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