)]}'
{
  "commit": "2693310eccccf8351678ddd6f3b050163e51dba0",
  "tree": "22a345f37c5c2501977b3f115b3b8cd91aa7e219",
  "parents": [
    "baf07d60f5c5d5d0f0c9e844cde75691f1ceb3d1"
  ],
  "author": {
    "name": "Alberto Garcia",
    "email": "berto@igalia.com",
    "time": "Mon May 11 15:54:55 2015 +0300"
  },
  "committer": {
    "name": "Kevin Wolf",
    "email": "kwolf@redhat.com",
    "time": "Fri May 22 17:08:01 2015 +0200"
  },
  "message": "qcow2: use an LRU algorithm to replace entries from the L2 cache\n\nThe current algorithm to evict entries from the cache gives always\npreference to those in the lowest positions. As the size of the cache\nincreases, the chances of the later elements of being removed decrease\nexponentially.\n\nIn a scenario with random I/O and lots of cache misses, entries in\npositions 8 and higher are rarely (if ever) evicted. This can be seen\neven with the default cache size, but with larger caches the problem\nbecomes more obvious.\n\nUsing an LRU algorithm makes the chances of being removed from the\ncache independent from the position.\n\nSigned-off-by: Alberto Garcia \u003cberto@igalia.com\u003e\nReviewed-by: Max Reitz \u003cmreitz@redhat.com\u003e\nSigned-off-by: Kevin Wolf \u003ckwolf@redhat.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6e78c8ffbabc4dadf9c73fe5073e176338bf3678",
      "old_mode": 33188,
      "old_path": "block/qcow2-cache.c",
      "new_id": "3a318955e694d2e7600d7cf778cc85ae9943edd9",
      "new_mode": 33188,
      "new_path": "block/qcow2-cache.c"
    }
  ]
}