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
38 * - The encrypted_file_info
39 * - The inode_casefold_map bitmap
41 * Pass 2 frees the following data structures
42 * - The inode_bad_map bitmap
43 * - The inode_reg_map bitmap
44 * - The encrypted_file_info
45 * - The inode_casefold_map bitmap
48 #define _GNU_SOURCE 1 /* get strnlen() */
54 #include "support/dict.h"
56 #ifdef NO_INLINE_FUNCS
59 #define _INLINE_ inline
62 /* #define DX_DEBUG */
65 * Keeps track of how many times an inode is referenced.
67 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf);
68 static int check_dir_block2(ext2_filsys fs,
69 struct ext2_db_entry2 *dir_blocks_info,
71 static int check_dir_block(ext2_filsys fs,
72 struct ext2_db_entry2 *dir_blocks_info,
74 static int allocate_dir_block(e2fsck_t ctx,
75 struct ext2_db_entry2 *dir_blocks_info,
76 char *buf, struct problem_context *pctx);
77 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino);
78 static short htree_depth(struct dx_dir_info *dx_dir,
79 struct dx_dirblock_info *dx_db);
80 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b);
82 struct check_dir_struct {
84 struct problem_context pctx;
87 unsigned long long list_offset;
88 unsigned long long ra_entries;
89 unsigned long long next_ra_off;
92 static void update_parents(struct dx_dir_info *dx_dir, int type)
94 struct dx_dirblock_info *dx_db, *dx_parent, *dx_previous;
97 for (b = 0, dx_db = dx_dir->dx_block;
98 b < dx_dir->numblocks;
100 dx_parent = &dx_dir->dx_block[dx_db->parent];
101 if (dx_db->type != type)
105 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
107 if (dx_db->flags & DX_FLAG_FIRST) {
108 dx_parent->min_hash = dx_db->min_hash;
109 if (dx_parent->previous) {
111 &dx_dir->dx_block[dx_parent->previous];
112 dx_previous->node_max_hash =
117 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
119 if (dx_db->flags & DX_FLAG_LAST) {
120 dx_parent->max_hash = dx_db->max_hash;
125 void e2fsck_pass2(e2fsck_t ctx)
127 struct ext2_super_block *sb = ctx->fs->super;
128 struct problem_context pctx;
129 ext2_filsys fs = ctx->fs;
131 #ifdef RESOURCE_TRACK
132 struct resource_track rtrack;
134 struct check_dir_struct cd;
135 struct dx_dir_info *dx_dir;
136 struct dx_dirblock_info *dx_db;
142 int (*check_dir_func)(ext2_filsys fs,
143 struct ext2_db_entry2 *dir_blocks_info,
146 init_resource_track(&rtrack, ctx->fs->io);
147 clear_problem_context(&cd.pctx);
150 mtrace_print("Pass 2");
153 if (!(ctx->options & E2F_OPT_PREEN))
154 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
156 cd.pctx.errcode = e2fsck_setup_icount(ctx, "inode_count",
157 EXT2_ICOUNT_OPT_INCREMENT,
158 ctx->inode_link_info, &ctx->inode_count);
159 if (cd.pctx.errcode) {
160 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
161 ctx->flags |= E2F_FLAG_ABORT;
164 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
165 "directory scan buffer");
168 * Set up the parent pointer for the root directory, if
169 * present. (If the root directory is not present, we will
170 * create it in pass 3.)
172 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
177 cd.max = ext2fs_dblist_count2(fs->dblist);
179 cd.ra_entries = ctx->readahead_kb * 1024 / ctx->fs->blocksize;
183 (void) (ctx->progress)(ctx, 2, 0, cd.max);
185 if (ext2fs_has_feature_dir_index(fs->super))
186 ext2fs_dblist_sort2(fs->dblist, special_dir_block_cmp);
188 check_dir_func = cd.ra_entries ? check_dir_block2 : check_dir_block;
189 cd.pctx.errcode = ext2fs_dblist_iterate2(fs->dblist, check_dir_func,
191 if (ctx->flags & E2F_FLAG_RESTART_LATER) {
192 ctx->flags |= E2F_FLAG_RESTART;
193 ctx->flags &= ~E2F_FLAG_RESTART_LATER;
196 if (ctx->flags & E2F_FLAG_RUN_RETURN)
199 if (cd.pctx.errcode) {
200 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
201 ctx->flags |= E2F_FLAG_ABORT;
205 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
206 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
208 if (e2fsck_dir_will_be_rehashed(ctx, dx_dir->ino) ||
209 dx_dir->numblocks == 0)
211 clear_problem_context(&pctx);
213 pctx.dir = dx_dir->ino;
214 dx_db = dx_dir->dx_block;
215 if (dx_db->flags & DX_FLAG_REFERENCED)
216 dx_db->flags |= DX_FLAG_DUP_REF;
218 dx_db->flags |= DX_FLAG_REFERENCED;
220 * Find all of the first and last leaf blocks, and
221 * update their parent's min and max hash values
223 update_parents(dx_dir, DX_DIRBLOCK_LEAF);
225 /* for 3 level htree: update 2 level parent's min
226 * and max hash values */
227 update_parents(dx_dir, DX_DIRBLOCK_NODE);
229 for (b=0, dx_db = dx_dir->dx_block;
230 b < dx_dir->numblocks;
233 pctx.group = dx_db->parent;
235 if (!(dx_db->flags & DX_FLAG_FIRST) &&
236 (dx_db->min_hash < dx_db->node_min_hash)) {
237 pctx.blk = dx_db->min_hash;
238 pctx.blk2 = dx_db->node_min_hash;
239 code = PR_2_HTREE_MIN_HASH;
240 fix_problem(ctx, code, &pctx);
243 if (dx_db->type == DX_DIRBLOCK_LEAF) {
244 depth = htree_depth(dx_dir, dx_db);
245 if (depth != dx_dir->depth) {
246 pctx.num = dx_dir->depth;
247 code = PR_2_HTREE_BAD_DEPTH;
248 fix_problem(ctx, code, &pctx);
253 * This test doesn't apply for the root block
257 (dx_db->max_hash > dx_db->node_max_hash)) {
258 pctx.blk = dx_db->max_hash;
259 pctx.blk2 = dx_db->node_max_hash;
260 code = PR_2_HTREE_MAX_HASH;
261 fix_problem(ctx, code, &pctx);
264 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
265 code = PR_2_HTREE_NOTREF;
266 fix_problem(ctx, code, &pctx);
268 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
269 code = PR_2_HTREE_DUPREF;
270 fix_problem(ctx, code, &pctx);
274 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
275 clear_htree(ctx, dx_dir->ino);
276 dx_dir->numblocks = 0;
279 e2fsck_free_dx_dir_info(ctx);
281 ext2fs_free_mem(&buf);
282 ext2fs_free_dblist(fs->dblist);
284 if (ctx->inode_bad_map) {
285 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
286 ctx->inode_bad_map = 0;
288 if (ctx->inode_reg_map) {
289 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
290 ctx->inode_reg_map = 0;
292 if (ctx->inode_casefold_map) {
293 ext2fs_free_inode_bitmap(ctx->inode_casefold_map);
294 ctx->inode_casefold_map = 0;
296 destroy_encrypted_file_info(ctx);
297 if (ctx->casefolded_dirs) {
298 ext2fs_u32_list_free(ctx->casefolded_dirs);
299 ctx->casefolded_dirs = 0;
302 clear_problem_context(&pctx);
303 if (ctx->large_files) {
304 if (!ext2fs_has_feature_large_file(sb) &&
305 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
306 ext2fs_set_feature_large_file(sb);
307 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
308 ext2fs_mark_super_dirty(fs);
310 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
311 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
312 ext2fs_update_dynamic_rev(fs);
313 ext2fs_mark_super_dirty(fs);
317 print_resource_track(ctx, _("Pass 2"), &rtrack, fs->io);
319 ext2fs_free_mem(&buf);
322 #define MAX_DEPTH 32000
323 static short htree_depth(struct dx_dir_info *dx_dir,
324 struct dx_dirblock_info *dx_db)
328 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
329 dx_db = &dx_dir->dx_block[dx_db->parent];
335 static int dict_de_cmp(const void *cmp_ctx, const void *a, const void *b)
337 const struct ext2_dir_entry *de_a, *de_b;
340 de_a = (const struct ext2_dir_entry *) a;
341 a_len = ext2fs_dirent_name_len(de_a);
342 de_b = (const struct ext2_dir_entry *) b;
343 b_len = ext2fs_dirent_name_len(de_b);
346 return (a_len - b_len);
348 return memcmp(de_a->name, de_b->name, a_len);
351 static int dict_de_cf_cmp(const void *cmp_ctx, const void *a, const void *b)
353 const struct ext2fs_nls_table *tbl = cmp_ctx;
354 const struct ext2_dir_entry *de_a, *de_b;
357 de_a = (const struct ext2_dir_entry *) a;
358 a_len = ext2fs_dirent_name_len(de_a);
359 de_b = (const struct ext2_dir_entry *) b;
360 b_len = ext2fs_dirent_name_len(de_b);
362 return ext2fs_casefold_cmp(tbl, de_a->name, a_len, de_b->name, b_len);
366 * This is special sort function that makes sure that directory blocks
367 * with a dirblock of zero are sorted to the beginning of the list.
368 * This guarantees that the root node of the htree directories are
369 * processed first, so we know what hash version to use.
371 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
373 const struct ext2_db_entry2 *db_a =
374 (const struct ext2_db_entry2 *) a;
375 const struct ext2_db_entry2 *db_b =
376 (const struct ext2_db_entry2 *) b;
378 if (db_a->blockcnt && !db_b->blockcnt)
381 if (!db_a->blockcnt && db_b->blockcnt)
384 if (db_a->blk != db_b->blk)
385 return (int) (db_a->blk - db_b->blk);
387 if (db_a->ino != db_b->ino)
388 return (int) (db_a->ino - db_b->ino);
390 return (int) (db_a->blockcnt - db_b->blockcnt);
395 * Make sure the first entry in the directory is '.', and that the
396 * directory entry is sane.
398 static int check_dot(e2fsck_t ctx,
399 struct ext2_dir_entry *dirent,
400 ext2_ino_t ino, struct problem_context *pctx)
402 struct ext2_dir_entry *nextdir;
403 unsigned int rec_len, new_len;
406 problem_t problem = 0;
409 problem = PR_2_MISSING_DOT;
410 else if ((ext2fs_dirent_name_len(dirent) != 1) ||
411 (dirent->name[0] != '.'))
412 problem = PR_2_1ST_NOT_DOT;
413 else if (dirent->name[1] != '\0')
414 problem = PR_2_DOT_NULL_TERM;
416 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
418 if (fix_problem(ctx, problem, pctx)) {
420 rec_len = dirent->rec_len = 12;
422 ext2fs_dirent_set_name_len(dirent, 1);
423 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
424 dirent->name[0] = '.';
425 dirent->name[1] = '\0';
430 if (dirent->inode != ino) {
431 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
437 new_len = rec_len - 12;
440 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
441 nextdir = (struct ext2_dir_entry *)
442 ((char *) dirent + 12);
443 dirent->rec_len = 12;
444 (void) ext2fs_set_rec_len(ctx->fs, new_len,
447 ext2fs_dirent_set_name_len(nextdir, 0);
448 ext2fs_dirent_set_file_type(nextdir,
458 * Make sure the second entry in the directory is '..', and that the
459 * directory entry is sane. We do not check the inode number of '..'
460 * here; this gets done in pass 3.
462 static int check_dotdot(e2fsck_t ctx,
463 struct ext2_dir_entry *dirent,
464 ext2_ino_t ino, struct problem_context *pctx)
466 problem_t problem = 0;
467 unsigned int rec_len;
470 problem = PR_2_MISSING_DOT_DOT;
471 else if ((ext2fs_dirent_name_len(dirent) != 2) ||
472 (dirent->name[0] != '.') ||
473 (dirent->name[1] != '.'))
474 problem = PR_2_2ND_NOT_DOT_DOT;
475 else if (dirent->name[2] != '\0')
476 problem = PR_2_DOT_DOT_NULL_TERM;
478 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len);
480 if (fix_problem(ctx, problem, pctx)) {
482 dirent->rec_len = 12;
484 * Note: we don't have the parent inode just
485 * yet, so we will fill it in with the root
486 * inode. This will get fixed in pass 3.
488 dirent->inode = EXT2_ROOT_INO;
489 ext2fs_dirent_set_name_len(dirent, 2);
490 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
491 dirent->name[0] = '.';
492 dirent->name[1] = '.';
493 dirent->name[2] = '\0';
498 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
499 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
506 * Check to make sure a directory entry doesn't contain any illegal
509 static int check_name(e2fsck_t ctx,
510 struct ext2_dir_entry *dirent,
511 struct problem_context *pctx)
517 for ( i = 0; i < ext2fs_dirent_name_len(dirent); i++) {
518 if (dirent->name[i] != '/' && dirent->name[i] != '\0')
521 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
524 dirent->name[i] = '.';
530 static int encrypted_check_name(e2fsck_t ctx,
531 const struct ext2_dir_entry *dirent,
532 struct problem_context *pctx)
534 if (ext2fs_dirent_name_len(dirent) < EXT4_CRYPTO_BLOCK_SIZE) {
535 if (fix_problem(ctx, PR_2_BAD_ENCRYPTED_NAME, pctx))
537 ext2fs_unmark_valid(ctx->fs);
542 static int encoded_check_name(e2fsck_t ctx,
543 struct ext2_dir_entry *dirent,
544 struct problem_context *pctx)
546 const struct ext2fs_nls_table *tbl = ctx->fs->encoding;
548 int len = ext2fs_dirent_name_len(dirent);
551 ret = ext2fs_check_encoded_name(tbl, dirent->name, len, &pos);
553 fatal_error(ctx, _("NLS is broken."));
555 ret = fix_problem(ctx, PR_2_BAD_ENCODED_NAME, pctx);
557 end = &dirent->name[len];
558 for (; *pos && pos != end; pos++)
563 return (ret || check_name(ctx, dirent, pctx));
567 * Check the directory filetype (if present)
569 static _INLINE_ int check_filetype(e2fsck_t ctx,
570 struct ext2_dir_entry *dirent,
571 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
572 struct problem_context *pctx)
574 int filetype = ext2fs_dirent_file_type(dirent);
575 int should_be = EXT2_FT_UNKNOWN;
576 struct ext2_inode inode;
578 if (!ext2fs_has_feature_filetype(ctx->fs->super)) {
580 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
582 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
586 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dirent->inode)) {
587 should_be = EXT2_FT_DIR;
588 } else if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map,
590 should_be = EXT2_FT_REG_FILE;
591 } else if (ctx->inode_bad_map &&
592 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
596 e2fsck_read_inode(ctx, dirent->inode, &inode,
598 should_be = ext2_file_type(inode.i_mode);
600 if (filetype == should_be)
602 pctx->num = should_be;
604 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
608 ext2fs_dirent_set_file_type(dirent, should_be);
612 static void parse_int_node(ext2_filsys fs,
613 struct ext2_db_entry2 *db,
614 struct check_dir_struct *cd,
615 struct dx_dir_info *dx_dir,
616 char *block_buf, int failed_csum)
618 struct ext2_dx_root_info *root;
619 struct ext2_dx_entry *ent;
620 struct ext2_dx_countlimit *limit;
621 struct dx_dirblock_info *dx_db;
622 int i, expect_limit, count;
624 ext2_dirhash_t min_hash = 0xffffffff;
625 ext2_dirhash_t max_hash = 0;
626 ext2_dirhash_t hash = 0, prev_hash;
629 if (db->blockcnt == 0) {
630 root = (struct ext2_dx_root_info *) (block_buf + 24);
633 printf("Root node dump:\n");
634 printf("\t Reserved zero: %u\n", root->reserved_zero);
635 printf("\t Hash Version: %u\n", root->hash_version);
636 printf("\t Info length: %u\n", root->info_length);
637 printf("\t Indirect levels: %u\n", root->indirect_levels);
638 printf("\t Flags: %x\n", root->unused_flags);
641 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
644 (e2fsck_dir_will_be_rehashed(cd->ctx, cd->pctx.ino) ||
645 fix_problem(cd->ctx, PR_2_HTREE_ROOT_CSUM_INVALID,
649 ent = (struct ext2_dx_entry *) (block_buf+8);
652 (e2fsck_dir_will_be_rehashed(cd->ctx, cd->pctx.ino) ||
653 fix_problem(cd->ctx, PR_2_HTREE_NODE_CSUM_INVALID,
658 limit = (struct ext2_dx_countlimit *) ent;
661 printf("Number of entries (count): %d\n",
662 ext2fs_le16_to_cpu(limit->count));
663 printf("Number of entries (limit): %d\n",
664 ext2fs_le16_to_cpu(limit->limit));
667 count = ext2fs_le16_to_cpu(limit->count);
668 if (ext2fs_has_feature_metadata_csum(fs->super))
669 csum_size = sizeof(struct ext2_dx_tail);
670 expect_limit = (fs->blocksize -
671 (csum_size + ((char *) ent - block_buf))) /
672 sizeof(struct ext2_dx_entry);
673 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
674 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
675 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
678 if (count > expect_limit) {
679 cd->pctx.num = count;
680 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
682 count = expect_limit;
685 for (i=0; i < count; i++) {
687 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
689 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
690 hash, ext2fs_le32_to_cpu(ent[i].block));
692 blk = ext2fs_le32_to_cpu(ent[i].block) & EXT4_DX_BLOCK_MASK;
693 /* Check to make sure the block is valid */
694 if (blk >= dx_dir->numblocks) {
696 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
701 if (hash < prev_hash &&
702 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
704 dx_db = &dx_dir->dx_block[blk];
705 if (dx_db->flags & DX_FLAG_REFERENCED) {
706 dx_db->flags |= DX_FLAG_DUP_REF;
708 dx_db->flags |= DX_FLAG_REFERENCED;
709 dx_db->parent = db->blockcnt;
713 i ? (ext2fs_le32_to_cpu(ent[i-1].block) &
714 EXT4_DX_BLOCK_MASK) : 0;
720 dx_db->node_min_hash = hash;
722 dx_db->node_max_hash =
723 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
725 dx_db->node_max_hash = 0xfffffffe;
726 dx_db->flags |= DX_FLAG_LAST;
729 dx_db->flags |= DX_FLAG_FIRST;
732 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
733 db->blockcnt, min_hash, max_hash);
735 dx_db = &dx_dir->dx_block[db->blockcnt];
736 dx_db->min_hash = min_hash;
737 dx_db->max_hash = max_hash;
741 clear_htree(cd->ctx, cd->pctx.ino);
742 dx_dir->numblocks = 0;
743 e2fsck_rehash_dir_later(cd->ctx, cd->pctx.ino);
747 * Given a busted directory, try to salvage it somehow.
750 static void salvage_directory(ext2_filsys fs,
751 struct ext2_dir_entry *dirent,
752 struct ext2_dir_entry *prev,
753 unsigned int *offset,
754 unsigned int block_len,
757 char *cp = (char *) dirent;
759 unsigned int rec_len, prev_rec_len;
760 unsigned int name_len;
763 * If the space left for the entry is too small to be an entry,
764 * we can't access dirent's fields, so plumb in the values needed
765 * so that the previous entry absorbs this one.
767 if (block_len - *offset < EXT2_DIR_ENTRY_HEADER_LEN) {
769 rec_len = block_len - *offset;
771 name_len = ext2fs_dirent_name_len(dirent);
772 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
774 left = block_len - *offset - rec_len;
777 * Special case of directory entry of size 8: copy what's left
778 * of the directory block up to cover up the invalid hole.
780 if ((left >= ext2fs_dir_rec_len(1, hash_in_dirent)) &&
781 (rec_len == EXT2_DIR_ENTRY_HEADER_LEN)) {
782 memmove(cp, cp+EXT2_DIR_ENTRY_HEADER_LEN, left);
783 memset(cp + left, 0, EXT2_DIR_ENTRY_HEADER_LEN);
787 * If the directory entry overruns the end of the directory
788 * block, and the name is small enough to fit, then adjust the
792 ((int) rec_len + left > EXT2_DIR_ENTRY_HEADER_LEN) &&
793 ((int) ext2fs_dir_rec_len(name_len, hash_in_dirent) <= (int) rec_len + left) &&
794 dirent->inode <= fs->super->s_inodes_count &&
795 strnlen(dirent->name, name_len) == name_len) {
796 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent);
800 * If the record length of the directory entry is a multiple
801 * of four, and not too big, such that it is valid, let the
802 * previous directory entry absorb the invalid one.
804 if (prev && rec_len && (rec_len % 4) == 0 &&
805 (*offset + rec_len <= block_len)) {
806 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
807 prev_rec_len += rec_len;
808 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
813 * Default salvage method --- kill all of the directory
814 * entries for the rest of the block. We will either try to
815 * absorb it into the previous directory entry, or create a
816 * new empty directory entry the rest of the directory block.
819 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len);
820 prev_rec_len += block_len - *offset;
821 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev);
822 *offset = fs->blocksize;
824 rec_len = block_len - *offset;
825 (void) ext2fs_set_rec_len(fs, rec_len, dirent);
826 ext2fs_dirent_set_name_len(dirent, 0);
827 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
832 #define NEXT_DIRENT(d) ((void *)((char *)(d) + (d)->rec_len))
833 static errcode_t insert_dirent_tail(ext2_filsys fs, void *dirbuf)
835 struct ext2_dir_entry *d;
837 struct ext2_dir_entry_tail *t;
840 top = EXT2_DIRENT_TAIL(dirbuf, fs->blocksize);
842 while (d->rec_len && !(d->rec_len & 0x3) && NEXT_DIRENT(d) <= top)
846 unsigned int min_size = EXT2_DIR_REC_LEN(
847 ext2fs_dirent_name_len(dirbuf));
848 if (min_size > (char *)top - (char *)d)
849 return EXT2_ET_DIR_NO_SPACE_FOR_CSUM;
850 d->rec_len = (char *)top - (char *)d;
853 t = (struct ext2_dir_entry_tail *)top;
854 if (t->det_reserved_zero1 ||
855 t->det_rec_len != sizeof(struct ext2_dir_entry_tail) ||
856 t->det_reserved_name_len != EXT2_DIR_NAME_LEN_CSUM)
857 ext2fs_initialize_dirent_tail(fs, t);
863 static errcode_t fix_inline_dir_size(e2fsck_t ctx, ext2_ino_t ino,
864 size_t *inline_data_size,
865 struct problem_context *pctx,
868 ext2_filsys fs = ctx->fs;
869 struct ext2_inode inode;
870 size_t new_size, old_size;
873 old_size = *inline_data_size;
875 * If there's not enough bytes to start the "second" dir block
876 * (in the EA space) then truncate everything to the first block.
878 if (old_size > EXT4_MIN_INLINE_DATA_SIZE &&
879 old_size < EXT4_MIN_INLINE_DATA_SIZE +
880 EXT2_DIR_REC_LEN(1)) {
881 old_size = EXT4_MIN_INLINE_DATA_SIZE;
884 /* Increase to the next four-byte boundary for salvaging */
885 new_size = old_size + (4 - (old_size & 3));
886 memset(buf + old_size, 0, new_size - old_size);
887 retval = ext2fs_inline_data_set(fs, ino, 0, buf, new_size);
888 if (retval == EXT2_ET_INLINE_DATA_NO_SPACE) {
889 /* Or we can't, so truncate. */
891 retval = ext2fs_inline_data_set(fs, ino, 0, buf, new_size);
893 if (fix_problem(ctx, PR_2_FIX_INLINE_DIR_FAILED,
901 if (fix_problem(ctx, PR_2_FIX_INLINE_DIR_FAILED,
910 retval = ext2fs_read_inode(fs, ino, &inode);
914 retval = ext2fs_inode_size_set(fs, &inode, new_size);
918 inode.i_flags &= ~EXT4_INLINE_DATA_FL;
919 retval = ext2fs_write_inode(fs, ino, &inode);
922 *inline_data_size = new_size;
928 /* Return true if this type of file needs encryption */
929 static int needs_encryption(e2fsck_t ctx, const struct ext2_dir_entry *dirent)
931 int filetype = ext2fs_dirent_file_type(dirent);
932 ext2_ino_t ino = dirent->inode;
933 struct ext2_inode inode;
935 if (filetype != EXT2_FT_UNKNOWN)
936 return filetype == EXT2_FT_REG_FILE ||
937 filetype == EXT2_FT_DIR ||
938 filetype == EXT2_FT_SYMLINK;
940 if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map, ino) ||
941 ext2fs_test_inode_bitmap2(ctx->inode_dir_map, ino))
944 e2fsck_read_inode(ctx, ino, &inode, "check_encryption_policy");
945 return LINUX_S_ISREG(inode.i_mode) ||
946 LINUX_S_ISDIR(inode.i_mode) ||
947 LINUX_S_ISLNK(inode.i_mode);
951 * All regular files, directories, and symlinks in encrypted directories must be
952 * encrypted using the same encryption policy as their directory.
954 * Returns 1 if the dirent should be cleared, otherwise 0.
956 static int check_encryption_policy(e2fsck_t ctx,
957 const struct ext2_dir_entry *dirent,
958 __u32 dir_encpolicy_id,
959 struct problem_context *pctx)
961 __u32 file_encpolicy_id = find_encryption_policy(ctx, dirent->inode);
963 /* Same policy or both UNRECOGNIZED_ENCRYPTION_POLICY? */
964 if (file_encpolicy_id == dir_encpolicy_id)
967 if (file_encpolicy_id == NO_ENCRYPTION_POLICY) {
968 if (!needs_encryption(ctx, dirent))
970 return fix_problem(ctx, PR_2_UNENCRYPTED_FILE, pctx);
973 return fix_problem(ctx, PR_2_INCONSISTENT_ENCRYPTION_POLICY, pctx);
977 * Check an encrypted directory entry.
979 * Returns 1 if the dirent should be cleared, otherwise 0.
981 static int check_encrypted_dirent(e2fsck_t ctx,
982 const struct ext2_dir_entry *dirent,
983 __u32 dir_encpolicy_id,
984 struct problem_context *pctx)
986 if (encrypted_check_name(ctx, dirent, pctx))
988 if (check_encryption_policy(ctx, dirent, dir_encpolicy_id, pctx))
993 static int check_dir_block2(ext2_filsys fs,
994 struct ext2_db_entry2 *db,
998 struct check_dir_struct *cd = priv_data;
1000 if (cd->ra_entries && cd->list_offset >= cd->next_ra_off) {
1001 err = e2fsck_readahead_dblist(fs,
1002 E2FSCK_RA_DBLIST_IGNORE_BLOCKCNT,
1004 cd->list_offset + cd->ra_entries / 8,
1008 cd->next_ra_off = cd->list_offset + (cd->ra_entries * 7 / 8);
1011 err = check_dir_block(fs, db, priv_data);
1016 static int check_dir_block(ext2_filsys fs,
1017 struct ext2_db_entry2 *db,
1020 struct dx_dir_info *dx_dir;
1021 struct dx_dirblock_info *dx_db = 0;
1022 struct ext2_dir_entry *dirent, *prev, dot, dotdot;
1023 ext2_dirhash_t hash;
1024 unsigned int offset = 0;
1025 int dir_modified = 0;
1027 unsigned int rec_len;
1028 blk64_t block_nr = db->blk;
1029 ext2_ino_t ino = db->ino;
1030 ext2_ino_t subdir_parent;
1032 struct check_dir_struct *cd;
1036 struct ext2_dx_root_info *root;
1037 struct ext2_dx_countlimit *limit;
1038 static dict_t de_dict;
1039 struct problem_context pctx;
1042 int dx_csum_size = 0, de_csum_size = 0;
1043 int failed_csum = 0;
1045 size_t inline_data_size = 0;
1047 __u32 dir_encpolicy_id = NO_ENCRYPTION_POLICY;
1048 int hash_in_dirent = 0;
1050 size_t max_block_size;
1052 static char *eop_read_dirblock = NULL;
1055 cd = (struct check_dir_struct *) priv_data;
1056 ibuf = buf = cd->buf;
1059 /* We only want filename encoding verification on strict
1060 * mode or if explicitly requested by user. */
1061 if (ext2fs_test_inode_bitmap2(ctx->inode_casefold_map, ino) &&
1062 ((ctx->fs->super->s_encoding_flags & EXT4_ENC_STRICT_MODE_FL) ||
1063 (ctx->options & E2F_OPT_CHECK_ENCODING)))
1066 if (ctx->flags & E2F_FLAG_RUN_RETURN)
1067 return DIRENT_ABORT;
1069 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
1070 return DIRENT_ABORT;
1072 if (ext2fs_has_feature_metadata_csum(fs->super)) {
1073 dx_csum_size = sizeof(struct ext2_dx_tail);
1074 de_csum_size = sizeof(struct ext2_dir_entry_tail);
1077 if (ext2fs_has_feature_filetype(fs->super))
1078 filetype = EXT2_FT_DIR << 8;
1081 * Make sure the inode is still in use (could have been
1082 * deleted in the duplicate/bad blocks pass.
1084 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino)))
1088 cd->pctx.blk = block_nr;
1089 cd->pctx.blkcount = db->blockcnt;
1091 cd->pctx.dirent = 0;
1094 if (ext2fs_has_feature_inline_data(fs->super)) {
1097 ec = ext2fs_inline_data_size(fs, ino, &inline_data_size);
1098 if (ec && ec != EXT2_ET_NO_INLINE_DATA)
1099 return DIRENT_ABORT;
1102 /* This will allow (at some point in the future) to punch out empty
1103 * directory blocks and reduce the space used by a directory that grows
1104 * very large and then the files are deleted. For now, all that is
1105 * needed is to avoid e2fsck filling in these holes as part of
1107 if (db->blk == 0 && ext2fs_has_feature_largedir(fs->super) &&
1108 !ext2fs_has_feature_inline_data(fs->super))
1111 if (db->blk == 0 && !inline_data_size) {
1112 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
1122 if (ctx->dirs_to_hash &&
1123 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
1127 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
1131 if (!eop_read_dirblock)
1132 eop_read_dirblock = (char *) _("reading directory block");
1133 ehandler_operation(eop_read_dirblock);
1134 if (inline_data_size) {
1135 memset(buf, 0, fs->blocksize - inline_data_size);
1136 cd->pctx.errcode = ext2fs_inline_data_get(fs, ino, 0, buf, 0);
1137 if (cd->pctx.errcode)
1138 goto inline_read_fail;
1139 #ifdef WORDS_BIGENDIAN
1141 goto skip_first_read_swab;
1142 *((__u32 *)buf) = ext2fs_le32_to_cpu(*((__u32 *)buf));
1143 cd->pctx.errcode = ext2fs_dirent_swab_in2(fs,
1144 buf + EXT4_INLINE_DATA_DOTDOT_SIZE,
1145 EXT4_MIN_INLINE_DATA_SIZE - EXT4_INLINE_DATA_DOTDOT_SIZE,
1147 if (cd->pctx.errcode)
1148 goto inline_read_fail;
1149 skip_first_read_swab:
1150 if (inline_data_size <= EXT4_MIN_INLINE_DATA_SIZE ||
1152 goto inline_read_fail;
1153 cd->pctx.errcode = ext2fs_dirent_swab_in2(fs,
1154 buf + EXT4_MIN_INLINE_DATA_SIZE,
1155 inline_data_size - EXT4_MIN_INLINE_DATA_SIZE,
1159 cd->pctx.errcode = ext2fs_read_dir_block4(fs, block_nr,
1163 pctx.num = inline_data_size;
1164 if (((inline_data_size & 3) ||
1165 (inline_data_size > EXT4_MIN_INLINE_DATA_SIZE &&
1166 inline_data_size < EXT4_MIN_INLINE_DATA_SIZE +
1167 EXT2_DIR_REC_LEN(1))) &&
1168 fix_problem(ctx, PR_2_BAD_INLINE_DIR_SIZE, &pctx)) {
1169 errcode_t err = fix_inline_dir_size(ctx, ino,
1170 &inline_data_size, &pctx,
1173 return DIRENT_ABORT;
1176 ehandler_operation(0);
1177 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
1178 cd->pctx.errcode = 0; /* We'll handle this ourselves */
1179 else if (cd->pctx.errcode == EXT2_ET_DIR_CSUM_INVALID) {
1180 cd->pctx.errcode = 0; /* We'll handle this ourselves */
1183 if (cd->pctx.errcode) {
1185 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
1186 ctx->flags |= E2F_FLAG_ABORT;
1187 return DIRENT_ABORT;
1189 ext2fs_new_dir_block(fs, db->blockcnt == 0 ? ino : 0,
1190 EXT2_ROOT_INO, &buf2);
1191 memcpy(buf, buf2, fs->blocksize);
1192 ext2fs_free_mem(&buf2);
1194 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
1195 if (dx_dir && dx_dir->numblocks) {
1196 if (db->blockcnt >= dx_dir->numblocks) {
1198 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
1200 clear_htree(ctx, ino);
1201 dx_dir->numblocks = 0;
1205 fatal_error(ctx, _("Can not continue."));
1207 dx_db = &dx_dir->dx_block[db->blockcnt];
1208 dx_db->type = DX_DIRBLOCK_LEAF;
1209 dx_db->phys = block_nr;
1210 dx_db->min_hash = ~0;
1211 dx_db->max_hash = 0;
1213 dirent = (struct ext2_dir_entry *) buf;
1214 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1215 limit = (struct ext2_dx_countlimit *) (buf+8);
1216 if (db->blockcnt == 0) {
1217 root = (struct ext2_dx_root_info *) (buf + 24);
1218 dx_db->type = DX_DIRBLOCK_ROOT;
1219 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
1221 /* large_dir was set in pass1 if large dirs were found,
1222 * so ext2_dir_htree_level() should now be correct */
1223 if ((root->reserved_zero ||
1224 root->info_length < 8 ||
1225 root->indirect_levels >=
1226 ext2_dir_htree_level(fs)) &&
1227 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
1228 clear_htree(ctx, ino);
1229 dx_dir->numblocks = 0;
1232 dx_dir->hashversion = root->hash_version;
1233 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
1234 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
1235 dx_dir->hashversion += 3;
1236 dx_dir->depth = root->indirect_levels + 1;
1237 } else if ((dirent->inode == 0) &&
1238 (rec_len == fs->blocksize) &&
1239 (ext2fs_dirent_name_len(dirent) == 0) &&
1240 (ext2fs_le16_to_cpu(limit->limit) ==
1241 ((fs->blocksize - (8 + dx_csum_size)) /
1242 sizeof(struct ext2_dx_entry)))) {
1243 dx_db->type = DX_DIRBLOCK_NODE;
1245 is_leaf = dx_db ? (dx_db->type == DX_DIRBLOCK_LEAF) : 0;
1249 /* Leaf node with no space for csum? Rebuild dirs in pass 3A. */
1250 if (is_leaf && !inline_data_size && failed_csum &&
1251 !ext2fs_dirent_has_tail(fs, (struct ext2_dir_entry *)buf)) {
1253 if (e2fsck_dir_will_be_rehashed(ctx, ino)) {
1257 if (!fix_problem(cd->ctx, PR_2_LEAF_NODE_MISSING_CSUM,
1260 e2fsck_rehash_dir_later(ctx, ino);
1264 /* htree nodes don't use fake dirents to store checksums */
1269 if (inline_data_size) {
1271 buf += EXT4_MIN_INLINE_DATA_SIZE;
1272 max_block_size = inline_data_size - EXT4_MIN_INLINE_DATA_SIZE;
1273 /* Zero-length second block, just exit */
1274 if (max_block_size == 0)
1277 max_block_size = EXT4_MIN_INLINE_DATA_SIZE;
1280 max_block_size = fs->blocksize - de_csum_size;
1282 dir_encpolicy_id = find_encryption_policy(ctx, ino);
1285 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cf_cmp);
1286 dict_set_cmp_context(&de_dict, (void *)ctx->fs->encoding);
1288 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
1290 if (ctx->casefolded_dirs)
1291 casefolded = ext2fs_u32_list_test(ctx->casefolded_dirs, ino);
1292 hash_in_dirent = (casefolded &&
1293 (dir_encpolicy_id != NO_ENCRYPTION_POLICY));
1298 ext2_ino_t first_unused_inode;
1299 unsigned int name_len;
1300 /* csum entry is not checked here, so don't worry about it */
1301 int extended = (dot_state > 1) && hash_in_dirent;
1302 int min_dir_len = ext2fs_dir_rec_len(1, extended);
1305 if (!inline_data_size || dot_state > 1) {
1306 dirent = (struct ext2_dir_entry *) (buf + offset);
1308 * If there's not even space for the entry header,
1309 * force salvaging this dir.
1311 if (max_block_size - offset < EXT2_DIR_ENTRY_HEADER_LEN)
1312 rec_len = ext2fs_dir_rec_len(1, extended);
1314 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1315 cd->pctx.dirent = dirent;
1316 cd->pctx.num = offset;
1317 if ((offset + rec_len > max_block_size) ||
1318 (rec_len < min_dir_len) ||
1319 ((rec_len % 4) != 0) ||
1320 ((ext2fs_dir_rec_len(ext2fs_dirent_name_len(dirent),
1321 extended)) > rec_len)) {
1322 if (fix_problem(ctx, PR_2_DIR_CORRUPTED,
1324 #ifdef WORDS_BIGENDIAN
1326 * On big-endian systems, if the dirent
1327 * swap routine finds a rec_len that it
1328 * doesn't like, it continues
1329 * processing the block as if rec_len
1330 * == EXT2_DIR_ENTRY_HEADER_LEN. This means that the name
1331 * field gets byte swapped, which means
1332 * that salvage will not detect the
1333 * correct name length (unless the name
1334 * has a length that's an exact
1335 * multiple of four bytes), and it'll
1336 * discard the entry (unnecessarily)
1337 * and the rest of the dirent block.
1338 * Therefore, swap the rest of the
1339 * block back to disk order, run
1340 * salvage, and re-swap anything after
1341 * the salvaged dirent.
1343 int need_reswab = 0;
1344 if (rec_len < EXT2_DIR_ENTRY_HEADER_LEN || rec_len % 4) {
1346 ext2fs_dirent_swab_in2(fs,
1347 ((char *)dirent) + EXT2_DIR_ENTRY_HEADER_LEN,
1348 max_block_size - offset - EXT2_DIR_ENTRY_HEADER_LEN,
1352 salvage_directory(fs, dirent, prev,
1356 #ifdef WORDS_BIGENDIAN
1358 (void) ext2fs_get_rec_len(fs,
1360 ext2fs_dirent_swab_in2(fs,
1361 ((char *)dirent) + offset + rec_len,
1362 max_block_size - offset - rec_len,
1369 goto abort_free_dict;
1372 if (dot_state == 0) {
1373 memset(&dot, 0, sizeof(dot));
1375 dirent->inode = ino;
1376 dirent->rec_len = EXT2_DIR_REC_LEN(1);
1377 dirent->name_len = 1 | filetype;
1378 dirent->name[0] = '.';
1379 } else if (dot_state == 1) {
1380 memset(&dotdot, 0, sizeof(dotdot));
1383 ((struct ext2_dir_entry *)buf)->inode;
1384 dirent->rec_len = EXT2_DIR_REC_LEN(2);
1385 dirent->name_len = 2 | filetype;
1386 dirent->name[0] = '.';
1387 dirent->name[1] = '.';
1389 fatal_error(ctx, _("Can not continue."));
1391 cd->pctx.dirent = dirent;
1392 cd->pctx.num = offset;
1395 if (dot_state == 0) {
1396 if (check_dot(ctx, dirent, ino, &cd->pctx))
1398 } else if (dot_state == 1) {
1399 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
1401 goto abort_free_dict;
1404 } else if (dirent->inode == ino) {
1405 problem = PR_2_LINK_DOT;
1406 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
1416 * Make sure the inode listed is a legal one.
1418 name_len = ext2fs_dirent_name_len(dirent);
1419 if (((dirent->inode != EXT2_ROOT_INO) &&
1420 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
1421 (dirent->inode > fs->super->s_inodes_count)) {
1422 problem = PR_2_BAD_INO;
1423 } else if (ctx->inode_bb_map &&
1424 (ext2fs_test_inode_bitmap2(ctx->inode_bb_map,
1427 * If the inode is in a bad block, offer to
1430 problem = PR_2_BB_INODE;
1431 } else if ((dot_state > 1) && (name_len == 1) &&
1432 (dirent->name[0] == '.')) {
1434 * If there's a '.' entry in anything other
1435 * than the first directory entry, it's a
1436 * duplicate entry that should be removed.
1438 problem = PR_2_DUP_DOT;
1439 } else if ((dot_state > 1) && (name_len == 2) &&
1440 (dirent->name[0] == '.') &&
1441 (dirent->name[1] == '.')) {
1443 * If there's a '..' entry in anything other
1444 * than the second directory entry, it's a
1445 * duplicate entry that should be removed.
1447 problem = PR_2_DUP_DOT_DOT;
1448 } else if ((dot_state > 1) &&
1449 (dirent->inode == EXT2_ROOT_INO)) {
1451 * Don't allow links to the root directory.
1452 * We check this specially to make sure we
1453 * catch this error case even if the root
1454 * directory hasn't been created yet.
1456 problem = PR_2_LINK_ROOT;
1457 } else if ((dot_state > 1) && (name_len == 0)) {
1459 * Don't allow zero-length directory names.
1461 problem = PR_2_NULL_NAME;
1465 if (fix_problem(ctx, problem, &cd->pctx)) {
1470 ext2fs_unmark_valid(fs);
1471 if (problem == PR_2_BAD_INO)
1477 * If the inode was marked as having bad fields in
1478 * pass1, process it and offer to fix/clear it.
1479 * (We wait until now so that we can display the
1480 * pathname to the user.)
1482 if (ctx->inode_bad_map &&
1483 ext2fs_test_inode_bitmap2(ctx->inode_bad_map,
1485 if (e2fsck_process_bad_inode(ctx, ino,
1487 buf + fs->blocksize)) {
1492 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1493 return DIRENT_ABORT;
1496 group = ext2fs_group_of_ino(fs, dirent->inode);
1497 first_unused_inode = group * fs->super->s_inodes_per_group +
1498 1 + fs->super->s_inodes_per_group -
1499 ext2fs_bg_itable_unused(fs, group);
1500 cd->pctx.group = group;
1503 * Check if the inode was missed out because
1504 * _INODE_UNINIT flag was set or bg_itable_unused was
1505 * incorrect. If so, clear the _INODE_UNINIT flag and
1506 * restart e2fsck. In the future it would be nice if
1507 * we could call a function in pass1.c that checks the
1508 * newly visible inodes.
1510 if (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)) {
1511 pctx.num = dirent->inode;
1512 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
1514 ext2fs_bg_flags_clear(fs, group,
1515 EXT2_BG_INODE_UNINIT);
1516 ext2fs_mark_super_dirty(fs);
1517 ctx->flags |= E2F_FLAG_RESTART_LATER;
1519 ext2fs_unmark_valid(fs);
1520 if (problem == PR_2_BAD_INO)
1523 } else if (dirent->inode >= first_unused_inode) {
1524 pctx.num = dirent->inode;
1525 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
1526 ext2fs_bg_itable_unused_set(fs, group, 0);
1527 ext2fs_mark_super_dirty(fs);
1528 ctx->flags |= E2F_FLAG_RESTART_LATER;
1530 ext2fs_unmark_valid(fs);
1531 if (problem == PR_2_BAD_INO)
1537 * Offer to clear unused inodes; if we are going to be
1538 * restarting the scan due to bg_itable_unused being
1539 * wrong, then don't clear any inodes to avoid zapping
1540 * inodes that were skipped during pass1 due to an
1541 * incorrect bg_itable_unused; we'll get any real
1542 * problems after we restart.
1544 if (!(ctx->flags & E2F_FLAG_RESTART_LATER) &&
1545 !(ext2fs_test_inode_bitmap2(ctx->inode_used_map,
1547 problem = PR_2_UNUSED_INODE;
1550 if (fix_problem(ctx, problem, &cd->pctx)) {
1555 ext2fs_unmark_valid(fs);
1556 if (problem == PR_2_BAD_INO)
1561 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1564 if (dir_encpolicy_id != NO_ENCRYPTION_POLICY) {
1565 /* Encrypted directory */
1566 if (dot_state > 1 &&
1567 check_encrypted_dirent(ctx, dirent,
1574 } else if (cf_dir) {
1575 /* Casefolded directory */
1576 if (encoded_check_name(ctx, dirent, &cd->pctx))
1579 /* Unencrypted and uncasefolded directory */
1580 if (check_name(ctx, dirent, &cd->pctx))
1585 if (dx_dir->casefolded_hash)
1586 hash_flags = EXT4_CASEFOLD_FL;
1588 if (dx_dir->hashversion == EXT2_HASH_SIPHASH) {
1590 hash = EXT2_DIRENT_HASH(dirent);
1592 ext2fs_dirhash2(dx_dir->hashversion,
1594 ext2fs_dirent_name_len(dirent),
1595 fs->encoding, hash_flags,
1596 fs->super->s_hash_seed,
1599 if (hash < dx_db->min_hash)
1600 dx_db->min_hash = hash;
1601 if (hash > dx_db->max_hash)
1602 dx_db->max_hash = hash;
1606 * If this is a directory, then mark its parent in its
1607 * dir_info structure. If the parent field is already
1608 * filled in, then this directory has more than one
1609 * hard link. We assume the first link is correct,
1610 * and ask the user if he/she wants to clear this one.
1612 if ((dot_state > 1) &&
1613 (ext2fs_test_inode_bitmap2(ctx->inode_dir_map,
1615 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1617 cd->pctx.ino = dirent->inode;
1618 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1619 goto abort_free_dict;
1621 if (subdir_parent) {
1622 cd->pctx.ino2 = subdir_parent;
1623 if (fix_problem(ctx, PR_2_LINK_DIR,
1631 (void) e2fsck_dir_info_set_parent(ctx,
1632 dirent->inode, ino);
1638 } else if (dict_lookup(&de_dict, dirent)) {
1639 clear_problem_context(&pctx);
1641 pctx.dirent = dirent;
1642 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1643 e2fsck_rehash_dir_later(ctx, ino);
1646 dict_alloc_insert(&de_dict, dirent, dirent);
1648 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1651 ctx->fs_links_count++;
1652 ctx->fs_total_count++;
1656 (void) ext2fs_get_rec_len(fs, dirent, &rec_len);
1657 if (!inline_data_size || dot_state > 1) {
1660 if (dot_state == 1) {
1663 * If we get here, we're checking an inline
1664 * directory and we've just checked a (fake)
1665 * dotdot entry that we created on the stack.
1666 * Therefore set 'prev' to NULL so that if we
1667 * call salvage_directory on the next entry,
1668 * it won't try to absorb the next entry into
1669 * the on-stack dotdot entry.
1675 } while (offset < max_block_size);
1681 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1682 db->blockcnt, dx_db->type,
1683 dx_db->min_hash, dx_db->max_hash);
1685 cd->pctx.dir = cd->pctx.ino;
1686 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1687 (dx_db->type == DX_DIRBLOCK_NODE))
1688 parse_int_node(fs, db, cd, dx_dir, buf, failed_csum);
1691 if (offset != max_block_size) {
1692 cd->pctx.num = rec_len + offset - max_block_size;
1693 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1694 dirent->rec_len = cd->pctx.num;
1699 int flags, will_rehash;
1700 /* leaf block with no tail? Rehash dirs later. */
1701 if (ext2fs_has_feature_metadata_csum(fs->super) &&
1703 !inline_data_size &&
1704 !ext2fs_dirent_has_tail(fs, (struct ext2_dir_entry *)buf)) {
1705 if (insert_dirent_tail(fs, buf) == 0)
1707 e2fsck_rehash_dir_later(ctx, ino);
1711 will_rehash = e2fsck_dir_will_be_rehashed(ctx, ino);
1713 flags = ctx->fs->flags;
1714 ctx->fs->flags |= EXT2_FLAG_IGNORE_CSUM_ERRORS;
1716 if (inline_data_size) {
1718 #ifdef WORDS_BIGENDIAN
1720 goto skip_first_write_swab;
1721 *((__u32 *)buf) = ext2fs_le32_to_cpu(*((__u32 *)buf));
1722 cd->pctx.errcode = ext2fs_dirent_swab_out2(fs,
1723 buf + EXT4_INLINE_DATA_DOTDOT_SIZE,
1724 EXT4_MIN_INLINE_DATA_SIZE -
1725 EXT4_INLINE_DATA_DOTDOT_SIZE,
1727 if (cd->pctx.errcode)
1728 goto skip_second_write_swab;
1729 skip_first_write_swab:
1730 if (inline_data_size <= EXT4_MIN_INLINE_DATA_SIZE ||
1732 goto skip_second_write_swab;
1733 cd->pctx.errcode = ext2fs_dirent_swab_out2(fs,
1734 buf + EXT4_MIN_INLINE_DATA_SIZE,
1736 EXT4_MIN_INLINE_DATA_SIZE,
1738 skip_second_write_swab:
1739 if (cd->pctx.errcode &&
1740 !fix_problem(ctx, PR_2_WRITE_DIRBLOCK, &cd->pctx))
1741 goto abort_free_dict;
1744 ext2fs_inline_data_set(fs, ino, 0, buf,
1747 cd->pctx.errcode = ext2fs_write_dir_block4(fs, block_nr,
1750 ctx->fs->flags = (flags &
1751 EXT2_FLAG_IGNORE_CSUM_ERRORS) |
1753 ~EXT2_FLAG_IGNORE_CSUM_ERRORS);
1754 if (cd->pctx.errcode) {
1755 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1757 goto abort_free_dict;
1759 ext2fs_mark_changed(fs);
1760 } else if (is_leaf && failed_csum && !dir_modified) {
1762 * If a leaf node that fails csum makes it this far without
1763 * alteration, ask the user if the checksum should be fixed.
1765 if (fix_problem(ctx, PR_2_LEAF_NODE_ONLY_CSUM_INVALID,
1769 dict_free_nodes(&de_dict);
1772 ctx->flags |= E2F_FLAG_ABORT;
1773 dict_free_nodes(&de_dict);
1774 return DIRENT_ABORT;
1780 blk64_t last_cluster;
1784 * This function is called to deallocate a block, and is an interator
1785 * functioned called by deallocate inode via ext2fs_iterate_block().
1787 static int deallocate_inode_block(ext2_filsys fs,
1789 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1790 blk64_t ref_block EXT2FS_ATTR((unused)),
1791 int ref_offset EXT2FS_ATTR((unused)),
1794 struct del_block *p = priv_data;
1795 blk64_t cluster = EXT2FS_B2C(fs, *block_nr);
1800 if (cluster == p->last_cluster)
1803 p->last_cluster = cluster;
1804 if ((*block_nr < fs->super->s_first_data_block) ||
1805 (*block_nr >= ext2fs_blocks_count(fs->super)))
1808 ext2fs_block_alloc_stats2(fs, *block_nr, -1);
1814 * This function deallocates an inode
1816 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1818 ext2_filsys fs = ctx->fs;
1819 struct ext2_inode inode;
1820 struct problem_context pctx;
1822 struct del_block del_block;
1824 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1825 clear_problem_context(&pctx);
1829 * Fix up the bitmaps...
1831 e2fsck_read_bitmaps(ctx);
1832 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1834 if (ext2fs_file_acl_block(fs, &inode) &&
1835 ext2fs_has_feature_xattr(fs->super)) {
1836 pctx.errcode = ext2fs_adjust_ea_refcount3(fs,
1837 ext2fs_file_acl_block(fs, &inode),
1838 block_buf, -1, &count, ino);
1839 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1844 pctx.blk = ext2fs_file_acl_block(fs, &inode);
1845 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1846 ctx->flags |= E2F_FLAG_ABORT;
1850 ext2fs_block_alloc_stats2(fs,
1851 ext2fs_file_acl_block(fs, &inode), -1);
1853 ext2fs_file_acl_block_set(fs, &inode, 0);
1856 if (!ext2fs_inode_has_valid_blocks2(fs, &inode))
1859 /* Inline data inodes don't have blocks to iterate */
1860 if (inode.i_flags & EXT4_INLINE_DATA_FL)
1863 if (ext2fs_needs_large_file_feature(EXT2_I_SIZE(&inode))) {
1864 if (LINUX_S_ISREG(inode.i_mode))
1866 else if (LINUX_S_ISDIR(inode.i_mode))
1870 del_block.ctx = ctx;
1872 del_block.last_cluster = 0;
1873 pctx.errcode = ext2fs_block_iterate3(fs, ino, 0, block_buf,
1874 deallocate_inode_block,
1877 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1878 ctx->flags |= E2F_FLAG_ABORT;
1882 /* Inode may have changed by block_iterate, so reread it */
1883 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1884 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1888 * This function clears the htree flag on an inode
1890 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1892 struct ext2_inode inode;
1894 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1895 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1896 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1897 if (ctx->dirs_to_hash)
1898 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1902 int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1903 ext2_ino_t ino, char *buf)
1905 ext2_filsys fs = ctx->fs;
1906 struct ext2_inode inode;
1907 int inode_modified = 0;
1909 unsigned char *frag, *fsize;
1910 struct problem_context pctx;
1911 problem_t problem = 0;
1913 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1915 clear_problem_context(&pctx);
1918 pctx.inode = &inode;
1920 if (ext2fs_file_acl_block(fs, &inode) &&
1921 !ext2fs_has_feature_xattr(fs->super)) {
1922 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1923 ext2fs_file_acl_block_set(fs, &inode, 0);
1929 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1930 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1931 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1932 !(LINUX_S_ISSOCK(inode.i_mode)))
1933 problem = PR_2_BAD_MODE;
1934 else if (LINUX_S_ISCHR(inode.i_mode)
1935 && !e2fsck_pass1_check_device_inode(fs, &inode))
1936 problem = PR_2_BAD_CHAR_DEV;
1937 else if (LINUX_S_ISBLK(inode.i_mode)
1938 && !e2fsck_pass1_check_device_inode(fs, &inode))
1939 problem = PR_2_BAD_BLOCK_DEV;
1940 else if (LINUX_S_ISFIFO(inode.i_mode)
1941 && !e2fsck_pass1_check_device_inode(fs, &inode))
1942 problem = PR_2_BAD_FIFO;
1943 else if (LINUX_S_ISSOCK(inode.i_mode)
1944 && !e2fsck_pass1_check_device_inode(fs, &inode))
1945 problem = PR_2_BAD_SOCKET;
1946 else if (LINUX_S_ISLNK(inode.i_mode)
1947 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1948 problem = PR_2_INVALID_SYMLINK;
1952 if (fix_problem(ctx, problem, &pctx)) {
1953 deallocate_inode(ctx, ino, 0);
1954 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1962 if (inode.i_faddr) {
1963 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1970 switch (fs->super->s_creator_os) {
1972 frag = &inode.osd2.hurd2.h_i_frag;
1973 fsize = &inode.osd2.hurd2.h_i_fsize;
1978 if (frag && *frag) {
1980 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1987 if (fsize && *fsize) {
1989 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1997 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1998 !ext2fs_has_feature_huge_file(fs->super) &&
1999 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
2000 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
2001 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
2002 inode.osd2.linux2.l_i_blocks_hi = 0;
2007 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
2008 !ext2fs_has_feature_64bit(fs->super) &&
2009 inode.osd2.linux2.l_i_file_acl_high != 0) {
2010 pctx.num = inode.osd2.linux2.l_i_file_acl_high;
2011 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) {
2012 inode.osd2.linux2.l_i_file_acl_high = 0;
2018 if (ext2fs_file_acl_block(fs, &inode) &&
2019 ((ext2fs_file_acl_block(fs, &inode) < fs->super->s_first_data_block) ||
2020 (ext2fs_file_acl_block(fs, &inode) >= ext2fs_blocks_count(fs->super)))) {
2021 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
2022 ext2fs_file_acl_block_set(fs, &inode, 0);
2027 if (inode.i_size_high && !ext2fs_has_feature_largedir(fs->super) &&
2028 inode.i_blocks < 1ULL << (29 - EXT2_BLOCK_SIZE_BITS(fs->super)) &&
2029 LINUX_S_ISDIR(inode.i_mode)) {
2030 if (fix_problem(ctx, PR_2_DIR_SIZE_HIGH_ZERO, &pctx)) {
2031 inode.i_size_high = 0;
2038 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
2039 if (!not_fixed && ctx->inode_bad_map)
2040 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino);
2045 * allocate_dir_block --- this function allocates a new directory
2046 * block for a particular inode; this is done if a directory has
2047 * a "hole" in it, or if a directory has a illegal block number
2048 * that was zeroed out and now needs to be replaced.
2050 static int allocate_dir_block(e2fsck_t ctx,
2051 struct ext2_db_entry2 *db,
2052 char *buf EXT2FS_ATTR((unused)),
2053 struct problem_context *pctx)
2055 ext2_filsys fs = ctx->fs;
2058 struct ext2_inode inode;
2060 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
2064 * Read the inode and block bitmaps in; we'll be messing with
2067 e2fsck_read_bitmaps(ctx);
2070 * First, find a free block
2072 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
2073 pctx->errcode = ext2fs_map_cluster_block(fs, db->ino, &inode,
2074 db->blockcnt, &blk);
2075 if (pctx->errcode || blk == 0) {
2076 blk = ext2fs_find_inode_goal(fs, db->ino, &inode, db->blockcnt);
2077 pctx->errcode = ext2fs_new_block2(fs, blk,
2078 ctx->block_found_map, &blk);
2079 if (pctx->errcode) {
2080 pctx->str = "ext2fs_new_block";
2081 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
2085 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
2086 ext2fs_mark_block_bitmap2(fs->block_map, blk);
2087 ext2fs_mark_bb_dirty(fs);
2090 * Now let's create the actual data block for the inode
2093 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
2095 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
2096 EXT2_ROOT_INO, &block);
2098 if (pctx->errcode) {
2099 pctx->str = "ext2fs_new_dir_block";
2100 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
2104 pctx->errcode = ext2fs_write_dir_block4(fs, blk, block, 0, db->ino);
2105 ext2fs_free_mem(&block);
2106 if (pctx->errcode) {
2107 pctx->str = "ext2fs_write_dir_block";
2108 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
2113 * Update the inode block count
2115 ext2fs_iblk_add_blocks(fs, &inode, 1);
2116 if (EXT2_I_SIZE(&inode) < ((__u64) db->blockcnt+1) * fs->blocksize) {
2117 pctx->errcode = ext2fs_inode_size_set(fs, &inode,
2118 (db->blockcnt+1) * fs->blocksize);
2119 if (pctx->errcode) {
2120 pctx->str = "ext2fs_inode_size_set";
2121 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
2125 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
2128 * Finally, update the block pointers for the inode
2131 pctx->errcode = ext2fs_bmap2(fs, db->ino, &inode, 0, BMAP_SET,
2132 db->blockcnt, 0, &blk);
2133 if (pctx->errcode) {
2134 pctx->str = "ext2fs_block_iterate";
2135 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);