fatent.c 14 KB

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