Statistics
| Branch: | Revision:

root / block-qcow.c @ afc7df11

History | View | Annotate | Download (21.5 kB)

1 ea2384d3 bellard
/*
2 ea2384d3 bellard
 * Block driver for the QCOW format
3 ea2384d3 bellard
 * 
4 ea2384d3 bellard
 * Copyright (c) 2004 Fabrice Bellard
5 ea2384d3 bellard
 * 
6 ea2384d3 bellard
 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 ea2384d3 bellard
 * of this software and associated documentation files (the "Software"), to deal
8 ea2384d3 bellard
 * in the Software without restriction, including without limitation the rights
9 ea2384d3 bellard
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 ea2384d3 bellard
 * copies of the Software, and to permit persons to whom the Software is
11 ea2384d3 bellard
 * furnished to do so, subject to the following conditions:
12 ea2384d3 bellard
 *
13 ea2384d3 bellard
 * The above copyright notice and this permission notice shall be included in
14 ea2384d3 bellard
 * all copies or substantial portions of the Software.
15 ea2384d3 bellard
 *
16 ea2384d3 bellard
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 ea2384d3 bellard
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 ea2384d3 bellard
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 ea2384d3 bellard
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 ea2384d3 bellard
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 ea2384d3 bellard
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
22 ea2384d3 bellard
 * THE SOFTWARE.
23 ea2384d3 bellard
 */
