diff options
| author | Kevin Wolf <kwolf@redhat.com> | 2013-03-27 11:43:49 +0100 |
|---|---|---|
| committer | Stefan Hajnoczi <stefanha@redhat.com> | 2013-03-28 11:52:44 +0100 |
| commit | ecdd5333ab9ed3f2b848066aaaef02c027b25e36 (patch) | |
| tree | 40f544da54cd4aaaaf2d5c86f3f15766221de83c /tests | |
| parent | 2c3b32d25620c26e26fd590c198ec6d9cf91da57 (diff) | |
| download | qemu-ecdd5333ab9ed3f2b848066aaaef02c027b25e36.tar.gz | |
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')
| -rw-r--r-- | tests/qemu-iotests/044.out | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/tests/qemu-iotests/044.out b/tests/qemu-iotests/044.out index 34c25c793e..5c5aa929fb 100644 --- a/tests/qemu-iotests/044.out +++ b/tests/qemu-iotests/044.out @@ -1,6 +1,6 @@ No errors were found on the image. 7292415/33554432 = 21.73% allocated, 0.00% fragmented, 0.00% compressed clusters -Image end offset: 4296447488 +Image end offset: 4296448000 . ---------------------------------------------------------------------- Ran 1 tests |