1 /* 2 * linux/fs/fat/dir.c 3 * 4 * directory handling functions for fat-based filesystems 5 * 6 * Written 1992,1993 by Werner Almesberger 7 * 8 * Hidden files 1995 by Albert Cahalan <albert@ccs.neu.edu> <adc@coe.neu.edu> 9 * 10 * VFAT extensions by Gordon Chaffee <chaffee@plateau.cs.berkeley.edu> 11 * Merged with msdos fs by Henrik Storner <storner@osiris.ping.dk> 12 * Rewritten for constant inumbers. Plugged buffer overrun in readdir(). AV 13 * Short name translation 1999, 2001 by Wolfram Pienkoss <wp@bszh.de> 14 */ 15 16 #include <linux/module.h> 17 #include <linux/slab.h> 18 #include <linux/time.h> 19 #include <linux/buffer_head.h> 20 #include <linux/compat.h> 21 #include <linux/uaccess.h> 22 #include <linux/kernel.h> 23 #include "fat.h" 24 25 /* 26 * Maximum buffer size of short name. 27 * [(MSDOS_NAME + '.') * max one char + nul] 28 * For msdos style, ['.' (hidden) + MSDOS_NAME + '.' + nul] 29 */ 30 #define FAT_MAX_SHORT_SIZE ((MSDOS_NAME + 1) * NLS_MAX_CHARSET_SIZE + 1) 31 /* 32 * Maximum buffer size of unicode chars from slots. 33 * [(max longname slots * 13 (size in a slot) + nul) * sizeof(wchar_t)] 34 */ 35 #define FAT_MAX_UNI_CHARS ((MSDOS_SLOTS - 1) * 13 + 1) 36 #define FAT_MAX_UNI_SIZE (FAT_MAX_UNI_CHARS * sizeof(wchar_t)) 37 38 static inline unsigned char fat_tolower(unsigned char c) 39 { 40 return ((c >= 'A') && (c <= 'Z')) ? c+32 : c; 41 } 42 43 static inline loff_t fat_make_i_pos(struct super_block *sb, 44 struct buffer_head *bh, 45 struct msdos_dir_entry *de) 46 { 47 return ((loff_t)bh->b_blocknr << MSDOS_SB(sb)->dir_per_block_bits) 48 | (de - (struct msdos_dir_entry *)bh->b_data); 49 } 50 51 static inline void fat_dir_readahead(struct inode *dir, sector_t iblock, 52 sector_t phys) 53 { 54 struct super_block *sb = dir->i_sb; 55 struct msdos_sb_info *sbi = MSDOS_SB(sb); 56 struct buffer_head *bh; 57 int sec; 58 59 /* This is not a first sector of cluster, or sec_per_clus == 1 */ 60 if ((iblock & (sbi->sec_per_clus - 1)) || sbi->sec_per_clus == 1) 61 return; 62 /* root dir of FAT12/FAT16 */ 63 if ((sbi->fat_bits != 32) && (dir->i_ino == MSDOS_ROOT_INO)) 64 return; 65 66 bh = sb_find_get_block(sb, phys); 67 if (bh == NULL || !buffer_uptodate(bh)) { 68 for (sec = 0; sec < sbi->sec_per_clus; sec++) 69 sb_breadahead(sb, phys + sec); 70 } 71 brelse(bh); 72 } 73 74 /* Returns the inode number of the directory entry at offset pos. If bh is 75 non-NULL, it is brelse'd before. Pos is incremented. The buffer header is 76 returned in bh. 77 AV. Most often we do it item-by-item. Makes sense to optimize. 78 AV. OK, there we go: if both bh and de are non-NULL we assume that we just 79 AV. want the next entry (took one explicit de=NULL in vfat/namei.c). 80 AV. It's done in fat_get_entry() (inlined), here the slow case lives. 81 AV. Additionally, when we return -1 (i.e. reached the end of directory) 82 AV. we make bh NULL. 83 */ 84 static int fat__get_entry(struct inode *dir, loff_t *pos, 85 struct buffer_head **bh, struct msdos_dir_entry **de) 86 { 87 struct super_block *sb = dir->i_sb; 88 sector_t phys, iblock; 89 unsigned long mapped_blocks; 90 int err, offset; 91 92 next: 93 if (*bh) 94 brelse(*bh); 95 96 *bh = NULL; 97 iblock = *pos >> sb->s_blocksize_bits; 98 err = fat_bmap(dir, iblock, &phys, &mapped_blocks, 0); 99 if (err || !phys) 100 return -1; /* beyond EOF or error */ 101 102 fat_dir_readahead(dir, iblock, phys); 103 104 *bh = sb_bread(sb, phys); 105 if (*bh == NULL) { 106 fat_msg_ratelimit(sb, KERN_ERR, 107 "Directory bread(block %llu) failed", (llu)phys); 108 /* skip this block */ 109 *pos = (iblock + 1) << sb->s_blocksize_bits; 110 goto next; 111 } 112 113 offset = *pos & (sb->s_blocksize - 1); 114 *pos += sizeof(struct msdos_dir_entry); 115 *de = (struct msdos_dir_entry *)((*bh)->b_data + offset); 116 117 return 0; 118 } 119 120 static inline int fat_get_entry(struct inode *dir, loff_t *pos, 121 struct buffer_head **bh, 122 struct msdos_dir_entry **de) 123 { 124 /* Fast stuff first */ 125 if (*bh && *de && 126 (*de - (struct msdos_dir_entry *)(*bh)->b_data) < 127 MSDOS_SB(dir->i_sb)->dir_per_block - 1) { 128 *pos += sizeof(struct msdos_dir_entry); 129 (*de)++; 130 return 0; 131 } 132 return fat__get_entry(dir, pos, bh, de); 133 } 134 135 /* 136 * Convert Unicode 16 to UTF-8, translated Unicode, or ASCII. 137 * If uni_xlate is enabled and we can't get a 1:1 conversion, use a 138 * colon as an escape character since it is normally invalid on the vfat 139 * filesystem. The following four characters are the hexadecimal digits 140 * of Unicode value. This lets us do a full dump and restore of Unicode 141 * filenames. We could get into some trouble with long Unicode names, 142 * but ignore that right now. 143 * Ahem... Stack smashing in ring 0 isn't fun. Fixed. 144 */ 145 static int uni16_to_x8(struct super_block *sb, unsigned char *ascii, 146 const wchar_t *uni, int len, struct nls_table *nls) 147 { 148 int uni_xlate = MSDOS_SB(sb)->options.unicode_xlate; 149 const wchar_t *ip; 150 wchar_t ec; 151 unsigned char *op; 152 int charlen; 153 154 ip = uni; 155 op = ascii; 156 157 while (*ip && ((len - NLS_MAX_CHARSET_SIZE) > 0)) { 158 ec = *ip++; 159 charlen = nls->uni2char(ec, op, NLS_MAX_CHARSET_SIZE); 160 if (charlen > 0) { 161 op += charlen; 162 len -= charlen; 163 } else { 164 if (uni_xlate == 1) { 165 *op++ = ':'; 166 op = hex_byte_pack(op, ec >> 8); 167 op = hex_byte_pack(op, ec); 168 len -= 5; 169 } else { 170 *op++ = '?'; 171 len--; 172 } 173 } 174 } 175 176 if (unlikely(*ip)) { 177 fat_msg(sb, KERN_WARNING, 178 "filename was truncated while converting."); 179 } 180 181 *op = 0; 182 return op - ascii; 183 } 184 185 static inline int fat_uni_to_x8(struct super_block *sb, const wchar_t *uni, 186 unsigned char *buf, int size) 187 { 188 struct msdos_sb_info *sbi = MSDOS_SB(sb); 189 if (sbi->options.utf8) 190 return utf16s_to_utf8s(uni, FAT_MAX_UNI_CHARS, 191 UTF16_HOST_ENDIAN, buf, size); 192 else 193 return uni16_to_x8(sb, buf, uni, size, sbi->nls_io); 194 } 195 196 static inline int 197 fat_short2uni(struct nls_table *t, unsigned char *c, int clen, wchar_t *uni) 198 { 199 int charlen; 200 201 charlen = t->char2uni(c, clen, uni); 202 if (charlen < 0) { 203 *uni = 0x003f; /* a question mark */ 204 charlen = 1; 205 } 206 return charlen; 207 } 208 209 static inline int 210 fat_short2lower_uni(struct nls_table *t, unsigned char *c, 211 int clen, wchar_t *uni) 212 { 213 int charlen; 214 wchar_t wc; 215 216 charlen = t->char2uni(c, clen, &wc); 217 if (charlen < 0) { 218 *uni = 0x003f; /* a question mark */ 219 charlen = 1; 220 } else if (charlen <= 1) { 221 unsigned char nc = t->charset2lower[*c]; 222 223 if (!nc) 224 nc = *c; 225 226 charlen = t->char2uni(&nc, 1, uni); 227 if (charlen < 0) { 228 *uni = 0x003f; /* a question mark */ 229 charlen = 1; 230 } 231 } else 232 *uni = wc; 233 234 return charlen; 235 } 236 237 static inline int 238 fat_shortname2uni(struct nls_table *nls, unsigned char *buf, int buf_size, 239 wchar_t *uni_buf, unsigned short opt, int lower) 240 { 241 int len = 0; 242 243 if (opt & VFAT_SFN_DISPLAY_LOWER) 244 len = fat_short2lower_uni(nls, buf, buf_size, uni_buf); 245 else if (opt & VFAT_SFN_DISPLAY_WIN95) 246 len = fat_short2uni(nls, buf, buf_size, uni_buf); 247 else if (opt & VFAT_SFN_DISPLAY_WINNT) { 248 if (lower) 249 len = fat_short2lower_uni(nls, buf, buf_size, uni_buf); 250 else 251 len = fat_short2uni(nls, buf, buf_size, uni_buf); 252 } else 253 len = fat_short2uni(nls, buf, buf_size, uni_buf); 254 255 return len; 256 } 257 258 static inline int fat_name_match(struct msdos_sb_info *sbi, 259 const unsigned char *a, int a_len, 260 const unsigned char *b, int b_len) 261 { 262 if (a_len != b_len) 263 return 0; 264 265 if (sbi->options.name_check != 's') 266 return !nls_strnicmp(sbi->nls_io, a, b, a_len); 267 else 268 return !memcmp(a, b, a_len); 269 } 270 271 enum { PARSE_INVALID = 1, PARSE_NOT_LONGNAME, PARSE_EOF, }; 272 273 /** 274 * fat_parse_long - Parse extended directory entry. 275 * 276 * This function returns zero on success, negative value on error, or one of 277 * the following: 278 * 279 * %PARSE_INVALID - Directory entry is invalid. 280 * %PARSE_NOT_LONGNAME - Directory entry does not contain longname. 281 * %PARSE_EOF - Directory has no more entries. 282 */ 283 static int fat_parse_long(struct inode *dir, loff_t *pos, 284 struct buffer_head **bh, struct msdos_dir_entry **de, 285 wchar_t **unicode, unsigned char *nr_slots) 286 { 287 struct msdos_dir_slot *ds; 288 unsigned char id, slot, slots, alias_checksum; 289 290 if (!*unicode) { 291 *unicode = __getname(); 292 if (!*unicode) { 293 brelse(*bh); 294 return -ENOMEM; 295 } 296 } 297 parse_long: 298 slots = 0; 299 ds = (struct msdos_dir_slot *)*de; 300 id = ds->id; 301 if (!(id & 0x40)) 302 return PARSE_INVALID; 303 slots = id & ~0x40; 304 if (slots > 20 || !slots) /* ceil(256 * 2 / 26) */ 305 return PARSE_INVALID; 306 *nr_slots = slots; 307 alias_checksum = ds->alias_checksum; 308 309 slot = slots; 310 while (1) { 311 int offset; 312 313 slot--; 314 offset = slot * 13; 315 fat16_towchar(*unicode + offset, ds->name0_4, 5); 316 fat16_towchar(*unicode + offset + 5, ds->name5_10, 6); 317 fat16_towchar(*unicode + offset + 11, ds->name11_12, 2); 318 319 if (ds->id & 0x40) 320 (*unicode)[offset + 13] = 0; 321 if (fat_get_entry(dir, pos, bh, de) < 0) 322 return PARSE_EOF; 323 if (slot == 0) 324 break; 325 ds = (struct msdos_dir_slot *)*de; 326 if (ds->attr != ATTR_EXT) 327 return PARSE_NOT_LONGNAME; 328 if ((ds->id & ~0x40) != slot) 329 goto parse_long; 330 if (ds->alias_checksum != alias_checksum) 331 goto parse_long; 332 } 333 if ((*de)->name[0] == DELETED_FLAG) 334 return PARSE_INVALID; 335 if ((*de)->attr == ATTR_EXT) 336 goto parse_long; 337 if (IS_FREE((*de)->name) || ((*de)->attr & ATTR_VOLUME)) 338 return PARSE_INVALID; 339 if (fat_checksum((*de)->name) != alias_checksum) 340 *nr_slots = 0; 341 342 return 0; 343 } 344 345 /** 346 * fat_parse_short - Parse MS-DOS (short) directory entry. 347 * @sb: superblock 348 * @de: directory entry to parse 349 * @name: FAT_MAX_SHORT_SIZE array in which to place extracted name 350 * @dot_hidden: Nonzero == prepend '.' to names with ATTR_HIDDEN 351 * 352 * Returns the number of characters extracted into 'name'. 353 */ 354 static int fat_parse_short(struct super_block *sb, 355 const struct msdos_dir_entry *de, 356 unsigned char *name, int dot_hidden) 357 { 358 const struct msdos_sb_info *sbi = MSDOS_SB(sb); 359 int isvfat = sbi->options.isvfat; 360 int nocase = sbi->options.nocase; 361 unsigned short opt_shortname = sbi->options.shortname; 362 struct nls_table *nls_disk = sbi->nls_disk; 363 wchar_t uni_name[14]; 364 unsigned char c, work[MSDOS_NAME]; 365 unsigned char *ptname = name; 366 int chi, chl, i, j, k; 367 int dotoffset = 0; 368 int name_len = 0, uni_len = 0; 369 370 if (!isvfat && dot_hidden && (de->attr & ATTR_HIDDEN)) { 371 *ptname++ = '.'; 372 dotoffset = 1; 373 } 374 375 memcpy(work, de->name, sizeof(work)); 376 /* see namei.c, msdos_format_name */ 377 if (work[0] == 0x05) 378 work[0] = 0xE5; 379 380 /* Filename */ 381 for (i = 0, j = 0; i < 8;) { 382 c = work[i]; 383 if (!c) 384 break; 385 chl = fat_shortname2uni(nls_disk, &work[i], 8 - i, 386 &uni_name[j++], opt_shortname, 387 de->lcase & CASE_LOWER_BASE); 388 if (chl <= 1) { 389 if (!isvfat) 390 ptname[i] = nocase ? c : fat_tolower(c); 391 i++; 392 if (c != ' ') { 393 name_len = i; 394 uni_len = j; 395 } 396 } else { 397 uni_len = j; 398 if (isvfat) 399 i += min(chl, 8-i); 400 else { 401 for (chi = 0; chi < chl && i < 8; chi++, i++) 402 ptname[i] = work[i]; 403 } 404 if (chl) 405 name_len = i; 406 } 407 } 408 409 i = name_len; 410 j = uni_len; 411 fat_short2uni(nls_disk, ".", 1, &uni_name[j++]); 412 if (!isvfat) 413 ptname[i] = '.'; 414 i++; 415 416 /* Extension */ 417 for (k = 8; k < MSDOS_NAME;) { 418 c = work[k]; 419 if (!c) 420 break; 421 chl = fat_shortname2uni(nls_disk, &work[k], MSDOS_NAME - k, 422 &uni_name[j++], opt_shortname, 423 de->lcase & CASE_LOWER_EXT); 424 if (chl <= 1) { 425 k++; 426 if (!isvfat) 427 ptname[i] = nocase ? c : fat_tolower(c); 428 i++; 429 if (c != ' ') { 430 name_len = i; 431 uni_len = j; 432 } 433 } else { 434 uni_len = j; 435 if (isvfat) { 436 int offset = min(chl, MSDOS_NAME-k); 437 k += offset; 438 i += offset; 439 } else { 440 for (chi = 0; chi < chl && k < MSDOS_NAME; 441 chi++, i++, k++) { 442 ptname[i] = work[k]; 443 } 444 } 445 if (chl) 446 name_len = i; 447 } 448 } 449 450 if (name_len > 0) { 451 name_len += dotoffset; 452 453 if (sbi->options.isvfat) { 454 uni_name[uni_len] = 0x0000; 455 name_len = fat_uni_to_x8(sb, uni_name, name, 456 FAT_MAX_SHORT_SIZE); 457 } 458 } 459 460 return name_len; 461 } 462 463 /* 464 * Return values: negative -> error/not found, 0 -> found. 465 */ 466 int fat_search_long(struct inode *inode, const unsigned char *name, 467 int name_len, struct fat_slot_info *sinfo) 468 { 469 struct super_block *sb = inode->i_sb; 470 struct msdos_sb_info *sbi = MSDOS_SB(sb); 471 struct buffer_head *bh = NULL; 472 struct msdos_dir_entry *de; 473 unsigned char nr_slots; 474 wchar_t *unicode = NULL; 475 unsigned char bufname[FAT_MAX_SHORT_SIZE]; 476 loff_t cpos = 0; 477 int err, len; 478 479 err = -ENOENT; 480 while (1) { 481 if (fat_get_entry(inode, &cpos, &bh, &de) == -1) 482 goto end_of_dir; 483 parse_record: 484 nr_slots = 0; 485 if (de->name[0] == DELETED_FLAG) 486 continue; 487 if (de->attr != ATTR_EXT && (de->attr & ATTR_VOLUME)) 488 continue; 489 if (de->attr != ATTR_EXT && IS_FREE(de->name)) 490 continue; 491 if (de->attr == ATTR_EXT) { 492 int status = fat_parse_long(inode, &cpos, &bh, &de, 493 &unicode, &nr_slots); 494 if (status < 0) { 495 err = status; 496 goto end_of_dir; 497 } else if (status == PARSE_INVALID) 498 continue; 499 else if (status == PARSE_NOT_LONGNAME) 500 goto parse_record; 501 else if (status == PARSE_EOF) 502 goto end_of_dir; 503 } 504 505 /* Never prepend '.' to hidden files here. 506 * That is done only for msdos mounts (and only when 507 * 'dotsOK=yes'); if we are executing here, it is in the 508 * context of a vfat mount. 509 */ 510 len = fat_parse_short(sb, de, bufname, 0); 511 if (len == 0) 512 continue; 513 514 /* Compare shortname */ 515 if (fat_name_match(sbi, name, name_len, bufname, len)) 516 goto found; 517 518 if (nr_slots) { 519 void *longname = unicode + FAT_MAX_UNI_CHARS; 520 int size = PATH_MAX - FAT_MAX_UNI_SIZE; 521 522 /* Compare longname */ 523 len = fat_uni_to_x8(sb, unicode, longname, size); 524 if (fat_name_match(sbi, name, name_len, longname, len)) 525 goto found; 526 } 527 } 528 529 found: 530 nr_slots++; /* include the de */ 531 sinfo->slot_off = cpos - nr_slots * sizeof(*de); 532 sinfo->nr_slots = nr_slots; 533 sinfo->de = de; 534 sinfo->bh = bh; 535 sinfo->i_pos = fat_make_i_pos(sb, sinfo->bh, sinfo->de); 536 err = 0; 537 end_of_dir: 538 if (unicode) 539 __putname(unicode); 540 541 return err; 542 } 543 EXPORT_SYMBOL_GPL(fat_search_long); 544 545 struct fat_ioctl_filldir_callback { 546 void __user *dirent; 547 int result; 548 /* for dir ioctl */ 549 const char *longname; 550 int long_len; 551 const char *shortname; 552 int short_len; 553 }; 554 555 static int __fat_readdir(struct inode *inode, struct file *filp, void *dirent, 556 filldir_t filldir, int short_only, int both) 557 { 558 struct super_block *sb = inode->i_sb; 559 struct msdos_sb_info *sbi = MSDOS_SB(sb); 560 struct buffer_head *bh; 561 struct msdos_dir_entry *de; 562 unsigned char nr_slots; 563 wchar_t *unicode = NULL; 564 unsigned char bufname[FAT_MAX_SHORT_SIZE]; 565 int isvfat = sbi->options.isvfat; 566 const char *fill_name = NULL; 567 unsigned long inum; 568 unsigned long lpos, dummy, *furrfu = &lpos; 569 loff_t cpos; 570 int short_len = 0, fill_len = 0; 571 int ret = 0; 572 573 mutex_lock(&sbi->s_lock); 574 575 cpos = filp->f_pos; 576 /* Fake . and .. for the root directory. */ 577 if (inode->i_ino == MSDOS_ROOT_INO) { 578 while (cpos < 2) { 579 if (filldir(dirent, "..", cpos+1, cpos, 580 MSDOS_ROOT_INO, DT_DIR) < 0) 581 goto out; 582 cpos++; 583 filp->f_pos++; 584 } 585 if (cpos == 2) { 586 dummy = 2; 587 furrfu = &dummy; 588 cpos = 0; 589 } 590 } 591 if (cpos & (sizeof(struct msdos_dir_entry) - 1)) { 592 ret = -ENOENT; 593 goto out; 594 } 595 596 bh = NULL; 597 get_new: 598 if (fat_get_entry(inode, &cpos, &bh, &de) == -1) 599 goto end_of_dir; 600 parse_record: 601 nr_slots = 0; 602 /* 603 * Check for long filename entry, but if short_only, we don't 604 * need to parse long filename. 605 */ 606 if (isvfat && !short_only) { 607 if (de->name[0] == DELETED_FLAG) 608 goto record_end; 609 if (de->attr != ATTR_EXT && (de->attr & ATTR_VOLUME)) 610 goto record_end; 611 if (de->attr != ATTR_EXT && IS_FREE(de->name)) 612 goto record_end; 613 } else { 614 if ((de->attr & ATTR_VOLUME) || IS_FREE(de->name)) 615 goto record_end; 616 } 617 618 if (isvfat && de->attr == ATTR_EXT) { 619 int status = fat_parse_long(inode, &cpos, &bh, &de, 620 &unicode, &nr_slots); 621 if (status < 0) { 622 filp->f_pos = cpos; 623 ret = status; 624 goto out; 625 } else if (status == PARSE_INVALID) 626 goto record_end; 627 else if (status == PARSE_NOT_LONGNAME) 628 goto parse_record; 629 else if (status == PARSE_EOF) 630 goto end_of_dir; 631 632 if (nr_slots) { 633 void *longname = unicode + FAT_MAX_UNI_CHARS; 634 int size = PATH_MAX - FAT_MAX_UNI_SIZE; 635 int len = fat_uni_to_x8(sb, unicode, longname, size); 636 637 fill_name = longname; 638 fill_len = len; 639 /* !both && !short_only, so we don't need shortname. */ 640 if (!both) 641 goto start_filldir; 642 } 643 } 644 645 short_len = fat_parse_short(sb, de, bufname, sbi->options.dotsOK); 646 if (short_len == 0) 647 goto record_end; 648 649 if (nr_slots) { 650 /* hack for fat_ioctl_filldir() */ 651 struct fat_ioctl_filldir_callback *p = dirent; 652 653 p->longname = fill_name; 654 p->long_len = fill_len; 655 p->shortname = bufname; 656 p->short_len = short_len; 657 fill_name = NULL; 658 fill_len = 0; 659 } else { 660 fill_name = bufname; 661 fill_len = short_len; 662 } 663 664 start_filldir: 665 lpos = cpos - (nr_slots + 1) * sizeof(struct msdos_dir_entry); 666 if (!memcmp(de->name, MSDOS_DOT, MSDOS_NAME)) 667 inum = inode->i_ino; 668 else if (!memcmp(de->name, MSDOS_DOTDOT, MSDOS_NAME)) { 669 inum = parent_ino(filp->f_path.dentry); 670 } else { 671 loff_t i_pos = fat_make_i_pos(sb, bh, de); 672 struct inode *tmp = fat_iget(sb, i_pos); 673 if (tmp) { 674 inum = tmp->i_ino; 675 iput(tmp); 676 } else 677 inum = iunique(sb, MSDOS_ROOT_INO); 678 } 679 680 if (filldir(dirent, fill_name, fill_len, *furrfu, inum, 681 (de->attr & ATTR_DIR) ? DT_DIR : DT_REG) < 0) 682 goto fill_failed; 683 684 record_end: 685 furrfu = &lpos; 686 filp->f_pos = cpos; 687 goto get_new; 688 end_of_dir: 689 filp->f_pos = cpos; 690 fill_failed: 691 brelse(bh); 692 if (unicode) 693 __putname(unicode); 694 out: 695 mutex_unlock(&sbi->s_lock); 696 return ret; 697 } 698 699 static int fat_readdir(struct file *filp, void *dirent, filldir_t filldir) 700 { 701 struct inode *inode = filp->f_path.dentry->d_inode; 702 return __fat_readdir(inode, filp, dirent, filldir, 0, 0); 703 } 704 705 #define FAT_IOCTL_FILLDIR_FUNC(func, dirent_type) \ 706 static int func(void *__buf, const char *name, int name_len, \ 707 loff_t offset, u64 ino, unsigned int d_type) \ 708 { \ 709 struct fat_ioctl_filldir_callback *buf = __buf; \ 710 struct dirent_type __user *d1 = buf->dirent; \ 711 struct dirent_type __user *d2 = d1 + 1; \ 712 \ 713 if (buf->result) \ 714 return -EINVAL; \ 715 buf->result++; \ 716 \ 717 if (name != NULL) { \ 718 /* dirent has only short name */ \ 719 if (name_len >= sizeof(d1->d_name)) \ 720 name_len = sizeof(d1->d_name) - 1; \ 721 \ 722 if (put_user(0, d2->d_name) || \ 723 put_user(0, &d2->d_reclen) || \ 724 copy_to_user(d1->d_name, name, name_len) || \ 725 put_user(0, d1->d_name + name_len) || \ 726 put_user(name_len, &d1->d_reclen)) \ 727 goto efault; \ 728 } else { \ 729 /* dirent has short and long name */ \ 730 const char *longname = buf->longname; \ 731 int long_len = buf->long_len; \ 732 const char *shortname = buf->shortname; \ 733 int short_len = buf->short_len; \ 734 \ 735 if (long_len >= sizeof(d1->d_name)) \ 736 long_len = sizeof(d1->d_name) - 1; \ 737 if (short_len >= sizeof(d1->d_name)) \ 738 short_len = sizeof(d1->d_name) - 1; \ 739 \ 740 if (copy_to_user(d2->d_name, longname, long_len) || \ 741 put_user(0, d2->d_name + long_len) || \ 742 put_user(long_len, &d2->d_reclen) || \ 743 put_user(ino, &d2->d_ino) || \ 744 put_user(offset, &d2->d_off) || \ 745 copy_to_user(d1->d_name, shortname, short_len) || \ 746 put_user(0, d1->d_name + short_len) || \ 747 put_user(short_len, &d1->d_reclen)) \ 748 goto efault; \ 749 } \ 750 return 0; \ 751 efault: \ 752 buf->result = -EFAULT; \ 753 return -EFAULT; \ 754 } 755 756 FAT_IOCTL_FILLDIR_FUNC(fat_ioctl_filldir, __fat_dirent) 757 758 static int fat_ioctl_readdir(struct inode *inode, struct file *filp, 759 void __user *dirent, filldir_t filldir, 760 int short_only, int both) 761 { 762 struct fat_ioctl_filldir_callback buf; 763 int ret; 764 765 buf.dirent = dirent; 766 buf.result = 0; 767 mutex_lock(&inode->i_mutex); 768 ret = -ENOENT; 769 if (!IS_DEADDIR(inode)) { 770 ret = __fat_readdir(inode, filp, &buf, filldir, 771 short_only, both); 772 } 773 mutex_unlock(&inode->i_mutex); 774 if (ret >= 0) 775 ret = buf.result; 776 return ret; 777 } 778 779 static long fat_dir_ioctl(struct file *filp, unsigned int cmd, 780 unsigned long arg) 781 { 782 struct inode *inode = filp->f_path.dentry->d_inode; 783 struct __fat_dirent __user *d1 = (struct __fat_dirent __user *)arg; 784 int short_only, both; 785 786 switch (cmd) { 787 case VFAT_IOCTL_READDIR_SHORT: 788 short_only = 1; 789 both = 0; 790 break; 791 case VFAT_IOCTL_READDIR_BOTH: 792 short_only = 0; 793 both = 1; 794 break; 795 default: 796 return fat_generic_ioctl(filp, cmd, arg); 797 } 798 799 if (!access_ok(VERIFY_WRITE, d1, sizeof(struct __fat_dirent[2]))) 800 return -EFAULT; 801 /* 802 * Yes, we don't need this put_user() absolutely. However old 803 * code didn't return the right value. So, app use this value, 804 * in order to check whether it is EOF. 805 */ 806 if (put_user(0, &d1->d_reclen)) 807 return -EFAULT; 808 809 return fat_ioctl_readdir(inode, filp, d1, fat_ioctl_filldir, 810 short_only, both); 811 } 812 813 #ifdef CONFIG_COMPAT 814 #define VFAT_IOCTL_READDIR_BOTH32 _IOR('r', 1, struct compat_dirent[2]) 815 #define VFAT_IOCTL_READDIR_SHORT32 _IOR('r', 2, struct compat_dirent[2]) 816 817 FAT_IOCTL_FILLDIR_FUNC(fat_compat_ioctl_filldir, compat_dirent) 818 819 static long fat_compat_dir_ioctl(struct file *filp, unsigned cmd, 820 unsigned long arg) 821 { 822 struct inode *inode = filp->f_path.dentry->d_inode; 823 struct compat_dirent __user *d1 = compat_ptr(arg); 824 int short_only, both; 825 826 switch (cmd) { 827 case VFAT_IOCTL_READDIR_SHORT32: 828 short_only = 1; 829 both = 0; 830 break; 831 case VFAT_IOCTL_READDIR_BOTH32: 832 short_only = 0; 833 both = 1; 834 break; 835 default: 836 return fat_generic_ioctl(filp, cmd, (unsigned long)arg); 837 } 838 839 if (!access_ok(VERIFY_WRITE, d1, sizeof(struct compat_dirent[2]))) 840 return -EFAULT; 841 /* 842 * Yes, we don't need this put_user() absolutely. However old 843 * code didn't return the right value. So, app use this value, 844 * in order to check whether it is EOF. 845 */ 846 if (put_user(0, &d1->d_reclen)) 847 return -EFAULT; 848 849 return fat_ioctl_readdir(inode, filp, d1, fat_compat_ioctl_filldir, 850 short_only, both); 851 } 852 #endif /* CONFIG_COMPAT */ 853 854 const struct file_operations fat_dir_operations = { 855 .llseek = generic_file_llseek, 856 .read = generic_read_dir, 857 .readdir = fat_readdir, 858 .unlocked_ioctl = fat_dir_ioctl, 859 #ifdef CONFIG_COMPAT 860 .compat_ioctl = fat_compat_dir_ioctl, 861 #endif 862 .fsync = fat_file_fsync, 863 }; 864 865 static int fat_get_short_entry(struct inode *dir, loff_t *pos, 866 struct buffer_head **bh, 867 struct msdos_dir_entry **de) 868 { 869 while (fat_get_entry(dir, pos, bh, de) >= 0) { 870 /* free entry or long name entry or volume label */ 871 if (!IS_FREE((*de)->name) && !((*de)->attr & ATTR_VOLUME)) 872 return 0; 873 } 874 return -ENOENT; 875 } 876 877 /* 878 * The ".." entry can not provide the "struct fat_slot_info" information 879 * for inode, nor a usable i_pos. So, this function provides some information 880 * only. 881 * 882 * Since this function walks through the on-disk inodes within a directory, 883 * callers are responsible for taking any locks necessary to prevent the 884 * directory from changing. 885 */ 886 int fat_get_dotdot_entry(struct inode *dir, struct buffer_head **bh, 887 struct msdos_dir_entry **de) 888 { 889 loff_t offset = 0; 890 891 *de = NULL; 892 while (fat_get_short_entry(dir, &offset, bh, de) >= 0) { 893 if (!strncmp((*de)->name, MSDOS_DOTDOT, MSDOS_NAME)) 894 return 0; 895 } 896 return -ENOENT; 897 } 898 EXPORT_SYMBOL_GPL(fat_get_dotdot_entry); 899 900 /* See if directory is empty */ 901 int fat_dir_empty(struct inode *dir) 902 { 903 struct buffer_head *bh; 904 struct msdos_dir_entry *de; 905 loff_t cpos; 906 int result = 0; 907 908 bh = NULL; 909 cpos = 0; 910 while (fat_get_short_entry(dir, &cpos, &bh, &de) >= 0) { 911 if (strncmp(de->name, MSDOS_DOT , MSDOS_NAME) && 912 strncmp(de->name, MSDOS_DOTDOT, MSDOS_NAME)) { 913 result = -ENOTEMPTY; 914 break; 915 } 916 } 917 brelse(bh); 918 return result; 919 } 920 EXPORT_SYMBOL_GPL(fat_dir_empty); 921 922 /* 923 * fat_subdirs counts the number of sub-directories of dir. It can be run 924 * on directories being created. 925 */ 926 int fat_subdirs(struct inode *dir) 927 { 928 struct buffer_head *bh; 929 struct msdos_dir_entry *de; 930 loff_t cpos; 931 int count = 0; 932 933 bh = NULL; 934 cpos = 0; 935 while (fat_get_short_entry(dir, &cpos, &bh, &de) >= 0) { 936 if (de->attr & ATTR_DIR) 937 count++; 938 } 939 brelse(bh); 940 return count; 941 } 942 943 /* 944 * Scans a directory for a given file (name points to its formatted name). 945 * Returns an error code or zero. 946 */ 947 int fat_scan(struct inode *dir, const unsigned char *name, 948 struct fat_slot_info *sinfo) 949 { 950 struct super_block *sb = dir->i_sb; 951 952 sinfo->slot_off = 0; 953 sinfo->bh = NULL; 954 while (fat_get_short_entry(dir, &sinfo->slot_off, &sinfo->bh, 955 &sinfo->de) >= 0) { 956 if (!strncmp(sinfo->de->name, name, MSDOS_NAME)) { 957 sinfo->slot_off -= sizeof(*sinfo->de); 958 sinfo->nr_slots = 1; 959 sinfo->i_pos = fat_make_i_pos(sb, sinfo->bh, sinfo->de); 960 return 0; 961 } 962 } 963 return -ENOENT; 964 } 965 EXPORT_SYMBOL_GPL(fat_scan); 966 967 static int __fat_remove_entries(struct inode *dir, loff_t pos, int nr_slots) 968 { 969 struct super_block *sb = dir->i_sb; 970 struct buffer_head *bh; 971 struct msdos_dir_entry *de, *endp; 972 int err = 0, orig_slots; 973 974 while (nr_slots) { 975 bh = NULL; 976 if (fat_get_entry(dir, &pos, &bh, &de) < 0) { 977 err = -EIO; 978 break; 979 } 980 981 orig_slots = nr_slots; 982 endp = (struct msdos_dir_entry *)(bh->b_data + sb->s_blocksize); 983 while (nr_slots && de < endp) { 984 de->name[0] = DELETED_FLAG; 985 de++; 986 nr_slots--; 987 } 988 mark_buffer_dirty_inode(bh, dir); 989 if (IS_DIRSYNC(dir)) 990 err = sync_dirty_buffer(bh); 991 brelse(bh); 992 if (err) 993 break; 994 995 /* pos is *next* de's position, so this does `- sizeof(de)' */ 996 pos += ((orig_slots - nr_slots) * sizeof(*de)) - sizeof(*de); 997 } 998 999 return err; 1000 } 1001 1002 int fat_remove_entries(struct inode *dir, struct fat_slot_info *sinfo) 1003 { 1004 struct super_block *sb = dir->i_sb; 1005 struct msdos_dir_entry *de; 1006 struct buffer_head *bh; 1007 int err = 0, nr_slots; 1008 1009 /* 1010 * First stage: Remove the shortname. By this, the directory 1011 * entry is removed. 1012 */ 1013 nr_slots = sinfo->nr_slots; 1014 de = sinfo->de; 1015 sinfo->de = NULL; 1016 bh = sinfo->bh; 1017 sinfo->bh = NULL; 1018 while (nr_slots && de >= (struct msdos_dir_entry *)bh->b_data) { 1019 de->name[0] = DELETED_FLAG; 1020 de--; 1021 nr_slots--; 1022 } 1023 mark_buffer_dirty_inode(bh, dir); 1024 if (IS_DIRSYNC(dir)) 1025 err = sync_dirty_buffer(bh); 1026 brelse(bh); 1027 if (err) 1028 return err; 1029 dir->i_version++; 1030 1031 if (nr_slots) { 1032 /* 1033 * Second stage: remove the remaining longname slots. 1034 * (This directory entry is already removed, and so return 1035 * the success) 1036 */ 1037 err = __fat_remove_entries(dir, sinfo->slot_off, nr_slots); 1038 if (err) { 1039 fat_msg(sb, KERN_WARNING, 1040 "Couldn't remove the long name slots"); 1041 } 1042 } 1043 1044 dir->i_mtime = dir->i_atime = CURRENT_TIME_SEC; 1045 if (IS_DIRSYNC(dir)) 1046 (void)fat_sync_inode(dir); 1047 else 1048 mark_inode_dirty(dir); 1049 1050 return 0; 1051 } 1052 EXPORT_SYMBOL_GPL(fat_remove_entries); 1053 1054 static int fat_zeroed_cluster(struct inode *dir, sector_t blknr, int nr_used, 1055 struct buffer_head **bhs, int nr_bhs) 1056 { 1057 struct super_block *sb = dir->i_sb; 1058 sector_t last_blknr = blknr + MSDOS_SB(sb)->sec_per_clus; 1059 int err, i, n; 1060 1061 /* Zeroing the unused blocks on this cluster */ 1062 blknr += nr_used; 1063 n = nr_used; 1064 while (blknr < last_blknr) { 1065 bhs[n] = sb_getblk(sb, blknr); 1066 if (!bhs[n]) { 1067 err = -ENOMEM; 1068 goto error; 1069 } 1070 memset(bhs[n]->b_data, 0, sb->s_blocksize); 1071 set_buffer_uptodate(bhs[n]); 1072 mark_buffer_dirty_inode(bhs[n], dir); 1073 1074 n++; 1075 blknr++; 1076 if (n == nr_bhs) { 1077 if (IS_DIRSYNC(dir)) { 1078 err = fat_sync_bhs(bhs, n); 1079 if (err) 1080 goto error; 1081 } 1082 for (i = 0; i < n; i++) 1083 brelse(bhs[i]); 1084 n = 0; 1085 } 1086 } 1087 if (IS_DIRSYNC(dir)) { 1088 err = fat_sync_bhs(bhs, n); 1089 if (err) 1090 goto error; 1091 } 1092 for (i = 0; i < n; i++) 1093 brelse(bhs[i]); 1094 1095 return 0; 1096 1097 error: 1098 for (i = 0; i < n; i++) 1099 bforget(bhs[i]); 1100 return err; 1101 } 1102 1103 int fat_alloc_new_dir(struct inode *dir, struct timespec *ts) 1104 { 1105 struct super_block *sb = dir->i_sb; 1106 struct msdos_sb_info *sbi = MSDOS_SB(sb); 1107 struct buffer_head *bhs[MAX_BUF_PER_PAGE]; 1108 struct msdos_dir_entry *de; 1109 sector_t blknr; 1110 __le16 date, time; 1111 u8 time_cs; 1112 int err, cluster; 1113 1114 err = fat_alloc_clusters(dir, &cluster, 1); 1115 if (err) 1116 goto error; 1117 1118 blknr = fat_clus_to_blknr(sbi, cluster); 1119 bhs[0] = sb_getblk(sb, blknr); 1120 if (!bhs[0]) { 1121 err = -ENOMEM; 1122 goto error_free; 1123 } 1124 1125 fat_time_unix2fat(sbi, ts, &time, &date, &time_cs); 1126 1127 de = (struct msdos_dir_entry *)bhs[0]->b_data; 1128 /* filling the new directory slots ("." and ".." entries) */ 1129 memcpy(de[0].name, MSDOS_DOT, MSDOS_NAME); 1130 memcpy(de[1].name, MSDOS_DOTDOT, MSDOS_NAME); 1131 de->attr = de[1].attr = ATTR_DIR; 1132 de[0].lcase = de[1].lcase = 0; 1133 de[0].time = de[1].time = time; 1134 de[0].date = de[1].date = date; 1135 if (sbi->options.isvfat) { 1136 /* extra timestamps */ 1137 de[0].ctime = de[1].ctime = time; 1138 de[0].ctime_cs = de[1].ctime_cs = time_cs; 1139 de[0].adate = de[0].cdate = de[1].adate = de[1].cdate = date; 1140 } else { 1141 de[0].ctime = de[1].ctime = 0; 1142 de[0].ctime_cs = de[1].ctime_cs = 0; 1143 de[0].adate = de[0].cdate = de[1].adate = de[1].cdate = 0; 1144 } 1145 fat_set_start(&de[0], cluster); 1146 fat_set_start(&de[1], MSDOS_I(dir)->i_logstart); 1147 de[0].size = de[1].size = 0; 1148 memset(de + 2, 0, sb->s_blocksize - 2 * sizeof(*de)); 1149 set_buffer_uptodate(bhs[0]); 1150 mark_buffer_dirty_inode(bhs[0], dir); 1151 1152 err = fat_zeroed_cluster(dir, blknr, 1, bhs, MAX_BUF_PER_PAGE); 1153 if (err) 1154 goto error_free; 1155 1156 return cluster; 1157 1158 error_free: 1159 fat_free_clusters(dir, cluster); 1160 error: 1161 return err; 1162 } 1163 EXPORT_SYMBOL_GPL(fat_alloc_new_dir); 1164 1165 static int fat_add_new_entries(struct inode *dir, void *slots, int nr_slots, 1166 int *nr_cluster, struct msdos_dir_entry **de, 1167 struct buffer_head **bh, loff_t *i_pos) 1168 { 1169 struct super_block *sb = dir->i_sb; 1170 struct msdos_sb_info *sbi = MSDOS_SB(sb); 1171 struct buffer_head *bhs[MAX_BUF_PER_PAGE]; 1172 sector_t blknr, start_blknr, last_blknr; 1173 unsigned long size, copy; 1174 int err, i, n, offset, cluster[2]; 1175 1176 /* 1177 * The minimum cluster size is 512bytes, and maximum entry 1178 * size is 32*slots (672bytes). So, iff the cluster size is 1179 * 512bytes, we may need two clusters. 1180 */ 1181 size = nr_slots * sizeof(struct msdos_dir_entry); 1182 *nr_cluster = (size + (sbi->cluster_size - 1)) >> sbi->cluster_bits; 1183 BUG_ON(*nr_cluster > 2); 1184 1185 err = fat_alloc_clusters(dir, cluster, *nr_cluster); 1186 if (err) 1187 goto error; 1188 1189 /* 1190 * First stage: Fill the directory entry. NOTE: This cluster 1191 * is not referenced from any inode yet, so updates order is 1192 * not important. 1193 */ 1194 i = n = copy = 0; 1195 do { 1196 start_blknr = blknr = fat_clus_to_blknr(sbi, cluster[i]); 1197 last_blknr = start_blknr + sbi->sec_per_clus; 1198 while (blknr < last_blknr) { 1199 bhs[n] = sb_getblk(sb, blknr); 1200 if (!bhs[n]) { 1201 err = -ENOMEM; 1202 goto error_nomem; 1203 } 1204 1205 /* fill the directory entry */ 1206 copy = min(size, sb->s_blocksize); 1207 memcpy(bhs[n]->b_data, slots, copy); 1208 slots += copy; 1209 size -= copy; 1210 set_buffer_uptodate(bhs[n]); 1211 mark_buffer_dirty_inode(bhs[n], dir); 1212 if (!size) 1213 break; 1214 n++; 1215 blknr++; 1216 } 1217 } while (++i < *nr_cluster); 1218 1219 memset(bhs[n]->b_data + copy, 0, sb->s_blocksize - copy); 1220 offset = copy - sizeof(struct msdos_dir_entry); 1221 get_bh(bhs[n]); 1222 *bh = bhs[n]; 1223 *de = (struct msdos_dir_entry *)((*bh)->b_data + offset); 1224 *i_pos = fat_make_i_pos(sb, *bh, *de); 1225 1226 /* Second stage: clear the rest of cluster, and write outs */ 1227 err = fat_zeroed_cluster(dir, start_blknr, ++n, bhs, MAX_BUF_PER_PAGE); 1228 if (err) 1229 goto error_free; 1230 1231 return cluster[0]; 1232 1233 error_free: 1234 brelse(*bh); 1235 *bh = NULL; 1236 n = 0; 1237 error_nomem: 1238 for (i = 0; i < n; i++) 1239 bforget(bhs[i]); 1240 fat_free_clusters(dir, cluster[0]); 1241 error: 1242 return err; 1243 } 1244 1245 int fat_add_entries(struct inode *dir, void *slots, int nr_slots, 1246 struct fat_slot_info *sinfo) 1247 { 1248 struct super_block *sb = dir->i_sb; 1249 struct msdos_sb_info *sbi = MSDOS_SB(sb); 1250 struct buffer_head *bh, *prev, *bhs[3]; /* 32*slots (672bytes) */ 1251 struct msdos_dir_entry *uninitialized_var(de); 1252 int err, free_slots, i, nr_bhs; 1253 loff_t pos, i_pos; 1254 1255 sinfo->nr_slots = nr_slots; 1256 1257 /* First stage: search free directory entries */ 1258 free_slots = nr_bhs = 0; 1259 bh = prev = NULL; 1260 pos = 0; 1261 err = -ENOSPC; 1262 while (fat_get_entry(dir, &pos, &bh, &de) > -1) { 1263 /* check the maximum size of directory */ 1264 if (pos >= FAT_MAX_DIR_SIZE) 1265 goto error; 1266 1267 if (IS_FREE(de->name)) { 1268 if (prev != bh) { 1269 get_bh(bh); 1270 bhs[nr_bhs] = prev = bh; 1271 nr_bhs++; 1272 } 1273 free_slots++; 1274 if (free_slots == nr_slots) 1275 goto found; 1276 } else { 1277 for (i = 0; i < nr_bhs; i++) 1278 brelse(bhs[i]); 1279 prev = NULL; 1280 free_slots = nr_bhs = 0; 1281 } 1282 } 1283 if (dir->i_ino == MSDOS_ROOT_INO) { 1284 if (sbi->fat_bits != 32) 1285 goto error; 1286 } else if (MSDOS_I(dir)->i_start == 0) { 1287 fat_msg(sb, KERN_ERR, "Corrupted directory (i_pos %lld)", 1288 MSDOS_I(dir)->i_pos); 1289 err = -EIO; 1290 goto error; 1291 } 1292 1293 found: 1294 err = 0; 1295 pos -= free_slots * sizeof(*de); 1296 nr_slots -= free_slots; 1297 if (free_slots) { 1298 /* 1299 * Second stage: filling the free entries with new entries. 1300 * NOTE: If this slots has shortname, first, we write 1301 * the long name slots, then write the short name. 1302 */ 1303 int size = free_slots * sizeof(*de); 1304 int offset = pos & (sb->s_blocksize - 1); 1305 int long_bhs = nr_bhs - (nr_slots == 0); 1306 1307 /* Fill the long name slots. */ 1308 for (i = 0; i < long_bhs; i++) { 1309 int copy = min_t(int, sb->s_blocksize - offset, size); 1310 memcpy(bhs[i]->b_data + offset, slots, copy); 1311 mark_buffer_dirty_inode(bhs[i], dir); 1312 offset = 0; 1313 slots += copy; 1314 size -= copy; 1315 } 1316 if (long_bhs && IS_DIRSYNC(dir)) 1317 err = fat_sync_bhs(bhs, long_bhs); 1318 if (!err && i < nr_bhs) { 1319 /* Fill the short name slot. */ 1320 int copy = min_t(int, sb->s_blocksize - offset, size); 1321 memcpy(bhs[i]->b_data + offset, slots, copy); 1322 mark_buffer_dirty_inode(bhs[i], dir); 1323 if (IS_DIRSYNC(dir)) 1324 err = sync_dirty_buffer(bhs[i]); 1325 } 1326 for (i = 0; i < nr_bhs; i++) 1327 brelse(bhs[i]); 1328 if (err) 1329 goto error_remove; 1330 } 1331 1332 if (nr_slots) { 1333 int cluster, nr_cluster; 1334 1335 /* 1336 * Third stage: allocate the cluster for new entries. 1337 * And initialize the cluster with new entries, then 1338 * add the cluster to dir. 1339 */ 1340 cluster = fat_add_new_entries(dir, slots, nr_slots, &nr_cluster, 1341 &de, &bh, &i_pos); 1342 if (cluster < 0) { 1343 err = cluster; 1344 goto error_remove; 1345 } 1346 err = fat_chain_add(dir, cluster, nr_cluster); 1347 if (err) { 1348 fat_free_clusters(dir, cluster); 1349 goto error_remove; 1350 } 1351 if (dir->i_size & (sbi->cluster_size - 1)) { 1352 fat_fs_error(sb, "Odd directory size"); 1353 dir->i_size = (dir->i_size + sbi->cluster_size - 1) 1354 & ~((loff_t)sbi->cluster_size - 1); 1355 } 1356 dir->i_size += nr_cluster << sbi->cluster_bits; 1357 MSDOS_I(dir)->mmu_private += nr_cluster << sbi->cluster_bits; 1358 } 1359 sinfo->slot_off = pos; 1360 sinfo->de = de; 1361 sinfo->bh = bh; 1362 sinfo->i_pos = fat_make_i_pos(sb, sinfo->bh, sinfo->de); 1363 1364 return 0; 1365 1366 error: 1367 brelse(bh); 1368 for (i = 0; i < nr_bhs; i++) 1369 brelse(bhs[i]); 1370 return err; 1371 1372 error_remove: 1373 brelse(bh); 1374 if (free_slots) 1375 __fat_remove_entries(dir, pos, free_slots); 1376 return err; 1377 } 1378 EXPORT_SYMBOL_GPL(fat_add_entries); 1379