24 ea2384d3 bellard
#include "vl.h"
25 ea2384d3 bellard
#include "block_int.h"
26 28d34b82 bellard
#include <zlib.h>
27 ea2384d3 bellard
#include "aes.h"
28 ea2384d3 bellard
29 ea2384d3 bellard
/**************************************************************/
30 ea2384d3 bellard
/* QEMU COW block driver with compression and encryption support */
31 ea2384d3 bellard
32 ea2384d3 bellard
#define QCOW_MAGIC (('Q' << 24) | ('F' << 16) | ('I' << 8) | 0xfb)
33 ea2384d3 bellard
#define QCOW_VERSION 1
34 ea2384d3 bellard
35 ea2384d3 bellard
#define QCOW_CRYPT_NONE 0
36 ea2384d3 bellard
#define QCOW_CRYPT_AES  1
37 ea2384d3 bellard
38 ea2384d3 bellard
#define QCOW_OFLAG_COMPRESSED (1LL << 63)
39 ea2384d3 bellard
40 ea2384d3 bellard
typedef struct QCowHeader {
41 ea2384d3 bellard
    uint32_t magic;
42 ea2384d3 bellard
    uint32_t version;
43 ea2384d3 bellard
    uint64_t backing_file_offset;
44 ea2384d3 bellard
    uint32_t backing_file_size;
45 ea2384d3 bellard
    uint32_t mtime;
46 ea2384d3 bellard
    uint64_t size; /* in bytes */
47 ea2384d3 bellard
    uint8_t cluster_bits;
48 ea2384d3 bellard
    uint8_t l2_bits;
49 ea2384d3 bellard
    uint32_t crypt_method;
50 ea2384d3 bellard
    uint64_t l1_table_offset;
51 ea2384d3 bellard
} QCowHeader;
52 ea2384d3 bellard
53 ea2384d3 bellard
#define L2_CACHE_SIZE 16
54 ea2384d3 bellard
55 ea2384d3 bellard
typedef struct BDRVQcowState {
56 ea2384d3 bellard
    int fd;
57 ea2384d3 bellard
    int cluster_bits;
58 ea2384d3 bellard
    int cluster_size;
59 ea2384d3 bellard
    int cluster_sectors;
60 ea2384d3 bellard
    int l2_bits;
61 ea2384d3 bellard
    int l2_size;
62 ea2384d3 bellard
    int l1_size;
63 ea2384d3 bellard
    uint64_t cluster_offset_mask;
64 ea2384d3 bellard
    uint64_t l1_table_offset;
65 ea2384d3 bellard
    uint64_t *l1_table;
66 ea2384d3 bellard
    uint64_t *l2_cache;
67 ea2384d3 bellard
    uint64_t l2_cache_offsets[L2_CACHE_SIZE];
68 ea2384d3 bellard
    uint32_t l2_cache_counts[L2_CACHE_SIZE];
69 ea2384d3 bellard
    uint8_t *cluster_cache;
70 ea2384d3 bellard
    uint8_t *cluster_data;
71 ea2384d3 bellard
    uint64_t cluster_cache_offset;
72 ea2384d3 bellard
    uint32_t crypt_method; /* current crypt method, 0 if no key yet */
73 ea2384d3 bellard
    uint32_t crypt_method_header;
74 ea2384d3 bellard
    AES_KEY aes_encrypt_key;
75 ea2384d3 bellard
    AES_KEY aes_decrypt_key;
76 ea2384d3 bellard
} BDRVQcowState;
77 ea2384d3 bellard
78 ea2384d3 bellard
static int decompress_cluster(BDRVQcowState *s, uint64_t cluster_offset);
79 ea2384d3 bellard
80 ea2384d3 bellard
static int qcow_probe(const uint8_t *buf, int buf_size, const char *filename)
81 ea2384d3 bellard
{
82 ea2384d3 bellard
    const QCowHeader *cow_header = (const void *)buf;
83 ea2384d3 bellard
84 ea2384d3 bellard
    if (be32_to_cpu(cow_header->magic) == QCOW_MAGIC &&
85 ea2384d3 bellard
        be32_to_cpu(cow_header->version) == QCOW_VERSION) 
86 ea2384d3 bellard
        return 100;
87 ea2384d3 bellard
    else
88 ea2384d3 bellard
        return 0;
89 ea2384d3 bellard
}
90 ea2384d3 bellard
91 ea2384d3 bellard
static int qcow_open(BlockDriverState *bs, const char *filename)
92 ea2384d3 bellard
{
93 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
94 ea2384d3 bellard
    int fd, len, i, shift;
95 ea2384d3 bellard
    QCowHeader header;
96 ea2384d3 bellard
    
97 ea2384d3 bellard
    fd = open(filename, O_RDWR | O_BINARY | O_LARGEFILE);
98 ea2384d3 bellard
    if (fd < 0) {
99 ea2384d3 bellard
        fd = open(filename, O_RDONLY | O_BINARY | O_LARGEFILE);
100 ea2384d3 bellard
        if (fd < 0)
101 ea2384d3 bellard
            return -1;
102 ea2384d3 bellard
    }
103 ea2384d3 bellard
    s->fd = fd;
104 ea2384d3 bellard
    if (read(fd, &header, sizeof(header)) != sizeof(header))
105 ea2384d3 bellard
        goto fail;
106 ea2384d3 bellard
    be32_to_cpus(&header.magic);
107 ea2384d3 bellard
    be32_to_cpus(&header.version);
108 ea2384d3 bellard
    be64_to_cpus(&header.backing_file_offset);
109 ea2384d3 bellard
    be32_to_cpus(&header.backing_file_size);
110 ea2384d3 bellard
    be32_to_cpus(&header.mtime);
111 ea2384d3 bellard
    be64_to_cpus(&header.size);
112 ea2384d3 bellard
    be32_to_cpus(&header.crypt_method);
113 ea2384d3 bellard
    be64_to_cpus(&header.l1_table_offset);
114 ea2384d3 bellard
    
115 ea2384d3 bellard
    if (header.magic != QCOW_MAGIC || header.version != QCOW_VERSION)
116 ea2384d3 bellard
        goto fail;
117 ea2384d3 bellard
    if (header.size <= 1 || header.cluster_bits < 9)
118 ea2384d3 bellard
        goto fail;
119 ea2384d3 bellard
    if (header.crypt_method > QCOW_CRYPT_AES)
120 ea2384d3 bellard
        goto fail;
121 ea2384d3 bellard
    s->crypt_method_header = header.crypt_method;
122 ea2384d3 bellard
    if (s->crypt_method_header)
123 ea2384d3 bellard
        bs->encrypted = 1;
124 ea2384d3 bellard
    s->cluster_bits = header.cluster_bits;
125 ea2384d3 bellard
    s->cluster_size = 1 << s->cluster_bits;
126 ea2384d3 bellard
    s->cluster_sectors = 1 << (s->cluster_bits - 9);
127 ea2384d3 bellard
    s->l2_bits = header.l2_bits;
128 ea2384d3 bellard
    s->l2_size = 1 << s->l2_bits;
129 ea2384d3 bellard
    bs->total_sectors = header.size / 512;
130 ea2384d3 bellard
    s->cluster_offset_mask = (1LL << (63 - s->cluster_bits)) - 1;
131 ea2384d3 bellard
132 ea2384d3 bellard
    /* read the level 1 table */
133 ea2384d3 bellard
    shift = s->cluster_bits + s->l2_bits;
134 ea2384d3 bellard
    s->l1_size = (header.size + (1LL << shift) - 1) >> shift;
135 ea2384d3 bellard
136 ea2384d3 bellard
    s->l1_table_offset = header.l1_table_offset;
137 ea2384d3 bellard
    s->l1_table = qemu_malloc(s->l1_size * sizeof(uint64_t));
138 ea2384d3 bellard
    if (!s->l1_table)
139 ea2384d3 bellard
        goto fail;
140 d5249393 bellard
    lseek(fd, s->l1_table_offset, SEEK_SET);
141 ea2384d3 bellard
    if (read(fd, s->l1_table, s->l1_size * sizeof(uint64_t)) != 
142 ea2384d3 bellard
        s->l1_size * sizeof(uint64_t))
143 ea2384d3 bellard
        goto fail;
144 ea2384d3 bellard
    for(i = 0;i < s->l1_size; i++) {
145 ea2384d3 bellard
        be64_to_cpus(&s->l1_table[i]);
146 ea2384d3 bellard
    }
147 ea2384d3 bellard
    /* alloc L2 cache */
148 ea2384d3 bellard
    s->l2_cache = qemu_malloc(s->l2_size * L2_CACHE_SIZE * sizeof(uint64_t));
149 ea2384d3 bellard
    if (!s->l2_cache)
150 ea2384d3 bellard
        goto fail;
151 ea2384d3 bellard
    s->cluster_cache = qemu_malloc(s->cluster_size);
152 ea2384d3 bellard
    if (!s->cluster_cache)
153 ea2384d3 bellard
        goto fail;
154 ea2384d3 bellard
    s->cluster_data = qemu_malloc(s->cluster_size);
155 ea2384d3 bellard
    if (!s->cluster_data)
156 ea2384d3 bellard
        goto fail;
157 ea2384d3 bellard
    s->cluster_cache_offset = -1;
158 ea2384d3 bellard
    
159 ea2384d3 bellard
    /* read the backing file name */
160 ea2384d3 bellard
    if (header.backing_file_offset != 0) {
161 ea2384d3 bellard
        len = header.backing_file_size;
162 ea2384d3 bellard
        if (len > 1023)
163 ea2384d3 bellard
            len = 1023;
164 d5249393 bellard
        lseek(fd, header.backing_file_offset, SEEK_SET);
165 ea2384d3 bellard
        if (read(fd, bs->backing_file, len) != len)
166 ea2384d3 bellard
            goto fail;
167 ea2384d3 bellard
        bs->backing_file[len] = '\0';
168 ea2384d3 bellard
    }
169 ea2384d3 bellard
    return 0;
170 ea2384d3 bellard
171 ea2384d3 bellard
 fail:
172 ea2384d3 bellard
    qemu_free(s->l1_table);
173 ea2384d3 bellard
    qemu_free(s->l2_cache);
174 ea2384d3 bellard
    qemu_free(s->cluster_cache);
175 ea2384d3 bellard
    qemu_free(s->cluster_data);
176 ea2384d3 bellard
    close(fd);
177 ea2384d3 bellard
    return -1;
178 ea2384d3 bellard
}
179 ea2384d3 bellard
180 ea2384d3 bellard
static int qcow_set_key(BlockDriverState *bs, const char *key)
181 ea2384d3 bellard
{
182 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
183 ea2384d3 bellard
    uint8_t keybuf[16];
184 ea2384d3 bellard
    int len, i;
185 ea2384d3 bellard
    
186 ea2384d3 bellard
    memset(keybuf, 0, 16);
187 ea2384d3 bellard
    len = strlen(key);
188 ea2384d3 bellard
    if (len > 16)
189 ea2384d3 bellard
        len = 16;
190 ea2384d3 bellard
    /* XXX: we could compress the chars to 7 bits to increase
191 ea2384d3 bellard
       entropy */
192 ea2384d3 bellard
    for(i = 0;i < len;i++) {
193 ea2384d3 bellard
        keybuf[i] = key[i];
194 ea2384d3 bellard
    }
195 ea2384d3 bellard
    s->crypt_method = s->crypt_method_header;
196 ea2384d3 bellard
197 ea2384d3 bellard
    if (AES_set_encrypt_key(keybuf, 128, &s->aes_encrypt_key) != 0)
198 ea2384d3 bellard
        return -1;
199 ea2384d3 bellard
    if (AES_set_decrypt_key(keybuf, 128, &s->aes_decrypt_key) != 0)
200 ea2384d3 bellard
        return -1;
201 ea2384d3 bellard
#if 0
202 ea2384d3 bellard
    /* test */
203 ea2384d3 bellard
    {
204 ea2384d3 bellard
        uint8_t in[16];
205 ea2384d3 bellard
        uint8_t out[16];
206 ea2384d3 bellard
        uint8_t tmp[16];
207 ea2384d3 bellard
        for(i=0;i<16;i++)
208 ea2384d3 bellard
            in[i] = i;
209 ea2384d3 bellard
        AES_encrypt(in, tmp, &s->aes_encrypt_key);
210 ea2384d3 bellard
        AES_decrypt(tmp, out, &s->aes_decrypt_key);
211 ea2384d3 bellard
        for(i = 0; i < 16; i++)
212 ea2384d3 bellard
            printf(" %02x", tmp[i]);
213 ea2384d3 bellard
        printf("\n");
214 ea2384d3 bellard
        for(i = 0; i < 16; i++)
215 ea2384d3 bellard
            printf(" %02x", out[i]);
216 ea2384d3 bellard
        printf("\n");
217 ea2384d3 bellard
    }
218 ea2384d3 bellard
#endif
219 ea2384d3 bellard
    return 0;
220 ea2384d3 bellard
}
221 ea2384d3 bellard
222 ea2384d3 bellard
/* The crypt function is compatible with the linux cryptoloop
223 ea2384d3 bellard
   algorithm for < 4 GB images. NOTE: out_buf == in_buf is
224 ea2384d3 bellard
   supported */
