fatent.c 16 KB

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