vvfat.c 80.3 KB
Newer Older
1
/* vim:set shiftwidth=4 ts=8: */
2 3
/*
 * QEMU Block driver for virtual VFAT (shadows a local directory)
4
 *
5
 * Copyright (c) 2004,2005 Johannes E. Schindelin
6
 *
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
#include <sys/stat.h>
#include <dirent.h>
P
pbrook 已提交
27
#include "qemu-common.h"
28
#include "block_int.h"
29
#include "module.h"
30

31 32 33 34 35 36 37 38 39 40
#ifndef S_IWGRP
#define S_IWGRP 0
#endif
#ifndef S_IWOTH
#define S_IWOTH 0
#endif

/* TODO: add ":bootsector=blabla.img:" */
/* LATER TODO: add automatic boot sector generation from
    BOOTEASY.ASM and Ranish Partition Manager
41
    Note that DOS assumes the system files to be the first files in the
42 43 44 45 46 47 48 49 50 51 52 53 54
    file system (test if the boot sector still relies on that fact)! */
/* MAYBE TODO: write block-visofs.c */
/* TODO: call try_commit() only after a timeout */

/* #define DEBUG */

#ifdef DEBUG

#define DLOG(a) a

#undef stderr
#define stderr STDERR
FILE* stderr = NULL;
55

56
static void checkpoint(void);
57

58 59 60 61 62 63
#ifdef __MINGW32__
void nonono(const char* file, int line, const char* msg) {
    fprintf(stderr, "Nonono! %s:%d %s\n", file, line, msg);
    exit(-5);
}
#undef assert
B
bellard 已提交
64
#define assert(a) do {if (!(a)) nonono(__FILE__, __LINE__, #a);}while(0)
65 66 67 68 69 70 71
#endif

#else

#define DLOG(a)

#endif
72 73

/* dynamic array functions */
A
Anthony Liguori 已提交
74
typedef struct array_t {
75 76
    char* pointer;
    unsigned int size,next,item_size;
A
Anthony Liguori 已提交
77
} array_t;
78

A
Anthony Liguori 已提交
79
static inline void array_init(array_t* array,unsigned int item_size)
80
{
81
    array->pointer = NULL;
82 83 84 85 86
    array->size=0;
    array->next=0;
    array->item_size=item_size;
}

A
Anthony Liguori 已提交
87
static inline void array_free(array_t* array)
88 89 90 91 92 93
{
    if(array->pointer)
        free(array->pointer);
    array->size=array->next=0;
}

94
/* does not automatically grow */
A
Anthony Liguori 已提交
95
static inline void* array_get(array_t* array,unsigned int index) {
96 97 98 99
    assert(index < array->next);
    return array->pointer + index * array->item_size;
}

A
Anthony Liguori 已提交
100
static inline int array_ensure_allocated(array_t* array, int index)
101 102 103
{
    if((index + 1) * array->item_size > array->size) {
	int new_size = (index + 32) * array->item_size;
T
ths 已提交
104
	array->pointer = qemu_realloc(array->pointer, new_size);
105 106 107 108
	if (!array->pointer)
	    return -1;
	array->size = new_size;
	array->next = index + 1;
109
    }
110 111

    return 0;
112 113
}

A
Anthony Liguori 已提交
114
static inline void* array_get_next(array_t* array) {
115 116 117 118 119 120 121 122 123
    unsigned int next = array->next;
    void* result;

    if (array_ensure_allocated(array, next) < 0)
	return NULL;

    array->next = next + 1;
    result = array_get(array, next);

124 125 126
    return result;
}

A
Anthony Liguori 已提交
127
static inline void* array_insert(array_t* array,unsigned int index,unsigned int count) {
128 129
    if((array->next+count)*array->item_size>array->size) {
	int increment=count*array->item_size;
T
ths 已提交
130
	array->pointer=qemu_realloc(array->pointer,array->size+increment);
131
	if(!array->pointer)
132
            return NULL;
133 134 135 136 137 138 139 140 141 142 143
	array->size+=increment;
    }
    memmove(array->pointer+(index+count)*array->item_size,
		array->pointer+index*array->item_size,
		(array->next-index)*array->item_size);
    array->next+=count;
    return array->pointer+index*array->item_size;
}

/* this performs a "roll", so that the element which was at index_from becomes
 * index_to, but the order of all other elements is preserved. */
A
Anthony Liguori 已提交
144
static inline int array_roll(array_t* array,int index_to,int index_from,int count)
145 146 147 148 149 150 151 152 153 154
{
    char* buf;
    char* from;
    char* to;
    int is;

    if(!array ||
	    index_to<0 || index_to>=array->next ||
	    index_from<0 || index_from>=array->next)
	return -1;
155

156 157 158 159 160 161
    if(index_to==index_from)
	return 0;

    is=array->item_size;
    from=array->pointer+index_from*is;
    to=array->pointer+index_to*is;
162
    buf=qemu_malloc(is*count);
163 164 165 166 167 168
    memcpy(buf,from,is*count);

    if(index_to<index_from)
	memmove(to+is*count,to,from-to);
    else
	memmove(from,from+is*count,to-from);
169

170 171 172 173 174 175 176
    memcpy(to,buf,is*count);

    free(buf);

    return 0;
}

A
Anthony Liguori 已提交
177
static inline int array_remove_slice(array_t* array,int index, int count)
178
{
179 180 181 182
    assert(index >=0);
    assert(count > 0);
    assert(index + count <= array->next);
    if(array_roll(array,array->next-1,index,count))
183
	return -1;
184
    array->next -= count;
185 186 187
    return 0;
}

A
Anthony Liguori 已提交
188
static int array_remove(array_t* array,int index)
189 190 191 192 193
{
    return array_remove_slice(array, index, 1);
}

/* return the index for a given member */
A
Anthony Liguori 已提交
194
static int array_index(array_t* array, void* pointer)
195 196 197 198 199 200 201
{
    size_t offset = (char*)pointer - array->pointer;
    assert((offset % array->item_size) == 0);
    assert(offset/array->item_size < array->next);
    return offset/array->item_size;
}

202 203 204
/* These structures are used to fake a disk and the VFAT filesystem.
 * For this reason we need to use __attribute__((packed)). */

A
Anthony Liguori 已提交
205
typedef struct bootsector_t {
206 207 208 209 210 211 212
    uint8_t jump[3];
    uint8_t name[8];
    uint16_t sector_size;
    uint8_t sectors_per_cluster;
    uint16_t reserved_sectors;
    uint8_t number_of_fats;
    uint16_t root_entries;
213
    uint16_t total_sectors16;
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
    uint8_t media_type;
    uint16_t sectors_per_fat;
    uint16_t sectors_per_track;
    uint16_t number_of_heads;
    uint32_t hidden_sectors;
    uint32_t total_sectors;
    union {
        struct {
	    uint8_t drive_number;
	    uint8_t current_head;
	    uint8_t signature;
	    uint32_t id;
	    uint8_t volume_label[11];
	} __attribute__((packed)) fat16;
	struct {
	    uint32_t sectors_per_fat;
	    uint16_t flags;
	    uint8_t major,minor;
	    uint32_t first_cluster_of_root_directory;
	    uint16_t info_sector;
	    uint16_t backup_boot_sector;
	    uint16_t ignored;
	} __attribute__((packed)) fat32;
    } u;
    uint8_t fat_type[8];
    uint8_t ignored[0x1c0];
    uint8_t magic[2];
A
Anthony Liguori 已提交
241
} __attribute__((packed)) bootsector_t;
242

T
ths 已提交
243 244 245 246
typedef struct {
    uint8_t head;
    uint8_t sector;
    uint8_t cylinder;
A
Anthony Liguori 已提交
247
} mbr_chs_t;
T
ths 已提交
248

A
Anthony Liguori 已提交
249
typedef struct partition_t {
250
    uint8_t attributes; /* 0x80 = bootable */
A
Anthony Liguori 已提交
251
    mbr_chs_t start_CHS;
T
ths 已提交
252
    uint8_t   fs_type; /* 0x1 = FAT12, 0x6 = FAT16, 0xe = FAT16_LBA, 0xb = FAT32, 0xc = FAT32_LBA */
A
Anthony Liguori 已提交
253
    mbr_chs_t end_CHS;
254
    uint32_t start_sector_long;
T
ths 已提交
255
    uint32_t length_sector_long;
A
Anthony Liguori 已提交
256
} __attribute__((packed)) partition_t;
257

A
Anthony Liguori 已提交
258
typedef struct mbr_t {
T
ths 已提交
259 260 261
    uint8_t ignored[0x1b8];
    uint32_t nt_id;
    uint8_t ignored2[2];
A
Anthony Liguori 已提交
262
    partition_t partition[4];
263
    uint8_t magic[2];
A
Anthony Liguori 已提交
264
} __attribute__((packed)) mbr_t;
265

A
Anthony Liguori 已提交
266
typedef struct direntry_t {
267 268 269 270 271 272 273 274 275 276 277 278
    uint8_t name[8];
    uint8_t extension[3];
    uint8_t attributes;
    uint8_t reserved[2];
    uint16_t ctime;
    uint16_t cdate;
    uint16_t adate;
    uint16_t begin_hi;
    uint16_t mtime;
    uint16_t mdate;
    uint16_t begin;
    uint32_t size;
A
Anthony Liguori 已提交
279
} __attribute__((packed)) direntry_t;
280 281 282

/* this structure are used to transparently access the files */

A
Anthony Liguori 已提交
283
typedef struct mapping_t {
284 285
    /* begin is the first cluster, end is the last+1 */
    uint32_t begin,end;
286 287
    /* as s->directory is growable, no pointer may be used here */
    unsigned int dir_index;
288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
    /* the clusters of a file may be in any order; this points to the first */
    int first_mapping_index;
    union {
	/* offset is
	 * - the offset in the file (in clusters) for a file, or
	 * - the next cluster of the directory for a directory, and
	 * - the address of the buffer for a faked entry
	 */
	struct {
	    uint32_t offset;
	} file;
	struct {
	    int parent_mapping_index;
	    int first_dir_index;
	} dir;
    } info;
    /* path contains the full path, i.e. it always starts with s->path */
    char* path;

    enum { MODE_UNDEFINED = 0, MODE_NORMAL = 1, MODE_MODIFIED = 2,
	MODE_DIRECTORY = 4, MODE_FAKED = 8,
	MODE_DELETED = 16, MODE_RENAMED = 32 } mode;
    int read_only;
A
Anthony Liguori 已提交
311
} mapping_t;
312

313
#ifdef DEBUG
A
Anthony Liguori 已提交
314 315
static void print_direntry(const struct direntry_t*);
static void print_mapping(const struct mapping_t* mapping);
316
#endif
317 318 319 320

/* here begins the real VVFAT driver */

typedef struct BDRVVVFATState {
321
    BlockDriverState* bs; /* pointer to parent */
322 323
    unsigned int first_sectors_number; /* 1 for a single partition, 0x40 for a disk with partition table */
    unsigned char first_sectors[0x40*0x200];
324

325
    int fat_type; /* 16 or 32 */
A
Anthony Liguori 已提交
326
    array_t fat,directory,mapping;
327

328 329 330 331
    unsigned int cluster_size;
    unsigned int sectors_per_cluster;
    unsigned int sectors_per_fat;
    unsigned int sectors_of_root_directory;
332
    uint32_t last_cluster_of_root_directory;
333 334 335 336
    unsigned int faked_sectors; /* how many sectors are faked before file data */
    uint32_t sector_count; /* total number of sectors of the partition */
    uint32_t cluster_count; /* total number of clusters of this partition */
    uint32_t max_fat_value;
337

338
    int current_fd;
A
Anthony Liguori 已提交
339
    mapping_t* current_mapping;
340 341
    unsigned char* cluster; /* points to current cluster */
    unsigned char* cluster_buffer; /* points to a buffer to hold temp data */
342 343 344
    unsigned int current_cluster;

    /* write support */
345 346 347 348 349
    BlockDriverState* write_target;
    char* qcow_filename;
    BlockDriverState* qcow;
    void* fat2;
    char* used_clusters;
A
Anthony Liguori 已提交
350
    array_t commits;
351 352
    const char* path;
    int downcase_short_names;
353 354
} BDRVVVFATState;

T
ths 已提交
355 356 357 358
/* take the sector position spos and convert it to Cylinder/Head/Sector position
 * if the position is outside the specified geometry, fill maximum value for CHS
 * and return 1 to signal overflow.
 */
A
Anthony Liguori 已提交
359
static int sector2CHS(BlockDriverState* bs, mbr_chs_t * chs, int spos){
T
ths 已提交
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376
    int head,sector;
    sector   = spos % (bs->secs);  spos/= bs->secs;
    head     = spos % (bs->heads); spos/= bs->heads;
    if(spos >= bs->cyls){
        /* Overflow,
        it happens if 32bit sector positions are used, while CHS is only 24bit.
        Windows/Dos is said to take 1023/255/63 as nonrepresentable CHS */
        chs->head     = 0xFF;
        chs->sector   = 0xFF;
        chs->cylinder = 0xFF;
        return 1;
    }
    chs->head     = (uint8_t)head;
    chs->sector   = (uint8_t)( (sector+1) | ((spos>>8)<<6) );
    chs->cylinder = (uint8_t)spos;
    return 0;
}
377 378 379 380

static void init_mbr(BDRVVVFATState* s)
{
    /* TODO: if the files mbr.img and bootsect.img exist, use them */
A
Anthony Liguori 已提交
381 382
    mbr_t* real_mbr=(mbr_t*)s->first_sectors;
    partition_t* partition = &(real_mbr->partition[0]);
T
ths 已提交
383
    int lba;
384 385

    memset(s->first_sectors,0,512);
386

T
ths 已提交
387 388 389
    /* Win NT Disk Signature */
    real_mbr->nt_id= cpu_to_le32(0xbe1afdfa);

390
    partition->attributes=0x80; /* bootable */
T
ths 已提交
391 392 393 394 395 396 397 398 399

    /* LBA is used when partition is outside the CHS geometry */
    lba = sector2CHS(s->bs, &partition->start_CHS, s->first_sectors_number-1);
    lba|= sector2CHS(s->bs, &partition->end_CHS,   s->sector_count);

    /*LBA partitions are identified only by start/length_sector_long not by CHS*/
    partition->start_sector_long =cpu_to_le32(s->first_sectors_number-1);
    partition->length_sector_long=cpu_to_le32(s->sector_count - s->first_sectors_number+1);

400
    /* FAT12/FAT16/FAT32 */
T
ths 已提交
401 402 403 404 405
    /* DOS uses different types when partition is LBA,
       probably to prevent older versions from using CHS on them */
    partition->fs_type= s->fat_type==12 ? 0x1:
                        s->fat_type==16 ? (lba?0xe:0x06):
                         /*fat_tyoe==32*/ (lba?0xc:0x0b);
406 407 408 409

    real_mbr->magic[0]=0x55; real_mbr->magic[1]=0xaa;
}

