2 * pass5.c --- check block and inode bitmaps against on-disk bitmaps
4 * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o.
7 * This file may be redistributed under the terms of the GNU Public
15 #include <sys/types.h>
17 #include <sys/ioctl.h>
24 #define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d))
26 static void check_block_bitmaps(e2fsck_t ctx);
27 static void check_inode_bitmaps(e2fsck_t ctx);
28 static void check_inode_end(e2fsck_t ctx);
29 static void check_block_end(e2fsck_t ctx);
31 void e2fsck_pass5(e2fsck_t ctx)
34 struct resource_track rtrack;
36 struct problem_context pctx;
39 mtrace_print("Pass 5");
42 init_resource_track(&rtrack, ctx->fs->io);
43 clear_problem_context(&pctx);
45 if (!(ctx->options & E2F_OPT_PREEN))
46 fix_problem(ctx, PR_5_PASS_HEADER, &pctx);
49 if ((ctx->progress)(ctx, 5, 0, ctx->fs->group_desc_count*2))
52 e2fsck_read_bitmaps(ctx);
54 check_block_bitmaps(ctx);
55 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
57 check_inode_bitmaps(ctx);
58 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
61 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
64 if (ctx->flags & E2F_FLAG_SIGNAL_MASK)
67 ext2fs_free_inode_bitmap(ctx->inode_used_map);
68 ctx->inode_used_map = 0;
69 ext2fs_free_inode_bitmap(ctx->inode_dir_map);
70 ctx->inode_dir_map = 0;
71 ext2fs_free_block_bitmap(ctx->block_found_map);
72 ctx->block_found_map = 0;
74 print_resource_track(ctx, _("Pass 5"), &rtrack, ctx->fs->io);
77 static void e2fsck_discard_blocks(e2fsck_t ctx, blk64_t start,
80 ext2_filsys fs = ctx->fs;
83 * If the filesystem has changed it means that there was an corruption
84 * which should be repaired, but in some cases just one e2fsck run is
85 * not enough to fix the problem, hence it is not safe to run discard
88 if (ext2fs_test_changed(fs))
89 ctx->options &= ~E2F_OPT_DISCARD;
91 if ((ctx->options & E2F_OPT_DISCARD) &&
92 (io_channel_discard(fs->io, start, count)))
93 ctx->options &= ~E2F_OPT_DISCARD;
97 * This will try to discard number 'count' inodes starting at
98 * inode number 'start' within the 'group'. Note that 'start'
99 * is 1-based, it means that we need to adjust it by -1 in this
100 * function to compute right offset in the particular inode table.
102 static void e2fsck_discard_inodes(e2fsck_t ctx, dgrp_t group,
103 ext2_ino_t start, int count)
105 ext2_filsys fs = ctx->fs;
109 * Sanity check for 'start'
111 if ((start < 1) || (start > EXT2_INODES_PER_GROUP(fs->super))) {
112 printf("PROGRAMMING ERROR: Got start %d outside of group %d!"
113 " Disabling discard\n",
115 ctx->options &= ~E2F_OPT_DISCARD;
119 * Do not attempt to discard if E2F_OPT_DISCARD is not set. And also
120 * skip the discard on this group if discard does not zero data.
121 * The reason is that if the inode table is not zeroed discard would
122 * no help us since we need to zero it anyway, or if the inode table
123 * is zeroed then the read after discard would not be deterministic
124 * anyway and we would not be able to assume that this inode table
125 * was zeroed anymore so we would have to zero it again, which does
126 * not really make sense.
128 if (!(ctx->options & E2F_OPT_DISCARD) ||
129 !io_channel_discard_zeroes_data(fs->io))
133 * Start is inode number within the group which starts
134 * counting from 1, so we need to adjust it.
139 * We can discard only blocks containing only unused
140 * inodes in the table.
142 blk = DIV_ROUND_UP(start,
143 EXT2_INODES_PER_BLOCK(fs->super));
144 count -= (blk * EXT2_INODES_PER_BLOCK(fs->super) - start);
145 blk += ext2fs_inode_table_loc(fs, group);
146 num = count / EXT2_INODES_PER_BLOCK(fs->super);
149 e2fsck_discard_blocks(ctx, blk, num);
152 #define NO_BLK ((blk64_t) -1)
154 static void print_bitmap_problem(e2fsck_t ctx, problem_t problem,
155 struct problem_context *pctx)
158 case PR_5_BLOCK_UNUSED:
159 if (pctx->blk == pctx->blk2)
162 problem = PR_5_BLOCK_RANGE_UNUSED;
164 case PR_5_BLOCK_USED:
165 if (pctx->blk == pctx->blk2)
168 problem = PR_5_BLOCK_RANGE_USED;
170 case PR_5_INODE_UNUSED:
171 if (pctx->ino == pctx->ino2)
174 problem = PR_5_INODE_RANGE_UNUSED;
176 case PR_5_INODE_USED:
177 if (pctx->ino == pctx->ino2)
180 problem = PR_5_INODE_RANGE_USED;
183 fix_problem(ctx, problem, pctx);
184 pctx->blk = pctx->blk2 = NO_BLK;
185 pctx->ino = pctx->ino2 = 0;
188 /* Just to be more succint */
189 #define B2C(x) EXT2FS_B2C(fs, (x))
190 #define EQ_CLSTR(x, y) (B2C(x) == B2C(y))
191 #define LE_CLSTR(x, y) (B2C(x) <= B2C(y))
192 #define GE_CLSTR(x, y) (B2C(x) >= B2C(y))
194 static void check_block_bitmaps(e2fsck_t ctx)
196 ext2_filsys fs = ctx->fs;
198 unsigned int *free_array;
200 unsigned int blocks = 0;
201 blk64_t free_blocks = 0;
202 blk64_t first_free = ext2fs_blocks_count(fs->super);
203 unsigned int group_free = 0;
205 struct problem_context pctx;
206 problem_t problem, save_problem;
207 int fixit, had_problem;
210 int old_desc_blocks = 0;
214 blk64_t super_blk, old_desc_blk, new_desc_blk;
215 char *actual_buf, *bitmap_buf;
217 actual_buf = (char *) e2fsck_allocate_memory(ctx, fs->blocksize,
218 "actual bitmap buffer");
219 bitmap_buf = (char *) e2fsck_allocate_memory(ctx, fs->blocksize,
220 "bitmap block buffer");
222 clear_problem_context(&pctx);
223 free_array = (unsigned int *) e2fsck_allocate_memory(ctx,
224 fs->group_desc_count * sizeof(unsigned int), "free block count array");
226 if ((B2C(fs->super->s_first_data_block) <
227 ext2fs_get_block_bitmap_start2(ctx->block_found_map)) ||
228 (B2C(ext2fs_blocks_count(fs->super)-1) >
229 ext2fs_get_block_bitmap_end2(ctx->block_found_map))) {
231 pctx.blk = B2C(fs->super->s_first_data_block);
232 pctx.blk2 = B2C(ext2fs_blocks_count(fs->super) - 1);
233 pctx.ino = ext2fs_get_block_bitmap_start2(ctx->block_found_map);
234 pctx.ino2 = ext2fs_get_block_bitmap_end2(ctx->block_found_map);
235 fix_problem(ctx, PR_5_BMAP_ENDPOINTS, &pctx);
237 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
241 if ((B2C(fs->super->s_first_data_block) <
242 ext2fs_get_block_bitmap_start2(fs->block_map)) ||
243 (B2C(ext2fs_blocks_count(fs->super)-1) >
244 ext2fs_get_block_bitmap_end2(fs->block_map))) {
246 pctx.blk = B2C(fs->super->s_first_data_block);
247 pctx.blk2 = B2C(ext2fs_blocks_count(fs->super) - 1);
248 pctx.ino = ext2fs_get_block_bitmap_start2(fs->block_map);
249 pctx.ino2 = ext2fs_get_block_bitmap_end2(fs->block_map);
250 fix_problem(ctx, PR_5_BMAP_ENDPOINTS, &pctx);
252 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
256 csum_flag = EXT2_HAS_RO_COMPAT_FEATURE(fs->super,
257 EXT4_FEATURE_RO_COMPAT_GDT_CSUM);
261 pctx.blk = pctx.blk2 = NO_BLK;
262 for (i = B2C(fs->super->s_first_data_block);
263 i < ext2fs_blocks_count(fs->super);
264 i += EXT2FS_CLUSTER_RATIO(fs)) {
265 int first_block_in_bg = (B2C(i) -
266 B2C(fs->super->s_first_data_block)) %
267 fs->super->s_clusters_per_group == 0;
268 int n, nbytes = fs->super->s_clusters_per_group / 8;
270 actual = ext2fs_fast_test_block_bitmap2(ctx->block_found_map, i);
273 * Try to optimize pass5 by extracting a bitmap block
274 * as expected from what we have on disk, and then
275 * comparing the two. If they are identical, then
276 * update the free block counts and go on to the next
277 * block group. This is much faster than doing the
278 * individual bit-by-bit comparison. The one downside
279 * is that this doesn't work if we are asking e2fsck
280 * to do a discard operation.
282 if (!first_block_in_bg ||
283 (group == (int)fs->group_desc_count - 1) ||
284 (ctx->options & E2F_OPT_DISCARD))
287 retval = ext2fs_get_block_bitmap_range2(ctx->block_found_map,
288 B2C(i), fs->super->s_clusters_per_group,
292 retval = ext2fs_get_block_bitmap_range2(fs->block_map,
293 B2C(i), fs->super->s_clusters_per_group,
297 if (memcmp(actual_buf, bitmap_buf, nbytes) != 0)
299 n = ext2fs_bitcount(actual_buf, nbytes);
300 group_free = fs->super->s_clusters_per_group - n;
301 free_blocks += group_free;
302 i += EXT2FS_C2B(fs, fs->super->s_clusters_per_group - 1);
309 bitmap = ext2fs_fast_test_block_bitmap2(fs->block_map, i);
311 if (!actual == !bitmap)
314 if (!actual && bitmap) {
316 * Block not used, but marked in use in the bitmap.
318 problem = PR_5_BLOCK_UNUSED;
321 * Block used, but not marked in use in the bitmap.
323 problem = PR_5_BLOCK_USED;
325 if (ext2fs_bg_flags_test(fs, group,
326 EXT2_BG_BLOCK_UNINIT)) {
327 struct problem_context pctx2;
330 if (fix_problem(ctx, PR_5_BLOCK_UNINIT,
332 ext2fs_bg_flags_clear(fs, group,
333 EXT2_BG_BLOCK_UNINIT);
336 if (pctx.blk == NO_BLK) {
337 pctx.blk = pctx.blk2 = i;
338 save_problem = problem;
340 if ((problem == save_problem) &&
341 (pctx.blk2 == i - EXT2FS_CLUSTER_RATIO(fs)))
342 pctx.blk2 += EXT2FS_CLUSTER_RATIO(fs);
344 print_bitmap_problem(ctx, save_problem, &pctx);
345 pctx.blk = pctx.blk2 = i;
346 save_problem = problem;
349 ctx->flags |= E2F_FLAG_PROG_SUPPRESS;
353 * If there a problem we should turn off the discard so we
354 * do not compromise the filesystem.
356 ctx->options &= ~E2F_OPT_DISCARD;
364 } else if (i > first_free) {
365 e2fsck_discard_blocks(ctx, first_free,
367 first_free = ext2fs_blocks_count(fs->super);
370 if ((blocks == fs->super->s_clusters_per_group) ||
371 (EXT2FS_B2C(fs, i) ==
372 EXT2FS_B2C(fs, ext2fs_blocks_count(fs->super)-1))) {
374 * If the last block of this group is free, then we can
375 * discard it as well.
377 if (!bitmap && i >= first_free)
378 e2fsck_discard_blocks(ctx, first_free,
379 (i - first_free) + 1);
381 first_free = ext2fs_blocks_count(fs->super);
383 free_array[group] = group_free;
388 if ((ctx->progress)(ctx, 5, group,
389 fs->group_desc_count*2))
393 if (pctx.blk != NO_BLK)
394 print_bitmap_problem(ctx, save_problem, &pctx);
396 fixit = end_problem_latch(ctx, PR_LATCH_BBITMAP);
399 ctx->flags &= ~E2F_FLAG_PROG_SUPPRESS;
402 ext2fs_free_block_bitmap(fs->block_map);
403 retval = ext2fs_copy_bitmap(ctx->block_found_map,
406 clear_problem_context(&pctx);
407 fix_problem(ctx, PR_5_COPY_BBITMAP_ERROR, &pctx);
408 ctx->flags |= E2F_FLAG_ABORT;
411 ext2fs_set_bitmap_padding(fs->block_map);
412 ext2fs_mark_bb_dirty(fs);
414 /* Redo the counts */
415 blocks = 0; free_blocks = 0; group_free = 0; group = 0;
416 memset(free_array, 0, fs->group_desc_count * sizeof(int));
419 } else if (fixit == 0)
420 ext2fs_unmark_valid(fs);
422 for (g = 0; g < fs->group_desc_count; g++) {
423 if (free_array[g] != ext2fs_bg_free_blocks_count(fs, g)) {
425 pctx.blk = ext2fs_bg_free_blocks_count(fs, g);
426 pctx.blk2 = free_array[g];
428 if (fix_problem(ctx, PR_5_FREE_BLOCK_COUNT_GROUP,
430 ext2fs_bg_free_blocks_count_set(fs, g, free_array[g]);
431 ext2fs_mark_super_dirty(fs);
433 ext2fs_unmark_valid(fs);
436 free_blocks = EXT2FS_C2B(fs, free_blocks);
437 if (free_blocks != ext2fs_free_blocks_count(fs->super)) {
439 pctx.blk = ext2fs_free_blocks_count(fs->super);
440 pctx.blk2 = free_blocks;
442 if (fix_problem(ctx, PR_5_FREE_BLOCK_COUNT, &pctx)) {
443 ext2fs_free_blocks_count_set(fs->super, free_blocks);
444 ext2fs_mark_super_dirty(fs);
448 ext2fs_free_mem(&free_array);
449 ext2fs_free_mem(&actual_buf);
450 ext2fs_free_mem(&bitmap_buf);
453 static void check_inode_bitmaps(e2fsck_t ctx)
455 ext2_filsys fs = ctx->fs;
457 unsigned int free_inodes = 0;
461 unsigned int inodes = 0;
462 ext2_ino_t *free_array;
463 ext2_ino_t *dir_array;
466 struct problem_context pctx;
467 problem_t problem, save_problem;
468 int fixit, had_problem;
472 ext2_ino_t first_free = fs->super->s_inodes_per_group + 1;
474 clear_problem_context(&pctx);
475 free_array = (ext2_ino_t *) e2fsck_allocate_memory(ctx,
476 fs->group_desc_count * sizeof(ext2_ino_t), "free inode count array");
478 dir_array = (ext2_ino_t *) e2fsck_allocate_memory(ctx,
479 fs->group_desc_count * sizeof(ext2_ino_t), "directory count array");
481 if ((1 < ext2fs_get_inode_bitmap_start2(ctx->inode_used_map)) ||
482 (fs->super->s_inodes_count >
483 ext2fs_get_inode_bitmap_end2(ctx->inode_used_map))) {
486 pctx.blk2 = fs->super->s_inodes_count;
487 pctx.ino = ext2fs_get_inode_bitmap_start2(ctx->inode_used_map);
488 pctx.ino2 = ext2fs_get_inode_bitmap_end2(ctx->inode_used_map);
489 fix_problem(ctx, PR_5_BMAP_ENDPOINTS, &pctx);
491 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
494 if ((1 < ext2fs_get_inode_bitmap_start2(fs->inode_map)) ||
495 (fs->super->s_inodes_count >
496 ext2fs_get_inode_bitmap_end2(fs->inode_map))) {
499 pctx.blk2 = fs->super->s_inodes_count;
500 pctx.ino = ext2fs_get_inode_bitmap_start2(fs->inode_map);
501 pctx.ino2 = ext2fs_get_inode_bitmap_end2(fs->inode_map);
502 fix_problem(ctx, PR_5_BMAP_ENDPOINTS, &pctx);
504 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
508 csum_flag = EXT2_HAS_RO_COMPAT_FEATURE(fs->super,
509 EXT4_FEATURE_RO_COMPAT_GDT_CSUM);
513 pctx.ino = pctx.ino2 = 0;
515 (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)))
518 /* Protect loop from wrap-around if inodes_count is maxed */
519 for (i = 1; i <= fs->super->s_inodes_count && i > 0; i++) {
522 i % fs->super->s_inodes_per_group == 1) {
524 * Current inode is the first inode
525 * in the current block group.
527 if (ext2fs_test_inode_bitmap_range(
528 ctx->inode_used_map, i,
529 fs->super->s_inodes_per_group)) {
531 * When the compared inodes in inodes bitmap
532 * are 0, count the free inode,
533 * skip the current block group.
536 inodes = fs->super->s_inodes_per_group - 1;
538 free_inodes += inodes;
545 actual = ext2fs_fast_test_inode_bitmap2(ctx->inode_used_map, i);
548 else if (!skip_group)
549 bitmap = ext2fs_fast_test_inode_bitmap2(fs->inode_map, i);
550 if (!actual == !bitmap)
553 if (!actual && bitmap) {
555 * Inode wasn't used, but marked in bitmap
557 problem = PR_5_INODE_UNUSED;
558 } else /* if (actual && !bitmap) */ {
560 * Inode used, but not in bitmap
562 problem = PR_5_INODE_USED;
564 /* We should never hit this, because it means that
565 * inodes were marked in use that weren't noticed
566 * in pass1 or pass 2. It is easier to fix the problem
567 * than to kill e2fsck and leave the user stuck. */
569 struct problem_context pctx2;
572 if (fix_problem(ctx, PR_5_INODE_UNINIT,&pctx2)){
573 ext2fs_bg_flags_clear(fs, group, EXT2_BG_INODE_UNINIT);
579 pctx.ino = pctx.ino2 = i;
580 save_problem = problem;
582 if ((problem == save_problem) &&
586 print_bitmap_problem(ctx, save_problem, &pctx);
587 pctx.ino = pctx.ino2 = i;
588 save_problem = problem;
591 ctx->flags |= E2F_FLAG_PROG_SUPPRESS;
594 * If there a problem we should turn off the discard so we
595 * do not compromise the filesystem.
597 ctx->options &= ~E2F_OPT_DISCARD;
602 if (ext2fs_test_inode_bitmap2(ctx->inode_dir_map, i))
604 if (inodes > first_free) {
605 e2fsck_discard_inodes(ctx, group, first_free,
606 inodes - first_free);
607 first_free = fs->super->s_inodes_per_group + 1;
612 if (first_free > inodes)
616 if ((inodes == fs->super->s_inodes_per_group) ||
617 (i == fs->super->s_inodes_count)) {
619 * If the last inode is free, we can discard it as well.
621 if (!bitmap && inodes >= first_free)
622 e2fsck_discard_inodes(ctx, group, first_free,
623 inodes - first_free + 1);
625 * If discard zeroes data and the group inode table
626 * was not zeroed yet, set itable as zeroed
628 if ((ctx->options & E2F_OPT_DISCARD) &&
629 io_channel_discard_zeroes_data(fs->io) &&
630 !(ext2fs_bg_flags_test(fs, group,
631 EXT2_BG_INODE_ZEROED))) {
632 ext2fs_bg_flags_set(fs, group,
633 EXT2_BG_INODE_ZEROED);
634 ext2fs_group_desc_csum_set(fs, group);
637 first_free = fs->super->s_inodes_per_group + 1;
638 free_array[group] = group_free;
639 dir_array[group] = dirs_count;
646 if ((ctx->progress)(ctx, 5,
647 group + fs->group_desc_count,
648 fs->group_desc_count*2))
651 (i != fs->super->s_inodes_count) &&
652 (ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT)
658 print_bitmap_problem(ctx, save_problem, &pctx);
661 fixit = end_problem_latch(ctx, PR_LATCH_IBITMAP);
664 ctx->flags &= ~E2F_FLAG_PROG_SUPPRESS;
667 ext2fs_free_inode_bitmap(fs->inode_map);
668 retval = ext2fs_copy_bitmap(ctx->inode_used_map,
671 clear_problem_context(&pctx);
672 fix_problem(ctx, PR_5_COPY_IBITMAP_ERROR, &pctx);
673 ctx->flags |= E2F_FLAG_ABORT;
676 ext2fs_set_bitmap_padding(fs->inode_map);
677 ext2fs_mark_ib_dirty(fs);
680 inodes = 0; free_inodes = 0; group_free = 0;
681 dirs_count = 0; group = 0;
682 memset(free_array, 0, fs->group_desc_count * sizeof(int));
683 memset(dir_array, 0, fs->group_desc_count * sizeof(int));
686 } else if (fixit == 0)
687 ext2fs_unmark_valid(fs);
689 for (i = 0; i < fs->group_desc_count; i++) {
690 if (free_array[i] != ext2fs_bg_free_inodes_count(fs, i)) {
692 pctx.ino = ext2fs_bg_free_inodes_count(fs, i);
693 pctx.ino2 = free_array[i];
694 if (fix_problem(ctx, PR_5_FREE_INODE_COUNT_GROUP,
696 ext2fs_bg_free_inodes_count_set(fs, i, free_array[i]);
697 ext2fs_mark_super_dirty(fs);
699 ext2fs_unmark_valid(fs);
701 if (dir_array[i] != ext2fs_bg_used_dirs_count(fs, i)) {
703 pctx.ino = ext2fs_bg_used_dirs_count(fs, i);
704 pctx.ino2 = dir_array[i];
706 if (fix_problem(ctx, PR_5_FREE_DIR_COUNT_GROUP,
708 ext2fs_bg_used_dirs_count_set(fs, i, dir_array[i]);
709 ext2fs_mark_super_dirty(fs);
711 ext2fs_unmark_valid(fs);
714 if (free_inodes != fs->super->s_free_inodes_count) {
716 pctx.ino = fs->super->s_free_inodes_count;
717 pctx.ino2 = free_inodes;
719 if (fix_problem(ctx, PR_5_FREE_INODE_COUNT, &pctx)) {
720 fs->super->s_free_inodes_count = free_inodes;
721 ext2fs_mark_super_dirty(fs);
725 ext2fs_free_mem(&free_array);
726 ext2fs_free_mem(&dir_array);
729 static void check_inode_end(e2fsck_t ctx)
731 ext2_filsys fs = ctx->fs;
732 ext2_ino_t end, save_inodes_count, i;
733 struct problem_context pctx;
735 clear_problem_context(&pctx);
737 end = EXT2_INODES_PER_GROUP(fs->super) * fs->group_desc_count;
738 pctx.errcode = ext2fs_fudge_inode_bitmap_end(fs->inode_map, end,
742 fix_problem(ctx, PR_5_FUDGE_BITMAP_ERROR, &pctx);
743 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
746 if (save_inodes_count == end)
749 /* protect loop from wrap-around if end is maxed */
750 for (i = save_inodes_count + 1; i <= end && i > save_inodes_count; i++) {
751 if (!ext2fs_test_inode_bitmap(fs->inode_map, i)) {
752 if (fix_problem(ctx, PR_5_INODE_BMAP_PADDING, &pctx)) {
753 for (; i <= end; i++)
754 ext2fs_mark_inode_bitmap(fs->inode_map,
756 ext2fs_mark_ib_dirty(fs);
758 ext2fs_unmark_valid(fs);
763 pctx.errcode = ext2fs_fudge_inode_bitmap_end(fs->inode_map,
764 save_inodes_count, 0);
767 fix_problem(ctx, PR_5_FUDGE_BITMAP_ERROR, &pctx);
768 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
773 static void check_block_end(e2fsck_t ctx)
775 ext2_filsys fs = ctx->fs;
776 blk64_t end, save_blocks_count, i;
777 struct problem_context pctx;
779 clear_problem_context(&pctx);
781 end = ext2fs_get_block_bitmap_start2(fs->block_map) +
782 ((blk64_t)EXT2_CLUSTERS_PER_GROUP(fs->super) * fs->group_desc_count) - 1;
783 pctx.errcode = ext2fs_fudge_block_bitmap_end2(fs->block_map, end,
787 fix_problem(ctx, PR_5_FUDGE_BITMAP_ERROR, &pctx);
788 ctx->flags |= E2F_FLAG_ABORT; /* fatal */
791 if (save_blocks_count == end)
794 /* Protect loop from wrap-around if end is maxed */
795 for (i = save_blocks_count + 1; i <= end && i > save_blocks_count; i++) {
796 if (!ext2fs_test_block_bitmap2(fs->block_map,
797 EXT2FS_C2B(fs, i))) {
798 if (fix_problem(ctx, PR_5_BLOCK_BMAP_PADDING, &pctx)) {
799 for (; i <= end; i++)
800 ext2fs_mark_block_bitmap2(fs->block_map,
802 ext2fs_mark_bb_dirty(fs);
804 ext2fs_unmark_valid(fs);
809 pctx.errcode = ext2fs_fudge_block_bitmap_end2(fs->block_map,
810 save_blocks_count, 0);
813 fix_problem(ctx, PR_5_FUDGE_BITMAP_ERROR, &pctx);
814 ctx->flags |= E2F_FLAG_ABORT; /* fatal */