pass5.c revision 1.9
1 /* $NetBSD: pass5.c,v 1.9 2001/07/13 20:30:19 perseant Exp $ */ 2 3 /*- 4 * Copyright (c) 2000 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Konrad E. Schroder <perseant (at) hhhh.org>. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/param.h> 40 #include <sys/time.h> 41 #include <ufs/ufs/dinode.h> 42 #include <ufs/ufs/dir.h> 43 #include <sys/mount.h> 44 #include <ufs/lfs/lfs.h> 45 46 #include <string.h> 47 #include "fsck.h" 48 #include "extern.h" 49 #include "fsutil.h" 50 51 extern SEGUSE *seg_table; 52 53 void 54 pass5() 55 { 56 SEGUSE *su; 57 struct bufarea *bp; 58 int i; 59 unsigned long bb; /* total number of used blocks (lower bound) */ 60 unsigned long ubb; /* upper bound number of used blocks */ 61 unsigned long avail; /* blocks available for writing */ 62 unsigned long dmeta; /* blocks in segsums and inodes */ 63 int nclean; /* clean segments */ 64 size_t labelskew; 65 66 /* 67 * Check segment holdings against actual holdings. Check for 68 * "clean" segments that contain live data. 69 */ 70 nclean = 0; 71 avail = 0; 72 bb = ubb = 0; 73 dmeta = 0; 74 for (i = 0; i < sblock.lfs_nseg; i++) { 75 su = lfs_gseguse(i, &bp); 76 if (!(su->su_flags & SEGUSE_DIRTY) && 77 seg_table[i].su_nbytes > 0) { 78 pwarn("%d bytes contained in 'clean' segment %d\n", 79 seg_table[i].su_nbytes, i); 80 if (preen || reply("fix")) { 81 su->su_flags |= SEGUSE_DIRTY; 82 dirty(bp); 83 } 84 } 85 if ((su->su_flags & SEGUSE_DIRTY) && 86 su->su_nbytes != seg_table[i].su_nbytes) { 87 pwarn("segment %d claims %d bytes but has %d", 88 i, su->su_nbytes, seg_table[i].su_nbytes); 89 if (su->su_nbytes > seg_table[i].su_nbytes) 90 pwarn(" (high by %d)\n", su->su_nbytes - 91 seg_table[i].su_nbytes); 92 else 93 pwarn(" (low by %d)\n", - su->su_nbytes + 94 seg_table[i].su_nbytes); 95 if (preen || reply("fix")) { 96 su->su_nbytes = seg_table[i].su_nbytes; 97 dirty(bp); 98 } 99 } 100 if (su->su_flags & SEGUSE_DIRTY) { 101 bb += btofsb(&sblock, su->su_nbytes + 102 su->su_nsums * sblock.lfs_sumsize); 103 ubb += btofsb(&sblock, su->su_nbytes + 104 su->su_nsums * sblock.lfs_sumsize + 105 su->su_ninos * sblock.lfs_ibsize); 106 dmeta += btofsb(&sblock, 107 sblock.lfs_sumsize * su->su_nsums); 108 dmeta += btofsb(&sblock, 109 sblock.lfs_ibsize * su->su_ninos); 110 } else { 111 nclean++; 112 avail += segtod(&sblock, 1); 113 if (su->su_flags & SEGUSE_SUPERBLOCK) 114 avail -= btofsb(&sblock, LFS_SBPAD); 115 if (i == 0 && sblock.lfs_version > 1 && 116 sblock.lfs_start < btofsb(&sblock, LFS_LABELPAD)) 117 avail -= btofsb(&sblock, LFS_LABELPAD) - 118 sblock.lfs_start; 119 } 120 bp->b_flags &= ~B_INUSE; 121 } 122 /* Also may be available bytes in current seg */ 123 i = dtosn(&sblock, sblock.lfs_offset); 124 avail += sntod(&sblock, i + 1) - sblock.lfs_offset; 125 /* But do not count minfreesegs */ 126 avail -= segtod(&sblock, (sblock.lfs_minfreeseg - 127 (sblock.lfs_minfreeseg / 2))); 128 129 if (dmeta != sblock.lfs_dmeta) { 130 pwarn("dmeta given as %d, should be %ld\n", sblock.lfs_dmeta, 131 dmeta); 132 if (preen || reply("fix")) { 133 sblock.lfs_dmeta = dmeta; 134 sbdirty(); 135 } 136 } 137 if (avail != sblock.lfs_avail) { 138 pwarn("avail given as %d, should be %ld\n", sblock.lfs_avail, 139 avail); 140 if (preen || reply("fix")) { 141 sblock.lfs_avail = avail; 142 sbdirty(); 143 } 144 } 145 if (nclean != sblock.lfs_nclean) { 146 pwarn("nclean given as %d, should be %d\n", sblock.lfs_nclean, 147 nclean); 148 if (preen || reply("fix")) { 149 sblock.lfs_nclean = nclean; 150 sbdirty(); 151 } 152 } 153 labelskew = (sblock.lfs_version == 1 ? 0 : 154 btofsb(&sblock, LFS_LABELPAD)); 155 if (sblock.lfs_bfree > sblock.lfs_dsize - bb - labelskew || 156 sblock.lfs_bfree < sblock.lfs_dsize - ubb - labelskew) { 157 pwarn("bfree given as %d, should be between %ld and %ld\n", 158 sblock.lfs_bfree, sblock.lfs_dsize - ubb - labelskew, 159 sblock.lfs_dsize - bb - labelskew); 160 if (preen || reply("fix")) { 161 sblock.lfs_bfree = sblock.lfs_dsize - labelskew - 162 (ubb + bb) / 2; 163 sbdirty(); 164 } 165 } 166 } 167
Indexes created Fri Oct 03 02:09:57 GMT 2025