225 ea2384d3 bellard
static void encrypt_sectors(BDRVQcowState *s, int64_t sector_num,
226 ea2384d3 bellard
                            uint8_t *out_buf, const uint8_t *in_buf,
227 ea2384d3 bellard
                            int nb_sectors, int enc,
228 ea2384d3 bellard
                            const AES_KEY *key)
229 ea2384d3 bellard
{
230 ea2384d3 bellard
    union {
231 ea2384d3 bellard
        uint64_t ll[2];
232 ea2384d3 bellard
        uint8_t b[16];
233 ea2384d3 bellard
    } ivec;
234 ea2384d3 bellard
    int i;
235 ea2384d3 bellard
236 ea2384d3 bellard
    for(i = 0; i < nb_sectors; i++) {
237 ea2384d3 bellard
        ivec.ll[0] = cpu_to_le64(sector_num);
238 ea2384d3 bellard
        ivec.ll[1] = 0;
239 ea2384d3 bellard
        AES_cbc_encrypt(in_buf, out_buf, 512, key, 
240 ea2384d3 bellard
                        ivec.b, enc);
241 ea2384d3 bellard
        sector_num++;
242 ea2384d3 bellard
        in_buf += 512;
243 ea2384d3 bellard
        out_buf += 512;
244 ea2384d3 bellard
    }
245 ea2384d3 bellard
}
246 ea2384d3 bellard
247 ea2384d3 bellard
/* 'allocate' is:
248 ea2384d3 bellard
 *
249 ea2384d3 bellard
 * 0 to not allocate.
250 ea2384d3 bellard
 *
251 ea2384d3 bellard
 * 1 to allocate a normal cluster (for sector indexes 'n_start' to
252 ea2384d3 bellard
 * 'n_end')
253 ea2384d3 bellard
 *
254 ea2384d3 bellard
 * 2 to allocate a compressed cluster of size
255 ea2384d3 bellard
 * 'compressed_size'. 'compressed_size' must be > 0 and <
256 ea2384d3 bellard
 * cluster_size 
257 ea2384d3 bellard
 *
258 ea2384d3 bellard
 * return 0 if not allocated.
259 ea2384d3 bellard
 */
