fatent.c 16 KB

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