410 411
/* direntry functions */

412
/* dest is assumed to hold 258 bytes, and pads with 0xffff up to next multiple of 26 */
T
ths 已提交
413
static inline int short2long_name(char* dest,const char* src)
414 415
{
    int i;
416
    int len;
417 418 419 420
    for(i=0;i<129 && src[i];i++) {
        dest[2*i]=src[i];
	dest[2*i+1]=0;
    }
421
    len=2*i;
422 423 424
    dest[2*i]=dest[2*i+1]=0;
    for(i=2*i+2;(i%26);i++)
	dest[i]=0xff;
425
    return len;
426 427
}

A
Anthony Liguori 已提交
428
static inline direntry_t* create_long_filename(BDRVVVFATState* s,const char* filename)
429 430 431 432
{
    char buffer[258];
    int length=short2long_name(buffer,filename),
        number_of_entries=(length+25)/26,i;
A
Anthony Liguori 已提交
433
    direntry_t* entry;
434 435 436 437 438 439 440 441

    for(i=0;i<number_of_entries;i++) {
	entry=array_get_next(&(s->directory));
	entry->attributes=0xf;
	entry->reserved[0]=0;
	entry->begin=0;
	entry->name[0]=(number_of_entries-i)|(i==0?0x40:0);
    }
442
    for(i=0;i<26*number_of_entries;i++) {
443 444 445 446 447 448 449 450 451 452
	int offset=(i%26);
	if(offset<10) offset=1+offset;
	else if(offset<22) offset=14+offset-10;
	else offset=28+offset-22;
	entry=array_get(&(s->directory),s->directory.next-1-(i/26));
	entry->name[offset]=buffer[i];
    }
    return array_get(&(s->directory),s->directory.next-number_of_entries);
}

A
Anthony Liguori 已提交
453
static char is_free(const direntry_t* direntry)
454
{
455
    return direntry->name[0]==0xe5 || direntry->name[0]==0x00;
456 457
}

A
Anthony Liguori 已提交
458
static char is_volume_label(const direntry_t* direntry)
459 460 461 462
{
    return direntry->attributes == 0x28;
}

A
Anthony Liguori 已提交
463
static char is_long_name(const direntry_t* direntry)
464 465 466 467
{
    return direntry->attributes == 0xf;
}

A
Anthony Liguori 已提交
468
static char is_short_name(const direntry_t* direntry)
469 470 471 472 473
{
    return !is_volume_label(direntry) && !is_long_name(direntry)
	&& !is_free(direntry);
}

A
Anthony Liguori 已提交
474
static char is_directory(const direntry_t* direntry)
475 476 477 478
{
    return direntry->attributes & 0x10 && direntry->name[0] != 0xe5;
}

A
Anthony Liguori 已提交
479
static inline char is_dot(const direntry_t* direntry)
480 481 482 483
{
    return is_short_name(direntry) && direntry->name[0] == '.';
}

A
Anthony Liguori 已提交
484
static char is_file(const direntry_t* direntry)
485 486 487 488
{
    return is_short_name(direntry) && !is_directory(direntry);
}

A
Anthony Liguori 已提交
489
static inline uint32_t begin_of_direntry(const direntry_t* direntry)
490 491 492 493
{
    return le16_to_cpu(direntry->begin)|(le16_to_cpu(direntry->begin_hi)<<16);
}

A
Anthony Liguori 已提交
494
static inline uint32_t filesize_of_direntry(const direntry_t* direntry)
495 496 497 498
{
    return le32_to_cpu(direntry->size);
}

A
Anthony Liguori 已提交
499
static void set_begin_of_direntry(direntry_t* direntry, uint32_t begin)
500 501 502 503 504
{
    direntry->begin = cpu_to_le16(begin & 0xffff);
    direntry->begin_hi = cpu_to_le16((begin >> 16) & 0xffff);
}

505 506
/* fat functions */

A
Anthony Liguori 已提交
507
static inline uint8_t fat_chksum(const direntry_t* entry)
508 509 510 511
{
    uint8_t chksum=0;
    int i;

A
Aurelien Jarno 已提交
512 513 514 515 516 517
    for(i=0;i<11;i++) {
        unsigned char c;

        c = (i <= 8) ? entry->name[i] : entry->extension[i-8];
        chksum=(((chksum&0xfe)>>1)|((chksum&0x01)?0x80:0)) + c;
    }
518

519 520 521 522 523 524 525 526 527 528
    return chksum;
}

/* if return_time==0, this returns the fat_date, else the fat_time */
static uint16_t fat_datetime(time_t time,int return_time) {
    struct tm* t;
#ifdef _WIN32
    t=localtime(&time); /* this is not thread safe */
#else
    struct tm t1;
M
Michael S. Tsirkin 已提交
529
    t = &t1;
530 531 532 533 534 535 536 537 538
    localtime_r(&time,t);
#endif
    if(return_time)
	return cpu_to_le16((t->tm_sec/2)|(t->tm_min<<5)|(t->tm_hour<<11));
    return cpu_to_le16((t->tm_mday)|((t->tm_mon+1)<<5)|((t->tm_year-80)<<9));
}

static inline void fat_set(BDRVVVFATState* s,unsigned int cluster,uint32_t value)
{
539 540 541
    if(s->fat_type==32) {
	uint32_t* entry=array_get(&(s->fat),cluster);
	*entry=cpu_to_le32(value);
542 543 544 545
    } else if(s->fat_type==16) {
	uint16_t* entry=array_get(&(s->fat),cluster);
	*entry=cpu_to_le16(value&0xffff);
    } else {
546 547 548 549 550 551 552 553 554 555 556 557
	int offset = (cluster*3/2);
	unsigned char* p = array_get(&(s->fat), offset);
        switch (cluster&1) {
	case 0:
		p[0] = value&0xff;
		p[1] = (p[1]&0xf0) | ((value>>8)&0xf);
		break;
	case 1:
		p[0] = (p[0]&0xf) | ((value&0xf)<<4);
		p[1] = (value>>4);
		break;
	}
558 559 560 561 562
    }
}

static inline uint32_t fat_get(BDRVVVFATState* s,unsigned int cluster)
{
563 564 565
    if(s->fat_type==32) {
	uint32_t* entry=array_get(&(s->fat),cluster);
	return le32_to_cpu(*entry);
566 567 568 569
    } else if(s->fat_type==16) {
	uint16_t* entry=array_get(&(s->fat),cluster);
	return le16_to_cpu(*entry);
    } else {
T
ths 已提交
570
	const uint8_t* x=(uint8_t*)(s->fat.pointer)+cluster*3/2;
571
	return ((x[0]|(x[1]<<8))>>(cluster&1?4:0))&0x0fff;
572 573 574 575 576 577 578 579 580 581 582 583
    }
}

static inline int fat_eof(BDRVVVFATState* s,uint32_t fat_entry)
{
    if(fat_entry>s->max_fat_value-8)
	return -1;
    return 0;
}

static inline void init_fat(BDRVVVFATState* s)
{
584 585 586 587 588 589 590 591 592
    if (s->fat_type == 12) {
	array_init(&(s->fat),1);
	array_ensure_allocated(&(s->fat),
		s->sectors_per_fat * 0x200 * 3 / 2 - 1);
    } else {
	array_init(&(s->fat),(s->fat_type==32?4:2));
	array_ensure_allocated(&(s->fat),
		s->sectors_per_fat * 0x200 / s->fat.item_size - 1);
    }
593
    memset(s->fat.pointer,0,s->fat.size);
594

595 596 597
    switch(s->fat_type) {
	case 12: s->max_fat_value=0xfff; break;
	case 16: s->max_fat_value=0xffff; break;
598
	case 32: s->max_fat_value=0x0fffffff; break;
599 600 601 602 603
	default: s->max_fat_value=0; /* error... */
    }

}

604 605
/* TODO: in create_short_filename, 0xe5->0x05 is not yet handled! */
/* TODO: in parse_short_filename, 0x05->0xe5 is not yet handled! */
A
Anthony Liguori 已提交
606
static inline direntry_t* create_short_and_long_name(BDRVVVFATState* s,
607
	unsigned int directory_start, const char* filename, int is_dot)
608
{
609
    int i,j,long_index=s->directory.next;
A
Anthony Liguori 已提交
610 611
    direntry_t* entry = NULL;
    direntry_t* entry_long = NULL;
612 613 614 615 616 617 618

    if(is_dot) {
	entry=array_get_next(&(s->directory));
	memset(entry->name,0x20,11);
	memcpy(entry->name,filename,strlen(filename));
	return entry;
    }
619

620
    entry_long=create_long_filename(s,filename);
621

622
    i = strlen(filename);
623 624 625 626 627 628
    for(j = i - 1; j>0  && filename[j]!='.';j--);
    if (j > 0)
	i = (j > 8 ? 8 : j);
    else if (i > 8)
	i = 8;

629 630
    entry=array_get_next(&(s->directory));
    memset(entry->name,0x20,11);
B
blueswir1 已提交
631
    memcpy(entry->name, filename, i);
632

633 634 635
    if(j > 0)
	for (i = 0; i < 3 && filename[j+1+i]; i++)
	    entry->extension[i] = filename[j+1+i];
636 637 638

    /* upcase & remove unwanted characters */
    for(i=10;i>=0;i--) {
639
	if(i==10 || i==7) for(;i>0 && entry->name[i]==' ';i--);
640
	if(entry->name[i]<=' ' || entry->name[i]>0x7f
641
		|| strchr(".*?<>|\":/\\[];,+='",entry->name[i]))
642 643 644 645 646 647 648
	    entry->name[i]='_';
        else if(entry->name[i]>='a' && entry->name[i]<='z')
            entry->name[i]+='A'-'a';
    }

    /* mangle duplicates */
    while(1) {
A
Anthony Liguori 已提交
649
	direntry_t* entry1=array_get(&(s->directory),directory_start);
650 651 652
	int j;

	for(;entry1<entry;entry1++)
653
	    if(!is_long_name(entry1) && !memcmp(entry1->name,entry->name,11))
654 655 656 657
		break; /* found dupe */
	if(entry1==entry) /* no dupe found */
	    break;

658
	/* use all 8 characters of name */
659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681
	if(entry->name[7]==' ') {
	    int j;
	    for(j=6;j>0 && entry->name[j]==' ';j--)
		entry->name[j]='~';
	}

	/* increment number */
	for(j=7;j>0 && entry->name[j]=='9';j--)
	    entry->name[j]='0';
	if(j>0) {
	    if(entry->name[j]<'0' || entry->name[j]>'9')
	        entry->name[j]='0';
	    else
	        entry->name[j]++;
	}
    }

    /* calculate checksum; propagate to long name */
    if(entry_long) {
        uint8_t chksum=fat_chksum(entry);

	/* calculate anew, because realloc could have taken place */
	entry_long=array_get(&(s->directory),long_index);
682
	while(entry_long<entry && is_long_name(entry_long)) {
683 684 685 686 687 688 689 690
	    entry_long->reserved[1]=chksum;
	    entry_long++;
	}
    }

    return entry;
}

691 692 693 694
/*
 * Read a directory. (the index of the corresponding mapping must be passed).
 */
