blob: 5b5f49061b7c7ccbfe76eea416475fc691936346 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Copyright (C) 2004, OGAWA Hirofumi
3 * Released under GPL v2.
4 */
5
6#include <linux/module.h>
7#include <linux/fs.h>
8#include <linux/msdos_fs.h>
David Woodhouse8c540a92008-08-05 18:05:46 +01009#include <linux/blkdev.h>
OGAWA Hirofumi9e975da2008-11-06 12:53:46 -080010#include "fat.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070011
12struct 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 *);
20};
21
OGAWA Hirofumi98283bb2007-07-16 09:40:05 +090022static DEFINE_SPINLOCK(fat12_entry_lock);
23
Linus Torvalds1da177e2005-04-16 15:20:36 -070024static void fat12_ent_blocknr(struct super_block *sb, int entry,
25 int *offset, sector_t *blocknr)
26{
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);
32}
33
34static void fat_ent_blocknr(struct super_block *sb, int entry,
35 int *offset, sector_t *blocknr)
36{
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);
42}
43
44static void fat12_ent_set_ptr(struct fat_entry *fatent, int offset)
45{
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;
55 }
56}
57
58static void fat16_ent_set_ptr(struct fat_entry *fatent, int offset)
59{
60 WARN_ON(offset & (2 - 1));
61 fatent->u.ent16_p = (__le16 *)(fatent->bhs[0]->b_data + offset);
62}
63
64static void fat32_ent_set_ptr(struct fat_entry *fatent, int offset)
65{
66 WARN_ON(offset & (4 - 1));
67 fatent->u.ent32_p = (__le32 *)(fatent->bhs[0]->b_data + offset);
68}
69
70static int fat12_ent_bread(struct super_block *sb, struct fat_entry *fatent,
71 int offset, sector_t blocknr)
72{
73 struct buffer_head **bhs = fatent->bhs;
74
75 WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
76 bhs[0] = sb_bread(sb, blocknr);
77 if (!bhs[0])
78 goto err;
79
80 if ((offset + 1) < sb->s_blocksize)
81 fatent->nr_bhs = 1;
82 else {
83 /* This entry is block boundary, it needs the next block */
84 blocknr++;
85 bhs[1] = sb_bread(sb, blocknr);
86 if (!bhs[1])
87 goto err_brelse;
88 fatent->nr_bhs = 2;
89 }
90 fat12_ent_set_ptr(fatent, offset);
91 return 0;
92
93err_brelse:
94 brelse(bhs[0]);
95err:
96 printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n",
97 (unsigned long long)blocknr);
98 return -EIO;
99}
100
101static int fat_ent_bread(struct super_block *sb, struct fat_entry *fatent,
102 int offset, sector_t blocknr)
103{
104 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
105
106 WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
107 fatent->bhs[0] = sb_bread(sb, blocknr);
108 if (!fatent->bhs[0]) {
109 printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n",
110 (unsigned long long)blocknr);
111 return -EIO;
112 }
113 fatent->nr_bhs = 1;
114 ops->ent_set_ptr(fatent, offset);
115 return 0;
116}
117
118static int fat12_ent_get(struct fat_entry *fatent)
119{
120 u8 **ent12_p = fatent->u.ent12_p;
121 int next;
122
OGAWA Hirofumi98283bb2007-07-16 09:40:05 +0900123 spin_lock(&fat12_entry_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 if (fatent->entry & 1)
125 next = (*ent12_p[0] >> 4) | (*ent12_p[1] << 4);
126 else
127 next = (*ent12_p[1] << 8) | *ent12_p[0];
OGAWA Hirofumi98283bb2007-07-16 09:40:05 +0900128 spin_unlock(&fat12_entry_lock);
129
Linus Torvalds1da177e2005-04-16 15:20:36 -0700130 next &= 0x0fff;
131 if (next >= BAD_FAT12)
132 next = FAT_ENT_EOF;
133 return next;
134}
135
136static int fat16_ent_get(struct fat_entry *fatent)
137{
138 int next = le16_to_cpu(*fatent->u.ent16_p);
139 WARN_ON((unsigned long)fatent->u.ent16_p & (2 - 1));
140 if (next >= BAD_FAT16)
141 next = FAT_ENT_EOF;
142 return next;
143}
144
145static int fat32_ent_get(struct fat_entry *fatent)
146{
147 int next = le32_to_cpu(*fatent->u.ent32_p) & 0x0fffffff;
148 WARN_ON((unsigned long)fatent->u.ent32_p & (4 - 1));
149 if (next >= BAD_FAT32)
150 next = FAT_ENT_EOF;
151 return next;
152}
153
154static void fat12_ent_put(struct fat_entry *fatent, int new)
155{
156 u8 **ent12_p = fatent->u.ent12_p;
157
158 if (new == FAT_ENT_EOF)
159 new = EOF_FAT12;
160
OGAWA Hirofumi98283bb2007-07-16 09:40:05 +0900161 spin_lock(&fat12_entry_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 if (fatent->entry & 1) {
163 *ent12_p[0] = (new << 4) | (*ent12_p[0] & 0x0f);
164 *ent12_p[1] = new >> 4;
165 } else {
166 *ent12_p[0] = new & 0xff;
167 *ent12_p[1] = (*ent12_p[1] & 0xf0) | (new >> 8);
168 }
OGAWA Hirofumi98283bb2007-07-16 09:40:05 +0900169 spin_unlock(&fat12_entry_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170
171 mark_buffer_dirty(fatent->bhs[0]);
172 if (fatent->nr_bhs == 2)
173 mark_buffer_dirty(fatent->bhs[1]);
174}
175
176static void fat16_ent_put(struct fat_entry *fatent, int new)
177{
178 if (new == FAT_ENT_EOF)
179 new = EOF_FAT16;
180
181 *fatent->u.ent16_p = cpu_to_le16(new);
182 mark_buffer_dirty(fatent->bhs[0]);
183}
184
185static void fat32_ent_put(struct fat_entry *fatent, int new)
186{
187 if (new == FAT_ENT_EOF)
188 new = EOF_FAT32;
189
190 WARN_ON(new & 0xf0000000);
191 new |= le32_to_cpu(*fatent->u.ent32_p) & ~0x0fffffff;
192 *fatent->u.ent32_p = cpu_to_le32(new);
193 mark_buffer_dirty(fatent->bhs[0]);
194}
195
196static int fat12_ent_next(struct fat_entry *fatent)
197{
198 u8 **ent12_p = fatent->u.ent12_p;
199 struct buffer_head **bhs = fatent->bhs;
200 u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1);
201
202 fatent->entry++;
203 if (fatent->nr_bhs == 1) {
204 WARN_ON(ent12_p[0] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 2)));
205 WARN_ON(ent12_p[1] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
206 if (nextp < (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1))) {
207 ent12_p[0] = nextp - 1;
208 ent12_p[1] = nextp;
209 return 1;
210 }
211 } else {
212 WARN_ON(ent12_p[0] != (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
213 WARN_ON(ent12_p[1] != (u8 *)bhs[1]->b_data);
214 ent12_p[0] = nextp - 1;
215 ent12_p[1] = nextp;
216 brelse(bhs[0]);
217 bhs[0] = bhs[1];
218 fatent->nr_bhs = 1;
219 return 1;
220 }
221 ent12_p[0] = NULL;
222 ent12_p[1] = NULL;
223 return 0;
224}
225
226static int fat16_ent_next(struct fat_entry *fatent)
227{
228 const struct buffer_head *bh = fatent->bhs[0];
229 fatent->entry++;
230 if (fatent->u.ent16_p < (__le16 *)(bh->b_data + (bh->b_size - 2))) {
231 fatent->u.ent16_p++;
232 return 1;
233 }
234 fatent->u.ent16_p = NULL;
235 return 0;
236}
237
238static int fat32_ent_next(struct fat_entry *fatent)
239{
240 const struct buffer_head *bh = fatent->bhs[0];
241 fatent->entry++;
242 if (fatent->u.ent32_p < (__le32 *)(bh->b_data + (bh->b_size - 4))) {
243 fatent->u.ent32_p++;
244 return 1;
245 }
246 fatent->u.ent32_p = NULL;
247 return 0;
248}
249
250static struct fatent_operations fat12_ops = {
251 .ent_blocknr = fat12_ent_blocknr,
252 .ent_set_ptr = fat12_ent_set_ptr,
253 .ent_bread = fat12_ent_bread,
254 .ent_get = fat12_ent_get,
255 .ent_put = fat12_ent_put,
256 .ent_next = fat12_ent_next,
257};
258
259static struct fatent_operations fat16_ops = {
260 .ent_blocknr = fat_ent_blocknr,
261 .ent_set_ptr = fat16_ent_set_ptr,
262 .ent_bread = fat_ent_bread,
263 .ent_get = fat16_ent_get,
264 .ent_put = fat16_ent_put,
265 .ent_next = fat16_ent_next,
266};
267
268static struct fatent_operations fat32_ops = {
269 .ent_blocknr = fat_ent_blocknr,
270 .ent_set_ptr = fat32_ent_set_ptr,
271 .ent_bread = fat_ent_bread,
272 .ent_get = fat32_ent_get,
273 .ent_put = fat32_ent_put,
274 .ent_next = fat32_ent_next,
275};
276
277static inline void lock_fat(struct msdos_sb_info *sbi)
278{
Arjan van de Ven6b9438e2006-03-23 03:00:48 -0800279 mutex_lock(&sbi->fat_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280}
281
282static inline void unlock_fat(struct msdos_sb_info *sbi)
283{
Arjan van de Ven6b9438e2006-03-23 03:00:48 -0800284 mutex_unlock(&sbi->fat_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285}
286
287void fat_ent_access_init(struct super_block *sb)
288{
289 struct msdos_sb_info *sbi = MSDOS_SB(sb);
290
Arjan van de Ven6b9438e2006-03-23 03:00:48 -0800291 mutex_init(&sbi->fat_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292
293 switch (sbi->fat_bits) {
294 case 32:
295 sbi->fatent_shift = 2;
296 sbi->fatent_ops = &fat32_ops;
297 break;
298 case 16:
299 sbi->fatent_shift = 1;
300 sbi->fatent_ops = &fat16_ops;
301 break;
302 case 12:
303 sbi->fatent_shift = -1;
304 sbi->fatent_ops = &fat12_ops;
305 break;
306 }
307}
308
309static inline int fat_ent_update_ptr(struct super_block *sb,
310 struct fat_entry *fatent,
311 int offset, sector_t blocknr)
312{
313 struct msdos_sb_info *sbi = MSDOS_SB(sb);
314 struct fatent_operations *ops = sbi->fatent_ops;
315 struct buffer_head **bhs = fatent->bhs;
316
317 /* Is this fatent's blocks including this entry? */
318 if (!fatent->nr_bhs || bhs[0]->b_blocknr != blocknr)
319 return 0;
320 /* Does this entry need the next block? */
321 if (sbi->fat_bits == 12 && (offset + 1) >= sb->s_blocksize) {
322 if (fatent->nr_bhs != 2 || bhs[1]->b_blocknr != (blocknr + 1))
323 return 0;
324 }
325 ops->ent_set_ptr(fatent, offset);
326 return 1;
327}
328
329int fat_ent_read(struct inode *inode, struct fat_entry *fatent, int entry)
330{
331 struct super_block *sb = inode->i_sb;
332 struct msdos_sb_info *sbi = MSDOS_SB(inode->i_sb);
333 struct fatent_operations *ops = sbi->fatent_ops;
334 int err, offset;
335 sector_t blocknr;
336
337 if (entry < FAT_START_ENT || sbi->max_cluster <= entry) {
338 fatent_brelse(fatent);
339 fat_fs_panic(sb, "invalid access to FAT (entry 0x%08x)", entry);
340 return -EIO;
341 }
342
343 fatent_set_entry(fatent, entry);
344 ops->ent_blocknr(sb, entry, &offset, &blocknr);
345
346 if (!fat_ent_update_ptr(sb, fatent, offset, blocknr)) {
347 fatent_brelse(fatent);
348 err = ops->ent_bread(sb, fatent, offset, blocknr);
349 if (err)
350 return err;
351 }
352 return ops->ent_get(fatent);
353}
354
355/* FIXME: We can write the blocks as more big chunk. */
356static int fat_mirror_bhs(struct super_block *sb, struct buffer_head **bhs,
357 int nr_bhs)
358{
359 struct msdos_sb_info *sbi = MSDOS_SB(sb);
360 struct buffer_head *c_bh;
361 int err, n, copy;
362
363 err = 0;
364 for (copy = 1; copy < sbi->fats; copy++) {
365 sector_t backup_fat = sbi->fat_length * copy;
366
367 for (n = 0; n < nr_bhs; n++) {
368 c_bh = sb_getblk(sb, backup_fat + bhs[n]->b_blocknr);
369 if (!c_bh) {
370 err = -ENOMEM;
371 goto error;
372 }
373 memcpy(c_bh->b_data, bhs[n]->b_data, sb->s_blocksize);
374 set_buffer_uptodate(c_bh);
375 mark_buffer_dirty(c_bh);
376 if (sb->s_flags & MS_SYNCHRONOUS)
377 err = sync_dirty_buffer(c_bh);
378 brelse(c_bh);
379 if (err)
380 goto error;
381 }
382 }
383error:
384 return err;
385}
386
387int fat_ent_write(struct inode *inode, struct fat_entry *fatent,
388 int new, int wait)
389{
390 struct super_block *sb = inode->i_sb;
391 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
392 int err;
393
394 ops->ent_put(fatent, new);
395 if (wait) {
396 err = fat_sync_bhs(fatent->bhs, fatent->nr_bhs);
397 if (err)
398 return err;
399 }
400 return fat_mirror_bhs(sb, fatent->bhs, fatent->nr_bhs);
401}
402
403static inline int fat_ent_next(struct msdos_sb_info *sbi,
404 struct fat_entry *fatent)
405{
406 if (sbi->fatent_ops->ent_next(fatent)) {
407 if (fatent->entry < sbi->max_cluster)
408 return 1;
409 }
410 return 0;
411}
412
413static inline int fat_ent_read_block(struct super_block *sb,
414 struct fat_entry *fatent)
415{
416 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
417 sector_t blocknr;
418 int offset;
419
420 fatent_brelse(fatent);
421 ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
422 return ops->ent_bread(sb, fatent, offset, blocknr);
423}
424
425static void fat_collect_bhs(struct buffer_head **bhs, int *nr_bhs,
426 struct fat_entry *fatent)
427{
428 int n, i;
429
430 for (n = 0; n < fatent->nr_bhs; n++) {
431 for (i = 0; i < *nr_bhs; i++) {
432 if (fatent->bhs[n] == bhs[i])
433 break;
434 }
435 if (i == *nr_bhs) {
436 get_bh(fatent->bhs[n]);
437 bhs[i] = fatent->bhs[n];
438 (*nr_bhs)++;
439 }
440 }
441}
442
443int fat_alloc_clusters(struct inode *inode, int *cluster, int nr_cluster)
444{
445 struct super_block *sb = inode->i_sb;
446 struct msdos_sb_info *sbi = MSDOS_SB(sb);
447 struct fatent_operations *ops = sbi->fatent_ops;
448 struct fat_entry fatent, prev_ent;
449 struct buffer_head *bhs[MAX_BUF_PER_PAGE];
450 int i, count, err, nr_bhs, idx_clus;
451
452 BUG_ON(nr_cluster > (MAX_BUF_PER_PAGE / 2)); /* fixed limit */
453
454 lock_fat(sbi);
OGAWA Hirofumi606e4232008-04-28 02:16:27 -0700455 if (sbi->free_clusters != -1 && sbi->free_clus_valid &&
456 sbi->free_clusters < nr_cluster) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457 unlock_fat(sbi);
458 return -ENOSPC;
459 }
460
461 err = nr_bhs = idx_clus = 0;
462 count = FAT_START_ENT;
463 fatent_init(&prev_ent);
464 fatent_init(&fatent);
465 fatent_set_entry(&fatent, sbi->prev_free + 1);
466 while (count < sbi->max_cluster) {
467 if (fatent.entry >= sbi->max_cluster)
468 fatent.entry = FAT_START_ENT;
469 fatent_set_entry(&fatent, fatent.entry);
470 err = fat_ent_read_block(sb, &fatent);
471 if (err)
472 goto out;
473
474 /* Find the free entries in a block */
475 do {
476 if (ops->ent_get(&fatent) == FAT_ENT_FREE) {
477 int entry = fatent.entry;
478
479 /* make the cluster chain */
480 ops->ent_put(&fatent, FAT_ENT_EOF);
481 if (prev_ent.nr_bhs)
482 ops->ent_put(&prev_ent, entry);
483
484 fat_collect_bhs(bhs, &nr_bhs, &fatent);
485
486 sbi->prev_free = entry;
487 if (sbi->free_clusters != -1)
488 sbi->free_clusters--;
OGAWA Hirofumia6bf6b22006-01-08 01:02:08 -0800489 sb->s_dirt = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490
491 cluster[idx_clus] = entry;
492 idx_clus++;
493 if (idx_clus == nr_cluster)
494 goto out;
495
496 /*
497 * fat_collect_bhs() gets ref-count of bhs,
498 * so we can still use the prev_ent.
499 */
500 prev_ent = fatent;
501 }
502 count++;
503 if (count == sbi->max_cluster)
504 break;
505 } while (fat_ent_next(sbi, &fatent));
506 }
507
508 /* Couldn't allocate the free entries */
509 sbi->free_clusters = 0;
OGAWA Hirofumi606e4232008-04-28 02:16:27 -0700510 sbi->free_clus_valid = 1;
OGAWA Hirofumia6bf6b22006-01-08 01:02:08 -0800511 sb->s_dirt = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512 err = -ENOSPC;
513
514out:
515 unlock_fat(sbi);
516 fatent_brelse(&fatent);
517 if (!err) {
518 if (inode_needs_sync(inode))
519 err = fat_sync_bhs(bhs, nr_bhs);
520 if (!err)
521 err = fat_mirror_bhs(sb, bhs, nr_bhs);
522 }
523 for (i = 0; i < nr_bhs; i++)
524 brelse(bhs[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525
526 if (err && idx_clus)
527 fat_free_clusters(inode, cluster[0]);
528
529 return err;
530}
531
532int fat_free_clusters(struct inode *inode, int cluster)
533{
534 struct super_block *sb = inode->i_sb;
535 struct msdos_sb_info *sbi = MSDOS_SB(sb);
536 struct fatent_operations *ops = sbi->fatent_ops;
537 struct fat_entry fatent;
538 struct buffer_head *bhs[MAX_BUF_PER_PAGE];
539 int i, err, nr_bhs;
David Woodhouse8c540a92008-08-05 18:05:46 +0100540 int first_cl = cluster;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541
542 nr_bhs = 0;
543 fatent_init(&fatent);
544 lock_fat(sbi);
545 do {
546 cluster = fat_ent_read(inode, &fatent, cluster);
547 if (cluster < 0) {
548 err = cluster;
549 goto error;
550 } else if (cluster == FAT_ENT_FREE) {
551 fat_fs_panic(sb, "%s: deleting FAT entry beyond EOF",
Harvey Harrison8e24eea2008-04-30 00:55:09 -0700552 __func__);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553 err = -EIO;
554 goto error;
555 }
556
David Woodhouse8c540a92008-08-05 18:05:46 +0100557 /*
558 * Issue discard for the sectors we no longer care about,
559 * batching contiguous clusters into one request
560 */
561 if (cluster != fatent.entry + 1) {
562 int nr_clus = fatent.entry - first_cl + 1;
563
564 sb_issue_discard(sb, fat_clus_to_blknr(sbi, first_cl),
565 nr_clus * sbi->sec_per_clus);
566 first_cl = cluster;
567 }
568
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 ops->ent_put(&fatent, FAT_ENT_FREE);
OGAWA Hirofumia6bf6b22006-01-08 01:02:08 -0800570 if (sbi->free_clusters != -1) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571 sbi->free_clusters++;
OGAWA Hirofumia6bf6b22006-01-08 01:02:08 -0800572 sb->s_dirt = 1;
573 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574
575 if (nr_bhs + fatent.nr_bhs > MAX_BUF_PER_PAGE) {
576 if (sb->s_flags & MS_SYNCHRONOUS) {
577 err = fat_sync_bhs(bhs, nr_bhs);
578 if (err)
579 goto error;
580 }
581 err = fat_mirror_bhs(sb, bhs, nr_bhs);
582 if (err)
583 goto error;
584 for (i = 0; i < nr_bhs; i++)
585 brelse(bhs[i]);
586 nr_bhs = 0;
587 }
588 fat_collect_bhs(bhs, &nr_bhs, &fatent);
589 } while (cluster != FAT_ENT_EOF);
590
591 if (sb->s_flags & MS_SYNCHRONOUS) {
592 err = fat_sync_bhs(bhs, nr_bhs);
593 if (err)
594 goto error;
595 }
596 err = fat_mirror_bhs(sb, bhs, nr_bhs);
597error:
598 fatent_brelse(&fatent);
599 for (i = 0; i < nr_bhs; i++)
600 brelse(bhs[i]);
601 unlock_fat(sbi);
602
Linus Torvalds1da177e2005-04-16 15:20:36 -0700603 return err;
604}
605
OGAWA Hirofumi7c709d02006-01-08 01:02:10 -0800606EXPORT_SYMBOL_GPL(fat_free_clusters);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
OGAWA Hirofumi9f966be8992008-01-08 15:32:41 -0800608/* 128kb is the whole sectors for FAT12 and FAT16 */
609#define FAT_READA_SIZE (128 * 1024)
610
611static void fat_ent_reada(struct super_block *sb, struct fat_entry *fatent,
612 unsigned long reada_blocks)
613{
614 struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
615 sector_t blocknr;
616 int i, offset;
617
618 ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
619
620 for (i = 0; i < reada_blocks; i++)
621 sb_breadahead(sb, blocknr + i);
622}
623
Linus Torvalds1da177e2005-04-16 15:20:36 -0700624int fat_count_free_clusters(struct super_block *sb)
625{
626 struct msdos_sb_info *sbi = MSDOS_SB(sb);
627 struct fatent_operations *ops = sbi->fatent_ops;
628 struct fat_entry fatent;
OGAWA Hirofumi9f966be8992008-01-08 15:32:41 -0800629 unsigned long reada_blocks, reada_mask, cur_block;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700630 int err = 0, free;
631
632 lock_fat(sbi);
OGAWA Hirofumi606e4232008-04-28 02:16:27 -0700633 if (sbi->free_clusters != -1 && sbi->free_clus_valid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634 goto out;
635
OGAWA Hirofumi9f966be8992008-01-08 15:32:41 -0800636 reada_blocks = FAT_READA_SIZE >> sb->s_blocksize_bits;
637 reada_mask = reada_blocks - 1;
638 cur_block = 0;
639
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 free = 0;
641 fatent_init(&fatent);
642 fatent_set_entry(&fatent, FAT_START_ENT);
643 while (fatent.entry < sbi->max_cluster) {
OGAWA Hirofumi9f966be8992008-01-08 15:32:41 -0800644 /* readahead of fat blocks */
645 if ((cur_block & reada_mask) == 0) {
646 unsigned long rest = sbi->fat_length - cur_block;
647 fat_ent_reada(sb, &fatent, min(reada_blocks, rest));
648 }
649 cur_block++;
650
Linus Torvalds1da177e2005-04-16 15:20:36 -0700651 err = fat_ent_read_block(sb, &fatent);
652 if (err)
653 goto out;
654
655 do {
656 if (ops->ent_get(&fatent) == FAT_ENT_FREE)
657 free++;
658 } while (fat_ent_next(sbi, &fatent));
659 }
660 sbi->free_clusters = free;
OGAWA Hirofumi606e4232008-04-28 02:16:27 -0700661 sbi->free_clus_valid = 1;
OGAWA Hirofumia6bf6b22006-01-08 01:02:08 -0800662 sb->s_dirt = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700663 fatent_brelse(&fatent);
664out:
665 unlock_fat(sbi);
666 return err;
667}