)]}'
{
  "commit": "cc09e2990fdd96d25fdbb9db6bc9b4c82d9e4a3c",
  "tree": "89c538c6182335592a981ded03fc120b616aef47",
  "parents": [
    "d9e7620e60bc6648c3dcabbc8d1a320b69c846f9"
  ],
  "author": {
    "name": "Jens Axboe",
    "email": "jens.axboe@oracle.com",
    "time": "Thu Apr 26 12:53:50 2007 +0200"
  },
  "committer": {
    "name": "Jens Axboe",
    "email": "axboe@nelson.home.kernel.dk",
    "time": "Mon Apr 30 09:01:21 2007 +0200"
  },
  "message": "[PATCH] cfq-iosched: speed up rbtree handling\n\nFor cases where the rbtree is mainly used for sorting and min retrieval,\na nice speedup of the rbtree code is to maintain a cache of the leftmost\nnode in the tree.\n\nAlso spotted in the CFS CPU scheduler code.\n\nImproved by Alan D. Brunelle \u003cAlan.Brunelle@hp.com\u003e by updating the\nleftmost hint in cfq_rb_first() if it isn\u0027t set, instead of only\nupdating it on insert.\n\nSigned-off-by: Jens Axboe \u003cjens.axboe@oracle.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4838c2b16f2c4759fb0aa0f7375b2b0d1b07074e",
      "old_mode": 33188,
      "old_path": "block/cfq-iosched.c",
      "new_id": "55c476baa692f4127e15c9c50562aa93699cbe0b",
      "new_mode": 33188,
      "new_path": "block/cfq-iosched.c"
    }
  ]
}