static int read_directory(BDRVVVFATState* s, int mapping_index)
695
{
A
Anthony Liguori 已提交
696 697
    mapping_t* mapping = array_get(&(s->mapping), mapping_index);
    direntry_t* direntry;
698 699 700
    const char* dirname = mapping->path;
    int first_cluster = mapping->begin;
    int parent_index = mapping->info.dir.parent_mapping_index;
A
Anthony Liguori 已提交
701
    mapping_t* parent_mapping = (mapping_t*)
702
        (parent_index >= 0 ? array_get(&(s->mapping), parent_index) : NULL);
703
    int first_cluster_of_parent = parent_mapping ? parent_mapping->begin : -1;
704 705 706 707 708

    DIR* dir=opendir(dirname);
    struct dirent* entry;
    int i;

709 710 711 712
    assert(mapping->mode & MODE_DIRECTORY);

    if(!dir) {
	mapping->end = mapping->begin;
713
	return -1;
714
    }
715

716 717 718
    i = mapping->info.dir.first_dir_index =
	    first_cluster == 0 ? 0 : s->directory.next;

719
    /* actually read the directory, and allocate the mappings */
720 721 722
    while((entry=readdir(dir))) {
	unsigned int length=strlen(dirname)+2+strlen(entry->d_name);
        char* buffer;
A
Anthony Liguori 已提交
723
	direntry_t* direntry;
724
        struct stat st;
725 726 727
	int is_dot=!strcmp(entry->d_name,".");
	int is_dotdot=!strcmp(entry->d_name,"..");

728
	if(first_cluster == 0 && (is_dotdot || is_dot))
729
	    continue;
730

731
	buffer=(char*)qemu_malloc(length);
732 733 734 735 736 737 738 739
	snprintf(buffer,length,"%s/%s",dirname,entry->d_name);

	if(stat(buffer,&st)<0) {
	    free(buffer);
            continue;
	}

	/* create directory entry for this file */
740 741
	direntry=create_short_and_long_name(s, i, entry->d_name,
		is_dot || is_dotdot);
742 743 744 745 746 747 748 749 750
	direntry->attributes=(S_ISDIR(st.st_mode)?0x10:0x20);
	direntry->reserved[0]=direntry->reserved[1]=0;
	direntry->ctime=fat_datetime(st.st_ctime,1);
	direntry->cdate=fat_datetime(st.st_ctime,0);
	direntry->adate=fat_datetime(st.st_atime,0);
	direntry->begin_hi=0;
	direntry->mtime=fat_datetime(st.st_mtime,1);
	direntry->mdate=fat_datetime(st.st_mtime,0);
	if(is_dotdot)
751
	    set_begin_of_direntry(direntry, first_cluster_of_parent);
752
	else if(is_dot)
753
	    set_begin_of_direntry(direntry, first_cluster);
754
	else
755 756 757 758 759 760 761
	    direntry->begin=0; /* do that later */
        if (st.st_size > 0x7fffffff) {
	    fprintf(stderr, "File %s is larger than 2GB\n", buffer);
	    free(buffer);
	    return -2;
        }
	direntry->size=cpu_to_le32(S_ISDIR(st.st_mode)?0:st.st_size);
762 763

	/* create mapping for this file */
764
	if(!is_dot && !is_dotdot && (S_ISDIR(st.st_mode) || st.st_size)) {
A
Anthony Liguori 已提交
765
	    s->current_mapping=(mapping_t*)array_get_next(&(s->mapping));
766 767
	    s->current_mapping->begin=0;
	    s->current_mapping->end=st.st_size;
768 769 770 771
	    /*
	     * we get the direntry of the most recent direntry, which
	     * contains the short name and all the relevant information.
	     */
772
	    s->current_mapping->dir_index=s->directory.next-1;
773 774 775 776 777 778 779 780 781 782 783 784
	    s->current_mapping->first_mapping_index = -1;
	    if (S_ISDIR(st.st_mode)) {
		s->current_mapping->mode = MODE_DIRECTORY;
		s->current_mapping->info.dir.parent_mapping_index =
		    mapping_index;
	    } else {
		s->current_mapping->mode = MODE_UNDEFINED;
		s->current_mapping->info.file.offset = 0;
	    }
	    s->current_mapping->path=buffer;
	    s->current_mapping->read_only =
		(st.st_mode & (S_IWUSR | S_IWGRP | S_IWOTH)) == 0;
785 786 787 788 789 790
	}
    }
    closedir(dir);

    /* fill with zeroes up to the end of the cluster */
    while(s->directory.next%(0x10*s->sectors_per_cluster)) {
A
Anthony Liguori 已提交
791 792
	direntry_t* direntry=array_get_next(&(s->directory));
	memset(direntry,0,sizeof(direntry_t));
793 794
    }

795 796 797 798 799 800 801
/* TODO: if there are more entries, bootsector has to be adjusted! */
#define ROOT_ENTRIES (0x02 * 0x10 * s->sectors_per_cluster)
    if (mapping_index == 0 && s->directory.next < ROOT_ENTRIES) {
	/* root directory */
	int cur = s->directory.next;
	array_ensure_allocated(&(s->directory), ROOT_ENTRIES - 1);
	memset(array_get(&(s->directory), cur), 0,
A
Anthony Liguori 已提交
802
		(ROOT_ENTRIES - cur) * sizeof(direntry_t));
803
    }
804

805
     /* reget the mapping, since s->mapping was possibly realloc()ed */
A
Anthony Liguori 已提交
806
    mapping = (mapping_t*)array_get(&(s->mapping), mapping_index);
807 808 809 810
    first_cluster += (s->directory.next - mapping->info.dir.first_dir_index)
	* 0x20 / s->cluster_size;
    mapping->end = first_cluster;

A
Anthony Liguori 已提交
811
    direntry = (direntry_t*)array_get(&(s->directory), mapping->dir_index);
812
    set_begin_of_direntry(direntry, mapping->begin);
813

814 815
    return 0;
}
816

817 818 819 820
static inline uint32_t sector2cluster(BDRVVVFATState* s,off_t sector_num)
{
    return (sector_num-s->faked_sectors)/s->sectors_per_cluster;
}
821

822 823 824 825
static inline off_t cluster2sector(BDRVVVFATState* s, uint32_t cluster_num)
{
    return s->faked_sectors + s->sectors_per_cluster * cluster_num;
}
826

827 828 829 830
static inline uint32_t sector_offset_in_cluster(BDRVVVFATState* s,off_t sector_num)
{
    return (sector_num-s->first_sectors_number-2*s->sectors_per_fat)%s->sectors_per_cluster;
}
831

832
#ifdef DBG
A
Anthony Liguori 已提交
833
static direntry_t* get_direntry_for_mapping(BDRVVVFATState* s,mapping_t* mapping)
834 835 836
{
    if(mapping->mode==MODE_UNDEFINED)
	return 0;
A
Anthony Liguori 已提交
837
    return (direntry_t*)(s->directory.pointer+sizeof(direntry_t)*mapping->dir_index);
838
}
839
#endif
840

841 842
static int init_directories(BDRVVVFATState* s,
	const char* dirname)
843
{
A
Anthony Liguori 已提交
844 845
    bootsector_t* bootsector;
    mapping_t* mapping;
846 847 848 849 850 851
    unsigned int i;
    unsigned int cluster;

    memset(&(s->first_sectors[0]),0,0x40*0x200);

    s->cluster_size=s->sectors_per_cluster*0x200;
852
    s->cluster_buffer=qemu_malloc(s->cluster_size);
853 854 855 856 857 858 859 860 861 862

    /*
     * The formula: sc = spf+1+spf*spc*(512*8/fat_type),
     * where sc is sector_count,
     * spf is sectors_per_fat,
     * spc is sectors_per_clusters, and
     * fat_type = 12, 16 or 32.
     */
    i = 1+s->sectors_per_cluster*0x200*8/s->fat_type;
    s->sectors_per_fat=(s->sector_count+i)/i; /* round up */
863

A
Anthony Liguori 已提交
864 865
    array_init(&(s->mapping),sizeof(mapping_t));
    array_init(&(s->directory),sizeof(direntry_t));
866 867 868

    /* add volume label */
    {
A
Anthony Liguori 已提交
869
	direntry_t* entry=array_get_next(&(s->directory));
870
	entry->attributes=0x28; /* archive | volume label */
871 872
	memcpy(entry->name,"QEMU VVF",8);
	memcpy(entry->extension,"AT ",3);
873 874 875 876 877
    }

    /* Now build FAT, and write back information into directory */
    init_fat(s);

878 879 880 881 882 883 884 885
    s->faked_sectors=s->first_sectors_number+s->sectors_per_fat*2;
    s->cluster_count=sector2cluster(s, s->sector_count);

    mapping = array_get_next(&(s->mapping));
    mapping->begin = 0;
    mapping->dir_index = 0;
    mapping->info.dir.parent_mapping_index = -1;
    mapping->first_mapping_index = -1;
886
    mapping->path = qemu_strdup(dirname);
887 888 889 890 891 892 893 894
    i = strlen(mapping->path);
    if (i > 0 && mapping->path[i - 1] == '/')
	mapping->path[i - 1] = '\0';
    mapping->mode = MODE_DIRECTORY;
    mapping->read_only = 0;
    s->path = mapping->path;

    for (i = 0, cluster = 0; i < s->mapping.next; i++) {
895
	/* MS-DOS expects the FAT to be 0 for the root directory
896 897 898 899 900 901 902 903 904 905
	 * (except for the media byte). */
	/* LATER TODO: still true for FAT32? */
	int fix_fat = (i != 0);
	mapping = array_get(&(s->mapping), i);

        if (mapping->mode & MODE_DIRECTORY) {
	    mapping->begin = cluster;
	    if(read_directory(s, i)) {
		fprintf(stderr, "Could not read directory %s\n",
			mapping->path);
906 907
		return -1;
	    }
908 909 910
	    mapping = array_get(&(s->mapping), i);
	} else {
	    assert(mapping->mode == MODE_UNDEFINED);
911
	    mapping->mode=MODE_NORMAL;
912 913
	    mapping->begin = cluster;
	    if (mapping->end > 0) {
A
Anthony Liguori 已提交
914
		direntry_t* direntry = array_get(&(s->directory),
915 916 917 918 919 920 921
			mapping->dir_index);

		mapping->end = cluster + 1 + (mapping->end-1)/s->cluster_size;
		set_begin_of_direntry(direntry, mapping->begin);
	    } else {
		mapping->end = cluster + 1;
		fix_fat = 0;
922
	    }
923 924 925 926
	}

	assert(mapping->begin < mapping->end);

927 928 929 930 931 932 933 934 935 936 937 938
	/* next free cluster */
	cluster = mapping->end;

	if(cluster > s->cluster_count) {
	    fprintf(stderr,"Directory does not fit in FAT%d (capacity %s)\n",
		    s->fat_type,
		    s->fat_type == 12 ? s->sector_count == 2880 ? "1.44 MB"
								: "2.88 MB"
				      : "504MB");
	    return -EINVAL;
	}

939 940
	/* fix fat for entry */
	if (fix_fat) {
941
	    int j;
942 943 944 945
	    for(j = mapping->begin; j < mapping->end - 1; j++)
		fat_set(s, j, j+1);
	    fat_set(s, mapping->end - 1, s->max_fat_value);
	}
946 947
    }

948 949 950 951 952 953 954
    mapping = array_get(&(s->mapping), 0);
    s->sectors_of_root_directory = mapping->end * s->sectors_per_cluster;
    s->last_cluster_of_root_directory = mapping->end;

    /* the FAT signature */
    fat_set(s,0,s->max_fat_value);
    fat_set(s,1,s->max_fat_value);
955

956 957
    s->current_mapping = NULL;

A
Anthony Liguori 已提交
958
    bootsector=(bootsector_t*)(s->first_sectors+(s->first_sectors_number-1)*0x200);
959 960 961 962 963 964 965 966 967
    bootsector->jump[0]=0xeb;
    bootsector->jump[1]=0x3e;
    bootsector->jump[2]=0x90;
    memcpy(bootsector->name,"QEMU    ",8);
    bootsector->sector_size=cpu_to_le16(0x200);
    bootsector->sectors_per_cluster=s->sectors_per_cluster;
    bootsector->reserved_sectors=cpu_to_le16(1);
    bootsector->number_of_fats=0x2; /* number of FATs */
    bootsector->root_entries=cpu_to_le16(s->sectors_of_root_directory*0x10);
968 969 970
    bootsector->total_sectors16=s->sector_count>0xffff?0:cpu_to_le16(s->sector_count);
    bootsector->media_type=(s->fat_type!=12?0xf8:s->sector_count==5760?0xf9:0xf8); /* media descriptor */
    s->fat.pointer[0] = bootsector->media_type;
971
    bootsector->sectors_per_fat=cpu_to_le16(s->sectors_per_fat);
972 973
    bootsector->sectors_per_track=cpu_to_le16(s->bs->secs);
    bootsector->number_of_heads=cpu_to_le16(s->bs->heads);
974
    bootsector->hidden_sectors=cpu_to_le32(s->first_sectors_number==1?0:0x3f);
975
    bootsector->total_sectors=cpu_to_le32(s->sector_count>0xffff?s->sector_count:0);
976

977 978
    /* LATER TODO: if FAT32, this is wrong */
    bootsector->u.fat16.drive_number=s->fat_type==12?0:0x80; /* assume this is hda (TODO) */
979 980 981 982 983 984 985 986 987 988 989
    bootsector->u.fat16.current_head=0;
    bootsector->u.fat16.signature=0x29;
    bootsector->u.fat16.id=cpu_to_le32(0xfabe1afd);

    memcpy(bootsector->u.fat16.volume_label,"QEMU VVFAT ",11);
    memcpy(bootsector->fat_type,(s->fat_type==12?"FAT12   ":s->fat_type==16?"FAT16   ":"FAT32   "),8);
    bootsector->magic[0]=0x55; bootsector->magic[1]=0xaa;

    return 0;
}

B
bellard 已提交
990
#ifdef DEBUG
991
static BDRVVVFATState *vvv = NULL;
B
bellard 已提交
992
#endif
993 994 995 996

static int enable_write_target(BDRVVVFATState *s);
static int is_consistent(BDRVVVFATState *s);

B
bellard 已提交
997
static int vvfat_open(BlockDriverState *bs, const char* dirname, int flags)
998 999
{
    BDRVVVFATState *s = bs->opaque;
1000
    int floppy = 0;
1001 1002
    int i;

B
bellard 已提交
1003
#ifdef DEBUG
1004
    vvv = s;
B
bellard 已提交
1005
#endif
1006 1007 1008 1009 1010 1011 1012 1013

DLOG(if (stderr == NULL) {
    stderr = fopen("vvfat.log", "a");
    setbuf(stderr, NULL);
})

    s->bs = bs;

1014
    s->fat_type=16;
1015 1016
    /* LATER TODO: if FAT32, adjust */
    s->sectors_per_cluster=0x10;
T
ths 已提交
1017 1018
    /* 504MB disk*/
    bs->cyls=1024; bs->heads=16; bs->secs=63;
1019 1020 1021 1022

    s->current_cluster=0xffffffff;

    s->first_sectors_number=0x40;
1023 1024 1025 1026 1027 1028
    /* read only is the default for safety */
    bs->read_only = 1;
    s->qcow = s->write_target = NULL;
    s->qcow_filename = NULL;
    s->fat2 = NULL;
    s->downcase_short_names = 1;
1029

1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
    if (!strstart(dirname, "fat:", NULL))
	return -1;

    if (strstr(dirname, ":floppy:")) {
	floppy = 1;
	s->fat_type = 12;
	s->first_sectors_number = 1;
	s->sectors_per_cluster=2;
	bs->cyls = 80; bs->heads = 2; bs->secs = 36;
    }

T
ths 已提交
1041 1042
    s->sector_count=bs->cyls*bs->heads*bs->secs;

1043 1044 1045 1046 1047 1048 1049 1050
    if (strstr(dirname, ":32:")) {
	fprintf(stderr, "Big fat greek warning: FAT32 has not been tested. You are welcome to do so!\n");
	s->fat_type = 32;
    } else if (strstr(dirname, ":16:")) {
	s->fat_type = 16;
    } else if (strstr(dirname, ":12:")) {
	s->fat_type = 12;
	s->sector_count=2880;
1051
    }
1052

T
ths 已提交
1053 1054 1055 1056 1057 1058
    if (strstr(dirname, ":rw:")) {
	if (enable_write_target(s))
	    return -1;
	bs->read_only = 0;
    }

1059 1060
    i = strrchr(dirname, ':') - dirname;
    assert(i >= 3);
1061
    if (dirname[i-2] == ':' && qemu_isalpha(dirname[i-1]))
1062 1063 1064 1065 1066 1067
	/* workaround for DOS drive names */
	dirname += i-1;
    else
	dirname += i+1;

    bs->total_sectors=bs->cyls*bs->heads*bs->secs;
T
ths 已提交
1068

1069
    if(init_directories(s, dirname))
1070 1071
	return -1;

T
ths 已提交
1072 1073
    s->sector_count = s->faked_sectors + s->sectors_per_cluster*s->cluster_count;

1074 1075 1076
    if(s->first_sectors_number==0x40)
	init_mbr(s);

1077 1078 1079 1080 1081
    /* for some reason or other, MS-DOS does not like to know about CHS... */
    if (floppy)
	bs->heads = bs->cyls = bs->secs = 0;

    //    assert(is_consistent(s));
1082 1083 1084 1085 1086 1087
    return 0;
}

