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 #ifdef RESOURCE_TRACK
105 init_resource_track(&rtrack);
108 clear_problem_context(&cd.pctx);
111 mtrace_print("Pass 2");
114 if (!(ctx->options & E2F_OPT_PREEN))
115 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
117 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
119 if (ctx->inode_count)
122 cd.pctx.errcode = ext2fs_create_icount2(fs,
123 EXT2_ICOUNT_OPT_INCREMENT,
124 0, ctx->inode_link_info,
126 if (cd.pctx.errcode) {
127 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
128 ctx->flags |= E2F_FLAG_ABORT;
131 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
132 "directory scan buffer");
135 * Set up the parent pointer for the root directory, if
136 * present. (If the root directory is not present, we will
137 * create it in pass 3.)
139 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
144 cd.max = ext2fs_dblist_count(fs->dblist);
147 (void) (ctx->progress)(ctx, 2, 0, cd.max);
149 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX)
150 ext2fs_dblist_sort(fs->dblist, special_dir_block_cmp);
152 cd.pctx.errcode = ext2fs_dblist_iterate(fs->dblist, check_dir_block,
154 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
156 if (cd.pctx.errcode) {
157 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
158 ctx->flags |= E2F_FLAG_ABORT;
163 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
164 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
166 if (dx_dir->numblocks == 0)
168 clear_problem_context(&pctx);
170 pctx.dir = dx_dir->ino;
171 dx_db = dx_dir->dx_block;
172 if (dx_db->flags & DX_FLAG_REFERENCED)
173 dx_db->flags |= DX_FLAG_DUP_REF;
175 dx_db->flags |= DX_FLAG_REFERENCED;
177 * Find all of the first and last leaf blocks, and
178 * update their parent's min and max hash values
180 for (b=0, dx_db = dx_dir->dx_block;
181 b < dx_dir->numblocks;
183 if ((dx_db->type != DX_DIRBLOCK_LEAF) ||
184 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST)))
186 dx_parent = &dx_dir->dx_block[dx_db->parent];
188 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
190 if (dx_db->flags & DX_FLAG_FIRST)
191 dx_parent->min_hash = dx_db->min_hash;
193 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
195 if (dx_db->flags & DX_FLAG_LAST)
196 dx_parent->max_hash = dx_db->max_hash;
199 for (b=0, dx_db = dx_dir->dx_block;
200 b < dx_dir->numblocks;
203 pctx.group = dx_db->parent;
205 if (!(dx_db->flags & DX_FLAG_FIRST) &&
206 (dx_db->min_hash < dx_db->node_min_hash)) {
207 pctx.blk = dx_db->min_hash;
208 pctx.blk2 = dx_db->node_min_hash;
209 code = PR_2_HTREE_MIN_HASH;
210 fix_problem(ctx, code, &pctx);
213 if (dx_db->type == DX_DIRBLOCK_LEAF) {
214 depth = htree_depth(dx_dir, dx_db);
215 if (depth != dx_dir->depth) {
216 code = PR_2_HTREE_BAD_DEPTH;
217 fix_problem(ctx, code, &pctx);
222 * This test doesn't apply for the root block
226 (dx_db->max_hash > dx_db->node_max_hash)) {
227 pctx.blk = dx_db->max_hash;
228 pctx.blk2 = dx_db->node_max_hash;
229 code = PR_2_HTREE_MAX_HASH;
230 fix_problem(ctx, code, &pctx);
233 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
234 code = PR_2_HTREE_NOTREF;
235 fix_problem(ctx, code, &pctx);
237 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
238 code = PR_2_HTREE_DUPREF;
239 fix_problem(ctx, code, &pctx);
245 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
246 clear_htree(ctx, dx_dir->ino);
247 dx_dir->numblocks = 0;
251 ext2fs_free_mem(&buf);
252 ext2fs_free_dblist(fs->dblist);
254 if (ctx->inode_bad_map) {
255 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
256 ctx->inode_bad_map = 0;
258 if (ctx->inode_reg_map) {
259 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
260 ctx->inode_reg_map = 0;
263 clear_problem_context(&pctx);
264 if (ctx->large_files) {
265 if (!(sb->s_feature_ro_compat &
266 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) &&
267 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
268 sb->s_feature_ro_compat |=
269 EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
270 ext2fs_mark_super_dirty(fs);
272 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
273 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
274 ext2fs_update_dynamic_rev(fs);
275 ext2fs_mark_super_dirty(fs);
277 } else if (!ctx->large_files &&
278 (sb->s_feature_ro_compat &
279 EXT2_FEATURE_RO_COMPAT_LARGE_FILE)) {
280 if (fs->flags & EXT2_FLAG_RW) {
281 sb->s_feature_ro_compat &=
282 ~EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
283 ext2fs_mark_super_dirty(fs);
287 #ifdef RESOURCE_TRACK
288 if (ctx->options & E2F_OPT_TIME2) {
289 e2fsck_clear_progbar(ctx);
290 print_resource_track(_("Pass 2"), &rtrack);
295 #define MAX_DEPTH 32000
296 static int htree_depth(struct dx_dir_info *dx_dir,
297 struct dx_dirblock_info *dx_db)
301 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
302 dx_db = &dx_dir->dx_block[dx_db->parent];
308 static int dict_de_cmp(const void *a, const void *b)
310 const struct ext2_dir_entry *de_a, *de_b;
313 de_a = (const struct ext2_dir_entry *) a;
314 a_len = de_a->name_len & 0xFF;
315 de_b = (const struct ext2_dir_entry *) b;
316 b_len = de_b->name_len & 0xFF;
319 return (a_len - b_len);
321 return strncmp(de_a->name, de_b->name, a_len);
325 * This is special sort function that makes sure that directory blocks
326 * with a dirblock of zero are sorted to the beginning of the list.
327 * This guarantees that the root node of the htree directories are
328 * processed first, so we know what hash version to use.
330 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
332 const struct ext2_db_entry *db_a =
333 (const struct ext2_db_entry *) a;
334 const struct ext2_db_entry *db_b =
335 (const struct ext2_db_entry *) b;
337 if (db_a->blockcnt && !db_b->blockcnt)
340 if (!db_a->blockcnt && db_b->blockcnt)
343 if (db_a->blk != db_b->blk)
344 return (int) (db_a->blk - db_b->blk);
346 if (db_a->ino != db_b->ino)
347 return (int) (db_a->ino - db_b->ino);
349 return (int) (db_a->blockcnt - db_b->blockcnt);
354 * Make sure the first entry in the directory is '.', and that the
355 * directory entry is sane.
357 static int check_dot(e2fsck_t ctx,
358 struct ext2_dir_entry *dirent,
359 ext2_ino_t ino, struct problem_context *pctx)
361 struct ext2_dir_entry *nextdir;
368 problem = PR_2_MISSING_DOT;
369 else if (((dirent->name_len & 0xFF) != 1) ||
370 (dirent->name[0] != '.'))
371 problem = PR_2_1ST_NOT_DOT;
372 else if (dirent->name[1] != '\0')
373 problem = PR_2_DOT_NULL_TERM;
376 if (fix_problem(ctx, problem, pctx)) {
377 if (dirent->rec_len < 12)
378 dirent->rec_len = 12;
380 dirent->name_len = 1;
381 dirent->name[0] = '.';
382 dirent->name[1] = '\0';
387 if (dirent->inode != ino) {
388 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
393 if (dirent->rec_len > 12) {
394 new_len = dirent->rec_len - 12;
397 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
398 nextdir = (struct ext2_dir_entry *)
399 ((char *) dirent + 12);
400 dirent->rec_len = 12;
401 nextdir->rec_len = new_len;
403 nextdir->name_len = 0;
412 * Make sure the second entry in the directory is '..', and that the
413 * directory entry is sane. We do not check the inode number of '..'
414 * here; this gets done in pass 3.
416 static int check_dotdot(e2fsck_t ctx,
417 struct ext2_dir_entry *dirent,
418 ext2_ino_t ino, struct problem_context *pctx)
423 problem = PR_2_MISSING_DOT_DOT;
424 else if (((dirent->name_len & 0xFF) != 2) ||
425 (dirent->name[0] != '.') ||
426 (dirent->name[1] != '.'))
427 problem = PR_2_2ND_NOT_DOT_DOT;
428 else if (dirent->name[2] != '\0')
429 problem = PR_2_DOT_DOT_NULL_TERM;
432 if (fix_problem(ctx, problem, pctx)) {
433 if (dirent->rec_len < 12)
434 dirent->rec_len = 12;
436 * Note: we don't have the parent inode just
437 * yet, so we will fill it in with the root
438 * inode. This will get fixed in pass 3.
440 dirent->inode = EXT2_ROOT_INO;
441 dirent->name_len = 2;
442 dirent->name[0] = '.';
443 dirent->name[1] = '.';
444 dirent->name[2] = '\0';
449 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
450 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
457 * Check to make sure a directory entry doesn't contain any illegal
460 static int check_name(e2fsck_t ctx,
461 struct ext2_dir_entry *dirent,
462 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
463 struct problem_context *pctx)
469 for ( i = 0; i < (dirent->name_len & 0xFF); i++) {
470 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
472 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
475 dirent->name[i] = '.';
484 * Check the directory filetype (if present)
486 static _INLINE_ int check_filetype(e2fsck_t ctx,
487 struct ext2_dir_entry *dirent,
488 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
489 struct problem_context *pctx)
491 int filetype = dirent->name_len >> 8;
492 int should_be = EXT2_FT_UNKNOWN;
493 struct ext2_inode inode;
495 if (!(ctx->fs->super->s_feature_incompat &
496 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
498 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
500 dirent->name_len = dirent->name_len & 0xFF;
504 if (ext2fs_test_inode_bitmap(ctx->inode_dir_map, dirent->inode)) {
505 should_be = EXT2_FT_DIR;
506 } else if (ext2fs_test_inode_bitmap(ctx->inode_reg_map,
508 should_be = EXT2_FT_REG_FILE;
509 } else if (ctx->inode_bad_map &&
510 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
514 e2fsck_read_inode(ctx, dirent->inode, &inode,
516 should_be = ext2_file_type(inode.i_mode);
518 if (filetype == should_be)
520 pctx->num = should_be;
522 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
526 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8;
531 static void parse_int_node(ext2_filsys fs,
532 struct ext2_db_entry *db,
533 struct check_dir_struct *cd,
534 struct dx_dir_info *dx_dir,
537 struct ext2_dx_root_info *root;
538 struct ext2_dx_entry *ent;
539 struct ext2_dx_countlimit *limit;
540 struct dx_dirblock_info *dx_db;
541 int i, expect_limit, count;
543 ext2_dirhash_t min_hash = 0xffffffff;
544 ext2_dirhash_t max_hash = 0;
545 ext2_dirhash_t hash = 0, prev_hash;
547 if (db->blockcnt == 0) {
548 root = (struct ext2_dx_root_info *) (block_buf + 24);
551 printf("Root node dump:\n");
552 printf("\t Reserved zero: %u\n", root->reserved_zero);
553 printf("\t Hash Version: %d\n", root->hash_version);
554 printf("\t Info length: %d\n", root->info_length);
555 printf("\t Indirect levels: %d\n", root->indirect_levels);
556 printf("\t Flags: %d\n", root->unused_flags);
559 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
561 ent = (struct ext2_dx_entry *) (block_buf+8);
563 limit = (struct ext2_dx_countlimit *) ent;
566 printf("Number of entries (count): %d\n",
567 ext2fs_le16_to_cpu(limit->count));
568 printf("Number of entries (limit): %d\n",
569 ext2fs_le16_to_cpu(limit->limit));
572 count = ext2fs_le16_to_cpu(limit->count);
573 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) /
574 sizeof(struct ext2_dx_entry);
575 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
576 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
577 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
580 if (count > expect_limit) {
581 cd->pctx.num = count;
582 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
584 count = expect_limit;
587 for (i=0; i < count; i++) {
589 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
591 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
592 hash, ext2fs_le32_to_cpu(ent[i].block));
594 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
595 /* Check to make sure the block is valid */
596 if (blk >= (blk_t) dx_dir->numblocks) {
598 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
603 if (hash < prev_hash &&
604 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
606 dx_db = &dx_dir->dx_block[blk];
607 if (dx_db->flags & DX_FLAG_REFERENCED) {
608 dx_db->flags |= DX_FLAG_DUP_REF;
610 dx_db->flags |= DX_FLAG_REFERENCED;
611 dx_db->parent = db->blockcnt;
617 dx_db->node_min_hash = hash;
619 dx_db->node_max_hash =
620 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
622 dx_db->node_max_hash = 0xfffffffe;
623 dx_db->flags |= DX_FLAG_LAST;
626 dx_db->flags |= DX_FLAG_FIRST;
629 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
630 db->blockcnt, min_hash, max_hash);
632 dx_db = &dx_dir->dx_block[db->blockcnt];
633 dx_db->min_hash = min_hash;
634 dx_db->max_hash = max_hash;
638 clear_htree(cd->ctx, cd->pctx.ino);
639 dx_dir->numblocks = 0;
641 #endif /* ENABLE_HTREE */
644 * Given a busted directory, try to salvage it somehow.
647 static void salvage_directory(ext2_filsys fs,
648 struct ext2_dir_entry *dirent,
649 struct ext2_dir_entry *prev,
650 unsigned int *offset)
652 char *cp = (char *) dirent;
653 int left = fs->blocksize - *offset - dirent->rec_len;
654 unsigned int name_len = dirent->name_len & 0xFF;
657 * Special case of directory entry of size 8: copy what's left
658 * of the directory block up to cover up the invalid hole.
660 if ((left >= 12) && (dirent->rec_len == 8)) {
661 memmove(cp, cp+8, left);
662 memset(cp + left, 0, 8);
666 * If the directory entry overruns the end of the directory
667 * block, and the name is small enough to fit, then adjust the
671 (name_len + 8 <= dirent->rec_len + (unsigned) left) &&
672 dirent->inode <= fs->super->s_inodes_count &&
673 strnlen(dirent->name, name_len) == name_len) {
674 dirent->rec_len += left;
678 * If the directory entry is a multiple of four, so it is
679 * valid, let the previous directory entry absorb the invalid
682 if (prev && dirent->rec_len && (dirent->rec_len % 4) == 0) {
683 prev->rec_len += dirent->rec_len;
684 *offset += dirent->rec_len;
688 * Default salvage method --- kill all of the directory
689 * entries for the rest of the block. We will either try to
690 * absorb it into the previous directory entry, or create a
691 * new empty directory entry the rest of the directory block.
694 prev->rec_len += fs->blocksize - *offset;
695 *offset = fs->blocksize;
697 dirent->rec_len = fs->blocksize - *offset;
698 dirent->name_len = 0;
703 static int check_dir_block(ext2_filsys fs,
704 struct ext2_db_entry *db,
707 struct dir_info *subdir;
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 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)
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 cd->pctx.errcode = ext2fs_read_dir_block(fs, block_nr, buf);
777 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
778 cd->pctx.errcode = 0; /* We'll handle this ourselves */
779 if (cd->pctx.errcode) {
780 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
781 ctx->flags |= E2F_FLAG_ABORT;
784 memset(buf, 0, fs->blocksize);
787 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
788 if (dx_dir && dx_dir->numblocks) {
789 if (db->blockcnt >= dx_dir->numblocks) {
790 printf("XXX should never happen!!!\n");
793 dx_db = &dx_dir->dx_block[db->blockcnt];
794 dx_db->type = DX_DIRBLOCK_LEAF;
795 dx_db->phys = block_nr;
796 dx_db->min_hash = ~0;
799 dirent = (struct ext2_dir_entry *) buf;
800 limit = (struct ext2_dx_countlimit *) (buf+8);
801 if (db->blockcnt == 0) {
802 root = (struct ext2_dx_root_info *) (buf + 24);
803 dx_db->type = DX_DIRBLOCK_ROOT;
804 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
805 if ((root->reserved_zero ||
806 root->info_length < 8 ||
807 root->indirect_levels > 1) &&
808 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
809 clear_htree(ctx, ino);
810 dx_dir->numblocks = 0;
813 dx_dir->hashversion = root->hash_version;
814 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
815 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
816 dx_dir->hashversion += 3;
817 dx_dir->depth = root->indirect_levels + 1;
818 } else if ((dirent->inode == 0) &&
819 (dirent->rec_len == fs->blocksize) &&
820 (dirent->name_len == 0) &&
821 (ext2fs_le16_to_cpu(limit->limit) ==
823 sizeof(struct ext2_dx_entry))))
824 dx_db->type = DX_DIRBLOCK_NODE;
826 #endif /* ENABLE_HTREE */
828 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
832 dirent = (struct ext2_dir_entry *) (buf + offset);
833 cd->pctx.dirent = dirent;
834 cd->pctx.num = offset;
835 if (((offset + dirent->rec_len) > fs->blocksize) ||
836 (dirent->rec_len < 12) ||
837 ((dirent->rec_len % 4) != 0) ||
838 (((dirent->name_len & 0xFF)+8) > dirent->rec_len)) {
839 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) {
840 salvage_directory(fs, dirent, prev, &offset);
844 goto abort_free_dict;
846 if ((dirent->name_len & 0xFF) > EXT2_NAME_LEN) {
847 if (fix_problem(ctx, PR_2_FILENAME_LONG, &cd->pctx)) {
848 dirent->name_len = EXT2_NAME_LEN;
853 if (dot_state == 0) {
854 if (check_dot(ctx, dirent, ino, &cd->pctx))
856 } else if (dot_state == 1) {
857 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
859 goto abort_free_dict;
862 } else if (dirent->inode == ino) {
863 problem = PR_2_LINK_DOT;
864 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
874 * Make sure the inode listed is a legal one.
876 if (((dirent->inode != EXT2_ROOT_INO) &&
877 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
878 (dirent->inode > fs->super->s_inodes_count)) {
879 problem = PR_2_BAD_INO;
880 } else if (!(ext2fs_test_inode_bitmap(ctx->inode_used_map,
883 * If the inode is unused, offer to clear it.
885 problem = PR_2_UNUSED_INODE;
886 } else if (ctx->inode_bb_map &&
887 (ext2fs_test_inode_bitmap(ctx->inode_bb_map,
890 * If the inode is in a bad block, offer to
893 problem = PR_2_BB_INODE;
894 } else if ((dot_state > 1) &&
895 ((dirent->name_len & 0xFF) == 1) &&
896 (dirent->name[0] == '.')) {
898 * If there's a '.' entry in anything other
899 * than the first directory entry, it's a
900 * duplicate entry that should be removed.
902 problem = PR_2_DUP_DOT;
903 } else if ((dot_state > 1) &&
904 ((dirent->name_len & 0xFF) == 2) &&
905 (dirent->name[0] == '.') &&
906 (dirent->name[1] == '.')) {
908 * If there's a '..' entry in anything other
909 * than the second directory entry, it's a
910 * duplicate entry that should be removed.
912 problem = PR_2_DUP_DOT_DOT;
913 } else if ((dot_state > 1) &&
914 (dirent->inode == EXT2_ROOT_INO)) {
916 * Don't allow links to the root directory.
917 * We check this specially to make sure we
918 * catch this error case even if the root
919 * directory hasn't been created yet.
921 problem = PR_2_LINK_ROOT;
922 } else if ((dot_state > 1) &&
923 (dirent->name_len & 0xFF) == 0) {
925 * Don't allow zero-length directory names.
927 problem = PR_2_NULL_NAME;
931 if (fix_problem(ctx, problem, &cd->pctx)) {
936 ext2fs_unmark_valid(fs);
937 if (problem == PR_2_BAD_INO)
943 * If the inode was marked as having bad fields in
944 * pass1, process it and offer to fix/clear it.
945 * (We wait until now so that we can display the
946 * pathname to the user.)
948 if (ctx->inode_bad_map &&
949 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
951 if (e2fsck_process_bad_inode(ctx, ino,
953 buf + fs->blocksize)) {
958 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
962 if (check_name(ctx, dirent, ino, &cd->pctx))
965 if (check_filetype(ctx, dirent, ino, &cd->pctx))
970 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
971 (dirent->name_len & 0xFF),
972 fs->super->s_hash_seed, &hash, 0);
973 if (hash < dx_db->min_hash)
974 dx_db->min_hash = hash;
975 if (hash > dx_db->max_hash)
976 dx_db->max_hash = hash;
981 * If this is a directory, then mark its parent in its
982 * dir_info structure. If the parent field is already
983 * filled in, then this directory has more than one
984 * hard link. We assume the first link is correct,
985 * and ask the user if he/she wants to clear this one.
987 if ((dot_state > 1) &&
988 (ext2fs_test_inode_bitmap(ctx->inode_dir_map,
990 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
992 cd->pctx.ino = dirent->inode;
993 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
994 goto abort_free_dict;
997 cd->pctx.ino2 = subdir_parent;
998 if (fix_problem(ctx, PR_2_LINK_DIR,
1006 (void) e2fsck_dir_info_set_parent(ctx,
1007 dirent->inode, ino);
1013 } else if (dict_lookup(&de_dict, dirent)) {
1014 clear_problem_context(&pctx);
1016 pctx.dirent = dirent;
1017 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1018 if (!ctx->dirs_to_hash)
1019 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
1020 if (ctx->dirs_to_hash)
1021 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1024 dict_alloc_insert(&de_dict, dirent, dirent);
1026 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1029 ctx->fs_links_count++;
1030 ctx->fs_total_count++;
1033 offset += dirent->rec_len;
1035 } while (offset < fs->blocksize);
1042 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1043 db->blockcnt, dx_db->type,
1044 dx_db->min_hash, dx_db->max_hash);
1046 cd->pctx.dir = cd->pctx.ino;
1047 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1048 (dx_db->type == DX_DIRBLOCK_NODE))
1049 parse_int_node(fs, db, cd, dx_dir, buf);
1051 #endif /* ENABLE_HTREE */
1052 if (offset != fs->blocksize) {
1053 cd->pctx.num = dirent->rec_len - fs->blocksize + offset;
1054 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1055 dirent->rec_len = cd->pctx.num;
1060 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf);
1061 if (cd->pctx.errcode) {
1062 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1064 goto abort_free_dict;
1066 ext2fs_mark_changed(fs);
1068 dict_free_nodes(&de_dict);
1071 dict_free_nodes(&de_dict);
1072 ctx->flags |= E2F_FLAG_ABORT;
1073 return DIRENT_ABORT;
1077 * This function is called to deallocate a block, and is an interator
1078 * functioned called by deallocate inode via ext2fs_iterate_block().
1080 static int deallocate_inode_block(ext2_filsys fs,
1082 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1083 blk_t ref_block EXT2FS_ATTR((unused)),
1084 int ref_offset EXT2FS_ATTR((unused)),
1087 e2fsck_t ctx = (e2fsck_t) priv_data;
1089 if (HOLE_BLKADDR(*block_nr))
1091 if ((*block_nr < fs->super->s_first_data_block) ||
1092 (*block_nr >= fs->super->s_blocks_count))
1094 ext2fs_unmark_block_bitmap(ctx->block_found_map, *block_nr);
1095 ext2fs_block_alloc_stats(fs, *block_nr, -1);
1100 * This fuction deallocates an inode
1102 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1104 ext2_filsys fs = ctx->fs;
1105 struct ext2_inode inode;
1106 struct problem_context pctx;
1109 ext2fs_icount_store(ctx->inode_link_info, ino, 0);
1110 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1111 inode.i_links_count = 0;
1112 inode.i_dtime = ctx->now;
1113 e2fsck_write_inode(ctx, ino, &inode, "deallocate_inode");
1114 clear_problem_context(&pctx);
1118 * Fix up the bitmaps...
1120 e2fsck_read_bitmaps(ctx);
1121 ext2fs_unmark_inode_bitmap(ctx->inode_used_map, ino);
1122 ext2fs_unmark_inode_bitmap(ctx->inode_dir_map, ino);
1123 if (ctx->inode_bad_map)
1124 ext2fs_unmark_inode_bitmap(ctx->inode_bad_map, ino);
1125 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1127 if (inode.i_file_acl &&
1128 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1129 pctx.errcode = ext2fs_adjust_ea_refcount(fs, inode.i_file_acl,
1130 block_buf, -1, &count);
1131 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1136 pctx.blk = inode.i_file_acl;
1137 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1138 ctx->flags |= E2F_FLAG_ABORT;
1142 ext2fs_unmark_block_bitmap(ctx->block_found_map,
1144 ext2fs_block_alloc_stats(fs, inode.i_file_acl, -1);
1146 inode.i_file_acl = 0;
1149 if (!ext2fs_inode_has_valid_blocks(&inode))
1152 if (LINUX_S_ISREG(inode.i_mode) &&
1153 (inode.i_size_high || inode.i_size & 0x80000000UL))
1156 pctx.errcode = ext2fs_block_iterate2(fs, ino, 0, block_buf,
1157 deallocate_inode_block, ctx);
1159 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1160 ctx->flags |= E2F_FLAG_ABORT;
1166 * This fuction clears the htree flag on an inode
1168 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1170 struct ext2_inode inode;
1172 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1173 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1174 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1175 if (ctx->dirs_to_hash)
1176 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1180 extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1181 ext2_ino_t ino, char *buf)
1183 ext2_filsys fs = ctx->fs;
1184 struct ext2_inode inode;
1185 int inode_modified = 0;
1187 unsigned char *frag, *fsize;
1188 struct problem_context pctx;
1191 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1193 clear_problem_context(&pctx);
1196 pctx.inode = &inode;
1198 if (inode.i_file_acl &&
1199 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1200 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1201 inode.i_file_acl = 0;
1202 #ifdef EXT2FS_ENABLE_SWAPFS
1204 * This is a special kludge to deal with long
1205 * symlinks on big endian systems. i_blocks
1206 * had already been decremented earlier in
1207 * pass 1, but since i_file_acl hadn't yet
1208 * been cleared, ext2fs_read_inode() assumed
1209 * that the file was short symlink and would
1210 * not have byte swapped i_block[0]. Hence,
1211 * we have to byte-swap it here.
1213 if (LINUX_S_ISLNK(inode.i_mode) &&
1214 (fs->flags & EXT2_FLAG_SWAP_BYTES) &&
1215 (inode.i_blocks == fs->blocksize >> 9))
1216 inode.i_block[0] = ext2fs_swab32(inode.i_block[0]);
1223 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1224 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1225 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1226 !(LINUX_S_ISSOCK(inode.i_mode)))
1227 problem = PR_2_BAD_MODE;
1228 else if (LINUX_S_ISCHR(inode.i_mode)
1229 && !e2fsck_pass1_check_device_inode(fs, &inode))
1230 problem = PR_2_BAD_CHAR_DEV;
1231 else if (LINUX_S_ISBLK(inode.i_mode)
1232 && !e2fsck_pass1_check_device_inode(fs, &inode))
1233 problem = PR_2_BAD_BLOCK_DEV;
1234 else if (LINUX_S_ISFIFO(inode.i_mode)
1235 && !e2fsck_pass1_check_device_inode(fs, &inode))
1236 problem = PR_2_BAD_FIFO;
1237 else if (LINUX_S_ISSOCK(inode.i_mode)
1238 && !e2fsck_pass1_check_device_inode(fs, &inode))
1239 problem = PR_2_BAD_SOCKET;
1240 else if (LINUX_S_ISLNK(inode.i_mode)
1241 && !e2fsck_pass1_check_symlink(fs, &inode, buf)) {
1242 problem = PR_2_INVALID_SYMLINK;
1246 if (fix_problem(ctx, problem, &pctx)) {
1247 deallocate_inode(ctx, ino, 0);
1248 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1256 if (inode.i_faddr) {
1257 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1264 switch (fs->super->s_creator_os) {
1266 frag = &inode.osd2.hurd2.h_i_frag;
1267 fsize = &inode.osd2.hurd2.h_i_fsize;
1270 frag = &inode.osd2.masix2.m_i_frag;
1271 fsize = &inode.osd2.masix2.m_i_fsize;
1276 if (frag && *frag) {
1278 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1285 if (fsize && *fsize) {
1287 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1295 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1296 !(fs->super->s_feature_ro_compat &
1297 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1298 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1299 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1300 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1301 inode.osd2.linux2.l_i_blocks_hi = 0;
1306 if (inode.i_file_acl &&
1307 ((inode.i_file_acl < fs->super->s_first_data_block) ||
1308 (inode.i_file_acl >= fs->super->s_blocks_count))) {
1309 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1310 inode.i_file_acl = 0;
1315 if (inode.i_dir_acl &&
1316 LINUX_S_ISDIR(inode.i_mode)) {
1317 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1318 inode.i_dir_acl = 0;
1325 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1326 if (!not_fixed && ctx->inode_bad_map)
1327 ext2fs_unmark_inode_bitmap(ctx->inode_bad_map, ino);
1333 * allocate_dir_block --- this function allocates a new directory
1334 * block for a particular inode; this is done if a directory has
1335 * a "hole" in it, or if a directory has a illegal block number
1336 * that was zeroed out and now needs to be replaced.
1338 static int allocate_dir_block(e2fsck_t ctx,
1339 struct ext2_db_entry *db,
1340 char *buf EXT2FS_ATTR((unused)),
1341 struct problem_context *pctx)
1343 ext2_filsys fs = ctx->fs;
1346 struct ext2_inode inode;
1348 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1352 * Read the inode and block bitmaps in; we'll be messing with
1355 e2fsck_read_bitmaps(ctx);
1358 * First, find a free block
1360 pctx->errcode = ext2fs_new_block(fs, 0, ctx->block_found_map, &blk);
1361 if (pctx->errcode) {
1362 pctx->str = "ext2fs_new_block";
1363 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1366 ext2fs_mark_block_bitmap(ctx->block_found_map, blk);
1367 ext2fs_mark_block_bitmap(fs->block_map, blk);
1368 ext2fs_mark_bb_dirty(fs);
1371 * Now let's create the actual data block for the inode
1374 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1376 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1377 EXT2_ROOT_INO, &block);
1379 if (pctx->errcode) {
1380 pctx->str = "ext2fs_new_dir_block";
1381 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1385 pctx->errcode = ext2fs_write_dir_block(fs, blk, block);
1386 ext2fs_free_mem(&block);
1387 if (pctx->errcode) {
1388 pctx->str = "ext2fs_write_dir_block";
1389 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1394 * Update the inode block count
1396 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1397 inode.i_blocks += fs->blocksize / 512;
1398 if (inode.i_size < (db->blockcnt+1) * fs->blocksize)
1399 inode.i_size = (db->blockcnt+1) * fs->blocksize;
1400 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1403 * Finally, update the block pointers for the inode
1406 pctx->errcode = ext2fs_block_iterate2(fs, db->ino, BLOCK_FLAG_HOLE,
1407 0, update_dir_block, db);
1408 if (pctx->errcode) {
1409 pctx->str = "ext2fs_block_iterate";
1410 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1418 * This is a helper function for allocate_dir_block().
1420 static int update_dir_block(ext2_filsys fs EXT2FS_ATTR((unused)),
1422 e2_blkcnt_t blockcnt,
1423 blk_t ref_block EXT2FS_ATTR((unused)),
1424 int ref_offset EXT2FS_ATTR((unused)),
1427 struct ext2_db_entry *db;
1429 db = (struct ext2_db_entry *) priv_data;
1430 if (db->blockcnt == (int) blockcnt) {
1431 *block_nr = db->blk;
1432 return BLOCK_CHANGED;