Skip to content

Commit

Permalink
dirty-bitmap: make it possible to restore bitmap after merge
Browse files Browse the repository at this point in the history
Add backup parameter to bdrv_merge_dirty_bitmap() to be used then with
bdrv_restore_dirty_bitmap() if it needed to restore the bitmap after
merge operation.

This is needed to implement bitmap merge transaction action in further
commit.

Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com>
Reviewed-by: John Snow <jsnow@redhat.com>
  • Loading branch information
Vladimir Sementsov-Ogievskiy authored and jnsnow committed Oct 29, 2018
1 parent 56bd662 commit fa000f2
Show file tree
Hide file tree
Showing 5 changed files with 40 additions and 17 deletions.
17 changes: 14 additions & 3 deletions block/dirty-bitmap.c
Expand Up @@ -314,7 +314,7 @@ BdrvDirtyBitmap *bdrv_reclaim_dirty_bitmap_locked(BlockDriverState *bs,
return NULL;
}

if (!hbitmap_merge(parent->bitmap, successor->bitmap)) {
if (!hbitmap_merge(parent->bitmap, successor->bitmap, parent->bitmap)) {
error_setg(errp, "Merging of parent and successor bitmap failed");
return NULL;
}
Expand Down Expand Up @@ -791,8 +791,10 @@ int64_t bdrv_dirty_bitmap_next_zero(BdrvDirtyBitmap *bitmap, uint64_t offset)
}

void bdrv_merge_dirty_bitmap(BdrvDirtyBitmap *dest, const BdrvDirtyBitmap *src,
Error **errp)
HBitmap **backup, Error **errp)
{
bool ret;

/* only bitmaps from one bds are supported */
assert(dest->mutex == src->mutex);

Expand All @@ -810,11 +812,20 @@ void bdrv_merge_dirty_bitmap(BdrvDirtyBitmap *dest, const BdrvDirtyBitmap *src,
goto out;
}

if (!hbitmap_merge(dest->bitmap, src->bitmap)) {
if (!hbitmap_can_merge(dest->bitmap, src->bitmap)) {
error_setg(errp, "Bitmaps are incompatible and can't be merged");
goto out;
}

if (backup) {
*backup = dest->bitmap;
dest->bitmap = hbitmap_alloc(dest->size, hbitmap_granularity(*backup));
ret = hbitmap_merge(*backup, src->bitmap, dest->bitmap);
} else {
ret = hbitmap_merge(dest->bitmap, src->bitmap, dest->bitmap);
}
assert(ret);

out:
qemu_mutex_unlock(dest->mutex);
}
2 changes: 1 addition & 1 deletion blockdev.c
Expand Up @@ -2968,7 +2968,7 @@ void qmp_x_block_dirty_bitmap_merge(const char *node, const char *dst_name,
return;
}

bdrv_merge_dirty_bitmap(dst, src, errp);
bdrv_merge_dirty_bitmap(dst, src, NULL, errp);
}

BlockDirtyBitmapSha256 *qmp_x_debug_block_dirty_bitmap_sha256(const char *node,
Expand Down
2 changes: 1 addition & 1 deletion include/block/dirty-bitmap.h
Expand Up @@ -71,7 +71,7 @@ void bdrv_dirty_bitmap_set_persistance(BdrvDirtyBitmap *bitmap,
bool persistent);
void bdrv_dirty_bitmap_set_qmp_locked(BdrvDirtyBitmap *bitmap, bool qmp_locked);
void bdrv_merge_dirty_bitmap(BdrvDirtyBitmap *dest, const BdrvDirtyBitmap *src,
Error **errp);
HBitmap **backup, Error **errp);

/* Functions that require manual locking. */
void bdrv_dirty_bitmap_lock(BdrvDirtyBitmap *bitmap);
Expand Down
25 changes: 16 additions & 9 deletions include/qemu/hbitmap.h
Expand Up @@ -73,16 +73,23 @@ void hbitmap_truncate(HBitmap *hb, uint64_t size);

/**
* hbitmap_merge:
* @a: The bitmap to store the result in.
* @b: The bitmap to merge into @a.
* @return true if the merge was successful,
* false if it was not attempted.
*
* Merge two bitmaps together.
* A := A (BITOR) B.
* B is left unmodified.
*
* Store result of merging @a and @b into @result.
* @result is allowed to be equal to @a or @b.
*
* Return true if the merge was successful,
* false if it was not attempted.
*/
bool hbitmap_merge(const HBitmap *a, const HBitmap *b, HBitmap *result);

/**
* hbitmap_can_merge:
*
* hbitmap_can_merge(a, b) && hbitmap_can_merge(a, result) is sufficient and
* necessary for hbitmap_merge will not fail.
*
*/
bool hbitmap_merge(HBitmap *a, const HBitmap *b);
bool hbitmap_can_merge(const HBitmap *a, const HBitmap *b);

/**
* hbitmap_empty:
Expand Down
11 changes: 8 additions & 3 deletions util/hbitmap.c
Expand Up @@ -723,6 +723,10 @@ void hbitmap_truncate(HBitmap *hb, uint64_t size)
}
}

bool hbitmap_can_merge(const HBitmap *a, const HBitmap *b)
{
return (a->size == b->size) && (a->granularity == b->granularity);
}

/**
* Given HBitmaps A and B, let A := A (BITOR) B.
Expand All @@ -731,14 +735,15 @@ void hbitmap_truncate(HBitmap *hb, uint64_t size)
* @return true if the merge was successful,
* false if it was not attempted.
*/
bool hbitmap_merge(HBitmap *a, const HBitmap *b)
bool hbitmap_merge(const HBitmap *a, const HBitmap *b, HBitmap *result)
{
int i;
uint64_t j;

if ((a->size != b->size) || (a->granularity != b->granularity)) {
if (!hbitmap_can_merge(a, b) || !hbitmap_can_merge(a, result)) {
return false;
}
assert(hbitmap_can_merge(b, result));

if (hbitmap_count(b) == 0) {
return true;
Expand All @@ -750,7 +755,7 @@ bool hbitmap_merge(HBitmap *a, const HBitmap *b)
*/
for (i = HBITMAP_LEVELS - 1; i >= 0; i--) {
for (j = 0; j < a->sizes[i]; j++) {
a->levels[i][j] |= b->levels[i][j];
result->levels[i][j] = a->levels[i][j] | b->levels[i][j];
}
}

Expand Down

0 comments on commit fa000f2

Please sign in to comment.