pass5.c revision 1.8
1 /* $NetBSD: pass5.c,v 1.8 2000/11/21 06:24:26 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 65 /* 66 * Check segment holdings against actual holdings. Check for 67 * "clean" segments that contain live data. 68 */ 69 nclean = 0; 70 avail = 0; 71 bb = ubb = 0; 72 dmeta = 0; 73 for (i = 0; i < sblock.lfs_nseg; i++) { 74 su = lfs_gseguse(i, &bp); 75 if (!(su->su_flags & SEGUSE_DIRTY) && 76 seg_table[i].su_nbytes > 0) { 77 pwarn("%d bytes contained in 'clean' segment %d\n", 78 seg_table[i].su_nbytes, i); 79 if (preen || reply("fix")) { 80 su->su_flags |= SEGUSE_DIRTY; 81 dirty(bp); 82 } 83 } 84 if ((su->su_flags & SEGUSE_DIRTY) && 85 su->su_nbytes != seg_table[i].su_nbytes) { 86 pwarn("segment %d claims %d bytes but has %d", 87 i, su->su_nbytes, seg_table[i].su_nbytes); 88 if (su->su_nbytes > seg_table[i].su_nbytes) 89 pwarn(" (high by %d)\n", su->su_nbytes - 90 seg_table[i].su_nbytes); 91 else 92 pwarn(" (low by %d)\n", - su->su_nbytes + 93 seg_table[i].su_nbytes); 94 if (preen || reply("fix")) { 95 su->su_nbytes = seg_table[i].su_nbytes; 96 dirty(bp); 97 } 98 } 99 if (su->su_flags & SEGUSE_DIRTY) { 100 bb += btodb(su->su_nbytes) + su->su_nsums; 101 ubb += btodb(su->su_nbytes) + su->su_nsums + fsbtodb(&sblock, su->su_ninos); 102 dmeta += btodb(LFS_SUMMARY_SIZE * su->su_nsums); 103 dmeta += fsbtodb(&sblock, su->su_ninos); 104 } else { 105 nclean++; 106 avail += fsbtodb(&sblock, sblock.lfs_ssize); 107 if (su->su_flags & SEGUSE_SUPERBLOCK) 108 avail -= btodb(LFS_SBPAD); 109 } 110 bp->b_flags &= ~B_INUSE; 111 } 112 /* Also may be available bytes in current seg */ 113 i = datosn(&sblock, sblock.lfs_offset); 114 avail += sntoda(&sblock, i + 1) - sblock.lfs_offset; 115 /* But do not count minfreesegs */ 116 avail -= fsbtodb(&sblock, sblock.lfs_ssize) * 117 (sblock.lfs_minfreeseg - (sblock.lfs_minfreeseg / 2)); 118 119 if (dmeta != sblock.lfs_dmeta) { 120 pwarn("dmeta given as %d, should be %ld\n", sblock.lfs_dmeta, 121 dmeta); 122 if (preen || reply("fix")) { 123 sblock.lfs_dmeta = dmeta; 124 sbdirty(); 125 } 126 } 127 if (avail != sblock.lfs_avail) { 128 pwarn("avail given as %d, should be %ld\n", sblock.lfs_avail, 129 avail); 130 if (preen || reply("fix")) { 131 sblock.lfs_avail = avail; 132 sbdirty(); 133 } 134 } 135 if (nclean != sblock.lfs_nclean) { 136 pwarn("nclean given as %d, should be %d\n", sblock.lfs_nclean, 137 nclean); 138 if (preen || reply("fix")) { 139 sblock.lfs_nclean = nclean; 140 sbdirty(); 141 } 142 } 143 if (sblock.lfs_bfree > sblock.lfs_dsize - bb || 144 sblock.lfs_bfree < sblock.lfs_dsize - ubb) { 145 pwarn("bfree given as %d, should be between %ld and %ld\n", 146 sblock.lfs_bfree, sblock.lfs_dsize - ubb, 147 sblock.lfs_dsize - bb); 148 if (preen || reply("fix")) { 149 sblock.lfs_bfree = sblock.lfs_dsize - (ubb + bb) / 2; 150 sbdirty(); 151 } 152 } 153 } 154
Indexes created Thu Oct 02 14:10:14 GMT 2025