)]}'
{
  "commit": "a6af2bc3d5ce8722b9d09c5bdd5383c91c419653",
  "tree": "d4af36e83f25d84979584b670b692068eb2b5a56",
  "parents": [
    "e10a4437cb37c85f2df95432025b392d98aac2aa"
  ],
  "author": {
    "name": "Mel Gorman",
    "email": "mel@csn.ul.ie",
    "time": "Sat Feb 10 01:42:57 2007 -0800"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@woody.linux-foundation.org",
    "time": "Sun Feb 11 10:51:17 2007 -0800"
  },
  "message": "[PATCH] Avoid excessive sorting of early_node_map[]\n\nfind_min_pfn_for_node() and find_min_pfn_with_active_regions() sort\nearly_node_map[] on every call.  This is an excessive amount of sorting and\nthat can be avoided.  This patch always searches the whole early_node_map[]\nin find_min_pfn_for_node() instead of returning the first value found.  The\nmap is then only sorted once when required.  Successfully boot tested on a\nnumber of machines.\n\n[akpm@osdl.org: cleanup]\nSigned-off-by: Mel Gorman \u003cmel@csn.ul.ie\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": "f12052dc23ff673d98ad183b750875c53f7d7f78",
      "old_mode": 33188,
      "old_path": "mm/page_alloc.c",
      "new_id": "f26fdc94393e1af05166af704252010518e5d950",
      "new_mode": 33188,
      "new_path": "mm/page_alloc.c"
    }
  ]
}