260 ea2384d3 bellard
static uint64_t get_cluster_offset(BlockDriverState *bs,
261 ea2384d3 bellard
                                   uint64_t offset, int allocate,
262 ea2384d3 bellard
                                   int compressed_size,
263 ea2384d3 bellard
                                   int n_start, int n_end)
264 ea2384d3 bellard
{
265 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
266 ea2384d3 bellard
    int min_index, i, j, l1_index, l2_index;
267 ea2384d3 bellard
    uint64_t l2_offset, *l2_table, cluster_offset, tmp;
268 ea2384d3 bellard
    uint32_t min_count;
269 ea2384d3 bellard
    int new_l2_table;
270 ea2384d3 bellard
    
271 ea2384d3 bellard
    l1_index = offset >> (s->l2_bits + s->cluster_bits);
272 ea2384d3 bellard
    l2_offset = s->l1_table[l1_index];
273 ea2384d3 bellard
    new_l2_table = 0;
274 ea2384d3 bellard
    if (!l2_offset) {
275 ea2384d3 bellard
        if (!allocate)
276 ea2384d3 bellard
            return 0;
277 ea2384d3 bellard
        /* allocate a new l2 entry */
278 d5249393 bellard
        l2_offset = lseek(s->fd, 0, SEEK_END);
279 ea2384d3 bellard
        /* round to cluster size */
280 ea2384d3 bellard
        l2_offset = (l2_offset + s->cluster_size - 1) & ~(s->cluster_size - 1);
281 ea2384d3 bellard
        /* update the L1 entry */
282 ea2384d3 bellard
        s->l1_table[l1_index] = l2_offset;
283 ea2384d3 bellard
        tmp = cpu_to_be64(l2_offset);
284 d5249393 bellard
        lseek(s->fd, s->l1_table_offset + l1_index * sizeof(tmp), SEEK_SET);
285 ea2384d3 bellard
        if (write(s->fd, &tmp, sizeof(tmp)) != sizeof(tmp))
286 ea2384d3 bellard
            return 0;
287 ea2384d3 bellard
        new_l2_table = 1;
288 ea2384d3 bellard
    }
289 ea2384d3 bellard
    for(i = 0; i < L2_CACHE_SIZE; i++) {
290 ea2384d3 bellard
        if (l2_offset == s->l2_cache_offsets[i]) {
291 ea2384d3 bellard
            /* increment the hit count */
292 ea2384d3 bellard
            if (++s->l2_cache_counts[i] == 0xffffffff) {
293 ea2384d3 bellard
                for(j = 0; j < L2_CACHE_SIZE; j++) {
294 ea2384d3 bellard
                    s->l2_cache_counts[j] >>= 1;
295 ea2384d3 bellard
                }
296 ea2384d3 bellard
            }
297 ea2384d3 bellard
            l2_table = s->l2_cache + (i << s->l2_bits);
298 ea2384d3 bellard
            goto found;
299 ea2384d3 bellard
        }
300 ea2384d3 bellard
    }
301 ea2384d3 bellard
    /* not found: load a new entry in the least used one */
302 ea2384d3 bellard
    min_index = 0;
303 ea2384d3 bellard
    min_count = 0xffffffff;
304 ea2384d3 bellard
    for(i = 0; i < L2_CACHE_SIZE; i++) {
305 ea2384d3 bellard
        if (s->l2_cache_counts[i] < min_count) {
306 ea2384d3 bellard
            min_count = s->l2_cache_counts[i];
307 ea2384d3 bellard
            min_index = i;
308 ea2384d3 bellard
        }
309 ea2384d3 bellard
    }
310 ea2384d3 bellard
    l2_table = s->l2_cache + (min_index << s->l2_bits);
311 ea2384d3 bellard
    lseek(s->fd, l2_offset, SEEK_SET);
312 ea2384d3 bellard
    if (new_l2_table) {
313 ea2384d3 bellard
        memset(l2_table, 0, s->l2_size * sizeof(uint64_t));
314 ea2384d3 bellard
        if (write(s->fd, l2_table, s->l2_size * sizeof(uint64_t)) !=
315 ea2384d3 bellard
            s->l2_size * sizeof(uint64_t))
316 ea2384d3 bellard
            return 0;
317 ea2384d3 bellard
    } else {
318 ea2384d3 bellard
        if (read(s->fd, l2_table, s->l2_size * sizeof(uint64_t)) != 
319 ea2384d3 bellard
            s->l2_size * sizeof(uint64_t))
320 ea2384d3 bellard
            return 0;
321 ea2384d3 bellard
    }
322 ea2384d3 bellard
    s->l2_cache_offsets[min_index] = l2_offset;
323 ea2384d3 bellard
    s->l2_cache_counts[min_index] = 1;
324 ea2384d3 bellard
 found:
325 ea2384d3 bellard
    l2_index = (offset >> s->cluster_bits) & (s->l2_size - 1);
326 ea2384d3 bellard
    cluster_offset = be64_to_cpu(l2_table[l2_index]);
327 ea2384d3 bellard
    if (!cluster_offset || 
328 ea2384d3 bellard
        ((cluster_offset & QCOW_OFLAG_COMPRESSED) && allocate == 1)) {
329 ea2384d3 bellard
        if (!allocate)
330 ea2384d3 bellard
            return 0;
331 ea2384d3 bellard
        /* allocate a new cluster */
332 ea2384d3 bellard
        if ((cluster_offset & QCOW_OFLAG_COMPRESSED) &&
333 ea2384d3 bellard
            (n_end - n_start) < s->cluster_sectors) {
334 ea2384d3 bellard
            /* if the cluster is already compressed, we must
335 ea2384d3 bellard
               decompress it in the case it is not completely
336 ea2384d3 bellard
               overwritten */
337 ea2384d3 bellard
            if (decompress_cluster(s, cluster_offset) < 0)
338 ea2384d3 bellard
                return 0;
339 d5249393 bellard
            cluster_offset = lseek(s->fd, 0, SEEK_END);
340 ea2384d3 bellard
            cluster_offset = (cluster_offset + s->cluster_size - 1) & 
341 ea2384d3 bellard
                ~(s->cluster_size - 1);
342 ea2384d3 bellard
            /* write the cluster content */
343 d5249393 bellard
            lseek(s->fd, cluster_offset, SEEK_SET);
344 ea2384d3 bellard
            if (write(s->fd, s->cluster_cache, s->cluster_size) != 
345 ea2384d3 bellard
                s->cluster_size)
346 ea2384d3 bellard
                return -1;
347 ea2384d3 bellard
        } else {
348 d5249393 bellard
            cluster_offset = lseek(s->fd, 0, SEEK_END);
349 ea2384d3 bellard
            if (allocate == 1) {
350 ea2384d3 bellard
                /* round to cluster size */
351 ea2384d3 bellard
                cluster_offset = (cluster_offset + s->cluster_size - 1) & 
352 ea2384d3 bellard
                    ~(s->cluster_size - 1);
353 ea2384d3 bellard
                ftruncate(s->fd, cluster_offset + s->cluster_size);
354 ea2384d3 bellard
                /* if encrypted, we must initialize the cluster
355 ea2384d3 bellard
                   content which won't be written */
356 ea2384d3 bellard
                if (s->crypt_method && 
357 ea2384d3 bellard
                    (n_end - n_start) < s->cluster_sectors) {
358 ea2384d3 bellard
                    uint64_t start_sect;
359 ea2384d3 bellard
                    start_sect = (offset & ~(s->cluster_size - 1)) >> 9;
360 ea2384d3 bellard
                    memset(s->cluster_data + 512, 0xaa, 512);
361 ea2384d3 bellard
                    for(i = 0; i < s->cluster_sectors; i++) {
362 ea2384d3 bellard
                        if (i < n_start || i >= n_end) {
363 ea2384d3 bellard
                            encrypt_sectors(s, start_sect + i, 
364 ea2384d3 bellard
                                            s->cluster_data, 
365 ea2384d3 bellard
                                            s->cluster_data + 512, 1, 1,
366 ea2384d3 bellard
                                            &s->aes_encrypt_key);
367 d5249393 bellard
                            lseek(s->fd, cluster_offset + i * 512, SEEK_SET);
368 ea2384d3 bellard
                            if (write(s->fd, s->cluster_data, 512) != 512)
369 ea2384d3 bellard
                                return -1;
370 ea2384d3 bellard
                        }
371 ea2384d3 bellard
                    }
372 ea2384d3 bellard
                }
373 ea2384d3 bellard
            } else {
374 ea2384d3 bellard
                cluster_offset |= QCOW_OFLAG_COMPRESSED | 
375 ea2384d3 bellard
                    (uint64_t)compressed_size << (63 - s->cluster_bits);
376 ea2384d3 bellard
            }
377 ea2384d3 bellard
        }
378 ea2384d3 bellard
        /* update L2 table */
379 ea2384d3 bellard
        tmp = cpu_to_be64(cluster_offset);
380 ea2384d3 bellard
        l2_table[l2_index] = tmp;
381 d5249393 bellard
        lseek(s->fd, l2_offset + l2_index * sizeof(tmp), SEEK_SET);
382 ea2384d3 bellard
        if (write(s->fd, &tmp, sizeof(tmp)) != sizeof(tmp))
383 ea2384d3 bellard
            return 0;
384 ea2384d3 bellard
    }
385 ea2384d3 bellard
    return cluster_offset;
386 ea2384d3 bellard
}
387 ea2384d3 bellard
388 ea2384d3 bellard
static int qcow_is_allocated(BlockDriverState *bs, int64_t sector_num, 
389 ea2384d3 bellard
                             int nb_sectors, int *pnum)
