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