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