summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authoraliguori <aliguori@c046a42c-6fe2-441c-8c8c-71466251a162>2009-03-11 20:16:16 +0000
committeraliguori <aliguori@c046a42c-6fe2-441c-8c8c-71466251a162>2009-03-11 20:16:16 +0000
commit0f56231dcea933fffc082735e02a52f339fc8d7c (patch)
tree656a6c0d87917cd3d0073e073ba95bd8ade26927
parent523faf1b924a89b412aa9a87d7ed0b34a1259428 (diff)
downloadqemu-0f56231dcea933fffc082735e02a52f339fc8d7c.tar.gz
Revert r6404
This series is broken by design as it requires expensive IO operations at open time causing very long delays when starting a virtual machine for the first time. Signed-off-by: Anthony Liguori <aliguori@us.ibm.com> git-svn-id: svn://svn.savannah.nongnu.org/qemu/branches/stable_0_10_0@6821 c046a42c-6fe2-441c-8c8c-71466251a162
-rw-r--r--block-qcow2.c34
1 files changed, 0 insertions, 34 deletions
diff --git a/block-qcow2.c b/block-qcow2.c
index 7cfa62b89a..957e419cae 100644
--- a/block-qcow2.c
+++ b/block-qcow2.c
@@ -143,9 +143,6 @@ typedef struct BDRVQcowState {
uint32_t crypt_method_header;
AES_KEY aes_encrypt_key;
AES_KEY aes_decrypt_key;
-
- int64_t highest_alloc; /* highest cluester allocated (in clusters) */
-
uint64_t snapshots_offset;
int snapshots_size;
int nb_snapshots;
@@ -173,8 +170,6 @@ static void free_clusters(BlockDriverState *bs,
#ifdef DEBUG_ALLOC
static void check_refcounts(BlockDriverState *bs);
#endif
-static void scan_refcount(BlockDriverState *bs, int64_t *high);
-
static int qcow_probe(const uint8_t *buf, int buf_size, const char *filename)
{
@@ -275,8 +270,6 @@ static int qcow_open(BlockDriverState *bs, const char *filename, int flags)
if (refcount_init(bs) < 0)
goto fail;
- scan_refcount(bs, &s->highest_alloc);
-
/* read the backing file name */
if (header.backing_file_offset != 0) {
len = header.backing_file_size;
@@ -2163,29 +2156,6 @@ static int load_refcount_block(BlockDriverState *bs,
return 0;
}
-static void scan_refcount(BlockDriverState *bs, int64_t *high)
-{
- BDRVQcowState *s = bs->opaque;
- int64_t refcnt_index, cluster_index, cluster_end, h = 0;
-
- for (refcnt_index=0; refcnt_index < s->refcount_table_size; refcnt_index++){
- if (s->refcount_table[refcnt_index] == 0) {
- continue;
- }
- cluster_index = refcnt_index << (s->cluster_bits - REFCOUNT_SHIFT);
- cluster_end = (refcnt_index + 1) << (s->cluster_bits - REFCOUNT_SHIFT);
- for ( ; cluster_index < cluster_end; cluster_index++) {
- if (get_refcount(bs, cluster_index) == 0)
- /* do nothing -- reserved for free counting */;
- else
- h = cluster_index;
- }
- }
-
- if (high)
- *high = (h+1);
-}
-
static int get_refcount(BlockDriverState *bs, int64_t cluster_index)
{
BDRVQcowState *s = bs->opaque;
@@ -2226,10 +2196,6 @@ retry:
size,
(s->free_cluster_index - nb_clusters) << s->cluster_bits);
#endif
-
- if (s->highest_alloc < s->free_cluster_index)
- s->highest_alloc = s->free_cluster_index;
-
return (s->free_cluster_index - nb_clusters) << s->cluster_bits;
}