fatent.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676
  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", (llu)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. (llu)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. if (sbi->fat_bits == 12) {
  279. if ((offset + 1) < sb->s_blocksize) {
  280. /* This entry is on bhs[0]. */
  281. if (fatent->nr_bhs == 2) {
  282. brelse(bhs[1]);
  283. fatent->nr_bhs = 1;
  284. }
  285. } else {
  286. /* This entry needs the next block. */
  287. if (fatent->nr_bhs != 2)
  288. return 0;
  289. if (bhs[1]->b_blocknr != (blocknr + 1))
  290. return 0;
  291. }
  292. }
  293. ops->ent_set_ptr(fatent, offset);
  294. return 1;
  295. }
  296. int fat_ent_read(struct inode *inode, struct fat_entry *fatent, int entry)
  297. {
  298. struct super_block *sb = inode->i_sb;
  299. struct msdos_sb_info *sbi = MSDOS_SB(inode->i_sb);
  300. struct fatent_operations *ops = sbi->fatent_ops;
  301. int err, offset;
  302. sector_t blocknr;
  303. if (entry < FAT_START_ENT || sbi->max_cluster <= entry) {
  304. fatent_brelse(fatent);
  305. fat_fs_panic(sb, "invalid access to FAT (entry 0x%08x)", entry);
  306. return -EIO;
  307. }
  308. fatent_set_entry(fatent, entry);
  309. ops->ent_blocknr(sb, entry, &offset, &blocknr);
  310. if (!fat_ent_update_ptr(sb, fatent, offset, blocknr)) {
  311. fatent_brelse(fatent);
  312. err = ops->ent_bread(sb, fatent, offset, blocknr);
  313. if (err)
  314. return err;
  315. }
  316. return ops->ent_get(fatent);
  317. }
  318. /* FIXME: We can write the blocks as more big chunk. */
  319. static int fat_mirror_bhs(struct super_block *sb, struct buffer_head **bhs,
  320. int nr_bhs)
  321. {
  322. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  323. struct buffer_head *c_bh;
  324. int err, n, copy;
  325. err = 0;
  326. for (copy = 1; copy < sbi->fats; copy++) {
  327. sector_t backup_fat = sbi->fat_length * copy;
  328. for (n = 0; n < nr_bhs; n++) {
  329. c_bh = sb_getblk(sb, backup_fat + bhs[n]->b_blocknr);
  330. if (!c_bh) {
  331. err = -ENOMEM;
  332. goto error;
  333. }
  334. memcpy(c_bh->b_data, bhs[n]->b_data, sb->s_blocksize);
  335. set_buffer_uptodate(c_bh);
  336. mark_buffer_dirty(c_bh);
  337. if (sb->s_flags & MS_SYNCHRONOUS)
  338. err = sync_dirty_buffer(c_bh);
  339. brelse(c_bh);
  340. if (err)
  341. goto error;
  342. }
  343. }
  344. error:
  345. return err;
  346. }
  347. int fat_ent_write(struct inode *inode, struct fat_entry *fatent,
  348. int new, int wait)
  349. {
  350. struct super_block *sb = inode->i_sb;
  351. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  352. int err;
  353. ops->ent_put(fatent, new);
  354. if (wait) {
  355. err = fat_sync_bhs(fatent->bhs, fatent->nr_bhs);
  356. if (err)
  357. return err;
  358. }
  359. return fat_mirror_bhs(sb, fatent->bhs, fatent->nr_bhs);
  360. }
  361. static inline int fat_ent_next(struct msdos_sb_info *sbi,
  362. struct fat_entry *fatent)
  363. {
  364. if (sbi->fatent_ops->ent_next(fatent)) {
  365. if (fatent->entry < sbi->max_cluster)
  366. return 1;
  367. }
  368. return 0;
  369. }
  370. static inline int fat_ent_read_block(struct super_block *sb,
  371. struct fat_entry *fatent)
  372. {
  373. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  374. sector_t blocknr;
  375. int offset;
  376. fatent_brelse(fatent);
  377. ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
  378. return ops->ent_bread(sb, fatent, offset, blocknr);
  379. }
  380. static void fat_collect_bhs(struct buffer_head **bhs, int *nr_bhs,
  381. struct fat_entry *fatent)
  382. {
  383. int n, i;
  384. for (n = 0; n < fatent->nr_bhs; n++) {
  385. for (i = 0; i < *nr_bhs; i++) {
  386. if (fatent->bhs[n] == bhs[i])
  387. break;
  388. }
  389. if (i == *nr_bhs) {
  390. get_bh(fatent->bhs[n]);
  391. bhs[i] = fatent->bhs[n];
  392. (*nr_bhs)++;
  393. }
  394. }
  395. }
  396. int fat_alloc_clusters(struct inode *inode, int *cluster, int nr_cluster)
  397. {
  398. struct super_block *sb = inode->i_sb;
  399. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  400. struct fatent_operations *ops = sbi->fatent_ops;
  401. struct fat_entry fatent, prev_ent;
  402. struct buffer_head *bhs[MAX_BUF_PER_PAGE];
  403. int i, count, err, nr_bhs, idx_clus;
  404. BUG_ON(nr_cluster > (MAX_BUF_PER_PAGE / 2)); /* fixed limit */
  405. lock_fat(sbi);
  406. if (sbi->free_clusters != -1 && sbi->free_clus_valid &&
  407. sbi->free_clusters < nr_cluster) {
  408. unlock_fat(sbi);
  409. return -ENOSPC;
  410. }
  411. err = nr_bhs = idx_clus = 0;
  412. count = FAT_START_ENT;
  413. fatent_init(&prev_ent);
  414. fatent_init(&fatent);
  415. fatent_set_entry(&fatent, sbi->prev_free + 1);
  416. while (count < sbi->max_cluster) {
  417. if (fatent.entry >= sbi->max_cluster)
  418. fatent.entry = FAT_START_ENT;
  419. fatent_set_entry(&fatent, fatent.entry);
  420. err = fat_ent_read_block(sb, &fatent);
  421. if (err)
  422. goto out;
  423. /* Find the free entries in a block */
  424. do {
  425. if (ops->ent_get(&fatent) == FAT_ENT_FREE) {
  426. int entry = fatent.entry;
  427. /* make the cluster chain */
  428. ops->ent_put(&fatent, FAT_ENT_EOF);
  429. if (prev_ent.nr_bhs)
  430. ops->ent_put(&prev_ent, entry);
  431. fat_collect_bhs(bhs, &nr_bhs, &fatent);
  432. sbi->prev_free = entry;
  433. if (sbi->free_clusters != -1)
  434. sbi->free_clusters--;
  435. sb->s_dirt = 1;
  436. cluster[idx_clus] = entry;
  437. idx_clus++;
  438. if (idx_clus == nr_cluster)
  439. goto out;
  440. /*
  441. * fat_collect_bhs() gets ref-count of bhs,
  442. * so we can still use the prev_ent.
  443. */
  444. prev_ent = fatent;
  445. }
  446. count++;
  447. if (count == sbi->max_cluster)
  448. break;
  449. } while (fat_ent_next(sbi, &fatent));
  450. }
  451. /* Couldn't allocate the free entries */
  452. sbi->free_clusters = 0;
  453. sbi->free_clus_valid = 1;
  454. sb->s_dirt = 1;
  455. err = -ENOSPC;
  456. out:
  457. unlock_fat(sbi);
  458. fatent_brelse(&fatent);
  459. if (!err) {
  460. if (inode_needs_sync(inode))
  461. err = fat_sync_bhs(bhs, nr_bhs);
  462. if (!err)
  463. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  464. }
  465. for (i = 0; i < nr_bhs; i++)
  466. brelse(bhs[i]);
  467. if (err && idx_clus)
  468. fat_free_clusters(inode, cluster[0]);
  469. return err;
  470. }
  471. int fat_free_clusters(struct inode *inode, int cluster)
  472. {
  473. struct super_block *sb = inode->i_sb;
  474. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  475. struct fatent_operations *ops = sbi->fatent_ops;
  476. struct fat_entry fatent;
  477. struct buffer_head *bhs[MAX_BUF_PER_PAGE];
  478. int i, err, nr_bhs;
  479. int first_cl = cluster;
  480. nr_bhs = 0;
  481. fatent_init(&fatent);
  482. lock_fat(sbi);
  483. do {
  484. cluster = fat_ent_read(inode, &fatent, cluster);
  485. if (cluster < 0) {
  486. err = cluster;
  487. goto error;
  488. } else if (cluster == FAT_ENT_FREE) {
  489. fat_fs_panic(sb, "%s: deleting FAT entry beyond EOF",
  490. __func__);
  491. err = -EIO;
  492. goto error;
  493. }
  494. /*
  495. * Issue discard for the sectors we no longer care about,
  496. * batching contiguous clusters into one request
  497. */
  498. if (cluster != fatent.entry + 1) {
  499. int nr_clus = fatent.entry - first_cl + 1;
  500. sb_issue_discard(sb, fat_clus_to_blknr(sbi, first_cl),
  501. nr_clus * sbi->sec_per_clus);
  502. first_cl = cluster;
  503. }
  504. ops->ent_put(&fatent, FAT_ENT_FREE);
  505. if (sbi->free_clusters != -1) {
  506. sbi->free_clusters++;
  507. sb->s_dirt = 1;
  508. }
  509. if (nr_bhs + fatent.nr_bhs > MAX_BUF_PER_PAGE) {
  510. if (sb->s_flags & MS_SYNCHRONOUS) {
  511. err = fat_sync_bhs(bhs, nr_bhs);
  512. if (err)
  513. goto error;
  514. }
  515. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  516. if (err)
  517. goto error;
  518. for (i = 0; i < nr_bhs; i++)
  519. brelse(bhs[i]);
  520. nr_bhs = 0;
  521. }
  522. fat_collect_bhs(bhs, &nr_bhs, &fatent);
  523. } while (cluster != FAT_ENT_EOF);
  524. if (sb->s_flags & MS_SYNCHRONOUS) {
  525. err = fat_sync_bhs(bhs, nr_bhs);
  526. if (err)
  527. goto error;
  528. }
  529. err = fat_mirror_bhs(sb, bhs, nr_bhs);
  530. error:
  531. fatent_brelse(&fatent);
  532. for (i = 0; i < nr_bhs; i++)
  533. brelse(bhs[i]);
  534. unlock_fat(sbi);
  535. return err;
  536. }
  537. EXPORT_SYMBOL_GPL(fat_free_clusters);
  538. /* 128kb is the whole sectors for FAT12 and FAT16 */
  539. #define FAT_READA_SIZE (128 * 1024)
  540. static void fat_ent_reada(struct super_block *sb, struct fat_entry *fatent,
  541. unsigned long reada_blocks)
  542. {
  543. struct fatent_operations *ops = MSDOS_SB(sb)->fatent_ops;
  544. sector_t blocknr;
  545. int i, offset;
  546. ops->ent_blocknr(sb, fatent->entry, &offset, &blocknr);
  547. for (i = 0; i < reada_blocks; i++)
  548. sb_breadahead(sb, blocknr + i);
  549. }
  550. int fat_count_free_clusters(struct super_block *sb)
  551. {
  552. struct msdos_sb_info *sbi = MSDOS_SB(sb);
  553. struct fatent_operations *ops = sbi->fatent_ops;
  554. struct fat_entry fatent;
  555. unsigned long reada_blocks, reada_mask, cur_block;
  556. int err = 0, free;
  557. lock_fat(sbi);
  558. if (sbi->free_clusters != -1 && sbi->free_clus_valid)
  559. goto out;
  560. reada_blocks = FAT_READA_SIZE >> sb->s_blocksize_bits;
  561. reada_mask = reada_blocks - 1;
  562. cur_block = 0;
  563. free = 0;
  564. fatent_init(&fatent);
  565. fatent_set_entry(&fatent, FAT_START_ENT);
  566. while (fatent.entry < sbi->max_cluster) {
  567. /* readahead of fat blocks */
  568. if ((cur_block & reada_mask) == 0) {
  569. unsigned long rest = sbi->fat_length - cur_block;
  570. fat_ent_reada(sb, &fatent, min(reada_blocks, rest));
  571. }
  572. cur_block++;
  573. err = fat_ent_read_block(sb, &fatent);
  574. if (err)
  575. goto out;
  576. do {
  577. if (ops->ent_get(&fatent) == FAT_ENT_FREE)
  578. free++;
  579. } while (fat_ent_next(sbi, &fatent));
  580. }
  581. sbi->free_clusters = free;
  582. sbi->free_clus_valid = 1;
  583. sb->s_dirt = 1;
  584. fatent_brelse(&fatent);
  585. out:
  586. unlock_fat(sbi);
  587. return err;
  588. }