fatent.c 17 KB

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