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 void clear_htree(e2fsck_t ctx, ext2_ino_t ino);
70 static int htree_depth(struct dx_dir_info *dx_dir,
71 struct dx_dirblock_info *dx_db);
72 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b);
74 struct check_dir_struct {
76 struct problem_context pctx;
81 void e2fsck_pass2(e2fsck_t ctx)
83 struct ext2_super_block *sb = ctx->fs->super;
84 struct problem_context pctx;
85 ext2_filsys fs = ctx->fs;
88 struct resource_track rtrack;
90 struct check_dir_struct cd;
91 struct dx_dir_info *dx_dir;
92 struct dx_dirblock_info *dx_db, *dx_parent;
98 init_resource_track(&rtrack, ctx->fs->io);
99 clear_problem_context(&cd.pctx);
102 mtrace_print("Pass 2");
105 if (!(ctx->options & E2F_OPT_PREEN))
106 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
108 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
110 if (ctx->inode_count)
113 cd.pctx.errcode = ext2fs_create_icount2(fs,
114 EXT2_ICOUNT_OPT_INCREMENT,
115 0, ctx->inode_link_info,
117 if (cd.pctx.errcode) {
118 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
119 ctx->flags |= E2F_FLAG_ABORT;
122 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
123 "directory scan buffer");
126 * Set up the parent pointer for the root directory, if
127 * present. (If the root directory is not present, we will
128 * create it in pass 3.)
130 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
135 cd.max = ext2fs_dblist_count(fs->dblist);
138 (void) (ctx->progress)(ctx, 2, 0, cd.max);
140 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX)
141 ext2fs_dblist_sort(fs->dblist, special_dir_block_cmp);
143 cd.pctx.errcode = ext2fs_dblist_iterate(fs->dblist, check_dir_block,
145 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
148 if (ctx->flags & E2F_FLAG_RESTART_LATER) {
149 ctx->flags |= E2F_FLAG_RESTART;
153 if (cd.pctx.errcode) {
154 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
155 ctx->flags |= E2F_FLAG_ABORT;
160 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
161 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
163 if (dx_dir->numblocks == 0)
165 clear_problem_context(&pctx);
167 pctx.dir = dx_dir->ino;
168 dx_db = dx_dir->dx_block;
169 if (dx_db->flags & DX_FLAG_REFERENCED)
170 dx_db->flags |= DX_FLAG_DUP_REF;
172 dx_db->flags |= DX_FLAG_REFERENCED;
174 * Find all of the first and last leaf blocks, and
175 * update their parent's min and max hash values
177 for (b=0, dx_db = dx_dir->dx_block;
178 b < dx_dir->numblocks;
180 if ((dx_db->type != DX_DIRBLOCK_LEAF) ||
181 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST)))
183 dx_parent = &dx_dir->dx_block[dx_db->parent];
185 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
187 if (dx_db->flags & DX_FLAG_FIRST)
188 dx_parent->min_hash = dx_db->min_hash;
190 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
192 if (dx_db->flags & DX_FLAG_LAST)
193 dx_parent->max_hash = dx_db->max_hash;
196 for (b=0, dx_db = dx_dir->dx_block;
197 b < dx_dir->numblocks;
200 pctx.group = dx_db->parent;
202 if (!(dx_db->flags & DX_FLAG_FIRST) &&
203 (dx_db->min_hash < dx_db->node_min_hash)) {
204 pctx.blk = dx_db->min_hash;
205 pctx.blk2 = dx_db->node_min_hash;
206 code = PR_2_HTREE_MIN_HASH;
207 fix_problem(ctx, code, &pctx);
210 if (dx_db->type == DX_DIRBLOCK_LEAF) {
211 depth = htree_depth(dx_dir, dx_db);
212 if (depth != dx_dir->depth) {
213 pctx.num = dx_dir->depth;
214 code = PR_2_HTREE_BAD_DEPTH;
215 fix_problem(ctx, code, &pctx);
220 * This test doesn't apply for the root block
224 (dx_db->max_hash > dx_db->node_max_hash)) {
225 pctx.blk = dx_db->max_hash;
226 pctx.blk2 = dx_db->node_max_hash;
227 code = PR_2_HTREE_MAX_HASH;
228 fix_problem(ctx, code, &pctx);
231 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
232 code = PR_2_HTREE_NOTREF;
233 fix_problem(ctx, code, &pctx);
235 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
236 code = PR_2_HTREE_DUPREF;
237 fix_problem(ctx, code, &pctx);
241 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
242 clear_htree(ctx, dx_dir->ino);
243 dx_dir->numblocks = 0;
246 e2fsck_free_dx_dir_info(ctx);
248 ext2fs_free_mem(&buf);
249 ext2fs_free_dblist(fs->dblist);
251 if (ctx->inode_bad_map) {
252 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
253 ctx->inode_bad_map = 0;
255 if (ctx->inode_reg_map) {
256 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
257 ctx->inode_reg_map = 0;
260 clear_problem_context(&pctx);
261 if (ctx->large_files) {
262 if (!(sb->s_feature_ro_compat &
263 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) &&
264 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
265 sb->s_feature_ro_compat |=
266 EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
267 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
268 ext2fs_mark_super_dirty(fs);
270 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
271 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
272 ext2fs_update_dynamic_rev(fs);
273 ext2fs_mark_super_dirty(fs);
277 print_resource_track(ctx, _("Pass 2"), &rtrack, fs->io);
280 #define MAX_DEPTH 32000
281 static int htree_depth(struct dx_dir_info *dx_dir,
282 struct dx_dirblock_info *dx_db)
286 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
287 dx_db = &dx_dir->dx_block[dx_db->parent];
293 static int dict_de_cmp(const void *a, const void *b)
295 const struct ext2_dir_entry *de_a, *de_b;
298 de_a = (const struct ext2_dir_entry *) a;
299 a_len = de_a->name_len & 0xFF;
300 de_b = (const struct ext2_dir_entry *) b;
301 b_len = de_b->name_len & 0xFF;
304 return (a_len - b_len);
306 return strncmp(de_a->name, de_b->name, a_len);
310 * This is special sort function that makes sure that directory blocks
311 * with a dirblock of zero are sorted to the beginning of the list.
312 * This guarantees that the root node of the htree directories are
313 * processed first, so we know what hash version to use.
315 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
317 const struct ext2_db_entry *db_a =
318 (const struct ext2_db_entry *) a;
319 const struct ext2_db_entry *db_b =
320 (const struct ext2_db_entry *) b;
322 if (db_a->blockcnt && !db_b->blockcnt)
325 if (!db_a->blockcnt && db_b->blockcnt)
328 if (db_a->blk != db_b->blk)
329 return (int) (db_a->blk - db_b->blk);
331 if (db_a->ino != db_b->ino)
332 return (int) (db_a->ino - db_b->ino);
334 return (int) (db_a->blockcnt - db_b->blockcnt);
339 * Make sure the first entry in the directory is '.', and that the
340 * directory entry is sane.
342 static int check_dot(e2fsck_t ctx,
343 struct ext2_dir_entry *dirent,
344 ext2_ino_t ino, struct problem_context *pctx)
346 struct ext2_dir_entry *nextdir;
347 unsigned int rec_len, new_len;
353 problem = PR_2_MISSING_DOT;
354 else if (((dirent->name_len & 0xFF) != 1) ||
355 (dirent->name[0] != '.'))
356 problem = PR_2_1ST_NOT_DOT;
357 else if (dirent->name[1] != '\0')
358 problem = PR_2_DOT_NULL_TERM;
360 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
362 if (fix_problem(ctx, problem, pctx)) {
364 rec_len = dirent->rec_len = 12;
366 dirent->name_len = 1;
367 dirent->name[0] = '.';
368 dirent->name[1] = '\0';
373 if (dirent->inode != ino) {
374 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
380 new_len = rec_len - 12;
383 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
384 nextdir = (struct ext2_dir_entry *)
385 ((char *) dirent + 12);
386 dirent->rec_len = 12;
387 (void) ext2fs_set_rec_len(ctx->fs, new_len,
390 nextdir->name_len = 0;
399 * Make sure the second entry in the directory is '..', and that the
400 * directory entry is sane. We do not check the inode number of '..'
401 * here; this gets done in pass 3.
403 static int check_dotdot(e2fsck_t ctx,
404 struct ext2_dir_entry *dirent,
405 ext2_ino_t ino, struct problem_context *pctx)
407 int rec_len, problem = 0;
410 problem = PR_2_MISSING_DOT_DOT;
411 else if (((dirent->name_len & 0xFF) != 2) ||
412 (dirent->name[0] != '.') ||
413 (dirent->name[1] != '.'))
414 problem = PR_2_2ND_NOT_DOT_DOT;
415 else if (dirent->name[2] != '\0')
416 problem = PR_2_DOT_DOT_NULL_TERM;
418 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
420 if (fix_problem(ctx, problem, pctx)) {
422 dirent->rec_len = 12;
424 * Note: we don't have the parent inode just
425 * yet, so we will fill it in with the root
426 * inode. This will get fixed in pass 3.
428 dirent->inode = EXT2_ROOT_INO;
429 dirent->name_len = 2;
430 dirent->name[0] = '.';
431 dirent->name[1] = '.';
432 dirent->name[2] = '\0';
437 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
438 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
445 * Check to make sure a directory entry doesn't contain any illegal
448 static int check_name(e2fsck_t ctx,
449 struct ext2_dir_entry *dirent,
450 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
451 struct problem_context *pctx)
457 for ( i = 0; i < (dirent->name_len & 0xFF); i++) {
458 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
460 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
463 dirent->name[i] = '.';
472 * Check the directory filetype (if present)
474 static _INLINE_ int check_filetype(e2fsck_t ctx,
475 struct ext2_dir_entry *dirent,
476 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
477 struct problem_context *pctx)
479 int filetype = dirent->name_len >> 8;
480 int should_be = EXT2_FT_UNKNOWN;
481 struct ext2_inode inode;
483 if (!(ctx->fs->super->s_feature_incompat &
484 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
486 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
488 dirent->name_len = dirent->name_len & 0xFF;
492 if (ext2fs_test_inode_bitmap(ctx->inode_dir_map, dirent->inode)) {
493 should_be = EXT2_FT_DIR;
494 } else if (ext2fs_test_inode_bitmap(ctx->inode_reg_map,
496 should_be = EXT2_FT_REG_FILE;
497 } else if (ctx->inode_bad_map &&
498 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
502 e2fsck_read_inode(ctx, dirent->inode, &inode,
504 should_be = ext2_file_type(inode.i_mode);
506 if (filetype == should_be)
508 pctx->num = should_be;
510 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
514 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8;
519 static void parse_int_node(ext2_filsys fs,
520 struct ext2_db_entry *db,
521 struct check_dir_struct *cd,
522 struct dx_dir_info *dx_dir,
525 struct ext2_dx_root_info *root;
526 struct ext2_dx_entry *ent;
527 struct ext2_dx_countlimit *limit;
528 struct dx_dirblock_info *dx_db;
529 int i, expect_limit, count;
531 ext2_dirhash_t min_hash = 0xffffffff;
532 ext2_dirhash_t max_hash = 0;
533 ext2_dirhash_t hash = 0, prev_hash;
535 if (db->blockcnt == 0) {
536 root = (struct ext2_dx_root_info *) (block_buf + 24);
539 printf("Root node dump:\n");
540 printf("\t Reserved zero: %u\n", root->reserved_zero);
541 printf("\t Hash Version: %d\n", root->hash_version);
542 printf("\t Info length: %d\n", root->info_length);
543 printf("\t Indirect levels: %d\n", root->indirect_levels);
544 printf("\t Flags: %d\n", root->unused_flags);
547 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
549 ent = (struct ext2_dx_entry *) (block_buf+8);
551 limit = (struct ext2_dx_countlimit *) ent;
554 printf("Number of entries (count): %d\n",
555 ext2fs_le16_to_cpu(limit->count));
556 printf("Number of entries (limit): %d\n",
557 ext2fs_le16_to_cpu(limit->limit));
560 count = ext2fs_le16_to_cpu(limit->count);
561 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) /
562 sizeof(struct ext2_dx_entry);
563 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
564 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
565 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
568 if (count > expect_limit) {
569 cd->pctx.num = count;
570 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
572 count = expect_limit;
575 for (i=0; i < count; i++) {
577 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
579 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
580 hash, ext2fs_le32_to_cpu(ent[i].block));
582 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
583 /* Check to make sure the block is valid */
584 if (blk >= (blk_t) dx_dir->numblocks) {
586 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
591 if (hash < prev_hash &&
592 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
594 dx_db = &dx_dir->dx_block[blk];
595 if (dx_db->flags & DX_FLAG_REFERENCED) {
596 dx_db->flags |= DX_FLAG_DUP_REF;
598 dx_db->flags |= DX_FLAG_REFERENCED;
599 dx_db->parent = db->blockcnt;
605 dx_db->node_min_hash = hash;
607 dx_db->node_max_hash =
608 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
610 dx_db->node_max_hash = 0xfffffffe;
611 dx_db->flags |= DX_FLAG_LAST;
614 dx_db->flags |= DX_FLAG_FIRST;
617 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
618 db->blockcnt, min_hash, max_hash);
620 dx_db = &dx_dir->dx_block[db->blockcnt];
621 dx_db->min_hash = min_hash;
622 dx_db->max_hash = max_hash;
626 clear_htree(cd->ctx, cd->pctx.ino);
627 dx_dir->numblocks = 0;
629 #endif /* ENABLE_HTREE */
632 * Given a busted directory, try to salvage it somehow.
635 static void salvage_directory(ext2_filsys fs,
636 struct ext2_dir_entry *dirent,
637 struct ext2_dir_entry *prev,
638 unsigned int *offset)
640 char *cp = (char *) dirent;
642 unsigned int rec_len, prev_rec_len;
643 unsigned int name_len = dirent->name_len & 0xFF;
645 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
646 left = fs->blocksize - *offset - rec_len;
649 * Special case of directory entry of size 8: copy what's left
650 * of the directory block up to cover up the invalid hole.
652 if ((left >= 12) && (rec_len == 8)) {
653 memmove(cp, cp+8, left);
654 memset(cp + left, 0, 8);
658 * If the directory entry overruns the end of the directory
659 * block, and the name is small enough to fit, then adjust the
663 ((int) rec_len + left > 8) &&
664 (name_len + 8 <= (int) rec_len + left) &&
665 dirent->inode <= fs->super->s_inodes_count &&
666 strnlen(dirent->name, name_len) == name_len) {
667 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent);
671 * If the record length of the directory entry is a multiple
672 * of four, and not too big, such that it is valid, let the
673 * previous directory entry absorb the invalid one.
675 if (prev && rec_len && (rec_len % 4) == 0 &&
676 (*offset + rec_len <= fs->blocksize)) {
677 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
678 prev_rec_len += rec_len;
679 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
684 * Default salvage method --- kill all of the directory
685 * entries for the rest of the block. We will either try to
686 * absorb it into the previous directory entry, or create a
687 * new empty directory entry the rest of the directory block.
690 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
691 prev_rec_len += fs->blocksize - *offset;
692 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
693 *offset = fs->blocksize;
695 rec_len = fs->blocksize - *offset;
696 (void) ext2fs_set_rec_len(fs, rec_len, dirent);
697 dirent->name_len = 0;
702 static int check_dir_block(ext2_filsys fs,
703 struct ext2_db_entry *db,
706 struct dx_dir_info *dx_dir;
708 struct dx_dirblock_info *dx_db = 0;
709 #endif /* ENABLE_HTREE */
710 struct ext2_dir_entry *dirent, *prev;
712 unsigned int offset = 0;
714 int dir_modified = 0;
716 unsigned int rec_len;
717 blk_t block_nr = db->blk;
718 ext2_ino_t ino = db->ino;
719 ext2_ino_t subdir_parent;
721 struct check_dir_struct *cd;
725 struct ext2_dx_root_info *root;
726 struct ext2_dx_countlimit *limit;
727 static dict_t de_dict;
728 struct problem_context pctx;
732 cd = (struct check_dir_struct *) priv_data;
736 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
739 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
743 * Make sure the inode is still in use (could have been
744 * deleted in the duplicate/bad blocks pass.
746 if (!(ext2fs_test_inode_bitmap(ctx->inode_used_map, ino)))
750 cd->pctx.blk = block_nr;
751 cd->pctx.blkcount = db->blockcnt;
757 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
767 if (ctx->dirs_to_hash &&
768 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
772 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
776 old_op = ehandler_operation(_("reading directory block"));
777 cd->pctx.errcode = ext2fs_read_dir_block(fs, block_nr, buf);
778 ehandler_operation(0);
779 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
780 cd->pctx.errcode = 0; /* We'll handle this ourselves */
781 if (cd->pctx.errcode) {
782 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
783 ctx->flags |= E2F_FLAG_ABORT;
786 memset(buf, 0, fs->blocksize);
789 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
790 if (dx_dir && dx_dir->numblocks) {
791 if (db->blockcnt >= dx_dir->numblocks) {
792 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
794 clear_htree(ctx, ino);
795 dx_dir->numblocks = 0;
799 fatal_error(ctx, _("Can not continue."));
801 dx_db = &dx_dir->dx_block[db->blockcnt];
802 dx_db->type = DX_DIRBLOCK_LEAF;
803 dx_db->phys = block_nr;
804 dx_db->min_hash = ~0;
807 dirent = (struct ext2_dir_entry *) buf;
808 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
809 limit = (struct ext2_dx_countlimit *) (buf+8);
810 if (db->blockcnt == 0) {
811 root = (struct ext2_dx_root_info *) (buf + 24);
812 dx_db->type = DX_DIRBLOCK_ROOT;
813 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
814 if ((root->reserved_zero ||
815 root->info_length < 8 ||
816 root->indirect_levels > 1) &&
817 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
818 clear_htree(ctx, ino);
819 dx_dir->numblocks = 0;
822 dx_dir->hashversion = root->hash_version;
823 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
824 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
825 dx_dir->hashversion += 3;
826 dx_dir->depth = root->indirect_levels + 1;
827 } else if ((dirent->inode == 0) &&
828 (rec_len == fs->blocksize) &&
829 (dirent->name_len == 0) &&
830 (ext2fs_le16_to_cpu(limit->limit) ==
832 sizeof(struct ext2_dx_entry))))
833 dx_db->type = DX_DIRBLOCK_NODE;
836 #endif /* ENABLE_HTREE */
838 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
842 ext2_ino_t first_unused_inode;
845 dirent = (struct ext2_dir_entry *) (buf + offset);
846 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
847 cd->pctx.dirent = dirent;
848 cd->pctx.num = offset;
849 if (((offset + rec_len) > fs->blocksize) ||
851 ((rec_len % 4) != 0) ||
852 (((dirent->name_len & (unsigned) 0xFF)+8) > rec_len)) {
853 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) {
854 salvage_directory(fs, dirent, prev, &offset);
858 goto abort_free_dict;
860 if ((dirent->name_len & 0xFF) > EXT2_NAME_LEN) {
861 if (fix_problem(ctx, PR_2_FILENAME_LONG, &cd->pctx)) {
862 dirent->name_len = EXT2_NAME_LEN;
867 if (dot_state == 0) {
868 if (check_dot(ctx, dirent, ino, &cd->pctx))
870 } else if (dot_state == 1) {
871 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
873 goto abort_free_dict;
876 } else if (dirent->inode == ino) {
877 problem = PR_2_LINK_DOT;
878 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
888 * Make sure the inode listed is a legal one.
890 if (((dirent->inode != EXT2_ROOT_INO) &&
891 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
892 (dirent->inode > fs->super->s_inodes_count)) {
893 problem = PR_2_BAD_INO;
894 } else if (ctx->inode_bb_map &&
895 (ext2fs_test_inode_bitmap(ctx->inode_bb_map,
898 * If the inode is in a bad block, offer to
901 problem = PR_2_BB_INODE;
902 } else if ((dot_state > 1) &&
903 ((dirent->name_len & 0xFF) == 1) &&
904 (dirent->name[0] == '.')) {
906 * If there's a '.' entry in anything other
907 * than the first directory entry, it's a
908 * duplicate entry that should be removed.
910 problem = PR_2_DUP_DOT;
911 } else if ((dot_state > 1) &&
912 ((dirent->name_len & 0xFF) == 2) &&
913 (dirent->name[0] == '.') &&
914 (dirent->name[1] == '.')) {
916 * If there's a '..' entry in anything other
917 * than the second directory entry, it's a
918 * duplicate entry that should be removed.
920 problem = PR_2_DUP_DOT_DOT;
921 } else if ((dot_state > 1) &&
922 (dirent->inode == EXT2_ROOT_INO)) {
924 * Don't allow links to the root directory.
925 * We check this specially to make sure we
926 * catch this error case even if the root
927 * directory hasn't been created yet.
929 problem = PR_2_LINK_ROOT;
930 } else if ((dot_state > 1) &&
931 (dirent->name_len & 0xFF) == 0) {
933 * Don't allow zero-length directory names.
935 problem = PR_2_NULL_NAME;
939 if (fix_problem(ctx, problem, &cd->pctx)) {
944 ext2fs_unmark_valid(fs);
945 if (problem == PR_2_BAD_INO)
951 * If the inode was marked as having bad fields in
952 * pass1, process it and offer to fix/clear it.
953 * (We wait until now so that we can display the
954 * pathname to the user.)
956 if (ctx->inode_bad_map &&
957 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
959 if (e2fsck_process_bad_inode(ctx, ino,
961 buf + fs->blocksize)) {
966 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
970 group = ext2fs_group_of_ino(fs, dirent->inode);
971 first_unused_inode = group * fs->super->s_inodes_per_group +
972 1 + fs->super->s_inodes_per_group -
973 fs->group_desc[group].bg_itable_unused;
974 cd->pctx.group = group;
977 * Check if the inode was missed out because
978 * _INODE_UNINIT flag was set or bg_itable_unused was
979 * incorrect. If so, clear the _INODE_UNINIT flag and
980 * restart e2fsck. In the future it would be nice if
981 * we could call a function in pass1.c that checks the
982 * newly visible inodes.
984 if (fs->group_desc[group].bg_flags & EXT2_BG_INODE_UNINIT) {
985 pctx.num = dirent->inode;
986 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
988 fs->group_desc[group].bg_flags &=
989 ~EXT2_BG_INODE_UNINIT;
990 ext2fs_mark_super_dirty(fs);
991 ctx->flags |= E2F_FLAG_RESTART_LATER;
993 ext2fs_unmark_valid(fs);
994 if (problem == PR_2_BAD_INO)
997 } else if (dirent->inode >= first_unused_inode) {
998 pctx.num = dirent->inode;
999 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
1000 fs->group_desc[group].bg_itable_unused = 0;
1001 ext2fs_mark_super_dirty(fs);
1002 ctx->flags |= E2F_FLAG_RESTART_LATER;
1004 ext2fs_unmark_valid(fs);
1005 if (problem == PR_2_BAD_INO)
1011 * Offer to clear unused inodes; if we are going to be
1012 * restarting the scan due to bg_itable_unused being
1013 * wrong, then don't clear any inodes to avoid zapping
1014 * inodes that were skipped during pass1 due to an
1015 * incorrect bg_itable_unused; we'll get any real
1016 * problems after we restart.
1018 if (!(ctx->flags & E2F_FLAG_RESTART_LATER) &&
1019 !(ext2fs_test_inode_bitmap(ctx->inode_used_map,
1021 problem = PR_2_UNUSED_INODE;
1024 if (fix_problem(ctx, problem, &cd->pctx)) {
1029 ext2fs_unmark_valid(fs);
1030 if (problem == PR_2_BAD_INO)
1035 if (check_name(ctx, dirent, ino, &cd->pctx))
1038 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1043 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
1044 (dirent->name_len & 0xFF),
1045 fs->super->s_hash_seed, &hash, 0);
1046 if (hash < dx_db->min_hash)
1047 dx_db->min_hash = hash;
1048 if (hash > dx_db->max_hash)
1049 dx_db->max_hash = hash;
1054 * If this is a directory, then mark its parent in its
1055 * dir_info structure. If the parent field is already
1056 * filled in, then this directory has more than one
1057 * hard link. We assume the first link is correct,
1058 * and ask the user if he/she wants to clear this one.
1060 if ((dot_state > 1) &&
1061 (ext2fs_test_inode_bitmap(ctx->inode_dir_map,
1063 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1065 cd->pctx.ino = dirent->inode;
1066 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1067 goto abort_free_dict;
1069 if (subdir_parent) {
1070 cd->pctx.ino2 = subdir_parent;
1071 if (fix_problem(ctx, PR_2_LINK_DIR,
1079 (void) e2fsck_dir_info_set_parent(ctx,
1080 dirent->inode, ino);
1086 } else if (dict_lookup(&de_dict, dirent)) {
1087 clear_problem_context(&pctx);
1089 pctx.dirent = dirent;
1090 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1091 if (!ctx->dirs_to_hash)
1092 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
1093 if (ctx->dirs_to_hash)
1094 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1097 dict_alloc_insert(&de_dict, dirent, dirent);
1099 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1102 ctx->fs_links_count++;
1103 ctx->fs_total_count++;
1107 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1110 } while (offset < fs->blocksize);
1117 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1118 db->blockcnt, dx_db->type,
1119 dx_db->min_hash, dx_db->max_hash);
1121 cd->pctx.dir = cd->pctx.ino;
1122 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1123 (dx_db->type == DX_DIRBLOCK_NODE))
1124 parse_int_node(fs, db, cd, dx_dir, buf);
1126 #endif /* ENABLE_HTREE */
1127 if (offset != fs->blocksize) {
1128 cd->pctx.num = rec_len - fs->blocksize + offset;
1129 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1130 dirent->rec_len = cd->pctx.num;
1135 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf);
1136 if (cd->pctx.errcode) {
1137 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1139 goto abort_free_dict;
1141 ext2fs_mark_changed(fs);
1143 dict_free_nodes(&de_dict);
1146 ctx->flags |= E2F_FLAG_ABORT;
1147 dict_free_nodes(&de_dict);
1148 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 blk_t ref_block EXT2FS_ATTR((unused)),
1159 int ref_offset EXT2FS_ATTR((unused)),
1162 e2fsck_t ctx = (e2fsck_t) priv_data;
1164 if (HOLE_BLKADDR(*block_nr))
1166 if ((*block_nr < fs->super->s_first_data_block) ||
1167 (*block_nr >= fs->super->s_blocks_count))
1169 ext2fs_unmark_block_bitmap(ctx->block_found_map, *block_nr);
1170 ext2fs_block_alloc_stats(fs, *block_nr, -1);
1175 * This fuction deallocates an inode
1177 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1179 ext2_filsys fs = ctx->fs;
1180 struct ext2_inode inode;
1181 struct problem_context pctx;
1184 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1185 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1186 clear_problem_context(&pctx);
1190 * Fix up the bitmaps...
1192 e2fsck_read_bitmaps(ctx);
1193 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1195 if (inode.i_file_acl &&
1196 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1197 pctx.errcode = ext2fs_adjust_ea_refcount(fs, inode.i_file_acl,
1198 block_buf, -1, &count);
1199 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1204 pctx.blk = inode.i_file_acl;
1205 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1206 ctx->flags |= E2F_FLAG_ABORT;
1210 ext2fs_unmark_block_bitmap(ctx->block_found_map,
1212 ext2fs_block_alloc_stats(fs, inode.i_file_acl, -1);
1214 inode.i_file_acl = 0;
1217 if (!ext2fs_inode_has_valid_blocks(&inode))
1220 if (LINUX_S_ISREG(inode.i_mode) &&
1221 (inode.i_size_high || inode.i_size & 0x80000000UL))
1224 pctx.errcode = ext2fs_block_iterate2(fs, ino, 0, block_buf,
1225 deallocate_inode_block, ctx);
1227 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1228 ctx->flags |= E2F_FLAG_ABORT;
1234 * This fuction clears the htree flag on an inode
1236 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1238 struct ext2_inode inode;
1240 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1241 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1242 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1243 if (ctx->dirs_to_hash)
1244 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1248 extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1249 ext2_ino_t ino, char *buf)
1251 ext2_filsys fs = ctx->fs;
1252 struct ext2_inode inode;
1253 int inode_modified = 0;
1255 unsigned char *frag, *fsize;
1256 struct problem_context pctx;
1259 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1261 clear_problem_context(&pctx);
1264 pctx.inode = &inode;
1266 if (inode.i_file_acl &&
1267 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1268 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1269 inode.i_file_acl = 0;
1275 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1276 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1277 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1278 !(LINUX_S_ISSOCK(inode.i_mode)))
1279 problem = PR_2_BAD_MODE;
1280 else if (LINUX_S_ISCHR(inode.i_mode)
1281 && !e2fsck_pass1_check_device_inode(fs, &inode))
1282 problem = PR_2_BAD_CHAR_DEV;
1283 else if (LINUX_S_ISBLK(inode.i_mode)
1284 && !e2fsck_pass1_check_device_inode(fs, &inode))
1285 problem = PR_2_BAD_BLOCK_DEV;
1286 else if (LINUX_S_ISFIFO(inode.i_mode)
1287 && !e2fsck_pass1_check_device_inode(fs, &inode))
1288 problem = PR_2_BAD_FIFO;
1289 else if (LINUX_S_ISSOCK(inode.i_mode)
1290 && !e2fsck_pass1_check_device_inode(fs, &inode))
1291 problem = PR_2_BAD_SOCKET;
1292 else if (LINUX_S_ISLNK(inode.i_mode)
1293 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1294 problem = PR_2_INVALID_SYMLINK;
1298 if (fix_problem(ctx, problem, &pctx)) {
1299 deallocate_inode(ctx, ino, 0);
1300 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1308 if (inode.i_faddr) {
1309 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1316 switch (fs->super->s_creator_os) {
1318 frag = &inode.osd2.hurd2.h_i_frag;
1319 fsize = &inode.osd2.hurd2.h_i_fsize;
1324 if (frag && *frag) {
1326 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1333 if (fsize && *fsize) {
1335 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1343 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1344 !(fs->super->s_feature_ro_compat &
1345 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1346 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1347 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1348 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1349 inode.osd2.linux2.l_i_blocks_hi = 0;
1354 if (!(fs->super->s_feature_incompat &
1355 EXT4_FEATURE_INCOMPAT_64BIT) &&
1356 inode.osd2.linux2.l_i_file_acl_high != 0) {
1357 pctx.num = inode.osd2.linux2.l_i_file_acl_high;
1358 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) {
1359 inode.osd2.linux2.l_i_file_acl_high = 0;
1365 if (inode.i_file_acl &&
1366 ((inode.i_file_acl < fs->super->s_first_data_block) ||
1367 (inode.i_file_acl >= fs->super->s_blocks_count))) {
1368 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1369 inode.i_file_acl = 0;
1374 if (inode.i_dir_acl &&
1375 LINUX_S_ISDIR(inode.i_mode)) {
1376 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1377 inode.i_dir_acl = 0;
1384 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1385 if (!not_fixed && ctx->inode_bad_map)
1386 ext2fs_unmark_inode_bitmap(ctx->inode_bad_map, ino);
1392 * allocate_dir_block --- this function allocates a new directory
1393 * block for a particular inode; this is done if a directory has
1394 * a "hole" in it, or if a directory has a illegal block number
1395 * that was zeroed out and now needs to be replaced.
1397 static int allocate_dir_block(e2fsck_t ctx,
1398 struct ext2_db_entry *db,
1399 char *buf EXT2FS_ATTR((unused)),
1400 struct problem_context *pctx)
1402 ext2_filsys fs = ctx->fs;
1405 struct ext2_inode inode;
1407 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1411 * Read the inode and block bitmaps in; we'll be messing with
1414 e2fsck_read_bitmaps(ctx);
1417 * First, find a free block
1419 pctx->errcode = ext2fs_new_block(fs, 0, ctx->block_found_map, &blk);
1420 if (pctx->errcode) {
1421 pctx->str = "ext2fs_new_block";
1422 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1425 ext2fs_mark_block_bitmap(ctx->block_found_map, blk);
1426 ext2fs_mark_block_bitmap(fs->block_map, blk);
1427 ext2fs_mark_bb_dirty(fs);
1430 * Now let's create the actual data block for the inode
1433 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1435 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1436 EXT2_ROOT_INO, &block);
1438 if (pctx->errcode) {
1439 pctx->str = "ext2fs_new_dir_block";
1440 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1444 pctx->errcode = ext2fs_write_dir_block(fs, blk, block);
1445 ext2fs_free_mem(&block);
1446 if (pctx->errcode) {
1447 pctx->str = "ext2fs_write_dir_block";
1448 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1453 * Update the inode block count
1455 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1456 ext2fs_iblk_add_blocks(fs, &inode, 1);
1457 if (inode.i_size < (db->blockcnt+1) * fs->blocksize)
1458 inode.i_size = (db->blockcnt+1) * fs->blocksize;
1459 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1462 * Finally, update the block pointers for the inode
1465 pctx->errcode = ext2fs_bmap(fs, db->ino, &inode, 0, BMAP_SET,
1466 db->blockcnt, &blk);
1467 if (pctx->errcode) {
1468 pctx->str = "ext2fs_block_iterate";
1469 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);