)]}'
{
  "commit": "c0bc9875b701c588e448302d41181995c21e8040",
  "tree": "c320855d4c04bd51ded6b4888bc5895ab539165f",
  "parents": [
    "b55ed816235cf41c29159d22a4cdeec7deb5821c"
  ],
  "author": {
    "name": "Nick Piggin",
    "email": "npiggin@suse.de",
    "time": "Tue Oct 16 01:24:42 2007 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@woody.linux-foundation.org",
    "time": "Tue Oct 16 09:42:53 2007 -0700"
  },
  "message": "radix-tree: use indirect bit\n\nRather than sign direct radix-tree pointers with a special bit, sign the\nindirect one that hangs off the root.  This means that, given a lookup_slot\noperation, the invalid result will be differentiated from the valid\n(previously, valid results could have the bit either set or clear).\n\nThis does not affect slot lookups which occur under lock -- they can never\nreturn an invalid result.  Is needed in future for lockless pagecache.\n\nSigned-off-by: Nick Piggin \u003cnpiggin@suse.de\u003e\nAcked-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nCc: Hugh Dickins \u003chugh@veritas.com\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": "430e4a8c1382b52107450ea60bbeb7e1f254938d",
      "old_mode": 33188,
      "old_path": "include/linux/radix-tree.h",
      "new_id": "b6116b4445c760f01f0f133ad9530af71b6f09d0",
      "new_mode": 33188,
      "new_path": "include/linux/radix-tree.h"
    },
    {
      "type": "modify",
      "old_id": "7af368a4401b77647cb50093652782471dee7132",
      "old_mode": 33188,
      "old_path": "lib/radix-tree.c",
      "new_id": "0eee4020a7be750a6d601c039ab2bca2a6c71111",
      "new_mode": 33188,
      "new_path": "lib/radix-tree.c"
    }
  ]
}