2 * Block driver for the QCOW version 2 format
4 * Copyright (c) 2004-2006 Fabrice Bellard
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #include "qemu/osdep.h"
26 #include "qapi/error.h"
27 #include "qemu-common.h"
28 #include "block/block_int.h"
30 #include "qemu/range.h"
31 #include "qemu/bswap.h"
32 #include "qemu/cutils.h"
34 static int64_t alloc_clusters_noref(BlockDriverState
*bs
, uint64_t size
,
36 static int QEMU_WARN_UNUSED_RESULT
update_refcount(BlockDriverState
*bs
,
37 int64_t offset
, int64_t length
, uint64_t addend
,
38 bool decrease
, enum qcow2_discard_type type
);
40 static uint64_t get_refcount_ro0(const void *refcount_array
, uint64_t index
);
41 static uint64_t get_refcount_ro1(const void *refcount_array
, uint64_t index
);
42 static uint64_t get_refcount_ro2(const void *refcount_array
, uint64_t index
);
43 static uint64_t get_refcount_ro3(const void *refcount_array
, uint64_t index
);
44 static uint64_t get_refcount_ro4(const void *refcount_array
, uint64_t index
);
45 static uint64_t get_refcount_ro5(const void *refcount_array
, uint64_t index
);
46 static uint64_t get_refcount_ro6(const void *refcount_array
, uint64_t index
);
48 static void set_refcount_ro0(void *refcount_array
, uint64_t index
,
50 static void set_refcount_ro1(void *refcount_array
, uint64_t index
,
52 static void set_refcount_ro2(void *refcount_array
, uint64_t index
,
54 static void set_refcount_ro3(void *refcount_array
, uint64_t index
,
56 static void set_refcount_ro4(void *refcount_array
, uint64_t index
,
58 static void set_refcount_ro5(void *refcount_array
, uint64_t index
,
60 static void set_refcount_ro6(void *refcount_array
, uint64_t index
,
64 static Qcow2GetRefcountFunc
*const get_refcount_funcs
[] = {
74 static Qcow2SetRefcountFunc
*const set_refcount_funcs
[] = {
85 /*********************************************************/
86 /* refcount handling */
88 static void update_max_refcount_table_index(BDRVQcow2State
*s
)
90 unsigned i
= s
->refcount_table_size
- 1;
91 while (i
> 0 && (s
->refcount_table
[i
] & REFT_OFFSET_MASK
) == 0) {
94 /* Set s->max_refcount_table_index to the index of the last used entry */
95 s
->max_refcount_table_index
= i
;
98 int qcow2_refcount_init(BlockDriverState
*bs
)
100 BDRVQcow2State
*s
= bs
->opaque
;
101 unsigned int refcount_table_size2
, i
;
104 assert(s
->refcount_order
>= 0 && s
->refcount_order
<= 6);
106 s
->get_refcount
= get_refcount_funcs
[s
->refcount_order
];
107 s
->set_refcount
= set_refcount_funcs
[s
->refcount_order
];
109 assert(s
->refcount_table_size
<= INT_MAX
/ sizeof(uint64_t));
110 refcount_table_size2
= s
->refcount_table_size
* sizeof(uint64_t);
111 s
->refcount_table
= g_try_malloc(refcount_table_size2
);
113 if (s
->refcount_table_size
> 0) {
114 if (s
->refcount_table
== NULL
) {
118 BLKDBG_EVENT(bs
->file
, BLKDBG_REFTABLE_LOAD
);
119 ret
= bdrv_pread(bs
->file
, s
->refcount_table_offset
,
120 s
->refcount_table
, refcount_table_size2
);
124 for(i
= 0; i
< s
->refcount_table_size
; i
++)
125 be64_to_cpus(&s
->refcount_table
[i
]);
126 update_max_refcount_table_index(s
);
133 void qcow2_refcount_close(BlockDriverState
*bs
)
135 BDRVQcow2State
*s
= bs
->opaque
;
136 g_free(s
->refcount_table
);
140 static uint64_t get_refcount_ro0(const void *refcount_array
, uint64_t index
)
142 return (((const uint8_t *)refcount_array
)[index
/ 8] >> (index
% 8)) & 0x1;
145 static void set_refcount_ro0(void *refcount_array
, uint64_t index
,
148 assert(!(value
>> 1));
149 ((uint8_t *)refcount_array
)[index
/ 8] &= ~(0x1 << (index
% 8));
150 ((uint8_t *)refcount_array
)[index
/ 8] |= value
<< (index
% 8);
153 static uint64_t get_refcount_ro1(const void *refcount_array
, uint64_t index
)
155 return (((const uint8_t *)refcount_array
)[index
/ 4] >> (2 * (index
% 4)))
159 static void set_refcount_ro1(void *refcount_array
, uint64_t index
,
162 assert(!(value
>> 2));
163 ((uint8_t *)refcount_array
)[index
/ 4] &= ~(0x3 << (2 * (index
% 4)));
164 ((uint8_t *)refcount_array
)[index
/ 4] |= value
<< (2 * (index
% 4));
167 static uint64_t get_refcount_ro2(const void *refcount_array
, uint64_t index
)
169 return (((const uint8_t *)refcount_array
)[index
/ 2] >> (4 * (index
% 2)))
173 static void set_refcount_ro2(void *refcount_array
, uint64_t index
,
176 assert(!(value
>> 4));
177 ((uint8_t *)refcount_array
)[index
/ 2] &= ~(0xf << (4 * (index
% 2)));
178 ((uint8_t *)refcount_array
)[index
/ 2] |= value
<< (4 * (index
% 2));
181 static uint64_t get_refcount_ro3(const void *refcount_array
, uint64_t index
)
183 return ((const uint8_t *)refcount_array
)[index
];
186 static void set_refcount_ro3(void *refcount_array
, uint64_t index
,
189 assert(!(value
>> 8));
190 ((uint8_t *)refcount_array
)[index
] = value
;
193 static uint64_t get_refcount_ro4(const void *refcount_array
, uint64_t index
)
195 return be16_to_cpu(((const uint16_t *)refcount_array
)[index
]);
198 static void set_refcount_ro4(void *refcount_array
, uint64_t index
,
201 assert(!(value
>> 16));
202 ((uint16_t *)refcount_array
)[index
] = cpu_to_be16(value
);
205 static uint64_t get_refcount_ro5(const void *refcount_array
, uint64_t index
)
207 return be32_to_cpu(((const uint32_t *)refcount_array
)[index
]);
210 static void set_refcount_ro5(void *refcount_array
, uint64_t index
,
213 assert(!(value
>> 32));
214 ((uint32_t *)refcount_array
)[index
] = cpu_to_be32(value
);
217 static uint64_t get_refcount_ro6(const void *refcount_array
, uint64_t index
)
219 return be64_to_cpu(((const uint64_t *)refcount_array
)[index
]);
222 static void set_refcount_ro6(void *refcount_array
, uint64_t index
,
225 ((uint64_t *)refcount_array
)[index
] = cpu_to_be64(value
);
229 static int load_refcount_block(BlockDriverState
*bs
,
230 int64_t refcount_block_offset
,
231 void **refcount_block
)
233 BDRVQcow2State
*s
= bs
->opaque
;
235 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_LOAD
);
236 return qcow2_cache_get(bs
, s
->refcount_block_cache
, refcount_block_offset
,
241 * Retrieves the refcount of the cluster given by its index and stores it in
242 * *refcount. Returns 0 on success and -errno on failure.
244 int qcow2_get_refcount(BlockDriverState
*bs
, int64_t cluster_index
,
247 BDRVQcow2State
*s
= bs
->opaque
;
248 uint64_t refcount_table_index
, block_index
;
249 int64_t refcount_block_offset
;
251 void *refcount_block
;
253 refcount_table_index
= cluster_index
>> s
->refcount_block_bits
;
254 if (refcount_table_index
>= s
->refcount_table_size
) {
258 refcount_block_offset
=
259 s
->refcount_table
[refcount_table_index
] & REFT_OFFSET_MASK
;
260 if (!refcount_block_offset
) {
265 if (offset_into_cluster(s
, refcount_block_offset
)) {
266 qcow2_signal_corruption(bs
, true, -1, -1, "Refblock offset %#" PRIx64
267 " unaligned (reftable index: %#" PRIx64
")",
268 refcount_block_offset
, refcount_table_index
);
272 ret
= qcow2_cache_get(bs
, s
->refcount_block_cache
, refcount_block_offset
,
278 block_index
= cluster_index
& (s
->refcount_block_size
- 1);
279 *refcount
= s
->get_refcount(refcount_block
, block_index
);
281 qcow2_cache_put(s
->refcount_block_cache
, &refcount_block
);
286 /* Checks if two offsets are described by the same refcount block */
287 static int in_same_refcount_block(BDRVQcow2State
*s
, uint64_t offset_a
,
290 uint64_t block_a
= offset_a
>> (s
->cluster_bits
+ s
->refcount_block_bits
);
291 uint64_t block_b
= offset_b
>> (s
->cluster_bits
+ s
->refcount_block_bits
);
293 return (block_a
== block_b
);
297 * Loads a refcount block. If it doesn't exist yet, it is allocated first
298 * (including growing the refcount table if needed).
300 * Returns 0 on success or -errno in error case
302 static int alloc_refcount_block(BlockDriverState
*bs
,
303 int64_t cluster_index
, void **refcount_block
)
305 BDRVQcow2State
*s
= bs
->opaque
;
306 unsigned int refcount_table_index
;
309 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC
);
311 /* Find the refcount block for the given cluster */
312 refcount_table_index
= cluster_index
>> s
->refcount_block_bits
;
314 if (refcount_table_index
< s
->refcount_table_size
) {
316 uint64_t refcount_block_offset
=
317 s
->refcount_table
[refcount_table_index
] & REFT_OFFSET_MASK
;
319 /* If it's already there, we're done */
320 if (refcount_block_offset
) {
321 if (offset_into_cluster(s
, refcount_block_offset
)) {
322 qcow2_signal_corruption(bs
, true, -1, -1, "Refblock offset %#"
323 PRIx64
" unaligned (reftable index: "
324 "%#x)", refcount_block_offset
,
325 refcount_table_index
);
329 return load_refcount_block(bs
, refcount_block_offset
,
335 * If we came here, we need to allocate something. Something is at least
336 * a cluster for the new refcount block. It may also include a new refcount
337 * table if the old refcount table is too small.
339 * Note that allocating clusters here needs some special care:
341 * - We can't use the normal qcow2_alloc_clusters(), it would try to
342 * increase the refcount and very likely we would end up with an endless
343 * recursion. Instead we must place the refcount blocks in a way that
344 * they can describe them themselves.
346 * - We need to consider that at this point we are inside update_refcounts
347 * and potentially doing an initial refcount increase. This means that
348 * some clusters have already been allocated by the caller, but their
349 * refcount isn't accurate yet. If we allocate clusters for metadata, we
350 * need to return -EAGAIN to signal the caller that it needs to restart
351 * the search for free clusters.
353 * - alloc_clusters_noref and qcow2_free_clusters may load a different
354 * refcount block into the cache
357 *refcount_block
= NULL
;
359 /* We write to the refcount table, so we might depend on L2 tables */
360 ret
= qcow2_cache_flush(bs
, s
->l2_table_cache
);
365 /* Allocate the refcount block itself and mark it as used */
366 int64_t new_block
= alloc_clusters_noref(bs
, s
->cluster_size
, INT64_MAX
);
371 /* The offset must fit in the offset field of the refcount table entry */
372 assert((new_block
& REFT_OFFSET_MASK
) == new_block
);
374 /* If we're allocating the block at offset 0 then something is wrong */
375 if (new_block
== 0) {
376 qcow2_signal_corruption(bs
, true, -1, -1, "Preventing invalid "
377 "allocation of refcount block at offset 0");
382 fprintf(stderr
, "qcow2: Allocate refcount block %d for %" PRIx64
384 refcount_table_index
, cluster_index
<< s
->cluster_bits
, new_block
);
387 if (in_same_refcount_block(s
, new_block
, cluster_index
<< s
->cluster_bits
)) {
388 /* Zero the new refcount block before updating it */
389 ret
= qcow2_cache_get_empty(bs
, s
->refcount_block_cache
, new_block
,
395 memset(*refcount_block
, 0, s
->cluster_size
);
397 /* The block describes itself, need to update the cache */
398 int block_index
= (new_block
>> s
->cluster_bits
) &
399 (s
->refcount_block_size
- 1);
400 s
->set_refcount(*refcount_block
, block_index
, 1);
402 /* Described somewhere else. This can recurse at most twice before we
403 * arrive at a block that describes itself. */
404 ret
= update_refcount(bs
, new_block
, s
->cluster_size
, 1, false,
405 QCOW2_DISCARD_NEVER
);
410 ret
= qcow2_cache_flush(bs
, s
->refcount_block_cache
);
415 /* Initialize the new refcount block only after updating its refcount,
416 * update_refcount uses the refcount cache itself */
417 ret
= qcow2_cache_get_empty(bs
, s
->refcount_block_cache
, new_block
,
423 memset(*refcount_block
, 0, s
->cluster_size
);
426 /* Now the new refcount block needs to be written to disk */
427 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC_WRITE
);
428 qcow2_cache_entry_mark_dirty(s
->refcount_block_cache
, *refcount_block
);
429 ret
= qcow2_cache_flush(bs
, s
->refcount_block_cache
);
434 /* If the refcount table is big enough, just hook the block up there */
435 if (refcount_table_index
< s
->refcount_table_size
) {
436 uint64_t data64
= cpu_to_be64(new_block
);
437 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC_HOOKUP
);
438 ret
= bdrv_pwrite_sync(bs
->file
,
439 s
->refcount_table_offset
+ refcount_table_index
* sizeof(uint64_t),
440 &data64
, sizeof(data64
));
445 s
->refcount_table
[refcount_table_index
] = new_block
;
446 /* If there's a hole in s->refcount_table then it can happen
447 * that refcount_table_index < s->max_refcount_table_index */
448 s
->max_refcount_table_index
=
449 MAX(s
->max_refcount_table_index
, refcount_table_index
);
451 /* The new refcount block may be where the caller intended to put its
452 * data, so let it restart the search. */
456 qcow2_cache_put(s
->refcount_block_cache
, refcount_block
);
459 * If we come here, we need to grow the refcount table. Again, a new
460 * refcount table needs some space and we can't simply allocate to avoid
463 * Therefore let's grab new refcount blocks at the end of the image, which
464 * will describe themselves and the new refcount table. This way we can
465 * reference them only in the new table and do the switch to the new
466 * refcount table at once without producing an inconsistent state in
469 BLKDBG_EVENT(bs
->file
, BLKDBG_REFTABLE_GROW
);
471 /* Calculate the number of refcount blocks needed so far; this will be the
472 * basis for calculating the index of the first cluster used for the
473 * self-describing refcount structures which we are about to create.
475 * Because we reached this point, there cannot be any refcount entries for
476 * cluster_index or higher indices yet. However, because new_block has been
477 * allocated to describe that cluster (and it will assume this role later
478 * on), we cannot use that index; also, new_block may actually have a higher
479 * cluster index than cluster_index, so it needs to be taken into account
480 * here (and 1 needs to be added to its value because that cluster is used).
482 uint64_t blocks_used
= DIV_ROUND_UP(MAX(cluster_index
+ 1,
483 (new_block
>> s
->cluster_bits
) + 1),
484 s
->refcount_block_size
);
486 /* Create the new refcount table and blocks */
487 uint64_t meta_offset
= (blocks_used
* s
->refcount_block_size
) *
490 ret
= qcow2_refcount_area(bs
, meta_offset
, 0, false,
491 refcount_table_index
, new_block
);
496 ret
= load_refcount_block(bs
, new_block
, refcount_block
);
501 /* If we were trying to do the initial refcount update for some cluster
502 * allocation, we might have used the same clusters to store newly
503 * allocated metadata. Make the caller search some new space. */
507 if (*refcount_block
!= NULL
) {
508 qcow2_cache_put(s
->refcount_block_cache
, refcount_block
);
514 * Starting at @start_offset, this function creates new self-covering refcount
515 * structures: A new refcount table and refcount blocks which cover all of
516 * themselves, and a number of @additional_clusters beyond their end.
517 * @start_offset must be at the end of the image file, that is, there must be
518 * only empty space beyond it.
519 * If @exact_size is false, the refcount table will have 50 % more entries than
520 * necessary so it will not need to grow again soon.
521 * If @new_refblock_offset is not zero, it contains the offset of a refcount
522 * block that should be entered into the new refcount table at index
523 * @new_refblock_index.
525 * Returns: The offset after the new refcount structures (i.e. where the
526 * @additional_clusters may be placed) on success, -errno on error.
528 int64_t qcow2_refcount_area(BlockDriverState
*bs
, uint64_t start_offset
,
529 uint64_t additional_clusters
, bool exact_size
,
530 int new_refblock_index
,
531 uint64_t new_refblock_offset
)
533 BDRVQcow2State
*s
= bs
->opaque
;
534 uint64_t total_refblock_count_u64
, additional_refblock_count
;
535 int total_refblock_count
, table_size
, area_reftable_index
, table_clusters
;
537 uint64_t table_offset
, block_offset
, end_offset
;
541 assert(!(start_offset
% s
->cluster_size
));
543 qcow2_refcount_metadata_size(start_offset
/ s
->cluster_size
+
545 s
->cluster_size
, s
->refcount_order
,
546 !exact_size
, &total_refblock_count_u64
);
547 if (total_refblock_count_u64
> QCOW_MAX_REFTABLE_SIZE
) {
550 total_refblock_count
= total_refblock_count_u64
;
552 /* Index in the refcount table of the first refcount block to cover the area
553 * of refcount structures we are about to create; we know that
554 * @total_refblock_count can cover @start_offset, so this will definitely
555 * fit into an int. */
556 area_reftable_index
= (start_offset
/ s
->cluster_size
) /
557 s
->refcount_block_size
;
560 table_size
= total_refblock_count
;
562 table_size
= total_refblock_count
+
563 DIV_ROUND_UP(total_refblock_count
, 2);
565 /* The qcow2 file can only store the reftable size in number of clusters */
566 table_size
= ROUND_UP(table_size
, s
->cluster_size
/ sizeof(uint64_t));
567 table_clusters
= (table_size
* sizeof(uint64_t)) / s
->cluster_size
;
569 if (table_size
> QCOW_MAX_REFTABLE_SIZE
) {
573 new_table
= g_try_new0(uint64_t, table_size
);
575 assert(table_size
> 0);
576 if (new_table
== NULL
) {
581 /* Fill the new refcount table */
582 if (table_size
> s
->max_refcount_table_index
) {
583 /* We're actually growing the reftable */
584 memcpy(new_table
, s
->refcount_table
,
585 (s
->max_refcount_table_index
+ 1) * sizeof(uint64_t));
587 /* Improbable case: We're shrinking the reftable. However, the caller
588 * has assured us that there is only empty space beyond @start_offset,
589 * so we can simply drop all of the refblocks that won't fit into the
591 memcpy(new_table
, s
->refcount_table
, table_size
* sizeof(uint64_t));
594 if (new_refblock_offset
) {
595 assert(new_refblock_index
< total_refblock_count
);
596 new_table
[new_refblock_index
] = new_refblock_offset
;
599 /* Count how many new refblocks we have to create */
600 additional_refblock_count
= 0;
601 for (i
= area_reftable_index
; i
< total_refblock_count
; i
++) {
603 additional_refblock_count
++;
607 table_offset
= start_offset
+ additional_refblock_count
* s
->cluster_size
;
608 end_offset
= table_offset
+ table_clusters
* s
->cluster_size
;
610 /* Fill the refcount blocks, and create new ones, if necessary */
611 block_offset
= start_offset
;
612 for (i
= area_reftable_index
; i
< total_refblock_count
; i
++) {
614 uint64_t first_offset_covered
;
616 /* Reuse an existing refblock if possible, create a new one otherwise */
618 ret
= qcow2_cache_get(bs
, s
->refcount_block_cache
, new_table
[i
],
624 ret
= qcow2_cache_get_empty(bs
, s
->refcount_block_cache
,
625 block_offset
, &refblock_data
);
629 memset(refblock_data
, 0, s
->cluster_size
);
630 qcow2_cache_entry_mark_dirty(s
->refcount_block_cache
,
633 new_table
[i
] = block_offset
;
634 block_offset
+= s
->cluster_size
;
637 /* First host offset covered by this refblock */
638 first_offset_covered
= (uint64_t)i
* s
->refcount_block_size
*
640 if (first_offset_covered
< end_offset
) {
643 /* Set the refcount of all of the new refcount structures to 1 */
645 if (first_offset_covered
< start_offset
) {
646 assert(i
== area_reftable_index
);
647 j
= (start_offset
- first_offset_covered
) / s
->cluster_size
;
648 assert(j
< s
->refcount_block_size
);
653 end_index
= MIN((end_offset
- first_offset_covered
) /
655 s
->refcount_block_size
);
657 for (; j
< end_index
; j
++) {
658 /* The caller guaranteed us this space would be empty */
659 assert(s
->get_refcount(refblock_data
, j
) == 0);
660 s
->set_refcount(refblock_data
, j
, 1);
663 qcow2_cache_entry_mark_dirty(s
->refcount_block_cache
,
667 qcow2_cache_put(s
->refcount_block_cache
, &refblock_data
);
670 assert(block_offset
== table_offset
);
672 /* Write refcount blocks to disk */
673 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC_WRITE_BLOCKS
);
674 ret
= qcow2_cache_flush(bs
, s
->refcount_block_cache
);
679 /* Write refcount table to disk */
680 for (i
= 0; i
< total_refblock_count
; i
++) {
681 cpu_to_be64s(&new_table
[i
]);
684 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC_WRITE_TABLE
);
685 ret
= bdrv_pwrite_sync(bs
->file
, table_offset
, new_table
,
686 table_size
* sizeof(uint64_t));
691 for (i
= 0; i
< total_refblock_count
; i
++) {
692 be64_to_cpus(&new_table
[i
]);
695 /* Hook up the new refcount table in the qcow2 header */
700 data
.d64
= cpu_to_be64(table_offset
);
701 data
.d32
= cpu_to_be32(table_clusters
);
702 BLKDBG_EVENT(bs
->file
, BLKDBG_REFBLOCK_ALLOC_SWITCH_TABLE
);
703 ret
= bdrv_pwrite_sync(bs
->file
,
704 offsetof(QCowHeader
, refcount_table_offset
),
705 &data
, sizeof(data
));
710 /* And switch it in memory */
711 uint64_t old_table_offset
= s
->refcount_table_offset
;
712 uint64_t old_table_size
= s
->refcount_table_size
;
714 g_free(s
->refcount_table
);
715 s
->refcount_table
= new_table
;
716 s
->refcount_table_size
= table_size
;
717 s
->refcount_table_offset
= table_offset
;
718 update_max_refcount_table_index(s
);
720 /* Free old table. */
721 qcow2_free_clusters(bs
, old_table_offset
, old_table_size
* sizeof(uint64_t),
722 QCOW2_DISCARD_OTHER
);
731 void qcow2_process_discards(BlockDriverState
*bs
, int ret
)
733 BDRVQcow2State
*s
= bs
->opaque
;
734 Qcow2DiscardRegion
*d
, *next
;
736 QTAILQ_FOREACH_SAFE(d
, &s
->discards
, next
, next
) {
737 QTAILQ_REMOVE(&s
->discards
, d
, next
);
739 /* Discard is optional, ignore the return value */
741 bdrv_pdiscard(bs
->file
, d
->offset
, d
->bytes
);
748 static void update_refcount_discard(BlockDriverState
*bs
,
749 uint64_t offset
, uint64_t length
)
751 BDRVQcow2State
*s
= bs
->opaque
;
752 Qcow2DiscardRegion
*d
, *p
, *next
;
754 QTAILQ_FOREACH(d
, &s
->discards
, next
) {
755 uint64_t new_start
= MIN(offset
, d
->offset
);
756 uint64_t new_end
= MAX(offset
+ length
, d
->offset
+ d
->bytes
);
758 if (new_end
- new_start
<= length
+ d
->bytes
) {
759 /* There can't be any overlap, areas ending up here have no
760 * references any more and therefore shouldn't get freed another
762 assert(d
->bytes
+ length
== new_end
- new_start
);
763 d
->offset
= new_start
;
764 d
->bytes
= new_end
- new_start
;
769 d
= g_malloc(sizeof(*d
));
770 *d
= (Qcow2DiscardRegion
) {
775 QTAILQ_INSERT_TAIL(&s
->discards
, d
, next
);
778 /* Merge discard requests if they are adjacent now */
779 QTAILQ_FOREACH_SAFE(p
, &s
->discards
, next
, next
) {
781 || p
->offset
> d
->offset
+ d
->bytes
782 || d
->offset
> p
->offset
+ p
->bytes
)
787 /* Still no overlap possible */
788 assert(p
->offset
== d
->offset
+ d
->bytes
789 || d
->offset
== p
->offset
+ p
->bytes
);
791 QTAILQ_REMOVE(&s
->discards
, p
, next
);
792 d
->offset
= MIN(d
->offset
, p
->offset
);
793 d
->bytes
+= p
->bytes
;
798 /* XXX: cache several refcount block clusters ? */
799 /* @addend is the absolute value of the addend; if @decrease is set, @addend
800 * will be subtracted from the current refcount, otherwise it will be added */
801 static int QEMU_WARN_UNUSED_RESULT
update_refcount(BlockDriverState
*bs
,
806 enum qcow2_discard_type type
)
808 BDRVQcow2State
*s
= bs
->opaque
;
809 int64_t start
, last
, cluster_offset
;
810 void *refcount_block
= NULL
;
811 int64_t old_table_index
= -1;
815 fprintf(stderr
, "update_refcount: offset=%" PRId64
" size=%" PRId64
816 " addend=%s%" PRIu64
"\n", offset
, length
, decrease
? "-" : "",
821 } else if (length
== 0) {
826 qcow2_cache_set_dependency(bs
, s
->refcount_block_cache
,
830 start
= start_of_cluster(s
, offset
);
831 last
= start_of_cluster(s
, offset
+ length
- 1);
832 for(cluster_offset
= start
; cluster_offset
<= last
;
833 cluster_offset
+= s
->cluster_size
)
837 int64_t cluster_index
= cluster_offset
>> s
->cluster_bits
;
838 int64_t table_index
= cluster_index
>> s
->refcount_block_bits
;
840 /* Load the refcount block and allocate it if needed */
841 if (table_index
!= old_table_index
) {
842 if (refcount_block
) {
843 qcow2_cache_put(s
->refcount_block_cache
, &refcount_block
);
845 ret
= alloc_refcount_block(bs
, cluster_index
, &refcount_block
);
846 /* If the caller needs to restart the search for free clusters,
847 * try the same ones first to see if they're still free. */
848 if (ret
== -EAGAIN
) {
849 if (s
->free_cluster_index
> (start
>> s
->cluster_bits
)) {
850 s
->free_cluster_index
= (start
>> s
->cluster_bits
);
857 old_table_index
= table_index
;
859 qcow2_cache_entry_mark_dirty(s
->refcount_block_cache
, refcount_block
);
861 /* we can update the count and save it */
862 block_index
= cluster_index
& (s
->refcount_block_size
- 1);
864 refcount
= s
->get_refcount(refcount_block
, block_index
);
865 if (decrease
? (refcount
- addend
> refcount
)
866 : (refcount
+ addend
< refcount
||
867 refcount
+ addend
> s
->refcount_max
))
877 if (refcount
== 0 && cluster_index
< s
->free_cluster_index
) {
878 s
->free_cluster_index
= cluster_index
;
880 s
->set_refcount(refcount_block
, block_index
, refcount
);
885 table
= qcow2_cache_is_table_offset(s
->refcount_block_cache
,
888 qcow2_cache_put(s
->refcount_block_cache
, &refcount_block
);
889 qcow2_cache_discard(s
->refcount_block_cache
, table
);
892 table
= qcow2_cache_is_table_offset(s
->l2_table_cache
, offset
);
894 qcow2_cache_discard(s
->l2_table_cache
, table
);
897 if (s
->discard_passthrough
[type
]) {
898 update_refcount_discard(bs
, cluster_offset
, s
->cluster_size
);
905 if (!s
->cache_discards
) {
906 qcow2_process_discards(bs
, ret
);
909 /* Write last changed block to disk */
910 if (refcount_block
) {
911 qcow2_cache_put(s
->refcount_block_cache
, &refcount_block
);
915 * Try do undo any updates if an error is returned (This may succeed in
916 * some cases like ENOSPC for allocating a new refcount block)
920 dummy
= update_refcount(bs
, offset
, cluster_offset
- offset
, addend
,
921 !decrease
, QCOW2_DISCARD_NEVER
);
929 * Increases or decreases the refcount of a given cluster.
931 * @addend is the absolute value of the addend; if @decrease is set, @addend
932 * will be subtracted from the current refcount, otherwise it will be added.
934 * On success 0 is returned; on failure -errno is returned.
936 int qcow2_update_cluster_refcount(BlockDriverState
*bs
,
937 int64_t cluster_index
,
938 uint64_t addend
, bool decrease
,
939 enum qcow2_discard_type type
)
941 BDRVQcow2State
*s
= bs
->opaque
;
944 ret
= update_refcount(bs
, cluster_index
<< s
->cluster_bits
, 1, addend
,
955 /*********************************************************/
956 /* cluster allocation functions */
960 /* return < 0 if error */
961 static int64_t alloc_clusters_noref(BlockDriverState
*bs
, uint64_t size
,
964 BDRVQcow2State
*s
= bs
->opaque
;
965 uint64_t i
, nb_clusters
, refcount
;
968 /* We can't allocate clusters if they may still be queued for discard. */
969 if (s
->cache_discards
) {
970 qcow2_process_discards(bs
, 0);
973 nb_clusters
= size_to_clusters(s
, size
);
975 for(i
= 0; i
< nb_clusters
; i
++) {
976 uint64_t next_cluster_index
= s
->free_cluster_index
++;
977 ret
= qcow2_get_refcount(bs
, next_cluster_index
, &refcount
);
981 } else if (refcount
!= 0) {
986 /* Make sure that all offsets in the "allocated" range are representable
987 * in the requested max */
988 if (s
->free_cluster_index
> 0 &&
989 s
->free_cluster_index
- 1 > (max
>> s
->cluster_bits
))
995 fprintf(stderr
, "alloc_clusters: size=%" PRId64
" -> %" PRId64
"\n",
997 (s
->free_cluster_index
- nb_clusters
) << s
->cluster_bits
);
999 return (s
->free_cluster_index
- nb_clusters
) << s
->cluster_bits
;
1002 int64_t qcow2_alloc_clusters(BlockDriverState
*bs
, uint64_t size
)
1007 BLKDBG_EVENT(bs
->file
, BLKDBG_CLUSTER_ALLOC
);
1009 offset
= alloc_clusters_noref(bs
, size
, QCOW_MAX_CLUSTER_OFFSET
);
1014 ret
= update_refcount(bs
, offset
, size
, 1, false, QCOW2_DISCARD_NEVER
);
1015 } while (ret
== -EAGAIN
);
1024 int64_t qcow2_alloc_clusters_at(BlockDriverState
*bs
, uint64_t offset
,
1025 int64_t nb_clusters
)
1027 BDRVQcow2State
*s
= bs
->opaque
;
1028 uint64_t cluster_index
, refcount
;
1032 assert(nb_clusters
>= 0);
1033 if (nb_clusters
== 0) {
1038 /* Check how many clusters there are free */
1039 cluster_index
= offset
>> s
->cluster_bits
;
1040 for(i
= 0; i
< nb_clusters
; i
++) {
1041 ret
= qcow2_get_refcount(bs
, cluster_index
++, &refcount
);
1044 } else if (refcount
!= 0) {
1049 /* And then allocate them */
1050 ret
= update_refcount(bs
, offset
, i
<< s
->cluster_bits
, 1, false,
1051 QCOW2_DISCARD_NEVER
);
1052 } while (ret
== -EAGAIN
);
1061 /* only used to allocate compressed sectors. We try to allocate
1062 contiguous sectors. size must be <= cluster_size */
1063 int64_t qcow2_alloc_bytes(BlockDriverState
*bs
, int size
)
1065 BDRVQcow2State
*s
= bs
->opaque
;
1067 size_t free_in_cluster
;
1070 BLKDBG_EVENT(bs
->file
, BLKDBG_CLUSTER_ALLOC_BYTES
);
1071 assert(size
> 0 && size
<= s
->cluster_size
);
1072 assert(!s
->free_byte_offset
|| offset_into_cluster(s
, s
->free_byte_offset
));
1074 offset
= s
->free_byte_offset
;
1078 ret
= qcow2_get_refcount(bs
, offset
>> s
->cluster_bits
, &refcount
);
1083 if (refcount
== s
->refcount_max
) {
1088 free_in_cluster
= s
->cluster_size
- offset_into_cluster(s
, offset
);
1090 if (!offset
|| free_in_cluster
< size
) {
1091 int64_t new_cluster
;
1093 new_cluster
= alloc_clusters_noref(bs
, s
->cluster_size
,
1094 MIN(s
->cluster_offset_mask
,
1095 QCOW_MAX_CLUSTER_OFFSET
));
1096 if (new_cluster
< 0) {
1100 if (new_cluster
== 0) {
1101 qcow2_signal_corruption(bs
, true, -1, -1, "Preventing invalid "
1102 "allocation of compressed cluster "
1107 if (!offset
|| ROUND_UP(offset
, s
->cluster_size
) != new_cluster
) {
1108 offset
= new_cluster
;
1109 free_in_cluster
= s
->cluster_size
;
1111 free_in_cluster
+= s
->cluster_size
;
1116 ret
= update_refcount(bs
, offset
, size
, 1, false, QCOW2_DISCARD_NEVER
);
1120 } while (ret
== -EAGAIN
);
1125 /* The cluster refcount was incremented; refcount blocks must be flushed
1126 * before the caller's L2 table updates. */
1127 qcow2_cache_set_dependency(bs
, s
->l2_table_cache
, s
->refcount_block_cache
);
1129 s
->free_byte_offset
= offset
+ size
;
1130 if (!offset_into_cluster(s
, s
->free_byte_offset
)) {
1131 s
->free_byte_offset
= 0;
1137 void qcow2_free_clusters(BlockDriverState
*bs
,
1138 int64_t offset
, int64_t size
,
1139 enum qcow2_discard_type type
)
1143 BLKDBG_EVENT(bs
->file
, BLKDBG_CLUSTER_FREE
);
1144 ret
= update_refcount(bs
, offset
, size
, 1, true, type
);
1146 fprintf(stderr
, "qcow2_free_clusters failed: %s\n", strerror(-ret
));
1147 /* TODO Remember the clusters to free them later and avoid leaking */
1152 * Free a cluster using its L2 entry (handles clusters of all types, e.g.
1153 * normal cluster, compressed cluster, etc.)
1155 void qcow2_free_any_clusters(BlockDriverState
*bs
, uint64_t l2_entry
,
1156 int nb_clusters
, enum qcow2_discard_type type
)
1158 BDRVQcow2State
*s
= bs
->opaque
;
1159 QCow2ClusterType ctype
= qcow2_get_cluster_type(bs
, l2_entry
);
1161 if (has_data_file(bs
)) {
1162 if (s
->discard_passthrough
[type
] &&
1163 (ctype
== QCOW2_CLUSTER_NORMAL
||
1164 ctype
== QCOW2_CLUSTER_ZERO_ALLOC
))
1166 bdrv_pdiscard(s
->data_file
, l2_entry
& L2E_OFFSET_MASK
,
1167 nb_clusters
<< s
->cluster_bits
);
1173 case QCOW2_CLUSTER_COMPRESSED
:
1175 int64_t offset
= (l2_entry
& s
->cluster_offset_mask
)
1176 & QCOW2_COMPRESSED_SECTOR_MASK
;
1177 int size
= QCOW2_COMPRESSED_SECTOR_SIZE
*
1178 (((l2_entry
>> s
->csize_shift
) & s
->csize_mask
) + 1);
1179 qcow2_free_clusters(bs
, offset
, size
, type
);
1182 case QCOW2_CLUSTER_NORMAL
:
1183 case QCOW2_CLUSTER_ZERO_ALLOC
:
1184 if (offset_into_cluster(s
, l2_entry
& L2E_OFFSET_MASK
)) {
1185 qcow2_signal_corruption(bs
, false, -1, -1,
1186 "Cannot free unaligned cluster %#llx",
1187 l2_entry
& L2E_OFFSET_MASK
);
1189 qcow2_free_clusters(bs
, l2_entry
& L2E_OFFSET_MASK
,
1190 nb_clusters
<< s
->cluster_bits
, type
);
1193 case QCOW2_CLUSTER_ZERO_PLAIN
:
1194 case QCOW2_CLUSTER_UNALLOCATED
:
1201 int coroutine_fn
qcow2_write_caches(BlockDriverState
*bs
)
1203 BDRVQcow2State
*s
= bs
->opaque
;
1206 ret
= qcow2_cache_write(bs
, s
->l2_table_cache
);
1211 if (qcow2_need_accurate_refcounts(s
)) {
1212 ret
= qcow2_cache_write(bs
, s
->refcount_block_cache
);
1221 int coroutine_fn
qcow2_flush_caches(BlockDriverState
*bs
)
1223 int ret
= qcow2_write_caches(bs
);
1228 return bdrv_flush(bs
->file
->bs
);
1231 /*********************************************************/
1232 /* snapshots and image creation */
1236 /* update the refcounts of snapshots and the copied flag */
1237 int qcow2_update_snapshot_refcount(BlockDriverState
*bs
,
1238 int64_t l1_table_offset
, int l1_size
, int addend
)
1240 BDRVQcow2State
*s
= bs
->opaque
;
1241 uint64_t *l1_table
, *l2_slice
, l2_offset
, entry
, l1_size2
, refcount
;
1242 bool l1_allocated
= false;
1243 int64_t old_entry
, old_l2_offset
;
1244 unsigned slice
, slice_size2
, n_slices
;
1245 int i
, j
, l1_modified
= 0, nb_csectors
;
1248 assert(addend
>= -1 && addend
<= 1);
1252 l1_size2
= l1_size
* sizeof(uint64_t);
1253 slice_size2
= s
->l2_slice_size
* sizeof(uint64_t);
1254 n_slices
= s
->cluster_size
/ slice_size2
;
1256 s
->cache_discards
= true;
1258 /* WARNING: qcow2_snapshot_goto relies on this function not using the
1259 * l1_table_offset when it is the current s->l1_table_offset! Be careful
1260 * when changing this! */
1261 if (l1_table_offset
!= s
->l1_table_offset
) {
1262 l1_table
= g_try_malloc0(ROUND_UP(l1_size2
, 512));
1263 if (l1_size2
&& l1_table
== NULL
) {
1267 l1_allocated
= true;
1269 ret
= bdrv_pread(bs
->file
, l1_table_offset
, l1_table
, l1_size2
);
1274 for (i
= 0; i
< l1_size
; i
++) {
1275 be64_to_cpus(&l1_table
[i
]);
1278 assert(l1_size
== s
->l1_size
);
1279 l1_table
= s
->l1_table
;
1280 l1_allocated
= false;
1283 for (i
= 0; i
< l1_size
; i
++) {
1284 l2_offset
= l1_table
[i
];
1286 old_l2_offset
= l2_offset
;
1287 l2_offset
&= L1E_OFFSET_MASK
;
1289 if (offset_into_cluster(s
, l2_offset
)) {
1290 qcow2_signal_corruption(bs
, true, -1, -1, "L2 table offset %#"
1291 PRIx64
" unaligned (L1 index: %#x)",
1297 for (slice
= 0; slice
< n_slices
; slice
++) {
1298 ret
= qcow2_cache_get(bs
, s
->l2_table_cache
,
1299 l2_offset
+ slice
* slice_size2
,
1300 (void **) &l2_slice
);
1305 for (j
= 0; j
< s
->l2_slice_size
; j
++) {
1306 uint64_t cluster_index
;
1309 entry
= be64_to_cpu(l2_slice
[j
]);
1311 entry
&= ~QCOW_OFLAG_COPIED
;
1312 offset
= entry
& L2E_OFFSET_MASK
;
1314 switch (qcow2_get_cluster_type(bs
, entry
)) {
1315 case QCOW2_CLUSTER_COMPRESSED
:
1316 nb_csectors
= ((entry
>> s
->csize_shift
) &
1319 uint64_t coffset
= (entry
& s
->cluster_offset_mask
)
1320 & QCOW2_COMPRESSED_SECTOR_MASK
;
1321 ret
= update_refcount(
1323 nb_csectors
* QCOW2_COMPRESSED_SECTOR_SIZE
,
1324 abs(addend
), addend
< 0,
1325 QCOW2_DISCARD_SNAPSHOT
);
1330 /* compressed clusters are never modified */
1334 case QCOW2_CLUSTER_NORMAL
:
1335 case QCOW2_CLUSTER_ZERO_ALLOC
:
1336 if (offset_into_cluster(s
, offset
)) {
1337 /* Here l2_index means table (not slice) index */
1338 int l2_index
= slice
* s
->l2_slice_size
+ j
;
1339 qcow2_signal_corruption(
1340 bs
, true, -1, -1, "Cluster "
1341 "allocation offset %#" PRIx64
1342 " unaligned (L2 offset: %#"
1343 PRIx64
", L2 index: %#x)",
1344 offset
, l2_offset
, l2_index
);
1349 cluster_index
= offset
>> s
->cluster_bits
;
1350 assert(cluster_index
);
1352 ret
= qcow2_update_cluster_refcount(
1353 bs
, cluster_index
, abs(addend
), addend
< 0,
1354 QCOW2_DISCARD_SNAPSHOT
);
1360 ret
= qcow2_get_refcount(bs
, cluster_index
, &refcount
);
1366 case QCOW2_CLUSTER_ZERO_PLAIN
:
1367 case QCOW2_CLUSTER_UNALLOCATED
:
1375 if (refcount
== 1) {
1376 entry
|= QCOW_OFLAG_COPIED
;
1378 if (entry
!= old_entry
) {
1380 qcow2_cache_set_dependency(bs
, s
->l2_table_cache
,
1381 s
->refcount_block_cache
);
1383 l2_slice
[j
] = cpu_to_be64(entry
);
1384 qcow2_cache_entry_mark_dirty(s
->l2_table_cache
,
1389 qcow2_cache_put(s
->l2_table_cache
, (void **) &l2_slice
);
1393 ret
= qcow2_update_cluster_refcount(bs
, l2_offset
>>
1395 abs(addend
), addend
< 0,
1396 QCOW2_DISCARD_SNAPSHOT
);
1401 ret
= qcow2_get_refcount(bs
, l2_offset
>> s
->cluster_bits
,
1405 } else if (refcount
== 1) {
1406 l2_offset
|= QCOW_OFLAG_COPIED
;
1408 if (l2_offset
!= old_l2_offset
) {
1409 l1_table
[i
] = l2_offset
;
1415 ret
= bdrv_flush(bs
);
1418 qcow2_cache_put(s
->l2_table_cache
, (void **) &l2_slice
);
1421 s
->cache_discards
= false;
1422 qcow2_process_discards(bs
, ret
);
1424 /* Update L1 only if it isn't deleted anyway (addend = -1) */
1425 if (ret
== 0 && addend
>= 0 && l1_modified
) {
1426 for (i
= 0; i
< l1_size
; i
++) {
1427 cpu_to_be64s(&l1_table
[i
]);
1430 ret
= bdrv_pwrite_sync(bs
->file
, l1_table_offset
,
1431 l1_table
, l1_size2
);
1433 for (i
= 0; i
< l1_size
; i
++) {
1434 be64_to_cpus(&l1_table
[i
]);
1445 /*********************************************************/
1446 /* refcount checking functions */
1449 static uint64_t refcount_array_byte_size(BDRVQcow2State
*s
, uint64_t entries
)
1451 /* This assertion holds because there is no way we can address more than
1452 * 2^(64 - 9) clusters at once (with cluster size 512 = 2^9, and because
1453 * offsets have to be representable in bytes); due to every cluster
1454 * corresponding to one refcount entry, we are well below that limit */
1455 assert(entries
< (UINT64_C(1) << (64 - 9)));
1457 /* Thanks to the assertion this will not overflow, because
1458 * s->refcount_order < 7.
1459 * (note: x << s->refcount_order == x * s->refcount_bits) */
1460 return DIV_ROUND_UP(entries
<< s
->refcount_order
, 8);
1464 * Reallocates *array so that it can hold new_size entries. *size must contain
1465 * the current number of entries in *array. If the reallocation fails, *array
1466 * and *size will not be modified and -errno will be returned. If the
1467 * reallocation is successful, *array will be set to the new buffer, *size
1468 * will be set to new_size and 0 will be returned. The size of the reallocated
1469 * refcount array buffer will be aligned to a cluster boundary, and the newly
1470 * allocated area will be zeroed.
1472 static int realloc_refcount_array(BDRVQcow2State
*s
, void **array
,
1473 int64_t *size
, int64_t new_size
)
1475 int64_t old_byte_size
, new_byte_size
;
1478 /* Round to clusters so the array can be directly written to disk */
1479 old_byte_size
= size_to_clusters(s
, refcount_array_byte_size(s
, *size
))
1481 new_byte_size
= size_to_clusters(s
, refcount_array_byte_size(s
, new_size
))
1484 if (new_byte_size
== old_byte_size
) {
1489 assert(new_byte_size
> 0);
1491 if (new_byte_size
> SIZE_MAX
) {
1495 new_ptr
= g_try_realloc(*array
, new_byte_size
);
1500 if (new_byte_size
> old_byte_size
) {
1501 memset((char *)new_ptr
+ old_byte_size
, 0,
1502 new_byte_size
- old_byte_size
);
1512 * Increases the refcount for a range of clusters in a given refcount table.
1513 * This is used to construct a temporary refcount table out of L1 and L2 tables
1514 * which can be compared to the refcount table saved in the image.
1516 * Modifies the number of errors in res.
1518 int qcow2_inc_refcounts_imrt(BlockDriverState
*bs
, BdrvCheckResult
*res
,
1519 void **refcount_table
,
1520 int64_t *refcount_table_size
,
1521 int64_t offset
, int64_t size
)
1523 BDRVQcow2State
*s
= bs
->opaque
;
1524 uint64_t start
, last
, cluster_offset
, k
, refcount
;
1532 file_len
= bdrv_getlength(bs
->file
->bs
);
1538 * Last cluster of qcow2 image may be semi-allocated, so it may be OK to
1539 * reference some space after file end but it should be less than one
1542 if (offset
+ size
- file_len
>= s
->cluster_size
) {
1543 fprintf(stderr
, "ERROR: counting reference for region exceeding the "
1544 "end of the file by one cluster or more: offset 0x%" PRIx64
1545 " size 0x%" PRIx64
"\n", offset
, size
);
1550 start
= start_of_cluster(s
, offset
);
1551 last
= start_of_cluster(s
, offset
+ size
- 1);
1552 for(cluster_offset
= start
; cluster_offset
<= last
;
1553 cluster_offset
+= s
->cluster_size
) {
1554 k
= cluster_offset
>> s
->cluster_bits
;
1555 if (k
>= *refcount_table_size
) {
1556 ret
= realloc_refcount_array(s
, refcount_table
,
1557 refcount_table_size
, k
+ 1);
1559 res
->check_errors
++;
1564 refcount
= s
->get_refcount(*refcount_table
, k
);
1565 if (refcount
== s
->refcount_max
) {
1566 fprintf(stderr
, "ERROR: overflow cluster offset=0x%" PRIx64
1567 "\n", cluster_offset
);
1568 fprintf(stderr
, "Use qemu-img amend to increase the refcount entry "
1569 "width or qemu-img convert to create a clean copy if the "
1570 "image cannot be opened for writing\n");
1574 s
->set_refcount(*refcount_table
, k
, refcount
+ 1);
1580 /* Flags for check_refcounts_l1() and check_refcounts_l2() */
1582 CHECK_FRAG_INFO
= 0x2, /* update BlockFragInfo counters */
1586 * Increases the refcount in the given refcount table for the all clusters
1587 * referenced in the L2 table. While doing so, performs some checks on L2
1590 * Returns the number of errors found by the checks or -errno if an internal
1593 static int check_refcounts_l2(BlockDriverState
*bs
, BdrvCheckResult
*res
,
1594 void **refcount_table
,
1595 int64_t *refcount_table_size
, int64_t l2_offset
,
1596 int flags
, BdrvCheckMode fix
, bool active
)
1598 BDRVQcow2State
*s
= bs
->opaque
;
1599 uint64_t *l2_table
, l2_entry
;
1600 uint64_t next_contiguous_offset
= 0;
1601 int i
, l2_size
, nb_csectors
, ret
;
1603 /* Read L2 table from disk */
1604 l2_size
= s
->l2_size
* sizeof(uint64_t);
1605 l2_table
= g_malloc(l2_size
);
1607 ret
= bdrv_pread(bs
->file
, l2_offset
, l2_table
, l2_size
);
1609 fprintf(stderr
, "ERROR: I/O error in check_refcounts_l2\n");
1610 res
->check_errors
++;
1614 /* Do the actual checks */
1615 for(i
= 0; i
< s
->l2_size
; i
++) {
1616 l2_entry
= be64_to_cpu(l2_table
[i
]);
1618 switch (qcow2_get_cluster_type(bs
, l2_entry
)) {
1619 case QCOW2_CLUSTER_COMPRESSED
:
1620 /* Compressed clusters don't have QCOW_OFLAG_COPIED */
1621 if (l2_entry
& QCOW_OFLAG_COPIED
) {
1622 fprintf(stderr
, "ERROR: coffset=0x%" PRIx64
": "
1623 "copied flag must never be set for compressed "
1624 "clusters\n", l2_entry
& s
->cluster_offset_mask
);
1625 l2_entry
&= ~QCOW_OFLAG_COPIED
;
1629 if (has_data_file(bs
)) {
1630 fprintf(stderr
, "ERROR compressed cluster %d with data file, "
1631 "entry=0x%" PRIx64
"\n", i
, l2_entry
);
1636 /* Mark cluster as used */
1637 nb_csectors
= ((l2_entry
>> s
->csize_shift
) &
1639 l2_entry
&= s
->cluster_offset_mask
;
1640 ret
= qcow2_inc_refcounts_imrt(
1641 bs
, res
, refcount_table
, refcount_table_size
,
1642 l2_entry
& QCOW2_COMPRESSED_SECTOR_MASK
,
1643 nb_csectors
* QCOW2_COMPRESSED_SECTOR_SIZE
);
1648 if (flags
& CHECK_FRAG_INFO
) {
1649 res
->bfi
.allocated_clusters
++;
1650 res
->bfi
.compressed_clusters
++;
1652 /* Compressed clusters are fragmented by nature. Since they
1653 * take up sub-sector space but we only have sector granularity
1654 * I/O we need to re-read the same sectors even for adjacent
1655 * compressed clusters.
1657 res
->bfi
.fragmented_clusters
++;
1661 case QCOW2_CLUSTER_ZERO_ALLOC
:
1662 case QCOW2_CLUSTER_NORMAL
:
1664 uint64_t offset
= l2_entry
& L2E_OFFSET_MASK
;
1666 /* Correct offsets are cluster aligned */
1667 if (offset_into_cluster(s
, offset
)) {
1670 if (qcow2_get_cluster_type(bs
, l2_entry
) ==
1671 QCOW2_CLUSTER_ZERO_ALLOC
)
1673 fprintf(stderr
, "%s offset=%" PRIx64
": Preallocated zero "
1674 "cluster is not properly aligned; L2 entry "
1676 fix
& BDRV_FIX_ERRORS
? "Repairing" : "ERROR",
1678 if (fix
& BDRV_FIX_ERRORS
) {
1679 uint64_t l2e_offset
=
1680 l2_offset
+ (uint64_t)i
* sizeof(uint64_t);
1681 int ign
= active
? QCOW2_OL_ACTIVE_L2
:
1682 QCOW2_OL_INACTIVE_L2
;
1684 l2_entry
= QCOW_OFLAG_ZERO
;
1685 l2_table
[i
] = cpu_to_be64(l2_entry
);
1686 ret
= qcow2_pre_write_overlap_check(bs
, ign
,
1687 l2e_offset
, sizeof(uint64_t), false);
1689 fprintf(stderr
, "ERROR: Overlap check failed\n");
1690 res
->check_errors
++;
1691 /* Something is seriously wrong, so abort checking
1696 ret
= bdrv_pwrite_sync(bs
->file
, l2e_offset
,
1697 &l2_table
[i
], sizeof(uint64_t));
1699 fprintf(stderr
, "ERROR: Failed to overwrite L2 "
1700 "table entry: %s\n", strerror(-ret
));
1701 res
->check_errors
++;
1702 /* Do not abort, continue checking the rest of this
1703 * L2 table's entries */
1706 res
->corruptions_fixed
++;
1707 /* Skip marking the cluster as used
1708 * (it is unused now) */
1713 fprintf(stderr
, "ERROR offset=%" PRIx64
": Data cluster is "
1714 "not properly aligned; L2 entry corrupted.\n", offset
);
1718 if (flags
& CHECK_FRAG_INFO
) {
1719 res
->bfi
.allocated_clusters
++;
1720 if (next_contiguous_offset
&&
1721 offset
!= next_contiguous_offset
) {
1722 res
->bfi
.fragmented_clusters
++;
1724 next_contiguous_offset
= offset
+ s
->cluster_size
;
1727 /* Mark cluster as used */
1728 if (!has_data_file(bs
)) {
1729 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
,
1730 refcount_table_size
,
1731 offset
, s
->cluster_size
);
1739 case QCOW2_CLUSTER_ZERO_PLAIN
:
1740 case QCOW2_CLUSTER_UNALLOCATED
:
1757 * Increases the refcount for the L1 table, its L2 tables and all referenced
1758 * clusters in the given refcount table. While doing so, performs some checks
1759 * on L1 and L2 entries.
1761 * Returns the number of errors found by the checks or -errno if an internal
1764 static int check_refcounts_l1(BlockDriverState
*bs
,
1765 BdrvCheckResult
*res
,
1766 void **refcount_table
,
1767 int64_t *refcount_table_size
,
1768 int64_t l1_table_offset
, int l1_size
,
1769 int flags
, BdrvCheckMode fix
, bool active
)
1771 BDRVQcow2State
*s
= bs
->opaque
;
1772 uint64_t *l1_table
= NULL
, l2_offset
, l1_size2
;
1775 l1_size2
= l1_size
* sizeof(uint64_t);
1777 /* Mark L1 table as used */
1778 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, refcount_table_size
,
1779 l1_table_offset
, l1_size2
);
1784 /* Read L1 table entries from disk */
1786 l1_table
= g_try_malloc(l1_size2
);
1787 if (l1_table
== NULL
) {
1789 res
->check_errors
++;
1792 ret
= bdrv_pread(bs
->file
, l1_table_offset
, l1_table
, l1_size2
);
1794 fprintf(stderr
, "ERROR: I/O error in check_refcounts_l1\n");
1795 res
->check_errors
++;
1798 for(i
= 0;i
< l1_size
; i
++)
1799 be64_to_cpus(&l1_table
[i
]);
1802 /* Do the actual checks */
1803 for(i
= 0; i
< l1_size
; i
++) {
1804 l2_offset
= l1_table
[i
];
1806 /* Mark L2 table as used */
1807 l2_offset
&= L1E_OFFSET_MASK
;
1808 ret
= qcow2_inc_refcounts_imrt(bs
, res
,
1809 refcount_table
, refcount_table_size
,
1810 l2_offset
, s
->cluster_size
);
1815 /* L2 tables are cluster aligned */
1816 if (offset_into_cluster(s
, l2_offset
)) {
1817 fprintf(stderr
, "ERROR l2_offset=%" PRIx64
": Table is not "
1818 "cluster aligned; L1 entry corrupted\n", l2_offset
);
1822 /* Process and check L2 entries */
1823 ret
= check_refcounts_l2(bs
, res
, refcount_table
,
1824 refcount_table_size
, l2_offset
, flags
,
1840 * Checks the OFLAG_COPIED flag for all L1 and L2 entries.
1842 * This function does not print an error message nor does it increment
1843 * check_errors if qcow2_get_refcount fails (this is because such an error will
1844 * have been already detected and sufficiently signaled by the calling function
1845 * (qcow2_check_refcounts) by the time this function is called).
1847 static int check_oflag_copied(BlockDriverState
*bs
, BdrvCheckResult
*res
,
1850 BDRVQcow2State
*s
= bs
->opaque
;
1851 uint64_t *l2_table
= qemu_blockalign(bs
, s
->cluster_size
);
1857 if (fix
& BDRV_FIX_ERRORS
) {
1860 } else if (fix
& BDRV_FIX_LEAKS
) {
1861 /* Repair only if that seems safe: This function is always
1862 * called after the refcounts have been fixed, so the refcount
1863 * is accurate if that repair was successful */
1864 repair
= !res
->check_errors
&& !res
->corruptions
&& !res
->leaks
;
1869 for (i
= 0; i
< s
->l1_size
; i
++) {
1870 uint64_t l1_entry
= s
->l1_table
[i
];
1871 uint64_t l2_offset
= l1_entry
& L1E_OFFSET_MASK
;
1878 ret
= qcow2_get_refcount(bs
, l2_offset
>> s
->cluster_bits
,
1881 /* don't print message nor increment check_errors */
1884 if ((refcount
== 1) != ((l1_entry
& QCOW_OFLAG_COPIED
) != 0)) {
1886 fprintf(stderr
, "%s OFLAG_COPIED L2 cluster: l1_index=%d "
1887 "l1_entry=%" PRIx64
" refcount=%" PRIu64
"\n",
1888 repair
? "Repairing" : "ERROR", i
, l1_entry
, refcount
);
1890 s
->l1_table
[i
] = refcount
== 1
1891 ? l1_entry
| QCOW_OFLAG_COPIED
1892 : l1_entry
& ~QCOW_OFLAG_COPIED
;
1893 ret
= qcow2_write_l1_entry(bs
, i
);
1895 res
->check_errors
++;
1899 res
->corruptions_fixed
++;
1903 ret
= bdrv_pread(bs
->file
, l2_offset
, l2_table
,
1904 s
->l2_size
* sizeof(uint64_t));
1906 fprintf(stderr
, "ERROR: Could not read L2 table: %s\n",
1908 res
->check_errors
++;
1912 for (j
= 0; j
< s
->l2_size
; j
++) {
1913 uint64_t l2_entry
= be64_to_cpu(l2_table
[j
]);
1914 uint64_t data_offset
= l2_entry
& L2E_OFFSET_MASK
;
1915 QCow2ClusterType cluster_type
= qcow2_get_cluster_type(bs
, l2_entry
);
1917 if (cluster_type
== QCOW2_CLUSTER_NORMAL
||
1918 cluster_type
== QCOW2_CLUSTER_ZERO_ALLOC
) {
1919 if (has_data_file(bs
)) {
1922 ret
= qcow2_get_refcount(bs
,
1923 data_offset
>> s
->cluster_bits
,
1926 /* don't print message nor increment check_errors */
1930 if ((refcount
== 1) != ((l2_entry
& QCOW_OFLAG_COPIED
) != 0)) {
1932 fprintf(stderr
, "%s OFLAG_COPIED data cluster: "
1933 "l2_entry=%" PRIx64
" refcount=%" PRIu64
"\n",
1934 repair
? "Repairing" : "ERROR", l2_entry
, refcount
);
1936 l2_table
[j
] = cpu_to_be64(refcount
== 1
1937 ? l2_entry
| QCOW_OFLAG_COPIED
1938 : l2_entry
& ~QCOW_OFLAG_COPIED
);
1946 ret
= qcow2_pre_write_overlap_check(bs
, QCOW2_OL_ACTIVE_L2
,
1947 l2_offset
, s
->cluster_size
,
1950 fprintf(stderr
, "ERROR: Could not write L2 table; metadata "
1951 "overlap check failed: %s\n", strerror(-ret
));
1952 res
->check_errors
++;
1956 ret
= bdrv_pwrite(bs
->file
, l2_offset
, l2_table
,
1959 fprintf(stderr
, "ERROR: Could not write L2 table: %s\n",
1961 res
->check_errors
++;
1964 res
->corruptions
-= l2_dirty
;
1965 res
->corruptions_fixed
+= l2_dirty
;
1972 qemu_vfree(l2_table
);
1977 * Checks consistency of refblocks and accounts for each refblock in
1980 static int check_refblocks(BlockDriverState
*bs
, BdrvCheckResult
*res
,
1981 BdrvCheckMode fix
, bool *rebuild
,
1982 void **refcount_table
, int64_t *nb_clusters
)
1984 BDRVQcow2State
*s
= bs
->opaque
;
1988 for(i
= 0; i
< s
->refcount_table_size
; i
++) {
1989 uint64_t offset
, cluster
;
1990 offset
= s
->refcount_table
[i
];
1991 cluster
= offset
>> s
->cluster_bits
;
1993 /* Refcount blocks are cluster aligned */
1994 if (offset_into_cluster(s
, offset
)) {
1995 fprintf(stderr
, "ERROR refcount block %" PRId64
" is not "
1996 "cluster aligned; refcount table entry corrupted\n", i
);
2002 if (cluster
>= *nb_clusters
) {
2004 fprintf(stderr
, "%s refcount block %" PRId64
" is outside image\n",
2005 fix
& BDRV_FIX_ERRORS
? "Repairing" : "ERROR", i
);
2007 if (fix
& BDRV_FIX_ERRORS
) {
2008 int64_t new_nb_clusters
;
2009 Error
*local_err
= NULL
;
2011 if (offset
> INT64_MAX
- s
->cluster_size
) {
2016 ret
= bdrv_truncate(bs
->file
, offset
+ s
->cluster_size
,
2017 PREALLOC_MODE_OFF
, &local_err
);
2019 error_report_err(local_err
);
2022 size
= bdrv_getlength(bs
->file
->bs
);
2028 new_nb_clusters
= size_to_clusters(s
, size
);
2029 assert(new_nb_clusters
>= *nb_clusters
);
2031 ret
= realloc_refcount_array(s
, refcount_table
,
2032 nb_clusters
, new_nb_clusters
);
2034 res
->check_errors
++;
2038 if (cluster
>= *nb_clusters
) {
2044 res
->corruptions_fixed
++;
2045 ret
= qcow2_inc_refcounts_imrt(bs
, res
,
2046 refcount_table
, nb_clusters
,
2047 offset
, s
->cluster_size
);
2051 /* No need to check whether the refcount is now greater than 1:
2052 * This area was just allocated and zeroed, so it can only be
2053 * exactly 1 after qcow2_inc_refcounts_imrt() */
2058 fprintf(stderr
, "ERROR could not resize image: %s\n",
2065 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, nb_clusters
,
2066 offset
, s
->cluster_size
);
2070 if (s
->get_refcount(*refcount_table
, cluster
) != 1) {
2071 fprintf(stderr
, "ERROR refcount block %" PRId64
2072 " refcount=%" PRIu64
"\n", i
,
2073 s
->get_refcount(*refcount_table
, cluster
));
2084 * Calculates an in-memory refcount table.
2086 static int calculate_refcounts(BlockDriverState
*bs
, BdrvCheckResult
*res
,
2087 BdrvCheckMode fix
, bool *rebuild
,
2088 void **refcount_table
, int64_t *nb_clusters
)
2090 BDRVQcow2State
*s
= bs
->opaque
;
2095 if (!*refcount_table
) {
2096 int64_t old_size
= 0;
2097 ret
= realloc_refcount_array(s
, refcount_table
,
2098 &old_size
, *nb_clusters
);
2100 res
->check_errors
++;
2106 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, nb_clusters
,
2107 0, s
->cluster_size
);
2112 /* current L1 table */
2113 ret
= check_refcounts_l1(bs
, res
, refcount_table
, nb_clusters
,
2114 s
->l1_table_offset
, s
->l1_size
, CHECK_FRAG_INFO
,
2121 if (has_data_file(bs
) && s
->nb_snapshots
) {
2122 fprintf(stderr
, "ERROR %d snapshots in image with data file\n",
2127 for (i
= 0; i
< s
->nb_snapshots
; i
++) {
2128 sn
= s
->snapshots
+ i
;
2129 if (offset_into_cluster(s
, sn
->l1_table_offset
)) {
2130 fprintf(stderr
, "ERROR snapshot %s (%s) l1_offset=%#" PRIx64
": "
2131 "L1 table is not cluster aligned; snapshot table entry "
2132 "corrupted\n", sn
->id_str
, sn
->name
, sn
->l1_table_offset
);
2136 if (sn
->l1_size
> QCOW_MAX_L1_SIZE
/ sizeof(uint64_t)) {
2137 fprintf(stderr
, "ERROR snapshot %s (%s) l1_size=%#" PRIx32
": "
2138 "L1 table is too large; snapshot table entry corrupted\n",
2139 sn
->id_str
, sn
->name
, sn
->l1_size
);
2143 ret
= check_refcounts_l1(bs
, res
, refcount_table
, nb_clusters
,
2144 sn
->l1_table_offset
, sn
->l1_size
, 0, fix
,
2150 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, nb_clusters
,
2151 s
->snapshots_offset
, s
->snapshots_size
);
2157 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, nb_clusters
,
2158 s
->refcount_table_offset
,
2159 s
->refcount_table_size
* sizeof(uint64_t));
2165 if (s
->crypto_header
.length
) {
2166 ret
= qcow2_inc_refcounts_imrt(bs
, res
, refcount_table
, nb_clusters
,
2167 s
->crypto_header
.offset
,
2168 s
->crypto_header
.length
);
2175 ret
= qcow2_check_bitmaps_refcounts(bs
, res
, refcount_table
, nb_clusters
);
2180 return check_refblocks(bs
, res
, fix
, rebuild
, refcount_table
, nb_clusters
);
2184 * Compares the actual reference count for each cluster in the image against the
2185 * refcount as reported by the refcount structures on-disk.
2187 static void compare_refcounts(BlockDriverState
*bs
, BdrvCheckResult
*res
,
2188 BdrvCheckMode fix
, bool *rebuild
,
2189 int64_t *highest_cluster
,
2190 void *refcount_table
, int64_t nb_clusters
)
2192 BDRVQcow2State
*s
= bs
->opaque
;
2194 uint64_t refcount1
, refcount2
;
2197 for (i
= 0, *highest_cluster
= 0; i
< nb_clusters
; i
++) {
2198 ret
= qcow2_get_refcount(bs
, i
, &refcount1
);
2200 fprintf(stderr
, "Can't get refcount for cluster %" PRId64
": %s\n",
2202 res
->check_errors
++;
2206 refcount2
= s
->get_refcount(refcount_table
, i
);
2208 if (refcount1
> 0 || refcount2
> 0) {
2209 *highest_cluster
= i
;
2212 if (refcount1
!= refcount2
) {
2213 /* Check if we're allowed to fix the mismatch */
2214 int *num_fixed
= NULL
;
2215 if (refcount1
== 0) {
2217 } else if (refcount1
> refcount2
&& (fix
& BDRV_FIX_LEAKS
)) {
2218 num_fixed
= &res
->leaks_fixed
;
2219 } else if (refcount1
< refcount2
&& (fix
& BDRV_FIX_ERRORS
)) {
2220 num_fixed
= &res
->corruptions_fixed
;
2223 fprintf(stderr
, "%s cluster %" PRId64
" refcount=%" PRIu64
2224 " reference=%" PRIu64
"\n",
2225 num_fixed
!= NULL
? "Repairing" :
2226 refcount1
< refcount2
? "ERROR" :
2228 i
, refcount1
, refcount2
);
2231 ret
= update_refcount(bs
, i
<< s
->cluster_bits
, 1,
2232 refcount_diff(refcount1
, refcount2
),
2233 refcount1
> refcount2
,
2234 QCOW2_DISCARD_ALWAYS
);
2241 /* And if we couldn't, print an error */
2242 if (refcount1
< refcount2
) {
2252 * Allocates clusters using an in-memory refcount table (IMRT) in contrast to
2253 * the on-disk refcount structures.
2255 * On input, *first_free_cluster tells where to start looking, and need not
2256 * actually be a free cluster; the returned offset will not be before that
2257 * cluster. On output, *first_free_cluster points to the first gap found, even
2258 * if that gap was too small to be used as the returned offset.
2260 * Note that *first_free_cluster is a cluster index whereas the return value is
2263 static int64_t alloc_clusters_imrt(BlockDriverState
*bs
,
2265 void **refcount_table
,
2266 int64_t *imrt_nb_clusters
,
2267 int64_t *first_free_cluster
)
2269 BDRVQcow2State
*s
= bs
->opaque
;
2270 int64_t cluster
= *first_free_cluster
, i
;
2271 bool first_gap
= true;
2272 int contiguous_free_clusters
;
2275 /* Starting at *first_free_cluster, find a range of at least cluster_count
2276 * continuously free clusters */
2277 for (contiguous_free_clusters
= 0;
2278 cluster
< *imrt_nb_clusters
&&
2279 contiguous_free_clusters
< cluster_count
;
2282 if (!s
->get_refcount(*refcount_table
, cluster
)) {
2283 contiguous_free_clusters
++;
2285 /* If this is the first free cluster found, update
2286 * *first_free_cluster accordingly */
2287 *first_free_cluster
= cluster
;
2290 } else if (contiguous_free_clusters
) {
2291 contiguous_free_clusters
= 0;
2295 /* If contiguous_free_clusters is greater than zero, it contains the number
2296 * of continuously free clusters until the current cluster; the first free
2297 * cluster in the current "gap" is therefore
2298 * cluster - contiguous_free_clusters */
2300 /* If no such range could be found, grow the in-memory refcount table
2301 * accordingly to append free clusters at the end of the image */
2302 if (contiguous_free_clusters
< cluster_count
) {
2303 /* contiguous_free_clusters clusters are already empty at the image end;
2304 * we need cluster_count clusters; therefore, we have to allocate
2305 * cluster_count - contiguous_free_clusters new clusters at the end of
2306 * the image (which is the current value of cluster; note that cluster
2307 * may exceed old_imrt_nb_clusters if *first_free_cluster pointed beyond
2309 ret
= realloc_refcount_array(s
, refcount_table
, imrt_nb_clusters
,
2310 cluster
+ cluster_count
2311 - contiguous_free_clusters
);
2317 /* Go back to the first free cluster */
2318 cluster
-= contiguous_free_clusters
;
2319 for (i
= 0; i
< cluster_count
; i
++) {
2320 s
->set_refcount(*refcount_table
, cluster
+ i
, 1);
2323 return cluster
<< s
->cluster_bits
;
2327 * Creates a new refcount structure based solely on the in-memory information
2328 * given through *refcount_table. All necessary allocations will be reflected
2331 * On success, the old refcount structure is leaked (it will be covered by the
2332 * new refcount structure).
2334 static int rebuild_refcount_structure(BlockDriverState
*bs
,
2335 BdrvCheckResult
*res
,
2336 void **refcount_table
,
2337 int64_t *nb_clusters
)
2339 BDRVQcow2State
*s
= bs
->opaque
;
2340 int64_t first_free_cluster
= 0, reftable_offset
= -1, cluster
= 0;
2341 int64_t refblock_offset
, refblock_start
, refblock_index
;
2342 uint32_t reftable_size
= 0;
2343 uint64_t *on_disk_reftable
= NULL
;
2344 void *on_disk_refblock
;
2347 uint64_t reftable_offset
;
2348 uint32_t reftable_clusters
;
2349 } QEMU_PACKED reftable_offset_and_clusters
;
2351 qcow2_cache_empty(bs
, s
->refcount_block_cache
);
2354 for (; cluster
< *nb_clusters
; cluster
++) {
2355 if (!s
->get_refcount(*refcount_table
, cluster
)) {
2359 refblock_index
= cluster
>> s
->refcount_block_bits
;
2360 refblock_start
= refblock_index
<< s
->refcount_block_bits
;
2362 /* Don't allocate a cluster in a refblock already written to disk */
2363 if (first_free_cluster
< refblock_start
) {
2364 first_free_cluster
= refblock_start
;
2366 refblock_offset
= alloc_clusters_imrt(bs
, 1, refcount_table
,
2367 nb_clusters
, &first_free_cluster
);
2368 if (refblock_offset
< 0) {
2369 fprintf(stderr
, "ERROR allocating refblock: %s\n",
2370 strerror(-refblock_offset
));
2371 res
->check_errors
++;
2372 ret
= refblock_offset
;
2376 if (reftable_size
<= refblock_index
) {
2377 uint32_t old_reftable_size
= reftable_size
;
2378 uint64_t *new_on_disk_reftable
;
2380 reftable_size
= ROUND_UP((refblock_index
+ 1) * sizeof(uint64_t),
2381 s
->cluster_size
) / sizeof(uint64_t);
2382 new_on_disk_reftable
= g_try_realloc(on_disk_reftable
,
2385 if (!new_on_disk_reftable
) {
2386 res
->check_errors
++;
2390 on_disk_reftable
= new_on_disk_reftable
;
2392 memset(on_disk_reftable
+ old_reftable_size
, 0,
2393 (reftable_size
- old_reftable_size
) * sizeof(uint64_t));
2395 /* The offset we have for the reftable is now no longer valid;
2396 * this will leak that range, but we can easily fix that by running
2397 * a leak-fixing check after this rebuild operation */
2398 reftable_offset
= -1;
2400 assert(on_disk_reftable
);
2402 on_disk_reftable
[refblock_index
] = refblock_offset
;
2404 /* If this is apparently the last refblock (for now), try to squeeze the
2406 if (refblock_index
== (*nb_clusters
- 1) >> s
->refcount_block_bits
&&
2407 reftable_offset
< 0)
2409 uint64_t reftable_clusters
= size_to_clusters(s
, reftable_size
*
2411 reftable_offset
= alloc_clusters_imrt(bs
, reftable_clusters
,
2412 refcount_table
, nb_clusters
,
2413 &first_free_cluster
);
2414 if (reftable_offset
< 0) {
2415 fprintf(stderr
, "ERROR allocating reftable: %s\n",
2416 strerror(-reftable_offset
));
2417 res
->check_errors
++;
2418 ret
= reftable_offset
;
2423 ret
= qcow2_pre_write_overlap_check(bs
, 0, refblock_offset
,
2424 s
->cluster_size
, false);
2426 fprintf(stderr
, "ERROR writing refblock: %s\n", strerror(-ret
));
2430 /* The size of *refcount_table is always cluster-aligned, therefore the
2431 * write operation will not overflow */
2432 on_disk_refblock
= (void *)((char *) *refcount_table
+
2433 refblock_index
* s
->cluster_size
);
2435 ret
= bdrv_pwrite(bs
->file
, refblock_offset
, on_disk_refblock
,
2438 fprintf(stderr
, "ERROR writing refblock: %s\n", strerror(-ret
));
2442 /* Go to the end of this refblock */
2443 cluster
= refblock_start
+ s
->refcount_block_size
- 1;
2446 if (reftable_offset
< 0) {
2447 uint64_t post_refblock_start
, reftable_clusters
;
2449 post_refblock_start
= ROUND_UP(*nb_clusters
, s
->refcount_block_size
);
2450 reftable_clusters
= size_to_clusters(s
,
2451 reftable_size
* sizeof(uint64_t));
2452 /* Not pretty but simple */
2453 if (first_free_cluster
< post_refblock_start
) {
2454 first_free_cluster
= post_refblock_start
;
2456 reftable_offset
= alloc_clusters_imrt(bs
, reftable_clusters
,
2457 refcount_table
, nb_clusters
,
2458 &first_free_cluster
);
2459 if (reftable_offset
< 0) {
2460 fprintf(stderr
, "ERROR allocating reftable: %s\n",
2461 strerror(-reftable_offset
));
2462 res
->check_errors
++;
2463 ret
= reftable_offset
;
2467 goto write_refblocks
;
2470 for (refblock_index
= 0; refblock_index
< reftable_size
; refblock_index
++) {
2471 cpu_to_be64s(&on_disk_reftable
[refblock_index
]);
2474 ret
= qcow2_pre_write_overlap_check(bs
, 0, reftable_offset
,
2475 reftable_size
* sizeof(uint64_t),
2478 fprintf(stderr
, "ERROR writing reftable: %s\n", strerror(-ret
));
2482 assert(reftable_size
< INT_MAX
/ sizeof(uint64_t));
2483 ret
= bdrv_pwrite(bs
->file
, reftable_offset
, on_disk_reftable
,
2484 reftable_size
* sizeof(uint64_t));
2486 fprintf(stderr
, "ERROR writing reftable: %s\n", strerror(-ret
));
2490 /* Enter new reftable into the image header */
2491 reftable_offset_and_clusters
.reftable_offset
= cpu_to_be64(reftable_offset
);
2492 reftable_offset_and_clusters
.reftable_clusters
=
2493 cpu_to_be32(size_to_clusters(s
, reftable_size
* sizeof(uint64_t)));
2494 ret
= bdrv_pwrite_sync(bs
->file
,
2495 offsetof(QCowHeader
, refcount_table_offset
),
2496 &reftable_offset_and_clusters
,
2497 sizeof(reftable_offset_and_clusters
));
2499 fprintf(stderr
, "ERROR setting reftable: %s\n", strerror(-ret
));
2503 for (refblock_index
= 0; refblock_index
< reftable_size
; refblock_index
++) {
2504 be64_to_cpus(&on_disk_reftable
[refblock_index
]);
2506 s
->refcount_table
= on_disk_reftable
;
2507 s
->refcount_table_offset
= reftable_offset
;
2508 s
->refcount_table_size
= reftable_size
;
2509 update_max_refcount_table_index(s
);
2514 g_free(on_disk_reftable
);
2519 * Checks an image for refcount consistency.
2521 * Returns 0 if no errors are found, the number of errors in case the image is
2522 * detected as corrupted, and -errno when an internal error occurred.
2524 int qcow2_check_refcounts(BlockDriverState
*bs
, BdrvCheckResult
*res
,
2527 BDRVQcow2State
*s
= bs
->opaque
;
2528 BdrvCheckResult pre_compare_res
;
2529 int64_t size
, highest_cluster
, nb_clusters
;
2530 void *refcount_table
= NULL
;
2531 bool rebuild
= false;
2534 size
= bdrv_getlength(bs
->file
->bs
);
2536 res
->check_errors
++;
2540 nb_clusters
= size_to_clusters(s
, size
);
2541 if (nb_clusters
> INT_MAX
) {
2542 res
->check_errors
++;
2546 res
->bfi
.total_clusters
=
2547 size_to_clusters(s
, bs
->total_sectors
* BDRV_SECTOR_SIZE
);
2549 ret
= calculate_refcounts(bs
, res
, fix
, &rebuild
, &refcount_table
,
2555 /* In case we don't need to rebuild the refcount structure (but want to fix
2556 * something), this function is immediately called again, in which case the
2557 * result should be ignored */
2558 pre_compare_res
= *res
;
2559 compare_refcounts(bs
, res
, 0, &rebuild
, &highest_cluster
, refcount_table
,
2562 if (rebuild
&& (fix
& BDRV_FIX_ERRORS
)) {
2563 BdrvCheckResult old_res
= *res
;
2564 int fresh_leaks
= 0;
2566 fprintf(stderr
, "Rebuilding refcount structure\n");
2567 ret
= rebuild_refcount_structure(bs
, res
, &refcount_table
,
2573 res
->corruptions
= 0;
2576 /* Because the old reftable has been exchanged for a new one the
2577 * references have to be recalculated */
2579 memset(refcount_table
, 0, refcount_array_byte_size(s
, nb_clusters
));
2580 ret
= calculate_refcounts(bs
, res
, 0, &rebuild
, &refcount_table
,
2586 if (fix
& BDRV_FIX_LEAKS
) {
2587 /* The old refcount structures are now leaked, fix it; the result
2588 * can be ignored, aside from leaks which were introduced by
2589 * rebuild_refcount_structure() that could not be fixed */
2590 BdrvCheckResult saved_res
= *res
;
2591 *res
= (BdrvCheckResult
){ 0 };
2593 compare_refcounts(bs
, res
, BDRV_FIX_LEAKS
, &rebuild
,
2594 &highest_cluster
, refcount_table
, nb_clusters
);
2596 fprintf(stderr
, "ERROR rebuilt refcount structure is still "
2600 /* Any leaks accounted for here were introduced by
2601 * rebuild_refcount_structure() because that function has created a
2602 * new refcount structure from scratch */
2603 fresh_leaks
= res
->leaks
;
2607 if (res
->corruptions
< old_res
.corruptions
) {
2608 res
->corruptions_fixed
+= old_res
.corruptions
- res
->corruptions
;
2610 if (res
->leaks
< old_res
.leaks
) {
2611 res
->leaks_fixed
+= old_res
.leaks
- res
->leaks
;
2613 res
->leaks
+= fresh_leaks
;
2616 fprintf(stderr
, "ERROR need to rebuild refcount structures\n");
2617 res
->check_errors
++;
2622 if (res
->leaks
|| res
->corruptions
) {
2623 *res
= pre_compare_res
;
2624 compare_refcounts(bs
, res
, fix
, &rebuild
, &highest_cluster
,
2625 refcount_table
, nb_clusters
);
2629 /* check OFLAG_COPIED */
2630 ret
= check_oflag_copied(bs
, res
, fix
);
2635 res
->image_end_offset
= (highest_cluster
+ 1) * s
->cluster_size
;
2639 g_free(refcount_table
);
2644 #define overlaps_with(ofs, sz) \
2645 ranges_overlap(offset, size, ofs, sz)
2648 * Checks if the given offset into the image file is actually free to use by
2649 * looking for overlaps with important metadata sections (L1/L2 tables etc.),
2650 * i.e. a sanity check without relying on the refcount tables.
2652 * The ign parameter specifies what checks not to perform (being a bitmask of
2653 * QCow2MetadataOverlap values), i.e., what sections to ignore.
2656 * - 0 if writing to this offset will not affect the mentioned metadata
2657 * - a positive QCow2MetadataOverlap value indicating one overlapping section
2658 * - a negative value (-errno) indicating an error while performing a check,
2659 * e.g. when bdrv_read failed on QCOW2_OL_INACTIVE_L2
2661 int qcow2_check_metadata_overlap(BlockDriverState
*bs
, int ign
, int64_t offset
,
2664 BDRVQcow2State
*s
= bs
->opaque
;
2665 int chk
= s
->overlap_check
& ~ign
;
2672 if (chk
& QCOW2_OL_MAIN_HEADER
) {
2673 if (offset
< s
->cluster_size
) {
2674 return QCOW2_OL_MAIN_HEADER
;
2678 /* align range to test to cluster boundaries */
2679 size
= ROUND_UP(offset_into_cluster(s
, offset
) + size
, s
->cluster_size
);
2680 offset
= start_of_cluster(s
, offset
);
2682 if ((chk
& QCOW2_OL_ACTIVE_L1
) && s
->l1_size
) {
2683 if (overlaps_with(s
->l1_table_offset
, s
->l1_size
* sizeof(uint64_t))) {
2684 return QCOW2_OL_ACTIVE_L1
;
2688 if ((chk
& QCOW2_OL_REFCOUNT_TABLE
) && s
->refcount_table_size
) {
2689 if (overlaps_with(s
->refcount_table_offset
,
2690 s
->refcount_table_size
* sizeof(uint64_t))) {
2691 return QCOW2_OL_REFCOUNT_TABLE
;
2695 if ((chk
& QCOW2_OL_SNAPSHOT_TABLE
) && s
->snapshots_size
) {
2696 if (overlaps_with(s
->snapshots_offset
, s
->snapshots_size
)) {
2697 return QCOW2_OL_SNAPSHOT_TABLE
;
2701 if ((chk
& QCOW2_OL_INACTIVE_L1
) && s
->snapshots
) {
2702 for (i
= 0; i
< s
->nb_snapshots
; i
++) {
2703 if (s
->snapshots
[i
].l1_size
&&
2704 overlaps_with(s
->snapshots
[i
].l1_table_offset
,
2705 s
->snapshots
[i
].l1_size
* sizeof(uint64_t))) {
2706 return QCOW2_OL_INACTIVE_L1
;
2711 if ((chk
& QCOW2_OL_ACTIVE_L2
) && s
->l1_table
) {
2712 for (i
= 0; i
< s
->l1_size
; i
++) {
2713 if ((s
->l1_table
[i
] & L1E_OFFSET_MASK
) &&
2714 overlaps_with(s
->l1_table
[i
] & L1E_OFFSET_MASK
,
2716 return QCOW2_OL_ACTIVE_L2
;
2721 if ((chk
& QCOW2_OL_REFCOUNT_BLOCK
) && s
->refcount_table
) {
2722 unsigned last_entry
= s
->max_refcount_table_index
;
2723 assert(last_entry
< s
->refcount_table_size
);
2724 assert(last_entry
+ 1 == s
->refcount_table_size
||
2725 (s
->refcount_table
[last_entry
+ 1] & REFT_OFFSET_MASK
) == 0);
2726 for (i
= 0; i
<= last_entry
; i
++) {
2727 if ((s
->refcount_table
[i
] & REFT_OFFSET_MASK
) &&
2728 overlaps_with(s
->refcount_table
[i
] & REFT_OFFSET_MASK
,
2730 return QCOW2_OL_REFCOUNT_BLOCK
;
2735 if ((chk
& QCOW2_OL_INACTIVE_L2
) && s
->snapshots
) {
2736 for (i
= 0; i
< s
->nb_snapshots
; i
++) {
2737 uint64_t l1_ofs
= s
->snapshots
[i
].l1_table_offset
;
2738 uint32_t l1_sz
= s
->snapshots
[i
].l1_size
;
2739 uint64_t l1_sz2
= l1_sz
* sizeof(uint64_t);
2743 ret
= qcow2_validate_table(bs
, l1_ofs
, l1_sz
, sizeof(uint64_t),
2744 QCOW_MAX_L1_SIZE
, "", NULL
);
2749 l1
= g_try_malloc(l1_sz2
);
2751 if (l1_sz2
&& l1
== NULL
) {
2755 ret
= bdrv_pread(bs
->file
, l1_ofs
, l1
, l1_sz2
);
2761 for (j
= 0; j
< l1_sz
; j
++) {
2762 uint64_t l2_ofs
= be64_to_cpu(l1
[j
]) & L1E_OFFSET_MASK
;
2763 if (l2_ofs
&& overlaps_with(l2_ofs
, s
->cluster_size
)) {
2765 return QCOW2_OL_INACTIVE_L2
;
2773 if ((chk
& QCOW2_OL_BITMAP_DIRECTORY
) &&
2774 (s
->autoclear_features
& QCOW2_AUTOCLEAR_BITMAPS
))
2776 if (overlaps_with(s
->bitmap_directory_offset
,
2777 s
->bitmap_directory_size
))
2779 return QCOW2_OL_BITMAP_DIRECTORY
;
2786 static const char *metadata_ol_names
[] = {
2787 [QCOW2_OL_MAIN_HEADER_BITNR
] = "qcow2_header",
2788 [QCOW2_OL_ACTIVE_L1_BITNR
] = "active L1 table",
2789 [QCOW2_OL_ACTIVE_L2_BITNR
] = "active L2 table",
2790 [QCOW2_OL_REFCOUNT_TABLE_BITNR
] = "refcount table",
2791 [QCOW2_OL_REFCOUNT_BLOCK_BITNR
] = "refcount block",
2792 [QCOW2_OL_SNAPSHOT_TABLE_BITNR
] = "snapshot table",
2793 [QCOW2_OL_INACTIVE_L1_BITNR
] = "inactive L1 table",
2794 [QCOW2_OL_INACTIVE_L2_BITNR
] = "inactive L2 table",
2795 [QCOW2_OL_BITMAP_DIRECTORY_BITNR
] = "bitmap directory",
2797 QEMU_BUILD_BUG_ON(QCOW2_OL_MAX_BITNR
!= ARRAY_SIZE(metadata_ol_names
));
2800 * First performs a check for metadata overlaps (through
2801 * qcow2_check_metadata_overlap); if that fails with a negative value (error
2802 * while performing a check), that value is returned. If an impending overlap
2803 * is detected, the BDS will be made unusable, the qcow2 file marked corrupt
2804 * and -EIO returned.
2806 * Returns 0 if there were neither overlaps nor errors while checking for
2807 * overlaps; or a negative value (-errno) on error.
2809 int qcow2_pre_write_overlap_check(BlockDriverState
*bs
, int ign
, int64_t offset
,
2810 int64_t size
, bool data_file
)
2814 if (data_file
&& has_data_file(bs
)) {
2818 ret
= qcow2_check_metadata_overlap(bs
, ign
, offset
, size
);
2821 } else if (ret
> 0) {
2822 int metadata_ol_bitnr
= ctz32(ret
);
2823 assert(metadata_ol_bitnr
< QCOW2_OL_MAX_BITNR
);
2825 qcow2_signal_corruption(bs
, true, offset
, size
, "Preventing invalid "
2826 "write on metadata (overlaps with %s)",
2827 metadata_ol_names
[metadata_ol_bitnr
]);
2834 /* A pointer to a function of this type is given to walk_over_reftable(). That
2835 * function will create refblocks and pass them to a RefblockFinishOp once they
2836 * are completed (@refblock). @refblock_empty is set if the refblock is
2839 * Along with the refblock, a corresponding reftable entry is passed, in the
2840 * reftable @reftable (which may be reallocated) at @reftable_index.
2842 * @allocated should be set to true if a new cluster has been allocated.
2844 typedef int (RefblockFinishOp
)(BlockDriverState
*bs
, uint64_t **reftable
,
2845 uint64_t reftable_index
, uint64_t *reftable_size
,
2846 void *refblock
, bool refblock_empty
,
2847 bool *allocated
, Error
**errp
);
2850 * This "operation" for walk_over_reftable() allocates the refblock on disk (if
2851 * it is not empty) and inserts its offset into the new reftable. The size of
2852 * this new reftable is increased as required.
2854 static int alloc_refblock(BlockDriverState
*bs
, uint64_t **reftable
,
2855 uint64_t reftable_index
, uint64_t *reftable_size
,
2856 void *refblock
, bool refblock_empty
, bool *allocated
,
2859 BDRVQcow2State
*s
= bs
->opaque
;
2862 if (!refblock_empty
&& reftable_index
>= *reftable_size
) {
2863 uint64_t *new_reftable
;
2864 uint64_t new_reftable_size
;
2866 new_reftable_size
= ROUND_UP(reftable_index
+ 1,
2867 s
->cluster_size
/ sizeof(uint64_t));
2868 if (new_reftable_size
> QCOW_MAX_REFTABLE_SIZE
/ sizeof(uint64_t)) {
2870 "This operation would make the refcount table grow "
2871 "beyond the maximum size supported by QEMU, aborting");
2875 new_reftable
= g_try_realloc(*reftable
, new_reftable_size
*
2877 if (!new_reftable
) {
2878 error_setg(errp
, "Failed to increase reftable buffer size");
2882 memset(new_reftable
+ *reftable_size
, 0,
2883 (new_reftable_size
- *reftable_size
) * sizeof(uint64_t));
2885 *reftable
= new_reftable
;
2886 *reftable_size
= new_reftable_size
;
2889 if (!refblock_empty
&& !(*reftable
)[reftable_index
]) {
2890 offset
= qcow2_alloc_clusters(bs
, s
->cluster_size
);
2892 error_setg_errno(errp
, -offset
, "Failed to allocate refblock");
2895 (*reftable
)[reftable_index
] = offset
;
2903 * This "operation" for walk_over_reftable() writes the refblock to disk at the
2904 * offset specified by the new reftable's entry. It does not modify the new
2905 * reftable or change any refcounts.
2907 static int flush_refblock(BlockDriverState
*bs
, uint64_t **reftable
,
2908 uint64_t reftable_index
, uint64_t *reftable_size
,
2909 void *refblock
, bool refblock_empty
, bool *allocated
,
2912 BDRVQcow2State
*s
= bs
->opaque
;
2916 if (reftable_index
< *reftable_size
&& (*reftable
)[reftable_index
]) {
2917 offset
= (*reftable
)[reftable_index
];
2919 ret
= qcow2_pre_write_overlap_check(bs
, 0, offset
, s
->cluster_size
,
2922 error_setg_errno(errp
, -ret
, "Overlap check failed");
2926 ret
= bdrv_pwrite(bs
->file
, offset
, refblock
, s
->cluster_size
);
2928 error_setg_errno(errp
, -ret
, "Failed to write refblock");
2932 assert(refblock_empty
);
2939 * This function walks over the existing reftable and every referenced refblock;
2940 * if @new_set_refcount is non-NULL, it is called for every refcount entry to
2941 * create an equal new entry in the passed @new_refblock. Once that
2942 * @new_refblock is completely filled, @operation will be called.
2944 * @status_cb and @cb_opaque are used for the amend operation's status callback.
2945 * @index is the index of the walk_over_reftable() calls and @total is the total
2946 * number of walk_over_reftable() calls per amend operation. Both are used for
2947 * calculating the parameters for the status callback.
2949 * @allocated is set to true if a new cluster has been allocated.
2951 static int walk_over_reftable(BlockDriverState
*bs
, uint64_t **new_reftable
,
2952 uint64_t *new_reftable_index
,
2953 uint64_t *new_reftable_size
,
2954 void *new_refblock
, int new_refblock_size
,
2955 int new_refcount_bits
,
2956 RefblockFinishOp
*operation
, bool *allocated
,
2957 Qcow2SetRefcountFunc
*new_set_refcount
,
2958 BlockDriverAmendStatusCB
*status_cb
,
2959 void *cb_opaque
, int index
, int total
,
2962 BDRVQcow2State
*s
= bs
->opaque
;
2963 uint64_t reftable_index
;
2964 bool new_refblock_empty
= true;
2966 int new_refblock_index
= 0;
2969 for (reftable_index
= 0; reftable_index
< s
->refcount_table_size
;
2972 uint64_t refblock_offset
= s
->refcount_table
[reftable_index
]
2975 status_cb(bs
, (uint64_t)index
* s
->refcount_table_size
+ reftable_index
,
2976 (uint64_t)total
* s
->refcount_table_size
, cb_opaque
);
2978 if (refblock_offset
) {
2981 if (offset_into_cluster(s
, refblock_offset
)) {
2982 qcow2_signal_corruption(bs
, true, -1, -1, "Refblock offset %#"
2983 PRIx64
" unaligned (reftable index: %#"
2984 PRIx64
")", refblock_offset
,
2987 "Image is corrupt (unaligned refblock offset)");
2991 ret
= qcow2_cache_get(bs
, s
->refcount_block_cache
, refblock_offset
,
2994 error_setg_errno(errp
, -ret
, "Failed to retrieve refblock");
2998 for (refblock_index
= 0; refblock_index
< s
->refcount_block_size
;
3003 if (new_refblock_index
>= new_refblock_size
) {
3004 /* new_refblock is now complete */
3005 ret
= operation(bs
, new_reftable
, *new_reftable_index
,
3006 new_reftable_size
, new_refblock
,
3007 new_refblock_empty
, allocated
, errp
);
3009 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3013 (*new_reftable_index
)++;
3014 new_refblock_index
= 0;
3015 new_refblock_empty
= true;
3018 refcount
= s
->get_refcount(refblock
, refblock_index
);
3019 if (new_refcount_bits
< 64 && refcount
>> new_refcount_bits
) {
3022 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3024 offset
= ((reftable_index
<< s
->refcount_block_bits
)
3025 + refblock_index
) << s
->cluster_bits
;
3027 error_setg(errp
, "Cannot decrease refcount entry width to "
3028 "%i bits: Cluster at offset %#" PRIx64
" has a "
3029 "refcount of %" PRIu64
, new_refcount_bits
,
3034 if (new_set_refcount
) {
3035 new_set_refcount(new_refblock
, new_refblock_index
++,
3038 new_refblock_index
++;
3040 new_refblock_empty
= new_refblock_empty
&& refcount
== 0;
3043 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3045 /* No refblock means every refcount is 0 */
3046 for (refblock_index
= 0; refblock_index
< s
->refcount_block_size
;
3049 if (new_refblock_index
>= new_refblock_size
) {
3050 /* new_refblock is now complete */
3051 ret
= operation(bs
, new_reftable
, *new_reftable_index
,
3052 new_reftable_size
, new_refblock
,
3053 new_refblock_empty
, allocated
, errp
);
3058 (*new_reftable_index
)++;
3059 new_refblock_index
= 0;
3060 new_refblock_empty
= true;
3063 if (new_set_refcount
) {
3064 new_set_refcount(new_refblock
, new_refblock_index
++, 0);
3066 new_refblock_index
++;
3072 if (new_refblock_index
> 0) {
3073 /* Complete the potentially existing partially filled final refblock */
3074 if (new_set_refcount
) {
3075 for (; new_refblock_index
< new_refblock_size
;
3076 new_refblock_index
++)
3078 new_set_refcount(new_refblock
, new_refblock_index
, 0);
3082 ret
= operation(bs
, new_reftable
, *new_reftable_index
,
3083 new_reftable_size
, new_refblock
, new_refblock_empty
,
3089 (*new_reftable_index
)++;
3092 status_cb(bs
, (uint64_t)(index
+ 1) * s
->refcount_table_size
,
3093 (uint64_t)total
* s
->refcount_table_size
, cb_opaque
);
3098 int qcow2_change_refcount_order(BlockDriverState
*bs
, int refcount_order
,
3099 BlockDriverAmendStatusCB
*status_cb
,
3100 void *cb_opaque
, Error
**errp
)
3102 BDRVQcow2State
*s
= bs
->opaque
;
3103 Qcow2GetRefcountFunc
*new_get_refcount
;
3104 Qcow2SetRefcountFunc
*new_set_refcount
;
3105 void *new_refblock
= qemu_blockalign(bs
->file
->bs
, s
->cluster_size
);
3106 uint64_t *new_reftable
= NULL
, new_reftable_size
= 0;
3107 uint64_t *old_reftable
, old_reftable_size
, old_reftable_offset
;
3108 uint64_t new_reftable_index
= 0;
3110 int64_t new_reftable_offset
= 0, allocated_reftable_size
= 0;
3111 int new_refblock_size
, new_refcount_bits
= 1 << refcount_order
;
3112 int old_refcount_order
;
3115 bool new_allocation
;
3117 assert(s
->qcow_version
>= 3);
3118 assert(refcount_order
>= 0 && refcount_order
<= 6);
3120 /* see qcow2_open() */
3121 new_refblock_size
= 1 << (s
->cluster_bits
- (refcount_order
- 3));
3123 new_get_refcount
= get_refcount_funcs
[refcount_order
];
3124 new_set_refcount
= set_refcount_funcs
[refcount_order
];
3130 new_allocation
= false;
3132 /* At least we have to do this walk and the one which writes the
3133 * refblocks; also, at least we have to do this loop here at least
3134 * twice (normally), first to do the allocations, and second to
3135 * determine that everything is correctly allocated, this then makes
3136 * three walks in total */
3137 total_walks
= MAX(walk_index
+ 2, 3);
3139 /* First, allocate the structures so they are present in the refcount
3141 ret
= walk_over_reftable(bs
, &new_reftable
, &new_reftable_index
,
3142 &new_reftable_size
, NULL
, new_refblock_size
,
3143 new_refcount_bits
, &alloc_refblock
,
3144 &new_allocation
, NULL
, status_cb
, cb_opaque
,
3145 walk_index
++, total_walks
, errp
);
3150 new_reftable_index
= 0;
3152 if (new_allocation
) {
3153 if (new_reftable_offset
) {
3154 qcow2_free_clusters(bs
, new_reftable_offset
,
3155 allocated_reftable_size
* sizeof(uint64_t),
3156 QCOW2_DISCARD_NEVER
);
3159 new_reftable_offset
= qcow2_alloc_clusters(bs
, new_reftable_size
*
3161 if (new_reftable_offset
< 0) {
3162 error_setg_errno(errp
, -new_reftable_offset
,
3163 "Failed to allocate the new reftable");
3164 ret
= new_reftable_offset
;
3167 allocated_reftable_size
= new_reftable_size
;
3169 } while (new_allocation
);
3171 /* Second, write the new refblocks */
3172 ret
= walk_over_reftable(bs
, &new_reftable
, &new_reftable_index
,
3173 &new_reftable_size
, new_refblock
,
3174 new_refblock_size
, new_refcount_bits
,
3175 &flush_refblock
, &new_allocation
, new_set_refcount
,
3176 status_cb
, cb_opaque
, walk_index
, walk_index
+ 1,
3181 assert(!new_allocation
);
3184 /* Write the new reftable */
3185 ret
= qcow2_pre_write_overlap_check(bs
, 0, new_reftable_offset
,
3186 new_reftable_size
* sizeof(uint64_t),
3189 error_setg_errno(errp
, -ret
, "Overlap check failed");
3193 for (i
= 0; i
< new_reftable_size
; i
++) {
3194 cpu_to_be64s(&new_reftable
[i
]);
3197 ret
= bdrv_pwrite(bs
->file
, new_reftable_offset
, new_reftable
,
3198 new_reftable_size
* sizeof(uint64_t));
3200 for (i
= 0; i
< new_reftable_size
; i
++) {
3201 be64_to_cpus(&new_reftable
[i
]);
3205 error_setg_errno(errp
, -ret
, "Failed to write the new reftable");
3210 /* Empty the refcount cache */
3211 ret
= qcow2_cache_flush(bs
, s
->refcount_block_cache
);
3213 error_setg_errno(errp
, -ret
, "Failed to flush the refblock cache");
3217 /* Update the image header to point to the new reftable; this only updates
3218 * the fields which are relevant to qcow2_update_header(); other fields
3219 * such as s->refcount_table or s->refcount_bits stay stale for now
3220 * (because we have to restore everything if qcow2_update_header() fails) */
3221 old_refcount_order
= s
->refcount_order
;
3222 old_reftable_size
= s
->refcount_table_size
;
3223 old_reftable_offset
= s
->refcount_table_offset
;
3225 s
->refcount_order
= refcount_order
;
3226 s
->refcount_table_size
= new_reftable_size
;
3227 s
->refcount_table_offset
= new_reftable_offset
;
3229 ret
= qcow2_update_header(bs
);
3231 s
->refcount_order
= old_refcount_order
;
3232 s
->refcount_table_size
= old_reftable_size
;
3233 s
->refcount_table_offset
= old_reftable_offset
;
3234 error_setg_errno(errp
, -ret
, "Failed to update the qcow2 header");
3238 /* Now update the rest of the in-memory information */
3239 old_reftable
= s
->refcount_table
;
3240 s
->refcount_table
= new_reftable
;
3241 update_max_refcount_table_index(s
);
3243 s
->refcount_bits
= 1 << refcount_order
;
3244 s
->refcount_max
= UINT64_C(1) << (s
->refcount_bits
- 1);
3245 s
->refcount_max
+= s
->refcount_max
- 1;
3247 s
->refcount_block_bits
= s
->cluster_bits
- (refcount_order
- 3);
3248 s
->refcount_block_size
= 1 << s
->refcount_block_bits
;
3250 s
->get_refcount
= new_get_refcount
;
3251 s
->set_refcount
= new_set_refcount
;
3253 /* For cleaning up all old refblocks and the old reftable below the "done"
3255 new_reftable
= old_reftable
;
3256 new_reftable_size
= old_reftable_size
;
3257 new_reftable_offset
= old_reftable_offset
;
3261 /* On success, new_reftable actually points to the old reftable (and
3262 * new_reftable_size is the old reftable's size); but that is just
3264 for (i
= 0; i
< new_reftable_size
; i
++) {
3265 uint64_t offset
= new_reftable
[i
] & REFT_OFFSET_MASK
;
3267 qcow2_free_clusters(bs
, offset
, s
->cluster_size
,
3268 QCOW2_DISCARD_OTHER
);
3271 g_free(new_reftable
);
3273 if (new_reftable_offset
> 0) {
3274 qcow2_free_clusters(bs
, new_reftable_offset
,
3275 new_reftable_size
* sizeof(uint64_t),
3276 QCOW2_DISCARD_OTHER
);
3280 qemu_vfree(new_refblock
);
3284 static int64_t get_refblock_offset(BlockDriverState
*bs
, uint64_t offset
)
3286 BDRVQcow2State
*s
= bs
->opaque
;
3287 uint32_t index
= offset_to_reftable_index(s
, offset
);
3288 int64_t covering_refblock_offset
= 0;
3290 if (index
< s
->refcount_table_size
) {
3291 covering_refblock_offset
= s
->refcount_table
[index
] & REFT_OFFSET_MASK
;
3293 if (!covering_refblock_offset
) {
3294 qcow2_signal_corruption(bs
, true, -1, -1, "Refblock at %#" PRIx64
" is "
3295 "not covered by the refcount structures",
3300 return covering_refblock_offset
;
3303 static int qcow2_discard_refcount_block(BlockDriverState
*bs
,
3304 uint64_t discard_block_offs
)
3306 BDRVQcow2State
*s
= bs
->opaque
;
3307 int64_t refblock_offs
;
3308 uint64_t cluster_index
= discard_block_offs
>> s
->cluster_bits
;
3309 uint32_t block_index
= cluster_index
& (s
->refcount_block_size
- 1);
3313 refblock_offs
= get_refblock_offset(bs
, discard_block_offs
);
3314 if (refblock_offs
< 0) {
3315 return refblock_offs
;
3318 assert(discard_block_offs
!= 0);
3320 ret
= qcow2_cache_get(bs
, s
->refcount_block_cache
, refblock_offs
,
3326 if (s
->get_refcount(refblock
, block_index
) != 1) {
3327 qcow2_signal_corruption(bs
, true, -1, -1, "Invalid refcount:"
3328 " refblock offset %#" PRIx64
3329 ", reftable index %u"
3330 ", block offset %#" PRIx64
3331 ", refcount %#" PRIx64
,
3333 offset_to_reftable_index(s
, discard_block_offs
),
3335 s
->get_refcount(refblock
, block_index
));
3336 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3339 s
->set_refcount(refblock
, block_index
, 0);
3341 qcow2_cache_entry_mark_dirty(s
->refcount_block_cache
, refblock
);
3343 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3345 if (cluster_index
< s
->free_cluster_index
) {
3346 s
->free_cluster_index
= cluster_index
;
3349 refblock
= qcow2_cache_is_table_offset(s
->refcount_block_cache
,
3350 discard_block_offs
);
3352 /* discard refblock from the cache if refblock is cached */
3353 qcow2_cache_discard(s
->refcount_block_cache
, refblock
);
3355 update_refcount_discard(bs
, discard_block_offs
, s
->cluster_size
);
3360 int qcow2_shrink_reftable(BlockDriverState
*bs
)
3362 BDRVQcow2State
*s
= bs
->opaque
;
3363 uint64_t *reftable_tmp
=
3364 g_malloc(s
->refcount_table_size
* sizeof(uint64_t));
3367 for (i
= 0; i
< s
->refcount_table_size
; i
++) {
3368 int64_t refblock_offs
= s
->refcount_table
[i
] & REFT_OFFSET_MASK
;
3372 if (refblock_offs
== 0) {
3373 reftable_tmp
[i
] = 0;
3376 ret
= qcow2_cache_get(bs
, s
->refcount_block_cache
, refblock_offs
,
3382 /* the refblock has own reference */
3383 if (i
== offset_to_reftable_index(s
, refblock_offs
)) {
3384 uint64_t block_index
= (refblock_offs
>> s
->cluster_bits
) &
3385 (s
->refcount_block_size
- 1);
3386 uint64_t refcount
= s
->get_refcount(refblock
, block_index
);
3388 s
->set_refcount(refblock
, block_index
, 0);
3390 unused_block
= buffer_is_zero(refblock
, s
->cluster_size
);
3392 s
->set_refcount(refblock
, block_index
, refcount
);
3394 unused_block
= buffer_is_zero(refblock
, s
->cluster_size
);
3396 qcow2_cache_put(s
->refcount_block_cache
, &refblock
);
3398 reftable_tmp
[i
] = unused_block
? 0 : cpu_to_be64(s
->refcount_table
[i
]);
3401 ret
= bdrv_pwrite_sync(bs
->file
, s
->refcount_table_offset
, reftable_tmp
,
3402 s
->refcount_table_size
* sizeof(uint64_t));
3404 * If the write in the reftable failed the image may contain a partially
3405 * overwritten reftable. In this case it would be better to clear the
3406 * reftable in memory to avoid possible image corruption.
3408 for (i
= 0; i
< s
->refcount_table_size
; i
++) {
3409 if (s
->refcount_table
[i
] && !reftable_tmp
[i
]) {
3411 ret
= qcow2_discard_refcount_block(bs
, s
->refcount_table
[i
] &
3414 s
->refcount_table
[i
] = 0;
3418 if (!s
->cache_discards
) {
3419 qcow2_process_discards(bs
, ret
);
3423 g_free(reftable_tmp
);
3427 int64_t qcow2_get_last_cluster(BlockDriverState
*bs
, int64_t size
)
3429 BDRVQcow2State
*s
= bs
->opaque
;
3432 for (i
= size_to_clusters(s
, size
) - 1; i
>= 0; i
--) {
3434 int ret
= qcow2_get_refcount(bs
, i
, &refcount
);
3436 fprintf(stderr
, "Can't get refcount for cluster %" PRId64
": %s\n",
3444 qcow2_signal_corruption(bs
, true, -1, -1,
3445 "There are no references in the refcount table.");