fatent.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667
  1. /*
  2. * Copyright (C) 2004, OGAWA Hirofumi
  3. * Released under GPL v2.
  4. */
  5. #include <linux/module.h>
  6. #include <linux/fs.h>
  7. #include <linux/msdos_fs.h>
  8. #include <linux/blkdev.h>
  9. #include "fat.h"
  10. struct fatent_operations {
  11. void (*ent_blocknr)(struct super_block *, int, int *, sector_t *);
  12. void (*ent_set_ptr)(struct fat_entry *, int);
  13. int (*ent_bread)(struct super_block *, struct fat_entry *,
  14. int, sector_t);
  15. int (*ent_get)(struct fat_entry *);
  16. void (*ent_put)(struct fat_entry *, int);
  17. int (*ent_next)(struct fat_entry *);
  18. };
  19. static DEFINE_SPINLOCK(fat12_entry_lock);
  20. static void fat12_ent_blocknr(struct super_block *sb, int entry,
  21. int *offset, sector_t *blocknr)
  22. {
  23. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  24. int bytes = entry + (entry >> 1);
  25. WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry);
  26. *offset = bytes & (sb->s_blocksize - 1);
  27. *blocknr = sbi->fat_start + (bytes >> sb->s_blocksize_bits);
  28. }
  29. static void fat_ent_blocknr(struct super_block *sb, int entry,
  30. int *offset, sector_t *blocknr)
  31. {
  32. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  33. int bytes = (entry << sbi->fatent_shift);
  34. WARN_ON(entry < FAT_START_ENT || sbi->max_cluster <= entry);
  35. *offset = bytes & (sb->s_blocksize - 1);
  36. *blocknr = sbi->fat_start + (bytes >> sb->s_blocksize_bits);
  37. }
  38. static void fat12_ent_set_ptr(struct fat_entry *fatent, int offset)
  39. {
  40. struct buffer_head **bhs = fatent->bhs;
  41. if (fatent->nr_bhs == 1) {
  42. WARN_ON(offset >= (bhs[0]->b_size - 1));
  43. fatent->u.ent12_p[0] = bhs[0]->b_data + offset;
  44. fatent->u.ent12_p[1] = bhs[0]->b_data + (offset + 1);
  45. } else {
  46. WARN_ON(offset != (bhs[0]->b_size - 1));
  47. fatent->u.ent12_p[0] = bhs[0]->b_data + offset;
  48. fatent->u.ent12_p[1] = bhs[1]->b_data;
  49. }
  50. }
  51. static void fat16_ent_set_ptr(struct fat_entry *fatent, int offset)
  52. {
  53. WARN_ON(offset & (2 - 1));
  54. fatent->u.ent16_p = (__le16 *)(fatent->bhs[0]->b_data + offset);
  55. }
  56. static void fat32_ent_set_ptr(struct fat_entry *fatent, int offset)
  57. {
  58. WARN_ON(offset & (4 - 1));
  59. fatent->u.ent32_p = (__le32 *)(fatent->bhs[0]->b_data + offset);
  60. }
  61. static int fat12_ent_bread(struct super_block *sb, struct fat_entry *fatent,
  62. int offset, sector_t blocknr)
  63. {
  64. struct buffer_head **bhs = fatent->bhs;
  65. WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
  66. bhs[0] = sb_bread(sb, blocknr);
  67. if (!bhs[0])
  68. goto err;
  69. if ((offset + 1) < sb->s_blocksize)
  70. fatent->nr_bhs = 1;
  71. else {
  72. /* This entry is block boundary, it needs the next block */
  73. blocknr++;
  74. bhs[1] = sb_bread(sb, blocknr);
  75. if (!bhs[1])
  76. goto err_brelse;
  77. fatent->nr_bhs = 2;
  78. }
  79. fat12_ent_set_ptr(fatent, offset);
  80. return 0;
  81. err_brelse:
  82. brelse(bhs[0]);
  83. err:
  84. printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n",
  85. (unsigned long long)blocknr);
  86. return -EIO;
  87. }
  88. static int fat_ent_bread(struct super_block *sb, struct fat_entry *fatent,
  89. int offset, sector_t blocknr)
  90. {
  91. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  92. WARN_ON(blocknr < MSDOS_SB(sb)->fat_start);
  93. fatent->bhs[0] = sb_bread(sb, blocknr);
  94. if (!fatent->bhs[0]) {
  95. printk(KERN_ERR "FAT: FAT read failed (blocknr %llu)\n",
  96. (unsigned long long)blocknr);
  97. return -EIO;
  98. }
  99. fatent->nr_bhs = 1;
  100. ops->ent_set_ptr(fatent, offset);
  101. return 0;
  102. }
  103. static int fat12_ent_get(struct fat_entry *fatent)
  104. {
  105. u8 **ent12_p = fatent->u.ent12_p;
  106. int next;
  107. spin_lock(&fat12_entry_lock);
  108. if (fatent->entry & 1)
  109. next = (*ent12_p[0] >> 4) | (*ent12_p[1] << 4);
  110. else
  111. next = (*ent12_p[1] << 8) | *ent12_p[0];
  112. spin_unlock(&fat12_entry_lock);
  113. next &= 0x0fff;
  114. if (next >= BAD_FAT12)
  115. next = FAT_ENT_EOF;
  116. return next;
  117. }
  118. static int fat16_ent_get(struct fat_entry *fatent)
  119. {
  120. int next = le16_to_cpu(*fatent->u.ent16_p);
  121. WARN_ON((unsigned long)fatent->u.ent16_p & (2 - 1));
  122. if (next >= BAD_FAT16)
  123. next = FAT_ENT_EOF;
  124. return next;
  125. }
  126. static int fat32_ent_get(struct fat_entry *fatent)
  127. {
  128. int next = le32_to_cpu(*fatent->u.ent32_p) & 0x0fffffff;
  129. WARN_ON((unsigned long)fatent->u.ent32_p & (4 - 1));
  130. if (next >= BAD_FAT32)
  131. next = FAT_ENT_EOF;
  132. return next;
  133. }
  134. static void fat12_ent_put(struct fat_entry *fatent, int new)
  135. {
  136. u8 **ent12_p = fatent->u.ent12_p;
  137. if (new == FAT_ENT_EOF)
  138. new = EOF_FAT12;
  139. spin_lock(&fat12_entry_lock);
  140. if (fatent->entry & 1) {
  141. *ent12_p[0] = (new << 4) | (*ent12_p[0] & 0x0f);
  142. *ent12_p[1] = new >> 4;
  143. } else {
  144. *ent12_p[0] = new & 0xff;
  145. *ent12_p[1] = (*ent12_p[1] & 0xf0) | (new >> 8);
  146. }
  147. spin_unlock(&fat12_entry_lock);
  148. mark_buffer_dirty(fatent->bhs[0]);
  149. if (fatent->nr_bhs == 2)
  150. mark_buffer_dirty(fatent->bhs[1]);
  151. }
  152. static void fat16_ent_put(struct fat_entry *fatent, int new)
  153. {
  154. if (new == FAT_ENT_EOF)
  155. new = EOF_FAT16;
  156. *fatent->u.ent16_p = cpu_to_le16(new);
  157. mark_buffer_dirty(fatent->bhs[0]);
  158. }
  159. static void fat32_ent_put(struct fat_entry *fatent, int new)
  160. {
  161. if (new == FAT_ENT_EOF)
  162. new = EOF_FAT32;
  163. WARN_ON(new & 0xf0000000);
  164. new |= le32_to_cpu(*fatent->u.ent32_p) & ~0x0fffffff;
  165. *fatent->u.ent32_p = cpu_to_le32(new);
  166. mark_buffer_dirty(fatent->bhs[0]);
  167. }
  168. static int fat12_ent_next(struct fat_entry *fatent)
  169. {
  170. u8 **ent12_p = fatent->u.ent12_p;
  171. struct buffer_head **bhs = fatent->bhs;
  172. u8 *nextp = ent12_p[1] + 1 + (fatent->entry & 1);
  173. fatent->entry++;
  174. if (fatent->nr_bhs == 1) {
  175. WARN_ON(ent12_p[0] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 2)));
  176. WARN_ON(ent12_p[1] > (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
  177. if (nextp < (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1))) {
  178. ent12_p[0] = nextp - 1;
  179. ent12_p[1] = nextp;
  180. return 1;
  181. }
  182. } else {
  183. WARN_ON(ent12_p[0] != (u8 *)(bhs[0]->b_data + (bhs[0]->b_size - 1)));
  184. WARN_ON(ent12_p[1] != (u8 *)bhs[1]->b_data);
  185. ent12_p[0] = nextp - 1;
  186. ent12_p[1] = nextp;
  187. brelse(bhs[0]);
  188. bhs[0] = bhs[1];
  189. fatent->nr_bhs = 1;
  190. return 1;
  191. }
  192. ent12_p[0] = NULL;
  193. ent12_p[1] = NULL;
  194. return 0;
  195. }
  196. static int fat16_ent_next(struct fat_entry *fatent)
  197. {
  198. const struct buffer_head *bh = fatent->bhs[0];
  199. fatent->entry++;
  200. if (fatent->u.ent16_p < (__le16 *)(bh->b_data + (bh->b_size - 2))) {
  201. fatent->u.ent16_p++;
  202. return 1;
  203. }
  204. fatent->u.ent16_p = NULL;
  205. return 0;
  206. }
  207. static int fat32_ent_next(struct fat_entry *fatent)
  208. {
  209. const struct buffer_head *bh = fatent->bhs[0];
  210. fatent->entry++;
  211. if (fatent->u.ent32_p < (__le32 *)(bh->b_data + (bh->b_size - 4))) {
  212. fatent->u.ent32_p++;
  213. return 1;
  214. }
  215. fatent->u.ent32_p = NULL;
  216. return 0;
  217. }
  218. static struct fatent_operations fat12_ops = {
  219. .ent_blocknr = fat12_ent_blocknr,
  220. .ent_set_ptr = fat12_ent_set_ptr,
  221. .ent_bread = fat12_ent_bread,
  222. .ent_get = fat12_ent_get,
  223. .ent_put = fat12_ent_put,
  224. .ent_next = fat12_ent_next,
  225. };
  226. static struct fatent_operations fat16_ops = {
  227. .ent_blocknr = fat_ent_blocknr,
  228. .ent_set_ptr = fat16_ent_set_ptr,
  229. .ent_bread = fat_ent_bread,
  230. .ent_get = fat16_ent_get,
  231. .ent_put = fat16_ent_put,
  232. .ent_next = fat16_ent_next,
  233. };
  234. static struct fatent_operations fat32_ops = {
  235. .ent_blocknr = fat_ent_blocknr,
  236. .ent_set_ptr = fat32_ent_set_ptr,
  237. .ent_bread = fat_ent_bread,
  238. .ent_get = fat32_ent_get,
  239. .ent_put = fat32_ent_put,
  240. .ent_next = fat32_ent_next,
  241. };
  242. static inline void lock_fat(struct msdos_sb_info *sbi)
  243. {
  244. mutex_lock(&sbi->fat_lock);
  245. }
  246. static inline void unlock_fat(struct msdos_sb_info *sbi)
  247. {
  248. mutex_unlock(&sbi->fat_lock);
  249. }
  250. void fat_ent_access_init(struct super_block *sb)
  251. {
  252. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  253. mutex_init(&sbi->fat_lock);
  254. switch (sbi->fat_bits) {
  255. case 32:
  256. sbi->fatent_shift = 2;
  257. sbi->fatent_ops = &fat32_ops;
  258. break;
  259. case 16:
  260. sbi->fatent_shift = 1;
  261. sbi->fatent_ops = &fat16_ops;
  262. break;
  263. case 12:
  264. sbi->fatent_shift = -1;
  265. sbi->fatent_ops = &fat12_ops;
  266. break;
  267. }
  268. }
  269. static inline int fat_ent_update_ptr(struct super_block *sb,
  270. struct fat_entry *fatent,
  271. int offset, sector_t blocknr)
  272. {
  273. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  274. struct fatent_operations *ops = sbi->fatent_ops;
  275. struct buffer_head **bhs = fatent->bhs;
  276. /* Is this fatent's blocks including this entry? */
  277. if (!fatent->nr_bhs || bhs[0]->b_blocknr != blocknr)
  278. return 0;
  279. /* Does this entry need the next block? */
  280. if (sbi->fat_bits == 12 && (offset + 1) >= sb->s_blocksize) {
  281. if (fatent->nr_bhs != 2 || bhs[1]->b_blocknr != (blocknr + 1))
  282. return 0;
  283. }
  284. ops->ent_set_ptr(fatent, offset);
  285. return 1;
  286. }
  287. int fat_ent_read(struct inode *inode, struct fat_entry *fatent, int entry)
  288. {
  289. struct super_block *sb = inode->i_sb;
  290. struct msdos_sb_info *sbi = MSDOS_SB(inode->i_sb);
  291. struct fatent_operations *ops = sbi->fatent_ops;
  292. int err, offset;
  293. sector_t blocknr;
  294. if (entry < FAT_START_ENT || sbi->max_cluster <= entry) {
  295. fatent_brelse(fatent);
  296. fat_fs_panic(sb, "invalid access to FAT (entry 0x%08x)", entry);
  297. return -EIO;
  298. }
  299. fatent_set_entry(fatent, entry);
  300. ops->ent_blocknr(sb, entry, &offset, &blocknr);
  301. if (!fat_ent_update_ptr(sb, fatent, offset, blocknr)) {
  302. fatent_brelse(fatent);
  303. err = ops->ent_bread(sb, fatent, offset, blocknr);
  304. if (err)
  305. return err;
  306. }
  307. return ops->ent_get(fatent);
  308. }
  309. /* FIXME: We can write the blocks as more big chunk. */
  310. static int fat_mirror_bhs(struct super_block *sb, struct buffer_head **bhs,
  311. int nr_bhs)
  312. {
  313. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  314. struct buffer_head *c_bh;
  315. int err, n, copy;
  316. err = 0;
  317. for (copy = 1; copy < sbi->fats; copy++) {
  318. sector_t backup_fat = sbi->fat_length * copy;
  319. for (n = 0; n < nr_bhs; n++) {
  320. c_bh = sb_getblk(sb, backup_fat + bhs[n]->b_blocknr);
  321. if (!c_bh) {
  322. err = -ENOMEM;
  323. goto error;
  324. }
  325. memcpy(c_bh->b_data, bhs[n]->b_data, sb->s_blocksize);
  326. set_buffer_uptodate(c_bh);
  327. mark_buffer_dirty(c_bh);
  328. if (sb->s_flags & MS_SYNCHRONOUS)
  329. err = sync_dirty_buffer(c_bh);
  330. brelse(c_bh);
  331. if (err)
  332. goto error;
  333. }
  334. }
  335. error:
  336. return err;
  337. }
  338. int fat_ent_write(struct inode *inode, struct fat_entry *fatent,
  339. int new, int wait)
  340. {
  341. struct super_block *sb = inode->i_sb;
  342. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  343. int err;
  344. ops->ent_put(fatent, new);
  345. if (wait) {
  346. err = fat_sync_bhs(fatent->bhs, fatent->nr_bhs);
  347. if (err)
  348. return err;
  349. }
  350. return fat_mirror_bhs(sb, fatent->bhs, fatent->nr_bhs);
  351. }
  352. static inline int fat_ent_next(struct msdos_sb_info *sbi,
  353. struct fat_entry *fatent)
  354. {
  355. if (sbi->fatent_ops->ent_next(fatent)) {
  356. if (fatent->entry < sbi->max_cluster)
  357. return 1;
  358. }
  359. return 0;
  360. }
  361. static inline int fat_ent_read_block(struct super_block *sb,
  362. struct fat_entry *fatent)
  363. {
  364. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  365. sector_t blocknr;
  366. int offset;
  367. fatent_brelse(fatent);
  368. ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
  369. return ops->ent_bread(sb, fatent, offset, blocknr);
  370. }
  371. static void fat_collect_bhs(struct buffer_head **bhs, int *nr_bhs,
  372. struct fat_entry *fatent)
  373. {
  374. int n, i;
  375. for (n = 0; n < fatent->nr_bhs; n++) {
  376. for (i = 0; i < *nr_bhs; i++) {
  377. if (fatent->bhs[n] == bhs[i])
  378. break;
  379. }
  380. if (i == *nr_bhs) {
  381. get_bh(fatent->bhs[n]);
  382. bhs[i] = fatent->bhs[n];
  383. (*nr_bhs)++;
  384. }
  385. }
  386. }
  387. int fat_alloc_clusters(struct inode *inode, int *cluster, int nr_cluster)
  388. {
  389. struct super_block *sb = inode->i_sb;
  390. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  391. struct fatent_operations *ops = sbi->fatent_ops;
  392. struct fat_entry fatent, prev_ent;
  393. struct buffer_head *bhs[MAX_BUF_PER_PAGE];
  394. int i, count, err, nr_bhs, idx_clus;
  395. BUG_ON(nr_cluster > (MAX_BUF_PER_PAGE / 2)); /* fixed limit */
  396. lock_fat(sbi);
  397. if (sbi->free_clusters != -1 && sbi->free_clus_valid &&
  398. sbi->free_clusters < nr_cluster) {
  399. unlock_fat(sbi);
  400. return -ENOSPC;
  401. }
  402. err = nr_bhs = idx_clus = 0;
  403. count = FAT_START_ENT;
  404. fatent_init(&prev_ent);
  405. fatent_init(&fatent);
  406. fatent_set_entry(&fatent, sbi->prev_free + 1);
  407. while (count < sbi->max_cluster) {
  408. if (fatent.entry >= sbi->max_cluster)
  409. fatent.entry = FAT_START_ENT;
  410. fatent_set_entry(&fatent, fatent.entry);
  411. err = fat_ent_read_block(sb, &fatent);
  412. if (err)
  413. goto out;
  414. /* Find the free entries in a block */
  415. do {
  416. if (ops->ent_get(&fatent) == FAT_ENT_FREE) {
  417. int entry = fatent.entry;
  418. /* make the cluster chain */
  419. ops->ent_put(&fatent, FAT_ENT_EOF);
  420. if (prev_ent.nr_bhs)
  421. ops->ent_put(&prev_ent, entry);
  422. fat_collect_bhs(bhs, &nr_bhs, &fatent);
  423. sbi->prev_free = entry;
  424. if (sbi->free_clusters != -1)
  425. sbi->free_clusters--;
  426. sb->s_dirt = 1;
  427. cluster[idx_clus] = entry;
  428. idx_clus++;
  429. if (idx_clus == nr_cluster)
  430. goto out;
  431. /*
  432. * fat_collect_bhs() gets ref-count of bhs,
  433. * so we can still use the prev_ent.
  434. */
  435. prev_ent = fatent;
  436. }
  437. count++;
  438. if (count == sbi->max_cluster)
  439. break;
  440. } while (fat_ent_next(sbi, &fatent));
  441. }
  442. /* Couldn't allocate the free entries */
  443. sbi->free_clusters = 0;
  444. sbi->free_clus_valid = 1;
  445. sb->s_dirt = 1;
  446. err = -ENOSPC;
  447. out:
  448. unlock_fat(sbi);
  449. fatent_brelse(&fatent);
  450. if (!err) {
  451. if (inode_needs_sync(inode))
  452. err = fat_sync_bhs(bhs, nr_bhs);
  453. if (!err)
  454. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  455. }
  456. for (i = 0; i < nr_bhs; i++)
  457. brelse(bhs[i]);
  458. if (err && idx_clus)
  459. fat_free_clusters(inode, cluster[0]);
  460. return err;
  461. }
  462. int fat_free_clusters(struct inode *inode, int cluster)
  463. {
  464. struct super_block *sb = inode->i_sb;
  465. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  466. struct fatent_operations *ops = sbi->fatent_ops;
  467. struct fat_entry fatent;
  468. struct buffer_head *bhs[MAX_BUF_PER_PAGE];
  469. int i, err, nr_bhs;
  470. int first_cl = cluster;
  471. nr_bhs = 0;
  472. fatent_init(&fatent);
  473. lock_fat(sbi);
  474. do {
  475. cluster = fat_ent_read(inode, &fatent, cluster);
  476. if (cluster < 0) {
  477. err = cluster;
  478. goto error;
  479. } else if (cluster == FAT_ENT_FREE) {
  480. fat_fs_panic(sb, "%s: deleting FAT entry beyond EOF",
  481. __func__);
  482. err = -EIO;
  483. goto error;
  484. }
  485. /*
  486. * Issue discard for the sectors we no longer care about,
  487. * batching contiguous clusters into one request
  488. */
  489. if (cluster != fatent.entry + 1) {
  490. int nr_clus = fatent.entry - first_cl + 1;
  491. sb_issue_discard(sb, fat_clus_to_blknr(sbi, first_cl),
  492. nr_clus * sbi->sec_per_clus);
  493. first_cl = cluster;
  494. }
  495. ops->ent_put(&fatent, FAT_ENT_FREE);
  496. if (sbi->free_clusters != -1) {
  497. sbi->free_clusters++;
  498. sb->s_dirt = 1;
  499. }
  500. if (nr_bhs + fatent.nr_bhs > MAX_BUF_PER_PAGE) {
  501. if (sb->s_flags & MS_SYNCHRONOUS) {
  502. err = fat_sync_bhs(bhs, nr_bhs);
  503. if (err)
  504. goto error;
  505. }
  506. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  507. if (err)
  508. goto error;
  509. for (i = 0; i < nr_bhs; i++)
  510. brelse(bhs[i]);
  511. nr_bhs = 0;
  512. }
  513. fat_collect_bhs(bhs, &nr_bhs, &fatent);
  514. } while (cluster != FAT_ENT_EOF);
  515. if (sb->s_flags & MS_SYNCHRONOUS) {
  516. err = fat_sync_bhs(bhs, nr_bhs);
  517. if (err)
  518. goto error;
  519. }
  520. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  521. error:
  522. fatent_brelse(&fatent);
  523. for (i = 0; i < nr_bhs; i++)
  524. brelse(bhs[i]);
  525. unlock_fat(sbi);
  526. return err;
  527. }
  528. EXPORT_SYMBOL_GPL(fat_free_clusters);
  529. /* 128kb is the whole sectors for FAT12 and FAT16 */
  530. #define FAT_READA_SIZE (128 * 1024)
  531. static void fat_ent_reada(struct super_block *sb, struct fat_entry *fatent,
  532. unsigned long reada_blocks)
  533. {
  534. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  535. sector_t blocknr;
  536. int i, offset;
  537. ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
  538. for (i = 0; i < reada_blocks; i++)
  539. sb_breadahead(sb, blocknr + i);
  540. }
  541. int fat_count_free_clusters(struct super_block *sb)
  542. {
  543. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  544. struct fatent_operations *ops = sbi->fatent_ops;
  545. struct fat_entry fatent;
  546. unsigned long reada_blocks, reada_mask, cur_block;
  547. int err = 0, free;
  548. lock_fat(sbi);
  549. if (sbi->free_clusters != -1 && sbi->free_clus_valid)
  550. goto out;
  551. reada_blocks = FAT_READA_SIZE >> sb->s_blocksize_bits;
  552. reada_mask = reada_blocks - 1;
  553. cur_block = 0;
  554. free = 0;
  555. fatent_init(&fatent);
  556. fatent_set_entry(&fatent, FAT_START_ENT);
  557. while (fatent.entry < sbi->max_cluster) {
  558. /* readahead of fat blocks */
  559. if ((cur_block & reada_mask) == 0) {
  560. unsigned long rest = sbi->fat_length - cur_block;
  561. fat_ent_reada(sb, &fatent, min(reada_blocks, rest));
  562. }
  563. cur_block++;
  564. err = fat_ent_read_block(sb, &fatent);
  565. if (err)
  566. goto out;
  567. do {
  568. if (ops->ent_get(&fatent) == FAT_ENT_FREE)
  569. free++;
  570. } while (fat_ent_next(sbi, &fatent));
  571. }
  572. sbi->free_clusters = free;
  573. sbi->free_clus_valid = 1;
  574. sb->s_dirt = 1;
  575. fatent_brelse(&fatent);
  576. out:
  577. unlock_fat(sbi);
  578. return err;
  579. }