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.1 (Berkeley) 06/05/93"; 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 switch ((int)fs->fs_postblformat) { 37 38 case FS_42POSTBLFMT: 39 basesize = (char *)(&ocg->cg_btot[0]) - (char *)(&ocg->cg_link); 40 sumsize = &ocg->cg_iused[0] - (char *)(&ocg->cg_btot[0]); 41 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 42 (u_char *)&ocg->cg_iused[0]; 43 ocg->cg_magic = CG_MAGIC; 44 savednrpos = fs->fs_nrpos; 45 fs->fs_nrpos = 8; 46 break; 47 48 case FS_DYNAMICPOSTBLFMT: 49 newcg->cg_btotoff = 50 &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 51 newcg->cg_boff = 52 newcg->cg_btotoff + fs->fs_cpg * sizeof(long); 53 newcg->cg_iusedoff = newcg->cg_boff + 54 fs->fs_cpg * fs->fs_nrpos * sizeof(short); 55 newcg->cg_freeoff = 56 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 57 newcg->cg_nextfreeoff = newcg->cg_freeoff + 58 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), 59 NBBY); 60 newcg->cg_magic = CG_MAGIC; 61 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 62 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 63 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 64 break; 65 66 default: 67 errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n", 68 fs->fs_postblformat); 69 } 70 bzero((char *)&idesc[0], sizeof idesc); 71 for (i = 0; i < 3; i++) { 72 idesc[i].id_type = ADDR; 73 if (doinglevel2) 74 idesc[i].id_fix = FIX; 75 } 76 bzero((char *)&cstotal, sizeof(struct csum)); 77 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 78 for (i = fs->fs_size; i < j; i++) 79 setbmap(i); 80 for (c = 0; c < fs->fs_ncg; c++) { 81 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 82 if (!cg_chkmagic(cg)) 83 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 84 dbase = cgbase(fs, c); 85 dmax = dbase + fs->fs_fpg; 86 if (dmax > fs->fs_size) 87 dmax = fs->fs_size; 88 newcg->cg_time = cg->cg_time; 89 newcg->cg_cgx = c; 90 if (c == fs->fs_ncg - 1) 91 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 92 else 93 newcg->cg_ncyl = fs->fs_cpg; 94 newcg->cg_ndblk = dmax - dbase; 95 newcg->cg_cs.cs_ndir = 0; 96 newcg->cg_cs.cs_nffree = 0; 97 newcg->cg_cs.cs_nbfree = 0; 98 newcg->cg_cs.cs_nifree = fs->fs_ipg; 99 if (cg->cg_rotor < newcg->cg_ndblk) 100 newcg->cg_rotor = cg->cg_rotor; 101 else 102 newcg->cg_rotor = 0; 103 if (cg->cg_frotor < newcg->cg_ndblk) 104 newcg->cg_frotor = cg->cg_frotor; 105 else 106 newcg->cg_frotor = 0; 107 if (cg->cg_irotor < newcg->cg_niblk) 108 newcg->cg_irotor = cg->cg_irotor; 109 else 110 newcg->cg_irotor = 0; 111 bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum); 112 bzero((char *)&cg_blktot(newcg)[0], 113 (size_t)(sumsize + mapsize)); 114 if (fs->fs_postblformat == FS_42POSTBLFMT) 115 ocg->cg_magic = CG_MAGIC; 116 j = fs->fs_ipg * c; 117 for (i = 0; i < fs->fs_ipg; j++, i++) { 118 switch (statemap[j]) { 119 120 case USTATE: 121 break; 122 123 case DSTATE: 124 case DCLEAR: 125 case DFOUND: 126 newcg->cg_cs.cs_ndir++; 127 /* fall through */ 128 129 case FSTATE: 130 case FCLEAR: 131 newcg->cg_cs.cs_nifree--; 132 setbit(cg_inosused(newcg), i); 133 break; 134 135 default: 136 if (j < ROOTINO) 137 break; 138 errexit("BAD STATE %d FOR INODE I=%d", 139 statemap[j], j); 140 } 141 } 142 if (c == 0) 143 for (i = 0; i < ROOTINO; i++) { 144 setbit(cg_inosused(newcg), i); 145 newcg->cg_cs.cs_nifree--; 146 } 147 for (i = 0, d = dbase; 148 d < dmax; 149 d += fs->fs_frag, i += fs->fs_frag) { 150 frags = 0; 151 for (j = 0; j < fs->fs_frag; j++) { 152 if (testbmap(d + j)) 153 continue; 154 setbit(cg_blksfree(newcg), i + j); 155 frags++; 156 } 157 if (frags == fs->fs_frag) { 158 newcg->cg_cs.cs_nbfree++; 159 j = cbtocylno(fs, i); 160 cg_blktot(newcg)[j]++; 161 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 162 } else if (frags > 0) { 163 newcg->cg_cs.cs_nffree += frags; 164 blk = blkmap(fs, cg_blksfree(newcg), i); 165 ffs_fragacct(fs, blk, newcg->cg_frsum, 1); 166 } 167 } 168 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 169 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 170 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 171 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 172 cs = &fs->fs_cs(fs, c); 173 if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 && 174 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 175 bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs); 176 sbdirty(); 177 } 178 if (doinglevel1) { 179 bcopy((char *)newcg, (char *)cg, (size_t)fs->fs_cgsize); 180 cgdirty(); 181 continue; 182 } 183 if (bcmp(cg_inosused(newcg), 184 cg_inosused(cg), mapsize) != 0 && 185 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 186 bcopy(cg_inosused(newcg), cg_inosused(cg), 187 (size_t)mapsize); 188 cgdirty(); 189 } 190 if ((bcmp((char *)newcg, (char *)cg, basesize) != 0 || 191 bcmp((char *)&cg_blktot(newcg)[0], 192 (char *)&cg_blktot(cg)[0], sumsize) != 0) && 193 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 194 bcopy((char *)newcg, (char *)cg, (size_t)basesize); 195 bcopy((char *)&cg_blktot(newcg)[0], 196 (char *)&cg_blktot(cg)[0], (size_t)sumsize); 197 cgdirty(); 198 } 199 } 200 if (fs->fs_postblformat == FS_42POSTBLFMT) 201 fs->fs_nrpos = savednrpos; 202 if (bcmp((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs) != 0 203 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 204 bcopy((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs); 205 fs->fs_ronly = 0; 206 fs->fs_fmod = 0; 207 sbdirty(); 208 } 209 } 210