aboutsummaryrefslogtreecommitdiff
path: root/tests/qemu-iotests/039
diff options
context:
space:
mode:
authorKevin Wolf <kwolf@redhat.com>2013-03-27 11:43:49 +0100
committerStefan Hajnoczi <stefanha@redhat.com>2013-03-28 11:52:44 +0100
commitecdd5333ab9ed3f2b848066aaaef02c027b25e36 (patch)
tree40f544da54cd4aaaaf2d5c86f3f15766221de83c /tests/qemu-iotests/039
parent2c3b32d25620c26e26fd590c198ec6d9cf91da57 (diff)
qcow2: Gather clusters in a looping loop
Instead of just checking once in exactly this order if there are dependendies, non-COW clusters and new allocation, this starts looping around these. This way we can, for example, gather non-COW clusters after new allocations as long as the host cluster offsets stay contiguous. Once handle_dependencies() is extended so that COW areas of in-flight allocations can be overwritten, this allows to continue with gathering other clusters (we wouldn't be able to do that without this change because we would have missed a possible second dependency in one of the next clusters). This means that in the typical sequential write case, we can combine the COW overwrite of one cluster with the allocation of the next cluster as soon as something like Delayed COW gets actually implemented. It is only by avoiding splitting requests this way that Delayed COW actually starts improving performance noticably. Signed-off-by: Kevin Wolf <kwolf@redhat.com> Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com>
Diffstat (limited to 'tests/qemu-iotests/039')
0 files changed, 0 insertions, 0 deletions