]> Git Repo - qemu.git/blame - block/vvfat.c
Merge remote-tracking branch 'remotes/gkurz/tags/9p-fix-2020-07-10' into staging
[qemu.git] / block / vvfat.c
CommitLineData
7ad9be64 1/* vim:set shiftwidth=4 ts=4: */
de167e41
FB
2/*
3 * QEMU Block driver for virtual VFAT (shadows a local directory)
5fafdf24 4 *
a046433a 5 * Copyright (c) 2004,2005 Johannes E. Schindelin
5fafdf24 6 *
de167e41
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 */
452fcdbc 25
80c71a24 26#include "qemu/osdep.h"
de167e41 27#include <dirent.h>
da34e65c 28#include "qapi/error.h"
737e150e 29#include "block/block_int.h"
609f45ea 30#include "block/qdict.h"
1de7afc9 31#include "qemu/module.h"
922a01a0 32#include "qemu/option.h"
58369e22 33#include "qemu/bswap.h"
795c40b8 34#include "migration/blocker.h"
452fcdbc 35#include "qapi/qmp/qdict.h"
d49b6836 36#include "qapi/qmp/qstring.h"
856dfd8a 37#include "qemu/ctype.h"
f348b6d1 38#include "qemu/cutils.h"
2ab4b135 39#include "qemu/error-report.h"
de167e41 40
a046433a
FB
41#ifndef S_IWGRP
42#define S_IWGRP 0
43#endif
44#ifndef S_IWOTH
45#define S_IWOTH 0
46#endif
47
48/* TODO: add ":bootsector=blabla.img:" */
49/* LATER TODO: add automatic boot sector generation from
50 BOOTEASY.ASM and Ranish Partition Manager
5fafdf24 51 Note that DOS assumes the system files to be the first files in the
a046433a
FB
52 file system (test if the boot sector still relies on that fact)! */
53/* MAYBE TODO: write block-visofs.c */
54/* TODO: call try_commit() only after a timeout */
55
56/* #define DEBUG */
57
58#ifdef DEBUG
59
60#define DLOG(a) a
61
3f47aa8c 62static void checkpoint(void);
de167e41 63
a046433a
FB
64#else
65
66#define DLOG(a)
67
68#endif
de167e41 69
63d261cb
HP
70/* bootsector OEM name. see related compatibility problems at:
71 * https://jdebp.eu/FGA/volume-boot-block-oem-name-field.html
72 * http://seasip.info/Misc/oemid.html
73 */
74#define BOOTSECTOR_OEM_NAME "MSWIN4.1"
75
8c4517fd
HP
76#define DIR_DELETED 0xe5
77#define DIR_KANJI DIR_DELETED
78#define DIR_KANJI_FAKE 0x05
79#define DIR_FREE 0x00
80
de167e41 81/* dynamic array functions */
c227f099 82typedef struct array_t {
de167e41
FB
83 char* pointer;
84 unsigned int size,next,item_size;
c227f099 85} array_t;
de167e41 86
c227f099 87static inline void array_init(array_t* array,unsigned int item_size)
de167e41 88{
511d2b14 89 array->pointer = NULL;
de167e41
FB
90 array->size=0;
91 array->next=0;
92 array->item_size=item_size;
93}
94
c227f099 95static inline void array_free(array_t* array)
de167e41 96{
ce137829 97 g_free(array->pointer);
de167e41
FB
98 array->size=array->next=0;
99}
100
a046433a 101/* does not automatically grow */
c227f099 102static inline void* array_get(array_t* array,unsigned int index) {
a046433a 103 assert(index < array->next);
8d9401c2 104 assert(array->pointer);
a046433a
FB
105 return array->pointer + index * array->item_size;
106}
107
8d9401c2 108static inline void array_ensure_allocated(array_t *array, int index)
a046433a
FB
109{
110 if((index + 1) * array->item_size > array->size) {
d6a7e54e
HP
111 int new_size = (index + 32) * array->item_size;
112 array->pointer = g_realloc(array->pointer, new_size);
8d9401c2 113 assert(array->pointer);
f80256b7 114 memset(array->pointer + array->size, 0, new_size - array->size);
d6a7e54e
HP
115 array->size = new_size;
116 array->next = index + 1;
de167e41 117 }
de167e41
FB
118}
119
c227f099 120static inline void* array_get_next(array_t* array) {
a046433a 121 unsigned int next = array->next;
a046433a 122
8d9401c2 123 array_ensure_allocated(array, next);
a046433a 124 array->next = next + 1;
9be38598 125 return array_get(array, next);
de167e41
FB
126}
127
c227f099 128static inline void* array_insert(array_t* array,unsigned int index,unsigned int count) {
de167e41 129 if((array->next+count)*array->item_size>array->size) {
d6a7e54e
HP
130 int increment=count*array->item_size;
131 array->pointer=g_realloc(array->pointer,array->size+increment);
132 if(!array->pointer)
511d2b14 133 return NULL;
d6a7e54e 134 array->size+=increment;
de167e41
FB
135 }
136 memmove(array->pointer+(index+count)*array->item_size,
d6a7e54e
HP
137 array->pointer+index*array->item_size,
138 (array->next-index)*array->item_size);
de167e41
FB
139 array->next+=count;
140 return array->pointer+index*array->item_size;
141}
142
c227f099 143static inline int array_remove_slice(array_t* array,int index, int count)
de167e41 144{
a046433a
FB
145 assert(index >=0);
146 assert(count > 0);
147 assert(index + count <= array->next);
3dfa23b9
KW
148
149 memmove(array->pointer + index * array->item_size,
150 array->pointer + (index + count) * array->item_size,
151 (array->next - index - count) * array->item_size);
152
a046433a 153 array->next -= count;
de167e41
FB
154 return 0;
155}
156
c227f099 157static int array_remove(array_t* array,int index)
a046433a
FB
158{
159 return array_remove_slice(array, index, 1);
160}
161
162/* return the index for a given member */
c227f099 163static int array_index(array_t* array, void* pointer)
a046433a
FB
164{
165 size_t offset = (char*)pointer - array->pointer;
a046433a
FB
166 assert((offset % array->item_size) == 0);
167 assert(offset/array->item_size < array->next);
168 return offset/array->item_size;
169}
170
de167e41 171/* These structures are used to fake a disk and the VFAT filesystem.
541dc0d4 172 * For this reason we need to use QEMU_PACKED. */
de167e41 173
c227f099 174typedef struct bootsector_t {
de167e41
FB
175 uint8_t jump[3];
176 uint8_t name[8];
177 uint16_t sector_size;
178 uint8_t sectors_per_cluster;
179 uint16_t reserved_sectors;
180 uint8_t number_of_fats;
181 uint16_t root_entries;
a046433a 182 uint16_t total_sectors16;
de167e41
FB
183 uint8_t media_type;
184 uint16_t sectors_per_fat;
185 uint16_t sectors_per_track;
186 uint16_t number_of_heads;
187 uint32_t hidden_sectors;
188 uint32_t total_sectors;
189 union {
190 struct {
d6a7e54e 191 uint8_t drive_number;
92e28d82 192 uint8_t reserved1;
d6a7e54e
HP
193 uint8_t signature;
194 uint32_t id;
195 uint8_t volume_label[11];
92e28d82
HP
196 uint8_t fat_type[8];
197 uint8_t ignored[0x1c0];
d6a7e54e
HP
198 } QEMU_PACKED fat16;
199 struct {
200 uint32_t sectors_per_fat;
201 uint16_t flags;
202 uint8_t major,minor;
92e28d82 203 uint32_t first_cluster_of_root_dir;
d6a7e54e
HP
204 uint16_t info_sector;
205 uint16_t backup_boot_sector;
92e28d82
HP
206 uint8_t reserved[12];
207 uint8_t drive_number;
208 uint8_t reserved1;
209 uint8_t signature;
210 uint32_t id;
211 uint8_t volume_label[11];
212 uint8_t fat_type[8];
213 uint8_t ignored[0x1a4];
d6a7e54e 214 } QEMU_PACKED fat32;
de167e41 215 } u;
de167e41 216 uint8_t magic[2];
541dc0d4 217} QEMU_PACKED bootsector_t;
de167e41 218
b570094d
TS
219typedef struct {
220 uint8_t head;
221 uint8_t sector;
222 uint8_t cylinder;
c227f099 223} mbr_chs_t;
b570094d 224
c227f099 225typedef struct partition_t {
de167e41 226 uint8_t attributes; /* 0x80 = bootable */
c227f099 227 mbr_chs_t start_CHS;
b570094d 228 uint8_t fs_type; /* 0x1 = FAT12, 0x6 = FAT16, 0xe = FAT16_LBA, 0xb = FAT32, 0xc = FAT32_LBA */
c227f099 229 mbr_chs_t end_CHS;
de167e41 230 uint32_t start_sector_long;
b570094d 231 uint32_t length_sector_long;
541dc0d4 232} QEMU_PACKED partition_t;
de167e41 233
c227f099 234typedef struct mbr_t {
b570094d
TS
235 uint8_t ignored[0x1b8];
236 uint32_t nt_id;
237 uint8_t ignored2[2];
c227f099 238 partition_t partition[4];
de167e41 239 uint8_t magic[2];
541dc0d4 240} QEMU_PACKED mbr_t;
de167e41 241
c227f099 242typedef struct direntry_t {
f671d173 243 uint8_t name[8 + 3];
de167e41
FB
244 uint8_t attributes;
245 uint8_t reserved[2];
246 uint16_t ctime;
247 uint16_t cdate;
248 uint16_t adate;
249 uint16_t begin_hi;
250 uint16_t mtime;
251 uint16_t mdate;
252 uint16_t begin;
253 uint32_t size;
541dc0d4 254} QEMU_PACKED direntry_t;
de167e41
FB
255
256/* this structure are used to transparently access the files */
257
c227f099 258typedef struct mapping_t {
a046433a
FB
259 /* begin is the first cluster, end is the last+1 */
260 uint32_t begin,end;
de167e41
FB
261 /* as s->directory is growable, no pointer may be used here */
262 unsigned int dir_index;
a046433a
FB
263 /* the clusters of a file may be in any order; this points to the first */
264 int first_mapping_index;
265 union {
d6a7e54e
HP
266 /* offset is
267 * - the offset in the file (in clusters) for a file, or
ad05b318 268 * - the next cluster of the directory for a directory
d6a7e54e
HP
269 */
270 struct {
271 uint32_t offset;
272 } file;
273 struct {
274 int parent_mapping_index;
275 int first_dir_index;
276 } dir;
a046433a
FB
277 } info;
278 /* path contains the full path, i.e. it always starts with s->path */
279 char* path;
280
ad05b318
HP
281 enum {
282 MODE_UNDEFINED = 0,
283 MODE_NORMAL = 1,
284 MODE_MODIFIED = 2,
285 MODE_DIRECTORY = 4,
286 MODE_DELETED = 8,
287 } mode;
a046433a 288 int read_only;
c227f099 289} mapping_t;
de167e41 290
a046433a 291#ifdef DEBUG
c227f099
AL
292static void print_direntry(const struct direntry_t*);
293static void print_mapping(const struct mapping_t* mapping);
a046433a 294#endif
de167e41
FB
295
296/* here begins the real VVFAT driver */
297
298typedef struct BDRVVVFATState {
848c66e8 299 CoMutex lock;
a046433a 300 BlockDriverState* bs; /* pointer to parent */
de167e41 301 unsigned char first_sectors[0x40*0x200];
3b46e624 302
de167e41 303 int fat_type; /* 16 or 32 */
c227f099 304 array_t fat,directory,mapping;
d5941dda 305 char volume_label[11];
3b46e624 306
4dc705dc
HP
307 uint32_t offset_to_bootsector; /* 0 for floppy, 0x3f for disk */
308
de167e41
FB
309 unsigned int cluster_size;
310 unsigned int sectors_per_cluster;
311 unsigned int sectors_per_fat;
a046433a 312 uint32_t last_cluster_of_root_directory;
6817efea
HP
313 /* how many entries are available in root directory (0 for FAT32) */
314 uint16_t root_entries;
de167e41
FB
315 uint32_t sector_count; /* total number of sectors of the partition */
316 uint32_t cluster_count; /* total number of clusters of this partition */
de167e41 317 uint32_t max_fat_value;
4dc705dc
HP
318 uint32_t offset_to_fat;
319 uint32_t offset_to_root_dir;
3b46e624 320
de167e41 321 int current_fd;
c227f099 322 mapping_t* current_mapping;
a046433a
FB
323 unsigned char* cluster; /* points to current cluster */
324 unsigned char* cluster_buffer; /* points to a buffer to hold temp data */
de167e41
FB
325 unsigned int current_cluster;
326
327 /* write support */
a046433a 328 char* qcow_filename;
eecc7747 329 BdrvChild* qcow;
a046433a
FB
330 void* fat2;
331 char* used_clusters;
c227f099 332 array_t commits;
a046433a
FB
333 const char* path;
334 int downcase_short_names;
3397f0cb
KW
335
336 Error *migration_blocker;
de167e41
FB
337} BDRVVVFATState;
338
b570094d
TS
339/* take the sector position spos and convert it to Cylinder/Head/Sector position
340 * if the position is outside the specified geometry, fill maximum value for CHS
341 * and return 1 to signal overflow.
342 */
4480e0f9
MA
343static int sector2CHS(mbr_chs_t *chs, int spos, int cyls, int heads, int secs)
344{
b570094d 345 int head,sector;
4480e0f9
MA
346 sector = spos % secs; spos /= secs;
347 head = spos % heads; spos /= heads;
348 if (spos >= cyls) {
b570094d
TS
349 /* Overflow,
350 it happens if 32bit sector positions are used, while CHS is only 24bit.
351 Windows/Dos is said to take 1023/255/63 as nonrepresentable CHS */
352 chs->head = 0xFF;
353 chs->sector = 0xFF;
354 chs->cylinder = 0xFF;
355 return 1;
356 }
357 chs->head = (uint8_t)head;
358 chs->sector = (uint8_t)( (sector+1) | ((spos>>8)<<6) );
359 chs->cylinder = (uint8_t)spos;
360 return 0;
361}
de167e41 362
4480e0f9 363static void init_mbr(BDRVVVFATState *s, int cyls, int heads, int secs)
de167e41
FB
364{
365 /* TODO: if the files mbr.img and bootsect.img exist, use them */
c227f099
AL
366 mbr_t* real_mbr=(mbr_t*)s->first_sectors;
367 partition_t* partition = &(real_mbr->partition[0]);
b570094d 368 int lba;
de167e41
FB
369
370 memset(s->first_sectors,0,512);
3b46e624 371
b570094d
TS
372 /* Win NT Disk Signature */
373 real_mbr->nt_id= cpu_to_le32(0xbe1afdfa);
374
de167e41 375 partition->attributes=0x80; /* bootable */
b570094d
TS
376
377 /* LBA is used when partition is outside the CHS geometry */
4dc705dc 378 lba = sector2CHS(&partition->start_CHS, s->offset_to_bootsector,
4480e0f9
MA
379 cyls, heads, secs);
380 lba |= sector2CHS(&partition->end_CHS, s->bs->total_sectors - 1,
381 cyls, heads, secs);
b570094d
TS
382
383 /*LBA partitions are identified only by start/length_sector_long not by CHS*/
4dc705dc 384 partition->start_sector_long = cpu_to_le32(s->offset_to_bootsector);
f91cbefe 385 partition->length_sector_long = cpu_to_le32(s->bs->total_sectors
4dc705dc 386 - s->offset_to_bootsector);
b570094d 387
a046433a 388 /* FAT12/FAT16/FAT32 */
b570094d
TS
389 /* DOS uses different types when partition is LBA,
390 probably to prevent older versions from using CHS on them */
5f5b29df
HP
391 partition->fs_type = s->fat_type == 12 ? 0x1 :
392 s->fat_type == 16 ? (lba ? 0xe : 0x06) :
393 /*s->fat_type == 32*/ (lba ? 0xc : 0x0b);
de167e41
FB
394
395 real_mbr->magic[0]=0x55; real_mbr->magic[1]=0xaa;
396}
397
a046433a
FB
398/* direntry functions */
399
09ec4119 400static direntry_t *create_long_filename(BDRVVVFATState *s, const char *filename)
de167e41 401{
09ec4119
HP
402 int number_of_entries, i;
403 glong length;
404 direntry_t *entry;
405
406 gunichar2 *longname = g_utf8_to_utf16(filename, -1, NULL, &length, NULL);
407 if (!longname) {
408 fprintf(stderr, "vvfat: invalid UTF-8 name: %s\n", filename);
409 return NULL;
de167e41 410 }
de167e41 411
78ee96de 412 number_of_entries = DIV_ROUND_UP(length * 2, 26);
de167e41
FB
413
414 for(i=0;i<number_of_entries;i++) {
d6a7e54e
HP
415 entry=array_get_next(&(s->directory));
416 entry->attributes=0xf;
417 entry->reserved[0]=0;
418 entry->begin=0;
419 entry->name[0]=(number_of_entries-i)|(i==0?0x40:0);
de167e41 420 }
1e080d5d 421 for(i=0;i<26*number_of_entries;i++) {
d6a7e54e
HP
422 int offset=(i%26);
423 if(offset<10) offset=1+offset;
424 else if(offset<22) offset=14+offset-10;
425 else offset=28+offset-22;
426 entry=array_get(&(s->directory),s->directory.next-1-(i/26));
09ec4119
HP
427 if (i >= 2 * length + 2) {
428 entry->name[offset] = 0xff;
429 } else if (i % 2 == 0) {
430 entry->name[offset] = longname[i / 2] & 0xff;
431 } else {
432 entry->name[offset] = longname[i / 2] >> 8;
433 }
de167e41 434 }
09ec4119 435 g_free(longname);
de167e41
FB
436 return array_get(&(s->directory),s->directory.next-number_of_entries);
437}
438
c227f099 439static char is_free(const direntry_t* direntry)
a046433a 440{
8c4517fd 441 return direntry->name[0] == DIR_DELETED || direntry->name[0] == DIR_FREE;
a046433a
FB
442}
443
c227f099 444static char is_volume_label(const direntry_t* direntry)
a046433a
FB
445{
446 return direntry->attributes == 0x28;
447}
448
c227f099 449static char is_long_name(const direntry_t* direntry)
a046433a
FB
450{
451 return direntry->attributes == 0xf;
452}
453
c227f099 454static char is_short_name(const direntry_t* direntry)
a046433a
FB
455{
456 return !is_volume_label(direntry) && !is_long_name(direntry)
d6a7e54e 457 && !is_free(direntry);
a046433a
FB
458}
459
c227f099 460static char is_directory(const direntry_t* direntry)
a046433a 461{
8c4517fd 462 return direntry->attributes & 0x10 && direntry->name[0] != DIR_DELETED;
a046433a
FB
463}
464
c227f099 465static inline char is_dot(const direntry_t* direntry)
a046433a
FB
466{
467 return is_short_name(direntry) && direntry->name[0] == '.';
468}
469
c227f099 470static char is_file(const direntry_t* direntry)
a046433a
FB
471{
472 return is_short_name(direntry) && !is_directory(direntry);
473}
474
c227f099 475static inline uint32_t begin_of_direntry(const direntry_t* direntry)
a046433a
FB
476{
477 return le16_to_cpu(direntry->begin)|(le16_to_cpu(direntry->begin_hi)<<16);
478}
479
c227f099 480static inline uint32_t filesize_of_direntry(const direntry_t* direntry)
a046433a
FB
481{
482 return le32_to_cpu(direntry->size);
483}
484
c227f099 485static void set_begin_of_direntry(direntry_t* direntry, uint32_t begin)
a046433a
FB
486{
487 direntry->begin = cpu_to_le16(begin & 0xffff);
488 direntry->begin_hi = cpu_to_le16((begin >> 16) & 0xffff);
489}
490
c79e243e
KW
491static bool valid_filename(const unsigned char *name)
492{
493 unsigned char c;
494 if (!strcmp((const char*)name, ".") || !strcmp((const char*)name, "..")) {
495 return false;
496 }
497 for (; (c = *name); name++) {
498 if (!((c >= '0' && c <= '9') ||
499 (c >= 'A' && c <= 'Z') ||
500 (c >= 'a' && c <= 'z') ||
501 c > 127 ||
502 strchr("$%'-_@~`!(){}^#&.+,;=[]", c) != NULL))
503 {
504 return false;
505 }
506 }
507 return true;
508}
509
0c36111f
HP
510static uint8_t to_valid_short_char(gunichar c)
511{
512 c = g_unichar_toupper(c);
513 if ((c >= '0' && c <= '9') ||
514 (c >= 'A' && c <= 'Z') ||
c79e243e 515 strchr("$%'-_@~`!(){}^#&", c) != NULL) {
0c36111f
HP
516 return c;
517 } else {
518 return 0;
519 }
520}
521
522static direntry_t *create_short_filename(BDRVVVFATState *s,
339cebcc
HP
523 const char *filename,
524 unsigned int directory_start)
0c36111f 525{
339cebcc 526 int i, j = 0;
0c36111f
HP
527 direntry_t *entry = array_get_next(&(s->directory));
528 const gchar *p, *last_dot = NULL;
529 gunichar c;
530 bool lossy_conversion = false;
7c8730d4 531 char tail[8];
0c36111f
HP
532
533 if (!entry) {
534 return NULL;
535 }
536 memset(entry->name, 0x20, sizeof(entry->name));
537
538 /* copy filename and search last dot */
539 for (p = filename; ; p = g_utf8_next_char(p)) {
540 c = g_utf8_get_char(p);
541 if (c == '\0') {
542 break;
543 } else if (c == '.') {
544 if (j == 0) {
545 /* '.' at start of filename */
546 lossy_conversion = true;
547 } else {
548 if (last_dot) {
549 lossy_conversion = true;
550 }
551 last_dot = p;
552 }
553 } else if (!last_dot) {
554 /* first part of the name; copy it */
555 uint8_t v = to_valid_short_char(c);
556 if (j < 8 && v) {
557 entry->name[j++] = v;
558 } else {
559 lossy_conversion = true;
560 }
561 }
562 }
563
564 /* copy extension (if any) */
565 if (last_dot) {
566 j = 0;
567 for (p = g_utf8_next_char(last_dot); ; p = g_utf8_next_char(p)) {
568 c = g_utf8_get_char(p);
569 if (c == '\0') {
570 break;
571 } else {
572 /* extension; copy it */
573 uint8_t v = to_valid_short_char(c);
574 if (j < 3 && v) {
575 entry->name[8 + (j++)] = v;
576 } else {
577 lossy_conversion = true;
578 }
579 }
580 }
581 }
339cebcc 582
8c4517fd
HP
583 if (entry->name[0] == DIR_KANJI) {
584 entry->name[0] = DIR_KANJI_FAKE;
78f002c9
HP
585 }
586
339cebcc
HP
587 /* numeric-tail generation */
588 for (j = 0; j < 8; j++) {
589 if (entry->name[j] == ' ') {
590 break;
591 }
592 }
593 for (i = lossy_conversion ? 1 : 0; i < 999999; i++) {
594 direntry_t *entry1;
595 if (i > 0) {
7c8730d4
HR
596 int len = snprintf(tail, sizeof(tail), "~%u", (unsigned)i);
597 assert(len <= 7);
339cebcc
HP
598 memcpy(entry->name + MIN(j, 8 - len), tail, len);
599 }
600 for (entry1 = array_get(&(s->directory), directory_start);
601 entry1 < entry; entry1++) {
602 if (!is_long_name(entry1) &&
603 !memcmp(entry1->name, entry->name, 11)) {
604 break; /* found dupe */
605 }
606 }
607 if (entry1 == entry) {
608 /* no dupe found */
609 return entry;
610 }
611 }
612 return NULL;
0c36111f
HP
613}
614
de167e41
FB
615/* fat functions */
616
c227f099 617static inline uint8_t fat_chksum(const direntry_t* entry)
de167e41
FB
618{
619 uint8_t chksum=0;
620 int i;
621
f671d173
SW
622 for (i = 0; i < ARRAY_SIZE(entry->name); i++) {
623 chksum = (((chksum & 0xfe) >> 1) |
624 ((chksum & 0x01) ? 0x80 : 0)) + entry->name[i];
5606c220 625 }
3b46e624 626
de167e41
FB
627 return chksum;
628}
629
630/* if return_time==0, this returns the fat_date, else the fat_time */
631static uint16_t fat_datetime(time_t time,int return_time) {
632 struct tm* t;
de167e41 633 struct tm t1;
6ab00cee 634 t = &t1;
de167e41 635 localtime_r(&time,t);
de167e41 636 if(return_time)
d6a7e54e 637 return cpu_to_le16((t->tm_sec/2)|(t->tm_min<<5)|(t->tm_hour<<11));
de167e41
FB
638 return cpu_to_le16((t->tm_mday)|((t->tm_mon+1)<<5)|((t->tm_year-80)<<9));
639}
640
641static inline void fat_set(BDRVVVFATState* s,unsigned int cluster,uint32_t value)
642{
a046433a 643 if(s->fat_type==32) {
d6a7e54e
HP
644 uint32_t* entry=array_get(&(s->fat),cluster);
645 *entry=cpu_to_le32(value);
de167e41 646 } else if(s->fat_type==16) {
d6a7e54e
HP
647 uint16_t* entry=array_get(&(s->fat),cluster);
648 *entry=cpu_to_le16(value&0xffff);
de167e41 649 } else {
d6a7e54e
HP
650 int offset = (cluster*3/2);
651 unsigned char* p = array_get(&(s->fat), offset);
a046433a 652 switch (cluster&1) {
d6a7e54e
HP
653 case 0:
654 p[0] = value&0xff;
655 p[1] = (p[1]&0xf0) | ((value>>8)&0xf);
656 break;
657 case 1:
658 p[0] = (p[0]&0xf) | ((value&0xf)<<4);
659 p[1] = (value>>4);
660 break;
661 }
de167e41
FB
662 }
663}
664
665static inline uint32_t fat_get(BDRVVVFATState* s,unsigned int cluster)
666{
a046433a 667 if(s->fat_type==32) {
d6a7e54e
HP
668 uint32_t* entry=array_get(&(s->fat),cluster);
669 return le32_to_cpu(*entry);
de167e41 670 } else if(s->fat_type==16) {
d6a7e54e
HP
671 uint16_t* entry=array_get(&(s->fat),cluster);
672 return le16_to_cpu(*entry);
de167e41 673 } else {
d6a7e54e
HP
674 const uint8_t* x=(uint8_t*)(s->fat.pointer)+cluster*3/2;
675 return ((x[0]|(x[1]<<8))>>(cluster&1?4:0))&0x0fff;
de167e41
FB
676 }
677}
678
679static inline int fat_eof(BDRVVVFATState* s,uint32_t fat_entry)
680{
681 if(fat_entry>s->max_fat_value-8)
d6a7e54e 682 return -1;
de167e41
FB
683 return 0;
684}
685
686static inline void init_fat(BDRVVVFATState* s)
687{
a046433a 688 if (s->fat_type == 12) {
d6a7e54e
HP
689 array_init(&(s->fat),1);
690 array_ensure_allocated(&(s->fat),
691 s->sectors_per_fat * 0x200 * 3 / 2 - 1);
a046433a 692 } else {
d6a7e54e
HP
693 array_init(&(s->fat),(s->fat_type==32?4:2));
694 array_ensure_allocated(&(s->fat),
695 s->sectors_per_fat * 0x200 / s->fat.item_size - 1);
a046433a 696 }
de167e41 697 memset(s->fat.pointer,0,s->fat.size);
3b46e624 698
de167e41 699 switch(s->fat_type) {
d6a7e54e
HP
700 case 12: s->max_fat_value=0xfff; break;
701 case 16: s->max_fat_value=0xffff; break;
702 case 32: s->max_fat_value=0x0fffffff; break;
703 default: s->max_fat_value=0; /* error... */
de167e41
FB
704 }
705
706}
707
c227f099 708static inline direntry_t* create_short_and_long_name(BDRVVVFATState* s,
d6a7e54e 709 unsigned int directory_start, const char* filename, int is_dot)
de167e41 710{
0c36111f 711 int long_index = s->directory.next;
c227f099
AL
712 direntry_t* entry = NULL;
713 direntry_t* entry_long = NULL;
de167e41
FB
714
715 if(is_dot) {
d6a7e54e 716 entry=array_get_next(&(s->directory));
f671d173 717 memset(entry->name, 0x20, sizeof(entry->name));
d6a7e54e
HP
718 memcpy(entry->name,filename,strlen(filename));
719 return entry;
de167e41 720 }
3b46e624 721
de167e41 722 entry_long=create_long_filename(s,filename);
339cebcc 723 entry = create_short_filename(s, filename, directory_start);
de167e41
FB
724
725 /* calculate checksum; propagate to long name */
726 if(entry_long) {
727 uint8_t chksum=fat_chksum(entry);
728
d6a7e54e
HP
729 /* calculate anew, because realloc could have taken place */
730 entry_long=array_get(&(s->directory),long_index);
731 while(entry_long<entry && is_long_name(entry_long)) {
732 entry_long->reserved[1]=chksum;
733 entry_long++;
734 }
de167e41
FB
735 }
736
737 return entry;
738}
739
a046433a
FB
740/*
741 * Read a directory. (the index of the corresponding mapping must be passed).
742 */
743static int read_directory(BDRVVVFATState* s, int mapping_index)
de167e41 744{
c227f099
AL
745 mapping_t* mapping = array_get(&(s->mapping), mapping_index);
746 direntry_t* direntry;
a046433a
FB
747 const char* dirname = mapping->path;
748 int first_cluster = mapping->begin;
749 int parent_index = mapping->info.dir.parent_mapping_index;
c227f099 750 mapping_t* parent_mapping = (mapping_t*)
511d2b14 751 (parent_index >= 0 ? array_get(&(s->mapping), parent_index) : NULL);
a046433a 752 int first_cluster_of_parent = parent_mapping ? parent_mapping->begin : -1;
de167e41
FB
753
754 DIR* dir=opendir(dirname);
755 struct dirent* entry;
de167e41
FB
756 int i;
757
a046433a
FB
758 assert(mapping->mode & MODE_DIRECTORY);
759
760 if(!dir) {
d6a7e54e
HP
761 mapping->end = mapping->begin;
762 return -1;
a046433a 763 }
3b46e624 764
a046433a 765 i = mapping->info.dir.first_dir_index =
d6a7e54e 766 first_cluster == 0 ? 0 : s->directory.next;
a046433a 767
f82d92bb
HP
768 if (first_cluster != 0) {
769 /* create the top entries of a subdirectory */
770 (void)create_short_and_long_name(s, i, ".", 1);
771 (void)create_short_and_long_name(s, i, "..", 1);
772 }
773
5fafdf24 774 /* actually read the directory, and allocate the mappings */
de167e41 775 while((entry=readdir(dir))) {
d6a7e54e 776 unsigned int length=strlen(dirname)+2+strlen(entry->d_name);
de167e41 777 char* buffer;
d6a7e54e 778 direntry_t* direntry;
a046433a 779 struct stat st;
d6a7e54e
HP
780 int is_dot=!strcmp(entry->d_name,".");
781 int is_dotdot=!strcmp(entry->d_name,"..");
de167e41 782
6817efea
HP
783 if (first_cluster == 0 && s->directory.next >= s->root_entries - 1) {
784 fprintf(stderr, "Too many entries in root directory\n");
785 closedir(dir);
786 return -2;
787 }
788
d6a7e54e
HP
789 if(first_cluster == 0 && (is_dotdot || is_dot))
790 continue;
5fafdf24 791
d6a7e54e
HP
792 buffer = g_malloc(length);
793 snprintf(buffer,length,"%s/%s",dirname,entry->d_name);
de167e41 794
d6a7e54e 795 if(stat(buffer,&st)<0) {
ce137829 796 g_free(buffer);
de167e41 797 continue;
d6a7e54e
HP
798 }
799
800 /* create directory entry for this file */
f82d92bb
HP
801 if (!is_dot && !is_dotdot) {
802 direntry = create_short_and_long_name(s, i, entry->d_name, 0);
803 } else {
804 direntry = array_get(&(s->directory), is_dot ? i : i + 1);
805 }
d6a7e54e
HP
806 direntry->attributes=(S_ISDIR(st.st_mode)?0x10:0x20);
807 direntry->reserved[0]=direntry->reserved[1]=0;
808 direntry->ctime=fat_datetime(st.st_ctime,1);
809 direntry->cdate=fat_datetime(st.st_ctime,0);
810 direntry->adate=fat_datetime(st.st_atime,0);
811 direntry->begin_hi=0;
812 direntry->mtime=fat_datetime(st.st_mtime,1);
813 direntry->mdate=fat_datetime(st.st_mtime,0);
814 if(is_dotdot)
815 set_begin_of_direntry(direntry, first_cluster_of_parent);
816 else if(is_dot)
817 set_begin_of_direntry(direntry, first_cluster);
818 else
819 direntry->begin=0; /* do that later */
a046433a 820 if (st.st_size > 0x7fffffff) {
d6a7e54e 821 fprintf(stderr, "File %s is larger than 2GB\n", buffer);
ce137829 822 g_free(buffer);
08089edc 823 closedir(dir);
d6a7e54e 824 return -2;
a046433a 825 }
d6a7e54e
HP
826 direntry->size=cpu_to_le32(S_ISDIR(st.st_mode)?0:st.st_size);
827
828 /* create mapping for this file */
829 if(!is_dot && !is_dotdot && (S_ISDIR(st.st_mode) || st.st_size)) {
830 s->current_mapping = array_get_next(&(s->mapping));
831 s->current_mapping->begin=0;
832 s->current_mapping->end=st.st_size;
833 /*
834 * we get the direntry of the most recent direntry, which
835 * contains the short name and all the relevant information.
836 */
837 s->current_mapping->dir_index=s->directory.next-1;
838 s->current_mapping->first_mapping_index = -1;
839 if (S_ISDIR(st.st_mode)) {
840 s->current_mapping->mode = MODE_DIRECTORY;
841 s->current_mapping->info.dir.parent_mapping_index =
842 mapping_index;
843 } else {
844 s->current_mapping->mode = MODE_UNDEFINED;
845 s->current_mapping->info.file.offset = 0;
846 }
847 s->current_mapping->path=buffer;
848 s->current_mapping->read_only =
849 (st.st_mode & (S_IWUSR | S_IWGRP | S_IWOTH)) == 0;
b122c3b6
MA
850 } else {
851 g_free(buffer);
852 }
de167e41
FB
853 }
854 closedir(dir);
855
856 /* fill with zeroes up to the end of the cluster */
857 while(s->directory.next%(0x10*s->sectors_per_cluster)) {
d6a7e54e
HP
858 direntry_t* direntry=array_get_next(&(s->directory));
859 memset(direntry,0,sizeof(direntry_t));
de167e41
FB
860 }
861
6817efea
HP
862 if (s->fat_type != 32 &&
863 mapping_index == 0 &&
864 s->directory.next < s->root_entries) {
d6a7e54e
HP
865 /* root directory */
866 int cur = s->directory.next;
6817efea
HP
867 array_ensure_allocated(&(s->directory), s->root_entries - 1);
868 s->directory.next = s->root_entries;
d6a7e54e 869 memset(array_get(&(s->directory), cur), 0,
6817efea 870 (s->root_entries - cur) * sizeof(direntry_t));
de167e41 871 }
5fafdf24 872
5f5b29df 873 /* re-get the mapping, since s->mapping was possibly realloc()ed */
d4df3dbc 874 mapping = array_get(&(s->mapping), mapping_index);
a046433a 875 first_cluster += (s->directory.next - mapping->info.dir.first_dir_index)
d6a7e54e 876 * 0x20 / s->cluster_size;
a046433a
FB
877 mapping->end = first_cluster;
878
d4df3dbc 879 direntry = array_get(&(s->directory), mapping->dir_index);
a046433a 880 set_begin_of_direntry(direntry, mapping->begin);
3b46e624 881
a046433a
FB
882 return 0;
883}
de167e41 884
a046433a
FB
885static inline uint32_t sector2cluster(BDRVVVFATState* s,off_t sector_num)
886{
4dc705dc 887 return (sector_num - s->offset_to_root_dir) / s->sectors_per_cluster;
a046433a 888}
de167e41 889
a046433a
FB
890static inline off_t cluster2sector(BDRVVVFATState* s, uint32_t cluster_num)
891{
4dc705dc 892 return s->offset_to_root_dir + s->sectors_per_cluster * cluster_num;
a046433a 893}
de167e41 894
a046433a 895static int init_directories(BDRVVVFATState* s,
d11c8917
MA
896 const char *dirname, int heads, int secs,
897 Error **errp)
de167e41 898{
c227f099
AL
899 bootsector_t* bootsector;
900 mapping_t* mapping;
de167e41
FB
901 unsigned int i;
902 unsigned int cluster;
903
904 memset(&(s->first_sectors[0]),0,0x40*0x200);
905
de167e41 906 s->cluster_size=s->sectors_per_cluster*0x200;
7267c094 907 s->cluster_buffer=g_malloc(s->cluster_size);
a046433a
FB
908
909 /*
910 * The formula: sc = spf+1+spf*spc*(512*8/fat_type),
911 * where sc is sector_count,
912 * spf is sectors_per_fat,
913 * spc is sectors_per_clusters, and
914 * fat_type = 12, 16 or 32.
915 */
916 i = 1+s->sectors_per_cluster*0x200*8/s->fat_type;
917 s->sectors_per_fat=(s->sector_count+i)/i; /* round up */
3b46e624 918
4dc705dc
HP
919 s->offset_to_fat = s->offset_to_bootsector + 1;
920 s->offset_to_root_dir = s->offset_to_fat + s->sectors_per_fat * 2;
921
c227f099
AL
922 array_init(&(s->mapping),sizeof(mapping_t));
923 array_init(&(s->directory),sizeof(direntry_t));
de167e41
FB
924
925 /* add volume label */
926 {
d6a7e54e
HP
927 direntry_t* entry=array_get_next(&(s->directory));
928 entry->attributes=0x28; /* archive | volume label */
d5941dda 929 memcpy(entry->name, s->volume_label, sizeof(entry->name));
de167e41
FB
930 }
931
de167e41
FB
932 /* Now build FAT, and write back information into directory */
933 init_fat(s);
934
6817efea
HP
935 /* TODO: if there are more entries, bootsector has to be adjusted! */
936 s->root_entries = 0x02 * 0x10 * s->sectors_per_cluster;
a046433a
FB
937 s->cluster_count=sector2cluster(s, s->sector_count);
938
939 mapping = array_get_next(&(s->mapping));
940 mapping->begin = 0;
941 mapping->dir_index = 0;
942 mapping->info.dir.parent_mapping_index = -1;
943 mapping->first_mapping_index = -1;
7267c094 944 mapping->path = g_strdup(dirname);
a046433a
FB
945 i = strlen(mapping->path);
946 if (i > 0 && mapping->path[i - 1] == '/')
d6a7e54e 947 mapping->path[i - 1] = '\0';
a046433a
FB
948 mapping->mode = MODE_DIRECTORY;
949 mapping->read_only = 0;
950 s->path = mapping->path;
951
952 for (i = 0, cluster = 0; i < s->mapping.next; i++) {
d6a7e54e
HP
953 /* MS-DOS expects the FAT to be 0 for the root directory
954 * (except for the media byte). */
955 /* LATER TODO: still true for FAT32? */
956 int fix_fat = (i != 0);
957 mapping = array_get(&(s->mapping), i);
a046433a
FB
958
959 if (mapping->mode & MODE_DIRECTORY) {
a2b83a51 960 char *path = mapping->path;
d6a7e54e
HP
961 mapping->begin = cluster;
962 if(read_directory(s, i)) {
a2b83a51 963 error_setg(errp, "Could not read directory %s", path);
d6a7e54e
HP
964 return -1;
965 }
966 mapping = array_get(&(s->mapping), i);
967 } else {
968 assert(mapping->mode == MODE_UNDEFINED);
969 mapping->mode=MODE_NORMAL;
970 mapping->begin = cluster;
971 if (mapping->end > 0) {
972 direntry_t* direntry = array_get(&(s->directory),
973 mapping->dir_index);
974
975 mapping->end = cluster + 1 + (mapping->end-1)/s->cluster_size;
976 set_begin_of_direntry(direntry, mapping->begin);
977 } else {
978 mapping->end = cluster + 1;
979 fix_fat = 0;
980 }
981 }
982
983 assert(mapping->begin < mapping->end);
984
985 /* next free cluster */
986 cluster = mapping->end;
987
988 if(cluster > s->cluster_count) {
d11c8917
MA
989 error_setg(errp,
990 "Directory does not fit in FAT%d (capacity %.2f MB)",
991 s->fat_type, s->sector_count / 2000.0);
992 return -1;
d6a7e54e 993 }
8ce0f869 994
d6a7e54e
HP
995 /* fix fat for entry */
996 if (fix_fat) {
997 int j;
998 for(j = mapping->begin; j < mapping->end - 1; j++)
999 fat_set(s, j, j+1);
1000 fat_set(s, mapping->end - 1, s->max_fat_value);
1001 }
de167e41
FB
1002 }
1003
a046433a 1004 mapping = array_get(&(s->mapping), 0);
a046433a
FB
1005 s->last_cluster_of_root_directory = mapping->end;
1006
1007 /* the FAT signature */
1008 fat_set(s,0,s->max_fat_value);
1009 fat_set(s,1,s->max_fat_value);
de167e41 1010
a046433a
FB
1011 s->current_mapping = NULL;
1012
4dc705dc
HP
1013 bootsector = (bootsector_t *)(s->first_sectors
1014 + s->offset_to_bootsector * 0x200);
de167e41
FB
1015 bootsector->jump[0]=0xeb;
1016 bootsector->jump[1]=0x3e;
1017 bootsector->jump[2]=0x90;
63d261cb 1018 memcpy(bootsector->name, BOOTSECTOR_OEM_NAME, 8);
de167e41
FB
1019 bootsector->sector_size=cpu_to_le16(0x200);
1020 bootsector->sectors_per_cluster=s->sectors_per_cluster;
1021 bootsector->reserved_sectors=cpu_to_le16(1);
1022 bootsector->number_of_fats=0x2; /* number of FATs */
6817efea 1023 bootsector->root_entries = cpu_to_le16(s->root_entries);
a046433a 1024 bootsector->total_sectors16=s->sector_count>0xffff?0:cpu_to_le16(s->sector_count);
4dc705dc
HP
1025 /* media descriptor: hard disk=0xf8, floppy=0xf0 */
1026 bootsector->media_type = (s->offset_to_bootsector > 0 ? 0xf8 : 0xf0);
a046433a 1027 s->fat.pointer[0] = bootsector->media_type;
de167e41 1028 bootsector->sectors_per_fat=cpu_to_le16(s->sectors_per_fat);
4480e0f9
MA
1029 bootsector->sectors_per_track = cpu_to_le16(secs);
1030 bootsector->number_of_heads = cpu_to_le16(heads);
4dc705dc 1031 bootsector->hidden_sectors = cpu_to_le32(s->offset_to_bootsector);
a046433a 1032 bootsector->total_sectors=cpu_to_le32(s->sector_count>0xffff?s->sector_count:0);
de167e41 1033
a046433a 1034 /* LATER TODO: if FAT32, this is wrong */
4dc705dc
HP
1035 /* drive_number: fda=0, hda=0x80 */
1036 bootsector->u.fat16.drive_number = s->offset_to_bootsector == 0 ? 0 : 0x80;
de167e41
FB
1037 bootsector->u.fat16.signature=0x29;
1038 bootsector->u.fat16.id=cpu_to_le32(0xfabe1afd);
1039
d5941dda
WB
1040 memcpy(bootsector->u.fat16.volume_label, s->volume_label,
1041 sizeof(bootsector->u.fat16.volume_label));
92e28d82
HP
1042 memcpy(bootsector->u.fat16.fat_type,
1043 s->fat_type == 12 ? "FAT12 " : "FAT16 ", 8);
de167e41
FB
1044 bootsector->magic[0]=0x55; bootsector->magic[1]=0xaa;
1045
1046 return 0;
1047}
1048
83f64091 1049#ifdef DEBUG
a046433a 1050static BDRVVVFATState *vvv = NULL;
83f64091 1051#endif
a046433a 1052
eecc7747 1053static int enable_write_target(BlockDriverState *bs, Error **errp);
a046433a
FB
1054static int is_consistent(BDRVVVFATState *s);
1055
7ad9be64
KW
1056static QemuOptsList runtime_opts = {
1057 .name = "vvfat",
1058 .head = QTAILQ_HEAD_INITIALIZER(runtime_opts.head),
1059 .desc = {
1060 {
1061 .name = "dir",
1062 .type = QEMU_OPT_STRING,
1063 .help = "Host directory to map to the vvfat device",
1064 },
1065 {
1066 .name = "fat-type",
1067 .type = QEMU_OPT_NUMBER,
1068 .help = "FAT type (12, 16 or 32)",
1069 },
1070 {
1071 .name = "floppy",
1072 .type = QEMU_OPT_BOOL,
1073 .help = "Create a floppy rather than a hard disk image",
1074 },
d5941dda
WB
1075 {
1076 .name = "label",
1077 .type = QEMU_OPT_STRING,
1078 .help = "Use a volume label other than QEMU VVFAT",
1079 },
7ad9be64
KW
1080 {
1081 .name = "rw",
1082 .type = QEMU_OPT_BOOL,
1083 .help = "Make the image writable",
1084 },
1085 { /* end of list */ }
1086 },
1087};
1088
1089static void vvfat_parse_filename(const char *filename, QDict *options,
1090 Error **errp)
1091{
1092 int fat_type = 0;
1093 bool floppy = false;
1094 bool rw = false;
1095 int i;
1096
1097 if (!strstart(filename, "fat:", NULL)) {
1098 error_setg(errp, "File name string must start with 'fat:'");
1099 return;
1100 }
1101
1102 /* Parse options */
1103 if (strstr(filename, ":32:")) {
1104 fat_type = 32;
1105 } else if (strstr(filename, ":16:")) {
1106 fat_type = 16;
1107 } else if (strstr(filename, ":12:")) {
1108 fat_type = 12;
1109 }
1110
1111 if (strstr(filename, ":floppy:")) {
1112 floppy = true;
1113 }
1114
1115 if (strstr(filename, ":rw:")) {
1116 rw = true;
1117 }
1118
1119 /* Get the directory name without options */
1120 i = strrchr(filename, ':') - filename;
1121 assert(i >= 3);
1122 if (filename[i - 2] == ':' && qemu_isalpha(filename[i - 1])) {
1123 /* workaround for DOS drive names */
1124 filename += i - 1;
1125 } else {
1126 filename += i + 1;
1127 }
1128
1129 /* Fill in the options QDict */
46f5ac20
EB
1130 qdict_put_str(options, "dir", filename);
1131 qdict_put_int(options, "fat-type", fat_type);
1132 qdict_put_bool(options, "floppy", floppy);
1133 qdict_put_bool(options, "rw", rw);
7ad9be64
KW
1134}
1135
015a1036
HR
1136static int vvfat_open(BlockDriverState *bs, QDict *options, int flags,
1137 Error **errp)
de167e41
FB
1138{
1139 BDRVVVFATState *s = bs->opaque;
7ad9be64
KW
1140 int cyls, heads, secs;
1141 bool floppy;
d5941dda 1142 const char *dirname, *label;
7ad9be64 1143 QemuOpts *opts;
7ad9be64 1144 int ret;
de167e41 1145
83f64091 1146#ifdef DEBUG
a046433a 1147 vvv = s;
83f64091 1148#endif
a046433a 1149
87ea75d5 1150 opts = qemu_opts_create(&runtime_opts, NULL, 0, &error_abort);
af175e85 1151 if (!qemu_opts_absorb_qdict(opts, options, errp)) {
7ad9be64
KW
1152 ret = -EINVAL;
1153 goto fail;
1154 }
1155
1156 dirname = qemu_opt_get(opts, "dir");
1157 if (!dirname) {
c0f92b52 1158 error_setg(errp, "vvfat block driver requires a 'dir' option");
7ad9be64
KW
1159 ret = -EINVAL;
1160 goto fail;
1161 }
1162
1163 s->fat_type = qemu_opt_get_number(opts, "fat-type", 0);
1164 floppy = qemu_opt_get_bool(opts, "floppy", false);
1165
d5941dda
WB
1166 memset(s->volume_label, ' ', sizeof(s->volume_label));
1167 label = qemu_opt_get(opts, "label");
1168 if (label) {
1169 size_t label_length = strlen(label);
1170 if (label_length > 11) {
1171 error_setg(errp, "vvfat label cannot be longer than 11 bytes");
1172 ret = -EINVAL;
1173 goto fail;
1174 }
1175 memcpy(s->volume_label, label, label_length);
d208c50d
KW
1176 } else {
1177 memcpy(s->volume_label, "QEMU VVFAT", 10);
d5941dda
WB
1178 }
1179
7ad9be64
KW
1180 if (floppy) {
1181 /* 1.44MB or 2.88MB floppy. 2.88MB can be FAT12 (default) or FAT16. */
1182 if (!s->fat_type) {
1183 s->fat_type = 12;
1184 secs = 36;
1185 s->sectors_per_cluster = 2;
1186 } else {
1187 secs = s->fat_type == 12 ? 18 : 36;
1188 s->sectors_per_cluster = 1;
1189 }
7ad9be64
KW
1190 cyls = 80;
1191 heads = 2;
1192 } else {
1193 /* 32MB or 504MB disk*/
1194 if (!s->fat_type) {
1195 s->fat_type = 16;
1196 }
4dc705dc 1197 s->offset_to_bootsector = 0x3f;
7ad9be64
KW
1198 cyls = s->fat_type == 12 ? 64 : 1024;
1199 heads = 16;
1200 secs = 63;
1201 }
1202
1203 switch (s->fat_type) {
1204 case 32:
b62e39b4 1205 warn_report("FAT32 has not been tested. You are welcome to do so!");
7ad9be64
KW
1206 break;
1207 case 16:
1208 case 12:
1209 break;
1210 default:
c0f92b52 1211 error_setg(errp, "Valid FAT types are only 12, 16 and 32");
7ad9be64
KW
1212 ret = -EINVAL;
1213 goto fail;
1214 }
1215
1216
a046433a
FB
1217 s->bs = bs;
1218
a046433a 1219 /* LATER TODO: if FAT32, adjust */
a046433a 1220 s->sectors_per_cluster=0x10;
de167e41
FB
1221
1222 s->current_cluster=0xffffffff;
de167e41 1223
eecc7747 1224 s->qcow = NULL;
a046433a
FB
1225 s->qcow_filename = NULL;
1226 s->fat2 = NULL;
1227 s->downcase_short_names = 1;
3b46e624 1228
3e31b4e1
TH
1229 DLOG(fprintf(stderr, "vvfat %s chs %d,%d,%d\n",
1230 dirname, cyls, heads, secs));
a046433a 1231
4dc705dc 1232 s->sector_count = cyls * heads * secs - s->offset_to_bootsector;
5a742b55 1233
7ad9be64 1234 if (qemu_opt_get_bool(opts, "rw", false)) {
e2b8247a
JC
1235 if (!bdrv_is_read_only(bs)) {
1236 ret = enable_write_target(bs, errp);
1237 if (ret < 0) {
1238 goto fail;
1239 }
1240 } else {
1241 ret = -EPERM;
1242 error_setg(errp,
1243 "Unable to set VVFAT to 'rw' when drive is read-only");
1244 goto fail;
1245 }
eaa2410f
KW
1246 } else {
1247 ret = bdrv_apply_auto_read_only(bs, NULL, errp);
78f27bd0 1248 if (ret < 0) {
7ad9be64
KW
1249 goto fail;
1250 }
b570094d
TS
1251 }
1252
4480e0f9 1253 bs->total_sectors = cyls * heads * secs;
b570094d 1254
d11c8917 1255 if (init_directories(s, dirname, heads, secs, errp)) {
7ad9be64
KW
1256 ret = -EIO;
1257 goto fail;
4480e0f9 1258 }
de167e41 1259
4dc705dc
HP
1260 s->sector_count = s->offset_to_root_dir
1261 + s->sectors_per_cluster * s->cluster_count;
b570094d 1262
3397f0cb
KW
1263 /* Disable migration when vvfat is used rw */
1264 if (s->qcow) {
81e5f78a
AG
1265 error_setg(&s->migration_blocker,
1266 "The vvfat (rw) format used by node '%s' "
1267 "does not support live migration",
1268 bdrv_get_device_or_node_name(bs));
386f6c07
MA
1269 ret = migrate_add_blocker(s->migration_blocker, errp);
1270 if (ret < 0) {
fe44dc91
AA
1271 error_free(s->migration_blocker);
1272 goto fail;
1273 }
3397f0cb
KW
1274 }
1275
4dc705dc 1276 if (s->offset_to_bootsector > 0) {
fe44dc91
AA
1277 init_mbr(s, cyls, heads, secs);
1278 }
1279
1280 qemu_co_mutex_init(&s->lock);
1281
7ad9be64
KW
1282 ret = 0;
1283fail:
1284 qemu_opts_del(opts);
1285 return ret;
de167e41
FB
1286}
1287
a6506481
EB
1288static void vvfat_refresh_limits(BlockDriverState *bs, Error **errp)
1289{
a5b8dd2c 1290 bs->bl.request_alignment = BDRV_SECTOR_SIZE; /* No sub-sector I/O */
a6506481
EB
1291}
1292
de167e41
FB
1293static inline void vvfat_close_current_file(BDRVVVFATState *s)
1294{
1295 if(s->current_mapping) {
d6a7e54e
HP
1296 s->current_mapping = NULL;
1297 if (s->current_fd) {
1298 qemu_close(s->current_fd);
1299 s->current_fd = 0;
1300 }
de167e41 1301 }
a046433a 1302 s->current_cluster = -1;
de167e41
FB
1303}
1304
1305/* mappings between index1 and index2-1 are supposed to be ordered
1306 * return value is the index of the last mapping for which end>cluster_num
1307 */
1308static inline int find_mapping_for_cluster_aux(BDRVVVFATState* s,int cluster_num,int index1,int index2)
1309{
de167e41 1310 while(1) {
88bf7950 1311 int index3;
d6a7e54e
HP
1312 mapping_t* mapping;
1313 index3=(index1+index2)/2;
1314 mapping=array_get(&(s->mapping),index3);
1315 assert(mapping->begin < mapping->end);
1316 if(mapping->begin>=cluster_num) {
1317 assert(index2!=index3 || index2==0);
1318 if(index2==index3)
1319 return index1;
1320 index2=index3;
1321 } else {
1322 if(index1==index3)
1323 return mapping->end<=cluster_num ? index2 : index1;
1324 index1=index3;
1325 }
1326 assert(index1<=index2);
1327 DLOG(mapping=array_get(&(s->mapping),index1);
1328 assert(mapping->begin<=cluster_num);
1329 assert(index2 >= s->mapping.next ||
1330 ((mapping = array_get(&(s->mapping),index2)) &&
1331 mapping->end>cluster_num)));
de167e41
FB
1332 }
1333}
1334
c227f099 1335static inline mapping_t* find_mapping_for_cluster(BDRVVVFATState* s,int cluster_num)
de167e41
FB
1336{
1337 int index=find_mapping_for_cluster_aux(s,cluster_num,0,s->mapping.next);
c227f099 1338 mapping_t* mapping;
de167e41 1339 if(index>=s->mapping.next)
511d2b14 1340 return NULL;
de167e41
FB
1341 mapping=array_get(&(s->mapping),index);
1342 if(mapping->begin>cluster_num)
511d2b14 1343 return NULL;
a046433a 1344 assert(mapping->begin<=cluster_num && mapping->end>cluster_num);
de167e41
FB
1345 return mapping;
1346}
1347
c227f099 1348static int open_file(BDRVVVFATState* s,mapping_t* mapping)
de167e41
FB
1349{
1350 if(!mapping)
d6a7e54e 1351 return -1;
de167e41 1352 if(!s->current_mapping ||
d6a7e54e
HP
1353 strcmp(s->current_mapping->path,mapping->path)) {
1354 /* open file */
1355 int fd = qemu_open(mapping->path, O_RDONLY | O_BINARY | O_LARGEFILE);
1356 if(fd<0)
1357 return -1;
1358 vvfat_close_current_file(s);
1359 s->current_fd = fd;
1360 s->current_mapping = mapping;
de167e41
FB
1361 }
1362 return 0;
1363}
1364
1365static inline int read_cluster(BDRVVVFATState *s,int cluster_num)
1366{
1367 if(s->current_cluster != cluster_num) {
d6a7e54e
HP
1368 int result=0;
1369 off_t offset;
1370 assert(!s->current_mapping || s->current_fd || (s->current_mapping->mode & MODE_DIRECTORY));
1371 if(!s->current_mapping
1372 || s->current_mapping->begin>cluster_num
1373 || s->current_mapping->end<=cluster_num) {
1374 /* binary search of mappings for file */
1375 mapping_t* mapping=find_mapping_for_cluster(s,cluster_num);
1376
1377 assert(!mapping || (cluster_num>=mapping->begin && cluster_num<mapping->end));
1378
1379 if (mapping && mapping->mode & MODE_DIRECTORY) {
1380 vvfat_close_current_file(s);
1381 s->current_mapping = mapping;
a046433a 1382read_cluster_directory:
d6a7e54e
HP
1383 offset = s->cluster_size*(cluster_num-s->current_mapping->begin);
1384 s->cluster = (unsigned char*)s->directory.pointer+offset
1385 + 0x20*s->current_mapping->info.dir.first_dir_index;
1386 assert(((s->cluster-(unsigned char*)s->directory.pointer)%s->cluster_size)==0);
1387 assert((char*)s->cluster+s->cluster_size <= s->directory.pointer+s->directory.next*s->directory.item_size);
1388 s->current_cluster = cluster_num;
1389 return 0;
1390 }
1391
1392 if(open_file(s,mapping))
1393 return -2;
1394 } else if (s->current_mapping->mode & MODE_DIRECTORY)
1395 goto read_cluster_directory;
1396
1397 assert(s->current_fd);
1398
1399 offset=s->cluster_size*(cluster_num-s->current_mapping->begin)+s->current_mapping->info.file.offset;
1400 if(lseek(s->current_fd, offset, SEEK_SET)!=offset)
1401 return -3;
1402 s->cluster=s->cluster_buffer;
1403 result=read(s->current_fd,s->cluster,s->cluster_size);
1404 if(result<0) {
1405 s->current_cluster = -1;
1406 return -1;
1407 }
1408 s->current_cluster = cluster_num;
de167e41
FB
1409 }
1410 return 0;
1411}
1412
a046433a 1413#ifdef DEBUG
c227f099 1414static void print_direntry(const direntry_t* direntry)
de167e41 1415{
a046433a
FB
1416 int j = 0;
1417 char buffer[1024];
1418
3e89cb04 1419 fprintf(stderr, "direntry %p: ", direntry);
de167e41 1420 if(!direntry)
d6a7e54e 1421 return;
a046433a 1422 if(is_long_name(direntry)) {
d6a7e54e
HP
1423 unsigned char* c=(unsigned char*)direntry;
1424 int i;
1425 for(i=1;i<11 && c[i] && c[i]!=0xff;i+=2)
3891b370 1426#define ADD_CHAR(c) {buffer[j] = (c); if (buffer[j] < ' ') buffer[j] = 0xb0; j++;}
d6a7e54e
HP
1427 ADD_CHAR(c[i]);
1428 for(i=14;i<26 && c[i] && c[i]!=0xff;i+=2)
1429 ADD_CHAR(c[i]);
1430 for(i=28;i<32 && c[i] && c[i]!=0xff;i+=2)
1431 ADD_CHAR(c[i]);
1432 buffer[j] = 0;
1433 fprintf(stderr, "%s\n", buffer);
de167e41 1434 } else {
d6a7e54e
HP
1435 int i;
1436 for(i=0;i<11;i++)
1437 ADD_CHAR(direntry->name[i]);
1438 buffer[j] = 0;
1439 fprintf(stderr,"%s attributes=0x%02x begin=%d size=%d\n",
1440 buffer,
1441 direntry->attributes,
1442 begin_of_direntry(direntry),le32_to_cpu(direntry->size));
de167e41
FB
1443 }
1444}
1445
c227f099 1446static void print_mapping(const mapping_t* mapping)
de167e41 1447{
3e89cb04
KW
1448 fprintf(stderr, "mapping (%p): begin, end = %d, %d, dir_index = %d, "
1449 "first_mapping_index = %d, name = %s, mode = 0x%x, " ,
1450 mapping, mapping->begin, mapping->end, mapping->dir_index,
1451 mapping->first_mapping_index, mapping->path, mapping->mode);
1452
a046433a 1453 if (mapping->mode & MODE_DIRECTORY)
d6a7e54e 1454 fprintf(stderr, "parent_mapping_index = %d, first_dir_index = %d\n", mapping->info.dir.parent_mapping_index, mapping->info.dir.first_dir_index);
a046433a 1455 else
d6a7e54e 1456 fprintf(stderr, "offset = %d\n", mapping->info.file.offset);
de167e41 1457}
a046433a 1458#endif
de167e41 1459
5fafdf24 1460static int vvfat_read(BlockDriverState *bs, int64_t sector_num,
a046433a 1461 uint8_t *buf, int nb_sectors)
de167e41 1462{
a046433a 1463 BDRVVVFATState *s = bs->opaque;
de167e41 1464 int i;
de167e41 1465
a046433a 1466 for(i=0;i<nb_sectors;i++,sector_num++) {
d6a7e54e
HP
1467 if (sector_num >= bs->total_sectors)
1468 return -1;
1469 if (s->qcow) {
d6a644bb 1470 int64_t n;
6f712ee0 1471 int ret;
d6a644bb
EB
1472 ret = bdrv_is_allocated(s->qcow->bs, sector_num * BDRV_SECTOR_SIZE,
1473 (nb_sectors - i) * BDRV_SECTOR_SIZE, &n);
6f712ee0
EB
1474 if (ret < 0) {
1475 return ret;
1476 }
1477 if (ret) {
d6a644bb
EB
1478 DLOG(fprintf(stderr, "sectors %" PRId64 "+%" PRId64
1479 " allocated\n", sector_num,
1480 n >> BDRV_SECTOR_BITS));
e5a0a678
AG
1481 if (bdrv_pread(s->qcow, sector_num * BDRV_SECTOR_SIZE,
1482 buf + i * 0x200, n) < 0) {
7704df98
KW
1483 return -1;
1484 }
d6a644bb
EB
1485 i += (n >> BDRV_SECTOR_BITS) - 1;
1486 sector_num += (n >> BDRV_SECTOR_BITS) - 1;
7704df98
KW
1487 continue;
1488 }
d6a644bb
EB
1489 DLOG(fprintf(stderr, "sector %" PRId64 " not allocated\n",
1490 sector_num));
d6a7e54e 1491 }
4dc705dc
HP
1492 if (sector_num < s->offset_to_root_dir) {
1493 if (sector_num < s->offset_to_fat) {
1494 memcpy(buf + i * 0x200,
1495 &(s->first_sectors[sector_num * 0x200]),
1496 0x200);
1497 } else if (sector_num < s->offset_to_fat + s->sectors_per_fat) {
1498 memcpy(buf + i * 0x200,
1499 &(s->fat.pointer[(sector_num
1500 - s->offset_to_fat) * 0x200]),
1501 0x200);
1502 } else if (sector_num < s->offset_to_root_dir) {
1503 memcpy(buf + i * 0x200,
1504 &(s->fat.pointer[(sector_num - s->offset_to_fat
1505 - s->sectors_per_fat) * 0x200]),
1506 0x200);
1507 }
d6a7e54e 1508 } else {
4dc705dc 1509 uint32_t sector = sector_num - s->offset_to_root_dir,
d6a7e54e
HP
1510 sector_offset_in_cluster=(sector%s->sectors_per_cluster),
1511 cluster_num=sector/s->sectors_per_cluster;
1512 if(cluster_num > s->cluster_count || read_cluster(s, cluster_num) != 0) {
1513 /* LATER TODO: strict: return -1; */
1514 memset(buf+i*0x200,0,0x200);
1515 continue;
1516 }
1517 memcpy(buf+i*0x200,s->cluster+sector_offset_in_cluster*0x200,0x200);
1518 }
de167e41 1519 }
de167e41
FB
1520 return 0;
1521}
1522
4575eb49
KW
1523static int coroutine_fn
1524vvfat_co_preadv(BlockDriverState *bs, uint64_t offset, uint64_t bytes,
1525 QEMUIOVector *qiov, int flags)
2914caa0
PB
1526{
1527 int ret;
1528 BDRVVVFATState *s = bs->opaque;
4575eb49
KW
1529 uint64_t sector_num = offset >> BDRV_SECTOR_BITS;
1530 int nb_sectors = bytes >> BDRV_SECTOR_BITS;
1531 void *buf;
1532
1bbbf32d
NS
1533 assert(QEMU_IS_ALIGNED(offset, BDRV_SECTOR_SIZE));
1534 assert(QEMU_IS_ALIGNED(bytes, BDRV_SECTOR_SIZE));
4575eb49
KW
1535
1536 buf = g_try_malloc(bytes);
1537 if (bytes && buf == NULL) {
1538 return -ENOMEM;
1539 }
1540
2914caa0
PB
1541 qemu_co_mutex_lock(&s->lock);
1542 ret = vvfat_read(bs, sector_num, buf, nb_sectors);
1543 qemu_co_mutex_unlock(&s->lock);
4575eb49
KW
1544
1545 qemu_iovec_from_buf(qiov, 0, buf, bytes);
1546 g_free(buf);
1547
2914caa0
PB
1548 return ret;
1549}
1550
a046433a 1551/* LATER TODO: statify all functions */
de167e41 1552
a046433a
FB
1553/*
1554 * Idea of the write support (use snapshot):
de167e41 1555 *
a046433a
FB
1556 * 1. check if all data is consistent, recording renames, modifications,
1557 * new files and directories (in s->commits).
de167e41 1558 *
a046433a 1559 * 2. if the data is not consistent, stop committing
de167e41 1560 *
a046433a
FB
1561 * 3. handle renames, and create new files and directories (do not yet
1562 * write their contents)
de167e41 1563 *
a046433a
FB
1564 * 4. walk the directories, fixing the mapping and direntries, and marking
1565 * the handled mappings as not deleted
de167e41 1566 *
a046433a 1567 * 5. commit the contents of the files
de167e41 1568 *
a046433a 1569 * 6. handle deleted files and directories
de167e41
FB
1570 *
1571 */
1572
c227f099 1573typedef struct commit_t {
a046433a
FB
1574 char* path;
1575 union {
d6a7e54e
HP
1576 struct { uint32_t cluster; } rename;
1577 struct { int dir_index; uint32_t modified_offset; } writeout;
1578 struct { uint32_t first_cluster; } new_file;
1579 struct { uint32_t cluster; } mkdir;
a046433a
FB
1580 } param;
1581 /* DELETEs and RMDIRs are handled differently: see handle_deletes() */
1582 enum {
d6a7e54e 1583 ACTION_RENAME, ACTION_WRITEOUT, ACTION_NEW_FILE, ACTION_MKDIR
a046433a 1584 } action;
c227f099 1585} commit_t;
de167e41 1586
a046433a 1587static void clear_commits(BDRVVVFATState* s)
de167e41
FB
1588{
1589 int i;
a046433a
FB
1590DLOG(fprintf(stderr, "clear_commits (%d commits)\n", s->commits.next));
1591 for (i = 0; i < s->commits.next; i++) {
d6a7e54e
HP
1592 commit_t* commit = array_get(&(s->commits), i);
1593 assert(commit->path || commit->action == ACTION_WRITEOUT);
1594 if (commit->action != ACTION_WRITEOUT) {
1595 assert(commit->path);
ce137829 1596 g_free(commit->path);
d6a7e54e
HP
1597 } else
1598 assert(commit->path == NULL);
de167e41 1599 }
a046433a 1600 s->commits.next = 0;
de167e41
FB
1601}
1602
a046433a 1603static void schedule_rename(BDRVVVFATState* s,
d6a7e54e 1604 uint32_t cluster, char* new_path)
de167e41 1605{
c227f099 1606 commit_t* commit = array_get_next(&(s->commits));
a046433a
FB
1607 commit->path = new_path;
1608 commit->param.rename.cluster = cluster;
1609 commit->action = ACTION_RENAME;
de167e41
FB
1610}
1611
a046433a 1612static void schedule_writeout(BDRVVVFATState* s,
d6a7e54e 1613 int dir_index, uint32_t modified_offset)
de167e41 1614{
c227f099 1615 commit_t* commit = array_get_next(&(s->commits));
a046433a
FB
1616 commit->path = NULL;
1617 commit->param.writeout.dir_index = dir_index;
1618 commit->param.writeout.modified_offset = modified_offset;
1619 commit->action = ACTION_WRITEOUT;
de167e41
FB
1620}
1621
a046433a 1622static void schedule_new_file(BDRVVVFATState* s,
d6a7e54e 1623 char* path, uint32_t first_cluster)
de167e41 1624{
c227f099 1625 commit_t* commit = array_get_next(&(s->commits));
a046433a
FB
1626 commit->path = path;
1627 commit->param.new_file.first_cluster = first_cluster;
1628 commit->action = ACTION_NEW_FILE;
1629}
1630
1631static void schedule_mkdir(BDRVVVFATState* s, uint32_t cluster, char* path)
1632{
c227f099 1633 commit_t* commit = array_get_next(&(s->commits));
a046433a
FB
1634 commit->path = path;
1635 commit->param.mkdir.cluster = cluster;
1636 commit->action = ACTION_MKDIR;
1637}
1638
1639typedef struct {
64eaabda
TS
1640 /*
1641 * Since the sequence number is at most 0x3f, and the filename
1642 * length is at most 13 times the sequence number, the maximal
1643 * filename length is 0x3f * 13 bytes.
1644 */
1645 unsigned char name[0x3f * 13 + 1];
e03da26b 1646 gunichar2 name2[0x3f * 13 + 1];
a046433a
FB
1647 int checksum, len;
1648 int sequence_number;
1649} long_file_name;
1650
1651static void lfn_init(long_file_name* lfn)
1652{
1653 lfn->sequence_number = lfn->len = 0;
1654 lfn->checksum = 0x100;
1655}
1656
1657/* return 0 if parsed successfully, > 0 if no long name, < 0 if error */
1658static int parse_long_name(long_file_name* lfn,
d6a7e54e 1659 const direntry_t* direntry)
a046433a
FB
1660{
1661 int i, j, offset;
1662 const unsigned char* pointer = (const unsigned char*)direntry;
1663
1664 if (!is_long_name(direntry))
d6a7e54e 1665 return 1;
a046433a
FB
1666
1667 if (pointer[0] & 0x40) {
e03da26b 1668 /* first entry; do some initialization */
d6a7e54e
HP
1669 lfn->sequence_number = pointer[0] & 0x3f;
1670 lfn->checksum = pointer[13];
1671 lfn->name[0] = 0;
1672 lfn->name[lfn->sequence_number * 13] = 0;
e03da26b
HP
1673 } else if ((pointer[0] & 0x3f) != --lfn->sequence_number) {
1674 /* not the expected sequence number */
d6a7e54e 1675 return -1;
e03da26b
HP
1676 } else if (pointer[13] != lfn->checksum) {
1677 /* not the expected checksum */
d6a7e54e 1678 return -2;
e03da26b
HP
1679 } else if (pointer[12] || pointer[26] || pointer[27]) {
1680 /* invalid zero fields */
d6a7e54e 1681 return -3;
e03da26b 1682 }
a046433a
FB
1683
1684 offset = 13 * (lfn->sequence_number - 1);
1685 for (i = 0, j = 1; i < 13; i++, j+=2) {
d6a7e54e
HP
1686 if (j == 11)
1687 j = 14;
1688 else if (j == 26)
1689 j = 28;
a046433a 1690
e03da26b
HP
1691 if (pointer[j] == 0 && pointer[j + 1] == 0) {
1692 /* end of long file name */
1693 break;
1694 }
1695 gunichar2 c = (pointer[j + 1] << 8) + pointer[j];
1696 lfn->name2[offset + i] = c;
de167e41 1697 }
a046433a 1698
e03da26b
HP
1699 if (pointer[0] & 0x40) {
1700 /* first entry; set len */
1701 lfn->len = offset + i;
1702 }
1703 if ((pointer[0] & 0x3f) == 0x01) {
1704 /* last entry; finalize entry */
1705 glong olen;
1706 gchar *utf8 = g_utf16_to_utf8(lfn->name2, lfn->len, NULL, &olen, NULL);
1707 if (!utf8) {
1708 return -4;
1709 }
1710 lfn->len = olen;
1711 memcpy(lfn->name, utf8, olen + 1);
1712 g_free(utf8);
1713 }
a046433a 1714
de167e41
FB
1715 return 0;
1716}
1717
a046433a
FB
1718/* returns 0 if successful, >0 if no short_name, and <0 on error */
1719static int parse_short_name(BDRVVVFATState* s,
d6a7e54e 1720 long_file_name* lfn, direntry_t* direntry)
de167e41 1721{
a046433a 1722 int i, j;
de167e41 1723
a046433a 1724 if (!is_short_name(direntry))
d6a7e54e 1725 return 1;
a046433a
FB
1726
1727 for (j = 7; j >= 0 && direntry->name[j] == ' '; j--);
1728 for (i = 0; i <= j; i++) {
e03da26b
HP
1729 uint8_t c = direntry->name[i];
1730 if (c != to_valid_short_char(c)) {
d6a7e54e 1731 return -1;
e03da26b 1732 } else if (s->downcase_short_names) {
d6a7e54e 1733 lfn->name[i] = qemu_tolower(direntry->name[i]);
e03da26b 1734 } else {
d6a7e54e 1735 lfn->name[i] = direntry->name[i];
e03da26b 1736 }
de167e41
FB
1737 }
1738
f671d173
SW
1739 for (j = 2; j >= 0 && direntry->name[8 + j] == ' '; j--) {
1740 }
a046433a 1741 if (j >= 0) {
d6a7e54e
HP
1742 lfn->name[i++] = '.';
1743 lfn->name[i + j + 1] = '\0';
1744 for (;j >= 0; j--) {
f671d173 1745 uint8_t c = direntry->name[8 + j];
e03da26b 1746 if (c != to_valid_short_char(c)) {
f671d173
SW
1747 return -2;
1748 } else if (s->downcase_short_names) {
1749 lfn->name[i + j] = qemu_tolower(c);
1750 } else {
1751 lfn->name[i + j] = c;
1752 }
d6a7e54e 1753 }
a046433a 1754 } else
d6a7e54e 1755 lfn->name[i + j + 1] = '\0';
a046433a 1756
8c4517fd
HP
1757 if (lfn->name[0] == DIR_KANJI_FAKE) {
1758 lfn->name[0] = DIR_KANJI;
78f002c9 1759 }
ffe8ab83 1760 lfn->len = strlen((char*)lfn->name);
a046433a
FB
1761
1762 return 0;
de167e41
FB
1763}
1764
a046433a 1765static inline uint32_t modified_fat_get(BDRVVVFATState* s,
d6a7e54e 1766 unsigned int cluster)
de167e41 1767{
a046433a 1768 if (cluster < s->last_cluster_of_root_directory) {
d6a7e54e
HP
1769 if (cluster + 1 == s->last_cluster_of_root_directory)
1770 return s->max_fat_value;
1771 else
1772 return cluster + 1;
a046433a
FB
1773 }
1774
1775 if (s->fat_type==32) {
1776 uint32_t* entry=((uint32_t*)s->fat2)+cluster;
1777 return le32_to_cpu(*entry);
1778 } else if (s->fat_type==16) {
1779 uint16_t* entry=((uint16_t*)s->fat2)+cluster;
1780 return le16_to_cpu(*entry);
1781 } else {
1782 const uint8_t* x=s->fat2+cluster*3/2;
1783 return ((x[0]|(x[1]<<8))>>(cluster&1?4:0))&0x0fff;
1784 }
1785}
1786
6f712ee0
EB
1787static inline bool cluster_was_modified(BDRVVVFATState *s,
1788 uint32_t cluster_num)
a046433a
FB
1789{
1790 int was_modified = 0;
d6a644bb 1791 int i;
a046433a 1792
eecc7747
KW
1793 if (s->qcow == NULL) {
1794 return 0;
1795 }
a046433a 1796
eecc7747
KW
1797 for (i = 0; !was_modified && i < s->sectors_per_cluster; i++) {
1798 was_modified = bdrv_is_allocated(s->qcow->bs,
d6a644bb
EB
1799 (cluster2sector(s, cluster_num) +
1800 i) * BDRV_SECTOR_SIZE,
1801 BDRV_SECTOR_SIZE, NULL);
eecc7747 1802 }
a046433a 1803
6f712ee0
EB
1804 /*
1805 * Note that this treats failures to learn allocation status the
1806 * same as if an allocation has occurred. It's as safe as
1807 * anything else, given that a failure to learn allocation status
1808 * will probably result in more failures.
1809 */
1810 return !!was_modified;
de167e41
FB
1811}
1812
a046433a 1813static const char* get_basename(const char* path)
de167e41 1814{
a046433a
FB
1815 char* basename = strrchr(path, '/');
1816 if (basename == NULL)
d6a7e54e 1817 return path;
a046433a 1818 else
d6a7e54e 1819 return basename + 1; /* strip '/' */
de167e41
FB
1820}
1821
a046433a
FB
1822/*
1823 * The array s->used_clusters holds the states of the clusters. If it is
1824 * part of a file, it has bit 2 set, in case of a directory, bit 1. If it
1825 * was modified, bit 3 is set.
1826 * If any cluster is allocated, but not part of a file or directory, this
1827 * driver refuses to commit.
1828 */
1829typedef enum {
1830 USED_DIRECTORY = 1, USED_FILE = 2, USED_ANY = 3, USED_ALLOCATED = 4
c227f099 1831} used_t;
de167e41 1832
a046433a
FB
1833/*
1834 * get_cluster_count_for_direntry() not only determines how many clusters
1835 * are occupied by direntry, but also if it was renamed or modified.
1836 *
1837 * A file is thought to be renamed *only* if there already was a file with
1838 * exactly the same first cluster, but a different name.
1839 *
1840 * Further, the files/directories handled by this function are
1841 * assumed to be *not* deleted (and *only* those).
1842 */
1843static uint32_t get_cluster_count_for_direntry(BDRVVVFATState* s,
d6a7e54e 1844 direntry_t* direntry, const char* path)
de167e41 1845{
a046433a
FB
1846 /*
1847 * This is a little bit tricky:
1848 * IF the guest OS just inserts a cluster into the file chain,
1849 * and leaves the rest alone, (i.e. the original file had clusters
1850 * 15 -> 16, but now has 15 -> 32 -> 16), then the following happens:
1851 *
1852 * - do_commit will write the cluster into the file at the given
1853 * offset, but
1854 *
1855 * - the cluster which is overwritten should be moved to a later
1856 * position in the file.
1857 *
1858 * I am not aware that any OS does something as braindead, but this
1859 * situation could happen anyway when not committing for a long time.
1860 * Just to be sure that this does not bite us, detect it, and copy the
1861 * contents of the clusters to-be-overwritten into the qcow.
1862 */
1863 int copy_it = 0;
1864 int was_modified = 0;
1865 int32_t ret = 0;
1866
1867 uint32_t cluster_num = begin_of_direntry(direntry);
1868 uint32_t offset = 0;
1869 int first_mapping_index = -1;
c227f099 1870 mapping_t* mapping = NULL;
a046433a 1871 const char* basename2 = NULL;
de167e41 1872
a046433a 1873 vvfat_close_current_file(s);
de167e41 1874
a046433a
FB
1875 /* the root directory */
1876 if (cluster_num == 0)
d6a7e54e 1877 return 0;
de167e41 1878
a046433a
FB
1879 /* write support */
1880 if (s->qcow) {
d6a7e54e 1881 basename2 = get_basename(path);
de167e41 1882
d6a7e54e 1883 mapping = find_mapping_for_cluster(s, cluster_num);
a046433a 1884
d6a7e54e
HP
1885 if (mapping) {
1886 const char* basename;
da2414e9 1887
d6a7e54e
HP
1888 assert(mapping->mode & MODE_DELETED);
1889 mapping->mode &= ~MODE_DELETED;
a046433a 1890
d6a7e54e 1891 basename = get_basename(mapping->path);
a046433a 1892
d6a7e54e 1893 assert(mapping->mode & MODE_NORMAL);
a046433a 1894
d6a7e54e
HP
1895 /* rename */
1896 if (strcmp(basename, basename2))
1897 schedule_rename(s, cluster_num, g_strdup(path));
1898 } else if (is_file(direntry))
1899 /* new file */
1900 schedule_new_file(s, g_strdup(path), cluster_num);
1901 else {
43dc2a64 1902 abort();
d6a7e54e
HP
1903 return 0;
1904 }
de167e41
FB
1905 }
1906
a046433a 1907 while(1) {
d6a7e54e
HP
1908 if (s->qcow) {
1909 if (!copy_it && cluster_was_modified(s, cluster_num)) {
1910 if (mapping == NULL ||
1911 mapping->begin > cluster_num ||
1912 mapping->end <= cluster_num)
1913 mapping = find_mapping_for_cluster(s, cluster_num);
de167e41 1914
a046433a 1915
d6a7e54e
HP
1916 if (mapping &&
1917 (mapping->mode & MODE_DIRECTORY) == 0) {
a046433a 1918
d6a7e54e
HP
1919 /* was modified in qcow */
1920 if (offset != mapping->info.file.offset + s->cluster_size
1921 * (cluster_num - mapping->begin)) {
1922 /* offset of this cluster in file chain has changed */
43dc2a64 1923 abort();
d6a7e54e
HP
1924 copy_it = 1;
1925 } else if (offset == 0) {
1926 const char* basename = get_basename(mapping->path);
a046433a 1927
d6a7e54e
HP
1928 if (strcmp(basename, basename2))
1929 copy_it = 1;
1930 first_mapping_index = array_index(&(s->mapping), mapping);
1931 }
a046433a 1932
d6a7e54e
HP
1933 if (mapping->first_mapping_index != first_mapping_index
1934 && mapping->info.file.offset > 0) {
43dc2a64 1935 abort();
d6a7e54e
HP
1936 copy_it = 1;
1937 }
1938
1939 /* need to write out? */
1940 if (!was_modified && is_file(direntry)) {
1941 was_modified = 1;
1942 schedule_writeout(s, mapping->dir_index, offset);
1943 }
1944 }
1945 }
1946
1947 if (copy_it) {
d6a644bb 1948 int i;
d6a7e54e
HP
1949 /*
1950 * This is horribly inefficient, but that is okay, since
1951 * it is rarely executed, if at all.
1952 */
1953 int64_t offset = cluster2sector(s, cluster_num);
1954
1955 vvfat_close_current_file(s);
7704df98 1956 for (i = 0; i < s->sectors_per_cluster; i++) {
eecc7747
KW
1957 int res;
1958
d6a644bb
EB
1959 res = bdrv_is_allocated(s->qcow->bs,
1960 (offset + i) * BDRV_SECTOR_SIZE,
1961 BDRV_SECTOR_SIZE, NULL);
6f712ee0
EB
1962 if (res < 0) {
1963 return -1;
1964 }
eecc7747
KW
1965 if (!res) {
1966 res = vvfat_read(s->bs, offset, s->cluster_buffer, 1);
1967 if (res) {
7704df98
KW
1968 return -1;
1969 }
e5a0a678
AG
1970 res = bdrv_pwrite(s->qcow, offset * BDRV_SECTOR_SIZE,
1971 s->cluster_buffer, BDRV_SECTOR_SIZE);
1972 if (res < 0) {
7704df98
KW
1973 return -2;
1974 }
1975 }
1976 }
d6a7e54e
HP
1977 }
1978 }
a046433a 1979
d6a7e54e
HP
1980 ret++;
1981 if (s->used_clusters[cluster_num] & USED_ANY)
1982 return 0;
1983 s->used_clusters[cluster_num] = USED_FILE;
a046433a 1984
d6a7e54e 1985 cluster_num = modified_fat_get(s, cluster_num);
a046433a 1986
d6a7e54e
HP
1987 if (fat_eof(s, cluster_num))
1988 return ret;
1989 else if (cluster_num < 2 || cluster_num > s->max_fat_value - 16)
1990 return -1;
a046433a 1991
d6a7e54e 1992 offset += s->cluster_size;
a046433a 1993 }
de167e41
FB
1994}
1995
a046433a 1996/*
5fafdf24 1997 * This function looks at the modified data (qcow).
a046433a
FB
1998 * It returns 0 upon inconsistency or error, and the number of clusters
1999 * used by the directory, its subdirectories and their files.
2000 */
2001static int check_directory_consistency(BDRVVVFATState *s,
d6a7e54e 2002 int cluster_num, const char* path)
de167e41 2003{
a046433a 2004 int ret = 0;
7267c094 2005 unsigned char* cluster = g_malloc(s->cluster_size);
c227f099
AL
2006 direntry_t* direntries = (direntry_t*)cluster;
2007 mapping_t* mapping = find_mapping_for_cluster(s, cluster_num);
a046433a
FB
2008
2009 long_file_name lfn;
2010 int path_len = strlen(path);
0d460d6f 2011 char path2[PATH_MAX + 1];
a046433a
FB
2012
2013 assert(path_len < PATH_MAX); /* len was tested before! */
363a37d5 2014 pstrcpy(path2, sizeof(path2), path);
a046433a
FB
2015 path2[path_len] = '/';
2016 path2[path_len + 1] = '\0';
2017
2018 if (mapping) {
d6a7e54e
HP
2019 const char* basename = get_basename(mapping->path);
2020 const char* basename2 = get_basename(path);
a046433a 2021
d6a7e54e 2022 assert(mapping->mode & MODE_DIRECTORY);
a046433a 2023
d6a7e54e
HP
2024 assert(mapping->mode & MODE_DELETED);
2025 mapping->mode &= ~MODE_DELETED;
a046433a 2026
d6a7e54e
HP
2027 if (strcmp(basename, basename2))
2028 schedule_rename(s, cluster_num, g_strdup(path));
a046433a 2029 } else
d6a7e54e
HP
2030 /* new directory */
2031 schedule_mkdir(s, cluster_num, g_strdup(path));
3b46e624 2032
a046433a
FB
2033 lfn_init(&lfn);
2034 do {
d6a7e54e
HP
2035 int i;
2036 int subret = 0;
a046433a 2037
d6a7e54e 2038 ret++;
a046433a 2039
d6a7e54e
HP
2040 if (s->used_clusters[cluster_num] & USED_ANY) {
2041 fprintf(stderr, "cluster %d used more than once\n", (int)cluster_num);
6262bbd3 2042 goto fail;
d6a7e54e
HP
2043 }
2044 s->used_clusters[cluster_num] = USED_DIRECTORY;
a046433a
FB
2045
2046DLOG(fprintf(stderr, "read cluster %d (sector %d)\n", (int)cluster_num, (int)cluster2sector(s, cluster_num)));
d6a7e54e
HP
2047 subret = vvfat_read(s->bs, cluster2sector(s, cluster_num), cluster,
2048 s->sectors_per_cluster);
2049 if (subret) {
2050 fprintf(stderr, "Error fetching direntries\n");
2051 fail:
ce137829 2052 g_free(cluster);
d6a7e54e
HP
2053 return 0;
2054 }
a046433a 2055
d6a7e54e
HP
2056 for (i = 0; i < 0x10 * s->sectors_per_cluster; i++) {
2057 int cluster_count = 0;
a046433a 2058
b2bedb21 2059DLOG(fprintf(stderr, "check direntry %d:\n", i); print_direntry(direntries + i));
d6a7e54e
HP
2060 if (is_volume_label(direntries + i) || is_dot(direntries + i) ||
2061 is_free(direntries + i))
2062 continue;
2063
2064 subret = parse_long_name(&lfn, direntries + i);
2065 if (subret < 0) {
2066 fprintf(stderr, "Error in long name\n");
2067 goto fail;
2068 }
2069 if (subret == 0 || is_free(direntries + i))
2070 continue;
2071
2072 if (fat_chksum(direntries+i) != lfn.checksum) {
2073 subret = parse_short_name(s, &lfn, direntries + i);
2074 if (subret < 0) {
2075 fprintf(stderr, "Error in short name (%d)\n", subret);
2076 goto fail;
2077 }
2078 if (subret > 0 || !strcmp((char*)lfn.name, ".")
2079 || !strcmp((char*)lfn.name, ".."))
2080 continue;
2081 }
2082 lfn.checksum = 0x100; /* cannot use long name twice */
2083
c79e243e
KW
2084 if (!valid_filename(lfn.name)) {
2085 fprintf(stderr, "Invalid file name\n");
2086 goto fail;
2087 }
d6a7e54e
HP
2088 if (path_len + 1 + lfn.len >= PATH_MAX) {
2089 fprintf(stderr, "Name too long: %s/%s\n", path, lfn.name);
2090 goto fail;
2091 }
363a37d5
BS
2092 pstrcpy(path2 + path_len + 1, sizeof(path2) - path_len - 1,
2093 (char*)lfn.name);
a046433a 2094
d6a7e54e
HP
2095 if (is_directory(direntries + i)) {
2096 if (begin_of_direntry(direntries + i) == 0) {
2097 DLOG(fprintf(stderr, "invalid begin for directory: %s\n", path2); print_direntry(direntries + i));
2098 goto fail;
2099 }
2100 cluster_count = check_directory_consistency(s,
2101 begin_of_direntry(direntries + i), path2);
2102 if (cluster_count == 0) {
2103 DLOG(fprintf(stderr, "problem in directory %s:\n", path2); print_direntry(direntries + i));
2104 goto fail;
2105 }
2106 } else if (is_file(direntries + i)) {
2107 /* check file size with FAT */
2108 cluster_count = get_cluster_count_for_direntry(s, direntries + i, path2);
2109 if (cluster_count !=
13385ae1 2110 DIV_ROUND_UP(le32_to_cpu(direntries[i].size), s->cluster_size)) {
d6a7e54e
HP
2111 DLOG(fprintf(stderr, "Cluster count mismatch\n"));
2112 goto fail;
2113 }
2114 } else
43dc2a64 2115 abort(); /* cluster_count = 0; */
a046433a 2116
d6a7e54e
HP
2117 ret += cluster_count;
2118 }
de167e41 2119
d6a7e54e 2120 cluster_num = modified_fat_get(s, cluster_num);
a046433a 2121 } while(!fat_eof(s, cluster_num));
de167e41 2122
ce137829 2123 g_free(cluster);
a046433a
FB
2124 return ret;
2125}
2126
2127/* returns 1 on success */
2128static int is_consistent(BDRVVVFATState* s)
2129{
2130 int i, check;
2131 int used_clusters_count = 0;
2132
2133DLOG(checkpoint());
2134 /*
2135 * - get modified FAT
2136 * - compare the two FATs (TODO)
2137 * - get buffer for marking used clusters
f4649069 2138 * - recurse direntries from root (using bs->bdrv_pread to make
a046433a
FB
2139 * sure to get the new data)
2140 * - check that the FAT agrees with the size
2141 * - count the number of clusters occupied by this directory and
2142 * its files
2143 * - check that the cumulative used cluster count agrees with the
2144 * FAT
2145 * - if all is fine, return number of used clusters
2146 */
2147 if (s->fat2 == NULL) {
d6a7e54e
HP
2148 int size = 0x200 * s->sectors_per_fat;
2149 s->fat2 = g_malloc(size);
2150 memcpy(s->fat2, s->fat.pointer, size);
a046433a
FB
2151 }
2152 check = vvfat_read(s->bs,
4dc705dc 2153 s->offset_to_fat, s->fat2, s->sectors_per_fat);
a046433a 2154 if (check) {
d6a7e54e
HP
2155 fprintf(stderr, "Could not copy fat\n");
2156 return 0;
a046433a
FB
2157 }
2158 assert (s->used_clusters);
2159 for (i = 0; i < sector2cluster(s, s->sector_count); i++)
d6a7e54e 2160 s->used_clusters[i] &= ~USED_ANY;
a046433a
FB
2161
2162 clear_commits(s);
2163
2164 /* mark every mapped file/directory as deleted.
2165 * (check_directory_consistency() will unmark those still present). */
2166 if (s->qcow)
d6a7e54e
HP
2167 for (i = 0; i < s->mapping.next; i++) {
2168 mapping_t* mapping = array_get(&(s->mapping), i);
2169 if (mapping->first_mapping_index < 0)
2170 mapping->mode |= MODE_DELETED;
2171 }
a046433a
FB
2172
2173 used_clusters_count = check_directory_consistency(s, 0, s->path);
2174 if (used_clusters_count <= 0) {
d6a7e54e
HP
2175 DLOG(fprintf(stderr, "problem in directory\n"));
2176 return 0;
de167e41
FB
2177 }
2178
a046433a
FB
2179 check = s->last_cluster_of_root_directory;
2180 for (i = check; i < sector2cluster(s, s->sector_count); i++) {
d6a7e54e
HP
2181 if (modified_fat_get(s, i)) {
2182 if(!s->used_clusters[i]) {
2183 DLOG(fprintf(stderr, "FAT was modified (%d), but cluster is not used?\n", i));
2184 return 0;
2185 }
2186 check++;
2187 }
a046433a 2188
d6a7e54e
HP
2189 if (s->used_clusters[i] == USED_ALLOCATED) {
2190 /* allocated, but not used... */
2191 DLOG(fprintf(stderr, "unused, modified cluster: %d\n", i));
2192 return 0;
2193 }
a046433a
FB
2194 }
2195
2196 if (check != used_clusters_count)
d6a7e54e 2197 return 0;
a046433a
FB
2198
2199 return used_clusters_count;
2200}
2201
2202static inline void adjust_mapping_indices(BDRVVVFATState* s,
d6a7e54e 2203 int offset, int adjust)
a046433a
FB
2204{
2205 int i;
2206
2207 for (i = 0; i < s->mapping.next; i++) {
d6a7e54e 2208 mapping_t* mapping = array_get(&(s->mapping), i);
a046433a
FB
2209
2210#define ADJUST_MAPPING_INDEX(name) \
d6a7e54e
HP
2211 if (mapping->name >= offset) \
2212 mapping->name += adjust
a046433a 2213
d6a7e54e
HP
2214 ADJUST_MAPPING_INDEX(first_mapping_index);
2215 if (mapping->mode & MODE_DIRECTORY)
2216 ADJUST_MAPPING_INDEX(info.dir.parent_mapping_index);
de167e41 2217 }
a046433a
FB
2218}
2219
2220/* insert or update mapping */
c227f099 2221static mapping_t* insert_mapping(BDRVVVFATState* s,
d6a7e54e 2222 uint32_t begin, uint32_t end)
a046433a
FB
2223{
2224 /*
2225 * - find mapping where mapping->begin >= begin,
2226 * - if mapping->begin > begin: insert
2227 * - adjust all references to mappings!
2228 * - else: adjust
2229 * - replace name
2230 */
2231 int index = find_mapping_for_cluster_aux(s, begin, 0, s->mapping.next);
c227f099
AL
2232 mapping_t* mapping = NULL;
2233 mapping_t* first_mapping = array_get(&(s->mapping), 0);
a046433a
FB
2234
2235 if (index < s->mapping.next && (mapping = array_get(&(s->mapping), index))
d6a7e54e
HP
2236 && mapping->begin < begin) {
2237 mapping->end = begin;
2238 index++;
2239 mapping = array_get(&(s->mapping), index);
a046433a
FB
2240 }
2241 if (index >= s->mapping.next || mapping->begin > begin) {
d6a7e54e
HP
2242 mapping = array_insert(&(s->mapping), index, 1);
2243 mapping->path = NULL;
2244 adjust_mapping_indices(s, index, +1);
a046433a
FB
2245 }
2246
2247 mapping->begin = begin;
2248 mapping->end = end;
de167e41 2249
c227f099 2250DLOG(mapping_t* next_mapping;
a046433a
FB
2251assert(index + 1 >= s->mapping.next ||
2252((next_mapping = array_get(&(s->mapping), index + 1)) &&
2253 next_mapping->begin >= end)));
2254
c227f099 2255 if (s->current_mapping && first_mapping != (mapping_t*)s->mapping.pointer)
d6a7e54e
HP
2256 s->current_mapping = array_get(&(s->mapping),
2257 s->current_mapping - first_mapping);
a046433a
FB
2258
2259 return mapping;
2260}
2261
2262static int remove_mapping(BDRVVVFATState* s, int mapping_index)
2263{
c227f099
AL
2264 mapping_t* mapping = array_get(&(s->mapping), mapping_index);
2265 mapping_t* first_mapping = array_get(&(s->mapping), 0);
a046433a
FB
2266
2267 /* free mapping */
ce137829
SW
2268 if (mapping->first_mapping_index < 0) {
2269 g_free(mapping->path);
2270 }
a046433a
FB
2271
2272 /* remove from s->mapping */
2273 array_remove(&(s->mapping), mapping_index);
2274
2275 /* adjust all references to mappings */
2276 adjust_mapping_indices(s, mapping_index, -1);
2277
c227f099 2278 if (s->current_mapping && first_mapping != (mapping_t*)s->mapping.pointer)
d6a7e54e
HP
2279 s->current_mapping = array_get(&(s->mapping),
2280 s->current_mapping - first_mapping);
de167e41 2281
de167e41
FB
2282 return 0;
2283}
2284
a046433a
FB
2285static void adjust_dirindices(BDRVVVFATState* s, int offset, int adjust)
2286{
2287 int i;
2288 for (i = 0; i < s->mapping.next; i++) {
d6a7e54e
HP
2289 mapping_t* mapping = array_get(&(s->mapping), i);
2290 if (mapping->dir_index >= offset)
2291 mapping->dir_index += adjust;
2292 if ((mapping->mode & MODE_DIRECTORY) &&
2293 mapping->info.dir.first_dir_index >= offset)
2294 mapping->info.dir.first_dir_index += adjust;
a046433a
FB
2295 }
2296}
de167e41 2297
c227f099 2298static direntry_t* insert_direntries(BDRVVVFATState* s,
d6a7e54e 2299 int dir_index, int count)
de167e41 2300{
a046433a
FB
2301 /*
2302 * make room in s->directory,
2303 * adjust_dirindices
2304 */
c227f099 2305 direntry_t* result = array_insert(&(s->directory), dir_index, count);
a046433a 2306 if (result == NULL)
d6a7e54e 2307 return NULL;
a046433a 2308 adjust_dirindices(s, dir_index, count);
de167e41
FB
2309 return result;
2310}
2311
a046433a
FB
2312static int remove_direntries(BDRVVVFATState* s, int dir_index, int count)
2313{
2314 int ret = array_remove_slice(&(s->directory), dir_index, count);
2315 if (ret)
d6a7e54e 2316 return ret;
a046433a
FB
2317 adjust_dirindices(s, dir_index, -count);
2318 return 0;
2319}
de167e41 2320
a046433a
FB
2321/*
2322 * Adapt the mappings of the cluster chain starting at first cluster
2323 * (i.e. if a file starts at first_cluster, the chain is followed according
2324 * to the modified fat, and the corresponding entries in s->mapping are
2325 * adjusted)
2326 */
2327static int commit_mappings(BDRVVVFATState* s,
d6a7e54e 2328 uint32_t first_cluster, int dir_index)
de167e41 2329{
c227f099
AL
2330 mapping_t* mapping = find_mapping_for_cluster(s, first_cluster);
2331 direntry_t* direntry = array_get(&(s->directory), dir_index);
a046433a
FB
2332 uint32_t cluster = first_cluster;
2333
2334 vvfat_close_current_file(s);
2335
2336 assert(mapping);
2337 assert(mapping->begin == first_cluster);
2338 mapping->first_mapping_index = -1;
2339 mapping->dir_index = dir_index;
2340 mapping->mode = (dir_index <= 0 || is_directory(direntry)) ?
d6a7e54e 2341 MODE_DIRECTORY : MODE_NORMAL;
a046433a
FB
2342
2343 while (!fat_eof(s, cluster)) {
d6a7e54e
HP
2344 uint32_t c, c1;
2345
2346 for (c = cluster, c1 = modified_fat_get(s, c); c + 1 == c1;
2347 c = c1, c1 = modified_fat_get(s, c1));
2348
2349 c++;
2350 if (c > mapping->end) {
2351 int index = array_index(&(s->mapping), mapping);
2352 int i, max_i = s->mapping.next - index;
2353 for (i = 1; i < max_i && mapping[i].begin < c; i++);
2354 while (--i > 0)
2355 remove_mapping(s, index + 1);
2356 }
2357 assert(mapping == array_get(&(s->mapping), s->mapping.next - 1)
2358 || mapping[1].begin >= c);
2359 mapping->end = c;
2360
2361 if (!fat_eof(s, c1)) {
2362 int i = find_mapping_for_cluster_aux(s, c1, 0, s->mapping.next);
2363 mapping_t* next_mapping = i >= s->mapping.next ? NULL :
2364 array_get(&(s->mapping), i);
2365
2366 if (next_mapping == NULL || next_mapping->begin > c1) {
2367 int i1 = array_index(&(s->mapping), mapping);
2368
2369 next_mapping = insert_mapping(s, c1, c1+1);
2370
2371 if (c1 < c)
2372 i1++;
2373 mapping = array_get(&(s->mapping), i1);
2374 }
2375
2376 next_mapping->dir_index = mapping->dir_index;
2377 next_mapping->first_mapping_index =
2378 mapping->first_mapping_index < 0 ?
2379 array_index(&(s->mapping), mapping) :
2380 mapping->first_mapping_index;
2381 next_mapping->path = mapping->path;
2382 next_mapping->mode = mapping->mode;
2383 next_mapping->read_only = mapping->read_only;
2384 if (mapping->mode & MODE_DIRECTORY) {
2385 next_mapping->info.dir.parent_mapping_index =
2386 mapping->info.dir.parent_mapping_index;
2387 next_mapping->info.dir.first_dir_index =
2388 mapping->info.dir.first_dir_index +
2389 0x10 * s->sectors_per_cluster *
2390 (mapping->end - mapping->begin);
2391 } else
2392 next_mapping->info.file.offset = mapping->info.file.offset +
2393 mapping->end - mapping->begin;
2394
2395 mapping = next_mapping;
2396 }
2397
2398 cluster = c1;
a046433a 2399 }
de167e41 2400
de167e41
FB
2401 return 0;
2402}
2403
a046433a 2404static int commit_direntries(BDRVVVFATState* s,
d6a7e54e 2405 int dir_index, int parent_mapping_index)
de167e41 2406{
c227f099 2407 direntry_t* direntry = array_get(&(s->directory), dir_index);
a046433a 2408 uint32_t first_cluster = dir_index == 0 ? 0 : begin_of_direntry(direntry);
c227f099 2409 mapping_t* mapping = find_mapping_for_cluster(s, first_cluster);
a046433a
FB
2410 int factor = 0x10 * s->sectors_per_cluster;
2411 int old_cluster_count, new_cluster_count;
8d9401c2
LM
2412 int current_dir_index;
2413 int first_dir_index;
a046433a
FB
2414 int ret, i;
2415 uint32_t c;
2416
a046433a
FB
2417 assert(direntry);
2418 assert(mapping);
2419 assert(mapping->begin == first_cluster);
2420 assert(mapping->info.dir.first_dir_index < s->directory.next);
2421 assert(mapping->mode & MODE_DIRECTORY);
2422 assert(dir_index == 0 || is_directory(direntry));
2423
8d9401c2
LM
2424 DLOG(fprintf(stderr, "commit_direntries for %s, parent_mapping_index %d\n",
2425 mapping->path, parent_mapping_index));
2426
2427 current_dir_index = mapping->info.dir.first_dir_index;
2428 first_dir_index = current_dir_index;
a046433a
FB
2429 mapping->info.dir.parent_mapping_index = parent_mapping_index;
2430
2431 if (first_cluster == 0) {
d6a7e54e
HP
2432 old_cluster_count = new_cluster_count =
2433 s->last_cluster_of_root_directory;
a046433a 2434 } else {
d6a7e54e
HP
2435 for (old_cluster_count = 0, c = first_cluster; !fat_eof(s, c);
2436 c = fat_get(s, c))
2437 old_cluster_count++;
de167e41 2438
d6a7e54e
HP
2439 for (new_cluster_count = 0, c = first_cluster; !fat_eof(s, c);
2440 c = modified_fat_get(s, c))
2441 new_cluster_count++;
a046433a 2442 }
de167e41 2443
a046433a 2444 if (new_cluster_count > old_cluster_count) {
d6a7e54e
HP
2445 if (insert_direntries(s,
2446 current_dir_index + factor * old_cluster_count,
2447 factor * (new_cluster_count - old_cluster_count)) == NULL)
2448 return -1;
a046433a 2449 } else if (new_cluster_count < old_cluster_count)
d6a7e54e
HP
2450 remove_direntries(s,
2451 current_dir_index + factor * new_cluster_count,
2452 factor * (old_cluster_count - new_cluster_count));
a046433a
FB
2453
2454 for (c = first_cluster; !fat_eof(s, c); c = modified_fat_get(s, c)) {
ebb72c9f 2455 direntry_t *first_direntry;
d6a7e54e
HP
2456 void* direntry = array_get(&(s->directory), current_dir_index);
2457 int ret = vvfat_read(s->bs, cluster2sector(s, c), direntry,
2458 s->sectors_per_cluster);
2459 if (ret)
2460 return ret;
ebb72c9f
KW
2461
2462 /* The first directory entry on the filesystem is the volume name */
2463 first_direntry = (direntry_t*) s->directory.pointer;
2464 assert(!memcmp(first_direntry->name, s->volume_label, 11));
2465
d6a7e54e 2466 current_dir_index += factor;
a046433a 2467 }
de167e41 2468
a046433a
FB
2469 ret = commit_mappings(s, first_cluster, dir_index);
2470 if (ret)
d6a7e54e 2471 return ret;
a046433a
FB
2472
2473 /* recurse */
2474 for (i = 0; i < factor * new_cluster_count; i++) {
d6a7e54e
HP
2475 direntry = array_get(&(s->directory), first_dir_index + i);
2476 if (is_directory(direntry) && !is_dot(direntry)) {
2477 mapping = find_mapping_for_cluster(s, first_cluster);
8d9401c2
LM
2478 if (mapping == NULL) {
2479 return -1;
2480 }
d6a7e54e
HP
2481 assert(mapping->mode & MODE_DIRECTORY);
2482 ret = commit_direntries(s, first_dir_index + i,
2483 array_index(&(s->mapping), mapping));
2484 if (ret)
2485 return ret;
2486 }
a046433a 2487 }
de167e41 2488
a046433a
FB
2489 return 0;
2490}
de167e41 2491
a046433a
FB
2492/* commit one file (adjust contents, adjust mapping),
2493 return first_mapping_index */
2494static int commit_one_file(BDRVVVFATState* s,
d6a7e54e 2495 int dir_index, uint32_t offset)
a046433a 2496{
c227f099 2497 direntry_t* direntry = array_get(&(s->directory), dir_index);
a046433a
FB
2498 uint32_t c = begin_of_direntry(direntry);
2499 uint32_t first_cluster = c;
c227f099 2500 mapping_t* mapping = find_mapping_for_cluster(s, c);
a046433a 2501 uint32_t size = filesize_of_direntry(direntry);
443ba6be 2502 char *cluster;
a046433a
FB
2503 uint32_t i;
2504 int fd = 0;
2505
2506 assert(offset < size);
2507 assert((offset % s->cluster_size) == 0);
2508
8d9401c2
LM
2509 if (mapping == NULL) {
2510 return -1;
2511 }
2512
a046433a 2513 for (i = s->cluster_size; i < offset; i += s->cluster_size)
d6a7e54e 2514 c = modified_fat_get(s, c);
a046433a 2515
6165f4d8 2516 fd = qemu_open(mapping->path, O_RDWR | O_CREAT | O_BINARY, 0666);
a046433a 2517 if (fd < 0) {
d6a7e54e
HP
2518 fprintf(stderr, "Could not open %s... (%s, %d)\n", mapping->path,
2519 strerror(errno), errno);
d6a7e54e 2520 return fd;
de167e41 2521 }
ce137829
SW
2522 if (offset > 0) {
2523 if (lseek(fd, offset, SEEK_SET) != offset) {
2e1e79da 2524 qemu_close(fd);
ce137829
SW
2525 return -3;
2526 }
2527 }
a046433a 2528
443ba6be
KW
2529 cluster = g_malloc(s->cluster_size);
2530
a046433a 2531 while (offset < size) {
d6a7e54e
HP
2532 uint32_t c1;
2533 int rest_size = (size - offset > s->cluster_size ?
2534 s->cluster_size : size - offset);
2535 int ret;
a046433a 2536
d6a7e54e 2537 c1 = modified_fat_get(s, c);
a046433a 2538
d6a7e54e
HP
2539 assert((size - offset == 0 && fat_eof(s, c)) ||
2540 (size > offset && c >=2 && !fat_eof(s, c)));
a046433a 2541
d6a7e54e 2542 ret = vvfat_read(s->bs, cluster2sector(s, c),
78ee96de 2543 (uint8_t*)cluster, DIV_ROUND_UP(rest_size, 0x200));
a046433a 2544
ce137829 2545 if (ret < 0) {
2e1e79da 2546 qemu_close(fd);
ce137829
SW
2547 g_free(cluster);
2548 return ret;
2549 }
a046433a 2550
ce137829 2551 if (write(fd, cluster, rest_size) < 0) {
2e1e79da 2552 qemu_close(fd);
ce137829
SW
2553 g_free(cluster);
2554 return -2;
2555 }
a046433a 2556
d6a7e54e
HP
2557 offset += rest_size;
2558 c = c1;
a046433a
FB
2559 }
2560
2dedf83e
KS
2561 if (ftruncate(fd, size)) {
2562 perror("ftruncate()");
2e1e79da 2563 qemu_close(fd);
ce137829 2564 g_free(cluster);
2dedf83e
KS
2565 return -4;
2566 }
2e1e79da 2567 qemu_close(fd);
ce137829 2568 g_free(cluster);
a046433a
FB
2569
2570 return commit_mappings(s, first_cluster, dir_index);
2571}
2572
2573#ifdef DEBUG
2574/* test, if all mappings point to valid direntries */
2575static void check1(BDRVVVFATState* s)
2576{
2577 int i;
2578 for (i = 0; i < s->mapping.next; i++) {
d6a7e54e
HP
2579 mapping_t* mapping = array_get(&(s->mapping), i);
2580 if (mapping->mode & MODE_DELETED) {
2581 fprintf(stderr, "deleted\n");
2582 continue;
2583 }
2584 assert(mapping->dir_index < s->directory.next);
2585 direntry_t* direntry = array_get(&(s->directory), mapping->dir_index);
2586 assert(mapping->begin == begin_of_direntry(direntry) || mapping->first_mapping_index >= 0);
2587 if (mapping->mode & MODE_DIRECTORY) {
2588 assert(mapping->info.dir.first_dir_index + 0x10 * s->sectors_per_cluster * (mapping->end - mapping->begin) <= s->directory.next);
2589 assert((mapping->info.dir.first_dir_index % (0x10 * s->sectors_per_cluster)) == 0);
2590 }
de167e41 2591 }
de167e41
FB
2592}
2593
a046433a
FB
2594/* test, if all direntries have mappings */
2595static void check2(BDRVVVFATState* s)
de167e41 2596{
de167e41 2597 int i;
a046433a 2598 int first_mapping = -1;
de167e41 2599
a046433a 2600 for (i = 0; i < s->directory.next; i++) {
d6a7e54e
HP
2601 direntry_t* direntry = array_get(&(s->directory), i);
2602
2603 if (is_short_name(direntry) && begin_of_direntry(direntry)) {
2604 mapping_t* mapping = find_mapping_for_cluster(s, begin_of_direntry(direntry));
2605 assert(mapping);
2606 assert(mapping->dir_index == i || is_dot(direntry));
2607 assert(mapping->begin == begin_of_direntry(direntry) || is_dot(direntry));
2608 }
2609
2610 if ((i % (0x10 * s->sectors_per_cluster)) == 0) {
2611 /* cluster start */
2612 int j, count = 0;
2613
2614 for (j = 0; j < s->mapping.next; j++) {
2615 mapping_t* mapping = array_get(&(s->mapping), j);
2616 if (mapping->mode & MODE_DELETED)
2617 continue;
2618 if (mapping->mode & MODE_DIRECTORY) {
2619 if (mapping->info.dir.first_dir_index <= i && mapping->info.dir.first_dir_index + 0x10 * s->sectors_per_cluster > i) {
2620 assert(++count == 1);
2621 if (mapping->first_mapping_index == -1)
2622 first_mapping = array_index(&(s->mapping), mapping);
2623 else
2624 assert(first_mapping == mapping->first_mapping_index);
2625 if (mapping->info.dir.parent_mapping_index < 0)
2626 assert(j == 0);
2627 else {
2628 mapping_t* parent = array_get(&(s->mapping), mapping->info.dir.parent_mapping_index);
2629 assert(parent->mode & MODE_DIRECTORY);
2630 assert(parent->info.dir.first_dir_index < mapping->info.dir.first_dir_index);
2631 }
2632 }
2633 }
2634 }
2635 if (count == 0)
2636 first_mapping = -1;
2637 }
a046433a
FB
2638 }
2639}
2640#endif
de167e41 2641
a046433a
FB
2642static int handle_renames_and_mkdirs(BDRVVVFATState* s)
2643{
2644 int i;
de167e41 2645
a046433a
FB
2646#ifdef DEBUG
2647 fprintf(stderr, "handle_renames\n");
2648 for (i = 0; i < s->commits.next; i++) {
d6a7e54e
HP
2649 commit_t* commit = array_get(&(s->commits), i);
2650 fprintf(stderr, "%d, %s (%d, %d)\n", i, commit->path ? commit->path : "(null)", commit->param.rename.cluster, commit->action);
a046433a
FB
2651 }
2652#endif
2653
2654 for (i = 0; i < s->commits.next;) {
d6a7e54e
HP
2655 commit_t* commit = array_get(&(s->commits), i);
2656 if (commit->action == ACTION_RENAME) {
2657 mapping_t* mapping = find_mapping_for_cluster(s,
2658 commit->param.rename.cluster);
8d9401c2 2659 char *old_path;
d6a7e54e 2660
8d9401c2
LM
2661 if (mapping == NULL) {
2662 return -1;
2663 }
2664 old_path = mapping->path;
d6a7e54e
HP
2665 assert(commit->path);
2666 mapping->path = commit->path;
2667 if (rename(old_path, mapping->path))
2668 return -2;
2669
2670 if (mapping->mode & MODE_DIRECTORY) {
2671 int l1 = strlen(mapping->path);
2672 int l2 = strlen(old_path);
2673 int diff = l1 - l2;
2674 direntry_t* direntry = array_get(&(s->directory),
2675 mapping->info.dir.first_dir_index);
2676 uint32_t c = mapping->begin;
2677 int i = 0;
2678
2679 /* recurse */
2680 while (!fat_eof(s, c)) {
2681 do {
2682 direntry_t* d = direntry + i;
2683
2684 if (is_file(d) || (is_directory(d) && !is_dot(d))) {
8d9401c2
LM
2685 int l;
2686 char *new_path;
d6a7e54e
HP
2687 mapping_t* m = find_mapping_for_cluster(s,
2688 begin_of_direntry(d));
8d9401c2
LM
2689 if (m == NULL) {
2690 return -1;
2691 }
2692 l = strlen(m->path);
2693 new_path = g_malloc(l + diff + 1);
d6a7e54e
HP
2694
2695 assert(!strncmp(m->path, mapping->path, l2));
a046433a 2696
363a37d5
BS
2697 pstrcpy(new_path, l + diff + 1, mapping->path);
2698 pstrcpy(new_path + l1, l + diff + 1 - l1,
2699 m->path + l2);
a046433a 2700
d6a7e54e
HP
2701 schedule_rename(s, m->begin, new_path);
2702 }
2703 i++;
2704 } while((i % (0x10 * s->sectors_per_cluster)) != 0);
2705 c = fat_get(s, c);
2706 }
2707 }
de167e41 2708
ce137829 2709 g_free(old_path);
d6a7e54e
HP
2710 array_remove(&(s->commits), i);
2711 continue;
2712 } else if (commit->action == ACTION_MKDIR) {
2713 mapping_t* mapping;
2714 int j, parent_path_len;
a046433a 2715
48c2f068
FB
2716#ifdef __MINGW32__
2717 if (mkdir(commit->path))
2718 return -5;
2719#else
2720 if (mkdir(commit->path, 0755))
2721 return -5;
2722#endif
a046433a 2723
d6a7e54e
HP
2724 mapping = insert_mapping(s, commit->param.mkdir.cluster,
2725 commit->param.mkdir.cluster + 1);
2726 if (mapping == NULL)
2727 return -6;
2728
2729 mapping->mode = MODE_DIRECTORY;
2730 mapping->read_only = 0;
2731 mapping->path = commit->path;
2732 j = s->directory.next;
2733 assert(j);
2734 insert_direntries(s, s->directory.next,
2735 0x10 * s->sectors_per_cluster);
2736 mapping->info.dir.first_dir_index = j;
2737
2738 parent_path_len = strlen(commit->path)
2739 - strlen(get_basename(commit->path)) - 1;
2740 for (j = 0; j < s->mapping.next; j++) {
2741 mapping_t* m = array_get(&(s->mapping), j);
2742 if (m->first_mapping_index < 0 && m != mapping &&
2743 !strncmp(m->path, mapping->path, parent_path_len) &&
2744 strlen(m->path) == parent_path_len)
2745 break;
2746 }
2747 assert(j < s->mapping.next);
2748 mapping->info.dir.parent_mapping_index = j;
2749
2750 array_remove(&(s->commits), i);
2751 continue;
2752 }
2753
2754 i++;
a046433a
FB
2755 }
2756 return 0;
2757}
2758
2759/*
2760 * TODO: make sure that the short name is not matching *another* file
2761 */
2762static int handle_commits(BDRVVVFATState* s)
2763{
2764 int i, fail = 0;
2765
2766 vvfat_close_current_file(s);
2767
2768 for (i = 0; !fail && i < s->commits.next; i++) {
d6a7e54e
HP
2769 commit_t* commit = array_get(&(s->commits), i);
2770 switch(commit->action) {
2771 case ACTION_RENAME: case ACTION_MKDIR:
43dc2a64 2772 abort();
d6a7e54e
HP
2773 fail = -2;
2774 break;
2775 case ACTION_WRITEOUT: {
a6c6f76c
BS
2776#ifndef NDEBUG
2777 /* these variables are only used by assert() below */
d6a7e54e
HP
2778 direntry_t* entry = array_get(&(s->directory),
2779 commit->param.writeout.dir_index);
2780 uint32_t begin = begin_of_direntry(entry);
2781 mapping_t* mapping = find_mapping_for_cluster(s, begin);
a6c6f76c 2782#endif
a046433a 2783
d6a7e54e
HP
2784 assert(mapping);
2785 assert(mapping->begin == begin);
2786 assert(commit->path == NULL);
2787
2788 if (commit_one_file(s, commit->param.writeout.dir_index,
2789 commit->param.writeout.modified_offset))
2790 fail = -3;
2791
2792 break;
2793 }
2794 case ACTION_NEW_FILE: {
2795 int begin = commit->param.new_file.first_cluster;
2796 mapping_t* mapping = find_mapping_for_cluster(s, begin);
2797 direntry_t* entry;
2798 int i;
2799
2800 /* find direntry */
2801 for (i = 0; i < s->directory.next; i++) {
2802 entry = array_get(&(s->directory), i);
2803 if (is_file(entry) && begin_of_direntry(entry) == begin)
2804 break;
2805 }
2806
2807 if (i >= s->directory.next) {
2808 fail = -6;
2809 continue;
2810 }
2811
2812 /* make sure there exists an initial mapping */
2813 if (mapping && mapping->begin != begin) {
2814 mapping->end = begin;
2815 mapping = NULL;
2816 }
2817 if (mapping == NULL) {
2818 mapping = insert_mapping(s, begin, begin+1);
2819 }
2820 /* most members will be fixed in commit_mappings() */
2821 assert(commit->path);
2822 mapping->path = commit->path;
2823 mapping->read_only = 0;
2824 mapping->mode = MODE_NORMAL;
2825 mapping->info.file.offset = 0;
2826
2827 if (commit_one_file(s, i, 0))
2828 fail = -7;
2829
2830 break;
2831 }
2832 default:
43dc2a64 2833 abort();
d6a7e54e 2834 }
a046433a
FB
2835 }
2836 if (i > 0 && array_remove_slice(&(s->commits), 0, i))
d6a7e54e 2837 return -1;
a046433a
FB
2838 return fail;
2839}
2840
2841static int handle_deletes(BDRVVVFATState* s)
2842{
2843 int i, deferred = 1, deleted = 1;
2844
2845 /* delete files corresponding to mappings marked as deleted */
2846 /* handle DELETEs and unused mappings (modified_fat_get(s, mapping->begin) == 0) */
2847 while (deferred && deleted) {
d6a7e54e
HP
2848 deferred = 0;
2849 deleted = 0;
2850
2851 for (i = 1; i < s->mapping.next; i++) {
2852 mapping_t* mapping = array_get(&(s->mapping), i);
2853 if (mapping->mode & MODE_DELETED) {
2854 direntry_t* entry = array_get(&(s->directory),
2855 mapping->dir_index);
2856
2857 if (is_free(entry)) {
2858 /* remove file/directory */
2859 if (mapping->mode & MODE_DIRECTORY) {
2860 int j, next_dir_index = s->directory.next,
2861 first_dir_index = mapping->info.dir.first_dir_index;
2862
2863 if (rmdir(mapping->path) < 0) {
2864 if (errno == ENOTEMPTY) {
2865 deferred++;
2866 continue;
2867 } else
2868 return -5;
2869 }
2870
2871 for (j = 1; j < s->mapping.next; j++) {
2872 mapping_t* m = array_get(&(s->mapping), j);
2873 if (m->mode & MODE_DIRECTORY &&
2874 m->info.dir.first_dir_index >
2875 first_dir_index &&
2876 m->info.dir.first_dir_index <
2877 next_dir_index)
2878 next_dir_index =
2879 m->info.dir.first_dir_index;
2880 }
2881 remove_direntries(s, first_dir_index,
2882 next_dir_index - first_dir_index);
2883
2884 deleted++;
2885 }
2886 } else {
2887 if (unlink(mapping->path))
2888 return -4;
2889 deleted++;
2890 }
2891 DLOG(fprintf(stderr, "DELETE (%d)\n", i); print_mapping(mapping); print_direntry(entry));
2892 remove_mapping(s, i);
2893 }
2894 }
de167e41 2895 }
a046433a
FB
2896
2897 return 0;
2898}
2899
2900/*
2901 * synchronize mapping with new state:
2902 *
f4649069 2903 * - copy FAT (with bdrv_pread)
a046433a 2904 * - mark all filenames corresponding to mappings as deleted
f4649069 2905 * - recurse direntries from root (using bs->bdrv_pread)
a046433a
FB
2906 * - delete files corresponding to mappings marked as deleted
2907 */
2908static int do_commit(BDRVVVFATState* s)
2909{
2910 int ret = 0;
2911
2912 /* the real meat are the commits. Nothing to do? Move along! */
2913 if (s->commits.next == 0)
d6a7e54e 2914 return 0;
a046433a
FB
2915
2916 vvfat_close_current_file(s);
2917
2918 ret = handle_renames_and_mkdirs(s);
2919 if (ret) {
d6a7e54e 2920 fprintf(stderr, "Error handling renames (%d)\n", ret);
43dc2a64 2921 abort();
d6a7e54e 2922 return ret;
a046433a
FB
2923 }
2924
f4649069 2925 /* copy FAT (with bdrv_pread) */
a046433a
FB
2926 memcpy(s->fat.pointer, s->fat2, 0x200 * s->sectors_per_fat);
2927
f4649069 2928 /* recurse direntries from root (using bs->bdrv_pread) */
a046433a
FB
2929 ret = commit_direntries(s, 0, -1);
2930 if (ret) {
d6a7e54e 2931 fprintf(stderr, "Fatal: error while committing (%d)\n", ret);
43dc2a64 2932 abort();
d6a7e54e 2933 return ret;
a046433a
FB
2934 }
2935
2936 ret = handle_commits(s);
2937 if (ret) {
d6a7e54e 2938 fprintf(stderr, "Error handling commits (%d)\n", ret);
43dc2a64 2939 abort();
d6a7e54e 2940 return ret;
a046433a
FB
2941 }
2942
2943 ret = handle_deletes(s);
2944 if (ret) {
d6a7e54e 2945 fprintf(stderr, "Error deleting\n");
43dc2a64 2946 abort();
d6a7e54e 2947 return ret;
a046433a
FB
2948 }
2949
f844ec01 2950 bdrv_make_empty(s->qcow, NULL);
a046433a
FB
2951
2952 memset(s->used_clusters, 0, sector2cluster(s, s->sector_count));
2953
2954DLOG(checkpoint());
2955 return 0;
2956}
2957
2958static int try_commit(BDRVVVFATState* s)
2959{
2960 vvfat_close_current_file(s);
2961DLOG(checkpoint());
2962 if(!is_consistent(s))
d6a7e54e 2963 return -1;
a046433a
FB
2964 return do_commit(s);
2965}
2966
5fafdf24 2967static int vvfat_write(BlockDriverState *bs, int64_t sector_num,
a046433a
FB
2968 const uint8_t *buf, int nb_sectors)
2969{
5fafdf24 2970 BDRVVVFATState *s = bs->opaque;
a046433a
FB
2971 int i, ret;
2972
2973DLOG(checkpoint());
2974
ac48e389
KW
2975 /* Check if we're operating in read-only mode */
2976 if (s->qcow == NULL) {
2977 return -EACCES;
2978 }
2979
a046433a
FB
2980 vvfat_close_current_file(s);
2981
2982 /*
2983 * Some sanity checks:
2984 * - do not allow writing to the boot sector
a046433a
FB
2985 */
2986
4dc705dc 2987 if (sector_num < s->offset_to_fat)
d6a7e54e 2988 return -1;
a046433a
FB
2989
2990 for (i = sector2cluster(s, sector_num);
d6a7e54e
HP
2991 i <= sector2cluster(s, sector_num + nb_sectors - 1);) {
2992 mapping_t* mapping = find_mapping_for_cluster(s, i);
2993 if (mapping) {
2994 if (mapping->read_only) {
2995 fprintf(stderr, "Tried to write to write-protected file %s\n",
2996 mapping->path);
2997 return -1;
2998 }
2999
3000 if (mapping->mode & MODE_DIRECTORY) {
3001 int begin = cluster2sector(s, i);
3002 int end = begin + s->sectors_per_cluster, k;
3003 int dir_index;
3004 const direntry_t* direntries;
3005 long_file_name lfn;
3006
3007 lfn_init(&lfn);
3008
3009 if (begin < sector_num)
3010 begin = sector_num;
3011 if (end > sector_num + nb_sectors)
3012 end = sector_num + nb_sectors;
3013 dir_index = mapping->dir_index +
3014 0x10 * (begin - mapping->begin * s->sectors_per_cluster);
3015 direntries = (direntry_t*)(buf + 0x200 * (begin - sector_num));
3016
3017 for (k = 0; k < (end - begin) * 0x10; k++) {
d6a7e54e 3018 /* no access to the direntry of a read-only file */
e03da26b 3019 if (is_short_name(direntries + k) &&
d6a7e54e
HP
3020 (direntries[k].attributes & 1)) {
3021 if (memcmp(direntries + k,
3022 array_get(&(s->directory), dir_index + k),
3023 sizeof(direntry_t))) {
2ab4b135
AF
3024 warn_report("tried to write to write-protected "
3025 "file");
d6a7e54e
HP
3026 return -1;
3027 }
3028 }
3029 }
3030 }
3031 i = mapping->end;
3032 } else
3033 i++;
a046433a
FB
3034 }
3035
3036 /*
3037 * Use qcow backend. Commit later.
3038 */
3039DLOG(fprintf(stderr, "Write to qcow backend: %d + %d\n", (int)sector_num, nb_sectors));
e5a0a678
AG
3040 ret = bdrv_pwrite(s->qcow, sector_num * BDRV_SECTOR_SIZE, buf,
3041 nb_sectors * BDRV_SECTOR_SIZE);
a046433a 3042 if (ret < 0) {
d6a7e54e
HP
3043 fprintf(stderr, "Error writing to qcow backend\n");
3044 return ret;
a046433a
FB
3045 }
3046
3047 for (i = sector2cluster(s, sector_num);
d6a7e54e
HP
3048 i <= sector2cluster(s, sector_num + nb_sectors - 1); i++)
3049 if (i >= 0)
3050 s->used_clusters[i] |= USED_ALLOCATED;
a046433a
FB
3051
3052DLOG(checkpoint());
3053 /* TODO: add timeout */
3054 try_commit(s);
3055
3056DLOG(checkpoint());
3057 return 0;
3058}
3059
4575eb49
KW
3060static int coroutine_fn
3061vvfat_co_pwritev(BlockDriverState *bs, uint64_t offset, uint64_t bytes,
3062 QEMUIOVector *qiov, int flags)
e183ef75
PB
3063{
3064 int ret;
3065 BDRVVVFATState *s = bs->opaque;
4575eb49
KW
3066 uint64_t sector_num = offset >> BDRV_SECTOR_BITS;
3067 int nb_sectors = bytes >> BDRV_SECTOR_BITS;
3068 void *buf;
3069
1bbbf32d
NS
3070 assert(QEMU_IS_ALIGNED(offset, BDRV_SECTOR_SIZE));
3071 assert(QEMU_IS_ALIGNED(bytes, BDRV_SECTOR_SIZE));
4575eb49
KW
3072
3073 buf = g_try_malloc(bytes);
3074 if (bytes && buf == NULL) {
3075 return -ENOMEM;
3076 }
3077 qemu_iovec_to_buf(qiov, 0, buf, bytes);
3078
e183ef75
PB
3079 qemu_co_mutex_lock(&s->lock);
3080 ret = vvfat_write(bs, sector_num, buf, nb_sectors);
3081 qemu_co_mutex_unlock(&s->lock);
4575eb49
KW
3082
3083 g_free(buf);
3084
e183ef75
PB
3085 return ret;
3086}
3087
fba3998d
EB
3088static int coroutine_fn vvfat_co_block_status(BlockDriverState *bs,
3089 bool want_zero, int64_t offset,
3090 int64_t bytes, int64_t *n,
3091 int64_t *map,
3092 BlockDriverState **file)
a046433a 3093{
fba3998d 3094 *n = bytes;
4bc74be9 3095 return BDRV_BLOCK_DATA;
a046433a
FB
3096}
3097
4575eb49
KW
3098static int coroutine_fn
3099write_target_commit(BlockDriverState *bs, uint64_t offset, uint64_t bytes,
3100 QEMUIOVector *qiov, int flags)
3101{
254aee4d
PB
3102 int ret;
3103
9217e26f 3104 BDRVVVFATState* s = *((BDRVVVFATState**) bs->opaque);
254aee4d
PB
3105 qemu_co_mutex_lock(&s->lock);
3106 ret = try_commit(s);
3107 qemu_co_mutex_unlock(&s->lock);
3108
3109 return ret;
a046433a
FB
3110}
3111
a046433a 3112static BlockDriver vvfat_write_target = {
f9e96436 3113 .format_name = "vvfat_write_target",
a8a4d15c 3114 .instance_size = sizeof(void*),
4575eb49 3115 .bdrv_co_pwritev = write_target_commit,
a046433a
FB
3116};
3117
3cdc69d3 3118static void vvfat_qcow_options(BdrvChildRole role, bool parent_is_format,
272c02ea 3119 int *child_flags, QDict *child_options,
eecc7747 3120 int parent_flags, QDict *parent_options)
a046433a 3121{
f87a0e29 3122 qdict_set_default_str(child_options, BDRV_OPT_READ_ONLY, "off");
e35bdc12 3123 qdict_set_default_str(child_options, BDRV_OPT_AUTO_READ_ONLY, "off");
4f8e3a1f 3124 qdict_set_default_str(child_options, BDRV_OPT_CACHE_NO_FLUSH, "on");
eecc7747
KW
3125}
3126
bd86fb99 3127static const BdrvChildClass child_vvfat_qcow = {
6cd5c9d7 3128 .parent_is_bds = true,
eecc7747
KW
3129 .inherit_options = vvfat_qcow_options,
3130};
3131
3132static int enable_write_target(BlockDriverState *bs, Error **errp)
3133{
3134 BDRVVVFATState *s = bs->opaque;
facdbb02 3135 BlockDriver *bdrv_qcow = NULL;
5db15a57 3136 BlockDriverState *backing;
facdbb02 3137 QemuOpts *opts = NULL;
a655211a 3138 int ret;
a046433a 3139 int size = sector2cluster(s, s->sector_count);
e6641719
HR
3140 QDict *options;
3141
a046433a
FB
3142 s->used_clusters = calloc(size, 1);
3143
c227f099 3144 array_init(&(s->commits), sizeof(commit_t));
a046433a 3145
9a29e18f
JC
3146 s->qcow_filename = g_malloc(PATH_MAX);
3147 ret = get_tmp_filename(s->qcow_filename, PATH_MAX);
eba25057 3148 if (ret < 0) {
68c70af1 3149 error_setg_errno(errp, -ret, "can't create temporary file");
78f27bd0 3150 goto err;
eba25057 3151 }
91a073a9
KW
3152
3153 bdrv_qcow = bdrv_find_format("qcow");
1bcb15cf
HR
3154 if (!bdrv_qcow) {
3155 error_setg(errp, "Failed to locate qcow driver");
3156 ret = -ENOENT;
3157 goto err;
3158 }
3159
c282e1fd 3160 opts = qemu_opts_create(bdrv_qcow->create_opts, NULL, 0, &error_abort);
39101f25
MA
3161 qemu_opt_set_number(opts, BLOCK_OPT_SIZE, s->sector_count * 512,
3162 &error_abort);
f43e47db 3163 qemu_opt_set(opts, BLOCK_OPT_BACKING_FILE, "fat:", &error_abort);
91a073a9 3164
c282e1fd 3165 ret = bdrv_create(bdrv_qcow, s->qcow_filename, opts, errp);
facdbb02 3166 qemu_opts_del(opts);
78f27bd0
FZ
3167 if (ret < 0) {
3168 goto err;
3169 }
a655211a 3170
e6641719 3171 options = qdict_new();
46f5ac20 3172 qdict_put_str(options, "write-target.driver", "qcow");
eecc7747 3173 s->qcow = bdrv_open_child(s->qcow_filename, options, "write-target", bs,
1f38f04e
HR
3174 &child_vvfat_qcow,
3175 BDRV_CHILD_DATA | BDRV_CHILD_METADATA,
3176 false, errp);
cb3e7f08 3177 qobject_unref(options);
5b363937
HR
3178 if (!s->qcow) {
3179 ret = -EINVAL;
78f27bd0 3180 goto err;
d6e9098e 3181 }
a046433a
FB
3182
3183#ifndef _WIN32
3184 unlink(s->qcow_filename);
3185#endif
3186
a8a4d15c
KW
3187 backing = bdrv_new_open_driver(&vvfat_write_target, NULL, BDRV_O_ALLOW_RDWR,
3188 &error_abort);
3189 *(void**) backing->opaque = s;
3190
12fa4af6 3191 bdrv_set_backing_hd(s->bs, backing, &error_abort);
5db15a57
KW
3192 bdrv_unref(backing);
3193
de167e41 3194 return 0;
78f27bd0
FZ
3195
3196err:
3197 g_free(s->qcow_filename);
3198 s->qcow_filename = NULL;
3199 return ret;
de167e41
FB
3200}
3201
91ef3825 3202static void vvfat_child_perm(BlockDriverState *bs, BdrvChild *c,
bf8e925e 3203 BdrvChildRole role,
e0995dc3 3204 BlockReopenQueue *reopen_queue,
91ef3825
KW
3205 uint64_t perm, uint64_t shared,
3206 uint64_t *nperm, uint64_t *nshared)
3207{
3208 BDRVVVFATState *s = bs->opaque;
3209
e5d8a406 3210 assert(c == s->qcow || (role & BDRV_CHILD_COW));
91ef3825
KW
3211
3212 if (c == s->qcow) {
3213 /* This is a private node, nobody should try to attach to it */
3214 *nperm = BLK_PERM_CONSISTENT_READ | BLK_PERM_WRITE;
3215 *nshared = BLK_PERM_WRITE_UNCHANGED;
3216 } else {
3217 /* The backing file is there so 'commit' can use it. vvfat doesn't
3218 * access it in any way. */
3219 *nperm = 0;
3220 *nshared = BLK_PERM_ALL;
3221 }
3222}
3223
de167e41
FB
3224static void vvfat_close(BlockDriverState *bs)
3225{
3226 BDRVVVFATState *s = bs->opaque;
3227
3228 vvfat_close_current_file(s);
3229 array_free(&(s->fat));
3230 array_free(&(s->directory));
3231 array_free(&(s->mapping));
ce137829 3232 g_free(s->cluster_buffer);
3397f0cb
KW
3233
3234 if (s->qcow) {
3235 migrate_del_blocker(s->migration_blocker);
3236 error_free(s->migration_blocker);
3237 }
de167e41
FB
3238}
3239
2654267c
HR
3240static const char *const vvfat_strong_runtime_opts[] = {
3241 "dir",
3242 "fat-type",
3243 "floppy",
3244 "label",
3245 "rw",
3246
3247 NULL
3248};
3249
5efa9d5a 3250static BlockDriver bdrv_vvfat = {
7ad9be64
KW
3251 .format_name = "vvfat",
3252 .protocol_name = "fat",
3253 .instance_size = sizeof(BDRVVVFATState),
3254
3255 .bdrv_parse_filename = vvfat_parse_filename,
3256 .bdrv_file_open = vvfat_open,
a6506481 3257 .bdrv_refresh_limits = vvfat_refresh_limits,
7ad9be64 3258 .bdrv_close = vvfat_close,
91ef3825 3259 .bdrv_child_perm = vvfat_child_perm,
7ad9be64 3260
4575eb49
KW
3261 .bdrv_co_preadv = vvfat_co_preadv,
3262 .bdrv_co_pwritev = vvfat_co_pwritev,
fba3998d 3263 .bdrv_co_block_status = vvfat_co_block_status,
2654267c
HR
3264
3265 .strong_runtime_opts = vvfat_strong_runtime_opts,
de167e41
FB
3266};
3267
5efa9d5a
AL
3268static void bdrv_vvfat_init(void)
3269{
3270 bdrv_register(&bdrv_vvfat);
3271}
3272
3273block_init(bdrv_vvfat_init);
3274
a046433a 3275#ifdef DEBUG
7a6ab45e
TH
3276static void checkpoint(void)
3277{
c227f099 3278 assert(((mapping_t*)array_get(&(vvv->mapping), 0))->end == 2);
a046433a
FB
3279 check1(vvv);
3280 check2(vvv);
3281 assert(!vvv->current_mapping || vvv->current_fd || (vvv->current_mapping->mode & MODE_DIRECTORY));
a046433a
FB
3282}
3283#endif
This page took 1.326091 seconds and 4 git commands to generate.