)]}'
{
  "commit": "d9e7620e60bc6648c3dcabbc8d1a320b69c846f9",
  "tree": "450d0f92533184d85ac00ab1625460fe0be4cda7",
  "parents": [
    "1afba0451c83cbff622a08f2d86fbb2e680dfd5f"
  ],
  "author": {
    "name": "Jens Axboe",
    "email": "jens.axboe@oracle.com",
    "time": "Fri Apr 20 14:27:50 2007 +0200"
  },
  "committer": {
    "name": "Jens Axboe",
    "email": "axboe@nelson.home.kernel.dk",
    "time": "Mon Apr 30 09:01:21 2007 +0200"
  },
  "message": "cfq-iosched: rework the whole round-robin list concept\n\nDrawing on some inspiration from the CFS CPU scheduler design, overhaul\nthe pending cfq_queue concept list management. Currently CFQ uses a\ndoubly linked list per priority level for sorting and service uses.\nKill those lists and maintain an rbtree of cfq_queue\u0027s, sorted by when\nto service them.\n\nThis unfortunately means that the ionice levels aren\u0027t as strong\nanymore, will work on improving those later. We only scale the slice\ntime now, not the number of times we service. This means that latency\nis better (for all priority levels), but that the distinction between\nthe highest and lower levels aren\u0027t as big.\n\nThe diffstat speaks for itself.\n\n cfq-iosched.c |  363 +++++++++++++++++---------------------------------\n 1 file changed, 125 insertions(+), 238 deletions(-)\n\nSigned-off-by: Jens Axboe \u003cjens.axboe@oracle.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "9d6f04103f01ae965959bb8b791373ffb633b020",
      "old_mode": 33188,
      "old_path": "block/cfq-iosched.c",
      "new_id": "4838c2b16f2c4759fb0aa0f7375b2b0d1b07074e",
      "new_mode": 33188,
      "new_path": "block/cfq-iosched.c"
    }
  ]
}