balloc.c 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881
  1. /*
  2. * linux/fs/ext4/balloc.c
  3. *
  4. * Copyright (C) 1992, 1993, 1994, 1995
  5. * Remy Card (card@masi.ibp.fr)
  6. * Laboratoire MASI - Institut Blaise Pascal
  7. * Universite Pierre et Marie Curie (Paris VI)
  8. *
  9. * Enhanced block allocation by Stephen Tweedie (sct@redhat.com), 1993
  10. * Big-endian to little-endian byte-swapping/bitmaps by
  11. * David S. Miller (davem@caip.rutgers.edu), 1995
  12. */
  13. #include <linux/time.h>
  14. #include <linux/capability.h>
  15. #include <linux/fs.h>
  16. #include <linux/jbd2.h>
  17. #include <linux/quotaops.h>
  18. #include <linux/buffer_head.h>
  19. #include "ext4.h"
  20. #include "ext4_jbd2.h"
  21. #include "mballoc.h"
  22. #include <trace/events/ext4.h>
  23. static unsigned ext4_num_base_meta_clusters(struct super_block *sb,
  24. ext4_group_t block_group);
  25. /*
  26. * balloc.c contains the blocks allocation and deallocation routines
  27. */
  28. /*
  29. * Calculate block group number for a given block number
  30. */
  31. ext4_group_t ext4_get_group_number(struct super_block *sb,
  32. ext4_fsblk_t block)
  33. {
  34. ext4_group_t group;
  35. if (test_opt2(sb, STD_GROUP_SIZE))
  36. group = (block -
  37. le32_to_cpu(EXT4_SB(sb)->s_es->s_first_data_block)) >>
  38. (EXT4_BLOCK_SIZE_BITS(sb) + EXT4_CLUSTER_BITS(sb) + 3);
  39. else
  40. ext4_get_group_no_and_offset(sb, block, &group, NULL);
  41. return group;
  42. }
  43. /*
  44. * Calculate the block group number and offset into the block/cluster
  45. * allocation bitmap, given a block number
  46. */
  47. void ext4_get_group_no_and_offset(struct super_block *sb, ext4_fsblk_t blocknr,
  48. ext4_group_t *blockgrpp, ext4_grpblk_t *offsetp)
  49. {
  50. struct ext4_super_block *es = EXT4_SB(sb)->s_es;
  51. ext4_grpblk_t offset;
  52. blocknr = blocknr - le32_to_cpu(es->s_first_data_block);
  53. offset = do_div(blocknr, EXT4_BLOCKS_PER_GROUP(sb)) >>
  54. EXT4_SB(sb)->s_cluster_bits;
  55. if (offsetp)
  56. *offsetp = offset;
  57. if (blockgrpp)
  58. *blockgrpp = blocknr;
  59. }
  60. /*
  61. * Check whether the 'block' lives within the 'block_group'. Returns 1 if so
  62. * and 0 otherwise.
  63. */
  64. static inline int ext4_block_in_group(struct super_block *sb,
  65. ext4_fsblk_t block,
  66. ext4_group_t block_group)
  67. {
  68. ext4_group_t actual_group;
  69. actual_group = ext4_get_group_number(sb, block);
  70. return (actual_group == block_group) ? 1 : 0;
  71. }
  72. /* Return the number of clusters used for file system metadata; this
  73. * represents the overhead needed by the file system.
  74. */
  75. static unsigned ext4_num_overhead_clusters(struct super_block *sb,
  76. ext4_group_t block_group,
  77. struct ext4_group_desc *gdp)
  78. {
  79. unsigned num_clusters;
  80. int block_cluster = -1, inode_cluster = -1, itbl_cluster = -1, i, c;
  81. ext4_fsblk_t start = ext4_group_first_block_no(sb, block_group);
  82. ext4_fsblk_t itbl_blk;
  83. struct ext4_sb_info *sbi = EXT4_SB(sb);
  84. /* This is the number of clusters used by the superblock,
  85. * block group descriptors, and reserved block group
  86. * descriptor blocks */
  87. num_clusters = ext4_num_base_meta_clusters(sb, block_group);
  88. /*
  89. * For the allocation bitmaps and inode table, we first need
  90. * to check to see if the block is in the block group. If it
  91. * is, then check to see if the cluster is already accounted
  92. * for in the clusters used for the base metadata cluster, or
  93. * if we can increment the base metadata cluster to include
  94. * that block. Otherwise, we will have to track the cluster
  95. * used for the allocation bitmap or inode table explicitly.
  96. * Normally all of these blocks are contiguous, so the special
  97. * case handling shouldn't be necessary except for *very*
  98. * unusual file system layouts.
  99. */
  100. if (ext4_block_in_group(sb, ext4_block_bitmap(sb, gdp), block_group)) {
  101. block_cluster = EXT4_B2C(sbi,
  102. ext4_block_bitmap(sb, gdp) - start);
  103. if (block_cluster < num_clusters)
  104. block_cluster = -1;
  105. else if (block_cluster == num_clusters) {
  106. num_clusters++;
  107. block_cluster = -1;
  108. }
  109. }
  110. if (ext4_block_in_group(sb, ext4_inode_bitmap(sb, gdp), block_group)) {
  111. inode_cluster = EXT4_B2C(sbi,
  112. ext4_inode_bitmap(sb, gdp) - start);
  113. if (inode_cluster < num_clusters)
  114. inode_cluster = -1;
  115. else if (inode_cluster == num_clusters) {
  116. num_clusters++;
  117. inode_cluster = -1;
  118. }
  119. }
  120. itbl_blk = ext4_inode_table(sb, gdp);
  121. for (i = 0; i < sbi->s_itb_per_group; i++) {
  122. if (ext4_block_in_group(sb, itbl_blk + i, block_group)) {
  123. c = EXT4_B2C(sbi, itbl_blk + i - start);
  124. if ((c < num_clusters) || (c == inode_cluster) ||
  125. (c == block_cluster) || (c == itbl_cluster))
  126. continue;
  127. if (c == num_clusters) {
  128. num_clusters++;
  129. continue;
  130. }
  131. num_clusters++;
  132. itbl_cluster = c;
  133. }
  134. }
  135. if (block_cluster != -1)
  136. num_clusters++;
  137. if (inode_cluster != -1)
  138. num_clusters++;
  139. return num_clusters;
  140. }
  141. static unsigned int num_clusters_in_group(struct super_block *sb,
  142. ext4_group_t block_group)
  143. {
  144. unsigned int blocks;
  145. if (block_group == ext4_get_groups_count(sb) - 1) {
  146. /*
  147. * Even though mke2fs always initializes the first and
  148. * last group, just in case some other tool was used,
  149. * we need to make sure we calculate the right free
  150. * blocks.
  151. */
  152. blocks = ext4_blocks_count(EXT4_SB(sb)->s_es) -
  153. ext4_group_first_block_no(sb, block_group);
  154. } else
  155. blocks = EXT4_BLOCKS_PER_GROUP(sb);
  156. return EXT4_NUM_B2C(EXT4_SB(sb), blocks);
  157. }
  158. /* Initializes an uninitialized block bitmap */
  159. static void ext4_init_block_bitmap(struct super_block *sb,
  160. struct buffer_head *bh,
  161. ext4_group_t block_group,
  162. struct ext4_group_desc *gdp)
  163. {
  164. unsigned int bit, bit_max;
  165. struct ext4_sb_info *sbi = EXT4_SB(sb);
  166. ext4_fsblk_t start, tmp;
  167. int flex_bg = 0;
  168. struct ext4_group_info *grp;
  169. J_ASSERT_BH(bh, buffer_locked(bh));
  170. /* If checksum is bad mark all blocks used to prevent allocation
  171. * essentially implementing a per-group read-only flag. */
  172. if (!ext4_group_desc_csum_verify(sb, block_group, gdp)) {
  173. ext4_error(sb, "Checksum bad for group %u", block_group);
  174. grp = ext4_get_group_info(sb, block_group);
  175. if (!EXT4_MB_GRP_BBITMAP_CORRUPT(grp))
  176. percpu_counter_sub(&sbi->s_freeclusters_counter,
  177. grp->bb_free);
  178. set_bit(EXT4_GROUP_INFO_BBITMAP_CORRUPT_BIT, &grp->bb_state);
  179. if (!EXT4_MB_GRP_IBITMAP_CORRUPT(grp)) {
  180. int count;
  181. count = ext4_free_inodes_count(sb, gdp);
  182. percpu_counter_sub(&sbi->s_freeinodes_counter,
  183. count);
  184. }
  185. set_bit(EXT4_GROUP_INFO_IBITMAP_CORRUPT_BIT, &grp->bb_state);
  186. return;
  187. }
  188. memset(bh->b_data, 0, sb->s_blocksize);
  189. bit_max = ext4_num_base_meta_clusters(sb, block_group);
  190. for (bit = 0; bit < bit_max; bit++)
  191. ext4_set_bit(bit, bh->b_data);
  192. start = ext4_group_first_block_no(sb, block_group);
  193. if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_FLEX_BG))
  194. flex_bg = 1;
  195. /* Set bits for block and inode bitmaps, and inode table */
  196. tmp = ext4_block_bitmap(sb, gdp);
  197. if (!flex_bg || ext4_block_in_group(sb, tmp, block_group))
  198. ext4_set_bit(EXT4_B2C(sbi, tmp - start), bh->b_data);
  199. tmp = ext4_inode_bitmap(sb, gdp);
  200. if (!flex_bg || ext4_block_in_group(sb, tmp, block_group))
  201. ext4_set_bit(EXT4_B2C(sbi, tmp - start), bh->b_data);
  202. tmp = ext4_inode_table(sb, gdp);
  203. for (; tmp < ext4_inode_table(sb, gdp) +
  204. sbi->s_itb_per_group; tmp++) {
  205. if (!flex_bg || ext4_block_in_group(sb, tmp, block_group))
  206. ext4_set_bit(EXT4_B2C(sbi, tmp - start), bh->b_data);
  207. }
  208. /*
  209. * Also if the number of blocks within the group is less than
  210. * the blocksize * 8 ( which is the size of bitmap ), set rest
  211. * of the block bitmap to 1
  212. */
  213. ext4_mark_bitmap_end(num_clusters_in_group(sb, block_group),
  214. sb->s_blocksize * 8, bh->b_data);
  215. ext4_block_bitmap_csum_set(sb, block_group, gdp, bh);
  216. ext4_group_desc_csum_set(sb, block_group, gdp);
  217. }
  218. /* Return the number of free blocks in a block group. It is used when
  219. * the block bitmap is uninitialized, so we can't just count the bits
  220. * in the bitmap. */
  221. unsigned ext4_free_clusters_after_init(struct super_block *sb,
  222. ext4_group_t block_group,
  223. struct ext4_group_desc *gdp)
  224. {
  225. return num_clusters_in_group(sb, block_group) -
  226. ext4_num_overhead_clusters(sb, block_group, gdp);
  227. }
  228. /*
  229. * The free blocks are managed by bitmaps. A file system contains several
  230. * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
  231. * block for inodes, N blocks for the inode table and data blocks.
  232. *
  233. * The file system contains group descriptors which are located after the
  234. * super block. Each descriptor contains the number of the bitmap block and
  235. * the free blocks count in the block. The descriptors are loaded in memory
  236. * when a file system is mounted (see ext4_fill_super).
  237. */
  238. /**
  239. * ext4_get_group_desc() -- load group descriptor from disk
  240. * @sb: super block
  241. * @block_group: given block group
  242. * @bh: pointer to the buffer head to store the block
  243. * group descriptor
  244. */
  245. struct ext4_group_desc * ext4_get_group_desc(struct super_block *sb,
  246. ext4_group_t block_group,
  247. struct buffer_head **bh)
  248. {
  249. unsigned int group_desc;
  250. unsigned int offset;
  251. ext4_group_t ngroups = ext4_get_groups_count(sb);
  252. struct ext4_group_desc *desc;
  253. struct ext4_sb_info *sbi = EXT4_SB(sb);
  254. if (block_group >= ngroups) {
  255. ext4_error(sb, "block_group >= groups_count - block_group = %u,"
  256. " groups_count = %u", block_group, ngroups);
  257. return NULL;
  258. }
  259. group_desc = block_group >> EXT4_DESC_PER_BLOCK_BITS(sb);
  260. offset = block_group & (EXT4_DESC_PER_BLOCK(sb) - 1);
  261. if (!sbi->s_group_desc[group_desc]) {
  262. ext4_error(sb, "Group descriptor not loaded - "
  263. "block_group = %u, group_desc = %u, desc = %u",
  264. block_group, group_desc, offset);
  265. return NULL;
  266. }
  267. desc = (struct ext4_group_desc *)(
  268. (__u8 *)sbi->s_group_desc[group_desc]->b_data +
  269. offset * EXT4_DESC_SIZE(sb));
  270. if (bh)
  271. *bh = sbi->s_group_desc[group_desc];
  272. return desc;
  273. }
  274. /*
  275. * Return the block number which was discovered to be invalid, or 0 if
  276. * the block bitmap is valid.
  277. */
  278. static ext4_fsblk_t ext4_valid_block_bitmap(struct super_block *sb,
  279. struct ext4_group_desc *desc,
  280. ext4_group_t block_group,
  281. struct buffer_head *bh)
  282. {
  283. struct ext4_sb_info *sbi = EXT4_SB(sb);
  284. ext4_grpblk_t offset;
  285. ext4_grpblk_t next_zero_bit;
  286. ext4_fsblk_t blk;
  287. ext4_fsblk_t group_first_block;
  288. if (EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_FLEX_BG)) {
  289. /* with FLEX_BG, the inode/block bitmaps and itable
  290. * blocks may not be in the group at all
  291. * so the bitmap validation will be skipped for those groups
  292. * or it has to also read the block group where the bitmaps
  293. * are located to verify they are set.
  294. */
  295. return 0;
  296. }
  297. group_first_block = ext4_group_first_block_no(sb, block_group);
  298. /* check whether block bitmap block number is set */
  299. blk = ext4_block_bitmap(sb, desc);
  300. offset = blk - group_first_block;
  301. if (!ext4_test_bit(EXT4_B2C(sbi, offset), bh->b_data))
  302. /* bad block bitmap */
  303. return blk;
  304. /* check whether the inode bitmap block number is set */
  305. blk = ext4_inode_bitmap(sb, desc);
  306. offset = blk - group_first_block;
  307. if (!ext4_test_bit(EXT4_B2C(sbi, offset), bh->b_data))
  308. /* bad block bitmap */
  309. return blk;
  310. /* check whether the inode table block number is set */
  311. blk = ext4_inode_table(sb, desc);
  312. offset = blk - group_first_block;
  313. next_zero_bit = ext4_find_next_zero_bit(bh->b_data,
  314. EXT4_B2C(sbi, offset + EXT4_SB(sb)->s_itb_per_group),
  315. EXT4_B2C(sbi, offset));
  316. if (next_zero_bit <
  317. EXT4_B2C(sbi, offset + EXT4_SB(sb)->s_itb_per_group))
  318. /* bad bitmap for inode tables */
  319. return blk;
  320. return 0;
  321. }
  322. static void ext4_validate_block_bitmap(struct super_block *sb,
  323. struct ext4_group_desc *desc,
  324. ext4_group_t block_group,
  325. struct buffer_head *bh)
  326. {
  327. ext4_fsblk_t blk;
  328. struct ext4_group_info *grp = ext4_get_group_info(sb, block_group);
  329. struct ext4_sb_info *sbi = EXT4_SB(sb);
  330. if (buffer_verified(bh))
  331. return;
  332. ext4_lock_group(sb, block_group);
  333. blk = ext4_valid_block_bitmap(sb, desc, block_group, bh);
  334. if (unlikely(blk != 0)) {
  335. ext4_unlock_group(sb, block_group);
  336. ext4_error(sb, "bg %u: block %llu: invalid block bitmap",
  337. block_group, blk);
  338. if (!EXT4_MB_GRP_BBITMAP_CORRUPT(grp))
  339. percpu_counter_sub(&sbi->s_freeclusters_counter,
  340. grp->bb_free);
  341. set_bit(EXT4_GROUP_INFO_BBITMAP_CORRUPT_BIT, &grp->bb_state);
  342. return;
  343. }
  344. if (unlikely(!ext4_block_bitmap_csum_verify(sb, block_group,
  345. desc, bh))) {
  346. ext4_unlock_group(sb, block_group);
  347. ext4_error(sb, "bg %u: bad block bitmap checksum", block_group);
  348. if (!EXT4_MB_GRP_BBITMAP_CORRUPT(grp))
  349. percpu_counter_sub(&sbi->s_freeclusters_counter,
  350. grp->bb_free);
  351. set_bit(EXT4_GROUP_INFO_BBITMAP_CORRUPT_BIT, &grp->bb_state);
  352. return;
  353. }
  354. set_buffer_verified(bh);
  355. ext4_unlock_group(sb, block_group);
  356. }
  357. /**
  358. * ext4_read_block_bitmap_nowait()
  359. * @sb: super block
  360. * @block_group: given block group
  361. *
  362. * Read the bitmap for a given block_group,and validate the
  363. * bits for block/inode/inode tables are set in the bitmaps
  364. *
  365. * Return buffer_head on success or NULL in case of failure.
  366. */
  367. struct buffer_head *
  368. ext4_read_block_bitmap_nowait(struct super_block *sb, ext4_group_t block_group)
  369. {
  370. struct ext4_group_desc *desc;
  371. struct buffer_head *bh;
  372. ext4_fsblk_t bitmap_blk;
  373. desc = ext4_get_group_desc(sb, block_group, NULL);
  374. if (!desc)
  375. return NULL;
  376. bitmap_blk = ext4_block_bitmap(sb, desc);
  377. bh = sb_getblk(sb, bitmap_blk);
  378. if (unlikely(!bh)) {
  379. ext4_error(sb, "Cannot get buffer for block bitmap - "
  380. "block_group = %u, block_bitmap = %llu",
  381. block_group, bitmap_blk);
  382. return NULL;
  383. }
  384. if (bitmap_uptodate(bh))
  385. goto verify;
  386. lock_buffer(bh);
  387. if (bitmap_uptodate(bh)) {
  388. unlock_buffer(bh);
  389. goto verify;
  390. }
  391. ext4_lock_group(sb, block_group);
  392. if (desc->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
  393. ext4_init_block_bitmap(sb, bh, block_group, desc);
  394. set_bitmap_uptodate(bh);
  395. set_buffer_uptodate(bh);
  396. ext4_unlock_group(sb, block_group);
  397. unlock_buffer(bh);
  398. return bh;
  399. }
  400. ext4_unlock_group(sb, block_group);
  401. if (buffer_uptodate(bh)) {
  402. /*
  403. * if not uninit if bh is uptodate,
  404. * bitmap is also uptodate
  405. */
  406. set_bitmap_uptodate(bh);
  407. unlock_buffer(bh);
  408. goto verify;
  409. }
  410. /*
  411. * submit the buffer_head for reading
  412. */
  413. set_buffer_new(bh);
  414. trace_ext4_read_block_bitmap_load(sb, block_group);
  415. bh->b_end_io = ext4_end_bitmap_read;
  416. get_bh(bh);
  417. submit_bh(READ | REQ_META | REQ_PRIO, bh);
  418. return bh;
  419. verify:
  420. ext4_validate_block_bitmap(sb, desc, block_group, bh);
  421. if (buffer_verified(bh))
  422. return bh;
  423. put_bh(bh);
  424. return NULL;
  425. }
  426. /* Returns 0 on success, 1 on error */
  427. int ext4_wait_block_bitmap(struct super_block *sb, ext4_group_t block_group,
  428. struct buffer_head *bh)
  429. {
  430. struct ext4_group_desc *desc;
  431. if (!buffer_new(bh))
  432. return 0;
  433. desc = ext4_get_group_desc(sb, block_group, NULL);
  434. if (!desc)
  435. return 1;
  436. wait_on_buffer(bh);
  437. if (!buffer_uptodate(bh)) {
  438. ext4_error(sb, "Cannot read block bitmap - "
  439. "block_group = %u, block_bitmap = %llu",
  440. block_group, (unsigned long long) bh->b_blocknr);
  441. return 1;
  442. }
  443. clear_buffer_new(bh);
  444. /* Panic or remount fs read-only if block bitmap is invalid */
  445. ext4_validate_block_bitmap(sb, desc, block_group, bh);
  446. /* ...but check for error just in case errors=continue. */
  447. return !buffer_verified(bh);
  448. }
  449. struct buffer_head *
  450. ext4_read_block_bitmap(struct super_block *sb, ext4_group_t block_group)
  451. {
  452. struct buffer_head *bh;
  453. bh = ext4_read_block_bitmap_nowait(sb, block_group);
  454. if (!bh)
  455. return NULL;
  456. if (ext4_wait_block_bitmap(sb, block_group, bh)) {
  457. put_bh(bh);
  458. return NULL;
  459. }
  460. return bh;
  461. }
  462. /**
  463. * ext4_has_free_clusters()
  464. * @sbi: in-core super block structure.
  465. * @nclusters: number of needed blocks
  466. * @flags: flags from ext4_mb_new_blocks()
  467. *
  468. * Check if filesystem has nclusters free & available for allocation.
  469. * On success return 1, return 0 on failure.
  470. */
  471. static int ext4_has_free_clusters(struct ext4_sb_info *sbi,
  472. s64 nclusters, unsigned int flags)
  473. {
  474. s64 free_clusters, dirty_clusters, rsv, resv_clusters;
  475. struct percpu_counter *fcc = &sbi->s_freeclusters_counter;
  476. struct percpu_counter *dcc = &sbi->s_dirtyclusters_counter;
  477. free_clusters = percpu_counter_read_positive(fcc);
  478. dirty_clusters = percpu_counter_read_positive(dcc);
  479. resv_clusters = atomic64_read(&sbi->s_resv_clusters);
  480. /*
  481. * r_blocks_count should always be multiple of the cluster ratio so
  482. * we are safe to do a plane bit shift only.
  483. */
  484. rsv = (ext4_r_blocks_count(sbi->s_es) >> sbi->s_cluster_bits) +
  485. resv_clusters;
  486. if (free_clusters - (nclusters + rsv + dirty_clusters) <
  487. EXT4_FREECLUSTERS_WATERMARK) {
  488. free_clusters = percpu_counter_sum_positive(fcc);
  489. dirty_clusters = percpu_counter_sum_positive(dcc);
  490. }
  491. /* Check whether we have space after accounting for current
  492. * dirty clusters & root reserved clusters.
  493. */
  494. if (free_clusters >= (rsv + nclusters + dirty_clusters))
  495. return 1;
  496. /* Hm, nope. Are (enough) root reserved clusters available? */
  497. if (uid_eq(sbi->s_resuid, current_fsuid()) ||
  498. (!gid_eq(sbi->s_resgid, GLOBAL_ROOT_GID) && in_group_p(sbi->s_resgid)) ||
  499. capable(CAP_SYS_RESOURCE) ||
  500. (flags & EXT4_MB_USE_ROOT_BLOCKS)) {
  501. if (free_clusters >= (nclusters + dirty_clusters +
  502. resv_clusters))
  503. return 1;
  504. }
  505. /* No free blocks. Let's see if we can dip into reserved pool */
  506. if (flags & EXT4_MB_USE_RESERVED) {
  507. if (free_clusters >= (nclusters + dirty_clusters))
  508. return 1;
  509. }
  510. return 0;
  511. }
  512. int ext4_claim_free_clusters(struct ext4_sb_info *sbi,
  513. s64 nclusters, unsigned int flags)
  514. {
  515. if (ext4_has_free_clusters(sbi, nclusters, flags)) {
  516. percpu_counter_add(&sbi->s_dirtyclusters_counter, nclusters);
  517. return 0;
  518. } else
  519. return -ENOSPC;
  520. }
  521. /**
  522. * ext4_should_retry_alloc()
  523. * @sb: super block
  524. * @retries number of attemps has been made
  525. *
  526. * ext4_should_retry_alloc() is called when ENOSPC is returned, and if
  527. * it is profitable to retry the operation, this function will wait
  528. * for the current or committing transaction to complete, and then
  529. * return TRUE.
  530. *
  531. * if the total number of retries exceed three times, return FALSE.
  532. */
  533. int ext4_should_retry_alloc(struct super_block *sb, int *retries)
  534. {
  535. if (!ext4_has_free_clusters(EXT4_SB(sb), 1, 0) ||
  536. (*retries)++ > 3 ||
  537. !EXT4_SB(sb)->s_journal)
  538. return 0;
  539. jbd_debug(1, "%s: retrying operation after ENOSPC\n", sb->s_id);
  540. return jbd2_journal_force_commit_nested(EXT4_SB(sb)->s_journal);
  541. }
  542. /*
  543. * ext4_new_meta_blocks() -- allocate block for meta data (indexing) blocks
  544. *
  545. * @handle: handle to this transaction
  546. * @inode: file inode
  547. * @goal: given target block(filesystem wide)
  548. * @count: pointer to total number of clusters needed
  549. * @errp: error code
  550. *
  551. * Return 1st allocated block number on success, *count stores total account
  552. * error stores in errp pointer
  553. */
  554. ext4_fsblk_t ext4_new_meta_blocks(handle_t *handle, struct inode *inode,
  555. ext4_fsblk_t goal, unsigned int flags,
  556. unsigned long *count, int *errp)
  557. {
  558. struct ext4_allocation_request ar;
  559. ext4_fsblk_t ret;
  560. memset(&ar, 0, sizeof(ar));
  561. /* Fill with neighbour allocated blocks */
  562. ar.inode = inode;
  563. ar.goal = goal;
  564. ar.len = count ? *count : 1;
  565. ar.flags = flags;
  566. ret = ext4_mb_new_blocks(handle, &ar, errp);
  567. if (count)
  568. *count = ar.len;
  569. /*
  570. * Account for the allocated meta blocks. We will never
  571. * fail EDQUOT for metdata, but we do account for it.
  572. */
  573. if (!(*errp) &&
  574. ext4_test_inode_state(inode, EXT4_STATE_DELALLOC_RESERVED)) {
  575. spin_lock(&EXT4_I(inode)->i_block_reservation_lock);
  576. EXT4_I(inode)->i_allocated_meta_blocks += ar.len;
  577. spin_unlock(&EXT4_I(inode)->i_block_reservation_lock);
  578. dquot_alloc_block_nofail(inode,
  579. EXT4_C2B(EXT4_SB(inode->i_sb), ar.len));
  580. }
  581. return ret;
  582. }
  583. /**
  584. * ext4_count_free_clusters() -- count filesystem free clusters
  585. * @sb: superblock
  586. *
  587. * Adds up the number of free clusters from each block group.
  588. */
  589. ext4_fsblk_t ext4_count_free_clusters(struct super_block *sb)
  590. {
  591. ext4_fsblk_t desc_count;
  592. struct ext4_group_desc *gdp;
  593. ext4_group_t i;
  594. ext4_group_t ngroups = ext4_get_groups_count(sb);
  595. struct ext4_group_info *grp;
  596. #ifdef EXT4FS_DEBUG
  597. struct ext4_super_block *es;
  598. ext4_fsblk_t bitmap_count;
  599. unsigned int x;
  600. struct buffer_head *bitmap_bh = NULL;
  601. es = EXT4_SB(sb)->s_es;
  602. desc_count = 0;
  603. bitmap_count = 0;
  604. gdp = NULL;
  605. for (i = 0; i < ngroups; i++) {
  606. gdp = ext4_get_group_desc(sb, i, NULL);
  607. if (!gdp)
  608. continue;
  609. grp = NULL;
  610. if (EXT4_SB(sb)->s_group_info)
  611. grp = ext4_get_group_info(sb, i);
  612. if (!grp || !EXT4_MB_GRP_BBITMAP_CORRUPT(grp))
  613. desc_count += ext4_free_group_clusters(sb, gdp);
  614. brelse(bitmap_bh);
  615. bitmap_bh = ext4_read_block_bitmap(sb, i);
  616. if (bitmap_bh == NULL)
  617. continue;
  618. x = ext4_count_free(bitmap_bh->b_data,
  619. EXT4_CLUSTERS_PER_GROUP(sb) / 8);
  620. printk(KERN_DEBUG "group %u: stored = %d, counted = %u\n",
  621. i, ext4_free_group_clusters(sb, gdp), x);
  622. bitmap_count += x;
  623. }
  624. brelse(bitmap_bh);
  625. printk(KERN_DEBUG "ext4_count_free_clusters: stored = %llu"
  626. ", computed = %llu, %llu\n",
  627. EXT4_NUM_B2C(EXT4_SB(sb), ext4_free_blocks_count(es)),
  628. desc_count, bitmap_count);
  629. return bitmap_count;
  630. #else
  631. desc_count = 0;
  632. for (i = 0; i < ngroups; i++) {
  633. gdp = ext4_get_group_desc(sb, i, NULL);
  634. if (!gdp)
  635. continue;
  636. grp = NULL;
  637. if (EXT4_SB(sb)->s_group_info)
  638. grp = ext4_get_group_info(sb, i);
  639. if (!grp || !EXT4_MB_GRP_BBITMAP_CORRUPT(grp))
  640. desc_count += ext4_free_group_clusters(sb, gdp);
  641. }
  642. return desc_count;
  643. #endif
  644. }
  645. static inline int test_root(ext4_group_t a, int b)
  646. {
  647. while (1) {
  648. if (a < b)
  649. return 0;
  650. if (a == b)
  651. return 1;
  652. if ((a % b) != 0)
  653. return 0;
  654. a = a / b;
  655. }
  656. }
  657. /**
  658. * ext4_bg_has_super - number of blocks used by the superblock in group
  659. * @sb: superblock for filesystem
  660. * @group: group number to check
  661. *
  662. * Return the number of blocks used by the superblock (primary or backup)
  663. * in this group. Currently this will be only 0 or 1.
  664. */
  665. int ext4_bg_has_super(struct super_block *sb, ext4_group_t group)
  666. {
  667. struct ext4_super_block *es = EXT4_SB(sb)->s_es;
  668. if (group == 0)
  669. return 1;
  670. if (EXT4_HAS_COMPAT_FEATURE(sb, EXT4_FEATURE_COMPAT_SPARSE_SUPER2)) {
  671. if (group == le32_to_cpu(es->s_backup_bgs[0]) ||
  672. group == le32_to_cpu(es->s_backup_bgs[1]))
  673. return 1;
  674. return 0;
  675. }
  676. if ((group <= 1) || !EXT4_HAS_RO_COMPAT_FEATURE(sb,
  677. EXT4_FEATURE_RO_COMPAT_SPARSE_SUPER))
  678. return 1;
  679. if (!(group & 1))
  680. return 0;
  681. if (test_root(group, 3) || (test_root(group, 5)) ||
  682. test_root(group, 7))
  683. return 1;
  684. return 0;
  685. }
  686. static unsigned long ext4_bg_num_gdb_meta(struct super_block *sb,
  687. ext4_group_t group)
  688. {
  689. unsigned long metagroup = group / EXT4_DESC_PER_BLOCK(sb);
  690. ext4_group_t first = metagroup * EXT4_DESC_PER_BLOCK(sb);
  691. ext4_group_t last = first + EXT4_DESC_PER_BLOCK(sb) - 1;
  692. if (group == first || group == first + 1 || group == last)
  693. return 1;
  694. return 0;
  695. }
  696. static unsigned long ext4_bg_num_gdb_nometa(struct super_block *sb,
  697. ext4_group_t group)
  698. {
  699. if (!ext4_bg_has_super(sb, group))
  700. return 0;
  701. if (EXT4_HAS_INCOMPAT_FEATURE(sb,EXT4_FEATURE_INCOMPAT_META_BG))
  702. return le32_to_cpu(EXT4_SB(sb)->s_es->s_first_meta_bg);
  703. else
  704. return EXT4_SB(sb)->s_gdb_count;
  705. }
  706. /**
  707. * ext4_bg_num_gdb - number of blocks used by the group table in group
  708. * @sb: superblock for filesystem
  709. * @group: group number to check
  710. *
  711. * Return the number of blocks used by the group descriptor table
  712. * (primary or backup) in this group. In the future there may be a
  713. * different number of descriptor blocks in each group.
  714. */
  715. unsigned long ext4_bg_num_gdb(struct super_block *sb, ext4_group_t group)
  716. {
  717. unsigned long first_meta_bg =
  718. le32_to_cpu(EXT4_SB(sb)->s_es->s_first_meta_bg);
  719. unsigned long metagroup = group / EXT4_DESC_PER_BLOCK(sb);
  720. if (!EXT4_HAS_INCOMPAT_FEATURE(sb,EXT4_FEATURE_INCOMPAT_META_BG) ||
  721. metagroup < first_meta_bg)
  722. return ext4_bg_num_gdb_nometa(sb, group);
  723. return ext4_bg_num_gdb_meta(sb,group);
  724. }
  725. /*
  726. * This function returns the number of file system metadata clusters at
  727. * the beginning of a block group, including the reserved gdt blocks.
  728. */
  729. static unsigned ext4_num_base_meta_clusters(struct super_block *sb,
  730. ext4_group_t block_group)
  731. {
  732. struct ext4_sb_info *sbi = EXT4_SB(sb);
  733. unsigned num;
  734. /* Check for superblock and gdt backups in this group */
  735. num = ext4_bg_has_super(sb, block_group);
  736. if (!EXT4_HAS_INCOMPAT_FEATURE(sb, EXT4_FEATURE_INCOMPAT_META_BG) ||
  737. block_group < le32_to_cpu(sbi->s_es->s_first_meta_bg) *
  738. sbi->s_desc_per_block) {
  739. if (num) {
  740. num += ext4_bg_num_gdb(sb, block_group);
  741. num += le16_to_cpu(sbi->s_es->s_reserved_gdt_blocks);
  742. }
  743. } else { /* For META_BG_BLOCK_GROUPS */
  744. num += ext4_bg_num_gdb(sb, block_group);
  745. }
  746. return EXT4_NUM_B2C(sbi, num);
  747. }
  748. /**
  749. * ext4_inode_to_goal_block - return a hint for block allocation
  750. * @inode: inode for block allocation
  751. *
  752. * Return the ideal location to start allocating blocks for a
  753. * newly created inode.
  754. */
  755. ext4_fsblk_t ext4_inode_to_goal_block(struct inode *inode)
  756. {
  757. struct ext4_inode_info *ei = EXT4_I(inode);
  758. ext4_group_t block_group;
  759. ext4_grpblk_t colour;
  760. int flex_size = ext4_flex_bg_size(EXT4_SB(inode->i_sb));
  761. ext4_fsblk_t bg_start;
  762. ext4_fsblk_t last_block;
  763. block_group = ei->i_block_group;
  764. if (flex_size >= EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME) {
  765. /*
  766. * If there are at least EXT4_FLEX_SIZE_DIR_ALLOC_SCHEME
  767. * block groups per flexgroup, reserve the first block
  768. * group for directories and special files. Regular
  769. * files will start at the second block group. This
  770. * tends to speed up directory access and improves
  771. * fsck times.
  772. */
  773. block_group &= ~(flex_size-1);
  774. if (S_ISREG(inode->i_mode))
  775. block_group++;
  776. }
  777. bg_start = ext4_group_first_block_no(inode->i_sb, block_group);
  778. last_block = ext4_blocks_count(EXT4_SB(inode->i_sb)->s_es) - 1;
  779. /*
  780. * If we are doing delayed allocation, we don't need take
  781. * colour into account.
  782. */
  783. if (test_opt(inode->i_sb, DELALLOC))
  784. return bg_start;
  785. if (bg_start + EXT4_BLOCKS_PER_GROUP(inode->i_sb) <= last_block)
  786. colour = (current->pid % 16) *
  787. (EXT4_BLOCKS_PER_GROUP(inode->i_sb) / 16);
  788. else
  789. colour = (current->pid % 16) * ((last_block - bg_start) / 16);
  790. return bg_start + colour;
  791. }