2 * pass2.c --- check directory structure
4 * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o
7 * This file may be redistributed under the terms of the GNU Public
11 * Pass 2 of e2fsck iterates through all active directory inodes, and
12 * applies to following tests to each directory entry in the directory
13 * blocks in the inodes:
15 * - The length of the directory entry (rec_len) should be at
16 * least 8 bytes, and no more than the remaining space
17 * left in the directory block.
18 * - The length of the name in the directory entry (name_len)
19 * should be less than (rec_len - 8).
20 * - The inode number in the directory entry should be within
22 * - The inode number should refer to a in-use inode.
23 * - The first entry should be '.', and its inode should be
24 * the inode of the directory.
25 * - The second entry should be '..'.
27 * To minimize disk seek time, the directory blocks are processed in
28 * sorted order of block numbers.
30 * Pass 2 also collects the following information:
31 * - The inode numbers of the subdirectories for each directory.
33 * Pass 2 relies on the following information from previous passes:
34 * - The directory information collected in pass 1.
35 * - The inode_used_map bitmap
36 * - The inode_bad_map bitmap
37 * - The inode_dir_map bitmap
39 * Pass 2 frees the following data structures
40 * - The inode_bad_map bitmap
41 * - The inode_reg_map bitmap
44 #define _GNU_SOURCE 1 /* get strnlen() */
52 #ifdef NO_INLINE_FUNCS
55 #define _INLINE_ inline
58 /* #define DX_DEBUG */
61 * Keeps track of how many times an inode is referenced.
63 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf);
64 static int check_dir_block(ext2_filsys fs,
65 struct ext2_db_entry2 *dir_blocks_info,
67 static int allocate_dir_block(e2fsck_t ctx,
68 struct ext2_db_entry2 *dir_blocks_info,
69 char *buf, struct problem_context *pctx);
70 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino);
71 static int htree_depth(struct dx_dir_info *dx_dir,
72 struct dx_dirblock_info *dx_db);
73 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b);
75 struct check_dir_struct {
77 struct problem_context pctx;
82 void e2fsck_pass2(e2fsck_t ctx)
84 struct ext2_super_block *sb = ctx->fs->super;
85 struct problem_context pctx;
86 ext2_filsys fs = ctx->fs;
89 struct resource_track rtrack;
91 struct check_dir_struct cd;
92 struct dx_dir_info *dx_dir;
93 struct dx_dirblock_info *dx_db, *dx_parent;
94 unsigned int save_type;
100 init_resource_track(&rtrack, ctx->fs->io);
101 clear_problem_context(&cd.pctx);
104 mtrace_print("Pass 2");
107 if (!(ctx->options & E2F_OPT_PREEN))
108 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
110 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
112 if (ctx->inode_count)
115 e2fsck_set_bitmap_type(fs, EXT2FS_BMAP64_RBTREE,
116 "inode_count", &save_type);
117 cd.pctx.errcode = ext2fs_create_icount2(fs,
118 EXT2_ICOUNT_OPT_INCREMENT,
119 0, ctx->inode_link_info,
121 fs->default_bitmap_type = save_type;
123 if (cd.pctx.errcode) {
124 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
125 ctx->flags |= E2F_FLAG_ABORT;
128 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
129 "directory scan buffer");
132 * Set up the parent pointer for the root directory, if
133 * present. (If the root directory is not present, we will
134 * create it in pass 3.)
136 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
141 cd.max = ext2fs_dblist_count2(fs->dblist);
144 (void) (ctx->progress)(ctx, 2, 0, cd.max);
146 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX)
147 ext2fs_dblist_sort2(fs->dblist, special_dir_block_cmp);
149 cd.pctx.errcode = ext2fs_dblist_iterate2(fs->dblist, check_dir_block,
151 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
154 if (ctx->flags & E2F_FLAG_RESTART_LATER) {
155 ctx->flags |= E2F_FLAG_RESTART;
159 if (cd.pctx.errcode) {
160 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
161 ctx->flags |= E2F_FLAG_ABORT;
166 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
167 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
169 if (dx_dir->numblocks == 0)
171 clear_problem_context(&pctx);
173 pctx.dir = dx_dir->ino;
174 dx_db = dx_dir->dx_block;
175 if (dx_db->flags & DX_FLAG_REFERENCED)
176 dx_db->flags |= DX_FLAG_DUP_REF;
178 dx_db->flags |= DX_FLAG_REFERENCED;
180 * Find all of the first and last leaf blocks, and
181 * update their parent's min and max hash values
183 for (b=0, dx_db = dx_dir->dx_block;
184 b < dx_dir->numblocks;
186 if ((dx_db->type != DX_DIRBLOCK_LEAF) ||
187 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST)))
189 dx_parent = &dx_dir->dx_block[dx_db->parent];
191 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
193 if (dx_db->flags & DX_FLAG_FIRST)
194 dx_parent->min_hash = dx_db->min_hash;
196 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
198 if (dx_db->flags & DX_FLAG_LAST)
199 dx_parent->max_hash = dx_db->max_hash;
202 for (b=0, dx_db = dx_dir->dx_block;
203 b < dx_dir->numblocks;
206 pctx.group = dx_db->parent;
208 if (!(dx_db->flags & DX_FLAG_FIRST) &&
209 (dx_db->min_hash < dx_db->node_min_hash)) {
210 pctx.blk = dx_db->min_hash;
211 pctx.blk2 = dx_db->node_min_hash;
212 code = PR_2_HTREE_MIN_HASH;
213 fix_problem(ctx, code, &pctx);
216 if (dx_db->type == DX_DIRBLOCK_LEAF) {
217 depth = htree_depth(dx_dir, dx_db);
218 if (depth != dx_dir->depth) {
219 pctx.num = dx_dir->depth;
220 code = PR_2_HTREE_BAD_DEPTH;
221 fix_problem(ctx, code, &pctx);
226 * This test doesn't apply for the root block
230 (dx_db->max_hash > dx_db->node_max_hash)) {
231 pctx.blk = dx_db->max_hash;
232 pctx.blk2 = dx_db->node_max_hash;
233 code = PR_2_HTREE_MAX_HASH;
234 fix_problem(ctx, code, &pctx);
237 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
238 code = PR_2_HTREE_NOTREF;
239 fix_problem(ctx, code, &pctx);
241 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
242 code = PR_2_HTREE_DUPREF;
243 fix_problem(ctx, code, &pctx);
247 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
248 clear_htree(ctx, dx_dir->ino);
249 dx_dir->numblocks = 0;
252 e2fsck_free_dx_dir_info(ctx);
254 ext2fs_free_mem(&buf);
255 ext2fs_free_dblist(fs->dblist);
257 if (ctx->inode_bad_map) {
258 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
259 ctx->inode_bad_map = 0;
261 if (ctx->inode_reg_map) {
262 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
263 ctx->inode_reg_map = 0;
266 clear_problem_context(&pctx);
267 if (ctx->large_files) {
268 if (!(sb->s_feature_ro_compat &
269 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) &&
270 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
271 sb->s_feature_ro_compat |=
272 EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
273 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
274 ext2fs_mark_super_dirty(fs);
276 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
277 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
278 ext2fs_update_dynamic_rev(fs);
279 ext2fs_mark_super_dirty(fs);
283 print_resource_track(ctx, _("Pass 2"), &rtrack, fs->io);
286 #define MAX_DEPTH 32000
287 static int htree_depth(struct dx_dir_info *dx_dir,
288 struct dx_dirblock_info *dx_db)
292 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
293 dx_db = &dx_dir->dx_block[dx_db->parent];
299 static int dict_de_cmp(const void *a, const void *b)
301 const struct ext2_dir_entry *de_a, *de_b;
304 de_a = (const struct ext2_dir_entry *) a;
305 a_len = ext2fs_dirent_name_len(de_a);
306 de_b = (const struct ext2_dir_entry *) b;
307 b_len = ext2fs_dirent_name_len(de_b);
310 return (a_len - b_len);
312 return strncmp(de_a->name, de_b->name, a_len);
316 * This is special sort function that makes sure that directory blocks
317 * with a dirblock of zero are sorted to the beginning of the list.
318 * This guarantees that the root node of the htree directories are
319 * processed first, so we know what hash version to use.
321 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
323 const struct ext2_db_entry2 *db_a =
324 (const struct ext2_db_entry2 *) a;
325 const struct ext2_db_entry2 *db_b =
326 (const struct ext2_db_entry2 *) b;
328 if (db_a->blockcnt && !db_b->blockcnt)
331 if (!db_a->blockcnt && db_b->blockcnt)
334 if (db_a->blk != db_b->blk)
335 return (int) (db_a->blk - db_b->blk);
337 if (db_a->ino != db_b->ino)
338 return (int) (db_a->ino - db_b->ino);
340 return (int) (db_a->blockcnt - db_b->blockcnt);
345 * Make sure the first entry in the directory is '.', and that the
346 * directory entry is sane.
348 static int check_dot(e2fsck_t ctx,
349 struct ext2_dir_entry *dirent,
350 ext2_ino_t ino, struct problem_context *pctx)
352 struct ext2_dir_entry *nextdir;
353 unsigned int rec_len, new_len;
356 problem_t problem = 0;
359 problem = PR_2_MISSING_DOT;
360 else if ((ext2fs_dirent_name_len(dirent) != 1) ||
361 (dirent->name[0] != '.'))
362 problem = PR_2_1ST_NOT_DOT;
363 else if (dirent->name[1] != '\0')
364 problem = PR_2_DOT_NULL_TERM;
366 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
368 if (fix_problem(ctx, problem, pctx)) {
370 rec_len = dirent->rec_len = 12;
372 ext2fs_dirent_set_name_len(dirent, 1);
373 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
374 dirent->name[0] = '.';
375 dirent->name[1] = '\0';
380 if (dirent->inode != ino) {
381 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
387 new_len = rec_len - 12;
390 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
391 nextdir = (struct ext2_dir_entry *)
392 ((char *) dirent + 12);
393 dirent->rec_len = 12;
394 (void) ext2fs_set_rec_len(ctx->fs, new_len,
397 ext2fs_dirent_set_name_len(nextdir, 0);
398 ext2fs_dirent_set_file_type(nextdir,
408 * Make sure the second entry in the directory is '..', and that the
409 * directory entry is sane. We do not check the inode number of '..'
410 * here; this gets done in pass 3.
412 static int check_dotdot(e2fsck_t ctx,
413 struct ext2_dir_entry *dirent,
414 ext2_ino_t ino, struct problem_context *pctx)
416 problem_t problem = 0;
417 unsigned int rec_len;
420 problem = PR_2_MISSING_DOT_DOT;
421 else if ((ext2fs_dirent_name_len(dirent) != 2) ||
422 (dirent->name[0] != '.') ||
423 (dirent->name[1] != '.'))
424 problem = PR_2_2ND_NOT_DOT_DOT;
425 else if (dirent->name[2] != '\0')
426 problem = PR_2_DOT_DOT_NULL_TERM;
428 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
430 if (fix_problem(ctx, problem, pctx)) {
432 dirent->rec_len = 12;
434 * Note: we don't have the parent inode just
435 * yet, so we will fill it in with the root
436 * inode. This will get fixed in pass 3.
438 dirent->inode = EXT2_ROOT_INO;
439 ext2fs_dirent_set_name_len(dirent, 2);
440 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
441 dirent->name[0] = '.';
442 dirent->name[1] = '.';
443 dirent->name[2] = '\0';
448 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
449 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
456 * Check to make sure a directory entry doesn't contain any illegal
459 static int check_name(e2fsck_t ctx,
460 struct ext2_dir_entry *dirent,
461 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
462 struct problem_context *pctx)
468 for ( i = 0; i < ext2fs_dirent_name_len(dirent); i++) {
469 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
471 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
474 dirent->name[i] = '.';
483 * Check the directory filetype (if present)
485 static _INLINE_ int check_filetype(e2fsck_t ctx,
486 struct ext2_dir_entry *dirent,
487 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
488 struct problem_context *pctx)
490 int filetype = ext2fs_dirent_file_type(dirent);
491 int should_be = EXT2_FT_UNKNOWN;
492 struct ext2_inode inode;
494 if (!(ctx->fs->super->s_feature_incompat &
495 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
497 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
499 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
503 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dirent->inode)) {
504 should_be = EXT2_FT_DIR;
505 } else if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map,
507 should_be = EXT2_FT_REG_FILE;
508 } else if (ctx->inode_bad_map &&
509 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
513 e2fsck_read_inode(ctx, dirent->inode, &inode,
515 should_be = ext2_file_type(inode.i_mode);
517 if (filetype == should_be)
519 pctx->num = should_be;
521 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
525 ext2fs_dirent_set_file_type(dirent, should_be);
530 static void parse_int_node(ext2_filsys fs,
531 struct ext2_db_entry2 *db,
532 struct check_dir_struct *cd,
533 struct dx_dir_info *dx_dir,
534 char *block_buf, int failed_csum)
536 struct ext2_dx_root_info *root;
537 struct ext2_dx_entry *ent;
538 struct ext2_dx_countlimit *limit;
539 struct dx_dirblock_info *dx_db;
540 int i, expect_limit, count;
542 ext2_dirhash_t min_hash = 0xffffffff;
543 ext2_dirhash_t max_hash = 0;
544 ext2_dirhash_t hash = 0, prev_hash;
547 if (db->blockcnt == 0) {
548 root = (struct ext2_dx_root_info *) (block_buf + 24);
551 printf("Root node dump:\n");
552 printf("\t Reserved zero: %u\n", root->reserved_zero);
553 printf("\t Hash Version: %d\n", root->hash_version);
554 printf("\t Info length: %d\n", root->info_length);
555 printf("\t Indirect levels: %d\n", root->indirect_levels);
556 printf("\t Flags: %d\n", root->unused_flags);
559 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
562 (e2fsck_dir_will_be_rehashed(cd->ctx, cd->pctx.ino) ||
563 fix_problem(cd->ctx, PR_2_HTREE_ROOT_CSUM_INVALID,
567 ent = (struct ext2_dx_entry *) (block_buf+8);
570 (e2fsck_dir_will_be_rehashed(cd->ctx, cd->pctx.ino) ||
571 fix_problem(cd->ctx, PR_2_HTREE_NODE_CSUM_INVALID,
576 limit = (struct ext2_dx_countlimit *) ent;
579 printf("Number of entries (count): %d\n",
580 ext2fs_le16_to_cpu(limit->count));
581 printf("Number of entries (limit): %d\n",
582 ext2fs_le16_to_cpu(limit->limit));
585 count = ext2fs_le16_to_cpu(limit->count);
586 if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super,
587 EXT4_FEATURE_RO_COMPAT_METADATA_CSUM))
588 csum_size = sizeof(struct ext2_dx_tail);
589 expect_limit = (fs->blocksize -
590 (csum_size + ((char *) ent - block_buf))) /
591 sizeof(struct ext2_dx_entry);
592 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
593 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
594 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
597 if (count > expect_limit) {
598 cd->pctx.num = count;
599 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
601 count = expect_limit;
604 for (i=0; i < count; i++) {
606 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
608 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
609 hash, ext2fs_le32_to_cpu(ent[i].block));
611 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
612 /* Check to make sure the block is valid */
613 if (blk >= (blk_t) dx_dir->numblocks) {
615 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
620 if (hash < prev_hash &&
621 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
623 dx_db = &dx_dir->dx_block[blk];
624 if (dx_db->flags & DX_FLAG_REFERENCED) {
625 dx_db->flags |= DX_FLAG_DUP_REF;
627 dx_db->flags |= DX_FLAG_REFERENCED;
628 dx_db->parent = db->blockcnt;
634 dx_db->node_min_hash = hash;
636 dx_db->node_max_hash =
637 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
639 dx_db->node_max_hash = 0xfffffffe;
640 dx_db->flags |= DX_FLAG_LAST;
643 dx_db->flags |= DX_FLAG_FIRST;
646 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
647 db->blockcnt, min_hash, max_hash);
649 dx_db = &dx_dir->dx_block[db->blockcnt];
650 dx_db->min_hash = min_hash;
651 dx_db->max_hash = max_hash;
655 clear_htree(cd->ctx, cd->pctx.ino);
656 dx_dir->numblocks = 0;
657 e2fsck_rehash_dir_later(cd->ctx, cd->pctx.ino);
659 #endif /* ENABLE_HTREE */
662 * Given a busted directory, try to salvage it somehow.
665 static void salvage_directory(ext2_filsys fs,
666 struct ext2_dir_entry *dirent,
667 struct ext2_dir_entry *prev,
668 unsigned int *offset,
669 unsigned int block_len)
671 char *cp = (char *) dirent;
673 unsigned int rec_len, prev_rec_len;
674 unsigned int name_len = ext2fs_dirent_name_len(dirent);
676 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
677 left = block_len - *offset - rec_len;
680 * Special case of directory entry of size 8: copy what's left
681 * of the directory block up to cover up the invalid hole.
683 if ((left >= 12) && (rec_len == 8)) {
684 memmove(cp, cp+8, left);
685 memset(cp + left, 0, 8);
689 * If the directory entry overruns the end of the directory
690 * block, and the name is small enough to fit, then adjust the
694 ((int) rec_len + left > 8) &&
695 ((int) name_len + 8 <= (int) rec_len + left) &&
696 dirent->inode <= fs->super->s_inodes_count &&
697 strnlen(dirent->name, name_len) == name_len) {
698 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent);
702 * If the record length of the directory entry is a multiple
703 * of four, and not too big, such that it is valid, let the
704 * previous directory entry absorb the invalid one.
706 if (prev && rec_len && (rec_len % 4) == 0 &&
707 (*offset + rec_len <= block_len)) {
708 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
709 prev_rec_len += rec_len;
710 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
715 * Default salvage method --- kill all of the directory
716 * entries for the rest of the block. We will either try to
717 * absorb it into the previous directory entry, or create a
718 * new empty directory entry the rest of the directory block.
721 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
722 prev_rec_len += block_len - *offset;
723 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
724 *offset = fs->blocksize;
726 rec_len = block_len - *offset;
727 (void) ext2fs_set_rec_len(fs, rec_len, dirent);
728 ext2fs_dirent_set_name_len(dirent, 0);
729 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
734 static int is_last_entry(ext2_filsys fs, int inline_data_size,
735 unsigned int offset, int csum_size)
737 if (inline_data_size)
738 return (offset < inline_data_size);
740 return (offset < fs->blocksize - csum_size);
743 #define NEXT_DIRENT(d) ((void *)((char *)(d) + (d)->rec_len))
744 static errcode_t insert_dirent_tail(ext2_filsys fs, void *dirbuf)
746 struct ext2_dir_entry *d;
748 struct ext2_dir_entry_tail *t;
749 unsigned int rec_len;
752 top = EXT2_DIRENT_TAIL(dirbuf, fs->blocksize);
754 while (d->rec_len && !(d->rec_len & 0x3) && NEXT_DIRENT(d) <= top)
758 size_t min_size = EXT2_DIR_REC_LEN(
759 ext2fs_dirent_name_len(dirbuf));
760 if (min_size > top - (void *)d)
761 return EXT2_ET_DIR_NO_SPACE_FOR_CSUM;
762 d->rec_len = top - (void *)d;
765 t = (struct ext2_dir_entry_tail *)top;
766 if (t->det_reserved_zero1 ||
767 t->det_rec_len != sizeof(struct ext2_dir_entry_tail) ||
768 t->det_reserved_name_len != EXT2_DIR_NAME_LEN_CSUM)
769 ext2fs_initialize_dirent_tail(fs, t);
775 static int check_dir_block(ext2_filsys fs,
776 struct ext2_db_entry2 *db,
779 struct dx_dir_info *dx_dir;
781 struct dx_dirblock_info *dx_db = 0;
782 #endif /* ENABLE_HTREE */
783 struct ext2_dir_entry *dirent, *prev, dot, dotdot;
785 unsigned int offset = 0;
786 int dir_modified = 0;
788 unsigned int rec_len;
789 blk64_t block_nr = db->blk;
790 ext2_ino_t ino = db->ino;
791 ext2_ino_t subdir_parent;
793 struct check_dir_struct *cd;
797 struct ext2_dx_root_info *root;
798 struct ext2_dx_countlimit *limit;
799 static dict_t de_dict;
800 struct problem_context pctx;
803 int dx_csum_size = 0, de_csum_size = 0;
806 size_t inline_data_size = 0;
809 cd = (struct check_dir_struct *) priv_data;
813 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
816 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
819 if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super,
820 EXT4_FEATURE_RO_COMPAT_METADATA_CSUM)) {
821 dx_csum_size = sizeof(struct ext2_dx_tail);
822 de_csum_size = sizeof(struct ext2_dir_entry_tail);
825 if (EXT2_HAS_INCOMPAT_FEATURE(fs->super,
826 EXT2_FEATURE_INCOMPAT_FILETYPE))
827 filetype = EXT2_FT_DIR << 8;
830 * Make sure the inode is still in use (could have been
831 * deleted in the duplicate/bad blocks pass.
833 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino)))
837 cd->pctx.blk = block_nr;
838 cd->pctx.blkcount = db->blockcnt;
843 if (EXT2_HAS_INCOMPAT_FEATURE(fs->super,
844 EXT4_FEATURE_INCOMPAT_INLINE_DATA)) {
847 ec = ext2fs_inline_data_size(fs, ino, &inline_data_size);
848 if (ec && ec != EXT2_ET_NO_INLINE_DATA)
852 if (db->blk == 0 && !inline_data_size) {
853 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
863 if (ctx->dirs_to_hash &&
864 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
868 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
872 ehandler_operation(_("reading directory block"));
873 if (inline_data_size)
874 cd->pctx.errcode = ext2fs_inline_data_get(fs, ino, 0, buf, 0);
876 cd->pctx.errcode = ext2fs_read_dir_block4(fs, block_nr,
878 ehandler_operation(0);
879 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
880 cd->pctx.errcode = 0; /* We'll handle this ourselves */
881 else if (cd->pctx.errcode == EXT2_ET_DIR_CSUM_INVALID) {
882 cd->pctx.errcode = 0; /* We'll handle this ourselves */
885 if (cd->pctx.errcode) {
887 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
888 ctx->flags |= E2F_FLAG_ABORT;
891 ext2fs_new_dir_block(fs, db->blockcnt == 0 ? ino : 0,
892 EXT2_ROOT_INO, &buf2);
893 memcpy(buf, buf2, fs->blocksize);
894 ext2fs_free_mem(&buf2);
897 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
898 if (dx_dir && dx_dir->numblocks) {
899 if (db->blockcnt >= dx_dir->numblocks) {
900 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
902 clear_htree(ctx, ino);
903 dx_dir->numblocks = 0;
907 fatal_error(ctx, _("Can not continue."));
909 dx_db = &dx_dir->dx_block[db->blockcnt];
910 dx_db->type = DX_DIRBLOCK_LEAF;
911 dx_db->phys = block_nr;
912 dx_db->min_hash = ~0;
915 dirent = (struct ext2_dir_entry *) buf;
916 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
917 limit = (struct ext2_dx_countlimit *) (buf+8);
918 if (db->blockcnt == 0) {
919 root = (struct ext2_dx_root_info *) (buf + 24);
920 dx_db->type = DX_DIRBLOCK_ROOT;
921 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
922 if ((root->reserved_zero ||
923 root->info_length < 8 ||
924 root->indirect_levels > 1) &&
925 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
926 clear_htree(ctx, ino);
927 dx_dir->numblocks = 0;
930 dx_dir->hashversion = root->hash_version;
931 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
932 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
933 dx_dir->hashversion += 3;
934 dx_dir->depth = root->indirect_levels + 1;
935 } else if ((dirent->inode == 0) &&
936 (rec_len == fs->blocksize) &&
937 (ext2fs_dirent_name_len(dirent) == 0) &&
938 (ext2fs_le16_to_cpu(limit->limit) ==
939 ((fs->blocksize - (8 + dx_csum_size)) /
940 sizeof(struct ext2_dx_entry))))
941 dx_db->type = DX_DIRBLOCK_NODE;
945 #endif /* ENABLE_HTREE */
947 /* Leaf node with no space for csum? Rebuild dirs in pass 3A. */
948 if (is_leaf && !inline_data_size && failed_csum &&
949 !ext2fs_dirent_has_tail(fs, (struct ext2_dir_entry *)buf)) {
951 if (e2fsck_dir_will_be_rehashed(ctx, ino) ||
952 !fix_problem(cd->ctx, PR_2_LEAF_NODE_MISSING_CSUM,
955 e2fsck_rehash_dir_later(ctx, ino);
958 /* htree nodes don't use fake dirents to store checksums */
963 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
967 ext2_ino_t first_unused_inode;
968 unsigned int name_len;
971 if (!inline_data_size || dot_state > 1) {
972 dirent = (struct ext2_dir_entry *) (buf + offset);
973 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
974 cd->pctx.dirent = dirent;
975 cd->pctx.num = offset;
976 if (((offset + rec_len) > fs->blocksize) ||
978 ((rec_len % 4) != 0) ||
979 ((ext2fs_dirent_name_len(dirent) + 8) > rec_len)) {
980 if (fix_problem(ctx, PR_2_DIR_CORRUPTED,
982 salvage_directory(fs, dirent, prev,
989 goto abort_free_dict;
992 if (dot_state == 0) {
993 memset(&dot, 0, sizeof(dot));
996 dirent->rec_len = EXT2_DIR_REC_LEN(1);
997 dirent->name_len = 1 | filetype;
998 dirent->name[0] = '.';
999 } else if (dot_state == 1) {
1000 memset(&dotdot, 0, sizeof(dotdot));
1003 ((struct ext2_dir_entry *)buf)->inode;
1004 dirent->rec_len = EXT2_DIR_REC_LEN(2);
1005 dirent->name_len = 2 | filetype;
1006 dirent->name[0] = '.';
1007 dirent->name[1] = '.';
1009 fatal_error(ctx, _("Can not continue."));
1011 cd->pctx.dirent = dirent;
1012 cd->pctx.num = offset;
1015 if (dot_state == 0) {
1016 if (check_dot(ctx, dirent, ino, &cd->pctx))
1018 } else if (dot_state == 1) {
1019 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
1021 goto abort_free_dict;
1024 } else if (dirent->inode == ino) {
1025 problem = PR_2_LINK_DOT;
1026 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
1036 * Make sure the inode listed is a legal one.
1038 name_len = ext2fs_dirent_name_len(dirent);
1039 if (((dirent->inode != EXT2_ROOT_INO) &&
1040 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
1041 (dirent->inode > fs->super->s_inodes_count)) {
1042 problem = PR_2_BAD_INO;
1043 } else if (ctx->inode_bb_map &&
1044 (ext2fs_test_inode_bitmap2(ctx->inode_bb_map,
1047 * If the inode is in a bad block, offer to
1050 problem = PR_2_BB_INODE;
1051 } else if ((dot_state > 1) && (name_len == 1) &&
1052 (dirent->name[0] == '.')) {
1054 * If there's a '.' entry in anything other
1055 * than the first directory entry, it's a
1056 * duplicate entry that should be removed.
1058 problem = PR_2_DUP_DOT;
1059 } else if ((dot_state > 1) && (name_len == 2) &&
1060 (dirent->name[0] == '.') &&
1061 (dirent->name[1] == '.')) {
1063 * If there's a '..' entry in anything other
1064 * than the second directory entry, it's a
1065 * duplicate entry that should be removed.
1067 problem = PR_2_DUP_DOT_DOT;
1068 } else if ((dot_state > 1) &&
1069 (dirent->inode == EXT2_ROOT_INO)) {
1071 * Don't allow links to the root directory.
1072 * We check this specially to make sure we
1073 * catch this error case even if the root
1074 * directory hasn't been created yet.
1076 problem = PR_2_LINK_ROOT;
1077 } else if ((dot_state > 1) && (name_len == 0)) {
1079 * Don't allow zero-length directory names.
1081 problem = PR_2_NULL_NAME;
1085 if (fix_problem(ctx, problem, &cd->pctx)) {
1090 ext2fs_unmark_valid(fs);
1091 if (problem == PR_2_BAD_INO)
1097 * If the inode was marked as having bad fields in
1098 * pass1, process it and offer to fix/clear it.
1099 * (We wait until now so that we can display the
1100 * pathname to the user.)
1102 if (ctx->inode_bad_map &&
1103 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
1105 if (e2fsck_process_bad_inode(ctx, ino,
1107 buf + fs->blocksize)) {
1112 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1113 return DIRENT_ABORT;
1116 group = ext2fs_group_of_ino(fs, dirent->inode);
1117 first_unused_inode = group * fs->super->s_inodes_per_group +
1118 1 + fs->super->s_inodes_per_group -
1119 ext2fs_bg_itable_unused(fs, group);
1120 cd->pctx.group = group;
1123 * Check if the inode was missed out because
1124 * _INODE_UNINIT flag was set or bg_itable_unused was
1125 * incorrect. If so, clear the _INODE_UNINIT flag and
1126 * restart e2fsck. In the future it would be nice if
1127 * we could call a function in pass1.c that checks the
1128 * newly visible inodes.
1130 if (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)) {
1131 pctx.num = dirent->inode;
1132 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
1134 ext2fs_bg_flags_clear(fs, group,
1135 EXT2_BG_INODE_UNINIT);
1136 ext2fs_mark_super_dirty(fs);
1137 ctx->flags |= E2F_FLAG_RESTART_LATER;
1139 ext2fs_unmark_valid(fs);
1140 if (problem == PR_2_BAD_INO)
1143 } else if (dirent->inode >= first_unused_inode) {
1144 pctx.num = dirent->inode;
1145 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
1146 ext2fs_bg_itable_unused_set(fs, group, 0);
1147 ext2fs_mark_super_dirty(fs);
1148 ctx->flags |= E2F_FLAG_RESTART_LATER;
1150 ext2fs_unmark_valid(fs);
1151 if (problem == PR_2_BAD_INO)
1157 * Offer to clear unused inodes; if we are going to be
1158 * restarting the scan due to bg_itable_unused being
1159 * wrong, then don't clear any inodes to avoid zapping
1160 * inodes that were skipped during pass1 due to an
1161 * incorrect bg_itable_unused; we'll get any real
1162 * problems after we restart.
1164 if (!(ctx->flags & E2F_FLAG_RESTART_LATER) &&
1165 !(ext2fs_test_inode_bitmap2(ctx->inode_used_map,
1167 problem = PR_2_UNUSED_INODE;
1170 if (fix_problem(ctx, problem, &cd->pctx)) {
1175 ext2fs_unmark_valid(fs);
1176 if (problem == PR_2_BAD_INO)
1181 if (check_name(ctx, dirent, ino, &cd->pctx))
1184 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1189 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
1190 ext2fs_dirent_name_len(dirent),
1191 fs->super->s_hash_seed, &hash, 0);
1192 if (hash < dx_db->min_hash)
1193 dx_db->min_hash = hash;
1194 if (hash > dx_db->max_hash)
1195 dx_db->max_hash = hash;
1200 * If this is a directory, then mark its parent in its
1201 * dir_info structure. If the parent field is already
1202 * filled in, then this directory has more than one
1203 * hard link. We assume the first link is correct,
1204 * and ask the user if he/she wants to clear this one.
1206 if ((dot_state > 1) &&
1207 (ext2fs_test_inode_bitmap2(ctx->inode_dir_map,
1209 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1211 cd->pctx.ino = dirent->inode;
1212 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1213 goto abort_free_dict;
1215 if (subdir_parent) {
1216 cd->pctx.ino2 = subdir_parent;
1217 if (fix_problem(ctx, PR_2_LINK_DIR,
1225 (void) e2fsck_dir_info_set_parent(ctx,
1226 dirent->inode, ino);
1232 } else if (dict_lookup(&de_dict, dirent)) {
1233 clear_problem_context(&pctx);
1235 pctx.dirent = dirent;
1236 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1237 e2fsck_rehash_dir_later(ctx, ino);
1240 dict_alloc_insert(&de_dict, dirent, dirent);
1242 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1245 ctx->fs_links_count++;
1246 ctx->fs_total_count++;
1250 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1251 if (!inline_data_size || dot_state > 1) {
1258 } while (is_last_entry(fs, inline_data_size, offset, de_csum_size));
1265 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1266 db->blockcnt, dx_db->type,
1267 dx_db->min_hash, dx_db->max_hash);
1269 cd->pctx.dir = cd->pctx.ino;
1270 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1271 (dx_db->type == DX_DIRBLOCK_NODE))
1272 parse_int_node(fs, db, cd, dx_dir, buf, failed_csum);
1274 #endif /* ENABLE_HTREE */
1276 if (inline_data_size) {
1277 if (offset != inline_data_size) {
1278 cd->pctx.num = rec_len + offset - inline_data_size;
1279 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1280 dirent->rec_len = cd->pctx.num;
1285 if (offset != fs->blocksize - de_csum_size) {
1286 cd->pctx.num = rec_len - (fs->blocksize - de_csum_size) +
1288 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1289 dirent->rec_len = cd->pctx.num;
1295 /* leaf block with no tail? Rehash dirs later. */
1296 if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super,
1297 EXT4_FEATURE_RO_COMPAT_METADATA_CSUM) &&
1299 !inline_data_size &&
1300 !ext2fs_dirent_has_tail(fs, (struct ext2_dir_entry *)buf)) {
1301 if (insert_dirent_tail(fs, buf) == 0)
1303 e2fsck_rehash_dir_later(ctx, ino);
1307 if (e2fsck_dir_will_be_rehashed(ctx, ino))
1308 ctx->fs->flags |= EXT2_FLAG_IGNORE_CSUM_ERRORS;
1309 if (inline_data_size) {
1311 ext2fs_inline_data_set(fs, ino, 0, buf,
1314 cd->pctx.errcode = ext2fs_write_dir_block4(fs, block_nr,
1316 if (e2fsck_dir_will_be_rehashed(ctx, ino))
1317 ctx->fs->flags &= ~EXT2_FLAG_IGNORE_CSUM_ERRORS;
1318 if (cd->pctx.errcode) {
1319 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1321 goto abort_free_dict;
1323 ext2fs_mark_changed(fs);
1324 } else if (is_leaf && failed_csum && !dir_modified) {
1326 * If a leaf node that fails csum makes it this far without
1327 * alteration, ask the user if the checksum should be fixed.
1329 if (fix_problem(ctx, PR_2_LEAF_NODE_ONLY_CSUM_INVALID,
1333 dict_free_nodes(&de_dict);
1336 ctx->flags |= E2F_FLAG_ABORT;
1337 dict_free_nodes(&de_dict);
1338 return DIRENT_ABORT;
1347 * This function is called to deallocate a block, and is an interator
1348 * functioned called by deallocate inode via ext2fs_iterate_block().
1350 static int deallocate_inode_block(ext2_filsys fs,
1352 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1353 blk64_t ref_block EXT2FS_ATTR((unused)),
1354 int ref_offset EXT2FS_ATTR((unused)),
1357 struct del_block *p = priv_data;
1359 if (HOLE_BLKADDR(*block_nr))
1361 if ((*block_nr < fs->super->s_first_data_block) ||
1362 (*block_nr >= ext2fs_blocks_count(fs->super)))
1364 if ((*block_nr % EXT2FS_CLUSTER_RATIO(fs)) == 0)
1365 ext2fs_block_alloc_stats2(fs, *block_nr, -1);
1371 * This fuction deallocates an inode
1373 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1375 ext2_filsys fs = ctx->fs;
1376 struct ext2_inode inode;
1377 struct problem_context pctx;
1379 struct del_block del_block;
1381 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1382 clear_problem_context(&pctx);
1386 * Fix up the bitmaps...
1388 e2fsck_read_bitmaps(ctx);
1389 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1391 if (ext2fs_file_acl_block(fs, &inode) &&
1392 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1393 pctx.errcode = ext2fs_adjust_ea_refcount3(fs,
1394 ext2fs_file_acl_block(fs, &inode),
1395 block_buf, -1, &count, ino);
1396 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1401 pctx.blk = ext2fs_file_acl_block(fs, &inode);
1402 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1403 ctx->flags |= E2F_FLAG_ABORT;
1407 ext2fs_block_alloc_stats2(fs,
1408 ext2fs_file_acl_block(fs, &inode), -1);
1410 ext2fs_file_acl_block_set(fs, &inode, 0);
1413 if (!ext2fs_inode_has_valid_blocks2(fs, &inode))
1416 if (LINUX_S_ISREG(inode.i_mode) &&
1417 ext2fs_needs_large_file_feature(EXT2_I_SIZE(&inode)))
1420 del_block.ctx = ctx;
1422 pctx.errcode = ext2fs_block_iterate3(fs, ino, 0, block_buf,
1423 deallocate_inode_block,
1426 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1427 ctx->flags |= E2F_FLAG_ABORT;
1431 /* Inode may have changed by block_iterate, so reread it */
1432 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1433 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1437 * This fuction clears the htree flag on an inode
1439 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1441 struct ext2_inode inode;
1443 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1444 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1445 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1446 if (ctx->dirs_to_hash)
1447 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1451 int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1452 ext2_ino_t ino, char *buf)
1454 ext2_filsys fs = ctx->fs;
1455 struct ext2_inode inode;
1456 int inode_modified = 0;
1458 unsigned char *frag, *fsize;
1459 struct problem_context pctx;
1460 problem_t problem = 0;
1462 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1464 clear_problem_context(&pctx);
1467 pctx.inode = &inode;
1469 if (ext2fs_file_acl_block(fs, &inode) &&
1470 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1471 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1472 ext2fs_file_acl_block_set(fs, &inode, 0);
1478 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1479 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1480 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1481 !(LINUX_S_ISSOCK(inode.i_mode)))
1482 problem = PR_2_BAD_MODE;
1483 else if (LINUX_S_ISCHR(inode.i_mode)
1484 && !e2fsck_pass1_check_device_inode(fs, &inode))
1485 problem = PR_2_BAD_CHAR_DEV;
1486 else if (LINUX_S_ISBLK(inode.i_mode)
1487 && !e2fsck_pass1_check_device_inode(fs, &inode))
1488 problem = PR_2_BAD_BLOCK_DEV;
1489 else if (LINUX_S_ISFIFO(inode.i_mode)
1490 && !e2fsck_pass1_check_device_inode(fs, &inode))
1491 problem = PR_2_BAD_FIFO;
1492 else if (LINUX_S_ISSOCK(inode.i_mode)
1493 && !e2fsck_pass1_check_device_inode(fs, &inode))
1494 problem = PR_2_BAD_SOCKET;
1495 else if (LINUX_S_ISLNK(inode.i_mode)
1496 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1497 problem = PR_2_INVALID_SYMLINK;
1501 if (fix_problem(ctx, problem, &pctx)) {
1502 deallocate_inode(ctx, ino, 0);
1503 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1511 if (inode.i_faddr) {
1512 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1519 switch (fs->super->s_creator_os) {
1521 frag = &inode.osd2.hurd2.h_i_frag;
1522 fsize = &inode.osd2.hurd2.h_i_fsize;
1527 if (frag && *frag) {
1529 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1536 if (fsize && *fsize) {
1538 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1546 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1547 !(fs->super->s_feature_ro_compat &
1548 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1549 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1550 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1551 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1552 inode.osd2.linux2.l_i_blocks_hi = 0;
1557 if (!(fs->super->s_feature_incompat &
1558 EXT4_FEATURE_INCOMPAT_64BIT) &&
1559 inode.osd2.linux2.l_i_file_acl_high != 0) {
1560 pctx.num = inode.osd2.linux2.l_i_file_acl_high;
1561 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) {
1562 inode.osd2.linux2.l_i_file_acl_high = 0;
1568 if (ext2fs_file_acl_block(fs, &inode) &&
1569 ((ext2fs_file_acl_block(fs, &inode) < fs->super->s_first_data_block) ||
1570 (ext2fs_file_acl_block(fs, &inode) >= ext2fs_blocks_count(fs->super)))) {
1571 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1572 ext2fs_file_acl_block_set(fs, &inode, 0);
1577 if (inode.i_dir_acl &&
1578 LINUX_S_ISDIR(inode.i_mode)) {
1579 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1580 inode.i_dir_acl = 0;
1587 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1588 if (!not_fixed && ctx->inode_bad_map)
1589 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino);
1595 * allocate_dir_block --- this function allocates a new directory
1596 * block for a particular inode; this is done if a directory has
1597 * a "hole" in it, or if a directory has a illegal block number
1598 * that was zeroed out and now needs to be replaced.
1600 static int allocate_dir_block(e2fsck_t ctx,
1601 struct ext2_db_entry2 *db,
1602 char *buf EXT2FS_ATTR((unused)),
1603 struct problem_context *pctx)
1605 ext2_filsys fs = ctx->fs;
1608 struct ext2_inode inode;
1610 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1614 * Read the inode and block bitmaps in; we'll be messing with
1617 e2fsck_read_bitmaps(ctx);
1620 * First, find a free block
1622 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1623 pctx->errcode = ext2fs_map_cluster_block(fs, db->ino, &inode,
1624 db->blockcnt, &blk);
1625 if (pctx->errcode || blk == 0) {
1626 pctx->errcode = ext2fs_new_block2(fs, 0,
1627 ctx->block_found_map, &blk);
1628 if (pctx->errcode) {
1629 pctx->str = "ext2fs_new_block";
1630 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1634 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
1635 ext2fs_mark_block_bitmap2(fs->block_map, blk);
1636 ext2fs_mark_bb_dirty(fs);
1639 * Now let's create the actual data block for the inode
1642 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1644 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1645 EXT2_ROOT_INO, &block);
1647 if (pctx->errcode) {
1648 pctx->str = "ext2fs_new_dir_block";
1649 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1653 pctx->errcode = ext2fs_write_dir_block4(fs, blk, block, 0, db->ino);
1654 ext2fs_free_mem(&block);
1655 if (pctx->errcode) {
1656 pctx->str = "ext2fs_write_dir_block";
1657 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1662 * Update the inode block count
1664 ext2fs_iblk_add_blocks(fs, &inode, 1);
1665 if (EXT2_I_SIZE(&inode) < (db->blockcnt+1) * fs->blocksize) {
1666 pctx->errcode = ext2fs_inode_size_set(fs, &inode,
1667 (db->blockcnt+1) * fs->blocksize);
1668 if (pctx->errcode) {
1669 pctx->str = "ext2fs_inode_size_set";
1670 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1674 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1677 * Finally, update the block pointers for the inode
1680 pctx->errcode = ext2fs_bmap2(fs, db->ino, &inode, 0, BMAP_SET,
1681 db->blockcnt, 0, &blk);
1682 if (pctx->errcode) {
1683 pctx->str = "ext2fs_block_iterate";
1684 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);