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