static inline void vvfat_close_current_file(BDRVVVFATState *s)
{
    if(s->current_mapping) {
1088 1089 1090 1091 1092
	s->current_mapping = NULL;
	if (s->current_fd) {
		close(s->current_fd);
		s->current_fd = 0;
	}
1093
    }
1094
    s->current_cluster = -1;
1095 1096 1097 1098 1099 1100 1101 1102
}

/* mappings between index1 and index2-1 are supposed to be ordered
 * return value is the index of the last mapping for which end>cluster_num
 */
static inline int find_mapping_for_cluster_aux(BDRVVVFATState* s,int cluster_num,int index1,int index2)
{
    while(1) {
1103
        int index3;
A
Anthony Liguori 已提交
1104
	mapping_t* mapping;
1105 1106
	index3=(index1+index2)/2;
	mapping=array_get(&(s->mapping),index3);
1107 1108
	assert(mapping->begin < mapping->end);
	if(mapping->begin>=cluster_num) {
1109 1110
	    assert(index2!=index3 || index2==0);
	    if(index2==index3)
1111
		return index1;
1112 1113 1114
	    index2=index3;
	} else {
	    if(index1==index3)
1115
		return mapping->end<=cluster_num ? index2 : index1;
1116 1117 1118
	    index1=index3;
	}
	assert(index1<=index2);
1119 1120
	DLOG(mapping=array_get(&(s->mapping),index1);
	assert(mapping->begin<=cluster_num);
1121
	assert(index2 >= s->mapping.next ||
1122 1123
		((mapping = array_get(&(s->mapping),index2)) &&
		mapping->end>cluster_num)));
1124 1125 1126
    }
}

A
Anthony Liguori 已提交
1127
static inline mapping_t* find_mapping_for_cluster(BDRVVVFATState* s,int cluster_num)
1128 1129
{
    int index=find_mapping_for_cluster_aux(s,cluster_num,0,s->mapping.next);
A
Anthony Liguori 已提交
1130
    mapping_t* mapping;
1131
    if(index>=s->mapping.next)
1132
        return NULL;
1133 1134
    mapping=array_get(&(s->mapping),index);
    if(mapping->begin>cluster_num)
1135
        return NULL;
1136
    assert(mapping->begin<=cluster_num && mapping->end>cluster_num);
1137 1138 1139
    return mapping;
}

1140 1141 1142 1143
/*
 * This function simply compares path == mapping->path. Since the mappings
 * are sorted by cluster, this is expensive: O(n).
 */
A
Anthony Liguori 已提交
1144
static inline mapping_t* find_mapping_for_path(BDRVVVFATState* s,
1145 1146 1147 1148 1149
	const char* path)
{
    int i;

    for (i = 0; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
1150
	mapping_t* mapping = array_get(&(s->mapping), i);
1151 1152 1153 1154 1155 1156 1157 1158
	if (mapping->first_mapping_index < 0 &&
		!strcmp(path, mapping->path))
	    return mapping;
    }

    return NULL;
}

A
Anthony Liguori 已提交
1159
static int open_file(BDRVVVFATState* s,mapping_t* mapping)
1160 1161 1162 1163
{
    if(!mapping)
	return -1;
    if(!s->current_mapping ||
1164
	    strcmp(s->current_mapping->path,mapping->path)) {
1165
	/* open file */
1166
	int fd = open(mapping->path, O_RDONLY | O_BINARY | O_LARGEFILE);
1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180
	if(fd<0)
	    return -1;
	vvfat_close_current_file(s);
	s->current_fd = fd;
	s->current_mapping = mapping;
    }
    return 0;
}

static inline int read_cluster(BDRVVVFATState *s,int cluster_num)
{
    if(s->current_cluster != cluster_num) {
	int result=0;
	off_t offset;
1181
	assert(!s->current_mapping || s->current_fd || (s->current_mapping->mode & MODE_DIRECTORY));
1182 1183 1184 1185
	if(!s->current_mapping
		|| s->current_mapping->begin>cluster_num
		|| s->current_mapping->end<=cluster_num) {
	    /* binary search of mappings for file */
A
Anthony Liguori 已提交
1186
	    mapping_t* mapping=find_mapping_for_cluster(s,cluster_num);
1187 1188 1189 1190 1191 1192 1193 1194

	    assert(!mapping || (cluster_num>=mapping->begin && cluster_num<mapping->end));

	    if (mapping && mapping->mode & MODE_DIRECTORY) {
		vvfat_close_current_file(s);
		s->current_mapping = mapping;
read_cluster_directory:
		offset = s->cluster_size*(cluster_num-s->current_mapping->begin);
T
ths 已提交
1195
		s->cluster = (unsigned char*)s->directory.pointer+offset
1196 1197 1198 1199 1200 1201 1202 1203
			+ 0x20*s->current_mapping->info.dir.first_dir_index;
		assert(((s->cluster-(unsigned char*)s->directory.pointer)%s->cluster_size)==0);
		assert((char*)s->cluster+s->cluster_size <= s->directory.pointer+s->directory.next*s->directory.item_size);
		s->current_cluster = cluster_num;
		return 0;
	    }

	    if(open_file(s,mapping))
1204
		return -2;
1205 1206
	} else if (s->current_mapping->mode & MODE_DIRECTORY)
	    goto read_cluster_directory;
1207

1208 1209 1210
	assert(s->current_fd);

	offset=s->cluster_size*(cluster_num-s->current_mapping->begin)+s->current_mapping->info.file.offset;
1211 1212
	if(lseek(s->current_fd, offset, SEEK_SET)!=offset)
	    return -3;
1213
	s->cluster=s->cluster_buffer;
1214 1215 1216 1217 1218 1219 1220 1221 1222 1223
	result=read(s->current_fd,s->cluster,s->cluster_size);
	if(result<0) {
	    s->current_cluster = -1;
	    return -1;
	}
	s->current_cluster = cluster_num;
    }
    return 0;
}

1224 1225
#ifdef DEBUG
static void hexdump(const void* address, uint32_t len)
1226
{
1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238
    const unsigned char* p = address;
    int i, j;

    for (i = 0; i < len; i += 16) {
	for (j = 0; j < 16 && i + j < len; j++)
	    fprintf(stderr, "%02x ", p[i + j]);
	for (; j < 16; j++)
	    fprintf(stderr, "   ");
	fprintf(stderr, " ");
	for (j = 0; j < 16 && i + j < len; j++)
	    fprintf(stderr, "%c", (p[i + j] < ' ' || p[i + j] > 0x7f) ? '.' : p[i + j]);
	fprintf(stderr, "\n");
1239 1240 1241
    }
}

A
Anthony Liguori 已提交
1242
static void print_direntry(const direntry_t* direntry)
1243
{
1244 1245 1246
    int j = 0;
    char buffer[1024];

K
Kevin Wolf 已提交
1247
    fprintf(stderr, "direntry %p: ", direntry);
1248 1249
    if(!direntry)
	return;
1250
    if(is_long_name(direntry)) {
1251 1252 1253
	unsigned char* c=(unsigned char*)direntry;
	int i;
	for(i=1;i<11 && c[i] && c[i]!=0xff;i+=2)
1254
#define ADD_CHAR(c) {buffer[j] = (c); if (buffer[j] < ' ') buffer[j] = 0xb0; j++;}
1255
	    ADD_CHAR(c[i]);
1256
	for(i=14;i<26 && c[i] && c[i]!=0xff;i+=2)
1257
	    ADD_CHAR(c[i]);
1258
	for(i=28;i<32 && c[i] && c[i]!=0xff;i+=2)
1259 1260 1261
	    ADD_CHAR(c[i]);
	buffer[j] = 0;
	fprintf(stderr, "%s\n", buffer);
1262 1263 1264
    } else {
	int i;
	for(i=0;i<11;i++)
1265 1266 1267 1268
	    ADD_CHAR(direntry->name[i]);
	buffer[j] = 0;
	fprintf(stderr,"%s attributes=0x%02x begin=%d size=%d\n",
		buffer,
1269
		direntry->attributes,
1270
		begin_of_direntry(direntry),le32_to_cpu(direntry->size));
1271 1272 1273
    }
}

A
Anthony Liguori 已提交
1274
static void print_mapping(const mapping_t* mapping)
1275
{
K
Kevin Wolf 已提交
1276 1277 1278 1279 1280
    fprintf(stderr, "mapping (%p): begin, end = %d, %d, dir_index = %d, "
        "first_mapping_index = %d, name = %s, mode = 0x%x, " ,
        mapping, mapping->begin, mapping->end, mapping->dir_index,
        mapping->first_mapping_index, mapping->path, mapping->mode);

1281 1282 1283 1284
    if (mapping->mode & MODE_DIRECTORY)
	fprintf(stderr, "parent_mapping_index = %d, first_dir_index = %d\n", mapping->info.dir.parent_mapping_index, mapping->info.dir.first_dir_index);
    else
	fprintf(stderr, "offset = %d\n", mapping->info.file.offset);
1285
}
1286
#endif
1287

1288
static int vvfat_read(BlockDriverState *bs, int64_t sector_num,
1289
                    uint8_t *buf, int nb_sectors)
1290
{
1291
    BDRVVVFATState *s = bs->opaque;
1292 1293
    int i;

1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308
    for(i=0;i<nb_sectors;i++,sector_num++) {
	if (sector_num >= s->sector_count)
	   return -1;
	if (s->qcow) {
	    int n;
	    if (s->qcow->drv->bdrv_is_allocated(s->qcow,
			sector_num, nb_sectors-i, &n)) {
DLOG(fprintf(stderr, "sectors %d+%d allocated\n", (int)sector_num, n));
		if (s->qcow->drv->bdrv_read(s->qcow, sector_num, buf+i*0x200, n))
		    return -1;
		i += n - 1;
		sector_num += n - 1;
		continue;
	    }
DLOG(fprintf(stderr, "sector %d not allocated\n", (int)sector_num));
1309
	}
1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324
	if(sector_num<s->faked_sectors) {
	    if(sector_num<s->first_sectors_number)
		memcpy(buf+i*0x200,&(s->first_sectors[sector_num*0x200]),0x200);
	    else if(sector_num-s->first_sectors_number<s->sectors_per_fat)
		memcpy(buf+i*0x200,&(s->fat.pointer[(sector_num-s->first_sectors_number)*0x200]),0x200);
	    else if(sector_num-s->first_sectors_number-s->sectors_per_fat<s->sectors_per_fat)
		memcpy(buf+i*0x200,&(s->fat.pointer[(sector_num-s->first_sectors_number-s->sectors_per_fat)*0x200]),0x200);
	} else {
	    uint32_t sector=sector_num-s->faked_sectors,
	    sector_offset_in_cluster=(sector%s->sectors_per_cluster),
	    cluster_num=sector/s->sectors_per_cluster;
	    if(read_cluster(s, cluster_num) != 0) {
		/* LATER TODO: strict: return -1; */
		memset(buf+i*0x200,0,0x200);
		continue;
1325
	    }
1326
	    memcpy(buf+i*0x200,s->cluster+sector_offset_in_cluster*0x200,0x200);
1327 1328 1329 1330 1331
	}
    }
    return 0;
}

1332
/* LATER TODO: statify all functions */
1333

1334 1335
/*
 * Idea of the write support (use snapshot):
1336
 *
1337 1338
 * 1. check if all data is consistent, recording renames, modifications,
 *    new files and directories (in s->commits).
1339
 *
1340
 * 2. if the data is not consistent, stop committing
1341
 *
1342 1343
 * 3. handle renames, and create new files and directories (do not yet
 *    write their contents)
1344
 *
1345 1346
 * 4. walk the directories, fixing the mapping and direntries, and marking
 *    the handled mappings as not deleted
1347
 *
1348
 * 5. commit the contents of the files
1349
 *
1350
 * 6. handle deleted files and directories
1351 1352 1353
 *
 */

A
Anthony Liguori 已提交
1354
typedef struct commit_t {
1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365
    char* path;
    union {
	struct { uint32_t cluster; } rename;
	struct { int dir_index; uint32_t modified_offset; } writeout;
	struct { uint32_t first_cluster; } new_file;
	struct { uint32_t cluster; } mkdir;
    } param;
    /* DELETEs and RMDIRs are handled differently: see handle_deletes() */
    enum {
	ACTION_RENAME, ACTION_WRITEOUT, ACTION_NEW_FILE, ACTION_MKDIR
    } action;
A
Anthony Liguori 已提交
1366
} commit_t;
1367

1368
static void clear_commits(BDRVVVFATState* s)
1369 1370
{
    int i;
1371 1372
DLOG(fprintf(stderr, "clear_commits (%d commits)\n", s->commits.next));
    for (i = 0; i < s->commits.next; i++) {
A
Anthony Liguori 已提交
1373
	commit_t* commit = array_get(&(s->commits), i);
1374 1375 1376 1377 1378 1379
	assert(commit->path || commit->action == ACTION_WRITEOUT);
	if (commit->action != ACTION_WRITEOUT) {
	    assert(commit->path);
	    free(commit->path);
	} else
	    assert(commit->path == NULL);
1380
    }
1381
    s->commits.next = 0;
1382 1383
}

