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