balloc.c 24 KB

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