390 ea2384d3 bellard
{
391 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
392 ea2384d3 bellard
    int index_in_cluster, n;
393 ea2384d3 bellard
    uint64_t cluster_offset;
394 ea2384d3 bellard
395 ea2384d3 bellard
    cluster_offset = get_cluster_offset(bs, sector_num << 9, 0, 0, 0, 0);
396 ea2384d3 bellard
    index_in_cluster = sector_num & (s->cluster_sectors - 1);
397 ea2384d3 bellard
    n = s->cluster_sectors - index_in_cluster;
398 ea2384d3 bellard
    if (n > nb_sectors)
399 ea2384d3 bellard
        n = nb_sectors;
400 ea2384d3 bellard
    *pnum = n;
401 ea2384d3 bellard
    return (cluster_offset != 0);
402 ea2384d3 bellard
}
403 ea2384d3 bellard
404 ea2384d3 bellard
static int decompress_buffer(uint8_t *out_buf, int out_buf_size,
405 ea2384d3 bellard
                             const uint8_t *buf, int buf_size)
406 ea2384d3 bellard
{
407 ea2384d3 bellard
    z_stream strm1, *strm = &strm1;
408 ea2384d3 bellard
    int ret, out_len;
409 ea2384d3 bellard
410 ea2384d3 bellard
    memset(strm, 0, sizeof(*strm));
411 ea2384d3 bellard
412 ea2384d3 bellard
    strm->next_in = (uint8_t *)buf;
413 ea2384d3 bellard
    strm->avail_in = buf_size;
414 ea2384d3 bellard
    strm->next_out = out_buf;
415 ea2384d3 bellard
    strm->avail_out = out_buf_size;
416 ea2384d3 bellard
417 ea2384d3 bellard
    ret = inflateInit2(strm, -12);
418 ea2384d3 bellard
    if (ret != Z_OK)
419 ea2384d3 bellard
        return -1;
420 ea2384d3 bellard
    ret = inflate(strm, Z_FINISH);
421 ea2384d3 bellard
    out_len = strm->next_out - out_buf;
422 ea2384d3 bellard
    if ((ret != Z_STREAM_END && ret != Z_BUF_ERROR) ||
423 ea2384d3 bellard
        out_len != out_buf_size) {
424 ea2384d3 bellard
        inflateEnd(strm);
425 ea2384d3 bellard
        return -1;
426 ea2384d3 bellard
    }
427 ea2384d3 bellard
    inflateEnd(strm);
428 ea2384d3 bellard
    return 0;
429 ea2384d3 bellard
}
430 ea2384d3 bellard
                              
