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