)]}'
{
  "commit": "6df8ba4f8a4c4abca9ccad10441d0dddbdff301c",
  "tree": "6ac5cd48d3400a9d32f8affd31106f7942df9547",
  "parents": [
    "f4e6b498d6e06742d72706ef50593a9c4dd72214"
  ],
  "author": {
    "name": "Fengguang Wu",
    "email": "wfg@mail.ustc.edu.cn",
    "time": "Tue Oct 16 01:24:33 2007 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@woody.linux-foundation.org",
    "time": "Tue Oct 16 09:42:52 2007 -0700"
  },
  "message": "radixtree: introduce radix_tree_next_hole()\n\nIntroduce radix_tree_next_hole(root, index, max_scan) to scan radix tree for\nthe first hole.  It will be used in interleaved readahead.\n\nThe implementation is dumb and obviously correct.  It can help debug(and\ndocument) the possible smart one in future.\n\nCc: Nick Piggin \u003cnickpiggin@yahoo.com.au\u003e\nSigned-off-by: Fengguang Wu \u003cwfg@mail.ustc.edu.cn\u003e\nCc: Rusty Russell \u003crusty@rustcorp.com.au\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "f9e77d2ee3201ea3565a409216c601734fc17140",
      "old_mode": 33188,
      "old_path": "include/linux/radix-tree.h",
      "new_id": "430e4a8c1382b52107450ea60bbeb7e1f254938d",
      "new_mode": 33188,
      "new_path": "include/linux/radix-tree.h"
    },
    {
      "type": "modify",
      "old_id": "514efb200be6775dd57633a71987a7dcfe2b9ee9",
      "old_mode": 33188,
      "old_path": "lib/radix-tree.c",
      "new_id": "7af368a4401b77647cb50093652782471dee7132",
      "new_mode": 33188,
      "new_path": "lib/radix-tree.c"
    }
  ]
}