1 /* 2 * Image mirroring 3 * 4 * Copyright Red Hat, Inc. 2012 5 * 6 * Authors: 7 * Paolo Bonzini <pbonzini@redhat.com> 8 * 9 * This work is licensed under the terms of the GNU LGPL, version 2 or later. 10 * See the COPYING.LIB file in the top-level directory. 11 * 12 */ 13 14 #include "qemu/osdep.h" 15 #include "trace.h" 16 #include "block/blockjob.h" 17 #include "block/block_int.h" 18 #include "sysemu/block-backend.h" 19 #include "qapi/error.h" 20 #include "qapi/qmp/qerror.h" 21 #include "qemu/ratelimit.h" 22 #include "qemu/bitmap.h" 23 #include "qemu/error-report.h" 24 25 #define SLICE_TIME 100000000ULL /* ns */ 26 #define MAX_IN_FLIGHT 16 27 #define DEFAULT_MIRROR_BUF_SIZE (10 << 20) 28 29 /* The mirroring buffer is a list of granularity-sized chunks. 30 * Free chunks are organized in a list. 31 */ 32 typedef struct MirrorBuffer { 33 QSIMPLEQ_ENTRY(MirrorBuffer) next; 34 } MirrorBuffer; 35 36 typedef struct MirrorBlockJob { 37 BlockJob common; 38 RateLimit limit; 39 BlockDriverState *target; 40 BlockDriverState *base; 41 /* The name of the graph node to replace */ 42 char *replaces; 43 /* The BDS to replace */ 44 BlockDriverState *to_replace; 45 /* Used to block operations on the drive-mirror-replace target */ 46 Error *replace_blocker; 47 bool is_none_mode; 48 BlockdevOnError on_source_error, on_target_error; 49 bool synced; 50 bool should_complete; 51 int64_t granularity; 52 size_t buf_size; 53 int64_t bdev_length; 54 unsigned long *cow_bitmap; 55 BdrvDirtyBitmap *dirty_bitmap; 56 HBitmapIter hbi; 57 uint8_t *buf; 58 QSIMPLEQ_HEAD(, MirrorBuffer) buf_free; 59 int buf_free_count; 60 61 unsigned long *in_flight_bitmap; 62 int in_flight; 63 int sectors_in_flight; 64 int ret; 65 bool unmap; 66 bool waiting_for_io; 67 int target_cluster_sectors; 68 int max_iov; 69 } MirrorBlockJob; 70 71 typedef struct MirrorOp { 72 MirrorBlockJob *s; 73 QEMUIOVector qiov; 74 int64_t sector_num; 75 int nb_sectors; 76 } MirrorOp; 77 78 static BlockErrorAction mirror_error_action(MirrorBlockJob *s, bool read, 79 int error) 80 { 81 s->synced = false; 82 if (read) { 83 return block_job_error_action(&s->common, s->common.bs, 84 s->on_source_error, true, error); 85 } else { 86 return block_job_error_action(&s->common, s->target, 87 s->on_target_error, false, error); 88 } 89 } 90 91 static void mirror_iteration_done(MirrorOp *op, int ret) 92 { 93 MirrorBlockJob *s = op->s; 94 struct iovec *iov; 95 int64_t chunk_num; 96 int i, nb_chunks, sectors_per_chunk; 97 98 trace_mirror_iteration_done(s, op->sector_num, op->nb_sectors, ret); 99 100 s->in_flight--; 101 s->sectors_in_flight -= op->nb_sectors; 102 iov = op->qiov.iov; 103 for (i = 0; i < op->qiov.niov; i++) { 104 MirrorBuffer *buf = (MirrorBuffer *) iov[i].iov_base; 105 QSIMPLEQ_INSERT_TAIL(&s->buf_free, buf, next); 106 s->buf_free_count++; 107 } 108 109 sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS; 110 chunk_num = op->sector_num / sectors_per_chunk; 111 nb_chunks = DIV_ROUND_UP(op->nb_sectors, sectors_per_chunk); 112 bitmap_clear(s->in_flight_bitmap, chunk_num, nb_chunks); 113 if (ret >= 0) { 114 if (s->cow_bitmap) { 115 bitmap_set(s->cow_bitmap, chunk_num, nb_chunks); 116 } 117 s->common.offset += (uint64_t)op->nb_sectors * BDRV_SECTOR_SIZE; 118 } 119 120 qemu_iovec_destroy(&op->qiov); 121 g_free(op); 122 123 if (s->waiting_for_io) { 124 qemu_coroutine_enter(s->common.co, NULL); 125 } 126 } 127 128 static void mirror_write_complete(void *opaque, int ret) 129 { 130 MirrorOp *op = opaque; 131 MirrorBlockJob *s = op->s; 132 if (ret < 0) { 133 BlockErrorAction action; 134 135 bdrv_set_dirty_bitmap(s->dirty_bitmap, op->sector_num, op->nb_sectors); 136 action = mirror_error_action(s, false, -ret); 137 if (action == BLOCK_ERROR_ACTION_REPORT && s->ret >= 0) { 138 s->ret = ret; 139 } 140 } 141 mirror_iteration_done(op, ret); 142 } 143 144 static void mirror_read_complete(void *opaque, int ret) 145 { 146 MirrorOp *op = opaque; 147 MirrorBlockJob *s = op->s; 148 if (ret < 0) { 149 BlockErrorAction action; 150 151 bdrv_set_dirty_bitmap(s->dirty_bitmap, op->sector_num, op->nb_sectors); 152 action = mirror_error_action(s, true, -ret); 153 if (action == BLOCK_ERROR_ACTION_REPORT && s->ret >= 0) { 154 s->ret = ret; 155 } 156 157 mirror_iteration_done(op, ret); 158 return; 159 } 160 bdrv_aio_writev(s->target, op->sector_num, &op->qiov, op->nb_sectors, 161 mirror_write_complete, op); 162 } 163 164 static inline void mirror_clip_sectors(MirrorBlockJob *s, 165 int64_t sector_num, 166 int *nb_sectors) 167 { 168 *nb_sectors = MIN(*nb_sectors, 169 s->bdev_length / BDRV_SECTOR_SIZE - sector_num); 170 } 171 172 /* Round sector_num and/or nb_sectors to target cluster if COW is needed, and 173 * return the offset of the adjusted tail sector against original. */ 174 static int mirror_cow_align(MirrorBlockJob *s, 175 int64_t *sector_num, 176 int *nb_sectors) 177 { 178 bool need_cow; 179 int ret = 0; 180 int chunk_sectors = s->granularity >> BDRV_SECTOR_BITS; 181 int64_t align_sector_num = *sector_num; 182 int align_nb_sectors = *nb_sectors; 183 int max_sectors = chunk_sectors * s->max_iov; 184 185 need_cow = !test_bit(*sector_num / chunk_sectors, s->cow_bitmap); 186 need_cow |= !test_bit((*sector_num + *nb_sectors - 1) / chunk_sectors, 187 s->cow_bitmap); 188 if (need_cow) { 189 bdrv_round_to_clusters(s->target, *sector_num, *nb_sectors, 190 &align_sector_num, &align_nb_sectors); 191 } 192 193 if (align_nb_sectors > max_sectors) { 194 align_nb_sectors = max_sectors; 195 if (need_cow) { 196 align_nb_sectors = QEMU_ALIGN_DOWN(align_nb_sectors, 197 s->target_cluster_sectors); 198 } 199 } 200 /* Clipping may result in align_nb_sectors unaligned to chunk boundary, but 201 * that doesn't matter because it's already the end of source image. */ 202 mirror_clip_sectors(s, align_sector_num, &align_nb_sectors); 203 204 ret = align_sector_num + align_nb_sectors - (*sector_num + *nb_sectors); 205 *sector_num = align_sector_num; 206 *nb_sectors = align_nb_sectors; 207 assert(ret >= 0); 208 return ret; 209 } 210 211 static inline void mirror_wait_for_io(MirrorBlockJob *s) 212 { 213 assert(!s->waiting_for_io); 214 s->waiting_for_io = true; 215 qemu_coroutine_yield(); 216 s->waiting_for_io = false; 217 } 218 219 /* Submit async read while handling COW. 220 * Returns: nb_sectors if no alignment is necessary, or 221 * (new_end - sector_num) if tail is rounded up or down due to 222 * alignment or buffer limit. 223 */ 224 static int mirror_do_read(MirrorBlockJob *s, int64_t sector_num, 225 int nb_sectors) 226 { 227 BlockDriverState *source = s->common.bs; 228 int sectors_per_chunk, nb_chunks; 229 int ret = nb_sectors; 230 MirrorOp *op; 231 232 sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS; 233 234 /* We can only handle as much as buf_size at a time. */ 235 nb_sectors = MIN(s->buf_size >> BDRV_SECTOR_BITS, nb_sectors); 236 assert(nb_sectors); 237 238 if (s->cow_bitmap) { 239 ret += mirror_cow_align(s, §or_num, &nb_sectors); 240 } 241 assert(nb_sectors << BDRV_SECTOR_BITS <= s->buf_size); 242 /* The sector range must meet granularity because: 243 * 1) Caller passes in aligned values; 244 * 2) mirror_cow_align is used only when target cluster is larger. */ 245 assert(!(sector_num % sectors_per_chunk)); 246 nb_chunks = DIV_ROUND_UP(nb_sectors, sectors_per_chunk); 247 248 while (s->buf_free_count < nb_chunks) { 249 trace_mirror_yield_in_flight(s, sector_num, s->in_flight); 250 mirror_wait_for_io(s); 251 } 252 253 /* Allocate a MirrorOp that is used as an AIO callback. */ 254 op = g_new(MirrorOp, 1); 255 op->s = s; 256 op->sector_num = sector_num; 257 op->nb_sectors = nb_sectors; 258 259 /* Now make a QEMUIOVector taking enough granularity-sized chunks 260 * from s->buf_free. 261 */ 262 qemu_iovec_init(&op->qiov, nb_chunks); 263 while (nb_chunks-- > 0) { 264 MirrorBuffer *buf = QSIMPLEQ_FIRST(&s->buf_free); 265 size_t remaining = nb_sectors * BDRV_SECTOR_SIZE - op->qiov.size; 266 267 QSIMPLEQ_REMOVE_HEAD(&s->buf_free, next); 268 s->buf_free_count--; 269 qemu_iovec_add(&op->qiov, buf, MIN(s->granularity, remaining)); 270 } 271 272 /* Copy the dirty cluster. */ 273 s->in_flight++; 274 s->sectors_in_flight += nb_sectors; 275 trace_mirror_one_iteration(s, sector_num, nb_sectors); 276 277 bdrv_aio_readv(source, sector_num, &op->qiov, nb_sectors, 278 mirror_read_complete, op); 279 return ret; 280 } 281 282 static void mirror_do_zero_or_discard(MirrorBlockJob *s, 283 int64_t sector_num, 284 int nb_sectors, 285 bool is_discard) 286 { 287 MirrorOp *op; 288 289 /* Allocate a MirrorOp that is used as an AIO callback. The qiov is zeroed 290 * so the freeing in mirror_iteration_done is nop. */ 291 op = g_new0(MirrorOp, 1); 292 op->s = s; 293 op->sector_num = sector_num; 294 op->nb_sectors = nb_sectors; 295 296 s->in_flight++; 297 s->sectors_in_flight += nb_sectors; 298 if (is_discard) { 299 bdrv_aio_discard(s->target, sector_num, op->nb_sectors, 300 mirror_write_complete, op); 301 } else { 302 bdrv_aio_write_zeroes(s->target, sector_num, op->nb_sectors, 303 s->unmap ? BDRV_REQ_MAY_UNMAP : 0, 304 mirror_write_complete, op); 305 } 306 } 307 308 static uint64_t coroutine_fn mirror_iteration(MirrorBlockJob *s) 309 { 310 BlockDriverState *source = s->common.bs; 311 int64_t sector_num, first_chunk; 312 uint64_t delay_ns = 0; 313 /* At least the first dirty chunk is mirrored in one iteration. */ 314 int nb_chunks = 1; 315 int64_t end = s->bdev_length / BDRV_SECTOR_SIZE; 316 int sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS; 317 318 sector_num = hbitmap_iter_next(&s->hbi); 319 if (sector_num < 0) { 320 bdrv_dirty_iter_init(s->dirty_bitmap, &s->hbi); 321 sector_num = hbitmap_iter_next(&s->hbi); 322 trace_mirror_restart_iter(s, bdrv_get_dirty_count(s->dirty_bitmap)); 323 assert(sector_num >= 0); 324 } 325 326 first_chunk = sector_num / sectors_per_chunk; 327 while (test_bit(first_chunk, s->in_flight_bitmap)) { 328 trace_mirror_yield_in_flight(s, first_chunk, s->in_flight); 329 mirror_wait_for_io(s); 330 } 331 332 /* Find the number of consective dirty chunks following the first dirty 333 * one, and wait for in flight requests in them. */ 334 while (nb_chunks * sectors_per_chunk < (s->buf_size >> BDRV_SECTOR_BITS)) { 335 int64_t hbitmap_next; 336 int64_t next_sector = sector_num + nb_chunks * sectors_per_chunk; 337 int64_t next_chunk = next_sector / sectors_per_chunk; 338 if (next_sector >= end || 339 !bdrv_get_dirty(source, s->dirty_bitmap, next_sector)) { 340 break; 341 } 342 if (test_bit(next_chunk, s->in_flight_bitmap)) { 343 break; 344 } 345 346 hbitmap_next = hbitmap_iter_next(&s->hbi); 347 if (hbitmap_next > next_sector || hbitmap_next < 0) { 348 /* The bitmap iterator's cache is stale, refresh it */ 349 bdrv_set_dirty_iter(&s->hbi, next_sector); 350 hbitmap_next = hbitmap_iter_next(&s->hbi); 351 } 352 assert(hbitmap_next == next_sector); 353 nb_chunks++; 354 } 355 356 /* Clear dirty bits before querying the block status, because 357 * calling bdrv_get_block_status_above could yield - if some blocks are 358 * marked dirty in this window, we need to know. 359 */ 360 bdrv_reset_dirty_bitmap(s->dirty_bitmap, sector_num, 361 nb_chunks * sectors_per_chunk); 362 bitmap_set(s->in_flight_bitmap, sector_num / sectors_per_chunk, nb_chunks); 363 while (nb_chunks > 0 && sector_num < end) { 364 int ret; 365 int io_sectors; 366 BlockDriverState *file; 367 enum MirrorMethod { 368 MIRROR_METHOD_COPY, 369 MIRROR_METHOD_ZERO, 370 MIRROR_METHOD_DISCARD 371 } mirror_method = MIRROR_METHOD_COPY; 372 373 assert(!(sector_num % sectors_per_chunk)); 374 ret = bdrv_get_block_status_above(source, NULL, sector_num, 375 nb_chunks * sectors_per_chunk, 376 &io_sectors, &file); 377 if (ret < 0) { 378 io_sectors = nb_chunks * sectors_per_chunk; 379 } 380 381 io_sectors -= io_sectors % sectors_per_chunk; 382 if (io_sectors < sectors_per_chunk) { 383 io_sectors = sectors_per_chunk; 384 } else if (ret >= 0 && !(ret & BDRV_BLOCK_DATA)) { 385 int64_t target_sector_num; 386 int target_nb_sectors; 387 bdrv_round_to_clusters(s->target, sector_num, io_sectors, 388 &target_sector_num, &target_nb_sectors); 389 if (target_sector_num == sector_num && 390 target_nb_sectors == io_sectors) { 391 mirror_method = ret & BDRV_BLOCK_ZERO ? 392 MIRROR_METHOD_ZERO : 393 MIRROR_METHOD_DISCARD; 394 } 395 } 396 397 mirror_clip_sectors(s, sector_num, &io_sectors); 398 switch (mirror_method) { 399 case MIRROR_METHOD_COPY: 400 io_sectors = mirror_do_read(s, sector_num, io_sectors); 401 break; 402 case MIRROR_METHOD_ZERO: 403 mirror_do_zero_or_discard(s, sector_num, io_sectors, false); 404 break; 405 case MIRROR_METHOD_DISCARD: 406 mirror_do_zero_or_discard(s, sector_num, io_sectors, true); 407 break; 408 default: 409 abort(); 410 } 411 assert(io_sectors); 412 sector_num += io_sectors; 413 nb_chunks -= DIV_ROUND_UP(io_sectors, sectors_per_chunk); 414 delay_ns += ratelimit_calculate_delay(&s->limit, io_sectors); 415 } 416 return delay_ns; 417 } 418 419 static void mirror_free_init(MirrorBlockJob *s) 420 { 421 int granularity = s->granularity; 422 size_t buf_size = s->buf_size; 423 uint8_t *buf = s->buf; 424 425 assert(s->buf_free_count == 0); 426 QSIMPLEQ_INIT(&s->buf_free); 427 while (buf_size != 0) { 428 MirrorBuffer *cur = (MirrorBuffer *)buf; 429 QSIMPLEQ_INSERT_TAIL(&s->buf_free, cur, next); 430 s->buf_free_count++; 431 buf_size -= granularity; 432 buf += granularity; 433 } 434 } 435 436 static void mirror_drain(MirrorBlockJob *s) 437 { 438 while (s->in_flight > 0) { 439 mirror_wait_for_io(s); 440 } 441 } 442 443 typedef struct { 444 int ret; 445 } MirrorExitData; 446 447 static void mirror_exit(BlockJob *job, void *opaque) 448 { 449 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common); 450 MirrorExitData *data = opaque; 451 AioContext *replace_aio_context = NULL; 452 BlockDriverState *src = s->common.bs; 453 454 /* Make sure that the source BDS doesn't go away before we called 455 * block_job_completed(). */ 456 bdrv_ref(src); 457 458 if (s->to_replace) { 459 replace_aio_context = bdrv_get_aio_context(s->to_replace); 460 aio_context_acquire(replace_aio_context); 461 } 462 463 if (s->should_complete && data->ret == 0) { 464 BlockDriverState *to_replace = s->common.bs; 465 if (s->to_replace) { 466 to_replace = s->to_replace; 467 } 468 469 /* This was checked in mirror_start_job(), but meanwhile one of the 470 * nodes could have been newly attached to a BlockBackend. */ 471 if (to_replace->blk && s->target->blk) { 472 error_report("block job: Can't create node with two BlockBackends"); 473 data->ret = -EINVAL; 474 goto out; 475 } 476 477 if (bdrv_get_flags(s->target) != bdrv_get_flags(to_replace)) { 478 bdrv_reopen(s->target, bdrv_get_flags(to_replace), NULL); 479 } 480 bdrv_replace_in_backing_chain(to_replace, s->target); 481 } 482 483 out: 484 if (s->to_replace) { 485 bdrv_op_unblock_all(s->to_replace, s->replace_blocker); 486 error_free(s->replace_blocker); 487 bdrv_unref(s->to_replace); 488 } 489 if (replace_aio_context) { 490 aio_context_release(replace_aio_context); 491 } 492 g_free(s->replaces); 493 bdrv_op_unblock_all(s->target, s->common.blocker); 494 bdrv_unref(s->target); 495 block_job_completed(&s->common, data->ret); 496 g_free(data); 497 bdrv_drained_end(src); 498 bdrv_unref(src); 499 } 500 501 static void coroutine_fn mirror_run(void *opaque) 502 { 503 MirrorBlockJob *s = opaque; 504 MirrorExitData *data; 505 BlockDriverState *bs = s->common.bs; 506 int64_t sector_num, end, length; 507 uint64_t last_pause_ns; 508 BlockDriverInfo bdi; 509 char backing_filename[2]; /* we only need 2 characters because we are only 510 checking for a NULL string */ 511 int ret = 0; 512 int n; 513 int target_cluster_size = BDRV_SECTOR_SIZE; 514 515 if (block_job_is_cancelled(&s->common)) { 516 goto immediate_exit; 517 } 518 519 s->bdev_length = bdrv_getlength(bs); 520 if (s->bdev_length < 0) { 521 ret = s->bdev_length; 522 goto immediate_exit; 523 } else if (s->bdev_length == 0) { 524 /* Report BLOCK_JOB_READY and wait for complete. */ 525 block_job_event_ready(&s->common); 526 s->synced = true; 527 while (!block_job_is_cancelled(&s->common) && !s->should_complete) { 528 block_job_yield(&s->common); 529 } 530 s->common.cancelled = false; 531 goto immediate_exit; 532 } 533 534 length = DIV_ROUND_UP(s->bdev_length, s->granularity); 535 s->in_flight_bitmap = bitmap_new(length); 536 537 /* If we have no backing file yet in the destination, we cannot let 538 * the destination do COW. Instead, we copy sectors around the 539 * dirty data if needed. We need a bitmap to do that. 540 */ 541 bdrv_get_backing_filename(s->target, backing_filename, 542 sizeof(backing_filename)); 543 if (!bdrv_get_info(s->target, &bdi) && bdi.cluster_size) { 544 target_cluster_size = bdi.cluster_size; 545 } 546 if (backing_filename[0] && !s->target->backing 547 && s->granularity < target_cluster_size) { 548 s->buf_size = MAX(s->buf_size, target_cluster_size); 549 s->cow_bitmap = bitmap_new(length); 550 } 551 s->target_cluster_sectors = target_cluster_size >> BDRV_SECTOR_BITS; 552 s->max_iov = MIN(s->common.bs->bl.max_iov, s->target->bl.max_iov); 553 554 end = s->bdev_length / BDRV_SECTOR_SIZE; 555 s->buf = qemu_try_blockalign(bs, s->buf_size); 556 if (s->buf == NULL) { 557 ret = -ENOMEM; 558 goto immediate_exit; 559 } 560 561 mirror_free_init(s); 562 563 last_pause_ns = qemu_clock_get_ns(QEMU_CLOCK_REALTIME); 564 if (!s->is_none_mode) { 565 /* First part, loop on the sectors and initialize the dirty bitmap. */ 566 BlockDriverState *base = s->base; 567 bool mark_all_dirty = s->base == NULL && !bdrv_has_zero_init(s->target); 568 569 for (sector_num = 0; sector_num < end; ) { 570 /* Just to make sure we are not exceeding int limit. */ 571 int nb_sectors = MIN(INT_MAX >> BDRV_SECTOR_BITS, 572 end - sector_num); 573 int64_t now = qemu_clock_get_ns(QEMU_CLOCK_REALTIME); 574 575 if (now - last_pause_ns > SLICE_TIME) { 576 last_pause_ns = now; 577 block_job_sleep_ns(&s->common, QEMU_CLOCK_REALTIME, 0); 578 } 579 580 if (block_job_is_cancelled(&s->common)) { 581 goto immediate_exit; 582 } 583 584 ret = bdrv_is_allocated_above(bs, base, sector_num, nb_sectors, &n); 585 586 if (ret < 0) { 587 goto immediate_exit; 588 } 589 590 assert(n > 0); 591 if (ret == 1 || mark_all_dirty) { 592 bdrv_set_dirty_bitmap(s->dirty_bitmap, sector_num, n); 593 } 594 sector_num += n; 595 } 596 } 597 598 bdrv_dirty_iter_init(s->dirty_bitmap, &s->hbi); 599 for (;;) { 600 uint64_t delay_ns = 0; 601 int64_t cnt; 602 bool should_complete; 603 604 if (s->ret < 0) { 605 ret = s->ret; 606 goto immediate_exit; 607 } 608 609 cnt = bdrv_get_dirty_count(s->dirty_bitmap); 610 /* s->common.offset contains the number of bytes already processed so 611 * far, cnt is the number of dirty sectors remaining and 612 * s->sectors_in_flight is the number of sectors currently being 613 * processed; together those are the current total operation length */ 614 s->common.len = s->common.offset + 615 (cnt + s->sectors_in_flight) * BDRV_SECTOR_SIZE; 616 617 /* Note that even when no rate limit is applied we need to yield 618 * periodically with no pending I/O so that bdrv_drain_all() returns. 619 * We do so every SLICE_TIME nanoseconds, or when there is an error, 620 * or when the source is clean, whichever comes first. 621 */ 622 if (qemu_clock_get_ns(QEMU_CLOCK_REALTIME) - last_pause_ns < SLICE_TIME && 623 s->common.iostatus == BLOCK_DEVICE_IO_STATUS_OK) { 624 if (s->in_flight == MAX_IN_FLIGHT || s->buf_free_count == 0 || 625 (cnt == 0 && s->in_flight > 0)) { 626 trace_mirror_yield(s, s->in_flight, s->buf_free_count, cnt); 627 mirror_wait_for_io(s); 628 continue; 629 } else if (cnt != 0) { 630 delay_ns = mirror_iteration(s); 631 } 632 } 633 634 should_complete = false; 635 if (s->in_flight == 0 && cnt == 0) { 636 trace_mirror_before_flush(s); 637 ret = bdrv_flush(s->target); 638 if (ret < 0) { 639 if (mirror_error_action(s, false, -ret) == 640 BLOCK_ERROR_ACTION_REPORT) { 641 goto immediate_exit; 642 } 643 } else { 644 /* We're out of the streaming phase. From now on, if the job 645 * is cancelled we will actually complete all pending I/O and 646 * report completion. This way, block-job-cancel will leave 647 * the target in a consistent state. 648 */ 649 if (!s->synced) { 650 block_job_event_ready(&s->common); 651 s->synced = true; 652 } 653 654 should_complete = s->should_complete || 655 block_job_is_cancelled(&s->common); 656 cnt = bdrv_get_dirty_count(s->dirty_bitmap); 657 } 658 } 659 660 if (cnt == 0 && should_complete) { 661 /* The dirty bitmap is not updated while operations are pending. 662 * If we're about to exit, wait for pending operations before 663 * calling bdrv_get_dirty_count(bs), or we may exit while the 664 * source has dirty data to copy! 665 * 666 * Note that I/O can be submitted by the guest while 667 * mirror_populate runs. 668 */ 669 trace_mirror_before_drain(s, cnt); 670 bdrv_co_drain(bs); 671 cnt = bdrv_get_dirty_count(s->dirty_bitmap); 672 } 673 674 ret = 0; 675 trace_mirror_before_sleep(s, cnt, s->synced, delay_ns); 676 if (!s->synced) { 677 block_job_sleep_ns(&s->common, QEMU_CLOCK_REALTIME, delay_ns); 678 if (block_job_is_cancelled(&s->common)) { 679 break; 680 } 681 } else if (!should_complete) { 682 delay_ns = (s->in_flight == 0 && cnt == 0 ? SLICE_TIME : 0); 683 block_job_sleep_ns(&s->common, QEMU_CLOCK_REALTIME, delay_ns); 684 } else if (cnt == 0) { 685 /* The two disks are in sync. Exit and report successful 686 * completion. 687 */ 688 assert(QLIST_EMPTY(&bs->tracked_requests)); 689 s->common.cancelled = false; 690 break; 691 } 692 last_pause_ns = qemu_clock_get_ns(QEMU_CLOCK_REALTIME); 693 } 694 695 immediate_exit: 696 if (s->in_flight > 0) { 697 /* We get here only if something went wrong. Either the job failed, 698 * or it was cancelled prematurely so that we do not guarantee that 699 * the target is a copy of the source. 700 */ 701 assert(ret < 0 || (!s->synced && block_job_is_cancelled(&s->common))); 702 mirror_drain(s); 703 } 704 705 assert(s->in_flight == 0); 706 qemu_vfree(s->buf); 707 g_free(s->cow_bitmap); 708 g_free(s->in_flight_bitmap); 709 bdrv_release_dirty_bitmap(bs, s->dirty_bitmap); 710 if (s->target->blk) { 711 blk_iostatus_disable(s->target->blk); 712 } 713 714 data = g_malloc(sizeof(*data)); 715 data->ret = ret; 716 /* Before we switch to target in mirror_exit, make sure data doesn't 717 * change. */ 718 bdrv_drained_begin(s->common.bs); 719 block_job_defer_to_main_loop(&s->common, mirror_exit, data); 720 } 721 722 static void mirror_set_speed(BlockJob *job, int64_t speed, Error **errp) 723 { 724 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common); 725 726 if (speed < 0) { 727 error_setg(errp, QERR_INVALID_PARAMETER, "speed"); 728 return; 729 } 730 ratelimit_set_speed(&s->limit, speed / BDRV_SECTOR_SIZE, SLICE_TIME); 731 } 732 733 static void mirror_iostatus_reset(BlockJob *job) 734 { 735 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common); 736 737 if (s->target->blk) { 738 blk_iostatus_reset(s->target->blk); 739 } 740 } 741 742 static void mirror_complete(BlockJob *job, Error **errp) 743 { 744 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common); 745 Error *local_err = NULL; 746 int ret; 747 748 ret = bdrv_open_backing_file(s->target, NULL, "backing", &local_err); 749 if (ret < 0) { 750 error_propagate(errp, local_err); 751 return; 752 } 753 if (!s->synced) { 754 error_setg(errp, QERR_BLOCK_JOB_NOT_READY, job->id); 755 return; 756 } 757 758 /* check the target bs is not blocked and block all operations on it */ 759 if (s->replaces) { 760 AioContext *replace_aio_context; 761 762 s->to_replace = bdrv_find_node(s->replaces); 763 if (!s->to_replace) { 764 error_setg(errp, "Node name '%s' not found", s->replaces); 765 return; 766 } 767 768 replace_aio_context = bdrv_get_aio_context(s->to_replace); 769 aio_context_acquire(replace_aio_context); 770 771 error_setg(&s->replace_blocker, 772 "block device is in use by block-job-complete"); 773 bdrv_op_block_all(s->to_replace, s->replace_blocker); 774 bdrv_ref(s->to_replace); 775 776 aio_context_release(replace_aio_context); 777 } 778 779 s->should_complete = true; 780 block_job_enter(&s->common); 781 } 782 783 static const BlockJobDriver mirror_job_driver = { 784 .instance_size = sizeof(MirrorBlockJob), 785 .job_type = BLOCK_JOB_TYPE_MIRROR, 786 .set_speed = mirror_set_speed, 787 .iostatus_reset= mirror_iostatus_reset, 788 .complete = mirror_complete, 789 }; 790 791 static const BlockJobDriver commit_active_job_driver = { 792 .instance_size = sizeof(MirrorBlockJob), 793 .job_type = BLOCK_JOB_TYPE_COMMIT, 794 .set_speed = mirror_set_speed, 795 .iostatus_reset 796 = mirror_iostatus_reset, 797 .complete = mirror_complete, 798 }; 799 800 static void mirror_start_job(BlockDriverState *bs, BlockDriverState *target, 801 const char *replaces, 802 int64_t speed, uint32_t granularity, 803 int64_t buf_size, 804 BlockdevOnError on_source_error, 805 BlockdevOnError on_target_error, 806 bool unmap, 807 BlockCompletionFunc *cb, 808 void *opaque, Error **errp, 809 const BlockJobDriver *driver, 810 bool is_none_mode, BlockDriverState *base) 811 { 812 MirrorBlockJob *s; 813 BlockDriverState *replaced_bs; 814 815 if (granularity == 0) { 816 granularity = bdrv_get_default_bitmap_granularity(target); 817 } 818 819 assert ((granularity & (granularity - 1)) == 0); 820 821 if ((on_source_error == BLOCKDEV_ON_ERROR_STOP || 822 on_source_error == BLOCKDEV_ON_ERROR_ENOSPC) && 823 (!bs->blk || !blk_iostatus_is_enabled(bs->blk))) { 824 error_setg(errp, QERR_INVALID_PARAMETER, "on-source-error"); 825 return; 826 } 827 828 if (buf_size < 0) { 829 error_setg(errp, "Invalid parameter 'buf-size'"); 830 return; 831 } 832 833 if (buf_size == 0) { 834 buf_size = DEFAULT_MIRROR_BUF_SIZE; 835 } 836 837 /* We can't support this case as long as the block layer can't handle 838 * multiple BlockBackends per BlockDriverState. */ 839 if (replaces) { 840 replaced_bs = bdrv_lookup_bs(replaces, replaces, errp); 841 if (replaced_bs == NULL) { 842 return; 843 } 844 } else { 845 replaced_bs = bs; 846 } 847 if (replaced_bs->blk && target->blk) { 848 error_setg(errp, "Can't create node with two BlockBackends"); 849 return; 850 } 851 852 s = block_job_create(driver, bs, speed, cb, opaque, errp); 853 if (!s) { 854 return; 855 } 856 857 s->replaces = g_strdup(replaces); 858 s->on_source_error = on_source_error; 859 s->on_target_error = on_target_error; 860 s->target = target; 861 s->is_none_mode = is_none_mode; 862 s->base = base; 863 s->granularity = granularity; 864 s->buf_size = ROUND_UP(buf_size, granularity); 865 s->unmap = unmap; 866 867 s->dirty_bitmap = bdrv_create_dirty_bitmap(bs, granularity, NULL, errp); 868 if (!s->dirty_bitmap) { 869 g_free(s->replaces); 870 block_job_unref(&s->common); 871 return; 872 } 873 874 bdrv_op_block_all(s->target, s->common.blocker); 875 876 if (s->target->blk) { 877 blk_set_on_error(s->target->blk, on_target_error, on_target_error); 878 blk_iostatus_enable(s->target->blk); 879 } 880 s->common.co = qemu_coroutine_create(mirror_run); 881 trace_mirror_start(bs, s, s->common.co, opaque); 882 qemu_coroutine_enter(s->common.co, s); 883 } 884 885 void mirror_start(BlockDriverState *bs, BlockDriverState *target, 886 const char *replaces, 887 int64_t speed, uint32_t granularity, int64_t buf_size, 888 MirrorSyncMode mode, BlockdevOnError on_source_error, 889 BlockdevOnError on_target_error, 890 bool unmap, 891 BlockCompletionFunc *cb, 892 void *opaque, Error **errp) 893 { 894 bool is_none_mode; 895 BlockDriverState *base; 896 897 if (mode == MIRROR_SYNC_MODE_INCREMENTAL) { 898 error_setg(errp, "Sync mode 'incremental' not supported"); 899 return; 900 } 901 is_none_mode = mode == MIRROR_SYNC_MODE_NONE; 902 base = mode == MIRROR_SYNC_MODE_TOP ? backing_bs(bs) : NULL; 903 mirror_start_job(bs, target, replaces, 904 speed, granularity, buf_size, 905 on_source_error, on_target_error, unmap, cb, opaque, errp, 906 &mirror_job_driver, is_none_mode, base); 907 } 908 909 void commit_active_start(BlockDriverState *bs, BlockDriverState *base, 910 int64_t speed, 911 BlockdevOnError on_error, 912 BlockCompletionFunc *cb, 913 void *opaque, Error **errp) 914 { 915 int64_t length, base_length; 916 int orig_base_flags; 917 int ret; 918 Error *local_err = NULL; 919 920 orig_base_flags = bdrv_get_flags(base); 921 922 if (bdrv_reopen(base, bs->open_flags, errp)) { 923 return; 924 } 925 926 length = bdrv_getlength(bs); 927 if (length < 0) { 928 error_setg_errno(errp, -length, 929 "Unable to determine length of %s", bs->filename); 930 goto error_restore_flags; 931 } 932 933 base_length = bdrv_getlength(base); 934 if (base_length < 0) { 935 error_setg_errno(errp, -base_length, 936 "Unable to determine length of %s", base->filename); 937 goto error_restore_flags; 938 } 939 940 if (length > base_length) { 941 ret = bdrv_truncate(base, length); 942 if (ret < 0) { 943 error_setg_errno(errp, -ret, 944 "Top image %s is larger than base image %s, and " 945 "resize of base image failed", 946 bs->filename, base->filename); 947 goto error_restore_flags; 948 } 949 } 950 951 bdrv_ref(base); 952 mirror_start_job(bs, base, NULL, speed, 0, 0, 953 on_error, on_error, false, cb, opaque, &local_err, 954 &commit_active_job_driver, false, base); 955 if (local_err) { 956 error_propagate(errp, local_err); 957 goto error_restore_flags; 958 } 959 960 return; 961 962 error_restore_flags: 963 /* ignore error and errp for bdrv_reopen, because we want to propagate 964 * the original error */ 965 bdrv_reopen(base, orig_base_flags, NULL); 966 return; 967 } 968