2009-05-28 18:07:05 +04:00
|
|
|
/*
|
|
|
|
* Block driver for the QCOW version 2 format
|
|
|
|
*
|
|
|
|
* Copyright (c) 2004-2006 Fabrice Bellard
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <zlib.h>
|
|
|
|
|
|
|
|
#include "qemu-common.h"
|
|
|
|
#include "block_int.h"
|
|
|
|
#include "block/qcow2.h"
|
2012-03-01 21:36:21 +04:00
|
|
|
#include "trace.h"
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2010-10-18 19:53:53 +04:00
|
|
|
int qcow2_grow_l1_table(BlockDriverState *bs, int min_size, bool exact_size)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
int new_l1_size, new_l1_size2, ret, i;
|
|
|
|
uint64_t *new_l1_table;
|
2010-01-20 17:04:01 +03:00
|
|
|
int64_t new_l1_table_offset;
|
2009-05-28 18:07:05 +04:00
|
|
|
uint8_t data[12];
|
|
|
|
|
2010-10-18 19:53:53 +04:00
|
|
|
if (min_size <= s->l1_size)
|
2009-05-28 18:07:05 +04:00
|
|
|
return 0;
|
2010-10-18 19:53:53 +04:00
|
|
|
|
|
|
|
if (exact_size) {
|
|
|
|
new_l1_size = min_size;
|
|
|
|
} else {
|
|
|
|
/* Bump size up to reduce the number of times we have to grow */
|
|
|
|
new_l1_size = s->l1_size;
|
|
|
|
if (new_l1_size == 0) {
|
|
|
|
new_l1_size = 1;
|
|
|
|
}
|
|
|
|
while (min_size > new_l1_size) {
|
|
|
|
new_l1_size = (new_l1_size * 3 + 1) / 2;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
2010-10-18 19:53:53 +04:00
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
#ifdef DEBUG_ALLOC2
|
2011-08-25 11:23:55 +04:00
|
|
|
fprintf(stderr, "grow l1_table from %d to %d\n", s->l1_size, new_l1_size);
|
2009-05-28 18:07:05 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
new_l1_size2 = sizeof(uint64_t) * new_l1_size;
|
2011-08-21 07:09:37 +04:00
|
|
|
new_l1_table = g_malloc0(align_offset(new_l1_size2, 512));
|
2009-05-28 18:07:05 +04:00
|
|
|
memcpy(new_l1_table, s->l1_table, s->l1_size * sizeof(uint64_t));
|
|
|
|
|
|
|
|
/* write new table (align to cluster) */
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L1_GROW_ALLOC_TABLE);
|
2009-05-28 18:07:07 +04:00
|
|
|
new_l1_table_offset = qcow2_alloc_clusters(bs, new_l1_size2);
|
2010-01-20 17:04:01 +03:00
|
|
|
if (new_l1_table_offset < 0) {
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(new_l1_table);
|
2010-01-20 17:04:01 +03:00
|
|
|
return new_l1_table_offset;
|
|
|
|
}
|
2011-01-10 19:17:28 +03:00
|
|
|
|
|
|
|
ret = qcow2_cache_flush(bs, s->refcount_block_cache);
|
|
|
|
if (ret < 0) {
|
2011-06-01 12:50:00 +04:00
|
|
|
goto fail;
|
2011-01-10 19:17:28 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L1_GROW_WRITE_TABLE);
|
2009-05-28 18:07:05 +04:00
|
|
|
for(i = 0; i < s->l1_size; i++)
|
|
|
|
new_l1_table[i] = cpu_to_be64(new_l1_table[i]);
|
2010-06-16 19:44:35 +04:00
|
|
|
ret = bdrv_pwrite_sync(bs->file, new_l1_table_offset, new_l1_table, new_l1_size2);
|
|
|
|
if (ret < 0)
|
2009-05-28 18:07:05 +04:00
|
|
|
goto fail;
|
|
|
|
for(i = 0; i < s->l1_size; i++)
|
|
|
|
new_l1_table[i] = be64_to_cpu(new_l1_table[i]);
|
|
|
|
|
|
|
|
/* set new table */
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L1_GROW_ACTIVATE_TABLE);
|
2009-05-28 18:07:05 +04:00
|
|
|
cpu_to_be32w((uint32_t*)data, new_l1_size);
|
2011-01-01 23:50:34 +03:00
|
|
|
cpu_to_be64wu((uint64_t*)(data + 4), new_l1_table_offset);
|
2010-06-16 19:44:35 +04:00
|
|
|
ret = bdrv_pwrite_sync(bs->file, offsetof(QCowHeader, l1_size), data,sizeof(data));
|
|
|
|
if (ret < 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
goto fail;
|
2010-01-20 17:02:58 +03:00
|
|
|
}
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(s->l1_table);
|
2009-05-28 18:07:07 +04:00
|
|
|
qcow2_free_clusters(bs, s->l1_table_offset, s->l1_size * sizeof(uint64_t));
|
2009-05-28 18:07:05 +04:00
|
|
|
s->l1_table_offset = new_l1_table_offset;
|
|
|
|
s->l1_table = new_l1_table;
|
|
|
|
s->l1_size = new_l1_size;
|
|
|
|
return 0;
|
|
|
|
fail:
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(new_l1_table);
|
2010-01-20 17:02:58 +03:00
|
|
|
qcow2_free_clusters(bs, new_l1_table_offset, new_l1_size2);
|
2010-06-16 19:44:35 +04:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* l2_load
|
|
|
|
*
|
|
|
|
* Loads a L2 table into memory. If the table is in the cache, the cache
|
|
|
|
* is used; otherwise the L2 table is loaded from the image file.
|
|
|
|
*
|
|
|
|
* Returns a pointer to the L2 table on success, or NULL if the read from
|
|
|
|
* the image file failed.
|
|
|
|
*/
|
|
|
|
|
2010-05-21 20:25:20 +04:00
|
|
|
static int l2_load(BlockDriverState *bs, uint64_t l2_offset,
|
|
|
|
uint64_t **l2_table)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2010-05-21 20:25:20 +04:00
|
|
|
int ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2011-01-10 19:17:28 +03:00
|
|
|
ret = qcow2_cache_get(bs, s->l2_table_cache, l2_offset, (void**) l2_table);
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2011-01-10 19:17:28 +03:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
2009-06-16 13:31:28 +04:00
|
|
|
/*
|
|
|
|
* Writes one sector of the L1 table to the disk (can't update single entries
|
|
|
|
* and we really don't want bdrv_pread to perform a read-modify-write)
|
|
|
|
*/
|
|
|
|
#define L1_ENTRIES_PER_SECTOR (512 / 8)
|
2010-04-14 16:17:38 +04:00
|
|
|
static int write_l1_entry(BlockDriverState *bs, int l1_index)
|
2009-06-16 13:31:28 +04:00
|
|
|
{
|
2010-04-14 16:17:38 +04:00
|
|
|
BDRVQcowState *s = bs->opaque;
|
2009-06-16 13:31:28 +04:00
|
|
|
uint64_t buf[L1_ENTRIES_PER_SECTOR];
|
|
|
|
int l1_start_index;
|
2010-03-23 19:28:22 +03:00
|
|
|
int i, ret;
|
2009-06-16 13:31:28 +04:00
|
|
|
|
|
|
|
l1_start_index = l1_index & ~(L1_ENTRIES_PER_SECTOR - 1);
|
|
|
|
for (i = 0; i < L1_ENTRIES_PER_SECTOR; i++) {
|
|
|
|
buf[i] = cpu_to_be64(s->l1_table[l1_start_index + i]);
|
|
|
|
}
|
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L1_UPDATE);
|
2010-06-16 19:44:35 +04:00
|
|
|
ret = bdrv_pwrite_sync(bs->file, s->l1_table_offset + 8 * l1_start_index,
|
2010-03-23 19:28:22 +03:00
|
|
|
buf, sizeof(buf));
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
2009-06-16 13:31:28 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
/*
|
|
|
|
* l2_allocate
|
|
|
|
*
|
|
|
|
* Allocate a new l2 entry in the file. If l1_index points to an already
|
|
|
|
* used entry in the L2 table (i.e. we are doing a copy on write for the L2
|
|
|
|
* table) copy the contents of the old L2 table into the newly allocated one.
|
|
|
|
* Otherwise the new table is initialized with zeros.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2010-03-23 19:41:24 +03:00
|
|
|
static int l2_allocate(BlockDriverState *bs, int l1_index, uint64_t **table)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2009-06-16 13:31:28 +04:00
|
|
|
uint64_t old_l2_offset;
|
2010-02-02 17:20:57 +03:00
|
|
|
uint64_t *l2_table;
|
|
|
|
int64_t l2_offset;
|
2010-03-23 19:41:24 +03:00
|
|
|
int ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
old_l2_offset = s->l1_table[l1_index];
|
|
|
|
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate(bs, l1_index);
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
/* allocate a new l2 entry */
|
|
|
|
|
2009-05-28 18:07:07 +04:00
|
|
|
l2_offset = qcow2_alloc_clusters(bs, s->l2_size * sizeof(uint64_t));
|
2010-01-20 17:04:01 +03:00
|
|
|
if (l2_offset < 0) {
|
2010-03-23 19:41:24 +03:00
|
|
|
return l2_offset;
|
2010-01-20 17:04:01 +03:00
|
|
|
}
|
2011-01-10 19:17:28 +03:00
|
|
|
|
|
|
|
ret = qcow2_cache_flush(bs, s->refcount_block_cache);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* allocate a new entry in the l2 cache */
|
|
|
|
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate_get_empty(bs, l1_index);
|
2011-01-10 19:17:28 +03:00
|
|
|
ret = qcow2_cache_get_empty(bs, s->l2_table_cache, l2_offset, (void**) table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
l2_table = *table;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-02-23 18:40:55 +04:00
|
|
|
if ((old_l2_offset & L1E_OFFSET_MASK) == 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
/* if there was no old l2 table, clear the new table */
|
|
|
|
memset(l2_table, 0, s->l2_size * sizeof(uint64_t));
|
|
|
|
} else {
|
2011-01-10 19:17:28 +03:00
|
|
|
uint64_t* old_table;
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
/* if there was an old l2 table, read it from the disk */
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L2_ALLOC_COW_READ);
|
2012-02-23 18:40:55 +04:00
|
|
|
ret = qcow2_cache_get(bs, s->l2_table_cache,
|
|
|
|
old_l2_offset & L1E_OFFSET_MASK,
|
2011-01-10 19:17:28 +03:00
|
|
|
(void**) &old_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
memcpy(l2_table, old_table, s->cluster_size);
|
|
|
|
|
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &old_table);
|
2010-03-23 19:41:24 +03:00
|
|
|
if (ret < 0) {
|
2010-05-12 18:23:26 +04:00
|
|
|
goto fail;
|
2010-03-23 19:41:24 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
2011-01-10 19:17:28 +03:00
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
/* write the l2 table to the file */
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L2_ALLOC_WRITE);
|
2011-01-10 19:17:28 +03:00
|
|
|
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate_write_l2(bs, l1_index);
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_entry_mark_dirty(s->l2_table_cache, l2_table);
|
|
|
|
ret = qcow2_cache_flush(bs, s->l2_table_cache);
|
2010-03-23 19:41:24 +03:00
|
|
|
if (ret < 0) {
|
2010-05-12 18:23:26 +04:00
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update the L1 entry */
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate_write_l1(bs, l1_index);
|
2010-05-12 18:23:26 +04:00
|
|
|
s->l1_table[l1_index] = l2_offset | QCOW_OFLAG_COPIED;
|
|
|
|
ret = write_l1_entry(bs, l1_index);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto fail;
|
2010-03-23 19:41:24 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2010-03-23 19:41:24 +03:00
|
|
|
*table = l2_table;
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate_done(bs, l1_index, 0);
|
2010-03-23 19:41:24 +03:00
|
|
|
return 0;
|
2010-05-12 18:23:26 +04:00
|
|
|
|
|
|
|
fail:
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_l2_allocate_done(bs, l1_index, ret);
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_put(bs, s->l2_table_cache, (void**) table);
|
2010-06-07 18:43:22 +04:00
|
|
|
s->l1_table[l1_index] = old_l2_offset;
|
2010-05-12 18:23:26 +04:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
2012-03-15 19:37:40 +04:00
|
|
|
/*
|
|
|
|
* Checks how many clusters in a given L2 table are contiguous in the image
|
|
|
|
* file. As soon as one of the flags in the bitmask stop_flags changes compared
|
|
|
|
* to the first cluster, the search is stopped and the cluster is not counted
|
|
|
|
* as contiguous. (This allows it, for example, to stop at the first compressed
|
|
|
|
* cluster which may require a different handling)
|
|
|
|
*/
|
2009-05-28 18:07:05 +04:00
|
|
|
static int count_contiguous_clusters(uint64_t nb_clusters, int cluster_size,
|
2012-03-15 19:37:40 +04:00
|
|
|
uint64_t *l2_table, uint64_t start, uint64_t stop_flags)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
int i;
|
2012-03-15 19:37:40 +04:00
|
|
|
uint64_t mask = stop_flags | L2E_OFFSET_MASK;
|
|
|
|
uint64_t offset = be64_to_cpu(l2_table[0]) & mask;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
if (!offset)
|
|
|
|
return 0;
|
|
|
|
|
2012-03-15 19:37:40 +04:00
|
|
|
for (i = start; i < start + nb_clusters; i++) {
|
|
|
|
uint64_t l2_entry = be64_to_cpu(l2_table[i]) & mask;
|
|
|
|
if (offset + (uint64_t) i * cluster_size != l2_entry) {
|
2009-05-28 18:07:05 +04:00
|
|
|
break;
|
2012-03-15 19:37:40 +04:00
|
|
|
}
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
return (i - start);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int count_contiguous_free_clusters(uint64_t nb_clusters, uint64_t *l2_table)
|
|
|
|
{
|
2012-03-15 19:37:40 +04:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < nb_clusters; i++) {
|
|
|
|
int type = qcow2_get_cluster_type(be64_to_cpu(l2_table[i]));
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-15 19:37:40 +04:00
|
|
|
if (type != QCOW2_CLUSTER_UNALLOCATED) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The crypt function is compatible with the linux cryptoloop
|
|
|
|
algorithm for < 4 GB images. NOTE: out_buf == in_buf is
|
|
|
|
supported */
|
2009-05-28 18:07:07 +04:00
|
|
|
void qcow2_encrypt_sectors(BDRVQcowState *s, int64_t sector_num,
|
|
|
|
uint8_t *out_buf, const uint8_t *in_buf,
|
|
|
|
int nb_sectors, int enc,
|
|
|
|
const AES_KEY *key)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
union {
|
|
|
|
uint64_t ll[2];
|
|
|
|
uint8_t b[16];
|
|
|
|
} ivec;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i = 0; i < nb_sectors; i++) {
|
|
|
|
ivec.ll[0] = cpu_to_le64(sector_num);
|
|
|
|
ivec.ll[1] = 0;
|
|
|
|
AES_cbc_encrypt(in_buf, out_buf, 512, key,
|
|
|
|
ivec.b, enc);
|
|
|
|
sector_num++;
|
|
|
|
in_buf += 512;
|
|
|
|
out_buf += 512;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-30 16:23:41 +04:00
|
|
|
static int coroutine_fn copy_sectors(BlockDriverState *bs,
|
|
|
|
uint64_t start_sect,
|
|
|
|
uint64_t cluster_offset,
|
|
|
|
int n_start, int n_end)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2011-11-30 16:23:41 +04:00
|
|
|
QEMUIOVector qiov;
|
|
|
|
struct iovec iov;
|
2009-05-28 18:07:05 +04:00
|
|
|
int n, ret;
|
2011-09-19 13:26:48 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If this is the last cluster and it is only partially used, we must only
|
|
|
|
* copy until the end of the image, or bdrv_check_request will fail for the
|
|
|
|
* bdrv_read/write calls below.
|
|
|
|
*/
|
|
|
|
if (start_sect + n_end > bs->total_sectors) {
|
|
|
|
n_end = bs->total_sectors - start_sect;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
n = n_end - n_start;
|
2011-09-19 13:26:48 +04:00
|
|
|
if (n <= 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
return 0;
|
2011-09-19 13:26:48 +04:00
|
|
|
}
|
|
|
|
|
2011-11-30 16:23:41 +04:00
|
|
|
iov.iov_len = n * BDRV_SECTOR_SIZE;
|
|
|
|
iov.iov_base = qemu_blockalign(bs, iov.iov_len);
|
|
|
|
|
|
|
|
qemu_iovec_init_external(&qiov, &iov, 1);
|
2011-09-19 13:26:48 +04:00
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_COW_READ);
|
2011-11-30 16:23:41 +04:00
|
|
|
|
|
|
|
/* Call .bdrv_co_readv() directly instead of using the public block-layer
|
|
|
|
* interface. This avoids double I/O throttling and request tracking,
|
|
|
|
* which can lead to deadlock when block layer copy-on-read is enabled.
|
|
|
|
*/
|
|
|
|
ret = bs->drv->bdrv_co_readv(bs, start_sect + n_start, n, &qiov);
|
2011-09-19 13:26:48 +04:00
|
|
|
if (ret < 0) {
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
if (s->crypt_method) {
|
2009-05-28 18:07:07 +04:00
|
|
|
qcow2_encrypt_sectors(s, start_sect + n_start,
|
2011-11-30 16:23:41 +04:00
|
|
|
iov.iov_base, iov.iov_base, n, 1,
|
2009-05-28 18:07:05 +04:00
|
|
|
&s->aes_encrypt_key);
|
|
|
|
}
|
2011-09-19 13:26:48 +04:00
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_COW_WRITE);
|
2011-11-30 16:23:41 +04:00
|
|
|
ret = bdrv_co_writev(bs->file, (cluster_offset >> 9) + n_start, n, &qiov);
|
2011-09-19 13:26:48 +04:00
|
|
|
if (ret < 0) {
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
out:
|
2011-11-30 16:23:41 +04:00
|
|
|
qemu_vfree(iov.iov_base);
|
2011-09-19 13:26:48 +04:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_cluster_offset
|
|
|
|
*
|
2010-05-21 19:59:36 +04:00
|
|
|
* For a given offset of the disk image, find the cluster offset in
|
|
|
|
* qcow2 file. The offset is stored in *cluster_offset.
|
2009-05-28 18:07:05 +04:00
|
|
|
*
|
2011-08-08 03:47:36 +04:00
|
|
|
* on entry, *num is the number of contiguous sectors we'd like to
|
2009-05-28 18:07:05 +04:00
|
|
|
* access following offset.
|
|
|
|
*
|
2011-08-08 03:47:36 +04:00
|
|
|
* on exit, *num is the number of contiguous sectors we can read.
|
2009-05-28 18:07:05 +04:00
|
|
|
*
|
2012-03-14 22:15:03 +04:00
|
|
|
* Returns the cluster type (QCOW2_CLUSTER_*) on success, -errno in error
|
|
|
|
* cases.
|
2009-05-28 18:07:05 +04:00
|
|
|
*/
|
2010-05-21 19:59:36 +04:00
|
|
|
int qcow2_get_cluster_offset(BlockDriverState *bs, uint64_t offset,
|
|
|
|
int *num, uint64_t *cluster_offset)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2009-09-15 14:30:43 +04:00
|
|
|
unsigned int l1_index, l2_index;
|
2010-05-21 19:59:36 +04:00
|
|
|
uint64_t l2_offset, *l2_table;
|
2009-05-28 18:07:05 +04:00
|
|
|
int l1_bits, c;
|
2009-09-15 14:30:43 +04:00
|
|
|
unsigned int index_in_cluster, nb_clusters;
|
|
|
|
uint64_t nb_available, nb_needed;
|
2010-05-21 20:25:20 +04:00
|
|
|
int ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
index_in_cluster = (offset >> 9) & (s->cluster_sectors - 1);
|
|
|
|
nb_needed = *num + index_in_cluster;
|
|
|
|
|
|
|
|
l1_bits = s->l2_bits + s->cluster_bits;
|
|
|
|
|
|
|
|
/* compute how many bytes there are between the offset and
|
|
|
|
* the end of the l1 entry
|
|
|
|
*/
|
|
|
|
|
2009-09-15 14:30:43 +04:00
|
|
|
nb_available = (1ULL << l1_bits) - (offset & ((1ULL << l1_bits) - 1));
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* compute the number of available sectors */
|
|
|
|
|
|
|
|
nb_available = (nb_available >> 9) + index_in_cluster;
|
|
|
|
|
|
|
|
if (nb_needed > nb_available) {
|
|
|
|
nb_needed = nb_available;
|
|
|
|
}
|
|
|
|
|
2010-05-21 19:59:36 +04:00
|
|
|
*cluster_offset = 0;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* seek the the l2 offset in the l1 table */
|
|
|
|
|
|
|
|
l1_index = offset >> l1_bits;
|
2012-03-14 22:15:03 +04:00
|
|
|
if (l1_index >= s->l1_size) {
|
|
|
|
ret = QCOW2_CLUSTER_UNALLOCATED;
|
2009-05-28 18:07:05 +04:00
|
|
|
goto out;
|
2012-03-14 22:15:03 +04:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-14 22:15:03 +04:00
|
|
|
l2_offset = s->l1_table[l1_index] & L1E_OFFSET_MASK;
|
|
|
|
if (!l2_offset) {
|
|
|
|
ret = QCOW2_CLUSTER_UNALLOCATED;
|
2009-05-28 18:07:05 +04:00
|
|
|
goto out;
|
2012-03-14 22:15:03 +04:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* load the l2 table in memory */
|
|
|
|
|
2010-05-21 20:25:20 +04:00
|
|
|
ret = l2_load(bs, l2_offset, &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
2010-05-21 19:59:36 +04:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* find the cluster offset for the given disk offset */
|
|
|
|
|
|
|
|
l2_index = (offset >> s->cluster_bits) & (s->l2_size - 1);
|
2010-05-21 19:59:36 +04:00
|
|
|
*cluster_offset = be64_to_cpu(l2_table[l2_index]);
|
2009-05-28 18:07:05 +04:00
|
|
|
nb_clusters = size_to_clusters(s, nb_needed << 9);
|
|
|
|
|
2012-03-14 22:15:03 +04:00
|
|
|
ret = qcow2_get_cluster_type(*cluster_offset);
|
|
|
|
switch (ret) {
|
|
|
|
case QCOW2_CLUSTER_COMPRESSED:
|
|
|
|
/* Compressed clusters can only be processed one by one */
|
|
|
|
c = 1;
|
|
|
|
*cluster_offset &= L2E_COMPRESSED_OFFSET_SIZE_MASK;
|
|
|
|
break;
|
2012-03-16 18:02:38 +04:00
|
|
|
case QCOW2_CLUSTER_ZERO:
|
|
|
|
c = count_contiguous_clusters(nb_clusters, s->cluster_size,
|
|
|
|
&l2_table[l2_index], 0,
|
|
|
|
QCOW_OFLAG_COMPRESSED | QCOW_OFLAG_ZERO);
|
|
|
|
*cluster_offset = 0;
|
|
|
|
break;
|
2012-03-14 22:15:03 +04:00
|
|
|
case QCOW2_CLUSTER_UNALLOCATED:
|
2009-05-28 18:07:05 +04:00
|
|
|
/* how many empty clusters ? */
|
|
|
|
c = count_contiguous_free_clusters(nb_clusters, &l2_table[l2_index]);
|
2012-03-14 22:15:03 +04:00
|
|
|
*cluster_offset = 0;
|
|
|
|
break;
|
|
|
|
case QCOW2_CLUSTER_NORMAL:
|
2009-05-28 18:07:05 +04:00
|
|
|
/* how many allocated clusters ? */
|
|
|
|
c = count_contiguous_clusters(nb_clusters, s->cluster_size,
|
2012-03-16 18:02:38 +04:00
|
|
|
&l2_table[l2_index], 0,
|
|
|
|
QCOW_OFLAG_COMPRESSED | QCOW_OFLAG_ZERO);
|
2012-03-14 22:15:03 +04:00
|
|
|
*cluster_offset &= L2E_OFFSET_MASK;
|
|
|
|
break;
|
2012-06-15 15:43:18 +04:00
|
|
|
default:
|
|
|
|
abort();
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
|
|
|
|
2012-03-14 22:15:03 +04:00
|
|
|
nb_available = (c * s->cluster_sectors);
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
out:
|
|
|
|
if (nb_available > nb_needed)
|
|
|
|
nb_available = nb_needed;
|
|
|
|
|
|
|
|
*num = nb_available - index_in_cluster;
|
|
|
|
|
2012-03-14 22:15:03 +04:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get_cluster_table
|
|
|
|
*
|
|
|
|
* for a given disk offset, load (and allocate if needed)
|
|
|
|
* the l2 table.
|
|
|
|
*
|
|
|
|
* the l2 table offset in the qcow2 file and the cluster index
|
|
|
|
* in the l2 table are given to the caller.
|
|
|
|
*
|
2010-01-20 17:03:00 +03:00
|
|
|
* Returns 0 on success, -errno in failure case
|
2009-05-28 18:07:05 +04:00
|
|
|
*/
|
|
|
|
static int get_cluster_table(BlockDriverState *bs, uint64_t offset,
|
|
|
|
uint64_t **new_l2_table,
|
|
|
|
int *new_l2_index)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2009-09-15 14:30:43 +04:00
|
|
|
unsigned int l1_index, l2_index;
|
2010-03-23 19:41:24 +03:00
|
|
|
uint64_t l2_offset;
|
|
|
|
uint64_t *l2_table = NULL;
|
2009-09-15 14:30:43 +04:00
|
|
|
int ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* seek the the l2 offset in the l1 table */
|
|
|
|
|
|
|
|
l1_index = offset >> (s->l2_bits + s->cluster_bits);
|
|
|
|
if (l1_index >= s->l1_size) {
|
2010-10-18 19:53:53 +04:00
|
|
|
ret = qcow2_grow_l1_table(bs, l1_index + 1, false);
|
2010-01-20 17:03:00 +03:00
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
2012-02-23 18:40:55 +04:00
|
|
|
|
|
|
|
l2_offset = s->l1_table[l1_index] & L1E_OFFSET_MASK;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* seek the l2 table of the given l2 offset */
|
|
|
|
|
2012-02-23 18:40:55 +04:00
|
|
|
if (s->l1_table[l1_index] & QCOW_OFLAG_COPIED) {
|
2009-05-28 18:07:05 +04:00
|
|
|
/* load the l2 table in memory */
|
2010-05-21 20:25:20 +04:00
|
|
|
ret = l2_load(bs, l2_offset, &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
2010-01-20 17:03:00 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
} else {
|
2011-02-09 19:36:19 +03:00
|
|
|
/* First allocate a new L2 table (and do COW if needed) */
|
2010-03-23 19:41:24 +03:00
|
|
|
ret = l2_allocate(bs, l1_index, &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
2010-01-20 17:03:00 +03:00
|
|
|
}
|
2011-02-09 19:36:19 +03:00
|
|
|
|
|
|
|
/* Then decrease the refcount of the old table */
|
|
|
|
if (l2_offset) {
|
|
|
|
qcow2_free_clusters(bs, l2_offset, s->l2_size * sizeof(uint64_t));
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* find the cluster offset for the given disk offset */
|
|
|
|
|
|
|
|
l2_index = (offset >> s->cluster_bits) & (s->l2_size - 1);
|
|
|
|
|
|
|
|
*new_l2_table = l2_table;
|
|
|
|
*new_l2_index = l2_index;
|
|
|
|
|
2010-01-20 17:03:00 +03:00
|
|
|
return 0;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* alloc_compressed_cluster_offset
|
|
|
|
*
|
|
|
|
* For a given offset of the disk image, return cluster offset in
|
|
|
|
* qcow2 file.
|
|
|
|
*
|
|
|
|
* If the offset is not found, allocate a new compressed cluster.
|
|
|
|
*
|
|
|
|
* Return the cluster offset if successful,
|
|
|
|
* Return 0, otherwise.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2009-05-28 18:07:07 +04:00
|
|
|
uint64_t qcow2_alloc_compressed_cluster_offset(BlockDriverState *bs,
|
|
|
|
uint64_t offset,
|
|
|
|
int compressed_size)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
int l2_index, ret;
|
2012-03-12 20:46:51 +04:00
|
|
|
uint64_t *l2_table;
|
2010-02-02 17:20:57 +03:00
|
|
|
int64_t cluster_offset;
|
2009-05-28 18:07:05 +04:00
|
|
|
int nb_csectors;
|
|
|
|
|
2012-03-12 20:46:51 +04:00
|
|
|
ret = get_cluster_table(bs, offset, &l2_table, &l2_index);
|
2010-01-20 17:03:00 +03:00
|
|
|
if (ret < 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
return 0;
|
2010-01-20 17:03:00 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-15 20:20:11 +04:00
|
|
|
/* Compression can't overwrite anything. Fail if the cluster was already
|
|
|
|
* allocated. */
|
2009-05-28 18:07:05 +04:00
|
|
|
cluster_offset = be64_to_cpu(l2_table[l2_index]);
|
2012-03-15 20:20:11 +04:00
|
|
|
if (cluster_offset & L2E_OFFSET_MASK) {
|
2011-10-18 19:12:44 +04:00
|
|
|
qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
|
|
|
return 0;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2009-05-28 18:07:07 +04:00
|
|
|
cluster_offset = qcow2_alloc_bytes(bs, compressed_size);
|
2010-01-20 17:04:01 +03:00
|
|
|
if (cluster_offset < 0) {
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
2010-01-20 17:04:01 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
nb_csectors = ((cluster_offset + compressed_size - 1) >> 9) -
|
|
|
|
(cluster_offset >> 9);
|
|
|
|
|
|
|
|
cluster_offset |= QCOW_OFLAG_COMPRESSED |
|
|
|
|
((uint64_t)nb_csectors << s->csize_shift);
|
|
|
|
|
|
|
|
/* update L2 table */
|
|
|
|
|
|
|
|
/* compressed clusters never have the copied flag */
|
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_L2_UPDATE_COMPRESSED);
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_entry_mark_dirty(s->l2_table_cache, l2_table);
|
2009-05-28 18:07:05 +04:00
|
|
|
l2_table[l2_index] = cpu_to_be64(cluster_offset);
|
2011-01-10 19:17:28 +03:00
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
2010-03-23 14:49:17 +03:00
|
|
|
if (ret < 0) {
|
2011-01-10 19:17:28 +03:00
|
|
|
return 0;
|
2009-06-16 13:31:29 +04:00
|
|
|
}
|
|
|
|
|
2011-01-10 19:17:28 +03:00
|
|
|
return cluster_offset;
|
2009-06-16 13:31:29 +04:00
|
|
|
}
|
|
|
|
|
2012-12-07 21:08:43 +04:00
|
|
|
static int perform_cow(BlockDriverState *bs, QCowL2Meta *m, Qcow2COWRegion *r)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (r->nb_sectors == 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
qemu_co_mutex_unlock(&s->lock);
|
|
|
|
ret = copy_sectors(bs, m->offset / BDRV_SECTOR_SIZE, m->alloc_offset,
|
|
|
|
r->offset / BDRV_SECTOR_SIZE,
|
|
|
|
r->offset / BDRV_SECTOR_SIZE + r->nb_sectors);
|
|
|
|
qemu_co_mutex_lock(&s->lock);
|
|
|
|
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Before we update the L2 table to actually point to the new cluster, we
|
|
|
|
* need to be sure that the refcounts have been increased and COW was
|
|
|
|
* handled.
|
|
|
|
*/
|
|
|
|
qcow2_cache_depends_on_flush(s->l2_table_cache);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-01-20 17:03:01 +03:00
|
|
|
int qcow2_alloc_cluster_link_l2(BlockDriverState *bs, QCowL2Meta *m)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
int i, j = 0, l2_index, ret;
|
2012-12-07 21:08:43 +04:00
|
|
|
uint64_t *old_cluster, *l2_table;
|
2012-03-02 17:10:54 +04:00
|
|
|
uint64_t cluster_offset = m->alloc_offset;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_cluster_link_l2(qemu_coroutine_self(), m->nb_clusters);
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
if (m->nb_clusters == 0)
|
|
|
|
return 0;
|
|
|
|
|
2011-08-21 07:09:37 +04:00
|
|
|
old_cluster = g_malloc(m->nb_clusters * sizeof(uint64_t));
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
/* copy content of unmodified sectors */
|
2012-12-07 21:08:43 +04:00
|
|
|
ret = perform_cow(bs, m, &m->cow_start);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto err;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
2012-12-07 21:08:43 +04:00
|
|
|
ret = perform_cow(bs, m, &m->cow_end);
|
|
|
|
if (ret < 0) {
|
|
|
|
goto err;
|
2011-01-10 19:17:28 +03:00
|
|
|
}
|
|
|
|
|
2012-12-07 21:08:43 +04:00
|
|
|
/* Update L2 table. */
|
|
|
|
|
2012-07-27 12:05:22 +04:00
|
|
|
if (qcow2_need_accurate_refcounts(s)) {
|
|
|
|
qcow2_cache_set_dependency(bs, s->l2_table_cache,
|
|
|
|
s->refcount_block_cache);
|
|
|
|
}
|
2012-03-12 20:46:51 +04:00
|
|
|
ret = get_cluster_table(bs, m->offset, &l2_table, &l2_index);
|
2010-01-20 17:03:00 +03:00
|
|
|
if (ret < 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
goto err;
|
2010-01-20 17:03:00 +03:00
|
|
|
}
|
2011-01-10 19:17:28 +03:00
|
|
|
qcow2_cache_entry_mark_dirty(s->l2_table_cache, l2_table);
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
for (i = 0; i < m->nb_clusters; i++) {
|
|
|
|
/* if two concurrent writes happen to the same unallocated cluster
|
|
|
|
* each write allocates separate cluster and writes data concurrently.
|
|
|
|
* The first one to complete updates l2 table with pointer to its
|
|
|
|
* cluster the second one has to do RMW (which is done above by
|
|
|
|
* copy_sectors()), update l2 table with its cluster pointer and free
|
|
|
|
* old cluster. This is what this loop does */
|
|
|
|
if(l2_table[l2_index + i] != 0)
|
|
|
|
old_cluster[j++] = l2_table[l2_index + i];
|
|
|
|
|
|
|
|
l2_table[l2_index + i] = cpu_to_be64((cluster_offset +
|
|
|
|
(i << s->cluster_bits)) | QCOW_OFLAG_COPIED);
|
|
|
|
}
|
|
|
|
|
2010-09-17 19:02:09 +04:00
|
|
|
|
2011-01-10 19:17:28 +03:00
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
2010-03-23 14:53:47 +03:00
|
|
|
if (ret < 0) {
|
2009-05-28 18:07:05 +04:00
|
|
|
goto err;
|
2009-06-16 13:31:29 +04:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2010-09-01 14:40:52 +04:00
|
|
|
/*
|
|
|
|
* If this was a COW, we need to decrease the refcount of the old cluster.
|
|
|
|
* Also flush bs->file to get the right order for L2 and refcount update.
|
|
|
|
*/
|
|
|
|
if (j != 0) {
|
|
|
|
for (i = 0; i < j; i++) {
|
2012-02-23 18:40:55 +04:00
|
|
|
qcow2_free_any_clusters(bs, be64_to_cpu(old_cluster[i]), 1);
|
2010-09-01 14:40:52 +04:00
|
|
|
}
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
err:
|
2011-08-21 07:09:37 +04:00
|
|
|
g_free(old_cluster);
|
2009-05-28 18:07:05 +04:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-03-02 22:27:53 +04:00
|
|
|
/*
|
|
|
|
* Returns the number of contiguous clusters that can be used for an allocating
|
|
|
|
* write, but require COW to be performed (this includes yet unallocated space,
|
|
|
|
* which must copy from the backing file)
|
|
|
|
*/
|
|
|
|
static int count_cow_clusters(BDRVQcowState *s, int nb_clusters,
|
|
|
|
uint64_t *l2_table, int l2_index)
|
|
|
|
{
|
2012-03-27 15:17:22 +04:00
|
|
|
int i;
|
2012-03-02 22:27:53 +04:00
|
|
|
|
2012-03-27 15:17:22 +04:00
|
|
|
for (i = 0; i < nb_clusters; i++) {
|
|
|
|
uint64_t l2_entry = be64_to_cpu(l2_table[l2_index + i]);
|
|
|
|
int cluster_type = qcow2_get_cluster_type(l2_entry);
|
|
|
|
|
|
|
|
switch(cluster_type) {
|
|
|
|
case QCOW2_CLUSTER_NORMAL:
|
|
|
|
if (l2_entry & QCOW_OFLAG_COPIED) {
|
|
|
|
goto out;
|
|
|
|
}
|
2012-03-02 22:27:53 +04:00
|
|
|
break;
|
2012-03-27 15:17:22 +04:00
|
|
|
case QCOW2_CLUSTER_UNALLOCATED:
|
|
|
|
case QCOW2_CLUSTER_COMPRESSED:
|
2012-03-16 18:02:38 +04:00
|
|
|
case QCOW2_CLUSTER_ZERO:
|
2012-03-02 22:27:53 +04:00
|
|
|
break;
|
2012-03-27 15:17:22 +04:00
|
|
|
default:
|
|
|
|
abort();
|
|
|
|
}
|
2012-03-02 22:27:53 +04:00
|
|
|
}
|
|
|
|
|
2012-03-27 15:17:22 +04:00
|
|
|
out:
|
2012-03-02 22:27:53 +04:00
|
|
|
assert(i <= nb_clusters);
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/*
|
|
|
|
* Allocates new clusters for the given guest_offset.
|
|
|
|
*
|
|
|
|
* At most *nb_clusters are allocated, and on return *nb_clusters is updated to
|
|
|
|
* contain the number of clusters that have been allocated and are contiguous
|
|
|
|
* in the image file.
|
|
|
|
*
|
|
|
|
* If *host_offset is non-zero, it specifies the offset in the image file at
|
|
|
|
* which the new clusters must start. *nb_clusters can be 0 on return in this
|
|
|
|
* case if the cluster at host_offset is already in use. If *host_offset is
|
|
|
|
* zero, the clusters can be allocated anywhere in the image file.
|
|
|
|
*
|
|
|
|
* *host_offset is updated to contain the offset into the image file at which
|
|
|
|
* the first allocated cluster starts.
|
|
|
|
*
|
|
|
|
* Return 0 on success and -errno in error cases. -EAGAIN means that the
|
|
|
|
* function has been waiting for another request and the allocation must be
|
|
|
|
* restarted, but the whole request should not be failed.
|
|
|
|
*/
|
|
|
|
static int do_alloc_cluster_offset(BlockDriverState *bs, uint64_t guest_offset,
|
2012-04-24 18:10:03 +04:00
|
|
|
uint64_t *host_offset, unsigned int *nb_clusters)
|
2012-03-02 17:10:54 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
QCowL2Meta *old_alloc;
|
|
|
|
|
|
|
|
trace_qcow2_do_alloc_clusters_offset(qemu_coroutine_self(), guest_offset,
|
|
|
|
*host_offset, *nb_clusters);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if there already is an AIO write request in flight which allocates
|
|
|
|
* the same cluster. In this case we need to wait until the previous
|
|
|
|
* request has completed and updated the L2 table accordingly.
|
|
|
|
*/
|
|
|
|
QLIST_FOREACH(old_alloc, &s->cluster_allocs, next_in_flight) {
|
|
|
|
|
|
|
|
uint64_t start = guest_offset >> s->cluster_bits;
|
|
|
|
uint64_t end = start + *nb_clusters;
|
|
|
|
uint64_t old_start = old_alloc->offset >> s->cluster_bits;
|
|
|
|
uint64_t old_end = old_start + old_alloc->nb_clusters;
|
|
|
|
|
|
|
|
if (end < old_start || start > old_end) {
|
|
|
|
/* No intersection */
|
|
|
|
} else {
|
|
|
|
if (start < old_start) {
|
|
|
|
/* Stop at the start of a running allocation */
|
|
|
|
*nb_clusters = old_start - start;
|
|
|
|
} else {
|
|
|
|
*nb_clusters = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*nb_clusters == 0) {
|
|
|
|
/* Wait for the dependency to complete. We need to recheck
|
|
|
|
* the free/allocated clusters when we continue. */
|
|
|
|
qemu_co_mutex_unlock(&s->lock);
|
|
|
|
qemu_co_queue_wait(&old_alloc->dependent_requests);
|
|
|
|
qemu_co_mutex_lock(&s->lock);
|
|
|
|
return -EAGAIN;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!*nb_clusters) {
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Allocate new clusters */
|
|
|
|
trace_qcow2_cluster_alloc_phys(qemu_coroutine_self());
|
|
|
|
if (*host_offset == 0) {
|
2012-05-24 14:56:32 +04:00
|
|
|
int64_t cluster_offset =
|
|
|
|
qcow2_alloc_clusters(bs, *nb_clusters * s->cluster_size);
|
|
|
|
if (cluster_offset < 0) {
|
|
|
|
return cluster_offset;
|
|
|
|
}
|
|
|
|
*host_offset = cluster_offset;
|
|
|
|
return 0;
|
2012-03-02 17:10:54 +04:00
|
|
|
} else {
|
2012-05-24 14:56:32 +04:00
|
|
|
int ret = qcow2_alloc_clusters_at(bs, *host_offset, *nb_clusters);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
*nb_clusters = ret;
|
|
|
|
return 0;
|
2012-03-02 17:10:54 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-28 18:07:05 +04:00
|
|
|
/*
|
|
|
|
* alloc_cluster_offset
|
|
|
|
*
|
2012-03-02 17:10:54 +04:00
|
|
|
* For a given offset on the virtual disk, find the cluster offset in qcow2
|
|
|
|
* file. If the offset is not found, allocate a new cluster.
|
2009-05-28 18:07:05 +04:00
|
|
|
*
|
2012-03-02 17:10:54 +04:00
|
|
|
* If the cluster was already allocated, m->nb_clusters is set to 0 and
|
2011-09-07 18:19:17 +04:00
|
|
|
* other fields in m are meaningless.
|
2010-01-20 17:03:01 +03:00
|
|
|
*
|
|
|
|
* If the cluster is newly allocated, m->nb_clusters is set to the number of
|
2011-06-30 19:42:09 +04:00
|
|
|
* contiguous clusters that have been allocated. In this case, the other
|
|
|
|
* fields of m are valid and contain information about the first allocated
|
|
|
|
* cluster.
|
2009-05-28 18:07:05 +04:00
|
|
|
*
|
2011-06-30 19:42:09 +04:00
|
|
|
* If the request conflicts with another write request in flight, the coroutine
|
|
|
|
* is queued and will be reentered when the dependency has completed.
|
2010-01-20 17:03:01 +03:00
|
|
|
*
|
|
|
|
* Return 0 on success and -errno in error cases
|
2009-05-28 18:07:05 +04:00
|
|
|
*/
|
2010-02-02 17:20:57 +03:00
|
|
|
int qcow2_alloc_cluster_offset(BlockDriverState *bs, uint64_t offset,
|
|
|
|
int n_start, int n_end, int *num, QCowL2Meta *m)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2012-03-02 17:10:54 +04:00
|
|
|
int l2_index, ret, sectors;
|
2012-03-12 20:46:51 +04:00
|
|
|
uint64_t *l2_table;
|
2012-03-02 17:10:54 +04:00
|
|
|
unsigned int nb_clusters, keep_clusters;
|
|
|
|
uint64_t cluster_offset;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-01 21:36:21 +04:00
|
|
|
trace_qcow2_alloc_clusters_offset(qemu_coroutine_self(), offset,
|
|
|
|
n_start, n_end);
|
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* Find L2 entry for the first involved cluster */
|
2012-04-24 18:10:56 +04:00
|
|
|
again:
|
2012-03-12 20:46:51 +04:00
|
|
|
ret = get_cluster_table(bs, offset, &l2_table, &l2_index);
|
2010-01-20 17:03:00 +03:00
|
|
|
if (ret < 0) {
|
2010-01-20 17:03:01 +03:00
|
|
|
return ret;
|
2010-01-20 17:03:00 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/*
|
|
|
|
* Calculate the number of clusters to look for. We stop at L2 table
|
|
|
|
* boundaries to keep things simple.
|
|
|
|
*/
|
|
|
|
nb_clusters = MIN(size_to_clusters(s, n_end << BDRV_SECTOR_BITS),
|
|
|
|
s->l2_size - l2_index);
|
2009-05-28 18:07:05 +04:00
|
|
|
|
|
|
|
cluster_offset = be64_to_cpu(l2_table[l2_index]);
|
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/*
|
|
|
|
* Check how many clusters are already allocated and don't need COW, and how
|
|
|
|
* many need a new allocation.
|
|
|
|
*/
|
2012-02-23 18:40:55 +04:00
|
|
|
if (qcow2_get_cluster_type(cluster_offset) == QCOW2_CLUSTER_NORMAL
|
|
|
|
&& (cluster_offset & QCOW_OFLAG_COPIED))
|
|
|
|
{
|
2012-03-02 17:10:54 +04:00
|
|
|
/* We keep all QCOW_OFLAG_COPIED clusters */
|
2012-03-16 18:02:38 +04:00
|
|
|
keep_clusters =
|
|
|
|
count_contiguous_clusters(nb_clusters, s->cluster_size,
|
|
|
|
&l2_table[l2_index], 0,
|
|
|
|
QCOW_OFLAG_COPIED | QCOW_OFLAG_ZERO);
|
2012-03-02 17:10:54 +04:00
|
|
|
assert(keep_clusters <= nb_clusters);
|
|
|
|
nb_clusters -= keep_clusters;
|
|
|
|
} else {
|
2012-04-26 21:41:22 +04:00
|
|
|
keep_clusters = 0;
|
|
|
|
cluster_offset = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nb_clusters > 0) {
|
2012-03-02 17:10:54 +04:00
|
|
|
/* For the moment, overwrite compressed clusters one by one */
|
2012-04-26 21:41:22 +04:00
|
|
|
uint64_t entry = be64_to_cpu(l2_table[l2_index + keep_clusters]);
|
|
|
|
if (entry & QCOW_OFLAG_COMPRESSED) {
|
2012-03-02 17:10:54 +04:00
|
|
|
nb_clusters = 1;
|
|
|
|
} else {
|
2012-04-26 21:41:22 +04:00
|
|
|
nb_clusters = count_cow_clusters(s, nb_clusters, l2_table,
|
|
|
|
l2_index + keep_clusters);
|
2012-03-02 17:10:54 +04:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
2012-02-23 18:40:55 +04:00
|
|
|
cluster_offset &= L2E_OFFSET_MASK;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-04-24 18:10:56 +04:00
|
|
|
/*
|
|
|
|
* The L2 table isn't used any more after this. As long as the cache works
|
|
|
|
* synchronously, it's important to release it before calling
|
|
|
|
* do_alloc_cluster_offset, which may yield if we need to wait for another
|
|
|
|
* request to complete. If we still had the reference, we could use up the
|
|
|
|
* whole cache with sleeping requests.
|
|
|
|
*/
|
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* If there is something left to allocate, do that now */
|
|
|
|
*m = (QCowL2Meta) {
|
|
|
|
.cluster_offset = cluster_offset,
|
|
|
|
.nb_clusters = 0,
|
|
|
|
};
|
|
|
|
qemu_co_queue_init(&m->dependent_requests);
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
if (nb_clusters > 0) {
|
|
|
|
uint64_t alloc_offset;
|
|
|
|
uint64_t alloc_cluster_offset;
|
|
|
|
uint64_t keep_bytes = keep_clusters * s->cluster_size;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* Calculate start and size of allocation */
|
|
|
|
alloc_offset = offset + keep_bytes;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
if (keep_clusters == 0) {
|
|
|
|
alloc_cluster_offset = 0;
|
2009-08-31 18:48:49 +04:00
|
|
|
} else {
|
2012-03-02 17:10:54 +04:00
|
|
|
alloc_cluster_offset = cluster_offset + keep_bytes;
|
2009-08-31 18:48:49 +04:00
|
|
|
}
|
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* Allocate, if necessary at a given offset in the image file */
|
|
|
|
ret = do_alloc_cluster_offset(bs, alloc_offset, &alloc_cluster_offset,
|
2012-04-24 18:10:03 +04:00
|
|
|
&nb_clusters);
|
2012-03-02 17:10:54 +04:00
|
|
|
if (ret == -EAGAIN) {
|
|
|
|
goto again;
|
|
|
|
} else if (ret < 0) {
|
|
|
|
goto fail;
|
|
|
|
}
|
2009-08-31 18:48:49 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* save info needed for meta data update */
|
|
|
|
if (nb_clusters > 0) {
|
2012-05-22 19:01:20 +04:00
|
|
|
/*
|
|
|
|
* requested_sectors: Number of sectors from the start of the first
|
|
|
|
* newly allocated cluster to the end of the (possibly shortened
|
|
|
|
* before) write request.
|
|
|
|
*
|
|
|
|
* avail_sectors: Number of sectors from the start of the first
|
|
|
|
* newly allocated to the end of the last newly allocated cluster.
|
2012-12-07 21:08:43 +04:00
|
|
|
*
|
|
|
|
* nb_sectors: The number of sectors from the start of the first
|
|
|
|
* newly allocated cluster to the end of the aread that the write
|
|
|
|
* request actually writes to (excluding COW at the end)
|
2012-05-22 19:01:20 +04:00
|
|
|
*/
|
2012-03-02 17:10:54 +04:00
|
|
|
int requested_sectors = n_end - keep_clusters * s->cluster_sectors;
|
2012-05-22 19:01:20 +04:00
|
|
|
int avail_sectors = nb_clusters
|
2012-03-02 17:10:54 +04:00
|
|
|
<< (s->cluster_bits - BDRV_SECTOR_BITS);
|
2012-12-07 21:08:43 +04:00
|
|
|
int alloc_n_start = keep_clusters == 0 ? n_start : 0;
|
|
|
|
int nb_sectors = MIN(requested_sectors, avail_sectors);
|
2012-03-02 17:10:54 +04:00
|
|
|
|
|
|
|
*m = (QCowL2Meta) {
|
|
|
|
.cluster_offset = keep_clusters == 0 ?
|
|
|
|
alloc_cluster_offset : cluster_offset,
|
|
|
|
.alloc_offset = alloc_cluster_offset,
|
2012-12-07 21:08:42 +04:00
|
|
|
.offset = alloc_offset & ~(s->cluster_size - 1),
|
2012-03-02 17:10:54 +04:00
|
|
|
.nb_clusters = nb_clusters,
|
2012-12-07 21:08:43 +04:00
|
|
|
.nb_available = nb_sectors,
|
|
|
|
|
|
|
|
.cow_start = {
|
|
|
|
.offset = 0,
|
|
|
|
.nb_sectors = alloc_n_start,
|
|
|
|
},
|
|
|
|
.cow_end = {
|
|
|
|
.offset = nb_sectors * BDRV_SECTOR_SIZE,
|
|
|
|
.nb_sectors = avail_sectors - nb_sectors,
|
|
|
|
},
|
2012-03-02 17:10:54 +04:00
|
|
|
};
|
|
|
|
qemu_co_queue_init(&m->dependent_requests);
|
|
|
|
QLIST_INSERT_HEAD(&s->cluster_allocs, m, next_in_flight);
|
|
|
|
}
|
2010-01-20 17:04:01 +03:00
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
/* Some cleanup work */
|
|
|
|
sectors = (keep_clusters + nb_clusters) << (s->cluster_bits - 9);
|
|
|
|
if (sectors > n_end) {
|
|
|
|
sectors = n_end;
|
|
|
|
}
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2012-03-02 17:10:54 +04:00
|
|
|
assert(sectors > n_start);
|
|
|
|
*num = sectors - n_start;
|
2009-05-28 18:07:05 +04:00
|
|
|
|
2010-01-20 17:03:01 +03:00
|
|
|
return 0;
|
2011-01-10 19:17:28 +03:00
|
|
|
|
|
|
|
fail:
|
2012-04-18 18:18:14 +04:00
|
|
|
if (m->nb_clusters > 0) {
|
2012-03-02 17:10:54 +04:00
|
|
|
QLIST_REMOVE(m, next_in_flight);
|
|
|
|
}
|
2011-01-10 19:17:28 +03:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int decompress_buffer(uint8_t *out_buf, int out_buf_size,
|
|
|
|
const uint8_t *buf, int buf_size)
|
|
|
|
{
|
|
|
|
z_stream strm1, *strm = &strm1;
|
|
|
|
int ret, out_len;
|
|
|
|
|
|
|
|
memset(strm, 0, sizeof(*strm));
|
|
|
|
|
|
|
|
strm->next_in = (uint8_t *)buf;
|
|
|
|
strm->avail_in = buf_size;
|
|
|
|
strm->next_out = out_buf;
|
|
|
|
strm->avail_out = out_buf_size;
|
|
|
|
|
|
|
|
ret = inflateInit2(strm, -12);
|
|
|
|
if (ret != Z_OK)
|
|
|
|
return -1;
|
|
|
|
ret = inflate(strm, Z_FINISH);
|
|
|
|
out_len = strm->next_out - out_buf;
|
|
|
|
if ((ret != Z_STREAM_END && ret != Z_BUF_ERROR) ||
|
|
|
|
out_len != out_buf_size) {
|
|
|
|
inflateEnd(strm);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
inflateEnd(strm);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2010-04-14 16:17:38 +04:00
|
|
|
int qcow2_decompress_cluster(BlockDriverState *bs, uint64_t cluster_offset)
|
2009-05-28 18:07:05 +04:00
|
|
|
{
|
2010-04-14 16:17:38 +04:00
|
|
|
BDRVQcowState *s = bs->opaque;
|
2009-05-28 18:07:05 +04:00
|
|
|
int ret, csize, nb_csectors, sector_offset;
|
|
|
|
uint64_t coffset;
|
|
|
|
|
|
|
|
coffset = cluster_offset & s->cluster_offset_mask;
|
|
|
|
if (s->cluster_cache_offset != coffset) {
|
|
|
|
nb_csectors = ((cluster_offset >> s->csize_shift) & s->csize_mask) + 1;
|
|
|
|
sector_offset = coffset & 511;
|
|
|
|
csize = nb_csectors * 512 - sector_offset;
|
2010-04-14 16:17:38 +04:00
|
|
|
BLKDBG_EVENT(bs->file, BLKDBG_READ_COMPRESSED);
|
|
|
|
ret = bdrv_read(bs->file, coffset >> 9, s->cluster_data, nb_csectors);
|
2009-05-28 18:07:05 +04:00
|
|
|
if (ret < 0) {
|
2011-02-09 12:26:06 +03:00
|
|
|
return ret;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
if (decompress_buffer(s->cluster_cache, s->cluster_size,
|
|
|
|
s->cluster_data + sector_offset, csize) < 0) {
|
2011-02-09 12:26:06 +03:00
|
|
|
return -EIO;
|
2009-05-28 18:07:05 +04:00
|
|
|
}
|
|
|
|
s->cluster_cache_offset = coffset;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2011-01-26 18:56:48 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This discards as many clusters of nb_clusters as possible at once (i.e.
|
|
|
|
* all clusters in the same L2 table) and returns the number of discarded
|
|
|
|
* clusters.
|
|
|
|
*/
|
|
|
|
static int discard_single_l2(BlockDriverState *bs, uint64_t offset,
|
|
|
|
unsigned int nb_clusters)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
2012-03-12 20:46:51 +04:00
|
|
|
uint64_t *l2_table;
|
2011-01-26 18:56:48 +03:00
|
|
|
int l2_index;
|
|
|
|
int ret;
|
|
|
|
int i;
|
|
|
|
|
2012-03-12 20:46:51 +04:00
|
|
|
ret = get_cluster_table(bs, offset, &l2_table, &l2_index);
|
2011-01-26 18:56:48 +03:00
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Limit nb_clusters to one L2 table */
|
|
|
|
nb_clusters = MIN(nb_clusters, s->l2_size - l2_index);
|
|
|
|
|
|
|
|
for (i = 0; i < nb_clusters; i++) {
|
|
|
|
uint64_t old_offset;
|
|
|
|
|
|
|
|
old_offset = be64_to_cpu(l2_table[l2_index + i]);
|
2012-02-23 18:40:55 +04:00
|
|
|
if ((old_offset & L2E_OFFSET_MASK) == 0) {
|
2011-01-26 18:56:48 +03:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* First remove L2 entries */
|
|
|
|
qcow2_cache_entry_mark_dirty(s->l2_table_cache, l2_table);
|
|
|
|
l2_table[l2_index + i] = cpu_to_be64(0);
|
|
|
|
|
|
|
|
/* Then decrease the refcount */
|
|
|
|
qcow2_free_any_clusters(bs, old_offset, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nb_clusters;
|
|
|
|
}
|
|
|
|
|
|
|
|
int qcow2_discard_clusters(BlockDriverState *bs, uint64_t offset,
|
|
|
|
int nb_sectors)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
uint64_t end_offset;
|
|
|
|
unsigned int nb_clusters;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
end_offset = offset + (nb_sectors << BDRV_SECTOR_BITS);
|
|
|
|
|
|
|
|
/* Round start up and end down */
|
|
|
|
offset = align_offset(offset, s->cluster_size);
|
|
|
|
end_offset &= ~(s->cluster_size - 1);
|
|
|
|
|
|
|
|
if (offset > end_offset) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
nb_clusters = size_to_clusters(s, end_offset - offset);
|
|
|
|
|
|
|
|
/* Each L2 table is handled by its own loop iteration */
|
|
|
|
while (nb_clusters > 0) {
|
|
|
|
ret = discard_single_l2(bs, offset, nb_clusters);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
nb_clusters -= ret;
|
|
|
|
offset += (ret * s->cluster_size);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2012-03-20 18:12:58 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This zeroes as many clusters of nb_clusters as possible at once (i.e.
|
|
|
|
* all clusters in the same L2 table) and returns the number of zeroed
|
|
|
|
* clusters.
|
|
|
|
*/
|
|
|
|
static int zero_single_l2(BlockDriverState *bs, uint64_t offset,
|
|
|
|
unsigned int nb_clusters)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
uint64_t *l2_table;
|
|
|
|
int l2_index;
|
|
|
|
int ret;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
ret = get_cluster_table(bs, offset, &l2_table, &l2_index);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Limit nb_clusters to one L2 table */
|
|
|
|
nb_clusters = MIN(nb_clusters, s->l2_size - l2_index);
|
|
|
|
|
|
|
|
for (i = 0; i < nb_clusters; i++) {
|
|
|
|
uint64_t old_offset;
|
|
|
|
|
|
|
|
old_offset = be64_to_cpu(l2_table[l2_index + i]);
|
|
|
|
|
|
|
|
/* Update L2 entries */
|
|
|
|
qcow2_cache_entry_mark_dirty(s->l2_table_cache, l2_table);
|
|
|
|
if (old_offset & QCOW_OFLAG_COMPRESSED) {
|
|
|
|
l2_table[l2_index + i] = cpu_to_be64(QCOW_OFLAG_ZERO);
|
|
|
|
qcow2_free_any_clusters(bs, old_offset, 1);
|
|
|
|
} else {
|
|
|
|
l2_table[l2_index + i] |= cpu_to_be64(QCOW_OFLAG_ZERO);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = qcow2_cache_put(bs, s->l2_table_cache, (void**) &l2_table);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
return nb_clusters;
|
|
|
|
}
|
|
|
|
|
|
|
|
int qcow2_zero_clusters(BlockDriverState *bs, uint64_t offset, int nb_sectors)
|
|
|
|
{
|
|
|
|
BDRVQcowState *s = bs->opaque;
|
|
|
|
unsigned int nb_clusters;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* The zero flag is only supported by version 3 and newer */
|
|
|
|
if (s->qcow_version < 3) {
|
|
|
|
return -ENOTSUP;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Each L2 table is handled by its own loop iteration */
|
|
|
|
nb_clusters = size_to_clusters(s, nb_sectors << BDRV_SECTOR_BITS);
|
|
|
|
|
|
|
|
while (nb_clusters > 0) {
|
|
|
|
ret = zero_single_l2(bs, offset, nb_clusters);
|
|
|
|
if (ret < 0) {
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
nb_clusters -= ret;
|
|
|
|
offset += (ret * s->cluster_size);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|