2 * linux/fs/ext3/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/jbd.h>
18 #include <linux/ext3_fs.h>
19 #include <linux/ext3_jbd.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/vs_dlimit.h>
28 #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.
49 * Read the inode allocation bitmap for a given block_group, reading
50 * into the specified slot in the superblock's bitmap cache.
52 * Return buffer_head of bitmap on success or NULL.
54 static struct buffer_head *
55 read_inode_bitmap(struct super_block * sb, unsigned long block_group)
57 struct ext3_group_desc *desc;
58 struct buffer_head *bh = NULL;
60 desc = ext3_get_group_desc(sb, block_group, NULL);
64 bh = sb_bread(sb, le32_to_cpu(desc->bg_inode_bitmap));
66 ext3_error(sb, "read_inode_bitmap",
67 "Cannot read inode bitmap - "
68 "block_group = %lu, inode_bitmap = %u",
69 block_group, le32_to_cpu(desc->bg_inode_bitmap));
75 * NOTE! When we get the inode, we're the only people
76 * that have access to it, and as such there are no
77 * race conditions we have to worry about. The inode
78 * is not on the hash-lists, and it cannot be reached
79 * through the filesystem because the directory entry
80 * has been deleted earlier.
82 * HOWEVER: we must make sure that we get no aliases,
83 * which means that we have to call "clear_inode()"
84 * _before_ we mark the inode not in use in the inode
85 * bitmaps. Otherwise a newly created file might use
86 * the same inode number (not actually the same pointer
87 * though), and then we'd have two inodes sharing the
88 * same inode number and space on the harddisk.
90 void ext3_free_inode (handle_t *handle, struct inode * inode)
92 struct super_block * sb = inode->i_sb;
95 struct buffer_head *bitmap_bh = NULL;
96 struct buffer_head *bh2;
97 unsigned long block_group;
99 struct ext3_group_desc * gdp;
100 struct ext3_super_block * es;
101 struct ext3_sb_info *sbi;
104 if (atomic_read(&inode->i_count) > 1) {
105 printk ("ext3_free_inode: inode has count=%d\n",
106 atomic_read(&inode->i_count));
109 if (inode->i_nlink) {
110 printk ("ext3_free_inode: inode has nlink=%d\n",
115 printk("ext3_free_inode: inode on nonexistent device\n");
121 ext3_debug ("freeing inode %lu\n", ino);
124 * Note: we must free any quota before locking the superblock,
125 * as writing the quota to disk may need the lock as well.
128 ext3_xattr_delete_inode(handle, inode);
129 DLIMIT_FREE_INODE(sb, inode->i_xid);
130 DQUOT_FREE_INODE(inode);
133 is_directory = S_ISDIR(inode->i_mode);
135 /* Do this BEFORE marking the inode not in use or returning an error */
138 es = EXT3_SB(sb)->s_es;
139 if (ino < EXT3_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
140 ext3_error (sb, "ext3_free_inode",
141 "reserved or nonexistent inode %lu", ino);
144 block_group = (ino - 1) / EXT3_INODES_PER_GROUP(sb);
145 bit = (ino - 1) % EXT3_INODES_PER_GROUP(sb);
146 bitmap_bh = read_inode_bitmap(sb, block_group);
150 BUFFER_TRACE(bitmap_bh, "get_write_access");
151 fatal = ext3_journal_get_write_access(handle, bitmap_bh);
155 /* Ok, now we can actually update the inode bitmaps.. */
156 if (!ext3_clear_bit_atomic(sb_bgl_lock(sbi, block_group),
157 bit, bitmap_bh->b_data))
158 ext3_error (sb, "ext3_free_inode",
159 "bit already cleared for inode %lu", ino);
161 gdp = ext3_get_group_desc (sb, block_group, &bh2);
163 BUFFER_TRACE(bh2, "get_write_access");
164 fatal = ext3_journal_get_write_access(handle, bh2);
165 if (fatal) goto error_return;
168 spin_lock(sb_bgl_lock(sbi, block_group));
169 gdp->bg_free_inodes_count = cpu_to_le16(
170 le16_to_cpu(gdp->bg_free_inodes_count) + 1);
172 gdp->bg_used_dirs_count = cpu_to_le16(
173 le16_to_cpu(gdp->bg_used_dirs_count) - 1);
174 spin_unlock(sb_bgl_lock(sbi, block_group));
175 percpu_counter_inc(&sbi->s_freeinodes_counter);
177 percpu_counter_dec(&sbi->s_dirs_counter);
180 BUFFER_TRACE(bh2, "call ext3_journal_dirty_metadata");
181 err = ext3_journal_dirty_metadata(handle, bh2);
182 if (!fatal) fatal = err;
184 BUFFER_TRACE(bitmap_bh, "call ext3_journal_dirty_metadata");
185 err = ext3_journal_dirty_metadata(handle, bitmap_bh);
191 ext3_std_error(sb, fatal);
195 * There are two policies for allocating an inode. If the new inode is
196 * a directory, then a forward search is made for a block group with both
197 * free space and a low directory-to-inode ratio; if that fails, then of
198 * the groups with above-average free space, that group with the fewest
199 * directories already is chosen.
201 * For other inodes, search forward from the parent directory\'s block
202 * group to find a free inode.
204 static int find_group_dir(struct super_block *sb, struct inode *parent)
206 int ngroups = EXT3_SB(sb)->s_groups_count;
208 struct ext3_group_desc *desc, *best_desc = NULL;
209 struct buffer_head *bh;
210 int group, best_group = -1;
212 freei = percpu_counter_read_positive(&EXT3_SB(sb)->s_freeinodes_counter);
213 avefreei = freei / ngroups;
215 for (group = 0; group < ngroups; group++) {
216 desc = ext3_get_group_desc (sb, group, &bh);
217 if (!desc || !desc->bg_free_inodes_count)
219 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
222 (le16_to_cpu(desc->bg_free_blocks_count) >
223 le16_to_cpu(best_desc->bg_free_blocks_count))) {
232 * Orlov's allocator for directories.
234 * We always try to spread first-level directories.
236 * If there are blockgroups with both free inodes and free blocks counts
237 * not worse than average we return one with smallest directory count.
238 * Otherwise we simply return a random group.
240 * For the rest rules look so:
242 * It's OK to put directory into a group unless
243 * it has too many directories already (max_dirs) or
244 * it has too few free inodes left (min_inodes) or
245 * it has too few free blocks left (min_blocks) or
246 * it's already running too large debt (max_debt).
247 * Parent's group is prefered, if it doesn't satisfy these
248 * conditions we search cyclically through the rest. If none
249 * of the groups look good we just look for a group with more
250 * free inodes than average (starting at parent's group).
252 * Debt is incremented each time we allocate a directory and decremented
253 * when we allocate an inode, within 0--255.
256 #define INODE_COST 64
257 #define BLOCK_COST 256
259 static int find_group_orlov(struct super_block *sb, struct inode *parent)
261 int parent_group = EXT3_I(parent)->i_block_group;
262 struct ext3_sb_info *sbi = EXT3_SB(sb);
263 struct ext3_super_block *es = sbi->s_es;
264 int ngroups = sbi->s_groups_count;
265 int inodes_per_group = EXT3_INODES_PER_GROUP(sb);
268 int blocks_per_dir, ndirs;
269 int max_debt, max_dirs, min_blocks, min_inodes;
271 struct ext3_group_desc *desc;
272 struct buffer_head *bh;
274 freei = percpu_counter_read_positive(&sbi->s_freeinodes_counter);
275 avefreei = freei / ngroups;
276 freeb = percpu_counter_read_positive(&sbi->s_freeblocks_counter);
277 avefreeb = freeb / ngroups;
278 ndirs = percpu_counter_read_positive(&sbi->s_dirs_counter);
280 if ((parent == sb->s_root->d_inode) ||
281 (EXT3_I(parent)->i_flags & EXT3_TOPDIR_FL)) {
282 int best_ndir = inodes_per_group;
285 get_random_bytes(&group, sizeof(group));
286 parent_group = (unsigned)group % ngroups;
287 for (i = 0; i < ngroups; i++) {
288 group = (parent_group + i) % ngroups;
289 desc = ext3_get_group_desc (sb, group, &bh);
290 if (!desc || !desc->bg_free_inodes_count)
292 if (le16_to_cpu(desc->bg_used_dirs_count) >= best_ndir)
294 if (le16_to_cpu(desc->bg_free_inodes_count) < avefreei)
296 if (le16_to_cpu(desc->bg_free_blocks_count) < avefreeb)
299 best_ndir = le16_to_cpu(desc->bg_used_dirs_count);
306 blocks_per_dir = (le32_to_cpu(es->s_blocks_count) - freeb) / ndirs;
308 max_dirs = ndirs / ngroups + inodes_per_group / 16;
309 min_inodes = avefreei - inodes_per_group / 4;
310 min_blocks = avefreeb - EXT3_BLOCKS_PER_GROUP(sb) / 4;
312 max_debt = EXT3_BLOCKS_PER_GROUP(sb) / max(blocks_per_dir, BLOCK_COST);
313 if (max_debt * INODE_COST > inodes_per_group)
314 max_debt = inodes_per_group / INODE_COST;
320 for (i = 0; i < ngroups; i++) {
321 group = (parent_group + i) % ngroups;
322 desc = ext3_get_group_desc (sb, group, &bh);
323 if (!desc || !desc->bg_free_inodes_count)
325 if (le16_to_cpu(desc->bg_used_dirs_count) >= max_dirs)
327 if (le16_to_cpu(desc->bg_free_inodes_count) < min_inodes)
329 if (le16_to_cpu(desc->bg_free_blocks_count) < min_blocks)
335 for (i = 0; i < ngroups; i++) {
336 group = (parent_group + i) % ngroups;
337 desc = ext3_get_group_desc (sb, group, &bh);
338 if (!desc || !desc->bg_free_inodes_count)
340 if (le16_to_cpu(desc->bg_free_inodes_count) >= avefreei)
346 * The free-inodes counter is approximate, and for really small
347 * filesystems the above test can fail to find any blockgroups
356 static int find_group_other(struct super_block *sb, struct inode *parent)
358 int parent_group = EXT3_I(parent)->i_block_group;
359 int ngroups = EXT3_SB(sb)->s_groups_count;
360 struct ext3_group_desc *desc;
361 struct buffer_head *bh;
365 * Try to place the inode in its parent directory
367 group = parent_group;
368 desc = ext3_get_group_desc (sb, group, &bh);
369 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
370 le16_to_cpu(desc->bg_free_blocks_count))
374 * We're going to place this inode in a different blockgroup from its
375 * parent. We want to cause files in a common directory to all land in
376 * the same blockgroup. But we want files which are in a different
377 * directory which shares a blockgroup with our parent to land in a
378 * different blockgroup.
380 * So add our directory's i_ino into the starting point for the hash.
382 group = (group + parent->i_ino) % ngroups;
385 * Use a quadratic hash to find a group with a free inode and some free
388 for (i = 1; i < ngroups; i <<= 1) {
390 if (group >= ngroups)
392 desc = ext3_get_group_desc (sb, group, &bh);
393 if (desc && le16_to_cpu(desc->bg_free_inodes_count) &&
394 le16_to_cpu(desc->bg_free_blocks_count))
399 * That failed: try linear search for a free inode, even if that group
400 * has no free blocks.
402 group = parent_group;
403 for (i = 0; i < ngroups; i++) {
404 if (++group >= ngroups)
406 desc = ext3_get_group_desc (sb, group, &bh);
407 if (desc && le16_to_cpu(desc->bg_free_inodes_count))
415 * There are two policies for allocating an inode. If the new inode is
416 * a directory, then a forward search is made for a block group with both
417 * free space and a low directory-to-inode ratio; if that fails, then of
418 * the groups with above-average free space, that group with the fewest
419 * directories already is chosen.
421 * For other inodes, search forward from the parent directory's block
422 * group to find a free inode.
424 struct inode *ext3_new_inode(handle_t *handle, struct inode * dir, int mode)
426 struct super_block *sb;
427 struct buffer_head *bitmap_bh = NULL;
428 struct buffer_head *bh2;
430 unsigned long ino = 0;
431 struct inode * inode;
432 struct ext3_group_desc * gdp = NULL;
433 struct ext3_super_block * es;
434 struct ext3_inode_info *ei;
435 struct ext3_sb_info *sbi;
440 /* Cannot create files in a deleted directory */
441 if (!dir || !dir->i_nlink)
442 return ERR_PTR(-EPERM);
445 inode = new_inode(sb);
447 return ERR_PTR(-ENOMEM);
449 if (sb->s_flags & MS_TAGXID)
450 inode->i_xid = vx_current_xid();
454 if (DLIMIT_ALLOC_INODE(sb, inode->i_xid)) {
463 if (test_opt (sb, OLDALLOC))
464 group = find_group_dir(sb, dir);
466 group = find_group_orlov(sb, dir);
468 group = find_group_other(sb, dir);
474 for (i = 0; i < sbi->s_groups_count; i++) {
475 gdp = ext3_get_group_desc(sb, group, &bh2);
479 bitmap_bh = read_inode_bitmap(sb, group);
485 repeat_in_this_group:
486 ino = ext3_find_next_zero_bit((unsigned long *)
487 bitmap_bh->b_data, EXT3_INODES_PER_GROUP(sb), ino);
488 if (ino < EXT3_INODES_PER_GROUP(sb)) {
491 BUFFER_TRACE(bitmap_bh, "get_write_access");
492 err = ext3_journal_get_write_access_credits(handle,
493 bitmap_bh, &credits);
497 if (!ext3_set_bit_atomic(sb_bgl_lock(sbi, group),
498 ino, bitmap_bh->b_data)) {
500 BUFFER_TRACE(bitmap_bh,
501 "call ext3_journal_dirty_metadata");
502 err = ext3_journal_dirty_metadata(handle,
509 journal_release_buffer(handle, bitmap_bh, credits);
511 if (++ino < EXT3_INODES_PER_GROUP(sb))
512 goto repeat_in_this_group;
516 * This case is possible in concurrent environment. It is very
517 * rare. We cannot repeat the find_group_xxx() call because
518 * that will simply return the same blockgroup, because the
519 * group descriptor metadata has not yet been updated.
520 * So we just go onto the next blockgroup.
522 if (++group == sbi->s_groups_count)
529 ino += group * EXT3_INODES_PER_GROUP(sb) + 1;
530 if (ino < EXT3_FIRST_INO(sb) || ino > le32_to_cpu(es->s_inodes_count)) {
531 ext3_error (sb, "ext3_new_inode",
532 "reserved inode or inode > inodes count - "
533 "block_group = %d, inode=%lu", group, ino);
538 BUFFER_TRACE(bh2, "get_write_access");
539 err = ext3_journal_get_write_access(handle, bh2);
541 spin_lock(sb_bgl_lock(sbi, group));
542 gdp->bg_free_inodes_count =
543 cpu_to_le16(le16_to_cpu(gdp->bg_free_inodes_count) - 1);
545 gdp->bg_used_dirs_count =
546 cpu_to_le16(le16_to_cpu(gdp->bg_used_dirs_count) + 1);
548 spin_unlock(sb_bgl_lock(sbi, group));
549 BUFFER_TRACE(bh2, "call ext3_journal_dirty_metadata");
550 err = ext3_journal_dirty_metadata(handle, bh2);
553 percpu_counter_dec(&sbi->s_freeinodes_counter);
555 percpu_counter_inc(&sbi->s_dirs_counter);
558 inode->i_uid = current->fsuid;
559 if (test_opt (sb, GRPID))
560 inode->i_gid = dir->i_gid;
561 else if (dir->i_mode & S_ISGID) {
562 inode->i_gid = dir->i_gid;
566 inode->i_gid = current->fsgid;
567 inode->i_mode = mode;
570 /* This is the optimal IO size (for stat), not the fs block size */
571 inode->i_blksize = PAGE_SIZE;
573 inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
575 memset(ei->i_data, 0, sizeof(ei->i_data));
576 ei->i_next_alloc_block = 0;
577 ei->i_next_alloc_goal = 0;
578 ei->i_dir_start_lookup = 0;
581 ei->i_flags = EXT3_I(dir)->i_flags &
582 ~(EXT3_INDEX_FL|EXT3_IUNLINK_FL|EXT3_BARRIER_FL);
584 ei->i_flags &= ~(EXT3_IMMUTABLE_FL|EXT3_APPEND_FL);
585 /* dirsync only applies to directories */
587 ei->i_flags &= ~EXT3_DIRSYNC_FL;
588 #ifdef EXT3_FRAGMENTS
596 ei->i_rsv_window.rsv_start = EXT3_RESERVE_WINDOW_NOT_ALLOCATED;
597 ei->i_rsv_window.rsv_end = EXT3_RESERVE_WINDOW_NOT_ALLOCATED;
598 atomic_set(&ei->i_rsv_window.rsv_goal_size, EXT3_DEFAULT_RESERVE_BLOCKS);
599 atomic_set(&ei->i_rsv_window.rsv_alloc_hit, 0);
600 seqlock_init(&ei->i_rsv_window.rsv_seqlock);
601 ei->i_block_group = group;
603 ext3_set_inode_flags(inode);
604 if (IS_DIRSYNC(inode))
606 insert_inode_hash(inode);
607 spin_lock(&sbi->s_next_gen_lock);
608 inode->i_generation = sbi->s_next_generation++;
609 spin_unlock(&sbi->s_next_gen_lock);
611 ei->i_state = EXT3_STATE_NEW;
613 (EXT3_INODE_SIZE(inode->i_sb) > EXT3_GOOD_OLD_INODE_SIZE) ?
614 sizeof(struct ext3_inode) - EXT3_GOOD_OLD_INODE_SIZE : 0;
617 if(DQUOT_ALLOC_INODE(inode)) {
622 err = ext3_init_acl(handle, inode, dir);
624 DQUOT_FREE_INODE(inode);
627 err = ext3_mark_inode_dirty(handle, inode);
629 ext3_std_error(sb, err);
630 DQUOT_FREE_INODE(inode);
634 ext3_debug("allocating inode %lu\n", inode->i_ino);
637 DLIMIT_FREE_INODE(sb, inode->i_xid);
638 ext3_std_error(sb, err);
647 DLIMIT_FREE_INODE(sb, inode->i_xid);
648 inode->i_flags |= S_NOQUOTA;
655 /* Verify that we are loading a valid orphan from disk */
656 struct inode *ext3_orphan_get(struct super_block *sb, unsigned long ino)
658 unsigned long max_ino = le32_to_cpu(EXT3_SB(sb)->s_es->s_inodes_count);
659 unsigned long block_group;
661 struct buffer_head *bitmap_bh = NULL;
662 struct inode *inode = NULL;
664 /* Error cases - e2fsck has already cleaned up for us */
666 ext3_warning(sb, __FUNCTION__,
667 "bad orphan ino %lu! e2fsck was run?\n", ino);
671 block_group = (ino - 1) / EXT3_INODES_PER_GROUP(sb);
672 bit = (ino - 1) % EXT3_INODES_PER_GROUP(sb);
673 bitmap_bh = read_inode_bitmap(sb, block_group);
675 ext3_warning(sb, __FUNCTION__,
676 "inode bitmap error for orphan %lu\n", ino);
680 /* Having the inode bit set should be a 100% indicator that this
681 * is a valid orphan (no e2fsck run on fs). Orphans also include
682 * inodes that were being truncated, so we can't check i_nlink==0.
684 if (!ext3_test_bit(bit, bitmap_bh->b_data) ||
685 !(inode = iget(sb, ino)) || is_bad_inode(inode) ||
686 NEXT_ORPHAN(inode) > max_ino) {
687 ext3_warning(sb, __FUNCTION__,
688 "bad orphan inode %lu! e2fsck was run?\n", ino);
689 printk(KERN_NOTICE "ext3_test_bit(bit=%d, block=%llu) = %d\n",
690 bit, (unsigned long long)bitmap_bh->b_blocknr,
691 ext3_test_bit(bit, bitmap_bh->b_data));
692 printk(KERN_NOTICE "inode=%p\n", inode);
694 printk(KERN_NOTICE "is_bad_inode(inode)=%d\n",
695 is_bad_inode(inode));
696 printk(KERN_NOTICE "NEXT_ORPHAN(inode)=%u\n",
698 printk(KERN_NOTICE "max_ino=%lu\n", max_ino);
700 /* Avoid freeing blocks if we got a bad deleted inode */
701 if (inode && inode->i_nlink == 0)
711 unsigned long ext3_count_free_inodes (struct super_block * sb)
713 unsigned long desc_count;
714 struct ext3_group_desc *gdp;
717 struct ext3_super_block *es;
718 unsigned long bitmap_count, x;
719 struct buffer_head *bitmap_bh = NULL;
722 es = EXT3_SB(sb)->s_es;
726 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
727 gdp = ext3_get_group_desc (sb, i, NULL);
730 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
732 bitmap_bh = read_inode_bitmap(sb, i);
736 x = ext3_count_free(bitmap_bh, EXT3_INODES_PER_GROUP(sb) / 8);
737 printk("group %d: stored = %d, counted = %lu\n",
738 i, le16_to_cpu(gdp->bg_free_inodes_count), x);
742 printk("ext3_count_free_inodes: stored = %u, computed = %lu, %lu\n",
743 le32_to_cpu(es->s_free_inodes_count), desc_count, bitmap_count);
748 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
749 gdp = ext3_get_group_desc (sb, i, NULL);
752 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
759 /* Called at mount-time, super-block is locked */
760 unsigned long ext3_count_dirs (struct super_block * sb)
762 unsigned long count = 0;
765 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
766 struct ext3_group_desc *gdp = ext3_get_group_desc (sb, i, NULL);
769 count += le16_to_cpu(gdp->bg_used_dirs_count);
774 #ifdef CONFIG_EXT3_CHECK
775 /* Called at mount-time, super-block is locked */
776 void ext3_check_inodes_bitmap (struct super_block * sb)
778 struct ext3_super_block * es;
779 unsigned long desc_count, bitmap_count, x;
780 struct buffer_head *bitmap_bh = NULL;
781 struct ext3_group_desc * gdp;
784 es = EXT3_SB(sb)->s_es;
788 for (i = 0; i < EXT3_SB(sb)->s_groups_count; i++) {
789 gdp = ext3_get_group_desc (sb, i, NULL);
792 desc_count += le16_to_cpu(gdp->bg_free_inodes_count);
794 bitmap_bh = read_inode_bitmap(sb, i);
798 x = ext3_count_free(bitmap_bh, EXT3_INODES_PER_GROUP(sb) / 8);
799 if (le16_to_cpu(gdp->bg_free_inodes_count) != x)
800 ext3_error (sb, "ext3_check_inodes_bitmap",
801 "Wrong free inodes count in group %d, "
802 "stored = %d, counted = %lu", i,
803 le16_to_cpu(gdp->bg_free_inodes_count), x);
807 if (le32_to_cpu(es->s_free_inodes_count) != bitmap_count)
808 ext3_error (sb, "ext3_check_inodes_bitmap",
809 "Wrong free inodes count in super block, "
810 "stored = %lu, counted = %lu",
811 (unsigned long)le32_to_cpu(es->s_free_inodes_count),