pass5.c revision 1.20.4.2
1 /* $NetBSD: pass5.c,v 1.20.4.2 1999/10/26 19:30:04 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.20.4.2 1999/10/26 19:30:04 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() 65 { 66 int c, blk, frags, basesize, sumsize, mapsize, savednrpos = 0; 67 int inomapsize, blkmapsize; 68 struct fs *fs = sblock; 69 ufs_daddr_t dbase, dmax; 70 ufs_daddr_t d; 71 long i, j; 72 struct csum *cs; 73 struct csum cstotal; 74 struct inodesc idesc[3]; 75 char buf[MAXBSIZE]; 76 struct cg *newcg = (struct cg *)buf; 77 struct ocg *ocg = (struct ocg *)buf; 78 struct cg *cg; 79 80 cg = cgrp = malloc(fs->fs_cgsize); 81 if (cg == NULL) 82 errx(EEXIT, "cannot allocate space for cylinder group"); 83 84 statemap[WINO] = USTATE; 85 memset(newcg, 0, (size_t)fs->fs_cgsize); 86 newcg->cg_niblk = fs->fs_ipg; 87 if (cvtlevel >= 3) { 88 if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) { 89 if (preen) 90 pwarn("DELETING CLUSTERING MAPS\n"); 91 if (preen || reply("DELETE CLUSTERING MAPS")) { 92 fs->fs_contigsumsize = 0; 93 doinglevel1 = 1; 94 sbdirty(); 95 } 96 } 97 if (fs->fs_maxcontig > 1) { 98 char *doit = 0; 99 100 if (fs->fs_contigsumsize < 1) { 101 doit = "CREAT"; 102 } else if (fs->fs_contigsumsize < fs->fs_maxcontig && 103 fs->fs_contigsumsize < FS_MAXCONTIG) { 104 doit = "EXPAND"; 105 } 106 if (doit) { 107 i = fs->fs_contigsumsize; 108 fs->fs_contigsumsize = 109 MIN(fs->fs_maxcontig, FS_MAXCONTIG); 110 if (CGSIZE(fs) > fs->fs_bsize) { 111 pwarn("CANNOT %s CLUSTER MAPS\n", doit); 112 fs->fs_contigsumsize = i; 113 } else if (preen || 114 reply("CREATE CLUSTER MAPS")) { 115 if (preen) 116 pwarn("%sING CLUSTER MAPS\n", 117 doit); 118 fs->fs_cgsize = 119 fragroundup(fs, CGSIZE(fs)); 120 doinglevel1 = 1; 121 sbdirty(); 122 } 123 } 124 } 125 } 126 switch ((int)fs->fs_postblformat) { 127 128 case FS_42POSTBLFMT: 129 basesize = (char *)(&ocg->cg_btot[0]) - 130 (char *)(&ocg->cg_firstfield); 131 sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]); 132 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 133 (u_char *)&ocg->cg_iused[0]; 134 blkmapsize = howmany(fs->fs_fpg, NBBY); 135 inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0]; 136 ocg->cg_magic = CG_MAGIC; 137 savednrpos = fs->fs_nrpos; 138 fs->fs_nrpos = 8; 139 break; 140 141 case FS_DYNAMICPOSTBLFMT: 142 newcg->cg_btotoff = 143 &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield); 144 newcg->cg_boff = 145 newcg->cg_btotoff + fs->fs_cpg * sizeof(int32_t); 146 newcg->cg_iusedoff = newcg->cg_boff + 147 fs->fs_cpg * fs->fs_nrpos * sizeof(int16_t); 148 newcg->cg_freeoff = 149 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 150 inomapsize = newcg->cg_freeoff - newcg->cg_iusedoff; 151 newcg->cg_nextfreeoff = newcg->cg_freeoff + 152 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), NBBY); 153 blkmapsize = newcg->cg_nextfreeoff - newcg->cg_freeoff; 154 if (fs->fs_contigsumsize > 0) { 155 newcg->cg_clustersumoff = newcg->cg_nextfreeoff - 156 sizeof(int32_t); 157 newcg->cg_clustersumoff = 158 roundup(newcg->cg_clustersumoff, sizeof(int32_t)); 159 newcg->cg_clusteroff = newcg->cg_clustersumoff + 160 (fs->fs_contigsumsize + 1) * sizeof(int32_t); 161 newcg->cg_nextfreeoff = newcg->cg_clusteroff + 162 howmany(fs->fs_cpg * fs->fs_spc / NSPB(fs), NBBY); 163 } 164 newcg->cg_magic = CG_MAGIC; 165 basesize = &newcg->cg_space[0] - 166 (u_char *)(&newcg->cg_firstfield); 167 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 168 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 169 break; 170 171 default: 172 inomapsize = blkmapsize = sumsize = 0; /* keep lint happy */ 173 errx(EEXIT, "UNKNOWN ROTATIONAL TABLE FORMAT %d", 174 fs->fs_postblformat); 175 } 176 memset(&idesc[0], 0, sizeof idesc); 177 for (i = 0; i < 3; i++) { 178 idesc[i].id_type = ADDR; 179 if (doinglevel2) 180 idesc[i].id_fix = FIX; 181 } 182 memset(&cstotal, 0, sizeof(struct csum)); 183 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 184 for (i = fs->fs_size; i < j; i++) 185 setbmap(i); 186 for (c = 0; c < fs->fs_ncg; c++) { 187 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 188 memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize); 189 if((doswap && !needswap) || (!doswap && needswap)) 190 swap_cg(cgblk.b_un.b_cg, cg); 191 if (!cg_chkmagic(cg, 0)) 192 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 193 if(doswap) 194 cgdirty(); 195 dbase = cgbase(fs, c); 196 dmax = dbase + fs->fs_fpg; 197 if (dmax > fs->fs_size) 198 dmax = fs->fs_size; 199 newcg->cg_time = cg->cg_time; 200 newcg->cg_cgx = c; 201 if (c == fs->fs_ncg - 1) 202 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 203 else 204 newcg->cg_ncyl = fs->fs_cpg; 205 newcg->cg_ndblk = dmax - dbase; 206 if (fs->fs_contigsumsize > 0) 207 newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag; 208 newcg->cg_cs.cs_ndir = 0; 209 newcg->cg_cs.cs_nffree = 0; 210 newcg->cg_cs.cs_nbfree = 0; 211 newcg->cg_cs.cs_nifree = fs->fs_ipg; 212 if (cg->cg_rotor < newcg->cg_ndblk) 213 newcg->cg_rotor = cg->cg_rotor; 214 else 215 newcg->cg_rotor = 0; 216 if (cg->cg_frotor < newcg->cg_ndblk) 217 newcg->cg_frotor = cg->cg_frotor; 218 else 219 newcg->cg_frotor = 0; 220 if (cg->cg_irotor < newcg->cg_niblk) 221 newcg->cg_irotor = cg->cg_irotor; 222 else 223 newcg->cg_irotor = 0; 224 memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum); 225 memset(&cg_blktot(newcg, 0)[0], 0, 226 (size_t)(sumsize + mapsize)); 227 if (fs->fs_postblformat == FS_42POSTBLFMT) 228 ocg->cg_magic = CG_MAGIC; 229 j = fs->fs_ipg * c; 230 for (i = 0; i < fs->fs_ipg; j++, i++) { 231 switch (statemap[j]) { 232 233 case USTATE: 234 break; 235 236 case DSTATE: 237 case DCLEAR: 238 case DFOUND: 239 newcg->cg_cs.cs_ndir++; 240 /* fall through */ 241 242 case FSTATE: 243 case FCLEAR: 244 newcg->cg_cs.cs_nifree--; 245 setbit(cg_inosused(newcg, 0), i); 246 break; 247 248 default: 249 if (j < ROOTINO) 250 break; 251 errx(EEXIT, "BAD STATE %d FOR INODE I=%ld", 252 statemap[j], (long)j); 253 } 254 } 255 if (c == 0) 256 for (i = 0; i < ROOTINO; i++) { 257 setbit(cg_inosused(newcg, 0), i); 258 newcg->cg_cs.cs_nifree--; 259 } 260 for (i = 0, d = dbase; 261 d < dmax; 262 d += fs->fs_frag, i += fs->fs_frag) { 263 frags = 0; 264 for (j = 0; j < fs->fs_frag; j++) { 265 if (testbmap(d + j)) 266 continue; 267 setbit(cg_blksfree(newcg, 0), i + j); 268 frags++; 269 } 270 if (frags == fs->fs_frag) { 271 newcg->cg_cs.cs_nbfree++; 272 j = cbtocylno(fs, i); 273 cg_blktot(newcg, 0)[j]++; 274 cg_blks(fs, newcg, j, 0)[cbtorpos(fs, i)]++; 275 if (fs->fs_contigsumsize > 0) 276 setbit(cg_clustersfree(newcg, 0), 277 i / fs->fs_frag); 278 } else if (frags > 0) { 279 newcg->cg_cs.cs_nffree += frags; 280 blk = blkmap(fs, cg_blksfree(newcg, 0), i); 281 ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0); 282 } 283 } 284 if (fs->fs_contigsumsize > 0) { 285 int32_t *sump = cg_clustersum(newcg, 0); 286 u_char *mapp = cg_clustersfree(newcg, 0); 287 int map = *mapp++; 288 int bit = 1; 289 int run = 0; 290 291 for (i = 0; i < newcg->cg_nclusterblks; i++) { 292 if ((map & bit) != 0) { 293 run++; 294 } else if (run != 0) { 295 if (run > fs->fs_contigsumsize) 296 run = fs->fs_contigsumsize; 297 sump[run]++; 298 run = 0; 299 } 300 if ((i & (NBBY - 1)) != (NBBY - 1)) { 301 bit <<= 1; 302 } else { 303 map = *mapp++; 304 bit = 1; 305 } 306 } 307 if (run != 0) { 308 if (run > fs->fs_contigsumsize) 309 run = fs->fs_contigsumsize; 310 sump[run]++; 311 } 312 } 313 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 314 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 315 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 316 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 317 cs = &fs->fs_cs(fs, c); 318 if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) { 319 if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 320 memmove(cs, &newcg->cg_cs, sizeof *cs); 321 sbdirty(); 322 } else 323 markclean = 0; 324 } 325 if (doinglevel1) { 326 memmove(cg, newcg, (size_t)fs->fs_cgsize); 327 cgdirty(); 328 continue; 329 } 330 if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize) != 0) { 331 if (debug) { 332 printf("newcg map:\n"); 333 print_bmap(cg_inosused(newcg, 0), mapsize); 334 printf("\ncg map:\n"); 335 print_bmap(cg_inosused(cg, 0), mapsize); 336 } 337 if (dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 338 memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0), 339 (size_t)mapsize); 340 cgdirty(); 341 } else 342 markclean = 0; 343 } 344 if (memcmp(newcg, cg, basesize) != 0 || 345 memcmp(&cg_blktot(newcg, 0)[0], 346 &cg_blktot(cg, 0)[0], sumsize) != 0) { 347 if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 348 memmove(cg, newcg, (size_t)basesize); 349 memmove(&cg_blktot(cg, 0)[0], 350 &cg_blktot(newcg, 0)[0], (size_t)sumsize); 351 cgdirty(); 352 } else markclean = 0; 353 } 354 355 } 356 if (fs->fs_postblformat == FS_42POSTBLFMT) 357 fs->fs_nrpos = savednrpos; 358 if (memcmp(&cstotal, &fs->fs_cstotal, sizeof *cs) != 0) { 359 if(dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 360 memmove(&fs->fs_cstotal, &cstotal, sizeof *cs); 361 fs->fs_ronly = 0; 362 fs->fs_fmod = 0; 363 sbdirty(); 364 } else 365 markclean = 0; 366 } 367 } 368 369 void 370 print_bmap(map, size) 371 u_char *map; 372 u_int32_t size; 373 { 374 int i, j; 375 376 i = 0; 377 while (i < size) { 378 printf("%u: ",i); 379 for (j = 0; j < 16; j++, i++) 380 printf("%2x ", (u_int)map[i] & 0xff); 381 printf("\n"); 382 } 383 } 384
Indexes created Thu Oct 23 22:10:10 GMT 2025