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