2 * pass3.c -- pass #3 of e2fsck: Check for directory connectivity
4 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999 Theodore Ts'o.
7 * This file may be redistributed under the terms of the GNU Public
11 * Pass #3 assures that all directories are connected to the
12 * filesystem tree, using the following algorithm:
14 * First, the root directory is checked to make sure it exists; if
15 * not, e2fsck will offer to create a new one. It is then marked as
18 * Then, pass3 interates over all directory inodes; for each directory
19 * it attempts to trace up the filesystem tree, using dirinfo.parent
20 * until it reaches a directory which has been marked "done". If it
21 * can not do so, then the directory must be disconnected, and e2fsck
22 * will offer to reconnect it to /lost+found. While it is chasing
23 * parent pointers up the filesystem tree, if pass3 sees a directory
24 * twice, then it has detected a filesystem loop, and it will again
25 * offer to reconnect the directory to /lost+found in to break the
28 * Pass 3 also contains the subroutine, e2fsck_reconnect_file() to
29 * reconnect inodes to /lost+found; this subroutine is also used by
30 * pass 4. e2fsck_reconnect_file() calls get_lost_and_found(), which
31 * is responsible for creating /lost+found if it does not exist.
33 * Pass 3 frees the following data structures:
34 * - The dirinfo directory information cache.
44 static void check_root(e2fsck_t ctx);
45 static int check_directory(e2fsck_t ctx, struct dir_info *dir,
46 struct problem_context *pctx);
47 static void fix_dotdot(e2fsck_t ctx, struct dir_info *dir, ext2_ino_t parent);
48 static errcode_t adjust_inode_count(e2fsck_t ctx, ext2_ino_t ino, int adj);
50 static ext2fs_inode_bitmap inode_loop_detect = 0;
51 static ext2fs_inode_bitmap inode_done_map = 0;
53 void e2fsck_pass3(e2fsck_t ctx)
55 ext2_filsys fs = ctx->fs;
58 struct resource_track rtrack;
60 struct problem_context pctx;
62 unsigned long maxdirs, count;
65 init_resource_track(&rtrack);
68 clear_problem_context(&pctx);
71 mtrace_print("Pass 3");
74 if (!(ctx->options & E2F_OPT_PREEN))
75 fix_problem(ctx, PR_3_PASS_HEADER, &pctx);
78 * Allocate some bitmaps to do loop detection.
80 pctx.errcode = ext2fs_allocate_inode_bitmap(fs, _("inode done bitmap"),
84 fix_problem(ctx, PR_3_ALLOCATE_IBITMAP_ERROR, &pctx);
85 ctx->flags |= E2F_FLAG_ABORT;
89 if (ctx->options & E2F_OPT_TIME) {
90 e2fsck_clear_progbar(ctx);
91 print_resource_track(_("Peak memory"), &ctx->global_rtrack);
96 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
99 ext2fs_mark_inode_bitmap(inode_done_map, EXT2_ROOT_INO);
101 maxdirs = e2fsck_get_num_dirinfo(ctx);
105 if ((ctx->progress)(ctx, 3, 0, maxdirs))
108 for (i=0; (dir = e2fsck_dir_info_iter(ctx, &i)) != 0;) {
109 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
111 if (ctx->progress && (ctx->progress)(ctx, 3, count++, maxdirs))
113 if (ext2fs_test_inode_bitmap(ctx->inode_dir_map, dir->ino))
114 if (check_directory(ctx, dir, &pctx))
119 * Force the creation of /lost+found if not present
121 if ((ctx->flags & E2F_OPT_READONLY) == 0)
122 e2fsck_get_lost_and_found(ctx, 1);
125 * If there are any directories that need to be indexed or
126 * optimized, do it here.
128 e2fsck_rehash_directories(ctx);
131 e2fsck_free_dir_info(ctx);
132 if (inode_loop_detect) {
133 ext2fs_free_inode_bitmap(inode_loop_detect);
134 inode_loop_detect = 0;
136 if (inode_done_map) {
137 ext2fs_free_inode_bitmap(inode_done_map);
141 #ifdef RESOURCE_TRACK
142 if (ctx->options & E2F_OPT_TIME2) {
143 e2fsck_clear_progbar(ctx);
144 print_resource_track(_("Pass 3"), &rtrack);
150 * This makes sure the root inode is present; if not, we ask if the
151 * user wants us to create it. Not creating it is a fatal error.
153 static void check_root(e2fsck_t ctx)
155 ext2_filsys fs = ctx->fs;
157 struct ext2_inode inode;
159 struct problem_context pctx;
161 clear_problem_context(&pctx);
163 if (ext2fs_test_inode_bitmap(ctx->inode_used_map, EXT2_ROOT_INO)) {
165 * If the root inode is not a directory, die here. The
166 * user must have answered 'no' in pass1 when we
167 * offered to clear it.
169 if (!(ext2fs_test_inode_bitmap(ctx->inode_dir_map,
171 fix_problem(ctx, PR_3_ROOT_NOT_DIR_ABORT, &pctx);
172 ctx->flags |= E2F_FLAG_ABORT;
177 if (!fix_problem(ctx, PR_3_NO_ROOT_INODE, &pctx)) {
178 fix_problem(ctx, PR_3_NO_ROOT_INODE_ABORT, &pctx);
179 ctx->flags |= E2F_FLAG_ABORT;
183 e2fsck_read_bitmaps(ctx);
186 * First, find a free block
188 pctx.errcode = ext2fs_new_block(fs, 0, ctx->block_found_map, &blk);
190 pctx.str = "ext2fs_new_block";
191 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
192 ctx->flags |= E2F_FLAG_ABORT;
195 ext2fs_mark_block_bitmap(ctx->block_found_map, blk);
196 ext2fs_mark_block_bitmap(fs->block_map, blk);
197 ext2fs_mark_bb_dirty(fs);
200 * Now let's create the actual data block for the inode
202 pctx.errcode = ext2fs_new_dir_block(fs, EXT2_ROOT_INO, EXT2_ROOT_INO,
205 pctx.str = "ext2fs_new_dir_block";
206 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
207 ctx->flags |= E2F_FLAG_ABORT;
211 pctx.errcode = ext2fs_write_dir_block(fs, blk, block);
213 pctx.str = "ext2fs_write_dir_block";
214 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
215 ctx->flags |= E2F_FLAG_ABORT;
218 ext2fs_free_mem((void **) &block);
221 * Set up the inode structure
223 memset(&inode, 0, sizeof(inode));
224 inode.i_mode = 040755;
225 inode.i_size = fs->blocksize;
226 inode.i_atime = inode.i_ctime = inode.i_mtime = time(0);
227 inode.i_links_count = 2;
228 inode.i_blocks = fs->blocksize / 512;
229 inode.i_block[0] = blk;
232 * Write out the inode.
234 pctx.errcode = ext2fs_write_inode(fs, EXT2_ROOT_INO, &inode);
236 pctx.str = "ext2fs_write_inode";
237 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
238 ctx->flags |= E2F_FLAG_ABORT;
243 * Miscellaneous bookkeeping...
245 e2fsck_add_dir_info(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
246 ext2fs_icount_store(ctx->inode_count, EXT2_ROOT_INO, 2);
247 ext2fs_icount_store(ctx->inode_link_info, EXT2_ROOT_INO, 2);
249 ext2fs_mark_inode_bitmap(ctx->inode_used_map, EXT2_ROOT_INO);
250 ext2fs_mark_inode_bitmap(ctx->inode_dir_map, EXT2_ROOT_INO);
251 ext2fs_mark_inode_bitmap(fs->inode_map, EXT2_ROOT_INO);
252 ext2fs_mark_ib_dirty(fs);
256 * This subroutine is responsible for making sure that a particular
257 * directory is connected to the root; if it isn't we trace it up as
258 * far as we can go, and then offer to connect the resulting parent to
259 * the lost+found. We have to do loop detection; if we ever discover
260 * a loop, we treat that as a disconnected directory and offer to
261 * reparent it to lost+found.
263 * However, loop detection is expensive, because for very large
264 * filesystems, the inode_loop_detect bitmap is huge, and clearing it
265 * is non-trivial. Loops in filesystems are also a rare error case,
266 * and we shouldn't optimize for error cases. So we try two passes of
267 * the algorithm. The first time, we ignore loop detection and merely
268 * increment a counter; if the counter exceeds some extreme threshold,
269 * then we try again with the loop detection bitmap enabled.
271 static int check_directory(e2fsck_t ctx, struct dir_info *dir,
272 struct problem_context *pctx)
274 ext2_filsys fs = ctx->fs;
275 struct dir_info *p = dir;
276 int loop_pass = 0, parent_count = 0;
283 * Mark this inode as being "done"; by the time we
284 * return from this function, the inode we either be
285 * verified as being connected to the directory tree,
286 * or we will have offered to reconnect this to
289 * If it was marked done already, then we've reached a
290 * parent we've already checked.
292 if (ext2fs_mark_inode_bitmap(inode_done_map, p->ino))
296 * If this directory doesn't have a parent, or we've
297 * seen the parent once already, then offer to
298 * reparent it to lost+found
302 (ext2fs_test_inode_bitmap(inode_loop_detect,
305 if (fix_problem(ctx, PR_3_UNCONNECTED_DIR, pctx)) {
306 if (e2fsck_reconnect_file(ctx, p->ino))
307 ext2fs_unmark_valid(fs);
309 p->parent = ctx->lost_and_found;
310 fix_dotdot(ctx, p, ctx->lost_and_found);
315 p = e2fsck_get_dir_info(ctx, p->parent);
317 fix_problem(ctx, PR_3_NO_DIRINFO, pctx);
321 ext2fs_mark_inode_bitmap(inode_loop_detect,
323 } else if (parent_count++ > 2048) {
325 * If we've run into a path depth that's
326 * greater than 2048, try again with the inode
327 * loop bitmap turned on and start from the
331 if (inode_loop_detect)
332 ext2fs_clear_inode_bitmap(inode_loop_detect);
334 pctx->errcode = ext2fs_allocate_inode_bitmap(fs, _("inode loop detection bitmap"), &inode_loop_detect);
338 PR_3_ALLOCATE_IBITMAP_ERROR, pctx);
339 ctx->flags |= E2F_FLAG_ABORT;
348 * Make sure that .. and the parent directory are the same;
349 * offer to fix it if not.
351 if (dir->parent != dir->dotdot) {
352 pctx->ino = dir->ino;
353 pctx->ino2 = dir->dotdot;
354 pctx->dir = dir->parent;
355 if (fix_problem(ctx, PR_3_BAD_DOT_DOT, pctx))
356 fix_dotdot(ctx, dir, dir->parent);
362 * This routine gets the lost_and_found inode, making it a directory
365 ext2_ino_t e2fsck_get_lost_and_found(e2fsck_t ctx, int fix)
367 ext2_filsys fs = ctx->fs;
371 struct ext2_inode inode;
373 static const char name[] = "lost+found";
374 struct problem_context pctx;
375 struct dir_info *dirinfo;
377 if (ctx->lost_and_found)
378 return ctx->lost_and_found;
380 clear_problem_context(&pctx);
382 retval = ext2fs_lookup(fs, EXT2_ROOT_INO, name,
383 sizeof(name)-1, 0, &ino);
387 if (ext2fs_test_inode_bitmap(ctx->inode_dir_map, ino)) {
388 ctx->lost_and_found = ino;
392 /* Lost+found isn't a directory! */
396 if (!fix_problem(ctx, PR_3_LPF_NOTDIR, &pctx))
399 /* OK, unlink the old /lost+found file. */
400 pctx.errcode = ext2fs_unlink(fs, EXT2_ROOT_INO, name, ino, 0);
402 pctx.str = "ext2fs_unlink";
403 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
406 dirinfo = e2fsck_get_dir_info(ctx, ino);
409 adjust_inode_count(ctx, ino, -1);
410 } else if (retval != EXT2_ET_FILE_NOT_FOUND) {
411 pctx.errcode = retval;
412 fix_problem(ctx, PR_3_ERR_FIND_LPF, &pctx);
414 if (!fix_problem(ctx, PR_3_NO_LF_DIR, 0))
418 * Read the inode and block bitmaps in; we'll be messing with
421 e2fsck_read_bitmaps(ctx);
424 * First, find a free block
426 retval = ext2fs_new_block(fs, 0, ctx->block_found_map, &blk);
428 pctx.errcode = retval;
429 fix_problem(ctx, PR_3_ERR_LPF_NEW_BLOCK, &pctx);
432 ext2fs_mark_block_bitmap(ctx->block_found_map, blk);
433 ext2fs_block_alloc_stats(fs, blk, +1);
436 * Next find a free inode.
438 retval = ext2fs_new_inode(fs, EXT2_ROOT_INO, 040755,
439 ctx->inode_used_map, &ino);
441 pctx.errcode = retval;
442 fix_problem(ctx, PR_3_ERR_LPF_NEW_INODE, &pctx);
445 ext2fs_mark_inode_bitmap(ctx->inode_used_map, ino);
446 ext2fs_mark_inode_bitmap(ctx->inode_dir_map, ino);
447 ext2fs_inode_alloc_stats2(fs, ino, +1, 1);
450 * Now let's create the actual data block for the inode
452 retval = ext2fs_new_dir_block(fs, ino, EXT2_ROOT_INO, &block);
454 pctx.errcode = retval;
455 fix_problem(ctx, PR_3_ERR_LPF_NEW_DIR_BLOCK, &pctx);
459 retval = ext2fs_write_dir_block(fs, blk, block);
460 ext2fs_free_mem((void **) &block);
462 pctx.errcode = retval;
463 fix_problem(ctx, PR_3_ERR_LPF_WRITE_BLOCK, &pctx);
468 * Set up the inode structure
470 memset(&inode, 0, sizeof(inode));
471 inode.i_mode = 040700;
472 inode.i_size = fs->blocksize;
473 inode.i_atime = inode.i_ctime = inode.i_mtime = time(0);
474 inode.i_links_count = 2;
475 inode.i_blocks = fs->blocksize / 512;
476 inode.i_block[0] = blk;
479 * Next, write out the inode.
481 pctx.errcode = ext2fs_write_inode(fs, ino, &inode);
483 pctx.str = "ext2fs_write_inode";
484 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
488 * Finally, create the directory link
490 pctx.errcode = ext2fs_link(fs, EXT2_ROOT_INO, name, ino, EXT2_FT_DIR);
492 pctx.str = "ext2fs_link";
493 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
498 * Miscellaneous bookkeeping that needs to be kept straight.
500 e2fsck_add_dir_info(ctx, ino, EXT2_ROOT_INO);
501 adjust_inode_count(ctx, EXT2_ROOT_INO, 1);
502 ext2fs_icount_store(ctx->inode_count, ino, 2);
503 ext2fs_icount_store(ctx->inode_link_info, ino, 2);
504 ctx->lost_and_found = ino;
506 printf("/lost+found created; inode #%lu\n", ino);
512 * This routine will connect a file to lost+found
514 int e2fsck_reconnect_file(e2fsck_t ctx, ext2_ino_t ino)
516 ext2_filsys fs = ctx->fs;
519 struct problem_context pctx;
520 struct ext2_inode inode;
523 clear_problem_context(&pctx);
526 if (!ctx->bad_lost_and_found && !ctx->lost_and_found) {
527 if (e2fsck_get_lost_and_found(ctx, 1) == 0)
528 ctx->bad_lost_and_found++;
530 if (ctx->bad_lost_and_found) {
531 fix_problem(ctx, PR_3_NO_LPF, &pctx);
535 sprintf(name, "#%u", ino);
536 if (ext2fs_read_inode(fs, ino, &inode) == 0)
537 file_type = ext2_file_type(inode.i_mode);
538 retval = ext2fs_link(fs, ctx->lost_and_found, name, ino, file_type);
539 if (retval == EXT2_ET_DIR_NO_SPACE) {
540 if (!fix_problem(ctx, PR_3_EXPAND_LF_DIR, &pctx))
542 retval = e2fsck_expand_directory(ctx, ctx->lost_and_found,
545 pctx.errcode = retval;
546 fix_problem(ctx, PR_3_CANT_EXPAND_LPF, &pctx);
549 retval = ext2fs_link(fs, ctx->lost_and_found, name,
553 pctx.errcode = retval;
554 fix_problem(ctx, PR_3_CANT_RECONNECT, &pctx);
557 adjust_inode_count(ctx, ino, 1);
563 * Utility routine to adjust the inode counts on an inode.
565 static errcode_t adjust_inode_count(e2fsck_t ctx, ext2_ino_t ino, int adj)
567 ext2_filsys fs = ctx->fs;
569 struct ext2_inode inode;
574 retval = ext2fs_read_inode(fs, ino, &inode);
579 printf("Adjusting link count for inode %lu by %d (from %d)\n", ino, adj,
580 inode.i_links_count);
584 ext2fs_icount_increment(ctx->inode_count, ino, 0);
585 if (inode.i_links_count == (__u16) ~0)
587 ext2fs_icount_increment(ctx->inode_link_info, ino, 0);
588 inode.i_links_count++;
589 } else if (adj == -1) {
590 ext2fs_icount_decrement(ctx->inode_count, ino, 0);
591 if (inode.i_links_count == 0)
593 ext2fs_icount_decrement(ctx->inode_link_info, ino, 0);
594 inode.i_links_count--;
597 retval = ext2fs_write_inode(fs, ino, &inode);
605 * Fix parent --- this routine fixes up the parent of a directory.
607 struct fix_dotdot_struct {
614 static int fix_dotdot_proc(struct ext2_dir_entry *dirent,
620 struct fix_dotdot_struct *fp = (struct fix_dotdot_struct *) priv_data;
622 struct problem_context pctx;
624 if ((dirent->name_len & 0xFF) != 2)
626 if (strncmp(dirent->name, "..", 2))
629 clear_problem_context(&pctx);
631 retval = adjust_inode_count(fp->ctx, dirent->inode, -1);
633 pctx.errcode = retval;
634 fix_problem(fp->ctx, PR_3_ADJUST_INODE, &pctx);
636 retval = adjust_inode_count(fp->ctx, fp->parent, 1);
638 pctx.errcode = retval;
639 fix_problem(fp->ctx, PR_3_ADJUST_INODE, &pctx);
641 dirent->inode = fp->parent;
644 return DIRENT_ABORT | DIRENT_CHANGED;
647 static void fix_dotdot(e2fsck_t ctx, struct dir_info *dir, ext2_ino_t parent)
649 ext2_filsys fs = ctx->fs;
651 struct fix_dotdot_struct fp;
652 struct problem_context pctx;
660 printf("Fixing '..' of inode %lu to be %lu...\n", dir->ino, parent);
663 retval = ext2fs_dir_iterate(fs, dir->ino, DIRENT_FLAG_INCLUDE_EMPTY,
664 0, fix_dotdot_proc, &fp);
665 if (retval || !fp.done) {
666 clear_problem_context(&pctx);
668 pctx.errcode = retval;
669 fix_problem(ctx, retval ? PR_3_FIX_PARENT_ERR :
670 PR_3_FIX_PARENT_NOFIND, &pctx);
671 ext2fs_unmark_valid(fs);
673 dir->dotdot = parent;
679 * These routines are responsible for expanding a /lost+found if it is
683 struct expand_dir_struct {
692 static int expand_dir_proc(ext2_filsys fs,
694 e2_blkcnt_t blockcnt,
699 struct expand_dir_struct *es = (struct expand_dir_struct *) priv_data;
701 static blk_t last_blk = 0;
708 if (es->guaranteed_size && blockcnt >= es->guaranteed_size)
712 es->last_block = blockcnt;
717 retval = ext2fs_new_block(fs, last_blk, ctx->block_found_map,
724 retval = ext2fs_new_dir_block(fs, 0, 0, &block);
730 retval = ext2fs_write_dir_block(fs, new_blk, block);
732 retval = ext2fs_get_mem(fs->blocksize, (void **) &block);
737 memset(block, 0, fs->blocksize);
738 retval = io_channel_write_blk(fs->io, new_blk, 1, block);
744 ext2fs_free_mem((void **) &block);
746 ext2fs_mark_block_bitmap(ctx->block_found_map, new_blk);
747 ext2fs_block_alloc_stats(fs, new_blk, +1);
751 return (BLOCK_CHANGED | BLOCK_ABORT);
753 return BLOCK_CHANGED;
756 errcode_t e2fsck_expand_directory(e2fsck_t ctx, ext2_ino_t dir,
757 int num, int guaranteed_size)
759 ext2_filsys fs = ctx->fs;
761 struct expand_dir_struct es;
762 struct ext2_inode inode;
764 if (!(fs->flags & EXT2_FLAG_RW))
765 return EXT2_ET_RO_FILSYS;
768 * Read the inode and block bitmaps in; we'll be messing with
771 e2fsck_read_bitmaps(ctx);
773 retval = ext2fs_check_directory(fs, dir);
778 es.guaranteed_size = guaranteed_size;
784 retval = ext2fs_block_iterate2(fs, dir, BLOCK_FLAG_APPEND,
785 0, expand_dir_proc, &es);
791 * Update the size and block count fields in the inode.
793 retval = ext2fs_read_inode(fs, dir, &inode);
797 inode.i_size = (es.last_block + 1) * fs->blocksize;
798 inode.i_blocks += (fs->blocksize / 512) * es.newblocks;
800 e2fsck_write_inode(ctx, dir, &inode, "expand_directory");