fix qcow2_can_store_new_dirty_bitmap
PATCH v2 1/2 qcow2-bitmaps: fix qcow2_can_store_new_dirty_bitmap
In reply to Vladimir Sementsov-Ogievskiyqcow2_can_store_new_dirty_bitmap works wrong, as it considers only bitmaps already stored in the qcow2 image and ignores persistent BdrvDirtyBitmap objects.
So, let's instead count persistent BdrvDirtyBitmaps. We load all qcow2 bitmaps on open, so there should not be any bitmap in the image for which we don't have BdrvDirtyBitmaps version. If it is - it's a kind of corruption, and no reason to check for corruptions here (open() and close() are better places for it).
--- block/qcow2-bitmap.c | 41 ++++++++++++++++++----------------------- 1 file changed, 18 insertions(+), 23 deletions(-)
block/qcow2-bitmap.c +18 -23
@@ -1671,8 +1671,14 @@ bool coroutine_fn qcow2_co_can_store_new_dirty_bitmap(BlockDriverState *bs, Error **errp) {BDRVQcow2State *s = bs->opaque; -bool found; -Qcow2BitmapList *bm_list; +BdrvDirtyBitmap *bitmap; +uint64_t bitmap_directory_size =0 ; +uint32_t nb_bitmaps =0 ; + +if (bdrv_find_dirty_bitmap (bs, name)) { +error_setg (errp,"Bitmap already exists: %s" , name); +return false; + }if (s->qcow_version <3 ) {/* Without autoclear_features, we would always have to assume
@@ -1688,38 +1694,27 @@ bool coroutine_fn qcow2_co_can_store_new_dirty_bitmap(BlockDriverState *bs, goto fail; } -if (s->nb_bitmaps ==0 ) { -return true; + FOR_EACH_DIRTY_BITMAP(bs, bitmap) { +if (bdrv_dirty_bitmap_get_persistence (bitmap)) { + nb_bitmaps++; + bitmap_directory_size += +calc_dir_entry_size (strlen (bdrv_dirty_bitmap_name (bitmap)),0 ); + } } + nb_bitmaps++; + bitmap_directory_size +=calc_dir_entry_size (strlen (name),0 ); -if (s->nb_bitmaps >=QCOW2_MAX_BITMAPS ) { +if (nb_bitmaps >QCOW2_MAX_BITMAPS ) {error_setg (errp,"Maximum number of persistent bitmaps is already reached" ); goto fail; } -if (s->bitmap_directory_size +calc_dir_entry_size (strlen (name),0 ) > -QCOW2_MAX_BITMAP_DIRECTORY_SIZE ) - { +if (bitmap_directory_size >QCOW2_MAX_BITMAP_DIRECTORY_SIZE ) {error_setg (errp,"Not enough space in the bitmap directory" ); goto fail; } -qemu_co_mutex_lock (&s->lock); - bm_list =bitmap_list_load (bs, s->bitmap_directory_offset, - s->bitmap_directory_size, errp); -qemu_co_mutex_unlock (&s->lock); -if (bm_list ==NULL ) { - goto fail; - } - - found =find_bitmap_by_name (bm_list, name); -bitmap_list_free (bm_list); -if (found) { -error_setg (errp,"Bitmap with the same name is already stored" ); - goto fail; - } -return true; fail:
Signature · 1 line
2.21.0
PATCH v2 2/2 iotests: add 269 to check maximum of bitmaps in qcow2
In reply to Vladimir Sementsov-OgievskiyCheck that it's impossible to create more persistent bitmaps than qcow2 supports.
--- tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 3 files changed, 51 insertions(+) create mode 100755 tests/qemu-iotests/269 create mode 100644 tests/qemu-iotests/269.out
tests/qemu-iotests/269 new file +47 -0
@@ -0,0 +1,47 @@ +#!/usr/bin/env python +# +# Test exceeding dirty bitmaps maximum amount in qcow2 image +# +# Copyright (c) 2019 Virtuozzo International GmbH. +# +# This program is free software; you can redistribute it and/or modify +# it under the terms of the GNU General Public License as published by +# the Free Software Foundation; either version 2 of the License, or +# (at your option) any later version. +# +# This program is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +# GNU General Public License for more details. +# +# You should have received a copy of the GNU General Public License +# along with this program. If not, see <http://www.gnu.org/licenses/>. +# + +import iotests +from iotests import qemu_img_create, file_path, log, filter_qmp_event + +iotests.verify_image_format(supported_fmts=['qcow2']) + +img = file_path('img') +size = 64 * 1024 + +qemu_img_create('-f', iotests.imgfmt, img, str(size)) +vm = iotests.VM().add_drive(img) +vm.launch() + +# Look at block/qcow2.h +QCOW2_MAX_BITMAPS = 65535 + +for i in range(QCOW2_MAX_BITMAPS): + result = vm.qmp('block-dirty-bitmap-add', node='drive0', + name='bitmap{}'.format(i), persistent=True) + assert result['return'] == {} + +log("{} persistent bitmap already created, " \ + "let's try to create one more".format(QCOW2_MAX_BITMAPS)) + +vm.qmp_log('block-dirty-bitmap-add', node='drive0', + name='bitmap{}'.format(QCOW2_MAX_BITMAPS), persistent=True) + +vm.shutdown()
tests/qemu-iotests/269.out new file +3 -0
@@ -0,0 +1,3 @@ +65535 persistent bitmap already created, let's try to create one more +{"execute": "block-dirty-bitmap-add", "arguments": {"name": "bitmap65535", "node": "drive0", "persistent": true}} +{"error": {"class": "GenericError", "desc": "Can't make bitmap 'bitmap65535' persistent in 'drive0': Maximum number of persistent bitmaps is already reached"}}
tests/qemu-iotests/group +1 -0
@@ -279,3 +279,4 @@ 265 rw auto quick 266 rw quick 267 rw auto quick snapshot +269
Signature · 1 line
2.21.0
v2 cover fix qcow2_can_store_new_dirty_bitmap
Hi all!
Here is a fix for persistent bitmaps managing: we must check existent but not yet stored bitmaps for qcow2-related constraints, like maximum number of bitmaps in qcow2 image.
v2:
01: change assertion to error-return at function start
Be free to add
if it's appropriate
02: new test
Ohh, it takes about 4 minutes. Be free to drop it, as I doubt that it worth to have. The case is simple, we may live without a test.
Vladimir Sementsov-Ogievskiy (2):
qcow2-bitmaps: fix qcow2_can_store_new_dirty_bitmap
iotests: add 269 to check maximum of bitmaps in qcow2
block/qcow2-bitmap.c | 41 +++++++++++++++------------------ tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 4 files changed, 69 insertions(+), 23 deletions(-) create mode 100755 tests/qemu-iotests/269 create mode 100644 tests/qemu-iotests/269.out
Signature · 1 line
2.21.0
Quoted 7 lines · Vladimir Sementsov-Ogievskiy
Hi all!
Here is a fix for persistent bitmaps managing: we must check existent but not yet stored bitmaps for qcow2-related constraints, like maximum number of bitmaps in qcow2 image.
v2:
main thing based on https://github.com/jnsnow/qemu bitmaps
Based-on: <[email protected]>
Quoted 23 lines
01: change assertion to error-return at function start
Be free to addReported-by aihua liang <[email protected]>if it's appropriate
02: new test
Ohh, it takes about 4 minutes. Be free to drop it, as I doubt that it worth to have. The case is simple, we may live without a test.Vladimir Sementsov-Ogievskiy (2):
qcow2-bitmaps: fixqcow2_can_store_new_dirty_bitmap
iotests: add 269 to check maximum of bitmaps in qcow2block/qcow2-bitmap.c | 41 +++++++++++++++------------------ tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 4 files changed, 69 insertions(+), 23 deletions(-)create mode 100755 tests/qemu-iotests/269
create mode 100644 tests/qemu-iotests/269.out
Signature · 2 lines
Best regards, Vladimir
Hi!
Don't we forget it?
Here is a bug-fix, I think we want it for 4.2.
Quoted 30 lines · Vladimir Sementsov-Ogievskiy
Hi all!
Here is a fix for persistent bitmaps managing: we must check existent but not yet stored bitmaps for qcow2-related constraints, like maximum number of bitmaps in qcow2 image.
v2:
01: change assertion to error-return at function start
Be free to addReported-by aihua liang <[email protected]>if it's appropriate
02: new test
Ohh, it takes about 4 minutes. Be free to drop it, as I doubt that it worth to have. The case is simple, we may live without a test.Vladimir Sementsov-Ogievskiy (2):
qcow2-bitmaps: fixqcow2_can_store_new_dirty_bitmap
iotests: add 269 to check maximum of bitmaps in qcow2block/qcow2-bitmap.c | 41 +++++++++++++++------------------ tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 4 files changed, 69 insertions(+), 23 deletions(-)create mode 100755 tests/qemu-iotests/269
create mode 100644 tests/qemu-iotests/269.out
Signature · 2 lines
Best regards, Vladimir
Re: [PATCH v2 1/2] qcow2-bitmaps: fix qcow2_can_store_new_dirty_bitmap
In reply to Vladimir Sementsov-OgievskiyQuoted 10 lines · Vladimir Sementsov-Ogievskiy
qcow2_can_store_new_dirty_bitmapworks wrong, as it considers only bitmaps already stored in the qcow2 image and ignores persistent BdrvDirtyBitmap objects.So, let's instead count persistent BdrvDirtyBitmaps. We load all qcow2 bitmaps on open, so there should not be any bitmap in the image for which we don't have BdrvDirtyBitmaps version. If it is - it's a kind of corruption, and no reason to check for corruptions here (
open()andclose()are better places for it).
Quoted 4 lines
Signed-off-by Vladimir Sementsov-Ogievskiy <[email protected]>--- block/qcow2-bitmap.c | 41 ++++++++++++++++++----------------------- 1 file changed, 18 insertions(+), 23 deletions(-)
Am I right in interpreting qcow2_load_dirty_bitmaps() in such a way that every persistent dirty bitmap will cause a runtime dirty bitmap to be created?
If so:
Re: [PATCH v2 1/2] qcow2-bitmaps: fix qcow2_can_store_new_dirty_bitmap
Quoted 11 lines · Max Reitz
Quoted 10 lines · Vladimir Sementsov-Ogievskiy
qcow2_can_store_new_dirty_bitmapworks wrong, as it considers only bitmaps already stored in the qcow2 image and ignores persistent BdrvDirtyBitmap objects.So, let's instead count persistent BdrvDirtyBitmaps. We load all qcow2 bitmaps on open, so there should not be any bitmap in the image for which we don't have BdrvDirtyBitmaps version. If it is - it's a kind of corruption, and no reason to check for corruptions here (
open()andclose()are better places for it).
Quoted 8 lines
Quoted 4 lines
Signed-off-by Vladimir Sementsov-Ogievskiy <[email protected]>--- block/qcow2-bitmap.c | 41 ++++++++++++++++++----------------------- 1 file changed, 18 insertions(+), 23 deletions(-)Am I right in interpreting
qcow2_load_dirty_bitmaps()in such a way that every persistent dirty bitmap will cause a runtime dirty bitmap to be created?
Yes, we load all the bitmaps.
Every bitmap stored in qcow2 image is loaded and corresponding BdrvDirtyBitmap is created. If bitmap has IN_USE flag in the image, created BdrvDirtyBitmap is marked inconsistent, but it is still there. If bitmap doesn't have AUTO flag, it becomes disabled bitmap.
Quoted 5 lines
If so:
Reviewed-by Max Reitz <[email protected]>
Signature · 2 lines
Best regards, Vladimir
Re: [PATCH v2 2/2] iotests: add 269 to check maximum of bitmaps in qcow2
In reply to Vladimir Sementsov-OgievskiyQuoted 11 lines · Vladimir Sementsov-Ogievskiy
Check that it's impossible to create more persistent bitmaps than qcow2 supports.
Signed-off-by Vladimir Sementsov-Ogievskiy <[email protected]>--- tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 3 files changed, 51 insertions(+) create mode 100755 tests/qemu-iotests/269 create mode 100644 tests/qemu-iotests/269.out
Is there no way to make this test any faster, e.g. by creating like 65534 bitmaps with dd and a binary blob? (Similarly to what I do in “iotests: Test qcow2's snapshot table handling”)
This is such an edge case, but running the test took 3:46 min before patch 1 (which I already find much too long), and 8:13 min afterwards (on my machine).
(To be honest, if we take this test as-is, I’m probably just never going to run it.)
Max
Re: [PATCH v2 2/2] iotests: add 269 to check maximum of bitmaps in qcow2
Quoted 13 lines · Max Reitz
Quoted 11 lines · Vladimir Sementsov-Ogievskiy
Check that it's impossible to create more persistent bitmaps than qcow2 supports.
Signed-off-by Vladimir Sementsov-Ogievskiy <[email protected]>--- tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 + 3 files changed, 51 insertions(+)create mode 100755 tests/qemu-iotests/269
create mode 100644 tests/qemu-iotests/269.out
Quoted 3 lines
Is there no way to make this test any faster, e.g. by creating like 65534 bitmaps with dd and a binary blob? (Similarly to what I do in “iotests: Test qcow2's snapshot table handling”)
Seems, that's not simple.. Each bitmap should have personal name and bitmap table..
Let's merge only patch 01 and forget about this one.
Quoted 10 lines
This is such an edge case, but running the test took 3:46 min before patch 1 (which I already find much too long), and 8:13 min afterwards (on my machine).
(To be honest, if we take this test as-is, I’m probably just never going to run it.)
Max
Signature · 2 lines
Best regards, Vladimir
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636
(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
Quoted 39 lines · Vladimir Sementsov-Ogievskiy
Hi!
Don't we forget it?
Here is a bug-fix, I think we want it for 4.2.
Quoted 30 lines · Vladimir Sementsov-Ogievskiy
Hi all!
Here is a fix for persistent bitmaps managing: we must check existent but not yet stored bitmaps for qcow2-related constraints, like maximum number of bitmaps in qcow2 image.
v2:
01: change assertion to error-return at function start Be free to add
Reported-by aihua liang <[email protected]>if it's appropriate
02: new test
Ohh, it takes about 4 minutes. Be free to drop it, as I doubt that it worth to have. The case is simple, we may live without a test.Vladimir Sementsov-Ogievskiy (2):
qcow2-bitmaps: fixqcow2_can_store_new_dirty_bitmap
iotests: add 269 to check maximum of bitmaps in qcow2block/qcow2-bitmap.c | 41 +++++++++++++++------------------ tests/qemu-iotests/269 | 47 ++++++++++++++++++++++++++++++++++++++ tests/qemu-iotests/269.out | 3 +++ tests/qemu-iotests/group | 1 +
4 files changed, 69 insertions(+), 23 deletions(-)create mode 100755 tests/qemu-iotests/269
create mode 100644 tests/qemu-iotests/269.out
Signature · 2 lines
Best regards, Vladimir
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 6 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
Max
Max Reitz
AppliedRe: [PATCH v2 1/2] qcow2-bitmaps: fix qcow2_can_store_new_dirty_bitmap
In reply to Vladimir Sementsov-OgievskiyQuoted 10 lines · Vladimir Sementsov-Ogievskiy
qcow2_can_store_new_dirty_bitmapworks wrong, as it considers only bitmaps already stored in the qcow2 image and ignores persistent BdrvDirtyBitmap objects.So, let's instead count persistent BdrvDirtyBitmaps. We load all qcow2 bitmaps on open, so there should not be any bitmap in the image for which we don't have BdrvDirtyBitmaps version. If it is - it's a kind of corruption, and no reason to check for corruptions here (
open()andclose()are better places for it).
Quoted 4 lines
Signed-off-by Vladimir Sementsov-Ogievskiy <[email protected]>--- block/qcow2-bitmap.c | 41 ++++++++++++++++++----------------------- 1 file changed, 18 insertions(+), 23 deletions(-)
Thanks, applied to my block-next branch:
https://git.xanclic.moe/XanClic/qemu/commits/branch/block-next
Max
Quoted 15 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 3 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636
Quoted 6 lines
Quoted 3 lines
(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Max
Quoted 20 lines · Max Reitz
Quoted 19 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 6 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
Quoted 7 lines
Quoted 2 lines
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Can we fix that to use a hash table for amortized O(1) lookup rather than the current O(n) lookup?
But such a fix is 5.0 material.
Signature · 3 lines
Eric Blake, Principal Software Engineer Red Hat, Inc. +1-919-301-3226 Virtualization: qemu.org | libvirt.org
Quoted 25 lines · Eric Blake
Quoted 24 lines · Max Reitz
Quoted 22 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 7 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
Quoted 7 lines
Quoted 4 lines
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Can we fix that to use a hash table for amortized O(1) lookup rather than the current O(n) lookup?
Not unreasonable, considering that this is probably what we would’ve done from the start in any language where hash tables are built in.
But OTOH when you have 66k bitmaps, you probably have other problems. Like, writes being incredibly slow, because all those bitmaps have to be updated.
(Well, you can technically have 99 % of them disabled, but who’d do such a thing?)
((Maybe I’ll look into it.))
Max
Quoted 37 lines · Max Reitz
Quoted 25 lines · Eric Blake
Quoted 24 lines · Max Reitz
Quoted 22 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 7 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
Quoted 7 lines
Quoted 4 lines
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Can we fix that to use a hash table for amortized O(1) lookup rather than the current O(n) lookup?
Not unreasonable, considering that this is probably what we would’ve done from the start in any language where hash tables are built in.
Quoted 8 lines
But OTOH when you have 66k bitmaps, you probably have other problems. Like, writes being incredibly slow, because all those bitmaps have to be updated.
(Well, you can technically have 99 % of them disabled, but who’d do such a thing?)
((Maybe I’ll look into it.))
Hmm, now I did. This gets the test down to 24 s. Still not sure whether it’s worth it, though...
Max
Quoted 45 lines · Max Reitz
Quoted 44 lines · Max Reitz
Quoted 25 lines · Eric Blake
Quoted 24 lines · Max Reitz
Quoted 22 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 7 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
Quoted 7 lines
Quoted 4 lines
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Can we fix that to use a hash table for amortized O(1) lookup rather than the current O(n) lookup?
Not unreasonable, considering that this is probably what we would’ve done from the start in any language where hash tables are built in.
But OTOH when you have 66k bitmaps, you probably have other problems. Like, writes being incredibly slow, because all those bitmaps have to be updated.
(Well, you can technically have 99 % of them disabled, but who’d do such a thing?)
Quoted 7 lines
Quoted 1 line
((Maybe I’ll look into it.))
Hmm, now I did. This gets the test down to 24 s. Still not sure whether it’s worth it, though...
Max
I agree we very likely have other problems once we reach resource usage of this level.
Still, if we want to make this blazing fast for the love of doing so:
(1) Read in the directory *once*, and cache it. We have avoided doing this largely to feel more confident that the code is correct and is never working on an "outdated" version of the directory.
[On cache invalidation, we can write the directory back out to the bitmap, and delete our cache. The next time we need the list, we can reload it. This should alleviate consistency concerns.]
(2) Store the entries in an rbtree! 65536 entries is only ~16 lookups maximum in the worst case. I took a look at the linux rbtree implementation and did a very quick back-of-the-envelope benchmarking for inserting strings (len=32) into a tree:
name generation 53151 usec
insert [0-10] 5 usec
insert [10-100] 14 usec
insert [100-1000] 195 usec
insert [1000-10000] 2919 usec
insert [10000-65536] 41485 usec
This seems fast enough that we're likely going to be eclipsed just by other string handling concerns.
--js
Quoted 62 lines · John Snow
Quoted 45 lines · Max Reitz
Quoted 44 lines · Max Reitz
Quoted 25 lines · Eric Blake
Quoted 24 lines · Max Reitz
Quoted 22 lines · Max Reitz
Quoted 5 lines · Vladimir Sementsov-Ogievskiy
Hi again!
Still forgotten bug-fix :(
Is it too late for 4.2?
Sorry. :-/
Yes, I think I just forgot it. I don’t think it’s too important for 4.2, so, well, it isn’t too bad, but... Sorry.
Quoted 7 lines
I can't imagine better test, and it tests exactly what written in
https://bugzilla.redhat.com/show_bug.cgi?id=1712636(Hmm, actually, I doubt that it is real use-case, more probably it's a bug in management layer)
So, take this with test or without test, to 4.2 or 5.0.
I was thinking of seeing whether I could write a quicker test, but of course we should take the patch either way.
Quoted 7 lines
Quoted 4 lines
OK, I give up. It’s very much possible to create an image with 65535 bitmaps very quickly (like, under a second) outside of qemu, but just opening it takes 2:30 min (because of the quadratic complexity of checking whether a bitmap of the same name already exists).
Can we fix that to use a hash table for amortized O(1) lookup rather than the current O(n) lookup?
Not unreasonable, considering that this is probably what we would’ve done from the start in any language where hash tables are built in.
But OTOH when you have 66k bitmaps, you probably have other problems. Like, writes being incredibly slow, because all those bitmaps have to be updated.
(Well, you can technically have 99 % of them disabled, but who’d do such a thing?)
Quoted 7 lines
Quoted 1 line
((Maybe I’ll look into it.))
Hmm, now I did. This gets the test down to 24 s. Still not sure whether it’s worth it, though...
Max
I agree we very likely have other problems once we reach resource usage of this level.
Still, if we want to make this blazing fast for the love of doing so:
Quoted 7 lines
(1) Read in the directory *once*, and cache it. We have avoided doing this largely to feel more confident that the code is correct and is never working on an "outdated" version of the directory.
[On cache invalidation, we can write the directory back out to the bitmap, and delete our cache. The next time we need the list, we can reload it. This should alleviate consistency concerns.]
Note, that in this case, if we want to modify cached directory, bitmaps compatible bit must be cleared (so, if we fail to flush directory at some moment, we just lose bitmaps, not the consistency)
Note2, interesting, could existing qcow2 metadata caching infrastructure be reused?
Quoted 14 lines
(2) Store the entries in an rbtree! 65536 entries is only ~16 lookups maximum in the worst case. I took a look at the linux rbtree implementation and did a very quick back-of-the-envelope benchmarking for inserting strings (len=32) into a tree:
name generation 53151 usec
insert [0-10] 5 usec
insert [10-100] 14 usec
insert [100-1000] 195 usec
insert [1000-10000] 2919 usec
insert [10000-65536] 41485 usec
Quoted 3 lines
This seems fast enough that we're likely going to be eclipsed just by other string handling concerns.
Is rbtree the best thing to use? May be, better to construct prefix tree? Still, I think g_hash_table should be enough and most simple to use..
Still, I really doubt that it worth it, as we never have too many bitmaps..
Actually there is no reason to have more than one active bitmap. So, we may have a lot of disabled bitmaps, marking some history of the drive.
I think, in this case, the better optimization would be to teach Qemu not to load disabled bitmap data, only headers. And then, load them on demand (for example, when user wants to enable it or use somehow).
And, if we have a lot of active bitmaps (for example to cover time regions [t0, t_current], [t1, t_current], [t2, t_current] ..., the optimization is to use instead disabled bitmaps, and merge them when we need:
[t0, t1], [t1, t2], [t2, t_current]
Signature · 2 lines
Best regards, Vladimir