]> git.ipfire.org Git - thirdparty/e2fsprogs.git/blob - e2fsck/pass3.c
Merge branch 'maint' into next
[thirdparty/e2fsprogs.git] / e2fsck / pass3.c
1 /*
2 * pass3.c -- pass #3 of e2fsck: Check for directory connectivity
3 *
4 * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999 Theodore Ts'o.
5 *
6 * %Begin-Header%
7 * This file may be redistributed under the terms of the GNU Public
8 * License.
9 * %End-Header%
10 *
11 * Pass #3 assures that all directories are connected to the
12 * filesystem tree, using the following algorithm:
13 *
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
16 * "done".
17 *
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
26 * filesystem loop.
27 *
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.
32 *
33 * Pass 3 frees the following data structures:
34 * - The dirinfo directory information cache.
35 */
36
37 #include "config.h"
38 #ifdef HAVE_ERRNO_H
39 #include <errno.h>
40 #endif
41
42 #include "e2fsck.h"
43 #include "problem.h"
44
45 static void check_root(e2fsck_t ctx);
46 static int check_directory(e2fsck_t ctx, ext2_ino_t ino,
47 struct problem_context *pctx);
48 static void fix_dotdot(e2fsck_t ctx, ext2_ino_t ino, ext2_ino_t parent);
49
50 static ext2fs_inode_bitmap inode_loop_detect = 0;
51 static ext2fs_inode_bitmap inode_done_map = 0;
52
53 void e2fsck_pass3(e2fsck_t ctx)
54 {
55 ext2_filsys fs = ctx->fs;
56 struct dir_info_iter *iter = NULL;
57 #ifdef RESOURCE_TRACK
58 struct resource_track rtrack;
59 #endif
60 struct problem_context pctx;
61 struct dir_info *dir;
62 unsigned long maxdirs, count;
63
64 init_resource_track(&rtrack, ctx->fs->io);
65 clear_problem_context(&pctx);
66
67 #ifdef MTRACE
68 mtrace_print("Pass 3");
69 #endif
70
71 if (!(ctx->options & E2F_OPT_PREEN))
72 fix_problem(ctx, PR_3_PASS_HEADER, &pctx);
73
74 /*
75 * Allocate some bitmaps to do loop detection.
76 */
77 pctx.errcode = e2fsck_allocate_inode_bitmap(fs, _("inode done bitmap"),
78 EXT2FS_BMAP64_AUTODIR,
79 "inode_done_map", &inode_done_map);
80 if (pctx.errcode) {
81 pctx.num = 2;
82 fix_problem(ctx, PR_3_ALLOCATE_IBITMAP_ERROR, &pctx);
83 ctx->flags |= E2F_FLAG_ABORT;
84 goto abort_exit;
85 }
86 print_resource_track(ctx, _("Peak memory"), &ctx->global_rtrack, NULL);
87
88 check_root(ctx);
89 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
90 goto abort_exit;
91
92 ext2fs_mark_inode_bitmap2(inode_done_map, EXT2_ROOT_INO);
93
94 maxdirs = e2fsck_get_num_dirinfo(ctx);
95 count = 1;
96
97 if (ctx->progress)
98 if ((ctx->progress)(ctx, 3, 0, maxdirs))
99 goto abort_exit;
100
101 iter = e2fsck_dir_info_iter_begin(ctx);
102 while ((dir = e2fsck_dir_info_iter(ctx, iter)) != 0) {
103 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
104 goto abort_exit;
105 if (ctx->progress && (ctx->progress)(ctx, 3, count++, maxdirs))
106 goto abort_exit;
107 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, dir->ino))
108 if (check_directory(ctx, dir->ino, &pctx))
109 goto abort_exit;
110 }
111
112 /*
113 * Force the creation of /lost+found if not present
114 */
115 if ((ctx->options & E2F_OPT_READONLY) == 0)
116 e2fsck_get_lost_and_found(ctx, 1);
117
118 /*
119 * If there are any directories that need to be indexed or
120 * optimized, do it here.
121 */
122 e2fsck_rehash_directories(ctx);
123
124 abort_exit:
125 if (iter)
126 e2fsck_dir_info_iter_end(ctx, iter);
127 e2fsck_free_dir_info(ctx);
128 if (inode_loop_detect) {
129 ext2fs_free_inode_bitmap(inode_loop_detect);
130 inode_loop_detect = 0;
131 }
132 if (inode_done_map) {
133 ext2fs_free_inode_bitmap(inode_done_map);
134 inode_done_map = 0;
135 }
136
137 if (ctx->lnf_repair_block) {
138 ext2fs_unmark_block_bitmap2(ctx->block_found_map,
139 ctx->lnf_repair_block);
140 ctx->lnf_repair_block = 0;
141 }
142 if (ctx->root_repair_block) {
143 ext2fs_unmark_block_bitmap2(ctx->block_found_map,
144 ctx->root_repair_block);
145 ctx->root_repair_block = 0;
146 }
147
148 print_resource_track(ctx, _("Pass 3"), &rtrack, ctx->fs->io);
149 }
150
151 /*
152 * This makes sure the root inode is present; if not, we ask if the
153 * user wants us to create it. Not creating it is a fatal error.
154 */
155 static void check_root(e2fsck_t ctx)
156 {
157 ext2_filsys fs = ctx->fs;
158 blk64_t blk;
159 struct ext2_inode inode;
160 char * block;
161 struct problem_context pctx;
162
163 clear_problem_context(&pctx);
164
165 if (ext2fs_test_inode_bitmap2(ctx->inode_used_map, EXT2_ROOT_INO)) {
166 /*
167 * If the root inode is not a directory, die here. The
168 * user must have answered 'no' in pass1 when we
169 * offered to clear it.
170 */
171 if (!(ext2fs_test_inode_bitmap2(ctx->inode_dir_map,
172 EXT2_ROOT_INO))) {
173 fix_problem(ctx, PR_3_ROOT_NOT_DIR_ABORT, &pctx);
174 ctx->flags |= E2F_FLAG_ABORT;
175 }
176 return;
177 }
178
179 if (!fix_problem(ctx, PR_3_NO_ROOT_INODE, &pctx)) {
180 fix_problem(ctx, PR_3_NO_ROOT_INODE_ABORT, &pctx);
181 ctx->flags |= E2F_FLAG_ABORT;
182 return;
183 }
184
185 e2fsck_read_bitmaps(ctx);
186
187 /*
188 * First, find a free block
189 */
190 if (ctx->root_repair_block) {
191 blk = ctx->root_repair_block;
192 ctx->root_repair_block = 0;
193 goto skip_new_block;
194 }
195 pctx.errcode = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
196 if (pctx.errcode) {
197 pctx.str = "ext2fs_new_block";
198 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
199 ctx->flags |= E2F_FLAG_ABORT;
200 return;
201 }
202 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
203 skip_new_block:
204 ext2fs_mark_block_bitmap2(fs->block_map, blk);
205 ext2fs_mark_bb_dirty(fs);
206
207 /*
208 * Set up the inode structure
209 */
210 memset(&inode, 0, sizeof(inode));
211 inode.i_mode = 040755;
212 inode.i_size = fs->blocksize;
213 inode.i_atime = inode.i_ctime = inode.i_mtime = ctx->now;
214 inode.i_links_count = 2;
215 ext2fs_iblk_set(fs, &inode, 1);
216 inode.i_block[0] = blk;
217
218 /*
219 * Write out the inode.
220 */
221 pctx.errcode = ext2fs_write_new_inode(fs, EXT2_ROOT_INO, &inode);
222 if (pctx.errcode) {
223 pctx.str = "ext2fs_write_inode";
224 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
225 ctx->flags |= E2F_FLAG_ABORT;
226 return;
227 }
228
229 /*
230 * Now let's create the actual data block for the inode.
231 * Due to metadata_csum, we must write the dir blocks AFTER
232 * the inode has been written to disk!
233 */
234 pctx.errcode = ext2fs_new_dir_block(fs, EXT2_ROOT_INO, EXT2_ROOT_INO,
235 &block);
236 if (pctx.errcode) {
237 pctx.str = "ext2fs_new_dir_block";
238 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
239 ctx->flags |= E2F_FLAG_ABORT;
240 return;
241 }
242
243 pctx.errcode = ext2fs_write_dir_block4(fs, blk, block, 0,
244 EXT2_ROOT_INO);
245 ext2fs_free_mem(&block);
246 if (pctx.errcode) {
247 pctx.str = "ext2fs_write_dir_block4";
248 fix_problem(ctx, PR_3_CREATE_ROOT_ERROR, &pctx);
249 ctx->flags |= E2F_FLAG_ABORT;
250 return;
251 }
252
253 /*
254 * Miscellaneous bookkeeping...
255 */
256 e2fsck_add_dir_info(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
257 ext2fs_icount_store(ctx->inode_count, EXT2_ROOT_INO, 2);
258 ext2fs_icount_store(ctx->inode_link_info, EXT2_ROOT_INO, 2);
259
260 ext2fs_mark_inode_bitmap2(ctx->inode_used_map, EXT2_ROOT_INO);
261 ext2fs_mark_inode_bitmap2(ctx->inode_dir_map, EXT2_ROOT_INO);
262 ext2fs_mark_inode_bitmap2(fs->inode_map, EXT2_ROOT_INO);
263 ext2fs_mark_ib_dirty(fs);
264 }
265
266 /*
267 * This subroutine is responsible for making sure that a particular
268 * directory is connected to the root; if it isn't we trace it up as
269 * far as we can go, and then offer to connect the resulting parent to
270 * the lost+found. We have to do loop detection; if we ever discover
271 * a loop, we treat that as a disconnected directory and offer to
272 * reparent it to lost+found.
273 *
274 * However, loop detection is expensive, because for very large
275 * filesystems, the inode_loop_detect bitmap is huge, and clearing it
276 * is non-trivial. Loops in filesystems are also a rare error case,
277 * and we shouldn't optimize for error cases. So we try two passes of
278 * the algorithm. The first time, we ignore loop detection and merely
279 * increment a counter; if the counter exceeds some extreme threshold,
280 * then we try again with the loop detection bitmap enabled.
281 */
282 static int check_directory(e2fsck_t ctx, ext2_ino_t dir,
283 struct problem_context *pctx)
284 {
285 ext2_filsys fs = ctx->fs;
286 ext2_ino_t ino = dir, parent;
287 int loop_pass = 0, parent_count = 0;
288
289 while (1) {
290 /*
291 * Mark this inode as being "done"; by the time we
292 * return from this function, the inode we either be
293 * verified as being connected to the directory tree,
294 * or we will have offered to reconnect this to
295 * lost+found.
296 *
297 * If it was marked done already, then we've reached a
298 * parent we've already checked.
299 */
300 if (ext2fs_mark_inode_bitmap2(inode_done_map, ino))
301 break;
302
303 if (e2fsck_dir_info_get_parent(ctx, ino, &parent)) {
304 fix_problem(ctx, PR_3_NO_DIRINFO, pctx);
305 return 0;
306 }
307
308 /*
309 * If this directory doesn't have a parent, or we've
310 * seen the parent once already, then offer to
311 * reparent it to lost+found
312 */
313 if (!parent ||
314 (loop_pass &&
315 (ext2fs_test_inode_bitmap2(inode_loop_detect,
316 parent)))) {
317 pctx->ino = ino;
318 if (fix_problem(ctx, PR_3_UNCONNECTED_DIR, pctx)) {
319 if (e2fsck_reconnect_file(ctx, pctx->ino))
320 ext2fs_unmark_valid(fs);
321 else {
322 fix_dotdot(ctx, pctx->ino,
323 ctx->lost_and_found);
324 parent = ctx->lost_and_found;
325 }
326 }
327 break;
328 }
329 ino = parent;
330 if (loop_pass) {
331 ext2fs_mark_inode_bitmap2(inode_loop_detect, ino);
332 } else if (parent_count++ > 2048) {
333 /*
334 * If we've run into a path depth that's
335 * greater than 2048, try again with the inode
336 * loop bitmap turned on and start from the
337 * top.
338 */
339 loop_pass = 1;
340 if (inode_loop_detect)
341 ext2fs_clear_inode_bitmap(inode_loop_detect);
342 else {
343 pctx->errcode = e2fsck_allocate_inode_bitmap(fs, _("inode loop detection bitmap"), EXT2FS_BMAP64_AUTODIR, "inode_loop_detect", &inode_loop_detect);
344 if (pctx->errcode) {
345 pctx->num = 1;
346 fix_problem(ctx,
347 PR_3_ALLOCATE_IBITMAP_ERROR, pctx);
348 ctx->flags |= E2F_FLAG_ABORT;
349 return -1;
350 }
351 }
352 ino = dir;
353 }
354 }
355
356 /*
357 * Make sure that .. and the parent directory are the same;
358 * offer to fix it if not.
359 */
360 pctx->ino = dir;
361 if (e2fsck_dir_info_get_dotdot(ctx, dir, &pctx->ino2) ||
362 e2fsck_dir_info_get_parent(ctx, dir, &pctx->dir)) {
363 fix_problem(ctx, PR_3_NO_DIRINFO, pctx);
364 return 0;
365 }
366 if (pctx->ino2 != pctx->dir) {
367 if (fix_problem(ctx, PR_3_BAD_DOT_DOT, pctx))
368 fix_dotdot(ctx, dir, pctx->dir);
369 }
370 return 0;
371 }
372
373 /*
374 * This routine gets the lost_and_found inode, making it a directory
375 * if necessary
376 */
377 ext2_ino_t e2fsck_get_lost_and_found(e2fsck_t ctx, int fix)
378 {
379 ext2_filsys fs = ctx->fs;
380 ext2_ino_t ino;
381 blk64_t blk;
382 errcode_t retval;
383 struct ext2_inode inode;
384 char * block;
385 static const char name[] = "lost+found";
386 struct problem_context pctx;
387
388 if (ctx->lost_and_found)
389 return ctx->lost_and_found;
390
391 clear_problem_context(&pctx);
392
393 retval = ext2fs_lookup(fs, EXT2_ROOT_INO, name,
394 sizeof(name)-1, 0, &ino);
395 if (retval && !fix)
396 return 0;
397 if (!retval) {
398 /* Lost+found shouldn't have inline data */
399 retval = ext2fs_read_inode(fs, ino, &inode);
400 if (fix && retval)
401 return 0;
402
403 if (fix && (inode.i_flags & EXT4_INLINE_DATA_FL)) {
404 if (!fix_problem(ctx, PR_3_LPF_INLINE_DATA, &pctx))
405 return 0;
406 goto unlink;
407 }
408
409 if (ext2fs_check_directory(fs, ino) == 0) {
410 ctx->lost_and_found = ino;
411 return ino;
412 }
413
414 /* Lost+found isn't a directory! */
415 if (!fix)
416 return 0;
417 pctx.ino = ino;
418 if (!fix_problem(ctx, PR_3_LPF_NOTDIR, &pctx))
419 return 0;
420
421 unlink:
422 /* OK, unlink the old /lost+found file. */
423 pctx.errcode = ext2fs_unlink(fs, EXT2_ROOT_INO, name, ino, 0);
424 if (pctx.errcode) {
425 pctx.str = "ext2fs_unlink";
426 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
427 return 0;
428 }
429 (void) e2fsck_dir_info_set_parent(ctx, ino, 0);
430 e2fsck_adjust_inode_count(ctx, ino, -1);
431 } else if (retval != EXT2_ET_FILE_NOT_FOUND) {
432 pctx.errcode = retval;
433 fix_problem(ctx, PR_3_ERR_FIND_LPF, &pctx);
434 }
435 if (!fix_problem(ctx, PR_3_NO_LF_DIR, 0))
436 return 0;
437
438 /*
439 * Read the inode and block bitmaps in; we'll be messing with
440 * them.
441 */
442 e2fsck_read_bitmaps(ctx);
443
444 /*
445 * First, find a free block
446 */
447 if (ctx->lnf_repair_block) {
448 blk = ctx->lnf_repair_block;
449 ctx->lnf_repair_block = 0;
450 goto skip_new_block;
451 }
452 retval = ext2fs_new_block2(fs, 0, ctx->block_found_map, &blk);
453 if (retval) {
454 pctx.errcode = retval;
455 fix_problem(ctx, PR_3_ERR_LPF_NEW_BLOCK, &pctx);
456 return 0;
457 }
458 ext2fs_mark_block_bitmap2(ctx->block_found_map, blk);
459 skip_new_block:
460 ext2fs_block_alloc_stats2(fs, blk, +1);
461
462 /*
463 * Next find a free inode.
464 */
465 retval = ext2fs_new_inode(fs, EXT2_ROOT_INO, 040700,
466 ctx->inode_used_map, &ino);
467 if (retval) {
468 pctx.errcode = retval;
469 fix_problem(ctx, PR_3_ERR_LPF_NEW_INODE, &pctx);
470 return 0;
471 }
472 ext2fs_mark_inode_bitmap2(ctx->inode_used_map, ino);
473 ext2fs_mark_inode_bitmap2(ctx->inode_dir_map, ino);
474 ext2fs_inode_alloc_stats2(fs, ino, +1, 1);
475
476 /*
477 * Set up the inode structure
478 */
479 memset(&inode, 0, sizeof(inode));
480 inode.i_mode = 040700;
481 inode.i_size = fs->blocksize;
482 inode.i_atime = inode.i_ctime = inode.i_mtime = ctx->now;
483 inode.i_links_count = 2;
484 ext2fs_iblk_set(fs, &inode, 1);
485 inode.i_block[0] = blk;
486
487 /*
488 * Next, write out the inode.
489 */
490 pctx.errcode = ext2fs_write_new_inode(fs, ino, &inode);
491 if (pctx.errcode) {
492 pctx.str = "ext2fs_write_inode";
493 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
494 return 0;
495 }
496
497 /*
498 * Now let's create the actual data block for the inode.
499 * Due to metadata_csum, the directory block MUST be written
500 * after the inode is written to disk!
501 */
502 retval = ext2fs_new_dir_block(fs, ino, EXT2_ROOT_INO, &block);
503 if (retval) {
504 pctx.errcode = retval;
505 fix_problem(ctx, PR_3_ERR_LPF_NEW_DIR_BLOCK, &pctx);
506 return 0;
507 }
508
509 retval = ext2fs_write_dir_block4(fs, blk, block, 0, ino);
510 ext2fs_free_mem(&block);
511 if (retval) {
512 pctx.errcode = retval;
513 fix_problem(ctx, PR_3_ERR_LPF_WRITE_BLOCK, &pctx);
514 return 0;
515 }
516
517 /*
518 * Finally, create the directory link
519 */
520 pctx.errcode = ext2fs_link(fs, EXT2_ROOT_INO, name, ino, EXT2_FT_DIR);
521 if (pctx.errcode) {
522 pctx.str = "ext2fs_link";
523 fix_problem(ctx, PR_3_CREATE_LPF_ERROR, &pctx);
524 return 0;
525 }
526
527 /*
528 * Miscellaneous bookkeeping that needs to be kept straight.
529 */
530 e2fsck_add_dir_info(ctx, ino, EXT2_ROOT_INO);
531 e2fsck_adjust_inode_count(ctx, EXT2_ROOT_INO, 1);
532 ext2fs_icount_store(ctx->inode_count, ino, 2);
533 ext2fs_icount_store(ctx->inode_link_info, ino, 2);
534 ctx->lost_and_found = ino;
535 quota_data_add(ctx->qctx, &inode, ino, fs->blocksize);
536 quota_data_inodes(ctx->qctx, &inode, ino, +1);
537 #if 0
538 printf("/lost+found created; inode #%lu\n", ino);
539 #endif
540 return ino;
541 }
542
543 /*
544 * This routine will connect a file to lost+found
545 */
546 int e2fsck_reconnect_file(e2fsck_t ctx, ext2_ino_t ino)
547 {
548 ext2_filsys fs = ctx->fs;
549 errcode_t retval;
550 char name[80];
551 struct problem_context pctx;
552 struct ext2_inode inode;
553 int file_type = 0;
554
555 clear_problem_context(&pctx);
556 pctx.ino = ino;
557
558 if (!ctx->bad_lost_and_found && !ctx->lost_and_found) {
559 if (e2fsck_get_lost_and_found(ctx, 1) == 0)
560 ctx->bad_lost_and_found++;
561 }
562 if (ctx->bad_lost_and_found) {
563 fix_problem(ctx, PR_3_NO_LPF, &pctx);
564 return 1;
565 }
566
567 sprintf(name, "#%u", ino);
568 if (ext2fs_read_inode(fs, ino, &inode) == 0)
569 file_type = ext2_file_type(inode.i_mode);
570 retval = ext2fs_link(fs, ctx->lost_and_found, name, ino, file_type);
571 if (retval == EXT2_ET_DIR_NO_SPACE) {
572 if (!fix_problem(ctx, PR_3_EXPAND_LF_DIR, &pctx))
573 return 1;
574 retval = e2fsck_expand_directory(ctx, ctx->lost_and_found,
575 1, 0);
576 if (retval) {
577 pctx.errcode = retval;
578 fix_problem(ctx, PR_3_CANT_EXPAND_LPF, &pctx);
579 return 1;
580 }
581 retval = ext2fs_link(fs, ctx->lost_and_found, name,
582 ino, file_type);
583 }
584 if (retval) {
585 pctx.errcode = retval;
586 fix_problem(ctx, PR_3_CANT_RECONNECT, &pctx);
587 return 1;
588 }
589 e2fsck_adjust_inode_count(ctx, ino, 1);
590
591 return 0;
592 }
593
594 /*
595 * Utility routine to adjust the inode counts on an inode.
596 */
597 errcode_t e2fsck_adjust_inode_count(e2fsck_t ctx, ext2_ino_t ino, int adj)
598 {
599 ext2_filsys fs = ctx->fs;
600 errcode_t retval;
601 struct ext2_inode inode;
602
603 if (!ino)
604 return 0;
605
606 retval = ext2fs_read_inode(fs, ino, &inode);
607 if (retval)
608 return retval;
609
610 #if 0
611 printf("Adjusting link count for inode %lu by %d (from %d)\n", ino, adj,
612 inode.i_links_count);
613 #endif
614
615 if (adj == 1) {
616 ext2fs_icount_increment(ctx->inode_count, ino, 0);
617 if (inode.i_links_count == (__u16) ~0)
618 return 0;
619 ext2fs_icount_increment(ctx->inode_link_info, ino, 0);
620 inode.i_links_count++;
621 } else if (adj == -1) {
622 ext2fs_icount_decrement(ctx->inode_count, ino, 0);
623 if (inode.i_links_count == 0)
624 return 0;
625 ext2fs_icount_decrement(ctx->inode_link_info, ino, 0);
626 inode.i_links_count--;
627 }
628
629 retval = ext2fs_write_inode(fs, ino, &inode);
630 if (retval)
631 return retval;
632
633 return 0;
634 }
635
636 /*
637 * Fix parent --- this routine fixes up the parent of a directory.
638 */
639 struct fix_dotdot_struct {
640 ext2_filsys fs;
641 ext2_ino_t parent;
642 int done;
643 e2fsck_t ctx;
644 };
645
646 static int fix_dotdot_proc(struct ext2_dir_entry *dirent,
647 int offset EXT2FS_ATTR((unused)),
648 int blocksize EXT2FS_ATTR((unused)),
649 char *buf EXT2FS_ATTR((unused)),
650 void *priv_data)
651 {
652 struct fix_dotdot_struct *fp = (struct fix_dotdot_struct *) priv_data;
653 errcode_t retval;
654 struct problem_context pctx;
655
656 if (ext2fs_dirent_name_len(dirent) != 2)
657 return 0;
658 if (strncmp(dirent->name, "..", 2))
659 return 0;
660
661 clear_problem_context(&pctx);
662
663 retval = e2fsck_adjust_inode_count(fp->ctx, dirent->inode, -1);
664 if (retval) {
665 pctx.errcode = retval;
666 fix_problem(fp->ctx, PR_3_ADJUST_INODE, &pctx);
667 }
668 retval = e2fsck_adjust_inode_count(fp->ctx, fp->parent, 1);
669 if (retval) {
670 pctx.errcode = retval;
671 fix_problem(fp->ctx, PR_3_ADJUST_INODE, &pctx);
672 }
673 dirent->inode = fp->parent;
674 if (fp->ctx->fs->super->s_feature_incompat &
675 EXT2_FEATURE_INCOMPAT_FILETYPE)
676 ext2fs_dirent_set_file_type(dirent, EXT2_FT_DIR);
677 else
678 ext2fs_dirent_set_file_type(dirent, EXT2_FT_UNKNOWN);
679
680 fp->done++;
681 return DIRENT_ABORT | DIRENT_CHANGED;
682 }
683
684 static void fix_dotdot(e2fsck_t ctx, ext2_ino_t ino, ext2_ino_t parent)
685 {
686 ext2_filsys fs = ctx->fs;
687 errcode_t retval;
688 struct fix_dotdot_struct fp;
689 struct problem_context pctx;
690
691 fp.fs = fs;
692 fp.parent = parent;
693 fp.done = 0;
694 fp.ctx = ctx;
695
696 #if 0
697 printf("Fixing '..' of inode %lu to be %lu...\n", ino, parent);
698 #endif
699
700 clear_problem_context(&pctx);
701 pctx.ino = ino;
702 if (e2fsck_dir_will_be_rehashed(ctx, ino))
703 ctx->fs->flags |= EXT2_FLAG_IGNORE_CSUM_ERRORS;
704 retval = ext2fs_dir_iterate(fs, ino, DIRENT_FLAG_INCLUDE_EMPTY,
705 0, fix_dotdot_proc, &fp);
706 if (e2fsck_dir_will_be_rehashed(ctx, ino))
707 ctx->fs->flags &= ~EXT2_FLAG_IGNORE_CSUM_ERRORS;
708 if (retval || !fp.done) {
709 pctx.errcode = retval;
710 fix_problem(ctx, retval ? PR_3_FIX_PARENT_ERR :
711 PR_3_FIX_PARENT_NOFIND, &pctx);
712 ext2fs_unmark_valid(fs);
713 }
714 (void) e2fsck_dir_info_set_dotdot(ctx, ino, parent);
715 if (e2fsck_dir_info_set_parent(ctx, ino, ctx->lost_and_found))
716 fix_problem(ctx, PR_3_NO_DIRINFO, &pctx);
717
718 return;
719 }
720
721 /*
722 * These routines are responsible for expanding a /lost+found if it is
723 * too small.
724 */
725
726 struct expand_dir_struct {
727 blk64_t num;
728 e2_blkcnt_t guaranteed_size;
729 blk64_t newblocks;
730 blk64_t last_block;
731 errcode_t err;
732 e2fsck_t ctx;
733 ext2_ino_t dir;
734 };
735
736 static int expand_dir_proc(ext2_filsys fs,
737 blk64_t *blocknr,
738 e2_blkcnt_t blockcnt,
739 blk64_t ref_block EXT2FS_ATTR((unused)),
740 int ref_offset EXT2FS_ATTR((unused)),
741 void *priv_data)
742 {
743 struct expand_dir_struct *es = (struct expand_dir_struct *) priv_data;
744 blk64_t new_blk;
745 static blk64_t last_blk = 0;
746 char *block;
747 errcode_t retval;
748 e2fsck_t ctx;
749
750 ctx = es->ctx;
751
752 if (es->guaranteed_size && blockcnt >= es->guaranteed_size)
753 return BLOCK_ABORT;
754
755 if (blockcnt > 0)
756 es->last_block = blockcnt;
757 if (*blocknr) {
758 last_blk = *blocknr;
759 return 0;
760 }
761
762 if (blockcnt &&
763 (EXT2FS_B2C(fs, last_blk) == EXT2FS_B2C(fs, last_blk + 1)))
764 new_blk = last_blk + 1;
765 else {
766 last_blk &= ~EXT2FS_CLUSTER_MASK(fs);
767 retval = ext2fs_new_block2(fs, last_blk, ctx->block_found_map,
768 &new_blk);
769 if (retval) {
770 es->err = retval;
771 return BLOCK_ABORT;
772 }
773 es->newblocks++;
774 ext2fs_block_alloc_stats2(fs, new_blk, +1);
775 }
776 last_blk = new_blk;
777
778 if (blockcnt > 0) {
779 retval = ext2fs_new_dir_block(fs, 0, 0, &block);
780 if (retval) {
781 es->err = retval;
782 return BLOCK_ABORT;
783 }
784 es->num--;
785 retval = ext2fs_write_dir_block4(fs, new_blk, block, 0,
786 es->dir);
787 } else {
788 retval = ext2fs_get_mem(fs->blocksize, &block);
789 if (retval) {
790 es->err = retval;
791 return BLOCK_ABORT;
792 }
793 memset(block, 0, fs->blocksize);
794 retval = io_channel_write_blk64(fs->io, new_blk, 1, block);
795 }
796 if (retval) {
797 es->err = retval;
798 return BLOCK_ABORT;
799 }
800 ext2fs_free_mem(&block);
801 *blocknr = new_blk;
802 ext2fs_mark_block_bitmap2(ctx->block_found_map, new_blk);
803
804 if (es->num == 0)
805 return (BLOCK_CHANGED | BLOCK_ABORT);
806 else
807 return BLOCK_CHANGED;
808 }
809
810 errcode_t e2fsck_expand_directory(e2fsck_t ctx, ext2_ino_t dir,
811 int num, int guaranteed_size)
812 {
813 ext2_filsys fs = ctx->fs;
814 errcode_t retval;
815 struct expand_dir_struct es;
816 struct ext2_inode inode;
817 blk64_t sz, before, after;
818
819 if (!(fs->flags & EXT2_FLAG_RW))
820 return EXT2_ET_RO_FILSYS;
821
822 /*
823 * Read the inode and block bitmaps in; we'll be messing with
824 * them.
825 */
826 e2fsck_read_bitmaps(ctx);
827
828 retval = ext2fs_check_directory(fs, dir);
829 if (retval)
830 return retval;
831
832 es.num = num;
833 es.guaranteed_size = guaranteed_size;
834 es.last_block = 0;
835 es.err = 0;
836 es.newblocks = 0;
837 es.ctx = ctx;
838 es.dir = dir;
839
840 retval = ext2fs_block_iterate3(fs, dir, BLOCK_FLAG_APPEND,
841 0, expand_dir_proc, &es);
842
843 if (es.err)
844 return es.err;
845
846 /*
847 * Update the size and block count fields in the inode.
848 */
849 retval = ext2fs_read_inode(fs, dir, &inode);
850 if (retval)
851 return retval;
852
853 sz = (es.last_block + 1) * fs->blocksize;
854 retval = ext2fs_inode_size_set(fs, &inode, sz);
855 if (retval)
856 return retval;
857 ext2fs_iblk_add_blocks(fs, &inode, es.newblocks);
858 quota_data_add(ctx->qctx, &inode, dir, es.newblocks * fs->blocksize);
859
860 e2fsck_write_inode(ctx, dir, &inode, "expand_directory");
861
862 return 0;
863 }
864