]> git.proxmox.com Git - mirror_qemu.git/blob - block/mirror.c
block/mirror: Improve progress report
[mirror_qemu.git] / block / mirror.c
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 "trace.h"
15 #include "block/blockjob.h"
16 #include "block/block_int.h"
17 #include "qemu/ratelimit.h"
18 #include "qemu/bitmap.h"
19
20 #define SLICE_TIME 100000000ULL /* ns */
21 #define MAX_IN_FLIGHT 16
22
23 /* The mirroring buffer is a list of granularity-sized chunks.
24 * Free chunks are organized in a list.
25 */
26 typedef struct MirrorBuffer {
27 QSIMPLEQ_ENTRY(MirrorBuffer) next;
28 } MirrorBuffer;
29
30 typedef struct MirrorBlockJob {
31 BlockJob common;
32 RateLimit limit;
33 BlockDriverState *target;
34 BlockDriverState *base;
35 /* The name of the graph node to replace */
36 char *replaces;
37 /* The BDS to replace */
38 BlockDriverState *to_replace;
39 /* Used to block operations on the drive-mirror-replace target */
40 Error *replace_blocker;
41 bool is_none_mode;
42 BlockdevOnError on_source_error, on_target_error;
43 bool synced;
44 bool should_complete;
45 int64_t sector_num;
46 int64_t granularity;
47 size_t buf_size;
48 int64_t bdev_length;
49 unsigned long *cow_bitmap;
50 BdrvDirtyBitmap *dirty_bitmap;
51 HBitmapIter hbi;
52 uint8_t *buf;
53 QSIMPLEQ_HEAD(, MirrorBuffer) buf_free;
54 int buf_free_count;
55
56 unsigned long *in_flight_bitmap;
57 int in_flight;
58 int sectors_in_flight;
59 int ret;
60 } MirrorBlockJob;
61
62 typedef struct MirrorOp {
63 MirrorBlockJob *s;
64 QEMUIOVector qiov;
65 int64_t sector_num;
66 int nb_sectors;
67 } MirrorOp;
68
69 static BlockErrorAction mirror_error_action(MirrorBlockJob *s, bool read,
70 int error)
71 {
72 s->synced = false;
73 if (read) {
74 return block_job_error_action(&s->common, s->common.bs,
75 s->on_source_error, true, error);
76 } else {
77 return block_job_error_action(&s->common, s->target,
78 s->on_target_error, false, error);
79 }
80 }
81
82 static void mirror_iteration_done(MirrorOp *op, int ret)
83 {
84 MirrorBlockJob *s = op->s;
85 struct iovec *iov;
86 int64_t chunk_num;
87 int i, nb_chunks, sectors_per_chunk;
88
89 trace_mirror_iteration_done(s, op->sector_num, op->nb_sectors, ret);
90
91 s->in_flight--;
92 s->sectors_in_flight -= op->nb_sectors;
93 iov = op->qiov.iov;
94 for (i = 0; i < op->qiov.niov; i++) {
95 MirrorBuffer *buf = (MirrorBuffer *) iov[i].iov_base;
96 QSIMPLEQ_INSERT_TAIL(&s->buf_free, buf, next);
97 s->buf_free_count++;
98 }
99
100 sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS;
101 chunk_num = op->sector_num / sectors_per_chunk;
102 nb_chunks = op->nb_sectors / sectors_per_chunk;
103 bitmap_clear(s->in_flight_bitmap, chunk_num, nb_chunks);
104 if (ret >= 0) {
105 if (s->cow_bitmap) {
106 bitmap_set(s->cow_bitmap, chunk_num, nb_chunks);
107 }
108 s->common.offset += (uint64_t)op->nb_sectors * BDRV_SECTOR_SIZE;
109 }
110
111 qemu_iovec_destroy(&op->qiov);
112 g_slice_free(MirrorOp, op);
113
114 /* Enter coroutine when it is not sleeping. The coroutine sleeps to
115 * rate-limit itself. The coroutine will eventually resume since there is
116 * a sleep timeout so don't wake it early.
117 */
118 if (s->common.busy) {
119 qemu_coroutine_enter(s->common.co, NULL);
120 }
121 }
122
123 static void mirror_write_complete(void *opaque, int ret)
124 {
125 MirrorOp *op = opaque;
126 MirrorBlockJob *s = op->s;
127 if (ret < 0) {
128 BlockDriverState *source = s->common.bs;
129 BlockErrorAction action;
130
131 bdrv_set_dirty(source, op->sector_num, op->nb_sectors);
132 action = mirror_error_action(s, false, -ret);
133 if (action == BLOCK_ERROR_ACTION_REPORT && s->ret >= 0) {
134 s->ret = ret;
135 }
136 }
137 mirror_iteration_done(op, ret);
138 }
139
140 static void mirror_read_complete(void *opaque, int ret)
141 {
142 MirrorOp *op = opaque;
143 MirrorBlockJob *s = op->s;
144 if (ret < 0) {
145 BlockDriverState *source = s->common.bs;
146 BlockErrorAction action;
147
148 bdrv_set_dirty(source, op->sector_num, op->nb_sectors);
149 action = mirror_error_action(s, true, -ret);
150 if (action == BLOCK_ERROR_ACTION_REPORT && s->ret >= 0) {
151 s->ret = ret;
152 }
153
154 mirror_iteration_done(op, ret);
155 return;
156 }
157 bdrv_aio_writev(s->target, op->sector_num, &op->qiov, op->nb_sectors,
158 mirror_write_complete, op);
159 }
160
161 static uint64_t coroutine_fn mirror_iteration(MirrorBlockJob *s)
162 {
163 BlockDriverState *source = s->common.bs;
164 int nb_sectors, sectors_per_chunk, nb_chunks;
165 int64_t end, sector_num, next_chunk, next_sector, hbitmap_next_sector;
166 uint64_t delay_ns = 0;
167 MirrorOp *op;
168
169 s->sector_num = hbitmap_iter_next(&s->hbi);
170 if (s->sector_num < 0) {
171 bdrv_dirty_iter_init(source, s->dirty_bitmap, &s->hbi);
172 s->sector_num = hbitmap_iter_next(&s->hbi);
173 trace_mirror_restart_iter(s,
174 bdrv_get_dirty_count(source, s->dirty_bitmap));
175 assert(s->sector_num >= 0);
176 }
177
178 hbitmap_next_sector = s->sector_num;
179 sector_num = s->sector_num;
180 sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS;
181 end = s->bdev_length / BDRV_SECTOR_SIZE;
182
183 /* Extend the QEMUIOVector to include all adjacent blocks that will
184 * be copied in this operation.
185 *
186 * We have to do this if we have no backing file yet in the destination,
187 * and the cluster size is very large. Then we need to do COW ourselves.
188 * The first time a cluster is copied, copy it entirely. Note that,
189 * because both the granularity and the cluster size are powers of two,
190 * the number of sectors to copy cannot exceed one cluster.
191 *
192 * We also want to extend the QEMUIOVector to include more adjacent
193 * dirty blocks if possible, to limit the number of I/O operations and
194 * run efficiently even with a small granularity.
195 */
196 nb_chunks = 0;
197 nb_sectors = 0;
198 next_sector = sector_num;
199 next_chunk = sector_num / sectors_per_chunk;
200
201 /* Wait for I/O to this cluster (from a previous iteration) to be done. */
202 while (test_bit(next_chunk, s->in_flight_bitmap)) {
203 trace_mirror_yield_in_flight(s, sector_num, s->in_flight);
204 qemu_coroutine_yield();
205 }
206
207 do {
208 int added_sectors, added_chunks;
209
210 if (!bdrv_get_dirty(source, s->dirty_bitmap, next_sector) ||
211 test_bit(next_chunk, s->in_flight_bitmap)) {
212 assert(nb_sectors > 0);
213 break;
214 }
215
216 added_sectors = sectors_per_chunk;
217 if (s->cow_bitmap && !test_bit(next_chunk, s->cow_bitmap)) {
218 bdrv_round_to_clusters(s->target,
219 next_sector, added_sectors,
220 &next_sector, &added_sectors);
221
222 /* On the first iteration, the rounding may make us copy
223 * sectors before the first dirty one.
224 */
225 if (next_sector < sector_num) {
226 assert(nb_sectors == 0);
227 sector_num = next_sector;
228 next_chunk = next_sector / sectors_per_chunk;
229 }
230 }
231
232 added_sectors = MIN(added_sectors, end - (sector_num + nb_sectors));
233 added_chunks = (added_sectors + sectors_per_chunk - 1) / sectors_per_chunk;
234
235 /* When doing COW, it may happen that there is not enough space for
236 * a full cluster. Wait if that is the case.
237 */
238 while (nb_chunks == 0 && s->buf_free_count < added_chunks) {
239 trace_mirror_yield_buf_busy(s, nb_chunks, s->in_flight);
240 qemu_coroutine_yield();
241 }
242 if (s->buf_free_count < nb_chunks + added_chunks) {
243 trace_mirror_break_buf_busy(s, nb_chunks, s->in_flight);
244 break;
245 }
246
247 /* We have enough free space to copy these sectors. */
248 bitmap_set(s->in_flight_bitmap, next_chunk, added_chunks);
249
250 nb_sectors += added_sectors;
251 nb_chunks += added_chunks;
252 next_sector += added_sectors;
253 next_chunk += added_chunks;
254 if (!s->synced && s->common.speed) {
255 delay_ns = ratelimit_calculate_delay(&s->limit, added_sectors);
256 }
257 } while (delay_ns == 0 && next_sector < end);
258
259 /* Allocate a MirrorOp that is used as an AIO callback. */
260 op = g_slice_new(MirrorOp);
261 op->s = s;
262 op->sector_num = sector_num;
263 op->nb_sectors = nb_sectors;
264
265 /* Now make a QEMUIOVector taking enough granularity-sized chunks
266 * from s->buf_free.
267 */
268 qemu_iovec_init(&op->qiov, nb_chunks);
269 next_sector = sector_num;
270 while (nb_chunks-- > 0) {
271 MirrorBuffer *buf = QSIMPLEQ_FIRST(&s->buf_free);
272 size_t remaining = (nb_sectors * BDRV_SECTOR_SIZE) - op->qiov.size;
273
274 QSIMPLEQ_REMOVE_HEAD(&s->buf_free, next);
275 s->buf_free_count--;
276 qemu_iovec_add(&op->qiov, buf, MIN(s->granularity, remaining));
277
278 /* Advance the HBitmapIter in parallel, so that we do not examine
279 * the same sector twice.
280 */
281 if (next_sector > hbitmap_next_sector
282 && bdrv_get_dirty(source, s->dirty_bitmap, next_sector)) {
283 hbitmap_next_sector = hbitmap_iter_next(&s->hbi);
284 }
285
286 next_sector += sectors_per_chunk;
287 }
288
289 bdrv_reset_dirty(source, sector_num, nb_sectors);
290
291 /* Copy the dirty cluster. */
292 s->in_flight++;
293 s->sectors_in_flight += nb_sectors;
294 trace_mirror_one_iteration(s, sector_num, nb_sectors);
295 bdrv_aio_readv(source, sector_num, &op->qiov, nb_sectors,
296 mirror_read_complete, op);
297 return delay_ns;
298 }
299
300 static void mirror_free_init(MirrorBlockJob *s)
301 {
302 int granularity = s->granularity;
303 size_t buf_size = s->buf_size;
304 uint8_t *buf = s->buf;
305
306 assert(s->buf_free_count == 0);
307 QSIMPLEQ_INIT(&s->buf_free);
308 while (buf_size != 0) {
309 MirrorBuffer *cur = (MirrorBuffer *)buf;
310 QSIMPLEQ_INSERT_TAIL(&s->buf_free, cur, next);
311 s->buf_free_count++;
312 buf_size -= granularity;
313 buf += granularity;
314 }
315 }
316
317 static void mirror_drain(MirrorBlockJob *s)
318 {
319 while (s->in_flight > 0) {
320 qemu_coroutine_yield();
321 }
322 }
323
324 static void coroutine_fn mirror_run(void *opaque)
325 {
326 MirrorBlockJob *s = opaque;
327 BlockDriverState *bs = s->common.bs;
328 int64_t sector_num, end, sectors_per_chunk, length;
329 uint64_t last_pause_ns;
330 BlockDriverInfo bdi;
331 char backing_filename[1024];
332 int ret = 0;
333 int n;
334
335 if (block_job_is_cancelled(&s->common)) {
336 goto immediate_exit;
337 }
338
339 s->bdev_length = bdrv_getlength(bs);
340 if (s->bdev_length < 0) {
341 ret = s->bdev_length;
342 goto immediate_exit;
343 } else if (s->bdev_length == 0) {
344 /* Report BLOCK_JOB_READY and wait for complete. */
345 block_job_event_ready(&s->common);
346 s->synced = true;
347 while (!block_job_is_cancelled(&s->common) && !s->should_complete) {
348 block_job_yield(&s->common);
349 }
350 s->common.cancelled = false;
351 goto immediate_exit;
352 }
353
354 length = DIV_ROUND_UP(s->bdev_length, s->granularity);
355 s->in_flight_bitmap = bitmap_new(length);
356
357 /* If we have no backing file yet in the destination, we cannot let
358 * the destination do COW. Instead, we copy sectors around the
359 * dirty data if needed. We need a bitmap to do that.
360 */
361 bdrv_get_backing_filename(s->target, backing_filename,
362 sizeof(backing_filename));
363 if (backing_filename[0] && !s->target->backing_hd) {
364 ret = bdrv_get_info(s->target, &bdi);
365 if (ret < 0) {
366 goto immediate_exit;
367 }
368 if (s->granularity < bdi.cluster_size) {
369 s->buf_size = MAX(s->buf_size, bdi.cluster_size);
370 s->cow_bitmap = bitmap_new(length);
371 }
372 }
373
374 end = s->bdev_length / BDRV_SECTOR_SIZE;
375 s->buf = qemu_try_blockalign(bs, s->buf_size);
376 if (s->buf == NULL) {
377 ret = -ENOMEM;
378 goto immediate_exit;
379 }
380
381 sectors_per_chunk = s->granularity >> BDRV_SECTOR_BITS;
382 mirror_free_init(s);
383
384 if (!s->is_none_mode) {
385 /* First part, loop on the sectors and initialize the dirty bitmap. */
386 BlockDriverState *base = s->base;
387 for (sector_num = 0; sector_num < end; ) {
388 int64_t next = (sector_num | (sectors_per_chunk - 1)) + 1;
389 ret = bdrv_is_allocated_above(bs, base,
390 sector_num, next - sector_num, &n);
391
392 if (ret < 0) {
393 goto immediate_exit;
394 }
395
396 assert(n > 0);
397 if (ret == 1) {
398 bdrv_set_dirty(bs, sector_num, n);
399 sector_num = next;
400 } else {
401 sector_num += n;
402 }
403 }
404 }
405
406 bdrv_dirty_iter_init(bs, s->dirty_bitmap, &s->hbi);
407 last_pause_ns = qemu_clock_get_ns(QEMU_CLOCK_REALTIME);
408 for (;;) {
409 uint64_t delay_ns = 0;
410 int64_t cnt;
411 bool should_complete;
412
413 if (s->ret < 0) {
414 ret = s->ret;
415 goto immediate_exit;
416 }
417
418 cnt = bdrv_get_dirty_count(bs, s->dirty_bitmap);
419 /* s->common.offset contains the number of bytes already processed so
420 * far, cnt is the number of dirty sectors remaining and
421 * s->sectors_in_flight is the number of sectors currently being
422 * processed; together those are the current total operation length */
423 s->common.len = s->common.offset +
424 (cnt + s->sectors_in_flight) * BDRV_SECTOR_SIZE;
425
426 /* Note that even when no rate limit is applied we need to yield
427 * periodically with no pending I/O so that qemu_aio_flush() returns.
428 * We do so every SLICE_TIME nanoseconds, or when there is an error,
429 * or when the source is clean, whichever comes first.
430 */
431 if (qemu_clock_get_ns(QEMU_CLOCK_REALTIME) - last_pause_ns < SLICE_TIME &&
432 s->common.iostatus == BLOCK_DEVICE_IO_STATUS_OK) {
433 if (s->in_flight == MAX_IN_FLIGHT || s->buf_free_count == 0 ||
434 (cnt == 0 && s->in_flight > 0)) {
435 trace_mirror_yield(s, s->in_flight, s->buf_free_count, cnt);
436 qemu_coroutine_yield();
437 continue;
438 } else if (cnt != 0) {
439 delay_ns = mirror_iteration(s);
440 if (delay_ns == 0) {
441 continue;
442 }
443 }
444 }
445
446 should_complete = false;
447 if (s->in_flight == 0 && cnt == 0) {
448 trace_mirror_before_flush(s);
449 ret = bdrv_flush(s->target);
450 if (ret < 0) {
451 if (mirror_error_action(s, false, -ret) ==
452 BLOCK_ERROR_ACTION_REPORT) {
453 goto immediate_exit;
454 }
455 } else {
456 /* We're out of the streaming phase. From now on, if the job
457 * is cancelled we will actually complete all pending I/O and
458 * report completion. This way, block-job-cancel will leave
459 * the target in a consistent state.
460 */
461 if (!s->synced) {
462 block_job_event_ready(&s->common);
463 s->synced = true;
464 }
465
466 should_complete = s->should_complete ||
467 block_job_is_cancelled(&s->common);
468 cnt = bdrv_get_dirty_count(bs, s->dirty_bitmap);
469 }
470 }
471
472 if (cnt == 0 && should_complete) {
473 /* The dirty bitmap is not updated while operations are pending.
474 * If we're about to exit, wait for pending operations before
475 * calling bdrv_get_dirty_count(bs), or we may exit while the
476 * source has dirty data to copy!
477 *
478 * Note that I/O can be submitted by the guest while
479 * mirror_populate runs.
480 */
481 trace_mirror_before_drain(s, cnt);
482 bdrv_drain_all();
483 cnt = bdrv_get_dirty_count(bs, s->dirty_bitmap);
484 }
485
486 ret = 0;
487 trace_mirror_before_sleep(s, cnt, s->synced, delay_ns);
488 if (!s->synced) {
489 block_job_sleep_ns(&s->common, QEMU_CLOCK_REALTIME, delay_ns);
490 if (block_job_is_cancelled(&s->common)) {
491 break;
492 }
493 } else if (!should_complete) {
494 delay_ns = (s->in_flight == 0 && cnt == 0 ? SLICE_TIME : 0);
495 block_job_sleep_ns(&s->common, QEMU_CLOCK_REALTIME, delay_ns);
496 } else if (cnt == 0) {
497 /* The two disks are in sync. Exit and report successful
498 * completion.
499 */
500 assert(QLIST_EMPTY(&bs->tracked_requests));
501 s->common.cancelled = false;
502 break;
503 }
504 last_pause_ns = qemu_clock_get_ns(QEMU_CLOCK_REALTIME);
505 }
506
507 immediate_exit:
508 if (s->in_flight > 0) {
509 /* We get here only if something went wrong. Either the job failed,
510 * or it was cancelled prematurely so that we do not guarantee that
511 * the target is a copy of the source.
512 */
513 assert(ret < 0 || (!s->synced && block_job_is_cancelled(&s->common)));
514 mirror_drain(s);
515 }
516
517 assert(s->in_flight == 0);
518 qemu_vfree(s->buf);
519 g_free(s->cow_bitmap);
520 g_free(s->in_flight_bitmap);
521 bdrv_release_dirty_bitmap(bs, s->dirty_bitmap);
522 bdrv_iostatus_disable(s->target);
523 if (s->should_complete && ret == 0) {
524 BlockDriverState *to_replace = s->common.bs;
525 if (s->to_replace) {
526 to_replace = s->to_replace;
527 }
528 if (bdrv_get_flags(s->target) != bdrv_get_flags(to_replace)) {
529 bdrv_reopen(s->target, bdrv_get_flags(to_replace), NULL);
530 }
531 bdrv_swap(s->target, to_replace);
532 if (s->common.driver->job_type == BLOCK_JOB_TYPE_COMMIT) {
533 /* drop the bs loop chain formed by the swap: break the loop then
534 * trigger the unref from the top one */
535 BlockDriverState *p = s->base->backing_hd;
536 bdrv_set_backing_hd(s->base, NULL);
537 bdrv_unref(p);
538 }
539 }
540 if (s->to_replace) {
541 bdrv_op_unblock_all(s->to_replace, s->replace_blocker);
542 error_free(s->replace_blocker);
543 bdrv_unref(s->to_replace);
544 }
545 g_free(s->replaces);
546 bdrv_unref(s->target);
547 block_job_completed(&s->common, ret);
548 }
549
550 static void mirror_set_speed(BlockJob *job, int64_t speed, Error **errp)
551 {
552 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common);
553
554 if (speed < 0) {
555 error_set(errp, QERR_INVALID_PARAMETER, "speed");
556 return;
557 }
558 ratelimit_set_speed(&s->limit, speed / BDRV_SECTOR_SIZE, SLICE_TIME);
559 }
560
561 static void mirror_iostatus_reset(BlockJob *job)
562 {
563 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common);
564
565 bdrv_iostatus_reset(s->target);
566 }
567
568 static void mirror_complete(BlockJob *job, Error **errp)
569 {
570 MirrorBlockJob *s = container_of(job, MirrorBlockJob, common);
571 Error *local_err = NULL;
572 int ret;
573
574 ret = bdrv_open_backing_file(s->target, NULL, &local_err);
575 if (ret < 0) {
576 error_propagate(errp, local_err);
577 return;
578 }
579 if (!s->synced) {
580 error_set(errp, QERR_BLOCK_JOB_NOT_READY,
581 bdrv_get_device_name(job->bs));
582 return;
583 }
584
585 /* check the target bs is not blocked and block all operations on it */
586 if (s->replaces) {
587 s->to_replace = check_to_replace_node(s->replaces, &local_err);
588 if (!s->to_replace) {
589 error_propagate(errp, local_err);
590 return;
591 }
592
593 error_setg(&s->replace_blocker,
594 "block device is in use by block-job-complete");
595 bdrv_op_block_all(s->to_replace, s->replace_blocker);
596 bdrv_ref(s->to_replace);
597 }
598
599 s->should_complete = true;
600 block_job_resume(job);
601 }
602
603 static const BlockJobDriver mirror_job_driver = {
604 .instance_size = sizeof(MirrorBlockJob),
605 .job_type = BLOCK_JOB_TYPE_MIRROR,
606 .set_speed = mirror_set_speed,
607 .iostatus_reset= mirror_iostatus_reset,
608 .complete = mirror_complete,
609 };
610
611 static const BlockJobDriver commit_active_job_driver = {
612 .instance_size = sizeof(MirrorBlockJob),
613 .job_type = BLOCK_JOB_TYPE_COMMIT,
614 .set_speed = mirror_set_speed,
615 .iostatus_reset
616 = mirror_iostatus_reset,
617 .complete = mirror_complete,
618 };
619
620 static void mirror_start_job(BlockDriverState *bs, BlockDriverState *target,
621 const char *replaces,
622 int64_t speed, int64_t granularity,
623 int64_t buf_size,
624 BlockdevOnError on_source_error,
625 BlockdevOnError on_target_error,
626 BlockCompletionFunc *cb,
627 void *opaque, Error **errp,
628 const BlockJobDriver *driver,
629 bool is_none_mode, BlockDriverState *base)
630 {
631 MirrorBlockJob *s;
632
633 if (granularity == 0) {
634 /* Choose the default granularity based on the target file's cluster
635 * size, clamped between 4k and 64k. */
636 BlockDriverInfo bdi;
637 if (bdrv_get_info(target, &bdi) >= 0 && bdi.cluster_size != 0) {
638 granularity = MAX(4096, bdi.cluster_size);
639 granularity = MIN(65536, granularity);
640 } else {
641 granularity = 65536;
642 }
643 }
644
645 assert ((granularity & (granularity - 1)) == 0);
646
647 if ((on_source_error == BLOCKDEV_ON_ERROR_STOP ||
648 on_source_error == BLOCKDEV_ON_ERROR_ENOSPC) &&
649 !bdrv_iostatus_is_enabled(bs)) {
650 error_set(errp, QERR_INVALID_PARAMETER, "on-source-error");
651 return;
652 }
653
654
655 s = block_job_create(driver, bs, speed, cb, opaque, errp);
656 if (!s) {
657 return;
658 }
659
660 s->replaces = g_strdup(replaces);
661 s->on_source_error = on_source_error;
662 s->on_target_error = on_target_error;
663 s->target = target;
664 s->is_none_mode = is_none_mode;
665 s->base = base;
666 s->granularity = granularity;
667 s->buf_size = MAX(buf_size, granularity);
668
669 s->dirty_bitmap = bdrv_create_dirty_bitmap(bs, granularity, errp);
670 if (!s->dirty_bitmap) {
671 return;
672 }
673 bdrv_set_enable_write_cache(s->target, true);
674 bdrv_set_on_error(s->target, on_target_error, on_target_error);
675 bdrv_iostatus_enable(s->target);
676 s->common.co = qemu_coroutine_create(mirror_run);
677 trace_mirror_start(bs, s, s->common.co, opaque);
678 qemu_coroutine_enter(s->common.co, s);
679 }
680
681 void mirror_start(BlockDriverState *bs, BlockDriverState *target,
682 const char *replaces,
683 int64_t speed, int64_t granularity, int64_t buf_size,
684 MirrorSyncMode mode, BlockdevOnError on_source_error,
685 BlockdevOnError on_target_error,
686 BlockCompletionFunc *cb,
687 void *opaque, Error **errp)
688 {
689 bool is_none_mode;
690 BlockDriverState *base;
691
692 is_none_mode = mode == MIRROR_SYNC_MODE_NONE;
693 base = mode == MIRROR_SYNC_MODE_TOP ? bs->backing_hd : NULL;
694 mirror_start_job(bs, target, replaces,
695 speed, granularity, buf_size,
696 on_source_error, on_target_error, cb, opaque, errp,
697 &mirror_job_driver, is_none_mode, base);
698 }
699
700 void commit_active_start(BlockDriverState *bs, BlockDriverState *base,
701 int64_t speed,
702 BlockdevOnError on_error,
703 BlockCompletionFunc *cb,
704 void *opaque, Error **errp)
705 {
706 int64_t length, base_length;
707 int orig_base_flags;
708 int ret;
709 Error *local_err = NULL;
710
711 orig_base_flags = bdrv_get_flags(base);
712
713 if (bdrv_reopen(base, bs->open_flags, errp)) {
714 return;
715 }
716
717 length = bdrv_getlength(bs);
718 if (length < 0) {
719 error_setg_errno(errp, -length,
720 "Unable to determine length of %s", bs->filename);
721 goto error_restore_flags;
722 }
723
724 base_length = bdrv_getlength(base);
725 if (base_length < 0) {
726 error_setg_errno(errp, -base_length,
727 "Unable to determine length of %s", base->filename);
728 goto error_restore_flags;
729 }
730
731 if (length > base_length) {
732 ret = bdrv_truncate(base, length);
733 if (ret < 0) {
734 error_setg_errno(errp, -ret,
735 "Top image %s is larger than base image %s, and "
736 "resize of base image failed",
737 bs->filename, base->filename);
738 goto error_restore_flags;
739 }
740 }
741
742 bdrv_ref(base);
743 mirror_start_job(bs, base, NULL, speed, 0, 0,
744 on_error, on_error, cb, opaque, &local_err,
745 &commit_active_job_driver, false, base);
746 if (local_err) {
747 error_propagate(errp, local_err);
748 goto error_restore_flags;
749 }
750
751 return;
752
753 error_restore_flags:
754 /* ignore error and errp for bdrv_reopen, because we want to propagate
755 * the original error */
756 bdrv_reopen(base, orig_base_flags, NULL);
757 return;
758 }