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