pass5.c revision 1.17
1 /* $NetBSD: pass5.c,v 1.17 1997/09/14 14:36:36 lukem 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 #include <sys/cdefs.h> 37 #ifndef lint 38 #if 0 39 static char sccsid[] = "@(#)pass5.c 8.6 (Berkeley) 11/30/94"; 40 #else 41 __RCSID("$NetBSD: pass5.c,v 1.17 1997/09/14 14:36:36 lukem Exp $"); 42 #endif 43 #endif /* not lint */ 44 45 #include <sys/param.h> 46 #include <sys/time.h> 47 #include <ufs/ufs/dinode.h> 48 #include <ufs/ffs/fs.h> 49 #include <ufs/ffs/ffs_extern.h> 50 #include <string.h> 51 52 #include "fsutil.h" 53 #include "fsck.h" 54 #include "extern.h" 55 56 void 57 pass5() 58 { 59 int c, blk, frags, basesize, sumsize, mapsize, savednrpos = 0; 60 struct fs *fs = &sblock; 61 struct cg *cg = &cgrp; 62 daddr_t dbase, dmax; 63 daddr_t d; 64 long i, j; 65 struct csum *cs; 66 struct csum cstotal; 67 struct inodesc idesc[3]; 68 char buf[MAXBSIZE]; 69 struct cg *newcg = (struct cg *)buf; 70 struct ocg *ocg = (struct ocg *)buf; 71 72 statemap[WINO] = USTATE; 73 memset(newcg, 0, (size_t)fs->fs_cgsize); 74 newcg->cg_niblk = fs->fs_ipg; 75 if (cvtlevel >= 3) { 76 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 77 if (preen) 78 pwarn("DELETING CLUSTERING MAPS\n"); 79 if (preen || reply("DELETE CLUSTERING MAPS")) { 80 fs->fs_contigsumsize = 0; 81 doinglevel1 = 1; 82 sbdirty(); 83 } 84 } 85 if (fs->fs_maxcontig > 1) { 86 char *doit = 0; 87 88 if (fs->fs_contigsumsize < 1) { 89 doit = "CREAT"; 90 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 91 fs->fs_contigsumsize < FS_MAXCONTIG) { 92 doit = "EXPAND"; 93 } 94 if (doit) { 95 i = fs->fs_contigsumsize; 96 fs->fs_contigsumsize = 97 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 98 if (CGSIZE(fs) > fs->fs_bsize) { 99 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 100 fs->fs_contigsumsize = i; 101 } else if (preen || 102 reply("CREATE CLUSTER MAPS")) { 103 if (preen) 104 pwarn("%sING CLUSTER MAPS\n", 105 doit); 106 fs->fs_cgsize = 107 fragroundup(fs, CGSIZE(fs)); 108 doinglevel1 = 1; 109 sbdirty(); 110 } 111 } 112 } 113 } 114 switch ((int)fs->fs_postblformat) { 115 116 case FS_42POSTBLFMT: 117 basesize = (char *)(&ocg->cg_btot[0]) - 118 (char *)(&ocg->cg_firstfield); 119 sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]); 120 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 121 (u_char *)&ocg->cg_iused[0]; 122 ocg->cg_magic = CG_MAGIC; 123 savednrpos = fs->fs_nrpos; 124 fs->fs_nrpos = 8; 125 break; 126 127 case FS_DYNAMICPOSTBLFMT: 128 newcg->cg_btotoff = 129 &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 130 newcg->cg_boff = 131 newcg->cg_btotoff + fs->fs_cpg * sizeof(int32_t); 132 newcg->cg_iusedoff = newcg->cg_boff + 133 fs->fs_cpg * fs->fs_nrpos * sizeof(int16_t); 134 newcg->cg_freeoff = 135 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 136 if (fs->fs_contigsumsize <= 0) { 137 newcg->cg_nextfreeoff = newcg->cg_freeoff + 138 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY); 139 } else { 140 newcg->cg_clustersumoff = newcg->cg_freeoff + 141 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY) - 142 sizeof(int32_t); 143 newcg->cg_clustersumoff = 144 roundup(newcg->cg_clustersumoff, sizeof(int32_t)); 145 newcg->cg_clusteroff = newcg->cg_clustersumoff + 146 (fs->fs_contigsumsize + 1) * sizeof(int32_t); 147 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 148 howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY); 149 } 150 newcg->cg_magic = CG_MAGIC; 151 basesize = &newcg->cg_space[0] - 152 (u_char *)(&newcg->cg_firstfield); 153 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 154 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 155 break; 156 157 default: 158 errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n", 159 fs->fs_postblformat); 160 } 161 memset(&idesc[0], 0, sizeof idesc); 162 for (i = 0; i < 3; i++) { 163 idesc[i].id_type = ADDR; 164 if (doinglevel2) 165 idesc[i].id_fix = FIX; 166 } 167 memset(&cstotal, 0, sizeof(struct csum)); 168 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 169 for (i = fs->fs_size; i < j; i++) 170 setbmap(i); 171 for (c = 0; c < fs->fs_ncg; c++) { 172 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 173 if (!cg_chkmagic(cg)) 174 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 175 dbase = cgbase(fs, c); 176 dmax = dbase + fs->fs_fpg; 177 if (dmax > fs->fs_size) 178 dmax = fs->fs_size; 179 newcg->cg_time = cg->cg_time; 180 newcg->cg_cgx = c; 181 if (c == fs->fs_ncg - 1) 182 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 183 else 184 newcg->cg_ncyl = fs->fs_cpg; 185 newcg->cg_ndblk = dmax - dbase; 186 if (fs->fs_contigsumsize > 0) 187 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 188 newcg->cg_cs.cs_ndir = 0; 189 newcg->cg_cs.cs_nffree = 0; 190 newcg->cg_cs.cs_nbfree = 0; 191 newcg->cg_cs.cs_nifree = fs->fs_ipg; 192 if (cg->cg_rotor < newcg->cg_ndblk) 193 newcg->cg_rotor = cg->cg_rotor; 194 else 195 newcg->cg_rotor = 0; 196 if (cg->cg_frotor < newcg->cg_ndblk) 197 newcg->cg_frotor = cg->cg_frotor; 198 else 199 newcg->cg_frotor = 0; 200 if (cg->cg_irotor < newcg->cg_niblk) 201 newcg->cg_irotor = cg->cg_irotor; 202 else 203 newcg->cg_irotor = 0; 204 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 205 memset(&cg_blktot(newcg)[0], 0, 206 (size_t)(sumsize + mapsize)); 207 if (fs->fs_postblformat == FS_42POSTBLFMT) 208 ocg->cg_magic = CG_MAGIC; 209 j = fs->fs_ipg * c; 210 for (i = 0; i < fs->fs_ipg; j++, i++) { 211 switch (statemap[j]) { 212 213 case USTATE: 214 break; 215 216 case DSTATE: 217 case DCLEAR: 218 case DFOUND: 219 newcg->cg_cs.cs_ndir++; 220 /* fall through */ 221 222 case FSTATE: 223 case FCLEAR: 224 newcg->cg_cs.cs_nifree--; 225 setbit(cg_inosused(newcg), i); 226 break; 227 228 default: 229 if (j < ROOTINO) 230 break; 231 errexit("BAD STATE %d FOR INODE I=%ld", 232 statemap[j], j); 233 } 234 } 235 if (c == 0) 236 for (i = 0; i < ROOTINO; i++) { 237 setbit(cg_inosused(newcg), i); 238 newcg->cg_cs.cs_nifree--; 239 } 240 for (i = 0, d = dbase; 241 d < dmax; 242 d += fs->fs_frag, i += fs->fs_frag) { 243 frags = 0; 244 for (j = 0; j < fs->fs_frag; j++) { 245 if (testbmap(d + j)) 246 continue; 247 setbit(cg_blksfree(newcg), i + j); 248 frags++; 249 } 250 if (frags == fs->fs_frag) { 251 newcg->cg_cs.cs_nbfree++; 252 j = cbtocylno(fs, i); 253 cg_blktot(newcg)[j]++; 254 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 255 if (fs->fs_contigsumsize > 0) 256 setbit(cg_clustersfree(newcg), 257 i / fs->fs_frag); 258 } else if (frags > 0) { 259 newcg->cg_cs.cs_nffree += frags; 260 blk = blkmap(fs, cg_blksfree(newcg), i); 261 ffs_fragacct(fs, blk, newcg->cg_frsum, 1); 262 } 263 } 264 if (fs->fs_contigsumsize > 0) { 265 int32_t *sump = cg_clustersum(newcg); 266 u_char *mapp = cg_clustersfree(newcg); 267 int map = *mapp++; 268 int bit = 1; 269 int run = 0; 270 271 for (i = 0; i < newcg->cg_nclusterblks; i++) { 272 if ((map & bit) != 0) { 273 run++; 274 } else if (run != 0) { 275 if (run > fs->fs_contigsumsize) 276 run = fs->fs_contigsumsize; 277 sump[run]++; 278 run = 0; 279 } 280 if ((i & (NBBY - 1)) != (NBBY - 1)) { 281 bit <<= 1; 282 } else { 283 map = *mapp++; 284 bit = 1; 285 } 286 } 287 if (run != 0) { 288 if (run > fs->fs_contigsumsize) 289 run = fs->fs_contigsumsize; 290 sump[run]++; 291 } 292 } 293 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 294 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 295 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 296 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 297 cs = &fs->fs_cs(fs, c); 298 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 && 299 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 300 memcpy(cs, &newcg->cg_cs, sizeof *cs); 301 sbdirty(); 302 } 303 if (doinglevel1) { 304 memcpy(cg, newcg, (size_t)fs->fs_cgsize); 305 cgdirty(); 306 continue; 307 } 308 if (memcmp(cg_inosused(newcg), 309 cg_inosused(cg), mapsize) != 0 && 310 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 311 memcpy(cg_inosused(cg), cg_inosused(newcg), 312 (size_t)mapsize); 313 cgdirty(); 314 } 315 if ((memcmp(newcg, cg, basesize) != 0 || 316 memcmp(&cg_blktot(newcg)[0], 317 &cg_blktot(cg)[0], sumsize) != 0) && 318 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 319 memcpy(cg, newcg, (size_t)basesize); 320 memcpy(&cg_blktot(cg)[0], 321 &cg_blktot(newcg)[0], (size_t)sumsize); 322 cgdirty(); 323 } 324 } 325 if (fs->fs_postblformat == FS_42POSTBLFMT) 326 fs->fs_nrpos = savednrpos; 327 if (memcmp(&cstotal, &fs->fs_cstotal, sizeof *cs) != 0 328 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 329 memcpy(&fs->fs_cstotal, &cstotal, sizeof *cs); 330 fs->fs_ronly = 0; 331 fs->fs_fmod = 0; 332 sbdirty(); 333 } 334 } 335
Indexes created Wed Oct 01 07:09:59 GMT 2025