1384 1385
static void schedule_rename(BDRVVVFATState* s,
	uint32_t cluster, char* new_path)
1386
{
A
Anthony Liguori 已提交
1387
    commit_t* commit = array_get_next(&(s->commits));
1388 1389 1390
    commit->path = new_path;
    commit->param.rename.cluster = cluster;
    commit->action = ACTION_RENAME;
1391 1392
}

1393 1394
static void schedule_writeout(BDRVVVFATState* s,
	int dir_index, uint32_t modified_offset)
1395
{
A
Anthony Liguori 已提交
1396
    commit_t* commit = array_get_next(&(s->commits));
1397 1398 1399 1400
    commit->path = NULL;
    commit->param.writeout.dir_index = dir_index;
    commit->param.writeout.modified_offset = modified_offset;
    commit->action = ACTION_WRITEOUT;
1401 1402
}

1403 1404
static void schedule_new_file(BDRVVVFATState* s,
	char* path, uint32_t first_cluster)
1405
{
A
Anthony Liguori 已提交
1406
    commit_t* commit = array_get_next(&(s->commits));
1407 1408 1409 1410 1411 1412 1413
    commit->path = path;
    commit->param.new_file.first_cluster = first_cluster;
    commit->action = ACTION_NEW_FILE;
}

static void schedule_mkdir(BDRVVVFATState* s, uint32_t cluster, char* path)
{
A
Anthony Liguori 已提交
1414
    commit_t* commit = array_get_next(&(s->commits));
1415 1416 1417 1418 1419 1420
    commit->path = path;
    commit->param.mkdir.cluster = cluster;
    commit->action = ACTION_MKDIR;
}

typedef struct {
1421 1422 1423 1424 1425 1426
    /*
     * Since the sequence number is at most 0x3f, and the filename
     * length is at most 13 times the sequence number, the maximal
     * filename length is 0x3f * 13 bytes.
     */
    unsigned char name[0x3f * 13 + 1];
1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438
    int checksum, len;
    int sequence_number;
} long_file_name;

static void lfn_init(long_file_name* lfn)
{
   lfn->sequence_number = lfn->len = 0;
   lfn->checksum = 0x100;
}

/* return 0 if parsed successfully, > 0 if no long name, < 0 if error */
static int parse_long_name(long_file_name* lfn,
A
Anthony Liguori 已提交
1439
	const direntry_t* direntry)
1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450
{
    int i, j, offset;
    const unsigned char* pointer = (const unsigned char*)direntry;

    if (!is_long_name(direntry))
	return 1;

    if (pointer[0] & 0x40) {
	lfn->sequence_number = pointer[0] & 0x3f;
	lfn->checksum = pointer[13];
	lfn->name[0] = 0;
T
ths 已提交
1451
	lfn->name[lfn->sequence_number * 13] = 0;
1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
    } else if ((pointer[0] & 0x3f) != --lfn->sequence_number)
	return -1;
    else if (pointer[13] != lfn->checksum)
	return -2;
    else if (pointer[12] || pointer[26] || pointer[27])
	return -3;

    offset = 13 * (lfn->sequence_number - 1);
    for (i = 0, j = 1; i < 13; i++, j+=2) {
	if (j == 11)
	    j = 14;
	else if (j == 26)
	    j = 28;

	if (pointer[j+1] == 0)
	    lfn->name[offset + i] = pointer[j];
	else if (pointer[j+1] != 0xff || (pointer[0] & 0x40) == 0)
	    return -4;
	else
	    lfn->name[offset + i] = 0;
1472
    }
1473 1474

    if (pointer[0] & 0x40)
T
ths 已提交
1475
	lfn->len = offset + strlen((char*)lfn->name + offset);
1476

1477 1478 1479
    return 0;
}

1480 1481
/* returns 0 if successful, >0 if no short_name, and <0 on error */
static int parse_short_name(BDRVVVFATState* s,
A
Anthony Liguori 已提交
1482
	long_file_name* lfn, direntry_t* direntry)
1483
{
1484
    int i, j;
1485

1486 1487 1488 1489 1490 1491 1492 1493
    if (!is_short_name(direntry))
	return 1;

    for (j = 7; j >= 0 && direntry->name[j] == ' '; j--);
    for (i = 0; i <= j; i++) {
	if (direntry->name[i] <= ' ' || direntry->name[i] > 0x7f)
	    return -1;
	else if (s->downcase_short_names)
1494
	    lfn->name[i] = qemu_tolower(direntry->name[i]);
1495 1496
	else
	    lfn->name[i] = direntry->name[i];
1497 1498
    }

1499 1500 1501 1502 1503 1504 1505 1506
    for (j = 2; j >= 0 && direntry->extension[j] == ' '; j--);
    if (j >= 0) {
	lfn->name[i++] = '.';
	lfn->name[i + j + 1] = '\0';
	for (;j >= 0; j--) {
	    if (direntry->extension[j] <= ' ' || direntry->extension[j] > 0x7f)
		return -2;
	    else if (s->downcase_short_names)
1507
		lfn->name[i + j] = qemu_tolower(direntry->extension[j]);
1508 1509 1510 1511 1512 1513
	    else
		lfn->name[i + j] = direntry->extension[j];
	}
    } else
	lfn->name[i + j + 1] = '\0';

T
ths 已提交
1514
    lfn->len = strlen((char*)lfn->name);
1515 1516

    return 0;
1517 1518
}

1519 1520
static inline uint32_t modified_fat_get(BDRVVVFATState* s,
	unsigned int cluster)
1521
{
1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
    if (cluster < s->last_cluster_of_root_directory) {
	if (cluster + 1 == s->last_cluster_of_root_directory)
	    return s->max_fat_value;
	else
	    return cluster + 1;
    }

    if (s->fat_type==32) {
        uint32_t* entry=((uint32_t*)s->fat2)+cluster;
        return le32_to_cpu(*entry);
    } else if (s->fat_type==16) {
        uint16_t* entry=((uint16_t*)s->fat2)+cluster;
        return le16_to_cpu(*entry);
    } else {
        const uint8_t* x=s->fat2+cluster*3/2;
        return ((x[0]|(x[1]<<8))>>(cluster&1?4:0))&0x0fff;
    }
}

static inline int cluster_was_modified(BDRVVVFATState* s, uint32_t cluster_num)
{
    int was_modified = 0;
    int i, dummy;

    if (s->qcow == NULL)
1547
	return 0;
1548 1549 1550 1551 1552 1553

    for (i = 0; !was_modified && i < s->sectors_per_cluster; i++)
	was_modified = s->qcow->drv->bdrv_is_allocated(s->qcow,
		cluster2sector(s, cluster_num) + i, 1, &dummy);

    return was_modified;
1554 1555
}

1556
static const char* get_basename(const char* path)
1557
{
1558 1559 1560 1561 1562
    char* basename = strrchr(path, '/');
    if (basename == NULL)
	return path;
    else
	return basename + 1; /* strip '/' */
1563 1564
}

1565 1566 1567 1568 1569 1570 1571 1572 1573
/*
 * The array s->used_clusters holds the states of the clusters. If it is
 * part of a file, it has bit 2 set, in case of a directory, bit 1. If it
 * was modified, bit 3 is set.
 * If any cluster is allocated, but not part of a file or directory, this
 * driver refuses to commit.
 */
typedef enum {
     USED_DIRECTORY = 1, USED_FILE = 2, USED_ANY = 3, USED_ALLOCATED = 4
A
Anthony Liguori 已提交
1574
} used_t;
1575

1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586
/*
 * get_cluster_count_for_direntry() not only determines how many clusters
 * are occupied by direntry, but also if it was renamed or modified.
 *
 * A file is thought to be renamed *only* if there already was a file with
 * exactly the same first cluster, but a different name.
 *
 * Further, the files/directories handled by this function are
 * assumed to be *not* deleted (and *only* those).
 */
static uint32_t get_cluster_count_for_direntry(BDRVVVFATState* s,
A
Anthony Liguori 已提交
1587
	direntry_t* direntry, const char* path)
1588
{
1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612
    /*
     * This is a little bit tricky:
     * IF the guest OS just inserts a cluster into the file chain,
     * and leaves the rest alone, (i.e. the original file had clusters
     * 15 -> 16, but now has 15 -> 32 -> 16), then the following happens:
     *
     * - do_commit will write the cluster into the file at the given
     *   offset, but
     *
     * - the cluster which is overwritten should be moved to a later
     *   position in the file.
     *
     * I am not aware that any OS does something as braindead, but this
     * situation could happen anyway when not committing for a long time.
     * Just to be sure that this does not bite us, detect it, and copy the
     * contents of the clusters to-be-overwritten into the qcow.
     */
    int copy_it = 0;
    int was_modified = 0;
    int32_t ret = 0;

    uint32_t cluster_num = begin_of_direntry(direntry);
    uint32_t offset = 0;
    int first_mapping_index = -1;
A
Anthony Liguori 已提交
1613
    mapping_t* mapping = NULL;
1614
    const char* basename2 = NULL;
1615

1616
    vvfat_close_current_file(s);
1617

1618 1619
    /* the root directory */
    if (cluster_num == 0)
1620 1621
	return 0;

1622 1623 1624
    /* write support */
    if (s->qcow) {
	basename2 = get_basename(path);
1625

1626 1627 1628
	mapping = find_mapping_for_cluster(s, cluster_num);

	if (mapping) {
B
bellard 已提交
1629 1630
	    const char* basename;

1631 1632 1633
	    assert(mapping->mode & MODE_DELETED);
	    mapping->mode &= ~MODE_DELETED;

B
bellard 已提交
1634
	    basename = get_basename(mapping->path);
1635 1636 1637 1638 1639

	    assert(mapping->mode & MODE_NORMAL);

	    /* rename */
	    if (strcmp(basename, basename2))
1640
		schedule_rename(s, cluster_num, qemu_strdup(path));
1641 1642
	} else if (is_file(direntry))
	    /* new file */
1643
	    schedule_new_file(s, qemu_strdup(path), cluster_num);
1644
	else {
1645
            abort();
1646 1647
	    return 0;
	}
1648 1649
    }

1650 1651 1652 1653 1654 1655 1656
    while(1) {
	if (s->qcow) {
	    if (!copy_it && cluster_was_modified(s, cluster_num)) {
		if (mapping == NULL ||
			mapping->begin > cluster_num ||
			mapping->end <= cluster_num)
		mapping = find_mapping_for_cluster(s, cluster_num);
1657

1658 1659 1660 1661 1662 1663 1664 1665

		if (mapping &&
			(mapping->mode & MODE_DIRECTORY) == 0) {

		    /* was modified in qcow */
		    if (offset != mapping->info.file.offset + s->cluster_size
			    * (cluster_num - mapping->begin)) {
			/* offset of this cluster in file chain has changed */
1666
                        abort();
1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677
			copy_it = 1;
		    } else if (offset == 0) {
			const char* basename = get_basename(mapping->path);

			if (strcmp(basename, basename2))
			    copy_it = 1;
			first_mapping_index = array_index(&(s->mapping), mapping);
		    }

		    if (mapping->first_mapping_index != first_mapping_index
			    && mapping->info.file.offset > 0) {
1678
                        abort();
1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725
			copy_it = 1;
		    }

		    /* need to write out? */
		    if (!was_modified && is_file(direntry)) {
			was_modified = 1;
			schedule_writeout(s, mapping->dir_index, offset);
		    }
		}
	    }

	    if (copy_it) {
		int i, dummy;
		/*
		 * This is horribly inefficient, but that is okay, since
		 * it is rarely executed, if at all.
		 */
		int64_t offset = cluster2sector(s, cluster_num);

		vvfat_close_current_file(s);
		for (i = 0; i < s->sectors_per_cluster; i++)
		    if (!s->qcow->drv->bdrv_is_allocated(s->qcow,
				offset + i, 1, &dummy)) {
			if (vvfat_read(s->bs,
				    offset, s->cluster_buffer, 1))
			    return -1;
			if (s->qcow->drv->bdrv_write(s->qcow,
				    offset, s->cluster_buffer, 1))
			    return -2;
		    }
	    }
	}

	ret++;
	if (s->used_clusters[cluster_num] & USED_ANY)
	    return 0;
	s->used_clusters[cluster_num] = USED_FILE;

	cluster_num = modified_fat_get(s, cluster_num);

	if (fat_eof(s, cluster_num))
	    return ret;
	else if (cluster_num < 2 || cluster_num > s->max_fat_value - 16)
	    return -1;

	offset += s->cluster_size;
    }
1726 1727
}

1728
/*
1729
 * This function looks at the modified data (qcow).
1730 1731 1732 1733 1734
 * It returns 0 upon inconsistency or error, and the number of clusters
 * used by the directory, its subdirectories and their files.
 */
static int check_directory_consistency(BDRVVVFATState *s,
	int cluster_num, const char* path)
