root / block-qcow2.c @ 43661a95
History | View | Annotate | Download (79.9 kB)
1 | 585f8587 | bellard | /*
|
---|---|---|---|
2 | 585f8587 | bellard | * Block driver for the QCOW version 2 format
|
3 | 5fafdf24 | ths | *
|
4 | 585f8587 | bellard | * Copyright (c) 2004-2006 Fabrice Bellard
|
5 | 5fafdf24 | ths | *
|
6 | 585f8587 | bellard | * Permission is hereby granted, free of charge, to any person obtaining a copy
|
7 | 585f8587 | bellard | * of this software and associated documentation files (the "Software"), to deal
|
8 | 585f8587 | bellard | * in the Software without restriction, including without limitation the rights
|
9 | 585f8587 | bellard | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
10 | 585f8587 | bellard | * copies of the Software, and to permit persons to whom the Software is
|
11 | 585f8587 | bellard | * furnished to do so, subject to the following conditions:
|
12 | 585f8587 | bellard | *
|
13 | 585f8587 | bellard | * The above copyright notice and this permission notice shall be included in
|
14 | 585f8587 | bellard | * all copies or substantial portions of the Software.
|
15 | 585f8587 | bellard | *
|
16 | 585f8587 | bellard | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
17 | 585f8587 | bellard | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
18 | 585f8587 | bellard | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
19 | 585f8587 | bellard | * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
20 | 585f8587 | bellard | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
21 | 585f8587 | bellard | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
22 | 585f8587 | bellard | * THE SOFTWARE.
|
23 | 585f8587 | bellard | */
|
24 | faf07963 | pbrook | #include "qemu-common.h" |
25 | 585f8587 | bellard | #include "block_int.h" |
26 | 585f8587 | bellard | #include <zlib.h> |
27 | 585f8587 | bellard | #include "aes.h" |
28 | 585f8587 | bellard | #include <assert.h> |
29 | 585f8587 | bellard | |
30 | 585f8587 | bellard | /*
|
31 | 585f8587 | bellard | Differences with QCOW:
|
32 | 585f8587 | bellard | |
33 | 585f8587 | bellard | - Support for multiple incremental snapshots.
|
34 | 585f8587 | bellard | - Memory management by reference counts.
|
35 | 585f8587 | bellard | - Clusters which have a reference count of one have the bit
|
36 | 585f8587 | bellard | QCOW_OFLAG_COPIED to optimize write performance.
|
37 | 5fafdf24 | ths | - Size of compressed clusters is stored in sectors to reduce bit usage
|
38 | 585f8587 | bellard | in the cluster offsets.
|
39 | 585f8587 | bellard | - Support for storing additional data (such as the VM state) in the
|
40 | 3b46e624 | ths | snapshots.
|
41 | 585f8587 | bellard | - If a backing store is used, the cluster size is not constrained
|
42 | 585f8587 | bellard | (could be backported to QCOW).
|
43 | 585f8587 | bellard | - L2 tables have always a size of one cluster.
|
44 | 585f8587 | bellard | */
|
45 | 585f8587 | bellard | |
46 | 585f8587 | bellard | //#define DEBUG_ALLOC
|
47 | 585f8587 | bellard | //#define DEBUG_ALLOC2
|
48 | 5fafdf24 | ths | |
49 | 585f8587 | bellard | #define QCOW_MAGIC (('Q' << 24) | ('F' << 16) | ('I' << 8) | 0xfb) |
50 | 585f8587 | bellard | #define QCOW_VERSION 2 |
51 | 585f8587 | bellard | |
52 | 585f8587 | bellard | #define QCOW_CRYPT_NONE 0 |
53 | 585f8587 | bellard | #define QCOW_CRYPT_AES 1 |
54 | 585f8587 | bellard | |
55 | 095a9c58 | aliguori | #define QCOW_MAX_CRYPT_CLUSTERS 32 |
56 | 095a9c58 | aliguori | |
57 | 585f8587 | bellard | /* indicate that the refcount of the referenced cluster is exactly one. */
|
58 | 585f8587 | bellard | #define QCOW_OFLAG_COPIED (1LL << 63) |
59 | 585f8587 | bellard | /* indicate that the cluster is compressed (they never have the copied flag) */
|
60 | 585f8587 | bellard | #define QCOW_OFLAG_COMPRESSED (1LL << 62) |
61 | 585f8587 | bellard | |
62 | 585f8587 | bellard | #define REFCOUNT_SHIFT 1 /* refcount size is 2 bytes */ |
63 | 585f8587 | bellard | |
64 | 585f8587 | bellard | #ifndef offsetof
|
65 | 585f8587 | bellard | #define offsetof(type, field) ((size_t) &((type *)0)->field) |
66 | 585f8587 | bellard | #endif
|
67 | 585f8587 | bellard | |
68 | 585f8587 | bellard | typedef struct QCowHeader { |
69 | 585f8587 | bellard | uint32_t magic; |
70 | 585f8587 | bellard | uint32_t version; |
71 | 585f8587 | bellard | uint64_t backing_file_offset; |
72 | 585f8587 | bellard | uint32_t backing_file_size; |
73 | 585f8587 | bellard | uint32_t cluster_bits; |
74 | 585f8587 | bellard | uint64_t size; /* in bytes */
|
75 | 585f8587 | bellard | uint32_t crypt_method; |
76 | 585f8587 | bellard | uint32_t l1_size; /* XXX: save number of clusters instead ? */
|
77 | 585f8587 | bellard | uint64_t l1_table_offset; |
78 | 585f8587 | bellard | uint64_t refcount_table_offset; |
79 | 585f8587 | bellard | uint32_t refcount_table_clusters; |
80 | 585f8587 | bellard | uint32_t nb_snapshots; |
81 | 585f8587 | bellard | uint64_t snapshots_offset; |
82 | 585f8587 | bellard | } QCowHeader; |
83 | 585f8587 | bellard | |
84 | 585f8587 | bellard | typedef struct __attribute__((packed)) QCowSnapshotHeader { |
85 | 585f8587 | bellard | /* header is 8 byte aligned */
|
86 | 585f8587 | bellard | uint64_t l1_table_offset; |
87 | 585f8587 | bellard | |
88 | 585f8587 | bellard | uint32_t l1_size; |
89 | 585f8587 | bellard | uint16_t id_str_size; |
90 | 585f8587 | bellard | uint16_t name_size; |
91 | 585f8587 | bellard | |
92 | 585f8587 | bellard | uint32_t date_sec; |
93 | 585f8587 | bellard | uint32_t date_nsec; |
94 | 585f8587 | bellard | |
95 | 585f8587 | bellard | uint64_t vm_clock_nsec; |
96 | 585f8587 | bellard | |
97 | 585f8587 | bellard | uint32_t vm_state_size; |
98 | 585f8587 | bellard | uint32_t extra_data_size; /* for extension */
|
99 | 585f8587 | bellard | /* extra data follows */
|
100 | 585f8587 | bellard | /* id_str follows */
|
101 | 585f8587 | bellard | /* name follows */
|
102 | 585f8587 | bellard | } QCowSnapshotHeader; |
103 | 585f8587 | bellard | |
104 | 585f8587 | bellard | #define L2_CACHE_SIZE 16 |
105 | 585f8587 | bellard | |
106 | 585f8587 | bellard | typedef struct QCowSnapshot { |
107 | 585f8587 | bellard | uint64_t l1_table_offset; |
108 | 585f8587 | bellard | uint32_t l1_size; |
109 | 585f8587 | bellard | char *id_str;
|
110 | 585f8587 | bellard | char *name;
|
111 | 585f8587 | bellard | uint32_t vm_state_size; |
112 | 585f8587 | bellard | uint32_t date_sec; |
113 | 585f8587 | bellard | uint32_t date_nsec; |
114 | 585f8587 | bellard | uint64_t vm_clock_nsec; |
115 | 585f8587 | bellard | } QCowSnapshot; |
116 | 585f8587 | bellard | |
117 | 585f8587 | bellard | typedef struct BDRVQcowState { |
118 | 585f8587 | bellard | BlockDriverState *hd; |
119 | 585f8587 | bellard | int cluster_bits;
|
120 | 585f8587 | bellard | int cluster_size;
|
121 | 585f8587 | bellard | int cluster_sectors;
|
122 | 585f8587 | bellard | int l2_bits;
|
123 | 585f8587 | bellard | int l2_size;
|
124 | 585f8587 | bellard | int l1_size;
|
125 | 585f8587 | bellard | int l1_vm_state_index;
|
126 | 585f8587 | bellard | int csize_shift;
|
127 | 585f8587 | bellard | int csize_mask;
|
128 | 585f8587 | bellard | uint64_t cluster_offset_mask; |
129 | 585f8587 | bellard | uint64_t l1_table_offset; |
130 | 585f8587 | bellard | uint64_t *l1_table; |
131 | 585f8587 | bellard | uint64_t *l2_cache; |
132 | 585f8587 | bellard | uint64_t l2_cache_offsets[L2_CACHE_SIZE]; |
133 | 585f8587 | bellard | uint32_t l2_cache_counts[L2_CACHE_SIZE]; |
134 | 585f8587 | bellard | uint8_t *cluster_cache; |
135 | 585f8587 | bellard | uint8_t *cluster_data; |
136 | 585f8587 | bellard | uint64_t cluster_cache_offset; |
137 | 585f8587 | bellard | |
138 | 585f8587 | bellard | uint64_t *refcount_table; |
139 | 585f8587 | bellard | uint64_t refcount_table_offset; |
140 | 585f8587 | bellard | uint32_t refcount_table_size; |
141 | 585f8587 | bellard | uint64_t refcount_block_cache_offset; |
142 | 585f8587 | bellard | uint16_t *refcount_block_cache; |
143 | 585f8587 | bellard | int64_t free_cluster_index; |
144 | 585f8587 | bellard | int64_t free_byte_offset; |
145 | 585f8587 | bellard | |
146 | 585f8587 | bellard | uint32_t crypt_method; /* current crypt method, 0 if no key yet */
|
147 | 585f8587 | bellard | uint32_t crypt_method_header; |
148 | 585f8587 | bellard | AES_KEY aes_encrypt_key; |
149 | 585f8587 | bellard | AES_KEY aes_decrypt_key; |
150 | 585f8587 | bellard | uint64_t snapshots_offset; |
151 | 585f8587 | bellard | int snapshots_size;
|
152 | 585f8587 | bellard | int nb_snapshots;
|
153 | 585f8587 | bellard | QCowSnapshot *snapshots; |
154 | 585f8587 | bellard | } BDRVQcowState; |
155 | 585f8587 | bellard | |
156 | 585f8587 | bellard | static int decompress_cluster(BDRVQcowState *s, uint64_t cluster_offset); |
157 | 5fafdf24 | ths | static int qcow_read(BlockDriverState *bs, int64_t sector_num, |
158 | 585f8587 | bellard | uint8_t *buf, int nb_sectors);
|
159 | 585f8587 | bellard | static int qcow_read_snapshots(BlockDriverState *bs); |
160 | 585f8587 | bellard | static void qcow_free_snapshots(BlockDriverState *bs); |
161 | 585f8587 | bellard | static int refcount_init(BlockDriverState *bs); |
162 | 585f8587 | bellard | static void refcount_close(BlockDriverState *bs); |
163 | 585f8587 | bellard | static int get_refcount(BlockDriverState *bs, int64_t cluster_index); |
164 | 5fafdf24 | ths | static int update_cluster_refcount(BlockDriverState *bs, |
165 | 585f8587 | bellard | int64_t cluster_index, |
166 | 585f8587 | bellard | int addend);
|
167 | 5fafdf24 | ths | static void update_refcount(BlockDriverState *bs, |
168 | 5fafdf24 | ths | int64_t offset, int64_t length, |
169 | 585f8587 | bellard | int addend);
|
170 | 585f8587 | bellard | static int64_t alloc_clusters(BlockDriverState *bs, int64_t size);
|
171 | 585f8587 | bellard | static int64_t alloc_bytes(BlockDriverState *bs, int size); |
172 | 5fafdf24 | ths | static void free_clusters(BlockDriverState *bs, |
173 | 585f8587 | bellard | int64_t offset, int64_t size); |
174 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
175 | 585f8587 | bellard | static void check_refcounts(BlockDriverState *bs); |
176 | 585f8587 | bellard | #endif
|
177 | 585f8587 | bellard | |
178 | 585f8587 | bellard | static int qcow_probe(const uint8_t *buf, int buf_size, const char *filename) |
179 | 585f8587 | bellard | { |
180 | 585f8587 | bellard | const QCowHeader *cow_header = (const void *)buf; |
181 | 3b46e624 | ths | |
182 | 585f8587 | bellard | if (buf_size >= sizeof(QCowHeader) && |
183 | 585f8587 | bellard | be32_to_cpu(cow_header->magic) == QCOW_MAGIC && |
184 | 5fafdf24 | ths | be32_to_cpu(cow_header->version) == QCOW_VERSION) |
185 | 585f8587 | bellard | return 100; |
186 | 585f8587 | bellard | else
|
187 | 585f8587 | bellard | return 0; |
188 | 585f8587 | bellard | } |
189 | 585f8587 | bellard | |
190 | 585f8587 | bellard | static int qcow_open(BlockDriverState *bs, const char *filename, int flags) |
191 | 585f8587 | bellard | { |
192 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
193 | 585f8587 | bellard | int len, i, shift, ret;
|
194 | 585f8587 | bellard | QCowHeader header; |
195 | 585f8587 | bellard | |
196 | b5eff355 | aurel32 | ret = bdrv_file_open(&s->hd, filename, flags); |
197 | 585f8587 | bellard | if (ret < 0) |
198 | 585f8587 | bellard | return ret;
|
199 | 585f8587 | bellard | if (bdrv_pread(s->hd, 0, &header, sizeof(header)) != sizeof(header)) |
200 | 585f8587 | bellard | goto fail;
|
201 | 585f8587 | bellard | be32_to_cpus(&header.magic); |
202 | 585f8587 | bellard | be32_to_cpus(&header.version); |
203 | 585f8587 | bellard | be64_to_cpus(&header.backing_file_offset); |
204 | 585f8587 | bellard | be32_to_cpus(&header.backing_file_size); |
205 | 585f8587 | bellard | be64_to_cpus(&header.size); |
206 | 585f8587 | bellard | be32_to_cpus(&header.cluster_bits); |
207 | 585f8587 | bellard | be32_to_cpus(&header.crypt_method); |
208 | 585f8587 | bellard | be64_to_cpus(&header.l1_table_offset); |
209 | 585f8587 | bellard | be32_to_cpus(&header.l1_size); |
210 | 585f8587 | bellard | be64_to_cpus(&header.refcount_table_offset); |
211 | 585f8587 | bellard | be32_to_cpus(&header.refcount_table_clusters); |
212 | 585f8587 | bellard | be64_to_cpus(&header.snapshots_offset); |
213 | 585f8587 | bellard | be32_to_cpus(&header.nb_snapshots); |
214 | 3b46e624 | ths | |
215 | 585f8587 | bellard | if (header.magic != QCOW_MAGIC || header.version != QCOW_VERSION)
|
216 | 585f8587 | bellard | goto fail;
|
217 | 5fafdf24 | ths | if (header.size <= 1 || |
218 | 5fafdf24 | ths | header.cluster_bits < 9 ||
|
219 | 585f8587 | bellard | header.cluster_bits > 16)
|
220 | 585f8587 | bellard | goto fail;
|
221 | 585f8587 | bellard | if (header.crypt_method > QCOW_CRYPT_AES)
|
222 | 585f8587 | bellard | goto fail;
|
223 | 585f8587 | bellard | s->crypt_method_header = header.crypt_method; |
224 | 585f8587 | bellard | if (s->crypt_method_header)
|
225 | 585f8587 | bellard | bs->encrypted = 1;
|
226 | 585f8587 | bellard | s->cluster_bits = header.cluster_bits; |
227 | 585f8587 | bellard | s->cluster_size = 1 << s->cluster_bits;
|
228 | 585f8587 | bellard | s->cluster_sectors = 1 << (s->cluster_bits - 9); |
229 | 585f8587 | bellard | s->l2_bits = s->cluster_bits - 3; /* L2 is always one cluster */ |
230 | 585f8587 | bellard | s->l2_size = 1 << s->l2_bits;
|
231 | 585f8587 | bellard | bs->total_sectors = header.size / 512;
|
232 | 585f8587 | bellard | s->csize_shift = (62 - (s->cluster_bits - 8)); |
233 | 585f8587 | bellard | s->csize_mask = (1 << (s->cluster_bits - 8)) - 1; |
234 | 585f8587 | bellard | s->cluster_offset_mask = (1LL << s->csize_shift) - 1; |
235 | 585f8587 | bellard | s->refcount_table_offset = header.refcount_table_offset; |
236 | 5fafdf24 | ths | s->refcount_table_size = |
237 | 585f8587 | bellard | header.refcount_table_clusters << (s->cluster_bits - 3);
|
238 | 585f8587 | bellard | |
239 | 585f8587 | bellard | s->snapshots_offset = header.snapshots_offset; |
240 | 585f8587 | bellard | s->nb_snapshots = header.nb_snapshots; |
241 | 585f8587 | bellard | |
242 | 585f8587 | bellard | /* read the level 1 table */
|
243 | 585f8587 | bellard | s->l1_size = header.l1_size; |
244 | 585f8587 | bellard | shift = s->cluster_bits + s->l2_bits; |
245 | 585f8587 | bellard | s->l1_vm_state_index = (header.size + (1LL << shift) - 1) >> shift; |
246 | 585f8587 | bellard | /* the L1 table must contain at least enough entries to put
|
247 | 585f8587 | bellard | header.size bytes */
|
248 | 585f8587 | bellard | if (s->l1_size < s->l1_vm_state_index)
|
249 | 585f8587 | bellard | goto fail;
|
250 | 585f8587 | bellard | s->l1_table_offset = header.l1_table_offset; |
251 | 585f8587 | bellard | s->l1_table = qemu_malloc(s->l1_size * sizeof(uint64_t));
|
252 | 585f8587 | bellard | if (!s->l1_table)
|
253 | 585f8587 | bellard | goto fail;
|
254 | 5fafdf24 | ths | if (bdrv_pread(s->hd, s->l1_table_offset, s->l1_table, s->l1_size * sizeof(uint64_t)) != |
255 | 585f8587 | bellard | s->l1_size * sizeof(uint64_t))
|
256 | 585f8587 | bellard | goto fail;
|
257 | 585f8587 | bellard | for(i = 0;i < s->l1_size; i++) { |
258 | 585f8587 | bellard | be64_to_cpus(&s->l1_table[i]); |
259 | 585f8587 | bellard | } |
260 | 585f8587 | bellard | /* alloc L2 cache */
|
261 | 585f8587 | bellard | s->l2_cache = qemu_malloc(s->l2_size * L2_CACHE_SIZE * sizeof(uint64_t));
|
262 | 585f8587 | bellard | if (!s->l2_cache)
|
263 | 585f8587 | bellard | goto fail;
|
264 | 585f8587 | bellard | s->cluster_cache = qemu_malloc(s->cluster_size); |
265 | 585f8587 | bellard | if (!s->cluster_cache)
|
266 | 585f8587 | bellard | goto fail;
|
267 | 585f8587 | bellard | /* one more sector for decompressed data alignment */
|
268 | 095a9c58 | aliguori | s->cluster_data = qemu_malloc(QCOW_MAX_CRYPT_CLUSTERS * s->cluster_size |
269 | 095a9c58 | aliguori | + 512);
|
270 | 585f8587 | bellard | if (!s->cluster_data)
|
271 | 585f8587 | bellard | goto fail;
|
272 | 585f8587 | bellard | s->cluster_cache_offset = -1;
|
273 | 3b46e624 | ths | |
274 | 585f8587 | bellard | if (refcount_init(bs) < 0) |
275 | 585f8587 | bellard | goto fail;
|
276 | 585f8587 | bellard | |
277 | 585f8587 | bellard | /* read the backing file name */
|
278 | 585f8587 | bellard | if (header.backing_file_offset != 0) { |
279 | 585f8587 | bellard | len = header.backing_file_size; |
280 | 585f8587 | bellard | if (len > 1023) |
281 | 585f8587 | bellard | len = 1023;
|
282 | 585f8587 | bellard | if (bdrv_pread(s->hd, header.backing_file_offset, bs->backing_file, len) != len)
|
283 | 585f8587 | bellard | goto fail;
|
284 | 585f8587 | bellard | bs->backing_file[len] = '\0';
|
285 | 585f8587 | bellard | } |
286 | 585f8587 | bellard | if (qcow_read_snapshots(bs) < 0) |
287 | 585f8587 | bellard | goto fail;
|
288 | 585f8587 | bellard | |
289 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
290 | 585f8587 | bellard | check_refcounts(bs); |
291 | 585f8587 | bellard | #endif
|
292 | 585f8587 | bellard | return 0; |
293 | 585f8587 | bellard | |
294 | 585f8587 | bellard | fail:
|
295 | 585f8587 | bellard | qcow_free_snapshots(bs); |
296 | 585f8587 | bellard | refcount_close(bs); |
297 | 585f8587 | bellard | qemu_free(s->l1_table); |
298 | 585f8587 | bellard | qemu_free(s->l2_cache); |
299 | 585f8587 | bellard | qemu_free(s->cluster_cache); |
300 | 585f8587 | bellard | qemu_free(s->cluster_data); |
301 | 585f8587 | bellard | bdrv_delete(s->hd); |
302 | 585f8587 | bellard | return -1; |
303 | 585f8587 | bellard | } |
304 | 585f8587 | bellard | |
305 | 585f8587 | bellard | static int qcow_set_key(BlockDriverState *bs, const char *key) |
306 | 585f8587 | bellard | { |
307 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
308 | 585f8587 | bellard | uint8_t keybuf[16];
|
309 | 585f8587 | bellard | int len, i;
|
310 | 3b46e624 | ths | |
311 | 585f8587 | bellard | memset(keybuf, 0, 16); |
312 | 585f8587 | bellard | len = strlen(key); |
313 | 585f8587 | bellard | if (len > 16) |
314 | 585f8587 | bellard | len = 16;
|
315 | 585f8587 | bellard | /* XXX: we could compress the chars to 7 bits to increase
|
316 | 585f8587 | bellard | entropy */
|
317 | 585f8587 | bellard | for(i = 0;i < len;i++) { |
318 | 585f8587 | bellard | keybuf[i] = key[i]; |
319 | 585f8587 | bellard | } |
320 | 585f8587 | bellard | s->crypt_method = s->crypt_method_header; |
321 | 585f8587 | bellard | |
322 | 585f8587 | bellard | if (AES_set_encrypt_key(keybuf, 128, &s->aes_encrypt_key) != 0) |
323 | 585f8587 | bellard | return -1; |
324 | 585f8587 | bellard | if (AES_set_decrypt_key(keybuf, 128, &s->aes_decrypt_key) != 0) |
325 | 585f8587 | bellard | return -1; |
326 | 585f8587 | bellard | #if 0
|
327 | 585f8587 | bellard | /* test */
|
328 | 585f8587 | bellard | {
|
329 | 585f8587 | bellard | uint8_t in[16];
|
330 | 585f8587 | bellard | uint8_t out[16];
|
331 | 585f8587 | bellard | uint8_t tmp[16];
|
332 | 585f8587 | bellard | for(i=0;i<16;i++)
|
333 | 585f8587 | bellard | in[i] = i;
|
334 | 585f8587 | bellard | AES_encrypt(in, tmp, &s->aes_encrypt_key);
|
335 | 585f8587 | bellard | AES_decrypt(tmp, out, &s->aes_decrypt_key);
|
336 | 585f8587 | bellard | for(i = 0; i < 16; i++)
|
337 | 585f8587 | bellard | printf(" %02x", tmp[i]);
|
338 | 585f8587 | bellard | printf("\n");
|
339 | 585f8587 | bellard | for(i = 0; i < 16; i++)
|
340 | 585f8587 | bellard | printf(" %02x", out[i]);
|
341 | 585f8587 | bellard | printf("\n");
|
342 | 585f8587 | bellard | }
|
343 | 585f8587 | bellard | #endif
|
344 | 585f8587 | bellard | return 0; |
345 | 585f8587 | bellard | } |
346 | 585f8587 | bellard | |
347 | 585f8587 | bellard | /* The crypt function is compatible with the linux cryptoloop
|
348 | 585f8587 | bellard | algorithm for < 4 GB images. NOTE: out_buf == in_buf is
|
349 | 585f8587 | bellard | supported */
|
350 | 585f8587 | bellard | static void encrypt_sectors(BDRVQcowState *s, int64_t sector_num, |
351 | 585f8587 | bellard | uint8_t *out_buf, const uint8_t *in_buf,
|
352 | 585f8587 | bellard | int nb_sectors, int enc, |
353 | 585f8587 | bellard | const AES_KEY *key)
|
354 | 585f8587 | bellard | { |
355 | 585f8587 | bellard | union {
|
356 | 585f8587 | bellard | uint64_t ll[2];
|
357 | 585f8587 | bellard | uint8_t b[16];
|
358 | 585f8587 | bellard | } ivec; |
359 | 585f8587 | bellard | int i;
|
360 | 585f8587 | bellard | |
361 | 585f8587 | bellard | for(i = 0; i < nb_sectors; i++) { |
362 | 585f8587 | bellard | ivec.ll[0] = cpu_to_le64(sector_num);
|
363 | 585f8587 | bellard | ivec.ll[1] = 0; |
364 | 5fafdf24 | ths | AES_cbc_encrypt(in_buf, out_buf, 512, key,
|
365 | 585f8587 | bellard | ivec.b, enc); |
366 | 585f8587 | bellard | sector_num++; |
367 | 585f8587 | bellard | in_buf += 512;
|
368 | 585f8587 | bellard | out_buf += 512;
|
369 | 585f8587 | bellard | } |
370 | 585f8587 | bellard | } |
371 | 585f8587 | bellard | |
372 | 585f8587 | bellard | static int copy_sectors(BlockDriverState *bs, uint64_t start_sect, |
373 | 585f8587 | bellard | uint64_t cluster_offset, int n_start, int n_end) |
374 | 585f8587 | bellard | { |
375 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
376 | 585f8587 | bellard | int n, ret;
|
377 | 585f8587 | bellard | |
378 | 585f8587 | bellard | n = n_end - n_start; |
379 | 585f8587 | bellard | if (n <= 0) |
380 | 585f8587 | bellard | return 0; |
381 | 585f8587 | bellard | ret = qcow_read(bs, start_sect + n_start, s->cluster_data, n); |
382 | 585f8587 | bellard | if (ret < 0) |
383 | 585f8587 | bellard | return ret;
|
384 | 585f8587 | bellard | if (s->crypt_method) {
|
385 | 5fafdf24 | ths | encrypt_sectors(s, start_sect + n_start, |
386 | 5fafdf24 | ths | s->cluster_data, |
387 | 585f8587 | bellard | s->cluster_data, n, 1,
|
388 | 585f8587 | bellard | &s->aes_encrypt_key); |
389 | 585f8587 | bellard | } |
390 | 5fafdf24 | ths | ret = bdrv_write(s->hd, (cluster_offset >> 9) + n_start,
|
391 | 585f8587 | bellard | s->cluster_data, n); |
392 | 585f8587 | bellard | if (ret < 0) |
393 | 585f8587 | bellard | return ret;
|
394 | 585f8587 | bellard | return 0; |
395 | 585f8587 | bellard | } |
396 | 585f8587 | bellard | |
397 | 585f8587 | bellard | static void l2_cache_reset(BlockDriverState *bs) |
398 | 585f8587 | bellard | { |
399 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
400 | 585f8587 | bellard | |
401 | 585f8587 | bellard | memset(s->l2_cache, 0, s->l2_size * L2_CACHE_SIZE * sizeof(uint64_t)); |
402 | 585f8587 | bellard | memset(s->l2_cache_offsets, 0, L2_CACHE_SIZE * sizeof(uint64_t)); |
403 | 585f8587 | bellard | memset(s->l2_cache_counts, 0, L2_CACHE_SIZE * sizeof(uint32_t)); |
404 | 585f8587 | bellard | } |
405 | 585f8587 | bellard | |
406 | 585f8587 | bellard | static inline int l2_cache_new_entry(BlockDriverState *bs) |
407 | 585f8587 | bellard | { |
408 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
409 | 585f8587 | bellard | uint32_t min_count; |
410 | 585f8587 | bellard | int min_index, i;
|
411 | 585f8587 | bellard | |
412 | 585f8587 | bellard | /* find a new entry in the least used one */
|
413 | 585f8587 | bellard | min_index = 0;
|
414 | 585f8587 | bellard | min_count = 0xffffffff;
|
415 | 585f8587 | bellard | for(i = 0; i < L2_CACHE_SIZE; i++) { |
416 | 585f8587 | bellard | if (s->l2_cache_counts[i] < min_count) {
|
417 | 585f8587 | bellard | min_count = s->l2_cache_counts[i]; |
418 | 585f8587 | bellard | min_index = i; |
419 | 585f8587 | bellard | } |
420 | 585f8587 | bellard | } |
421 | 585f8587 | bellard | return min_index;
|
422 | 585f8587 | bellard | } |
423 | 585f8587 | bellard | |
424 | 585f8587 | bellard | static int64_t align_offset(int64_t offset, int n) |
425 | 585f8587 | bellard | { |
426 | 585f8587 | bellard | offset = (offset + n - 1) & ~(n - 1); |
427 | 585f8587 | bellard | return offset;
|
428 | 585f8587 | bellard | } |
429 | 585f8587 | bellard | |
430 | 585f8587 | bellard | static int grow_l1_table(BlockDriverState *bs, int min_size) |
431 | 585f8587 | bellard | { |
432 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
433 | 585f8587 | bellard | int new_l1_size, new_l1_size2, ret, i;
|
434 | 585f8587 | bellard | uint64_t *new_l1_table; |
435 | 585f8587 | bellard | uint64_t new_l1_table_offset; |
436 | 585f8587 | bellard | uint64_t data64; |
437 | 585f8587 | bellard | uint32_t data32; |
438 | 585f8587 | bellard | |
439 | 585f8587 | bellard | new_l1_size = s->l1_size; |
440 | 585f8587 | bellard | if (min_size <= new_l1_size)
|
441 | 585f8587 | bellard | return 0; |
442 | 585f8587 | bellard | while (min_size > new_l1_size) {
|
443 | 585f8587 | bellard | new_l1_size = (new_l1_size * 3 + 1) / 2; |
444 | 585f8587 | bellard | } |
445 | 585f8587 | bellard | #ifdef DEBUG_ALLOC2
|
446 | 585f8587 | bellard | printf("grow l1_table from %d to %d\n", s->l1_size, new_l1_size);
|
447 | 585f8587 | bellard | #endif
|
448 | 585f8587 | bellard | |
449 | 585f8587 | bellard | new_l1_size2 = sizeof(uint64_t) * new_l1_size;
|
450 | 585f8587 | bellard | new_l1_table = qemu_mallocz(new_l1_size2); |
451 | 585f8587 | bellard | if (!new_l1_table)
|
452 | 585f8587 | bellard | return -ENOMEM;
|
453 | 585f8587 | bellard | memcpy(new_l1_table, s->l1_table, s->l1_size * sizeof(uint64_t));
|
454 | 585f8587 | bellard | |
455 | 585f8587 | bellard | /* write new table (align to cluster) */
|
456 | 585f8587 | bellard | new_l1_table_offset = alloc_clusters(bs, new_l1_size2); |
457 | 3b46e624 | ths | |
458 | 585f8587 | bellard | for(i = 0; i < s->l1_size; i++) |
459 | 585f8587 | bellard | new_l1_table[i] = cpu_to_be64(new_l1_table[i]); |
460 | 585f8587 | bellard | ret = bdrv_pwrite(s->hd, new_l1_table_offset, new_l1_table, new_l1_size2); |
461 | 585f8587 | bellard | if (ret != new_l1_size2)
|
462 | 585f8587 | bellard | goto fail;
|
463 | 585f8587 | bellard | for(i = 0; i < s->l1_size; i++) |
464 | 585f8587 | bellard | new_l1_table[i] = be64_to_cpu(new_l1_table[i]); |
465 | 3b46e624 | ths | |
466 | 585f8587 | bellard | /* set new table */
|
467 | 585f8587 | bellard | data64 = cpu_to_be64(new_l1_table_offset); |
468 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, l1_table_offset),
|
469 | 585f8587 | bellard | &data64, sizeof(data64)) != sizeof(data64)) |
470 | 585f8587 | bellard | goto fail;
|
471 | 585f8587 | bellard | data32 = cpu_to_be32(new_l1_size); |
472 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, l1_size),
|
473 | 585f8587 | bellard | &data32, sizeof(data32)) != sizeof(data32)) |
474 | 585f8587 | bellard | goto fail;
|
475 | 585f8587 | bellard | qemu_free(s->l1_table); |
476 | 585f8587 | bellard | free_clusters(bs, s->l1_table_offset, s->l1_size * sizeof(uint64_t));
|
477 | 585f8587 | bellard | s->l1_table_offset = new_l1_table_offset; |
478 | 585f8587 | bellard | s->l1_table = new_l1_table; |
479 | 585f8587 | bellard | s->l1_size = new_l1_size; |
480 | 585f8587 | bellard | return 0; |
481 | 585f8587 | bellard | fail:
|
482 | 585f8587 | bellard | qemu_free(s->l1_table); |
483 | 585f8587 | bellard | return -EIO;
|
484 | 585f8587 | bellard | } |
485 | 585f8587 | bellard | |
486 | 108534b9 | aliguori | /*
|
487 | 108534b9 | aliguori | * seek_l2_table
|
488 | 585f8587 | bellard | *
|
489 | 108534b9 | aliguori | * seek l2_offset in the l2_cache table
|
490 | 108534b9 | aliguori | * if not found, return NULL,
|
491 | 108534b9 | aliguori | * if found,
|
492 | 108534b9 | aliguori | * increments the l2 cache hit count of the entry,
|
493 | 108534b9 | aliguori | * if counter overflow, divide by two all counters
|
494 | 108534b9 | aliguori | * return the pointer to the l2 cache entry
|
495 | 585f8587 | bellard | *
|
496 | 108534b9 | aliguori | */
|
497 | 108534b9 | aliguori | |
498 | 108534b9 | aliguori | static uint64_t *seek_l2_table(BDRVQcowState *s, uint64_t l2_offset)
|
499 | 108534b9 | aliguori | { |
500 | 108534b9 | aliguori | int i, j;
|
501 | 108534b9 | aliguori | |
502 | 108534b9 | aliguori | for(i = 0; i < L2_CACHE_SIZE; i++) { |
503 | 108534b9 | aliguori | if (l2_offset == s->l2_cache_offsets[i]) {
|
504 | 108534b9 | aliguori | /* increment the hit count */
|
505 | 108534b9 | aliguori | if (++s->l2_cache_counts[i] == 0xffffffff) { |
506 | 108534b9 | aliguori | for(j = 0; j < L2_CACHE_SIZE; j++) { |
507 | 108534b9 | aliguori | s->l2_cache_counts[j] >>= 1;
|
508 | 108534b9 | aliguori | } |
509 | 108534b9 | aliguori | } |
510 | 108534b9 | aliguori | return s->l2_cache + (i << s->l2_bits);
|
511 | 108534b9 | aliguori | } |
512 | 108534b9 | aliguori | } |
513 | 108534b9 | aliguori | return NULL; |
514 | 108534b9 | aliguori | } |
515 | 108534b9 | aliguori | |
516 | 108534b9 | aliguori | /*
|
517 | 108534b9 | aliguori | * l2_load
|
518 | 108534b9 | aliguori | *
|
519 | 108534b9 | aliguori | * Loads a L2 table into memory. If the table is in the cache, the cache
|
520 | 108534b9 | aliguori | * is used; otherwise the L2 table is loaded from the image file.
|
521 | 108534b9 | aliguori | *
|
522 | 108534b9 | aliguori | * Returns a pointer to the L2 table on success, or NULL if the read from
|
523 | 108534b9 | aliguori | * the image file failed.
|
524 | 108534b9 | aliguori | */
|
525 | 108534b9 | aliguori | |
526 | 108534b9 | aliguori | static uint64_t *l2_load(BlockDriverState *bs, uint64_t l2_offset)
|
527 | 108534b9 | aliguori | { |
528 | 108534b9 | aliguori | BDRVQcowState *s = bs->opaque; |
529 | 108534b9 | aliguori | int min_index;
|
530 | 108534b9 | aliguori | uint64_t *l2_table; |
531 | 108534b9 | aliguori | |
532 | 108534b9 | aliguori | /* seek if the table for the given offset is in the cache */
|
533 | 108534b9 | aliguori | |
534 | 108534b9 | aliguori | l2_table = seek_l2_table(s, l2_offset); |
535 | 108534b9 | aliguori | if (l2_table != NULL) |
536 | 108534b9 | aliguori | return l2_table;
|
537 | 108534b9 | aliguori | |
538 | 108534b9 | aliguori | /* not found: load a new entry in the least used one */
|
539 | 108534b9 | aliguori | |
540 | 108534b9 | aliguori | min_index = l2_cache_new_entry(bs); |
541 | 108534b9 | aliguori | l2_table = s->l2_cache + (min_index << s->l2_bits); |
542 | 108534b9 | aliguori | if (bdrv_pread(s->hd, l2_offset, l2_table, s->l2_size * sizeof(uint64_t)) != |
543 | 108534b9 | aliguori | s->l2_size * sizeof(uint64_t))
|
544 | 108534b9 | aliguori | return NULL; |
545 | 108534b9 | aliguori | s->l2_cache_offsets[min_index] = l2_offset; |
546 | 108534b9 | aliguori | s->l2_cache_counts[min_index] = 1;
|
547 | 108534b9 | aliguori | |
548 | 108534b9 | aliguori | return l2_table;
|
549 | 108534b9 | aliguori | } |
550 | 108534b9 | aliguori | |
551 | 108534b9 | aliguori | /*
|
552 | 108534b9 | aliguori | * l2_allocate
|
553 | 585f8587 | bellard | *
|
554 | 108534b9 | aliguori | * Allocate a new l2 entry in the file. If l1_index points to an already
|
555 | 108534b9 | aliguori | * used entry in the L2 table (i.e. we are doing a copy on write for the L2
|
556 | 108534b9 | aliguori | * table) copy the contents of the old L2 table into the newly allocated one.
|
557 | 108534b9 | aliguori | * Otherwise the new table is initialized with zeros.
|
558 | 585f8587 | bellard | *
|
559 | 585f8587 | bellard | */
|
560 | 108534b9 | aliguori | |
561 | 108534b9 | aliguori | static uint64_t *l2_allocate(BlockDriverState *bs, int l1_index) |
562 | 108534b9 | aliguori | { |
563 | 108534b9 | aliguori | BDRVQcowState *s = bs->opaque; |
564 | 108534b9 | aliguori | int min_index;
|
565 | 108534b9 | aliguori | uint64_t old_l2_offset, tmp; |
566 | 108534b9 | aliguori | uint64_t *l2_table, l2_offset; |
567 | 108534b9 | aliguori | |
568 | 108534b9 | aliguori | old_l2_offset = s->l1_table[l1_index]; |
569 | 108534b9 | aliguori | |
570 | 108534b9 | aliguori | /* allocate a new l2 entry */
|
571 | 108534b9 | aliguori | |
572 | 108534b9 | aliguori | l2_offset = alloc_clusters(bs, s->l2_size * sizeof(uint64_t));
|
573 | 108534b9 | aliguori | |
574 | 108534b9 | aliguori | /* update the L1 entry */
|
575 | 108534b9 | aliguori | |
576 | 108534b9 | aliguori | s->l1_table[l1_index] = l2_offset | QCOW_OFLAG_COPIED; |
577 | 108534b9 | aliguori | |
578 | 108534b9 | aliguori | tmp = cpu_to_be64(l2_offset | QCOW_OFLAG_COPIED); |
579 | 108534b9 | aliguori | if (bdrv_pwrite(s->hd, s->l1_table_offset + l1_index * sizeof(tmp), |
580 | 108534b9 | aliguori | &tmp, sizeof(tmp)) != sizeof(tmp)) |
581 | 108534b9 | aliguori | return NULL; |
582 | 108534b9 | aliguori | |
583 | 108534b9 | aliguori | /* allocate a new entry in the l2 cache */
|
584 | 108534b9 | aliguori | |
585 | 108534b9 | aliguori | min_index = l2_cache_new_entry(bs); |
586 | 108534b9 | aliguori | l2_table = s->l2_cache + (min_index << s->l2_bits); |
587 | 108534b9 | aliguori | |
588 | 108534b9 | aliguori | if (old_l2_offset == 0) { |
589 | 108534b9 | aliguori | /* if there was no old l2 table, clear the new table */
|
590 | 108534b9 | aliguori | memset(l2_table, 0, s->l2_size * sizeof(uint64_t)); |
591 | 108534b9 | aliguori | } else {
|
592 | 108534b9 | aliguori | /* if there was an old l2 table, read it from the disk */
|
593 | 108534b9 | aliguori | if (bdrv_pread(s->hd, old_l2_offset,
|
594 | 108534b9 | aliguori | l2_table, s->l2_size * sizeof(uint64_t)) !=
|
595 | 108534b9 | aliguori | s->l2_size * sizeof(uint64_t))
|
596 | 108534b9 | aliguori | return NULL; |
597 | 108534b9 | aliguori | } |
598 | 108534b9 | aliguori | /* write the l2 table to the file */
|
599 | 108534b9 | aliguori | if (bdrv_pwrite(s->hd, l2_offset,
|
600 | 108534b9 | aliguori | l2_table, s->l2_size * sizeof(uint64_t)) !=
|
601 | 108534b9 | aliguori | s->l2_size * sizeof(uint64_t))
|
602 | 108534b9 | aliguori | return NULL; |
603 | 108534b9 | aliguori | |
604 | 108534b9 | aliguori | /* update the l2 cache entry */
|
605 | 108534b9 | aliguori | |
606 | 108534b9 | aliguori | s->l2_cache_offsets[min_index] = l2_offset; |
607 | 108534b9 | aliguori | s->l2_cache_counts[min_index] = 1;
|
608 | 108534b9 | aliguori | |
609 | 108534b9 | aliguori | return l2_table;
|
610 | 108534b9 | aliguori | } |
611 | 108534b9 | aliguori | |
612 | 05203524 | aliguori | /*
|
613 | 05203524 | aliguori | * get_cluster_offset
|
614 | 05203524 | aliguori | *
|
615 | 05203524 | aliguori | * For a given offset of the disk image, return cluster offset in
|
616 | 05203524 | aliguori | * qcow2 file.
|
617 | 05203524 | aliguori | *
|
618 | 095a9c58 | aliguori | * on entry, *num is the number of contiguous clusters we'd like to
|
619 | 095a9c58 | aliguori | * access following offset.
|
620 | 095a9c58 | aliguori | *
|
621 | 095a9c58 | aliguori | * on exit, *num is the number of contiguous clusters we can read.
|
622 | 095a9c58 | aliguori | *
|
623 | 05203524 | aliguori | * Return 1, if the offset is found
|
624 | 05203524 | aliguori | * Return 0, otherwise.
|
625 | 05203524 | aliguori | *
|
626 | 05203524 | aliguori | */
|
627 | 05203524 | aliguori | |
628 | 095a9c58 | aliguori | static uint64_t get_cluster_offset(BlockDriverState *bs,
|
629 | 095a9c58 | aliguori | uint64_t offset, int *num)
|
630 | 05203524 | aliguori | { |
631 | 05203524 | aliguori | BDRVQcowState *s = bs->opaque; |
632 | 05203524 | aliguori | int l1_index, l2_index;
|
633 | 095a9c58 | aliguori | uint64_t l2_offset, *l2_table, cluster_offset, next; |
634 | 095a9c58 | aliguori | int l1_bits;
|
635 | 095a9c58 | aliguori | int index_in_cluster, nb_available, nb_needed;
|
636 | 095a9c58 | aliguori | |
637 | 095a9c58 | aliguori | index_in_cluster = (offset >> 9) & (s->cluster_sectors - 1); |
638 | 095a9c58 | aliguori | nb_needed = *num + index_in_cluster; |
639 | 095a9c58 | aliguori | |
640 | 095a9c58 | aliguori | l1_bits = s->l2_bits + s->cluster_bits; |
641 | 095a9c58 | aliguori | |
642 | 095a9c58 | aliguori | /* compute how many bytes there are between the offset and
|
643 | 095a9c58 | aliguori | * and the end of the l1 entry
|
644 | 095a9c58 | aliguori | */
|
645 | 095a9c58 | aliguori | |
646 | 095a9c58 | aliguori | nb_available = (1 << l1_bits) - (offset & ((1 << l1_bits) - 1)); |
647 | 095a9c58 | aliguori | |
648 | 095a9c58 | aliguori | /* compute the number of available sectors */
|
649 | 095a9c58 | aliguori | |
650 | 095a9c58 | aliguori | nb_available = (nb_available >> 9) + index_in_cluster;
|
651 | 095a9c58 | aliguori | |
652 | 095a9c58 | aliguori | cluster_offset = 0;
|
653 | 05203524 | aliguori | |
654 | 05203524 | aliguori | /* seek the the l2 offset in the l1 table */
|
655 | 05203524 | aliguori | |
656 | 095a9c58 | aliguori | l1_index = offset >> l1_bits; |
657 | 05203524 | aliguori | if (l1_index >= s->l1_size)
|
658 | 095a9c58 | aliguori | goto out;
|
659 | 05203524 | aliguori | |
660 | 05203524 | aliguori | l2_offset = s->l1_table[l1_index]; |
661 | 05203524 | aliguori | |
662 | 05203524 | aliguori | /* seek the l2 table of the given l2 offset */
|
663 | 05203524 | aliguori | |
664 | 05203524 | aliguori | if (!l2_offset)
|
665 | 095a9c58 | aliguori | goto out;
|
666 | 05203524 | aliguori | |
667 | 05203524 | aliguori | /* load the l2 table in memory */
|
668 | 05203524 | aliguori | |
669 | 05203524 | aliguori | l2_offset &= ~QCOW_OFLAG_COPIED; |
670 | 05203524 | aliguori | l2_table = l2_load(bs, l2_offset); |
671 | 05203524 | aliguori | if (l2_table == NULL) |
672 | 768706a5 | aliguori | return 0; |
673 | 05203524 | aliguori | |
674 | 05203524 | aliguori | /* find the cluster offset for the given disk offset */
|
675 | 05203524 | aliguori | |
676 | 05203524 | aliguori | l2_index = (offset >> s->cluster_bits) & (s->l2_size - 1);
|
677 | 05203524 | aliguori | cluster_offset = be64_to_cpu(l2_table[l2_index]); |
678 | 095a9c58 | aliguori | nb_available = s->cluster_sectors; |
679 | 095a9c58 | aliguori | l2_index++; |
680 | 095a9c58 | aliguori | |
681 | 095a9c58 | aliguori | if (!cluster_offset) {
|
682 | 05203524 | aliguori | |
683 | 095a9c58 | aliguori | /* how many empty clusters ? */
|
684 | 095a9c58 | aliguori | |
685 | 095a9c58 | aliguori | while (nb_available < nb_needed && !l2_table[l2_index]) {
|
686 | 095a9c58 | aliguori | l2_index++; |
687 | 095a9c58 | aliguori | nb_available += s->cluster_sectors; |
688 | 095a9c58 | aliguori | } |
689 | 095a9c58 | aliguori | } else {
|
690 | 095a9c58 | aliguori | |
691 | 095a9c58 | aliguori | /* how many allocated clusters ? */
|
692 | 095a9c58 | aliguori | |
693 | 095a9c58 | aliguori | cluster_offset &= ~QCOW_OFLAG_COPIED; |
694 | 095a9c58 | aliguori | while (nb_available < nb_needed) {
|
695 | 095a9c58 | aliguori | next = be64_to_cpu(l2_table[l2_index]) & ~QCOW_OFLAG_COPIED; |
696 | 095a9c58 | aliguori | if (next != cluster_offset + (nb_available << 9)) |
697 | 095a9c58 | aliguori | break;
|
698 | 095a9c58 | aliguori | l2_index++; |
699 | 095a9c58 | aliguori | nb_available += s->cluster_sectors; |
700 | 095a9c58 | aliguori | } |
701 | 095a9c58 | aliguori | } |
702 | 095a9c58 | aliguori | |
703 | 095a9c58 | aliguori | out:
|
704 | 095a9c58 | aliguori | if (nb_available > nb_needed)
|
705 | 095a9c58 | aliguori | nb_available = nb_needed; |
706 | 095a9c58 | aliguori | |
707 | 095a9c58 | aliguori | *num = nb_available - index_in_cluster; |
708 | 095a9c58 | aliguori | |
709 | 095a9c58 | aliguori | return cluster_offset;
|
710 | 05203524 | aliguori | } |
711 | 05203524 | aliguori | |
712 | 05203524 | aliguori | /*
|
713 | 52d893ec | aliguori | * free_any_clusters
|
714 | 05203524 | aliguori | *
|
715 | 52d893ec | aliguori | * free clusters according to its type: compressed or not
|
716 | 05203524 | aliguori | *
|
717 | 52d893ec | aliguori | */
|
718 | 52d893ec | aliguori | |
719 | 52d893ec | aliguori | static void free_any_clusters(BlockDriverState *bs, |
720 | 095a9c58 | aliguori | uint64_t cluster_offset, int nb_clusters)
|
721 | 52d893ec | aliguori | { |
722 | 52d893ec | aliguori | BDRVQcowState *s = bs->opaque; |
723 | 52d893ec | aliguori | |
724 | 52d893ec | aliguori | /* free the cluster */
|
725 | 52d893ec | aliguori | |
726 | 52d893ec | aliguori | if (cluster_offset & QCOW_OFLAG_COMPRESSED) {
|
727 | 52d893ec | aliguori | int nb_csectors;
|
728 | 52d893ec | aliguori | nb_csectors = ((cluster_offset >> s->csize_shift) & |
729 | 52d893ec | aliguori | s->csize_mask) + 1;
|
730 | 52d893ec | aliguori | free_clusters(bs, (cluster_offset & s->cluster_offset_mask) & ~511,
|
731 | 52d893ec | aliguori | nb_csectors * 512);
|
732 | 52d893ec | aliguori | return;
|
733 | 52d893ec | aliguori | } |
734 | 52d893ec | aliguori | |
735 | 095a9c58 | aliguori | free_clusters(bs, cluster_offset, nb_clusters << s->cluster_bits); |
736 | 095a9c58 | aliguori | |
737 | 095a9c58 | aliguori | return;
|
738 | 52d893ec | aliguori | } |
739 | 52d893ec | aliguori | |
740 | 52d893ec | aliguori | /*
|
741 | 52d893ec | aliguori | * get_cluster_table
|
742 | 05203524 | aliguori | *
|
743 | 52d893ec | aliguori | * for a given disk offset, load (and allocate if needed)
|
744 | 52d893ec | aliguori | * the l2 table.
|
745 | 52d893ec | aliguori | *
|
746 | 52d893ec | aliguori | * the l2 table offset in the qcow2 file and the cluster index
|
747 | 52d893ec | aliguori | * in the l2 table are given to the caller.
|
748 | 05203524 | aliguori | *
|
749 | 05203524 | aliguori | */
|
750 | 05203524 | aliguori | |
751 | 52d893ec | aliguori | static int get_cluster_table(BlockDriverState *bs, uint64_t offset, |
752 | 52d893ec | aliguori | uint64_t **new_l2_table, |
753 | 52d893ec | aliguori | uint64_t *new_l2_offset, |
754 | 52d893ec | aliguori | int *new_l2_index)
|
755 | 585f8587 | bellard | { |
756 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
757 | 108534b9 | aliguori | int l1_index, l2_index, ret;
|
758 | 52d893ec | aliguori | uint64_t l2_offset, *l2_table; |
759 | 108534b9 | aliguori | |
760 | 108534b9 | aliguori | /* seek the the l2 offset in the l1 table */
|
761 | 3b46e624 | ths | |
762 | 585f8587 | bellard | l1_index = offset >> (s->l2_bits + s->cluster_bits); |
763 | 585f8587 | bellard | if (l1_index >= s->l1_size) {
|
764 | 108534b9 | aliguori | ret = grow_l1_table(bs, l1_index + 1);
|
765 | 108534b9 | aliguori | if (ret < 0) |
766 | 585f8587 | bellard | return 0; |
767 | 585f8587 | bellard | } |
768 | 585f8587 | bellard | l2_offset = s->l1_table[l1_index]; |
769 | 108534b9 | aliguori | |
770 | 108534b9 | aliguori | /* seek the l2 table of the given l2 offset */
|
771 | 108534b9 | aliguori | |
772 | 05203524 | aliguori | if (l2_offset & QCOW_OFLAG_COPIED) {
|
773 | 05203524 | aliguori | /* load the l2 table in memory */
|
774 | 05203524 | aliguori | l2_offset &= ~QCOW_OFLAG_COPIED; |
775 | 05203524 | aliguori | l2_table = l2_load(bs, l2_offset); |
776 | 05203524 | aliguori | if (l2_table == NULL) |
777 | 585f8587 | bellard | return 0; |
778 | 05203524 | aliguori | } else {
|
779 | 05203524 | aliguori | if (l2_offset)
|
780 | 05203524 | aliguori | free_clusters(bs, l2_offset, s->l2_size * sizeof(uint64_t));
|
781 | 108534b9 | aliguori | l2_table = l2_allocate(bs, l1_index); |
782 | 108534b9 | aliguori | if (l2_table == NULL) |
783 | 585f8587 | bellard | return 0; |
784 | 108534b9 | aliguori | l2_offset = s->l1_table[l1_index] & ~QCOW_OFLAG_COPIED; |
785 | 585f8587 | bellard | } |
786 | 108534b9 | aliguori | |
787 | 108534b9 | aliguori | /* find the cluster offset for the given disk offset */
|
788 | 108534b9 | aliguori | |
789 | 585f8587 | bellard | l2_index = (offset >> s->cluster_bits) & (s->l2_size - 1);
|
790 | 05203524 | aliguori | |
791 | 52d893ec | aliguori | *new_l2_table = l2_table; |
792 | 52d893ec | aliguori | *new_l2_offset = l2_offset; |
793 | 52d893ec | aliguori | *new_l2_index = l2_index; |
794 | 52d893ec | aliguori | |
795 | 52d893ec | aliguori | return 1; |
796 | 52d893ec | aliguori | } |
797 | 52d893ec | aliguori | |
798 | 52d893ec | aliguori | /*
|
799 | 52d893ec | aliguori | * alloc_compressed_cluster_offset
|
800 | 52d893ec | aliguori | *
|
801 | 52d893ec | aliguori | * For a given offset of the disk image, return cluster offset in
|
802 | 52d893ec | aliguori | * qcow2 file.
|
803 | 52d893ec | aliguori | *
|
804 | 52d893ec | aliguori | * If the offset is not found, allocate a new compressed cluster.
|
805 | 52d893ec | aliguori | *
|
806 | 52d893ec | aliguori | * Return the cluster offset if successful,
|
807 | 52d893ec | aliguori | * Return 0, otherwise.
|
808 | 52d893ec | aliguori | *
|
809 | 52d893ec | aliguori | */
|
810 | 52d893ec | aliguori | |
811 | 52d893ec | aliguori | static uint64_t alloc_compressed_cluster_offset(BlockDriverState *bs,
|
812 | 52d893ec | aliguori | uint64_t offset, |
813 | 52d893ec | aliguori | int compressed_size)
|
814 | 52d893ec | aliguori | { |
815 | 52d893ec | aliguori | BDRVQcowState *s = bs->opaque; |
816 | 52d893ec | aliguori | int l2_index, ret;
|
817 | 52d893ec | aliguori | uint64_t l2_offset, *l2_table, cluster_offset; |
818 | 52d893ec | aliguori | int nb_csectors;
|
819 | 52d893ec | aliguori | |
820 | 52d893ec | aliguori | ret = get_cluster_table(bs, offset, &l2_table, &l2_offset, &l2_index); |
821 | 52d893ec | aliguori | if (ret == 0) |
822 | 52d893ec | aliguori | return 0; |
823 | 52d893ec | aliguori | |
824 | 52d893ec | aliguori | cluster_offset = be64_to_cpu(l2_table[l2_index]); |
825 | 05203524 | aliguori | if (cluster_offset & QCOW_OFLAG_COPIED)
|
826 | 05203524 | aliguori | return cluster_offset & ~QCOW_OFLAG_COPIED;
|
827 | 05203524 | aliguori | |
828 | 095a9c58 | aliguori | if (cluster_offset)
|
829 | 095a9c58 | aliguori | free_any_clusters(bs, cluster_offset, 1);
|
830 | 108534b9 | aliguori | |
831 | 52d893ec | aliguori | cluster_offset = alloc_bytes(bs, compressed_size); |
832 | 52d893ec | aliguori | nb_csectors = ((cluster_offset + compressed_size - 1) >> 9) - |
833 | 52d893ec | aliguori | (cluster_offset >> 9);
|
834 | 05203524 | aliguori | |
835 | 52d893ec | aliguori | cluster_offset |= QCOW_OFLAG_COMPRESSED | |
836 | 52d893ec | aliguori | ((uint64_t)nb_csectors << s->csize_shift); |
837 | 05203524 | aliguori | |
838 | 52d893ec | aliguori | /* update L2 table */
|
839 | 05203524 | aliguori | |
840 | 52d893ec | aliguori | /* compressed clusters never have the copied flag */
|
841 | 05203524 | aliguori | |
842 | 52d893ec | aliguori | l2_table[l2_index] = cpu_to_be64(cluster_offset); |
843 | 52d893ec | aliguori | if (bdrv_pwrite(s->hd,
|
844 | 52d893ec | aliguori | l2_offset + l2_index * sizeof(uint64_t),
|
845 | 52d893ec | aliguori | l2_table + l2_index, |
846 | 52d893ec | aliguori | sizeof(uint64_t)) != sizeof(uint64_t)) |
847 | 52d893ec | aliguori | return 0; |
848 | 05203524 | aliguori | |
849 | 52d893ec | aliguori | return cluster_offset;
|
850 | 52d893ec | aliguori | } |
851 | 05203524 | aliguori | |
852 | 52d893ec | aliguori | /*
|
853 | 52d893ec | aliguori | * alloc_cluster_offset
|
854 | 52d893ec | aliguori | *
|
855 | 52d893ec | aliguori | * For a given offset of the disk image, return cluster offset in
|
856 | 52d893ec | aliguori | * qcow2 file.
|
857 | 52d893ec | aliguori | *
|
858 | 52d893ec | aliguori | * If the offset is not found, allocate a new cluster.
|
859 | 52d893ec | aliguori | *
|
860 | 52d893ec | aliguori | * Return the cluster offset if successful,
|
861 | 52d893ec | aliguori | * Return 0, otherwise.
|
862 | 52d893ec | aliguori | *
|
863 | 52d893ec | aliguori | */
|
864 | 52d893ec | aliguori | |
865 | 52d893ec | aliguori | static uint64_t alloc_cluster_offset(BlockDriverState *bs,
|
866 | 52d893ec | aliguori | uint64_t offset, |
867 | 095a9c58 | aliguori | int n_start, int n_end, |
868 | 095a9c58 | aliguori | int *num)
|
869 | 52d893ec | aliguori | { |
870 | 52d893ec | aliguori | BDRVQcowState *s = bs->opaque; |
871 | 52d893ec | aliguori | int l2_index, ret;
|
872 | 52d893ec | aliguori | uint64_t l2_offset, *l2_table, cluster_offset; |
873 | bc352085 | aliguori | int nb_available, nb_clusters, i, j;
|
874 | 095a9c58 | aliguori | uint64_t start_sect, current; |
875 | 52d893ec | aliguori | |
876 | 52d893ec | aliguori | ret = get_cluster_table(bs, offset, &l2_table, &l2_offset, &l2_index); |
877 | 52d893ec | aliguori | if (ret == 0) |
878 | 52d893ec | aliguori | return 0; |
879 | 52d893ec | aliguori | |
880 | 095a9c58 | aliguori | nb_clusters = ((n_end << 9) + s->cluster_size - 1) >> |
881 | 095a9c58 | aliguori | s->cluster_bits; |
882 | 095a9c58 | aliguori | if (nb_clusters > s->l2_size - l2_index)
|
883 | 095a9c58 | aliguori | nb_clusters = s->l2_size - l2_index; |
884 | 095a9c58 | aliguori | |
885 | 52d893ec | aliguori | cluster_offset = be64_to_cpu(l2_table[l2_index]); |
886 | 52d893ec | aliguori | |
887 | 095a9c58 | aliguori | /* We keep all QCOW_OFLAG_COPIED clusters */
|
888 | 095a9c58 | aliguori | |
889 | 095a9c58 | aliguori | if (cluster_offset & QCOW_OFLAG_COPIED) {
|
890 | 095a9c58 | aliguori | |
891 | 095a9c58 | aliguori | for (i = 1; i < nb_clusters; i++) { |
892 | 095a9c58 | aliguori | current = be64_to_cpu(l2_table[l2_index + i]); |
893 | 095a9c58 | aliguori | if (cluster_offset + (i << s->cluster_bits) != current)
|
894 | 095a9c58 | aliguori | break;
|
895 | 095a9c58 | aliguori | } |
896 | 095a9c58 | aliguori | nb_clusters = i; |
897 | 095a9c58 | aliguori | |
898 | 095a9c58 | aliguori | nb_available = nb_clusters << (s->cluster_bits - 9);
|
899 | 095a9c58 | aliguori | if (nb_available > n_end)
|
900 | 095a9c58 | aliguori | nb_available = n_end; |
901 | 095a9c58 | aliguori | |
902 | 095a9c58 | aliguori | cluster_offset &= ~QCOW_OFLAG_COPIED; |
903 | 095a9c58 | aliguori | |
904 | 095a9c58 | aliguori | goto out;
|
905 | 095a9c58 | aliguori | } |
906 | 095a9c58 | aliguori | |
907 | 095a9c58 | aliguori | /* for the moment, multiple compressed clusters are not managed */
|
908 | 095a9c58 | aliguori | |
909 | 095a9c58 | aliguori | if (cluster_offset & QCOW_OFLAG_COMPRESSED)
|
910 | 095a9c58 | aliguori | nb_clusters = 1;
|
911 | 095a9c58 | aliguori | |
912 | bc352085 | aliguori | /* how many available clusters ? */
|
913 | 095a9c58 | aliguori | |
914 | bc352085 | aliguori | i = 0;
|
915 | bc352085 | aliguori | while (i < nb_clusters) {
|
916 | 095a9c58 | aliguori | |
917 | bc352085 | aliguori | i++; |
918 | 095a9c58 | aliguori | |
919 | bc352085 | aliguori | if (!cluster_offset) {
|
920 | 095a9c58 | aliguori | |
921 | bc352085 | aliguori | /* how many free clusters ? */
|
922 | 095a9c58 | aliguori | |
923 | bc352085 | aliguori | while (i < nb_clusters) {
|
924 | bc352085 | aliguori | cluster_offset = l2_table[l2_index + i]; |
925 | bc352085 | aliguori | if (cluster_offset != 0) |
926 | bc352085 | aliguori | break;
|
927 | bc352085 | aliguori | i++; |
928 | bc352085 | aliguori | } |
929 | 095a9c58 | aliguori | |
930 | bc352085 | aliguori | if ((cluster_offset & QCOW_OFLAG_COPIED) ||
|
931 | bc352085 | aliguori | (cluster_offset & QCOW_OFLAG_COMPRESSED)) |
932 | 095a9c58 | aliguori | break;
|
933 | 095a9c58 | aliguori | |
934 | bc352085 | aliguori | } else {
|
935 | bc352085 | aliguori | |
936 | bc352085 | aliguori | /* how many contiguous clusters ? */
|
937 | bc352085 | aliguori | |
938 | bc352085 | aliguori | j = 1;
|
939 | bc352085 | aliguori | current = 0;
|
940 | bc352085 | aliguori | while (i < nb_clusters) {
|
941 | bc352085 | aliguori | current = be64_to_cpu(l2_table[l2_index + i]); |
942 | bc352085 | aliguori | if (cluster_offset + (j << s->cluster_bits) != current)
|
943 | bc352085 | aliguori | break;
|
944 | bc352085 | aliguori | |
945 | bc352085 | aliguori | i++; |
946 | bc352085 | aliguori | j++; |
947 | bc352085 | aliguori | } |
948 | bc352085 | aliguori | |
949 | bc352085 | aliguori | free_any_clusters(bs, cluster_offset, j); |
950 | bc352085 | aliguori | if (current)
|
951 | bc352085 | aliguori | break;
|
952 | bc352085 | aliguori | cluster_offset = current; |
953 | bc352085 | aliguori | } |
954 | 095a9c58 | aliguori | } |
955 | bc352085 | aliguori | nb_clusters = i; |
956 | 05203524 | aliguori | |
957 | 05203524 | aliguori | /* allocate a new cluster */
|
958 | 05203524 | aliguori | |
959 | 095a9c58 | aliguori | cluster_offset = alloc_clusters(bs, nb_clusters * s->cluster_size); |
960 | 05203524 | aliguori | |
961 | 05203524 | aliguori | /* we must initialize the cluster content which won't be
|
962 | 05203524 | aliguori | written */
|
963 | 05203524 | aliguori | |
964 | 095a9c58 | aliguori | nb_available = nb_clusters << (s->cluster_bits - 9);
|
965 | 095a9c58 | aliguori | if (nb_available > n_end)
|
966 | 095a9c58 | aliguori | nb_available = n_end; |
967 | 05203524 | aliguori | |
968 | 095a9c58 | aliguori | /* copy content of unmodified sectors */
|
969 | 095a9c58 | aliguori | |
970 | 095a9c58 | aliguori | start_sect = (offset & ~(s->cluster_size - 1)) >> 9; |
971 | 095a9c58 | aliguori | if (n_start) {
|
972 | 095a9c58 | aliguori | ret = copy_sectors(bs, start_sect, cluster_offset, 0, n_start);
|
973 | 05203524 | aliguori | if (ret < 0) |
974 | 05203524 | aliguori | return 0; |
975 | 095a9c58 | aliguori | } |
976 | 095a9c58 | aliguori | |
977 | 095a9c58 | aliguori | if (nb_available & (s->cluster_sectors - 1)) { |
978 | 095a9c58 | aliguori | uint64_t end = nb_available & ~(uint64_t)(s->cluster_sectors - 1);
|
979 | 095a9c58 | aliguori | ret = copy_sectors(bs, start_sect + end, |
980 | 095a9c58 | aliguori | cluster_offset + (end << 9),
|
981 | 095a9c58 | aliguori | nb_available - end, |
982 | 095a9c58 | aliguori | s->cluster_sectors); |
983 | 05203524 | aliguori | if (ret < 0) |
984 | 05203524 | aliguori | return 0; |
985 | 585f8587 | bellard | } |
986 | 05203524 | aliguori | |
987 | 585f8587 | bellard | /* update L2 table */
|
988 | 05203524 | aliguori | |
989 | 095a9c58 | aliguori | for (i = 0; i < nb_clusters; i++) |
990 | 095a9c58 | aliguori | l2_table[l2_index + i] = cpu_to_be64((cluster_offset + |
991 | 095a9c58 | aliguori | (i << s->cluster_bits)) | |
992 | 095a9c58 | aliguori | QCOW_OFLAG_COPIED); |
993 | 095a9c58 | aliguori | |
994 | 5fafdf24 | ths | if (bdrv_pwrite(s->hd,
|
995 | 05203524 | aliguori | l2_offset + l2_index * sizeof(uint64_t),
|
996 | 05203524 | aliguori | l2_table + l2_index, |
997 | 095a9c58 | aliguori | nb_clusters * sizeof(uint64_t)) !=
|
998 | 095a9c58 | aliguori | nb_clusters * sizeof(uint64_t))
|
999 | 585f8587 | bellard | return 0; |
1000 | 05203524 | aliguori | |
1001 | 095a9c58 | aliguori | out:
|
1002 | 095a9c58 | aliguori | *num = nb_available - n_start; |
1003 | 095a9c58 | aliguori | |
1004 | 585f8587 | bellard | return cluster_offset;
|
1005 | 585f8587 | bellard | } |
1006 | 585f8587 | bellard | |
1007 | 5fafdf24 | ths | static int qcow_is_allocated(BlockDriverState *bs, int64_t sector_num, |
1008 | 585f8587 | bellard | int nb_sectors, int *pnum) |
1009 | 585f8587 | bellard | { |
1010 | 585f8587 | bellard | uint64_t cluster_offset; |
1011 | 585f8587 | bellard | |
1012 | 095a9c58 | aliguori | *pnum = nb_sectors; |
1013 | 095a9c58 | aliguori | cluster_offset = get_cluster_offset(bs, sector_num << 9, pnum);
|
1014 | 095a9c58 | aliguori | |
1015 | 585f8587 | bellard | return (cluster_offset != 0); |
1016 | 585f8587 | bellard | } |
1017 | 585f8587 | bellard | |
1018 | 585f8587 | bellard | static int decompress_buffer(uint8_t *out_buf, int out_buf_size, |
1019 | 585f8587 | bellard | const uint8_t *buf, int buf_size) |
1020 | 585f8587 | bellard | { |
1021 | 585f8587 | bellard | z_stream strm1, *strm = &strm1; |
1022 | 585f8587 | bellard | int ret, out_len;
|
1023 | 585f8587 | bellard | |
1024 | 585f8587 | bellard | memset(strm, 0, sizeof(*strm)); |
1025 | 585f8587 | bellard | |
1026 | 585f8587 | bellard | strm->next_in = (uint8_t *)buf; |
1027 | 585f8587 | bellard | strm->avail_in = buf_size; |
1028 | 585f8587 | bellard | strm->next_out = out_buf; |
1029 | 585f8587 | bellard | strm->avail_out = out_buf_size; |
1030 | 585f8587 | bellard | |
1031 | 585f8587 | bellard | ret = inflateInit2(strm, -12);
|
1032 | 585f8587 | bellard | if (ret != Z_OK)
|
1033 | 585f8587 | bellard | return -1; |
1034 | 585f8587 | bellard | ret = inflate(strm, Z_FINISH); |
1035 | 585f8587 | bellard | out_len = strm->next_out - out_buf; |
1036 | 585f8587 | bellard | if ((ret != Z_STREAM_END && ret != Z_BUF_ERROR) ||
|
1037 | 585f8587 | bellard | out_len != out_buf_size) { |
1038 | 585f8587 | bellard | inflateEnd(strm); |
1039 | 585f8587 | bellard | return -1; |
1040 | 585f8587 | bellard | } |
1041 | 585f8587 | bellard | inflateEnd(strm); |
1042 | 585f8587 | bellard | return 0; |
1043 | 585f8587 | bellard | } |
1044 | 3b46e624 | ths | |
1045 | 585f8587 | bellard | static int decompress_cluster(BDRVQcowState *s, uint64_t cluster_offset) |
1046 | 585f8587 | bellard | { |
1047 | 585f8587 | bellard | int ret, csize, nb_csectors, sector_offset;
|
1048 | 585f8587 | bellard | uint64_t coffset; |
1049 | 585f8587 | bellard | |
1050 | 585f8587 | bellard | coffset = cluster_offset & s->cluster_offset_mask; |
1051 | 585f8587 | bellard | if (s->cluster_cache_offset != coffset) {
|
1052 | 585f8587 | bellard | nb_csectors = ((cluster_offset >> s->csize_shift) & s->csize_mask) + 1;
|
1053 | 585f8587 | bellard | sector_offset = coffset & 511;
|
1054 | 585f8587 | bellard | csize = nb_csectors * 512 - sector_offset;
|
1055 | 585f8587 | bellard | ret = bdrv_read(s->hd, coffset >> 9, s->cluster_data, nb_csectors);
|
1056 | 585f8587 | bellard | if (ret < 0) { |
1057 | 585f8587 | bellard | return -1; |
1058 | 585f8587 | bellard | } |
1059 | 585f8587 | bellard | if (decompress_buffer(s->cluster_cache, s->cluster_size,
|
1060 | 585f8587 | bellard | s->cluster_data + sector_offset, csize) < 0) {
|
1061 | 585f8587 | bellard | return -1; |
1062 | 585f8587 | bellard | } |
1063 | 585f8587 | bellard | s->cluster_cache_offset = coffset; |
1064 | 585f8587 | bellard | } |
1065 | 585f8587 | bellard | return 0; |
1066 | 585f8587 | bellard | } |
1067 | 585f8587 | bellard | |
1068 | a9465922 | bellard | /* handle reading after the end of the backing file */
|
1069 | 5fafdf24 | ths | static int backing_read1(BlockDriverState *bs, |
1070 | a9465922 | bellard | int64_t sector_num, uint8_t *buf, int nb_sectors)
|
1071 | a9465922 | bellard | { |
1072 | a9465922 | bellard | int n1;
|
1073 | a9465922 | bellard | if ((sector_num + nb_sectors) <= bs->total_sectors)
|
1074 | a9465922 | bellard | return nb_sectors;
|
1075 | a9465922 | bellard | if (sector_num >= bs->total_sectors)
|
1076 | a9465922 | bellard | n1 = 0;
|
1077 | a9465922 | bellard | else
|
1078 | a9465922 | bellard | n1 = bs->total_sectors - sector_num; |
1079 | a9465922 | bellard | memset(buf + n1 * 512, 0, 512 * (nb_sectors - n1)); |
1080 | a9465922 | bellard | return n1;
|
1081 | a9465922 | bellard | } |
1082 | a9465922 | bellard | |
1083 | 5fafdf24 | ths | static int qcow_read(BlockDriverState *bs, int64_t sector_num, |
1084 | 585f8587 | bellard | uint8_t *buf, int nb_sectors)
|
1085 | 585f8587 | bellard | { |
1086 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1087 | a9465922 | bellard | int ret, index_in_cluster, n, n1;
|
1088 | 585f8587 | bellard | uint64_t cluster_offset; |
1089 | 3b46e624 | ths | |
1090 | 585f8587 | bellard | while (nb_sectors > 0) { |
1091 | 095a9c58 | aliguori | n = nb_sectors; |
1092 | 095a9c58 | aliguori | cluster_offset = get_cluster_offset(bs, sector_num << 9, &n);
|
1093 | 585f8587 | bellard | index_in_cluster = sector_num & (s->cluster_sectors - 1);
|
1094 | 585f8587 | bellard | if (!cluster_offset) {
|
1095 | 585f8587 | bellard | if (bs->backing_hd) {
|
1096 | 585f8587 | bellard | /* read from the base image */
|
1097 | a9465922 | bellard | n1 = backing_read1(bs->backing_hd, sector_num, buf, n); |
1098 | a9465922 | bellard | if (n1 > 0) { |
1099 | a9465922 | bellard | ret = bdrv_read(bs->backing_hd, sector_num, buf, n1); |
1100 | a9465922 | bellard | if (ret < 0) |
1101 | a9465922 | bellard | return -1; |
1102 | a9465922 | bellard | } |
1103 | 585f8587 | bellard | } else {
|
1104 | 585f8587 | bellard | memset(buf, 0, 512 * n); |
1105 | 585f8587 | bellard | } |
1106 | 585f8587 | bellard | } else if (cluster_offset & QCOW_OFLAG_COMPRESSED) { |
1107 | 585f8587 | bellard | if (decompress_cluster(s, cluster_offset) < 0) |
1108 | 585f8587 | bellard | return -1; |
1109 | 585f8587 | bellard | memcpy(buf, s->cluster_cache + index_in_cluster * 512, 512 * n); |
1110 | 585f8587 | bellard | } else {
|
1111 | 585f8587 | bellard | ret = bdrv_pread(s->hd, cluster_offset + index_in_cluster * 512, buf, n * 512); |
1112 | 5fafdf24 | ths | if (ret != n * 512) |
1113 | 585f8587 | bellard | return -1; |
1114 | 585f8587 | bellard | if (s->crypt_method) {
|
1115 | 5fafdf24 | ths | encrypt_sectors(s, sector_num, buf, buf, n, 0,
|
1116 | 585f8587 | bellard | &s->aes_decrypt_key); |
1117 | 585f8587 | bellard | } |
1118 | 585f8587 | bellard | } |
1119 | 585f8587 | bellard | nb_sectors -= n; |
1120 | 585f8587 | bellard | sector_num += n; |
1121 | 585f8587 | bellard | buf += n * 512;
|
1122 | 585f8587 | bellard | } |
1123 | 585f8587 | bellard | return 0; |
1124 | 585f8587 | bellard | } |
1125 | 585f8587 | bellard | |
1126 | 5fafdf24 | ths | static int qcow_write(BlockDriverState *bs, int64_t sector_num, |
1127 | 585f8587 | bellard | const uint8_t *buf, int nb_sectors) |
1128 | 585f8587 | bellard | { |
1129 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1130 | 585f8587 | bellard | int ret, index_in_cluster, n;
|
1131 | 585f8587 | bellard | uint64_t cluster_offset; |
1132 | 095a9c58 | aliguori | int n_end;
|
1133 | 3b46e624 | ths | |
1134 | 585f8587 | bellard | while (nb_sectors > 0) { |
1135 | 585f8587 | bellard | index_in_cluster = sector_num & (s->cluster_sectors - 1);
|
1136 | 095a9c58 | aliguori | n_end = index_in_cluster + nb_sectors; |
1137 | 095a9c58 | aliguori | if (s->crypt_method &&
|
1138 | 095a9c58 | aliguori | n_end > QCOW_MAX_CRYPT_CLUSTERS * s->cluster_sectors) |
1139 | 095a9c58 | aliguori | n_end = QCOW_MAX_CRYPT_CLUSTERS * s->cluster_sectors; |
1140 | 52d893ec | aliguori | cluster_offset = alloc_cluster_offset(bs, sector_num << 9,
|
1141 | 05203524 | aliguori | index_in_cluster, |
1142 | 095a9c58 | aliguori | n_end, &n); |
1143 | 585f8587 | bellard | if (!cluster_offset)
|
1144 | 585f8587 | bellard | return -1; |
1145 | 585f8587 | bellard | if (s->crypt_method) {
|
1146 | 585f8587 | bellard | encrypt_sectors(s, sector_num, s->cluster_data, buf, n, 1,
|
1147 | 585f8587 | bellard | &s->aes_encrypt_key); |
1148 | 5fafdf24 | ths | ret = bdrv_pwrite(s->hd, cluster_offset + index_in_cluster * 512,
|
1149 | 585f8587 | bellard | s->cluster_data, n * 512);
|
1150 | 585f8587 | bellard | } else {
|
1151 | 585f8587 | bellard | ret = bdrv_pwrite(s->hd, cluster_offset + index_in_cluster * 512, buf, n * 512); |
1152 | 585f8587 | bellard | } |
1153 | 5fafdf24 | ths | if (ret != n * 512) |
1154 | 585f8587 | bellard | return -1; |
1155 | 585f8587 | bellard | nb_sectors -= n; |
1156 | 585f8587 | bellard | sector_num += n; |
1157 | 585f8587 | bellard | buf += n * 512;
|
1158 | 585f8587 | bellard | } |
1159 | 585f8587 | bellard | s->cluster_cache_offset = -1; /* disable compressed cache */ |
1160 | 585f8587 | bellard | return 0; |
1161 | 585f8587 | bellard | } |
1162 | 585f8587 | bellard | |
1163 | ce1a14dc | pbrook | typedef struct QCowAIOCB { |
1164 | ce1a14dc | pbrook | BlockDriverAIOCB common; |
1165 | 585f8587 | bellard | int64_t sector_num; |
1166 | 585f8587 | bellard | uint8_t *buf; |
1167 | 585f8587 | bellard | int nb_sectors;
|
1168 | 585f8587 | bellard | int n;
|
1169 | 585f8587 | bellard | uint64_t cluster_offset; |
1170 | 5fafdf24 | ths | uint8_t *cluster_data; |
1171 | 585f8587 | bellard | BlockDriverAIOCB *hd_aiocb; |
1172 | 585f8587 | bellard | } QCowAIOCB; |
1173 | 585f8587 | bellard | |
1174 | 585f8587 | bellard | static void qcow_aio_read_cb(void *opaque, int ret) |
1175 | 585f8587 | bellard | { |
1176 | ce1a14dc | pbrook | QCowAIOCB *acb = opaque; |
1177 | ce1a14dc | pbrook | BlockDriverState *bs = acb->common.bs; |
1178 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1179 | a9465922 | bellard | int index_in_cluster, n1;
|
1180 | 585f8587 | bellard | |
1181 | ce1a14dc | pbrook | acb->hd_aiocb = NULL;
|
1182 | 585f8587 | bellard | if (ret < 0) { |
1183 | 585f8587 | bellard | fail:
|
1184 | ce1a14dc | pbrook | acb->common.cb(acb->common.opaque, ret); |
1185 | ce1a14dc | pbrook | qemu_aio_release(acb); |
1186 | 585f8587 | bellard | return;
|
1187 | 585f8587 | bellard | } |
1188 | 585f8587 | bellard | |
1189 | 585f8587 | bellard | redo:
|
1190 | 585f8587 | bellard | /* post process the read buffer */
|
1191 | ce1a14dc | pbrook | if (!acb->cluster_offset) {
|
1192 | 585f8587 | bellard | /* nothing to do */
|
1193 | ce1a14dc | pbrook | } else if (acb->cluster_offset & QCOW_OFLAG_COMPRESSED) { |
1194 | 585f8587 | bellard | /* nothing to do */
|
1195 | 585f8587 | bellard | } else {
|
1196 | 585f8587 | bellard | if (s->crypt_method) {
|
1197 | 5fafdf24 | ths | encrypt_sectors(s, acb->sector_num, acb->buf, acb->buf, |
1198 | 5fafdf24 | ths | acb->n, 0,
|
1199 | 585f8587 | bellard | &s->aes_decrypt_key); |
1200 | 585f8587 | bellard | } |
1201 | 585f8587 | bellard | } |
1202 | 585f8587 | bellard | |
1203 | ce1a14dc | pbrook | acb->nb_sectors -= acb->n; |
1204 | ce1a14dc | pbrook | acb->sector_num += acb->n; |
1205 | ce1a14dc | pbrook | acb->buf += acb->n * 512;
|
1206 | 585f8587 | bellard | |
1207 | ce1a14dc | pbrook | if (acb->nb_sectors == 0) { |
1208 | 585f8587 | bellard | /* request completed */
|
1209 | ce1a14dc | pbrook | acb->common.cb(acb->common.opaque, 0);
|
1210 | ce1a14dc | pbrook | qemu_aio_release(acb); |
1211 | 585f8587 | bellard | return;
|
1212 | 585f8587 | bellard | } |
1213 | 3b46e624 | ths | |
1214 | 585f8587 | bellard | /* prepare next AIO request */
|
1215 | 095a9c58 | aliguori | acb->n = acb->nb_sectors; |
1216 | 095a9c58 | aliguori | acb->cluster_offset = get_cluster_offset(bs, acb->sector_num << 9, &acb->n);
|
1217 | ce1a14dc | pbrook | index_in_cluster = acb->sector_num & (s->cluster_sectors - 1);
|
1218 | ce1a14dc | pbrook | |
1219 | ce1a14dc | pbrook | if (!acb->cluster_offset) {
|
1220 | 585f8587 | bellard | if (bs->backing_hd) {
|
1221 | 585f8587 | bellard | /* read from the base image */
|
1222 | 5fafdf24 | ths | n1 = backing_read1(bs->backing_hd, acb->sector_num, |
1223 | ce1a14dc | pbrook | acb->buf, acb->n); |
1224 | a9465922 | bellard | if (n1 > 0) { |
1225 | 5fafdf24 | ths | acb->hd_aiocb = bdrv_aio_read(bs->backing_hd, acb->sector_num, |
1226 | ce1a14dc | pbrook | acb->buf, acb->n, qcow_aio_read_cb, acb); |
1227 | ce1a14dc | pbrook | if (acb->hd_aiocb == NULL) |
1228 | a9465922 | bellard | goto fail;
|
1229 | a9465922 | bellard | } else {
|
1230 | a9465922 | bellard | goto redo;
|
1231 | a9465922 | bellard | } |
1232 | 585f8587 | bellard | } else {
|
1233 | 585f8587 | bellard | /* Note: in this case, no need to wait */
|
1234 | ce1a14dc | pbrook | memset(acb->buf, 0, 512 * acb->n); |
1235 | 585f8587 | bellard | goto redo;
|
1236 | 585f8587 | bellard | } |
1237 | ce1a14dc | pbrook | } else if (acb->cluster_offset & QCOW_OFLAG_COMPRESSED) { |
1238 | 585f8587 | bellard | /* add AIO support for compressed blocks ? */
|
1239 | ce1a14dc | pbrook | if (decompress_cluster(s, acb->cluster_offset) < 0) |
1240 | 585f8587 | bellard | goto fail;
|
1241 | 5fafdf24 | ths | memcpy(acb->buf, |
1242 | ce1a14dc | pbrook | s->cluster_cache + index_in_cluster * 512, 512 * acb->n); |
1243 | 585f8587 | bellard | goto redo;
|
1244 | 585f8587 | bellard | } else {
|
1245 | ce1a14dc | pbrook | if ((acb->cluster_offset & 511) != 0) { |
1246 | 585f8587 | bellard | ret = -EIO; |
1247 | 585f8587 | bellard | goto fail;
|
1248 | 585f8587 | bellard | } |
1249 | ce1a14dc | pbrook | acb->hd_aiocb = bdrv_aio_read(s->hd, |
1250 | 5fafdf24 | ths | (acb->cluster_offset >> 9) + index_in_cluster,
|
1251 | ce1a14dc | pbrook | acb->buf, acb->n, qcow_aio_read_cb, acb); |
1252 | ce1a14dc | pbrook | if (acb->hd_aiocb == NULL) |
1253 | 585f8587 | bellard | goto fail;
|
1254 | 585f8587 | bellard | } |
1255 | 585f8587 | bellard | } |
1256 | 585f8587 | bellard | |
1257 | ce1a14dc | pbrook | static QCowAIOCB *qcow_aio_setup(BlockDriverState *bs,
|
1258 | ce1a14dc | pbrook | int64_t sector_num, uint8_t *buf, int nb_sectors,
|
1259 | ce1a14dc | pbrook | BlockDriverCompletionFunc *cb, void *opaque)
|
1260 | 585f8587 | bellard | { |
1261 | ce1a14dc | pbrook | QCowAIOCB *acb; |
1262 | ce1a14dc | pbrook | |
1263 | ce1a14dc | pbrook | acb = qemu_aio_get(bs, cb, opaque); |
1264 | ce1a14dc | pbrook | if (!acb)
|
1265 | ce1a14dc | pbrook | return NULL; |
1266 | ce1a14dc | pbrook | acb->hd_aiocb = NULL;
|
1267 | ce1a14dc | pbrook | acb->sector_num = sector_num; |
1268 | ce1a14dc | pbrook | acb->buf = buf; |
1269 | ce1a14dc | pbrook | acb->nb_sectors = nb_sectors; |
1270 | ce1a14dc | pbrook | acb->n = 0;
|
1271 | ce1a14dc | pbrook | acb->cluster_offset = 0;
|
1272 | ce1a14dc | pbrook | return acb;
|
1273 | ce1a14dc | pbrook | } |
1274 | ce1a14dc | pbrook | |
1275 | ce1a14dc | pbrook | static BlockDriverAIOCB *qcow_aio_read(BlockDriverState *bs,
|
1276 | ce1a14dc | pbrook | int64_t sector_num, uint8_t *buf, int nb_sectors,
|
1277 | ce1a14dc | pbrook | BlockDriverCompletionFunc *cb, void *opaque)
|
1278 | ce1a14dc | pbrook | { |
1279 | ce1a14dc | pbrook | QCowAIOCB *acb; |
1280 | ce1a14dc | pbrook | |
1281 | ce1a14dc | pbrook | acb = qcow_aio_setup(bs, sector_num, buf, nb_sectors, cb, opaque); |
1282 | ce1a14dc | pbrook | if (!acb)
|
1283 | ce1a14dc | pbrook | return NULL; |
1284 | 585f8587 | bellard | |
1285 | 585f8587 | bellard | qcow_aio_read_cb(acb, 0);
|
1286 | ce1a14dc | pbrook | return &acb->common;
|
1287 | 585f8587 | bellard | } |
1288 | 585f8587 | bellard | |
1289 | 585f8587 | bellard | static void qcow_aio_write_cb(void *opaque, int ret) |
1290 | 585f8587 | bellard | { |
1291 | ce1a14dc | pbrook | QCowAIOCB *acb = opaque; |
1292 | ce1a14dc | pbrook | BlockDriverState *bs = acb->common.bs; |
1293 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1294 | 585f8587 | bellard | int index_in_cluster;
|
1295 | 585f8587 | bellard | uint64_t cluster_offset; |
1296 | 585f8587 | bellard | const uint8_t *src_buf;
|
1297 | 095a9c58 | aliguori | int n_end;
|
1298 | ce1a14dc | pbrook | |
1299 | ce1a14dc | pbrook | acb->hd_aiocb = NULL;
|
1300 | ce1a14dc | pbrook | |
1301 | 585f8587 | bellard | if (ret < 0) { |
1302 | 585f8587 | bellard | fail:
|
1303 | ce1a14dc | pbrook | acb->common.cb(acb->common.opaque, ret); |
1304 | ce1a14dc | pbrook | qemu_aio_release(acb); |
1305 | 585f8587 | bellard | return;
|
1306 | 585f8587 | bellard | } |
1307 | 585f8587 | bellard | |
1308 | ce1a14dc | pbrook | acb->nb_sectors -= acb->n; |
1309 | ce1a14dc | pbrook | acb->sector_num += acb->n; |
1310 | ce1a14dc | pbrook | acb->buf += acb->n * 512;
|
1311 | 585f8587 | bellard | |
1312 | ce1a14dc | pbrook | if (acb->nb_sectors == 0) { |
1313 | 585f8587 | bellard | /* request completed */
|
1314 | ce1a14dc | pbrook | acb->common.cb(acb->common.opaque, 0);
|
1315 | ce1a14dc | pbrook | qemu_aio_release(acb); |
1316 | 585f8587 | bellard | return;
|
1317 | 585f8587 | bellard | } |
1318 | 3b46e624 | ths | |
1319 | ce1a14dc | pbrook | index_in_cluster = acb->sector_num & (s->cluster_sectors - 1);
|
1320 | 095a9c58 | aliguori | n_end = index_in_cluster + acb->nb_sectors; |
1321 | 095a9c58 | aliguori | if (s->crypt_method &&
|
1322 | 095a9c58 | aliguori | n_end > QCOW_MAX_CRYPT_CLUSTERS * s->cluster_sectors) |
1323 | 095a9c58 | aliguori | n_end = QCOW_MAX_CRYPT_CLUSTERS * s->cluster_sectors; |
1324 | 095a9c58 | aliguori | |
1325 | 52d893ec | aliguori | cluster_offset = alloc_cluster_offset(bs, acb->sector_num << 9,
|
1326 | 05203524 | aliguori | index_in_cluster, |
1327 | 095a9c58 | aliguori | n_end, &acb->n); |
1328 | 585f8587 | bellard | if (!cluster_offset || (cluster_offset & 511) != 0) { |
1329 | 585f8587 | bellard | ret = -EIO; |
1330 | 585f8587 | bellard | goto fail;
|
1331 | 585f8587 | bellard | } |
1332 | 585f8587 | bellard | if (s->crypt_method) {
|
1333 | ce1a14dc | pbrook | if (!acb->cluster_data) {
|
1334 | 095a9c58 | aliguori | acb->cluster_data = qemu_mallocz(QCOW_MAX_CRYPT_CLUSTERS * |
1335 | 095a9c58 | aliguori | s->cluster_size); |
1336 | ce1a14dc | pbrook | if (!acb->cluster_data) {
|
1337 | 585f8587 | bellard | ret = -ENOMEM; |
1338 | 585f8587 | bellard | goto fail;
|
1339 | 585f8587 | bellard | } |
1340 | 585f8587 | bellard | } |
1341 | 5fafdf24 | ths | encrypt_sectors(s, acb->sector_num, acb->cluster_data, acb->buf, |
1342 | ce1a14dc | pbrook | acb->n, 1, &s->aes_encrypt_key);
|
1343 | ce1a14dc | pbrook | src_buf = acb->cluster_data; |
1344 | 585f8587 | bellard | } else {
|
1345 | ce1a14dc | pbrook | src_buf = acb->buf; |
1346 | 585f8587 | bellard | } |
1347 | ce1a14dc | pbrook | acb->hd_aiocb = bdrv_aio_write(s->hd, |
1348 | 5fafdf24 | ths | (cluster_offset >> 9) + index_in_cluster,
|
1349 | 5fafdf24 | ths | src_buf, acb->n, |
1350 | ce1a14dc | pbrook | qcow_aio_write_cb, acb); |
1351 | ce1a14dc | pbrook | if (acb->hd_aiocb == NULL) |
1352 | 585f8587 | bellard | goto fail;
|
1353 | 585f8587 | bellard | } |
1354 | 585f8587 | bellard | |
1355 | ce1a14dc | pbrook | static BlockDriverAIOCB *qcow_aio_write(BlockDriverState *bs,
|
1356 | ce1a14dc | pbrook | int64_t sector_num, const uint8_t *buf, int nb_sectors, |
1357 | ce1a14dc | pbrook | BlockDriverCompletionFunc *cb, void *opaque)
|
1358 | 585f8587 | bellard | { |
1359 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1360 | ce1a14dc | pbrook | QCowAIOCB *acb; |
1361 | 3b46e624 | ths | |
1362 | 585f8587 | bellard | s->cluster_cache_offset = -1; /* disable compressed cache */ |
1363 | 585f8587 | bellard | |
1364 | ce1a14dc | pbrook | acb = qcow_aio_setup(bs, sector_num, (uint8_t*)buf, nb_sectors, cb, opaque); |
1365 | ce1a14dc | pbrook | if (!acb)
|
1366 | ce1a14dc | pbrook | return NULL; |
1367 | 3b46e624 | ths | |
1368 | 585f8587 | bellard | qcow_aio_write_cb(acb, 0);
|
1369 | ce1a14dc | pbrook | return &acb->common;
|
1370 | 585f8587 | bellard | } |
1371 | 585f8587 | bellard | |
1372 | ce1a14dc | pbrook | static void qcow_aio_cancel(BlockDriverAIOCB *blockacb) |
1373 | 585f8587 | bellard | { |
1374 | ce1a14dc | pbrook | QCowAIOCB *acb = (QCowAIOCB *)blockacb; |
1375 | ce1a14dc | pbrook | if (acb->hd_aiocb)
|
1376 | ce1a14dc | pbrook | bdrv_aio_cancel(acb->hd_aiocb); |
1377 | ce1a14dc | pbrook | qemu_aio_release(acb); |
1378 | 585f8587 | bellard | } |
1379 | 585f8587 | bellard | |
1380 | 585f8587 | bellard | static void qcow_close(BlockDriverState *bs) |
1381 | 585f8587 | bellard | { |
1382 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1383 | 585f8587 | bellard | qemu_free(s->l1_table); |
1384 | 585f8587 | bellard | qemu_free(s->l2_cache); |
1385 | 585f8587 | bellard | qemu_free(s->cluster_cache); |
1386 | 585f8587 | bellard | qemu_free(s->cluster_data); |
1387 | 585f8587 | bellard | refcount_close(bs); |
1388 | 585f8587 | bellard | bdrv_delete(s->hd); |
1389 | 585f8587 | bellard | } |
1390 | 585f8587 | bellard | |
1391 | 585f8587 | bellard | /* XXX: use std qcow open function ? */
|
1392 | 585f8587 | bellard | typedef struct QCowCreateState { |
1393 | 585f8587 | bellard | int cluster_size;
|
1394 | 585f8587 | bellard | int cluster_bits;
|
1395 | 585f8587 | bellard | uint16_t *refcount_block; |
1396 | 585f8587 | bellard | uint64_t *refcount_table; |
1397 | 585f8587 | bellard | int64_t l1_table_offset; |
1398 | 585f8587 | bellard | int64_t refcount_table_offset; |
1399 | 585f8587 | bellard | int64_t refcount_block_offset; |
1400 | 585f8587 | bellard | } QCowCreateState; |
1401 | 585f8587 | bellard | |
1402 | 585f8587 | bellard | static void create_refcount_update(QCowCreateState *s, |
1403 | 585f8587 | bellard | int64_t offset, int64_t size) |
1404 | 585f8587 | bellard | { |
1405 | 585f8587 | bellard | int refcount;
|
1406 | 585f8587 | bellard | int64_t start, last, cluster_offset; |
1407 | 585f8587 | bellard | uint16_t *p; |
1408 | 585f8587 | bellard | |
1409 | 585f8587 | bellard | start = offset & ~(s->cluster_size - 1);
|
1410 | 585f8587 | bellard | last = (offset + size - 1) & ~(s->cluster_size - 1); |
1411 | 5fafdf24 | ths | for(cluster_offset = start; cluster_offset <= last;
|
1412 | 585f8587 | bellard | cluster_offset += s->cluster_size) { |
1413 | 585f8587 | bellard | p = &s->refcount_block[cluster_offset >> s->cluster_bits]; |
1414 | 585f8587 | bellard | refcount = be16_to_cpu(*p); |
1415 | 585f8587 | bellard | refcount++; |
1416 | 585f8587 | bellard | *p = cpu_to_be16(refcount); |
1417 | 585f8587 | bellard | } |
1418 | 585f8587 | bellard | } |
1419 | 585f8587 | bellard | |
1420 | 585f8587 | bellard | static int qcow_create(const char *filename, int64_t total_size, |
1421 | 585f8587 | bellard | const char *backing_file, int flags) |
1422 | 585f8587 | bellard | { |
1423 | 585f8587 | bellard | int fd, header_size, backing_filename_len, l1_size, i, shift, l2_bits;
|
1424 | 585f8587 | bellard | QCowHeader header; |
1425 | 585f8587 | bellard | uint64_t tmp, offset; |
1426 | 585f8587 | bellard | QCowCreateState s1, *s = &s1; |
1427 | 3b46e624 | ths | |
1428 | 585f8587 | bellard | memset(s, 0, sizeof(*s)); |
1429 | 585f8587 | bellard | |
1430 | 585f8587 | bellard | fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY, 0644);
|
1431 | 585f8587 | bellard | if (fd < 0) |
1432 | 585f8587 | bellard | return -1; |
1433 | 585f8587 | bellard | memset(&header, 0, sizeof(header)); |
1434 | 585f8587 | bellard | header.magic = cpu_to_be32(QCOW_MAGIC); |
1435 | 585f8587 | bellard | header.version = cpu_to_be32(QCOW_VERSION); |
1436 | 585f8587 | bellard | header.size = cpu_to_be64(total_size * 512);
|
1437 | 585f8587 | bellard | header_size = sizeof(header);
|
1438 | 585f8587 | bellard | backing_filename_len = 0;
|
1439 | 585f8587 | bellard | if (backing_file) {
|
1440 | 585f8587 | bellard | header.backing_file_offset = cpu_to_be64(header_size); |
1441 | 585f8587 | bellard | backing_filename_len = strlen(backing_file); |
1442 | 585f8587 | bellard | header.backing_file_size = cpu_to_be32(backing_filename_len); |
1443 | 585f8587 | bellard | header_size += backing_filename_len; |
1444 | 585f8587 | bellard | } |
1445 | 585f8587 | bellard | s->cluster_bits = 12; /* 4 KB clusters */ |
1446 | 585f8587 | bellard | s->cluster_size = 1 << s->cluster_bits;
|
1447 | 585f8587 | bellard | header.cluster_bits = cpu_to_be32(s->cluster_bits); |
1448 | 585f8587 | bellard | header_size = (header_size + 7) & ~7; |
1449 | ec36ba14 | ths | if (flags & BLOCK_FLAG_ENCRYPT) {
|
1450 | 585f8587 | bellard | header.crypt_method = cpu_to_be32(QCOW_CRYPT_AES); |
1451 | 585f8587 | bellard | } else {
|
1452 | 585f8587 | bellard | header.crypt_method = cpu_to_be32(QCOW_CRYPT_NONE); |
1453 | 585f8587 | bellard | } |
1454 | 585f8587 | bellard | l2_bits = s->cluster_bits - 3;
|
1455 | 585f8587 | bellard | shift = s->cluster_bits + l2_bits; |
1456 | 585f8587 | bellard | l1_size = (((total_size * 512) + (1LL << shift) - 1) >> shift); |
1457 | 585f8587 | bellard | offset = align_offset(header_size, s->cluster_size); |
1458 | 585f8587 | bellard | s->l1_table_offset = offset; |
1459 | 585f8587 | bellard | header.l1_table_offset = cpu_to_be64(s->l1_table_offset); |
1460 | 585f8587 | bellard | header.l1_size = cpu_to_be32(l1_size); |
1461 | 15e6690a | bellard | offset += align_offset(l1_size * sizeof(uint64_t), s->cluster_size);
|
1462 | 585f8587 | bellard | |
1463 | 585f8587 | bellard | s->refcount_table = qemu_mallocz(s->cluster_size); |
1464 | 585f8587 | bellard | if (!s->refcount_table)
|
1465 | 585f8587 | bellard | goto fail;
|
1466 | 585f8587 | bellard | s->refcount_block = qemu_mallocz(s->cluster_size); |
1467 | 585f8587 | bellard | if (!s->refcount_block)
|
1468 | 585f8587 | bellard | goto fail;
|
1469 | 3b46e624 | ths | |
1470 | 585f8587 | bellard | s->refcount_table_offset = offset; |
1471 | 585f8587 | bellard | header.refcount_table_offset = cpu_to_be64(offset); |
1472 | 585f8587 | bellard | header.refcount_table_clusters = cpu_to_be32(1);
|
1473 | 585f8587 | bellard | offset += s->cluster_size; |
1474 | 585f8587 | bellard | |
1475 | 585f8587 | bellard | s->refcount_table[0] = cpu_to_be64(offset);
|
1476 | 585f8587 | bellard | s->refcount_block_offset = offset; |
1477 | 585f8587 | bellard | offset += s->cluster_size; |
1478 | 585f8587 | bellard | |
1479 | 585f8587 | bellard | /* update refcounts */
|
1480 | 585f8587 | bellard | create_refcount_update(s, 0, header_size);
|
1481 | 15e6690a | bellard | create_refcount_update(s, s->l1_table_offset, l1_size * sizeof(uint64_t));
|
1482 | 585f8587 | bellard | create_refcount_update(s, s->refcount_table_offset, s->cluster_size); |
1483 | 585f8587 | bellard | create_refcount_update(s, s->refcount_block_offset, s->cluster_size); |
1484 | 3b46e624 | ths | |
1485 | 585f8587 | bellard | /* write all the data */
|
1486 | 585f8587 | bellard | write(fd, &header, sizeof(header));
|
1487 | 585f8587 | bellard | if (backing_file) {
|
1488 | 585f8587 | bellard | write(fd, backing_file, backing_filename_len); |
1489 | 585f8587 | bellard | } |
1490 | 585f8587 | bellard | lseek(fd, s->l1_table_offset, SEEK_SET); |
1491 | 585f8587 | bellard | tmp = 0;
|
1492 | 585f8587 | bellard | for(i = 0;i < l1_size; i++) { |
1493 | 585f8587 | bellard | write(fd, &tmp, sizeof(tmp));
|
1494 | 585f8587 | bellard | } |
1495 | 585f8587 | bellard | lseek(fd, s->refcount_table_offset, SEEK_SET); |
1496 | 585f8587 | bellard | write(fd, s->refcount_table, s->cluster_size); |
1497 | 3b46e624 | ths | |
1498 | 585f8587 | bellard | lseek(fd, s->refcount_block_offset, SEEK_SET); |
1499 | 585f8587 | bellard | write(fd, s->refcount_block, s->cluster_size); |
1500 | 585f8587 | bellard | |
1501 | 585f8587 | bellard | qemu_free(s->refcount_table); |
1502 | 585f8587 | bellard | qemu_free(s->refcount_block); |
1503 | 585f8587 | bellard | close(fd); |
1504 | 585f8587 | bellard | return 0; |
1505 | 585f8587 | bellard | fail:
|
1506 | 585f8587 | bellard | qemu_free(s->refcount_table); |
1507 | 585f8587 | bellard | qemu_free(s->refcount_block); |
1508 | 585f8587 | bellard | close(fd); |
1509 | 585f8587 | bellard | return -ENOMEM;
|
1510 | 585f8587 | bellard | } |
1511 | 585f8587 | bellard | |
1512 | 585f8587 | bellard | static int qcow_make_empty(BlockDriverState *bs) |
1513 | 585f8587 | bellard | { |
1514 | 585f8587 | bellard | #if 0
|
1515 | 585f8587 | bellard | /* XXX: not correct */
|
1516 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque;
|
1517 | 585f8587 | bellard | uint32_t l1_length = s->l1_size * sizeof(uint64_t);
|
1518 | 585f8587 | bellard | int ret;
|
1519 | 585f8587 | bellard | |
1520 | 585f8587 | bellard | memset(s->l1_table, 0, l1_length);
|
1521 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, s->l1_table_offset, s->l1_table, l1_length) < 0)
|
1522 | 585f8587 | bellard | return -1;
|
1523 | 585f8587 | bellard | ret = bdrv_truncate(s->hd, s->l1_table_offset + l1_length);
|
1524 | 585f8587 | bellard | if (ret < 0)
|
1525 | 585f8587 | bellard | return ret;
|
1526 | 3b46e624 | ths | |
1527 | 585f8587 | bellard | l2_cache_reset(bs);
|
1528 | 585f8587 | bellard | #endif
|
1529 | 585f8587 | bellard | return 0; |
1530 | 585f8587 | bellard | } |
1531 | 585f8587 | bellard | |
1532 | 585f8587 | bellard | /* XXX: put compressed sectors first, then all the cluster aligned
|
1533 | 585f8587 | bellard | tables to avoid losing bytes in alignment */
|
1534 | 5fafdf24 | ths | static int qcow_write_compressed(BlockDriverState *bs, int64_t sector_num, |
1535 | 585f8587 | bellard | const uint8_t *buf, int nb_sectors) |
1536 | 585f8587 | bellard | { |
1537 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1538 | 585f8587 | bellard | z_stream strm; |
1539 | 585f8587 | bellard | int ret, out_len;
|
1540 | 585f8587 | bellard | uint8_t *out_buf; |
1541 | 585f8587 | bellard | uint64_t cluster_offset; |
1542 | 585f8587 | bellard | |
1543 | 585f8587 | bellard | if (nb_sectors == 0) { |
1544 | 585f8587 | bellard | /* align end of file to a sector boundary to ease reading with
|
1545 | 585f8587 | bellard | sector based I/Os */
|
1546 | 585f8587 | bellard | cluster_offset = bdrv_getlength(s->hd); |
1547 | 585f8587 | bellard | cluster_offset = (cluster_offset + 511) & ~511; |
1548 | 585f8587 | bellard | bdrv_truncate(s->hd, cluster_offset); |
1549 | 585f8587 | bellard | return 0; |
1550 | 585f8587 | bellard | } |
1551 | 585f8587 | bellard | |
1552 | 585f8587 | bellard | if (nb_sectors != s->cluster_sectors)
|
1553 | 585f8587 | bellard | return -EINVAL;
|
1554 | 585f8587 | bellard | |
1555 | 585f8587 | bellard | out_buf = qemu_malloc(s->cluster_size + (s->cluster_size / 1000) + 128); |
1556 | 585f8587 | bellard | if (!out_buf)
|
1557 | 585f8587 | bellard | return -ENOMEM;
|
1558 | 585f8587 | bellard | |
1559 | 585f8587 | bellard | /* best compression, small window, no zlib header */
|
1560 | 585f8587 | bellard | memset(&strm, 0, sizeof(strm)); |
1561 | 585f8587 | bellard | ret = deflateInit2(&strm, Z_DEFAULT_COMPRESSION, |
1562 | 5fafdf24 | ths | Z_DEFLATED, -12,
|
1563 | 585f8587 | bellard | 9, Z_DEFAULT_STRATEGY);
|
1564 | 585f8587 | bellard | if (ret != 0) { |
1565 | 585f8587 | bellard | qemu_free(out_buf); |
1566 | 585f8587 | bellard | return -1; |
1567 | 585f8587 | bellard | } |
1568 | 585f8587 | bellard | |
1569 | 585f8587 | bellard | strm.avail_in = s->cluster_size; |
1570 | 585f8587 | bellard | strm.next_in = (uint8_t *)buf; |
1571 | 585f8587 | bellard | strm.avail_out = s->cluster_size; |
1572 | 585f8587 | bellard | strm.next_out = out_buf; |
1573 | 585f8587 | bellard | |
1574 | 585f8587 | bellard | ret = deflate(&strm, Z_FINISH); |
1575 | 585f8587 | bellard | if (ret != Z_STREAM_END && ret != Z_OK) {
|
1576 | 585f8587 | bellard | qemu_free(out_buf); |
1577 | 585f8587 | bellard | deflateEnd(&strm); |
1578 | 585f8587 | bellard | return -1; |
1579 | 585f8587 | bellard | } |
1580 | 585f8587 | bellard | out_len = strm.next_out - out_buf; |
1581 | 585f8587 | bellard | |
1582 | 585f8587 | bellard | deflateEnd(&strm); |
1583 | 585f8587 | bellard | |
1584 | 585f8587 | bellard | if (ret != Z_STREAM_END || out_len >= s->cluster_size) {
|
1585 | 585f8587 | bellard | /* could not compress: write normal cluster */
|
1586 | 585f8587 | bellard | qcow_write(bs, sector_num, buf, s->cluster_sectors); |
1587 | 585f8587 | bellard | } else {
|
1588 | 52d893ec | aliguori | cluster_offset = alloc_compressed_cluster_offset(bs, sector_num << 9,
|
1589 | 52d893ec | aliguori | out_len); |
1590 | 52d893ec | aliguori | if (!cluster_offset)
|
1591 | 52d893ec | aliguori | return -1; |
1592 | 585f8587 | bellard | cluster_offset &= s->cluster_offset_mask; |
1593 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, cluster_offset, out_buf, out_len) != out_len) {
|
1594 | 585f8587 | bellard | qemu_free(out_buf); |
1595 | 585f8587 | bellard | return -1; |
1596 | 585f8587 | bellard | } |
1597 | 585f8587 | bellard | } |
1598 | 3b46e624 | ths | |
1599 | 585f8587 | bellard | qemu_free(out_buf); |
1600 | 585f8587 | bellard | return 0; |
1601 | 585f8587 | bellard | } |
1602 | 585f8587 | bellard | |
1603 | 585f8587 | bellard | static void qcow_flush(BlockDriverState *bs) |
1604 | 585f8587 | bellard | { |
1605 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1606 | 585f8587 | bellard | bdrv_flush(s->hd); |
1607 | 585f8587 | bellard | } |
1608 | 585f8587 | bellard | |
1609 | 585f8587 | bellard | static int qcow_get_info(BlockDriverState *bs, BlockDriverInfo *bdi) |
1610 | 585f8587 | bellard | { |
1611 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1612 | 585f8587 | bellard | bdi->cluster_size = s->cluster_size; |
1613 | 5fafdf24 | ths | bdi->vm_state_offset = (int64_t)s->l1_vm_state_index << |
1614 | 585f8587 | bellard | (s->cluster_bits + s->l2_bits); |
1615 | 585f8587 | bellard | return 0; |
1616 | 585f8587 | bellard | } |
1617 | 585f8587 | bellard | |
1618 | 585f8587 | bellard | /*********************************************************/
|
1619 | 585f8587 | bellard | /* snapshot support */
|
1620 | 585f8587 | bellard | |
1621 | 585f8587 | bellard | /* update the refcounts of snapshots and the copied flag */
|
1622 | 5fafdf24 | ths | static int update_snapshot_refcount(BlockDriverState *bs, |
1623 | 585f8587 | bellard | int64_t l1_table_offset, |
1624 | 585f8587 | bellard | int l1_size,
|
1625 | 585f8587 | bellard | int addend)
|
1626 | 585f8587 | bellard | { |
1627 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1628 | 585f8587 | bellard | uint64_t *l1_table, *l2_table, l2_offset, offset, l1_size2, l1_allocated; |
1629 | 585f8587 | bellard | int64_t old_offset, old_l2_offset; |
1630 | 585f8587 | bellard | int l2_size, i, j, l1_modified, l2_modified, nb_csectors, refcount;
|
1631 | 3b46e624 | ths | |
1632 | 585f8587 | bellard | l2_cache_reset(bs); |
1633 | 585f8587 | bellard | |
1634 | 585f8587 | bellard | l2_table = NULL;
|
1635 | 585f8587 | bellard | l1_table = NULL;
|
1636 | 585f8587 | bellard | l1_size2 = l1_size * sizeof(uint64_t);
|
1637 | 585f8587 | bellard | l1_allocated = 0;
|
1638 | 585f8587 | bellard | if (l1_table_offset != s->l1_table_offset) {
|
1639 | 585f8587 | bellard | l1_table = qemu_malloc(l1_size2); |
1640 | 585f8587 | bellard | if (!l1_table)
|
1641 | 585f8587 | bellard | goto fail;
|
1642 | 585f8587 | bellard | l1_allocated = 1;
|
1643 | 5fafdf24 | ths | if (bdrv_pread(s->hd, l1_table_offset,
|
1644 | 585f8587 | bellard | l1_table, l1_size2) != l1_size2) |
1645 | 585f8587 | bellard | goto fail;
|
1646 | 585f8587 | bellard | for(i = 0;i < l1_size; i++) |
1647 | 585f8587 | bellard | be64_to_cpus(&l1_table[i]); |
1648 | 585f8587 | bellard | } else {
|
1649 | 585f8587 | bellard | assert(l1_size == s->l1_size); |
1650 | 585f8587 | bellard | l1_table = s->l1_table; |
1651 | 585f8587 | bellard | l1_allocated = 0;
|
1652 | 585f8587 | bellard | } |
1653 | 3b46e624 | ths | |
1654 | 585f8587 | bellard | l2_size = s->l2_size * sizeof(uint64_t);
|
1655 | 585f8587 | bellard | l2_table = qemu_malloc(l2_size); |
1656 | 585f8587 | bellard | if (!l2_table)
|
1657 | 585f8587 | bellard | goto fail;
|
1658 | 585f8587 | bellard | l1_modified = 0;
|
1659 | 585f8587 | bellard | for(i = 0; i < l1_size; i++) { |
1660 | 585f8587 | bellard | l2_offset = l1_table[i]; |
1661 | 585f8587 | bellard | if (l2_offset) {
|
1662 | 585f8587 | bellard | old_l2_offset = l2_offset; |
1663 | 585f8587 | bellard | l2_offset &= ~QCOW_OFLAG_COPIED; |
1664 | 585f8587 | bellard | l2_modified = 0;
|
1665 | 585f8587 | bellard | if (bdrv_pread(s->hd, l2_offset, l2_table, l2_size) != l2_size)
|
1666 | 585f8587 | bellard | goto fail;
|
1667 | 585f8587 | bellard | for(j = 0; j < s->l2_size; j++) { |
1668 | 585f8587 | bellard | offset = be64_to_cpu(l2_table[j]); |
1669 | 585f8587 | bellard | if (offset != 0) { |
1670 | 585f8587 | bellard | old_offset = offset; |
1671 | 585f8587 | bellard | offset &= ~QCOW_OFLAG_COPIED; |
1672 | 585f8587 | bellard | if (offset & QCOW_OFLAG_COMPRESSED) {
|
1673 | 5fafdf24 | ths | nb_csectors = ((offset >> s->csize_shift) & |
1674 | 585f8587 | bellard | s->csize_mask) + 1;
|
1675 | 585f8587 | bellard | if (addend != 0) |
1676 | 585f8587 | bellard | update_refcount(bs, (offset & s->cluster_offset_mask) & ~511,
|
1677 | 585f8587 | bellard | nb_csectors * 512, addend);
|
1678 | 585f8587 | bellard | /* compressed clusters are never modified */
|
1679 | 5fafdf24 | ths | refcount = 2;
|
1680 | 585f8587 | bellard | } else {
|
1681 | 585f8587 | bellard | if (addend != 0) { |
1682 | 585f8587 | bellard | refcount = update_cluster_refcount(bs, offset >> s->cluster_bits, addend); |
1683 | 585f8587 | bellard | } else {
|
1684 | 585f8587 | bellard | refcount = get_refcount(bs, offset >> s->cluster_bits); |
1685 | 585f8587 | bellard | } |
1686 | 585f8587 | bellard | } |
1687 | 585f8587 | bellard | |
1688 | 585f8587 | bellard | if (refcount == 1) { |
1689 | 585f8587 | bellard | offset |= QCOW_OFLAG_COPIED; |
1690 | 585f8587 | bellard | } |
1691 | 585f8587 | bellard | if (offset != old_offset) {
|
1692 | 585f8587 | bellard | l2_table[j] = cpu_to_be64(offset); |
1693 | 585f8587 | bellard | l2_modified = 1;
|
1694 | 585f8587 | bellard | } |
1695 | 585f8587 | bellard | } |
1696 | 585f8587 | bellard | } |
1697 | 585f8587 | bellard | if (l2_modified) {
|
1698 | 5fafdf24 | ths | if (bdrv_pwrite(s->hd,
|
1699 | 585f8587 | bellard | l2_offset, l2_table, l2_size) != l2_size) |
1700 | 585f8587 | bellard | goto fail;
|
1701 | 585f8587 | bellard | } |
1702 | 585f8587 | bellard | |
1703 | 585f8587 | bellard | if (addend != 0) { |
1704 | 585f8587 | bellard | refcount = update_cluster_refcount(bs, l2_offset >> s->cluster_bits, addend); |
1705 | 585f8587 | bellard | } else {
|
1706 | 585f8587 | bellard | refcount = get_refcount(bs, l2_offset >> s->cluster_bits); |
1707 | 585f8587 | bellard | } |
1708 | 585f8587 | bellard | if (refcount == 1) { |
1709 | 585f8587 | bellard | l2_offset |= QCOW_OFLAG_COPIED; |
1710 | 585f8587 | bellard | } |
1711 | 585f8587 | bellard | if (l2_offset != old_l2_offset) {
|
1712 | 585f8587 | bellard | l1_table[i] = l2_offset; |
1713 | 585f8587 | bellard | l1_modified = 1;
|
1714 | 585f8587 | bellard | } |
1715 | 585f8587 | bellard | } |
1716 | 585f8587 | bellard | } |
1717 | 585f8587 | bellard | if (l1_modified) {
|
1718 | 585f8587 | bellard | for(i = 0; i < l1_size; i++) |
1719 | 585f8587 | bellard | cpu_to_be64s(&l1_table[i]); |
1720 | 5fafdf24 | ths | if (bdrv_pwrite(s->hd, l1_table_offset, l1_table,
|
1721 | 585f8587 | bellard | l1_size2) != l1_size2) |
1722 | 585f8587 | bellard | goto fail;
|
1723 | 585f8587 | bellard | for(i = 0; i < l1_size; i++) |
1724 | 585f8587 | bellard | be64_to_cpus(&l1_table[i]); |
1725 | 585f8587 | bellard | } |
1726 | 585f8587 | bellard | if (l1_allocated)
|
1727 | 585f8587 | bellard | qemu_free(l1_table); |
1728 | 585f8587 | bellard | qemu_free(l2_table); |
1729 | 585f8587 | bellard | return 0; |
1730 | 585f8587 | bellard | fail:
|
1731 | 585f8587 | bellard | if (l1_allocated)
|
1732 | 585f8587 | bellard | qemu_free(l1_table); |
1733 | 585f8587 | bellard | qemu_free(l2_table); |
1734 | 585f8587 | bellard | return -EIO;
|
1735 | 585f8587 | bellard | } |
1736 | 585f8587 | bellard | |
1737 | 585f8587 | bellard | static void qcow_free_snapshots(BlockDriverState *bs) |
1738 | 585f8587 | bellard | { |
1739 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1740 | 585f8587 | bellard | int i;
|
1741 | 585f8587 | bellard | |
1742 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1743 | 585f8587 | bellard | qemu_free(s->snapshots[i].name); |
1744 | 585f8587 | bellard | qemu_free(s->snapshots[i].id_str); |
1745 | 585f8587 | bellard | } |
1746 | 585f8587 | bellard | qemu_free(s->snapshots); |
1747 | 585f8587 | bellard | s->snapshots = NULL;
|
1748 | 585f8587 | bellard | s->nb_snapshots = 0;
|
1749 | 585f8587 | bellard | } |
1750 | 585f8587 | bellard | |
1751 | 585f8587 | bellard | static int qcow_read_snapshots(BlockDriverState *bs) |
1752 | 585f8587 | bellard | { |
1753 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1754 | 585f8587 | bellard | QCowSnapshotHeader h; |
1755 | 585f8587 | bellard | QCowSnapshot *sn; |
1756 | 585f8587 | bellard | int i, id_str_size, name_size;
|
1757 | 585f8587 | bellard | int64_t offset; |
1758 | 585f8587 | bellard | uint32_t extra_data_size; |
1759 | 585f8587 | bellard | |
1760 | 585f8587 | bellard | offset = s->snapshots_offset; |
1761 | 585f8587 | bellard | s->snapshots = qemu_mallocz(s->nb_snapshots * sizeof(QCowSnapshot));
|
1762 | 585f8587 | bellard | if (!s->snapshots)
|
1763 | 585f8587 | bellard | goto fail;
|
1764 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1765 | 585f8587 | bellard | offset = align_offset(offset, 8);
|
1766 | 585f8587 | bellard | if (bdrv_pread(s->hd, offset, &h, sizeof(h)) != sizeof(h)) |
1767 | 585f8587 | bellard | goto fail;
|
1768 | 585f8587 | bellard | offset += sizeof(h);
|
1769 | 585f8587 | bellard | sn = s->snapshots + i; |
1770 | 585f8587 | bellard | sn->l1_table_offset = be64_to_cpu(h.l1_table_offset); |
1771 | 585f8587 | bellard | sn->l1_size = be32_to_cpu(h.l1_size); |
1772 | 585f8587 | bellard | sn->vm_state_size = be32_to_cpu(h.vm_state_size); |
1773 | 585f8587 | bellard | sn->date_sec = be32_to_cpu(h.date_sec); |
1774 | 585f8587 | bellard | sn->date_nsec = be32_to_cpu(h.date_nsec); |
1775 | 585f8587 | bellard | sn->vm_clock_nsec = be64_to_cpu(h.vm_clock_nsec); |
1776 | 585f8587 | bellard | extra_data_size = be32_to_cpu(h.extra_data_size); |
1777 | 585f8587 | bellard | |
1778 | 585f8587 | bellard | id_str_size = be16_to_cpu(h.id_str_size); |
1779 | 585f8587 | bellard | name_size = be16_to_cpu(h.name_size); |
1780 | 585f8587 | bellard | |
1781 | 585f8587 | bellard | offset += extra_data_size; |
1782 | 585f8587 | bellard | |
1783 | 585f8587 | bellard | sn->id_str = qemu_malloc(id_str_size + 1);
|
1784 | 585f8587 | bellard | if (!sn->id_str)
|
1785 | 585f8587 | bellard | goto fail;
|
1786 | 585f8587 | bellard | if (bdrv_pread(s->hd, offset, sn->id_str, id_str_size) != id_str_size)
|
1787 | 585f8587 | bellard | goto fail;
|
1788 | 585f8587 | bellard | offset += id_str_size; |
1789 | 585f8587 | bellard | sn->id_str[id_str_size] = '\0';
|
1790 | 585f8587 | bellard | |
1791 | 585f8587 | bellard | sn->name = qemu_malloc(name_size + 1);
|
1792 | 585f8587 | bellard | if (!sn->name)
|
1793 | 585f8587 | bellard | goto fail;
|
1794 | 585f8587 | bellard | if (bdrv_pread(s->hd, offset, sn->name, name_size) != name_size)
|
1795 | 585f8587 | bellard | goto fail;
|
1796 | 585f8587 | bellard | offset += name_size; |
1797 | 585f8587 | bellard | sn->name[name_size] = '\0';
|
1798 | 585f8587 | bellard | } |
1799 | 585f8587 | bellard | s->snapshots_size = offset - s->snapshots_offset; |
1800 | 585f8587 | bellard | return 0; |
1801 | 585f8587 | bellard | fail:
|
1802 | 585f8587 | bellard | qcow_free_snapshots(bs); |
1803 | 585f8587 | bellard | return -1; |
1804 | 585f8587 | bellard | } |
1805 | 585f8587 | bellard | |
1806 | 585f8587 | bellard | /* add at the end of the file a new list of snapshots */
|
1807 | 585f8587 | bellard | static int qcow_write_snapshots(BlockDriverState *bs) |
1808 | 585f8587 | bellard | { |
1809 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1810 | 585f8587 | bellard | QCowSnapshot *sn; |
1811 | 585f8587 | bellard | QCowSnapshotHeader h; |
1812 | 585f8587 | bellard | int i, name_size, id_str_size, snapshots_size;
|
1813 | 585f8587 | bellard | uint64_t data64; |
1814 | 585f8587 | bellard | uint32_t data32; |
1815 | 585f8587 | bellard | int64_t offset, snapshots_offset; |
1816 | 585f8587 | bellard | |
1817 | 585f8587 | bellard | /* compute the size of the snapshots */
|
1818 | 585f8587 | bellard | offset = 0;
|
1819 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1820 | 585f8587 | bellard | sn = s->snapshots + i; |
1821 | 585f8587 | bellard | offset = align_offset(offset, 8);
|
1822 | 585f8587 | bellard | offset += sizeof(h);
|
1823 | 585f8587 | bellard | offset += strlen(sn->id_str); |
1824 | 585f8587 | bellard | offset += strlen(sn->name); |
1825 | 585f8587 | bellard | } |
1826 | 585f8587 | bellard | snapshots_size = offset; |
1827 | 585f8587 | bellard | |
1828 | 585f8587 | bellard | snapshots_offset = alloc_clusters(bs, snapshots_size); |
1829 | 585f8587 | bellard | offset = snapshots_offset; |
1830 | 3b46e624 | ths | |
1831 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1832 | 585f8587 | bellard | sn = s->snapshots + i; |
1833 | 585f8587 | bellard | memset(&h, 0, sizeof(h)); |
1834 | 585f8587 | bellard | h.l1_table_offset = cpu_to_be64(sn->l1_table_offset); |
1835 | 585f8587 | bellard | h.l1_size = cpu_to_be32(sn->l1_size); |
1836 | 585f8587 | bellard | h.vm_state_size = cpu_to_be32(sn->vm_state_size); |
1837 | 585f8587 | bellard | h.date_sec = cpu_to_be32(sn->date_sec); |
1838 | 585f8587 | bellard | h.date_nsec = cpu_to_be32(sn->date_nsec); |
1839 | 585f8587 | bellard | h.vm_clock_nsec = cpu_to_be64(sn->vm_clock_nsec); |
1840 | 3b46e624 | ths | |
1841 | 585f8587 | bellard | id_str_size = strlen(sn->id_str); |
1842 | 585f8587 | bellard | name_size = strlen(sn->name); |
1843 | 585f8587 | bellard | h.id_str_size = cpu_to_be16(id_str_size); |
1844 | 585f8587 | bellard | h.name_size = cpu_to_be16(name_size); |
1845 | 585f8587 | bellard | offset = align_offset(offset, 8);
|
1846 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offset, &h, sizeof(h)) != sizeof(h)) |
1847 | 585f8587 | bellard | goto fail;
|
1848 | 585f8587 | bellard | offset += sizeof(h);
|
1849 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offset, sn->id_str, id_str_size) != id_str_size)
|
1850 | 585f8587 | bellard | goto fail;
|
1851 | 585f8587 | bellard | offset += id_str_size; |
1852 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offset, sn->name, name_size) != name_size)
|
1853 | 585f8587 | bellard | goto fail;
|
1854 | 585f8587 | bellard | offset += name_size; |
1855 | 585f8587 | bellard | } |
1856 | 585f8587 | bellard | |
1857 | 585f8587 | bellard | /* update the various header fields */
|
1858 | 585f8587 | bellard | data64 = cpu_to_be64(snapshots_offset); |
1859 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, snapshots_offset),
|
1860 | 585f8587 | bellard | &data64, sizeof(data64)) != sizeof(data64)) |
1861 | 585f8587 | bellard | goto fail;
|
1862 | 585f8587 | bellard | data32 = cpu_to_be32(s->nb_snapshots); |
1863 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, nb_snapshots),
|
1864 | 585f8587 | bellard | &data32, sizeof(data32)) != sizeof(data32)) |
1865 | 585f8587 | bellard | goto fail;
|
1866 | 585f8587 | bellard | |
1867 | 585f8587 | bellard | /* free the old snapshot table */
|
1868 | 585f8587 | bellard | free_clusters(bs, s->snapshots_offset, s->snapshots_size); |
1869 | 585f8587 | bellard | s->snapshots_offset = snapshots_offset; |
1870 | 585f8587 | bellard | s->snapshots_size = snapshots_size; |
1871 | 585f8587 | bellard | return 0; |
1872 | 585f8587 | bellard | fail:
|
1873 | 585f8587 | bellard | return -1; |
1874 | 585f8587 | bellard | } |
1875 | 585f8587 | bellard | |
1876 | 585f8587 | bellard | static void find_new_snapshot_id(BlockDriverState *bs, |
1877 | 585f8587 | bellard | char *id_str, int id_str_size) |
1878 | 585f8587 | bellard | { |
1879 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1880 | 585f8587 | bellard | QCowSnapshot *sn; |
1881 | 585f8587 | bellard | int i, id, id_max = 0; |
1882 | 585f8587 | bellard | |
1883 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1884 | 585f8587 | bellard | sn = s->snapshots + i; |
1885 | 585f8587 | bellard | id = strtoul(sn->id_str, NULL, 10); |
1886 | 585f8587 | bellard | if (id > id_max)
|
1887 | 585f8587 | bellard | id_max = id; |
1888 | 585f8587 | bellard | } |
1889 | 585f8587 | bellard | snprintf(id_str, id_str_size, "%d", id_max + 1); |
1890 | 585f8587 | bellard | } |
1891 | 585f8587 | bellard | |
1892 | 585f8587 | bellard | static int find_snapshot_by_id(BlockDriverState *bs, const char *id_str) |
1893 | 585f8587 | bellard | { |
1894 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1895 | 585f8587 | bellard | int i;
|
1896 | 585f8587 | bellard | |
1897 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1898 | 585f8587 | bellard | if (!strcmp(s->snapshots[i].id_str, id_str))
|
1899 | 585f8587 | bellard | return i;
|
1900 | 585f8587 | bellard | } |
1901 | 585f8587 | bellard | return -1; |
1902 | 585f8587 | bellard | } |
1903 | 585f8587 | bellard | |
1904 | 585f8587 | bellard | static int find_snapshot_by_id_or_name(BlockDriverState *bs, const char *name) |
1905 | 585f8587 | bellard | { |
1906 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1907 | 585f8587 | bellard | int i, ret;
|
1908 | 3b46e624 | ths | |
1909 | 585f8587 | bellard | ret = find_snapshot_by_id(bs, name); |
1910 | 585f8587 | bellard | if (ret >= 0) |
1911 | 585f8587 | bellard | return ret;
|
1912 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
1913 | 585f8587 | bellard | if (!strcmp(s->snapshots[i].name, name))
|
1914 | 585f8587 | bellard | return i;
|
1915 | 585f8587 | bellard | } |
1916 | 585f8587 | bellard | return -1; |
1917 | 585f8587 | bellard | } |
1918 | 585f8587 | bellard | |
1919 | 585f8587 | bellard | /* if no id is provided, a new one is constructed */
|
1920 | 5fafdf24 | ths | static int qcow_snapshot_create(BlockDriverState *bs, |
1921 | 585f8587 | bellard | QEMUSnapshotInfo *sn_info) |
1922 | 585f8587 | bellard | { |
1923 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1924 | 585f8587 | bellard | QCowSnapshot *snapshots1, sn1, *sn = &sn1; |
1925 | 585f8587 | bellard | int i, ret;
|
1926 | 585f8587 | bellard | uint64_t *l1_table = NULL;
|
1927 | 3b46e624 | ths | |
1928 | 585f8587 | bellard | memset(sn, 0, sizeof(*sn)); |
1929 | 585f8587 | bellard | |
1930 | 585f8587 | bellard | if (sn_info->id_str[0] == '\0') { |
1931 | 585f8587 | bellard | /* compute a new id */
|
1932 | 585f8587 | bellard | find_new_snapshot_id(bs, sn_info->id_str, sizeof(sn_info->id_str));
|
1933 | 585f8587 | bellard | } |
1934 | 585f8587 | bellard | |
1935 | 585f8587 | bellard | /* check that the ID is unique */
|
1936 | 585f8587 | bellard | if (find_snapshot_by_id(bs, sn_info->id_str) >= 0) |
1937 | 585f8587 | bellard | return -ENOENT;
|
1938 | 585f8587 | bellard | |
1939 | 585f8587 | bellard | sn->id_str = qemu_strdup(sn_info->id_str); |
1940 | 585f8587 | bellard | if (!sn->id_str)
|
1941 | 585f8587 | bellard | goto fail;
|
1942 | 585f8587 | bellard | sn->name = qemu_strdup(sn_info->name); |
1943 | 585f8587 | bellard | if (!sn->name)
|
1944 | 585f8587 | bellard | goto fail;
|
1945 | 585f8587 | bellard | sn->vm_state_size = sn_info->vm_state_size; |
1946 | 585f8587 | bellard | sn->date_sec = sn_info->date_sec; |
1947 | 585f8587 | bellard | sn->date_nsec = sn_info->date_nsec; |
1948 | 585f8587 | bellard | sn->vm_clock_nsec = sn_info->vm_clock_nsec; |
1949 | 585f8587 | bellard | |
1950 | 585f8587 | bellard | ret = update_snapshot_refcount(bs, s->l1_table_offset, s->l1_size, 1);
|
1951 | 585f8587 | bellard | if (ret < 0) |
1952 | 585f8587 | bellard | goto fail;
|
1953 | 585f8587 | bellard | |
1954 | 585f8587 | bellard | /* create the L1 table of the snapshot */
|
1955 | 585f8587 | bellard | sn->l1_table_offset = alloc_clusters(bs, s->l1_size * sizeof(uint64_t));
|
1956 | 585f8587 | bellard | sn->l1_size = s->l1_size; |
1957 | 585f8587 | bellard | |
1958 | 585f8587 | bellard | l1_table = qemu_malloc(s->l1_size * sizeof(uint64_t));
|
1959 | 585f8587 | bellard | if (!l1_table)
|
1960 | 585f8587 | bellard | goto fail;
|
1961 | 585f8587 | bellard | for(i = 0; i < s->l1_size; i++) { |
1962 | 585f8587 | bellard | l1_table[i] = cpu_to_be64(s->l1_table[i]); |
1963 | 585f8587 | bellard | } |
1964 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, sn->l1_table_offset,
|
1965 | 5fafdf24 | ths | l1_table, s->l1_size * sizeof(uint64_t)) !=
|
1966 | 585f8587 | bellard | (s->l1_size * sizeof(uint64_t)))
|
1967 | 585f8587 | bellard | goto fail;
|
1968 | 585f8587 | bellard | qemu_free(l1_table); |
1969 | 585f8587 | bellard | l1_table = NULL;
|
1970 | 585f8587 | bellard | |
1971 | 585f8587 | bellard | snapshots1 = qemu_malloc((s->nb_snapshots + 1) * sizeof(QCowSnapshot)); |
1972 | 585f8587 | bellard | if (!snapshots1)
|
1973 | 585f8587 | bellard | goto fail;
|
1974 | 585f8587 | bellard | memcpy(snapshots1, s->snapshots, s->nb_snapshots * sizeof(QCowSnapshot));
|
1975 | 585f8587 | bellard | s->snapshots = snapshots1; |
1976 | 585f8587 | bellard | s->snapshots[s->nb_snapshots++] = *sn; |
1977 | 585f8587 | bellard | |
1978 | 585f8587 | bellard | if (qcow_write_snapshots(bs) < 0) |
1979 | 585f8587 | bellard | goto fail;
|
1980 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
1981 | 585f8587 | bellard | check_refcounts(bs); |
1982 | 585f8587 | bellard | #endif
|
1983 | 585f8587 | bellard | return 0; |
1984 | 585f8587 | bellard | fail:
|
1985 | 585f8587 | bellard | qemu_free(sn->name); |
1986 | 585f8587 | bellard | qemu_free(l1_table); |
1987 | 585f8587 | bellard | return -1; |
1988 | 585f8587 | bellard | } |
1989 | 585f8587 | bellard | |
1990 | 585f8587 | bellard | /* copy the snapshot 'snapshot_name' into the current disk image */
|
1991 | 5fafdf24 | ths | static int qcow_snapshot_goto(BlockDriverState *bs, |
1992 | 585f8587 | bellard | const char *snapshot_id) |
1993 | 585f8587 | bellard | { |
1994 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
1995 | 585f8587 | bellard | QCowSnapshot *sn; |
1996 | 585f8587 | bellard | int i, snapshot_index, l1_size2;
|
1997 | 585f8587 | bellard | |
1998 | 585f8587 | bellard | snapshot_index = find_snapshot_by_id_or_name(bs, snapshot_id); |
1999 | 585f8587 | bellard | if (snapshot_index < 0) |
2000 | 585f8587 | bellard | return -ENOENT;
|
2001 | 585f8587 | bellard | sn = &s->snapshots[snapshot_index]; |
2002 | 585f8587 | bellard | |
2003 | 585f8587 | bellard | if (update_snapshot_refcount(bs, s->l1_table_offset, s->l1_size, -1) < 0) |
2004 | 585f8587 | bellard | goto fail;
|
2005 | 585f8587 | bellard | |
2006 | 585f8587 | bellard | if (grow_l1_table(bs, sn->l1_size) < 0) |
2007 | 585f8587 | bellard | goto fail;
|
2008 | 585f8587 | bellard | |
2009 | 585f8587 | bellard | s->l1_size = sn->l1_size; |
2010 | 585f8587 | bellard | l1_size2 = s->l1_size * sizeof(uint64_t);
|
2011 | 585f8587 | bellard | /* copy the snapshot l1 table to the current l1 table */
|
2012 | 5fafdf24 | ths | if (bdrv_pread(s->hd, sn->l1_table_offset,
|
2013 | 585f8587 | bellard | s->l1_table, l1_size2) != l1_size2) |
2014 | 585f8587 | bellard | goto fail;
|
2015 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, s->l1_table_offset,
|
2016 | 585f8587 | bellard | s->l1_table, l1_size2) != l1_size2) |
2017 | 585f8587 | bellard | goto fail;
|
2018 | 585f8587 | bellard | for(i = 0;i < s->l1_size; i++) { |
2019 | 585f8587 | bellard | be64_to_cpus(&s->l1_table[i]); |
2020 | 585f8587 | bellard | } |
2021 | 585f8587 | bellard | |
2022 | 585f8587 | bellard | if (update_snapshot_refcount(bs, s->l1_table_offset, s->l1_size, 1) < 0) |
2023 | 585f8587 | bellard | goto fail;
|
2024 | 585f8587 | bellard | |
2025 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
2026 | 585f8587 | bellard | check_refcounts(bs); |
2027 | 585f8587 | bellard | #endif
|
2028 | 585f8587 | bellard | return 0; |
2029 | 585f8587 | bellard | fail:
|
2030 | 585f8587 | bellard | return -EIO;
|
2031 | 585f8587 | bellard | } |
2032 | 585f8587 | bellard | |
2033 | 585f8587 | bellard | static int qcow_snapshot_delete(BlockDriverState *bs, const char *snapshot_id) |
2034 | 585f8587 | bellard | { |
2035 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2036 | 585f8587 | bellard | QCowSnapshot *sn; |
2037 | 585f8587 | bellard | int snapshot_index, ret;
|
2038 | 3b46e624 | ths | |
2039 | 585f8587 | bellard | snapshot_index = find_snapshot_by_id_or_name(bs, snapshot_id); |
2040 | 585f8587 | bellard | if (snapshot_index < 0) |
2041 | 585f8587 | bellard | return -ENOENT;
|
2042 | 585f8587 | bellard | sn = &s->snapshots[snapshot_index]; |
2043 | 585f8587 | bellard | |
2044 | 585f8587 | bellard | ret = update_snapshot_refcount(bs, sn->l1_table_offset, sn->l1_size, -1);
|
2045 | 585f8587 | bellard | if (ret < 0) |
2046 | 585f8587 | bellard | return ret;
|
2047 | 585f8587 | bellard | /* must update the copied flag on the current cluster offsets */
|
2048 | 585f8587 | bellard | ret = update_snapshot_refcount(bs, s->l1_table_offset, s->l1_size, 0);
|
2049 | 585f8587 | bellard | if (ret < 0) |
2050 | 585f8587 | bellard | return ret;
|
2051 | 585f8587 | bellard | free_clusters(bs, sn->l1_table_offset, sn->l1_size * sizeof(uint64_t));
|
2052 | 585f8587 | bellard | |
2053 | 585f8587 | bellard | qemu_free(sn->id_str); |
2054 | 585f8587 | bellard | qemu_free(sn->name); |
2055 | 585f8587 | bellard | memmove(sn, sn + 1, (s->nb_snapshots - snapshot_index - 1) * sizeof(*sn)); |
2056 | 585f8587 | bellard | s->nb_snapshots--; |
2057 | 585f8587 | bellard | ret = qcow_write_snapshots(bs); |
2058 | 585f8587 | bellard | if (ret < 0) { |
2059 | 585f8587 | bellard | /* XXX: restore snapshot if error ? */
|
2060 | 585f8587 | bellard | return ret;
|
2061 | 585f8587 | bellard | } |
2062 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
2063 | 585f8587 | bellard | check_refcounts(bs); |
2064 | 585f8587 | bellard | #endif
|
2065 | 585f8587 | bellard | return 0; |
2066 | 585f8587 | bellard | } |
2067 | 585f8587 | bellard | |
2068 | 5fafdf24 | ths | static int qcow_snapshot_list(BlockDriverState *bs, |
2069 | 585f8587 | bellard | QEMUSnapshotInfo **psn_tab) |
2070 | 585f8587 | bellard | { |
2071 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2072 | 585f8587 | bellard | QEMUSnapshotInfo *sn_tab, *sn_info; |
2073 | 585f8587 | bellard | QCowSnapshot *sn; |
2074 | 585f8587 | bellard | int i;
|
2075 | 585f8587 | bellard | |
2076 | 585f8587 | bellard | sn_tab = qemu_mallocz(s->nb_snapshots * sizeof(QEMUSnapshotInfo));
|
2077 | 585f8587 | bellard | if (!sn_tab)
|
2078 | 585f8587 | bellard | goto fail;
|
2079 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
2080 | 585f8587 | bellard | sn_info = sn_tab + i; |
2081 | 585f8587 | bellard | sn = s->snapshots + i; |
2082 | 585f8587 | bellard | pstrcpy(sn_info->id_str, sizeof(sn_info->id_str),
|
2083 | 585f8587 | bellard | sn->id_str); |
2084 | 585f8587 | bellard | pstrcpy(sn_info->name, sizeof(sn_info->name),
|
2085 | 585f8587 | bellard | sn->name); |
2086 | 585f8587 | bellard | sn_info->vm_state_size = sn->vm_state_size; |
2087 | 585f8587 | bellard | sn_info->date_sec = sn->date_sec; |
2088 | 585f8587 | bellard | sn_info->date_nsec = sn->date_nsec; |
2089 | 585f8587 | bellard | sn_info->vm_clock_nsec = sn->vm_clock_nsec; |
2090 | 585f8587 | bellard | } |
2091 | 585f8587 | bellard | *psn_tab = sn_tab; |
2092 | 585f8587 | bellard | return s->nb_snapshots;
|
2093 | 585f8587 | bellard | fail:
|
2094 | 585f8587 | bellard | qemu_free(sn_tab); |
2095 | 585f8587 | bellard | *psn_tab = NULL;
|
2096 | 585f8587 | bellard | return -ENOMEM;
|
2097 | 585f8587 | bellard | } |
2098 | 585f8587 | bellard | |
2099 | 585f8587 | bellard | /*********************************************************/
|
2100 | 585f8587 | bellard | /* refcount handling */
|
2101 | 585f8587 | bellard | |
2102 | 585f8587 | bellard | static int refcount_init(BlockDriverState *bs) |
2103 | 585f8587 | bellard | { |
2104 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2105 | 585f8587 | bellard | int ret, refcount_table_size2, i;
|
2106 | 3b46e624 | ths | |
2107 | 585f8587 | bellard | s->refcount_block_cache = qemu_malloc(s->cluster_size); |
2108 | 585f8587 | bellard | if (!s->refcount_block_cache)
|
2109 | 585f8587 | bellard | goto fail;
|
2110 | 585f8587 | bellard | refcount_table_size2 = s->refcount_table_size * sizeof(uint64_t);
|
2111 | 585f8587 | bellard | s->refcount_table = qemu_malloc(refcount_table_size2); |
2112 | 585f8587 | bellard | if (!s->refcount_table)
|
2113 | 585f8587 | bellard | goto fail;
|
2114 | 585f8587 | bellard | if (s->refcount_table_size > 0) { |
2115 | 585f8587 | bellard | ret = bdrv_pread(s->hd, s->refcount_table_offset, |
2116 | 585f8587 | bellard | s->refcount_table, refcount_table_size2); |
2117 | 585f8587 | bellard | if (ret != refcount_table_size2)
|
2118 | 585f8587 | bellard | goto fail;
|
2119 | 585f8587 | bellard | for(i = 0; i < s->refcount_table_size; i++) |
2120 | 585f8587 | bellard | be64_to_cpus(&s->refcount_table[i]); |
2121 | 585f8587 | bellard | } |
2122 | 585f8587 | bellard | return 0; |
2123 | 585f8587 | bellard | fail:
|
2124 | 585f8587 | bellard | return -ENOMEM;
|
2125 | 585f8587 | bellard | } |
2126 | 585f8587 | bellard | |
2127 | 585f8587 | bellard | static void refcount_close(BlockDriverState *bs) |
2128 | 585f8587 | bellard | { |
2129 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2130 | 585f8587 | bellard | qemu_free(s->refcount_block_cache); |
2131 | 585f8587 | bellard | qemu_free(s->refcount_table); |
2132 | 585f8587 | bellard | } |
2133 | 585f8587 | bellard | |
2134 | 585f8587 | bellard | |
2135 | 5fafdf24 | ths | static int load_refcount_block(BlockDriverState *bs, |
2136 | 585f8587 | bellard | int64_t refcount_block_offset) |
2137 | 585f8587 | bellard | { |
2138 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2139 | 585f8587 | bellard | int ret;
|
2140 | 5fafdf24 | ths | ret = bdrv_pread(s->hd, refcount_block_offset, s->refcount_block_cache, |
2141 | 585f8587 | bellard | s->cluster_size); |
2142 | 585f8587 | bellard | if (ret != s->cluster_size)
|
2143 | 585f8587 | bellard | return -EIO;
|
2144 | 585f8587 | bellard | s->refcount_block_cache_offset = refcount_block_offset; |
2145 | 585f8587 | bellard | return 0; |
2146 | 585f8587 | bellard | } |
2147 | 585f8587 | bellard | |
2148 | 585f8587 | bellard | static int get_refcount(BlockDriverState *bs, int64_t cluster_index) |
2149 | 585f8587 | bellard | { |
2150 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2151 | 585f8587 | bellard | int refcount_table_index, block_index;
|
2152 | 585f8587 | bellard | int64_t refcount_block_offset; |
2153 | 585f8587 | bellard | |
2154 | 585f8587 | bellard | refcount_table_index = cluster_index >> (s->cluster_bits - REFCOUNT_SHIFT); |
2155 | 585f8587 | bellard | if (refcount_table_index >= s->refcount_table_size)
|
2156 | 585f8587 | bellard | return 0; |
2157 | 585f8587 | bellard | refcount_block_offset = s->refcount_table[refcount_table_index]; |
2158 | 585f8587 | bellard | if (!refcount_block_offset)
|
2159 | 585f8587 | bellard | return 0; |
2160 | 585f8587 | bellard | if (refcount_block_offset != s->refcount_block_cache_offset) {
|
2161 | 585f8587 | bellard | /* better than nothing: return allocated if read error */
|
2162 | 585f8587 | bellard | if (load_refcount_block(bs, refcount_block_offset) < 0) |
2163 | 585f8587 | bellard | return 1; |
2164 | 585f8587 | bellard | } |
2165 | 5fafdf24 | ths | block_index = cluster_index & |
2166 | 585f8587 | bellard | ((1 << (s->cluster_bits - REFCOUNT_SHIFT)) - 1); |
2167 | 585f8587 | bellard | return be16_to_cpu(s->refcount_block_cache[block_index]);
|
2168 | 585f8587 | bellard | } |
2169 | 585f8587 | bellard | |
2170 | 585f8587 | bellard | /* return < 0 if error */
|
2171 | 585f8587 | bellard | static int64_t alloc_clusters_noref(BlockDriverState *bs, int64_t size)
|
2172 | 585f8587 | bellard | { |
2173 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2174 | 585f8587 | bellard | int i, nb_clusters;
|
2175 | 585f8587 | bellard | |
2176 | 585f8587 | bellard | nb_clusters = (size + s->cluster_size - 1) >> s->cluster_bits;
|
2177 | 585f8587 | bellard | for(;;) {
|
2178 | 585f8587 | bellard | if (get_refcount(bs, s->free_cluster_index) == 0) { |
2179 | 585f8587 | bellard | s->free_cluster_index++; |
2180 | 585f8587 | bellard | for(i = 1; i < nb_clusters; i++) { |
2181 | 585f8587 | bellard | if (get_refcount(bs, s->free_cluster_index) != 0) |
2182 | 585f8587 | bellard | goto not_found;
|
2183 | 585f8587 | bellard | s->free_cluster_index++; |
2184 | 585f8587 | bellard | } |
2185 | 585f8587 | bellard | #ifdef DEBUG_ALLOC2
|
2186 | 585f8587 | bellard | printf("alloc_clusters: size=%lld -> %lld\n",
|
2187 | 5fafdf24 | ths | size, |
2188 | 585f8587 | bellard | (s->free_cluster_index - nb_clusters) << s->cluster_bits); |
2189 | 585f8587 | bellard | #endif
|
2190 | 585f8587 | bellard | return (s->free_cluster_index - nb_clusters) << s->cluster_bits;
|
2191 | 585f8587 | bellard | } else {
|
2192 | 585f8587 | bellard | not_found:
|
2193 | 585f8587 | bellard | s->free_cluster_index++; |
2194 | 585f8587 | bellard | } |
2195 | 585f8587 | bellard | } |
2196 | 585f8587 | bellard | } |
2197 | 585f8587 | bellard | |
2198 | 585f8587 | bellard | static int64_t alloc_clusters(BlockDriverState *bs, int64_t size)
|
2199 | 585f8587 | bellard | { |
2200 | 585f8587 | bellard | int64_t offset; |
2201 | 585f8587 | bellard | |
2202 | 585f8587 | bellard | offset = alloc_clusters_noref(bs, size); |
2203 | 585f8587 | bellard | update_refcount(bs, offset, size, 1);
|
2204 | 585f8587 | bellard | return offset;
|
2205 | 585f8587 | bellard | } |
2206 | 585f8587 | bellard | |
2207 | 585f8587 | bellard | /* only used to allocate compressed sectors. We try to allocate
|
2208 | 585f8587 | bellard | contiguous sectors. size must be <= cluster_size */
|
2209 | 585f8587 | bellard | static int64_t alloc_bytes(BlockDriverState *bs, int size) |
2210 | 585f8587 | bellard | { |
2211 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2212 | 585f8587 | bellard | int64_t offset, cluster_offset; |
2213 | 585f8587 | bellard | int free_in_cluster;
|
2214 | 3b46e624 | ths | |
2215 | 585f8587 | bellard | assert(size > 0 && size <= s->cluster_size);
|
2216 | 585f8587 | bellard | if (s->free_byte_offset == 0) { |
2217 | 585f8587 | bellard | s->free_byte_offset = alloc_clusters(bs, s->cluster_size); |
2218 | 585f8587 | bellard | } |
2219 | 585f8587 | bellard | redo:
|
2220 | 5fafdf24 | ths | free_in_cluster = s->cluster_size - |
2221 | 585f8587 | bellard | (s->free_byte_offset & (s->cluster_size - 1));
|
2222 | 585f8587 | bellard | if (size <= free_in_cluster) {
|
2223 | 585f8587 | bellard | /* enough space in current cluster */
|
2224 | 585f8587 | bellard | offset = s->free_byte_offset; |
2225 | 585f8587 | bellard | s->free_byte_offset += size; |
2226 | 585f8587 | bellard | free_in_cluster -= size; |
2227 | 585f8587 | bellard | if (free_in_cluster == 0) |
2228 | 585f8587 | bellard | s->free_byte_offset = 0;
|
2229 | 585f8587 | bellard | if ((offset & (s->cluster_size - 1)) != 0) |
2230 | 585f8587 | bellard | update_cluster_refcount(bs, offset >> s->cluster_bits, 1);
|
2231 | 585f8587 | bellard | } else {
|
2232 | 585f8587 | bellard | offset = alloc_clusters(bs, s->cluster_size); |
2233 | 585f8587 | bellard | cluster_offset = s->free_byte_offset & ~(s->cluster_size - 1);
|
2234 | 585f8587 | bellard | if ((cluster_offset + s->cluster_size) == offset) {
|
2235 | 585f8587 | bellard | /* we are lucky: contiguous data */
|
2236 | 585f8587 | bellard | offset = s->free_byte_offset; |
2237 | 585f8587 | bellard | update_cluster_refcount(bs, offset >> s->cluster_bits, 1);
|
2238 | 585f8587 | bellard | s->free_byte_offset += size; |
2239 | 585f8587 | bellard | } else {
|
2240 | 585f8587 | bellard | s->free_byte_offset = offset; |
2241 | 585f8587 | bellard | goto redo;
|
2242 | 585f8587 | bellard | } |
2243 | 585f8587 | bellard | } |
2244 | 585f8587 | bellard | return offset;
|
2245 | 585f8587 | bellard | } |
2246 | 585f8587 | bellard | |
2247 | 5fafdf24 | ths | static void free_clusters(BlockDriverState *bs, |
2248 | 585f8587 | bellard | int64_t offset, int64_t size) |
2249 | 585f8587 | bellard | { |
2250 | 585f8587 | bellard | update_refcount(bs, offset, size, -1);
|
2251 | 585f8587 | bellard | } |
2252 | 585f8587 | bellard | |
2253 | 585f8587 | bellard | static int grow_refcount_table(BlockDriverState *bs, int min_size) |
2254 | 585f8587 | bellard | { |
2255 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2256 | 585f8587 | bellard | int new_table_size, new_table_size2, refcount_table_clusters, i, ret;
|
2257 | 585f8587 | bellard | uint64_t *new_table; |
2258 | 585f8587 | bellard | int64_t table_offset; |
2259 | 585f8587 | bellard | uint64_t data64; |
2260 | 585f8587 | bellard | uint32_t data32; |
2261 | 23be50f1 | ths | int old_table_size;
|
2262 | 23be50f1 | ths | int64_t old_table_offset; |
2263 | 585f8587 | bellard | |
2264 | 585f8587 | bellard | if (min_size <= s->refcount_table_size)
|
2265 | 585f8587 | bellard | return 0; |
2266 | 585f8587 | bellard | /* compute new table size */
|
2267 | 585f8587 | bellard | refcount_table_clusters = s->refcount_table_size >> (s->cluster_bits - 3);
|
2268 | 585f8587 | bellard | for(;;) {
|
2269 | 585f8587 | bellard | if (refcount_table_clusters == 0) { |
2270 | 585f8587 | bellard | refcount_table_clusters = 1;
|
2271 | 585f8587 | bellard | } else {
|
2272 | 585f8587 | bellard | refcount_table_clusters = (refcount_table_clusters * 3 + 1) / 2; |
2273 | 585f8587 | bellard | } |
2274 | 585f8587 | bellard | new_table_size = refcount_table_clusters << (s->cluster_bits - 3);
|
2275 | 585f8587 | bellard | if (min_size <= new_table_size)
|
2276 | 585f8587 | bellard | break;
|
2277 | 585f8587 | bellard | } |
2278 | 15e6690a | bellard | #ifdef DEBUG_ALLOC2
|
2279 | 15e6690a | bellard | printf("grow_refcount_table from %d to %d\n",
|
2280 | 15e6690a | bellard | s->refcount_table_size, |
2281 | 15e6690a | bellard | new_table_size); |
2282 | 15e6690a | bellard | #endif
|
2283 | 585f8587 | bellard | new_table_size2 = new_table_size * sizeof(uint64_t);
|
2284 | 585f8587 | bellard | new_table = qemu_mallocz(new_table_size2); |
2285 | 585f8587 | bellard | if (!new_table)
|
2286 | 585f8587 | bellard | return -ENOMEM;
|
2287 | 5fafdf24 | ths | memcpy(new_table, s->refcount_table, |
2288 | 585f8587 | bellard | s->refcount_table_size * sizeof(uint64_t));
|
2289 | 585f8587 | bellard | for(i = 0; i < s->refcount_table_size; i++) |
2290 | 585f8587 | bellard | cpu_to_be64s(&new_table[i]); |
2291 | 585f8587 | bellard | /* Note: we cannot update the refcount now to avoid recursion */
|
2292 | 585f8587 | bellard | table_offset = alloc_clusters_noref(bs, new_table_size2); |
2293 | 585f8587 | bellard | ret = bdrv_pwrite(s->hd, table_offset, new_table, new_table_size2); |
2294 | 5fafdf24 | ths | if (ret != new_table_size2)
|
2295 | 585f8587 | bellard | goto fail;
|
2296 | 585f8587 | bellard | for(i = 0; i < s->refcount_table_size; i++) |
2297 | 585f8587 | bellard | be64_to_cpus(&new_table[i]); |
2298 | 585f8587 | bellard | |
2299 | 585f8587 | bellard | data64 = cpu_to_be64(table_offset); |
2300 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, refcount_table_offset),
|
2301 | 585f8587 | bellard | &data64, sizeof(data64)) != sizeof(data64)) |
2302 | 585f8587 | bellard | goto fail;
|
2303 | 585f8587 | bellard | data32 = cpu_to_be32(refcount_table_clusters); |
2304 | 585f8587 | bellard | if (bdrv_pwrite(s->hd, offsetof(QCowHeader, refcount_table_clusters),
|
2305 | 585f8587 | bellard | &data32, sizeof(data32)) != sizeof(data32)) |
2306 | 585f8587 | bellard | goto fail;
|
2307 | 585f8587 | bellard | qemu_free(s->refcount_table); |
2308 | 23be50f1 | ths | old_table_offset = s->refcount_table_offset; |
2309 | 23be50f1 | ths | old_table_size = s->refcount_table_size; |
2310 | 585f8587 | bellard | s->refcount_table = new_table; |
2311 | 585f8587 | bellard | s->refcount_table_size = new_table_size; |
2312 | a4080ece | ths | s->refcount_table_offset = table_offset; |
2313 | 585f8587 | bellard | |
2314 | 585f8587 | bellard | update_refcount(bs, table_offset, new_table_size2, 1);
|
2315 | 23be50f1 | ths | free_clusters(bs, old_table_offset, old_table_size * sizeof(uint64_t));
|
2316 | 585f8587 | bellard | return 0; |
2317 | 585f8587 | bellard | fail:
|
2318 | 585f8587 | bellard | free_clusters(bs, table_offset, new_table_size2); |
2319 | 585f8587 | bellard | qemu_free(new_table); |
2320 | 585f8587 | bellard | return -EIO;
|
2321 | 585f8587 | bellard | } |
2322 | 585f8587 | bellard | |
2323 | 585f8587 | bellard | /* addend must be 1 or -1 */
|
2324 | 585f8587 | bellard | /* XXX: cache several refcount block clusters ? */
|
2325 | 5fafdf24 | ths | static int update_cluster_refcount(BlockDriverState *bs, |
2326 | 585f8587 | bellard | int64_t cluster_index, |
2327 | 585f8587 | bellard | int addend)
|
2328 | 585f8587 | bellard | { |
2329 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2330 | 585f8587 | bellard | int64_t offset, refcount_block_offset; |
2331 | 585f8587 | bellard | int ret, refcount_table_index, block_index, refcount;
|
2332 | 585f8587 | bellard | uint64_t data64; |
2333 | 585f8587 | bellard | |
2334 | 585f8587 | bellard | refcount_table_index = cluster_index >> (s->cluster_bits - REFCOUNT_SHIFT); |
2335 | 585f8587 | bellard | if (refcount_table_index >= s->refcount_table_size) {
|
2336 | 585f8587 | bellard | if (addend < 0) |
2337 | 585f8587 | bellard | return -EINVAL;
|
2338 | 585f8587 | bellard | ret = grow_refcount_table(bs, refcount_table_index + 1);
|
2339 | 585f8587 | bellard | if (ret < 0) |
2340 | 585f8587 | bellard | return ret;
|
2341 | 585f8587 | bellard | } |
2342 | 585f8587 | bellard | refcount_block_offset = s->refcount_table[refcount_table_index]; |
2343 | 585f8587 | bellard | if (!refcount_block_offset) {
|
2344 | 585f8587 | bellard | if (addend < 0) |
2345 | 585f8587 | bellard | return -EINVAL;
|
2346 | 585f8587 | bellard | /* create a new refcount block */
|
2347 | 585f8587 | bellard | /* Note: we cannot update the refcount now to avoid recursion */
|
2348 | 585f8587 | bellard | offset = alloc_clusters_noref(bs, s->cluster_size); |
2349 | 585f8587 | bellard | memset(s->refcount_block_cache, 0, s->cluster_size);
|
2350 | 585f8587 | bellard | ret = bdrv_pwrite(s->hd, offset, s->refcount_block_cache, s->cluster_size); |
2351 | 585f8587 | bellard | if (ret != s->cluster_size)
|
2352 | 585f8587 | bellard | return -EINVAL;
|
2353 | 585f8587 | bellard | s->refcount_table[refcount_table_index] = offset; |
2354 | 585f8587 | bellard | data64 = cpu_to_be64(offset); |
2355 | 5fafdf24 | ths | ret = bdrv_pwrite(s->hd, s->refcount_table_offset + |
2356 | 5fafdf24 | ths | refcount_table_index * sizeof(uint64_t),
|
2357 | 585f8587 | bellard | &data64, sizeof(data64));
|
2358 | 585f8587 | bellard | if (ret != sizeof(data64)) |
2359 | 585f8587 | bellard | return -EINVAL;
|
2360 | 585f8587 | bellard | |
2361 | 585f8587 | bellard | refcount_block_offset = offset; |
2362 | 585f8587 | bellard | s->refcount_block_cache_offset = offset; |
2363 | 585f8587 | bellard | update_refcount(bs, offset, s->cluster_size, 1);
|
2364 | 585f8587 | bellard | } else {
|
2365 | 585f8587 | bellard | if (refcount_block_offset != s->refcount_block_cache_offset) {
|
2366 | 585f8587 | bellard | if (load_refcount_block(bs, refcount_block_offset) < 0) |
2367 | 585f8587 | bellard | return -EIO;
|
2368 | 585f8587 | bellard | } |
2369 | 585f8587 | bellard | } |
2370 | 585f8587 | bellard | /* we can update the count and save it */
|
2371 | 5fafdf24 | ths | block_index = cluster_index & |
2372 | 585f8587 | bellard | ((1 << (s->cluster_bits - REFCOUNT_SHIFT)) - 1); |
2373 | 585f8587 | bellard | refcount = be16_to_cpu(s->refcount_block_cache[block_index]); |
2374 | 585f8587 | bellard | refcount += addend; |
2375 | 585f8587 | bellard | if (refcount < 0 || refcount > 0xffff) |
2376 | 585f8587 | bellard | return -EINVAL;
|
2377 | 585f8587 | bellard | if (refcount == 0 && cluster_index < s->free_cluster_index) { |
2378 | 585f8587 | bellard | s->free_cluster_index = cluster_index; |
2379 | 585f8587 | bellard | } |
2380 | 585f8587 | bellard | s->refcount_block_cache[block_index] = cpu_to_be16(refcount); |
2381 | 5fafdf24 | ths | if (bdrv_pwrite(s->hd,
|
2382 | 5fafdf24 | ths | refcount_block_offset + (block_index << REFCOUNT_SHIFT), |
2383 | 585f8587 | bellard | &s->refcount_block_cache[block_index], 2) != 2) |
2384 | 585f8587 | bellard | return -EIO;
|
2385 | 585f8587 | bellard | return refcount;
|
2386 | 585f8587 | bellard | } |
2387 | 585f8587 | bellard | |
2388 | 5fafdf24 | ths | static void update_refcount(BlockDriverState *bs, |
2389 | 5fafdf24 | ths | int64_t offset, int64_t length, |
2390 | 585f8587 | bellard | int addend)
|
2391 | 585f8587 | bellard | { |
2392 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2393 | 585f8587 | bellard | int64_t start, last, cluster_offset; |
2394 | 585f8587 | bellard | |
2395 | 585f8587 | bellard | #ifdef DEBUG_ALLOC2
|
2396 | 5fafdf24 | ths | printf("update_refcount: offset=%lld size=%lld addend=%d\n",
|
2397 | 585f8587 | bellard | offset, length, addend); |
2398 | 585f8587 | bellard | #endif
|
2399 | 585f8587 | bellard | if (length <= 0) |
2400 | 585f8587 | bellard | return;
|
2401 | 585f8587 | bellard | start = offset & ~(s->cluster_size - 1);
|
2402 | 585f8587 | bellard | last = (offset + length - 1) & ~(s->cluster_size - 1); |
2403 | 5fafdf24 | ths | for(cluster_offset = start; cluster_offset <= last;
|
2404 | 585f8587 | bellard | cluster_offset += s->cluster_size) { |
2405 | 585f8587 | bellard | update_cluster_refcount(bs, cluster_offset >> s->cluster_bits, addend); |
2406 | 585f8587 | bellard | } |
2407 | 585f8587 | bellard | } |
2408 | 585f8587 | bellard | |
2409 | 585f8587 | bellard | #ifdef DEBUG_ALLOC
|
2410 | 5fafdf24 | ths | static void inc_refcounts(BlockDriverState *bs, |
2411 | 5fafdf24 | ths | uint16_t *refcount_table, |
2412 | 585f8587 | bellard | int refcount_table_size,
|
2413 | 585f8587 | bellard | int64_t offset, int64_t size) |
2414 | 585f8587 | bellard | { |
2415 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2416 | 585f8587 | bellard | int64_t start, last, cluster_offset; |
2417 | 585f8587 | bellard | int k;
|
2418 | 3b46e624 | ths | |
2419 | 585f8587 | bellard | if (size <= 0) |
2420 | 585f8587 | bellard | return;
|
2421 | 585f8587 | bellard | |
2422 | 585f8587 | bellard | start = offset & ~(s->cluster_size - 1);
|
2423 | 585f8587 | bellard | last = (offset + size - 1) & ~(s->cluster_size - 1); |
2424 | 5fafdf24 | ths | for(cluster_offset = start; cluster_offset <= last;
|
2425 | 585f8587 | bellard | cluster_offset += s->cluster_size) { |
2426 | 585f8587 | bellard | k = cluster_offset >> s->cluster_bits; |
2427 | 585f8587 | bellard | if (k < 0 || k >= refcount_table_size) { |
2428 | 585f8587 | bellard | printf("ERROR: invalid cluster offset=0x%llx\n", cluster_offset);
|
2429 | 585f8587 | bellard | } else {
|
2430 | 585f8587 | bellard | if (++refcount_table[k] == 0) { |
2431 | 585f8587 | bellard | printf("ERROR: overflow cluster offset=0x%llx\n", cluster_offset);
|
2432 | 585f8587 | bellard | } |
2433 | 585f8587 | bellard | } |
2434 | 585f8587 | bellard | } |
2435 | 585f8587 | bellard | } |
2436 | 585f8587 | bellard | |
2437 | 5fafdf24 | ths | static int check_refcounts_l1(BlockDriverState *bs, |
2438 | 5fafdf24 | ths | uint16_t *refcount_table, |
2439 | 585f8587 | bellard | int refcount_table_size,
|
2440 | 585f8587 | bellard | int64_t l1_table_offset, int l1_size,
|
2441 | 585f8587 | bellard | int check_copied)
|
2442 | 585f8587 | bellard | { |
2443 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2444 | 585f8587 | bellard | uint64_t *l1_table, *l2_table, l2_offset, offset, l1_size2; |
2445 | 585f8587 | bellard | int l2_size, i, j, nb_csectors, refcount;
|
2446 | 585f8587 | bellard | |
2447 | 585f8587 | bellard | l2_table = NULL;
|
2448 | 585f8587 | bellard | l1_size2 = l1_size * sizeof(uint64_t);
|
2449 | 585f8587 | bellard | |
2450 | 585f8587 | bellard | inc_refcounts(bs, refcount_table, refcount_table_size, |
2451 | 585f8587 | bellard | l1_table_offset, l1_size2); |
2452 | 585f8587 | bellard | |
2453 | 585f8587 | bellard | l1_table = qemu_malloc(l1_size2); |
2454 | 585f8587 | bellard | if (!l1_table)
|
2455 | 585f8587 | bellard | goto fail;
|
2456 | 5fafdf24 | ths | if (bdrv_pread(s->hd, l1_table_offset,
|
2457 | 585f8587 | bellard | l1_table, l1_size2) != l1_size2) |
2458 | 585f8587 | bellard | goto fail;
|
2459 | 585f8587 | bellard | for(i = 0;i < l1_size; i++) |
2460 | 585f8587 | bellard | be64_to_cpus(&l1_table[i]); |
2461 | 3b46e624 | ths | |
2462 | 585f8587 | bellard | l2_size = s->l2_size * sizeof(uint64_t);
|
2463 | 585f8587 | bellard | l2_table = qemu_malloc(l2_size); |
2464 | 585f8587 | bellard | if (!l2_table)
|
2465 | 585f8587 | bellard | goto fail;
|
2466 | 585f8587 | bellard | for(i = 0; i < l1_size; i++) { |
2467 | 585f8587 | bellard | l2_offset = l1_table[i]; |
2468 | 585f8587 | bellard | if (l2_offset) {
|
2469 | 585f8587 | bellard | if (check_copied) {
|
2470 | 585f8587 | bellard | refcount = get_refcount(bs, (l2_offset & ~QCOW_OFLAG_COPIED) >> s->cluster_bits); |
2471 | 585f8587 | bellard | if ((refcount == 1) != ((l2_offset & QCOW_OFLAG_COPIED) != 0)) { |
2472 | 585f8587 | bellard | printf("ERROR OFLAG_COPIED: l2_offset=%llx refcount=%d\n",
|
2473 | 585f8587 | bellard | l2_offset, refcount); |
2474 | 585f8587 | bellard | } |
2475 | 585f8587 | bellard | } |
2476 | 585f8587 | bellard | l2_offset &= ~QCOW_OFLAG_COPIED; |
2477 | 585f8587 | bellard | if (bdrv_pread(s->hd, l2_offset, l2_table, l2_size) != l2_size)
|
2478 | 585f8587 | bellard | goto fail;
|
2479 | 585f8587 | bellard | for(j = 0; j < s->l2_size; j++) { |
2480 | 585f8587 | bellard | offset = be64_to_cpu(l2_table[j]); |
2481 | 585f8587 | bellard | if (offset != 0) { |
2482 | 585f8587 | bellard | if (offset & QCOW_OFLAG_COMPRESSED) {
|
2483 | 585f8587 | bellard | if (offset & QCOW_OFLAG_COPIED) {
|
2484 | 585f8587 | bellard | printf("ERROR: cluster %lld: copied flag must never be set for compressed clusters\n",
|
2485 | 585f8587 | bellard | offset >> s->cluster_bits); |
2486 | 585f8587 | bellard | offset &= ~QCOW_OFLAG_COPIED; |
2487 | 585f8587 | bellard | } |
2488 | 5fafdf24 | ths | nb_csectors = ((offset >> s->csize_shift) & |
2489 | 585f8587 | bellard | s->csize_mask) + 1;
|
2490 | 585f8587 | bellard | offset &= s->cluster_offset_mask; |
2491 | 5fafdf24 | ths | inc_refcounts(bs, refcount_table, |
2492 | 585f8587 | bellard | refcount_table_size, |
2493 | 585f8587 | bellard | offset & ~511, nb_csectors * 512); |
2494 | 585f8587 | bellard | } else {
|
2495 | 585f8587 | bellard | if (check_copied) {
|
2496 | 585f8587 | bellard | refcount = get_refcount(bs, (offset & ~QCOW_OFLAG_COPIED) >> s->cluster_bits); |
2497 | 585f8587 | bellard | if ((refcount == 1) != ((offset & QCOW_OFLAG_COPIED) != 0)) { |
2498 | 585f8587 | bellard | printf("ERROR OFLAG_COPIED: offset=%llx refcount=%d\n",
|
2499 | 585f8587 | bellard | offset, refcount); |
2500 | 585f8587 | bellard | } |
2501 | 585f8587 | bellard | } |
2502 | 585f8587 | bellard | offset &= ~QCOW_OFLAG_COPIED; |
2503 | 5fafdf24 | ths | inc_refcounts(bs, refcount_table, |
2504 | 585f8587 | bellard | refcount_table_size, |
2505 | 585f8587 | bellard | offset, s->cluster_size); |
2506 | 585f8587 | bellard | } |
2507 | 585f8587 | bellard | } |
2508 | 585f8587 | bellard | } |
2509 | 5fafdf24 | ths | inc_refcounts(bs, refcount_table, |
2510 | 585f8587 | bellard | refcount_table_size, |
2511 | 585f8587 | bellard | l2_offset, |
2512 | 585f8587 | bellard | s->cluster_size); |
2513 | 585f8587 | bellard | } |
2514 | 585f8587 | bellard | } |
2515 | 585f8587 | bellard | qemu_free(l1_table); |
2516 | 585f8587 | bellard | qemu_free(l2_table); |
2517 | 585f8587 | bellard | return 0; |
2518 | 585f8587 | bellard | fail:
|
2519 | 585f8587 | bellard | printf("ERROR: I/O error in check_refcounts_l1\n");
|
2520 | 585f8587 | bellard | qemu_free(l1_table); |
2521 | 585f8587 | bellard | qemu_free(l2_table); |
2522 | 585f8587 | bellard | return -EIO;
|
2523 | 585f8587 | bellard | } |
2524 | 585f8587 | bellard | |
2525 | 585f8587 | bellard | static void check_refcounts(BlockDriverState *bs) |
2526 | 585f8587 | bellard | { |
2527 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque; |
2528 | 585f8587 | bellard | int64_t size; |
2529 | 585f8587 | bellard | int nb_clusters, refcount1, refcount2, i;
|
2530 | 585f8587 | bellard | QCowSnapshot *sn; |
2531 | 585f8587 | bellard | uint16_t *refcount_table; |
2532 | 585f8587 | bellard | |
2533 | 585f8587 | bellard | size = bdrv_getlength(s->hd); |
2534 | 585f8587 | bellard | nb_clusters = (size + s->cluster_size - 1) >> s->cluster_bits;
|
2535 | 585f8587 | bellard | refcount_table = qemu_mallocz(nb_clusters * sizeof(uint16_t));
|
2536 | 15e6690a | bellard | |
2537 | 585f8587 | bellard | /* header */
|
2538 | 585f8587 | bellard | inc_refcounts(bs, refcount_table, nb_clusters, |
2539 | 585f8587 | bellard | 0, s->cluster_size);
|
2540 | 3b46e624 | ths | |
2541 | 585f8587 | bellard | check_refcounts_l1(bs, refcount_table, nb_clusters, |
2542 | 585f8587 | bellard | s->l1_table_offset, s->l1_size, 1);
|
2543 | 585f8587 | bellard | |
2544 | 585f8587 | bellard | /* snapshots */
|
2545 | 585f8587 | bellard | for(i = 0; i < s->nb_snapshots; i++) { |
2546 | 585f8587 | bellard | sn = s->snapshots + i; |
2547 | 585f8587 | bellard | check_refcounts_l1(bs, refcount_table, nb_clusters, |
2548 | 585f8587 | bellard | sn->l1_table_offset, sn->l1_size, 0);
|
2549 | 585f8587 | bellard | } |
2550 | 585f8587 | bellard | inc_refcounts(bs, refcount_table, nb_clusters, |
2551 | 585f8587 | bellard | s->snapshots_offset, s->snapshots_size); |
2552 | 585f8587 | bellard | |
2553 | 585f8587 | bellard | /* refcount data */
|
2554 | 585f8587 | bellard | inc_refcounts(bs, refcount_table, nb_clusters, |
2555 | 5fafdf24 | ths | s->refcount_table_offset, |
2556 | 585f8587 | bellard | s->refcount_table_size * sizeof(uint64_t));
|
2557 | 585f8587 | bellard | for(i = 0; i < s->refcount_table_size; i++) { |
2558 | 585f8587 | bellard | int64_t offset; |
2559 | 585f8587 | bellard | offset = s->refcount_table[i]; |
2560 | 585f8587 | bellard | if (offset != 0) { |
2561 | 585f8587 | bellard | inc_refcounts(bs, refcount_table, nb_clusters, |
2562 | 585f8587 | bellard | offset, s->cluster_size); |
2563 | 585f8587 | bellard | } |
2564 | 585f8587 | bellard | } |
2565 | 585f8587 | bellard | |
2566 | 585f8587 | bellard | /* compare ref counts */
|
2567 | 585f8587 | bellard | for(i = 0; i < nb_clusters; i++) { |
2568 | 585f8587 | bellard | refcount1 = get_refcount(bs, i); |
2569 | 585f8587 | bellard | refcount2 = refcount_table[i]; |
2570 | 585f8587 | bellard | if (refcount1 != refcount2)
|
2571 | 585f8587 | bellard | printf("ERROR cluster %d refcount=%d reference=%d\n",
|
2572 | 585f8587 | bellard | i, refcount1, refcount2); |
2573 | 585f8587 | bellard | } |
2574 | 585f8587 | bellard | |
2575 | 585f8587 | bellard | qemu_free(refcount_table); |
2576 | 585f8587 | bellard | } |
2577 | 585f8587 | bellard | |
2578 | 585f8587 | bellard | #if 0
|
2579 | 585f8587 | bellard | static void dump_refcounts(BlockDriverState *bs)
|
2580 | 585f8587 | bellard | {
|
2581 | 585f8587 | bellard | BDRVQcowState *s = bs->opaque;
|
2582 | 585f8587 | bellard | int64_t nb_clusters, k, k1, size;
|
2583 | 585f8587 | bellard | int refcount;
|
2584 | 585f8587 | bellard | |
2585 | 585f8587 | bellard | size = bdrv_getlength(s->hd);
|
2586 | 585f8587 | bellard | nb_clusters = (size + s->cluster_size - 1) >> s->cluster_bits;
|
2587 | 585f8587 | bellard | for(k = 0; k < nb_clusters;) {
|
2588 | 585f8587 | bellard | k1 = k;
|
2589 | 585f8587 | bellard | refcount = get_refcount(bs, k);
|
2590 | 585f8587 | bellard | k++;
|
2591 | 585f8587 | bellard | while (k < nb_clusters && get_refcount(bs, k) == refcount)
|
2592 | 585f8587 | bellard | k++;
|
2593 | 585f8587 | bellard | printf("%lld: refcount=%d nb=%lld\n", k, refcount, k - k1);
|
2594 | 585f8587 | bellard | }
|
2595 | 585f8587 | bellard | }
|
2596 | 585f8587 | bellard | #endif
|
2597 | 585f8587 | bellard | #endif
|
2598 | 585f8587 | bellard | |
2599 | 585f8587 | bellard | BlockDriver bdrv_qcow2 = { |
2600 | 585f8587 | bellard | "qcow2",
|
2601 | 585f8587 | bellard | sizeof(BDRVQcowState),
|
2602 | 585f8587 | bellard | qcow_probe, |
2603 | 585f8587 | bellard | qcow_open, |
2604 | 585f8587 | bellard | NULL,
|
2605 | 585f8587 | bellard | NULL,
|
2606 | 585f8587 | bellard | qcow_close, |
2607 | 585f8587 | bellard | qcow_create, |
2608 | 585f8587 | bellard | qcow_flush, |
2609 | 585f8587 | bellard | qcow_is_allocated, |
2610 | 585f8587 | bellard | qcow_set_key, |
2611 | 585f8587 | bellard | qcow_make_empty, |
2612 | 585f8587 | bellard | |
2613 | 585f8587 | bellard | .bdrv_aio_read = qcow_aio_read, |
2614 | 585f8587 | bellard | .bdrv_aio_write = qcow_aio_write, |
2615 | 585f8587 | bellard | .bdrv_aio_cancel = qcow_aio_cancel, |
2616 | ce1a14dc | pbrook | .aiocb_size = sizeof(QCowAIOCB),
|
2617 | 585f8587 | bellard | .bdrv_write_compressed = qcow_write_compressed, |
2618 | 585f8587 | bellard | |
2619 | 585f8587 | bellard | .bdrv_snapshot_create = qcow_snapshot_create, |
2620 | 585f8587 | bellard | .bdrv_snapshot_goto = qcow_snapshot_goto, |
2621 | 585f8587 | bellard | .bdrv_snapshot_delete = qcow_snapshot_delete, |
2622 | 585f8587 | bellard | .bdrv_snapshot_list = qcow_snapshot_list, |
2623 | 585f8587 | bellard | .bdrv_get_info = qcow_get_info, |
2624 | 585f8587 | bellard | }; |