pass5.c revision 1.34
1 /* $NetBSD: pass5.c,v 1.34 2003/04/02 10:39:26 fvdl 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 #if 0 39 static char sccsid[] = "@(#)pass5.c 8.9 (Berkeley) 4/28/95"; 40 #else 41 __RCSID("$NetBSD: pass5.c,v 1.34 2003/04/02 10:39:26 fvdl Exp $"); 42 #endif 43 #endif /* not lint */ 44 45 #include <sys/param.h> 46 #include <sys/time.h> 47 48 #include <ufs/ufs/dinode.h> 49 #include <ufs/ffs/fs.h> 50 #include <ufs/ffs/ffs_extern.h> 51 #include <ufs/ufs/ufs_bswap.h> 52 53 #include <err.h> 54 #include <string.h> 55 #include <malloc.h> 56 57 #include "fsutil.h" 58 #include "fsck.h" 59 #include "extern.h" 60 61 void print_bmap __P((u_char *,u_int32_t)); 62 63 void 64 pass5(void) 65 { 66 int c, blk, frags, basesize, mapsize; 67 int inomapsize, blkmapsize; 68 struct fs *fs = sblock; 69 daddr_t dbase, dmax; 70 daddr_t d; 71 long i, j, k; 72 struct csum *cs; 73 struct csum_total cstotal; 74 struct inodesc idesc[4]; 75 char buf[MAXBSIZE]; 76 struct cg *newcg = (struct cg *)buf; 77 struct cg *cg = cgrp; 78 struct inostat *info; 79 80 inoinfo(WINO)->ino_state = USTATE; 81 memset(newcg, 0, (size_t)fs->fs_cgsize); 82 newcg->cg_niblk = fs->fs_ipg; 83 if (cvtlevel >= 3) { 84 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 85 if (preen) 86 pwarn("DELETING CLUSTERING MAPS\n"); 87 if (preen || reply("DELETE CLUSTERING MAPS")) { 88 fs->fs_contigsumsize = 0; 89 doinglevel1 = 1; 90 sbdirty(); 91 } 92 } 93 if (fs->fs_maxcontig > 1) { 94 char *doit = 0; 95 96 if (fs->fs_contigsumsize < 1) { 97 doit = "CREAT"; 98 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 99 fs->fs_contigsumsize < FS_MAXCONTIG) { 100 doit = "EXPAND"; 101 } 102 if (doit) { 103 i = fs->fs_contigsumsize; 104 fs->fs_contigsumsize = 105 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 106 if (CGSIZE(fs) > fs->fs_bsize) { 107 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 108 fs->fs_contigsumsize = i; 109 } else if (preen || 110 reply("CREATE CLUSTER MAPS")) { 111 if (preen) 112 pwarn("%sING CLUSTER MAPS\n", 113 doit); 114 fs->fs_cgsize = 115 fragroundup(fs, CGSIZE(fs)); 116 cg = cgrp = 117 realloc(cgrp, fs->fs_cgsize); 118 if (cg == NULL) 119 errx(EEXIT, 120 "cannot reallocate cg space"); 121 doinglevel1 = 1; 122 sbdirty(); 123 } 124 } 125 } 126 } 127 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 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 newcg->cg_clustersumoff = 152 roundup(newcg->cg_clustersumoff, sizeof(u_int32_t)); 153 newcg->cg_clusteroff = newcg->cg_clustersumoff + 154 (fs->fs_contigsumsize + 1) * sizeof(u_int32_t); 155 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 156 howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT); 157 } 158 newcg->cg_magic = CG_MAGIC; 159 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 160 memset(&idesc[0], 0, sizeof idesc); 161 for (i = 0; i < 4; i++) { 162 idesc[i].id_type = ADDR; 163 if (!is_ufs2 && doinglevel2) 164 idesc[i].id_fix = FIX; 165 } 166 memset(&cstotal, 0, sizeof(struct csum_total)); 167 dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1); 168 for (d = fs->fs_size; d < dmax; d++) 169 setbmap(d); 170 for (c = 0; c < fs->fs_ncg; c++) { 171 if (got_siginfo) { 172 fprintf(stderr, 173 "%s: phase 5: cyl group %d of %d (%d%%)\n", 174 cdevname(), c, fs->fs_ncg, 175 c * 100 / fs->fs_ncg); 176 got_siginfo = 0; 177 } 178 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 179 memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize); 180 if((doswap && !needswap) || (!doswap && needswap)) 181 ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock); 182 if (!cg_chkmagic(cg, 0)) 183 pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c); 184 if(doswap) 185 cgdirty(); 186 /* 187 * While we have the disk head where we want it, 188 * write back the superblock to the spare at this 189 * cylinder group. 190 */ 191 if ((cvtlevel && sblk.b_dirty) || doswap) { 192 bwrite(fswritefd, sblk.b_un.b_buf, 193 fsbtodb(sblock, cgsblock(sblock, c)), 194 sblock->fs_sbsize); 195 } else { 196 /* 197 * Read in the current alternate superblock, 198 * and compare it to the master. If it's 199 * wrong, fix it up. 200 */ 201 getblk(&asblk, cgsblock(sblock, c), sblock->fs_sbsize); 202 if (asblk.b_errs) 203 pfatal("CG %d: UNABLE TO READ ALTERNATE " 204 "SUPERBLK\n", c); 205 else { 206 memmove(altsblock, asblk.b_un.b_fs, 207 sblock->fs_sbsize); 208 if (needswap) 209 ffs_sb_swap(asblk.b_un.b_fs, altsblock); 210 } 211 if ((asblk.b_errs || cmpsblks(sblock, altsblock)) && 212 dofix(&idesc[3], 213 "ALTERNATE SUPERBLK(S) ARE INCORRECT")) { 214 bwrite(fswritefd, sblk.b_un.b_buf, 215 fsbtodb(sblock, cgsblock(sblock, c)), 216 sblock->fs_sbsize); 217 } 218 } 219 dbase = cgbase(fs, c); 220 dmax = dbase + fs->fs_fpg; 221 if (dmax > fs->fs_size) 222 dmax = fs->fs_size; 223 newcg->cg_time = cg->cg_time; 224 newcg->cg_old_time = cg->cg_old_time; 225 newcg->cg_cgx = c; 226 newcg->cg_ndblk = dmax - dbase; 227 if (!is_ufs2) { 228 if (c == fs->fs_ncg - 1) 229 newcg->cg_old_ncyl = howmany(newcg->cg_ndblk, 230 fs->fs_fpg / fs->fs_old_cpg); 231 else 232 newcg->cg_old_ncyl = fs->fs_old_cpg; 233 newcg->cg_old_niblk = fs->fs_ipg; 234 newcg->cg_niblk = 0; 235 } 236 if (fs->fs_contigsumsize > 0) 237 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 238 newcg->cg_cs.cs_ndir = 0; 239 newcg->cg_cs.cs_nffree = 0; 240 newcg->cg_cs.cs_nbfree = 0; 241 newcg->cg_cs.cs_nifree = fs->fs_ipg; 242 if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk) 243 newcg->cg_rotor = cg->cg_rotor; 244 else 245 newcg->cg_rotor = 0; 246 if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk) 247 newcg->cg_frotor = cg->cg_frotor; 248 else 249 newcg->cg_frotor = 0; 250 if (cg->cg_irotor >= 0 && cg->cg_irotor < newcg->cg_niblk) 251 newcg->cg_irotor = cg->cg_irotor; 252 else 253 newcg->cg_irotor = 0; 254 if (!is_ufs2) { 255 newcg->cg_initediblk = 0; 256 } else { 257 if ((unsigned)cg->cg_initediblk > fs->fs_ipg) 258 newcg->cg_initediblk = fs->fs_ipg; 259 else 260 newcg->cg_initediblk = cg->cg_initediblk; 261 } 262 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 263 memset(cg_inosused(newcg, 0), 0, (size_t)(mapsize)); 264 j = fs->fs_ipg * c; 265 for (i = 0; i < fs->fs_ipg; j++, i++) { 266 info = inoinfo(j); 267 switch (info->ino_state) { 268 269 case USTATE: 270 break; 271 272 case DSTATE: 273 case DCLEAR: 274 case DFOUND: 275 newcg->cg_cs.cs_ndir++; 276 /* fall through */ 277 278 case FSTATE: 279 case FCLEAR: 280 newcg->cg_cs.cs_nifree--; 281 setbit(cg_inosused(newcg, 0), i); 282 break; 283 284 default: 285 if (j < ROOTINO) 286 break; 287 errx(EEXIT, "BAD STATE %d FOR INODE I=%ld", 288 info->ino_state, (long)j); 289 } 290 } 291 if (c == 0) 292 for (i = 0; i < ROOTINO; i++) { 293 setbit(cg_inosused(newcg, 0), i); 294 newcg->cg_cs.cs_nifree--; 295 } 296 for (i = 0, d = dbase; 297 d < dmax; 298 d += fs->fs_frag, i += fs->fs_frag) { 299 frags = 0; 300 for (j = 0; j < fs->fs_frag; j++) { 301 if (testbmap(d + j)) 302 continue; 303 setbit(cg_blksfree(newcg, 0), i + j); 304 frags++; 305 } 306 if (frags == fs->fs_frag) { 307 newcg->cg_cs.cs_nbfree++; 308 if (fs->fs_contigsumsize > 0) 309 setbit(cg_clustersfree(newcg, 0), 310 fragstoblks(fs, i)); 311 } else if (frags > 0) { 312 newcg->cg_cs.cs_nffree += frags; 313 blk = blkmap(fs, cg_blksfree(newcg, 0), i); 314 ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0); 315 } 316 } 317 if (fs->fs_contigsumsize > 0) { 318 int32_t *sump = cg_clustersum(newcg, 0); 319 u_char *mapp = cg_clustersfree(newcg, 0); 320 int map = *mapp++; 321 int bit = 1; 322 int run = 0; 323 324 for (i = 0; i < newcg->cg_nclusterblks; i++) { 325 if ((map & bit) != 0) { 326 run++; 327 } else if (run != 0) { 328 if (run > fs->fs_contigsumsize) 329 run = fs->fs_contigsumsize; 330 sump[run]++; 331 run = 0; 332 } 333 if ((i & (NBBY - 1)) != (NBBY - 1)) { 334 bit <<= 1; 335 } else { 336 map = *mapp++; 337 bit = 1; 338 } 339 } 340 if (run != 0) { 341 if (run > fs->fs_contigsumsize) 342 run = fs->fs_contigsumsize; 343 sump[run]++; 344 } 345 } 346 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 347 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 348 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 349 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 350 cs = &fs->fs_cs(fs, c); 351 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) { 352 if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 353 memmove(cs, &newcg->cg_cs, sizeof *cs); 354 sbdirty(); 355 } else 356 markclean = 0; 357 } 358 if (doinglevel1) { 359 memmove(cg, newcg, (size_t)fs->fs_cgsize); 360 cgdirty(); 361 continue; 362 } 363 if (memcmp(newcg, cg, basesize) != 0) { 364 if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 365 memmove(cg, newcg, (size_t)basesize); 366 cgdirty(); 367 } else 368 markclean = 0; 369 } 370 if (usedsoftdep) { 371 for (i = 0; i < inomapsize; i++) { 372 j = cg_inosused(newcg, 0)[i]; 373 if ((cg_inosused(cg, 0)[i] & j) == j) 374 continue; 375 for (k = 0; k < NBBY; k++) { 376 if ((j & (1 << k)) == 0) 377 continue; 378 if (cg_inosused(cg, 0)[i] & (1 << k)) 379 continue; 380 pwarn("ALLOCATED INODE %ld " 381 "MARKED FREE\n", 382 c * fs->fs_ipg + i * 8 + k); 383 } 384 } 385 for (i = 0; i < blkmapsize; i++) { 386 j = cg_blksfree(cg, 0)[i]; 387 if ((cg_blksfree(newcg, 0)[i] & j) == j) 388 continue; 389 for (k = 0; k < NBBY; k++) { 390 if ((j & (1 << k)) == 0) 391 continue; 392 if (cg_inosused(cg, 0)[i] & (1 << k)) 393 continue; 394 pwarn("ALLOCATED FRAG %ld " 395 "MARKED FREE\n", 396 c * fs->fs_fpg + i * 8 + k); 397 } 398 } 399 } 400 if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize) 401 != 0 && dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 402 memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0), 403 (size_t)mapsize); 404 cgdirty(); 405 } 406 } 407 if (memcmp(&cstotal, &fs->fs_cstotal, sizeof cstotal) != 0) { 408 if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 409 memmove(&fs->fs_cstotal, &cstotal, sizeof *cs); 410 fs->fs_ronly = 0; 411 fs->fs_fmod = 0; 412 sbdirty(); 413 } else 414 markclean = 0; 415 } 416 } 417 418 void 419 print_bmap(map, size) 420 u_char *map; 421 u_int32_t size; 422 { 423 int i, j; 424 425 i = 0; 426 while (i < size) { 427 printf("%u: ",i); 428 for (j = 0; j < 16; j++, i++) 429 printf("%2x ", (u_int)map[i] & 0xff); 430 printf("\n"); 431 } 432 } 433
Indexes created Wed Oct 01 07:09:59 GMT 2025