)]}'
{
  "commit": "250196f19c6e7df12965d74a5073e10aba06c802",
  "tree": "53e93bcbfbf9355fe6d3f09e6045c3036959434c",
  "parents": [
    "256900b16b0264af9e165bceabbf74dcece4ea38"
  ],
  "author": {
    "name": "Kevin Wolf",
    "email": "kwolf@redhat.com",
    "time": "Fri Mar 02 14:10:54 2012 +0100"
  },
  "committer": {
    "name": "Kevin Wolf",
    "email": "kwolf@redhat.com",
    "time": "Mon Mar 12 15:14:07 2012 +0100"
  },
  "message": "qcow2: Reduce number of I/O requests\n\nIf the first part of a write request is allocated, but the second isn\u0027t\nand it can be allocated so that the resulting area is contiguous, handle\nit at once. This is a common case for sequential writes.\n\nAfter this patch, alloc_cluster_offset() only checks if the clusters are\nalready allocated or how many new clusters can be allocated contigouosly.\nThe actual cluster allocation is split off into a new function\ndo_alloc_cluster_offset().\n\nSigned-off-by: Kevin Wolf \u003ckwolf@redhat.com\u003e\nReviewed-by: Stefan Hajnoczi \u003cstefanha@linux.vnet.ibm.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "903454d2fcad97147d4dc73203fff52df8b6c74e",
      "old_mode": 33188,
      "old_path": "block/qcow2-cluster.c",
      "new_id": "e0fb90792f926a2a62dbfed4c14830abd57453b6",
      "new_mode": 33188,
      "new_path": "block/qcow2-cluster.c"
    },
    {
      "type": "modify",
      "old_id": "5129e3eab90616af81ca6f51620c30fbd529744c",
      "old_mode": 33188,
      "old_path": "block/qcow2.h",
      "new_id": "e4ac366cfcfbb3ac45b0edb26add23a91241a678",
      "new_mode": 33188,
      "new_path": "block/qcow2.h"
    },
    {
      "type": "modify",
      "old_id": "d818ff139539b084442f1eb90599592325c9d97a",
      "old_mode": 33188,
      "old_path": "trace-events",
      "new_id": "606d9034e975472274abb39d0e07562cdeab93cb",
      "new_mode": 33188,
      "new_path": "trace-events"
    }
  ]
}