431 ea2384d3 bellard
static int decompress_cluster(BDRVQcowState *s, uint64_t cluster_offset)
432 ea2384d3 bellard
{
433 ea2384d3 bellard
    int ret, csize;
434 ea2384d3 bellard
    uint64_t coffset;
435 ea2384d3 bellard
436 ea2384d3 bellard
    coffset = cluster_offset & s->cluster_offset_mask;
437 ea2384d3 bellard
    if (s->cluster_cache_offset != coffset) {
438 ea2384d3 bellard
        csize = cluster_offset >> (63 - s->cluster_bits);
439 ea2384d3 bellard
        csize &= (s->cluster_size - 1);
440 d5249393 bellard
        lseek(s->fd, coffset, SEEK_SET);
441 ea2384d3 bellard
        ret = read(s->fd, s->cluster_data, csize);
442 ea2384d3 bellard
        if (ret != csize) 
443 ea2384d3 bellard
            return -1;
444 ea2384d3 bellard
        if (decompress_buffer(s->cluster_cache, s->cluster_size,
445 ea2384d3 bellard
                              s->cluster_data, csize) < 0) {
446 ea2384d3 bellard
            return -1;
447 ea2384d3 bellard
        }
448 ea2384d3 bellard
        s->cluster_cache_offset = coffset;
449 ea2384d3 bellard
    }
450 ea2384d3 bellard
    return 0;
451 ea2384d3 bellard
}
452 ea2384d3 bellard
453 ea2384d3 bellard
static int qcow_read(BlockDriverState *bs, int64_t sector_num, 
454 ea2384d3 bellard
                     uint8_t *buf, int nb_sectors)
455 ea2384d3 bellard
{
456 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
457 ea2384d3 bellard
    int ret, index_in_cluster, n;
458 ea2384d3 bellard
    uint64_t cluster_offset;
459 ea2384d3 bellard
    
460 ea2384d3 bellard
    while (nb_sectors > 0) {
461 ea2384d3 bellard
        cluster_offset = get_cluster_offset(bs, sector_num << 9, 0, 0, 0, 0);
462 ea2384d3 bellard
        index_in_cluster = sector_num & (s->cluster_sectors - 1);
463 ea2384d3 bellard
        n = s->cluster_sectors - index_in_cluster;
464 ea2384d3 bellard
        if (n > nb_sectors)
465 ea2384d3 bellard
            n = nb_sectors;
466 ea2384d3 bellard
        if (!cluster_offset) {
467 ea2384d3 bellard
            memset(buf, 0, 512 * n);
468 ea2384d3 bellard
        } else if (cluster_offset & QCOW_OFLAG_COMPRESSED) {
469 ea2384d3 bellard
            if (decompress_cluster(s, cluster_offset) < 0)
470 ea2384d3 bellard
                return -1;
471 ea2384d3 bellard
            memcpy(buf, s->cluster_cache + index_in_cluster * 512, 512 * n);
472 ea2384d3 bellard
        } else {
473 d5249393 bellard
            lseek(s->fd, cluster_offset + index_in_cluster * 512, SEEK_SET);
474 ea2384d3 bellard
            ret = read(s->fd, buf, n * 512);
475 ea2384d3 bellard
            if (ret != n * 512) 
476 ea2384d3 bellard
                return -1;
477 ea2384d3 bellard
            if (s->crypt_method) {
478 ea2384d3 bellard
                encrypt_sectors(s, sector_num, buf, buf, n, 0, 
479 ea2384d3 bellard
                                &s->aes_decrypt_key);
480 ea2384d3 bellard
            }
481 ea2384d3 bellard
        }
482 ea2384d3 bellard
        nb_sectors -= n;
483 ea2384d3 bellard
        sector_num += n;
484 ea2384d3 bellard
        buf += n * 512;
485 ea2384d3 bellard
    }
486 ea2384d3 bellard
    return 0;
487 ea2384d3 bellard
}
488 ea2384d3 bellard
489 ea2384d3 bellard
static int qcow_write(BlockDriverState *bs, int64_t sector_num, 
490 ea2384d3 bellard
                     const uint8_t *buf, int nb_sectors)
