balloc.c 26 KB

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