1735
{
1736
    int ret = 0;
1737
    unsigned char* cluster = qemu_malloc(s->cluster_size);
A
Anthony Liguori 已提交
1738 1739
    direntry_t* direntries = (direntry_t*)cluster;
    mapping_t* mapping = find_mapping_for_cluster(s, cluster_num);
1740 1741 1742 1743 1744 1745

    long_file_name lfn;
    int path_len = strlen(path);
    char path2[PATH_MAX];

    assert(path_len < PATH_MAX); /* len was tested before! */
B
blueswir1 已提交
1746
    pstrcpy(path2, sizeof(path2), path);
1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759
    path2[path_len] = '/';
    path2[path_len + 1] = '\0';

    if (mapping) {
	const char* basename = get_basename(mapping->path);
	const char* basename2 = get_basename(path);

	assert(mapping->mode & MODE_DIRECTORY);

	assert(mapping->mode & MODE_DELETED);
	mapping->mode &= ~MODE_DELETED;

	if (strcmp(basename, basename2))
1760
	    schedule_rename(s, cluster_num, qemu_strdup(path));
1761 1762
    } else
	/* new directory */
1763
	schedule_mkdir(s, cluster_num, qemu_strdup(path));
1764

1765 1766
    lfn_init(&lfn);
    do {
1767
	int i;
1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788
	int subret = 0;

	ret++;

	if (s->used_clusters[cluster_num] & USED_ANY) {
	    fprintf(stderr, "cluster %d used more than once\n", (int)cluster_num);
	    return 0;
	}
	s->used_clusters[cluster_num] = USED_DIRECTORY;

DLOG(fprintf(stderr, "read cluster %d (sector %d)\n", (int)cluster_num, (int)cluster2sector(s, cluster_num)));
	subret = vvfat_read(s->bs, cluster2sector(s, cluster_num), cluster,
		s->sectors_per_cluster);
	if (subret) {
	    fprintf(stderr, "Error fetching direntries\n");
	fail:
	    free(cluster);
	    return 0;
	}

	for (i = 0; i < 0x10 * s->sectors_per_cluster; i++) {
1789
	    int cluster_count = 0;
1790 1791 1792 1793 1794 1795 1796 1797 1798 1799

DLOG(fprintf(stderr, "check direntry %d: \n", i); print_direntry(direntries + i));
	    if (is_volume_label(direntries + i) || is_dot(direntries + i) ||
		    is_free(direntries + i))
		continue;

	    subret = parse_long_name(&lfn, direntries + i);
	    if (subret < 0) {
		fprintf(stderr, "Error in long name\n");
		goto fail;
1800
	    }
1801 1802 1803 1804 1805 1806 1807 1808 1809
	    if (subret == 0 || is_free(direntries + i))
		continue;

	    if (fat_chksum(direntries+i) != lfn.checksum) {
		subret = parse_short_name(s, &lfn, direntries + i);
		if (subret < 0) {
		    fprintf(stderr, "Error in short name (%d)\n", subret);
		    goto fail;
		}
T
ths 已提交
1810 1811
		if (subret > 0 || !strcmp((char*)lfn.name, ".")
			|| !strcmp((char*)lfn.name, ".."))
1812 1813 1814 1815 1816 1817 1818 1819
		    continue;
	    }
	    lfn.checksum = 0x100; /* cannot use long name twice */

	    if (path_len + 1 + lfn.len >= PATH_MAX) {
		fprintf(stderr, "Name too long: %s/%s\n", path, lfn.name);
		goto fail;
	    }
B
blueswir1 已提交
1820 1821
            pstrcpy(path2 + path_len + 1, sizeof(path2) - path_len - 1,
                    (char*)lfn.name);
1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843

	    if (is_directory(direntries + i)) {
		if (begin_of_direntry(direntries + i) == 0) {
		    DLOG(fprintf(stderr, "invalid begin for directory: %s\n", path2); print_direntry(direntries + i));
		    goto fail;
		}
		cluster_count = check_directory_consistency(s,
			begin_of_direntry(direntries + i), path2);
		if (cluster_count == 0) {
		    DLOG(fprintf(stderr, "problem in directory %s:\n", path2); print_direntry(direntries + i));
		    goto fail;
		}
	    } else if (is_file(direntries + i)) {
		/* check file size with FAT */
		cluster_count = get_cluster_count_for_direntry(s, direntries + i, path2);
		if (cluster_count !=
			(le32_to_cpu(direntries[i].size) + s->cluster_size
			 - 1) / s->cluster_size) {
		    DLOG(fprintf(stderr, "Cluster count mismatch\n"));
		    goto fail;
		}
	    } else
1844
                abort(); /* cluster_count = 0; */
1845 1846

	    ret += cluster_count;
1847 1848
	}

1849 1850
	cluster_num = modified_fat_get(s, cluster_num);
    } while(!fat_eof(s, cluster_num));
1851

1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877
    free(cluster);
    return ret;
}

/* returns 1 on success */
static int is_consistent(BDRVVVFATState* s)
{
    int i, check;
    int used_clusters_count = 0;

DLOG(checkpoint());
    /*
     * - get modified FAT
     * - compare the two FATs (TODO)
     * - get buffer for marking used clusters
     * - recurse direntries from root (using bs->bdrv_read to make
     *    sure to get the new data)
     *   - check that the FAT agrees with the size
     *   - count the number of clusters occupied by this directory and
     *     its files
     * - check that the cumulative used cluster count agrees with the
     *   FAT
     * - if all is fine, return number of used clusters
     */
    if (s->fat2 == NULL) {
	int size = 0x200 * s->sectors_per_fat;
1878
	s->fat2 = qemu_malloc(size);
1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896
	memcpy(s->fat2, s->fat.pointer, size);
    }
    check = vvfat_read(s->bs,
	    s->first_sectors_number, s->fat2, s->sectors_per_fat);
    if (check) {
	fprintf(stderr, "Could not copy fat\n");
	return 0;
    }
    assert (s->used_clusters);
    for (i = 0; i < sector2cluster(s, s->sector_count); i++)
	s->used_clusters[i] &= ~USED_ANY;

    clear_commits(s);

    /* mark every mapped file/directory as deleted.
     * (check_directory_consistency() will unmark those still present). */
    if (s->qcow)
	for (i = 0; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
1897
	    mapping_t* mapping = array_get(&(s->mapping), i);
1898 1899
	    if (mapping->first_mapping_index < 0)
		mapping->mode |= MODE_DELETED;
1900
	}
1901 1902 1903 1904 1905

    used_clusters_count = check_directory_consistency(s, 0, s->path);
    if (used_clusters_count <= 0) {
	DLOG(fprintf(stderr, "problem in directory\n"));
	return 0;
1906 1907
    }

1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936
    check = s->last_cluster_of_root_directory;
    for (i = check; i < sector2cluster(s, s->sector_count); i++) {
	if (modified_fat_get(s, i)) {
	    if(!s->used_clusters[i]) {
		DLOG(fprintf(stderr, "FAT was modified (%d), but cluster is not used?\n", i));
		return 0;
	    }
	    check++;
	}

	if (s->used_clusters[i] == USED_ALLOCATED) {
	    /* allocated, but not used... */
	    DLOG(fprintf(stderr, "unused, modified cluster: %d\n", i));
	    return 0;
	}
    }

    if (check != used_clusters_count)
	return 0;

    return used_clusters_count;
}

static inline void adjust_mapping_indices(BDRVVVFATState* s,
	int offset, int adjust)
{
    int i;

    for (i = 0; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
1937
	mapping_t* mapping = array_get(&(s->mapping), i);
1938 1939 1940 1941 1942 1943 1944 1945

#define ADJUST_MAPPING_INDEX(name) \
	if (mapping->name >= offset) \
	    mapping->name += adjust

	ADJUST_MAPPING_INDEX(first_mapping_index);
	if (mapping->mode & MODE_DIRECTORY)
	    ADJUST_MAPPING_INDEX(info.dir.parent_mapping_index);
1946
    }
1947 1948 1949
}

/* insert or update mapping */
A
Anthony Liguori 已提交
1950
static mapping_t* insert_mapping(BDRVVVFATState* s,
1951 1952 1953 1954 1955 1956 1957 1958 1959 1960
	uint32_t begin, uint32_t end)
{
    /*
     * - find mapping where mapping->begin >= begin,
     * - if mapping->begin > begin: insert
     *   - adjust all references to mappings!
     * - else: adjust
     * - replace name
     */
    int index = find_mapping_for_cluster_aux(s, begin, 0, s->mapping.next);
A
Anthony Liguori 已提交
1961 1962
    mapping_t* mapping = NULL;
    mapping_t* first_mapping = array_get(&(s->mapping), 0);
1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977

    if (index < s->mapping.next && (mapping = array_get(&(s->mapping), index))
	    && mapping->begin < begin) {
	mapping->end = begin;
	index++;
	mapping = array_get(&(s->mapping), index);
    }
    if (index >= s->mapping.next || mapping->begin > begin) {
	mapping = array_insert(&(s->mapping), index, 1);
	mapping->path = NULL;
	adjust_mapping_indices(s, index, +1);
    }

    mapping->begin = begin;
    mapping->end = end;
1978

A
Anthony Liguori 已提交
1979
DLOG(mapping_t* next_mapping;
1980 1981 1982 1983
assert(index + 1 >= s->mapping.next ||
((next_mapping = array_get(&(s->mapping), index + 1)) &&
 next_mapping->begin >= end)));

A
Anthony Liguori 已提交
1984
    if (s->current_mapping && first_mapping != (mapping_t*)s->mapping.pointer)
1985 1986 1987 1988 1989 1990 1991 1992
	s->current_mapping = array_get(&(s->mapping),
		s->current_mapping - first_mapping);

    return mapping;
}

static int remove_mapping(BDRVVVFATState* s, int mapping_index)
{
A
Anthony Liguori 已提交
1993 1994
    mapping_t* mapping = array_get(&(s->mapping), mapping_index);
    mapping_t* first_mapping = array_get(&(s->mapping), 0);
1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005

    /* free mapping */
    if (mapping->first_mapping_index < 0)
	free(mapping->path);

    /* remove from s->mapping */
    array_remove(&(s->mapping), mapping_index);

    /* adjust all references to mappings */
    adjust_mapping_indices(s, mapping_index, -1);

A
Anthony Liguori 已提交
2006
    if (s->current_mapping && first_mapping != (mapping_t*)s->mapping.pointer)
2007 2008
	s->current_mapping = array_get(&(s->mapping),
		s->current_mapping - first_mapping);
2009 2010 2011 2012

    return 0;
}

2013 2014 2015 2016
static void adjust_dirindices(BDRVVVFATState* s, int offset, int adjust)
{
    int i;
    for (i = 0; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
2017
	mapping_t* mapping = array_get(&(s->mapping), i);
2018 2019 2020 2021 2022 2023 2024
	if (mapping->dir_index >= offset)
	    mapping->dir_index += adjust;
	if ((mapping->mode & MODE_DIRECTORY) &&
		mapping->info.dir.first_dir_index >= offset)
	    mapping->info.dir.first_dir_index += adjust;
    }
}
2025

A
Anthony Liguori 已提交
2026
static direntry_t* insert_direntries(BDRVVVFATState* s,
2027
	int dir_index, int count)
2028
{
2029 2030 2031 2032
    /*
     * make room in s->directory,
     * adjust_dirindices
     */
A
Anthony Liguori 已提交
2033
    direntry_t* result = array_insert(&(s->directory), dir_index, count);
2034 2035 2036
    if (result == NULL)
	return NULL;
    adjust_dirindices(s, dir_index, count);
2037 2038 2039
    return result;
}

2040 2041 2042 2043 2044 2045 2046 2047
static int remove_direntries(BDRVVVFATState* s, int dir_index, int count)
{
    int ret = array_remove_slice(&(s->directory), dir_index, count);
    if (ret)
	return ret;
    adjust_dirindices(s, dir_index, -count);
    return 0;
}
2048

2049 2050 2051 2052 2053 2054 2055 2056
/*
 * Adapt the mappings of the cluster chain starting at first cluster
 * (i.e. if a file starts at first_cluster, the chain is followed according
 * to the modified fat, and the corresponding entries in s->mapping are
 * adjusted)
 */
static int commit_mappings(BDRVVVFATState* s,
	uint32_t first_cluster, int dir_index)
2057
{
A
Anthony Liguori 已提交
2058 2059
    mapping_t* mapping = find_mapping_for_cluster(s, first_cluster);
    direntry_t* direntry = array_get(&(s->directory), dir_index);
2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090
    uint32_t cluster = first_cluster;

    vvfat_close_current_file(s);

    assert(mapping);
    assert(mapping->begin == first_cluster);
    mapping->first_mapping_index = -1;
    mapping->dir_index = dir_index;
    mapping->mode = (dir_index <= 0 || is_directory(direntry)) ?
	MODE_DIRECTORY : MODE_NORMAL;

    while (!fat_eof(s, cluster)) {
	uint32_t c, c1;

	for (c = cluster, c1 = modified_fat_get(s, c); c + 1 == c1;
		c = c1, c1 = modified_fat_get(s, c1));

	c++;
	if (c > mapping->end) {
	    int index = array_index(&(s->mapping), mapping);
	    int i, max_i = s->mapping.next - index;
	    for (i = 1; i < max_i && mapping[i].begin < c; i++);
	    while (--i > 0)
		remove_mapping(s, index + 1);
	}
	assert(mapping == array_get(&(s->mapping), s->mapping.next - 1)
		|| mapping[1].begin >= c);
	mapping->end = c;

	if (!fat_eof(s, c1)) {
	    int i = find_mapping_for_cluster_aux(s, c1, 0, s->mapping.next);
A
Anthony Liguori 已提交
2091
	    mapping_t* next_mapping = i >= s->mapping.next ? NULL :
2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104
		array_get(&(s->mapping), i);

	    if (next_mapping == NULL || next_mapping->begin > c1) {
		int i1 = array_index(&(s->mapping), mapping);

		next_mapping = insert_mapping(s, c1, c1+1);

		if (c1 < c)
		    i1++;
		mapping = array_get(&(s->mapping), i1);
	    }

	    next_mapping->dir_index = mapping->dir_index;
2105
	    next_mapping->first_mapping_index =
2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124
		mapping->first_mapping_index < 0 ?
		array_index(&(s->mapping), mapping) :
		mapping->first_mapping_index;
	    next_mapping->path = mapping->path;
	    next_mapping->mode = mapping->mode;
	    next_mapping->read_only = mapping->read_only;
	    if (mapping->mode & MODE_DIRECTORY) {
		next_mapping->info.dir.parent_mapping_index =
			mapping->info.dir.parent_mapping_index;
		next_mapping->info.dir.first_dir_index =
			mapping->info.dir.first_dir_index +
			0x10 * s->sectors_per_cluster *
			(mapping->end - mapping->begin);
	    } else
		next_mapping->info.file.offset = mapping->info.file.offset +
			mapping->end - mapping->begin;

	    mapping = next_mapping;
	}
2125

2126 2127
	cluster = c1;
    }
2128 2129 2130 2131

    return 0;
}

2132 2133
static int commit_direntries(BDRVVVFATState* s,
	int dir_index, int parent_mapping_index)
