)]}'
{
  "commit": "812e4082cae73e12fd425cace4fd3a715a7c1d32",
  "tree": "d7405b5a8c87135628ea2d72a7ba93786969f96f",
  "parents": [
    "fdfbca82a0874916007ca76323cd35f2af8a2ef3"
  ],
  "author": {
    "name": "Alberto Garcia",
    "email": "berto@igalia.com",
    "time": "Mon May 11 15:54:57 2015 +0300"
  },
  "committer": {
    "name": "Kevin Wolf",
    "email": "kwolf@redhat.com",
    "time": "Fri May 22 17:08:01 2015 +0200"
  },
  "message": "qcow2: use a hash to look for entries in the L2 cache\n\nThe current cache algorithm traverses the array starting always from\nthe beginning, so the average number of comparisons needed to perform\na lookup is proportional to the size of the array.\n\nBy using a hash of the offset as the starting point, lookups are\nfaster and independent from the array size.\n\nThe hash is computed using the cluster number of the table, multiplied\nby 4 to make it perform better when there are collisions.\n\nIn my tests, using a cache with 2048 entries, this reduces the average\nnumber of comparisons per lookup from 430 to 2.5.\n\nSigned-off-by: Alberto Garcia \u003cberto@igalia.com\u003e\nReviewed-by: Stefan Hajnoczi \u003cstefanha@redhat.com\u003e\nSigned-off-by: Kevin Wolf \u003ckwolf@redhat.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "2035cd8ab268ad4fbd97fc8e3e2e3e05be954aac",
      "old_mode": 33188,
      "old_path": "block/qcow2-cache.c",
      "new_id": "121e6e922761a8725a83c39348d3c2b01f2dc3dc",
      "new_mode": 33188,
      "new_path": "block/qcow2-cache.c"
    }
  ]
}