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/stat.h>
19 #include <linux/string.h>
20 #include <linux/quotaops.h>
21 #include <linux/buffer_head.h>
22 #include <linux/random.h>
23 #include <linux/bitops.h>
24 #include <linux/blkdev.h>
25 #include <asm/byteorder.h>
27 #include "ext4_jbd2.h"
33 * ialloc.c contains the inodes allocation and deallocation routines
37 * The free inodes are managed by bitmaps. A file system contains several
38 * blocks groups. Each group contains 1 bitmap block for blocks, 1 bitmap
39 * block for inodes, N blocks for the inode table and data blocks.
41 * The file system contains group descriptors which are located after the
42 * super block. Each descriptor contains the number of the bitmap block and
43 * the free blocks count in the block.
47 * To avoid calling the atomic setbit hundreds or thousands of times, we only
48 * need to use it within a single byte (to ensure we get endianness right).
49 * We can use memset for the rest of the bitmap as there are no other users.
51 void mark_bitmap_end(int start_bit, int end_bit, char *bitmap)
55 if (start_bit >= end_bit)
58 ext4_debug("mark end bits +%d through +%d used\n", start_bit, end_bit);
59 for (i = start_bit; i < ((start_bit + 7) & ~7UL); i++)
60 ext4_set_bit(i, bitmap);
62 memset(bitmap + (i >> 3), 0xff, (end_bit - i) >> 3);
65 /* Initializes an uninitialized inode bitmap */
66 unsigned ext4_init_inode_bitmap(struct super_block *sb, struct buffer_head *bh,
67 ext4_group_t block_group,
68 struct ext4_group_desc *gdp)
70 struct ext4_sb_info *sbi = EXT4_SB(sb);
72 J_ASSERT_BH(bh, buffer_locked(bh));
74 /* If checksum is bad mark all blocks and inodes use to prevent
75 * allocation, essentially implementing a per-group read-only flag. */
76 if (!ext4_group_desc_csum_verify(sbi, block_group, gdp)) {
77 ext4_error(sb, __func__, "Checksum bad for group %lu\n",
79 gdp->bg_free_blocks_count = 0;
80 gdp->bg_free_inodes_count = 0;
81 gdp->bg_itable_unused = 0;
82 memset(bh->b_data, 0xff, sb->s_blocksize);
86 memset(bh->b_data, 0, (EXT4_INODES_PER_GROUP(sb) + 7) / 8);
87 mark_bitmap_end(EXT4_INODES_PER_GROUP(sb), EXT4_BLOCKS_PER_GROUP(sb),
90 return EXT4_INODES_PER_GROUP(sb);
94 * Read the inode allocation bitmap for a given block_group, reading
95 * into the specified slot in the superblock's bitmap cache.
97 * Return buffer_head of bitmap on success or NULL.
99 static struct buffer_head *
100 read_inode_bitmap(struct super_block *sb, ext4_group_t block_group)
102 struct ext4_group_desc *desc;
103 struct buffer_head *bh = NULL;
105 desc = ext4_get_group_desc(sb, block_group, NULL);
108 if (desc->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) {
109 bh = sb_getblk(sb, ext4_inode_bitmap(sb, desc));
110 if (!buffer_uptodate(bh)) {
112 if (!buffer_uptodate(bh)) {
113 ext4_init_inode_bitmap(sb, bh, block_group,
115 set_buffer_uptodate(bh);
120 bh = sb_bread(sb, ext4_inode_bitmap(sb, desc));
123 ext4_error(sb, "read_inode_bitmap",
124 "Cannot read inode bitmap - "
125 "block_group = %lu, inode_bitmap = %llu",
126 block_group, ext4_inode_bitmap(sb, desc));
132 * NOTE! When we get the inode, we're the only people
133 * that have access to it, and as such there are no
134 * race conditions we have to worry about. The inode
135 * is not on the hash-lists, and it cannot be reached
136 * through the filesystem because the directory entry
137 * has been deleted earlier.
139 * HOWEVER: we must make sure that we get no aliases,
140 * which means that we have to call "clear_inode()"
141 * _before_ we mark the inode not in use in the inode
142 * bitmaps. Otherwise a newly created file might use
143 * the same inode number (not actually the same pointer
144 * though), and then we'd have two inodes sharing the
145 * same inode number and space on the harddisk.
147 void ext4_free_inode (handle_t *handle, struct inode * inode)
149 struct super_block * sb = inode->i_sb;
152 struct buffer_head *bitmap_bh = NULL;
153 struct buffer_head *bh2;
154 ext4_group_t block_group;
156 struct ext4_group_desc * gdp;
157 struct ext4_super_block * es;
158 struct ext4_sb_info *sbi;
160 ext4_group_t flex_group;
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);
236 if (sbi->s_log_groups_per_flex) {
237 flex_group = ext4_flex_group(sbi, block_group);
238 spin_lock(sb_bgl_lock(sbi, flex_group));
239 sbi->s_flex_groups[flex_group].free_inodes++;
240 spin_unlock(sb_bgl_lock(sbi, flex_group));
243 BUFFER_TRACE(bh2, "call ext4_journal_dirty_metadata");
244 err = ext4_journal_dirty_metadata(handle, bh2);
245 if (!fatal) fatal = err;
247 BUFFER_TRACE(bitmap_bh, "call ext4_journal_dirty_metadata");
248 err = ext4_journal_dirty_metadata(handle, bitmap_bh);
254 ext4_std_error(sb, fatal);
258 * There are two policies for allocating an inode. If the new inode is
259 * a directory, then a forward search is made for a block group with both
260 * free space and a low directory-to-inode ratio; if that fails, then of
261 * the groups with above-average free space, that group with the fewest
262 * directories already is chosen.
264 * For other inodes, search forward from the parent directory\'s block
265 * group to find a free inode.
267 static int find_group_dir(struct super_block *sb, struct inode *parent,
268 ext4_group_t *best_group)
270 ext4_group_t ngroups = EXT4_SB(sb)->s_groups_count;
271 unsigned int freei, avefreei;
272 struct ext4_group_desc *desc, *best_desc = NULL;
276 freei = percpu_counter_read_positive(&EXT4_SB(sb)->s_freeinodes_counter);
277 avefreei = freei / ngroups;
279 for (group = 0; group < ngroups; group++) {
280 desc = ext4_get_group_desc (sb, group, NULL);
281 if (!desc || !desc->bg_free_inodes_count)
283 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
286 (le16_to_cpu(desc->bg_free_blocks_count) >
287 le16_to_cpu(best_desc->bg_free_blocks_count))) {
296 #define free_block_ratio 10
298 static int find_group_flex(struct super_block *sb, struct inode *parent,
299 ext4_group_t *best_group)
301 struct ext4_sb_info *sbi = EXT4_SB(sb);
302 struct ext4_group_desc *desc;
303 struct buffer_head *bh;
304 struct flex_groups *flex_group = sbi->s_flex_groups;
305 ext4_group_t parent_group = EXT4_I(parent)->i_block_group;
306 ext4_group_t parent_fbg_group = ext4_flex_group(sbi, parent_group);
307 ext4_group_t ngroups = sbi->s_groups_count;
308 int flex_size = ext4_flex_bg_size(sbi);
309 ext4_group_t best_flex = parent_fbg_group;
310 int blocks_per_flex = sbi->s_blocks_per_group * flex_size;
311 int flexbg_free_blocks;
312 int flex_freeb_ratio;
313 ext4_group_t n_fbg_groups;
316 n_fbg_groups = (sbi->s_groups_count + flex_size - 1) >>
317 sbi->s_log_groups_per_flex;
319 find_close_to_parent:
320 flexbg_free_blocks = flex_group[best_flex].free_blocks;
321 flex_freeb_ratio = flexbg_free_blocks * 100 / blocks_per_flex;
322 if (flex_group[best_flex].free_inodes &&
323 flex_freeb_ratio > free_block_ratio)
326 if (best_flex && best_flex == parent_fbg_group) {
328 goto find_close_to_parent;
331 for (i = 0; i < n_fbg_groups; i++) {
332 if (i == parent_fbg_group || i == parent_fbg_group - 1)
335 flexbg_free_blocks = flex_group[i].free_blocks;
336 flex_freeb_ratio = flexbg_free_blocks * 100 / blocks_per_flex;
338 if (flex_freeb_ratio > free_block_ratio &&
339 flex_group[i].free_inodes) {
345 (flex_group[i].free_blocks >
346 flex_group[best_flex].free_blocks &&
347 flex_group[i].free_inodes))
351 if (!flex_group[best_flex].free_inodes ||
352 !flex_group[best_flex].free_blocks)
356 for (i = best_flex * flex_size; i < ngroups &&
357 i < (best_flex + 1) * flex_size; i++) {
358 desc = ext4_get_group_desc(sb, i, &bh);
359 if (le16_to_cpu(desc->bg_free_inodes_count)) {
371 * Orlov's allocator for directories.
373 * We always try to spread first-level directories.
375 * If there are blockgroups with both free inodes and free blocks counts
376 * not worse than average we return one with smallest directory count.
377 * Otherwise we simply return a random group.
379 * For the rest rules look so:
381 * It's OK to put directory into a group unless
382 * it has too many directories already (max_dirs) or
383 * it has too few free inodes left (min_inodes) or
384 * it has too few free blocks left (min_blocks) or
385 * it's already running too large debt (max_debt).
386 * Parent's group is preferred, if it doesn't satisfy these
387 * conditions we search cyclically through the rest. If none
388 * of the groups look good we just look for a group with more
389 * free inodes than average (starting at parent's group).
391 * Debt is incremented each time we allocate a directory and decremented
392 * when we allocate an inode, within 0--255.
395 #define INODE_COST 64
396 #define BLOCK_COST 256
398 static int find_group_orlov(struct super_block *sb, struct inode *parent,
401 ext4_group_t parent_group = EXT4_I(parent)->i_block_group;
402 struct ext4_sb_info *sbi = EXT4_SB(sb);
403 struct ext4_super_block *es = sbi->s_es;
404 ext4_group_t ngroups = sbi->s_groups_count;
405 int inodes_per_group = EXT4_INODES_PER_GROUP(sb);
406 unsigned int freei, avefreei;
407 ext4_fsblk_t freeb, avefreeb;
408 ext4_fsblk_t blocks_per_dir;
410 int max_debt, max_dirs, min_inodes;
411 ext4_grpblk_t min_blocks;
413 struct ext4_group_desc *desc;
415 freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter);
416 avefreei = freei / ngroups;
417 freeb = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
419 do_div(avefreeb, ngroups);
420 ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter);
422 if ((parent == sb->s_root->d_inode) ||
423 (EXT4_I(parent)->i_flags & EXT4_TOPDIR_FL)) {
424 int best_ndir = inodes_per_group;
428 get_random_bytes(&grp, sizeof(grp));
429 parent_group = (unsigned)grp % ngroups;
430 for (i = 0; i < ngroups; i++) {
431 grp = (parent_group + i) % ngroups;
432 desc = ext4_get_group_desc(sb, grp, NULL);
433 if (!desc || !desc->bg_free_inodes_count)
435 if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir)
437 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
439 if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb)
443 best_ndir = le16_to_cpu(desc->bg_used_dirs_count);
450 blocks_per_dir = ext4_blocks_count(es) - freeb;
451 do_div(blocks_per_dir, ndirs);
453 max_dirs = ndirs / ngroups + inodes_per_group / 16;
454 min_inodes = avefreei - inodes_per_group / 4;
455 min_blocks = avefreeb - EXT4_BLOCKS_PER_GROUP(sb) / 4;
457 max_debt = EXT4_BLOCKS_PER_GROUP(sb);
458 max_debt /= max_t(int, blocks_per_dir, BLOCK_COST);
459 if (max_debt * INODE_COST > inodes_per_group)
460 max_debt = inodes_per_group / INODE_COST;
466 for (i = 0; i < ngroups; i++) {
467 *group = (parent_group + i) % ngroups;
468 desc = ext4_get_group_desc(sb, *group, NULL);
469 if (!desc || !desc->bg_free_inodes_count)
471 if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs)
473 if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes)
475 if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks)
481 for (i = 0; i < ngroups; i++) {
482 *group = (parent_group + i) % ngroups;
483 desc = ext4_get_group_desc(sb, *group, NULL);
484 if (desc && desc->bg_free_inodes_count &&
485 le16_to_cpu(desc->bg_free_inodes_count) >= avefreei)
491 * The free-inodes counter is approximate, and for really small
492 * filesystems the above test can fail to find any blockgroups
501 static int find_group_other(struct super_block *sb, struct inode *parent,
504 ext4_group_t parent_group = EXT4_I(parent)->i_block_group;
505 ext4_group_t ngroups = EXT4_SB(sb)->s_groups_count;
506 struct ext4_group_desc *desc;
510 * Try to place the inode in its parent directory
512 *group = parent_group;
513 desc = ext4_get_group_desc(sb, *group, NULL);
514 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
515 le16_to_cpu(desc->bg_free_blocks_count))
519 * We're going to place this inode in a different blockgroup from its
520 * parent. We want to cause files in a common directory to all land in
521 * the same blockgroup. But we want files which are in a different
522 * directory which shares a blockgroup with our parent to land in a
523 * different blockgroup.
525 * So add our directory's i_ino into the starting point for the hash.
527 *group = (*group + parent->i_ino) % ngroups;
530 * Use a quadratic hash to find a group with a free inode and some free
533 for (i = 1; i < ngroups; i <<= 1) {
535 if (*group >= ngroups)
537 desc = ext4_get_group_desc(sb, *group, NULL);
538 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
539 le16_to_cpu(desc->bg_free_blocks_count))
544 * That failed: try linear search for a free inode, even if that group
545 * has no free blocks.
547 *group = parent_group;
548 for (i = 0; i < ngroups; i++) {
549 if (++*group >= ngroups)
551 desc = ext4_get_group_desc(sb, *group, NULL);
552 if (desc && le16_to_cpu(desc->bg_free_inodes_count))
560 * There are two policies for allocating an inode. If the new inode is
561 * a directory, then a forward search is made for a block group with both
562 * free space and a low directory-to-inode ratio; if that fails, then of
563 * the groups with above-average free space, that group with the fewest
564 * directories already is chosen.
566 * For other inodes, search forward from the parent directory's block
567 * group to find a free inode.
569 struct inode *ext4_new_inode(handle_t *handle, struct inode * dir, int mode)
571 struct super_block *sb;
572 struct buffer_head *bitmap_bh = NULL;
573 struct buffer_head *bh2;
574 ext4_group_t group = 0;
575 unsigned long ino = 0;
576 struct inode * inode;
577 struct ext4_group_desc * gdp = NULL;
578 struct ext4_super_block * es;
579 struct ext4_inode_info *ei;
580 struct ext4_sb_info *sbi;
585 ext4_group_t flex_group;
587 /* Cannot create files in a deleted directory */
588 if (!dir || !dir->i_nlink)
589 return ERR_PTR(-EPERM);
592 inode = new_inode(sb);
594 return ERR_PTR(-ENOMEM);
600 if (sbi->s_log_groups_per_flex) {
601 ret2 = find_group_flex(sb, dir, &group);
606 if (test_opt (sb, OLDALLOC))
607 ret2 = find_group_dir(sb, dir, &group);
609 ret2 = find_group_orlov(sb, dir, &group);
611 ret2 = find_group_other(sb, dir, &group);
618 for (i = 0; i < sbi->s_groups_count; i++) {
621 gdp = ext4_get_group_desc(sb, group, &bh2);
626 bitmap_bh = read_inode_bitmap(sb, group);
632 repeat_in_this_group:
633 ino = ext4_find_next_zero_bit((unsigned long *)
634 bitmap_bh->b_data, EXT4_INODES_PER_GROUP(sb), ino);
635 if (ino < EXT4_INODES_PER_GROUP(sb)) {
637 BUFFER_TRACE(bitmap_bh, "get_write_access");
638 err = ext4_journal_get_write_access(handle, bitmap_bh);
642 if (!ext4_set_bit_atomic(sb_bgl_lock(sbi, group),
643 ino, bitmap_bh->b_data)) {
645 BUFFER_TRACE(bitmap_bh,
646 "call ext4_journal_dirty_metadata");
647 err = ext4_journal_dirty_metadata(handle,
654 jbd2_journal_release_buffer(handle, bitmap_bh);
656 if (++ino < EXT4_INODES_PER_GROUP(sb))
657 goto repeat_in_this_group;
661 * This case is possible in concurrent environment. It is very
662 * rare. We cannot repeat the find_group_xxx() call because
663 * that will simply return the same blockgroup, because the
664 * group descriptor metadata has not yet been updated.
665 * So we just go onto the next blockgroup.
667 if (++group == sbi->s_groups_count)
675 if ((group == 0 && ino < EXT4_FIRST_INO(sb)) ||
676 ino > EXT4_INODES_PER_GROUP(sb)) {
677 ext4_error(sb, __func__,
678 "reserved inode or inode > inodes count - "
679 "block_group = %lu, inode=%lu", group,
680 ino + group * EXT4_INODES_PER_GROUP(sb));
685 BUFFER_TRACE(bh2, "get_write_access");
686 err = ext4_journal_get_write_access(handle, bh2);
689 /* We may have to initialize the block bitmap if it isn't already */
690 if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM) &&
691 gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
692 struct buffer_head *block_bh = ext4_read_block_bitmap(sb, group);
694 BUFFER_TRACE(block_bh, "get block bitmap access");
695 err = ext4_journal_get_write_access(handle, block_bh);
702 spin_lock(sb_bgl_lock(sbi, group));
703 /* recheck and clear flag under lock if we still need to */
704 if (gdp->bg_flags & cpu_to_le16(EXT4_BG_BLOCK_UNINIT)) {
705 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_BLOCK_UNINIT);
706 free = ext4_free_blocks_after_init(sb, group, gdp);
707 gdp->bg_free_blocks_count = cpu_to_le16(free);
709 spin_unlock(sb_bgl_lock(sbi, group));
711 /* Don't need to dirty bitmap block if we didn't change it */
713 BUFFER_TRACE(block_bh, "dirty block bitmap");
714 err = ext4_journal_dirty_metadata(handle, block_bh);
722 spin_lock(sb_bgl_lock(sbi, group));
723 /* If we didn't allocate from within the initialized part of the inode
724 * table then we need to initialize up to this inode. */
725 if (EXT4_HAS_RO_COMPAT_FEATURE(sb, EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) {
726 if (gdp->bg_flags & cpu_to_le16(EXT4_BG_INODE_UNINIT)) {
727 gdp->bg_flags &= cpu_to_le16(~EXT4_BG_INODE_UNINIT);
729 /* When marking the block group with
730 * ~EXT4_BG_INODE_UNINIT we don't want to depend
731 * on the value of bg_itable_unsed even though
732 * mke2fs could have initialized the same for us.
733 * Instead we calculated the value below
738 free = EXT4_INODES_PER_GROUP(sb) -
739 le16_to_cpu(gdp->bg_itable_unused);
743 * Check the relative inode number against the last used
744 * relative inode number in this group. if it is greater
745 * we need to update the bg_itable_unused count
749 gdp->bg_itable_unused =
750 cpu_to_le16(EXT4_INODES_PER_GROUP(sb) - ino);
753 le16_add_cpu(&gdp->bg_free_inodes_count, -1);
755 le16_add_cpu(&gdp->bg_used_dirs_count, 1);
757 gdp->bg_checksum = ext4_group_desc_csum(sbi, group, gdp);
758 spin_unlock(sb_bgl_lock(sbi, group));
759 BUFFER_TRACE(bh2, "call ext4_journal_dirty_metadata");
760 err = ext4_journal_dirty_metadata(handle, bh2);
763 percpu_counter_dec(&sbi->s_freeinodes_counter);
765 percpu_counter_inc(&sbi->s_dirs_counter);
768 if (sbi->s_log_groups_per_flex) {
769 flex_group = ext4_flex_group(sbi, group);
770 spin_lock(sb_bgl_lock(sbi, flex_group));
771 sbi->s_flex_groups[flex_group].free_inodes--;
772 spin_unlock(sb_bgl_lock(sbi, flex_group));
775 inode->i_uid = current->fsuid;
776 if (test_opt (sb, GRPID))
777 inode->i_gid = dir->i_gid;
778 else if (dir->i_mode & S_ISGID) {
779 inode->i_gid = dir->i_gid;
783 inode->i_gid = current->fsgid;
784 inode->i_mode = mode;
786 inode->i_ino = ino + group * EXT4_INODES_PER_GROUP(sb);
787 /* This is the optimal IO size (for stat), not the fs block size */
789 inode->i_mtime = inode->i_atime = inode->i_ctime = ei->i_crtime =
790 ext4_current_time(inode);
792 memset(ei->i_data, 0, sizeof(ei->i_data));
793 ei->i_dir_start_lookup = 0;
797 * Don't inherit extent flag from directory. We set extent flag on
798 * newly created directory and file only if -o extent mount option is
801 ei->i_flags = EXT4_I(dir)->i_flags & ~(EXT4_INDEX_FL|EXT4_EXTENTS_FL);
803 ei->i_flags &= ~(EXT4_IMMUTABLE_FL|EXT4_APPEND_FL);
804 /* dirsync only applies to directories */
806 ei->i_flags &= ~EXT4_DIRSYNC_FL;
809 ei->i_block_alloc_info = NULL;
810 ei->i_block_group = group;
812 ext4_set_inode_flags(inode);
813 if (IS_DIRSYNC(inode))
815 insert_inode_hash(inode);
816 spin_lock(&sbi->s_next_gen_lock);
817 inode->i_generation = sbi->s_next_generation++;
818 spin_unlock(&sbi->s_next_gen_lock);
820 ei->i_state = EXT4_STATE_NEW;
822 ei->i_extra_isize = EXT4_SB(sb)->s_want_extra_isize;
825 if(DQUOT_ALLOC_INODE(inode)) {
830 err = ext4_init_acl(handle, inode, dir);
834 err = ext4_init_security(handle,inode, dir);
838 if (test_opt(sb, EXTENTS)) {
839 /* set extent flag only for directory, file and normal symlink*/
840 if (S_ISDIR(mode) || S_ISREG(mode) || S_ISLNK(mode)) {
841 EXT4_I(inode)->i_flags |= EXT4_EXTENTS_FL;
842 ext4_ext_tree_init(handle, inode);
846 err = ext4_mark_inode_dirty(handle, inode);
848 ext4_std_error(sb, err);
852 ext4_debug("allocating inode %lu\n", inode->i_ino);
855 ext4_std_error(sb, err);
864 DQUOT_FREE_INODE(inode);
868 inode->i_flags |= S_NOQUOTA;
875 /* Verify that we are loading a valid orphan from disk */
876 struct inode *ext4_orphan_get(struct super_block *sb, unsigned long ino)
878 unsigned long max_ino = le32_to_cpu(EXT4_SB(sb)->s_es->s_inodes_count);
879 ext4_group_t block_group;
881 struct buffer_head *bitmap_bh;
882 struct inode *inode = NULL;
885 /* Error cases - e2fsck has already cleaned up for us */
887 ext4_warning(sb, __func__,
888 "bad orphan ino %lu! e2fsck was run?", ino);
892 block_group = (ino - 1) / EXT4_INODES_PER_GROUP(sb);
893 bit = (ino - 1) % EXT4_INODES_PER_GROUP(sb);
894 bitmap_bh = read_inode_bitmap(sb, block_group);
896 ext4_warning(sb, __func__,
897 "inode bitmap error for orphan %lu", ino);
901 /* Having the inode bit set should be a 100% indicator that this
902 * is a valid orphan (no e2fsck run on fs). Orphans also include
903 * inodes that were being truncated, so we can't check i_nlink==0.
905 if (!ext4_test_bit(bit, bitmap_bh->b_data))
908 inode = ext4_iget(sb, ino);
913 * If the orphans has i_nlinks > 0 then it should be able to be
914 * truncated, otherwise it won't be removed from the orphan list
915 * during processing and an infinite loop will result.
917 if (inode->i_nlink && !ext4_can_truncate(inode))
920 if (NEXT_ORPHAN(inode) > max_ino)
926 err = PTR_ERR(inode);
929 ext4_warning(sb, __func__,
930 "bad orphan inode %lu! e2fsck was run?", ino);
931 printk(KERN_NOTICE "ext4_test_bit(bit=%d, block=%llu) = %d\n",
932 bit, (unsigned long long)bitmap_bh->b_blocknr,
933 ext4_test_bit(bit, bitmap_bh->b_data));
934 printk(KERN_NOTICE "inode=%p\n", inode);
936 printk(KERN_NOTICE "is_bad_inode(inode)=%d\n",
937 is_bad_inode(inode));
938 printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
940 printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
941 printk(KERN_NOTICE "i_nlink=%u\n", inode->i_nlink);
942 /* Avoid freeing blocks if we got a bad deleted inode */
943 if (inode->i_nlink == 0)
952 unsigned long ext4_count_free_inodes (struct super_block * sb)
954 unsigned long desc_count;
955 struct ext4_group_desc *gdp;
958 struct ext4_super_block *es;
959 unsigned long bitmap_count, x;
960 struct buffer_head *bitmap_bh = NULL;
962 es = EXT4_SB(sb)->s_es;
966 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
967 gdp = ext4_get_group_desc (sb, i, NULL);
970 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
972 bitmap_bh = read_inode_bitmap(sb, i);
976 x = ext4_count_free(bitmap_bh, EXT4_INODES_PER_GROUP(sb) / 8);
977 printk(KERN_DEBUG "group %lu: stored = %d, counted = %lu\n",
978 i, le16_to_cpu(gdp->bg_free_inodes_count), x);
982 printk("ext4_count_free_inodes: stored = %u, computed = %lu, %lu\n",
983 le32_to_cpu(es->s_free_inodes_count), desc_count, bitmap_count);
987 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
988 gdp = ext4_get_group_desc (sb, i, NULL);
991 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
998 /* Called at mount-time, super-block is locked */
999 unsigned long ext4_count_dirs (struct super_block * sb)
1001 unsigned long count = 0;
1004 for (i = 0; i < EXT4_SB(sb)->s_groups_count; i++) {
1005 struct ext4_group_desc *gdp = ext4_get_group_desc (sb, i, NULL);
1008 count += le16_to_cpu(gdp->bg_used_dirs_count);