2134
{
A
Anthony Liguori 已提交
2135
    direntry_t* direntry = array_get(&(s->directory), dir_index);
2136
    uint32_t first_cluster = dir_index == 0 ? 0 : begin_of_direntry(direntry);
A
Anthony Liguori 已提交
2137
    mapping_t* mapping = find_mapping_for_cluster(s, first_cluster);
2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163

    int factor = 0x10 * s->sectors_per_cluster;
    int old_cluster_count, new_cluster_count;
    int current_dir_index = mapping->info.dir.first_dir_index;
    int first_dir_index = current_dir_index;
    int ret, i;
    uint32_t c;

DLOG(fprintf(stderr, "commit_direntries for %s, parent_mapping_index %d\n", mapping->path, parent_mapping_index));

    assert(direntry);
    assert(mapping);
    assert(mapping->begin == first_cluster);
    assert(mapping->info.dir.first_dir_index < s->directory.next);
    assert(mapping->mode & MODE_DIRECTORY);
    assert(dir_index == 0 || is_directory(direntry));

    mapping->info.dir.parent_mapping_index = parent_mapping_index;

    if (first_cluster == 0) {
	old_cluster_count = new_cluster_count =
	    s->last_cluster_of_root_directory;
    } else {
	for (old_cluster_count = 0, c = first_cluster; !fat_eof(s, c);
		c = fat_get(s, c))
	    old_cluster_count++;
2164

2165 2166 2167 2168
	for (new_cluster_count = 0, c = first_cluster; !fat_eof(s, c);
		c = modified_fat_get(s, c))
	    new_cluster_count++;
    }
2169

2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188
    if (new_cluster_count > old_cluster_count) {
	if (insert_direntries(s,
		current_dir_index + factor * old_cluster_count,
		factor * (new_cluster_count - old_cluster_count)) == NULL)
	    return -1;
    } else if (new_cluster_count < old_cluster_count)
	remove_direntries(s,
		current_dir_index + factor * new_cluster_count,
		factor * (old_cluster_count - new_cluster_count));

    for (c = first_cluster; !fat_eof(s, c); c = modified_fat_get(s, c)) {
	void* direntry = array_get(&(s->directory), current_dir_index);
	int ret = vvfat_read(s->bs, cluster2sector(s, c), direntry,
		s->sectors_per_cluster);
	if (ret)
	    return ret;
	assert(!strncmp(s->directory.pointer, "QEMU", 4));
	current_dir_index += factor;
    }
2189

2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205
    ret = commit_mappings(s, first_cluster, dir_index);
    if (ret)
	return ret;

    /* recurse */
    for (i = 0; i < factor * new_cluster_count; i++) {
	direntry = array_get(&(s->directory), first_dir_index + i);
	if (is_directory(direntry) && !is_dot(direntry)) {
	    mapping = find_mapping_for_cluster(s, first_cluster);
	    assert(mapping->mode & MODE_DIRECTORY);
	    ret = commit_direntries(s, first_dir_index + i,
		array_index(&(s->mapping), mapping));
	    if (ret)
		return ret;
	}
    }
2206

2207 2208
    return 0;
}
2209

2210 2211 2212 2213 2214
/* commit one file (adjust contents, adjust mapping),
   return first_mapping_index */
static int commit_one_file(BDRVVVFATState* s,
	int dir_index, uint32_t offset)
{
A
Anthony Liguori 已提交
2215
    direntry_t* direntry = array_get(&(s->directory), dir_index);
2216 2217
    uint32_t c = begin_of_direntry(direntry);
    uint32_t first_cluster = c;
A
Anthony Liguori 已提交
2218
    mapping_t* mapping = find_mapping_for_cluster(s, c);
2219
    uint32_t size = filesize_of_direntry(direntry);
2220
    char* cluster = qemu_malloc(s->cluster_size);
2221 2222 2223 2224 2225 2226 2227 2228 2229
    uint32_t i;
    int fd = 0;

    assert(offset < size);
    assert((offset % s->cluster_size) == 0);

    for (i = s->cluster_size; i < offset; i += s->cluster_size)
	c = modified_fat_get(s, c);

B
bellard 已提交
2230
    fd = open(mapping->path, O_RDWR | O_CREAT | O_BINARY, 0666);
2231 2232 2233 2234
    if (fd < 0) {
	fprintf(stderr, "Could not open %s... (%s, %d)\n", mapping->path,
		strerror(errno), errno);
	return fd;
2235
    }
2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251
    if (offset > 0)
	if (lseek(fd, offset, SEEK_SET) != offset)
	    return -3;

    while (offset < size) {
	uint32_t c1;
	int rest_size = (size - offset > s->cluster_size ?
		s->cluster_size : size - offset);
	int ret;

	c1 = modified_fat_get(s, c);

	assert((size - offset == 0 && fat_eof(s, c)) ||
		(size > offset && c >=2 && !fat_eof(s, c)));

	ret = vvfat_read(s->bs, cluster2sector(s, c),
T
ths 已提交
2252
	    (uint8_t*)cluster, (rest_size + 0x1ff) / 0x200);
2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263

	if (ret < 0)
	    return ret;

	if (write(fd, cluster, rest_size) < 0)
	    return -2;

	offset += rest_size;
	c = c1;
    }

2264 2265 2266 2267 2268
    if (ftruncate(fd, size)) {
        perror("ftruncate()");
        close(fd);
        return -4;
    }
2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279
    close(fd);

    return commit_mappings(s, first_cluster, dir_index);
}

#ifdef DEBUG
/* test, if all mappings point to valid direntries */
static void check1(BDRVVVFATState* s)
{
    int i;
    for (i = 0; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
2280
	mapping_t* mapping = array_get(&(s->mapping), i);
2281 2282 2283 2284 2285 2286
	if (mapping->mode & MODE_DELETED) {
	    fprintf(stderr, "deleted\n");
	    continue;
	}
	assert(mapping->dir_index >= 0);
	assert(mapping->dir_index < s->directory.next);
A
Anthony Liguori 已提交
2287
	direntry_t* direntry = array_get(&(s->directory), mapping->dir_index);
2288 2289 2290 2291
	assert(mapping->begin == begin_of_direntry(direntry) || mapping->first_mapping_index >= 0);
	if (mapping->mode & MODE_DIRECTORY) {
	    assert(mapping->info.dir.first_dir_index + 0x10 * s->sectors_per_cluster * (mapping->end - mapping->begin) <= s->directory.next);
	    assert((mapping->info.dir.first_dir_index % (0x10 * s->sectors_per_cluster)) == 0);
2292 2293 2294 2295
	}
    }
}

2296 2297
/* test, if all direntries have mappings */
static void check2(BDRVVVFATState* s)
2298 2299
{
    int i;
2300
    int first_mapping = -1;
2301

2302
    for (i = 0; i < s->directory.next; i++) {
A
Anthony Liguori 已提交
2303
	direntry_t* direntry = array_get(&(s->directory), i);
2304

2305
	if (is_short_name(direntry) && begin_of_direntry(direntry)) {
A
Anthony Liguori 已提交
2306
	    mapping_t* mapping = find_mapping_for_cluster(s, begin_of_direntry(direntry));
2307 2308 2309 2310
	    assert(mapping);
	    assert(mapping->dir_index == i || is_dot(direntry));
	    assert(mapping->begin == begin_of_direntry(direntry) || is_dot(direntry));
	}
2311

2312 2313 2314
	if ((i % (0x10 * s->sectors_per_cluster)) == 0) {
	    /* cluster start */
	    int j, count = 0;
2315

2316
	    for (j = 0; j < s->mapping.next; j++) {
A
Anthony Liguori 已提交
2317
		mapping_t* mapping = array_get(&(s->mapping), j);
2318
		if (mapping->mode & MODE_DELETED)
2319
		    continue;
2320 2321 2322 2323 2324 2325 2326 2327 2328 2329
		if (mapping->mode & MODE_DIRECTORY) {
		    if (mapping->info.dir.first_dir_index <= i && mapping->info.dir.first_dir_index + 0x10 * s->sectors_per_cluster > i) {
			assert(++count == 1);
			if (mapping->first_mapping_index == -1)
			    first_mapping = array_index(&(s->mapping), mapping);
			else
			    assert(first_mapping == mapping->first_mapping_index);
			if (mapping->info.dir.parent_mapping_index < 0)
			    assert(j == 0);
			else {
A
Anthony Liguori 已提交
2330
			    mapping_t* parent = array_get(&(s->mapping), mapping->info.dir.parent_mapping_index);
2331 2332 2333 2334
			    assert(parent->mode & MODE_DIRECTORY);
			    assert(parent->info.dir.first_dir_index < mapping->info.dir.first_dir_index);
			}
		    }
2335
		}
2336 2337 2338 2339 2340 2341 2342
	    }
	    if (count == 0)
		first_mapping = -1;
	}
    }
}
#endif
2343

2344 2345 2346
static int handle_renames_and_mkdirs(BDRVVVFATState* s)
{
    int i;
2347

2348 2349 2350
#ifdef DEBUG
    fprintf(stderr, "handle_renames\n");
    for (i = 0; i < s->commits.next; i++) {
A
Anthony Liguori 已提交
2351
	commit_t* commit = array_get(&(s->commits), i);
2352 2353 2354 2355 2356
	fprintf(stderr, "%d, %s (%d, %d)\n", i, commit->path ? commit->path : "(null)", commit->param.rename.cluster, commit->action);
    }
#endif

    for (i = 0; i < s->commits.next;) {
A
Anthony Liguori 已提交
2357
	commit_t* commit = array_get(&(s->commits), i);
2358
	if (commit->action == ACTION_RENAME) {
A
Anthony Liguori 已提交
2359
	    mapping_t* mapping = find_mapping_for_cluster(s,
2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371
		    commit->param.rename.cluster);
	    char* old_path = mapping->path;

	    assert(commit->path);
	    mapping->path = commit->path;
	    if (rename(old_path, mapping->path))
		return -2;

	    if (mapping->mode & MODE_DIRECTORY) {
		int l1 = strlen(mapping->path);
		int l2 = strlen(old_path);
		int diff = l1 - l2;
A
Anthony Liguori 已提交
2372
		direntry_t* direntry = array_get(&(s->directory),
2373 2374 2375 2376 2377 2378 2379
			mapping->info.dir.first_dir_index);
		uint32_t c = mapping->begin;
		int i = 0;

		/* recurse */
		while (!fat_eof(s, c)) {
		    do {
A
Anthony Liguori 已提交
2380
			direntry_t* d = direntry + i;
2381 2382

			if (is_file(d) || (is_directory(d) && !is_dot(d))) {
A
Anthony Liguori 已提交
2383
			    mapping_t* m = find_mapping_for_cluster(s,
2384 2385
				    begin_of_direntry(d));
			    int l = strlen(m->path);
2386
			    char* new_path = qemu_malloc(l + diff + 1);
2387 2388 2389

			    assert(!strncmp(m->path, mapping->path, l2));

B
blueswir1 已提交
2390 2391 2392
                            pstrcpy(new_path, l + diff + 1, mapping->path);
                            pstrcpy(new_path + l1, l + diff + 1 - l1,
                                    m->path + l2);
2393 2394

			    schedule_rename(s, m->begin, new_path);
2395
			}
2396 2397 2398
			i++;
		    } while((i % (0x10 * s->sectors_per_cluster)) != 0);
		    c = fat_get(s, c);
2399 2400 2401
		}
	    }

2402 2403 2404 2405
	    free(old_path);
	    array_remove(&(s->commits), i);
	    continue;
	} else if (commit->action == ACTION_MKDIR) {
A
Anthony Liguori 已提交
2406
	    mapping_t* mapping;
2407 2408
	    int j, parent_path_len;

B
bellard 已提交
2409 2410 2411 2412 2413 2414 2415
#ifdef __MINGW32__
            if (mkdir(commit->path))
                return -5;
#else
            if (mkdir(commit->path, 0755))
                return -5;
#endif
2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433

	    mapping = insert_mapping(s, commit->param.mkdir.cluster,
		    commit->param.mkdir.cluster + 1);
	    if (mapping == NULL)
		return -6;

	    mapping->mode = MODE_DIRECTORY;
	    mapping->read_only = 0;
	    mapping->path = commit->path;
	    j = s->directory.next;
	    assert(j);
	    insert_direntries(s, s->directory.next,
		    0x10 * s->sectors_per_cluster);
	    mapping->info.dir.first_dir_index = j;

	    parent_path_len = strlen(commit->path)
		- strlen(get_basename(commit->path)) - 1;
	    for (j = 0; j < s->mapping.next; j++) {
A
Anthony Liguori 已提交
2434
		mapping_t* m = array_get(&(s->mapping), j);
2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461
		if (m->first_mapping_index < 0 && m != mapping &&
			!strncmp(m->path, mapping->path, parent_path_len) &&
			strlen(m->path) == parent_path_len)
		    break;
	    }
	    assert(j < s->mapping.next);
	    mapping->info.dir.parent_mapping_index = j;

	    array_remove(&(s->commits), i);
	    continue;
	}

	i++;
    }
    return 0;
}

/*
 * TODO: make sure that the short name is not matching *another* file
 */
