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