]> git.ipfire.org Git - thirdparty/e2fsprogs.git/blob - e2fsck/pass2.c
projects / thirdparty / e2fsprogs.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
e2fsck: Don't cancel the fsck run after clearing an errant INODE_UNINIT flag
[thirdparty/e2fsprogs.git] / e2fsck / pass2.c
1 /*
2 * pass2.c --- check directory structure
3 *
4 * Copyright (C) 1993, 1994, 1995, 1996, 1997 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 2 of e2fsck iterates through all active directory inodes, and
12 * applies to following tests to each directory entry in the directory
13 * blocks in the inodes:
14 *
15 * - The length of the directory entry (rec_len) should be at
16 * least 8 bytes, and no more than the remaining space
17 * left in the directory block.
18 * - The length of the name in the directory entry (name_len)
19 * should be less than (rec_len - 8).
20 * - The inode number in the directory entry should be within
21 * legal bounds.
22 * - The inode number should refer to a in-use inode.
23 * - The first entry should be '.', and its inode should be
24 * the inode of the directory.
25 * - The second entry should be '..'.
26 *
27 * To minimize disk seek time, the directory blocks are processed in
28 * sorted order of block numbers.
29 *
30 * Pass 2 also collects the following information:
31 * - The inode numbers of the subdirectories for each directory.
32 *
33 * Pass 2 relies on the following information from previous passes:
34 * - The directory information collected in pass 1.
35 * - The inode_used_map bitmap
36 * - The inode_bad_map bitmap
37 * - The inode_dir_map bitmap
38 *
39 * Pass 2 frees the following data structures
40 * - The inode_bad_map bitmap
41 * - The inode_reg_map bitmap
42 */
43
44 #define _GNU_SOURCE 1 /* get strnlen() */
45 #include <string.h>
46
47 #include "e2fsck.h"
48 #include "problem.h"
49 #include "dict.h"
50
51 #ifdef NO_INLINE_FUNCS
52 #define _INLINE_
53 #else
54 #define _INLINE_ inline
55 #endif
56
57 /* #define DX_DEBUG */
58
59 /*
60 * Keeps track of how many times an inode is referenced.
61 */
62 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf);
63 static int check_dir_block(ext2_filsys fs,
64 struct ext2_db_entry *dir_blocks_info,
65 void *priv_data);
66 static int allocate_dir_block(e2fsck_t ctx,
67 struct ext2_db_entry *dir_blocks_info,
68 char *buf, struct problem_context *pctx);
69 static int update_dir_block(ext2_filsys fs,
70 blk_t *block_nr,
71 e2_blkcnt_t blockcnt,
72 blk_t ref_block,
73 int ref_offset,
74 void *priv_data);
75 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino);
76 static int htree_depth(struct dx_dir_info *dx_dir,
77 struct dx_dirblock_info *dx_db);
78 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b);
79
80 struct check_dir_struct {
81 char *buf;
82 struct problem_context pctx;
83 int count, max;
84 e2fsck_t ctx;
85 };
86
87 void e2fsck_pass2(e2fsck_t ctx)
88 {
89 struct ext2_super_block *sb = ctx->fs->super;
90 struct problem_context pctx;
91 ext2_filsys fs = ctx->fs;
92 char *buf;
93 #ifdef RESOURCE_TRACK
94 struct resource_track rtrack;
95 #endif
96 struct check_dir_struct cd;
97 struct dx_dir_info *dx_dir;
98 struct dx_dirblock_info *dx_db, *dx_parent;
99 int b;
100 int i, depth;
101 problem_t code;
102 int bad_dir;
103
104 #ifdef RESOURCE_TRACK
105 init_resource_track(&rtrack, ctx->fs->io);
106 #endif
107
108 clear_problem_context(&cd.pctx);
109
110 #ifdef MTRACE
111 mtrace_print("Pass 2");
112 #endif
113
114 if (!(ctx->options & E2F_OPT_PREEN))
115 fix_problem(ctx, PR_2_PASS_HEADER, &cd.pctx);
116
117 e2fsck_setup_tdb_icount(ctx, EXT2_ICOUNT_OPT_INCREMENT,
118 &ctx->inode_count);
119 if (ctx->inode_count)
120 cd.pctx.errcode = 0;
121 else
122 cd.pctx.errcode = ext2fs_create_icount2(fs,
123 EXT2_ICOUNT_OPT_INCREMENT,
124 0, ctx->inode_link_info,
125 &ctx->inode_count);
126 if (cd.pctx.errcode) {
127 fix_problem(ctx, PR_2_ALLOCATE_ICOUNT, &cd.pctx);
128 ctx->flags |= E2F_FLAG_ABORT;
129 return;
130 }
131 buf = (char *) e2fsck_allocate_memory(ctx, 2*fs->blocksize,
132 "directory scan buffer");
133
134 /*
135 * Set up the parent pointer for the root directory, if
136 * present. (If the root directory is not present, we will
137 * create it in pass 3.)
138 */
139 (void) e2fsck_dir_info_set_parent(ctx, EXT2_ROOT_INO, EXT2_ROOT_INO);
140
141 cd.buf = buf;
142 cd.ctx = ctx;
143 cd.count = 1;
144 cd.max = ext2fs_dblist_count(fs->dblist);
145
146 if (ctx->progress)
147 (void) (ctx->progress)(ctx, 2, 0, cd.max);
148
149 if (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_DIR_INDEX)
150 ext2fs_dblist_sort(fs->dblist, special_dir_block_cmp);
151
152 cd.pctx.errcode = ext2fs_dblist_iterate(fs->dblist, check_dir_block,
153 &cd);
154 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
155 return;
156 if (cd.pctx.errcode) {
157 fix_problem(ctx, PR_2_DBLIST_ITERATE, &cd.pctx);
158 ctx->flags |= E2F_FLAG_ABORT;
159 return;
160 }
161
162 #ifdef ENABLE_HTREE
163 for (i=0; (dx_dir = e2fsck_dx_dir_info_iter(ctx, &i)) != 0;) {
164 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
165 return;
166 if (dx_dir->numblocks == 0)
167 continue;
168 clear_problem_context(&pctx);
169 bad_dir = 0;
170 pctx.dir = dx_dir->ino;
171 dx_db = dx_dir->dx_block;
172 if (dx_db->flags & DX_FLAG_REFERENCED)
173 dx_db->flags |= DX_FLAG_DUP_REF;
174 else
175 dx_db->flags |= DX_FLAG_REFERENCED;
176 /*
177 * Find all of the first and last leaf blocks, and
178 * update their parent's min and max hash values
179 */
180 for (b=0, dx_db = dx_dir->dx_block;
181 b < dx_dir->numblocks;
182 b++, dx_db++) {
183 if ((dx_db->type != DX_DIRBLOCK_LEAF) ||
184 !(dx_db->flags & (DX_FLAG_FIRST | DX_FLAG_LAST)))
185 continue;
186 dx_parent = &dx_dir->dx_block[dx_db->parent];
187 /*
188 * XXX Make sure dx_parent->min_hash > dx_db->min_hash
189 */
190 if (dx_db->flags & DX_FLAG_FIRST)
191 dx_parent->min_hash = dx_db->min_hash;
192 /*
193 * XXX Make sure dx_parent->max_hash < dx_db->max_hash
194 */
195 if (dx_db->flags & DX_FLAG_LAST)
196 dx_parent->max_hash = dx_db->max_hash;
197 }
198
199 for (b=0, dx_db = dx_dir->dx_block;
200 b < dx_dir->numblocks;
201 b++, dx_db++) {
202 pctx.blkcount = b;
203 pctx.group = dx_db->parent;
204 code = 0;
205 if (!(dx_db->flags & DX_FLAG_FIRST) &&
206 (dx_db->min_hash < dx_db->node_min_hash)) {
207 pctx.blk = dx_db->min_hash;
208 pctx.blk2 = dx_db->node_min_hash;
209 code = PR_2_HTREE_MIN_HASH;
210 fix_problem(ctx, code, &pctx);
211 bad_dir++;
212 }
213 if (dx_db->type == DX_DIRBLOCK_LEAF) {
214 depth = htree_depth(dx_dir, dx_db);
215 if (depth != dx_dir->depth) {
216 pctx.num = dx_dir->depth;
217 code = PR_2_HTREE_BAD_DEPTH;
218 fix_problem(ctx, code, &pctx);
219 bad_dir++;
220 }
221 }
222 /*
223 * This test doesn't apply for the root block
224 * at block #0
225 */
226 if (b &&
227 (dx_db->max_hash > dx_db->node_max_hash)) {
228 pctx.blk = dx_db->max_hash;
229 pctx.blk2 = dx_db->node_max_hash;
230 code = PR_2_HTREE_MAX_HASH;
231 fix_problem(ctx, code, &pctx);
232 bad_dir++;
233 }
234 if (!(dx_db->flags & DX_FLAG_REFERENCED)) {
235 code = PR_2_HTREE_NOTREF;
236 fix_problem(ctx, code, &pctx);
237 bad_dir++;
238 } else if (dx_db->flags & DX_FLAG_DUP_REF) {
239 code = PR_2_HTREE_DUPREF;
240 fix_problem(ctx, code, &pctx);
241 bad_dir++;
242 }
243 if (code == 0)
244 continue;
245 }
246 if (bad_dir && fix_problem(ctx, PR_2_HTREE_CLEAR, &pctx)) {
247 clear_htree(ctx, dx_dir->ino);
248 dx_dir->numblocks = 0;
249 }
250 }
251 #endif
252 ext2fs_free_mem(&buf);
253 ext2fs_free_dblist(fs->dblist);
254
255 if (ctx->inode_bad_map) {
256 ext2fs_free_inode_bitmap(ctx->inode_bad_map);
257 ctx->inode_bad_map = 0;
258 }
259 if (ctx->inode_reg_map) {
260 ext2fs_free_inode_bitmap(ctx->inode_reg_map);
261 ctx->inode_reg_map = 0;
262 }
263
264 clear_problem_context(&pctx);
265 if (ctx->large_files) {
266 if (!(sb->s_feature_ro_compat &
267 EXT2_FEATURE_RO_COMPAT_LARGE_FILE) &&
268 fix_problem(ctx, PR_2_FEATURE_LARGE_FILES, &pctx)) {
269 sb->s_feature_ro_compat |=
270 EXT2_FEATURE_RO_COMPAT_LARGE_FILE;
271 fs->flags &= ~EXT2_FLAG_MASTER_SB_ONLY;
272 ext2fs_mark_super_dirty(fs);
273 }
274 if (sb->s_rev_level == EXT2_GOOD_OLD_REV &&
275 fix_problem(ctx, PR_1_FS_REV_LEVEL, &pctx)) {
276 ext2fs_update_dynamic_rev(fs);
277 ext2fs_mark_super_dirty(fs);
278 }
279 }
280
281 #ifdef RESOURCE_TRACK
282 if (ctx->options & E2F_OPT_TIME2) {
283 e2fsck_clear_progbar(ctx);
284 print_resource_track(_("Pass 2"), &rtrack, fs->io);
285 }
286 #endif
287 }
288
289 #define MAX_DEPTH 32000
290 static int htree_depth(struct dx_dir_info *dx_dir,
291 struct dx_dirblock_info *dx_db)
292 {
293 int depth = 0;
294
295 while (dx_db->type != DX_DIRBLOCK_ROOT && depth < MAX_DEPTH) {
296 dx_db = &dx_dir->dx_block[dx_db->parent];
297 depth++;
298 }
299 return depth;
300 }
301
302 static int dict_de_cmp(const void *a, const void *b)
303 {
304 const struct ext2_dir_entry *de_a, *de_b;
305 int a_len, b_len;
306
307 de_a = (const struct ext2_dir_entry *) a;
308 a_len = de_a->name_len & 0xFF;
309 de_b = (const struct ext2_dir_entry *) b;
310 b_len = de_b->name_len & 0xFF;
311
312 if (a_len != b_len)
313 return (a_len - b_len);
314
315 return strncmp(de_a->name, de_b->name, a_len);
316 }
317
318 /*
319 * This is special sort function that makes sure that directory blocks
320 * with a dirblock of zero are sorted to the beginning of the list.
321 * This guarantees that the root node of the htree directories are
322 * processed first, so we know what hash version to use.
323 */
324 static EXT2_QSORT_TYPE special_dir_block_cmp(const void *a, const void *b)
325 {
326 const struct ext2_db_entry *db_a =
327 (const struct ext2_db_entry *) a;
328 const struct ext2_db_entry *db_b =
329 (const struct ext2_db_entry *) b;
330
331 if (db_a->blockcnt && !db_b->blockcnt)
332 return 1;
333
334 if (!db_a->blockcnt && db_b->blockcnt)
335 return -1;
336
337 if (db_a->blk != db_b->blk)
338 return (int) (db_a->blk - db_b->blk);
339
340 if (db_a->ino != db_b->ino)
341 return (int) (db_a->ino - db_b->ino);
342
343 return (int) (db_a->blockcnt - db_b->blockcnt);
344 }
345
346
347 /*
348 * Make sure the first entry in the directory is '.', and that the
349 * directory entry is sane.
350 */
351 static int check_dot(e2fsck_t ctx,
352 struct ext2_dir_entry *dirent,
353 ext2_ino_t ino, struct problem_context *pctx)
354 {
355 struct ext2_dir_entry *nextdir;
356 int status = 0;
357 int created = 0;
358 int rec_len, new_len;
359 int problem = 0;
360
361 if (!dirent->inode)
362 problem = PR_2_MISSING_DOT;
363 else if (((dirent->name_len & 0xFF) != 1) ||
364 (dirent->name[0] != '.'))
365 problem = PR_2_1ST_NOT_DOT;
366 else if (dirent->name[1] != '\0')
367 problem = PR_2_DOT_NULL_TERM;
368
369 rec_len = (dirent->rec_len || ctx->fs->blocksize < 65536) ?
370 dirent->rec_len : 65536;
371 if (problem) {
372 if (fix_problem(ctx, problem, pctx)) {
373 if (rec_len < 12)
374 rec_len = dirent->rec_len = 12;
375 dirent->inode = ino;
376 dirent->name_len = 1;
377 dirent->name[0] = '.';
378 dirent->name[1] = '\0';
379 status = 1;
380 created = 1;
381 }
382 }
383 if (dirent->inode != ino) {
384 if (fix_problem(ctx, PR_2_BAD_INODE_DOT, pctx)) {
385 dirent->inode = ino;
386 status = 1;
387 }
388 }
389 if (rec_len > 12) {
390 new_len = rec_len - 12;
391 if (new_len > 12) {
392 if (created ||
393 fix_problem(ctx, PR_2_SPLIT_DOT, pctx)) {
394 nextdir = (struct ext2_dir_entry *)
395 ((char *) dirent + 12);
396 dirent->rec_len = 12;
397 nextdir->rec_len = new_len;
398 nextdir->inode = 0;
399 nextdir->name_len = 0;
400 status = 1;
401 }
402 }
403 }
404 return status;
405 }
406
407 /*
408 * Make sure the second entry in the directory is '..', and that the
409 * directory entry is sane. We do not check the inode number of '..'
410 * here; this gets done in pass 3.
411 */
412 static int check_dotdot(e2fsck_t ctx,
413 struct ext2_dir_entry *dirent,
414 ext2_ino_t ino, struct problem_context *pctx)
415 {
416 int rec_len, problem = 0;
417
418 if (!dirent->inode)
419 problem = PR_2_MISSING_DOT_DOT;
420 else if (((dirent->name_len & 0xFF) != 2) ||
421 (dirent->name[0] != '.') ||
422 (dirent->name[1] != '.'))
423 problem = PR_2_2ND_NOT_DOT_DOT;
424 else if (dirent->name[2] != '\0')
425 problem = PR_2_DOT_DOT_NULL_TERM;
426
427 rec_len = (dirent->rec_len || ctx->fs->blocksize < 65536) ?
428 dirent->rec_len : 65536;
429 if (problem) {
430 if (fix_problem(ctx, problem, pctx)) {
431 if (rec_len < 12)
432 dirent->rec_len = 12;
433 /*
434 * Note: we don't have the parent inode just
435 * yet, so we will fill it in with the root
436 * inode. This will get fixed in pass 3.
437 */
438 dirent->inode = EXT2_ROOT_INO;
439 dirent->name_len = 2;
440 dirent->name[0] = '.';
441 dirent->name[1] = '.';
442 dirent->name[2] = '\0';
443 return 1;
444 }
445 return 0;
446 }
447 if (e2fsck_dir_info_set_dotdot(ctx, ino, dirent->inode)) {
448 fix_problem(ctx, PR_2_NO_DIRINFO, pctx);
449 return -1;
450 }
451 return 0;
452 }
453
454 /*
455 * Check to make sure a directory entry doesn't contain any illegal
456 * characters.
457 */
458 static int check_name(e2fsck_t ctx,
459 struct ext2_dir_entry *dirent,
460 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
461 struct problem_context *pctx)
462 {
463 int i;
464 int fixup = -1;
465 int ret = 0;
466
467 for ( i = 0; i < (dirent->name_len & 0xFF); i++) {
468 if (dirent->name[i] == '/' || dirent->name[i] == '\0') {
469 if (fixup < 0) {
470 fixup = fix_problem(ctx, PR_2_BAD_NAME, pctx);
471 }
472 if (fixup) {
473 dirent->name[i] = '.';
474 ret = 1;
475 }
476 }
477 }
478 return ret;
479 }
480
481 /*
482 * Check the directory filetype (if present)
483 */
484 static _INLINE_ int check_filetype(e2fsck_t ctx,
485 struct ext2_dir_entry *dirent,
486 ext2_ino_t dir_ino EXT2FS_ATTR((unused)),
487 struct problem_context *pctx)
488 {
489 int filetype = dirent->name_len >> 8;
490 int should_be = EXT2_FT_UNKNOWN;
491 struct ext2_inode inode;
492
493 if (!(ctx->fs->super->s_feature_incompat &
494 EXT2_FEATURE_INCOMPAT_FILETYPE)) {
495 if (filetype == 0 ||
496 !fix_problem(ctx, PR_2_CLEAR_FILETYPE, pctx))
497 return 0;
498 dirent->name_len = dirent->name_len & 0xFF;
499 return 1;
500 }
501
502 if (ext2fs_test_inode_bitmap(ctx->inode_dir_map, dirent->inode)) {
503 should_be = EXT2_FT_DIR;
504 } else if (ext2fs_test_inode_bitmap(ctx->inode_reg_map,
505 dirent->inode)) {
506 should_be = EXT2_FT_REG_FILE;
507 } else if (ctx->inode_bad_map &&
508 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
509 dirent->inode))
510 should_be = 0;
511 else {
512 e2fsck_read_inode(ctx, dirent->inode, &inode,
513 "check_filetype");
514 should_be = ext2_file_type(inode.i_mode);
515 }
516 if (filetype == should_be)
517 return 0;
518 pctx->num = should_be;
519
520 if (fix_problem(ctx, filetype ? PR_2_BAD_FILETYPE : PR_2_SET_FILETYPE,
521 pctx) == 0)
522 return 0;
523
524 dirent->name_len = (dirent->name_len & 0xFF) | should_be << 8;
525 return 1;
526 }
527
528 #ifdef ENABLE_HTREE
529 static void parse_int_node(ext2_filsys fs,
530 struct ext2_db_entry *db,
531 struct check_dir_struct *cd,
532 struct dx_dir_info *dx_dir,
533 char *block_buf)
534 {
535 struct ext2_dx_root_info *root;
536 struct ext2_dx_entry *ent;
537 struct ext2_dx_countlimit *limit;
538 struct dx_dirblock_info *dx_db;
539 int i, expect_limit, count;
540 blk_t blk;
541 ext2_dirhash_t min_hash = 0xffffffff;
542 ext2_dirhash_t max_hash = 0;
543 ext2_dirhash_t hash = 0, prev_hash;
544
545 if (db->blockcnt == 0) {
546 root = (struct ext2_dx_root_info *) (block_buf + 24);
547
548 #ifdef DX_DEBUG
549 printf("Root node dump:\n");
550 printf("\t Reserved zero: %u\n", root->reserved_zero);
551 printf("\t Hash Version: %d\n", root->hash_version);
552 printf("\t Info length: %d\n", root->info_length);
553 printf("\t Indirect levels: %d\n", root->indirect_levels);
554 printf("\t Flags: %d\n", root->unused_flags);
555 #endif
556
557 ent = (struct ext2_dx_entry *) (block_buf + 24 + root->info_length);
558 } else {
559 ent = (struct ext2_dx_entry *) (block_buf+8);
560 }
561 limit = (struct ext2_dx_countlimit *) ent;
562
563 #ifdef DX_DEBUG
564 printf("Number of entries (count): %d\n",
565 ext2fs_le16_to_cpu(limit->count));
566 printf("Number of entries (limit): %d\n",
567 ext2fs_le16_to_cpu(limit->limit));
568 #endif
569
570 count = ext2fs_le16_to_cpu(limit->count);
571 expect_limit = (fs->blocksize - ((char *) ent - block_buf)) /
572 sizeof(struct ext2_dx_entry);
573 if (ext2fs_le16_to_cpu(limit->limit) != expect_limit) {
574 cd->pctx.num = ext2fs_le16_to_cpu(limit->limit);
575 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_LIMIT, &cd->pctx))
576 goto clear_and_exit;
577 }
578 if (count > expect_limit) {
579 cd->pctx.num = count;
580 if (fix_problem(cd->ctx, PR_2_HTREE_BAD_COUNT, &cd->pctx))
581 goto clear_and_exit;
582 count = expect_limit;
583 }
584
585 for (i=0; i < count; i++) {
586 prev_hash = hash;
587 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
588 #ifdef DX_DEBUG
589 printf("Entry #%d: Hash 0x%08x, block %u\n", i,
590 hash, ext2fs_le32_to_cpu(ent[i].block));
591 #endif
592 blk = ext2fs_le32_to_cpu(ent[i].block) & 0x0ffffff;
593 /* Check to make sure the block is valid */
594 if (blk >= (blk_t) dx_dir->numblocks) {
595 cd->pctx.blk = blk;
596 if (fix_problem(cd->ctx, PR_2_HTREE_BADBLK,
597 &cd->pctx))
598 goto clear_and_exit;
599 continue;
600 }
601 if (hash < prev_hash &&
602 fix_problem(cd->ctx, PR_2_HTREE_HASH_ORDER, &cd->pctx))
603 goto clear_and_exit;
604 dx_db = &dx_dir->dx_block[blk];
605 if (dx_db->flags & DX_FLAG_REFERENCED) {
606 dx_db->flags |= DX_FLAG_DUP_REF;
607 } else {
608 dx_db->flags |= DX_FLAG_REFERENCED;
609 dx_db->parent = db->blockcnt;
610 }
611 if (hash < min_hash)
612 min_hash = hash;
613 if (hash > max_hash)
614 max_hash = hash;
615 dx_db->node_min_hash = hash;
616 if ((i+1) < count)
617 dx_db->node_max_hash =
618 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
619 else {
620 dx_db->node_max_hash = 0xfffffffe;
621 dx_db->flags |= DX_FLAG_LAST;
622 }
623 if (i == 0)
624 dx_db->flags |= DX_FLAG_FIRST;
625 }
626 #ifdef DX_DEBUG
627 printf("Blockcnt = %d, min hash 0x%08x, max hash 0x%08x\n",
628 db->blockcnt, min_hash, max_hash);
629 #endif
630 dx_db = &dx_dir->dx_block[db->blockcnt];
631 dx_db->min_hash = min_hash;
632 dx_db->max_hash = max_hash;
633 return;
634
635 clear_and_exit:
636 clear_htree(cd->ctx, cd->pctx.ino);
637 dx_dir->numblocks = 0;
638 }
639 #endif /* ENABLE_HTREE */
640
641 /*
642 * Given a busted directory, try to salvage it somehow.
643 *
644 */
645 static void salvage_directory(ext2_filsys fs,
646 struct ext2_dir_entry *dirent,
647 struct ext2_dir_entry *prev,
648 unsigned int *offset)
649 {
650 char *cp = (char *) dirent;
651 int left, rec_len;
652 unsigned int name_len = dirent->name_len & 0xFF;
653
654 rec_len = (dirent->rec_len || fs->blocksize < 65536) ?
655 dirent->rec_len : 65536;
656 left = fs->blocksize - *offset - rec_len;
657
658 /*
659 * Special case of directory entry of size 8: copy what's left
660 * of the directory block up to cover up the invalid hole.
661 */
662 if ((left >= 12) && (rec_len == 8)) {
663 memmove(cp, cp+8, left);
664 memset(cp + left, 0, 8);
665 return;
666 }
667 /*
668 * If the directory entry overruns the end of the directory
669 * block, and the name is small enough to fit, then adjust the
670 * record length.
671 */
672 if ((left < 0) &&
673 (name_len + 8 <= rec_len + (unsigned) left) &&
674 dirent->inode <= fs->super->s_inodes_count &&
675 strnlen(dirent->name, name_len) == name_len) {
676 dirent->rec_len += left;
677 return;
678 }
679 /*
680 * If the record length of the directory entry is a multiple
681 * of four, and not too big, such that it is valid, let the
682 * previous directory entry absorb the invalid one.
683 */
684 if (prev && rec_len && (rec_len % 4) == 0 &&
685 (*offset + rec_len <= fs->blocksize)) {
686 prev->rec_len += rec_len;
687 *offset += rec_len;
688 return;
689 }
690 /*
691 * Default salvage method --- kill all of the directory
692 * entries for the rest of the block. We will either try to
693 * absorb it into the previous directory entry, or create a
694 * new empty directory entry the rest of the directory block.
695 */
696 if (prev) {
697 prev->rec_len += fs->blocksize - *offset;
698 *offset = fs->blocksize;
699 } else {
700 dirent->rec_len = fs->blocksize - *offset;
701 dirent->name_len = 0;
702 dirent->inode = 0;
703 }
704 }
705
706 static int check_dir_block(ext2_filsys fs,
707 struct ext2_db_entry *db,
708 void *priv_data)
709 {
710 struct dx_dir_info *dx_dir;
711 #ifdef ENABLE_HTREE
712 struct dx_dirblock_info *dx_db = 0;
713 #endif /* ENABLE_HTREE */
714 struct ext2_dir_entry *dirent, *prev;
715 ext2_dirhash_t hash;
716 unsigned int offset = 0;
717 const char * old_op;
718 int dir_modified = 0;
719 int dot_state;
720 unsigned int rec_len;
721 blk_t block_nr = db->blk;
722 ext2_ino_t ino = db->ino;
723 ext2_ino_t subdir_parent;
724 __u16 links;
725 struct check_dir_struct *cd;
726 char *buf;
727 e2fsck_t ctx;
728 int problem;
729 struct ext2_dx_root_info *root;
730 struct ext2_dx_countlimit *limit;
731 static dict_t de_dict;
732 struct problem_context pctx;
733 int dups_found = 0;
734 int ret;
735
736 cd = (struct check_dir_struct *) priv_data;
737 buf = cd->buf;
738 ctx = cd->ctx;
739
740 if (ctx->flags & E2F_FLAG_SIGNAL_MASK || ctx->flags & E2F_FLAG_RESTART)
741 return DIRENT_ABORT;
742
743 if (ctx->progress && (ctx->progress)(ctx, 2, cd->count++, cd->max))
744 return DIRENT_ABORT;
745
746 /*
747 * Make sure the inode is still in use (could have been
748 * deleted in the duplicate/bad blocks pass.
749 */
750 if (!(ext2fs_test_inode_bitmap(ctx->inode_used_map, ino)))
751 return 0;
752
753 cd->pctx.ino = ino;
754 cd->pctx.blk = block_nr;
755 cd->pctx.blkcount = db->blockcnt;
756 cd->pctx.ino2 = 0;
757 cd->pctx.dirent = 0;
758 cd->pctx.num = 0;
759
760 if (db->blk == 0) {
761 if (allocate_dir_block(ctx, db, buf, &cd->pctx))
762 return 0;
763 block_nr = db->blk;
764 }
765
766 if (db->blockcnt)
767 dot_state = 2;
768 else
769 dot_state = 0;
770
771 if (ctx->dirs_to_hash &&
772 ext2fs_u32_list_test(ctx->dirs_to_hash, ino))
773 dups_found++;
774
775 #if 0
776 printf("In process_dir_block block %lu, #%d, inode %lu\n", block_nr,
777 db->blockcnt, ino);
778 #endif
779
780 old_op = ehandler_operation(_("reading directory block"));
781 cd->pctx.errcode = ext2fs_read_dir_block(fs, block_nr, buf);
782 ehandler_operation(0);
783 if (cd->pctx.errcode == EXT2_ET_DIR_CORRUPTED)
784 cd->pctx.errcode = 0; /* We'll handle this ourselves */
785 if (cd->pctx.errcode) {
786 if (!fix_problem(ctx, PR_2_READ_DIRBLOCK, &cd->pctx)) {
787 ctx->flags |= E2F_FLAG_ABORT;
788 return DIRENT_ABORT;
789 }
790 memset(buf, 0, fs->blocksize);
791 }
792 #ifdef ENABLE_HTREE
793 dx_dir = e2fsck_get_dx_dir_info(ctx, ino);
794 if (dx_dir && dx_dir->numblocks) {
795 if (db->blockcnt >= dx_dir->numblocks) {
796 if (fix_problem(ctx, PR_2_UNEXPECTED_HTREE_BLOCK,
797 &pctx)) {
798 clear_htree(ctx, ino);
799 dx_dir->numblocks = 0;
800 dx_db = 0;
801 goto out_htree;
802 }
803 fatal_error(ctx, _("Can not continue."));
804 }
805 dx_db = &dx_dir->dx_block[db->blockcnt];
806 dx_db->type = DX_DIRBLOCK_LEAF;
807 dx_db->phys = block_nr;
808 dx_db->min_hash = ~0;
809 dx_db->max_hash = 0;
810
811 dirent = (struct ext2_dir_entry *) buf;
812 rec_len = (dirent->rec_len || fs->blocksize < 65536) ?
813 dirent->rec_len : 65536;
814 limit = (struct ext2_dx_countlimit *) (buf+8);
815 if (db->blockcnt == 0) {
816 root = (struct ext2_dx_root_info *) (buf + 24);
817 dx_db->type = DX_DIRBLOCK_ROOT;
818 dx_db->flags |= DX_FLAG_FIRST | DX_FLAG_LAST;
819 if ((root->reserved_zero ||
820 root->info_length < 8 ||
821 root->indirect_levels > 1) &&
822 fix_problem(ctx, PR_2_HTREE_BAD_ROOT, &cd->pctx)) {
823 clear_htree(ctx, ino);
824 dx_dir->numblocks = 0;
825 dx_db = 0;
826 }
827 dx_dir->hashversion = root->hash_version;
828 if ((dx_dir->hashversion <= EXT2_HASH_TEA) &&
829 (fs->super->s_flags & EXT2_FLAGS_UNSIGNED_HASH))
830 dx_dir->hashversion += 3;
831 dx_dir->depth = root->indirect_levels + 1;
832 } else if ((dirent->inode == 0) &&
833 (rec_len == fs->blocksize) &&
834 (dirent->name_len == 0) &&
835 (ext2fs_le16_to_cpu(limit->limit) ==
836 ((fs->blocksize-8) /
837 sizeof(struct ext2_dx_entry))))
838 dx_db->type = DX_DIRBLOCK_NODE;
839 }
840 out_htree:
841 #endif /* ENABLE_HTREE */
842
843 dict_init(&de_dict, DICTCOUNT_T_MAX, dict_de_cmp);
844 prev = 0;
845 do {
846 int group;
847 ext2_ino_t first_unused_inode;
848
849 problem = 0;
850 dirent = (struct ext2_dir_entry *) (buf + offset);
851 rec_len = (dirent->rec_len || fs->blocksize < 65536) ?
852 dirent->rec_len : 65536;
853 cd->pctx.dirent = dirent;
854 cd->pctx.num = offset;
855 if (((offset + rec_len) > fs->blocksize) ||
856 (rec_len < 12) ||
857 ((rec_len % 4) != 0) ||
858 (((dirent->name_len & (unsigned) 0xFF)+8) > rec_len)) {
859 if (fix_problem(ctx, PR_2_DIR_CORRUPTED, &cd->pctx)) {
860 salvage_directory(fs, dirent, prev, &offset);
861 dir_modified++;
862 continue;
863 } else
864 goto abort_free_dict;
865 }
866 if ((dirent->name_len & 0xFF) > EXT2_NAME_LEN) {
867 if (fix_problem(ctx, PR_2_FILENAME_LONG, &cd->pctx)) {
868 dirent->name_len = EXT2_NAME_LEN;
869 dir_modified++;
870 }
871 }
872
873 if (dot_state == 0) {
874 if (check_dot(ctx, dirent, ino, &cd->pctx))
875 dir_modified++;
876 } else if (dot_state == 1) {
877 ret = check_dotdot(ctx, dirent, ino, &cd->pctx);
878 if (ret < 0)
879 goto abort_free_dict;
880 if (ret)
881 dir_modified++;
882 } else if (dirent->inode == ino) {
883 problem = PR_2_LINK_DOT;
884 if (fix_problem(ctx, PR_2_LINK_DOT, &cd->pctx)) {
885 dirent->inode = 0;
886 dir_modified++;
887 goto next;
888 }
889 }
890 if (!dirent->inode)
891 goto next;
892
893 /*
894 * Make sure the inode listed is a legal one.
895 */
896 if (((dirent->inode != EXT2_ROOT_INO) &&
897 (dirent->inode < EXT2_FIRST_INODE(fs->super))) ||
898 (dirent->inode > fs->super->s_inodes_count)) {
899 problem = PR_2_BAD_INO;
900 } else if (ctx->inode_bb_map &&
901 (ext2fs_test_inode_bitmap(ctx->inode_bb_map,
902 dirent->inode))) {
903 /*
904 * If the inode is in a bad block, offer to
905 * clear it.
906 */
907 problem = PR_2_BB_INODE;
908 } else if ((dot_state > 1) &&
909 ((dirent->name_len & 0xFF) == 1) &&
910 (dirent->name[0] == '.')) {
911 /*
912 * If there's a '.' entry in anything other
913 * than the first directory entry, it's a
914 * duplicate entry that should be removed.
915 */
916 problem = PR_2_DUP_DOT;
917 } else if ((dot_state > 1) &&
918 ((dirent->name_len & 0xFF) == 2) &&
919 (dirent->name[0] == '.') &&
920 (dirent->name[1] == '.')) {
921 /*
922 * If there's a '..' entry in anything other
923 * than the second directory entry, it's a
924 * duplicate entry that should be removed.
925 */
926 problem = PR_2_DUP_DOT_DOT;
927 } else if ((dot_state > 1) &&
928 (dirent->inode == EXT2_ROOT_INO)) {
929 /*
930 * Don't allow links to the root directory.
931 * We check this specially to make sure we
932 * catch this error case even if the root
933 * directory hasn't been created yet.
934 */
935 problem = PR_2_LINK_ROOT;
936 } else if ((dot_state > 1) &&
937 (dirent->name_len & 0xFF) == 0) {
938 /*
939 * Don't allow zero-length directory names.
940 */
941 problem = PR_2_NULL_NAME;
942 }
943
944 if (problem) {
945 if (fix_problem(ctx, problem, &cd->pctx)) {
946 dirent->inode = 0;
947 dir_modified++;
948 goto next;
949 } else {
950 ext2fs_unmark_valid(fs);
951 if (problem == PR_2_BAD_INO)
952 goto next;
953 }
954 }
955
956 /*
957 * If the inode was marked as having bad fields in
958 * pass1, process it and offer to fix/clear it.
959 * (We wait until now so that we can display the
960 * pathname to the user.)
961 */
962 if (ctx->inode_bad_map &&
963 ext2fs_test_inode_bitmap(ctx->inode_bad_map,
964 dirent->inode)) {
965 if (e2fsck_process_bad_inode(ctx, ino,
966 dirent->inode,
967 buf + fs->blocksize)) {
968 dirent->inode = 0;
969 dir_modified++;
970 goto next;
971 }
972 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
973 return DIRENT_ABORT;
974 }
975
976 group = ext2fs_group_of_ino(fs, dirent->inode);
977 first_unused_inode = group * fs->super->s_inodes_per_group +
978 1 + fs->super->s_inodes_per_group -
979 fs->group_desc[group].bg_itable_unused;
980 cd->pctx.group = group;
981
982 /*
983 * Check if the inode was missed out because
984 * _INODE_UNINIT flag was set or bg_itable_unused was
985 * incorrect. If so, clear the _INODE_UNINIT flag and
986 * restart e2fsck. In the future it would be nice if
987 * we could call a function in pass1.c that checks the
988 * newly visible inodes.
989 */
990 if (fs->group_desc[group].bg_flags & EXT2_BG_INODE_UNINIT) {
991 if (fix_problem(ctx, PR_2_INOREF_BG_INO_UNINIT,
992 &cd->pctx)){
993 fs->group_desc[group].bg_flags &=
994 ~EXT2_BG_INODE_UNINIT;
995 ext2fs_mark_super_dirty(fs);
996 ctx->flags |= E2F_FLAG_RESTART;
997 } else {
998 ext2fs_unmark_valid(fs);
999 if (problem == PR_2_BAD_INO)
1000 goto next;
1001 }
1002 } else if (dirent->inode >= first_unused_inode) {
1003 if (fix_problem(ctx, PR_2_INOREF_IN_UNUSED, &cd->pctx)){
1004 fs->group_desc[group].bg_itable_unused = 0;
1005 ext2fs_mark_super_dirty(fs);
1006 ctx->flags |= E2F_FLAG_RESTART;
1007 goto restart_fsck;
1008 } else {
1009 ext2fs_unmark_valid(fs);
1010 if (problem == PR_2_BAD_INO)
1011 goto next;
1012 }
1013 }
1014
1015 if (!(ext2fs_test_inode_bitmap(ctx->inode_used_map,
1016 dirent->inode))) {
1017 /*
1018 * If the inode is unused, offer to clear it.
1019 */
1020 problem = PR_2_UNUSED_INODE;
1021 }
1022
1023 if (problem) {
1024 if (fix_problem(ctx, problem, &cd->pctx)) {
1025 dirent->inode = 0;
1026 dir_modified++;
1027 goto next;
1028 } else {
1029 ext2fs_unmark_valid(fs);
1030 if (problem == PR_2_BAD_INO)
1031 goto next;
1032 }
1033 }
1034
1035 if (check_name(ctx, dirent, ino, &cd->pctx))
1036 dir_modified++;
1037
1038 if (check_filetype(ctx, dirent, ino, &cd->pctx))
1039 dir_modified++;
1040
1041 #ifdef ENABLE_HTREE
1042 if (dx_db) {
1043 ext2fs_dirhash(dx_dir->hashversion, dirent->name,
1044 (dirent->name_len & 0xFF),
1045 fs->super->s_hash_seed, &hash, 0);
1046 if (hash < dx_db->min_hash)
1047 dx_db->min_hash = hash;
1048 if (hash > dx_db->max_hash)
1049 dx_db->max_hash = hash;
1050 }
1051 #endif
1052
1053 /*
1054 * If this is a directory, then mark its parent in its
1055 * dir_info structure. If the parent field is already
1056 * filled in, then this directory has more than one
1057 * hard link. We assume the first link is correct,
1058 * and ask the user if he/she wants to clear this one.
1059 */
1060 if ((dot_state > 1) &&
1061 (ext2fs_test_inode_bitmap(ctx->inode_dir_map,
1062 dirent->inode))) {
1063 if (e2fsck_dir_info_get_parent(ctx, dirent->inode,
1064 &subdir_parent)) {
1065 cd->pctx.ino = dirent->inode;
1066 fix_problem(ctx, PR_2_NO_DIRINFO, &cd->pctx);
1067 goto abort_free_dict;
1068 }
1069 if (subdir_parent) {
1070 cd->pctx.ino2 = subdir_parent;
1071 if (fix_problem(ctx, PR_2_LINK_DIR,
1072 &cd->pctx)) {
1073 dirent->inode = 0;
1074 dir_modified++;
1075 goto next;
1076 }
1077 cd->pctx.ino2 = 0;
1078 } else {
1079 (void) e2fsck_dir_info_set_parent(ctx,
1080 dirent->inode, ino);
1081 }
1082 }
1083
1084 if (dups_found) {
1085 ;
1086 } else if (dict_lookup(&de_dict, dirent)) {
1087 clear_problem_context(&pctx);
1088 pctx.ino = ino;
1089 pctx.dirent = dirent;
1090 fix_problem(ctx, PR_2_REPORT_DUP_DIRENT, &pctx);
1091 if (!ctx->dirs_to_hash)
1092 ext2fs_u32_list_create(&ctx->dirs_to_hash, 50);
1093 if (ctx->dirs_to_hash)
1094 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1095 dups_found++;
1096 } else
1097 dict_alloc_insert(&de_dict, dirent, dirent);
1098
1099 ext2fs_icount_increment(ctx->inode_count, dirent->inode,
1100 &links);
1101 if (links > 1)
1102 ctx->fs_links_count++;
1103 ctx->fs_total_count++;
1104 next:
1105 prev = dirent;
1106 if (dir_modified)
1107 rec_len = (dirent->rec_len || fs->blocksize < 65536) ?
1108 dirent->rec_len : 65536;
1109 offset += rec_len;
1110 dot_state++;
1111 } while (offset < fs->blocksize);
1112 #if 0
1113 printf("\n");
1114 #endif
1115 #ifdef ENABLE_HTREE
1116 if (dx_db) {
1117 #ifdef DX_DEBUG
1118 printf("db_block %d, type %d, min_hash 0x%0x, max_hash 0x%0x\n",
1119 db->blockcnt, dx_db->type,
1120 dx_db->min_hash, dx_db->max_hash);
1121 #endif
1122 cd->pctx.dir = cd->pctx.ino;
1123 if ((dx_db->type == DX_DIRBLOCK_ROOT) ||
1124 (dx_db->type == DX_DIRBLOCK_NODE))
1125 parse_int_node(fs, db, cd, dx_dir, buf);
1126 }
1127 #endif /* ENABLE_HTREE */
1128 if (offset != fs->blocksize) {
1129 cd->pctx.num = rec_len - fs->blocksize + offset;
1130 if (fix_problem(ctx, PR_2_FINAL_RECLEN, &cd->pctx)) {
1131 dirent->rec_len = cd->pctx.num;
1132 dir_modified++;
1133 }
1134 }
1135 if (dir_modified) {
1136 cd->pctx.errcode = ext2fs_write_dir_block(fs, block_nr, buf);
1137 if (cd->pctx.errcode) {
1138 if (!fix_problem(ctx, PR_2_WRITE_DIRBLOCK,
1139 &cd->pctx))
1140 goto abort_free_dict;
1141 }
1142 ext2fs_mark_changed(fs);
1143 }
1144 dict_free_nodes(&de_dict);
1145 return 0;
1146 abort_free_dict:
1147 ctx->flags |= E2F_FLAG_ABORT;
1148 restart_fsck:
1149 dict_free_nodes(&de_dict);
1150 return DIRENT_ABORT;
1151 }
1152
1153 /*
1154 * This function is called to deallocate a block, and is an interator
1155 * functioned called by deallocate inode via ext2fs_iterate_block().
1156 */
1157 static int deallocate_inode_block(ext2_filsys fs,
1158 blk_t *block_nr,
1159 e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)),
1160 blk_t ref_block EXT2FS_ATTR((unused)),
1161 int ref_offset EXT2FS_ATTR((unused)),
1162 void *priv_data)
1163 {
1164 e2fsck_t ctx = (e2fsck_t) priv_data;
1165
1166 if (HOLE_BLKADDR(*block_nr))
1167 return 0;
1168 if ((*block_nr < fs->super->s_first_data_block) ||
1169 (*block_nr >= fs->super->s_blocks_count))
1170 return 0;
1171 ext2fs_unmark_block_bitmap(ctx->block_found_map, *block_nr);
1172 ext2fs_block_alloc_stats(fs, *block_nr, -1);
1173 return 0;
1174 }
1175
1176 /*
1177 * This fuction deallocates an inode
1178 */
1179 static void deallocate_inode(e2fsck_t ctx, ext2_ino_t ino, char* block_buf)
1180 {
1181 ext2_filsys fs = ctx->fs;
1182 struct ext2_inode inode;
1183 struct problem_context pctx;
1184 __u32 count;
1185
1186 e2fsck_read_inode(ctx, ino, &inode, "deallocate_inode");
1187 e2fsck_clear_inode(ctx, ino, &inode, 0, "deallocate_inode");
1188 clear_problem_context(&pctx);
1189 pctx.ino = ino;
1190
1191 /*
1192 * Fix up the bitmaps...
1193 */
1194 e2fsck_read_bitmaps(ctx);
1195 ext2fs_inode_alloc_stats2(fs, ino, -1, LINUX_S_ISDIR(inode.i_mode));
1196
1197 if (inode.i_file_acl &&
1198 (fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1199 pctx.errcode = ext2fs_adjust_ea_refcount(fs, inode.i_file_acl,
1200 block_buf, -1, &count);
1201 if (pctx.errcode == EXT2_ET_BAD_EA_BLOCK_NUM) {
1202 pctx.errcode = 0;
1203 count = 1;
1204 }
1205 if (pctx.errcode) {
1206 pctx.blk = inode.i_file_acl;
1207 fix_problem(ctx, PR_2_ADJ_EA_REFCOUNT, &pctx);
1208 ctx->flags |= E2F_FLAG_ABORT;
1209 return;
1210 }
1211 if (count == 0) {
1212 ext2fs_unmark_block_bitmap(ctx->block_found_map,
1213 inode.i_file_acl);
1214 ext2fs_block_alloc_stats(fs, inode.i_file_acl, -1);
1215 }
1216 inode.i_file_acl = 0;
1217 }
1218
1219 if (!ext2fs_inode_has_valid_blocks(&inode))
1220 return;
1221
1222 if (LINUX_S_ISREG(inode.i_mode) &&
1223 (inode.i_size_high || inode.i_size & 0x80000000UL))
1224 ctx->large_files--;
1225
1226 pctx.errcode = ext2fs_block_iterate2(fs, ino, 0, block_buf,
1227 deallocate_inode_block, ctx);
1228 if (pctx.errcode) {
1229 fix_problem(ctx, PR_2_DEALLOC_INODE, &pctx);
1230 ctx->flags |= E2F_FLAG_ABORT;
1231 return;
1232 }
1233 }
1234
1235 /*
1236 * This fuction clears the htree flag on an inode
1237 */
1238 static void clear_htree(e2fsck_t ctx, ext2_ino_t ino)
1239 {
1240 struct ext2_inode inode;
1241
1242 e2fsck_read_inode(ctx, ino, &inode, "clear_htree");
1243 inode.i_flags = inode.i_flags & ~EXT2_INDEX_FL;
1244 e2fsck_write_inode(ctx, ino, &inode, "clear_htree");
1245 if (ctx->dirs_to_hash)
1246 ext2fs_u32_list_add(ctx->dirs_to_hash, ino);
1247 }
1248
1249
1250 extern int e2fsck_process_bad_inode(e2fsck_t ctx, ext2_ino_t dir,
1251 ext2_ino_t ino, char *buf)
1252 {
1253 ext2_filsys fs = ctx->fs;
1254 struct ext2_inode inode;
1255 int inode_modified = 0;
1256 int not_fixed = 0;
1257 unsigned char *frag, *fsize;
1258 struct problem_context pctx;
1259 int problem = 0;
1260
1261 e2fsck_read_inode(ctx, ino, &inode, "process_bad_inode");
1262
1263 clear_problem_context(&pctx);
1264 pctx.ino = ino;
1265 pctx.dir = dir;
1266 pctx.inode = &inode;
1267
1268 if (inode.i_file_acl &&
1269 !(fs->super->s_feature_compat & EXT2_FEATURE_COMPAT_EXT_ATTR)) {
1270 if (fix_problem(ctx, PR_2_FILE_ACL_ZERO, &pctx)) {
1271 inode.i_file_acl = 0;
1272 inode_modified++;
1273 } else
1274 not_fixed++;
1275 }
1276
1277 if (!LINUX_S_ISDIR(inode.i_mode) && !LINUX_S_ISREG(inode.i_mode) &&
1278 !LINUX_S_ISCHR(inode.i_mode) && !LINUX_S_ISBLK(inode.i_mode) &&
1279 !LINUX_S_ISLNK(inode.i_mode) && !LINUX_S_ISFIFO(inode.i_mode) &&
1280 !(LINUX_S_ISSOCK(inode.i_mode)))
1281 problem = PR_2_BAD_MODE;
1282 else if (LINUX_S_ISCHR(inode.i_mode)
1283 && !e2fsck_pass1_check_device_inode(fs, &inode))
1284 problem = PR_2_BAD_CHAR_DEV;
1285 else if (LINUX_S_ISBLK(inode.i_mode)
1286 && !e2fsck_pass1_check_device_inode(fs, &inode))
1287 problem = PR_2_BAD_BLOCK_DEV;
1288 else if (LINUX_S_ISFIFO(inode.i_mode)
1289 && !e2fsck_pass1_check_device_inode(fs, &inode))
1290 problem = PR_2_BAD_FIFO;
1291 else if (LINUX_S_ISSOCK(inode.i_mode)
1292 && !e2fsck_pass1_check_device_inode(fs, &inode))
1293 problem = PR_2_BAD_SOCKET;
1294 else if (LINUX_S_ISLNK(inode.i_mode)
1295 && !e2fsck_pass1_check_symlink(fs, ino, &inode, buf)) {
1296 problem = PR_2_INVALID_SYMLINK;
1297 }
1298
1299 if (problem) {
1300 if (fix_problem(ctx, problem, &pctx)) {
1301 deallocate_inode(ctx, ino, 0);
1302 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
1303 return 0;
1304 return 1;
1305 } else
1306 not_fixed++;
1307 problem = 0;
1308 }
1309
1310 if (inode.i_faddr) {
1311 if (fix_problem(ctx, PR_2_FADDR_ZERO, &pctx)) {
1312 inode.i_faddr = 0;
1313 inode_modified++;
1314 } else
1315 not_fixed++;
1316 }
1317
1318 switch (fs->super->s_creator_os) {
1319 case EXT2_OS_HURD:
1320 frag = &inode.osd2.hurd2.h_i_frag;
1321 fsize = &inode.osd2.hurd2.h_i_fsize;
1322 break;
1323 default:
1324 frag = fsize = 0;
1325 }
1326 if (frag && *frag) {
1327 pctx.num = *frag;
1328 if (fix_problem(ctx, PR_2_FRAG_ZERO, &pctx)) {
1329 *frag = 0;
1330 inode_modified++;
1331 } else
1332 not_fixed++;
1333 pctx.num = 0;
1334 }
1335 if (fsize && *fsize) {
1336 pctx.num = *fsize;
1337 if (fix_problem(ctx, PR_2_FSIZE_ZERO, &pctx)) {
1338 *fsize = 0;
1339 inode_modified++;
1340 } else
1341 not_fixed++;
1342 pctx.num = 0;
1343 }
1344
1345 if ((fs->super->s_creator_os == EXT2_OS_LINUX) &&
1346 !(fs->super->s_feature_ro_compat &
1347 EXT4_FEATURE_RO_COMPAT_HUGE_FILE) &&
1348 (inode.osd2.linux2.l_i_blocks_hi != 0)) {
1349 pctx.num = inode.osd2.linux2.l_i_blocks_hi;
1350 if (fix_problem(ctx, PR_2_BLOCKS_HI_ZERO, &pctx)) {
1351 inode.osd2.linux2.l_i_blocks_hi = 0;
1352 inode_modified++;
1353 }
1354 }
1355
1356 if (inode.i_file_acl &&
1357 ((inode.i_file_acl < fs->super->s_first_data_block) ||
1358 (inode.i_file_acl >= fs->super->s_blocks_count))) {
1359 if (fix_problem(ctx, PR_2_FILE_ACL_BAD, &pctx)) {
1360 inode.i_file_acl = 0;
1361 inode_modified++;
1362 } else
1363 not_fixed++;
1364 }
1365 if (inode.i_dir_acl &&
1366 LINUX_S_ISDIR(inode.i_mode)) {
1367 if (fix_problem(ctx, PR_2_DIR_ACL_ZERO, &pctx)) {
1368 inode.i_dir_acl = 0;
1369 inode_modified++;
1370 } else
1371 not_fixed++;
1372 }
1373
1374 if (inode_modified)
1375 e2fsck_write_inode(ctx, ino, &inode, "process_bad_inode");
1376 if (!not_fixed && ctx->inode_bad_map)
1377 ext2fs_unmark_inode_bitmap(ctx->inode_bad_map, ino);
1378 return 0;
1379 }
1380
1381
1382 /*
1383 * allocate_dir_block --- this function allocates a new directory
1384 * block for a particular inode; this is done if a directory has
1385 * a "hole" in it, or if a directory has a illegal block number
1386 * that was zeroed out and now needs to be replaced.
1387 */
1388 static int allocate_dir_block(e2fsck_t ctx,
1389 struct ext2_db_entry *db,
1390 char *buf EXT2FS_ATTR((unused)),
1391 struct problem_context *pctx)
1392 {
1393 ext2_filsys fs = ctx->fs;
1394 blk_t blk;
1395 char *block;
1396 struct ext2_inode inode;
1397
1398 if (fix_problem(ctx, PR_2_DIRECTORY_HOLE, pctx) == 0)
1399 return 1;
1400
1401 /*
1402 * Read the inode and block bitmaps in; we'll be messing with
1403 * them.
1404 */
1405 e2fsck_read_bitmaps(ctx);
1406
1407 /*
1408 * First, find a free block
1409 */
1410 pctx->errcode = ext2fs_new_block(fs, 0, ctx->block_found_map, &blk);
1411 if (pctx->errcode) {
1412 pctx->str = "ext2fs_new_block";
1413 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1414 return 1;
1415 }
1416 ext2fs_mark_block_bitmap(ctx->block_found_map, blk);
1417 ext2fs_mark_block_bitmap(fs->block_map, blk);
1418 ext2fs_mark_bb_dirty(fs);
1419
1420 /*
1421 * Now let's create the actual data block for the inode
1422 */
1423 if (db->blockcnt)
1424 pctx->errcode = ext2fs_new_dir_block(fs, 0, 0, &block);
1425 else
1426 pctx->errcode = ext2fs_new_dir_block(fs, db->ino,
1427 EXT2_ROOT_INO, &block);
1428
1429 if (pctx->errcode) {
1430 pctx->str = "ext2fs_new_dir_block";
1431 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1432 return 1;
1433 }
1434
1435 pctx->errcode = ext2fs_write_dir_block(fs, blk, block);
1436 ext2fs_free_mem(&block);
1437 if (pctx->errcode) {
1438 pctx->str = "ext2fs_write_dir_block";
1439 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1440 return 1;
1441 }
1442
1443 /*
1444 * Update the inode block count
1445 */
1446 e2fsck_read_inode(ctx, db->ino, &inode, "allocate_dir_block");
1447 ext2fs_iblk_add_blocks(fs, &inode, 1);
1448 if (inode.i_size < (db->blockcnt+1) * fs->blocksize)
1449 inode.i_size = (db->blockcnt+1) * fs->blocksize;
1450 e2fsck_write_inode(ctx, db->ino, &inode, "allocate_dir_block");
1451
1452 /*
1453 * Finally, update the block pointers for the inode
1454 */
1455 db->blk = blk;
1456 pctx->errcode = ext2fs_block_iterate2(fs, db->ino, BLOCK_FLAG_HOLE,
1457 0, update_dir_block, db);
1458 if (pctx->errcode) {
1459 pctx->str = "ext2fs_block_iterate";
1460 fix_problem(ctx, PR_2_ALLOC_DIRBOCK, pctx);
1461 return 1;
1462 }
1463
1464 return 0;
1465 }
1466
1467 /*
1468 * This is a helper function for allocate_dir_block().
1469 */
1470 static int update_dir_block(ext2_filsys fs EXT2FS_ATTR((unused)),
1471 blk_t *block_nr,
1472 e2_blkcnt_t blockcnt,
1473 blk_t ref_block EXT2FS_ATTR((unused)),
1474 int ref_offset EXT2FS_ATTR((unused)),
1475 void *priv_data)
1476 {
1477 struct ext2_db_entry *db;
1478
1479 db = (struct ext2_db_entry *) priv_data;
1480 if (db->blockcnt == (int) blockcnt) {
1481 *block_nr = db->blk;
1482 return BLOCK_CHANGED;
1483 }
1484 return 0;
1485 }
Unnamed repository; edit this file 'description' to name the repository.