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() */
51 #ifdef NO_INLINE_FUNCS
54 #define _INLINE_ inline
57 /* #define DX_DEBUG */
60 * Keeps track of how many times an inode is referenced.
62 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf);
63 static int check_dir_block(ext2_filsys fs,
64 struct ext2_db_entry *dir_blocks_info,
66 static int allocate_dir_block(e2fsck_t ctx,
67 struct ext2_db_entry *dir_blocks_info,
68 char *buf, struct problem_context *pctx);
69 static int update_dir_block(ext2_filsys fs,
75 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino);
76 static int htree_depth(struct dx_dir_info *dx_dir,
77 struct dx_dirblock_info *dx_db);
78 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b);
80 struct check_dir_struct {
82 struct problem_context pctx;
87 void e2fsck_pass2(e2fsck_t ctx)
89 struct ext2_super_block *sb = ctx->fs->super;
90 struct problem_context pctx;
91 ext2_filsys fs = ctx->fs;
94 struct resource_track rtrack;
96 struct check_dir_struct cd;
97 struct dx_dir_info *dx_dir;
98 struct dx_dirblock_info *dx_db, *dx_parent;
104 init_resource_track(&rtrack, ctx->fs->io);
105 clear_problem_context(&cd.pctx);
108 mtrace_print("Pass 2");
111 if (!(ctx->options & E2F_OPT_PREEN))
112 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
114 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
116 if (ctx->inode_count)
119 cd.pctx.errcode = ext2fs_create_icount2(fs,
120 EXT2_ICOUNT_OPT_INCREMENT,
121 0, ctx->inode_link_info,
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_count(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_sort(fs->dblist, special_dir_block_cmp);
149 cd.pctx.errcode = ext2fs_dblist_iterate(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 = de_a->name_len & 0xFF;
306 de_b = (const struct ext2_dir_entry *) b;
307 b_len = de_b->name_len & 0xFF;
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_entry *db_a =
324 (const struct ext2_db_entry *) a;
325 const struct ext2_db_entry *db_b =
326 (const struct ext2_db_entry *) 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;
359 problem = PR_2_MISSING_DOT;
360 else if (((dirent->name_len & 0xFF) != 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 dirent->name_len = 1;
373 dirent->name[0] = '.';
374 dirent->name[1] = '\0';
379 if (dirent->inode != ino) {
380 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
386 new_len = rec_len - 12;
389 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
390 nextdir = (struct ext2_dir_entry *)
391 ((char *) dirent + 12);
392 dirent->rec_len = 12;
393 (void) ext2fs_set_rec_len(ctx->fs, new_len,
396 nextdir->name_len = 0;
405 * Make sure the second entry in the directory is '..', and that the
406 * directory entry is sane. We do not check the inode number of '..'
407 * here; this gets done in pass 3.
409 static int check_dotdot(e2fsck_t ctx,
410 struct ext2_dir_entry *dirent,
411 ext2_ino_t ino, struct problem_context *pctx)
413 int rec_len, problem = 0;
416 problem = PR_2_MISSING_DOT_DOT;
417 else if (((dirent->name_len & 0xFF) != 2) ||
418 (dirent->name[0] != '.') ||
419 (dirent->name[1] != '.'))
420 problem = PR_2_2ND_NOT_DOT_DOT;
421 else if (dirent->name[2] != '\0')
422 problem = PR_2_DOT_DOT_NULL_TERM;
424 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
426 if (fix_problem(ctx, problem, pctx)) {
428 dirent->rec_len = 12;
430 * Note: we don't have the parent inode just
431 * yet, so we will fill it in with the root
432 * inode. This will get fixed in pass 3.
434 dirent->inode = EXT2_ROOT_INO;
435 dirent->name_len = 2;
436 dirent->name[0] = '.';
437 dirent->name[1] = '.';
438 dirent->name[2] = '\0';
443 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
444 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
451 * Check to make sure a directory entry doesn't contain any illegal
454 static int check_name(e2fsck_t ctx,
455 struct ext2_dir_entry *dirent,
456 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
457 struct problem_context *pctx)
463 for ( i = 0; i < (dirent->name_len & 0xFF); i++) {
464 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
466 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
469 dirent->name[i] = '.';
478 * Check the directory filetype (if present)
480 static _INLINE_ int check_filetype(e2fsck_t ctx,
481 struct ext2_dir_entry *dirent,
482 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
483 struct problem_context *pctx)
485 int filetype = dirent->name_len >> 8;
486 int should_be = EXT2_FT_UNKNOWN;
487 struct ext2_inode inode;
489 if (!(ctx->fs->super->s_feature_incompat &
490 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
492 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
494 dirent->name_len = dirent->name_len & 0xFF;
498 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dirent->inode)) {
499 should_be = EXT2_FT_DIR;
500 } else if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map,
502 should_be = EXT2_FT_REG_FILE;
503 } else if (ctx->inode_bad_map &&
504 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
508 e2fsck_read_inode(ctx, dirent->inode, &inode,
510 should_be = ext2_file_type(inode.i_mode);
512 if (filetype == should_be)
514 pctx->num = should_be;
516 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
520 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8;
525 static void parse_int_node(ext2_filsys fs,
526 struct ext2_db_entry *db,
527 struct check_dir_struct *cd,
528 struct dx_dir_info *dx_dir,
531 struct ext2_dx_root_info *root;
532 struct ext2_dx_entry *ent;
533 struct ext2_dx_countlimit *limit;
534 struct dx_dirblock_info *dx_db;
535 int i, expect_limit, count;
537 ext2_dirhash_t min_hash = 0xffffffff;
538 ext2_dirhash_t max_hash = 0;
539 ext2_dirhash_t hash = 0, prev_hash;
541 if (db->blockcnt == 0) {
542 root = (struct ext2_dx_root_info *) (block_buf + 24);
545 printf("Root node dump:\n");
546 printf("\t Reserved zero: %u\n", root->reserved_zero);
547 printf("\t Hash Version: %d\n", root->hash_version);
548 printf("\t Info length: %d\n", root->info_length);
549 printf("\t Indirect levels: %d\n", root->indirect_levels);
550 printf("\t Flags: %d\n", root->unused_flags);
553 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
555 ent = (struct ext2_dx_entry *) (block_buf+8);
557 limit = (struct ext2_dx_countlimit *) ent;
560 printf("Number of entries (count): %d\n",
561 ext2fs_le16_to_cpu(limit->count));
562 printf("Number of entries (limit): %d\n",
563 ext2fs_le16_to_cpu(limit->limit));
566 count = ext2fs_le16_to_cpu(limit->count);
567 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) /
568 sizeof(struct ext2_dx_entry);
569 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
570 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
571 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
574 if (count > expect_limit) {
575 cd->pctx.num = count;
576 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
578 count = expect_limit;
581 for (i=0; i < count; i++) {
583 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
585 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
586 hash, ext2fs_le32_to_cpu(ent[i].block));
588 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
589 /* Check to make sure the block is valid */
590 if (blk >= (blk_t) dx_dir->numblocks) {
592 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
597 if (hash < prev_hash &&
598 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
600 dx_db = &dx_dir->dx_block[blk];
601 if (dx_db->flags & DX_FLAG_REFERENCED) {
602 dx_db->flags |= DX_FLAG_DUP_REF;
604 dx_db->flags |= DX_FLAG_REFERENCED;
605 dx_db->parent = db->blockcnt;
611 dx_db->node_min_hash = hash;
613 dx_db->node_max_hash =
614 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
616 dx_db->node_max_hash = 0xfffffffe;
617 dx_db->flags |= DX_FLAG_LAST;
620 dx_db->flags |= DX_FLAG_FIRST;
623 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
624 db->blockcnt, min_hash, max_hash);
626 dx_db = &dx_dir->dx_block[db->blockcnt];
627 dx_db->min_hash = min_hash;
628 dx_db->max_hash = max_hash;
632 clear_htree(cd->ctx, cd->pctx.ino);
633 dx_dir->numblocks = 0;
635 #endif /* ENABLE_HTREE */
638 * Given a busted directory, try to salvage it somehow.
641 static void salvage_directory(ext2_filsys fs,
642 struct ext2_dir_entry *dirent,
643 struct ext2_dir_entry *prev,
644 unsigned int *offset)
646 char *cp = (char *) dirent;
648 unsigned int rec_len, prev_rec_len;
649 unsigned int name_len = dirent->name_len & 0xFF;
651 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
652 left = fs->blocksize - *offset - rec_len;
655 * Special case of directory entry of size 8: copy what's left
656 * of the directory block up to cover up the invalid hole.
658 if ((left >= 12) && (rec_len == 8)) {
659 memmove(cp, cp+8, left);
660 memset(cp + left, 0, 8);
664 * If the directory entry overruns the end of the directory
665 * block, and the name is small enough to fit, then adjust the
669 ((int) rec_len + left > 8) &&
670 (name_len + 8 <= (int) rec_len + left) &&
671 dirent->inode <= fs->super->s_inodes_count &&
672 strnlen(dirent->name, name_len) == name_len) {
673 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent);
677 * If the record length of the directory entry is a multiple
678 * of four, and not too big, such that it is valid, let the
679 * previous directory entry absorb the invalid one.
681 if (prev && rec_len && (rec_len % 4) == 0 &&
682 (*offset + rec_len <= fs->blocksize)) {
683 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
684 prev_rec_len += rec_len;
685 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
690 * Default salvage method --- kill all of the directory
691 * entries for the rest of the block. We will either try to
692 * absorb it into the previous directory entry, or create a
693 * new empty directory entry the rest of the directory block.
696 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
697 prev_rec_len += fs->blocksize - *offset;
698 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
699 *offset = fs->blocksize;
701 rec_len = fs->blocksize - *offset;
702 (void) ext2fs_set_rec_len(fs, rec_len, dirent);
703 dirent->name_len = 0;
708 static int check_dir_block(ext2_filsys fs,
709 struct ext2_db_entry *db,
712 struct dx_dir_info *dx_dir;
714 struct dx_dirblock_info *dx_db = 0;
715 #endif /* ENABLE_HTREE */
716 struct ext2_dir_entry *dirent, *prev;
718 unsigned int offset = 0;
720 int dir_modified = 0;
722 unsigned int rec_len;
723 blk_t block_nr = db->blk;
724 ext2_ino_t ino = db->ino;
725 ext2_ino_t subdir_parent;
727 struct check_dir_struct *cd;
731 struct ext2_dx_root_info *root;
732 struct ext2_dx_countlimit *limit;
733 static dict_t de_dict;
734 struct problem_context pctx;
738 cd = (struct check_dir_struct *) priv_data;
742 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
745 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
749 * Make sure the inode is still in use (could have been
750 * deleted in the duplicate/bad blocks pass.
752 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino)))
756 cd->pctx.blk = block_nr;
757 cd->pctx.blkcount = db->blockcnt;
763 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
773 if (ctx->dirs_to_hash &&
774 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
778 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
782 old_op = ehandler_operation(_("reading directory block"));
783 cd->pctx.errcode = ext2fs_read_dir_block(fs, block_nr, buf);
784 ehandler_operation(0);
785 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
786 cd->pctx.errcode = 0; /* We'll handle this ourselves */
787 if (cd->pctx.errcode) {
788 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
789 ctx->flags |= E2F_FLAG_ABORT;
792 memset(buf, 0, fs->blocksize);
795 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
796 if (dx_dir && dx_dir->numblocks) {
797 if (db->blockcnt >= dx_dir->numblocks) {
798 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
800 clear_htree(ctx, ino);
801 dx_dir->numblocks = 0;
805 fatal_error(ctx, _("Can not continue."));
807 dx_db = &dx_dir->dx_block[db->blockcnt];
808 dx_db->type = DX_DIRBLOCK_LEAF;
809 dx_db->phys = block_nr;
810 dx_db->min_hash = ~0;
813 dirent = (struct ext2_dir_entry *) buf;
814 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
815 limit = (struct ext2_dx_countlimit *) (buf+8);
816 if (db->blockcnt == 0) {
817 root = (struct ext2_dx_root_info *) (buf + 24);
818 dx_db->type = DX_DIRBLOCK_ROOT;
819 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
820 if ((root->reserved_zero ||
821 root->info_length < 8 ||
822 root->indirect_levels > 1) &&
823 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
824 clear_htree(ctx, ino);
825 dx_dir->numblocks = 0;
828 dx_dir->hashversion = root->hash_version;
829 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
830 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
831 dx_dir->hashversion += 3;
832 dx_dir->depth = root->indirect_levels + 1;
833 } else if ((dirent->inode == 0) &&
834 (rec_len == fs->blocksize) &&
835 (dirent->name_len == 0) &&
836 (ext2fs_le16_to_cpu(limit->limit) ==
838 sizeof(struct ext2_dx_entry))))
839 dx_db->type = DX_DIRBLOCK_NODE;
842 #endif /* ENABLE_HTREE */
844 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
848 ext2_ino_t first_unused_inode;
851 dirent = (struct ext2_dir_entry *) (buf + offset);
852 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
853 cd->pctx.dirent = dirent;
854 cd->pctx.num = offset;
855 if (((offset + rec_len) > fs->blocksize) ||
857 ((rec_len % 4) != 0) ||
858 (((dirent->name_len & (unsigned) 0xFF)+8) > rec_len)) {
859 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) {
860 salvage_directory(fs, dirent, prev, &offset);
864 goto abort_free_dict;
866 if ((dirent->name_len & 0xFF) > EXT2_NAME_LEN) {
867 if (fix_problem(ctx, PR_2_FILENAME_LONG, &cd->pctx)) {
868 dirent->name_len = EXT2_NAME_LEN;
873 if (dot_state == 0) {
874 if (check_dot(ctx, dirent, ino, &cd->pctx))
876 } else if (dot_state == 1) {
877 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
879 goto abort_free_dict;
882 } else if (dirent->inode == ino) {
883 problem = PR_2_LINK_DOT;
884 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
894 * Make sure the inode listed is a legal one.
896 if (((dirent->inode != EXT2_ROOT_INO) &&
897 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
898 (dirent->inode > fs->super->s_inodes_count)) {
899 problem = PR_2_BAD_INO;
900 } else if (ctx->inode_bb_map &&
901 (ext2fs_test_inode_bitmap2(ctx->inode_bb_map,
904 * If the inode is in a bad block, offer to
907 problem = PR_2_BB_INODE;
908 } else if ((dot_state > 1) &&
909 ((dirent->name_len & 0xFF) == 1) &&
910 (dirent->name[0] == '.')) {
912 * If there's a '.' entry in anything other
913 * than the first directory entry, it's a
914 * duplicate entry that should be removed.
916 problem = PR_2_DUP_DOT;
917 } else if ((dot_state > 1) &&
918 ((dirent->name_len & 0xFF) == 2) &&
919 (dirent->name[0] == '.') &&
920 (dirent->name[1] == '.')) {
922 * If there's a '..' entry in anything other
923 * than the second directory entry, it's a
924 * duplicate entry that should be removed.
926 problem = PR_2_DUP_DOT_DOT;
927 } else if ((dot_state > 1) &&
928 (dirent->inode == EXT2_ROOT_INO)) {
930 * Don't allow links to the root directory.
931 * We check this specially to make sure we
932 * catch this error case even if the root
933 * directory hasn't been created yet.
935 problem = PR_2_LINK_ROOT;
936 } else if ((dot_state > 1) &&
937 (dirent->name_len & 0xFF) == 0) {
939 * Don't allow zero-length directory names.
941 problem = PR_2_NULL_NAME;
945 if (fix_problem(ctx, problem, &cd->pctx)) {
950 ext2fs_unmark_valid(fs);
951 if (problem == PR_2_BAD_INO)
957 * If the inode was marked as having bad fields in
958 * pass1, process it and offer to fix/clear it.
959 * (We wait until now so that we can display the
960 * pathname to the user.)
962 if (ctx->inode_bad_map &&
963 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
965 if (e2fsck_process_bad_inode(ctx, ino,
967 buf + fs->blocksize)) {
972 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
976 group = ext2fs_group_of_ino(fs, dirent->inode);
977 first_unused_inode = group * fs->super->s_inodes_per_group +
978 1 + fs->super->s_inodes_per_group -
979 fs->group_desc[group].bg_itable_unused;
980 cd->pctx.group = group;
983 * Check if the inode was missed out because
984 * _INODE_UNINIT flag was set or bg_itable_unused was
985 * incorrect. If so, clear the _INODE_UNINIT flag and
986 * restart e2fsck. In the future it would be nice if
987 * we could call a function in pass1.c that checks the
988 * newly visible inodes.
990 if (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)) {
991 pctx.num = dirent->inode;
992 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
994 ext2fs_bg_flags_clear(fs, group,
995 EXT2_BG_INODE_UNINIT);
996 ext2fs_mark_super_dirty(fs);
997 ctx->flags |= E2F_FLAG_RESTART_LATER;
999 ext2fs_unmark_valid(fs);
1000 if (problem == PR_2_BAD_INO)
1003 } else if (dirent->inode >= first_unused_inode) {
1004 pctx.num = dirent->inode;
1005 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
1006 fs->group_desc[group].bg_itable_unused = 0;
1007 ext2fs_mark_super_dirty(fs);
1008 ctx->flags |= E2F_FLAG_RESTART_LATER;
1010 ext2fs_unmark_valid(fs);
1011 if (problem == PR_2_BAD_INO)
1016 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map,
1019 * If the inode is unused, offer to clear it.
1021 problem = PR_2_UNUSED_INODE;
1025 if (fix_problem(ctx, problem, &cd->pctx)) {
1030 ext2fs_unmark_valid(fs);
1031 if (problem == PR_2_BAD_INO)
1036 if (check_name(ctx, dirent, ino, &cd->pctx))
1039 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1044 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
1045 (dirent->name_len & 0xFF),
1046 fs->super->s_hash_seed, &hash, 0);
1047 if (hash < dx_db->min_hash)
1048 dx_db->min_hash = hash;
1049 if (hash > dx_db->max_hash)
1050 dx_db->max_hash = hash;
1055 * If this is a directory, then mark its parent in its
1056 * dir_info structure. If the parent field is already
1057 * filled in, then this directory has more than one
1058 * hard link. We assume the first link is correct,
1059 * and ask the user if he/she wants to clear this one.
1061 if ((dot_state > 1) &&
1062 (ext2fs_test_inode_bitmap2(ctx->inode_dir_map,
1064 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1066 cd->pctx.ino = dirent->inode;
1067 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1068 goto abort_free_dict;
1070 if (subdir_parent) {
1071 cd->pctx.ino2 = subdir_parent;
1072 if (fix_problem(ctx, PR_2_LINK_DIR,
1080 (void) e2fsck_dir_info_set_parent(ctx,
1081 dirent->inode, ino);
1087 } else if (dict_lookup(&de_dict, dirent)) {
1088 clear_problem_context(&pctx);
1090 pctx.dirent = dirent;
1091 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1092 if (!ctx->dirs_to_hash)
1093 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
1094 if (ctx->dirs_to_hash)
1095 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1098 dict_alloc_insert(&de_dict, dirent, dirent);
1100 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1103 ctx->fs_links_count++;
1104 ctx->fs_total_count++;
1108 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1111 } while (offset < fs->blocksize);
1118 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1119 db->blockcnt, dx_db->type,
1120 dx_db->min_hash, dx_db->max_hash);
1122 cd->pctx.dir = cd->pctx.ino;
1123 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1124 (dx_db->type == DX_DIRBLOCK_NODE))
1125 parse_int_node(fs, db, cd, dx_dir, buf);
1127 #endif /* ENABLE_HTREE */
1128 if (offset != fs->blocksize) {
1129 cd->pctx.num = rec_len - fs->blocksize + offset;
1130 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1131 dirent->rec_len = cd->pctx.num;
1136 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf);
1137 if (cd->pctx.errcode) {
1138 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1140 goto abort_free_dict;
1142 ext2fs_mark_changed(fs);
1144 dict_free_nodes(&de_dict);
1147 ctx->flags |= E2F_FLAG_ABORT;
1148 dict_free_nodes(&de_dict);
1149 return DIRENT_ABORT;
1153 * This function is called to deallocate a block, and is an interator
1154 * functioned called by deallocate inode via ext2fs_iterate_block().
1156 static int deallocate_inode_block(ext2_filsys fs,
1158 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1159 blk_t ref_block EXT2FS_ATTR((unused)),
1160 int ref_offset EXT2FS_ATTR((unused)),
1163 e2fsck_t ctx = (e2fsck_t) priv_data;
1165 if (HOLE_BLKADDR(*block_nr))
1167 if ((*block_nr < fs->super->s_first_data_block) ||
1168 (*block_nr >= ext2fs_blocks_count(fs->super)))
1170 ext2fs_unmark_block_bitmap2(ctx->block_found_map, *block_nr);
1171 ext2fs_block_alloc_stats(fs, *block_nr, -1);
1176 * This fuction deallocates an inode
1178 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1180 ext2_filsys fs = ctx->fs;
1181 struct ext2_inode inode;
1182 struct problem_context pctx;
1185 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1186 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1187 clear_problem_context(&pctx);
1191 * Fix up the bitmaps...
1193 e2fsck_read_bitmaps(ctx);
1194 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1196 if (ext2fs_file_acl_block(&inode) &&
1197 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1198 pctx.errcode = ext2fs_adjust_ea_refcount(fs, ext2fs_file_acl_block(&inode),
1199 block_buf, -1, &count);
1200 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1205 pctx.blk = ext2fs_file_acl_block(&inode);
1206 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1207 ctx->flags |= E2F_FLAG_ABORT;
1211 ext2fs_unmark_block_bitmap2(ctx->block_found_map,
1212 ext2fs_file_acl_block(&inode));
1213 ext2fs_block_alloc_stats(fs, ext2fs_file_acl_block(&inode), -1);
1215 ext2fs_file_acl_block_set(&inode, 0);
1218 if (!ext2fs_inode_has_valid_blocks(&inode))
1221 if (LINUX_S_ISREG(inode.i_mode) &&
1222 (inode.i_size_high || inode.i_size & 0x80000000UL))
1225 pctx.errcode = ext2fs_block_iterate2(fs, ino, 0, block_buf,
1226 deallocate_inode_block, ctx);
1228 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1229 ctx->flags |= E2F_FLAG_ABORT;
1235 * This fuction clears the htree flag on an inode
1237 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1239 struct ext2_inode inode;
1241 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1242 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1243 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1244 if (ctx->dirs_to_hash)
1245 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1249 extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1250 ext2_ino_t ino, char *buf)
1252 ext2_filsys fs = ctx->fs;
1253 struct ext2_inode inode;
1254 int inode_modified = 0;
1256 unsigned char *frag, *fsize;
1257 struct problem_context pctx;
1260 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1262 clear_problem_context(&pctx);
1265 pctx.inode = &inode;
1267 if (ext2fs_file_acl_block(&inode) &&
1268 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1269 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1270 ext2fs_file_acl_block_set(&inode, 0);
1276 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1277 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1278 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1279 !(LINUX_S_ISSOCK(inode.i_mode)))
1280 problem = PR_2_BAD_MODE;
1281 else if (LINUX_S_ISCHR(inode.i_mode)
1282 && !e2fsck_pass1_check_device_inode(fs, &inode))
1283 problem = PR_2_BAD_CHAR_DEV;
1284 else if (LINUX_S_ISBLK(inode.i_mode)
1285 && !e2fsck_pass1_check_device_inode(fs, &inode))
1286 problem = PR_2_BAD_BLOCK_DEV;
1287 else if (LINUX_S_ISFIFO(inode.i_mode)
1288 && !e2fsck_pass1_check_device_inode(fs, &inode))
1289 problem = PR_2_BAD_FIFO;
1290 else if (LINUX_S_ISSOCK(inode.i_mode)
1291 && !e2fsck_pass1_check_device_inode(fs, &inode))
1292 problem = PR_2_BAD_SOCKET;
1293 else if (LINUX_S_ISLNK(inode.i_mode)
1294 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1295 problem = PR_2_INVALID_SYMLINK;
1299 if (fix_problem(ctx, problem, &pctx)) {
1300 deallocate_inode(ctx, ino, 0);
1301 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1309 if (inode.i_faddr) {
1310 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1317 switch (fs->super->s_creator_os) {
1319 frag = &inode.osd2.hurd2.h_i_frag;
1320 fsize = &inode.osd2.hurd2.h_i_fsize;
1325 if (frag && *frag) {
1327 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1334 if (fsize && *fsize) {
1336 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1344 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1345 !(fs->super->s_feature_ro_compat &
1346 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1347 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1348 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1349 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1350 inode.osd2.linux2.l_i_blocks_hi = 0;
1355 if (!(fs->super->s_feature_incompat &
1356 EXT4_FEATURE_INCOMPAT_64BIT) &&
1357 inode.osd2.linux2.l_i_file_acl_high != 0) {
1358 pctx.num = inode.osd2.linux2.l_i_file_acl_high;
1359 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) {
1360 inode.osd2.linux2.l_i_file_acl_high = 0;
1366 if (ext2fs_file_acl_block(&inode) &&
1367 ((ext2fs_file_acl_block(&inode) < fs->super->s_first_data_block) ||
1368 (ext2fs_file_acl_block(&inode) >= ext2fs_blocks_count(fs->super)))) {
1369 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1370 ext2fs_file_acl_block_set(&inode, 0);
1375 if (inode.i_dir_acl &&
1376 LINUX_S_ISDIR(inode.i_mode)) {
1377 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1378 inode.i_dir_acl = 0;
1385 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1386 if (!not_fixed && ctx->inode_bad_map)
1387 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino);
1393 * allocate_dir_block --- this function allocates a new directory
1394 * block for a particular inode; this is done if a directory has
1395 * a "hole" in it, or if a directory has a illegal block number
1396 * that was zeroed out and now needs to be replaced.
1398 static int allocate_dir_block(e2fsck_t ctx,
1399 struct ext2_db_entry *db,
1400 char *buf EXT2FS_ATTR((unused)),
1401 struct problem_context *pctx)
1403 ext2_filsys fs = ctx->fs;
1406 struct ext2_inode inode;
1408 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1412 * Read the inode and block bitmaps in; we'll be messing with
1415 e2fsck_read_bitmaps(ctx);
1418 * First, find a free block
1420 pctx->errcode = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
1421 if (pctx->errcode) {
1422 pctx->str = "ext2fs_new_block";
1423 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1426 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
1427 ext2fs_mark_block_bitmap2(fs->block_map, blk);
1428 ext2fs_mark_bb_dirty(fs);
1431 * Now let's create the actual data block for the inode
1434 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1436 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1437 EXT2_ROOT_INO, &block);
1439 if (pctx->errcode) {
1440 pctx->str = "ext2fs_new_dir_block";
1441 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1445 pctx->errcode = ext2fs_write_dir_block(fs, blk, block);
1446 ext2fs_free_mem(&block);
1447 if (pctx->errcode) {
1448 pctx->str = "ext2fs_write_dir_block";
1449 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1454 * Update the inode block count
1456 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1457 ext2fs_iblk_add_blocks(fs, &inode, 1);
1458 if (inode.i_size < (db->blockcnt+1) * fs->blocksize)
1459 inode.i_size = (db->blockcnt+1) * fs->blocksize;
1460 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1463 * Finally, update the block pointers for the inode
1466 pctx->errcode = ext2fs_block_iterate2(fs, db->ino, BLOCK_FLAG_HOLE,
1467 0, update_dir_block, db);
1468 if (pctx->errcode) {
1469 pctx->str = "ext2fs_block_iterate";
1470 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1478 * This is a helper function for allocate_dir_block().
1480 static int update_dir_block(ext2_filsys fs EXT2FS_ATTR((unused)),
1482 e2_blkcnt_t blockcnt,
1483 blk_t ref_block EXT2FS_ATTR((unused)),
1484 int ref_offset EXT2FS_ATTR((unused)),
1487 struct ext2_db_entry *db;
1489 db = (struct ext2_db_entry *) priv_data;
1490 if (db->blockcnt == (int) blockcnt) {
1491 *block_nr = db->blk;
1492 return BLOCK_CHANGED;