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