)]}'
{
  "commit": "11e33f6a55ed7847d9c8ffe185ef87faf7806abe",
  "tree": "ca70fe29e836c508cc279c619f7b856380a6f10f",
  "parents": [
    "7f82af9742a9346794ecc1515139daed480e7025"
  ],
  "author": {
    "name": "Mel Gorman",
    "email": "mel@csn.ul.ie",
    "time": "Tue Jun 16 15:31:57 2009 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Tue Jun 16 19:47:32 2009 -0700"
  },
  "message": "page allocator: break up the allocator entry point into fast and slow paths\n\nThe core of the page allocator is one giant function which allocates\nmemory on the stack and makes calculations that may not be needed for\nevery allocation.  This patch breaks up the allocator path into fast and\nslow paths for clarity.  Note the slow paths are still inlined but the\nentry is marked unlikely.  If they were not inlined, it actally increases\ntext size to generate the as there is only one call site.\n\nSigned-off-by: Mel Gorman \u003cmel@csn.ul.ie\u003e\nReviewed-by: Christoph Lameter \u003ccl@linux-foundation.org\u003e\nCc: KOSAKI Motohiro \u003ckosaki.motohiro@jp.fujitsu.com\u003e\nCc: Pekka Enberg \u003cpenberg@cs.helsinki.fi\u003e\nCc: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nCc: Nick Piggin \u003cnickpiggin@yahoo.com.au\u003e\nCc: Dave Hansen \u003cdave@linux.vnet.ibm.com\u003e\nCc: Lee Schermerhorn \u003cLee.Schermerhorn@hp.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": "6be8fcb6f74f8cfbed43e825fa4d9e006a4837d1",
      "old_mode": 33188,
      "old_path": "mm/page_alloc.c",
      "new_id": "512bf9a618c7ad884347fbad5ce81c6b289009c2",
      "new_mode": 33188,
      "new_path": "mm/page_alloc.c"
    }
  ]
}