]> git.proxmox.com Git - qemu.git/blame - block/vpc.c
Merge remote-tracking branch 'kwolf/for-anthony' into staging
[qemu.git] / block / vpc.c
CommitLineData
6a0f9e82 1/*
cc2040f8 2 * Block driver for Connectix / Microsoft Virtual PC images
5fafdf24 3 *
6a0f9e82 4 * Copyright (c) 2005 Alex Beregszaszi
15d35bc5 5 * Copyright (c) 2009 Kevin Wolf <kwolf@suse.de>
5fafdf24 6 *
6a0f9e82
FB
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
13 *
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
23 * THE SOFTWARE.
24 */
faf07963 25#include "qemu-common.h"
6a0f9e82 26#include "block_int.h"
5efa9d5a 27#include "module.h"
6a0f9e82
FB
28
29/**************************************************************/
30
31#define HEADER_SIZE 512
32
33//#define CACHE
34
2cfacb62
AL
35enum vhd_type {
36 VHD_FIXED = 2,
37 VHD_DYNAMIC = 3,
38 VHD_DIFFERENCING = 4,
39};
40
57c7d9e5
AL
41// Seconds since Jan 1, 2000 0:00:00 (UTC)
42#define VHD_TIMESTAMP_BASE 946684800
43
6a0f9e82 44// always big-endian
b9fa33a6 45struct vhd_footer {
2cfacb62
AL
46 char creator[8]; // "conectix"
47 uint32_t features;
48 uint32_t version;
49
50 // Offset of next header structure, 0xFFFFFFFF if none
51 uint64_t data_offset;
52
53 // Seconds since Jan 1, 2000 0:00:00 (UTC)
54 uint32_t timestamp;
55
56 char creator_app[4]; // "vpc "
57 uint16_t major;
58 uint16_t minor;
59 char creator_os[4]; // "Wi2k"
60
61 uint64_t orig_size;
62 uint64_t size;
63
64 uint16_t cyls;
65 uint8_t heads;
66 uint8_t secs_per_cyl;
67
68 uint32_t type;
69
70 // Checksum of the Hard Disk Footer ("one's complement of the sum of all
71 // the bytes in the footer without the checksum field")
72 uint32_t checksum;
73
74 // UUID used to identify a parent hard disk (backing file)
75 uint8_t uuid[16];
76
77 uint8_t in_saved_state;
b9fa33a6
AL
78};
79
80struct vhd_dyndisk_header {
2cfacb62
AL
81 char magic[8]; // "cxsparse"
82
83 // Offset of next header structure, 0xFFFFFFFF if none
84 uint64_t data_offset;
85
86 // Offset of the Block Allocation Table (BAT)
87 uint64_t table_offset;
88
89 uint32_t version;
90 uint32_t max_table_entries; // 32bit/entry
91
92 // 2 MB by default, must be a power of two
93 uint32_t block_size;
94
95 uint32_t checksum;
96 uint8_t parent_uuid[16];
97 uint32_t parent_timestamp;
98 uint32_t reserved;
99
100 // Backing file name (in UTF-16)
101 uint8_t parent_name[512];
102
103 struct {
104 uint32_t platform;
105 uint32_t data_space;
106 uint32_t data_length;
107 uint32_t reserved;
108 uint64_t data_offset;
109 } parent_locator[8];
6a0f9e82
FB
110};
111
112typedef struct BDRVVPCState {
15d35bc5
AL
113 uint8_t footer_buf[HEADER_SIZE];
114 uint64_t free_data_block_offset;
2cfacb62 115 int max_table_entries;
6a0f9e82 116 uint32_t *pagetable;
15d35bc5
AL
117 uint64_t bat_offset;
118 uint64_t last_bitmap_offset;
6a0f9e82 119
2cfacb62 120 uint32_t block_size;
15d35bc5
AL
121 uint32_t bitmap_size;
122
6a0f9e82
FB
123#ifdef CACHE
124 uint8_t *pageentry_u8;
125 uint32_t *pageentry_u32;
126 uint16_t *pageentry_u16;
3b46e624 127
6a0f9e82
FB
128 uint64_t last_bitmap;
129#endif
130} BDRVVPCState;
131
57c7d9e5
AL
132static uint32_t vpc_checksum(uint8_t* buf, size_t size)
133{
134 uint32_t res = 0;
135 int i;
136
137 for (i = 0; i < size; i++)
138 res += buf[i];
139
140 return ~res;
141}
142
143
6a0f9e82
FB
144static int vpc_probe(const uint8_t *buf, int buf_size, const char *filename)
145{
ffe8ab83 146 if (buf_size >= 8 && !strncmp((char *)buf, "conectix", 8))
6a0f9e82 147 return 100;
6a0f9e82
FB
148 return 0;
149}
150
66f82cee 151static int vpc_open(BlockDriverState *bs, int flags)
6a0f9e82
FB
152{
153 BDRVVPCState *s = bs->opaque;
66f82cee 154 int i;
b9fa33a6
AL
155 struct vhd_footer* footer;
156 struct vhd_dyndisk_header* dyndisk_header;
157 uint8_t buf[HEADER_SIZE];
57c7d9e5 158 uint32_t checksum;
6a0f9e82 159
66f82cee 160 if (bdrv_pread(bs->file, 0, s->footer_buf, HEADER_SIZE) != HEADER_SIZE)
6a0f9e82
FB
161 goto fail;
162
15d35bc5 163 footer = (struct vhd_footer*) s->footer_buf;
b9fa33a6 164 if (strncmp(footer->creator, "conectix", 8))
6a0f9e82 165 goto fail;
6a0f9e82 166
57c7d9e5
AL
167 checksum = be32_to_cpu(footer->checksum);
168 footer->checksum = 0;
169 if (vpc_checksum(s->footer_buf, HEADER_SIZE) != checksum)
170 fprintf(stderr, "block-vpc: The header checksum of '%s' is "
66f82cee 171 "incorrect.\n", bs->filename);
57c7d9e5 172
1fa79228
AL
173 // The visible size of a image in Virtual PC depends on the geometry
174 // rather than on the size stored in the footer (the size in the footer
175 // is too large usually)
176 bs->total_sectors = (int64_t)
177 be16_to_cpu(footer->cyls) * footer->heads * footer->secs_per_cyl;
178
66f82cee 179 if (bdrv_pread(bs->file, be64_to_cpu(footer->data_offset), buf, HEADER_SIZE)
b71d1c2e 180 != HEADER_SIZE)
6a0f9e82
FB
181 goto fail;
182
b9fa33a6
AL
183 dyndisk_header = (struct vhd_dyndisk_header*) buf;
184
185 if (strncmp(dyndisk_header->magic, "cxsparse", 8))
186 goto fail;
6a0f9e82 187
6a0f9e82 188
15d35bc5
AL
189 s->block_size = be32_to_cpu(dyndisk_header->block_size);
190 s->bitmap_size = ((s->block_size / (8 * 512)) + 511) & ~511;
191
2cfacb62
AL
192 s->max_table_entries = be32_to_cpu(dyndisk_header->max_table_entries);
193 s->pagetable = qemu_malloc(s->max_table_entries * 4);
b71d1c2e 194
15d35bc5 195 s->bat_offset = be64_to_cpu(dyndisk_header->table_offset);
66f82cee 196 if (bdrv_pread(bs->file, s->bat_offset, s->pagetable,
15d35bc5 197 s->max_table_entries * 4) != s->max_table_entries * 4)
b71d1c2e
AL
198 goto fail;
199
15d35bc5
AL
200 s->free_data_block_offset =
201 (s->bat_offset + (s->max_table_entries * 4) + 511) & ~511;
202
203 for (i = 0; i < s->max_table_entries; i++) {
204 be32_to_cpus(&s->pagetable[i]);
205 if (s->pagetable[i] != 0xFFFFFFFF) {
206 int64_t next = (512 * (int64_t) s->pagetable[i]) +
207 s->bitmap_size + s->block_size;
208
209 if (next> s->free_data_block_offset)
210 s->free_data_block_offset = next;
211 }
212 }
213
214 s->last_bitmap_offset = (int64_t) -1;
6a0f9e82 215
6a0f9e82
FB
216#ifdef CACHE
217 s->pageentry_u8 = qemu_malloc(512);
6a0f9e82
FB
218 s->pageentry_u32 = s->pageentry_u8;
219 s->pageentry_u16 = s->pageentry_u8;
220 s->last_pagetable = -1;
221#endif
222
223 return 0;
224 fail:
6a0f9e82
FB
225 return -1;
226}
227
b71d1c2e
AL
228/*
229 * Returns the absolute byte offset of the given sector in the image file.
230 * If the sector is not allocated, -1 is returned instead.
15d35bc5
AL
231 *
232 * The parameter write must be 1 if the offset will be used for a write
233 * operation (the block bitmaps is updated then), 0 otherwise.
b71d1c2e 234 */
15d35bc5
AL
235static inline int64_t get_sector_offset(BlockDriverState *bs,
236 int64_t sector_num, int write)
6a0f9e82
FB
237{
238 BDRVVPCState *s = bs->opaque;
239 uint64_t offset = sector_num * 512;
240 uint64_t bitmap_offset, block_offset;
241 uint32_t pagetable_index, pageentry_index;
242
2cfacb62
AL
243 pagetable_index = offset / s->block_size;
244 pageentry_index = (offset % s->block_size) / 512;
3b46e624 245
15d35bc5
AL
246 if (pagetable_index >= s->max_table_entries || s->pagetable[pagetable_index] == 0xffffffff)
247 return -1; // not allocated
6a0f9e82 248
378e2aea 249 bitmap_offset = 512 * (uint64_t) s->pagetable[pagetable_index];
15d35bc5
AL
250 block_offset = bitmap_offset + s->bitmap_size + (512 * pageentry_index);
251
252 // We must ensure that we don't write to any sectors which are marked as
253 // unused in the bitmap. We get away with setting all bits in the block
254 // bitmap each time we write to a new block. This might cause Virtual PC to
255 // miss sparse read optimization, but it's not a problem in terms of
256 // correctness.
257 if (write && (s->last_bitmap_offset != bitmap_offset)) {
258 uint8_t bitmap[s->bitmap_size];
259
260 s->last_bitmap_offset = bitmap_offset;
261 memset(bitmap, 0xff, s->bitmap_size);
078a458e 262 bdrv_pwrite_sync(bs->file, bitmap_offset, bitmap, s->bitmap_size);
15d35bc5 263 }
3b46e624 264
26a76461 265// printf("sector: %" PRIx64 ", index: %x, offset: %x, bioff: %" PRIx64 ", bloff: %" PRIx64 "\n",
6a0f9e82
FB
266// sector_num, pagetable_index, pageentry_index,
267// bitmap_offset, block_offset);
268
269// disabled by reason
270#if 0
271#ifdef CACHE
272 if (bitmap_offset != s->last_bitmap)
273 {
274 lseek(s->fd, bitmap_offset, SEEK_SET);
275
276 s->last_bitmap = bitmap_offset;
5fafdf24 277
6a0f9e82
FB
278 // Scary! Bitmap is stored as big endian 32bit entries,
279 // while we used to look it up byte by byte
280 read(s->fd, s->pageentry_u8, 512);
281 for (i = 0; i < 128; i++)
282 be32_to_cpus(&s->pageentry_u32[i]);
283 }
284
285 if ((s->pageentry_u8[pageentry_index / 8] >> (pageentry_index % 8)) & 1)
286 return -1;
287#else
288 lseek(s->fd, bitmap_offset + (pageentry_index / 8), SEEK_SET);
5fafdf24 289
6a0f9e82
FB
290 read(s->fd, &bitmap_entry, 1);
291
292 if ((bitmap_entry >> (pageentry_index % 8)) & 1)
293 return -1; // not allocated
294#endif
295#endif
6a0f9e82 296
b71d1c2e 297 return block_offset;
6a0f9e82
FB
298}
299
15d35bc5
AL
300/*
301 * Writes the footer to the end of the image file. This is needed when the
302 * file grows as it overwrites the old footer
303 *
304 * Returns 0 on success and < 0 on error
305 */
306static int rewrite_footer(BlockDriverState* bs)
307{
308 int ret;
309 BDRVVPCState *s = bs->opaque;
310 int64_t offset = s->free_data_block_offset;
311
078a458e 312 ret = bdrv_pwrite_sync(bs->file, offset, s->footer_buf, HEADER_SIZE);
15d35bc5
AL
313 if (ret < 0)
314 return ret;
315
316 return 0;
317}
318
319/*
320 * Allocates a new block. This involves writing a new footer and updating
321 * the Block Allocation Table to use the space at the old end of the image
322 * file (overwriting the old footer)
323 *
324 * Returns the sectors' offset in the image file on success and < 0 on error
325 */
326static int64_t alloc_block(BlockDriverState* bs, int64_t sector_num)
327{
328 BDRVVPCState *s = bs->opaque;
329 int64_t bat_offset;
330 uint32_t index, bat_value;
331 int ret;
332 uint8_t bitmap[s->bitmap_size];
333
334 // Check if sector_num is valid
335 if ((sector_num < 0) || (sector_num > bs->total_sectors))
336 return -1;
337
338 // Write entry into in-memory BAT
339 index = (sector_num * 512) / s->block_size;
340 if (s->pagetable[index] != 0xFFFFFFFF)
341 return -1;
342
343 s->pagetable[index] = s->free_data_block_offset / 512;
344
345 // Initialize the block's bitmap
346 memset(bitmap, 0xff, s->bitmap_size);
078a458e
KW
347 bdrv_pwrite_sync(bs->file, s->free_data_block_offset, bitmap,
348 s->bitmap_size);
15d35bc5
AL
349
350 // Write new footer (the old one will be overwritten)
351 s->free_data_block_offset += s->block_size + s->bitmap_size;
352 ret = rewrite_footer(bs);
353 if (ret < 0)
354 goto fail;
355
356 // Write BAT entry to disk
357 bat_offset = s->bat_offset + (4 * index);
358 bat_value = be32_to_cpu(s->pagetable[index]);
078a458e 359 ret = bdrv_pwrite_sync(bs->file, bat_offset, &bat_value, 4);
15d35bc5
AL
360 if (ret < 0)
361 goto fail;
362
363 return get_sector_offset(bs, sector_num, 0);
364
365fail:
366 s->free_data_block_offset -= (s->block_size + s->bitmap_size);
367 return -1;
368}
369
5fafdf24 370static int vpc_read(BlockDriverState *bs, int64_t sector_num,
6a0f9e82
FB
371 uint8_t *buf, int nb_sectors)
372{
6c6ea921 373 BDRVVPCState *s = bs->opaque;
6a0f9e82 374 int ret;
b71d1c2e 375 int64_t offset;
6c6ea921 376 int64_t sectors, sectors_per_block;
6a0f9e82
FB
377
378 while (nb_sectors > 0) {
15d35bc5 379 offset = get_sector_offset(bs, sector_num, 0);
b71d1c2e 380
6c6ea921
KW
381 sectors_per_block = s->block_size >> BDRV_SECTOR_BITS;
382 sectors = sectors_per_block - (sector_num % sectors_per_block);
383 if (sectors > nb_sectors) {
384 sectors = nb_sectors;
385 }
386
b71d1c2e 387 if (offset == -1) {
6c6ea921 388 memset(buf, 0, sectors * BDRV_SECTOR_SIZE);
b71d1c2e 389 } else {
6c6ea921
KW
390 ret = bdrv_pread(bs->file, offset, buf,
391 sectors * BDRV_SECTOR_SIZE);
392 if (ret != sectors * BDRV_SECTOR_SIZE) {
b71d1c2e 393 return -1;
6c6ea921 394 }
b71d1c2e
AL
395 }
396
6c6ea921
KW
397 nb_sectors -= sectors;
398 sector_num += sectors;
399 buf += sectors * BDRV_SECTOR_SIZE;
6a0f9e82
FB
400 }
401 return 0;
402}
403
15d35bc5
AL
404static int vpc_write(BlockDriverState *bs, int64_t sector_num,
405 const uint8_t *buf, int nb_sectors)
406{
6c6ea921 407 BDRVVPCState *s = bs->opaque;
15d35bc5 408 int64_t offset;
6c6ea921 409 int64_t sectors, sectors_per_block;
15d35bc5
AL
410 int ret;
411
412 while (nb_sectors > 0) {
413 offset = get_sector_offset(bs, sector_num, 1);
414
6c6ea921
KW
415 sectors_per_block = s->block_size >> BDRV_SECTOR_BITS;
416 sectors = sectors_per_block - (sector_num % sectors_per_block);
417 if (sectors > nb_sectors) {
418 sectors = nb_sectors;
419 }
420
15d35bc5
AL
421 if (offset == -1) {
422 offset = alloc_block(bs, sector_num);
423 if (offset < 0)
424 return -1;
425 }
426
6c6ea921
KW
427 ret = bdrv_pwrite(bs->file, offset, buf, sectors * BDRV_SECTOR_SIZE);
428 if (ret != sectors * BDRV_SECTOR_SIZE) {
15d35bc5 429 return -1;
6c6ea921 430 }
15d35bc5 431
6c6ea921
KW
432 nb_sectors -= sectors;
433 sector_num += sectors;
434 buf += sectors * BDRV_SECTOR_SIZE;
15d35bc5
AL
435 }
436
437 return 0;
438}
439
4a411185
KW
440static int vpc_flush(BlockDriverState *bs)
441{
442 return bdrv_flush(bs->file);
443}
57c7d9e5
AL
444
445/*
446 * Calculates the number of cylinders, heads and sectors per cylinder
447 * based on a given number of sectors. This is the algorithm described
448 * in the VHD specification.
449 *
450 * Note that the geometry doesn't always exactly match total_sectors but
451 * may round it down.
6e9ea0c0
AJ
452 *
453 * Returns 0 on success, -EFBIG if the size is larger than 127 GB
57c7d9e5 454 */
6e9ea0c0 455static int calculate_geometry(int64_t total_sectors, uint16_t* cyls,
57c7d9e5
AL
456 uint8_t* heads, uint8_t* secs_per_cyl)
457{
458 uint32_t cyls_times_heads;
459
460 if (total_sectors > 65535 * 16 * 255)
6e9ea0c0 461 return -EFBIG;
57c7d9e5
AL
462
463 if (total_sectors > 65535 * 16 * 63) {
464 *secs_per_cyl = 255;
465 *heads = 16;
466 cyls_times_heads = total_sectors / *secs_per_cyl;
467 } else {
468 *secs_per_cyl = 17;
469 cyls_times_heads = total_sectors / *secs_per_cyl;
470 *heads = (cyls_times_heads + 1023) / 1024;
471
472 if (*heads < 4)
473 *heads = 4;
474
475 if (cyls_times_heads >= (*heads * 1024) || *heads > 16) {
476 *secs_per_cyl = 31;
477 *heads = 16;
478 cyls_times_heads = total_sectors / *secs_per_cyl;
479 }
480
481 if (cyls_times_heads >= (*heads * 1024)) {
482 *secs_per_cyl = 63;
483 *heads = 16;
484 cyls_times_heads = total_sectors / *secs_per_cyl;
485 }
486 }
487
dede4188 488 *cyls = cyls_times_heads / *heads;
6e9ea0c0
AJ
489
490 return 0;
57c7d9e5
AL
491}
492
0e7e1989 493static int vpc_create(const char *filename, QEMUOptionParameter *options)
57c7d9e5
AL
494{
495 uint8_t buf[1024];
496 struct vhd_footer* footer = (struct vhd_footer*) buf;
497 struct vhd_dyndisk_header* dyndisk_header =
498 (struct vhd_dyndisk_header*) buf;
499 int fd, i;
dede4188
SW
500 uint16_t cyls = 0;
501 uint8_t heads = 0;
502 uint8_t secs_per_cyl = 0;
57c7d9e5 503 size_t block_size, num_bat_entries;
0e7e1989 504 int64_t total_sectors = 0;
f0ff243a 505 int ret = -EIO;
57c7d9e5 506
0e7e1989 507 // Read out options
2d56a546
ML
508 total_sectors = get_option_parameter(options, BLOCK_OPT_SIZE)->value.n /
509 BDRV_SECTOR_SIZE;
57c7d9e5 510
0e7e1989 511 // Create the file
57c7d9e5
AL
512 fd = open(filename, O_WRONLY | O_CREAT | O_TRUNC | O_BINARY, 0644);
513 if (fd < 0)
514 return -EIO;
515
dede4188
SW
516 /* Calculate matching total_size and geometry. Increase the number of
517 sectors requested until we get enough (or fail). */
518 for (i = 0; total_sectors > (int64_t)cyls * heads * secs_per_cyl; i++) {
519 if (calculate_geometry(total_sectors + i,
520 &cyls, &heads, &secs_per_cyl)) {
f0ff243a
BS
521 ret = -EFBIG;
522 goto fail;
dede4188
SW
523 }
524 }
57c7d9e5
AL
525 total_sectors = (int64_t) cyls * heads * secs_per_cyl;
526
527 // Prepare the Hard Disk Footer
528 memset(buf, 0, 1024);
529
5ec4d682 530 memcpy(footer->creator, "conectix", 8);
57c7d9e5 531 // TODO Check if "qemu" creator_app is ok for VPC
5ec4d682
NF
532 memcpy(footer->creator_app, "qemu", 4);
533 memcpy(footer->creator_os, "Wi2k", 4);
57c7d9e5
AL
534
535 footer->features = be32_to_cpu(0x02);
536 footer->version = be32_to_cpu(0x00010000);
537 footer->data_offset = be64_to_cpu(HEADER_SIZE);
538 footer->timestamp = be32_to_cpu(time(NULL) - VHD_TIMESTAMP_BASE);
539
540 // Version of Virtual PC 2007
541 footer->major = be16_to_cpu(0x0005);
542 footer->minor =be16_to_cpu(0x0003);
543
544 footer->orig_size = be64_to_cpu(total_sectors * 512);
545 footer->size = be64_to_cpu(total_sectors * 512);
546
547 footer->cyls = be16_to_cpu(cyls);
548 footer->heads = heads;
549 footer->secs_per_cyl = secs_per_cyl;
550
551 footer->type = be32_to_cpu(VHD_DYNAMIC);
552
553 // TODO uuid is missing
554
555 footer->checksum = be32_to_cpu(vpc_checksum(buf, HEADER_SIZE));
556
557 // Write the footer (twice: at the beginning and at the end)
558 block_size = 0x200000;
559 num_bat_entries = (total_sectors + block_size / 512) / (block_size / 512);
560
f0ff243a
BS
561 if (write(fd, buf, HEADER_SIZE) != HEADER_SIZE) {
562 goto fail;
563 }
57c7d9e5 564
f0ff243a
BS
565 if (lseek(fd, 1536 + ((num_bat_entries * 4 + 511) & ~511), SEEK_SET) < 0) {
566 goto fail;
567 }
568 if (write(fd, buf, HEADER_SIZE) != HEADER_SIZE) {
569 goto fail;
570 }
57c7d9e5
AL
571
572 // Write the initial BAT
f0ff243a
BS
573 if (lseek(fd, 3 * 512, SEEK_SET) < 0) {
574 goto fail;
575 }
57c7d9e5
AL
576
577 memset(buf, 0xFF, 512);
f0ff243a
BS
578 for (i = 0; i < (num_bat_entries * 4 + 511) / 512; i++) {
579 if (write(fd, buf, 512) != 512) {
580 goto fail;
581 }
582 }
57c7d9e5
AL
583
584
585 // Prepare the Dynamic Disk Header
586 memset(buf, 0, 1024);
587
5ec4d682 588 memcpy(dyndisk_header->magic, "cxsparse", 8);
57c7d9e5
AL
589
590 dyndisk_header->data_offset = be64_to_cpu(0xFFFFFFFF);
591 dyndisk_header->table_offset = be64_to_cpu(3 * 512);
592 dyndisk_header->version = be32_to_cpu(0x00010000);
593 dyndisk_header->block_size = be32_to_cpu(block_size);
594 dyndisk_header->max_table_entries = be32_to_cpu(num_bat_entries);
595
596 dyndisk_header->checksum = be32_to_cpu(vpc_checksum(buf, 1024));
597
598 // Write the header
f0ff243a
BS
599 if (lseek(fd, 512, SEEK_SET) < 0) {
600 goto fail;
601 }
57c7d9e5 602
f0ff243a
BS
603 if (write(fd, buf, 1024) != 1024) {
604 goto fail;
605 }
606 ret = 0;
607
608 fail:
57c7d9e5 609 close(fd);
f0ff243a 610 return ret;
57c7d9e5
AL
611}
612
6a0f9e82
FB
613static void vpc_close(BlockDriverState *bs)
614{
615 BDRVVPCState *s = bs->opaque;
616 qemu_free(s->pagetable);
617#ifdef CACHE
618 qemu_free(s->pageentry_u8);
619#endif
6a0f9e82
FB
620}
621
0e7e1989 622static QEMUOptionParameter vpc_create_options[] = {
db08adf5
KW
623 {
624 .name = BLOCK_OPT_SIZE,
625 .type = OPT_SIZE,
626 .help = "Virtual disk size"
627 },
0e7e1989
KW
628 { NULL }
629};
630
5efa9d5a 631static BlockDriver bdrv_vpc = {
4a411185
KW
632 .format_name = "vpc",
633 .instance_size = sizeof(BDRVVPCState),
634 .bdrv_probe = vpc_probe,
635 .bdrv_open = vpc_open,
636 .bdrv_read = vpc_read,
637 .bdrv_write = vpc_write,
638 .bdrv_flush = vpc_flush,
639 .bdrv_close = vpc_close,
640 .bdrv_create = vpc_create,
0e7e1989
KW
641
642 .create_options = vpc_create_options,
6a0f9e82 643};
5efa9d5a
AL
644
645static void bdrv_vpc_init(void)
646{
647 bdrv_register(&bdrv_vpc);
648}
649
650block_init(bdrv_vpc_init);