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