pass2.c revision 48f23054bb8ad0506c0baa9f06ba182acc2aa88b
1/* 2 * pass2.c --- check directory structure 3 * 4 * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o 5 * 6 * %Begin-Header% 7 * This file may be redistributed under the terms of the GNU Public 8 * License. 9 * %End-Header% 10 * 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: 14 * 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 21 * legal bounds. 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 '..'. 26 * 27 * To minimize disk seek time, the directory blocks are processed in 28 * sorted order of block numbers. 29 * 30 * Pass 2 also collects the following information: 31 * - The inode numbers of the subdirectories for each directory. 32 * 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 * 39 * Pass 2 frees the following data structures 40 * - The inode_bad_map bitmap 41 * - The inode_reg_map bitmap 42 */ 43 44#define _GNU_SOURCE 1 /* get strnlen() */ 45#include <string.h> 46 47#include "e2fsck.h" 48#include "problem.h" 49#include "dict.h" 50 51#ifdef NO_INLINE_FUNCS 52#define _INLINE_ 53#else 54#define _INLINE_ inline 55#endif 56 57/* #define DX_DEBUG */ 58 59/* 60 * Keeps track of how many times an inode is referenced. 61 */ 62static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf); 63static int check_dir_block(ext2_filsys fs, 64 struct ext2_db_entry *dir_blocks_info, 65 void *priv_data); 66static int allocate_dir_block(e2fsck_t ctx, 67 struct ext2_db_entry *dir_blocks_info, 68 char *buf, struct problem_context *pctx); 69static int update_dir_block(ext2_filsys fs, 70 blk_t *block_nr, 71 e2_blkcnt_t blockcnt, 72 blk_t ref_block, 73 int ref_offset, 74 void *priv_data); 75static void clear_htree(e2fsck_t ctx, ext2_ino_t ino); 76static int htree_depth(struct dx_dir_info *dx_dir, 77 struct dx_dirblock_info *dx_db); 78static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b); 79 80struct check_dir_struct { 81 char *buf; 82 struct problem_context pctx; 83 int count, max; 84 e2fsck_t ctx; 85}; 86 87void e2fsck_pass2(e2fsck_t ctx) 88{ 89 struct ext2_super_block *sb = ctx->fs->super; 90 struct problem_context pctx; 91 ext2_filsys fs = ctx->fs; 92 char *buf; 93#ifdef RESOURCE_TRACK 94 struct resource_track rtrack; 95#endif 96 struct check_dir_struct cd; 97 struct dx_dir_info *dx_dir; 98 struct dx_dirblock_info *dx_db, *dx_parent; 99 int b; 100 int i, depth; 101 problem_t code; 102 int bad_dir; 103 104 init_resource_track(&rtrack, ctx->fs->io); 105 clear_problem_context(&cd.pctx); 106 107#ifdef MTRACE 108 mtrace_print("Pass 2"); 109#endif 110 111 if (!(ctx->options & E2F_OPT_PREEN)) 112 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx); 113 114 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT, 115 &ctx->inode_count); 116 if (ctx->inode_count) 117 cd.pctx.errcode = 0; 118 else 119 cd.pctx.errcode = ext2fs_create_icount2(fs, 120 EXT2_ICOUNT_OPT_INCREMENT, 121 0, ctx->inode_link_info, 122 &ctx->inode_count); 123 if (cd.pctx.errcode) { 124 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx); 125 ctx->flags |= E2F_FLAG_ABORT; 126 return; 127 } 128 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize, 129 "directory scan buffer"); 130 131 /* 132 * Set up the parent pointer for the root directory, if 133 * present. (If the root directory is not present, we will 134 * create it in pass 3.) 135 */ 136 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO); 137 138 cd.buf = buf; 139 cd.ctx = ctx; 140 cd.count = 1; 141 cd.max = ext2fs_dblist_count(fs->dblist); 142 143 if (ctx->progress) 144 (void) (ctx->progress)(ctx, 2, 0, cd.max); 145 146 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX) 147 ext2fs_dblist_sort(fs->dblist, special_dir_block_cmp); 148 149 cd.pctx.errcode = ext2fs_dblist_iterate(fs->dblist, check_dir_block, 150 &cd); 151 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART) 152 return; 153 154 if (ctx->flags & E2F_FLAG_RESTART_LATER) { 155 ctx->flags |= E2F_FLAG_RESTART; 156 return; 157 } 158 159 if (cd.pctx.errcode) { 160 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx); 161 ctx->flags |= E2F_FLAG_ABORT; 162 return; 163 } 164 165#ifdef ENABLE_HTREE 166 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) { 167 if (ctx->flags & E2F_FLAG_SIGNAL_MASK) 168 return; 169 if (dx_dir->numblocks == 0) 170 continue; 171 clear_problem_context(&pctx); 172 bad_dir = 0; 173 pctx.dir = dx_dir->ino; 174 dx_db = dx_dir->dx_block; 175 if (dx_db->flags & DX_FLAG_REFERENCED) 176 dx_db->flags |= DX_FLAG_DUP_REF; 177 else 178 dx_db->flags |= DX_FLAG_REFERENCED; 179 /* 180 * Find all of the first and last leaf blocks, and 181 * update their parent's min and max hash values 182 */ 183 for (b=0, dx_db = dx_dir->dx_block; 184 b < dx_dir->numblocks; 185 b++, dx_db++) { 186 if ((dx_db->type != DX_DIRBLOCK_LEAF) || 187 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST))) 188 continue; 189 dx_parent = &dx_dir->dx_block[dx_db->parent]; 190 /* 191 * XXX Make sure dx_parent->min_hash > dx_db->min_hash 192 */ 193 if (dx_db->flags & DX_FLAG_FIRST) 194 dx_parent->min_hash = dx_db->min_hash; 195 /* 196 * XXX Make sure dx_parent->max_hash < dx_db->max_hash 197 */ 198 if (dx_db->flags & DX_FLAG_LAST) 199 dx_parent->max_hash = dx_db->max_hash; 200 } 201 202 for (b=0, dx_db = dx_dir->dx_block; 203 b < dx_dir->numblocks; 204 b++, dx_db++) { 205 pctx.blkcount = b; 206 pctx.group = dx_db->parent; 207 code = 0; 208 if (!(dx_db->flags & DX_FLAG_FIRST) && 209 (dx_db->min_hash < dx_db->node_min_hash)) { 210 pctx.blk = dx_db->min_hash; 211 pctx.blk2 = dx_db->node_min_hash; 212 code = PR_2_HTREE_MIN_HASH; 213 fix_problem(ctx, code, &pctx); 214 bad_dir++; 215 } 216 if (dx_db->type == DX_DIRBLOCK_LEAF) { 217 depth = htree_depth(dx_dir, dx_db); 218 if (depth != dx_dir->depth) { 219 pctx.num = dx_dir->depth; 220 code = PR_2_HTREE_BAD_DEPTH; 221 fix_problem(ctx, code, &pctx); 222 bad_dir++; 223 } 224 } 225 /* 226 * This test doesn't apply for the root block 227 * at block #0 228 */ 229 if (b && 230 (dx_db->max_hash > dx_db->node_max_hash)) { 231 pctx.blk = dx_db->max_hash; 232 pctx.blk2 = dx_db->node_max_hash; 233 code = PR_2_HTREE_MAX_HASH; 234 fix_problem(ctx, code, &pctx); 235 bad_dir++; 236 } 237 if (!(dx_db->flags & DX_FLAG_REFERENCED)) { 238 code = PR_2_HTREE_NOTREF; 239 fix_problem(ctx, code, &pctx); 240 bad_dir++; 241 } else if (dx_db->flags & DX_FLAG_DUP_REF) { 242 code = PR_2_HTREE_DUPREF; 243 fix_problem(ctx, code, &pctx); 244 bad_dir++; 245 } 246 } 247 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) { 248 clear_htree(ctx, dx_dir->ino); 249 dx_dir->numblocks = 0; 250 } 251 } 252 e2fsck_free_dx_dir_info(ctx); 253#endif 254 ext2fs_free_mem(&buf); 255 ext2fs_free_dblist(fs->dblist); 256 257 if (ctx->inode_bad_map) { 258 ext2fs_free_inode_bitmap(ctx->inode_bad_map); 259 ctx->inode_bad_map = 0; 260 } 261 if (ctx->inode_reg_map) { 262 ext2fs_free_inode_bitmap(ctx->inode_reg_map); 263 ctx->inode_reg_map = 0; 264 } 265 266 clear_problem_context(&pctx); 267 if (ctx->large_files) { 268 if (!(sb->s_feature_ro_compat & 269 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) && 270 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) { 271 sb->s_feature_ro_compat |= 272 EXT2_FEATURE_RO_COMPAT_LARGE_FILE; 273 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY; 274 ext2fs_mark_super_dirty(fs); 275 } 276 if (sb->s_rev_level == EXT2_GOOD_OLD_REV && 277 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) { 278 ext2fs_update_dynamic_rev(fs); 279 ext2fs_mark_super_dirty(fs); 280 } 281 } 282 283 print_resource_track(ctx, _("Pass 2"), &rtrack, fs->io); 284} 285 286#define MAX_DEPTH 32000 287static int htree_depth(struct dx_dir_info *dx_dir, 288 struct dx_dirblock_info *dx_db) 289{ 290 int depth = 0; 291 292 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) { 293 dx_db = &dx_dir->dx_block[dx_db->parent]; 294 depth++; 295 } 296 return depth; 297} 298 299static int dict_de_cmp(const void *a, const void *b) 300{ 301 const struct ext2_dir_entry *de_a, *de_b; 302 int a_len, b_len; 303 304 de_a = (const struct ext2_dir_entry *) a; 305 a_len = de_a->name_len & 0xFF; 306 de_b = (const struct ext2_dir_entry *) b; 307 b_len = de_b->name_len & 0xFF; 308 309 if (a_len != b_len) 310 return (a_len - b_len); 311 312 return strncmp(de_a->name, de_b->name, a_len); 313} 314 315/* 316 * This is special sort function that makes sure that directory blocks 317 * with a dirblock of zero are sorted to the beginning of the list. 318 * This guarantees that the root node of the htree directories are 319 * processed first, so we know what hash version to use. 320 */ 321static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b) 322{ 323 const struct ext2_db_entry *db_a = 324 (const struct ext2_db_entry *) a; 325 const struct ext2_db_entry *db_b = 326 (const struct ext2_db_entry *) b; 327 328 if (db_a->blockcnt && !db_b->blockcnt) 329 return 1; 330 331 if (!db_a->blockcnt && db_b->blockcnt) 332 return -1; 333 334 if (db_a->blk != db_b->blk) 335 return (int) (db_a->blk - db_b->blk); 336 337 if (db_a->ino != db_b->ino) 338 return (int) (db_a->ino - db_b->ino); 339 340 return (int) (db_a->blockcnt - db_b->blockcnt); 341} 342 343 344/* 345 * Make sure the first entry in the directory is '.', and that the 346 * directory entry is sane. 347 */ 348static int check_dot(e2fsck_t ctx, 349 struct ext2_dir_entry *dirent, 350 ext2_ino_t ino, struct problem_context *pctx) 351{ 352 struct ext2_dir_entry *nextdir; 353 unsigned int rec_len, new_len; 354 int status = 0; 355 int created = 0; 356 int problem = 0; 357 358 if (!dirent->inode) 359 problem = PR_2_MISSING_DOT; 360 else if (((dirent->name_len & 0xFF) != 1) || 361 (dirent->name[0] != '.')) 362 problem = PR_2_1ST_NOT_DOT; 363 else if (dirent->name[1] != '\0') 364 problem = PR_2_DOT_NULL_TERM; 365 366 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len); 367 if (problem) { 368 if (fix_problem(ctx, problem, pctx)) { 369 if (rec_len < 12) 370 rec_len = dirent->rec_len = 12; 371 dirent->inode = ino; 372 dirent->name_len = 1; 373 dirent->name[0] = '.'; 374 dirent->name[1] = '\0'; 375 status = 1; 376 created = 1; 377 } 378 } 379 if (dirent->inode != ino) { 380 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) { 381 dirent->inode = ino; 382 status = 1; 383 } 384 } 385 if (rec_len > 12) { 386 new_len = rec_len - 12; 387 if (new_len > 12) { 388 if (created || 389 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) { 390 nextdir = (struct ext2_dir_entry *) 391 ((char *) dirent + 12); 392 dirent->rec_len = 12; 393 (void) ext2fs_set_rec_len(ctx->fs, new_len, 394 nextdir); 395 nextdir->inode = 0; 396 nextdir->name_len = 0; 397 status = 1; 398 } 399 } 400 } 401 return status; 402} 403 404/* 405 * Make sure the second entry in the directory is '..', and that the 406 * directory entry is sane. We do not check the inode number of '..' 407 * here; this gets done in pass 3. 408 */ 409static int check_dotdot(e2fsck_t ctx, 410 struct ext2_dir_entry *dirent, 411 ext2_ino_t ino, struct problem_context *pctx) 412{ 413 int rec_len, problem = 0; 414 415 if (!dirent->inode) 416 problem = PR_2_MISSING_DOT_DOT; 417 else if (((dirent->name_len & 0xFF) != 2) || 418 (dirent->name[0] != '.') || 419 (dirent->name[1] != '.')) 420 problem = PR_2_2ND_NOT_DOT_DOT; 421 else if (dirent->name[2] != '\0') 422 problem = PR_2_DOT_DOT_NULL_TERM; 423 424 (void) ext2fs_get_rec_len(ctx->fs, dirent, &rec_len); 425 if (problem) { 426 if (fix_problem(ctx, problem, pctx)) { 427 if (rec_len < 12) 428 dirent->rec_len = 12; 429 /* 430 * Note: we don't have the parent inode just 431 * yet, so we will fill it in with the root 432 * inode. This will get fixed in pass 3. 433 */ 434 dirent->inode = EXT2_ROOT_INO; 435 dirent->name_len = 2; 436 dirent->name[0] = '.'; 437 dirent->name[1] = '.'; 438 dirent->name[2] = '\0'; 439 return 1; 440 } 441 return 0; 442 } 443 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) { 444 fix_problem(ctx, PR_2_NO_DIRINFO, pctx); 445 return -1; 446 } 447 return 0; 448} 449 450/* 451 * Check to make sure a directory entry doesn't contain any illegal 452 * characters. 453 */ 454static int check_name(e2fsck_t ctx, 455 struct ext2_dir_entry *dirent, 456 ext2_ino_t dir_ino EXT2FS_ATTR((unused)), 457 struct problem_context *pctx) 458{ 459 int i; 460 int fixup = -1; 461 int ret = 0; 462 463 for ( i = 0; i < (dirent->name_len & 0xFF); i++) { 464 if (dirent->name[i] == '/' || dirent->name[i] == '\0') { 465 if (fixup < 0) { 466 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx); 467 } 468 if (fixup) { 469 dirent->name[i] = '.'; 470 ret = 1; 471 } 472 } 473 } 474 return ret; 475} 476 477/* 478 * Check the directory filetype (if present) 479 */ 480static _INLINE_ int check_filetype(e2fsck_t ctx, 481 struct ext2_dir_entry *dirent, 482 ext2_ino_t dir_ino EXT2FS_ATTR((unused)), 483 struct problem_context *pctx) 484{ 485 int filetype = dirent->name_len >> 8; 486 int should_be = EXT2_FT_UNKNOWN; 487 struct ext2_inode inode; 488 489 if (!(ctx->fs->super->s_feature_incompat & 490 EXT2_FEATURE_INCOMPAT_FILETYPE)) { 491 if (filetype == 0 || 492 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx)) 493 return 0; 494 dirent->name_len = dirent->name_len & 0xFF; 495 return 1; 496 } 497 498 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dirent->inode)) { 499 should_be = EXT2_FT_DIR; 500 } else if (ext2fs_test_inode_bitmap2(ctx->inode_reg_map, 501 dirent->inode)) { 502 should_be = EXT2_FT_REG_FILE; 503 } else if (ctx->inode_bad_map && 504 ext2fs_test_inode_bitmap2(ctx->inode_bad_map, 505 dirent->inode)) 506 should_be = 0; 507 else { 508 e2fsck_read_inode(ctx, dirent->inode, &inode, 509 "check_filetype"); 510 should_be = ext2_file_type(inode.i_mode); 511 } 512 if (filetype == should_be) 513 return 0; 514 pctx->num = should_be; 515 516 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE, 517 pctx) == 0) 518 return 0; 519 520 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8; 521 return 1; 522} 523 524#ifdef ENABLE_HTREE 525static void parse_int_node(ext2_filsys fs, 526 struct ext2_db_entry *db, 527 struct check_dir_struct *cd, 528 struct dx_dir_info *dx_dir, 529 char *block_buf) 530{ 531 struct ext2_dx_root_info *root; 532 struct ext2_dx_entry *ent; 533 struct ext2_dx_countlimit *limit; 534 struct dx_dirblock_info *dx_db; 535 int i, expect_limit, count; 536 blk_t blk; 537 ext2_dirhash_t min_hash = 0xffffffff; 538 ext2_dirhash_t max_hash = 0; 539 ext2_dirhash_t hash = 0, prev_hash; 540 541 if (db->blockcnt == 0) { 542 root = (struct ext2_dx_root_info *) (block_buf + 24); 543 544#ifdef DX_DEBUG 545 printf("Root node dump:\n"); 546 printf("\t Reserved zero: %u\n", root->reserved_zero); 547 printf("\t Hash Version: %d\n", root->hash_version); 548 printf("\t Info length: %d\n", root->info_length); 549 printf("\t Indirect levels: %d\n", root->indirect_levels); 550 printf("\t Flags: %d\n", root->unused_flags); 551#endif 552 553 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length); 554 } else { 555 ent = (struct ext2_dx_entry *) (block_buf+8); 556 } 557 limit = (struct ext2_dx_countlimit *) ent; 558 559#ifdef DX_DEBUG 560 printf("Number of entries (count): %d\n", 561 ext2fs_le16_to_cpu(limit->count)); 562 printf("Number of entries (limit): %d\n", 563 ext2fs_le16_to_cpu(limit->limit)); 564#endif 565 566 count = ext2fs_le16_to_cpu(limit->count); 567 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) / 568 sizeof(struct ext2_dx_entry); 569 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) { 570 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit); 571 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx)) 572 goto clear_and_exit; 573 } 574 if (count > expect_limit) { 575 cd->pctx.num = count; 576 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx)) 577 goto clear_and_exit; 578 count = expect_limit; 579 } 580 581 for (i=0; i < count; i++) { 582 prev_hash = hash; 583 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0; 584#ifdef DX_DEBUG 585 printf("Entry #%d: Hash 0x%08x, block %u\n", i, 586 hash, ext2fs_le32_to_cpu(ent[i].block)); 587#endif 588 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff; 589 /* Check to make sure the block is valid */ 590 if (blk >= (blk_t) dx_dir->numblocks) { 591 cd->pctx.blk = blk; 592 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK, 593 &cd->pctx)) 594 goto clear_and_exit; 595 continue; 596 } 597 if (hash < prev_hash && 598 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx)) 599 goto clear_and_exit; 600 dx_db = &dx_dir->dx_block[blk]; 601 if (dx_db->flags & DX_FLAG_REFERENCED) { 602 dx_db->flags |= DX_FLAG_DUP_REF; 603 } else { 604 dx_db->flags |= DX_FLAG_REFERENCED; 605 dx_db->parent = db->blockcnt; 606 } 607 if (hash < min_hash) 608 min_hash = hash; 609 if (hash > max_hash) 610 max_hash = hash; 611 dx_db->node_min_hash = hash; 612 if ((i+1) < count) 613 dx_db->node_max_hash = 614 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1; 615 else { 616 dx_db->node_max_hash = 0xfffffffe; 617 dx_db->flags |= DX_FLAG_LAST; 618 } 619 if (i == 0) 620 dx_db->flags |= DX_FLAG_FIRST; 621 } 622#ifdef DX_DEBUG 623 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n", 624 db->blockcnt, min_hash, max_hash); 625#endif 626 dx_db = &dx_dir->dx_block[db->blockcnt]; 627 dx_db->min_hash = min_hash; 628 dx_db->max_hash = max_hash; 629 return; 630 631clear_and_exit: 632 clear_htree(cd->ctx, cd->pctx.ino); 633 dx_dir->numblocks = 0; 634} 635#endif /* ENABLE_HTREE */ 636 637/* 638 * Given a busted directory, try to salvage it somehow. 639 * 640 */ 641static void salvage_directory(ext2_filsys fs, 642 struct ext2_dir_entry *dirent, 643 struct ext2_dir_entry *prev, 644 unsigned int *offset) 645{ 646 char *cp = (char *) dirent; 647 int left; 648 unsigned int rec_len, prev_rec_len; 649 unsigned int name_len = dirent->name_len & 0xFF; 650 651 (void) ext2fs_get_rec_len(fs, dirent, &rec_len); 652 left = fs->blocksize - *offset - rec_len; 653 654 /* 655 * Special case of directory entry of size 8: copy what's left 656 * of the directory block up to cover up the invalid hole. 657 */ 658 if ((left >= 12) && (rec_len == 8)) { 659 memmove(cp, cp+8, left); 660 memset(cp + left, 0, 8); 661 return; 662 } 663 /* 664 * If the directory entry overruns the end of the directory 665 * block, and the name is small enough to fit, then adjust the 666 * record length. 667 */ 668 if ((left < 0) && 669 ((int) rec_len + left > 8) && 670 (name_len + 8 <= (int) rec_len + left) && 671 dirent->inode <= fs->super->s_inodes_count && 672 strnlen(dirent->name, name_len) == name_len) { 673 (void) ext2fs_set_rec_len(fs, (int) rec_len + left, dirent); 674 return; 675 } 676 /* 677 * If the record length of the directory entry is a multiple 678 * of four, and not too big, such that it is valid, let the 679 * previous directory entry absorb the invalid one. 680 */ 681 if (prev && rec_len && (rec_len % 4) == 0 && 682 (*offset + rec_len <= fs->blocksize)) { 683 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len); 684 prev_rec_len += rec_len; 685 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev); 686 *offset += rec_len; 687 return; 688 } 689 /* 690 * Default salvage method --- kill all of the directory 691 * entries for the rest of the block. We will either try to 692 * absorb it into the previous directory entry, or create a 693 * new empty directory entry the rest of the directory block. 694 */ 695 if (prev) { 696 (void) ext2fs_get_rec_len(fs, prev, &prev_rec_len); 697 prev_rec_len += fs->blocksize - *offset; 698 (void) ext2fs_set_rec_len(fs, prev_rec_len, prev); 699 *offset = fs->blocksize; 700 } else { 701 rec_len = fs->blocksize - *offset; 702 (void) ext2fs_set_rec_len(fs, rec_len, dirent); 703 dirent->name_len = 0; 704 dirent->inode = 0; 705 } 706} 707 708static int check_dir_block(ext2_filsys fs, 709 struct ext2_db_entry *db, 710 void *priv_data) 711{ 712 struct dx_dir_info *dx_dir; 713#ifdef ENABLE_HTREE 714 struct dx_dirblock_info *dx_db = 0; 715#endif /* ENABLE_HTREE */ 716 struct ext2_dir_entry *dirent, *prev; 717 ext2_dirhash_t hash; 718 unsigned int offset = 0; 719 const char * old_op; 720 int dir_modified = 0; 721 int dot_state; 722 unsigned int rec_len; 723 blk_t block_nr = db->blk; 724 ext2_ino_t ino = db->ino; 725 ext2_ino_t subdir_parent; 726 __u16 links; 727 struct check_dir_struct *cd; 728 char *buf; 729 e2fsck_t ctx; 730 int problem; 731 struct ext2_dx_root_info *root; 732 struct ext2_dx_countlimit *limit; 733 static dict_t de_dict; 734 struct problem_context pctx; 735 int dups_found = 0; 736 int ret; 737 738 cd = (struct check_dir_struct *) priv_data; 739 buf = cd->buf; 740 ctx = cd->ctx; 741 742 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART) 743 return DIRENT_ABORT; 744 745 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max)) 746 return DIRENT_ABORT; 747 748 /* 749 * Make sure the inode is still in use (could have been 750 * deleted in the duplicate/bad blocks pass. 751 */ 752 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino))) 753 return 0; 754 755 cd->pctx.ino = ino; 756 cd->pctx.blk = block_nr; 757 cd->pctx.blkcount = db->blockcnt; 758 cd->pctx.ino2 = 0; 759 cd->pctx.dirent = 0; 760 cd->pctx.num = 0; 761 762 if (db->blk == 0) { 763 if (allocate_dir_block(ctx, db, buf, &cd->pctx)) 764 return 0; 765 block_nr = db->blk; 766 } 767 768 if (db->blockcnt) 769 dot_state = 2; 770 else 771 dot_state = 0; 772 773 if (ctx->dirs_to_hash && 774 ext2fs_u32_list_test(ctx->dirs_to_hash, ino)) 775 dups_found++; 776 777#if 0 778 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr, 779 db->blockcnt, ino); 780#endif 781 782 old_op = ehandler_operation(_("reading directory block")); 783 cd->pctx.errcode = ext2fs_read_dir_block(fs, block_nr, buf); 784 ehandler_operation(0); 785 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED) 786 cd->pctx.errcode = 0; /* We'll handle this ourselves */ 787 if (cd->pctx.errcode) { 788 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) { 789 ctx->flags |= E2F_FLAG_ABORT; 790 return DIRENT_ABORT; 791 } 792 memset(buf, 0, fs->blocksize); 793 } 794#ifdef ENABLE_HTREE 795 dx_dir = e2fsck_get_dx_dir_info(ctx, ino); 796 if (dx_dir && dx_dir->numblocks) { 797 if (db->blockcnt >= dx_dir->numblocks) { 798 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK, 799 &pctx)) { 800 clear_htree(ctx, ino); 801 dx_dir->numblocks = 0; 802 dx_db = 0; 803 goto out_htree; 804 } 805 fatal_error(ctx, _("Can not continue.")); 806 } 807 dx_db = &dx_dir->dx_block[db->blockcnt]; 808 dx_db->type = DX_DIRBLOCK_LEAF; 809 dx_db->phys = block_nr; 810 dx_db->min_hash = ~0; 811 dx_db->max_hash = 0; 812 813 dirent = (struct ext2_dir_entry *) buf; 814 (void) ext2fs_get_rec_len(fs, dirent, &rec_len); 815 limit = (struct ext2_dx_countlimit *) (buf+8); 816 if (db->blockcnt == 0) { 817 root = (struct ext2_dx_root_info *) (buf + 24); 818 dx_db->type = DX_DIRBLOCK_ROOT; 819 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST; 820 if ((root->reserved_zero || 821 root->info_length < 8 || 822 root->indirect_levels > 1) && 823 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) { 824 clear_htree(ctx, ino); 825 dx_dir->numblocks = 0; 826 dx_db = 0; 827 } 828 dx_dir->hashversion = root->hash_version; 829 if ((dx_dir->hashversion <= EXT2_HASH_TEA) && 830 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH)) 831 dx_dir->hashversion += 3; 832 dx_dir->depth = root->indirect_levels + 1; 833 } else if ((dirent->inode == 0) && 834 (rec_len == fs->blocksize) && 835 (dirent->name_len == 0) && 836 (ext2fs_le16_to_cpu(limit->limit) == 837 ((fs->blocksize-8) / 838 sizeof(struct ext2_dx_entry)))) 839 dx_db->type = DX_DIRBLOCK_NODE; 840 } 841out_htree: 842#endif /* ENABLE_HTREE */ 843 844 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp); 845 prev = 0; 846 do { 847 int group; 848 ext2_ino_t first_unused_inode; 849 850 problem = 0; 851 dirent = (struct ext2_dir_entry *) (buf + offset); 852 (void) ext2fs_get_rec_len(fs, dirent, &rec_len); 853 cd->pctx.dirent = dirent; 854 cd->pctx.num = offset; 855 if (((offset + rec_len) > fs->blocksize) || 856 (rec_len < 12) || 857 ((rec_len % 4) != 0) || 858 (((dirent->name_len & (unsigned) 0xFF)+8) > rec_len)) { 859 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) { 860 salvage_directory(fs, dirent, prev, &offset); 861 dir_modified++; 862 continue; 863 } else 864 goto abort_free_dict; 865 } 866 if ((dirent->name_len & 0xFF) > EXT2_NAME_LEN) { 867 if (fix_problem(ctx, PR_2_FILENAME_LONG, &cd->pctx)) { 868 dirent->name_len = EXT2_NAME_LEN; 869 dir_modified++; 870 } 871 } 872 873 if (dot_state == 0) { 874 if (check_dot(ctx, dirent, ino, &cd->pctx)) 875 dir_modified++; 876 } else if (dot_state == 1) { 877 ret = check_dotdot(ctx, dirent, ino, &cd->pctx); 878 if (ret < 0) 879 goto abort_free_dict; 880 if (ret) 881 dir_modified++; 882 } else if (dirent->inode == ino) { 883 problem = PR_2_LINK_DOT; 884 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) { 885 dirent->inode = 0; 886 dir_modified++; 887 goto next; 888 } 889 } 890 if (!dirent->inode) 891 goto next; 892 893 /* 894 * Make sure the inode listed is a legal one. 895 */ 896 if (((dirent->inode != EXT2_ROOT_INO) && 897 (dirent->inode < EXT2_FIRST_INODE(fs->super))) || 898 (dirent->inode > fs->super->s_inodes_count)) { 899 problem = PR_2_BAD_INO; 900 } else if (ctx->inode_bb_map && 901 (ext2fs_test_inode_bitmap2(ctx->inode_bb_map, 902 dirent->inode))) { 903 /* 904 * If the inode is in a bad block, offer to 905 * clear it. 906 */ 907 problem = PR_2_BB_INODE; 908 } else if ((dot_state > 1) && 909 ((dirent->name_len & 0xFF) == 1) && 910 (dirent->name[0] == '.')) { 911 /* 912 * If there's a '.' entry in anything other 913 * than the first directory entry, it's a 914 * duplicate entry that should be removed. 915 */ 916 problem = PR_2_DUP_DOT; 917 } else if ((dot_state > 1) && 918 ((dirent->name_len & 0xFF) == 2) && 919 (dirent->name[0] == '.') && 920 (dirent->name[1] == '.')) { 921 /* 922 * If there's a '..' entry in anything other 923 * than the second directory entry, it's a 924 * duplicate entry that should be removed. 925 */ 926 problem = PR_2_DUP_DOT_DOT; 927 } else if ((dot_state > 1) && 928 (dirent->inode == EXT2_ROOT_INO)) { 929 /* 930 * Don't allow links to the root directory. 931 * We check this specially to make sure we 932 * catch this error case even if the root 933 * directory hasn't been created yet. 934 */ 935 problem = PR_2_LINK_ROOT; 936 } else if ((dot_state > 1) && 937 (dirent->name_len & 0xFF) == 0) { 938 /* 939 * Don't allow zero-length directory names. 940 */ 941 problem = PR_2_NULL_NAME; 942 } 943 944 if (problem) { 945 if (fix_problem(ctx, problem, &cd->pctx)) { 946 dirent->inode = 0; 947 dir_modified++; 948 goto next; 949 } else { 950 ext2fs_unmark_valid(fs); 951 if (problem == PR_2_BAD_INO) 952 goto next; 953 } 954 } 955 956 /* 957 * If the inode was marked as having bad fields in 958 * pass1, process it and offer to fix/clear it. 959 * (We wait until now so that we can display the 960 * pathname to the user.) 961 */ 962 if (ctx->inode_bad_map && 963 ext2fs_test_inode_bitmap2(ctx->inode_bad_map, 964 dirent->inode)) { 965 if (e2fsck_process_bad_inode(ctx, ino, 966 dirent->inode, 967 buf + fs->blocksize)) { 968 dirent->inode = 0; 969 dir_modified++; 970 goto next; 971 } 972 if (ctx->flags & E2F_FLAG_SIGNAL_MASK) 973 return DIRENT_ABORT; 974 } 975 976 group = ext2fs_group_of_ino(fs, dirent->inode); 977 first_unused_inode = group * fs->super->s_inodes_per_group + 978 1 + fs->super->s_inodes_per_group - 979 ext2fs_bg_itable_unused(fs, group); 980 cd->pctx.group = group; 981 982 /* 983 * Check if the inode was missed out because 984 * _INODE_UNINIT flag was set or bg_itable_unused was 985 * incorrect. If so, clear the _INODE_UNINIT flag and 986 * restart e2fsck. In the future it would be nice if 987 * we could call a function in pass1.c that checks the 988 * newly visible inodes. 989 */ 990 if (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)) { 991 pctx.num = dirent->inode; 992 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT, 993 &cd->pctx)){ 994 ext2fs_bg_flags_clear(fs, group, 995 EXT2_BG_INODE_UNINIT); 996 ext2fs_mark_super_dirty(fs); 997 ctx->flags |= E2F_FLAG_RESTART_LATER; 998 } else { 999 ext2fs_unmark_valid(fs); 1000 if (problem == PR_2_BAD_INO) 1001 goto next; 1002 } 1003 } else if (dirent->inode >= first_unused_inode) { 1004 pctx.num = dirent->inode; 1005 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){ 1006 ext2fs_bg_itable_unused_set(fs, group, 0); 1007 ext2fs_mark_super_dirty(fs); 1008 ctx->flags |= E2F_FLAG_RESTART_LATER; 1009 } else { 1010 ext2fs_unmark_valid(fs); 1011 if (problem == PR_2_BAD_INO) 1012 goto next; 1013 } 1014 } 1015 1016 if (!(ext2fs_test_inode_bitmap2(ctx->inode_used_map, 1017 dirent->inode))) { 1018 /* 1019 * If the inode is unused, offer to clear it. 1020 */ 1021 problem = PR_2_UNUSED_INODE; 1022 } 1023 1024 if (problem) { 1025 if (fix_problem(ctx, problem, &cd->pctx)) { 1026 dirent->inode = 0; 1027 dir_modified++; 1028 goto next; 1029 } else { 1030 ext2fs_unmark_valid(fs); 1031 if (problem == PR_2_BAD_INO) 1032 goto next; 1033 } 1034 } 1035 1036 if (check_name(ctx, dirent, ino, &cd->pctx)) 1037 dir_modified++; 1038 1039 if (check_filetype(ctx, dirent, ino, &cd->pctx)) 1040 dir_modified++; 1041 1042#ifdef ENABLE_HTREE 1043 if (dx_db) { 1044 ext2fs_dirhash(dx_dir->hashversion, dirent->name, 1045 (dirent->name_len & 0xFF), 1046 fs->super->s_hash_seed, &hash, 0); 1047 if (hash < dx_db->min_hash) 1048 dx_db->min_hash = hash; 1049 if (hash > dx_db->max_hash) 1050 dx_db->max_hash = hash; 1051 } 1052#endif 1053 1054 /* 1055 * If this is a directory, then mark its parent in its 1056 * dir_info structure. If the parent field is already 1057 * filled in, then this directory has more than one 1058 * hard link. We assume the first link is correct, 1059 * and ask the user if he/she wants to clear this one. 1060 */ 1061 if ((dot_state > 1) && 1062 (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, 1063 dirent->inode))) { 1064 if (e2fsck_dir_info_get_parent(ctx, dirent->inode, 1065 &subdir_parent)) { 1066 cd->pctx.ino = dirent->inode; 1067 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx); 1068 goto abort_free_dict; 1069 } 1070 if (subdir_parent) { 1071 cd->pctx.ino2 = subdir_parent; 1072 if (fix_problem(ctx, PR_2_LINK_DIR, 1073 &cd->pctx)) { 1074 dirent->inode = 0; 1075 dir_modified++; 1076 goto next; 1077 } 1078 cd->pctx.ino2 = 0; 1079 } else { 1080 (void) e2fsck_dir_info_set_parent(ctx, 1081 dirent->inode, ino); 1082 } 1083 } 1084 1085 if (dups_found) { 1086 ; 1087 } else if (dict_lookup(&de_dict, dirent)) { 1088 clear_problem_context(&pctx); 1089 pctx.ino = ino; 1090 pctx.dirent = dirent; 1091 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx); 1092 if (!ctx->dirs_to_hash) 1093 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50); 1094 if (ctx->dirs_to_hash) 1095 ext2fs_u32_list_add(ctx->dirs_to_hash, ino); 1096 dups_found++; 1097 } else 1098 dict_alloc_insert(&de_dict, dirent, dirent); 1099 1100 ext2fs_icount_increment(ctx->inode_count, dirent->inode, 1101 &links); 1102 if (links > 1) 1103 ctx->fs_links_count++; 1104 ctx->fs_total_count++; 1105 next: 1106 prev = dirent; 1107 if (dir_modified) 1108 (void) ext2fs_get_rec_len(fs, dirent, &rec_len); 1109 offset += rec_len; 1110 dot_state++; 1111 } while (offset < fs->blocksize); 1112#if 0 1113 printf("\n"); 1114#endif 1115#ifdef ENABLE_HTREE 1116 if (dx_db) { 1117#ifdef DX_DEBUG 1118 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n", 1119 db->blockcnt, dx_db->type, 1120 dx_db->min_hash, dx_db->max_hash); 1121#endif 1122 cd->pctx.dir = cd->pctx.ino; 1123 if ((dx_db->type == DX_DIRBLOCK_ROOT) || 1124 (dx_db->type == DX_DIRBLOCK_NODE)) 1125 parse_int_node(fs, db, cd, dx_dir, buf); 1126 } 1127#endif /* ENABLE_HTREE */ 1128 if (offset != fs->blocksize) { 1129 cd->pctx.num = rec_len - fs->blocksize + offset; 1130 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) { 1131 dirent->rec_len = cd->pctx.num; 1132 dir_modified++; 1133 } 1134 } 1135 if (dir_modified) { 1136 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf); 1137 if (cd->pctx.errcode) { 1138 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK, 1139 &cd->pctx)) 1140 goto abort_free_dict; 1141 } 1142 ext2fs_mark_changed(fs); 1143 } 1144 dict_free_nodes(&de_dict); 1145 return 0; 1146abort_free_dict: 1147 ctx->flags |= E2F_FLAG_ABORT; 1148 dict_free_nodes(&de_dict); 1149 return DIRENT_ABORT; 1150} 1151 1152/* 1153 * This function is called to deallocate a block, and is an interator 1154 * functioned called by deallocate inode via ext2fs_iterate_block(). 1155 */ 1156static int deallocate_inode_block(ext2_filsys fs, 1157 blk_t *block_nr, 1158 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)), 1159 blk_t ref_block EXT2FS_ATTR((unused)), 1160 int ref_offset EXT2FS_ATTR((unused)), 1161 void *priv_data) 1162{ 1163 e2fsck_t ctx = (e2fsck_t) priv_data; 1164 1165 if (HOLE_BLKADDR(*block_nr)) 1166 return 0; 1167 if ((*block_nr < fs->super->s_first_data_block) || 1168 (*block_nr >= ext2fs_blocks_count(fs->super))) 1169 return 0; 1170 ext2fs_unmark_block_bitmap2(ctx->block_found_map, *block_nr); 1171 ext2fs_block_alloc_stats2(fs, *block_nr, -1); 1172 return 0; 1173} 1174 1175/* 1176 * This fuction deallocates an inode 1177 */ 1178static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf) 1179{ 1180 ext2_filsys fs = ctx->fs; 1181 struct ext2_inode inode; 1182 struct problem_context pctx; 1183 __u32 count; 1184 1185 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode"); 1186 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode"); 1187 clear_problem_context(&pctx); 1188 pctx.ino = ino; 1189 1190 /* 1191 * Fix up the bitmaps... 1192 */ 1193 e2fsck_read_bitmaps(ctx); 1194 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode)); 1195 1196 if (ext2fs_file_acl_block(&inode) && 1197 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) { 1198 pctx.errcode = ext2fs_adjust_ea_refcount(fs, ext2fs_file_acl_block(&inode), 1199 block_buf, -1, &count); 1200 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) { 1201 pctx.errcode = 0; 1202 count = 1; 1203 } 1204 if (pctx.errcode) { 1205 pctx.blk = ext2fs_file_acl_block(&inode); 1206 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx); 1207 ctx->flags |= E2F_FLAG_ABORT; 1208 return; 1209 } 1210 if (count == 0) { 1211 ext2fs_unmark_block_bitmap2(ctx->block_found_map, 1212 ext2fs_file_acl_block(&inode)); 1213 ext2fs_block_alloc_stats2(fs, 1214 ext2fs_file_acl_block(&inode), 1215 -1); 1216 } 1217 ext2fs_file_acl_block_set(&inode, 0); 1218 } 1219 1220 if (!ext2fs_inode_has_valid_blocks(&inode)) 1221 return; 1222 1223 if (LINUX_S_ISREG(inode.i_mode) && 1224 (inode.i_size_high || inode.i_size & 0x80000000UL)) 1225 ctx->large_files--; 1226 1227 pctx.errcode = ext2fs_block_iterate2(fs, ino, 0, block_buf, 1228 deallocate_inode_block, ctx); 1229 if (pctx.errcode) { 1230 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx); 1231 ctx->flags |= E2F_FLAG_ABORT; 1232 return; 1233 } 1234} 1235 1236/* 1237 * This fuction clears the htree flag on an inode 1238 */ 1239static void clear_htree(e2fsck_t ctx, ext2_ino_t ino) 1240{ 1241 struct ext2_inode inode; 1242 1243 e2fsck_read_inode(ctx, ino, &inode, "clear_htree"); 1244 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL; 1245 e2fsck_write_inode(ctx, ino, &inode, "clear_htree"); 1246 if (ctx->dirs_to_hash) 1247 ext2fs_u32_list_add(ctx->dirs_to_hash, ino); 1248} 1249 1250 1251extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir, 1252 ext2_ino_t ino, char *buf) 1253{ 1254 ext2_filsys fs = ctx->fs; 1255 struct ext2_inode inode; 1256 int inode_modified = 0; 1257 int not_fixed = 0; 1258 unsigned char *frag, *fsize; 1259 struct problem_context pctx; 1260 int problem = 0; 1261 1262 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode"); 1263 1264 clear_problem_context(&pctx); 1265 pctx.ino = ino; 1266 pctx.dir = dir; 1267 pctx.inode = &inode; 1268 1269 if (ext2fs_file_acl_block(&inode) && 1270 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) { 1271 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) { 1272 ext2fs_file_acl_block_set(&inode, 0); 1273 inode_modified++; 1274 } else 1275 not_fixed++; 1276 } 1277 1278 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) && 1279 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) && 1280 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) && 1281 !(LINUX_S_ISSOCK(inode.i_mode))) 1282 problem = PR_2_BAD_MODE; 1283 else if (LINUX_S_ISCHR(inode.i_mode) 1284 && !e2fsck_pass1_check_device_inode(fs, &inode)) 1285 problem = PR_2_BAD_CHAR_DEV; 1286 else if (LINUX_S_ISBLK(inode.i_mode) 1287 && !e2fsck_pass1_check_device_inode(fs, &inode)) 1288 problem = PR_2_BAD_BLOCK_DEV; 1289 else if (LINUX_S_ISFIFO(inode.i_mode) 1290 && !e2fsck_pass1_check_device_inode(fs, &inode)) 1291 problem = PR_2_BAD_FIFO; 1292 else if (LINUX_S_ISSOCK(inode.i_mode) 1293 && !e2fsck_pass1_check_device_inode(fs, &inode)) 1294 problem = PR_2_BAD_SOCKET; 1295 else if (LINUX_S_ISLNK(inode.i_mode) 1296 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) { 1297 problem = PR_2_INVALID_SYMLINK; 1298 } 1299 1300 if (problem) { 1301 if (fix_problem(ctx, problem, &pctx)) { 1302 deallocate_inode(ctx, ino, 0); 1303 if (ctx->flags & E2F_FLAG_SIGNAL_MASK) 1304 return 0; 1305 return 1; 1306 } else 1307 not_fixed++; 1308 problem = 0; 1309 } 1310 1311 if (inode.i_faddr) { 1312 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) { 1313 inode.i_faddr = 0; 1314 inode_modified++; 1315 } else 1316 not_fixed++; 1317 } 1318 1319 switch (fs->super->s_creator_os) { 1320 case EXT2_OS_HURD: 1321 frag = &inode.osd2.hurd2.h_i_frag; 1322 fsize = &inode.osd2.hurd2.h_i_fsize; 1323 break; 1324 default: 1325 frag = fsize = 0; 1326 } 1327 if (frag && *frag) { 1328 pctx.num = *frag; 1329 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) { 1330 *frag = 0; 1331 inode_modified++; 1332 } else 1333 not_fixed++; 1334 pctx.num = 0; 1335 } 1336 if (fsize && *fsize) { 1337 pctx.num = *fsize; 1338 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) { 1339 *fsize = 0; 1340 inode_modified++; 1341 } else 1342 not_fixed++; 1343 pctx.num = 0; 1344 } 1345 1346 if ((fs->super->s_creator_os == EXT2_OS_LINUX) && 1347 !(fs->super->s_feature_ro_compat & 1348 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) && 1349 (inode.osd2.linux2.l_i_blocks_hi != 0)) { 1350 pctx.num = inode.osd2.linux2.l_i_blocks_hi; 1351 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) { 1352 inode.osd2.linux2.l_i_blocks_hi = 0; 1353 inode_modified++; 1354 } 1355 } 1356 1357 if (!(fs->super->s_feature_incompat & 1358 EXT4_FEATURE_INCOMPAT_64BIT) && 1359 inode.osd2.linux2.l_i_file_acl_high != 0) { 1360 pctx.num = inode.osd2.linux2.l_i_file_acl_high; 1361 if (fix_problem(ctx, PR_2_I_FILE_ACL_HI_ZERO, &pctx)) { 1362 inode.osd2.linux2.l_i_file_acl_high = 0; 1363 inode_modified++; 1364 } else 1365 not_fixed++; 1366 } 1367 1368 if (ext2fs_file_acl_block(&inode) && 1369 ((ext2fs_file_acl_block(&inode) < fs->super->s_first_data_block) || 1370 (ext2fs_file_acl_block(&inode) >= ext2fs_blocks_count(fs->super)))) { 1371 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) { 1372 ext2fs_file_acl_block_set(&inode, 0); 1373 inode_modified++; 1374 } else 1375 not_fixed++; 1376 } 1377 if (inode.i_dir_acl && 1378 LINUX_S_ISDIR(inode.i_mode)) { 1379 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) { 1380 inode.i_dir_acl = 0; 1381 inode_modified++; 1382 } else 1383 not_fixed++; 1384 } 1385 1386 if (inode_modified) 1387 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode"); 1388 if (!not_fixed && ctx->inode_bad_map) 1389 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino); 1390 return 0; 1391} 1392 1393 1394/* 1395 * allocate_dir_block --- this function allocates a new directory 1396 * block for a particular inode; this is done if a directory has 1397 * a "hole" in it, or if a directory has a illegal block number 1398 * that was zeroed out and now needs to be replaced. 1399 */ 1400static int allocate_dir_block(e2fsck_t ctx, 1401 struct ext2_db_entry *db, 1402 char *buf EXT2FS_ATTR((unused)), 1403 struct problem_context *pctx) 1404{ 1405 ext2_filsys fs = ctx->fs; 1406 blk64_t blk; 1407 char *block; 1408 struct ext2_inode inode; 1409 1410 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0) 1411 return 1; 1412 1413 /* 1414 * Read the inode and block bitmaps in; we'll be messing with 1415 * them. 1416 */ 1417 e2fsck_read_bitmaps(ctx); 1418 1419 /* 1420 * First, find a free block 1421 */ 1422 pctx->errcode = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk); 1423 if (pctx->errcode) { 1424 pctx->str = "ext2fs_new_block"; 1425 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx); 1426 return 1; 1427 } 1428 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk); 1429 ext2fs_mark_block_bitmap2(fs->block_map, blk); 1430 ext2fs_mark_bb_dirty(fs); 1431 1432 /* 1433 * Now let's create the actual data block for the inode 1434 */ 1435 if (db->blockcnt) 1436 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block); 1437 else 1438 pctx->errcode = ext2fs_new_dir_block(fs, db->ino, 1439 EXT2_ROOT_INO, &block); 1440 1441 if (pctx->errcode) { 1442 pctx->str = "ext2fs_new_dir_block"; 1443 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx); 1444 return 1; 1445 } 1446 1447 pctx->errcode = ext2fs_write_dir_block(fs, blk, block); 1448 ext2fs_free_mem(&block); 1449 if (pctx->errcode) { 1450 pctx->str = "ext2fs_write_dir_block"; 1451 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx); 1452 return 1; 1453 } 1454 1455 /* 1456 * Update the inode block count 1457 */ 1458 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block"); 1459 ext2fs_iblk_add_blocks(fs, &inode, 1); 1460 if (inode.i_size < (db->blockcnt+1) * fs->blocksize) 1461 inode.i_size = (db->blockcnt+1) * fs->blocksize; 1462 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block"); 1463 1464 /* 1465 * Finally, update the block pointers for the inode 1466 */ 1467 db->blk = blk; 1468 pctx->errcode = ext2fs_block_iterate2(fs, db->ino, BLOCK_FLAG_HOLE, 1469 0, update_dir_block, db); 1470 if (pctx->errcode) { 1471 pctx->str = "ext2fs_block_iterate"; 1472 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx); 1473 return 1; 1474 } 1475 1476 return 0; 1477} 1478 1479/* 1480 * This is a helper function for allocate_dir_block(). 1481 */ 1482static int update_dir_block(ext2_filsys fs EXT2FS_ATTR((unused)), 1483 blk_t *block_nr, 1484 e2_blkcnt_t blockcnt, 1485 blk_t ref_block EXT2FS_ATTR((unused)), 1486 int ref_offset EXT2FS_ATTR((unused)), 1487 void *priv_data) 1488{ 1489 struct ext2_db_entry *db; 1490 1491 db = (struct ext2_db_entry *) priv_data; 1492 if (db->blockcnt == (int) blockcnt) { 1493 *block_nr = db->blk; 1494 return BLOCK_CHANGED; 1495 } 1496 return 0; 1497} 1498