pass5.c revision 1.5
1 /* 2 * Copyright (c) 1980, 1986 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 /*static char sccsid[] = "from: @(#)pass5.c 5.13 (Berkeley) 7/20/90";*/ 36 static char rcsid[] = "$Id: pass5.c,v 1.5 1994/04/25 18:28:57 cgd Exp $"; 37 #endif /* not lint */ 38 39 #include <sys/param.h> 40 #include <sys/time.h> 41 #include <ufs/dinode.h> 42 #include <ufs/fs.h> 43 #include <string.h> 44 #include "fsck.h" 45 46 pass5() 47 { 48 int c, blk, frags, basesize, sumsize, mapsize, savednrpos; 49 register struct fs *fs = &sblock; 50 register struct cg *cg = &cgrp; 51 daddr_t dbase, dmax; 52 register daddr_t d; 53 register long i, j; 54 struct csum *cs; 55 time_t now; 56 struct csum cstotal; 57 struct inodesc idesc[3]; 58 char buf[MAXBSIZE]; 59 register struct cg *newcg = (struct cg *)buf; 60 struct ocg *ocg = (struct ocg *)buf; 61 62 bzero((char *)newcg, (size_t)fs->fs_cgsize); 63 newcg->cg_niblk = fs->fs_ipg; 64 switch ((int)fs->fs_postblformat) { 65 66 case FS_42POSTBLFMT: 67 basesize = (char *)(&ocg->cg_btot[0]) - (char *)(&ocg->cg_link); 68 sumsize = &ocg->cg_iused[0] - (char *)(&ocg->cg_btot[0]); 69 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 70 (u_char *)&ocg->cg_iused[0]; 71 ocg->cg_magic = CG_MAGIC; 72 savednrpos = fs->fs_nrpos; 73 fs->fs_nrpos = 8; 74 break; 75 76 case FS_DYNAMICPOSTBLFMT: 77 newcg->cg_btotoff = 78 &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 79 newcg->cg_boff = 80 newcg->cg_btotoff + fs->fs_cpg * sizeof(long); 81 newcg->cg_iusedoff = newcg->cg_boff + 82 fs->fs_cpg * fs->fs_nrpos * sizeof(short); 83 newcg->cg_freeoff = 84 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 85 newcg->cg_nextfreeoff = newcg->cg_freeoff + 86 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), 87 NBBY); 88 newcg->cg_magic = CG_MAGIC; 89 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 90 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 91 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 92 break; 93 94 default: 95 errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n", 96 fs->fs_postblformat); 97 } 98 bzero((char *)&idesc[0], sizeof idesc); 99 for (i = 0; i < 3; i++) 100 idesc[i].id_type = ADDR; 101 bzero((char *)&cstotal, sizeof(struct csum)); 102 (void)time(&now); 103 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 104 for (i = fs->fs_size; i < j; i++) 105 setbmap(i); 106 for (c = 0; c < fs->fs_ncg; c++) { 107 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 108 if (!cg_chkmagic(cg)) 109 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 110 dbase = cgbase(fs, c); 111 dmax = dbase + fs->fs_fpg; 112 if (dmax > fs->fs_size) 113 dmax = fs->fs_size; 114 if (now > cg->cg_time) 115 newcg->cg_time = cg->cg_time; 116 else 117 newcg->cg_time = now; 118 newcg->cg_cgx = c; 119 if (c == fs->fs_ncg - 1) 120 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 121 else 122 newcg->cg_ncyl = fs->fs_cpg; 123 newcg->cg_ndblk = dmax - dbase; 124 newcg->cg_cs.cs_ndir = 0; 125 newcg->cg_cs.cs_nffree = 0; 126 newcg->cg_cs.cs_nbfree = 0; 127 newcg->cg_cs.cs_nifree = fs->fs_ipg; 128 if (cg->cg_rotor < newcg->cg_ndblk) 129 newcg->cg_rotor = cg->cg_rotor; 130 else 131 newcg->cg_rotor = 0; 132 if (cg->cg_frotor < newcg->cg_ndblk) 133 newcg->cg_frotor = cg->cg_frotor; 134 else 135 newcg->cg_frotor = 0; 136 if (cg->cg_irotor < newcg->cg_niblk) 137 newcg->cg_irotor = cg->cg_irotor; 138 else 139 newcg->cg_irotor = 0; 140 bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum); 141 bzero((char *)&cg_blktot(newcg)[0], 142 (size_t)(sumsize + mapsize)); 143 if (fs->fs_postblformat == FS_42POSTBLFMT) 144 ocg->cg_magic = CG_MAGIC; 145 j = fs->fs_ipg * c; 146 for (i = 0; i < fs->fs_ipg; j++, i++) { 147 switch (statemap[j]) { 148 149 case USTATE: 150 break; 151 152 case DSTATE: 153 case DCLEAR: 154 case DFOUND: 155 newcg->cg_cs.cs_ndir++; 156 /* fall through */ 157 158 case FSTATE: 159 case FCLEAR: 160 newcg->cg_cs.cs_nifree--; 161 setbit(cg_inosused(newcg), i); 162 break; 163 164 default: 165 if (j < ROOTINO) 166 break; 167 errexit("BAD STATE %d FOR INODE I=%d", 168 statemap[j], j); 169 } 170 } 171 if (c == 0) 172 for (i = 0; i < ROOTINO; i++) { 173 setbit(cg_inosused(newcg), i); 174 newcg->cg_cs.cs_nifree--; 175 } 176 for (i = 0, d = dbase; 177 d < dmax; 178 d += fs->fs_frag, i += fs->fs_frag) { 179 frags = 0; 180 for (j = 0; j < fs->fs_frag; j++) { 181 if (testbmap(d + j)) 182 continue; 183 setbit(cg_blksfree(newcg), i + j); 184 frags++; 185 } 186 if (frags == fs->fs_frag) { 187 newcg->cg_cs.cs_nbfree++; 188 j = cbtocylno(fs, i); 189 cg_blktot(newcg)[j]++; 190 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 191 } else if (frags > 0) { 192 newcg->cg_cs.cs_nffree += frags; 193 blk = blkmap(fs, cg_blksfree(newcg), i); 194 fragacct(fs, blk, newcg->cg_frsum, 1); 195 } 196 } 197 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 198 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 199 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 200 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 201 cs = &fs->fs_cs(fs, c); 202 if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 && 203 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 204 bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs); 205 sbdirty(); 206 } 207 if (cvtflag) { 208 bcopy((char *)newcg, (char *)cg, (size_t)fs->fs_cgsize); 209 cgdirty(); 210 continue; 211 } 212 if (bcmp(cg_inosused(newcg), 213 cg_inosused(cg), mapsize) != 0 && 214 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 215 bcopy(cg_inosused(newcg), cg_inosused(cg), 216 (size_t)mapsize); 217 cgdirty(); 218 } 219 if ((bcmp((char *)newcg, (char *)cg, basesize) != 0 || 220 bcmp((char *)&cg_blktot(newcg)[0], 221 (char *)&cg_blktot(cg)[0], sumsize) != 0) && 222 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 223 bcopy((char *)newcg, (char *)cg, (size_t)basesize); 224 bcopy((char *)&cg_blktot(newcg)[0], 225 (char *)&cg_blktot(cg)[0], (size_t)sumsize); 226 cgdirty(); 227 } 228 } 229 if (fs->fs_postblformat == FS_42POSTBLFMT) 230 fs->fs_nrpos = savednrpos; 231 if (bcmp((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs) != 0 232 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 233 bcopy((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs); 234 fs->fs_ronly = 0; 235 fs->fs_fmod = 0; 236 sbdirty(); 237 } 238 } 239
Indexes created Wed Oct 01 15:09:59 GMT 2025