pass5.c revision 1.14
1 /* $NetBSD: pass5.c,v 1.14 1995/03/21 01:30:16 cgd Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1986, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #ifndef lint 37 #if 0 38 static char sccsid[] = "@(#)pass5.c 8.6 (Berkeley) 11/30/94"; 39 #else 40 static char rcsid[] = "$NetBSD: pass5.c,v 1.14 1995/03/21 01:30:16 cgd Exp $"; 41 #endif 42 #endif /* not lint */ 43 44 #include <sys/param.h> 45 #include <sys/time.h> 46 #include <ufs/ufs/dinode.h> 47 #include <ufs/ffs/fs.h> 48 #include <string.h> 49 #include "fsck.h" 50 #include "extern.h" 51 52 void 53 pass5() 54 { 55 int c, blk, frags, basesize, sumsize, mapsize, savednrpos; 56 register struct fs *fs = &sblock; 57 register struct cg *cg = &cgrp; 58 daddr_t dbase, dmax; 59 register daddr_t d; 60 register long i, j; 61 struct csum *cs; 62 struct csum cstotal; 63 struct inodesc idesc[3]; 64 char buf[MAXBSIZE]; 65 register struct cg *newcg = (struct cg *)buf; 66 struct ocg *ocg = (struct ocg *)buf; 67 68 statemap[WINO] = USTATE; 69 memset(newcg, 0, (size_t)fs->fs_cgsize); 70 newcg->cg_niblk = fs->fs_ipg; 71 if (cvtlevel >= 3) { 72 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 73 if (preen) 74 pwarn("DELETING CLUSTERING MAPS\n"); 75 if (preen || reply("DELETE CLUSTERING MAPS")) { 76 fs->fs_contigsumsize = 0; 77 doinglevel1 = 1; 78 sbdirty(); 79 } 80 } 81 if (fs->fs_maxcontig > 1) { 82 char *doit = 0; 83 84 if (fs->fs_contigsumsize < 1) { 85 doit = "CREAT"; 86 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 87 fs->fs_contigsumsize < FS_MAXCONTIG) { 88 doit = "EXPAND"; 89 } 90 if (doit) { 91 i = fs->fs_contigsumsize; 92 fs->fs_contigsumsize = 93 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 94 if (CGSIZE(fs) > fs->fs_bsize) { 95 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 96 fs->fs_contigsumsize = i; 97 } else if (preen || 98 reply("CREATE CLUSTER MAPS")) { 99 if (preen) 100 pwarn("%sING CLUSTER MAPS\n", 101 doit); 102 fs->fs_cgsize = 103 fragroundup(fs, CGSIZE(fs)); 104 doinglevel1 = 1; 105 sbdirty(); 106 } 107 } 108 } 109 } 110 switch ((int)fs->fs_postblformat) { 111 112 case FS_42POSTBLFMT: 113 basesize = (char *)(&ocg->cg_btot[0]) - 114 (char *)(&ocg->cg_firstfield); 115 sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]); 116 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 117 (u_char *)&ocg->cg_iused[0]; 118 ocg->cg_magic = CG_MAGIC; 119 savednrpos = fs->fs_nrpos; 120 fs->fs_nrpos = 8; 121 break; 122 123 case FS_DYNAMICPOSTBLFMT: 124 newcg->cg_btotoff = 125 &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 126 newcg->cg_boff = 127 newcg->cg_btotoff + fs->fs_cpg * sizeof(int32_t); 128 newcg->cg_iusedoff = newcg->cg_boff + 129 fs->fs_cpg * fs->fs_nrpos * sizeof(int16_t); 130 newcg->cg_freeoff = 131 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 132 if (fs->fs_contigsumsize <= 0) { 133 newcg->cg_nextfreeoff = newcg->cg_freeoff + 134 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY); 135 } else { 136 newcg->cg_clustersumoff = newcg->cg_freeoff + 137 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY) - 138 sizeof(int32_t); 139 newcg->cg_clustersumoff = 140 roundup(newcg->cg_clustersumoff, sizeof(int32_t)); 141 newcg->cg_clusteroff = newcg->cg_clustersumoff + 142 (fs->fs_contigsumsize + 1) * sizeof(int32_t); 143 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 144 howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY); 145 } 146 newcg->cg_magic = CG_MAGIC; 147 basesize = &newcg->cg_space[0] - 148 (u_char *)(&newcg->cg_firstfield); 149 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 150 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 151 break; 152 153 default: 154 errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n", 155 fs->fs_postblformat); 156 } 157 memset(&idesc[0], 0, sizeof idesc); 158 for (i = 0; i < 3; i++) { 159 idesc[i].id_type = ADDR; 160 if (doinglevel2) 161 idesc[i].id_fix = FIX; 162 } 163 memset(&cstotal, 0, sizeof(struct csum)); 164 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 165 for (i = fs->fs_size; i < j; i++) 166 setbmap(i); 167 for (c = 0; c < fs->fs_ncg; c++) { 168 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 169 if (!cg_chkmagic(cg)) 170 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 171 dbase = cgbase(fs, c); 172 dmax = dbase + fs->fs_fpg; 173 if (dmax > fs->fs_size) 174 dmax = fs->fs_size; 175 newcg->cg_time = cg->cg_time; 176 newcg->cg_cgx = c; 177 if (c == fs->fs_ncg - 1) 178 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 179 else 180 newcg->cg_ncyl = fs->fs_cpg; 181 newcg->cg_ndblk = dmax - dbase; 182 if (fs->fs_contigsumsize > 0) 183 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 184 newcg->cg_cs.cs_ndir = 0; 185 newcg->cg_cs.cs_nffree = 0; 186 newcg->cg_cs.cs_nbfree = 0; 187 newcg->cg_cs.cs_nifree = fs->fs_ipg; 188 if (cg->cg_rotor < newcg->cg_ndblk) 189 newcg->cg_rotor = cg->cg_rotor; 190 else 191 newcg->cg_rotor = 0; 192 if (cg->cg_frotor < newcg->cg_ndblk) 193 newcg->cg_frotor = cg->cg_frotor; 194 else 195 newcg->cg_frotor = 0; 196 if (cg->cg_irotor < newcg->cg_niblk) 197 newcg->cg_irotor = cg->cg_irotor; 198 else 199 newcg->cg_irotor = 0; 200 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 201 memset(&cg_blktot(newcg)[0], 0, 202 (size_t)(sumsize + mapsize)); 203 if (fs->fs_postblformat == FS_42POSTBLFMT) 204 ocg->cg_magic = CG_MAGIC; 205 j = fs->fs_ipg * c; 206 for (i = 0; i < fs->fs_ipg; j++, i++) { 207 switch (statemap[j]) { 208 209 case USTATE: 210 break; 211 212 case DSTATE: 213 case DCLEAR: 214 case DFOUND: 215 newcg->cg_cs.cs_ndir++; 216 /* fall through */ 217 218 case FSTATE: 219 case FCLEAR: 220 newcg->cg_cs.cs_nifree--; 221 setbit(cg_inosused(newcg), i); 222 break; 223 224 default: 225 if (j < ROOTINO) 226 break; 227 errexit("BAD STATE %d FOR INODE I=%d", 228 statemap[j], j); 229 } 230 } 231 if (c == 0) 232 for (i = 0; i < ROOTINO; i++) { 233 setbit(cg_inosused(newcg), i); 234 newcg->cg_cs.cs_nifree--; 235 } 236 for (i = 0, d = dbase; 237 d < dmax; 238 d += fs->fs_frag, i += fs->fs_frag) { 239 frags = 0; 240 for (j = 0; j < fs->fs_frag; j++) { 241 if (testbmap(d + j)) 242 continue; 243 setbit(cg_blksfree(newcg), i + j); 244 frags++; 245 } 246 if (frags == fs->fs_frag) { 247 newcg->cg_cs.cs_nbfree++; 248 j = cbtocylno(fs, i); 249 cg_blktot(newcg)[j]++; 250 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 251 if (fs->fs_contigsumsize > 0) 252 setbit(cg_clustersfree(newcg), 253 i / fs->fs_frag); 254 } else if (frags > 0) { 255 newcg->cg_cs.cs_nffree += frags; 256 blk = blkmap(fs, cg_blksfree(newcg), i); 257 ffs_fragacct(fs, blk, newcg->cg_frsum, 1); 258 } 259 } 260 if (fs->fs_contigsumsize > 0) { 261 int32_t *sump = cg_clustersum(newcg); 262 u_char *mapp = cg_clustersfree(newcg); 263 int map = *mapp++; 264 int bit = 1; 265 int run = 0; 266 267 for (i = 0; i < newcg->cg_nclusterblks; i++) { 268 if ((map & bit) != 0) { 269 run++; 270 } else if (run != 0) { 271 if (run > fs->fs_contigsumsize) 272 run = fs->fs_contigsumsize; 273 sump[run]++; 274 run = 0; 275 } 276 if ((i & (NBBY - 1)) != (NBBY - 1)) { 277 bit <<= 1; 278 } else { 279 map = *mapp++; 280 bit = 1; 281 } 282 } 283 if (run != 0) { 284 if (run > fs->fs_contigsumsize) 285 run = fs->fs_contigsumsize; 286 sump[run]++; 287 } 288 } 289 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 290 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 291 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 292 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 293 cs = &fs->fs_cs(fs, c); 294 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 && 295 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 296 memcpy(cs, &newcg->cg_cs, sizeof *cs); 297 sbdirty(); 298 } 299 if (doinglevel1) { 300 memcpy(cg, newcg, (size_t)fs->fs_cgsize); 301 cgdirty(); 302 continue; 303 } 304 if (memcmp(cg_inosused(newcg), 305 cg_inosused(cg), mapsize) != 0 && 306 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 307 memcpy(cg_inosused(cg), cg_inosused(newcg), 308 (size_t)mapsize); 309 cgdirty(); 310 } 311 if ((memcmp(newcg, cg, basesize) != 0 || 312 memcmp(&cg_blktot(newcg)[0], 313 &cg_blktot(cg)[0], sumsize) != 0) && 314 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 315 memcpy(cg, newcg, (size_t)basesize); 316 memcpy(&cg_blktot(cg)[0], 317 &cg_blktot(newcg)[0], (size_t)sumsize); 318 cgdirty(); 319 } 320 } 321 if (fs->fs_postblformat == FS_42POSTBLFMT) 322 fs->fs_nrpos = savednrpos; 323 if (memcmp(&cstotal, &fs->fs_cstotal, sizeof *cs) != 0 324 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 325 memcpy(&fs->fs_cstotal, &cstotal, sizeof *cs); 326 fs->fs_ronly = 0; 327 fs->fs_fmod = 0; 328 sbdirty(); 329 } 330 } 331
Indexes created Wed Oct 01 12:09:54 GMT 2025