ialloc.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678
  1. /*
  2. * linux/fs/ext2/ialloc.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. * BSD ufs-inspired inode and directory allocation by
  10. * Stephen Tweedie (sct@dcs.ed.ac.uk), 1993
  11. * Big-endian to little-endian byte-swapping/bitmaps by
  12. * David S. Miller (davem@caip.rutgers.edu), 1995
  13. */
  14. #include <linux/quotaops.h>
  15. #include <linux/sched.h>
  16. #include <linux/backing-dev.h>
  17. #include <linux/buffer_head.h>
  18. #include <linux/random.h>
  19. #include "ext2.h"
  20. #include "xattr.h"
  21. #include "acl.h"
  22. /*
  23. * ialloc.c contains the inodes allocation and deallocation routines
  24. */
  25. /*
  26. * The free inodes are managed by bitmaps. A file system contains several
  27. * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
  28. * block for inodes, N blocks for the inode table and data blocks.
  29. *
  30. * The file system contains group descriptors which are located after the
  31. * super block. Each descriptor contains the number of the bitmap block and
  32. * the free blocks count in the block.
  33. */
  34. /*
  35. * Read the inode allocation bitmap for a given block_group, reading
  36. * into the specified slot in the superblock's bitmap cache.
  37. *
  38. * Return buffer_head of bitmap on success or NULL.
  39. */
  40. static struct buffer_head *
  41. read_inode_bitmap(struct super_block * sb, unsigned long block_group)
  42. {
  43. struct ext2_group_desc *desc;
  44. struct buffer_head *bh = NULL;
  45. desc = ext2_get_group_desc(sb, block_group, NULL);
  46. if (!desc)
  47. goto error_out;
  48. bh = sb_bread(sb, le32_to_cpu(desc->bg_inode_bitmap));
  49. if (!bh)
  50. ext2_error(sb, "read_inode_bitmap",
  51. "Cannot read inode bitmap - "
  52. "block_group = %lu, inode_bitmap = %u",
  53. block_group, le32_to_cpu(desc->bg_inode_bitmap));
  54. error_out:
  55. return bh;
  56. }
  57. static void ext2_release_inode(struct super_block *sb, int group, int dir)
  58. {
  59. struct ext2_group_desc * desc;
  60. struct buffer_head *bh;
  61. desc = ext2_get_group_desc(sb, group, &bh);
  62. if (!desc) {
  63. ext2_error(sb, "ext2_release_inode",
  64. "can't get descriptor for group %d", group);
  65. return;
  66. }
  67. spin_lock(sb_bgl_lock(EXT2_SB(sb), group));
  68. le16_add_cpu(&desc->bg_free_inodes_count, 1);
  69. if (dir)
  70. le16_add_cpu(&desc->bg_used_dirs_count, -1);
  71. spin_unlock(sb_bgl_lock(EXT2_SB(sb), group));
  72. if (dir)
  73. percpu_counter_dec(&EXT2_SB(sb)->s_dirs_counter);
  74. mark_buffer_dirty(bh);
  75. }
  76. /*
  77. * NOTE! When we get the inode, we're the only people
  78. * that have access to it, and as such there are no
  79. * race conditions we have to worry about. The inode
  80. * is not on the hash-lists, and it cannot be reached
  81. * through the filesystem because the directory entry
  82. * has been deleted earlier.
  83. *
  84. * HOWEVER: we must make sure that we get no aliases,
  85. * which means that we have to call "clear_inode()"
  86. * _before_ we mark the inode not in use in the inode
  87. * bitmaps. Otherwise a newly created file might use
  88. * the same inode number (not actually the same pointer
  89. * though), and then we'd have two inodes sharing the
  90. * same inode number and space on the harddisk.
  91. */
  92. void ext2_free_inode (struct inode * inode)
  93. {
  94. struct super_block * sb = inode->i_sb;
  95. int is_directory;
  96. unsigned long ino;
  97. struct buffer_head *bitmap_bh;
  98. unsigned long block_group;
  99. unsigned long bit;
  100. struct ext2_super_block * es;
  101. ino = inode->i_ino;
  102. ext2_debug ("freeing inode %lu\n", ino);
  103. /*
  104. * Note: we must free any quota before locking the superblock,
  105. * as writing the quota to disk may need the lock as well.
  106. */
  107. /* Quota is already initialized in iput() */
  108. dquot_free_inode(inode);
  109. dquot_drop(inode);
  110. es = EXT2_SB(sb)->s_es;
  111. is_directory = S_ISDIR(inode->i_mode);
  112. if (ino < EXT2_FIRST_INO(sb) ||
  113. ino > le32_to_cpu(es->s_inodes_count)) {
  114. ext2_error (sb, "ext2_free_inode",
  115. "reserved or nonexistent inode %lu", ino);
  116. return;
  117. }
  118. block_group = (ino - 1) / EXT2_INODES_PER_GROUP(sb);
  119. bit = (ino - 1) % EXT2_INODES_PER_GROUP(sb);
  120. bitmap_bh = read_inode_bitmap(sb, block_group);
  121. if (!bitmap_bh)
  122. return;
  123. /* Ok, now we can actually update the inode bitmaps.. */
  124. if (!ext2_clear_bit_atomic(sb_bgl_lock(EXT2_SB(sb), block_group),
  125. bit, (void *) bitmap_bh->b_data))
  126. ext2_error (sb, "ext2_free_inode",
  127. "bit already cleared for inode %lu", ino);
  128. else
  129. ext2_release_inode(sb, block_group, is_directory);
  130. mark_buffer_dirty(bitmap_bh);
  131. if (sb->s_flags & MS_SYNCHRONOUS)
  132. sync_dirty_buffer(bitmap_bh);
  133. brelse(bitmap_bh);
  134. }
  135. /*
  136. * We perform asynchronous prereading of the new inode's inode block when
  137. * we create the inode, in the expectation that the inode will be written
  138. * back soon. There are two reasons:
  139. *
  140. * - When creating a large number of files, the async prereads will be
  141. * nicely merged into large reads
  142. * - When writing out a large number of inodes, we don't need to keep on
  143. * stalling the writes while we read the inode block.
  144. *
  145. * FIXME: ext2_get_group_desc() needs to be simplified.
  146. */
  147. static void ext2_preread_inode(struct inode *inode)
  148. {
  149. unsigned long block_group;
  150. unsigned long offset;
  151. unsigned long block;
  152. struct ext2_group_desc * gdp;
  153. struct backing_dev_info *bdi;
  154. bdi = inode_to_bdi(inode);
  155. if (bdi_read_congested(bdi))
  156. return;
  157. if (bdi_write_congested(bdi))
  158. return;
  159. block_group = (inode->i_ino - 1) / EXT2_INODES_PER_GROUP(inode->i_sb);
  160. gdp = ext2_get_group_desc(inode->i_sb, block_group, NULL);
  161. if (gdp == NULL)
  162. return;
  163. /*
  164. * Figure out the offset within the block group inode table
  165. */
  166. offset = ((inode->i_ino - 1) % EXT2_INODES_PER_GROUP(inode->i_sb)) *
  167. EXT2_INODE_SIZE(inode->i_sb);
  168. block = le32_to_cpu(gdp->bg_inode_table) +
  169. (offset >> EXT2_BLOCK_SIZE_BITS(inode->i_sb));
  170. sb_breadahead(inode->i_sb, block);
  171. }
  172. /*
  173. * There are two policies for allocating an inode. If the new inode is
  174. * a directory, then a forward search is made for a block group with both
  175. * free space and a low directory-to-inode ratio; if that fails, then of
  176. * the groups with above-average free space, that group with the fewest
  177. * directories already is chosen.
  178. *
  179. * For other inodes, search forward from the parent directory\'s block
  180. * group to find a free inode.
  181. */
  182. static int find_group_dir(struct super_block *sb, struct inode *parent)
  183. {
  184. int ngroups = EXT2_SB(sb)->s_groups_count;
  185. int avefreei = ext2_count_free_inodes(sb) / ngroups;
  186. struct ext2_group_desc *desc, *best_desc = NULL;
  187. int group, best_group = -1;
  188. for (group = 0; group < ngroups; group++) {
  189. desc = ext2_get_group_desc (sb, group, NULL);
  190. if (!desc || !desc->bg_free_inodes_count)
  191. continue;
  192. if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
  193. continue;
  194. if (!best_desc ||
  195. (le16_to_cpu(desc->bg_free_blocks_count) >
  196. le16_to_cpu(best_desc->bg_free_blocks_count))) {
  197. best_group = group;
  198. best_desc = desc;
  199. }
  200. }
  201. if (!best_desc)
  202. return -1;
  203. return best_group;
  204. }
  205. /*
  206. * Orlov's allocator for directories.
  207. *
  208. * We always try to spread first-level directories.
  209. *
  210. * If there are blockgroups with both free inodes and free blocks counts
  211. * not worse than average we return one with smallest directory count.
  212. * Otherwise we simply return a random group.
  213. *
  214. * For the rest rules look so:
  215. *
  216. * It's OK to put directory into a group unless
  217. * it has too many directories already (max_dirs) or
  218. * it has too few free inodes left (min_inodes) or
  219. * it has too few free blocks left (min_blocks) or
  220. * it's already running too large debt (max_debt).
  221. * Parent's group is preferred, if it doesn't satisfy these
  222. * conditions we search cyclically through the rest. If none
  223. * of the groups look good we just look for a group with more
  224. * free inodes than average (starting at parent's group).
  225. *
  226. * Debt is incremented each time we allocate a directory and decremented
  227. * when we allocate an inode, within 0--255.
  228. */
  229. #define INODE_COST 64
  230. #define BLOCK_COST 256
  231. static int find_group_orlov(struct super_block *sb, struct inode *parent)
  232. {
  233. int parent_group = EXT2_I(parent)->i_block_group;
  234. struct ext2_sb_info *sbi = EXT2_SB(sb);
  235. struct ext2_super_block *es = sbi->s_es;
  236. int ngroups = sbi->s_groups_count;
  237. int inodes_per_group = EXT2_INODES_PER_GROUP(sb);
  238. int freei;
  239. int avefreei;
  240. int free_blocks;
  241. int avefreeb;
  242. int blocks_per_dir;
  243. int ndirs;
  244. int max_debt, max_dirs, min_blocks, min_inodes;
  245. int group = -1, i;
  246. struct ext2_group_desc *desc;
  247. freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter);
  248. avefreei = freei / ngroups;
  249. free_blocks = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
  250. avefreeb = free_blocks / ngroups;
  251. ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter);
  252. if ((parent == d_inode(sb->s_root)) ||
  253. (EXT2_I(parent)->i_flags & EXT2_TOPDIR_FL)) {
  254. struct ext2_group_desc *best_desc = NULL;
  255. int best_ndir = inodes_per_group;
  256. int best_group = -1;
  257. group = prandom_u32();
  258. parent_group = (unsigned)group % ngroups;
  259. for (i = 0; i < ngroups; i++) {
  260. group = (parent_group + i) % ngroups;
  261. desc = ext2_get_group_desc (sb, group, NULL);
  262. if (!desc || !desc->bg_free_inodes_count)
  263. continue;
  264. if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir)
  265. continue;
  266. if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
  267. continue;
  268. if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb)
  269. continue;
  270. best_group = group;
  271. best_ndir = le16_to_cpu(desc->bg_used_dirs_count);
  272. best_desc = desc;
  273. }
  274. if (best_group >= 0) {
  275. desc = best_desc;
  276. group = best_group;
  277. goto found;
  278. }
  279. goto fallback;
  280. }
  281. if (ndirs == 0)
  282. ndirs = 1; /* percpu_counters are approximate... */
  283. blocks_per_dir = (le32_to_cpu(es->s_blocks_count)-free_blocks) / ndirs;
  284. max_dirs = ndirs / ngroups + inodes_per_group / 16;
  285. min_inodes = avefreei - inodes_per_group / 4;
  286. min_blocks = avefreeb - EXT2_BLOCKS_PER_GROUP(sb) / 4;
  287. max_debt = EXT2_BLOCKS_PER_GROUP(sb) / max(blocks_per_dir, BLOCK_COST);
  288. if (max_debt * INODE_COST > inodes_per_group)
  289. max_debt = inodes_per_group / INODE_COST;
  290. if (max_debt > 255)
  291. max_debt = 255;
  292. if (max_debt == 0)
  293. max_debt = 1;
  294. for (i = 0; i < ngroups; i++) {
  295. group = (parent_group + i) % ngroups;
  296. desc = ext2_get_group_desc (sb, group, NULL);
  297. if (!desc || !desc->bg_free_inodes_count)
  298. continue;
  299. if (sbi->s_debts[group] >= max_debt)
  300. continue;
  301. if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs)
  302. continue;
  303. if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes)
  304. continue;
  305. if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks)
  306. continue;
  307. goto found;
  308. }
  309. fallback:
  310. for (i = 0; i < ngroups; i++) {
  311. group = (parent_group + i) % ngroups;
  312. desc = ext2_get_group_desc (sb, group, NULL);
  313. if (!desc || !desc->bg_free_inodes_count)
  314. continue;
  315. if (le16_to_cpu(desc->bg_free_inodes_count) >= avefreei)
  316. goto found;
  317. }
  318. if (avefreei) {
  319. /*
  320. * The free-inodes counter is approximate, and for really small
  321. * filesystems the above test can fail to find any blockgroups
  322. */
  323. avefreei = 0;
  324. goto fallback;
  325. }
  326. return -1;
  327. found:
  328. return group;
  329. }
  330. static int find_group_other(struct super_block *sb, struct inode *parent)
  331. {
  332. int parent_group = EXT2_I(parent)->i_block_group;
  333. int ngroups = EXT2_SB(sb)->s_groups_count;
  334. struct ext2_group_desc *desc;
  335. int group, i;
  336. /*
  337. * Try to place the inode in its parent directory
  338. */
  339. group = parent_group;
  340. desc = ext2_get_group_desc (sb, group, NULL);
  341. if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
  342. le16_to_cpu(desc->bg_free_blocks_count))
  343. goto found;
  344. /*
  345. * We're going to place this inode in a different blockgroup from its
  346. * parent. We want to cause files in a common directory to all land in
  347. * the same blockgroup. But we want files which are in a different
  348. * directory which shares a blockgroup with our parent to land in a
  349. * different blockgroup.
  350. *
  351. * So add our directory's i_ino into the starting point for the hash.
  352. */
  353. group = (group + parent->i_ino) % ngroups;
  354. /*
  355. * Use a quadratic hash to find a group with a free inode and some
  356. * free blocks.
  357. */
  358. for (i = 1; i < ngroups; i <<= 1) {
  359. group += i;
  360. if (group >= ngroups)
  361. group -= ngroups;
  362. desc = ext2_get_group_desc (sb, group, NULL);
  363. if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
  364. le16_to_cpu(desc->bg_free_blocks_count))
  365. goto found;
  366. }
  367. /*
  368. * That failed: try linear search for a free inode, even if that group
  369. * has no free blocks.
  370. */
  371. group = parent_group;
  372. for (i = 0; i < ngroups; i++) {
  373. if (++group >= ngroups)
  374. group = 0;
  375. desc = ext2_get_group_desc (sb, group, NULL);
  376. if (desc && le16_to_cpu(desc->bg_free_inodes_count))
  377. goto found;
  378. }
  379. return -1;
  380. found:
  381. return group;
  382. }
  383. struct inode *ext2_new_inode(struct inode *dir, umode_t mode,
  384. const struct qstr *qstr)
  385. {
  386. struct super_block *sb;
  387. struct buffer_head *bitmap_bh = NULL;
  388. struct buffer_head *bh2;
  389. int group, i;
  390. ino_t ino = 0;
  391. struct inode * inode;
  392. struct ext2_group_desc *gdp;
  393. struct ext2_super_block *es;
  394. struct ext2_inode_info *ei;
  395. struct ext2_sb_info *sbi;
  396. int err;
  397. sb = dir->i_sb;
  398. inode = new_inode(sb);
  399. if (!inode)
  400. return ERR_PTR(-ENOMEM);
  401. ei = EXT2_I(inode);
  402. sbi = EXT2_SB(sb);
  403. es = sbi->s_es;
  404. if (S_ISDIR(mode)) {
  405. if (test_opt(sb, OLDALLOC))
  406. group = find_group_dir(sb, dir);
  407. else
  408. group = find_group_orlov(sb, dir);
  409. } else
  410. group = find_group_other(sb, dir);
  411. if (group == -1) {
  412. err = -ENOSPC;
  413. goto fail;
  414. }
  415. for (i = 0; i < sbi->s_groups_count; i++) {
  416. gdp = ext2_get_group_desc(sb, group, &bh2);
  417. brelse(bitmap_bh);
  418. bitmap_bh = read_inode_bitmap(sb, group);
  419. if (!bitmap_bh) {
  420. err = -EIO;
  421. goto fail;
  422. }
  423. ino = 0;
  424. repeat_in_this_group:
  425. ino = ext2_find_next_zero_bit((unsigned long *)bitmap_bh->b_data,
  426. EXT2_INODES_PER_GROUP(sb), ino);
  427. if (ino >= EXT2_INODES_PER_GROUP(sb)) {
  428. /*
  429. * Rare race: find_group_xx() decided that there were
  430. * free inodes in this group, but by the time we tried
  431. * to allocate one, they're all gone. This can also
  432. * occur because the counters which find_group_orlov()
  433. * uses are approximate. So just go and search the
  434. * next block group.
  435. */
  436. if (++group == sbi->s_groups_count)
  437. group = 0;
  438. continue;
  439. }
  440. if (ext2_set_bit_atomic(sb_bgl_lock(sbi, group),
  441. ino, bitmap_bh->b_data)) {
  442. /* we lost this inode */
  443. if (++ino >= EXT2_INODES_PER_GROUP(sb)) {
  444. /* this group is exhausted, try next group */
  445. if (++group == sbi->s_groups_count)
  446. group = 0;
  447. continue;
  448. }
  449. /* try to find free inode in the same group */
  450. goto repeat_in_this_group;
  451. }
  452. goto got;
  453. }
  454. /*
  455. * Scanned all blockgroups.
  456. */
  457. err = -ENOSPC;
  458. goto fail;
  459. got:
  460. mark_buffer_dirty(bitmap_bh);
  461. if (sb->s_flags & MS_SYNCHRONOUS)
  462. sync_dirty_buffer(bitmap_bh);
  463. brelse(bitmap_bh);
  464. ino += group * EXT2_INODES_PER_GROUP(sb) + 1;
  465. if (ino < EXT2_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
  466. ext2_error (sb, "ext2_new_inode",
  467. "reserved inode or inode > inodes count - "
  468. "block_group = %d,inode=%lu", group,
  469. (unsigned long) ino);
  470. err = -EIO;
  471. goto fail;
  472. }
  473. percpu_counter_add(&sbi->s_freeinodes_counter, -1);
  474. if (S_ISDIR(mode))
  475. percpu_counter_inc(&sbi->s_dirs_counter);
  476. spin_lock(sb_bgl_lock(sbi, group));
  477. le16_add_cpu(&gdp->bg_free_inodes_count, -1);
  478. if (S_ISDIR(mode)) {
  479. if (sbi->s_debts[group] < 255)
  480. sbi->s_debts[group]++;
  481. le16_add_cpu(&gdp->bg_used_dirs_count, 1);
  482. } else {
  483. if (sbi->s_debts[group])
  484. sbi->s_debts[group]--;
  485. }
  486. spin_unlock(sb_bgl_lock(sbi, group));
  487. mark_buffer_dirty(bh2);
  488. if (test_opt(sb, GRPID)) {
  489. inode->i_mode = mode;
  490. inode->i_uid = current_fsuid();
  491. inode->i_gid = dir->i_gid;
  492. } else
  493. inode_init_owner(inode, dir, mode);
  494. inode->i_ino = ino;
  495. inode->i_blocks = 0;
  496. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
  497. memset(ei->i_data, 0, sizeof(ei->i_data));
  498. ei->i_flags =
  499. ext2_mask_flags(mode, EXT2_I(dir)->i_flags & EXT2_FL_INHERITED);
  500. ei->i_faddr = 0;
  501. ei->i_frag_no = 0;
  502. ei->i_frag_size = 0;
  503. ei->i_file_acl = 0;
  504. ei->i_dir_acl = 0;
  505. ei->i_dtime = 0;
  506. ei->i_block_alloc_info = NULL;
  507. ei->i_block_group = group;
  508. ei->i_dir_start_lookup = 0;
  509. ei->i_state = EXT2_STATE_NEW;
  510. ext2_set_inode_flags(inode);
  511. spin_lock(&sbi->s_next_gen_lock);
  512. inode->i_generation = sbi->s_next_generation++;
  513. spin_unlock(&sbi->s_next_gen_lock);
  514. if (insert_inode_locked(inode) < 0) {
  515. ext2_error(sb, "ext2_new_inode",
  516. "inode number already in use - inode=%lu",
  517. (unsigned long) ino);
  518. err = -EIO;
  519. goto fail;
  520. }
  521. err = dquot_initialize(inode);
  522. if (err)
  523. goto fail_drop;
  524. err = dquot_alloc_inode(inode);
  525. if (err)
  526. goto fail_drop;
  527. err = ext2_init_acl(inode, dir);
  528. if (err)
  529. goto fail_free_drop;
  530. err = ext2_init_security(inode, dir, qstr);
  531. if (err)
  532. goto fail_free_drop;
  533. mark_inode_dirty(inode);
  534. ext2_debug("allocating inode %lu\n", inode->i_ino);
  535. ext2_preread_inode(inode);
  536. return inode;
  537. fail_free_drop:
  538. dquot_free_inode(inode);
  539. fail_drop:
  540. dquot_drop(inode);
  541. inode->i_flags |= S_NOQUOTA;
  542. clear_nlink(inode);
  543. unlock_new_inode(inode);
  544. iput(inode);
  545. return ERR_PTR(err);
  546. fail:
  547. make_bad_inode(inode);
  548. iput(inode);
  549. return ERR_PTR(err);
  550. }
  551. unsigned long ext2_count_free_inodes (struct super_block * sb)
  552. {
  553. struct ext2_group_desc *desc;
  554. unsigned long desc_count = 0;
  555. int i;
  556. #ifdef EXT2FS_DEBUG
  557. struct ext2_super_block *es;
  558. unsigned long bitmap_count = 0;
  559. struct buffer_head *bitmap_bh = NULL;
  560. es = EXT2_SB(sb)->s_es;
  561. for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) {
  562. unsigned x;
  563. desc = ext2_get_group_desc (sb, i, NULL);
  564. if (!desc)
  565. continue;
  566. desc_count += le16_to_cpu(desc->bg_free_inodes_count);
  567. brelse(bitmap_bh);
  568. bitmap_bh = read_inode_bitmap(sb, i);
  569. if (!bitmap_bh)
  570. continue;
  571. x = ext2_count_free(bitmap_bh, EXT2_INODES_PER_GROUP(sb) / 8);
  572. printk("group %d: stored = %d, counted = %u\n",
  573. i, le16_to_cpu(desc->bg_free_inodes_count), x);
  574. bitmap_count += x;
  575. }
  576. brelse(bitmap_bh);
  577. printk("ext2_count_free_inodes: stored = %lu, computed = %lu, %lu\n",
  578. (unsigned long)
  579. percpu_counter_read(&EXT2_SB(sb)->s_freeinodes_counter),
  580. desc_count, bitmap_count);
  581. return desc_count;
  582. #else
  583. for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) {
  584. desc = ext2_get_group_desc (sb, i, NULL);
  585. if (!desc)
  586. continue;
  587. desc_count += le16_to_cpu(desc->bg_free_inodes_count);
  588. }
  589. return desc_count;
  590. #endif
  591. }
  592. /* Called at mount-time, super-block is locked */
  593. unsigned long ext2_count_dirs (struct super_block * sb)
  594. {
  595. unsigned long count = 0;
  596. int i;
  597. for (i = 0; i < EXT2_SB(sb)->s_groups_count; i++) {
  598. struct ext2_group_desc *gdp = ext2_get_group_desc (sb, i, NULL);
  599. if (!gdp)
  600. continue;
  601. count += le16_to_cpu(gdp->bg_used_dirs_count);
  602. }
  603. return count;
  604. }