]> git.proxmox.com Git - mirror_qemu.git/blame - block/dirty-bitmap.c
Merge tag 'win32-pull-request' of https://gitlab.com/marcandre.lureau/qemu into staging
[mirror_qemu.git] / block / dirty-bitmap.c
CommitLineData
ebab2259
FZ
1/*
2 * Block Dirty Bitmap
3 *
1b6cc579 4 * Copyright (c) 2016-2017 Red Hat. Inc
ebab2259
FZ
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
22 * THE SOFTWARE.
23 */
24#include "qemu/osdep.h"
da34e65c 25#include "qapi/error.h"
ebab2259
FZ
26#include "trace.h"
27#include "block/block_int.h"
28#include "block/blockjob.h"
d2c3080e 29#include "qemu/main-loop.h"
ebab2259 30
ebab2259 31struct BdrvDirtyBitmap {
5deb6cbd 32 BlockDriverState *bs;
ca759622 33 HBitmap *bitmap; /* Dirty bitmap implementation */
27a1b301 34 bool busy; /* Bitmap is busy, it can't be used via QMP */
21d2376f 35 BdrvDirtyBitmap *successor; /* Anonymous child, if any. */
ebab2259 36 char *name; /* Optional non-empty unique ID */
993e6525 37 int64_t size; /* Size of the bitmap, in bytes */
8bfc932e
VSO
38 bool disabled; /* Bitmap is disabled. It ignores all writes to
39 the device */
dc162c8e 40 int active_iterators; /* How many iterators are active */
d6883bc9
VSO
41 bool readonly; /* Bitmap is read-only. This field also
42 prevents the respective image from being
43 modified (i.e. blocks writes and discards).
44 Such operations must fail and both the image
45 and this bitmap must remain unchanged while
46 this flag is set. */
a88b179f 47 bool persistent; /* bitmap must be saved to owner disk image */
b0f45559
JS
48 bool inconsistent; /* bitmap is persistent, but inconsistent.
49 It cannot be used at all in any way, except
50 a QMP user can remove it. */
c4e4b0fa
JS
51 bool skip_store; /* We are either migrating or deleting this
52 * bitmap; it should not be stored on the next
53 * inactivation. */
ebab2259
FZ
54 QLIST_ENTRY(BdrvDirtyBitmap) list;
55};
56
dc162c8e
FZ
57struct BdrvDirtyBitmapIter {
58 HBitmapIter hbi;
59 BdrvDirtyBitmap *bitmap;
60};
61
2119882c
PB
62static inline void bdrv_dirty_bitmaps_lock(BlockDriverState *bs)
63{
64 qemu_mutex_lock(&bs->dirty_bitmap_mutex);
65}
66
67static inline void bdrv_dirty_bitmaps_unlock(BlockDriverState *bs)
68{
69 qemu_mutex_unlock(&bs->dirty_bitmap_mutex);
70}
71
b64bd51e
PB
72void bdrv_dirty_bitmap_lock(BdrvDirtyBitmap *bitmap)
73{
1e638301 74 bdrv_dirty_bitmaps_lock(bitmap->bs);
b64bd51e
PB
75}
76
77void bdrv_dirty_bitmap_unlock(BdrvDirtyBitmap *bitmap)
78{
1e638301 79 bdrv_dirty_bitmaps_unlock(bitmap->bs);
b64bd51e
PB
80}
81
2119882c 82/* Called with BQL or dirty_bitmap lock taken. */
ebab2259
FZ
83BdrvDirtyBitmap *bdrv_find_dirty_bitmap(BlockDriverState *bs, const char *name)
84{
85 BdrvDirtyBitmap *bm;
86
87 assert(name);
88 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
89 if (bm->name && !strcmp(name, bm->name)) {
90 return bm;
91 }
92 }
93 return NULL;
94}
95
2119882c 96/* Called with BQL taken. */
ebab2259
FZ
97BdrvDirtyBitmap *bdrv_create_dirty_bitmap(BlockDriverState *bs,
98 uint32_t granularity,
99 const char *name,
100 Error **errp)
101{
102 int64_t bitmap_size;
103 BdrvDirtyBitmap *bitmap;
ebab2259 104
993e6525 105 assert(is_power_of_2(granularity) && granularity >= BDRV_SECTOR_SIZE);
ebab2259 106
cf7c49cf
EB
107 if (name) {
108 if (bdrv_find_dirty_bitmap(bs, name)) {
109 error_setg(errp, "Bitmap already exists: %s", name);
110 return NULL;
111 }
112 if (strlen(name) > BDRV_BITMAP_MAX_NAME_SIZE) {
113 error_setg(errp, "Bitmap name too long: %s", name);
114 return NULL;
115 }
ebab2259 116 }
993e6525 117 bitmap_size = bdrv_getlength(bs);
ebab2259
FZ
118 if (bitmap_size < 0) {
119 error_setg_errno(errp, -bitmap_size, "could not get length of device");
120 errno = -bitmap_size;
121 return NULL;
122 }
123 bitmap = g_new0(BdrvDirtyBitmap, 1);
5deb6cbd 124 bitmap->bs = bs;
ca759622 125 bitmap->bitmap = hbitmap_alloc(bitmap_size, ctz32(granularity));
ebab2259
FZ
126 bitmap->size = bitmap_size;
127 bitmap->name = g_strdup(name);
128 bitmap->disabled = false;
2119882c 129 bdrv_dirty_bitmaps_lock(bs);
ebab2259 130 QLIST_INSERT_HEAD(&bs->dirty_bitmaps, bitmap, list);
2119882c 131 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
132 return bitmap;
133}
134
15891fac
FZ
135int64_t bdrv_dirty_bitmap_size(const BdrvDirtyBitmap *bitmap)
136{
993e6525 137 return bitmap->size;
15891fac
FZ
138}
139
140const char *bdrv_dirty_bitmap_name(const BdrvDirtyBitmap *bitmap)
141{
142 return bitmap->name;
143}
144
2119882c 145/* Called with BQL taken. */
50a47257 146bool bdrv_dirty_bitmap_has_successor(BdrvDirtyBitmap *bitmap)
ebab2259
FZ
147{
148 return bitmap->successor;
149}
150
3ae96d66 151static bool bdrv_dirty_bitmap_busy(const BdrvDirtyBitmap *bitmap)
27a1b301
JS
152{
153 return bitmap->busy;
993edc0c
JS
154}
155
27a1b301 156void bdrv_dirty_bitmap_set_busy(BdrvDirtyBitmap *bitmap, bool busy)
4f43e953 157{
1e638301 158 bdrv_dirty_bitmaps_lock(bitmap->bs);
27a1b301 159 bitmap->busy = busy;
1e638301 160 bdrv_dirty_bitmaps_unlock(bitmap->bs);
4f43e953
VSO
161}
162
2119882c 163/* Called with BQL taken. */
ebab2259
FZ
164bool bdrv_dirty_bitmap_enabled(BdrvDirtyBitmap *bitmap)
165{
8b2e20f6 166 return !bitmap->disabled;
ebab2259
FZ
167}
168
4db6ceb0
JS
169/* Called with BQL taken. */
170static bool bdrv_dirty_bitmap_recording(BdrvDirtyBitmap *bitmap)
171{
172 return !bitmap->disabled || (bitmap->successor &&
173 !bitmap->successor->disabled);
174}
175
3ae96d66
JS
176int bdrv_dirty_bitmap_check(const BdrvDirtyBitmap *bitmap, uint32_t flags,
177 Error **errp)
178{
179 if ((flags & BDRV_BITMAP_BUSY) && bdrv_dirty_bitmap_busy(bitmap)) {
180 error_setg(errp, "Bitmap '%s' is currently in use by another"
181 " operation and cannot be used", bitmap->name);
182 return -1;
183 }
184
185 if ((flags & BDRV_BITMAP_RO) && bdrv_dirty_bitmap_readonly(bitmap)) {
186 error_setg(errp, "Bitmap '%s' is readonly and cannot be modified",
187 bitmap->name);
188 return -1;
189 }
190
191 if ((flags & BDRV_BITMAP_INCONSISTENT) &&
192 bdrv_dirty_bitmap_inconsistent(bitmap)) {
193 error_setg(errp, "Bitmap '%s' is inconsistent and cannot be used",
194 bitmap->name);
195 error_append_hint(errp, "Try block-dirty-bitmap-remove to delete"
94075c28 196 " this bitmap from disk\n");
3ae96d66
JS
197 return -1;
198 }
199
200 return 0;
201}
202
ebab2259
FZ
203/**
204 * Create a successor bitmap destined to replace this bitmap after an operation.
27a1b301 205 * Requires that the bitmap is not marked busy and has no successor.
8b2e20f6 206 * The successor will be enabled if the parent bitmap was.
2119882c 207 * Called with BQL taken.
ebab2259 208 */
5deb6cbd 209int bdrv_dirty_bitmap_create_successor(BdrvDirtyBitmap *bitmap, Error **errp)
ebab2259
FZ
210{
211 uint64_t granularity;
212 BdrvDirtyBitmap *child;
213
3ae96d66 214 if (bdrv_dirty_bitmap_check(bitmap, BDRV_BITMAP_BUSY, errp)) {
50a47257
JS
215 return -1;
216 }
217 if (bdrv_dirty_bitmap_has_successor(bitmap)) {
218 error_setg(errp, "Cannot create a successor for a bitmap that already "
219 "has one");
ebab2259
FZ
220 return -1;
221 }
ebab2259
FZ
222
223 /* Create an anonymous successor */
224 granularity = bdrv_dirty_bitmap_granularity(bitmap);
5deb6cbd 225 child = bdrv_create_dirty_bitmap(bitmap->bs, granularity, NULL, errp);
ebab2259
FZ
226 if (!child) {
227 return -1;
228 }
229
230 /* Successor will be on or off based on our current state. */
231 child->disabled = bitmap->disabled;
8b2e20f6 232 bitmap->disabled = true;
ebab2259 233
27a1b301 234 /* Install the successor and mark the parent as busy */
ebab2259 235 bitmap->successor = child;
27a1b301 236 bitmap->busy = true;
ebab2259
FZ
237 return 0;
238}
239
92bcea40
VSO
240void bdrv_enable_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap)
241{
92bcea40
VSO
242 bitmap->disabled = false;
243}
244
e73a265e
VSO
245/* Called with BQL taken. */
246void bdrv_dirty_bitmap_enable_successor(BdrvDirtyBitmap *bitmap)
247{
1e638301
VSO
248 assert(bitmap->bs == bitmap->successor->bs);
249 bdrv_dirty_bitmaps_lock(bitmap->bs);
58f72b96 250 bdrv_enable_dirty_bitmap_locked(bitmap->successor);
1e638301 251 bdrv_dirty_bitmaps_unlock(bitmap->bs);
e73a265e
VSO
252}
253
b133c27f
PB
254/* Called within bdrv_dirty_bitmap_lock..unlock and with BQL taken. */
255static void bdrv_release_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap)
604ab74b 256{
b133c27f 257 assert(!bitmap->active_iterators);
27a1b301 258 assert(!bdrv_dirty_bitmap_busy(bitmap));
50a47257 259 assert(!bdrv_dirty_bitmap_has_successor(bitmap));
b133c27f
PB
260 QLIST_REMOVE(bitmap, list);
261 hbitmap_free(bitmap->bitmap);
262 g_free(bitmap->name);
263 g_free(bitmap);
604ab74b
VSO
264}
265
ebab2259
FZ
266/**
267 * For a bitmap with a successor, yield our name to the successor,
268 * delete the old bitmap, and return a handle to the new bitmap.
2119882c 269 * Called with BQL taken.
ebab2259 270 */
5deb6cbd 271BdrvDirtyBitmap *bdrv_dirty_bitmap_abdicate(BdrvDirtyBitmap *bitmap,
ebab2259
FZ
272 Error **errp)
273{
274 char *name;
275 BdrvDirtyBitmap *successor = bitmap->successor;
276
277 if (successor == NULL) {
278 error_setg(errp, "Cannot relinquish control if "
279 "there's no successor present");
280 return NULL;
281 }
282
283 name = bitmap->name;
284 bitmap->name = NULL;
285 successor->name = name;
286 bitmap->successor = NULL;
a88b179f
VSO
287 successor->persistent = bitmap->persistent;
288 bitmap->persistent = false;
27a1b301 289 bitmap->busy = false;
5deb6cbd 290 bdrv_release_dirty_bitmap(bitmap);
ebab2259
FZ
291
292 return successor;
293}
294
295/**
296 * In cases of failure where we can no longer safely delete the parent,
297 * we may wish to re-join the parent and child/successor.
27a1b301 298 * The merged parent will be marked as not busy.
8b2e20f6 299 * The marged parent will be enabled if and only if the successor was enabled.
044ee8e1 300 * Called within bdrv_dirty_bitmap_lock..unlock and with BQL taken.
ebab2259 301 */
5deb6cbd 302BdrvDirtyBitmap *bdrv_reclaim_dirty_bitmap_locked(BdrvDirtyBitmap *parent,
044ee8e1 303 Error **errp)
ebab2259 304{
044ee8e1 305 BdrvDirtyBitmap *successor = parent->successor;
ebab2259
FZ
306
307 if (!successor) {
308 error_setg(errp, "Cannot reclaim a successor when none is present");
309 return NULL;
310 }
311
618af89e 312 hbitmap_merge(parent->bitmap, successor->bitmap, parent->bitmap);
8b2e20f6
JS
313
314 parent->disabled = successor->disabled;
27a1b301 315 parent->busy = false;
b133c27f 316 bdrv_release_dirty_bitmap_locked(successor);
ebab2259
FZ
317 parent->successor = NULL;
318
044ee8e1
VSO
319 return parent;
320}
321
322/* Called with BQL taken. */
5deb6cbd 323BdrvDirtyBitmap *bdrv_reclaim_dirty_bitmap(BdrvDirtyBitmap *parent,
044ee8e1
VSO
324 Error **errp)
325{
326 BdrvDirtyBitmap *ret;
327
1e638301 328 bdrv_dirty_bitmaps_lock(parent->bs);
5deb6cbd 329 ret = bdrv_reclaim_dirty_bitmap_locked(parent, errp);
1e638301 330 bdrv_dirty_bitmaps_unlock(parent->bs);
604ab74b 331
044ee8e1 332 return ret;
ebab2259
FZ
333}
334
335/**
336 * Truncates _all_ bitmaps attached to a BDS.
2119882c 337 * Called with BQL taken.
ebab2259 338 */
1b6cc579 339void bdrv_dirty_bitmap_truncate(BlockDriverState *bs, int64_t bytes)
ebab2259
FZ
340{
341 BdrvDirtyBitmap *bitmap;
ebab2259 342
2119882c 343 bdrv_dirty_bitmaps_lock(bs);
ebab2259 344 QLIST_FOREACH(bitmap, &bs->dirty_bitmaps, list) {
27a1b301 345 assert(!bdrv_dirty_bitmap_busy(bitmap));
50a47257 346 assert(!bdrv_dirty_bitmap_has_successor(bitmap));
dc162c8e 347 assert(!bitmap->active_iterators);
ca759622 348 hbitmap_truncate(bitmap->bitmap, bytes);
993e6525 349 bitmap->size = bytes;
ebab2259 350 }
2119882c 351 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
352}
353
2119882c 354/* Called with BQL taken. */
5deb6cbd 355void bdrv_release_dirty_bitmap(BdrvDirtyBitmap *bitmap)
ebab2259 356{
5deb6cbd
VSO
357 BlockDriverState *bs = bitmap->bs;
358
b133c27f
PB
359 bdrv_dirty_bitmaps_lock(bs);
360 bdrv_release_dirty_bitmap_locked(bitmap);
361 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
362}
363
364/**
365 * Release all named dirty bitmaps attached to a BDS (for use in bdrv_close()).
27a1b301 366 * There must not be any busy bitmaps attached.
56f364e6 367 * This function does not remove persistent bitmaps from the storage.
2119882c 368 * Called with BQL taken.
ebab2259
FZ
369 */
370void bdrv_release_named_dirty_bitmaps(BlockDriverState *bs)
371{
b133c27f
PB
372 BdrvDirtyBitmap *bm, *next;
373
374 bdrv_dirty_bitmaps_lock(bs);
375 QLIST_FOREACH_SAFE(bm, &bs->dirty_bitmaps, list, next) {
376 if (bdrv_dirty_bitmap_name(bm)) {
377 bdrv_release_dirty_bitmap_locked(bm);
378 }
379 }
380 bdrv_dirty_bitmaps_unlock(bs);
615b5dcf
VSO
381}
382
56f364e6
VSO
383/**
384 * Remove persistent dirty bitmap from the storage if it exists.
385 * Absence of bitmap is not an error, because we have the following scenario:
386 * BdrvDirtyBitmap can have .persistent = true but not yet saved and have no
387 * stored version. For such bitmap bdrv_remove_persistent_dirty_bitmap() should
388 * not fail.
389 * This function doesn't release corresponding BdrvDirtyBitmap.
390 */
d2c3080e
VSO
391static int coroutine_fn
392bdrv_co_remove_persistent_dirty_bitmap(BlockDriverState *bs, const char *name,
393 Error **errp)
56f364e6 394{
d2c3080e
VSO
395 if (bs->drv && bs->drv->bdrv_co_remove_persistent_dirty_bitmap) {
396 return bs->drv->bdrv_co_remove_persistent_dirty_bitmap(bs, name, errp);
56f364e6 397 }
b56a1e31
VSO
398
399 return 0;
56f364e6
VSO
400}
401
d2c3080e
VSO
402typedef struct BdrvRemovePersistentDirtyBitmapCo {
403 BlockDriverState *bs;
404 const char *name;
405 Error **errp;
406 int ret;
407} BdrvRemovePersistentDirtyBitmapCo;
408
409static void coroutine_fn
410bdrv_co_remove_persistent_dirty_bitmap_entry(void *opaque)
411{
412 BdrvRemovePersistentDirtyBitmapCo *s = opaque;
413
414 s->ret = bdrv_co_remove_persistent_dirty_bitmap(s->bs, s->name, s->errp);
415 aio_wait_kick();
416}
417
418int bdrv_remove_persistent_dirty_bitmap(BlockDriverState *bs, const char *name,
419 Error **errp)
420{
421 if (qemu_in_coroutine()) {
422 return bdrv_co_remove_persistent_dirty_bitmap(bs, name, errp);
423 } else {
424 Coroutine *co;
425 BdrvRemovePersistentDirtyBitmapCo s = {
426 .bs = bs,
427 .name = name,
428 .errp = errp,
429 .ret = -EINPROGRESS,
430 };
431
432 co = qemu_coroutine_create(bdrv_co_remove_persistent_dirty_bitmap_entry,
433 &s);
434 bdrv_coroutine_enter(bs, co);
435 BDRV_POLL_WHILE(bs, s.ret == -EINPROGRESS);
436
437 return s.ret;
438 }
439}
440
ef893b5c
EB
441bool
442bdrv_supports_persistent_dirty_bitmap(BlockDriverState *bs)
443{
444 if (bs->drv && bs->drv->bdrv_supports_persistent_dirty_bitmap) {
445 return bs->drv->bdrv_supports_persistent_dirty_bitmap(bs);
446 }
447 return false;
448}
449
d2c3080e
VSO
450static bool coroutine_fn
451bdrv_co_can_store_new_dirty_bitmap(BlockDriverState *bs, const char *name,
452 uint32_t granularity, Error **errp)
85cc8a4f
VSO
453{
454 BlockDriver *drv = bs->drv;
455
456 if (!drv) {
457 error_setg_errno(errp, ENOMEDIUM,
458 "Can't store persistent bitmaps to %s",
459 bdrv_get_device_or_node_name(bs));
460 return false;
461 }
462
d2c3080e 463 if (!drv->bdrv_co_can_store_new_dirty_bitmap) {
85cc8a4f
VSO
464 error_setg_errno(errp, ENOTSUP,
465 "Can't store persistent bitmaps to %s",
466 bdrv_get_device_or_node_name(bs));
467 return false;
468 }
469
d2c3080e
VSO
470 return drv->bdrv_co_can_store_new_dirty_bitmap(bs, name, granularity, errp);
471}
472
473typedef struct BdrvCanStoreNewDirtyBitmapCo {
474 BlockDriverState *bs;
475 const char *name;
476 uint32_t granularity;
477 Error **errp;
478 bool ret;
479
480 bool in_progress;
481} BdrvCanStoreNewDirtyBitmapCo;
482
483static void coroutine_fn bdrv_co_can_store_new_dirty_bitmap_entry(void *opaque)
484{
485 BdrvCanStoreNewDirtyBitmapCo *s = opaque;
486
487 s->ret = bdrv_co_can_store_new_dirty_bitmap(s->bs, s->name, s->granularity,
488 s->errp);
489 s->in_progress = false;
490 aio_wait_kick();
491}
492
493bool bdrv_can_store_new_dirty_bitmap(BlockDriverState *bs, const char *name,
494 uint32_t granularity, Error **errp)
495{
384a48fb 496 IO_CODE();
d2c3080e
VSO
497 if (qemu_in_coroutine()) {
498 return bdrv_co_can_store_new_dirty_bitmap(bs, name, granularity, errp);
499 } else {
500 Coroutine *co;
501 BdrvCanStoreNewDirtyBitmapCo s = {
502 .bs = bs,
503 .name = name,
504 .granularity = granularity,
505 .errp = errp,
506 .in_progress = true,
507 };
508
509 co = qemu_coroutine_create(bdrv_co_can_store_new_dirty_bitmap_entry,
510 &s);
511 bdrv_coroutine_enter(bs, co);
512 BDRV_POLL_WHILE(bs, s.in_progress);
513
514 return s.ret;
515 }
85cc8a4f
VSO
516}
517
ebab2259
FZ
518void bdrv_disable_dirty_bitmap(BdrvDirtyBitmap *bitmap)
519{
1e638301 520 bdrv_dirty_bitmaps_lock(bitmap->bs);
ebab2259 521 bitmap->disabled = true;
1e638301 522 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
523}
524
525void bdrv_enable_dirty_bitmap(BdrvDirtyBitmap *bitmap)
526{
1e638301 527 bdrv_dirty_bitmaps_lock(bitmap->bs);
92bcea40 528 bdrv_enable_dirty_bitmap_locked(bitmap);
1e638301 529 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
530}
531
532BlockDirtyInfoList *bdrv_query_dirty_bitmaps(BlockDriverState *bs)
533{
534 BdrvDirtyBitmap *bm;
535 BlockDirtyInfoList *list = NULL;
c3033fd3 536 BlockDirtyInfoList **tail = &list;
ebab2259 537
2119882c 538 bdrv_dirty_bitmaps_lock(bs);
ebab2259
FZ
539 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
540 BlockDirtyInfo *info = g_new0(BlockDirtyInfo, 1);
c3033fd3 541
9a46dba7 542 info->count = bdrv_get_dirty_count(bm);
ebab2259
FZ
543 info->granularity = bdrv_dirty_bitmap_granularity(bm);
544 info->has_name = !!bm->name;
545 info->name = g_strdup(bm->name);
4db6ceb0 546 info->recording = bdrv_dirty_bitmap_recording(bm);
27a1b301 547 info->busy = bdrv_dirty_bitmap_busy(bm);
f67cf661 548 info->persistent = bm->persistent;
b0f45559
JS
549 info->has_inconsistent = bm->inconsistent;
550 info->inconsistent = bm->inconsistent;
c3033fd3 551 QAPI_LIST_APPEND(tail, info);
ebab2259 552 }
2119882c 553 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
554
555 return list;
556}
557
b64bd51e 558/* Called within bdrv_dirty_bitmap_lock..unlock */
28636b82 559bool bdrv_dirty_bitmap_get_locked(BdrvDirtyBitmap *bitmap, int64_t offset)
ebab2259 560{
28636b82
JS
561 return hbitmap_get(bitmap->bitmap, offset);
562}
563
564bool bdrv_dirty_bitmap_get(BdrvDirtyBitmap *bitmap, int64_t offset)
565{
566 bool ret;
1e638301 567 bdrv_dirty_bitmaps_lock(bitmap->bs);
28636b82 568 ret = bdrv_dirty_bitmap_get_locked(bitmap, offset);
1e638301 569 bdrv_dirty_bitmaps_unlock(bitmap->bs);
28636b82
JS
570
571 return ret;
ebab2259
FZ
572}
573
574/**
575 * Chooses a default granularity based on the existing cluster size,
576 * but clamped between [4K, 64K]. Defaults to 64K in the case that there
577 * is no cluster size information available.
578 */
579uint32_t bdrv_get_default_bitmap_granularity(BlockDriverState *bs)
580{
581 BlockDriverInfo bdi;
582 uint32_t granularity;
583
584 if (bdrv_get_info(bs, &bdi) >= 0 && bdi.cluster_size > 0) {
585 granularity = MAX(4096, bdi.cluster_size);
586 granularity = MIN(65536, granularity);
587 } else {
588 granularity = 65536;
589 }
590
591 return granularity;
592}
593
ba06ff1a 594uint32_t bdrv_dirty_bitmap_granularity(const BdrvDirtyBitmap *bitmap)
ebab2259 595{
ca759622 596 return 1U << hbitmap_granularity(bitmap->bitmap);
ebab2259
FZ
597}
598
715a74d8 599BdrvDirtyBitmapIter *bdrv_dirty_iter_new(BdrvDirtyBitmap *bitmap)
dc162c8e
FZ
600{
601 BdrvDirtyBitmapIter *iter = g_new(BdrvDirtyBitmapIter, 1);
715a74d8 602 hbitmap_iter_init(&iter->hbi, bitmap->bitmap, 0);
dc162c8e
FZ
603 iter->bitmap = bitmap;
604 bitmap->active_iterators++;
605 return iter;
606}
607
608void bdrv_dirty_iter_free(BdrvDirtyBitmapIter *iter)
609{
610 if (!iter) {
611 return;
612 }
613 assert(iter->bitmap->active_iterators > 0);
614 iter->bitmap->active_iterators--;
615 g_free(iter);
616}
617
618int64_t bdrv_dirty_iter_next(BdrvDirtyBitmapIter *iter)
ebab2259 619{
19c021e1 620 return hbitmap_iter_next(&iter->hbi);
ebab2259
FZ
621}
622
b64bd51e
PB
623/* Called within bdrv_dirty_bitmap_lock..unlock */
624void bdrv_set_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap,
e0d7f73e 625 int64_t offset, int64_t bytes)
b64bd51e 626{
d6883bc9 627 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 628 hbitmap_set(bitmap->bitmap, offset, bytes);
b64bd51e
PB
629}
630
ebab2259 631void bdrv_set_dirty_bitmap(BdrvDirtyBitmap *bitmap,
e0d7f73e 632 int64_t offset, int64_t bytes)
b64bd51e 633{
1e638301 634 bdrv_dirty_bitmaps_lock(bitmap->bs);
e0d7f73e 635 bdrv_set_dirty_bitmap_locked(bitmap, offset, bytes);
1e638301 636 bdrv_dirty_bitmaps_unlock(bitmap->bs);
b64bd51e
PB
637}
638
639/* Called within bdrv_dirty_bitmap_lock..unlock */
640void bdrv_reset_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap,
e0d7f73e 641 int64_t offset, int64_t bytes)
ebab2259 642{
d6883bc9 643 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 644 hbitmap_reset(bitmap->bitmap, offset, bytes);
ebab2259
FZ
645}
646
647void bdrv_reset_dirty_bitmap(BdrvDirtyBitmap *bitmap,
e0d7f73e 648 int64_t offset, int64_t bytes)
ebab2259 649{
1e638301 650 bdrv_dirty_bitmaps_lock(bitmap->bs);
e0d7f73e 651 bdrv_reset_dirty_bitmap_locked(bitmap, offset, bytes);
1e638301 652 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
653}
654
655void bdrv_clear_dirty_bitmap(BdrvDirtyBitmap *bitmap, HBitmap **out)
656{
967d7905 657 IO_CODE();
d6883bc9 658 assert(!bdrv_dirty_bitmap_readonly(bitmap));
1e638301 659 bdrv_dirty_bitmaps_lock(bitmap->bs);
ebab2259
FZ
660 if (!out) {
661 hbitmap_reset_all(bitmap->bitmap);
662 } else {
663 HBitmap *backup = bitmap->bitmap;
ca759622 664 bitmap->bitmap = hbitmap_alloc(bitmap->size,
ebab2259
FZ
665 hbitmap_granularity(backup));
666 *out = backup;
667 }
1e638301 668 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
669}
670
56bd6624 671void bdrv_restore_dirty_bitmap(BdrvDirtyBitmap *bitmap, HBitmap *backup)
ebab2259
FZ
672{
673 HBitmap *tmp = bitmap->bitmap;
d6883bc9 674 assert(!bdrv_dirty_bitmap_readonly(bitmap));
b4ad82aa 675 GLOBAL_STATE_CODE();
56bd6624 676 bitmap->bitmap = backup;
ebab2259
FZ
677 hbitmap_free(tmp);
678}
679
882c36f5 680uint64_t bdrv_dirty_bitmap_serialization_size(const BdrvDirtyBitmap *bitmap,
86f6ae67 681 uint64_t offset, uint64_t bytes)
882c36f5 682{
ca759622 683 return hbitmap_serialization_size(bitmap->bitmap, offset, bytes);
882c36f5
VSO
684}
685
686uint64_t bdrv_dirty_bitmap_serialization_align(const BdrvDirtyBitmap *bitmap)
687{
ca759622 688 return hbitmap_serialization_align(bitmap->bitmap);
882c36f5
VSO
689}
690
35f428ba
VSO
691/* Return the disk size covered by a chunk of serialized bitmap data. */
692uint64_t bdrv_dirty_bitmap_serialization_coverage(int serialized_chunk_size,
693 const BdrvDirtyBitmap *bitmap)
694{
695 uint64_t granularity = bdrv_dirty_bitmap_granularity(bitmap);
696 uint64_t limit = granularity * (serialized_chunk_size << 3);
697
698 assert(QEMU_IS_ALIGNED(limit,
699 bdrv_dirty_bitmap_serialization_align(bitmap)));
700 return limit;
701}
702
703
882c36f5 704void bdrv_dirty_bitmap_serialize_part(const BdrvDirtyBitmap *bitmap,
86f6ae67
EB
705 uint8_t *buf, uint64_t offset,
706 uint64_t bytes)
882c36f5 707{
ca759622 708 hbitmap_serialize_part(bitmap->bitmap, buf, offset, bytes);
882c36f5
VSO
709}
710
711void bdrv_dirty_bitmap_deserialize_part(BdrvDirtyBitmap *bitmap,
86f6ae67
EB
712 uint8_t *buf, uint64_t offset,
713 uint64_t bytes, bool finish)
882c36f5 714{
ca759622 715 hbitmap_deserialize_part(bitmap->bitmap, buf, offset, bytes, finish);
882c36f5
VSO
716}
717
718void bdrv_dirty_bitmap_deserialize_zeroes(BdrvDirtyBitmap *bitmap,
86f6ae67 719 uint64_t offset, uint64_t bytes,
882c36f5
VSO
720 bool finish)
721{
ca759622 722 hbitmap_deserialize_zeroes(bitmap->bitmap, offset, bytes, finish);
6bdc8b71
VSO
723}
724
725void bdrv_dirty_bitmap_deserialize_ones(BdrvDirtyBitmap *bitmap,
86f6ae67 726 uint64_t offset, uint64_t bytes,
6bdc8b71
VSO
727 bool finish)
728{
ca759622 729 hbitmap_deserialize_ones(bitmap->bitmap, offset, bytes, finish);
882c36f5
VSO
730}
731
732void bdrv_dirty_bitmap_deserialize_finish(BdrvDirtyBitmap *bitmap)
733{
734 hbitmap_deserialize_finish(bitmap->bitmap);
735}
736
0fdf1a4f 737void bdrv_set_dirty(BlockDriverState *bs, int64_t offset, int64_t bytes)
ebab2259
FZ
738{
739 BdrvDirtyBitmap *bitmap;
967d7905 740 IO_CODE();
2119882c
PB
741
742 if (QLIST_EMPTY(&bs->dirty_bitmaps)) {
743 return;
744 }
745
746 bdrv_dirty_bitmaps_lock(bs);
ebab2259
FZ
747 QLIST_FOREACH(bitmap, &bs->dirty_bitmaps, list) {
748 if (!bdrv_dirty_bitmap_enabled(bitmap)) {
749 continue;
750 }
d6883bc9 751 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 752 hbitmap_set(bitmap->bitmap, offset, bytes);
ebab2259 753 }
2119882c 754 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
755}
756
757/**
dc162c8e 758 * Advance a BdrvDirtyBitmapIter to an arbitrary offset.
ebab2259 759 */
715a74d8 760void bdrv_set_dirty_iter(BdrvDirtyBitmapIter *iter, int64_t offset)
ebab2259 761{
ca759622 762 hbitmap_iter_init(&iter->hbi, iter->hbi.hb, offset);
ebab2259
FZ
763}
764
765int64_t bdrv_get_dirty_count(BdrvDirtyBitmap *bitmap)
766{
ca759622 767 return hbitmap_count(bitmap->bitmap);
ebab2259 768}
6d3f4049 769
d6883bc9
VSO
770bool bdrv_dirty_bitmap_readonly(const BdrvDirtyBitmap *bitmap)
771{
772 return bitmap->readonly;
773}
774
775/* Called with BQL taken. */
776void bdrv_dirty_bitmap_set_readonly(BdrvDirtyBitmap *bitmap, bool value)
777{
1e638301 778 bdrv_dirty_bitmaps_lock(bitmap->bs);
d6883bc9 779 bitmap->readonly = value;
1e638301 780 bdrv_dirty_bitmaps_unlock(bitmap->bs);
d6883bc9
VSO
781}
782
783bool bdrv_has_readonly_bitmaps(BlockDriverState *bs)
784{
785 BdrvDirtyBitmap *bm;
786 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
787 if (bm->readonly) {
788 return true;
789 }
790 }
791
792 return false;
793}
a0319aac 794
7ae89a0d
VSO
795bool bdrv_has_named_bitmaps(BlockDriverState *bs)
796{
797 BdrvDirtyBitmap *bm;
798
799 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
800 if (bdrv_dirty_bitmap_name(bm)) {
801 return true;
802 }
803 }
804
805 return false;
806}
807
a88b179f 808/* Called with BQL taken. */
796a3798 809void bdrv_dirty_bitmap_set_persistence(BdrvDirtyBitmap *bitmap, bool persistent)
a88b179f 810{
1e638301 811 bdrv_dirty_bitmaps_lock(bitmap->bs);
a88b179f 812 bitmap->persistent = persistent;
1e638301 813 bdrv_dirty_bitmaps_unlock(bitmap->bs);
a88b179f
VSO
814}
815
b0f45559
JS
816/* Called with BQL taken. */
817void bdrv_dirty_bitmap_set_inconsistent(BdrvDirtyBitmap *bitmap)
818{
1e638301 819 bdrv_dirty_bitmaps_lock(bitmap->bs);
b0f45559
JS
820 assert(bitmap->persistent == true);
821 bitmap->inconsistent = true;
822 bitmap->disabled = true;
1e638301 823 bdrv_dirty_bitmaps_unlock(bitmap->bs);
b0f45559
JS
824}
825
9c98f145 826/* Called with BQL taken. */
c4e4b0fa 827void bdrv_dirty_bitmap_skip_store(BdrvDirtyBitmap *bitmap, bool skip)
9c98f145 828{
1e638301 829 bdrv_dirty_bitmaps_lock(bitmap->bs);
c4e4b0fa 830 bitmap->skip_store = skip;
1e638301 831 bdrv_dirty_bitmaps_unlock(bitmap->bs);
9c98f145
VSO
832}
833
796a3798 834bool bdrv_dirty_bitmap_get_persistence(BdrvDirtyBitmap *bitmap)
a88b179f 835{
c4e4b0fa 836 return bitmap->persistent && !bitmap->skip_store;
a88b179f
VSO
837}
838
b0f45559
JS
839bool bdrv_dirty_bitmap_inconsistent(const BdrvDirtyBitmap *bitmap)
840{
841 return bitmap->inconsistent;
842}
843
ef9041a7 844BdrvDirtyBitmap *bdrv_dirty_bitmap_first(BlockDriverState *bs)
3dd10a06 845{
ef9041a7
VSO
846 return QLIST_FIRST(&bs->dirty_bitmaps);
847}
848
849BdrvDirtyBitmap *bdrv_dirty_bitmap_next(BdrvDirtyBitmap *bitmap)
850{
851 return QLIST_NEXT(bitmap, list);
3dd10a06 852}
a3b52535
VSO
853
854char *bdrv_dirty_bitmap_sha256(const BdrvDirtyBitmap *bitmap, Error **errp)
855{
856 return hbitmap_sha256(bitmap->bitmap, errp);
857}
56207df5 858
9399c54b
VSO
859int64_t bdrv_dirty_bitmap_next_dirty(BdrvDirtyBitmap *bitmap, int64_t offset,
860 int64_t bytes)
861{
862 return hbitmap_next_dirty(bitmap->bitmap, offset, bytes);
863}
864
642700fd
VSO
865int64_t bdrv_dirty_bitmap_next_zero(BdrvDirtyBitmap *bitmap, int64_t offset,
866 int64_t bytes)
56207df5 867{
76d570dc 868 return hbitmap_next_zero(bitmap->bitmap, offset, bytes);
56207df5 869}
b598e531 870
a78a1a48 871bool bdrv_dirty_bitmap_next_dirty_area(BdrvDirtyBitmap *bitmap,
299ea9ff
VSO
872 int64_t start, int64_t end, int64_t max_dirty_count,
873 int64_t *dirty_start, int64_t *dirty_count)
a78a1a48 874{
299ea9ff
VSO
875 return hbitmap_next_dirty_area(bitmap->bitmap, start, end, max_dirty_count,
876 dirty_start, dirty_count);
a78a1a48
VSO
877}
878
a6426475
VSO
879bool bdrv_dirty_bitmap_status(BdrvDirtyBitmap *bitmap, int64_t offset,
880 int64_t bytes, int64_t *count)
881{
882 return hbitmap_status(bitmap->bitmap, offset, bytes, count);
883}
884
b7661ca5
JS
885/**
886 * bdrv_merge_dirty_bitmap: merge src into dest.
887 * Ensures permissions on bitmaps are reasonable; use for public API.
888 *
889 * @backup: If provided, make a copy of dest here prior to merge.
34ffacb7
VSO
890 *
891 * Returns true on success, false on failure. In case of failure bitmaps are
892 * untouched.
b7661ca5 893 */
34ffacb7 894bool bdrv_merge_dirty_bitmap(BdrvDirtyBitmap *dest, const BdrvDirtyBitmap *src,
fa000f2f 895 HBitmap **backup, Error **errp)
b598e531 896{
34ffacb7 897 bool ret = false;
fa000f2f 898
1e638301
VSO
899 bdrv_dirty_bitmaps_lock(dest->bs);
900 if (src->bs != dest->bs) {
901 bdrv_dirty_bitmaps_lock(src->bs);
eff0829b 902 }
b598e531 903
3ae96d66 904 if (bdrv_dirty_bitmap_check(dest, BDRV_BITMAP_DEFAULT, errp)) {
06bf5006
VSO
905 goto out;
906 }
907
cb8e58e3
JS
908 if (bdrv_dirty_bitmap_check(src, BDRV_BITMAP_ALLOW_RO, errp)) {
909 goto out;
910 }
b598e531 911
618af89e
VSO
912 if (bdrv_dirty_bitmap_size(src) != bdrv_dirty_bitmap_size(dest)) {
913 error_setg(errp, "Bitmaps are of different sizes (destination size is %"
914 PRId64 ", source size is %" PRId64 ") and can't be merged",
915 bdrv_dirty_bitmap_size(dest), bdrv_dirty_bitmap_size(src));
06bf5006 916 goto out;
b598e531
VSO
917 }
918
618af89e
VSO
919 bdrv_dirty_bitmap_merge_internal(dest, src, backup, false);
920 ret = true;
b7661ca5
JS
921
922out:
1e638301
VSO
923 bdrv_dirty_bitmaps_unlock(dest->bs);
924 if (src->bs != dest->bs) {
925 bdrv_dirty_bitmaps_unlock(src->bs);
b7661ca5 926 }
34ffacb7
VSO
927
928 return ret;
b7661ca5
JS
929}
930
931/**
932 * bdrv_dirty_bitmap_merge_internal: merge src into dest.
933 * Does NOT check bitmap permissions; not suitable for use as public API.
618af89e 934 * @dest, @src and @backup (if not NULL) must have same size.
b7661ca5
JS
935 *
936 * @backup: If provided, make a copy of dest here prior to merge.
937 * @lock: If true, lock and unlock bitmaps on the way in/out.
b7661ca5 938 */
618af89e 939void bdrv_dirty_bitmap_merge_internal(BdrvDirtyBitmap *dest,
b7661ca5
JS
940 const BdrvDirtyBitmap *src,
941 HBitmap **backup,
942 bool lock)
943{
967d7905 944 IO_CODE();
b7661ca5
JS
945
946 assert(!bdrv_dirty_bitmap_readonly(dest));
947 assert(!bdrv_dirty_bitmap_inconsistent(dest));
948 assert(!bdrv_dirty_bitmap_inconsistent(src));
949
950 if (lock) {
1e638301
VSO
951 bdrv_dirty_bitmaps_lock(dest->bs);
952 if (src->bs != dest->bs) {
953 bdrv_dirty_bitmaps_lock(src->bs);
b7661ca5
JS
954 }
955 }
956
fa000f2f
VSO
957 if (backup) {
958 *backup = dest->bitmap;
959 dest->bitmap = hbitmap_alloc(dest->size, hbitmap_granularity(*backup));
618af89e 960 hbitmap_merge(*backup, src->bitmap, dest->bitmap);
fa000f2f 961 } else {
618af89e 962 hbitmap_merge(dest->bitmap, src->bitmap, dest->bitmap);
fa000f2f 963 }
fa000f2f 964
b7661ca5 965 if (lock) {
1e638301
VSO
966 bdrv_dirty_bitmaps_unlock(dest->bs);
967 if (src->bs != dest->bs) {
968 bdrv_dirty_bitmaps_unlock(src->bs);
b7661ca5 969 }
eff0829b 970 }
b598e531 971}