GUI: Fix Tomato RAF theme for all builds. Compilation typo.
[tomato.git] / release / src-rt-6.x.4708 / linux / linux-2.6.36 / fs / fat / fatent.c
blobf65cd928075ac2d6e11372f20e2cfa0a0e823f62
1 /*
2 * Copyright (C) 2004, OGAWA Hirofumi
3 * Released under GPL v2.
4 */
6 #include <linux/module.h>
7 #include <linux/fs.h>
8 #include <linux/msdos_fs.h>
9 #include <linux/blkdev.h>
10 #include "fat.h"
12 struct fatent_operations {
13 void (*ent_blocknr)(struct super_block *, int, int *, sector_t *);
14 void (*ent_set_ptr)(struct fat_entry *, int);
15 int (*ent_bread)(struct super_block *, struct fat_entry *,
16 int, sector_t);
17 int (*ent_get)(struct fat_entry *);
18 void (*ent_put)(struct fat_entry *, int);
19 int (*ent_next)(struct fat_entry *);
22 static DEFINE_SPINLOCK(fat12_entry_lock);
24 static void fat12_ent_blocknr(struct super_block *sb, int entry,
25 int *offset, sector_t *blocknr)
27 struct msdos_sb_info *sbi = MSDOS_SB(sb);
28 int bytes = entry + (entry >> 1);
29 WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry);
30 *offset = bytes & (sb->s_blocksize - 1);
31 *blocknr = sbi->fat_start + (bytes >> sb->s_blocksize_bits);
34 static void fat_ent_blocknr(struct super_block *sb, int entry,
35 int *offset, sector_t *blocknr)
37 struct msdos_sb_info *sbi = MSDOS_SB(sb);
38 int bytes = (entry << sbi->fatent_shift);
39 WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry);
40 *offset = bytes & (sb->s_blocksize - 1);
41 *blocknr = sbi->fat_start + (bytes >> sb->s_blocksize_bits);
44 static void fat12_ent_set_ptr(struct fat_entry *fatent, int offset)
46 struct buffer_head **bhs = fatent->bhs;
47 if (fatent->nr_bhs == 1) {
48 WARN_ON(offset >= (bhs[0]->b_size - 1));
49 fatent->u.ent12_p[0] = bhs[0]->b_data + offset;
50 fatent->u.ent12_p[1] = bhs[0]->b_data + (offset + 1);
51 } else {
52 WARN_ON(offset != (bhs[0]->b_size - 1));
53 fatent->u.ent12_p[0] = bhs[0]->b_data + offset;
54 fatent->u.ent12_p[1] = bhs[1]->b_data;
58 static void fat16_ent_set_ptr(struct fat_entry *fatent, int offset)
60 WARN_ON(offset & (2 - 1));
61 fatent->u.ent16_p = (__le16 *)(fatent->bhs[0]->b_data + offset);
64 static void fat32_ent_set_ptr(struct fat_entry *fatent, int offset)
66 WARN_ON(offset & (4 - 1));
67 fatent->u.ent32_p = (__le32 *)(fatent->bhs[0]->b_data + offset);
70 static int fat12_ent_bread(struct super_block *sb, struct fat_entry *fatent,
71 int offset, sector_t blocknr)
73 struct buffer_head **bhs = fatent->bhs;
75 WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
76 fatent->fat_inode = MSDOS_SB(sb)->fat_inode;
78 bhs[0] = sb_bread(sb, blocknr);
79 if (!bhs[0])
80 goto err;
82 if ((offset + 1) < sb->s_blocksize)
83 fatent->nr_bhs = 1;
84 else {
85 /* This entry is block boundary, it needs the next block */
86 blocknr++;
87 bhs[1] = sb_bread(sb, blocknr);
88 if (!bhs[1])
89 goto err_brelse;
90 fatent->nr_bhs = 2;
92 fat12_ent_set_ptr(fatent, offset);
93 return 0;
95 err_brelse:
96 brelse(bhs[0]);
97 err:
98 printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n", (llu)blocknr);
99 return -EIO;
102 static int fat_ent_bread(struct super_block *sb, struct fat_entry *fatent,
103 int offset, sector_t blocknr)
105 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
107 WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
108 fatent->fat_inode = MSDOS_SB(sb)->fat_inode;
109 fatent->bhs[0] = sb_bread(sb, blocknr);
110 if (!fatent->bhs[0]) {
111 printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n",
112 (llu)blocknr);
113 return -EIO;
115 fatent->nr_bhs = 1;
116 ops->ent_set_ptr(fatent, offset);
117 return 0;
120 static int fat12_ent_get(struct fat_entry *fatent)
122 u8 **ent12_p = fatent->u.ent12_p;
123 int next;
125 spin_lock(&fat12_entry_lock);
126 if (fatent->entry & 1)
127 next = (*ent12_p[0] >> 4) | (*ent12_p[1] << 4);
128 else
129 next = (*ent12_p[1] << 8) | *ent12_p[0];
130 spin_unlock(&fat12_entry_lock);
132 next &= 0x0fff;
133 if (next >= BAD_FAT12)
134 next = FAT_ENT_EOF;
135 return next;
138 static int fat16_ent_get(struct fat_entry *fatent)
140 int next = le16_to_cpu(*fatent->u.ent16_p);
141 WARN_ON((unsigned long)fatent->u.ent16_p & (2 - 1));
142 if (next >= BAD_FAT16)
143 next = FAT_ENT_EOF;
144 return next;
147 static int fat32_ent_get(struct fat_entry *fatent)
149 int next = le32_to_cpu(*fatent->u.ent32_p) & 0x0fffffff;
150 WARN_ON((unsigned long)fatent->u.ent32_p & (4 - 1));
151 if (next >= BAD_FAT32)
152 next = FAT_ENT_EOF;
153 return next;
156 static void fat12_ent_put(struct fat_entry *fatent, int new)
158 u8 **ent12_p = fatent->u.ent12_p;
160 if (new == FAT_ENT_EOF)
161 new = EOF_FAT12;
163 spin_lock(&fat12_entry_lock);
164 if (fatent->entry & 1) {
165 *ent12_p[0] = (new << 4) | (*ent12_p[0] & 0x0f);
166 *ent12_p[1] = new >> 4;
167 } else {
168 *ent12_p[0] = new & 0xff;
169 *ent12_p[1] = (*ent12_p[1] & 0xf0) | (new >> 8);
171 spin_unlock(&fat12_entry_lock);
173 mark_buffer_dirty_inode(fatent->bhs[0], fatent->fat_inode);
174 if (fatent->nr_bhs == 2)
175 mark_buffer_dirty_inode(fatent->bhs[1], fatent->fat_inode);
178 static void fat16_ent_put(struct fat_entry *fatent, int new)
180 if (new == FAT_ENT_EOF)
181 new = EOF_FAT16;
183 *fatent->u.ent16_p = cpu_to_le16(new);
184 mark_buffer_dirty_inode(fatent->bhs[0], fatent->fat_inode);
187 static void fat32_ent_put(struct fat_entry *fatent, int new)
189 if (new == FAT_ENT_EOF)
190 new = EOF_FAT32;
192 WARN_ON(new & 0xf0000000);
193 new |= le32_to_cpu(*fatent->u.ent32_p) & ~0x0fffffff;
194 *fatent->u.ent32_p = cpu_to_le32(new);
195 mark_buffer_dirty_inode(fatent->bhs[0], fatent->fat_inode);
198 static int fat12_ent_next(struct fat_entry *fatent)
200 u8 **ent12_p = fatent->u.ent12_p;
201 struct buffer_head **bhs = fatent->bhs;
202 u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1);
204 fatent->entry++;
205 if (fatent->nr_bhs == 1) {
206 WARN_ON(ent12_p[0] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 2)));
207 WARN_ON(ent12_p[1] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
208 if (nextp < (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1))) {
209 ent12_p[0] = nextp - 1;
210 ent12_p[1] = nextp;
211 return 1;
213 } else {
214 WARN_ON(ent12_p[0] != (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
215 WARN_ON(ent12_p[1] != (u8 *)bhs[1]->b_data);
216 ent12_p[0] = nextp - 1;
217 ent12_p[1] = nextp;
218 brelse(bhs[0]);
219 bhs[0] = bhs[1];
220 fatent->nr_bhs = 1;
221 return 1;
223 ent12_p[0] = NULL;
224 ent12_p[1] = NULL;
225 return 0;
228 static int fat16_ent_next(struct fat_entry *fatent)
230 const struct buffer_head *bh = fatent->bhs[0];
231 fatent->entry++;
232 if (fatent->u.ent16_p < (__le16 *)(bh->b_data + (bh->b_size - 2))) {
233 fatent->u.ent16_p++;
234 return 1;
236 fatent->u.ent16_p = NULL;
237 return 0;
240 static int fat32_ent_next(struct fat_entry *fatent)
242 const struct buffer_head *bh = fatent->bhs[0];
243 fatent->entry++;
244 if (fatent->u.ent32_p < (__le32 *)(bh->b_data + (bh->b_size - 4))) {
245 fatent->u.ent32_p++;
246 return 1;
248 fatent->u.ent32_p = NULL;
249 return 0;
252 static struct fatent_operations fat12_ops = {
253 .ent_blocknr = fat12_ent_blocknr,
254 .ent_set_ptr = fat12_ent_set_ptr,
255 .ent_bread = fat12_ent_bread,
256 .ent_get = fat12_ent_get,
257 .ent_put = fat12_ent_put,
258 .ent_next = fat12_ent_next,
261 static struct fatent_operations fat16_ops = {
262 .ent_blocknr = fat_ent_blocknr,
263 .ent_set_ptr = fat16_ent_set_ptr,
264 .ent_bread = fat_ent_bread,
265 .ent_get = fat16_ent_get,
266 .ent_put = fat16_ent_put,
267 .ent_next = fat16_ent_next,
270 static struct fatent_operations fat32_ops = {
271 .ent_blocknr = fat_ent_blocknr,
272 .ent_set_ptr = fat32_ent_set_ptr,
273 .ent_bread = fat_ent_bread,
274 .ent_get = fat32_ent_get,
275 .ent_put = fat32_ent_put,
276 .ent_next = fat32_ent_next,
279 static inline void lock_fat(struct msdos_sb_info *sbi)
281 mutex_lock(&sbi->fat_lock);
284 static inline void unlock_fat(struct msdos_sb_info *sbi)
286 mutex_unlock(&sbi->fat_lock);
289 void fat_ent_access_init(struct super_block *sb)
291 struct msdos_sb_info *sbi = MSDOS_SB(sb);
293 mutex_init(&sbi->fat_lock);
295 switch (sbi->fat_bits) {
296 case 32:
297 sbi->fatent_shift = 2;
298 sbi->fatent_ops = &fat32_ops;
299 break;
300 case 16:
301 sbi->fatent_shift = 1;
302 sbi->fatent_ops = &fat16_ops;
303 break;
304 case 12:
305 sbi->fatent_shift = -1;
306 sbi->fatent_ops = &fat12_ops;
307 break;
311 static inline int fat_ent_update_ptr(struct super_block *sb,
312 struct fat_entry *fatent,
313 int offset, sector_t blocknr)
315 struct msdos_sb_info *sbi = MSDOS_SB(sb);
316 struct fatent_operations *ops = sbi->fatent_ops;
317 struct buffer_head **bhs = fatent->bhs;
319 /* Is this fatent's blocks including this entry? */
320 if (!fatent->nr_bhs || bhs[0]->b_blocknr != blocknr)
321 return 0;
322 if (sbi->fat_bits == 12) {
323 if ((offset + 1) < sb->s_blocksize) {
324 /* This entry is on bhs[0]. */
325 if (fatent->nr_bhs == 2) {
326 brelse(bhs[1]);
327 fatent->nr_bhs = 1;
329 } else {
330 /* This entry needs the next block. */
331 if (fatent->nr_bhs != 2)
332 return 0;
333 if (bhs[1]->b_blocknr != (blocknr + 1))
334 return 0;
337 ops->ent_set_ptr(fatent, offset);
338 return 1;
341 int fat_ent_read(struct inode *inode, struct fat_entry *fatent, int entry)
343 struct super_block *sb = inode->i_sb;
344 struct msdos_sb_info *sbi = MSDOS_SB(inode->i_sb);
345 struct fatent_operations *ops = sbi->fatent_ops;
346 int err, offset;
347 sector_t blocknr;
349 if (entry < FAT_START_ENT || sbi->max_cluster <= entry) {
350 fatent_brelse(fatent);
351 fat_fs_error(sb, "invalid access to FAT (entry 0x%08x)", entry);
352 return -EIO;
355 fatent_set_entry(fatent, entry);
356 ops->ent_blocknr(sb, entry, &offset, &blocknr);
358 if (!fat_ent_update_ptr(sb, fatent, offset, blocknr)) {
359 fatent_brelse(fatent);
360 err = ops->ent_bread(sb, fatent, offset, blocknr);
361 if (err)
362 return err;
364 return ops->ent_get(fatent);
367 static int fat_mirror_bhs(struct super_block *sb, struct buffer_head **bhs,
368 int nr_bhs)
370 struct msdos_sb_info *sbi = MSDOS_SB(sb);
371 struct buffer_head *c_bh;
372 int err, n, copy;
374 err = 0;
375 for (copy = 1; copy < sbi->fats; copy++) {
376 sector_t backup_fat = sbi->fat_length * copy;
378 for (n = 0; n < nr_bhs; n++) {
379 c_bh = sb_getblk(sb, backup_fat + bhs[n]->b_blocknr);
380 if (!c_bh) {
381 err = -ENOMEM;
382 goto error;
384 memcpy(c_bh->b_data, bhs[n]->b_data, sb->s_blocksize);
385 set_buffer_uptodate(c_bh);
386 mark_buffer_dirty_inode(c_bh, sbi->fat_inode);
387 if (sb->s_flags & MS_SYNCHRONOUS)
388 err = sync_dirty_buffer(c_bh);
389 brelse(c_bh);
390 if (err)
391 goto error;
394 error:
395 return err;
398 int fat_ent_write(struct inode *inode, struct fat_entry *fatent,
399 int new, int wait)
401 struct super_block *sb = inode->i_sb;
402 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
403 int err;
405 ops->ent_put(fatent, new);
406 if (wait) {
407 err = fat_sync_bhs(fatent->bhs, fatent->nr_bhs);
408 if (err)
409 return err;
411 return fat_mirror_bhs(sb, fatent->bhs, fatent->nr_bhs);
414 static inline int fat_ent_next(struct msdos_sb_info *sbi,
415 struct fat_entry *fatent)
417 if (sbi->fatent_ops->ent_next(fatent)) {
418 if (fatent->entry < sbi->max_cluster)
419 return 1;
421 return 0;
424 static inline int fat_ent_read_block(struct super_block *sb,
425 struct fat_entry *fatent)
427 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
428 sector_t blocknr;
429 int offset;
431 fatent_brelse(fatent);
432 ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
433 return ops->ent_bread(sb, fatent, offset, blocknr);
436 static void fat_collect_bhs(struct buffer_head **bhs, int *nr_bhs,
437 struct fat_entry *fatent)
439 int n, i;
441 for (n = 0; n < fatent->nr_bhs; n++) {
442 for (i = 0; i < *nr_bhs; i++) {
443 if (fatent->bhs[n] == bhs[i])
444 break;
446 if (i == *nr_bhs) {
447 get_bh(fatent->bhs[n]);
448 bhs[i] = fatent->bhs[n];
449 (*nr_bhs)++;
454 int fat_alloc_clusters(struct inode *inode, int *cluster, int nr_cluster)
456 struct super_block *sb = inode->i_sb;
457 struct msdos_sb_info *sbi = MSDOS_SB(sb);
458 struct fatent_operations *ops = sbi->fatent_ops;
459 struct fat_entry fatent, prev_ent;
460 struct buffer_head *bhs[MAX_BUF_PER_PAGE];
461 int i, count, err, nr_bhs, idx_clus;
463 BUG_ON(nr_cluster > (MAX_BUF_PER_PAGE / 2)); /* fixed limit */
465 lock_fat(sbi);
466 if (sbi->free_clusters != -1 && sbi->free_clus_valid &&
467 sbi->free_clusters < nr_cluster) {
468 unlock_fat(sbi);
469 return -ENOSPC;
472 err = nr_bhs = idx_clus = 0;
473 count = FAT_START_ENT;
474 fatent_init(&prev_ent);
475 fatent_init(&fatent);
476 fatent_set_entry(&fatent, sbi->prev_free + 1);
477 while (count < sbi->max_cluster) {
478 if (fatent.entry >= sbi->max_cluster)
479 fatent.entry = FAT_START_ENT;
480 fatent_set_entry(&fatent, fatent.entry);
481 err = fat_ent_read_block(sb, &fatent);
482 if (err)
483 goto out;
485 /* Find the free entries in a block */
486 do {
487 if (ops->ent_get(&fatent) == FAT_ENT_FREE) {
488 int entry = fatent.entry;
490 /* make the cluster chain */
491 ops->ent_put(&fatent, FAT_ENT_EOF);
492 if (prev_ent.nr_bhs)
493 ops->ent_put(&prev_ent, entry);
495 fat_collect_bhs(bhs, &nr_bhs, &fatent);
497 sbi->prev_free = entry;
498 if (sbi->free_clusters != -1)
499 sbi->free_clusters--;
500 sb->s_dirt = 1;
502 cluster[idx_clus] = entry;
503 idx_clus++;
504 if (idx_clus == nr_cluster)
505 goto out;
508 * fat_collect_bhs() gets ref-count of bhs,
509 * so we can still use the prev_ent.
511 prev_ent = fatent;
513 count++;
514 if (count == sbi->max_cluster)
515 break;
516 } while (fat_ent_next(sbi, &fatent));
519 /* Couldn't allocate the free entries */
520 sbi->free_clusters = 0;
521 sbi->free_clus_valid = 1;
522 sb->s_dirt = 1;
523 err = -ENOSPC;
525 out:
526 unlock_fat(sbi);
527 fatent_brelse(&fatent);
528 if (!err) {
529 if (inode_needs_sync(inode))
530 err = fat_sync_bhs(bhs, nr_bhs);
531 if (!err)
532 err = fat_mirror_bhs(sb, bhs, nr_bhs);
534 for (i = 0; i < nr_bhs; i++)
535 brelse(bhs[i]);
537 if (err && idx_clus)
538 fat_free_clusters(inode, cluster[0]);
540 return err;
543 int fat_free_clusters(struct inode *inode, int cluster)
545 struct super_block *sb = inode->i_sb;
546 struct msdos_sb_info *sbi = MSDOS_SB(sb);
547 struct fatent_operations *ops = sbi->fatent_ops;
548 struct fat_entry fatent;
549 struct buffer_head *bhs[MAX_BUF_PER_PAGE];
550 int i, err, nr_bhs;
551 int first_cl = cluster;
553 nr_bhs = 0;
554 fatent_init(&fatent);
555 lock_fat(sbi);
556 do {
557 cluster = fat_ent_read(inode, &fatent, cluster);
558 if (cluster < 0) {
559 err = cluster;
560 goto error;
561 } else if (cluster == FAT_ENT_FREE) {
562 fat_fs_error(sb, "%s: deleting FAT entry beyond EOF",
563 __func__);
564 err = -EIO;
565 goto error;
568 if (sbi->options.discard) {
570 * Issue discard for the sectors we no longer
571 * care about, batching contiguous clusters
572 * into one request
574 if (cluster != fatent.entry + 1) {
575 int nr_clus = fatent.entry - first_cl + 1;
577 sb_issue_discard(sb,
578 fat_clus_to_blknr(sbi, first_cl),
579 nr_clus * sbi->sec_per_clus);
581 first_cl = cluster;
585 ops->ent_put(&fatent, FAT_ENT_FREE);
586 if (sbi->free_clusters != -1) {
587 sbi->free_clusters++;
588 sb->s_dirt = 1;
591 if (nr_bhs + fatent.nr_bhs > MAX_BUF_PER_PAGE) {
592 if (sb->s_flags & MS_SYNCHRONOUS) {
593 err = fat_sync_bhs(bhs, nr_bhs);
594 if (err)
595 goto error;
597 err = fat_mirror_bhs(sb, bhs, nr_bhs);
598 if (err)
599 goto error;
600 for (i = 0; i < nr_bhs; i++)
601 brelse(bhs[i]);
602 nr_bhs = 0;
604 fat_collect_bhs(bhs, &nr_bhs, &fatent);
605 } while (cluster != FAT_ENT_EOF);
607 if (sb->s_flags & MS_SYNCHRONOUS) {
608 err = fat_sync_bhs(bhs, nr_bhs);
609 if (err)
610 goto error;
612 err = fat_mirror_bhs(sb, bhs, nr_bhs);
613 error:
614 fatent_brelse(&fatent);
615 for (i = 0; i < nr_bhs; i++)
616 brelse(bhs[i]);
617 unlock_fat(sbi);
619 return err;
622 EXPORT_SYMBOL_GPL(fat_free_clusters);
624 /* 128kb is the whole sectors for FAT12 and FAT16 */
625 #define FAT_READA_SIZE (128 * 1024)
627 static void fat_ent_reada(struct super_block *sb, struct fat_entry *fatent,
628 unsigned long reada_blocks)
630 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
631 sector_t blocknr;
632 int i, offset;
634 ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
636 for (i = 0; i < reada_blocks; i++)
637 sb_breadahead(sb, blocknr + i);
640 int fat_count_free_clusters(struct super_block *sb)
642 struct msdos_sb_info *sbi = MSDOS_SB(sb);
643 struct fatent_operations *ops = sbi->fatent_ops;
644 struct fat_entry fatent;
645 unsigned long reada_blocks, reada_mask, cur_block;
646 int err = 0, free;
648 lock_fat(sbi);
649 if (sbi->free_clusters != -1 && sbi->free_clus_valid)
650 goto out;
652 reada_blocks = FAT_READA_SIZE >> sb->s_blocksize_bits;
653 reada_mask = reada_blocks - 1;
654 cur_block = 0;
656 free = 0;
657 fatent_init(&fatent);
658 fatent_set_entry(&fatent, FAT_START_ENT);
659 while (fatent.entry < sbi->max_cluster) {
660 /* readahead of fat blocks */
661 if ((cur_block & reada_mask) == 0) {
662 unsigned long rest = sbi->fat_length - cur_block;
663 fat_ent_reada(sb, &fatent, min(reada_blocks, rest));
665 cur_block++;
667 err = fat_ent_read_block(sb, &fatent);
668 if (err)
669 goto out;
671 do {
672 if (ops->ent_get(&fatent) == FAT_ENT_FREE)
673 free++;
674 } while (fat_ent_next(sbi, &fatent));
676 sbi->free_clusters = free;
677 sbi->free_clus_valid = 1;
678 sb->s_dirt = 1;
679 fatent_brelse(&fatent);
680 out:
681 unlock_fat(sbi);
682 return err;