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;
99 init_resource_track(&rtrack, ctx->fs->io);
100 clear_problem_context(&cd.pctx);
103 mtrace_print("Pass 2");
106 if (!(ctx->options & E2F_OPT_PREEN))
107 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
109 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
111 if (ctx->inode_count)
114 cd.pctx.errcode = ext2fs_create_icount2(fs,
115 EXT2_ICOUNT_OPT_INCREMENT,
116 0, ctx->inode_link_info,
118 if (cd.pctx.errcode) {
119 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
120 ctx->flags |= E2F_FLAG_ABORT;
123 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
124 "directory scan buffer");
127 * Set up the parent pointer for the root directory, if
128 * present. (If the root directory is not present, we will
129 * create it in pass 3.)
131 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
136 cd.max = ext2fs_dblist_count2(fs->dblist);
139 (void) (ctx->progress)(ctx, 2, 0, cd.max);
141 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX)
142 ext2fs_dblist_sort2(fs->dblist, special_dir_block_cmp);
144 cd.pctx.errcode = ext2fs_dblist_iterate2(fs->dblist, check_dir_block,
146 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
149 if (ctx->flags & E2F_FLAG_RESTART_LATER) {
150 ctx->flags |= E2F_FLAG_RESTART;
154 if (cd.pctx.errcode) {
155 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
156 ctx->flags |= E2F_FLAG_ABORT;
161 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
162 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
164 if (dx_dir->numblocks == 0)
166 clear_problem_context(&pctx);
168 pctx.dir = dx_dir->ino;
169 dx_db = dx_dir->dx_block;
170 if (dx_db->flags & DX_FLAG_REFERENCED)
171 dx_db->flags |= DX_FLAG_DUP_REF;
173 dx_db->flags |= DX_FLAG_REFERENCED;
175 * Find all of the first and last leaf blocks, and
176 * update their parent's min and max hash values
178 for (b=0, dx_db = dx_dir->dx_block;
179 b < dx_dir->numblocks;
181 if ((dx_db->type != DX_DIRBLOCK_LEAF) ||
182 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST)))
184 dx_parent = &dx_dir->dx_block[dx_db->parent];
186 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
188 if (dx_db->flags & DX_FLAG_FIRST)
189 dx_parent->min_hash = dx_db->min_hash;
191 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
193 if (dx_db->flags & DX_FLAG_LAST)
194 dx_parent->max_hash = dx_db->max_hash;
197 for (b=0, dx_db = dx_dir->dx_block;
198 b < dx_dir->numblocks;
201 pctx.group = dx_db->parent;
203 if (!(dx_db->flags & DX_FLAG_FIRST) &&
204 (dx_db->min_hash < dx_db->node_min_hash)) {
205 pctx.blk = dx_db->min_hash;
206 pctx.blk2 = dx_db->node_min_hash;
207 code = PR_2_HTREE_MIN_HASH;
208 fix_problem(ctx, code, &pctx);
211 if (dx_db->type == DX_DIRBLOCK_LEAF) {
212 depth = htree_depth(dx_dir, dx_db);
213 if (depth != dx_dir->depth) {
214 pctx.num = dx_dir->depth;
215 code = PR_2_HTREE_BAD_DEPTH;
216 fix_problem(ctx, code, &pctx);
221 * This test doesn't apply for the root block
225 (dx_db->max_hash > dx_db->node_max_hash)) {
226 pctx.blk = dx_db->max_hash;
227 pctx.blk2 = dx_db->node_max_hash;
228 code = PR_2_HTREE_MAX_HASH;
229 fix_problem(ctx, code, &pctx);
232 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
233 code = PR_2_HTREE_NOTREF;
234 fix_problem(ctx, code, &pctx);
236 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
237 code = PR_2_HTREE_DUPREF;
238 fix_problem(ctx, code, &pctx);
242 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
243 clear_htree(ctx, dx_dir->ino);
244 dx_dir->numblocks = 0;
247 e2fsck_free_dx_dir_info(ctx);
249 ext2fs_free_mem(&buf);
250 ext2fs_free_dblist(fs->dblist);
252 if (ctx->inode_bad_map) {
253 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
254 ctx->inode_bad_map = 0;
256 if (ctx->inode_reg_map) {
257 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
258 ctx->inode_reg_map = 0;
261 clear_problem_context(&pctx);
262 if (ctx->large_files) {
263 if (!(sb->s_feature_ro_compat &
264 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) &&
265 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
266 sb->s_feature_ro_compat |=
267 EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
268 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
269 ext2fs_mark_super_dirty(fs);
271 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
272 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
273 ext2fs_update_dynamic_rev(fs);
274 ext2fs_mark_super_dirty(fs);
278 print_resource_track(ctx, _("Pass 2"), &rtrack, fs->io);
281 #define MAX_DEPTH 32000
282 static int htree_depth(struct dx_dir_info *dx_dir,
283 struct dx_dirblock_info *dx_db)
287 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
288 dx_db = &dx_dir->dx_block[dx_db->parent];
294 static int dict_de_cmp(const void *a, const void *b)
296 const struct ext2_dir_entry *de_a, *de_b;
299 de_a = (const struct ext2_dir_entry *) a;
300 a_len = de_a->name_len & 0xFF;
301 de_b = (const struct ext2_dir_entry *) b;
302 b_len = de_b->name_len & 0xFF;
305 return (a_len - b_len);
307 return strncmp(de_a->name, de_b->name, a_len);
311 * This is special sort function that makes sure that directory blocks
312 * with a dirblock of zero are sorted to the beginning of the list.
313 * This guarantees that the root node of the htree directories are
314 * processed first, so we know what hash version to use.
316 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
318 const struct ext2_db_entry2 *db_a =
319 (const struct ext2_db_entry2 *) a;
320 const struct ext2_db_entry2 *db_b =
321 (const struct ext2_db_entry2 *) b;
323 if (db_a->blockcnt && !db_b->blockcnt)
326 if (!db_a->blockcnt && db_b->blockcnt)
329 if (db_a->blk != db_b->blk)
330 return (int) (db_a->blk - db_b->blk);
332 if (db_a->ino != db_b->ino)
333 return (int) (db_a->ino - db_b->ino);
335 return (int) (db_a->blockcnt - db_b->blockcnt);
340 * Make sure the first entry in the directory is '.', and that the
341 * directory entry is sane.
343 static int check_dot(e2fsck_t ctx,
344 struct ext2_dir_entry *dirent,
345 ext2_ino_t ino, struct problem_context *pctx)
347 struct ext2_dir_entry *nextdir;
348 unsigned int rec_len, new_len;
354 problem = PR_2_MISSING_DOT;
355 else if (((dirent->name_len & 0xFF) != 1) ||
356 (dirent->name[0] != '.'))
357 problem = PR_2_1ST_NOT_DOT;
358 else if (dirent->name[1] != '\0')
359 problem = PR_2_DOT_NULL_TERM;
361 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
363 if (fix_problem(ctx, problem, pctx)) {
365 rec_len = dirent->rec_len = 12;
367 dirent->name_len = 1;
368 dirent->name[0] = '.';
369 dirent->name[1] = '\0';
374 if (dirent->inode != ino) {
375 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
381 new_len = rec_len - 12;
384 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
385 nextdir = (struct ext2_dir_entry *)
386 ((char *) dirent + 12);
387 dirent->rec_len = 12;
388 (void) ext2fs_set_rec_len(ctx->fs, new_len,
391 nextdir->name_len = 0;
400 * Make sure the second entry in the directory is '..', and that the
401 * directory entry is sane. We do not check the inode number of '..'
402 * here; this gets done in pass 3.
404 static int check_dotdot(e2fsck_t ctx,
405 struct ext2_dir_entry *dirent,
406 ext2_ino_t ino, struct problem_context *pctx)
409 unsigned int rec_len;
412 problem = PR_2_MISSING_DOT_DOT;
413 else if (((dirent->name_len & 0xFF) != 2) ||
414 (dirent->name[0] != '.') ||
415 (dirent->name[1] != '.'))
416 problem = PR_2_2ND_NOT_DOT_DOT;
417 else if (dirent->name[2] != '\0')
418 problem = PR_2_DOT_DOT_NULL_TERM;
420 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
422 if (fix_problem(ctx, problem, pctx)) {
424 dirent->rec_len = 12;
426 * Note: we don't have the parent inode just
427 * yet, so we will fill it in with the root
428 * inode. This will get fixed in pass 3.
430 dirent->inode = EXT2_ROOT_INO;
431 dirent->name_len = 2;
432 dirent->name[0] = '.';
433 dirent->name[1] = '.';
434 dirent->name[2] = '\0';
439 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
440 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
447 * Check to make sure a directory entry doesn't contain any illegal
450 static int check_name(e2fsck_t ctx,
451 struct ext2_dir_entry *dirent,
452 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
453 struct problem_context *pctx)
459 for ( i = 0; i < (dirent->name_len & 0xFF); i++) {
460 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
462 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
465 dirent->name[i] = '.';
474 * Check the directory filetype (if present)
476 static _INLINE_ int check_filetype(e2fsck_t ctx,
477 struct ext2_dir_entry *dirent,
478 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
479 struct problem_context *pctx)
481 int filetype = dirent->name_len >> 8;
482 int should_be = EXT2_FT_UNKNOWN;
483 struct ext2_inode inode;
485 if (!(ctx->fs->super->s_feature_incompat &
486 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
488 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
490 dirent->name_len = dirent->name_len & 0xFF;
494 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dirent->inode)) {
495 should_be = EXT2_FT_DIR;
496 } else if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map,
498 should_be = EXT2_FT_REG_FILE;
499 } else if (ctx->inode_bad_map &&
500 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
504 e2fsck_read_inode(ctx, dirent->inode, &inode,
506 should_be = ext2_file_type(inode.i_mode);
508 if (filetype == should_be)
510 pctx->num = should_be;
512 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
516 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8;
521 static void parse_int_node(ext2_filsys fs,
522 struct ext2_db_entry2 *db,
523 struct check_dir_struct *cd,
524 struct dx_dir_info *dx_dir,
527 struct ext2_dx_root_info *root;
528 struct ext2_dx_entry *ent;
529 struct ext2_dx_countlimit *limit;
530 struct dx_dirblock_info *dx_db;
531 int i, expect_limit, count;
533 ext2_dirhash_t min_hash = 0xffffffff;
534 ext2_dirhash_t max_hash = 0;
535 ext2_dirhash_t hash = 0, prev_hash;
537 if (db->blockcnt == 0) {
538 root = (struct ext2_dx_root_info *) (block_buf + 24);
541 printf("Root node dump:\n");
542 printf("\t Reserved zero: %u\n", root->reserved_zero);
543 printf("\t Hash Version: %d\n", root->hash_version);
544 printf("\t Info length: %d\n", root->info_length);
545 printf("\t Indirect levels: %d\n", root->indirect_levels);
546 printf("\t Flags: %d\n", root->unused_flags);
549 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
551 ent = (struct ext2_dx_entry *) (block_buf+8);
553 limit = (struct ext2_dx_countlimit *) ent;
556 printf("Number of entries (count): %d\n",
557 ext2fs_le16_to_cpu(limit->count));
558 printf("Number of entries (limit): %d\n",
559 ext2fs_le16_to_cpu(limit->limit));
562 count = ext2fs_le16_to_cpu(limit->count);
563 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) /
564 sizeof(struct ext2_dx_entry);
565 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
566 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
567 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
570 if (count > expect_limit) {
571 cd->pctx.num = count;
572 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
574 count = expect_limit;
577 for (i=0; i < count; i++) {
579 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
581 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
582 hash, ext2fs_le32_to_cpu(ent[i].block));
584 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
585 /* Check to make sure the block is valid */
586 if (blk >= (blk_t) dx_dir->numblocks) {
588 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
593 if (hash < prev_hash &&
594 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
596 dx_db = &dx_dir->dx_block[blk];
597 if (dx_db->flags & DX_FLAG_REFERENCED) {
598 dx_db->flags |= DX_FLAG_DUP_REF;
600 dx_db->flags |= DX_FLAG_REFERENCED;
601 dx_db->parent = db->blockcnt;
607 dx_db->node_min_hash = hash;
609 dx_db->node_max_hash =
610 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
612 dx_db->node_max_hash = 0xfffffffe;
613 dx_db->flags |= DX_FLAG_LAST;
616 dx_db->flags |= DX_FLAG_FIRST;
619 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
620 db->blockcnt, min_hash, max_hash);
622 dx_db = &dx_dir->dx_block[db->blockcnt];
623 dx_db->min_hash = min_hash;
624 dx_db->max_hash = max_hash;
628 clear_htree(cd->ctx, cd->pctx.ino);
629 dx_dir->numblocks = 0;
631 #endif /* ENABLE_HTREE */
634 * Given a busted directory, try to salvage it somehow.
637 static void salvage_directory(ext2_filsys fs,
638 struct ext2_dir_entry *dirent,
639 struct ext2_dir_entry *prev,
640 unsigned int *offset)
642 char *cp = (char *) dirent;
644 unsigned int rec_len, prev_rec_len;
645 unsigned int name_len = dirent->name_len & 0xFF;
647 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
648 left = fs->blocksize - *offset - rec_len;
651 * Special case of directory entry of size 8: copy what's left
652 * of the directory block up to cover up the invalid hole.
654 if ((left >= 12) && (rec_len == 8)) {
655 memmove(cp, cp+8, left);
656 memset(cp + left, 0, 8);
660 * If the directory entry overruns the end of the directory
661 * block, and the name is small enough to fit, then adjust the
665 ((int) rec_len + left > 8) &&
666 (name_len + 8 <= (int) rec_len + left) &&
667 dirent->inode <= fs->super->s_inodes_count &&
668 strnlen(dirent->name, name_len) == name_len) {
669 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent);
673 * If the record length of the directory entry is a multiple
674 * of four, and not too big, such that it is valid, let the
675 * previous directory entry absorb the invalid one.
677 if (prev && rec_len && (rec_len % 4) == 0 &&
678 (*offset + rec_len <= fs->blocksize)) {
679 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
680 prev_rec_len += rec_len;
681 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
686 * Default salvage method --- kill all of the directory
687 * entries for the rest of the block. We will either try to
688 * absorb it into the previous directory entry, or create a
689 * new empty directory entry the rest of the directory block.
692 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
693 prev_rec_len += fs->blocksize - *offset;
694 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
695 *offset = fs->blocksize;
697 rec_len = fs->blocksize - *offset;
698 (void) ext2fs_set_rec_len(fs, rec_len, dirent);
699 dirent->name_len = 0;
704 static int check_dir_block(ext2_filsys fs,
705 struct ext2_db_entry2 *db,
708 struct dx_dir_info *dx_dir;
710 struct dx_dirblock_info *dx_db = 0;
711 #endif /* ENABLE_HTREE */
712 struct ext2_dir_entry *dirent, *prev;
714 unsigned int offset = 0;
715 int dir_modified = 0;
717 unsigned int rec_len;
718 blk64_t block_nr = db->blk;
719 ext2_ino_t ino = db->ino;
720 ext2_ino_t subdir_parent;
722 struct check_dir_struct *cd;
726 struct ext2_dx_root_info *root;
727 struct ext2_dx_countlimit *limit;
728 static dict_t de_dict;
729 struct problem_context pctx;
733 cd = (struct check_dir_struct *) priv_data;
737 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
740 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
744 * Make sure the inode is still in use (could have been
745 * deleted in the duplicate/bad blocks pass.
747 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino)))
751 cd->pctx.blk = block_nr;
752 cd->pctx.blkcount = db->blockcnt;
758 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
768 if (ctx->dirs_to_hash &&
769 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
773 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
777 ehandler_operation(_("reading directory block"));
778 cd->pctx.errcode = ext2fs_read_dir_block3(fs, block_nr, buf, 0);
779 ehandler_operation(0);
780 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
781 cd->pctx.errcode = 0; /* We'll handle this ourselves */
782 if (cd->pctx.errcode) {
783 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
784 ctx->flags |= E2F_FLAG_ABORT;
787 memset(buf, 0, fs->blocksize);
790 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
791 if (dx_dir && dx_dir->numblocks) {
792 if (db->blockcnt >= dx_dir->numblocks) {
793 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
795 clear_htree(ctx, ino);
796 dx_dir->numblocks = 0;
800 fatal_error(ctx, _("Can not continue."));
802 dx_db = &dx_dir->dx_block[db->blockcnt];
803 dx_db->type = DX_DIRBLOCK_LEAF;
804 dx_db->phys = block_nr;
805 dx_db->min_hash = ~0;
808 dirent = (struct ext2_dir_entry *) buf;
809 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
810 limit = (struct ext2_dx_countlimit *) (buf+8);
811 if (db->blockcnt == 0) {
812 root = (struct ext2_dx_root_info *) (buf + 24);
813 dx_db->type = DX_DIRBLOCK_ROOT;
814 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
815 if ((root->reserved_zero ||
816 root->info_length < 8 ||
817 root->indirect_levels > 1) &&
818 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
819 clear_htree(ctx, ino);
820 dx_dir->numblocks = 0;
823 dx_dir->hashversion = root->hash_version;
824 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
825 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
826 dx_dir->hashversion += 3;
827 dx_dir->depth = root->indirect_levels + 1;
828 } else if ((dirent->inode == 0) &&
829 (rec_len == fs->blocksize) &&
830 (dirent->name_len == 0) &&
831 (ext2fs_le16_to_cpu(limit->limit) ==
833 sizeof(struct ext2_dx_entry))))
834 dx_db->type = DX_DIRBLOCK_NODE;
837 #endif /* ENABLE_HTREE */
839 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
843 ext2_ino_t first_unused_inode;
846 dirent = (struct ext2_dir_entry *) (buf + offset);
847 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
848 cd->pctx.dirent = dirent;
849 cd->pctx.num = offset;
850 if (((offset + rec_len) > fs->blocksize) ||
852 ((rec_len % 4) != 0) ||
853 (((dirent->name_len & (unsigned) 0xFF)+8) > rec_len)) {
854 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) {
855 salvage_directory(fs, dirent, prev, &offset);
859 goto abort_free_dict;
862 if (dot_state == 0) {
863 if (check_dot(ctx, dirent, ino, &cd->pctx))
865 } else if (dot_state == 1) {
866 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
868 goto abort_free_dict;
871 } else if (dirent->inode == ino) {
872 problem = PR_2_LINK_DOT;
873 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
883 * Make sure the inode listed is a legal one.
885 if (((dirent->inode != EXT2_ROOT_INO) &&
886 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
887 (dirent->inode > fs->super->s_inodes_count)) {
888 problem = PR_2_BAD_INO;
889 } else if (ctx->inode_bb_map &&
890 (ext2fs_test_inode_bitmap2(ctx->inode_bb_map,
893 * If the inode is in a bad block, offer to
896 problem = PR_2_BB_INODE;
897 } else if ((dot_state > 1) &&
898 ((dirent->name_len & 0xFF) == 1) &&
899 (dirent->name[0] == '.')) {
901 * If there's a '.' entry in anything other
902 * than the first directory entry, it's a
903 * duplicate entry that should be removed.
905 problem = PR_2_DUP_DOT;
906 } else if ((dot_state > 1) &&
907 ((dirent->name_len & 0xFF) == 2) &&
908 (dirent->name[0] == '.') &&
909 (dirent->name[1] == '.')) {
911 * If there's a '..' entry in anything other
912 * than the second directory entry, it's a
913 * duplicate entry that should be removed.
915 problem = PR_2_DUP_DOT_DOT;
916 } else if ((dot_state > 1) &&
917 (dirent->inode == EXT2_ROOT_INO)) {
919 * Don't allow links to the root directory.
920 * We check this specially to make sure we
921 * catch this error case even if the root
922 * directory hasn't been created yet.
924 problem = PR_2_LINK_ROOT;
925 } else if ((dot_state > 1) &&
926 (dirent->name_len & 0xFF) == 0) {
928 * Don't allow zero-length directory names.
930 problem = PR_2_NULL_NAME;
934 if (fix_problem(ctx, problem, &cd->pctx)) {
939 ext2fs_unmark_valid(fs);
940 if (problem == PR_2_BAD_INO)
946 * If the inode was marked as having bad fields in
947 * pass1, process it and offer to fix/clear it.
948 * (We wait until now so that we can display the
949 * pathname to the user.)
951 if (ctx->inode_bad_map &&
952 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
954 if (e2fsck_process_bad_inode(ctx, ino,
956 buf + fs->blocksize)) {
961 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
965 group = ext2fs_group_of_ino(fs, dirent->inode);
966 first_unused_inode = group * fs->super->s_inodes_per_group +
967 1 + fs->super->s_inodes_per_group -
968 ext2fs_bg_itable_unused(fs, group);
969 cd->pctx.group = group;
972 * Check if the inode was missed out because
973 * _INODE_UNINIT flag was set or bg_itable_unused was
974 * incorrect. If so, clear the _INODE_UNINIT flag and
975 * restart e2fsck. In the future it would be nice if
976 * we could call a function in pass1.c that checks the
977 * newly visible inodes.
979 if (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)) {
980 pctx.num = dirent->inode;
981 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
983 ext2fs_bg_flags_clear(fs, group,
984 EXT2_BG_INODE_UNINIT);
985 ext2fs_mark_super_dirty(fs);
986 ctx->flags |= E2F_FLAG_RESTART_LATER;
988 ext2fs_unmark_valid(fs);
989 if (problem == PR_2_BAD_INO)
992 } else if (dirent->inode >= first_unused_inode) {
993 pctx.num = dirent->inode;
994 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
995 ext2fs_bg_itable_unused_set(fs, group, 0);
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)
1006 * Offer to clear unused inodes; if we are going to be
1007 * restarting the scan due to bg_itable_unused being
1008 * wrong, then don't clear any inodes to avoid zapping
1009 * inodes that were skipped during pass1 due to an
1010 * incorrect bg_itable_unused; we'll get any real
1011 * problems after we restart.
1013 if (!(ctx->flags & E2F_FLAG_RESTART_LATER) &&
1014 !(ext2fs_test_inode_bitmap2(ctx->inode_used_map,
1016 problem = PR_2_UNUSED_INODE;
1019 if (fix_problem(ctx, problem, &cd->pctx)) {
1024 ext2fs_unmark_valid(fs);
1025 if (problem == PR_2_BAD_INO)
1030 if (check_name(ctx, dirent, ino, &cd->pctx))
1033 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1038 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
1039 (dirent->name_len & 0xFF),
1040 fs->super->s_hash_seed, &hash, 0);
1041 if (hash < dx_db->min_hash)
1042 dx_db->min_hash = hash;
1043 if (hash > dx_db->max_hash)
1044 dx_db->max_hash = hash;
1049 * If this is a directory, then mark its parent in its
1050 * dir_info structure. If the parent field is already
1051 * filled in, then this directory has more than one
1052 * hard link. We assume the first link is correct,
1053 * and ask the user if he/she wants to clear this one.
1055 if ((dot_state > 1) &&
1056 (ext2fs_test_inode_bitmap2(ctx->inode_dir_map,
1058 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1060 cd->pctx.ino = dirent->inode;
1061 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1062 goto abort_free_dict;
1064 if (subdir_parent) {
1065 cd->pctx.ino2 = subdir_parent;
1066 if (fix_problem(ctx, PR_2_LINK_DIR,
1074 (void) e2fsck_dir_info_set_parent(ctx,
1075 dirent->inode, ino);
1081 } else if (dict_lookup(&de_dict, dirent)) {
1082 clear_problem_context(&pctx);
1084 pctx.dirent = dirent;
1085 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1086 if (!ctx->dirs_to_hash)
1087 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
1088 if (ctx->dirs_to_hash)
1089 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1092 dict_alloc_insert(&de_dict, dirent, dirent);
1094 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1097 ctx->fs_links_count++;
1098 ctx->fs_total_count++;
1102 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1105 } while (offset < fs->blocksize);
1112 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1113 db->blockcnt, dx_db->type,
1114 dx_db->min_hash, dx_db->max_hash);
1116 cd->pctx.dir = cd->pctx.ino;
1117 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1118 (dx_db->type == DX_DIRBLOCK_NODE))
1119 parse_int_node(fs, db, cd, dx_dir, buf);
1121 #endif /* ENABLE_HTREE */
1122 if (offset != fs->blocksize) {
1123 cd->pctx.num = rec_len - fs->blocksize + offset;
1124 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1125 dirent->rec_len = cd->pctx.num;
1130 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf);
1131 if (cd->pctx.errcode) {
1132 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1134 goto abort_free_dict;
1136 ext2fs_mark_changed(fs);
1138 dict_free_nodes(&de_dict);
1141 ctx->flags |= E2F_FLAG_ABORT;
1142 dict_free_nodes(&de_dict);
1143 return DIRENT_ABORT;
1152 * This function is called to deallocate a block, and is an interator
1153 * functioned called by deallocate inode via ext2fs_iterate_block().
1155 static int deallocate_inode_block(ext2_filsys fs,
1157 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1158 blk64_t ref_block EXT2FS_ATTR((unused)),
1159 int ref_offset EXT2FS_ATTR((unused)),
1162 struct del_block *p = priv_data;
1164 if (HOLE_BLKADDR(*block_nr))
1166 if ((*block_nr < fs->super->s_first_data_block) ||
1167 (*block_nr >= ext2fs_blocks_count(fs->super)))
1169 ext2fs_unmark_block_bitmap2(p->ctx->block_found_map, *block_nr);
1170 ext2fs_block_alloc_stats2(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;
1184 struct del_block del_block;
1186 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1187 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1188 clear_problem_context(&pctx);
1192 * Fix up the bitmaps...
1194 e2fsck_read_bitmaps(ctx);
1195 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1197 if (ext2fs_file_acl_block(fs, &inode) &&
1198 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1199 pctx.errcode = ext2fs_adjust_ea_refcount2(fs,
1200 ext2fs_file_acl_block(fs, &inode),
1201 block_buf, -1, &count);
1202 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1207 pctx.blk = ext2fs_file_acl_block(fs, &inode);
1208 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1209 ctx->flags |= E2F_FLAG_ABORT;
1213 ext2fs_unmark_block_bitmap2(ctx->block_found_map,
1214 ext2fs_file_acl_block(fs, &inode));
1215 ext2fs_block_alloc_stats2(fs,
1216 ext2fs_file_acl_block(fs, &inode), -1);
1218 ext2fs_file_acl_block_set(fs, &inode, 0);
1221 if (!ext2fs_inode_has_valid_blocks2(fs, &inode))
1224 if (LINUX_S_ISREG(inode.i_mode) && EXT2_I_SIZE(&inode) >= 0x80000000UL)
1227 del_block.ctx = ctx;
1229 pctx.errcode = ext2fs_block_iterate3(fs, ino, 0, block_buf,
1230 deallocate_inode_block,
1233 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1234 ctx->flags |= E2F_FLAG_ABORT;
1240 * This fuction clears the htree flag on an inode
1242 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1244 struct ext2_inode inode;
1246 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1247 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1248 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1249 if (ctx->dirs_to_hash)
1250 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1254 extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1255 ext2_ino_t ino, char *buf)
1257 ext2_filsys fs = ctx->fs;
1258 struct ext2_inode inode;
1259 int inode_modified = 0;
1261 unsigned char *frag, *fsize;
1262 struct problem_context pctx;
1265 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1267 clear_problem_context(&pctx);
1270 pctx.inode = &inode;
1272 if (ext2fs_file_acl_block(fs, &inode) &&
1273 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1274 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1275 ext2fs_file_acl_block_set(fs, &inode, 0);
1281 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1282 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1283 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1284 !(LINUX_S_ISSOCK(inode.i_mode)))
1285 problem = PR_2_BAD_MODE;
1286 else if (LINUX_S_ISCHR(inode.i_mode)
1287 && !e2fsck_pass1_check_device_inode(fs, &inode))
1288 problem = PR_2_BAD_CHAR_DEV;
1289 else if (LINUX_S_ISBLK(inode.i_mode)
1290 && !e2fsck_pass1_check_device_inode(fs, &inode))
1291 problem = PR_2_BAD_BLOCK_DEV;
1292 else if (LINUX_S_ISFIFO(inode.i_mode)
1293 && !e2fsck_pass1_check_device_inode(fs, &inode))
1294 problem = PR_2_BAD_FIFO;
1295 else if (LINUX_S_ISSOCK(inode.i_mode)
1296 && !e2fsck_pass1_check_device_inode(fs, &inode))
1297 problem = PR_2_BAD_SOCKET;
1298 else if (LINUX_S_ISLNK(inode.i_mode)
1299 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1300 problem = PR_2_INVALID_SYMLINK;
1304 if (fix_problem(ctx, problem, &pctx)) {
1305 deallocate_inode(ctx, ino, 0);
1306 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1314 if (inode.i_faddr) {
1315 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1322 switch (fs->super->s_creator_os) {
1324 frag = &inode.osd2.hurd2.h_i_frag;
1325 fsize = &inode.osd2.hurd2.h_i_fsize;
1330 if (frag && *frag) {
1332 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1339 if (fsize && *fsize) {
1341 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1349 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1350 !(fs->super->s_feature_ro_compat &
1351 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1352 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1353 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1354 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1355 inode.osd2.linux2.l_i_blocks_hi = 0;
1360 if (!(fs->super->s_feature_incompat &
1361 EXT4_FEATURE_INCOMPAT_64BIT) &&
1362 inode.osd2.linux2.l_i_file_acl_high != 0) {
1363 pctx.num = inode.osd2.linux2.l_i_file_acl_high;
1364 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) {
1365 inode.osd2.linux2.l_i_file_acl_high = 0;
1371 if (ext2fs_file_acl_block(fs, &inode) &&
1372 ((ext2fs_file_acl_block(fs, &inode) < fs->super->s_first_data_block) ||
1373 (ext2fs_file_acl_block(fs, &inode) >= ext2fs_blocks_count(fs->super)))) {
1374 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1375 ext2fs_file_acl_block_set(fs, &inode, 0);
1380 if (inode.i_dir_acl &&
1381 LINUX_S_ISDIR(inode.i_mode)) {
1382 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1383 inode.i_dir_acl = 0;
1390 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1391 if (!not_fixed && ctx->inode_bad_map)
1392 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino);
1398 * allocate_dir_block --- this function allocates a new directory
1399 * block for a particular inode; this is done if a directory has
1400 * a "hole" in it, or if a directory has a illegal block number
1401 * that was zeroed out and now needs to be replaced.
1403 static int allocate_dir_block(e2fsck_t ctx,
1404 struct ext2_db_entry2 *db,
1405 char *buf EXT2FS_ATTR((unused)),
1406 struct problem_context *pctx)
1408 ext2_filsys fs = ctx->fs;
1411 struct ext2_inode inode;
1413 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1417 * Read the inode and block bitmaps in; we'll be messing with
1420 e2fsck_read_bitmaps(ctx);
1423 * First, find a free block
1425 pctx->errcode = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
1426 if (pctx->errcode) {
1427 pctx->str = "ext2fs_new_block";
1428 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1431 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
1432 ext2fs_mark_block_bitmap2(fs->block_map, blk);
1433 ext2fs_mark_bb_dirty(fs);
1436 * Now let's create the actual data block for the inode
1439 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1441 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1442 EXT2_ROOT_INO, &block);
1444 if (pctx->errcode) {
1445 pctx->str = "ext2fs_new_dir_block";
1446 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1450 pctx->errcode = ext2fs_write_dir_block(fs, blk, block);
1451 ext2fs_free_mem(&block);
1452 if (pctx->errcode) {
1453 pctx->str = "ext2fs_write_dir_block";
1454 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1459 * Update the inode block count
1461 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1462 ext2fs_iblk_add_blocks(fs, &inode, 1);
1463 if (inode.i_size < (db->blockcnt+1) * fs->blocksize)
1464 inode.i_size = (db->blockcnt+1) * fs->blocksize;
1465 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1468 * Finally, update the block pointers for the inode
1471 pctx->errcode = ext2fs_bmap2(fs, db->ino, &inode, 0, BMAP_SET,
1472 db->blockcnt, 0, &blk);
1473 if (pctx->errcode) {
1474 pctx->str = "ext2fs_block_iterate";
1475 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);