]> Git Repo - qemu.git/blame - block/dirty-bitmap.c
assertions for block_int global state API
[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
fa000f2f 312 if (!hbitmap_merge(parent->bitmap, successor->bitmap, parent->bitmap)) {
ebab2259
FZ
313 error_setg(errp, "Merging of parent and successor bitmap failed");
314 return NULL;
315 }
8b2e20f6
JS
316
317 parent->disabled = successor->disabled;
27a1b301 318 parent->busy = false;
b133c27f 319 bdrv_release_dirty_bitmap_locked(successor);
ebab2259
FZ
320 parent->successor = NULL;
321
044ee8e1
VSO
322 return parent;
323}
324
325/* Called with BQL taken. */
5deb6cbd 326BdrvDirtyBitmap *bdrv_reclaim_dirty_bitmap(BdrvDirtyBitmap *parent,
044ee8e1
VSO
327 Error **errp)
328{
329 BdrvDirtyBitmap *ret;
330
1e638301 331 bdrv_dirty_bitmaps_lock(parent->bs);
5deb6cbd 332 ret = bdrv_reclaim_dirty_bitmap_locked(parent, errp);
1e638301 333 bdrv_dirty_bitmaps_unlock(parent->bs);
604ab74b 334
044ee8e1 335 return ret;
ebab2259
FZ
336}
337
338/**
339 * Truncates _all_ bitmaps attached to a BDS.
2119882c 340 * Called with BQL taken.
ebab2259 341 */
1b6cc579 342void bdrv_dirty_bitmap_truncate(BlockDriverState *bs, int64_t bytes)
ebab2259
FZ
343{
344 BdrvDirtyBitmap *bitmap;
ebab2259 345
2119882c 346 bdrv_dirty_bitmaps_lock(bs);
ebab2259 347 QLIST_FOREACH(bitmap, &bs->dirty_bitmaps, list) {
27a1b301 348 assert(!bdrv_dirty_bitmap_busy(bitmap));
50a47257 349 assert(!bdrv_dirty_bitmap_has_successor(bitmap));
dc162c8e 350 assert(!bitmap->active_iterators);
ca759622 351 hbitmap_truncate(bitmap->bitmap, bytes);
993e6525 352 bitmap->size = bytes;
ebab2259 353 }
2119882c 354 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
355}
356
2119882c 357/* Called with BQL taken. */
5deb6cbd 358void bdrv_release_dirty_bitmap(BdrvDirtyBitmap *bitmap)
ebab2259 359{
5deb6cbd
VSO
360 BlockDriverState *bs = bitmap->bs;
361
b133c27f
PB
362 bdrv_dirty_bitmaps_lock(bs);
363 bdrv_release_dirty_bitmap_locked(bitmap);
364 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
365}
366
367/**
368 * Release all named dirty bitmaps attached to a BDS (for use in bdrv_close()).
27a1b301 369 * There must not be any busy bitmaps attached.
56f364e6 370 * This function does not remove persistent bitmaps from the storage.
2119882c 371 * Called with BQL taken.
ebab2259
FZ
372 */
373void bdrv_release_named_dirty_bitmaps(BlockDriverState *bs)
374{
b133c27f
PB
375 BdrvDirtyBitmap *bm, *next;
376
377 bdrv_dirty_bitmaps_lock(bs);
378 QLIST_FOREACH_SAFE(bm, &bs->dirty_bitmaps, list, next) {
379 if (bdrv_dirty_bitmap_name(bm)) {
380 bdrv_release_dirty_bitmap_locked(bm);
381 }
382 }
383 bdrv_dirty_bitmaps_unlock(bs);
615b5dcf
VSO
384}
385
56f364e6
VSO
386/**
387 * Remove persistent dirty bitmap from the storage if it exists.
388 * Absence of bitmap is not an error, because we have the following scenario:
389 * BdrvDirtyBitmap can have .persistent = true but not yet saved and have no
390 * stored version. For such bitmap bdrv_remove_persistent_dirty_bitmap() should
391 * not fail.
392 * This function doesn't release corresponding BdrvDirtyBitmap.
393 */
d2c3080e
VSO
394static int coroutine_fn
395bdrv_co_remove_persistent_dirty_bitmap(BlockDriverState *bs, const char *name,
396 Error **errp)
56f364e6 397{
d2c3080e
VSO
398 if (bs->drv && bs->drv->bdrv_co_remove_persistent_dirty_bitmap) {
399 return bs->drv->bdrv_co_remove_persistent_dirty_bitmap(bs, name, errp);
56f364e6 400 }
b56a1e31
VSO
401
402 return 0;
56f364e6
VSO
403}
404
d2c3080e
VSO
405typedef struct BdrvRemovePersistentDirtyBitmapCo {
406 BlockDriverState *bs;
407 const char *name;
408 Error **errp;
409 int ret;
410} BdrvRemovePersistentDirtyBitmapCo;
411
412static void coroutine_fn
413bdrv_co_remove_persistent_dirty_bitmap_entry(void *opaque)
414{
415 BdrvRemovePersistentDirtyBitmapCo *s = opaque;
416
417 s->ret = bdrv_co_remove_persistent_dirty_bitmap(s->bs, s->name, s->errp);
418 aio_wait_kick();
419}
420
421int bdrv_remove_persistent_dirty_bitmap(BlockDriverState *bs, const char *name,
422 Error **errp)
423{
424 if (qemu_in_coroutine()) {
425 return bdrv_co_remove_persistent_dirty_bitmap(bs, name, errp);
426 } else {
427 Coroutine *co;
428 BdrvRemovePersistentDirtyBitmapCo s = {
429 .bs = bs,
430 .name = name,
431 .errp = errp,
432 .ret = -EINPROGRESS,
433 };
434
435 co = qemu_coroutine_create(bdrv_co_remove_persistent_dirty_bitmap_entry,
436 &s);
437 bdrv_coroutine_enter(bs, co);
438 BDRV_POLL_WHILE(bs, s.ret == -EINPROGRESS);
439
440 return s.ret;
441 }
442}
443
ef893b5c
EB
444bool
445bdrv_supports_persistent_dirty_bitmap(BlockDriverState *bs)
446{
447 if (bs->drv && bs->drv->bdrv_supports_persistent_dirty_bitmap) {
448 return bs->drv->bdrv_supports_persistent_dirty_bitmap(bs);
449 }
450 return false;
451}
452
d2c3080e
VSO
453static bool coroutine_fn
454bdrv_co_can_store_new_dirty_bitmap(BlockDriverState *bs, const char *name,
455 uint32_t granularity, Error **errp)
85cc8a4f
VSO
456{
457 BlockDriver *drv = bs->drv;
458
459 if (!drv) {
460 error_setg_errno(errp, ENOMEDIUM,
461 "Can't store persistent bitmaps to %s",
462 bdrv_get_device_or_node_name(bs));
463 return false;
464 }
465
d2c3080e 466 if (!drv->bdrv_co_can_store_new_dirty_bitmap) {
85cc8a4f
VSO
467 error_setg_errno(errp, ENOTSUP,
468 "Can't store persistent bitmaps to %s",
469 bdrv_get_device_or_node_name(bs));
470 return false;
471 }
472
d2c3080e
VSO
473 return drv->bdrv_co_can_store_new_dirty_bitmap(bs, name, granularity, errp);
474}
475
476typedef struct BdrvCanStoreNewDirtyBitmapCo {
477 BlockDriverState *bs;
478 const char *name;
479 uint32_t granularity;
480 Error **errp;
481 bool ret;
482
483 bool in_progress;
484} BdrvCanStoreNewDirtyBitmapCo;
485
486static void coroutine_fn bdrv_co_can_store_new_dirty_bitmap_entry(void *opaque)
487{
488 BdrvCanStoreNewDirtyBitmapCo *s = opaque;
489
490 s->ret = bdrv_co_can_store_new_dirty_bitmap(s->bs, s->name, s->granularity,
491 s->errp);
492 s->in_progress = false;
493 aio_wait_kick();
494}
495
496bool bdrv_can_store_new_dirty_bitmap(BlockDriverState *bs, const char *name,
497 uint32_t granularity, Error **errp)
498{
384a48fb 499 IO_CODE();
d2c3080e
VSO
500 if (qemu_in_coroutine()) {
501 return bdrv_co_can_store_new_dirty_bitmap(bs, name, granularity, errp);
502 } else {
503 Coroutine *co;
504 BdrvCanStoreNewDirtyBitmapCo s = {
505 .bs = bs,
506 .name = name,
507 .granularity = granularity,
508 .errp = errp,
509 .in_progress = true,
510 };
511
512 co = qemu_coroutine_create(bdrv_co_can_store_new_dirty_bitmap_entry,
513 &s);
514 bdrv_coroutine_enter(bs, co);
515 BDRV_POLL_WHILE(bs, s.in_progress);
516
517 return s.ret;
518 }
85cc8a4f
VSO
519}
520
ebab2259
FZ
521void bdrv_disable_dirty_bitmap(BdrvDirtyBitmap *bitmap)
522{
1e638301 523 bdrv_dirty_bitmaps_lock(bitmap->bs);
ebab2259 524 bitmap->disabled = true;
1e638301 525 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
526}
527
528void bdrv_enable_dirty_bitmap(BdrvDirtyBitmap *bitmap)
529{
1e638301 530 bdrv_dirty_bitmaps_lock(bitmap->bs);
92bcea40 531 bdrv_enable_dirty_bitmap_locked(bitmap);
1e638301 532 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
533}
534
535BlockDirtyInfoList *bdrv_query_dirty_bitmaps(BlockDriverState *bs)
536{
537 BdrvDirtyBitmap *bm;
538 BlockDirtyInfoList *list = NULL;
c3033fd3 539 BlockDirtyInfoList **tail = &list;
ebab2259 540
2119882c 541 bdrv_dirty_bitmaps_lock(bs);
ebab2259
FZ
542 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
543 BlockDirtyInfo *info = g_new0(BlockDirtyInfo, 1);
c3033fd3 544
9a46dba7 545 info->count = bdrv_get_dirty_count(bm);
ebab2259
FZ
546 info->granularity = bdrv_dirty_bitmap_granularity(bm);
547 info->has_name = !!bm->name;
548 info->name = g_strdup(bm->name);
4db6ceb0 549 info->recording = bdrv_dirty_bitmap_recording(bm);
27a1b301 550 info->busy = bdrv_dirty_bitmap_busy(bm);
f67cf661 551 info->persistent = bm->persistent;
b0f45559
JS
552 info->has_inconsistent = bm->inconsistent;
553 info->inconsistent = bm->inconsistent;
c3033fd3 554 QAPI_LIST_APPEND(tail, info);
ebab2259 555 }
2119882c 556 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
557
558 return list;
559}
560
b64bd51e 561/* Called within bdrv_dirty_bitmap_lock..unlock */
28636b82 562bool bdrv_dirty_bitmap_get_locked(BdrvDirtyBitmap *bitmap, int64_t offset)
ebab2259 563{
28636b82
JS
564 return hbitmap_get(bitmap->bitmap, offset);
565}
566
567bool bdrv_dirty_bitmap_get(BdrvDirtyBitmap *bitmap, int64_t offset)
568{
569 bool ret;
1e638301 570 bdrv_dirty_bitmaps_lock(bitmap->bs);
28636b82 571 ret = bdrv_dirty_bitmap_get_locked(bitmap, offset);
1e638301 572 bdrv_dirty_bitmaps_unlock(bitmap->bs);
28636b82
JS
573
574 return ret;
ebab2259
FZ
575}
576
577/**
578 * Chooses a default granularity based on the existing cluster size,
579 * but clamped between [4K, 64K]. Defaults to 64K in the case that there
580 * is no cluster size information available.
581 */
582uint32_t bdrv_get_default_bitmap_granularity(BlockDriverState *bs)
583{
584 BlockDriverInfo bdi;
585 uint32_t granularity;
586
587 if (bdrv_get_info(bs, &bdi) >= 0 && bdi.cluster_size > 0) {
588 granularity = MAX(4096, bdi.cluster_size);
589 granularity = MIN(65536, granularity);
590 } else {
591 granularity = 65536;
592 }
593
594 return granularity;
595}
596
ba06ff1a 597uint32_t bdrv_dirty_bitmap_granularity(const BdrvDirtyBitmap *bitmap)
ebab2259 598{
ca759622 599 return 1U << hbitmap_granularity(bitmap->bitmap);
ebab2259
FZ
600}
601
715a74d8 602BdrvDirtyBitmapIter *bdrv_dirty_iter_new(BdrvDirtyBitmap *bitmap)
dc162c8e
FZ
603{
604 BdrvDirtyBitmapIter *iter = g_new(BdrvDirtyBitmapIter, 1);
715a74d8 605 hbitmap_iter_init(&iter->hbi, bitmap->bitmap, 0);
dc162c8e
FZ
606 iter->bitmap = bitmap;
607 bitmap->active_iterators++;
608 return iter;
609}
610
611void bdrv_dirty_iter_free(BdrvDirtyBitmapIter *iter)
612{
613 if (!iter) {
614 return;
615 }
616 assert(iter->bitmap->active_iterators > 0);
617 iter->bitmap->active_iterators--;
618 g_free(iter);
619}
620
621int64_t bdrv_dirty_iter_next(BdrvDirtyBitmapIter *iter)
ebab2259 622{
19c021e1 623 return hbitmap_iter_next(&iter->hbi);
ebab2259
FZ
624}
625
b64bd51e
PB
626/* Called within bdrv_dirty_bitmap_lock..unlock */
627void bdrv_set_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap,
e0d7f73e 628 int64_t offset, int64_t bytes)
b64bd51e 629{
d6883bc9 630 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 631 hbitmap_set(bitmap->bitmap, offset, bytes);
b64bd51e
PB
632}
633
ebab2259 634void bdrv_set_dirty_bitmap(BdrvDirtyBitmap *bitmap,
e0d7f73e 635 int64_t offset, int64_t bytes)
b64bd51e 636{
1e638301 637 bdrv_dirty_bitmaps_lock(bitmap->bs);
e0d7f73e 638 bdrv_set_dirty_bitmap_locked(bitmap, offset, bytes);
1e638301 639 bdrv_dirty_bitmaps_unlock(bitmap->bs);
b64bd51e
PB
640}
641
642/* Called within bdrv_dirty_bitmap_lock..unlock */
643void bdrv_reset_dirty_bitmap_locked(BdrvDirtyBitmap *bitmap,
e0d7f73e 644 int64_t offset, int64_t bytes)
ebab2259 645{
d6883bc9 646 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 647 hbitmap_reset(bitmap->bitmap, offset, bytes);
ebab2259
FZ
648}
649
650void bdrv_reset_dirty_bitmap(BdrvDirtyBitmap *bitmap,
e0d7f73e 651 int64_t offset, int64_t bytes)
ebab2259 652{
1e638301 653 bdrv_dirty_bitmaps_lock(bitmap->bs);
e0d7f73e 654 bdrv_reset_dirty_bitmap_locked(bitmap, offset, bytes);
1e638301 655 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
656}
657
658void bdrv_clear_dirty_bitmap(BdrvDirtyBitmap *bitmap, HBitmap **out)
659{
d6883bc9 660 assert(!bdrv_dirty_bitmap_readonly(bitmap));
1e638301 661 bdrv_dirty_bitmaps_lock(bitmap->bs);
ebab2259
FZ
662 if (!out) {
663 hbitmap_reset_all(bitmap->bitmap);
664 } else {
665 HBitmap *backup = bitmap->bitmap;
ca759622 666 bitmap->bitmap = hbitmap_alloc(bitmap->size,
ebab2259
FZ
667 hbitmap_granularity(backup));
668 *out = backup;
669 }
1e638301 670 bdrv_dirty_bitmaps_unlock(bitmap->bs);
ebab2259
FZ
671}
672
56bd6624 673void bdrv_restore_dirty_bitmap(BdrvDirtyBitmap *bitmap, HBitmap *backup)
ebab2259
FZ
674{
675 HBitmap *tmp = bitmap->bitmap;
d6883bc9 676 assert(!bdrv_dirty_bitmap_readonly(bitmap));
b4ad82aa 677 GLOBAL_STATE_CODE();
56bd6624 678 bitmap->bitmap = backup;
ebab2259
FZ
679 hbitmap_free(tmp);
680}
681
882c36f5 682uint64_t bdrv_dirty_bitmap_serialization_size(const BdrvDirtyBitmap *bitmap,
86f6ae67 683 uint64_t offset, uint64_t bytes)
882c36f5 684{
ca759622 685 return hbitmap_serialization_size(bitmap->bitmap, offset, bytes);
882c36f5
VSO
686}
687
688uint64_t bdrv_dirty_bitmap_serialization_align(const BdrvDirtyBitmap *bitmap)
689{
ca759622 690 return hbitmap_serialization_align(bitmap->bitmap);
882c36f5
VSO
691}
692
35f428ba
VSO
693/* Return the disk size covered by a chunk of serialized bitmap data. */
694uint64_t bdrv_dirty_bitmap_serialization_coverage(int serialized_chunk_size,
695 const BdrvDirtyBitmap *bitmap)
696{
697 uint64_t granularity = bdrv_dirty_bitmap_granularity(bitmap);
698 uint64_t limit = granularity * (serialized_chunk_size << 3);
699
700 assert(QEMU_IS_ALIGNED(limit,
701 bdrv_dirty_bitmap_serialization_align(bitmap)));
702 return limit;
703}
704
705
882c36f5 706void bdrv_dirty_bitmap_serialize_part(const BdrvDirtyBitmap *bitmap,
86f6ae67
EB
707 uint8_t *buf, uint64_t offset,
708 uint64_t bytes)
882c36f5 709{
ca759622 710 hbitmap_serialize_part(bitmap->bitmap, buf, offset, bytes);
882c36f5
VSO
711}
712
713void bdrv_dirty_bitmap_deserialize_part(BdrvDirtyBitmap *bitmap,
86f6ae67
EB
714 uint8_t *buf, uint64_t offset,
715 uint64_t bytes, bool finish)
882c36f5 716{
ca759622 717 hbitmap_deserialize_part(bitmap->bitmap, buf, offset, bytes, finish);
882c36f5
VSO
718}
719
720void bdrv_dirty_bitmap_deserialize_zeroes(BdrvDirtyBitmap *bitmap,
86f6ae67 721 uint64_t offset, uint64_t bytes,
882c36f5
VSO
722 bool finish)
723{
ca759622 724 hbitmap_deserialize_zeroes(bitmap->bitmap, offset, bytes, finish);
6bdc8b71
VSO
725}
726
727void bdrv_dirty_bitmap_deserialize_ones(BdrvDirtyBitmap *bitmap,
86f6ae67 728 uint64_t offset, uint64_t bytes,
6bdc8b71
VSO
729 bool finish)
730{
ca759622 731 hbitmap_deserialize_ones(bitmap->bitmap, offset, bytes, finish);
882c36f5
VSO
732}
733
734void bdrv_dirty_bitmap_deserialize_finish(BdrvDirtyBitmap *bitmap)
735{
736 hbitmap_deserialize_finish(bitmap->bitmap);
737}
738
0fdf1a4f 739void bdrv_set_dirty(BlockDriverState *bs, int64_t offset, int64_t bytes)
ebab2259
FZ
740{
741 BdrvDirtyBitmap *bitmap;
2119882c
PB
742
743 if (QLIST_EMPTY(&bs->dirty_bitmaps)) {
744 return;
745 }
746
747 bdrv_dirty_bitmaps_lock(bs);
ebab2259
FZ
748 QLIST_FOREACH(bitmap, &bs->dirty_bitmaps, list) {
749 if (!bdrv_dirty_bitmap_enabled(bitmap)) {
750 continue;
751 }
d6883bc9 752 assert(!bdrv_dirty_bitmap_readonly(bitmap));
ca759622 753 hbitmap_set(bitmap->bitmap, offset, bytes);
ebab2259 754 }
2119882c 755 bdrv_dirty_bitmaps_unlock(bs);
ebab2259
FZ
756}
757
758/**
dc162c8e 759 * Advance a BdrvDirtyBitmapIter to an arbitrary offset.
ebab2259 760 */
715a74d8 761void bdrv_set_dirty_iter(BdrvDirtyBitmapIter *iter, int64_t offset)
ebab2259 762{
ca759622 763 hbitmap_iter_init(&iter->hbi, iter->hbi.hb, offset);
ebab2259
FZ
764}
765
766int64_t bdrv_get_dirty_count(BdrvDirtyBitmap *bitmap)
767{
ca759622 768 return hbitmap_count(bitmap->bitmap);
ebab2259 769}
6d3f4049 770
d6883bc9
VSO
771bool bdrv_dirty_bitmap_readonly(const BdrvDirtyBitmap *bitmap)
772{
773 return bitmap->readonly;
774}
775
776/* Called with BQL taken. */
777void bdrv_dirty_bitmap_set_readonly(BdrvDirtyBitmap *bitmap, bool value)
778{
1e638301 779 bdrv_dirty_bitmaps_lock(bitmap->bs);
d6883bc9 780 bitmap->readonly = value;
1e638301 781 bdrv_dirty_bitmaps_unlock(bitmap->bs);
d6883bc9
VSO
782}
783
784bool bdrv_has_readonly_bitmaps(BlockDriverState *bs)
785{
786 BdrvDirtyBitmap *bm;
787 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
788 if (bm->readonly) {
789 return true;
790 }
791 }
792
793 return false;
794}
a0319aac 795
7ae89a0d
VSO
796bool bdrv_has_named_bitmaps(BlockDriverState *bs)
797{
798 BdrvDirtyBitmap *bm;
799
800 QLIST_FOREACH(bm, &bs->dirty_bitmaps, list) {
801 if (bdrv_dirty_bitmap_name(bm)) {
802 return true;
803 }
804 }
805
806 return false;
807}
808
a88b179f 809/* Called with BQL taken. */
796a3798 810void bdrv_dirty_bitmap_set_persistence(BdrvDirtyBitmap *bitmap, bool persistent)
a88b179f 811{
1e638301 812 bdrv_dirty_bitmaps_lock(bitmap->bs);
a88b179f 813 bitmap->persistent = persistent;
1e638301 814 bdrv_dirty_bitmaps_unlock(bitmap->bs);
a88b179f
VSO
815}
816
b0f45559
JS
817/* Called with BQL taken. */
818void bdrv_dirty_bitmap_set_inconsistent(BdrvDirtyBitmap *bitmap)
819{
1e638301 820 bdrv_dirty_bitmaps_lock(bitmap->bs);
b0f45559
JS
821 assert(bitmap->persistent == true);
822 bitmap->inconsistent = true;
823 bitmap->disabled = true;
1e638301 824 bdrv_dirty_bitmaps_unlock(bitmap->bs);
b0f45559
JS
825}
826
9c98f145 827/* Called with BQL taken. */
c4e4b0fa 828void bdrv_dirty_bitmap_skip_store(BdrvDirtyBitmap *bitmap, bool skip)
9c98f145 829{
1e638301 830 bdrv_dirty_bitmaps_lock(bitmap->bs);
c4e4b0fa 831 bitmap->skip_store = skip;
1e638301 832 bdrv_dirty_bitmaps_unlock(bitmap->bs);
9c98f145
VSO
833}
834
796a3798 835bool bdrv_dirty_bitmap_get_persistence(BdrvDirtyBitmap *bitmap)
a88b179f 836{
c4e4b0fa 837 return bitmap->persistent && !bitmap->skip_store;
a88b179f
VSO
838}
839
b0f45559
JS
840bool bdrv_dirty_bitmap_inconsistent(const BdrvDirtyBitmap *bitmap)
841{
842 return bitmap->inconsistent;
843}
844
ef9041a7 845BdrvDirtyBitmap *bdrv_dirty_bitmap_first(BlockDriverState *bs)
3dd10a06 846{
ef9041a7
VSO
847 return QLIST_FIRST(&bs->dirty_bitmaps);
848}
849
850BdrvDirtyBitmap *bdrv_dirty_bitmap_next(BdrvDirtyBitmap *bitmap)
851{
852 return QLIST_NEXT(bitmap, list);
3dd10a06 853}
a3b52535
VSO
854
855char *bdrv_dirty_bitmap_sha256(const BdrvDirtyBitmap *bitmap, Error **errp)
856{
857 return hbitmap_sha256(bitmap->bitmap, errp);
858}
56207df5 859
9399c54b
VSO
860int64_t bdrv_dirty_bitmap_next_dirty(BdrvDirtyBitmap *bitmap, int64_t offset,
861 int64_t bytes)
862{
863 return hbitmap_next_dirty(bitmap->bitmap, offset, bytes);
864}
865
642700fd
VSO
866int64_t bdrv_dirty_bitmap_next_zero(BdrvDirtyBitmap *bitmap, int64_t offset,
867 int64_t bytes)
56207df5 868{
76d570dc 869 return hbitmap_next_zero(bitmap->bitmap, offset, bytes);
56207df5 870}
b598e531 871
a78a1a48 872bool bdrv_dirty_bitmap_next_dirty_area(BdrvDirtyBitmap *bitmap,
299ea9ff
VSO
873 int64_t start, int64_t end, int64_t max_dirty_count,
874 int64_t *dirty_start, int64_t *dirty_count)
a78a1a48 875{
299ea9ff
VSO
876 return hbitmap_next_dirty_area(bitmap->bitmap, start, end, max_dirty_count,
877 dirty_start, dirty_count);
a78a1a48
VSO
878}
879
b7661ca5
JS
880/**
881 * bdrv_merge_dirty_bitmap: merge src into dest.
882 * Ensures permissions on bitmaps are reasonable; use for public API.
883 *
884 * @backup: If provided, make a copy of dest here prior to merge.
885 */
b598e531 886void bdrv_merge_dirty_bitmap(BdrvDirtyBitmap *dest, const BdrvDirtyBitmap *src,
fa000f2f 887 HBitmap **backup, Error **errp)
b598e531 888{
fa000f2f
VSO
889 bool ret;
890
1e638301
VSO
891 bdrv_dirty_bitmaps_lock(dest->bs);
892 if (src->bs != dest->bs) {
893 bdrv_dirty_bitmaps_lock(src->bs);
eff0829b 894 }
b598e531 895
3ae96d66 896 if (bdrv_dirty_bitmap_check(dest, BDRV_BITMAP_DEFAULT, errp)) {
06bf5006
VSO
897 goto out;
898 }
899
cb8e58e3
JS
900 if (bdrv_dirty_bitmap_check(src, BDRV_BITMAP_ALLOW_RO, errp)) {
901 goto out;
902 }
b598e531 903
fa000f2f 904 if (!hbitmap_can_merge(dest->bitmap, src->bitmap)) {
b598e531 905 error_setg(errp, "Bitmaps are incompatible and can't be merged");
06bf5006 906 goto out;
b598e531
VSO
907 }
908
b7661ca5
JS
909 ret = bdrv_dirty_bitmap_merge_internal(dest, src, backup, false);
910 assert(ret);
911
912out:
1e638301
VSO
913 bdrv_dirty_bitmaps_unlock(dest->bs);
914 if (src->bs != dest->bs) {
915 bdrv_dirty_bitmaps_unlock(src->bs);
b7661ca5
JS
916 }
917}
918
919/**
920 * bdrv_dirty_bitmap_merge_internal: merge src into dest.
921 * Does NOT check bitmap permissions; not suitable for use as public API.
922 *
923 * @backup: If provided, make a copy of dest here prior to merge.
924 * @lock: If true, lock and unlock bitmaps on the way in/out.
925 * returns true if the merge succeeded; false if unattempted.
926 */
927bool bdrv_dirty_bitmap_merge_internal(BdrvDirtyBitmap *dest,
928 const BdrvDirtyBitmap *src,
929 HBitmap **backup,
930 bool lock)
931{
932 bool ret;
933
934 assert(!bdrv_dirty_bitmap_readonly(dest));
935 assert(!bdrv_dirty_bitmap_inconsistent(dest));
936 assert(!bdrv_dirty_bitmap_inconsistent(src));
937
938 if (lock) {
1e638301
VSO
939 bdrv_dirty_bitmaps_lock(dest->bs);
940 if (src->bs != dest->bs) {
941 bdrv_dirty_bitmaps_lock(src->bs);
b7661ca5
JS
942 }
943 }
944
fa000f2f
VSO
945 if (backup) {
946 *backup = dest->bitmap;
947 dest->bitmap = hbitmap_alloc(dest->size, hbitmap_granularity(*backup));
948 ret = hbitmap_merge(*backup, src->bitmap, dest->bitmap);
949 } else {
950 ret = hbitmap_merge(dest->bitmap, src->bitmap, dest->bitmap);
951 }
fa000f2f 952
b7661ca5 953 if (lock) {
1e638301
VSO
954 bdrv_dirty_bitmaps_unlock(dest->bs);
955 if (src->bs != dest->bs) {
956 bdrv_dirty_bitmaps_unlock(src->bs);
b7661ca5 957 }
eff0829b 958 }
b7661ca5
JS
959
960 return ret;
b598e531 961}
This page took 0.406895 seconds and 4 git commands to generate.