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