)]}'
{
  "commit": "30002ed2e41830ec03ec3e577ad83ac6b188f96e",
  "tree": "13896f3038e391eb41246455239d7678cf51b011",
  "parents": [
    "652ea695364142b2464744746beac206d050ef19"
  ],
  "author": {
    "name": "Nick Piggin",
    "email": "npiggin@suse.de",
    "time": "Fri Jul 25 19:45:28 2008 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Sat Jul 26 12:00:06 2008 -0700"
  },
  "message": "mm: readahead scan lockless\n\nradix_tree_next_hole() is implemented as a series of radix_tree_lookup()s.\nSo it can be called locklessly, under rcu_read_lock().\n\nSigned-off-by: Nick Piggin \u003cnpiggin@suse.de\u003e\nCc: Benjamin Herrenschmidt \u003cbenh@kernel.crashing.org\u003e\nCc: Paul Mackerras \u003cpaulus@samba.org\u003e\nCc: Hugh Dickins \u003chugh@veritas.com\u003e\nCc: \"Paul E. McKenney\" \u003cpaulmck@us.ibm.com\u003e\nReviewed-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\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": "d8723a5f6496d05af23445e6ae862754e9d41214",
      "old_mode": 33188,
      "old_path": "mm/readahead.c",
      "new_id": "77e8ddf945e9a725d4b675923124f4eafd0924e2",
      "new_mode": 33188,
      "new_path": "mm/readahead.c"
    }
  ]
}