static int handle_commits(BDRVVVFATState* s)
{
    int i, fail = 0;

    vvfat_close_current_file(s);

    for (i = 0; !fail && i < s->commits.next; i++) {
A
Anthony Liguori 已提交
2462
	commit_t* commit = array_get(&(s->commits), i);
2463 2464
	switch(commit->action) {
	case ACTION_RENAME: case ACTION_MKDIR:
2465
            abort();
2466 2467 2468
	    fail = -2;
	    break;
	case ACTION_WRITEOUT: {
B
Blue Swirl 已提交
2469 2470
#ifndef NDEBUG
            /* these variables are only used by assert() below */
A
Anthony Liguori 已提交
2471
	    direntry_t* entry = array_get(&(s->directory),
2472 2473
		    commit->param.writeout.dir_index);
	    uint32_t begin = begin_of_direntry(entry);
A
Anthony Liguori 已提交
2474
	    mapping_t* mapping = find_mapping_for_cluster(s, begin);
B
Blue Swirl 已提交
2475
#endif
2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488

	    assert(mapping);
	    assert(mapping->begin == begin);
	    assert(commit->path == NULL);

	    if (commit_one_file(s, commit->param.writeout.dir_index,
			commit->param.writeout.modified_offset))
		fail = -3;

	    break;
	}
	case ACTION_NEW_FILE: {
	    int begin = commit->param.new_file.first_cluster;
A
Anthony Liguori 已提交
2489 2490
	    mapping_t* mapping = find_mapping_for_cluster(s, begin);
	    direntry_t* entry;
2491
	    int i;
2492

2493 2494 2495 2496 2497
	    /* find direntry */
	    for (i = 0; i < s->directory.next; i++) {
		entry = array_get(&(s->directory), i);
		if (is_file(entry) && begin_of_direntry(entry) == begin)
		    break;
2498 2499
	    }

2500 2501 2502 2503
	    if (i >= s->directory.next) {
		fail = -6;
		continue;
	    }
2504

2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525
	    /* make sure there exists an initial mapping */
	    if (mapping && mapping->begin != begin) {
		mapping->end = begin;
		mapping = NULL;
	    }
	    if (mapping == NULL) {
		mapping = insert_mapping(s, begin, begin+1);
	    }
	    /* most members will be fixed in commit_mappings() */
	    assert(commit->path);
	    mapping->path = commit->path;
	    mapping->read_only = 0;
	    mapping->mode = MODE_NORMAL;
	    mapping->info.file.offset = 0;

	    if (commit_one_file(s, i, 0))
		fail = -7;

	    break;
	}
	default:
2526
            abort();
2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544
	}
    }
    if (i > 0 && array_remove_slice(&(s->commits), 0, i))
	return -1;
    return fail;
}

static int handle_deletes(BDRVVVFATState* s)
{
    int i, deferred = 1, deleted = 1;

    /* delete files corresponding to mappings marked as deleted */
    /* handle DELETEs and unused mappings (modified_fat_get(s, mapping->begin) == 0) */
    while (deferred && deleted) {
	deferred = 0;
	deleted = 0;

	for (i = 1; i < s->mapping.next; i++) {
A
Anthony Liguori 已提交
2545
	    mapping_t* mapping = array_get(&(s->mapping), i);
2546
	    if (mapping->mode & MODE_DELETED) {
A
Anthony Liguori 已提交
2547
		direntry_t* entry = array_get(&(s->directory),
2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561
			mapping->dir_index);

		if (is_free(entry)) {
		    /* remove file/directory */
		    if (mapping->mode & MODE_DIRECTORY) {
			int j, next_dir_index = s->directory.next,
			first_dir_index = mapping->info.dir.first_dir_index;

			if (rmdir(mapping->path) < 0) {
			    if (errno == ENOTEMPTY) {
				deferred++;
				continue;
			    } else
				return -5;
2562
			}
2563 2564

			for (j = 1; j < s->mapping.next; j++) {
A
Anthony Liguori 已提交
2565
			    mapping_t* m = array_get(&(s->mapping), j);
2566 2567 2568 2569 2570 2571 2572
			    if (m->mode & MODE_DIRECTORY &&
				    m->info.dir.first_dir_index >
				    first_dir_index &&
				    m->info.dir.first_dir_index <
				    next_dir_index)
				next_dir_index =
				    m->info.dir.first_dir_index;
2573
			}
2574 2575
			remove_direntries(s, first_dir_index,
				next_dir_index - first_dir_index);
2576

2577
			deleted++;
2578
		    }
2579 2580 2581 2582
		} else {
		    if (unlink(mapping->path))
			return -4;
		    deleted++;
2583
		}
2584 2585
		DLOG(fprintf(stderr, "DELETE (%d)\n", i); print_mapping(mapping); print_direntry(entry));
		remove_mapping(s, i);
2586 2587 2588
	    }
	}
    }
2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613

    return 0;
}

/*
 * synchronize mapping with new state:
 *
 * - copy FAT (with bdrv_read)
 * - mark all filenames corresponding to mappings as deleted
 * - recurse direntries from root (using bs->bdrv_read)
 * - delete files corresponding to mappings marked as deleted
 */
static int do_commit(BDRVVVFATState* s)
{
    int ret = 0;

    /* the real meat are the commits. Nothing to do? Move along! */
    if (s->commits.next == 0)
	return 0;

    vvfat_close_current_file(s);

    ret = handle_renames_and_mkdirs(s);
    if (ret) {
	fprintf(stderr, "Error handling renames (%d)\n", ret);
2614
        abort();
2615 2616 2617
	return ret;
    }

2618
    /* copy FAT (with bdrv_read) */
2619 2620 2621 2622 2623 2624
    memcpy(s->fat.pointer, s->fat2, 0x200 * s->sectors_per_fat);

    /* recurse direntries from root (using bs->bdrv_read) */
    ret = commit_direntries(s, 0, -1);
    if (ret) {
	fprintf(stderr, "Fatal: error while committing (%d)\n", ret);
2625
        abort();
2626 2627 2628 2629 2630 2631
	return ret;
    }

    ret = handle_commits(s);
    if (ret) {
	fprintf(stderr, "Error handling commits (%d)\n", ret);
2632
        abort();
2633 2634 2635 2636 2637 2638
	return ret;
    }

    ret = handle_deletes(s);
    if (ret) {
	fprintf(stderr, "Error deleting\n");
2639
        abort();
2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659
	return ret;
    }

    s->qcow->drv->bdrv_make_empty(s->qcow);

    memset(s->used_clusters, 0, sector2cluster(s, s->sector_count));

DLOG(checkpoint());
    return 0;
}

static int try_commit(BDRVVVFATState* s)
{
    vvfat_close_current_file(s);
DLOG(checkpoint());
    if(!is_consistent(s))
	return -1;
    return do_commit(s);
}

2660
static int vvfat_write(BlockDriverState *bs, int64_t sector_num,
2661 2662
                    const uint8_t *buf, int nb_sectors)
{
2663
    BDRVVVFATState *s = bs->opaque;
2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680
    int i, ret;

DLOG(checkpoint());

    vvfat_close_current_file(s);

    /*
     * Some sanity checks:
     * - do not allow writing to the boot sector
     * - do not allow to write non-ASCII filenames
     */

    if (sector_num < s->first_sectors_number)
	return -1;

    for (i = sector2cluster(s, sector_num);
	    i <= sector2cluster(s, sector_num + nb_sectors - 1);) {
A
Anthony Liguori 已提交
2681
	mapping_t* mapping = find_mapping_for_cluster(s, i);
2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692
	if (mapping) {
	    if (mapping->read_only) {
		fprintf(stderr, "Tried to write to write-protected file %s\n",
			mapping->path);
		return -1;
	    }

	    if (mapping->mode & MODE_DIRECTORY) {
		int begin = cluster2sector(s, i);
		int end = begin + s->sectors_per_cluster, k;
		int dir_index;
A
Anthony Liguori 已提交
2693
		const direntry_t* direntries;
2694 2695 2696 2697 2698 2699 2700 2701
		long_file_name lfn;

		lfn_init(&lfn);

		if (begin < sector_num)
		    begin = sector_num;
		if (end > sector_num + nb_sectors)
		    end = sector_num + nb_sectors;
2702
		dir_index  = mapping->dir_index +
2703
		    0x10 * (begin - mapping->begin * s->sectors_per_cluster);
A
Anthony Liguori 已提交
2704
		direntries = (direntry_t*)(buf + 0x200 * (begin - sector_num));
2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716

		for (k = 0; k < (end - begin) * 0x10; k++) {
		    /* do not allow non-ASCII filenames */
		    if (parse_long_name(&lfn, direntries + k) < 0) {
			fprintf(stderr, "Warning: non-ASCII filename\n");
			return -1;
		    }
		    /* no access to the direntry of a read-only file */
		    else if (is_short_name(direntries+k) &&
			    (direntries[k].attributes & 1)) {
			if (memcmp(direntries + k,
				    array_get(&(s->directory), dir_index + k),
A
Anthony Liguori 已提交
2717
				    sizeof(direntry_t))) {
2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760
			    fprintf(stderr, "Warning: tried to write to write-protected file\n");
			    return -1;
			}
		    }
		}
	    }
	    i = mapping->end;
	} else
	    i++;
    }

    /*
     * Use qcow backend. Commit later.
     */
DLOG(fprintf(stderr, "Write to qcow backend: %d + %d\n", (int)sector_num, nb_sectors));
    ret = s->qcow->drv->bdrv_write(s->qcow, sector_num, buf, nb_sectors);
    if (ret < 0) {
	fprintf(stderr, "Error writing to qcow backend\n");
	return ret;
    }

    for (i = sector2cluster(s, sector_num);
	    i <= sector2cluster(s, sector_num + nb_sectors - 1); i++)
	if (i >= 0)
	    s->used_clusters[i] |= USED_ALLOCATED;

DLOG(checkpoint());
    /* TODO: add timeout */
    try_commit(s);

DLOG(checkpoint());
    return 0;
}

static int vvfat_is_allocated(BlockDriverState *bs,
	int64_t sector_num, int nb_sectors, int* n)
{
    BDRVVVFATState* s = bs->opaque;
    *n = s->sector_count - sector_num;
    if (*n > nb_sectors)
	*n = nb_sectors;
    else if (*n < 0)
	return 0;
2761
    return 1;
2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776
}

static int write_target_commit(BlockDriverState *bs, int64_t sector_num,
	const uint8_t* buffer, int nb_sectors) {
    BDRVVVFATState* s = bs->opaque;
    return try_commit(s);
}

static void write_target_close(BlockDriverState *bs) {
    BDRVVVFATState* s = bs->opaque;
    bdrv_delete(s->qcow);
    free(s->qcow_filename);
}

static BlockDriver vvfat_write_target = {
2777 2778 2779
    .format_name        = "vvfat_write_target",
    .bdrv_write         = write_target_commit,
    .bdrv_close         = write_target_close,
2780 2781 2782 2783
};

static int enable_write_target(BDRVVVFATState *s)
{
K
Kevin Wolf 已提交
2784 2785
    BlockDriver *bdrv_qcow;
    QEMUOptionParameter *options;
2786 2787 2788
    int size = sector2cluster(s, s->sector_count);
    s->used_clusters = calloc(size, 1);

A
Anthony Liguori 已提交
2789
    array_init(&(s->commits), sizeof(commit_t));
2790

2791
    s->qcow_filename = qemu_malloc(1024);
B
bellard 已提交
2792
    get_tmp_filename(s->qcow_filename, 1024);
K
Kevin Wolf 已提交
2793 2794 2795 2796 2797 2798 2799

    bdrv_qcow = bdrv_find_format("qcow");
    options = parse_option_parameters("", bdrv_qcow->create_options, NULL);
    set_option_parameter_int(options, BLOCK_OPT_SIZE, s->sector_count * 512);
    set_option_parameter(options, BLOCK_OPT_BACKING_FILE, "fat:");

    if (bdrv_create(bdrv_qcow, s->qcow_filename, options) < 0)
2800 2801
	return -1;
    s->qcow = bdrv_new("");
K
Kevin Wolf 已提交
2802 2803 2804
    if (s->qcow == NULL ||
        bdrv_open(s->qcow, s->qcow_filename, BDRV_O_RDWR, bdrv_qcow) < 0)
    {
2805
	return -1;
K
Kevin Wolf 已提交
2806
    }
2807 2808 2809 2810 2811 2812 2813 2814 2815

#ifndef _WIN32
    unlink(s->qcow_filename);
#endif

    s->bs->backing_hd = calloc(sizeof(BlockDriverState), 1);
    s->bs->backing_hd->drv = &vvfat_write_target;
    s->bs->backing_hd->opaque = s;

2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826
    return 0;
}

static void vvfat_close(BlockDriverState *bs)
{
    BDRVVVFATState *s = bs->opaque;

    vvfat_close_current_file(s);
    array_free(&(s->fat));
    array_free(&(s->directory));
    array_free(&(s->mapping));
2827 2828
    if(s->cluster_buffer)
        free(s->cluster_buffer);
2829 2830
}

2831
static BlockDriver bdrv_vvfat = {
2832 2833
    .format_name	= "vvfat",
    .instance_size	= sizeof(BDRVVVFATState),
2834
    .bdrv_file_open	= vvfat_open,
2835 2836 2837 2838 2839
    .bdrv_read		= vvfat_read,
    .bdrv_write		= vvfat_write,
    .bdrv_close		= vvfat_close,
    .bdrv_is_allocated	= vvfat_is_allocated,
    .protocol_name	= "fat",
2840 2841
};

2842 2843 2844 2845 2846 2847 2848
static void bdrv_vvfat_init(void)
{
    bdrv_register(&bdrv_vvfat);
}

block_init(bdrv_vvfat_init);

2849
#ifdef DEBUG
2850
static void checkpoint(void) {
A
Anthony Liguori 已提交
2851
    assert(((mapping_t*)array_get(&(vvv->mapping), 0))->end == 2);
2852 2853 2854 2855
    check1(vvv);
    check2(vvv);
    assert(!vvv->current_mapping || vvv->current_fd || (vvv->current_mapping->mode & MODE_DIRECTORY));
#if 0
A
Anthony Liguori 已提交
2856
    if (((direntry_t*)vvv->directory.pointer)[1].attributes != 0xf)
2857
	fprintf(stderr, "Nonono!\n");
A
Anthony Liguori 已提交
2858 2859
    mapping_t* mapping;
    direntry_t* direntry;
2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871
    assert(vvv->mapping.size >= vvv->mapping.item_size * vvv->mapping.next);
    assert(vvv->directory.size >= vvv->directory.item_size * vvv->directory.next);
    if (vvv->mapping.next<47)
	return;
    assert((mapping = array_get(&(vvv->mapping), 47)));
    assert(mapping->dir_index < vvv->directory.next);
    direntry = array_get(&(vvv->directory), mapping->dir_index);
    assert(!memcmp(direntry->name, "USB     H  ", 11) || direntry->name[0]==0);
#endif
    return;
    /* avoid compiler warnings: */
    hexdump(NULL, 100);
2872
    remove_mapping(vvv, 0);
2873 2874 2875 2876
    print_mapping(NULL);
    print_direntry(NULL);
}
#endif