1 /* 2 * Copyright (c) 1980, 1986 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 */ 7 8 #ifndef lint 9 static char sccsid[] = "@(#)pass5.c 5.15 (Berkeley) 11/11/91"; 10 #endif /* not lint */ 11 12 #include <sys/param.h> 13 #include <ufs/ufs/dinode.h> 14 #include <ufs/ffs/fs.h> 15 #include <string.h> 16 #include "fsck.h" 17 18 pass5() 19 { 20 int c, blk, frags, basesize, sumsize, mapsize, savednrpos; 21 register struct fs *fs = &sblock; 22 register struct cg *cg = &cgrp; 23 daddr_t dbase, dmax; 24 register daddr_t d; 25 register long i, j; 26 struct csum *cs; 27 time_t now; 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 bzero((char *)&cstotal, sizeof(struct csum)); 74 (void)time(&now); 75 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 76 for (i = fs->fs_size; i < j; i++) 77 setbmap(i); 78 for (c = 0; c < fs->fs_ncg; c++) { 79 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 80 if (!cg_chkmagic(cg)) 81 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 82 dbase = cgbase(fs, c); 83 dmax = dbase + fs->fs_fpg; 84 if (dmax > fs->fs_size) 85 dmax = fs->fs_size; 86 if (now > cg->cg_time) 87 newcg->cg_time = cg->cg_time; 88 else 89 newcg->cg_time = now; 90 newcg->cg_cgx = c; 91 if (c == fs->fs_ncg - 1) 92 newcg->cg_ncyl = fs->fs_ncyl % fs->fs_cpg; 93 else 94 newcg->cg_ncyl = fs->fs_cpg; 95 newcg->cg_ndblk = dmax - dbase; 96 newcg->cg_cs.cs_ndir = 0; 97 newcg->cg_cs.cs_nffree = 0; 98 newcg->cg_cs.cs_nbfree = 0; 99 newcg->cg_cs.cs_nifree = fs->fs_ipg; 100 if (cg->cg_rotor < newcg->cg_ndblk) 101 newcg->cg_rotor = cg->cg_rotor; 102 else 103 newcg->cg_rotor = 0; 104 if (cg->cg_frotor < newcg->cg_ndblk) 105 newcg->cg_frotor = cg->cg_frotor; 106 else 107 newcg->cg_frotor = 0; 108 if (cg->cg_irotor < newcg->cg_niblk) 109 newcg->cg_irotor = cg->cg_irotor; 110 else 111 newcg->cg_irotor = 0; 112 bzero((char *)&newcg->cg_frsum[0], sizeof newcg->cg_frsum); 113 bzero((char *)&cg_blktot(newcg)[0], 114 (size_t)(sumsize + mapsize)); 115 if (fs->fs_postblformat == FS_42POSTBLFMT) 116 ocg->cg_magic = CG_MAGIC; 117 j = fs->fs_ipg * c; 118 for (i = 0; i < fs->fs_ipg; j++, i++) { 119 switch (statemap[j]) { 120 121 case USTATE: 122 break; 123 124 case DSTATE: 125 case DCLEAR: 126 case DFOUND: 127 newcg->cg_cs.cs_ndir++; 128 /* fall through */ 129 130 case FSTATE: 131 case FCLEAR: 132 newcg->cg_cs.cs_nifree--; 133 setbit(cg_inosused(newcg), i); 134 break; 135 136 default: 137 if (j < ROOTINO) 138 break; 139 errexit("BAD STATE %d FOR INODE I=%d", 140 statemap[j], j); 141 } 142 } 143 if (c == 0) 144 for (i = 0; i < ROOTINO; i++) { 145 setbit(cg_inosused(newcg), i); 146 newcg->cg_cs.cs_nifree--; 147 } 148 for (i = 0, d = dbase; 149 d < dmax; 150 d += fs->fs_frag, i += fs->fs_frag) { 151 frags = 0; 152 for (j = 0; j < fs->fs_frag; j++) { 153 if (testbmap(d + j)) 154 continue; 155 setbit(cg_blksfree(newcg), i + j); 156 frags++; 157 } 158 if (frags == fs->fs_frag) { 159 newcg->cg_cs.cs_nbfree++; 160 j = cbtocylno(fs, i); 161 cg_blktot(newcg)[j]++; 162 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 163 } else if (frags > 0) { 164 newcg->cg_cs.cs_nffree += frags; 165 blk = blkmap(fs, cg_blksfree(newcg), i); 166 ffs_fragacct(fs, blk, newcg->cg_frsum, 1); 167 } 168 } 169 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 170 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 171 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 172 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 173 cs = &fs->fs_cs(fs, c); 174 if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 && 175 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 176 bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs); 177 sbdirty(); 178 } 179 if (cvtflag) { 180 bcopy((char *)newcg, (char *)cg, (size_t)fs->fs_cgsize); 181 cgdirty(); 182 continue; 183 } 184 if (bcmp(cg_inosused(newcg), 185 cg_inosused(cg), mapsize) != 0 && 186 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 187 bcopy(cg_inosused(newcg), cg_inosused(cg), 188 (size_t)mapsize); 189 cgdirty(); 190 } 191 if ((bcmp((char *)newcg, (char *)cg, basesize) != 0 || 192 bcmp((char *)&cg_blktot(newcg)[0], 193 (char *)&cg_blktot(cg)[0], sumsize) != 0) && 194 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 195 bcopy((char *)newcg, (char *)cg, (size_t)basesize); 196 bcopy((char *)&cg_blktot(newcg)[0], 197 (char *)&cg_blktot(cg)[0], (size_t)sumsize); 198 cgdirty(); 199 } 200 } 201 if (fs->fs_postblformat == FS_42POSTBLFMT) 202 fs->fs_nrpos = savednrpos; 203 if (bcmp((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs) != 0 204 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 205 bcopy((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs); 206 fs->fs_ronly = 0; 207 fs->fs_fmod = 0; 208 sbdirty(); 209 } 210 } 211