2 * pass1b.c --- Pass #1b of e2fsck
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
8 * Pass1B scans the data blocks of all the inodes again, generating a
9 * complete list of duplicate blocks and which inodes have claimed
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.
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.
21 * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o.
24 * This file may be redistributed under the terms of the GNU Public
36 #ifdef HAVE_INTTYPES_H
41 typedef long intptr_t;
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))
48 #include <et/com_err.h>
52 #include "support/dict.h"
54 /* Define an extension to the ext2 library's block count information */
55 #define BLOCK_COUNT_EXTATTR (-5)
59 struct cluster_el *next;
64 struct inode_el *next;
69 struct inode_el *inode_list;
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.
82 struct ext2_inode_large inode;
83 struct cluster_el *cluster_list;
86 static 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);
89 static void delete_file(e2fsck_t ctx, ext2_ino_t ino,
90 struct dup_inode *dp, char *block_buf);
91 static errcode_t clone_file(e2fsck_t ctx, ext2_ino_t ino,
92 struct dup_inode *dp, char* block_buf);
93 static int check_if_fs_block(e2fsck_t ctx, blk64_t test_block);
94 static int check_if_fs_cluster(e2fsck_t ctx, blk64_t cluster);
96 static void pass1b(e2fsck_t ctx, char *block_buf);
97 static void pass1c(e2fsck_t ctx, char *block_buf);
98 static void pass1d(e2fsck_t ctx, char *block_buf);
100 static int dup_inode_count = 0;
101 static int dup_inode_founddir = 0;
103 static dict_t clstr_dict, ino_dict;
105 static ext2fs_inode_bitmap inode_dup_map;
107 static int dict_int_cmp(const void *cmp_ctx EXT2FS_ATTR((unused)),
108 const void *a, const void *b)
119 * Add a duplicate block record
121 static void add_dupe(e2fsck_t ctx, ext2_ino_t ino, blk64_t cluster,
122 struct ext2_inode_large *inode)
125 struct dup_cluster *db;
126 struct dup_inode *di;
127 struct cluster_el *cluster_el;
128 struct inode_el *ino_el;
130 n = dict_lookup(&clstr_dict, INT_TO_VOIDPTR(cluster));
132 db = (struct dup_cluster *) dnode_get(n);
134 db = (struct dup_cluster *) e2fsck_allocate_memory(ctx,
135 sizeof(struct dup_cluster), "duplicate cluster header");
138 dict_alloc_insert(&clstr_dict, INT_TO_VOIDPTR(cluster), db);
140 ino_el = (struct inode_el *) e2fsck_allocate_memory(ctx,
141 sizeof(struct inode_el), "inode element");
143 ino_el->next = db->inode_list;
144 db->inode_list = ino_el;
147 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(ino));
149 di = (struct dup_inode *) dnode_get(n);
151 di = (struct dup_inode *) e2fsck_allocate_memory(ctx,
152 sizeof(struct dup_inode), "duplicate inode header");
153 if (ino == EXT2_ROOT_INO) {
154 di->dir = EXT2_ROOT_INO;
155 dup_inode_founddir++;
159 di->num_dupblocks = 0;
160 di->cluster_list = 0;
162 dict_alloc_insert(&ino_dict, INT_TO_VOIDPTR(ino), di);
164 cluster_el = (struct cluster_el *) e2fsck_allocate_memory(ctx,
165 sizeof(struct cluster_el), "cluster element");
166 cluster_el->cluster = cluster;
167 cluster_el->next = di->cluster_list;
168 di->cluster_list = cluster_el;
173 * Free a duplicate inode record
175 static void inode_dnode_free(dnode_t *node,
176 void *context EXT2FS_ATTR((unused)))
178 struct dup_inode *di;
179 struct cluster_el *p, *next;
181 di = (struct dup_inode *) dnode_get(node);
182 for (p = di->cluster_list; p; p = next) {
186 ext2fs_free_mem(&di);
187 ext2fs_free_mem(&node);
191 * Free a duplicate cluster record
193 static void cluster_dnode_free(dnode_t *node,
194 void *context EXT2FS_ATTR((unused)))
196 struct dup_cluster *dc;
197 struct inode_el *p, *next;
199 dc = (struct dup_cluster *) dnode_get(node);
200 for (p = dc->inode_list; p; p = next) {
204 ext2fs_free_mem(&dc);
205 ext2fs_free_mem(&node);
210 * Main procedure for handling duplicate blocks
212 void e2fsck_pass1_dupblocks(e2fsck_t ctx, char *block_buf)
214 ext2_filsys fs = ctx->fs;
215 struct problem_context pctx;
216 #ifdef RESOURCE_TRACK
217 struct resource_track rtrack;
220 clear_problem_context(&pctx);
222 pctx.errcode = e2fsck_allocate_inode_bitmap(fs,
223 _("multiply claimed inode map"),
224 EXT2FS_BMAP64_RBTREE, "inode_dup_map",
227 fix_problem(ctx, PR_1B_ALLOCATE_IBITMAP_ERROR, &pctx);
228 ctx->flags |= E2F_FLAG_ABORT;
232 dict_init(&ino_dict, DICTCOUNT_T_MAX, dict_int_cmp);
233 dict_init(&clstr_dict, DICTCOUNT_T_MAX, dict_int_cmp);
234 dict_set_allocator(&ino_dict, NULL, inode_dnode_free, NULL);
235 dict_set_allocator(&clstr_dict, NULL, cluster_dnode_free, NULL);
237 init_resource_track(&rtrack, ctx->fs->io);
238 pass1b(ctx, block_buf);
239 print_resource_track(ctx, "Pass 1b", &rtrack, ctx->fs->io);
241 init_resource_track(&rtrack, ctx->fs->io);
242 pass1c(ctx, block_buf);
243 print_resource_track(ctx, "Pass 1c", &rtrack, ctx->fs->io);
245 init_resource_track(&rtrack, ctx->fs->io);
246 pass1d(ctx, block_buf);
247 print_resource_track(ctx, "Pass 1d", &rtrack, ctx->fs->io);
249 if (ext2fs_has_feature_shared_blocks(ctx->fs->super) &&
250 (ctx->options & E2F_OPT_UNSHARE_BLOCKS)) {
252 * If we successfully managed to unshare all blocks, unset the
253 * shared block feature.
256 int result = ext2fs_find_first_set_block_bitmap2(
258 ctx->fs->super->s_first_data_block,
259 ext2fs_blocks_count(ctx->fs->super) - 1,
261 if (result == ENOENT && !(ctx->options & E2F_OPT_NO)) {
262 ext2fs_clear_feature_shared_blocks(ctx->fs->super);
263 ext2fs_mark_super_dirty(ctx->fs);
268 * Time to free all of the accumulated data structures that we
269 * don't need anymore.
271 dict_free_nodes(&ino_dict);
272 dict_free_nodes(&clstr_dict);
273 ext2fs_free_inode_bitmap(inode_dup_map);
277 * Scan the inodes looking for inodes that contain duplicate blocks.
279 struct process_block_struct {
283 blk64_t cur_cluster, phys_cluster;
285 struct ext2_inode_large *inode;
286 struct problem_context *pctx;
289 static void pass1b(e2fsck_t ctx, char *block_buf)
291 ext2_filsys fs = ctx->fs;
293 struct ext2_inode_large inode;
294 ext2_inode_scan scan;
295 struct process_block_struct pb;
296 struct problem_context pctx;
299 clear_problem_context(&pctx);
301 if (!(ctx->options & E2F_OPT_PREEN))
302 fix_problem(ctx, PR_1B_PASS_HEADER, &pctx);
303 pctx.errcode = ext2fs_open_inode_scan(fs, ctx->inode_buffer_blocks,
306 fix_problem(ctx, PR_1B_ISCAN_ERROR, &pctx);
307 ctx->flags |= E2F_FLAG_ABORT;
310 ctx->stashed_inode = EXT2_INODE(&inode);
315 if (ino % (fs->super->s_inodes_per_group * 4) == 1) {
316 if (e2fsck_mmp_update(fs))
319 pctx.errcode = ext2fs_get_next_inode_full(scan, &ino,
320 EXT2_INODE(&inode), sizeof(inode));
321 if (pctx.errcode == EXT2_ET_BAD_BLOCK_IN_INODE_TABLE)
325 fix_problem(ctx, PR_1B_ISCAN_ERROR, &pctx);
326 ctx->flags |= E2F_FLAG_ABORT;
331 pctx.ino = ctx->stashed_ino = ino;
332 if ((ino != EXT2_BAD_INO) &&
333 !ext2fs_test_inode_bitmap2(ctx->inode_used_map, ino))
340 pb.phys_cluster = ~0;
342 pb.pctx->blk = pb.pctx->blk2 = 0;
344 if (ext2fs_inode_has_valid_blocks2(fs, EXT2_INODE(&inode)) ||
345 (ino == EXT2_BAD_INO))
346 pctx.errcode = ext2fs_block_iterate3(fs, ino,
347 BLOCK_FLAG_READ_ONLY, block_buf,
348 process_pass1b_block, &pb);
349 /* If the feature is not set, attrs will be cleared later anyway */
350 if (ext2fs_has_feature_xattr(fs->super) &&
351 ext2fs_file_acl_block(fs, EXT2_INODE(&inode))) {
352 blk64_t blk = ext2fs_file_acl_block(fs, EXT2_INODE(&inode));
353 process_pass1b_block(fs, &blk,
354 BLOCK_COUNT_EXTATTR, 0, 0, &pb);
355 ext2fs_file_acl_block_set(fs, EXT2_INODE(&inode), blk);
358 if (ino != EXT2_BAD_INO) {
359 op = pctx.blk == pctx.blk2 ?
360 PR_1B_DUP_BLOCK : PR_1B_DUP_RANGE;
361 fix_problem(ctx, op, pb.pctx);
363 end_problem_latch(ctx, PR_LATCH_DBLOCK);
364 if (ino >= EXT2_FIRST_INODE(fs->super) ||
365 ino == EXT2_ROOT_INO)
369 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx);
371 ext2fs_close_inode_scan(scan);
372 e2fsck_use_inode_shortcuts(ctx, 0);
375 static int process_pass1b_block(ext2_filsys fs EXT2FS_ATTR((unused)),
377 e2_blkcnt_t blockcnt,
378 blk64_t ref_blk EXT2FS_ATTR((unused)),
379 int ref_offset EXT2FS_ATTR((unused)),
382 struct process_block_struct *p;
389 p = (struct process_block_struct *) priv_data;
391 lc = EXT2FS_B2C(fs, blockcnt);
392 pc = EXT2FS_B2C(fs, *block_nr);
394 if (!ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr))
397 /* OK, this is a duplicate block */
398 if (p->ino != EXT2_BAD_INO) {
399 if (p->last_blk + 1 != *block_nr) {
401 op = p->pctx->blk == p->pctx->blk2 ?
404 fix_problem(ctx, op, p->pctx);
406 p->pctx->blk = *block_nr;
408 p->pctx->blk2 = *block_nr;
409 p->last_blk = *block_nr;
412 ext2fs_mark_inode_bitmap2(inode_dup_map, p->ino);
415 * Qualifications for submitting a block for duplicate processing:
416 * It's an extent/indirect block (and has a negative logical offset);
417 * we've crossed a logical cluster boundary; or the physical cluster
418 * suddenly changed, which indicates that blocks in a logical cluster
419 * are mapped to multiple physical clusters.
421 if (blockcnt < 0 || lc != p->cur_cluster || pc != p->phys_cluster)
422 add_dupe(ctx, p->ino, EXT2FS_B2C(fs, *block_nr), p->inode);
426 p->phys_cluster = pc;
431 * Pass 1c: Scan directories for inodes with duplicate blocks. This
432 * is used so that we can print pathnames when prompting the user for
435 struct search_dir_struct {
437 ext2_ino_t first_inode;
438 ext2_ino_t max_inode;
441 static int search_dirent_proc(ext2_ino_t dir, int entry,
442 struct ext2_dir_entry *dirent,
443 int offset EXT2FS_ATTR((unused)),
444 int blocksize EXT2FS_ATTR((unused)),
445 char *buf EXT2FS_ATTR((unused)),
448 struct search_dir_struct *sd;
452 sd = (struct search_dir_struct *) priv_data;
454 if (dirent->inode > sd->max_inode)
455 /* Should abort this inode, but not everything */
458 if ((dirent->inode < sd->first_inode) || (entry < DIRENT_OTHER_FILE) ||
459 !ext2fs_test_inode_bitmap2(inode_dup_map, dirent->inode))
462 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(dirent->inode));
465 p = (struct dup_inode *) dnode_get(n);
471 return(sd->count ? 0 : DIRENT_ABORT);
475 static void pass1c(e2fsck_t ctx, char *block_buf)
477 ext2_filsys fs = ctx->fs;
478 struct search_dir_struct sd;
479 struct problem_context pctx;
481 clear_problem_context(&pctx);
483 if (!(ctx->options & E2F_OPT_PREEN))
484 fix_problem(ctx, PR_1C_PASS_HEADER, &pctx);
487 * Search through all directories to translate inodes to names
488 * (by searching for the containing directory for that inode.)
490 sd.count = dup_inode_count - dup_inode_founddir;
491 sd.first_inode = EXT2_FIRST_INODE(fs->super);
492 sd.max_inode = fs->super->s_inodes_count;
493 ext2fs_dblist_dir_iterate(fs->dblist, 0, block_buf,
494 search_dirent_proc, &sd);
497 static void pass1d(e2fsck_t ctx, char *block_buf)
499 ext2_filsys fs = ctx->fs;
500 struct dup_inode *p, *t;
501 struct dup_cluster *q;
502 ext2_ino_t *shared, ino;
507 struct problem_context pctx;
509 struct cluster_el *s;
512 clear_problem_context(&pctx);
514 if (!(ctx->options & E2F_OPT_PREEN))
515 fix_problem(ctx, PR_1D_PASS_HEADER, &pctx);
516 e2fsck_read_bitmaps(ctx);
518 pctx.num = dup_inode_count; /* dict_count(&ino_dict); */
519 fix_problem(ctx, PR_1D_NUM_DUP_INODES, &pctx);
520 shared = (ext2_ino_t *) e2fsck_allocate_memory(ctx,
521 sizeof(ext2_ino_t) * dict_count(&ino_dict),
522 "Shared inode list");
523 for (n = dict_first(&ino_dict); n; n = dict_next(&ino_dict, n)) {
524 p = (struct dup_inode *) dnode_get(n);
527 ino = (ext2_ino_t)VOIDPTR_TO_INT(dnode_getkey(n));
528 if (ino == EXT2_BAD_INO || ino == EXT2_RESIZE_INO)
532 * Find all of the inodes which share blocks with this
533 * one. First we find all of the duplicate blocks
534 * belonging to this inode, and then search each block
535 * get the list of inodes, and merge them together.
537 for (s = p->cluster_list; s; s = s->next) {
538 m = dict_lookup(&clstr_dict,
539 INT_TO_VOIDPTR(s->cluster));
541 continue; /* Should never happen... */
542 q = (struct dup_cluster *) dnode_get(m);
545 if (q->num_bad == 1 && (ctx->clone == E2F_CLONE_ZERO ||
546 ctx->shared != E2F_SHARED_PRESERVE))
548 if (check_if_fs_cluster(ctx, s->cluster)) {
554 * Add all inodes used by this block to the
555 * shared[] --- which is a unique list, so
556 * if an inode is already in shared[], don't
559 for (r = q->inode_list; r; r = r->next) {
562 for (i = 0; i < shared_len; i++)
563 if (shared[i] == r->inode)
565 if (i == shared_len) {
566 shared[shared_len++] = r->inode;
572 * Report the inode that we are working on
574 pctx.inode = EXT2_INODE(&p->inode);
577 pctx.blkcount = p->num_dupblocks;
578 pctx.num = meta_data ? shared_len+1 : shared_len;
579 fix_problem(ctx, PR_1D_DUP_FILE, &pctx);
584 fix_problem(ctx, PR_1D_SHARE_METADATA, &pctx);
586 for (i = 0; i < shared_len; i++) {
587 m = dict_lookup(&ino_dict, INT_TO_VOIDPTR(shared[i]));
589 continue; /* should never happen */
590 t = (struct dup_inode *) dnode_get(m);
592 * Report the inode that we are sharing with
594 pctx.inode = EXT2_INODE(&t->inode);
595 pctx.ino = shared[i];
597 fix_problem(ctx, PR_1D_DUP_FILE_LIST, &pctx);
600 * Even if the file shares blocks with itself, we still need to
603 if (file_ok && (meta_data ? shared_len+1 : shared_len) != 0) {
604 fix_problem(ctx, PR_1D_DUP_BLOCKS_DEALT, &pctx);
607 if (ctx->shared != E2F_SHARED_DELETE &&
608 ((ctx->options & E2F_OPT_UNSHARE_BLOCKS) ||
609 fix_problem(ctx, PR_1D_CLONE_QUESTION, &pctx))) {
610 pctx.errcode = clone_file(ctx, ino, p, block_buf);
612 fix_problem(ctx, PR_1D_CLONE_ERROR, &pctx);
615 if (ctx->shared == E2F_SHARED_LPF &&
616 fix_problem(ctx, PR_1D_DISCONNECT_QUESTION, &pctx)){
617 pctx.errcode = ext2fs_unlink(fs, p->dir,
620 fix_problem(ctx, PR_1D_DISCONNECT_ERROR,
629 * Note: When unsharing blocks, we don't prompt to delete
630 * files. If the clone operation fails than the unshare
631 * operation should fail too.
633 if (!(ctx->options & E2F_OPT_UNSHARE_BLOCKS) &&
634 fix_problem(ctx, PR_1D_DELETE_QUESTION, &pctx))
635 delete_file(ctx, ino, p, block_buf);
637 ext2fs_unmark_valid(fs);
639 ext2fs_free_mem(&shared);
643 * Drop the refcount on the dup_block structure, and clear the entry
644 * in the block_dup_map if appropriate.
646 static void decrement_badcount(e2fsck_t ctx, blk64_t block,
647 struct dup_cluster *p)
650 if (p->num_bad <= 0 ||
651 (p->num_bad == 1 && !check_if_fs_block(ctx, block) &&
652 ctx->clone == E2F_CLONE_DUP)) {
653 if (check_if_fs_cluster(ctx, EXT2FS_B2C(ctx->fs, block)))
655 ext2fs_unmark_block_bitmap2(ctx->block_dup_map, block);
659 static int delete_file_block(ext2_filsys fs,
661 e2_blkcnt_t blockcnt,
662 blk64_t ref_block EXT2FS_ATTR((unused)),
663 int ref_offset EXT2FS_ATTR((unused)),
666 struct process_block_struct *pb;
667 struct dup_cluster *p;
672 pb = (struct process_block_struct *) priv_data;
678 c = EXT2FS_B2C(fs, *block_nr);
679 lc = EXT2FS_B2C(fs, blockcnt);
680 if (ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr)) {
681 n = dict_lookup(&clstr_dict, INT_TO_VOIDPTR(c));
683 if (lc != pb->cur_cluster) {
684 p = (struct dup_cluster *) dnode_get(n);
685 decrement_badcount(ctx, *block_nr, p);
689 com_err("delete_file_block", 0,
690 _("internal error: can't find dup_blk for %llu\n"),
691 (unsigned long long) *block_nr);
693 if ((*block_nr % EXT2FS_CLUSTER_RATIO(ctx->fs)) == 0)
694 ext2fs_block_alloc_stats2(fs, *block_nr, -1);
697 pb->cur_cluster = lc;
702 static void delete_file(e2fsck_t ctx, ext2_ino_t ino,
703 struct dup_inode *dp, char* block_buf)
705 ext2_filsys fs = ctx->fs;
706 struct process_block_struct pb;
707 struct problem_context pctx;
710 clear_problem_context(&pctx);
711 pctx.ino = pb.ino = ino;
714 pctx.str = "delete_file";
717 if (ext2fs_inode_has_valid_blocks2(fs, EXT2_INODE(&dp->inode)))
718 pctx.errcode = ext2fs_block_iterate3(fs, ino,
719 BLOCK_FLAG_READ_ONLY,
721 delete_file_block, &pb);
723 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx);
724 if (ctx->inode_bad_map)
725 ext2fs_unmark_inode_bitmap2(ctx->inode_bad_map, ino);
726 if (ctx->inode_reg_map)
727 ext2fs_unmark_inode_bitmap2(ctx->inode_reg_map, ino);
728 ext2fs_unmark_inode_bitmap2(ctx->inode_dir_map, ino);
729 ext2fs_unmark_inode_bitmap2(ctx->inode_used_map, ino);
730 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(dp->inode.i_mode));
731 quota_data_sub(ctx->qctx, &dp->inode, ino,
732 pb.dup_blocks * fs->blocksize);
733 quota_data_inodes(ctx->qctx, &dp->inode, ino, -1);
735 /* Inode may have changed by block_iterate, so reread it */
736 e2fsck_read_inode_full(ctx, ino, EXT2_INODE(&dp->inode),
737 sizeof(dp->inode), "delete_file");
738 e2fsck_clear_inode(ctx, ino, EXT2_INODE(&dp->inode), 0, "delete_file");
739 if (ext2fs_file_acl_block(fs, EXT2_INODE(&dp->inode)) &&
740 ext2fs_has_feature_xattr(fs->super)) {
741 blk64_t file_acl_block = ext2fs_file_acl_block(fs,
742 EXT2_INODE(&dp->inode));
745 pctx.errcode = ext2fs_adjust_ea_refcount3(fs, file_acl_block,
746 block_buf, -1, &count, ino);
747 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
752 pctx.blk = file_acl_block;
753 fix_problem(ctx, PR_1B_ADJ_EA_REFCOUNT, &pctx);
756 * If the count is zero, then arrange to have the
757 * block deleted. If the block is in the block_dup_map,
758 * also call delete_file_block since it will take care
759 * of keeping the accounting straight.
762 ext2fs_test_block_bitmap2(ctx->block_dup_map,
764 delete_file_block(fs, &file_acl_block,
765 BLOCK_COUNT_EXTATTR, 0, 0, &pb);
766 ext2fs_file_acl_block_set(fs, EXT2_INODE(&dp->inode),
768 quota_data_sub(ctx->qctx, &dp->inode, ino,
774 struct clone_struct {
781 struct ext2_inode_large *inode;
783 struct dup_cluster *save_dup_cluster;
784 blk64_t save_blocknr;
788 * Decrement the bad count *after* we've shown that (a) we can allocate a
789 * replacement block and (b) remap the file blocks. Unfortunately, there's no
790 * way to find out if the remap succeeded until either the next
791 * clone_file_block() call (an error when remapping the block after returning
792 * BLOCK_CHANGED will halt the iteration) or after block_iterate() returns.
793 * Otherwise, it's possible that we decrease the badcount once in preparation
794 * to remap, then the remap fails (either we can't find a replacement block or
795 * we have to split the extent tree and can't find a new extent block), so we
796 * delete the file, which decreases the badcount again.
798 static void deferred_dec_badcount(struct clone_struct *cs)
800 if (!cs->save_dup_cluster)
802 decrement_badcount(cs->ctx, cs->save_blocknr, cs->save_dup_cluster);
803 if (cs->ctx->clone == E2F_CLONE_ZERO &&
804 cs->save_dup_cluster->num_bad == 0) {
805 ext2fs_unmark_block_bitmap2(cs->ctx->block_found_map,
807 ext2fs_block_alloc_stats(cs->ctx->fs, cs->save_blocknr, -1);
809 cs->save_dup_cluster = NULL;
812 static int clone_file_block(ext2_filsys fs,
814 e2_blkcnt_t blockcnt,
815 blk64_t ref_block EXT2FS_ATTR((unused)),
816 int ref_offset EXT2FS_ATTR((unused)),
819 struct dup_cluster *p = NULL;
822 struct clone_struct *cs = (struct clone_struct *) priv_data;
827 int should_write = 1;
830 deferred_dec_badcount(cs);
835 if (ext2fs_has_feature_shared_blocks(ctx->fs->super) &&
836 (ctx->options & E2F_OPT_UNSHARE_BLOCKS) &&
837 (ctx->options & E2F_OPT_NO))
840 c = EXT2FS_B2C(fs, blockcnt);
841 if (check_if_fs_cluster(ctx, EXT2FS_B2C(fs, *block_nr)))
844 if (c == cs->dup_cluster && cs->alloc_block) {
845 new_block = cs->alloc_block;
849 if (ext2fs_test_block_bitmap2(ctx->block_dup_map, *block_nr)) {
850 n = dict_lookup(&clstr_dict,
851 INT_TO_VOIDPTR(EXT2FS_B2C(fs, *block_nr)));
853 com_err("clone_file_block", 0,
854 _("internal error: can't find dup_blk for %llu\n"),
855 (unsigned long long) *block_nr);
859 p = (struct dup_cluster *) dnode_get(n);
863 * Let's try an implied cluster allocation. If we get the same
864 * cluster back, then we need to find a new block; otherwise,
865 * we're merely fixing the problem of one logical cluster being
866 * mapped to multiple physical clusters.
869 retval = ext2fs_map_cluster_block(fs, cs->ino,
870 EXT2_INODE(cs->inode),
871 blockcnt, &new_block);
872 if (retval == 0 && new_block != 0 &&
873 EXT2FS_B2C(ctx->fs, new_block) !=
874 EXT2FS_B2C(ctx->fs, *block_nr))
875 goto cluster_alloc_ok;
876 retval = ext2fs_new_block2(fs, 0, ctx->block_found_map,
879 cs->errcode = retval;
882 if (ext2fs_has_feature_shared_blocks(fs->super)) {
884 * Update the block stats so we don't get a prompt to fix block
885 * counts in the final pass.
887 ext2fs_block_alloc_stats2(fs, new_block, +1);
890 cs->alloc_block = new_block;
893 new_block &= ~EXT2FS_CLUSTER_MASK(fs);
894 new_block += EXT2FS_CLUSTER_MASK(fs) & blockcnt;
895 if (cs->dir && (blockcnt >= 0)) {
896 retval = ext2fs_set_dir_block2(fs->dblist,
897 cs->dir, new_block, blockcnt);
899 cs->errcode = retval;
904 printf("Cloning block #%lld from %llu to %llu\n",
905 blockcnt, (unsigned long long) *block_nr,
906 (unsigned long long) new_block);
908 if (ctx->clone == E2F_CLONE_ZERO) {
909 memset(cs->buf, 0, fs->blocksize);
911 retval = io_channel_read_blk64(fs->io, *block_nr, 1,
914 cs->errcode = retval;
919 retval = io_channel_write_blk64(fs->io, new_block, 1, cs->buf);
921 cs->errcode = retval;
925 cs->save_dup_cluster = (is_meta ? NULL : p);
926 cs->save_blocknr = *block_nr;
927 *block_nr = new_block;
928 ext2fs_mark_block_bitmap2(ctx->block_found_map, new_block);
929 ext2fs_mark_block_bitmap2(fs->block_map, new_block);
932 /* Don't try to change extent information; we want e2fsck to
937 return BLOCK_CHANGED;
942 static errcode_t clone_file(e2fsck_t ctx, ext2_ino_t ino,
943 struct dup_inode *dp, char* block_buf)
945 ext2_filsys fs = ctx->fs;
947 struct clone_struct cs;
948 struct problem_context pctx;
949 blk64_t blk, new_blk;
951 struct inode_el *ino_el;
952 struct dup_cluster *dc;
953 struct dup_inode *di;
955 clear_problem_context(&pctx);
962 cs.inode = &dp->inode;
963 cs.save_dup_cluster = NULL;
965 retval = ext2fs_get_mem(fs->blocksize, &cs.buf);
969 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, ino))
973 pctx.str = "clone_file";
974 if (ext2fs_inode_has_valid_blocks2(fs, EXT2_INODE(&dp->inode)))
975 pctx.errcode = ext2fs_block_iterate3(fs, ino, 0, block_buf,
976 clone_file_block, &cs);
977 deferred_dec_badcount(&cs);
978 ext2fs_mark_bb_dirty(fs);
980 fix_problem(ctx, PR_1B_BLOCK_ITERATE, &pctx);
981 retval = pctx.errcode;
985 com_err("clone_file", cs.errcode, "%s",
986 _("returned from clone_file_block"));
990 /* The inode may have changed on disk, so we have to re-read it */
991 e2fsck_read_inode_full(ctx, ino, EXT2_INODE(&dp->inode),
992 sizeof(dp->inode), "clone file EA");
993 blk = ext2fs_file_acl_block(fs, EXT2_INODE(&dp->inode));
995 if (blk && (clone_file_block(fs, &new_blk,
996 BLOCK_COUNT_EXTATTR, 0, 0, &cs) ==
998 ext2fs_file_acl_block_set(fs, EXT2_INODE(&dp->inode), new_blk);
999 e2fsck_write_inode_full(ctx, ino, EXT2_INODE(&dp->inode),
1000 sizeof(dp->inode), "clone file EA");
1002 * If we cloned the EA block, find all other inodes
1003 * which referred to that EA block, and modify
1004 * them to point to the new EA block.
1006 n = dict_lookup(&clstr_dict,
1007 INT_TO_VOIDPTR(EXT2FS_B2C(fs, blk)));
1009 com_err("clone_file", 0,
1010 _("internal error: couldn't lookup EA "
1011 "block record for %llu"),
1012 (unsigned long long) blk);
1013 retval = 0; /* OK to stumble on... */
1016 dc = (struct dup_cluster *) dnode_get(n);
1017 for (ino_el = dc->inode_list; ino_el; ino_el = ino_el->next) {
1018 if (ino_el->inode == ino)
1020 n = dict_lookup(&ino_dict, INT_TO_VOIDPTR(ino_el->inode));
1022 com_err("clone_file", 0,
1023 _("internal error: couldn't lookup EA "
1024 "inode record for %u"),
1026 retval = 0; /* OK to stumble on... */
1029 di = (struct dup_inode *) dnode_get(n);
1030 if (ext2fs_file_acl_block(fs,
1031 EXT2_INODE(&di->inode)) == blk) {
1032 ext2fs_file_acl_block_set(fs,
1033 EXT2_INODE(&di->inode),
1034 ext2fs_file_acl_block(fs, EXT2_INODE(&dp->inode)));
1035 e2fsck_write_inode_full(ctx, ino_el->inode,
1036 EXT2_INODE(&di->inode),
1037 sizeof(di->inode), "clone file EA");
1038 decrement_badcount(ctx, blk, dc);
1044 ext2fs_free_mem(&cs.buf);
1049 * This routine returns 1 if a block overlaps with one of the superblocks,
1050 * group descriptors, inode bitmaps, or block bitmaps.
1052 static int check_if_fs_block(e2fsck_t ctx, blk64_t test_block)
1054 ext2_filsys fs = ctx->fs;
1055 blk64_t first_block;
1058 first_block = fs->super->s_first_data_block;
1059 for (i = 0; i < fs->group_desc_count; i++) {
1061 /* Check superblocks/block group descriptors */
1062 if (ext2fs_bg_has_super(fs, i)) {
1063 if (test_block >= first_block &&
1064 (test_block <= first_block + fs->desc_blocks))
1068 /* Check the inode table */
1069 if ((ext2fs_inode_table_loc(fs, i)) &&
1070 (test_block >= ext2fs_inode_table_loc(fs, i)) &&
1071 (test_block < (ext2fs_inode_table_loc(fs, i) +
1072 fs->inode_blocks_per_group)))
1075 /* Check the bitmap blocks */
1076 if ((test_block == ext2fs_block_bitmap_loc(fs, i)) ||
1077 (test_block == ext2fs_inode_bitmap_loc(fs, i)))
1080 first_block += fs->super->s_blocks_per_group;
1086 * This routine returns 1 if a cluster overlaps with one of the superblocks,
1087 * group descriptors, inode bitmaps, or block bitmaps.
1089 static int check_if_fs_cluster(e2fsck_t ctx, blk64_t cluster)
1091 ext2_filsys fs = ctx->fs;
1092 blk64_t first_block;
1095 first_block = fs->super->s_first_data_block;
1096 for (i = 0; i < fs->group_desc_count; i++) {
1098 /* Check superblocks/block group descriptors */
1099 if (ext2fs_bg_has_super(fs, i)) {
1100 if (cluster >= EXT2FS_B2C(fs, first_block) &&
1101 (cluster <= EXT2FS_B2C(fs, first_block +
1106 /* Check the inode table */
1107 if ((ext2fs_inode_table_loc(fs, i)) &&
1108 (cluster >= EXT2FS_B2C(fs,
1109 ext2fs_inode_table_loc(fs, i))) &&
1110 (cluster <= EXT2FS_B2C(fs,
1111 ext2fs_inode_table_loc(fs, i) +
1112 fs->inode_blocks_per_group - 1)))
1115 /* Check the bitmap blocks */
1116 if ((cluster == EXT2FS_B2C(fs,
1117 ext2fs_block_bitmap_loc(fs, i))) ||
1118 (cluster == EXT2FS_B2C(fs,
1119 ext2fs_inode_bitmap_loc(fs, i))))
1122 first_block += fs->super->s_blocks_per_group;