2 * QEMU Enhanced Disk Format
4 * Copyright IBM, Corp. 2010
7 * Stefan Hajnoczi <stefanha@linux.vnet.ibm.com>
8 * Anthony Liguori <aliguori@us.ibm.com>
10 * This work is licensed under the terms of the GNU LGPL, version 2 or later.
11 * See the COPYING.LIB file in the top-level directory.
15 #include "qemu/osdep.h"
16 #include "block/qdict.h"
17 #include "qapi/error.h"
18 #include "qemu/timer.h"
19 #include "qemu/bswap.h"
20 #include "qemu/main-loop.h"
21 #include "qemu/module.h"
22 #include "qemu/option.h"
23 #include "qemu/memalign.h"
26 #include "sysemu/block-backend.h"
27 #include "qapi/qmp/qdict.h"
28 #include "qapi/qobject-input-visitor.h"
29 #include "qapi/qapi-visit-block-core.h"
31 static QemuOptsList qed_create_opts
;
33 static int bdrv_qed_probe(const uint8_t *buf
, int buf_size
,
36 const QEDHeader
*header
= (const QEDHeader
*)buf
;
38 if (buf_size
< sizeof(*header
)) {
41 if (le32_to_cpu(header
->magic
) != QED_MAGIC
) {
48 * Check whether an image format is raw
50 * @fmt: Backing file format, may be NULL
52 static bool qed_fmt_is_raw(const char *fmt
)
54 return fmt
&& strcmp(fmt
, "raw") == 0;
57 static void qed_header_le_to_cpu(const QEDHeader
*le
, QEDHeader
*cpu
)
59 cpu
->magic
= le32_to_cpu(le
->magic
);
60 cpu
->cluster_size
= le32_to_cpu(le
->cluster_size
);
61 cpu
->table_size
= le32_to_cpu(le
->table_size
);
62 cpu
->header_size
= le32_to_cpu(le
->header_size
);
63 cpu
->features
= le64_to_cpu(le
->features
);
64 cpu
->compat_features
= le64_to_cpu(le
->compat_features
);
65 cpu
->autoclear_features
= le64_to_cpu(le
->autoclear_features
);
66 cpu
->l1_table_offset
= le64_to_cpu(le
->l1_table_offset
);
67 cpu
->image_size
= le64_to_cpu(le
->image_size
);
68 cpu
->backing_filename_offset
= le32_to_cpu(le
->backing_filename_offset
);
69 cpu
->backing_filename_size
= le32_to_cpu(le
->backing_filename_size
);
72 static void qed_header_cpu_to_le(const QEDHeader
*cpu
, QEDHeader
*le
)
74 le
->magic
= cpu_to_le32(cpu
->magic
);
75 le
->cluster_size
= cpu_to_le32(cpu
->cluster_size
);
76 le
->table_size
= cpu_to_le32(cpu
->table_size
);
77 le
->header_size
= cpu_to_le32(cpu
->header_size
);
78 le
->features
= cpu_to_le64(cpu
->features
);
79 le
->compat_features
= cpu_to_le64(cpu
->compat_features
);
80 le
->autoclear_features
= cpu_to_le64(cpu
->autoclear_features
);
81 le
->l1_table_offset
= cpu_to_le64(cpu
->l1_table_offset
);
82 le
->image_size
= cpu_to_le64(cpu
->image_size
);
83 le
->backing_filename_offset
= cpu_to_le32(cpu
->backing_filename_offset
);
84 le
->backing_filename_size
= cpu_to_le32(cpu
->backing_filename_size
);
87 int qed_write_header_sync(BDRVQEDState
*s
)
91 qed_header_cpu_to_le(&s
->header
, &le
);
92 return bdrv_pwrite(s
->bs
->file
, 0, sizeof(le
), &le
, 0);
96 * Update header in-place (does not rewrite backing filename or other strings)
98 * This function only updates known header fields in-place and does not affect
99 * extra data after the QED header.
101 * No new allocating reqs can start while this function runs.
103 static int coroutine_fn GRAPH_RDLOCK
qed_write_header(BDRVQEDState
*s
)
105 /* We must write full sectors for O_DIRECT but cannot necessarily generate
106 * the data following the header if an unrecognized compat feature is
107 * active. Therefore, first read the sectors containing the header, update
108 * them, and write back.
111 int nsectors
= DIV_ROUND_UP(sizeof(QEDHeader
), BDRV_SECTOR_SIZE
);
112 size_t len
= nsectors
* BDRV_SECTOR_SIZE
;
116 assert(s
->allocating_acb
|| s
->allocating_write_reqs_plugged
);
118 buf
= qemu_blockalign(s
->bs
, len
);
120 ret
= bdrv_co_pread(s
->bs
->file
, 0, len
, buf
, 0);
126 qed_header_cpu_to_le(&s
->header
, (QEDHeader
*) buf
);
128 ret
= bdrv_co_pwrite(s
->bs
->file
, 0, len
, buf
, 0);
139 static uint64_t qed_max_image_size(uint32_t cluster_size
, uint32_t table_size
)
141 uint64_t table_entries
;
144 table_entries
= (table_size
* cluster_size
) / sizeof(uint64_t);
145 l2_size
= table_entries
* cluster_size
;
147 return l2_size
* table_entries
;
150 static bool qed_is_cluster_size_valid(uint32_t cluster_size
)
152 if (cluster_size
< QED_MIN_CLUSTER_SIZE
||
153 cluster_size
> QED_MAX_CLUSTER_SIZE
) {
156 if (cluster_size
& (cluster_size
- 1)) {
157 return false; /* not power of 2 */
162 static bool qed_is_table_size_valid(uint32_t table_size
)
164 if (table_size
< QED_MIN_TABLE_SIZE
||
165 table_size
> QED_MAX_TABLE_SIZE
) {
168 if (table_size
& (table_size
- 1)) {
169 return false; /* not power of 2 */
174 static bool qed_is_image_size_valid(uint64_t image_size
, uint32_t cluster_size
,
177 if (image_size
% BDRV_SECTOR_SIZE
!= 0) {
178 return false; /* not multiple of sector size */
180 if (image_size
> qed_max_image_size(cluster_size
, table_size
)) {
181 return false; /* image is too large */
187 * Read a string of known length from the image file
190 * @offset: File offset to start of string, in bytes
191 * @n: String length in bytes
192 * @buf: Destination buffer
193 * @buflen: Destination buffer length in bytes
194 * @ret: 0 on success, -errno on failure
196 * The string is NUL-terminated.
198 static int qed_read_string(BdrvChild
*file
, uint64_t offset
, size_t n
,
199 char *buf
, size_t buflen
)
205 ret
= bdrv_pread(file
, offset
, n
, buf
, 0);
214 * Allocate new clusters
217 * @n: Number of contiguous clusters to allocate
218 * @ret: Offset of first allocated cluster
220 * This function only produces the offset where the new clusters should be
221 * written. It updates BDRVQEDState but does not make any changes to the image
224 * Called with table_lock held.
226 static uint64_t qed_alloc_clusters(BDRVQEDState
*s
, unsigned int n
)
228 uint64_t offset
= s
->file_size
;
229 s
->file_size
+= n
* s
->header
.cluster_size
;
233 QEDTable
*qed_alloc_table(BDRVQEDState
*s
)
235 /* Honor O_DIRECT memory alignment requirements */
236 return qemu_blockalign(s
->bs
,
237 s
->header
.cluster_size
* s
->header
.table_size
);
241 * Allocate a new zeroed L2 table
243 * Called with table_lock held.
245 static CachedL2Table
*qed_new_l2_table(BDRVQEDState
*s
)
247 CachedL2Table
*l2_table
= qed_alloc_l2_cache_entry(&s
->l2_cache
);
249 l2_table
->table
= qed_alloc_table(s
);
250 l2_table
->offset
= qed_alloc_clusters(s
, s
->header
.table_size
);
252 memset(l2_table
->table
->offsets
, 0,
253 s
->header
.cluster_size
* s
->header
.table_size
);
257 static bool coroutine_fn
qed_plug_allocating_write_reqs(BDRVQEDState
*s
)
259 qemu_co_mutex_lock(&s
->table_lock
);
261 /* No reentrancy is allowed. */
262 assert(!s
->allocating_write_reqs_plugged
);
263 if (s
->allocating_acb
!= NULL
) {
264 /* Another allocating write came concurrently. This cannot happen
265 * from bdrv_qed_drain_begin, but it can happen when the timer runs.
267 qemu_co_mutex_unlock(&s
->table_lock
);
271 s
->allocating_write_reqs_plugged
= true;
272 qemu_co_mutex_unlock(&s
->table_lock
);
276 static void coroutine_fn
qed_unplug_allocating_write_reqs(BDRVQEDState
*s
)
278 qemu_co_mutex_lock(&s
->table_lock
);
279 assert(s
->allocating_write_reqs_plugged
);
280 s
->allocating_write_reqs_plugged
= false;
281 qemu_co_queue_next(&s
->allocating_write_reqs
);
282 qemu_co_mutex_unlock(&s
->table_lock
);
285 static void coroutine_fn GRAPH_RDLOCK
qed_need_check_timer(BDRVQEDState
*s
)
289 trace_qed_need_check_timer_cb(s
);
290 assert_bdrv_graph_readable();
292 if (!qed_plug_allocating_write_reqs(s
)) {
296 /* Ensure writes are on disk before clearing flag */
297 ret
= bdrv_co_flush(s
->bs
->file
->bs
);
299 qed_unplug_allocating_write_reqs(s
);
303 s
->header
.features
&= ~QED_F_NEED_CHECK
;
304 ret
= qed_write_header(s
);
307 qed_unplug_allocating_write_reqs(s
);
309 ret
= bdrv_co_flush(s
->bs
);
313 static void coroutine_fn
qed_need_check_timer_entry(void *opaque
)
315 BDRVQEDState
*s
= opaque
;
316 GRAPH_RDLOCK_GUARD();
318 qed_need_check_timer(opaque
);
319 bdrv_dec_in_flight(s
->bs
);
322 static void qed_need_check_timer_cb(void *opaque
)
324 BDRVQEDState
*s
= opaque
;
325 Coroutine
*co
= qemu_coroutine_create(qed_need_check_timer_entry
, opaque
);
327 bdrv_inc_in_flight(s
->bs
);
328 qemu_coroutine_enter(co
);
331 static void qed_start_need_check_timer(BDRVQEDState
*s
)
333 trace_qed_start_need_check_timer(s
);
335 /* Use QEMU_CLOCK_VIRTUAL so we don't alter the image file while suspended for
338 timer_mod(s
->need_check_timer
, qemu_clock_get_ns(QEMU_CLOCK_VIRTUAL
) +
339 NANOSECONDS_PER_SECOND
* QED_NEED_CHECK_TIMEOUT
);
342 /* It's okay to call this multiple times or when no timer is started */
343 static void qed_cancel_need_check_timer(BDRVQEDState
*s
)
345 trace_qed_cancel_need_check_timer(s
);
346 timer_del(s
->need_check_timer
);
349 static void bdrv_qed_detach_aio_context(BlockDriverState
*bs
)
351 BDRVQEDState
*s
= bs
->opaque
;
353 qed_cancel_need_check_timer(s
);
354 timer_free(s
->need_check_timer
);
357 static void bdrv_qed_attach_aio_context(BlockDriverState
*bs
,
358 AioContext
*new_context
)
360 BDRVQEDState
*s
= bs
->opaque
;
362 s
->need_check_timer
= aio_timer_new(new_context
,
363 QEMU_CLOCK_VIRTUAL
, SCALE_NS
,
364 qed_need_check_timer_cb
, s
);
365 if (s
->header
.features
& QED_F_NEED_CHECK
) {
366 qed_start_need_check_timer(s
);
370 static void bdrv_qed_drain_begin(BlockDriverState
*bs
)
372 BDRVQEDState
*s
= bs
->opaque
;
374 /* Fire the timer immediately in order to start doing I/O as soon as the
377 if (s
->need_check_timer
&& timer_pending(s
->need_check_timer
)) {
380 qed_cancel_need_check_timer(s
);
381 co
= qemu_coroutine_create(qed_need_check_timer_entry
, s
);
382 bdrv_inc_in_flight(bs
);
383 aio_co_enter(bdrv_get_aio_context(bs
), co
);
387 static void bdrv_qed_init_state(BlockDriverState
*bs
)
389 BDRVQEDState
*s
= bs
->opaque
;
391 memset(s
, 0, sizeof(BDRVQEDState
));
393 qemu_co_mutex_init(&s
->table_lock
);
394 qemu_co_queue_init(&s
->allocating_write_reqs
);
397 /* Called with table_lock held. */
398 static int coroutine_fn GRAPH_RDLOCK
399 bdrv_qed_do_open(BlockDriverState
*bs
, QDict
*options
, int flags
, Error
**errp
)
401 BDRVQEDState
*s
= bs
->opaque
;
406 ret
= bdrv_co_pread(bs
->file
, 0, sizeof(le_header
), &le_header
, 0);
408 error_setg(errp
, "Failed to read QED header");
411 qed_header_le_to_cpu(&le_header
, &s
->header
);
413 if (s
->header
.magic
!= QED_MAGIC
) {
414 error_setg(errp
, "Image not in QED format");
417 if (s
->header
.features
& ~QED_FEATURE_MASK
) {
418 /* image uses unsupported feature bits */
419 error_setg(errp
, "Unsupported QED features: %" PRIx64
,
420 s
->header
.features
& ~QED_FEATURE_MASK
);
423 if (!qed_is_cluster_size_valid(s
->header
.cluster_size
)) {
424 error_setg(errp
, "QED cluster size is invalid");
428 /* Round down file size to the last cluster */
429 file_size
= bdrv_co_getlength(bs
->file
->bs
);
431 error_setg(errp
, "Failed to get file length");
434 s
->file_size
= qed_start_of_cluster(s
, file_size
);
436 if (!qed_is_table_size_valid(s
->header
.table_size
)) {
437 error_setg(errp
, "QED table size is invalid");
440 if (!qed_is_image_size_valid(s
->header
.image_size
,
441 s
->header
.cluster_size
,
442 s
->header
.table_size
)) {
443 error_setg(errp
, "QED image size is invalid");
446 if (!qed_check_table_offset(s
, s
->header
.l1_table_offset
)) {
447 error_setg(errp
, "QED table offset is invalid");
451 s
->table_nelems
= (s
->header
.cluster_size
* s
->header
.table_size
) /
453 s
->l2_shift
= ctz32(s
->header
.cluster_size
);
454 s
->l2_mask
= s
->table_nelems
- 1;
455 s
->l1_shift
= s
->l2_shift
+ ctz32(s
->table_nelems
);
457 /* Header size calculation must not overflow uint32_t */
458 if (s
->header
.header_size
> UINT32_MAX
/ s
->header
.cluster_size
) {
459 error_setg(errp
, "QED header size is too large");
463 if ((s
->header
.features
& QED_F_BACKING_FILE
)) {
464 g_autofree
char *backing_file_str
= NULL
;
466 if ((uint64_t)s
->header
.backing_filename_offset
+
467 s
->header
.backing_filename_size
>
468 s
->header
.cluster_size
* s
->header
.header_size
) {
469 error_setg(errp
, "QED backing filename offset is invalid");
473 backing_file_str
= g_malloc(sizeof(bs
->backing_file
));
474 ret
= qed_read_string(bs
->file
, s
->header
.backing_filename_offset
,
475 s
->header
.backing_filename_size
,
476 backing_file_str
, sizeof(bs
->backing_file
));
478 error_setg(errp
, "Failed to read backing filename");
482 if (!g_str_equal(backing_file_str
, bs
->backing_file
)) {
483 pstrcpy(bs
->backing_file
, sizeof(bs
->backing_file
),
485 pstrcpy(bs
->auto_backing_file
, sizeof(bs
->auto_backing_file
),
489 if (s
->header
.features
& QED_F_BACKING_FORMAT_NO_PROBE
) {
490 pstrcpy(bs
->backing_format
, sizeof(bs
->backing_format
), "raw");
494 /* Reset unknown autoclear feature bits. This is a backwards
495 * compatibility mechanism that allows images to be opened by older
496 * programs, which "knock out" unknown feature bits. When an image is
497 * opened by a newer program again it can detect that the autoclear
498 * feature is no longer valid.
500 if ((s
->header
.autoclear_features
& ~QED_AUTOCLEAR_FEATURE_MASK
) != 0 &&
501 !bdrv_is_read_only(bs
->file
->bs
) && !(flags
& BDRV_O_INACTIVE
)) {
502 s
->header
.autoclear_features
&= QED_AUTOCLEAR_FEATURE_MASK
;
504 ret
= qed_write_header_sync(s
);
506 error_setg(errp
, "Failed to update header");
510 /* From here on only known autoclear feature bits are valid */
511 bdrv_co_flush(bs
->file
->bs
);
514 s
->l1_table
= qed_alloc_table(s
);
515 qed_init_l2_cache(&s
->l2_cache
);
517 ret
= qed_read_l1_table_sync(s
);
519 error_setg(errp
, "Failed to read L1 table");
523 /* If image was not closed cleanly, check consistency */
524 if (!(flags
& BDRV_O_CHECK
) && (s
->header
.features
& QED_F_NEED_CHECK
)) {
525 /* Read-only images cannot be fixed. There is no risk of corruption
526 * since write operations are not possible. Therefore, allow
527 * potentially inconsistent images to be opened read-only. This can
528 * aid data recovery from an otherwise inconsistent image.
530 if (!bdrv_is_read_only(bs
->file
->bs
) &&
531 !(flags
& BDRV_O_INACTIVE
)) {
532 BdrvCheckResult result
= {0};
534 ret
= qed_check(s
, &result
, true);
536 error_setg(errp
, "Image corrupted");
542 bdrv_qed_attach_aio_context(bs
, bdrv_get_aio_context(bs
));
546 qed_free_l2_cache(&s
->l2_cache
);
547 qemu_vfree(s
->l1_table
);
552 typedef struct QEDOpenCo
{
553 BlockDriverState
*bs
;
560 static void coroutine_fn
bdrv_qed_open_entry(void *opaque
)
562 QEDOpenCo
*qoc
= opaque
;
563 BDRVQEDState
*s
= qoc
->bs
->opaque
;
565 GRAPH_RDLOCK_GUARD();
567 qemu_co_mutex_lock(&s
->table_lock
);
568 qoc
->ret
= bdrv_qed_do_open(qoc
->bs
, qoc
->options
, qoc
->flags
, qoc
->errp
);
569 qemu_co_mutex_unlock(&s
->table_lock
);
572 static int bdrv_qed_open(BlockDriverState
*bs
, QDict
*options
, int flags
,
584 ret
= bdrv_open_file_child(NULL
, options
, "file", bs
, errp
);
589 bdrv_qed_init_state(bs
);
590 assert(!qemu_in_coroutine());
591 assert(qemu_get_current_aio_context() == qemu_get_aio_context());
592 qemu_coroutine_enter(qemu_coroutine_create(bdrv_qed_open_entry
, &qoc
));
593 BDRV_POLL_WHILE(bs
, qoc
.ret
== -EINPROGRESS
);
598 static void bdrv_qed_refresh_limits(BlockDriverState
*bs
, Error
**errp
)
600 BDRVQEDState
*s
= bs
->opaque
;
602 bs
->bl
.pwrite_zeroes_alignment
= s
->header
.cluster_size
;
603 bs
->bl
.max_pwrite_zeroes
= QEMU_ALIGN_DOWN(INT_MAX
, s
->header
.cluster_size
);
606 /* We have nothing to do for QED reopen, stubs just return
608 static int bdrv_qed_reopen_prepare(BDRVReopenState
*state
,
609 BlockReopenQueue
*queue
, Error
**errp
)
614 static void bdrv_qed_close(BlockDriverState
*bs
)
616 BDRVQEDState
*s
= bs
->opaque
;
618 bdrv_qed_detach_aio_context(bs
);
620 /* Ensure writes reach stable storage */
621 bdrv_flush(bs
->file
->bs
);
623 /* Clean shutdown, no check required on next open */
624 if (s
->header
.features
& QED_F_NEED_CHECK
) {
625 s
->header
.features
&= ~QED_F_NEED_CHECK
;
626 qed_write_header_sync(s
);
629 qed_free_l2_cache(&s
->l2_cache
);
630 qemu_vfree(s
->l1_table
);
633 static int coroutine_fn
bdrv_qed_co_create(BlockdevCreateOptions
*opts
,
636 BlockdevCreateOptionsQed
*qed_opts
;
637 BlockBackend
*blk
= NULL
;
638 BlockDriverState
*bs
= NULL
;
642 uint8_t *l1_table
= NULL
;
646 assert(opts
->driver
== BLOCKDEV_DRIVER_QED
);
647 qed_opts
= &opts
->u
.qed
;
649 /* Validate options and set default values */
650 if (!qed_opts
->has_cluster_size
) {
651 qed_opts
->cluster_size
= QED_DEFAULT_CLUSTER_SIZE
;
653 if (!qed_opts
->has_table_size
) {
654 qed_opts
->table_size
= QED_DEFAULT_TABLE_SIZE
;
657 if (!qed_is_cluster_size_valid(qed_opts
->cluster_size
)) {
658 error_setg(errp
, "QED cluster size must be within range [%u, %u] "
660 QED_MIN_CLUSTER_SIZE
, QED_MAX_CLUSTER_SIZE
);
663 if (!qed_is_table_size_valid(qed_opts
->table_size
)) {
664 error_setg(errp
, "QED table size must be within range [%u, %u] "
666 QED_MIN_TABLE_SIZE
, QED_MAX_TABLE_SIZE
);
669 if (!qed_is_image_size_valid(qed_opts
->size
, qed_opts
->cluster_size
,
670 qed_opts
->table_size
))
672 error_setg(errp
, "QED image size must be a non-zero multiple of "
673 "cluster size and less than %" PRIu64
" bytes",
674 qed_max_image_size(qed_opts
->cluster_size
,
675 qed_opts
->table_size
));
679 /* Create BlockBackend to write to the image */
680 bs
= bdrv_co_open_blockdev_ref(qed_opts
->file
, errp
);
685 blk
= blk_co_new_with_bs(bs
, BLK_PERM_WRITE
| BLK_PERM_RESIZE
, BLK_PERM_ALL
,
691 blk_set_allow_write_beyond_eof(blk
, true);
693 /* Prepare image format */
694 header
= (QEDHeader
) {
696 .cluster_size
= qed_opts
->cluster_size
,
697 .table_size
= qed_opts
->table_size
,
700 .compat_features
= 0,
701 .l1_table_offset
= qed_opts
->cluster_size
,
702 .image_size
= qed_opts
->size
,
705 l1_size
= header
.cluster_size
* header
.table_size
;
708 * The QED format associates file length with allocation status,
709 * so a new file (which is empty) must have a length of 0.
711 ret
= blk_co_truncate(blk
, 0, true, PREALLOC_MODE_OFF
, 0, errp
);
716 if (qed_opts
->backing_file
) {
717 header
.features
|= QED_F_BACKING_FILE
;
718 header
.backing_filename_offset
= sizeof(le_header
);
719 header
.backing_filename_size
= strlen(qed_opts
->backing_file
);
721 if (qed_opts
->has_backing_fmt
) {
722 const char *backing_fmt
= BlockdevDriver_str(qed_opts
->backing_fmt
);
723 if (qed_fmt_is_raw(backing_fmt
)) {
724 header
.features
|= QED_F_BACKING_FORMAT_NO_PROBE
;
729 qed_header_cpu_to_le(&header
, &le_header
);
730 ret
= blk_co_pwrite(blk
, 0, sizeof(le_header
), &le_header
, 0);
734 ret
= blk_co_pwrite(blk
, sizeof(le_header
), header
.backing_filename_size
,
735 qed_opts
->backing_file
, 0);
740 l1_table
= g_malloc0(l1_size
);
741 ret
= blk_co_pwrite(blk
, header
.l1_table_offset
, l1_size
, l1_table
, 0);
746 ret
= 0; /* success */
754 static int coroutine_fn GRAPH_RDLOCK
755 bdrv_qed_co_create_opts(BlockDriver
*drv
, const char *filename
,
756 QemuOpts
*opts
, Error
**errp
)
758 BlockdevCreateOptions
*create_options
= NULL
;
761 BlockDriverState
*bs
= NULL
;
764 static const QDictRenames opt_renames
[] = {
765 { BLOCK_OPT_BACKING_FILE
, "backing-file" },
766 { BLOCK_OPT_BACKING_FMT
, "backing-fmt" },
767 { BLOCK_OPT_CLUSTER_SIZE
, "cluster-size" },
768 { BLOCK_OPT_TABLE_SIZE
, "table-size" },
772 /* Parse options and convert legacy syntax */
773 qdict
= qemu_opts_to_qdict_filtered(opts
, NULL
, &qed_create_opts
, true);
775 if (!qdict_rename_keys(qdict
, opt_renames
, errp
)) {
780 /* Create and open the file (protocol layer) */
781 ret
= bdrv_co_create_file(filename
, opts
, errp
);
786 bs
= bdrv_co_open(filename
, NULL
, NULL
,
787 BDRV_O_RDWR
| BDRV_O_RESIZE
| BDRV_O_PROTOCOL
, errp
);
793 /* Now get the QAPI type BlockdevCreateOptions */
794 qdict_put_str(qdict
, "driver", "qed");
795 qdict_put_str(qdict
, "file", bs
->node_name
);
797 v
= qobject_input_visitor_new_flat_confused(qdict
, errp
);
803 visit_type_BlockdevCreateOptions(v
, NULL
, &create_options
, errp
);
805 if (!create_options
) {
810 /* Silently round up size */
811 assert(create_options
->driver
== BLOCKDEV_DRIVER_QED
);
812 create_options
->u
.qed
.size
=
813 ROUND_UP(create_options
->u
.qed
.size
, BDRV_SECTOR_SIZE
);
815 /* Create the qed image (format layer) */
816 ret
= bdrv_qed_co_create(create_options
, errp
);
819 qobject_unref(qdict
);
821 qapi_free_BlockdevCreateOptions(create_options
);
825 static int coroutine_fn GRAPH_RDLOCK
826 bdrv_qed_co_block_status(BlockDriverState
*bs
, bool want_zero
, int64_t pos
,
827 int64_t bytes
, int64_t *pnum
, int64_t *map
,
828 BlockDriverState
**file
)
830 BDRVQEDState
*s
= bs
->opaque
;
831 size_t len
= MIN(bytes
, SIZE_MAX
);
833 QEDRequest request
= { .l2_table
= NULL
};
837 qemu_co_mutex_lock(&s
->table_lock
);
838 ret
= qed_find_cluster(s
, &request
, pos
, &len
, &offset
);
842 case QED_CLUSTER_FOUND
:
843 *map
= offset
| qed_offset_into_cluster(s
, pos
);
844 status
= BDRV_BLOCK_DATA
| BDRV_BLOCK_OFFSET_VALID
;
845 *file
= bs
->file
->bs
;
847 case QED_CLUSTER_ZERO
:
848 status
= BDRV_BLOCK_ZERO
;
860 qed_unref_l2_cache_entry(request
.l2_table
);
861 qemu_co_mutex_unlock(&s
->table_lock
);
866 static BDRVQEDState
*acb_to_s(QEDAIOCB
*acb
)
868 return acb
->bs
->opaque
;
872 * Read from the backing file or zero-fill if no backing file
875 * @pos: Byte position in device
876 * @qiov: Destination I/O vector
878 * This function reads qiov->size bytes starting at pos from the backing file.
879 * If there is no backing file then zeroes are read.
881 static int coroutine_fn GRAPH_RDLOCK
882 qed_read_backing_file(BDRVQEDState
*s
, uint64_t pos
, QEMUIOVector
*qiov
)
884 if (s
->bs
->backing
) {
885 BLKDBG_EVENT(s
->bs
->file
, BLKDBG_READ_BACKING_AIO
);
886 return bdrv_co_preadv(s
->bs
->backing
, pos
, qiov
->size
, qiov
, 0);
888 qemu_iovec_memset(qiov
, 0, 0, qiov
->size
);
893 * Copy data from backing file into the image
896 * @pos: Byte position in device
897 * @len: Number of bytes
898 * @offset: Byte offset in image file
900 static int coroutine_fn GRAPH_RDLOCK
901 qed_copy_from_backing_file(BDRVQEDState
*s
, uint64_t pos
, uint64_t len
,
907 /* Skip copy entirely if there is no work to do */
912 qemu_iovec_init_buf(&qiov
, qemu_blockalign(s
->bs
, len
), len
);
914 ret
= qed_read_backing_file(s
, pos
, &qiov
);
920 BLKDBG_EVENT(s
->bs
->file
, BLKDBG_COW_WRITE
);
921 ret
= bdrv_co_pwritev(s
->bs
->file
, offset
, qiov
.size
, &qiov
, 0);
927 qemu_vfree(qemu_iovec_buf(&qiov
));
932 * Link one or more contiguous clusters into a table
936 * @index: First cluster index
937 * @n: Number of contiguous clusters
938 * @cluster: First cluster offset
940 * The cluster offset may be an allocated byte offset in the image file, the
941 * zero cluster marker, or the unallocated cluster marker.
943 * Called with table_lock held.
945 static void coroutine_fn
qed_update_l2_table(BDRVQEDState
*s
, QEDTable
*table
,
946 int index
, unsigned int n
,
950 for (i
= index
; i
< index
+ n
; i
++) {
951 table
->offsets
[i
] = cluster
;
952 if (!qed_offset_is_unalloc_cluster(cluster
) &&
953 !qed_offset_is_zero_cluster(cluster
)) {
954 cluster
+= s
->header
.cluster_size
;
959 /* Called with table_lock held. */
960 static void coroutine_fn
qed_aio_complete(QEDAIOCB
*acb
)
962 BDRVQEDState
*s
= acb_to_s(acb
);
965 qemu_iovec_destroy(&acb
->cur_qiov
);
966 qed_unref_l2_cache_entry(acb
->request
.l2_table
);
968 /* Free the buffer we may have allocated for zero writes */
969 if (acb
->flags
& QED_AIOCB_ZERO
) {
970 qemu_vfree(acb
->qiov
->iov
[0].iov_base
);
971 acb
->qiov
->iov
[0].iov_base
= NULL
;
974 /* Start next allocating write request waiting behind this one. Note that
975 * requests enqueue themselves when they first hit an unallocated cluster
976 * but they wait until the entire request is finished before waking up the
977 * next request in the queue. This ensures that we don't cycle through
978 * requests multiple times but rather finish one at a time completely.
980 if (acb
== s
->allocating_acb
) {
981 s
->allocating_acb
= NULL
;
982 if (!qemu_co_queue_empty(&s
->allocating_write_reqs
)) {
983 qemu_co_queue_next(&s
->allocating_write_reqs
);
984 } else if (s
->header
.features
& QED_F_NEED_CHECK
) {
985 qed_start_need_check_timer(s
);
991 * Update L1 table with new L2 table offset and write it out
993 * Called with table_lock held.
995 static int coroutine_fn GRAPH_RDLOCK
qed_aio_write_l1_update(QEDAIOCB
*acb
)
997 BDRVQEDState
*s
= acb_to_s(acb
);
998 CachedL2Table
*l2_table
= acb
->request
.l2_table
;
999 uint64_t l2_offset
= l2_table
->offset
;
1002 index
= qed_l1_index(s
, acb
->cur_pos
);
1003 s
->l1_table
->offsets
[index
] = l2_table
->offset
;
1005 ret
= qed_write_l1_table(s
, index
, 1);
1007 /* Commit the current L2 table to the cache */
1008 qed_commit_l2_cache_entry(&s
->l2_cache
, l2_table
);
1010 /* This is guaranteed to succeed because we just committed the entry to the
1013 acb
->request
.l2_table
= qed_find_l2_cache_entry(&s
->l2_cache
, l2_offset
);
1014 assert(acb
->request
.l2_table
!= NULL
);
1021 * Update L2 table with new cluster offsets and write them out
1023 * Called with table_lock held.
1025 static int coroutine_fn GRAPH_RDLOCK
1026 qed_aio_write_l2_update(QEDAIOCB
*acb
, uint64_t offset
)
1028 BDRVQEDState
*s
= acb_to_s(acb
);
1029 bool need_alloc
= acb
->find_cluster_ret
== QED_CLUSTER_L1
;
1033 qed_unref_l2_cache_entry(acb
->request
.l2_table
);
1034 acb
->request
.l2_table
= qed_new_l2_table(s
);
1037 index
= qed_l2_index(s
, acb
->cur_pos
);
1038 qed_update_l2_table(s
, acb
->request
.l2_table
->table
, index
, acb
->cur_nclusters
,
1042 /* Write out the whole new L2 table */
1043 ret
= qed_write_l2_table(s
, &acb
->request
, 0, s
->table_nelems
, true);
1047 return qed_aio_write_l1_update(acb
);
1049 /* Write out only the updated part of the L2 table */
1050 ret
= qed_write_l2_table(s
, &acb
->request
, index
, acb
->cur_nclusters
,
1060 * Write data to the image file
1062 * Called with table_lock *not* held.
1064 static int coroutine_fn GRAPH_RDLOCK
qed_aio_write_main(QEDAIOCB
*acb
)
1066 BDRVQEDState
*s
= acb_to_s(acb
);
1067 uint64_t offset
= acb
->cur_cluster
+
1068 qed_offset_into_cluster(s
, acb
->cur_pos
);
1070 trace_qed_aio_write_main(s
, acb
, 0, offset
, acb
->cur_qiov
.size
);
1072 BLKDBG_EVENT(s
->bs
->file
, BLKDBG_WRITE_AIO
);
1073 return bdrv_co_pwritev(s
->bs
->file
, offset
, acb
->cur_qiov
.size
,
1078 * Populate untouched regions of new data cluster
1080 * Called with table_lock held.
1082 static int coroutine_fn GRAPH_RDLOCK
qed_aio_write_cow(QEDAIOCB
*acb
)
1084 BDRVQEDState
*s
= acb_to_s(acb
);
1085 uint64_t start
, len
, offset
;
1088 qemu_co_mutex_unlock(&s
->table_lock
);
1090 /* Populate front untouched region of new data cluster */
1091 start
= qed_start_of_cluster(s
, acb
->cur_pos
);
1092 len
= qed_offset_into_cluster(s
, acb
->cur_pos
);
1094 trace_qed_aio_write_prefill(s
, acb
, start
, len
, acb
->cur_cluster
);
1095 ret
= qed_copy_from_backing_file(s
, start
, len
, acb
->cur_cluster
);
1100 /* Populate back untouched region of new data cluster */
1101 start
= acb
->cur_pos
+ acb
->cur_qiov
.size
;
1102 len
= qed_start_of_cluster(s
, start
+ s
->header
.cluster_size
- 1) - start
;
1103 offset
= acb
->cur_cluster
+
1104 qed_offset_into_cluster(s
, acb
->cur_pos
) +
1107 trace_qed_aio_write_postfill(s
, acb
, start
, len
, offset
);
1108 ret
= qed_copy_from_backing_file(s
, start
, len
, offset
);
1113 ret
= qed_aio_write_main(acb
);
1118 if (s
->bs
->backing
) {
1120 * Flush new data clusters before updating the L2 table
1122 * This flush is necessary when a backing file is in use. A crash
1123 * during an allocating write could result in empty clusters in the
1124 * image. If the write only touched a subregion of the cluster,
1125 * then backing image sectors have been lost in the untouched
1126 * region. The solution is to flush after writing a new data
1127 * cluster and before updating the L2 table.
1129 ret
= bdrv_co_flush(s
->bs
->file
->bs
);
1133 qemu_co_mutex_lock(&s
->table_lock
);
1138 * Check if the QED_F_NEED_CHECK bit should be set during allocating write
1140 static bool qed_should_set_need_check(BDRVQEDState
*s
)
1142 /* The flush before L2 update path ensures consistency */
1143 if (s
->bs
->backing
) {
1147 return !(s
->header
.features
& QED_F_NEED_CHECK
);
1151 * Write new data cluster
1153 * @acb: Write request
1154 * @len: Length in bytes
1156 * This path is taken when writing to previously unallocated clusters.
1158 * Called with table_lock held.
1160 static int coroutine_fn GRAPH_RDLOCK
1161 qed_aio_write_alloc(QEDAIOCB
*acb
, size_t len
)
1163 BDRVQEDState
*s
= acb_to_s(acb
);
1166 /* Cancel timer when the first allocating request comes in */
1167 if (s
->allocating_acb
== NULL
) {
1168 qed_cancel_need_check_timer(s
);
1171 /* Freeze this request if another allocating write is in progress */
1172 if (s
->allocating_acb
!= acb
|| s
->allocating_write_reqs_plugged
) {
1173 if (s
->allocating_acb
!= NULL
) {
1174 qemu_co_queue_wait(&s
->allocating_write_reqs
, &s
->table_lock
);
1175 assert(s
->allocating_acb
== NULL
);
1177 s
->allocating_acb
= acb
;
1178 return -EAGAIN
; /* start over with looking up table entries */
1181 acb
->cur_nclusters
= qed_bytes_to_clusters(s
,
1182 qed_offset_into_cluster(s
, acb
->cur_pos
) + len
);
1183 qemu_iovec_concat(&acb
->cur_qiov
, acb
->qiov
, acb
->qiov_offset
, len
);
1185 if (acb
->flags
& QED_AIOCB_ZERO
) {
1186 /* Skip ahead if the clusters are already zero */
1187 if (acb
->find_cluster_ret
== QED_CLUSTER_ZERO
) {
1190 acb
->cur_cluster
= 1;
1192 acb
->cur_cluster
= qed_alloc_clusters(s
, acb
->cur_nclusters
);
1195 if (qed_should_set_need_check(s
)) {
1196 s
->header
.features
|= QED_F_NEED_CHECK
;
1197 ret
= qed_write_header(s
);
1203 if (!(acb
->flags
& QED_AIOCB_ZERO
)) {
1204 ret
= qed_aio_write_cow(acb
);
1210 return qed_aio_write_l2_update(acb
, acb
->cur_cluster
);
1214 * Write data cluster in place
1216 * @acb: Write request
1217 * @offset: Cluster offset in bytes
1218 * @len: Length in bytes
1220 * This path is taken when writing to already allocated clusters.
1222 * Called with table_lock held.
1224 static int coroutine_fn GRAPH_RDLOCK
1225 qed_aio_write_inplace(QEDAIOCB
*acb
, uint64_t offset
, size_t len
)
1227 BDRVQEDState
*s
= acb_to_s(acb
);
1230 qemu_co_mutex_unlock(&s
->table_lock
);
1232 /* Allocate buffer for zero writes */
1233 if (acb
->flags
& QED_AIOCB_ZERO
) {
1234 struct iovec
*iov
= acb
->qiov
->iov
;
1236 if (!iov
->iov_base
) {
1237 iov
->iov_base
= qemu_try_blockalign(acb
->bs
, iov
->iov_len
);
1238 if (iov
->iov_base
== NULL
) {
1242 memset(iov
->iov_base
, 0, iov
->iov_len
);
1246 /* Calculate the I/O vector */
1247 acb
->cur_cluster
= offset
;
1248 qemu_iovec_concat(&acb
->cur_qiov
, acb
->qiov
, acb
->qiov_offset
, len
);
1250 /* Do the actual write. */
1251 r
= qed_aio_write_main(acb
);
1253 qemu_co_mutex_lock(&s
->table_lock
);
1258 * Write data cluster
1260 * @opaque: Write request
1261 * @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2 or QED_CLUSTER_L1
1262 * @offset: Cluster offset in bytes
1263 * @len: Length in bytes
1265 * Called with table_lock held.
1267 static int coroutine_fn GRAPH_RDLOCK
1268 qed_aio_write_data(void *opaque
, int ret
, uint64_t offset
, size_t len
)
1270 QEDAIOCB
*acb
= opaque
;
1272 trace_qed_aio_write_data(acb_to_s(acb
), acb
, ret
, offset
, len
);
1274 acb
->find_cluster_ret
= ret
;
1277 case QED_CLUSTER_FOUND
:
1278 return qed_aio_write_inplace(acb
, offset
, len
);
1280 case QED_CLUSTER_L2
:
1281 case QED_CLUSTER_L1
:
1282 case QED_CLUSTER_ZERO
:
1283 return qed_aio_write_alloc(acb
, len
);
1286 g_assert_not_reached();
1293 * @opaque: Read request
1294 * @ret: QED_CLUSTER_FOUND, QED_CLUSTER_L2 or QED_CLUSTER_L1
1295 * @offset: Cluster offset in bytes
1296 * @len: Length in bytes
1298 * Called with table_lock held.
1300 static int coroutine_fn GRAPH_RDLOCK
1301 qed_aio_read_data(void *opaque
, int ret
, uint64_t offset
, size_t len
)
1303 QEDAIOCB
*acb
= opaque
;
1304 BDRVQEDState
*s
= acb_to_s(acb
);
1305 BlockDriverState
*bs
= acb
->bs
;
1308 qemu_co_mutex_unlock(&s
->table_lock
);
1310 /* Adjust offset into cluster */
1311 offset
+= qed_offset_into_cluster(s
, acb
->cur_pos
);
1313 trace_qed_aio_read_data(s
, acb
, ret
, offset
, len
);
1315 qemu_iovec_concat(&acb
->cur_qiov
, acb
->qiov
, acb
->qiov_offset
, len
);
1317 /* Handle zero cluster and backing file reads, otherwise read
1318 * data cluster directly.
1320 if (ret
== QED_CLUSTER_ZERO
) {
1321 qemu_iovec_memset(&acb
->cur_qiov
, 0, 0, acb
->cur_qiov
.size
);
1323 } else if (ret
!= QED_CLUSTER_FOUND
) {
1324 r
= qed_read_backing_file(s
, acb
->cur_pos
, &acb
->cur_qiov
);
1326 BLKDBG_EVENT(bs
->file
, BLKDBG_READ_AIO
);
1327 r
= bdrv_co_preadv(bs
->file
, offset
, acb
->cur_qiov
.size
,
1331 qemu_co_mutex_lock(&s
->table_lock
);
1336 * Begin next I/O or complete the request
1338 static int coroutine_fn GRAPH_RDLOCK
qed_aio_next_io(QEDAIOCB
*acb
)
1340 BDRVQEDState
*s
= acb_to_s(acb
);
1345 qemu_co_mutex_lock(&s
->table_lock
);
1347 trace_qed_aio_next_io(s
, acb
, 0, acb
->cur_pos
+ acb
->cur_qiov
.size
);
1349 acb
->qiov_offset
+= acb
->cur_qiov
.size
;
1350 acb
->cur_pos
+= acb
->cur_qiov
.size
;
1351 qemu_iovec_reset(&acb
->cur_qiov
);
1353 /* Complete request */
1354 if (acb
->cur_pos
>= acb
->end_pos
) {
1359 /* Find next cluster and start I/O */
1360 len
= acb
->end_pos
- acb
->cur_pos
;
1361 ret
= qed_find_cluster(s
, &acb
->request
, acb
->cur_pos
, &len
, &offset
);
1366 if (acb
->flags
& QED_AIOCB_WRITE
) {
1367 ret
= qed_aio_write_data(acb
, ret
, offset
, len
);
1369 ret
= qed_aio_read_data(acb
, ret
, offset
, len
);
1372 if (ret
< 0 && ret
!= -EAGAIN
) {
1377 trace_qed_aio_complete(s
, acb
, ret
);
1378 qed_aio_complete(acb
);
1379 qemu_co_mutex_unlock(&s
->table_lock
);
1383 static int coroutine_fn GRAPH_RDLOCK
1384 qed_co_request(BlockDriverState
*bs
, int64_t sector_num
, QEMUIOVector
*qiov
,
1385 int nb_sectors
, int flags
)
1389 .cur_pos
= (uint64_t) sector_num
* BDRV_SECTOR_SIZE
,
1390 .end_pos
= (sector_num
+ nb_sectors
) * BDRV_SECTOR_SIZE
,
1394 qemu_iovec_init(&acb
.cur_qiov
, qiov
->niov
);
1396 trace_qed_aio_setup(bs
->opaque
, &acb
, sector_num
, nb_sectors
, NULL
, flags
);
1399 return qed_aio_next_io(&acb
);
1402 static int coroutine_fn GRAPH_RDLOCK
1403 bdrv_qed_co_readv(BlockDriverState
*bs
, int64_t sector_num
, int nb_sectors
,
1406 return qed_co_request(bs
, sector_num
, qiov
, nb_sectors
, 0);
1409 static int coroutine_fn GRAPH_RDLOCK
1410 bdrv_qed_co_writev(BlockDriverState
*bs
, int64_t sector_num
, int nb_sectors
,
1411 QEMUIOVector
*qiov
, int flags
)
1413 return qed_co_request(bs
, sector_num
, qiov
, nb_sectors
, QED_AIOCB_WRITE
);
1416 static int coroutine_fn GRAPH_RDLOCK
1417 bdrv_qed_co_pwrite_zeroes(BlockDriverState
*bs
, int64_t offset
, int64_t bytes
,
1418 BdrvRequestFlags flags
)
1420 BDRVQEDState
*s
= bs
->opaque
;
1423 * Zero writes start without an I/O buffer. If a buffer becomes necessary
1424 * then it will be allocated during request processing.
1426 QEMUIOVector qiov
= QEMU_IOVEC_INIT_BUF(qiov
, NULL
, bytes
);
1429 * QED is not prepared for 63bit write-zero requests, so rely on
1430 * max_pwrite_zeroes.
1432 assert(bytes
<= INT_MAX
);
1434 /* Fall back if the request is not aligned */
1435 if (qed_offset_into_cluster(s
, offset
) ||
1436 qed_offset_into_cluster(s
, bytes
)) {
1440 return qed_co_request(bs
, offset
>> BDRV_SECTOR_BITS
, &qiov
,
1441 bytes
>> BDRV_SECTOR_BITS
,
1442 QED_AIOCB_WRITE
| QED_AIOCB_ZERO
);
1445 static int coroutine_fn
bdrv_qed_co_truncate(BlockDriverState
*bs
,
1448 PreallocMode prealloc
,
1449 BdrvRequestFlags flags
,
1452 BDRVQEDState
*s
= bs
->opaque
;
1453 uint64_t old_image_size
;
1456 if (prealloc
!= PREALLOC_MODE_OFF
) {
1457 error_setg(errp
, "Unsupported preallocation mode '%s'",
1458 PreallocMode_str(prealloc
));
1462 if (!qed_is_image_size_valid(offset
, s
->header
.cluster_size
,
1463 s
->header
.table_size
)) {
1464 error_setg(errp
, "Invalid image size specified");
1468 if ((uint64_t)offset
< s
->header
.image_size
) {
1469 error_setg(errp
, "Shrinking images is currently not supported");
1473 old_image_size
= s
->header
.image_size
;
1474 s
->header
.image_size
= offset
;
1475 ret
= qed_write_header_sync(s
);
1477 s
->header
.image_size
= old_image_size
;
1478 error_setg_errno(errp
, -ret
, "Failed to update the image size");
1483 static int64_t coroutine_fn
bdrv_qed_co_getlength(BlockDriverState
*bs
)
1485 BDRVQEDState
*s
= bs
->opaque
;
1486 return s
->header
.image_size
;
1489 static int coroutine_fn
1490 bdrv_qed_co_get_info(BlockDriverState
*bs
, BlockDriverInfo
*bdi
)
1492 BDRVQEDState
*s
= bs
->opaque
;
1494 memset(bdi
, 0, sizeof(*bdi
));
1495 bdi
->cluster_size
= s
->header
.cluster_size
;
1496 bdi
->is_dirty
= s
->header
.features
& QED_F_NEED_CHECK
;
1500 static int bdrv_qed_change_backing_file(BlockDriverState
*bs
,
1501 const char *backing_file
,
1502 const char *backing_fmt
)
1504 BDRVQEDState
*s
= bs
->opaque
;
1505 QEDHeader new_header
, le_header
;
1507 size_t buffer_len
, backing_file_len
;
1510 /* Refuse to set backing filename if unknown compat feature bits are
1511 * active. If the image uses an unknown compat feature then we may not
1512 * know the layout of data following the header structure and cannot safely
1515 if (backing_file
&& (s
->header
.compat_features
&
1516 ~QED_COMPAT_FEATURE_MASK
)) {
1520 memcpy(&new_header
, &s
->header
, sizeof(new_header
));
1522 new_header
.features
&= ~(QED_F_BACKING_FILE
|
1523 QED_F_BACKING_FORMAT_NO_PROBE
);
1525 /* Adjust feature flags */
1527 new_header
.features
|= QED_F_BACKING_FILE
;
1529 if (qed_fmt_is_raw(backing_fmt
)) {
1530 new_header
.features
|= QED_F_BACKING_FORMAT_NO_PROBE
;
1534 /* Calculate new header size */
1535 backing_file_len
= 0;
1538 backing_file_len
= strlen(backing_file
);
1541 buffer_len
= sizeof(new_header
);
1542 new_header
.backing_filename_offset
= buffer_len
;
1543 new_header
.backing_filename_size
= backing_file_len
;
1544 buffer_len
+= backing_file_len
;
1546 /* Make sure we can rewrite header without failing */
1547 if (buffer_len
> new_header
.header_size
* new_header
.cluster_size
) {
1551 /* Prepare new header */
1552 buffer
= g_malloc(buffer_len
);
1554 qed_header_cpu_to_le(&new_header
, &le_header
);
1555 memcpy(buffer
, &le_header
, sizeof(le_header
));
1556 buffer_len
= sizeof(le_header
);
1559 memcpy(buffer
+ buffer_len
, backing_file
, backing_file_len
);
1560 buffer_len
+= backing_file_len
;
1563 /* Write new header */
1564 ret
= bdrv_pwrite_sync(bs
->file
, 0, buffer_len
, buffer
, 0);
1567 memcpy(&s
->header
, &new_header
, sizeof(new_header
));
1572 static void coroutine_fn GRAPH_RDLOCK
1573 bdrv_qed_co_invalidate_cache(BlockDriverState
*bs
, Error
**errp
)
1575 BDRVQEDState
*s
= bs
->opaque
;
1580 bdrv_qed_init_state(bs
);
1581 qemu_co_mutex_lock(&s
->table_lock
);
1582 ret
= bdrv_qed_do_open(bs
, NULL
, bs
->open_flags
, errp
);
1583 qemu_co_mutex_unlock(&s
->table_lock
);
1585 error_prepend(errp
, "Could not reopen qed layer: ");
1589 static int coroutine_fn GRAPH_RDLOCK
1590 bdrv_qed_co_check(BlockDriverState
*bs
, BdrvCheckResult
*result
,
1593 BDRVQEDState
*s
= bs
->opaque
;
1596 qemu_co_mutex_lock(&s
->table_lock
);
1597 ret
= qed_check(s
, result
, !!fix
);
1598 qemu_co_mutex_unlock(&s
->table_lock
);
1603 static QemuOptsList qed_create_opts
= {
1604 .name
= "qed-create-opts",
1605 .head
= QTAILQ_HEAD_INITIALIZER(qed_create_opts
.head
),
1608 .name
= BLOCK_OPT_SIZE
,
1609 .type
= QEMU_OPT_SIZE
,
1610 .help
= "Virtual disk size"
1613 .name
= BLOCK_OPT_BACKING_FILE
,
1614 .type
= QEMU_OPT_STRING
,
1615 .help
= "File name of a base image"
1618 .name
= BLOCK_OPT_BACKING_FMT
,
1619 .type
= QEMU_OPT_STRING
,
1620 .help
= "Image format of the base image"
1623 .name
= BLOCK_OPT_CLUSTER_SIZE
,
1624 .type
= QEMU_OPT_SIZE
,
1625 .help
= "Cluster size (in bytes)",
1626 .def_value_str
= stringify(QED_DEFAULT_CLUSTER_SIZE
)
1629 .name
= BLOCK_OPT_TABLE_SIZE
,
1630 .type
= QEMU_OPT_SIZE
,
1631 .help
= "L1/L2 table size (in clusters)"
1633 { /* end of list */ }
1637 static BlockDriver bdrv_qed
= {
1638 .format_name
= "qed",
1639 .instance_size
= sizeof(BDRVQEDState
),
1640 .create_opts
= &qed_create_opts
,
1642 .supports_backing
= true,
1644 .bdrv_probe
= bdrv_qed_probe
,
1645 .bdrv_open
= bdrv_qed_open
,
1646 .bdrv_close
= bdrv_qed_close
,
1647 .bdrv_reopen_prepare
= bdrv_qed_reopen_prepare
,
1648 .bdrv_child_perm
= bdrv_default_perms
,
1649 .bdrv_co_create
= bdrv_qed_co_create
,
1650 .bdrv_co_create_opts
= bdrv_qed_co_create_opts
,
1651 .bdrv_has_zero_init
= bdrv_has_zero_init_1
,
1652 .bdrv_co_block_status
= bdrv_qed_co_block_status
,
1653 .bdrv_co_readv
= bdrv_qed_co_readv
,
1654 .bdrv_co_writev
= bdrv_qed_co_writev
,
1655 .bdrv_co_pwrite_zeroes
= bdrv_qed_co_pwrite_zeroes
,
1656 .bdrv_co_truncate
= bdrv_qed_co_truncate
,
1657 .bdrv_co_getlength
= bdrv_qed_co_getlength
,
1658 .bdrv_co_get_info
= bdrv_qed_co_get_info
,
1659 .bdrv_refresh_limits
= bdrv_qed_refresh_limits
,
1660 .bdrv_change_backing_file
= bdrv_qed_change_backing_file
,
1661 .bdrv_co_invalidate_cache
= bdrv_qed_co_invalidate_cache
,
1662 .bdrv_co_check
= bdrv_qed_co_check
,
1663 .bdrv_detach_aio_context
= bdrv_qed_detach_aio_context
,
1664 .bdrv_attach_aio_context
= bdrv_qed_attach_aio_context
,
1665 .bdrv_drain_begin
= bdrv_qed_drain_begin
,
1668 static void bdrv_qed_init(void)
1670 bdrv_register(&bdrv_qed
);
1673 block_init(bdrv_qed_init
);