491 ea2384d3 bellard
{
492 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
493 ea2384d3 bellard
    int ret, index_in_cluster, n;
494 ea2384d3 bellard
    uint64_t cluster_offset;
495 ea2384d3 bellard
    
496 ea2384d3 bellard
    while (nb_sectors > 0) {
497 ea2384d3 bellard
        index_in_cluster = sector_num & (s->cluster_sectors - 1);
498 ea2384d3 bellard
        n = s->cluster_sectors - index_in_cluster;
499 ea2384d3 bellard
        if (n > nb_sectors)
500 ea2384d3 bellard
            n = nb_sectors;
501 ea2384d3 bellard
        cluster_offset = get_cluster_offset(bs, sector_num << 9, 1, 0, 
502 ea2384d3 bellard
                                            index_in_cluster, 
503 ea2384d3 bellard
                                            index_in_cluster + n);
504 ea2384d3 bellard
        if (!cluster_offset)
505 ea2384d3 bellard
            return -1;
506 d5249393 bellard
        lseek(s->fd, cluster_offset + index_in_cluster * 512, SEEK_SET);
507 ea2384d3 bellard
        if (s->crypt_method) {
508 ea2384d3 bellard
            encrypt_sectors(s, sector_num, s->cluster_data, buf, n, 1,
509 ea2384d3 bellard
                            &s->aes_encrypt_key);
510 ea2384d3 bellard
            ret = write(s->fd, s->cluster_data, n * 512);
511 ea2384d3 bellard
        } else {
512 ea2384d3 bellard
            ret = write(s->fd, buf, n * 512);
513 ea2384d3 bellard
        }
514 ea2384d3 bellard
        if (ret != n * 512) 
515 ea2384d3 bellard
            return -1;
516 ea2384d3 bellard
        nb_sectors -= n;
517 ea2384d3 bellard
        sector_num += n;
518 ea2384d3 bellard
        buf += n * 512;
519 ea2384d3 bellard
    }
520 ea2384d3 bellard
    s->cluster_cache_offset = -1; /* disable compressed cache */
521 ea2384d3 bellard
    return 0;
522 ea2384d3 bellard
}
523 ea2384d3 bellard
524 e2731add bellard
static void qcow_close(BlockDriverState *bs)
525 ea2384d3 bellard
{
526 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
527 ea2384d3 bellard
    qemu_free(s->l1_table);
528 ea2384d3 bellard
    qemu_free(s->l2_cache);
529 ea2384d3 bellard
    qemu_free(s->cluster_cache);
530 ea2384d3 bellard
    qemu_free(s->cluster_data);
531 ea2384d3 bellard
    close(s->fd);
532 ea2384d3 bellard
}
533 ea2384d3 bellard
534 ea2384d3 bellard
static int qcow_create(const char *filename, int64_t total_size,
535 ea2384d3 bellard
                      const char *backing_file, int flags)
536 ea2384d3 bellard
{
537 ea2384d3 bellard
    int fd, header_size, backing_filename_len, l1_size, i, shift;
538 ea2384d3 bellard
    QCowHeader header;
539 ea2384d3 bellard
    char backing_filename[1024];
540 ea2384d3 bellard
    uint64_t tmp;
541 ea2384d3 bellard
    struct stat st;
542 ea2384d3 bellard
543 ea2384d3 bellard
    fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY | O_LARGEFILE, 
544 ea2384d3 bellard
              0644);
545 ea2384d3 bellard
    if (fd < 0)
546 ea2384d3 bellard
        return -1;
547 ea2384d3 bellard
    memset(&header, 0, sizeof(header));
548 ea2384d3 bellard
    header.magic = cpu_to_be32(QCOW_MAGIC);
549 ea2384d3 bellard
    header.version = cpu_to_be32(QCOW_VERSION);
550 ea2384d3 bellard
    header.size = cpu_to_be64(total_size * 512);
551 ea2384d3 bellard
    header_size = sizeof(header);
552 ea2384d3 bellard
    backing_filename_len = 0;
553 ea2384d3 bellard
    if (backing_file) {
554 ea2384d3 bellard
        realpath(backing_file, backing_filename);
555 ea2384d3 bellard
        if (stat(backing_filename, &st) != 0) {
556 ea2384d3 bellard
            return -1;
557 ea2384d3 bellard
        }
558 ea2384d3 bellard
        header.mtime = cpu_to_be32(st.st_mtime);
559 ea2384d3 bellard
        header.backing_file_offset = cpu_to_be64(header_size);
560 ea2384d3 bellard
        backing_filename_len = strlen(backing_filename);
561 ea2384d3 bellard
        header.backing_file_size = cpu_to_be32(backing_filename_len);
562 ea2384d3 bellard
        header_size += backing_filename_len;
563 ea2384d3 bellard
        header.cluster_bits = 9; /* 512 byte cluster to avoid copying
564 ea2384d3 bellard
                                    unmodifyed sectors */
565 ea2384d3 bellard
        header.l2_bits = 12; /* 32 KB L2 tables */
566 ea2384d3 bellard
    } else {
567 ea2384d3 bellard
        header.cluster_bits = 12; /* 4 KB clusters */
568 ea2384d3 bellard
        header.l2_bits = 9; /* 4 KB L2 tables */
569 ea2384d3 bellard
    }
570 ea2384d3 bellard
    header_size = (header_size + 7) & ~7;
571 ea2384d3 bellard
    shift = header.cluster_bits + header.l2_bits;
572 ea2384d3 bellard
    l1_size = ((total_size * 512) + (1LL << shift) - 1) >> shift;
573 ea2384d3 bellard
574 ea2384d3 bellard
    header.l1_table_offset = cpu_to_be64(header_size);
575 ea2384d3 bellard
    if (flags) {
576 ea2384d3 bellard
        header.crypt_method = cpu_to_be32(QCOW_CRYPT_AES);
577 ea2384d3 bellard
    } else {
578 ea2384d3 bellard
        header.crypt_method = cpu_to_be32(QCOW_CRYPT_NONE);
579 ea2384d3 bellard
    }
580 ea2384d3 bellard
    
581 ea2384d3 bellard
    /* write all the data */
582 ea2384d3 bellard
    write(fd, &header, sizeof(header));
583 ea2384d3 bellard
    if (backing_file) {
584 ea2384d3 bellard
        write(fd, backing_filename, backing_filename_len);
585 ea2384d3 bellard
    }
