)]}'
{
  "commit": "7aae6dd80e265aa9402ed507caaff4a5dba55069",
  "tree": "b6b2e4d4942fd199768f6df6b0694a886e8c4375",
  "parents": [
    "dc0afa8388972a9ed7c2203cc46d8df1a4713f65"
  ],
  "author": {
    "name": "Tejun Heo",
    "email": "htejun@gmail.com",
    "time": "Thu Jun 14 03:45:12 2007 +0900"
  },
  "committer": {
    "name": "Greg Kroah-Hartman",
    "email": "gregkh@suse.de",
    "time": "Wed Jul 11 16:09:02 2007 -0700"
  },
  "message": "idr: fix obscure bug in allocation path\n\nIn sub_alloc(), when bitmap search fails, it goes up one level to\ncontinue search.  This is done by updating the id cursor and searching\nthe upper level again.  If the cursor was at the end of the upper\nlevel, we need to go further than that.\n\nThis wasn\u0027t implemented and when that happens the part of the cursor\nwhich indexes into the upper level wraps and sub_alloc() ends up\nsearching the wrong bitmap.  It allocates id which doesn\u0027t match the\nactual slot.\n\nThis patch fixes this by restarting from the top if the search needs\nto go higher than one level.\n\nSigned-off-by: Tejun Heo \u003chtejun@gmail.com\u003e\nSigned-off-by: Greg Kroah-Hartman \u003cgregkh@suse.de\u003e\n\n\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "305117ca2d415a1adf91700fe34a06d88028de67",
      "old_mode": 33188,
      "old_path": "lib/idr.c",
      "new_id": "7b5a59caa9891d74ebbec9e29fef35cd2ba7e3b0",
      "new_mode": 33188,
      "new_path": "lib/idr.c"
    }
  ]
}