fatent.c 15 KB

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