pass5.c revision 34266
1168404Spjd/* 2168404Spjd * Copyright (c) 1980, 1986, 1993 3168404Spjd * The Regents of the University of California. All rights reserved. 4168404Spjd * 5168404Spjd * Redistribution and use in source and binary forms, with or without 6168404Spjd * modification, are permitted provided that the following conditions 7168404Spjd * are met: 8168404Spjd * 1. Redistributions of source code must retain the above copyright 9168404Spjd * notice, this list of conditions and the following disclaimer. 10168404Spjd * 2. Redistributions in binary form must reproduce the above copyright 11168404Spjd * notice, this list of conditions and the following disclaimer in the 12168404Spjd * documentation and/or other materials provided with the distribution. 13168404Spjd * 3. All advertising materials mentioning features or use of this software 14168404Spjd * must display the following acknowledgement: 15168404Spjd * This product includes software developed by the University of 16168404Spjd * California, Berkeley and its contributors. 17168404Spjd * 4. Neither the name of the University nor the names of its contributors 18168404Spjd * may be used to endorse or promote products derived from this software 19168404Spjd * without specific prior written permission. 20168404Spjd * 21168404Spjd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22168404Spjd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23168404Spjd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24168404Spjd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25168404Spjd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26168404Spjd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27168404Spjd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28168404Spjd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29168404Spjd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30168404Spjd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31168404Spjd * SUCH DAMAGE. 32168404Spjd */ 33168404Spjd 34168404Spjd#ifndef lint 35168404Spjdstatic const char sccsid[] = "@(#)pass5.c 8.9 (Berkeley) 4/28/95"; 36168404Spjd#endif /* not lint */ 37168404Spjd 38168404Spjd#include <sys/param.h> 39168404Spjd#include <sys/time.h> 40168404Spjd 41168404Spjd#include <ufs/ufs/dinode.h> 42168404Spjd#include <ufs/ffs/fs.h> 43168404Spjd 44168404Spjd#include <err.h> 45168404Spjd#include <string.h> 46168404Spjd 47168404Spjd#include "fsck.h" 48168404Spjd 49168404Spjdvoid 50168404Spjdpass5() 51168404Spjd{ 52168404Spjd int c, blk, frags, basesize, sumsize, mapsize, savednrpos; 53 int inomapsize, blkmapsize; 54 struct fs *fs = &sblock; 55 struct cg *cg = &cgrp; 56 ufs_daddr_t dbase, dmax; 57 ufs_daddr_t d; 58 long i, j, k; 59 struct csum *cs; 60 struct csum cstotal; 61 struct inodesc idesc[3]; 62 char buf[MAXBSIZE]; 63 register struct cg *newcg = (struct cg *)buf; 64 struct ocg *ocg = (struct ocg *)buf; 65 66 statemap[WINO] = USTATE; 67 memset(newcg, 0, (size_t)fs->fs_cgsize); 68 newcg->cg_niblk = fs->fs_ipg; 69 if (cvtlevel >= 3) { 70 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 71 if (preen) 72 pwarn("DELETING CLUSTERING MAPS\n"); 73 if (preen || reply("DELETE CLUSTERING MAPS")) { 74 fs->fs_contigsumsize = 0; 75 doinglevel1 = 1; 76 sbdirty(); 77 } 78 } 79 if (fs->fs_maxcontig > 1) { 80 char *doit = 0; 81 82 if (fs->fs_contigsumsize < 1) { 83 doit = "CREAT"; 84 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 85 fs->fs_contigsumsize < FS_MAXCONTIG) { 86 doit = "EXPAND"; 87 } 88 if (doit) { 89 i = fs->fs_contigsumsize; 90 fs->fs_contigsumsize = 91 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 92 if (CGSIZE(fs) > fs->fs_bsize) { 93 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 94 fs->fs_contigsumsize = i; 95 } else if (preen || 96 reply("CREATE CLUSTER MAPS")) { 97 if (preen) 98 pwarn("%sING CLUSTER MAPS\n", 99 doit); 100 fs->fs_cgsize = 101 fragroundup(fs, CGSIZE(fs)); 102 doinglevel1 = 1; 103 sbdirty(); 104 } 105 } 106 } 107 } 108 switch ((int)fs->fs_postblformat) { 109 110 case FS_42POSTBLFMT: 111 basesize = (char *)(&ocg->cg_btot[0]) - 112 (char *)(&ocg->cg_firstfield); 113 sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]); 114 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 115 (u_char *)&ocg->cg_iused[0]; 116 blkmapsize = howmany(fs->fs_fpg, NBBY); 117 inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0]; 118 ocg->cg_magic = CG_MAGIC; 119 savednrpos = fs->fs_nrpos; 120 fs->fs_nrpos = 8; 121 break; 122 123 case FS_DYNAMICPOSTBLFMT: 124 newcg->cg_btotoff = 125 &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 126 newcg->cg_boff = 127 newcg->cg_btotoff + fs->fs_cpg * sizeof(long); 128 newcg->cg_iusedoff = newcg->cg_boff + 129 fs->fs_cpg * fs->fs_nrpos * sizeof(short); 130 newcg->cg_freeoff = 131 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 132 inomapsize = newcg->cg_freeoff - newcg->cg_iusedoff; 133 newcg->cg_nextfreeoff = newcg->cg_freeoff + 134 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY); 135 blkmapsize = newcg->cg_nextfreeoff - newcg->cg_freeoff; 136 if (fs->fs_contigsumsize > 0) { 137 newcg->cg_clustersumoff = newcg->cg_nextfreeoff - 138 sizeof(long); 139 newcg->cg_clustersumoff = 140 roundup(newcg->cg_clustersumoff, sizeof(long)); 141 newcg->cg_clusteroff = newcg->cg_clustersumoff + 142 (fs->fs_contigsumsize + 1) * sizeof(long); 143 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 144 howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY); 145 } 146 newcg->cg_magic = CG_MAGIC; 147 basesize = &newcg->cg_space[0] - 148 (u_char *)(&newcg->cg_firstfield); 149 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 150 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 151 break; 152 153 default: 154 inomapsize = blkmapsize = sumsize = 0; /* keep lint happy */ 155 errx(EEXIT, "UNKNOWN ROTATIONAL TABLE FORMAT %d", 156 fs->fs_postblformat); 157 } 158 memset(&idesc[0], 0, sizeof idesc); 159 for (i = 0; i < 3; i++) { 160 idesc[i].id_type = ADDR; 161 if (doinglevel2) 162 idesc[i].id_fix = FIX; 163 } 164 memset(&cstotal, 0, sizeof(struct csum)); 165 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 166 for (i = fs->fs_size; i < j; i++) 167 setbmap(i); 168 for (c = 0; c < fs->fs_ncg; c++) { 169 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 170 if (!cg_chkmagic(cg)) 171 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 172 dbase = cgbase(fs, c); 173 dmax = dbase + fs->fs_fpg; 174 if (dmax > fs->fs_size) 175 dmax = fs->fs_size; 176 newcg->cg_time = cg->cg_time; 177 newcg->cg_cgx = c; 178 if (c == fs->fs_ncg - 1) 179 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 180 else 181 newcg->cg_ncyl = fs->fs_cpg; 182 newcg->cg_ndblk = dmax - dbase; 183 if (fs->fs_contigsumsize > 0) 184 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 185 newcg->cg_cs.cs_ndir = 0; 186 newcg->cg_cs.cs_nffree = 0; 187 newcg->cg_cs.cs_nbfree = 0; 188 newcg->cg_cs.cs_nifree = fs->fs_ipg; 189 if (cg->cg_rotor < newcg->cg_ndblk) 190 newcg->cg_rotor = cg->cg_rotor; 191 else 192 newcg->cg_rotor = 0; 193 if (cg->cg_frotor < newcg->cg_ndblk) 194 newcg->cg_frotor = cg->cg_frotor; 195 else 196 newcg->cg_frotor = 0; 197 if (cg->cg_irotor < newcg->cg_niblk) 198 newcg->cg_irotor = cg->cg_irotor; 199 else 200 newcg->cg_irotor = 0; 201 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 202 memset(&cg_blktot(newcg)[0], 0, 203 (size_t)(sumsize + mapsize)); 204 if (fs->fs_postblformat == FS_42POSTBLFMT) 205 ocg->cg_magic = CG_MAGIC; 206 j = fs->fs_ipg * c; 207 for (i = 0; i < fs->fs_ipg; j++, i++) { 208 switch (statemap[j]) { 209 210 case USTATE: 211 break; 212 213 case DSTATE: 214 case DCLEAR: 215 case DFOUND: 216 newcg->cg_cs.cs_ndir++; 217 /* fall through */ 218 219 case FSTATE: 220 case FCLEAR: 221 newcg->cg_cs.cs_nifree--; 222 setbit(cg_inosused(newcg), i); 223 break; 224 225 default: 226 if (j < ROOTINO) 227 break; 228 errx(EEXIT, "BAD STATE %d FOR INODE I=%d", 229 statemap[j], j); 230 } 231 } 232 if (c == 0) 233 for (i = 0; i < ROOTINO; i++) { 234 setbit(cg_inosused(newcg), i); 235 newcg->cg_cs.cs_nifree--; 236 } 237 for (i = 0, d = dbase; 238 d < dmax; 239 d += fs->fs_frag, i += fs->fs_frag) { 240 frags = 0; 241 for (j = 0; j < fs->fs_frag; j++) { 242 if (testbmap(d + j)) 243 continue; 244 setbit(cg_blksfree(newcg), i + j); 245 frags++; 246 } 247 if (frags == fs->fs_frag) { 248 newcg->cg_cs.cs_nbfree++; 249 j = cbtocylno(fs, i); 250 cg_blktot(newcg)[j]++; 251 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 252 if (fs->fs_contigsumsize > 0) 253 setbit(cg_clustersfree(newcg), 254 i / fs->fs_frag); 255 } else if (frags > 0) { 256 newcg->cg_cs.cs_nffree += frags; 257 blk = blkmap(fs, cg_blksfree(newcg), i); 258 ffs_fragacct(fs, blk, newcg->cg_frsum, 1); 259 } 260 } 261 if (fs->fs_contigsumsize > 0) { 262 int32_t *sump = cg_clustersum(newcg); 263 u_char *mapp = cg_clustersfree(newcg); 264 int map = *mapp++; 265 int bit = 1; 266 int run = 0; 267 268 for (i = 0; i < newcg->cg_nclusterblks; i++) { 269 if ((map & bit) != 0) { 270 run++; 271 } else if (run != 0) { 272 if (run > fs->fs_contigsumsize) 273 run = fs->fs_contigsumsize; 274 sump[run]++; 275 run = 0; 276 } 277 if ((i & (NBBY - 1)) != (NBBY - 1)) { 278 bit <<= 1; 279 } else { 280 map = *mapp++; 281 bit = 1; 282 } 283 } 284 if (run != 0) { 285 if (run > fs->fs_contigsumsize) 286 run = fs->fs_contigsumsize; 287 sump[run]++; 288 } 289 } 290 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 291 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 292 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 293 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 294 cs = &fs->fs_cs(fs, c); 295 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0 && 296 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 297 memmove(cs, &newcg->cg_cs, sizeof *cs); 298 sbdirty(); 299 } 300 if (doinglevel1) { 301 memmove(cg, newcg, (size_t)fs->fs_cgsize); 302 cgdirty(); 303 continue; 304 } 305 if ((memcmp(newcg, cg, basesize) != 0 || 306 memcmp(&cg_blktot(newcg)[0], 307 &cg_blktot(cg)[0], sumsize) != 0) && 308 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 309 memmove(cg, newcg, (size_t)basesize); 310 memmove(&cg_blktot(cg)[0], 311 &cg_blktot(newcg)[0], (size_t)sumsize); 312 cgdirty(); 313 } 314 if (usedsoftdep) { 315 for (i = 0; i < inomapsize; i++) { 316 j = cg_inosused(newcg)[i]; 317 if ((cg_inosused(cg)[i] & j) == j) 318 continue; 319 for (k = 0; k < NBBY; k++) { 320 if ((j & (1 << k)) == 0) 321 continue; 322 if (cg_inosused(cg)[i] & (1 << k)) 323 continue; 324 pwarn("ALLOCATED INODE %d MARKED FREE", 325 c * fs->fs_ipg + i * 8 + k); 326 } 327 } 328 for (i = 0; i < blkmapsize; i++) { 329 j = cg_blksfree(cg)[i]; 330 if ((cg_blksfree(newcg)[i] & j) == j) 331 continue; 332 for (k = 0; k < NBBY; k++) { 333 if ((j & (1 << k)) == 0) 334 continue; 335 if (cg_inosused(cg)[i] & (1 << k)) 336 continue; 337 pwarn("ALLOCATED FRAG %d MARKED FREE", 338 c * fs->fs_fpg + i * 8 + k); 339 } 340 } 341 } 342 if (memcmp(cg_inosused(newcg), cg_inosused(cg), mapsize) != 0 && 343 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 344 memmove(cg_inosused(cg), cg_inosused(newcg), 345 (size_t)mapsize); 346 cgdirty(); 347 } 348 } 349 if (fs->fs_postblformat == FS_42POSTBLFMT) 350 fs->fs_nrpos = savednrpos; 351 if (memcmp(&cstotal, &fs->fs_cstotal, sizeof *cs) != 0 352 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 353 memmove(&fs->fs_cstotal, &cstotal, sizeof *cs); 354 fs->fs_ronly = 0; 355 sbdirty(); 356 } 357 if (fs->fs_fmod != 0) { 358 pwarn("MODIFIED FLAG SET IN SUPERBLOCK"); 359 if (preen) 360 printf(" (FIXED)\n"); 361 if (preen || reply("FIX") == 1) { 362 fs->fs_fmod = 0; 363 sbdirty(); 364 } 365 } 366 if (fs->fs_clean == 0) { 367 pwarn("CLEAN FLAG NOT SET IN SUPERBLOCK"); 368 if (preen) 369 printf(" (FIXED)\n"); 370 if (preen || reply("FIX") == 1) { 371 fs->fs_clean = 1; 372 sbdirty(); 373 } 374 } 375} 376