)]}'
{
  "commit": "d6269543ef24aa012aa228c27af3adb074f7b36b",
  "tree": "5e0c24ce1dd5ed3947ea00b7863782e24848b8d3",
  "parents": [
    "41f9dc5c871600f53c8912b2975971d2a11c1c25"
  ],
  "author": {
    "name": "Matt Mackall",
    "email": "mpm@selenic.com",
    "time": "Sat Jul 21 04:37:40 2007 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@woody.linux-foundation.org",
    "time": "Sat Jul 21 17:49:16 2007 -0700"
  },
  "message": "slob: reduce list scanning\n\nThe version of SLOB in -mm always scans its free list from the beginning,\nwhich results in small allocations and free segments clustering at the\nbeginning of the list over time.  This causes the average search to scan\nover a large stretch at the beginning on each allocation.\n\nBy starting each page search where the last one left off, we evenly\ndistribute the allocations and greatly shorten the average search.\n\nWithout this patch, kernel compiles on a 1.5G machine take a large amount\nof system time for list scanning.  With this patch, compiles are within a\nfew seconds of performance of a SLAB kernel with no notable change in\nsystem time.\n\nSigned-off-by: Matt Mackall \u003cmpm@selenic.com\u003e\nCc: Christoph Lameter \u003cclameter@sgi.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": "d50920ecc02bed44acc1dd3cdc2deed467b6b262",
      "old_mode": 33188,
      "old_path": "mm/slob.c",
      "new_id": "ec33fcdc852e2c72ecc95194ada98bf702d3a14a",
      "new_mode": 33188,
      "new_path": "mm/slob.c"
    }
  ]
}