pass5.c revision 1.41
1 /* $NetBSD: pass5.c,v 1.41 2004/10/09 20:08:44 ragge Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1986, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #include <sys/cdefs.h> 33 #ifndef lint 34 #if 0 35 static char sccsid[] = "@(#)pass5.c 8.9 (Berkeley) 4/28/95"; 36 #else 37 __RCSID("$NetBSD: pass5.c,v 1.41 2004/10/09 20:08:44 ragge Exp $"); 38 #endif 39 #endif /* not lint */ 40 41 #include <sys/param.h> 42 #include <sys/time.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ffs/fs.h> 46 #include <ufs/ffs/ffs_extern.h> 47 #include <ufs/ufs/ufs_bswap.h> 48 49 #include <err.h> 50 #include <string.h> 51 #include <malloc.h> 52 53 #include "fsutil.h" 54 #include "fsck.h" 55 #include "extern.h" 56 57 void print_bmap __P((u_char *,u_int32_t)); 58 59 void 60 pass5(void) 61 { 62 int c, blk, frags, basesize, sumsize, mapsize, cssize; 63 int inomapsize, blkmapsize; 64 struct fs *fs = sblock; 65 daddr_t dbase, dmax; 66 daddr_t d; 67 long i, j, k; 68 struct csum *cs; 69 struct csum_total cstotal; 70 struct inodesc idesc[4]; 71 char buf[MAXBSIZE]; 72 struct cg *newcg = (struct cg *)buf; 73 struct ocg *ocg = (struct ocg *)buf; 74 struct cg *cg = cgrp, *ncg; 75 struct inostat *info; 76 u_int32_t ncgsize; 77 78 inoinfo(WINO)->ino_state = USTATE; 79 memset(newcg, 0, (size_t)fs->fs_cgsize); 80 newcg->cg_niblk = fs->fs_ipg; 81 if (cvtlevel >= 3) { 82 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 83 if (preen) 84 pwarn("DELETING CLUSTERING MAPS\n"); 85 if (preen || reply("DELETE CLUSTERING MAPS")) { 86 fs->fs_contigsumsize = 0; 87 doinglevel1 = 1; 88 sbdirty(); 89 } 90 } 91 if (fs->fs_maxcontig > 1) { 92 char *doit = 0; 93 94 if (fs->fs_contigsumsize < 1) { 95 doit = "CREAT"; 96 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 97 fs->fs_contigsumsize < FS_MAXCONTIG) { 98 doit = "EXPAND"; 99 } 100 if (doit) { 101 i = fs->fs_contigsumsize; 102 fs->fs_contigsumsize = 103 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 104 if (CGSIZE(fs) > fs->fs_bsize) { 105 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 106 fs->fs_contigsumsize = i; 107 } else if (preen || 108 reply("CREATE CLUSTER MAPS")) { 109 if (preen) 110 pwarn("%sING CLUSTER MAPS\n", 111 doit); 112 ncgsize = fragroundup(fs, CGSIZE(fs)); 113 ncg = realloc(cgrp, ncgsize); 114 if (ncg == NULL) 115 errx(EEXIT, 116 "cannot reallocate cg space"); 117 cg = cgrp = ncg; 118 fs->fs_cgsize = ncgsize; 119 doinglevel1 = 1; 120 sbdirty(); 121 } 122 } 123 } 124 } 125 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 126 cssize = (u_char *)&cstotal.cs_spare[0] - (u_char *)&cstotal.cs_ndir; 127 sumsize = 0; 128 if (is_ufs2) { 129 newcg->cg_iusedoff = basesize; 130 } else { 131 /* 132 * We reserve the space for the old rotation summary 133 * tables for the benefit of old kernels, but do not 134 * maintain them in modern kernels. In time, they can 135 * go away. 136 */ 137 newcg->cg_old_btotoff = basesize; 138 newcg->cg_old_boff = newcg->cg_old_btotoff + 139 fs->fs_old_cpg * sizeof(int32_t); 140 newcg->cg_iusedoff = newcg->cg_old_boff + 141 fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t); 142 memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize); 143 } 144 inomapsize = howmany(fs->fs_ipg, CHAR_BIT); 145 newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize; 146 blkmapsize = howmany(fs->fs_fpg, CHAR_BIT); 147 newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize; 148 if (fs->fs_contigsumsize > 0) { 149 newcg->cg_clustersumoff = newcg->cg_nextfreeoff - 150 sizeof(u_int32_t); 151 if (isappleufs) { 152 /* Apple PR2216969 gives rationale for this change. 153 * I believe they were mistaken, but we need to 154 * duplicate it for compatibility. -- dbj (at) NetBSD.org 155 */ 156 newcg->cg_clustersumoff += sizeof(u_int32_t); 157 } 158 newcg->cg_clustersumoff = 159 roundup(newcg->cg_clustersumoff, sizeof(u_int32_t)); 160 newcg->cg_clusteroff = newcg->cg_clustersumoff + 161 (fs->fs_contigsumsize + 1) * sizeof(u_int32_t); 162 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 163 howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT); 164 } 165 newcg->cg_magic = CG_MAGIC; 166 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 167 if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)) { 168 switch ((int)fs->fs_old_postblformat) { 169 170 case FS_42POSTBLFMT: 171 basesize = (char *)(&ocg->cg_btot[0]) - 172 (char *)(&ocg->cg_firstfield); 173 sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]); 174 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 175 (u_char *)&ocg->cg_iused[0]; 176 blkmapsize = howmany(fs->fs_fpg, NBBY); 177 inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0]; 178 ocg->cg_magic = CG_MAGIC; 179 newcg->cg_magic = 0; 180 break; 181 182 case FS_DYNAMICPOSTBLFMT: 183 sumsize = newcg->cg_iusedoff - newcg->cg_old_btotoff; 184 break; 185 186 default: 187 errx(EEXIT, "UNKNOWN ROTATIONAL TABLE FORMAT %d", 188 fs->fs_old_postblformat); 189 } 190 } 191 memset(&idesc[0], 0, sizeof idesc); 192 for (i = 0; i < 4; i++) { 193 idesc[i].id_type = ADDR; 194 if (!is_ufs2 && doinglevel2) 195 idesc[i].id_fix = FIX; 196 } 197 memset(&cstotal, 0, sizeof(struct csum_total)); 198 dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1); 199 for (d = fs->fs_size; d < dmax; d++) 200 setbmap(d); 201 for (c = 0; c < fs->fs_ncg; c++) { 202 if (got_siginfo) { 203 fprintf(stderr, 204 "%s: phase 5: cyl group %d of %d (%d%%)\n", 205 cdevname(), c, fs->fs_ncg, 206 c * 100 / fs->fs_ncg); 207 got_siginfo = 0; 208 } 209 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 210 memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize); 211 if((doswap && !needswap) || (!doswap && needswap)) 212 ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock); 213 if (!doinglevel1 && !cg_chkmagic(cg, 0)) 214 pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c); 215 if(doswap) 216 cgdirty(); 217 /* 218 * While we have the disk head where we want it, 219 * write back the superblock to the spare at this 220 * cylinder group. 221 */ 222 if ((cvtlevel && sblk.b_dirty) || doswap) { 223 bwrite(fswritefd, sblk.b_un.b_buf, 224 fsbtodb(sblock, cgsblock(sblock, c)), 225 sblock->fs_sbsize); 226 } else { 227 /* 228 * Read in the current alternate superblock, 229 * and compare it to the master. If it's 230 * wrong, fix it up. 231 */ 232 getblk(&asblk, cgsblock(sblock, c), sblock->fs_sbsize); 233 if (asblk.b_errs) 234 pfatal("CG %d: UNABLE TO READ ALTERNATE " 235 "SUPERBLK\n", c); 236 else { 237 memmove(altsblock, asblk.b_un.b_fs, 238 sblock->fs_sbsize); 239 if (needswap) 240 ffs_sb_swap(asblk.b_un.b_fs, altsblock); 241 } 242 sb_oldfscompat_write(sblock, sblocksave); 243 if ((asblk.b_errs || cmpsblks(sblock, altsblock)) && 244 dofix(&idesc[3], 245 "ALTERNATE SUPERBLK(S) ARE INCORRECT")) { 246 bwrite(fswritefd, sblk.b_un.b_buf, 247 fsbtodb(sblock, cgsblock(sblock, c)), 248 sblock->fs_sbsize); 249 } 250 sb_oldfscompat_read(sblock, 0); 251 } 252 dbase = cgbase(fs, c); 253 dmax = dbase + fs->fs_fpg; 254 if (dmax > fs->fs_size) 255 dmax = fs->fs_size; 256 if (is_ufs2 || (fs->fs_old_flags & FS_FLAGS_UPDATED)) 257 newcg->cg_time = cg->cg_time; 258 newcg->cg_old_time = cg->cg_old_time; 259 newcg->cg_cgx = c; 260 newcg->cg_ndblk = dmax - dbase; 261 if (!is_ufs2) { 262 if (c == fs->fs_ncg - 1) { 263 /* Avoid fighting old fsck for this value. Its never used 264 * outside of this check anyway. 265 */ 266 if ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0) 267 newcg->cg_old_ncyl = fs->fs_old_ncyl % fs->fs_old_cpg; 268 else 269 newcg->cg_old_ncyl = howmany(newcg->cg_ndblk, 270 fs->fs_fpg / fs->fs_old_cpg); 271 } else 272 newcg->cg_old_ncyl = fs->fs_old_cpg; 273 newcg->cg_old_niblk = fs->fs_ipg; 274 newcg->cg_niblk = 0; 275 } 276 if (fs->fs_contigsumsize > 0) 277 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 278 newcg->cg_cs.cs_ndir = 0; 279 newcg->cg_cs.cs_nffree = 0; 280 newcg->cg_cs.cs_nbfree = 0; 281 newcg->cg_cs.cs_nifree = fs->fs_ipg; 282 if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk) 283 newcg->cg_rotor = cg->cg_rotor; 284 else 285 newcg->cg_rotor = 0; 286 if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk) 287 newcg->cg_frotor = cg->cg_frotor; 288 else 289 newcg->cg_frotor = 0; 290 if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg) 291 newcg->cg_irotor = cg->cg_irotor; 292 else 293 newcg->cg_irotor = 0; 294 if (!is_ufs2) { 295 newcg->cg_initediblk = 0; 296 } else { 297 if ((unsigned)cg->cg_initediblk > fs->fs_ipg) 298 newcg->cg_initediblk = fs->fs_ipg; 299 else 300 newcg->cg_initediblk = cg->cg_initediblk; 301 } 302 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 303 memset(&old_cg_blktot(newcg, 0)[0], 0, (size_t)(sumsize)); 304 memset(cg_inosused(newcg, 0), 0, (size_t)(mapsize)); 305 if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0) && 306 fs->fs_old_postblformat == FS_42POSTBLFMT) 307 ocg->cg_magic = CG_MAGIC; 308 j = fs->fs_ipg * c; 309 for (i = 0; i < fs->fs_ipg; j++, i++) { 310 info = inoinfo(j); 311 switch (info->ino_state) { 312 313 case USTATE: 314 break; 315 316 case DSTATE: 317 case DCLEAR: 318 case DFOUND: 319 newcg->cg_cs.cs_ndir++; 320 /* fall through */ 321 322 case FSTATE: 323 case FCLEAR: 324 newcg->cg_cs.cs_nifree--; 325 setbit(cg_inosused(newcg, 0), i); 326 break; 327 328 default: 329 if (j < ROOTINO) 330 break; 331 errx(EEXIT, "BAD STATE %d FOR INODE I=%ld", 332 info->ino_state, (long)j); 333 } 334 } 335 if (c == 0) 336 for (i = 0; i < ROOTINO; i++) { 337 setbit(cg_inosused(newcg, 0), i); 338 newcg->cg_cs.cs_nifree--; 339 } 340 for (i = 0, d = dbase; 341 d < dmax; 342 d += fs->fs_frag, i += fs->fs_frag) { 343 frags = 0; 344 for (j = 0; j < fs->fs_frag; j++) { 345 if (testbmap(d + j)) 346 continue; 347 setbit(cg_blksfree(newcg, 0), i + j); 348 frags++; 349 } 350 if (frags == fs->fs_frag) { 351 newcg->cg_cs.cs_nbfree++; 352 if (sumsize) { 353 j = old_cbtocylno(fs, i); 354 old_cg_blktot(newcg, 0)[j]++; 355 old_cg_blks(fs, newcg, j, 0)[old_cbtorpos(fs, i)]++; 356 } 357 if (fs->fs_contigsumsize > 0) 358 setbit(cg_clustersfree(newcg, 0), 359 fragstoblks(fs, i)); 360 } else if (frags > 0) { 361 newcg->cg_cs.cs_nffree += frags; 362 blk = blkmap(fs, cg_blksfree(newcg, 0), i); 363 ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0); 364 } 365 } 366 if (fs->fs_contigsumsize > 0) { 367 int32_t *sump = cg_clustersum(newcg, 0); 368 u_char *mapp = cg_clustersfree(newcg, 0); 369 int map = *mapp++; 370 int bit = 1; 371 int run = 0; 372 373 for (i = 0; i < newcg->cg_nclusterblks; i++) { 374 if ((map & bit) != 0) { 375 run++; 376 } else if (run != 0) { 377 if (run > fs->fs_contigsumsize) 378 run = fs->fs_contigsumsize; 379 sump[run]++; 380 run = 0; 381 } 382 if ((i & (NBBY - 1)) != (NBBY - 1)) { 383 bit <<= 1; 384 } else { 385 map = *mapp++; 386 bit = 1; 387 } 388 } 389 if (run != 0) { 390 if (run > fs->fs_contigsumsize) 391 run = fs->fs_contigsumsize; 392 sump[run]++; 393 } 394 } 395 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 396 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 397 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 398 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 399 cs = &fs->fs_cs(fs, c); 400 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) { 401 if (debug) { 402 printf("cg %d: nffree: %d/%d nbfree %d/%d" 403 " nifree %d/%d ndir %d/%d\n", 404 c, cs->cs_nffree,newcg->cg_cs.cs_nffree, 405 cs->cs_nbfree,newcg->cg_cs.cs_nbfree, 406 cs->cs_nifree,newcg->cg_cs.cs_nifree, 407 cs->cs_ndir,newcg->cg_cs.cs_ndir); 408 } 409 if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 410 memmove(cs, &newcg->cg_cs, sizeof *cs); 411 sbdirty(); 412 } else 413 markclean = 0; 414 } 415 if (doinglevel1) { 416 memmove(cg, newcg, (size_t)fs->fs_cgsize); 417 cgdirty(); 418 continue; 419 } 420 if ((memcmp(newcg, cg, basesize) != 0) || 421 (memcmp(&old_cg_blktot(newcg, 0)[0], 422 &old_cg_blktot(cg, 0)[0], sumsize) != 0)) { 423 if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 424 memmove(cg, newcg, (size_t)basesize); 425 memmove(&old_cg_blktot(cg, 0)[0], 426 &old_cg_blktot(newcg, 0)[0], (size_t)sumsize); 427 cgdirty(); 428 } else 429 markclean = 0; 430 } 431 if (usedsoftdep) { 432 for (i = 0; i < inomapsize; i++) { 433 j = cg_inosused(newcg, 0)[i]; 434 if ((cg_inosused(cg, 0)[i] & j) == j) 435 continue; 436 for (k = 0; k < NBBY; k++) { 437 if ((j & (1 << k)) == 0) 438 continue; 439 if (cg_inosused(cg, 0)[i] & (1 << k)) 440 continue; 441 pwarn("ALLOCATED INODE %ld " 442 "MARKED FREE\n", 443 c * fs->fs_ipg + i * 8 + k); 444 } 445 } 446 for (i = 0; i < blkmapsize; i++) { 447 j = cg_blksfree(cg, 0)[i]; 448 if ((cg_blksfree(newcg, 0)[i] & j) == j) 449 continue; 450 for (k = 0; k < NBBY; k++) { 451 if ((j & (1 << k)) == 0) 452 continue; 453 if (cg_inosused(cg, 0)[i] & (1 << k)) 454 continue; 455 pwarn("ALLOCATED FRAG %ld " 456 "MARKED FREE\n", 457 c * fs->fs_fpg + i * 8 + k); 458 } 459 } 460 } 461 if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize) 462 != 0 && dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 463 memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0), 464 (size_t)mapsize); 465 cgdirty(); 466 } 467 } 468 if (memcmp(&cstotal, &fs->fs_cstotal, cssize) != 0) { 469 if (debug) { 470 printf("total: nffree: %lld/%lld nbfree %lld/%lld" 471 " nifree %lld/%lld ndir %lld/%lld\n", 472 (long long int)fs->fs_cstotal.cs_nffree, 473 (long long int)cstotal.cs_nffree, 474 (long long int)fs->fs_cstotal.cs_nbfree, 475 (long long int)cstotal.cs_nbfree, 476 (long long int)fs->fs_cstotal.cs_nifree, 477 (long long int)cstotal.cs_nifree, 478 (long long int)fs->fs_cstotal.cs_ndir, 479 (long long int)cstotal.cs_ndir); 480 } 481 if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 482 memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal); 483 fs->fs_ronly = 0; 484 fs->fs_fmod = 0; 485 sbdirty(); 486 } else 487 markclean = 0; 488 } 489 } 490 491 void 492 print_bmap(map, size) 493 u_char *map; 494 u_int32_t size; 495 { 496 int i, j; 497 498 i = 0; 499 while (i < size) { 500 printf("%u: ",i); 501 for (j = 0; j < 16; j++, i++) 502 printf("%2x ", (u_int)map[i] & 0xff); 503 printf("\n"); 504 } 505 } 506
Indexes created Wed Oct 01 15:09:59 GMT 2025