pass1b.c revision a63745e81cbb476b90c75ca3ca60b9ba4be95cae
1/* 2 * pass1b.c --- Pass #1b of e2fsck 3 * 4 * This file contains pass1B, pass1C, and pass1D of e2fsck. They are 5 * only invoked if pass 1 discovered blocks which are in use by more 6 * than one inode. 7 * 8 * Pass1B scans the data blocks of all the inodes again, generating a 9 * complete list of duplicate blocks and which inodes have claimed 10 * them. 11 * 12 * Pass1C does a tree-traversal of the filesystem, to determine the 13 * parent directories of these inodes. This step is necessary so that 14 * e2fsck can print out the pathnames of affected inodes. 15 * 16 * Pass1D is a reconciliation pass. For each inode with duplicate 17 * blocks, the user is prompted if s/he would like to clone the file 18 * (so that the file gets a fresh copy of the duplicated blocks) or 19 * simply to delete the file. 20 * 21 * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o. 22 * 23 * %Begin-Header% 24 * This file may be redistributed under the terms of the GNU Public 25 * License. 26 * %End-Header% 27 * 28 */ 29 30#include <time.h> 31#ifdef HAVE_ERRNO_H 32#include <errno.h> 33#endif 34 35#ifdef HAVE_INTTYPES_H 36#include <inttypes.h> 37#endif 38 39#ifndef HAVE_INTPTR_T 40typedef long intptr_t; 41#endif 42 43/* Needed for architectures where sizeof(int) != sizeof(void *) */ 44#define INT_TO_VOIDPTR(val) ((void *)(intptr_t)(val)) 45#define VOIDPTR_TO_INT(ptr) ((int)(intptr_t)(ptr)) 46 47#include <et/com_err.h> 48#include "e2fsck.h" 49 50#include "problem.h" 51#include "dict.h" 52 53/* Define an extension to the ext2 library's block count information */ 54#define BLOCK_COUNT_EXTATTR (-5) 55 56struct block_el { 57 blk_t block; 58 struct block_el *next; 59}; 60 61struct inode_el { 62 ext2_ino_t inode; 63 struct inode_el *next; 64}; 65 66struct dup_block { 67 int num_bad; 68 struct inode_el *inode_list; 69}; 70 71/* 72 * This structure stores information about a particular inode which 73 * is sharing blocks with other inodes. This information is collected 74 * to display to the user, so that the user knows what files he or she 75 * is dealing with, when trying to decide how to resolve the conflict 76 * of multiply-claimed blocks. 77 */ 78struct dup_inode { 79 ext2_ino_t dir; 80 int num_dupblocks; 81 struct ext2_inode inode; 82 struct block_el *block_list; 83}; 84 85static int process_pass1b_block(ext2_filsys fs, blk64_t *blocknr, 86 e2_blkcnt_t blockcnt, blk64_t ref_blk, 87 int ref_offset, void *priv_data); 88static void delete_file(e2fsck_t ctx, ext2_ino_t ino, 89 struct dup_inode *dp, char *block_buf); 90static int clone_file(e2fsck_t ctx, ext2_ino_t ino, 91 struct dup_inode *dp, char* block_buf); 92static int check_if_fs_block(e2fsck_t ctx, blk_t test_blk); 93 94static void pass1b(e2fsck_t ctx, char *block_buf); 95static void pass1c(e2fsck_t ctx, char *block_buf); 96static void pass1d(e2fsck_t ctx, char *block_buf); 97 98static int dup_inode_count = 0; 99static int dup_inode_founddir = 0; 100 101static dict_t blk_dict, ino_dict; 102 103static ext2fs_inode_bitmap inode_dup_map; 104 105static int dict_int_cmp(const void *a, const void *b) 106{ 107 intptr_t ia, ib; 108 109 ia = (intptr_t)a; 110 ib = (intptr_t)b; 111 112 return (ia-ib); 113} 114 115/* 116 * Add a duplicate block record 117 */ 118static void add_dupe(e2fsck_t ctx, ext2_ino_t ino, blk_t blk, 119 struct ext2_inode *inode) 120{ 121 dnode_t *n; 122 struct dup_block *db; 123 struct dup_inode *di; 124 struct block_el *blk_el; 125 struct inode_el *ino_el; 126 127 n = dict_lookup(&blk_dict, INT_TO_VOIDPTR(blk)); 128 if (n) 129 db = (struct dup_block *) dnode_get(n); 130 else { 131 db = (struct dup_block *) e2fsck_allocate_memory(ctx, 132 sizeof(struct dup_block), "duplicate block header"); 133 db->num_bad = 0; 134 db->inode_list = 0; 135 dict_alloc_insert(&blk_dict, INT_TO_VOIDPTR(blk), db); 136 } 137 ino_el = (struct inode_el *) e2fsck_allocate_memory(ctx, 138 sizeof(struct inode_el), "inode element"); 139 ino_el->inode = ino; 140 ino_el->next = db->inode_list; 141 db->inode_list = ino_el; 142 db->num_bad++; 143 144 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(ino)); 145 if (n) 146 di = (struct dup_inode *) dnode_get(n); 147 else { 148 di = (struct dup_inode *) e2fsck_allocate_memory(ctx, 149 sizeof(struct dup_inode), "duplicate inode header"); 150 if (ino == EXT2_ROOT_INO) { 151 di->dir = EXT2_ROOT_INO; 152 dup_inode_founddir++; 153 } else 154 di->dir = 0; 155 156 di->num_dupblocks = 0; 157 di->block_list = 0; 158 di->inode = *inode; 159 dict_alloc_insert(&ino_dict, INT_TO_VOIDPTR(ino), di); 160 } 161 blk_el = (struct block_el *) e2fsck_allocate_memory(ctx, 162 sizeof(struct block_el), "block element"); 163 blk_el->block = blk; 164 blk_el->next = di->block_list; 165 di->block_list = blk_el; 166 di->num_dupblocks++; 167} 168 169/* 170 * Free a duplicate inode record 171 */ 172static void inode_dnode_free(dnode_t *node, 173 void *context EXT2FS_ATTR((unused))) 174{ 175 struct dup_inode *di; 176 struct block_el *p, *next; 177 178 di = (struct dup_inode *) dnode_get(node); 179 for (p = di->block_list; p; p = next) { 180 next = p->next; 181 free(p); 182 } 183 free(di); 184 free(node); 185} 186 187/* 188 * Free a duplicate block record 189 */ 190static void block_dnode_free(dnode_t *node, 191 void *context EXT2FS_ATTR((unused))) 192{ 193 struct dup_block *db; 194 struct inode_el *p, *next; 195 196 db = (struct dup_block *) dnode_get(node); 197 for (p = db->inode_list; p; p = next) { 198 next = p->next; 199 free(p); 200 } 201 free(db); 202 free(node); 203} 204 205 206/* 207 * Main procedure for handling duplicate blocks 208 */ 209void e2fsck_pass1_dupblocks(e2fsck_t ctx, char *block_buf) 210{ 211 ext2_filsys fs = ctx->fs; 212 struct problem_context pctx; 213#ifdef RESOURCE_TRACK 214 struct resource_track rtrack; 215#endif 216 217 clear_problem_context(&pctx); 218 219 pctx.errcode = ext2fs_allocate_inode_bitmap(fs, 220 _("multiply claimed inode map"), &inode_dup_map); 221 if (pctx.errcode) { 222 fix_problem(ctx, PR_1B_ALLOCATE_IBITMAP_ERROR, &pctx); 223 ctx->flags |= E2F_FLAG_ABORT; 224 return; 225 } 226 227 dict_init(&ino_dict, DICTCOUNT_T_MAX, dict_int_cmp); 228 dict_init(&blk_dict, DICTCOUNT_T_MAX, dict_int_cmp); 229 dict_set_allocator(&ino_dict, NULL, inode_dnode_free, NULL); 230 dict_set_allocator(&blk_dict, NULL, block_dnode_free, NULL); 231 232 init_resource_track(&rtrack, ctx->fs->io); 233 pass1b(ctx, block_buf); 234 print_resource_track(ctx, "Pass 1b", &rtrack, ctx->fs->io); 235 236 init_resource_track(&rtrack, ctx->fs->io); 237 pass1c(ctx, block_buf); 238 print_resource_track(ctx, "Pass 1c", &rtrack, ctx->fs->io); 239 240 init_resource_track(&rtrack, ctx->fs->io); 241 pass1d(ctx, block_buf); 242 print_resource_track(ctx, "Pass 1d", &rtrack, ctx->fs->io); 243 244 /* 245 * Time to free all of the accumulated data structures that we 246 * don't need anymore. 247 */ 248 dict_free_nodes(&ino_dict); 249 dict_free_nodes(&blk_dict); 250 ext2fs_free_inode_bitmap(inode_dup_map); 251} 252 253/* 254 * Scan the inodes looking for inodes that contain duplicate blocks. 255 */ 256struct process_block_struct { 257 e2fsck_t ctx; 258 ext2_ino_t ino; 259 int dup_blocks; 260 struct ext2_inode *inode; 261 struct problem_context *pctx; 262}; 263 264static void pass1b(e2fsck_t ctx, char *block_buf) 265{ 266 ext2_filsys fs = ctx->fs; 267 ext2_ino_t ino; 268 struct ext2_inode inode; 269 ext2_inode_scan scan; 270 struct process_block_struct pb; 271 struct problem_context pctx; 272 273 clear_problem_context(&pctx); 274 275 if (!(ctx->options & E2F_OPT_PREEN)) 276 fix_problem(ctx, PR_1B_PASS_HEADER, &pctx); 277 pctx.errcode = ext2fs_open_inode_scan(fs, ctx->inode_buffer_blocks, 278 &scan); 279 if (pctx.errcode) { 280 fix_problem(ctx, PR_1B_ISCAN_ERROR, &pctx); 281 ctx->flags |= E2F_FLAG_ABORT; 282 return; 283 } 284 ctx->stashed_inode = &inode; 285 pb.ctx = ctx; 286 pb.pctx = &pctx; 287 pctx.str = "pass1b"; 288 while (1) { 289 pctx.errcode = ext2fs_get_next_inode(scan, &ino, &inode); 290 if (pctx.errcode == EXT2_ET_BAD_BLOCK_IN_INODE_TABLE) 291 continue; 292 if (pctx.errcode) { 293 fix_problem(ctx, PR_1B_ISCAN_ERROR, &pctx); 294 ctx->flags |= E2F_FLAG_ABORT; 295 return; 296 } 297 if (!ino) 298 break; 299 pctx.ino = ctx->stashed_ino = ino; 300 if ((ino != EXT2_BAD_INO) && 301 !ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino)) 302 continue; 303 304 pb.ino = ino; 305 pb.dup_blocks = 0; 306 pb.inode = &inode; 307 308 if (ext2fs_inode_has_valid_blocks(&inode) || 309 (ino == EXT2_BAD_INO)) 310 pctx.errcode = ext2fs_block_iterate3(fs, ino, 311 BLOCK_FLAG_READ_ONLY, block_buf, 312 process_pass1b_block, &pb); 313 if (ext2fs_file_acl_block(&inode)) { 314 blk64_t blk = ext2fs_file_acl_block(&inode); 315 process_pass1b_block(fs, &blk, 316 BLOCK_COUNT_EXTATTR, 0, 0, &pb); 317 ext2fs_file_acl_block_set(&inode, blk); 318 } 319 if (pb.dup_blocks) { 320 end_problem_latch(ctx, PR_LATCH_DBLOCK); 321 if (ino >= EXT2_FIRST_INODE(fs->super) || 322 ino == EXT2_ROOT_INO) 323 dup_inode_count++; 324 } 325 if (pctx.errcode) 326 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx); 327 } 328 ext2fs_close_inode_scan(scan); 329 e2fsck_use_inode_shortcuts(ctx, 0); 330} 331 332static int process_pass1b_block(ext2_filsys fs EXT2FS_ATTR((unused)), 333 blk64_t *block_nr, 334 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)), 335 blk64_t ref_blk EXT2FS_ATTR((unused)), 336 int ref_offset EXT2FS_ATTR((unused)), 337 void *priv_data) 338{ 339 struct process_block_struct *p; 340 e2fsck_t ctx; 341 342 if (HOLE_BLKADDR(*block_nr)) 343 return 0; 344 p = (struct process_block_struct *) priv_data; 345 ctx = p->ctx; 346 347 if (!ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr)) 348 return 0; 349 350 /* OK, this is a duplicate block */ 351 if (p->ino != EXT2_BAD_INO) { 352 p->pctx->blk = *block_nr; 353 fix_problem(ctx, PR_1B_DUP_BLOCK, p->pctx); 354 } 355 p->dup_blocks++; 356 ext2fs_mark_inode_bitmap2(inode_dup_map, p->ino); 357 358 add_dupe(ctx, p->ino, *block_nr, p->inode); 359 360 return 0; 361} 362 363/* 364 * Pass 1c: Scan directories for inodes with duplicate blocks. This 365 * is used so that we can print pathnames when prompting the user for 366 * what to do. 367 */ 368struct search_dir_struct { 369 int count; 370 ext2_ino_t first_inode; 371 ext2_ino_t max_inode; 372}; 373 374static int search_dirent_proc(ext2_ino_t dir, int entry, 375 struct ext2_dir_entry *dirent, 376 int offset EXT2FS_ATTR((unused)), 377 int blocksize EXT2FS_ATTR((unused)), 378 char *buf EXT2FS_ATTR((unused)), 379 void *priv_data) 380{ 381 struct search_dir_struct *sd; 382 struct dup_inode *p; 383 dnode_t *n; 384 385 sd = (struct search_dir_struct *) priv_data; 386 387 if (dirent->inode > sd->max_inode) 388 /* Should abort this inode, but not everything */ 389 return 0; 390 391 if ((dirent->inode < sd->first_inode) || (entry < DIRENT_OTHER_FILE) || 392 !ext2fs_test_inode_bitmap2(inode_dup_map, dirent->inode)) 393 return 0; 394 395 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(dirent->inode)); 396 if (!n) 397 return 0; 398 p = (struct dup_inode *) dnode_get(n); 399 if (!p->dir) { 400 p->dir = dir; 401 sd->count--; 402 } 403 404 return(sd->count ? 0 : DIRENT_ABORT); 405} 406 407 408static void pass1c(e2fsck_t ctx, char *block_buf) 409{ 410 ext2_filsys fs = ctx->fs; 411 struct search_dir_struct sd; 412 struct problem_context pctx; 413 414 clear_problem_context(&pctx); 415 416 if (!(ctx->options & E2F_OPT_PREEN)) 417 fix_problem(ctx, PR_1C_PASS_HEADER, &pctx); 418 419 /* 420 * Search through all directories to translate inodes to names 421 * (by searching for the containing directory for that inode.) 422 */ 423 sd.count = dup_inode_count - dup_inode_founddir; 424 sd.first_inode = EXT2_FIRST_INODE(fs->super); 425 sd.max_inode = fs->super->s_inodes_count; 426 ext2fs_dblist_dir_iterate(fs->dblist, 0, block_buf, 427 search_dirent_proc, &sd); 428} 429 430static void pass1d(e2fsck_t ctx, char *block_buf) 431{ 432 ext2_filsys fs = ctx->fs; 433 struct dup_inode *p, *t; 434 struct dup_block *q; 435 ext2_ino_t *shared, ino; 436 int shared_len; 437 int i; 438 int file_ok; 439 int meta_data = 0; 440 struct problem_context pctx; 441 dnode_t *n, *m; 442 struct block_el *s; 443 struct inode_el *r; 444 445 clear_problem_context(&pctx); 446 447 if (!(ctx->options & E2F_OPT_PREEN)) 448 fix_problem(ctx, PR_1D_PASS_HEADER, &pctx); 449 e2fsck_read_bitmaps(ctx); 450 451 pctx.num = dup_inode_count; /* dict_count(&ino_dict); */ 452 fix_problem(ctx, PR_1D_NUM_DUP_INODES, &pctx); 453 shared = (ext2_ino_t *) e2fsck_allocate_memory(ctx, 454 sizeof(ext2_ino_t) * dict_count(&ino_dict), 455 "Shared inode list"); 456 for (n = dict_first(&ino_dict); n; n = dict_next(&ino_dict, n)) { 457 p = (struct dup_inode *) dnode_get(n); 458 shared_len = 0; 459 file_ok = 1; 460 ino = (ext2_ino_t)VOIDPTR_TO_INT(dnode_getkey(n)); 461 if (ino == EXT2_BAD_INO || ino == EXT2_RESIZE_INO) 462 continue; 463 464 /* 465 * Find all of the inodes which share blocks with this 466 * one. First we find all of the duplicate blocks 467 * belonging to this inode, and then search each block 468 * get the list of inodes, and merge them together. 469 */ 470 for (s = p->block_list; s; s = s->next) { 471 m = dict_lookup(&blk_dict, INT_TO_VOIDPTR(s->block)); 472 if (!m) 473 continue; /* Should never happen... */ 474 q = (struct dup_block *) dnode_get(m); 475 if (q->num_bad > 1) 476 file_ok = 0; 477 if (check_if_fs_block(ctx, s->block)) { 478 file_ok = 0; 479 meta_data = 1; 480 } 481 482 /* 483 * Add all inodes used by this block to the 484 * shared[] --- which is a unique list, so 485 * if an inode is already in shared[], don't 486 * add it again. 487 */ 488 for (r = q->inode_list; r; r = r->next) { 489 if (r->inode == ino) 490 continue; 491 for (i = 0; i < shared_len; i++) 492 if (shared[i] == r->inode) 493 break; 494 if (i == shared_len) { 495 shared[shared_len++] = r->inode; 496 } 497 } 498 } 499 500 /* 501 * Report the inode that we are working on 502 */ 503 pctx.inode = &p->inode; 504 pctx.ino = ino; 505 pctx.dir = p->dir; 506 pctx.blkcount = p->num_dupblocks; 507 pctx.num = meta_data ? shared_len+1 : shared_len; 508 fix_problem(ctx, PR_1D_DUP_FILE, &pctx); 509 pctx.blkcount = 0; 510 pctx.num = 0; 511 512 if (meta_data) 513 fix_problem(ctx, PR_1D_SHARE_METADATA, &pctx); 514 515 for (i = 0; i < shared_len; i++) { 516 m = dict_lookup(&ino_dict, INT_TO_VOIDPTR(shared[i])); 517 if (!m) 518 continue; /* should never happen */ 519 t = (struct dup_inode *) dnode_get(m); 520 /* 521 * Report the inode that we are sharing with 522 */ 523 pctx.inode = &t->inode; 524 pctx.ino = shared[i]; 525 pctx.dir = t->dir; 526 fix_problem(ctx, PR_1D_DUP_FILE_LIST, &pctx); 527 } 528 if (file_ok) { 529 fix_problem(ctx, PR_1D_DUP_BLOCKS_DEALT, &pctx); 530 continue; 531 } 532 if (fix_problem(ctx, PR_1D_CLONE_QUESTION, &pctx)) { 533 pctx.errcode = clone_file(ctx, ino, p, block_buf); 534 if (pctx.errcode) 535 fix_problem(ctx, PR_1D_CLONE_ERROR, &pctx); 536 else 537 continue; 538 } 539 if (fix_problem(ctx, PR_1D_DELETE_QUESTION, &pctx)) 540 delete_file(ctx, ino, p, block_buf); 541 else 542 ext2fs_unmark_valid(fs); 543 } 544 ext2fs_free_mem(&shared); 545} 546 547/* 548 * Drop the refcount on the dup_block structure, and clear the entry 549 * in the block_dup_map if appropriate. 550 */ 551static void decrement_badcount(e2fsck_t ctx, blk_t block, struct dup_block *p) 552{ 553 p->num_bad--; 554 if (p->num_bad <= 0 || 555 (p->num_bad == 1 && !check_if_fs_block(ctx, block))) 556 ext2fs_unmark_block_bitmap2(ctx->block_dup_map, block); 557} 558 559static int delete_file_block(ext2_filsys fs, 560 blk64_t *block_nr, 561 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)), 562 blk64_t ref_block EXT2FS_ATTR((unused)), 563 int ref_offset EXT2FS_ATTR((unused)), 564 void *priv_data) 565{ 566 struct process_block_struct *pb; 567 struct dup_block *p; 568 dnode_t *n; 569 e2fsck_t ctx; 570 571 pb = (struct process_block_struct *) priv_data; 572 ctx = pb->ctx; 573 574 if (HOLE_BLKADDR(*block_nr)) 575 return 0; 576 577 if (ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr)) { 578 n = dict_lookup(&blk_dict, INT_TO_VOIDPTR(*block_nr)); 579 if (n) { 580 p = (struct dup_block *) dnode_get(n); 581 decrement_badcount(ctx, *block_nr, p); 582 } else 583 com_err("delete_file_block", 0, 584 _("internal error: can't find dup_blk for %llu\n"), 585 *block_nr); 586 } else { 587 ext2fs_unmark_block_bitmap2(ctx->block_found_map, *block_nr); 588 ext2fs_block_alloc_stats(fs, *block_nr, -1); 589 } 590 591 return 0; 592} 593 594static void delete_file(e2fsck_t ctx, ext2_ino_t ino, 595 struct dup_inode *dp, char* block_buf) 596{ 597 ext2_filsys fs = ctx->fs; 598 struct process_block_struct pb; 599 struct ext2_inode inode; 600 struct problem_context pctx; 601 unsigned int count; 602 603 clear_problem_context(&pctx); 604 pctx.ino = pb.ino = ino; 605 pb.dup_blocks = dp->num_dupblocks; 606 pb.ctx = ctx; 607 pctx.str = "delete_file"; 608 609 e2fsck_read_inode(ctx, ino, &inode, "delete_file"); 610 if (ext2fs_inode_has_valid_blocks(&inode)) 611 pctx.errcode = ext2fs_block_iterate3(fs, ino, BLOCK_FLAG_READ_ONLY, 612 block_buf, delete_file_block, &pb); 613 if (pctx.errcode) 614 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx); 615 if (ctx->inode_bad_map) 616 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino); 617 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode)); 618 619 /* Inode may have changed by block_iterate, so reread it */ 620 e2fsck_read_inode(ctx, ino, &inode, "delete_file"); 621 e2fsck_clear_inode(ctx, ino, &inode, 0, "delete_file"); 622 if (ext2fs_file_acl_block(&inode) && 623 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) { 624 count = 1; 625 pctx.errcode = ext2fs_adjust_ea_refcount(fs, 626 ext2fs_file_acl_block(&inode), 627 block_buf, -1, &count); 628 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) { 629 pctx.errcode = 0; 630 count = 1; 631 } 632 if (pctx.errcode) { 633 pctx.blk = ext2fs_file_acl_block(&inode); 634 fix_problem(ctx, PR_1B_ADJ_EA_REFCOUNT, &pctx); 635 } 636 /* 637 * If the count is zero, then arrange to have the 638 * block deleted. If the block is in the block_dup_map, 639 * also call delete_file_block since it will take care 640 * of keeping the accounting straight. 641 */ 642 if ((count == 0) || 643 ext2fs_test_block_bitmap2(ctx->block_dup_map, 644 ext2fs_file_acl_block(&inode))) { 645 blk64_t blk = ext2fs_file_acl_block(&inode); 646 delete_file_block(fs, &blk, 647 BLOCK_COUNT_EXTATTR, 0, 0, &pb); 648 ext2fs_file_acl_block_set(&inode, blk); 649 } 650 } 651} 652 653struct clone_struct { 654 errcode_t errcode; 655 ext2_ino_t dir; 656 char *buf; 657 e2fsck_t ctx; 658}; 659 660static int clone_file_block(ext2_filsys fs, 661 blk64_t *block_nr, 662 e2_blkcnt_t blockcnt, 663 blk64_t ref_block EXT2FS_ATTR((unused)), 664 int ref_offset EXT2FS_ATTR((unused)), 665 void *priv_data) 666{ 667 struct dup_block *p; 668 blk64_t new_block; 669 errcode_t retval; 670 struct clone_struct *cs = (struct clone_struct *) priv_data; 671 dnode_t *n; 672 e2fsck_t ctx; 673 674 ctx = cs->ctx; 675 676 if (HOLE_BLKADDR(*block_nr)) 677 return 0; 678 679 if (ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr)) { 680 n = dict_lookup(&blk_dict, INT_TO_VOIDPTR(*block_nr)); 681 if (n) { 682 p = (struct dup_block *) dnode_get(n); 683 retval = ext2fs_new_block2(fs, 0, ctx->block_found_map, 684 &new_block); 685 if (retval) { 686 cs->errcode = retval; 687 return BLOCK_ABORT; 688 } 689 if (cs->dir && (blockcnt >= 0)) { 690 retval = ext2fs_set_dir_block(fs->dblist, 691 cs->dir, new_block, blockcnt); 692 if (retval) { 693 cs->errcode = retval; 694 return BLOCK_ABORT; 695 } 696 } 697#if 0 698 printf("Cloning block %u to %u\n", *block_nr, 699 new_block); 700#endif 701 retval = io_channel_read_blk64(fs->io, *block_nr, 1, 702 cs->buf); 703 if (retval) { 704 cs->errcode = retval; 705 return BLOCK_ABORT; 706 } 707 retval = io_channel_write_blk64(fs->io, new_block, 1, 708 cs->buf); 709 if (retval) { 710 cs->errcode = retval; 711 return BLOCK_ABORT; 712 } 713 decrement_badcount(ctx, *block_nr, p); 714 *block_nr = new_block; 715 ext2fs_mark_block_bitmap2(ctx->block_found_map, 716 new_block); 717 ext2fs_mark_block_bitmap2(fs->block_map, new_block); 718 return BLOCK_CHANGED; 719 } else 720 com_err("clone_file_block", 0, 721 _("internal error: can't find dup_blk for %llu\n"), 722 *block_nr); 723 } 724 return 0; 725} 726 727static int clone_file(e2fsck_t ctx, ext2_ino_t ino, 728 struct dup_inode *dp, char* block_buf) 729{ 730 ext2_filsys fs = ctx->fs; 731 errcode_t retval; 732 struct clone_struct cs; 733 struct problem_context pctx; 734 blk64_t blk, new_blk; 735 dnode_t *n; 736 struct inode_el *ino_el; 737 struct dup_block *db; 738 struct dup_inode *di; 739 740 clear_problem_context(&pctx); 741 cs.errcode = 0; 742 cs.dir = 0; 743 cs.ctx = ctx; 744 retval = ext2fs_get_mem(fs->blocksize, &cs.buf); 745 if (retval) 746 return retval; 747 748 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, ino)) 749 cs.dir = ino; 750 751 pctx.ino = ino; 752 pctx.str = "clone_file"; 753 if (ext2fs_inode_has_valid_blocks(&dp->inode)) 754 pctx.errcode = ext2fs_block_iterate3(fs, ino, 0, block_buf, 755 clone_file_block, &cs); 756 ext2fs_mark_bb_dirty(fs); 757 if (pctx.errcode) { 758 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx); 759 retval = pctx.errcode; 760 goto errout; 761 } 762 if (cs.errcode) { 763 com_err("clone_file", cs.errcode, 764 _("returned from clone_file_block")); 765 retval = cs.errcode; 766 goto errout; 767 } 768 /* The inode may have changed on disk, so we have to re-read it */ 769 e2fsck_read_inode(ctx, ino, &dp->inode, "clone file EA"); 770 blk = ext2fs_file_acl_block(&dp->inode); 771 new_blk = blk; 772 if (blk && (clone_file_block(fs, &new_blk, 773 BLOCK_COUNT_EXTATTR, 0, 0, &cs) == 774 BLOCK_CHANGED)) { 775 ext2fs_file_acl_block_set(&dp->inode, new_blk); 776 e2fsck_write_inode(ctx, ino, &dp->inode, "clone file EA"); 777 /* 778 * If we cloned the EA block, find all other inodes 779 * which refered to that EA block, and modify 780 * them to point to the new EA block. 781 */ 782 n = dict_lookup(&blk_dict, INT_TO_VOIDPTR(blk)); 783 if (!n) { 784 com_err("clone_file", 0, 785 _("internal error: couldn't lookup EA " 786 "block record for %llu"), blk); 787 retval = 0; /* OK to stumble on... */ 788 goto errout; 789 } 790 db = (struct dup_block *) dnode_get(n); 791 for (ino_el = db->inode_list; ino_el; ino_el = ino_el->next) { 792 if (ino_el->inode == ino) 793 continue; 794 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(ino_el->inode)); 795 if (!n) { 796 com_err("clone_file", 0, 797 _("internal error: couldn't lookup EA " 798 "inode record for %u"), 799 ino_el->inode); 800 retval = 0; /* OK to stumble on... */ 801 goto errout; 802 } 803 di = (struct dup_inode *) dnode_get(n); 804 if (ext2fs_file_acl_block(&di->inode) == blk) { 805 ext2fs_file_acl_block_set(&di->inode, 806 ext2fs_file_acl_block(&dp->inode)); 807 e2fsck_write_inode(ctx, ino_el->inode, 808 &di->inode, "clone file EA"); 809 decrement_badcount(ctx, blk, db); 810 } 811 } 812 } 813 retval = 0; 814errout: 815 ext2fs_free_mem(&cs.buf); 816 return retval; 817} 818 819/* 820 * This routine returns 1 if a block overlaps with one of the superblocks, 821 * group descriptors, inode bitmaps, or block bitmaps. 822 */ 823static int check_if_fs_block(e2fsck_t ctx, blk_t test_block) 824{ 825 ext2_filsys fs = ctx->fs; 826 blk_t first_block; 827 dgrp_t i; 828 829 first_block = fs->super->s_first_data_block; 830 for (i = 0; i < fs->group_desc_count; i++) { 831 832 /* Check superblocks/block group descriptors */ 833 if (ext2fs_bg_has_super(fs, i)) { 834 if (test_block >= first_block && 835 (test_block <= first_block + fs->desc_blocks)) 836 return 1; 837 } 838 839 /* Check the inode table */ 840 if ((fs->group_desc[i].bg_inode_table) && 841 (test_block >= fs->group_desc[i].bg_inode_table) && 842 (test_block < (fs->group_desc[i].bg_inode_table + 843 fs->inode_blocks_per_group))) 844 return 1; 845 846 /* Check the bitmap blocks */ 847 if ((test_block == fs->group_desc[i].bg_block_bitmap) || 848 (test_block == fs->group_desc[i].bg_inode_bitmap)) 849 return 1; 850 851 first_block += fs->super->s_blocks_per_group; 852 } 853 return 0; 854} 855