586 ea2384d3 bellard
    lseek(fd, header_size, SEEK_SET);
587 ea2384d3 bellard
    tmp = 0;
588 ea2384d3 bellard
    for(i = 0;i < l1_size; i++) {
589 ea2384d3 bellard
        write(fd, &tmp, sizeof(tmp));
590 ea2384d3 bellard
    }
591 ea2384d3 bellard
    close(fd);
592 ea2384d3 bellard
    return 0;
593 ea2384d3 bellard
}
594 ea2384d3 bellard
595 ea2384d3 bellard
int qcow_get_cluster_size(BlockDriverState *bs)
596 ea2384d3 bellard
{
597 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
598 ea2384d3 bellard
    if (bs->drv != &bdrv_qcow)
599 ea2384d3 bellard
        return -1;
600 ea2384d3 bellard
    return s->cluster_size;
601 ea2384d3 bellard
}
602 ea2384d3 bellard
603 ea2384d3 bellard
/* XXX: put compressed sectors first, then all the cluster aligned
604 ea2384d3 bellard
   tables to avoid losing bytes in alignment */
605 ea2384d3 bellard
int qcow_compress_cluster(BlockDriverState *bs, int64_t sector_num, 
606 ea2384d3 bellard
                          const uint8_t *buf)
607 ea2384d3 bellard
{
608 ea2384d3 bellard
    BDRVQcowState *s = bs->opaque;
609 ea2384d3 bellard
    z_stream strm;
610 ea2384d3 bellard
    int ret, out_len;
611 ea2384d3 bellard
    uint8_t *out_buf;
612 ea2384d3 bellard
    uint64_t cluster_offset;
613 ea2384d3 bellard
614 ea2384d3 bellard
    if (bs->drv != &bdrv_qcow)
615 ea2384d3 bellard
        return -1;
616 ea2384d3 bellard
617 ea2384d3 bellard
    out_buf = qemu_malloc(s->cluster_size + (s->cluster_size / 1000) + 128);
618 ea2384d3 bellard
    if (!out_buf)
619 ea2384d3 bellard
        return -1;
620 ea2384d3 bellard
621 ea2384d3 bellard
    /* best compression, small window, no zlib header */
622 ea2384d3 bellard
    memset(&strm, 0, sizeof(strm));
623 ea2384d3 bellard
    ret = deflateInit2(&strm, Z_DEFAULT_COMPRESSION,
624 ea2384d3 bellard
                       Z_DEFLATED, -12, 
625 ea2384d3 bellard
                       9, Z_DEFAULT_STRATEGY);
626 ea2384d3 bellard
    if (ret != 0) {
627 ea2384d3 bellard
        qemu_free(out_buf);
628 ea2384d3 bellard
        return -1;
629 ea2384d3 bellard
    }
630 ea2384d3 bellard
631 ea2384d3 bellard
    strm.avail_in = s->cluster_size;
632 ea2384d3 bellard
    strm.next_in = (uint8_t *)buf;
633 ea2384d3 bellard
    strm.avail_out = s->cluster_size;
634 ea2384d3 bellard
    strm.next_out = out_buf;
635 ea2384d3 bellard
636 ea2384d3 bellard
    ret = deflate(&strm, Z_FINISH);
637 ea2384d3 bellard
    if (ret != Z_STREAM_END && ret != Z_OK) {
638 ea2384d3 bellard
        qemu_free(out_buf);
639 ea2384d3 bellard
        deflateEnd(&strm);
640 ea2384d3 bellard
        return -1;
641 ea2384d3 bellard
    }
642 ea2384d3 bellard
    out_len = strm.next_out - out_buf;
643 ea2384d3 bellard
644 ea2384d3 bellard
    deflateEnd(&strm);
645 ea2384d3 bellard
646 ea2384d3 bellard
    if (ret != Z_STREAM_END || out_len >= s->cluster_size) {
647 ea2384d3 bellard
        /* could not compress: write normal cluster */
648 ea2384d3 bellard
        qcow_write(bs, sector_num, buf, s->cluster_sectors);
649 ea2384d3 bellard
    } else {
650 ea2384d3 bellard
        cluster_offset = get_cluster_offset(bs, sector_num << 9, 2, 
651 ea2384d3 bellard
                                            out_len, 0, 0);
652 ea2384d3 bellard
        cluster_offset &= s->cluster_offset_mask;
653 d5249393 bellard
        lseek(s->fd, cluster_offset, SEEK_SET);
654 ea2384d3 bellard
        if (write(s->fd, out_buf, out_len) != out_len) {
655 ea2384d3 bellard
            qemu_free(out_buf);
656 ea2384d3 bellard
            return -1;
657 ea2384d3 bellard
        }
658 ea2384d3 bellard
    }
659 ea2384d3 bellard
    
660 ea2384d3 bellard
    qemu_free(out_buf);
661 ea2384d3 bellard
    return 0;
662 ea2384d3 bellard
}
663 ea2384d3 bellard
664 ea2384d3 bellard
BlockDriver bdrv_qcow = {
665 ea2384d3 bellard
    "qcow",
666 ea2384d3 bellard
    sizeof(BDRVQcowState),
667 ea2384d3 bellard
    qcow_probe,
668 ea2384d3 bellard
    qcow_open,
669 ea2384d3 bellard
    qcow_read,
670 ea2384d3 bellard
    qcow_write,
671 ea2384d3 bellard
    qcow_close,
672 ea2384d3 bellard
    qcow_create,
673 ea2384d3 bellard
    qcow_is_allocated,
674 ea2384d3 bellard
    qcow_set_key,
675 ea2384d3 bellard
};
676 ea2384d3 bellard