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