balloc.c 23 KB

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