2 * linux/fs/ext4/ialloc.c
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)
9 * BSD ufs-inspired inode and directory allocation by
10 * 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
15 #include <linux/time.h>
17 #include <linux/jbd2.h>
18 #include <linux/ext4_fs.h>
19 #include <linux/ext4_jbd2.h>
20 #include <linux/stat.h>
21 #include <linux/string.h>
22 #include <linux/quotaops.h>
23 #include <linux/buffer_head.h>
24 #include <linux/random.h>
25 #include <linux/bitops.h>
26 #include <linux/blkdev.h>
27 #include <asm/byteorder.h>
34 * ialloc.c contains the inodes allocation and deallocation routines
38 * The free inodes are managed by bitmaps. A file system contains several
39 * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
40 * block for inodes, N blocks for the inode table and data blocks.
42 * The file system contains group descriptors which are located after the
43 * super block. Each descriptor contains the number of the bitmap block and
44 * the free blocks count in the block.
48 * To avoid calling the atomic setbit hundreds or thousands of times, we only
49 * need to use it within a single byte (to ensure we get endianness right).
50 * We can use memset for the rest of the bitmap as there are no other users.
52 void mark_bitmap_end(int start_bit, int end_bit, char *bitmap)
56 if (start_bit >= end_bit)
59 ext4_debug("mark end bits +%d through +%d used\n", start_bit, end_bit);
60 for (i = start_bit; i < ((start_bit + 7) & ~7UL); i++)
61 ext4_set_bit(i, bitmap);
63 memset(bitmap + (i >> 3), 0xff, (end_bit - i) >> 3);
66 /* Initializes an uninitialized inode bitmap */
67 unsigned ext4_init_inode_bitmap(struct super_block *sb, struct buffer_head *bh,
68 ext4_group_t block_group,
69 struct ext4_group_desc *gdp)
71 struct ext4_sb_info *sbi = EXT4_SB(sb);
73 J_ASSERT_BH(bh, buffer_locked(bh));
75 /* If checksum is bad mark all blocks and inodes use to prevent
76 * allocation, essentially implementing a per-group read-only flag. */
77 if (!ext4_group_desc_csum_verify(sbi, block_group, gdp)) {
78 ext4_error(sb, __func__, "Checksum bad for group %lu\n",
80 gdp->bg_free_blocks_count = 0;
81 gdp->bg_free_inodes_count = 0;
82 gdp->bg_itable_unused = 0;
83 memset(bh->b_data, 0xff, sb->s_blocksize);
87 memset(bh->b_data, 0, (EXT4_INODES_PER_GROUP(sb) + 7) / 8);
88 mark_bitmap_end(EXT4_INODES_PER_GROUP(sb), EXT4_BLOCKS_PER_GROUP(sb),
91 return EXT4_INODES_PER_GROUP(sb);
95 * Read the inode allocation bitmap for a given block_group, reading
96 * into the specified slot in the superblock's bitmap cache.
98 * Return buffer_head of bitmap on success or NULL.
100 static struct buffer_head *
101 read_inode_bitmap(struct super_block *sb, ext4_group_t block_group)
103 struct ext4_group_desc *desc;
104 struct buffer_head *bh = NULL;
106 desc = ext4_get_group_desc(sb, block_group, NULL);
109 if (desc->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) {
110 bh = sb_getblk(sb, ext4_inode_bitmap(sb, desc));
111 if (!buffer_uptodate(bh)) {
113 if (!buffer_uptodate(bh)) {
114 ext4_init_inode_bitmap(sb, bh, block_group,
116 set_buffer_uptodate(bh);
121 bh = sb_bread(sb, ext4_inode_bitmap(sb, desc));
124 ext4_error(sb, "read_inode_bitmap",
125 "Cannot read inode bitmap - "
126 "block_group = %lu, inode_bitmap = %llu",
127 block_group, ext4_inode_bitmap(sb, desc));
133 * NOTE! When we get the inode, we're the only people
134 * that have access to it, and as such there are no
135 * race conditions we have to worry about. The inode
136 * is not on the hash-lists, and it cannot be reached
137 * through the filesystem because the directory entry
138 * has been deleted earlier.
140 * HOWEVER: we must make sure that we get no aliases,
141 * which means that we have to call "clear_inode()"
142 * _before_ we mark the inode not in use in the inode
143 * bitmaps. Otherwise a newly created file might use
144 * the same inode number (not actually the same pointer
145 * though), and then we'd have two inodes sharing the
146 * same inode number and space on the harddisk.
148 void ext4_free_inode (handle_t *handle, struct inode * inode)
150 struct super_block * sb = inode->i_sb;
153 struct buffer_head *bitmap_bh = NULL;
154 struct buffer_head *bh2;
155 ext4_group_t block_group;
157 struct ext4_group_desc * gdp;
158 struct ext4_super_block * es;
159 struct ext4_sb_info *sbi;
162 if (atomic_read(&inode->i_count) > 1) {
163 printk ("ext4_free_inode: inode has count=%d\n",
164 atomic_read(&inode->i_count));
167 if (inode->i_nlink) {
168 printk ("ext4_free_inode: inode has nlink=%d\n",
173 printk("ext4_free_inode: inode on nonexistent device\n");
179 ext4_debug ("freeing inode %lu\n", ino);
182 * Note: we must free any quota before locking the superblock,
183 * as writing the quota to disk may need the lock as well.
186 ext4_xattr_delete_inode(handle, inode);
187 DQUOT_FREE_INODE(inode);
190 is_directory = S_ISDIR(inode->i_mode);
192 /* Do this BEFORE marking the inode not in use or returning an error */
195 es = EXT4_SB(sb)->s_es;
196 if (ino < EXT4_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
197 ext4_error (sb, "ext4_free_inode",
198 "reserved or nonexistent inode %lu", ino);
201 block_group = (ino - 1) / EXT4_INODES_PER_GROUP(sb);
202 bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb);
203 bitmap_bh = read_inode_bitmap(sb, block_group);
207 BUFFER_TRACE(bitmap_bh, "get_write_access");
208 fatal = ext4_journal_get_write_access(handle, bitmap_bh);
212 /* Ok, now we can actually update the inode bitmaps.. */
213 if (!ext4_clear_bit_atomic(sb_bgl_lock(sbi, block_group),
214 bit, bitmap_bh->b_data))
215 ext4_error (sb, "ext4_free_inode",
216 "bit already cleared for inode %lu", ino);
218 gdp = ext4_get_group_desc (sb, block_group, &bh2);
220 BUFFER_TRACE(bh2, "get_write_access");
221 fatal = ext4_journal_get_write_access(handle, bh2);
222 if (fatal) goto error_return;
225 spin_lock(sb_bgl_lock(sbi, block_group));
226 le16_add_cpu(&gdp->bg_free_inodes_count, 1);
228 le16_add_cpu(&gdp->bg_used_dirs_count, -1);
229 gdp->bg_checksum = ext4_group_desc_csum(sbi,
231 spin_unlock(sb_bgl_lock(sbi, block_group));
232 percpu_counter_inc(&sbi->s_freeinodes_counter);
234 percpu_counter_dec(&sbi->s_dirs_counter);
237 BUFFER_TRACE(bh2, "call ext4_journal_dirty_metadata");
238 err = ext4_journal_dirty_metadata(handle, bh2);
239 if (!fatal) fatal = err;
241 BUFFER_TRACE(bitmap_bh, "call ext4_journal_dirty_metadata");
242 err = ext4_journal_dirty_metadata(handle, bitmap_bh);
248 ext4_std_error(sb, fatal);
252 * There are two policies for allocating an inode. If the new inode is
253 * a directory, then a forward search is made for a block group with both
254 * free space and a low directory-to-inode ratio; if that fails, then of
255 * the groups with above-average free space, that group with the fewest
256 * directories already is chosen.
258 * For other inodes, search forward from the parent directory\'s block
259 * group to find a free inode.
261 static int find_group_dir(struct super_block *sb, struct inode *parent,
262 ext4_group_t *best_group)
264 ext4_group_t ngroups = EXT4_SB(sb)->s_groups_count;
265 unsigned int freei, avefreei;
266 struct ext4_group_desc *desc, *best_desc = NULL;
270 freei = percpu_counter_read_positive(&EXT4_SB(sb)->s_freeinodes_counter);
271 avefreei = freei / ngroups;
273 for (group = 0; group < ngroups; group++) {
274 desc = ext4_get_group_desc (sb, group, NULL);
275 if (!desc || !desc->bg_free_inodes_count)
277 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
280 (le16_to_cpu(desc->bg_free_blocks_count) >
281 le16_to_cpu(best_desc->bg_free_blocks_count))) {
291 * Orlov's allocator for directories.
293 * We always try to spread first-level directories.
295 * If there are blockgroups with both free inodes and free blocks counts
296 * not worse than average we return one with smallest directory count.
297 * Otherwise we simply return a random group.
299 * For the rest rules look so:
301 * It's OK to put directory into a group unless
302 * it has too many directories already (max_dirs) or
303 * it has too few free inodes left (min_inodes) or
304 * it has too few free blocks left (min_blocks) or
305 * it's already running too large debt (max_debt).
306 * Parent's group is preferred, if it doesn't satisfy these
307 * conditions we search cyclically through the rest. If none
308 * of the groups look good we just look for a group with more
309 * free inodes than average (starting at parent's group).
311 * Debt is incremented each time we allocate a directory and decremented
312 * when we allocate an inode, within 0--255.
315 #define INODE_COST 64
316 #define BLOCK_COST 256
318 static int find_group_orlov(struct super_block *sb, struct inode *parent,
321 ext4_group_t parent_group = EXT4_I(parent)->i_block_group;
322 struct ext4_sb_info *sbi = EXT4_SB(sb);
323 struct ext4_super_block *es = sbi->s_es;
324 ext4_group_t ngroups = sbi->s_groups_count;
325 int inodes_per_group = EXT4_INODES_PER_GROUP(sb);
326 unsigned int freei, avefreei;
327 ext4_fsblk_t freeb, avefreeb;
328 ext4_fsblk_t blocks_per_dir;
330 int max_debt, max_dirs, min_inodes;
331 ext4_grpblk_t min_blocks;
333 struct ext4_group_desc *desc;
335 freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter);
336 avefreei = freei / ngroups;
337 freeb = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
339 do_div(avefreeb, ngroups);
340 ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter);
342 if ((parent == sb->s_root->d_inode) ||
343 (EXT4_I(parent)->i_flags & EXT4_TOPDIR_FL)) {
344 int best_ndir = inodes_per_group;
348 get_random_bytes(&grp, sizeof(grp));
349 parent_group = (unsigned)grp % ngroups;
350 for (i = 0; i < ngroups; i++) {
351 grp = (parent_group + i) % ngroups;
352 desc = ext4_get_group_desc(sb, grp, NULL);
353 if (!desc || !desc->bg_free_inodes_count)
355 if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir)
357 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
359 if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb)
363 best_ndir = le16_to_cpu(desc->bg_used_dirs_count);
370 blocks_per_dir = ext4_blocks_count(es) - freeb;
371 do_div(blocks_per_dir, ndirs);
373 max_dirs = ndirs / ngroups + inodes_per_group / 16;
374 min_inodes = avefreei - inodes_per_group / 4;
375 min_blocks = avefreeb - EXT4_BLOCKS_PER_GROUP(sb) / 4;
377 max_debt = EXT4_BLOCKS_PER_GROUP(sb);
378 max_debt /= max_t(int, blocks_per_dir, BLOCK_COST);
379 if (max_debt * INODE_COST > inodes_per_group)
380 max_debt = inodes_per_group / INODE_COST;
386 for (i = 0; i < ngroups; i++) {
387 *group = (parent_group + i) % ngroups;
388 desc = ext4_get_group_desc(sb, *group, NULL);
389 if (!desc || !desc->bg_free_inodes_count)
391 if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs)
393 if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes)
395 if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks)
401 for (i = 0; i < ngroups; i++) {
402 *group = (parent_group + i) % ngroups;
403 desc = ext4_get_group_desc(sb, *group, NULL);
404 if (desc && desc->bg_free_inodes_count &&
405 le16_to_cpu(desc->bg_free_inodes_count) >= avefreei)
411 * The free-inodes counter is approximate, and for really small
412 * filesystems the above test can fail to find any blockgroups
421 static int find_group_other(struct super_block *sb, struct inode *parent,
424 ext4_group_t parent_group = EXT4_I(parent)->i_block_group;
425 ext4_group_t ngroups = EXT4_SB(sb)->s_groups_count;
426 struct ext4_group_desc *desc;
430 * Try to place the inode in its parent directory
432 *group = parent_group;
433 desc = ext4_get_group_desc(sb, *group, NULL);
434 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
435 le16_to_cpu(desc->bg_free_blocks_count))
439 * We're going to place this inode in a different blockgroup from its
440 * parent. We want to cause files in a common directory to all land in
441 * the same blockgroup. But we want files which are in a different
442 * directory which shares a blockgroup with our parent to land in a
443 * different blockgroup.
445 * So add our directory's i_ino into the starting point for the hash.
447 *group = (*group + parent->i_ino) % ngroups;
450 * Use a quadratic hash to find a group with a free inode and some free
453 for (i = 1; i < ngroups; i <<= 1) {
455 if (*group >= ngroups)
457 desc = ext4_get_group_desc(sb, *group, NULL);
458 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
459 le16_to_cpu(desc->bg_free_blocks_count))
464 * That failed: try linear search for a free inode, even if that group
465 * has no free blocks.
467 *group = parent_group;
468 for (i = 0; i < ngroups; i++) {
469 if (++*group >= ngroups)
471 desc = ext4_get_group_desc(sb, *group, NULL);
472 if (desc && le16_to_cpu(desc->bg_free_inodes_count))
480 * There are two policies for allocating an inode. If the new inode is
481 * a directory, then a forward search is made for a block group with both
482 * free space and a low directory-to-inode ratio; if that fails, then of
483 * the groups with above-average free space, that group with the fewest
484 * directories already is chosen.
486 * For other inodes, search forward from the parent directory's block
487 * group to find a free inode.
489 struct inode *ext4_new_inode(handle_t *handle, struct inode * dir, int mode)
491 struct super_block *sb;
492 struct buffer_head *bitmap_bh = NULL;
493 struct buffer_head *bh2;
494 ext4_group_t group = 0;
495 unsigned long ino = 0;
496 struct inode * inode;
497 struct ext4_group_desc * gdp = NULL;
498 struct ext4_super_block * es;
499 struct ext4_inode_info *ei;
500 struct ext4_sb_info *sbi;
506 /* Cannot create files in a deleted directory */
507 if (!dir || !dir->i_nlink)
508 return ERR_PTR(-EPERM);
511 inode = new_inode(sb);
513 return ERR_PTR(-ENOMEM);
519 if (test_opt (sb, OLDALLOC))
520 ret2 = find_group_dir(sb, dir, &group);
522 ret2 = find_group_orlov(sb, dir, &group);
524 ret2 = find_group_other(sb, dir, &group);
530 for (i = 0; i < sbi->s_groups_count; i++) {
533 gdp = ext4_get_group_desc(sb, group, &bh2);
538 bitmap_bh = read_inode_bitmap(sb, group);
544 repeat_in_this_group:
545 ino = ext4_find_next_zero_bit((unsigned long *)
546 bitmap_bh->b_data, EXT4_INODES_PER_GROUP(sb), ino);
547 if (ino < EXT4_INODES_PER_GROUP(sb)) {
549 BUFFER_TRACE(bitmap_bh, "get_write_access");
550 err = ext4_journal_get_write_access(handle, bitmap_bh);
554 if (!ext4_set_bit_atomic(sb_bgl_lock(sbi, group),
555 ino, bitmap_bh->b_data)) {
557 BUFFER_TRACE(bitmap_bh,
558 "call ext4_journal_dirty_metadata");
559 err = ext4_journal_dirty_metadata(handle,
566 jbd2_journal_release_buffer(handle, bitmap_bh);
568 if (++ino < EXT4_INODES_PER_GROUP(sb))
569 goto repeat_in_this_group;
573 * This case is possible in concurrent environment. It is very
574 * rare. We cannot repeat the find_group_xxx() call because
575 * that will simply return the same blockgroup, because the
576 * group descriptor metadata has not yet been updated.
577 * So we just go onto the next blockgroup.
579 if (++group == sbi->s_groups_count)
587 if ((group == 0 && ino < EXT4_FIRST_INO(sb)) ||
588 ino > EXT4_INODES_PER_GROUP(sb)) {
589 ext4_error(sb, __func__,
590 "reserved inode or inode > inodes count - "
591 "block_group = %lu, inode=%lu", group,
592 ino + group * EXT4_INODES_PER_GROUP(sb));
597 BUFFER_TRACE(bh2, "get_write_access");
598 err = ext4_journal_get_write_access(handle, bh2);
601 /* We may have to initialize the block bitmap if it isn't already */
602 if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM) &&
603 gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
604 struct buffer_head *block_bh = read_block_bitmap(sb, group);
606 BUFFER_TRACE(block_bh, "get block bitmap access");
607 err = ext4_journal_get_write_access(handle, block_bh);
614 spin_lock(sb_bgl_lock(sbi, group));
615 /* recheck and clear flag under lock if we still need to */
616 if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
617 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT);
618 free = ext4_free_blocks_after_init(sb, group, gdp);
619 gdp->bg_free_blocks_count = cpu_to_le16(free);
621 spin_unlock(sb_bgl_lock(sbi, group));
623 /* Don't need to dirty bitmap block if we didn't change it */
625 BUFFER_TRACE(block_bh, "dirty block bitmap");
626 err = ext4_journal_dirty_metadata(handle, block_bh);
634 spin_lock(sb_bgl_lock(sbi, group));
635 /* If we didn't allocate from within the initialized part of the inode
636 * table then we need to initialize up to this inode. */
637 if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) {
638 if (gdp->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) {
639 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_INODE_UNINIT);
641 /* When marking the block group with
642 * ~EXT4_BG_INODE_UNINIT we don't want to depend
643 * on the value of bg_itable_unsed even though
644 * mke2fs could have initialized the same for us.
645 * Instead we calculated the value below
650 free = EXT4_INODES_PER_GROUP(sb) -
651 le16_to_cpu(gdp->bg_itable_unused);
655 * Check the relative inode number against the last used
656 * relative inode number in this group. if it is greater
657 * we need to update the bg_itable_unused count
661 gdp->bg_itable_unused =
662 cpu_to_le16(EXT4_INODES_PER_GROUP(sb) - ino);
665 le16_add_cpu(&gdp->bg_free_inodes_count, -1);
667 le16_add_cpu(&gdp->bg_used_dirs_count, 1);
669 gdp->bg_checksum = ext4_group_desc_csum(sbi, group, gdp);
670 spin_unlock(sb_bgl_lock(sbi, group));
671 BUFFER_TRACE(bh2, "call ext4_journal_dirty_metadata");
672 err = ext4_journal_dirty_metadata(handle, bh2);
675 percpu_counter_dec(&sbi->s_freeinodes_counter);
677 percpu_counter_inc(&sbi->s_dirs_counter);
680 inode->i_uid = current->fsuid;
681 if (test_opt (sb, GRPID))
682 inode->i_gid = dir->i_gid;
683 else if (dir->i_mode & S_ISGID) {
684 inode->i_gid = dir->i_gid;
688 inode->i_gid = current->fsgid;
689 inode->i_mode = mode;
691 inode->i_ino = ino + group * EXT4_INODES_PER_GROUP(sb);
692 /* This is the optimal IO size (for stat), not the fs block size */
694 inode->i_mtime = inode->i_atime = inode->i_ctime = ei->i_crtime =
695 ext4_current_time(inode);
697 memset(ei->i_data, 0, sizeof(ei->i_data));
698 ei->i_dir_start_lookup = 0;
702 * Don't inherit extent flag from directory. We set extent flag on
703 * newly created directory and file only if -o extent mount option is
706 ei->i_flags = EXT4_I(dir)->i_flags & ~(EXT4_INDEX_FL|EXT4_EXTENTS_FL);
708 ei->i_flags &= ~(EXT4_IMMUTABLE_FL|EXT4_APPEND_FL);
709 /* dirsync only applies to directories */
711 ei->i_flags &= ~EXT4_DIRSYNC_FL;
714 ei->i_block_alloc_info = NULL;
715 ei->i_block_group = group;
717 ext4_set_inode_flags(inode);
718 if (IS_DIRSYNC(inode))
720 insert_inode_hash(inode);
721 spin_lock(&sbi->s_next_gen_lock);
722 inode->i_generation = sbi->s_next_generation++;
723 spin_unlock(&sbi->s_next_gen_lock);
725 ei->i_state = EXT4_STATE_NEW;
727 ei->i_extra_isize = EXT4_SB(sb)->s_want_extra_isize;
730 if(DQUOT_ALLOC_INODE(inode)) {
735 err = ext4_init_acl(handle, inode, dir);
739 err = ext4_init_security(handle,inode, dir);
743 err = ext4_mark_inode_dirty(handle, inode);
745 ext4_std_error(sb, err);
748 if (test_opt(sb, EXTENTS)) {
749 /* set extent flag only for diretory, file and normal symlink*/
750 if (S_ISDIR(mode) || S_ISREG(mode) || S_ISLNK(mode)) {
751 EXT4_I(inode)->i_flags |= EXT4_EXTENTS_FL;
752 ext4_ext_tree_init(handle, inode);
753 err = ext4_update_incompat_feature(handle, sb,
754 EXT4_FEATURE_INCOMPAT_EXTENTS);
760 ext4_debug("allocating inode %lu\n", inode->i_ino);
763 ext4_std_error(sb, err);
772 DQUOT_FREE_INODE(inode);
776 inode->i_flags |= S_NOQUOTA;
783 /* Verify that we are loading a valid orphan from disk */
784 struct inode *ext4_orphan_get(struct super_block *sb, unsigned long ino)
786 unsigned long max_ino = le32_to_cpu(EXT4_SB(sb)->s_es->s_inodes_count);
787 ext4_group_t block_group;
789 struct buffer_head *bitmap_bh;
790 struct inode *inode = NULL;
793 /* Error cases - e2fsck has already cleaned up for us */
795 ext4_warning(sb, __func__,
796 "bad orphan ino %lu! e2fsck was run?", ino);
800 block_group = (ino - 1) / EXT4_INODES_PER_GROUP(sb);
801 bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb);
802 bitmap_bh = read_inode_bitmap(sb, block_group);
804 ext4_warning(sb, __func__,
805 "inode bitmap error for orphan %lu", ino);
809 /* Having the inode bit set should be a 100% indicator that this
810 * is a valid orphan (no e2fsck run on fs). Orphans also include
811 * inodes that were being truncated, so we can't check i_nlink==0.
813 if (!ext4_test_bit(bit, bitmap_bh->b_data))
816 inode = ext4_iget(sb, ino);
820 if (NEXT_ORPHAN(inode) > max_ino)
826 err = PTR_ERR(inode);
829 ext4_warning(sb, __func__,
830 "bad orphan inode %lu! e2fsck was run?", ino);
831 printk(KERN_NOTICE "ext4_test_bit(bit=%d, block=%llu) = %d\n",
832 bit, (unsigned long long)bitmap_bh->b_blocknr,
833 ext4_test_bit(bit, bitmap_bh->b_data));
834 printk(KERN_NOTICE "inode=%p\n", inode);
836 printk(KERN_NOTICE "is_bad_inode(inode)=%d\n",
837 is_bad_inode(inode));
838 printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
840 printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
841 /* Avoid freeing blocks if we got a bad deleted inode */
842 if (inode->i_nlink == 0)
851 unsigned long ext4_count_free_inodes (struct super_block * sb)
853 unsigned long desc_count;
854 struct ext4_group_desc *gdp;
857 struct ext4_super_block *es;
858 unsigned long bitmap_count, x;
859 struct buffer_head *bitmap_bh = NULL;
861 es = EXT4_SB(sb)->s_es;
865 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
866 gdp = ext4_get_group_desc (sb, i, NULL);
869 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
871 bitmap_bh = read_inode_bitmap(sb, i);
875 x = ext4_count_free(bitmap_bh, EXT4_INODES_PER_GROUP(sb) / 8);
876 printk(KERN_DEBUG "group %lu: stored = %d, counted = %lu\n",
877 i, le16_to_cpu(gdp->bg_free_inodes_count), x);
881 printk("ext4_count_free_inodes: stored = %u, computed = %lu, %lu\n",
882 le32_to_cpu(es->s_free_inodes_count), desc_count, bitmap_count);
886 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
887 gdp = ext4_get_group_desc (sb, i, NULL);
890 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
897 /* Called at mount-time, super-block is locked */
898 unsigned long ext4_count_dirs (struct super_block * sb)
900 unsigned long count = 0;
903 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
904 struct ext4_group_desc *gdp = ext4_get_group_desc (sb, i, NULL);
907 count += le16_to_cpu(gdp->bg_used_dirs_count);