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.12 (Berkeley) 06/01/90"; 10 #endif /* not lint */ 11 12 #include <sys/param.h> 13 #include <ufs/dinode.h> 14 #include <ufs/fs.h> 15 #include "fsck.h" 16 17 pass5() 18 { 19 int c, blk, frags, basesize, sumsize, mapsize, savednrpos; 20 register struct fs *fs = &sblock; 21 register struct cg *cg = &cgrp; 22 daddr_t dbase, dmax; 23 register daddr_t d; 24 register long i, j; 25 struct csum *cs; 26 time_t now; 27 struct csum cstotal; 28 struct inodesc idesc[3]; 29 char buf[MAXBSIZE]; 30 register struct cg *newcg = (struct cg *)buf; 31 struct ocg *ocg = (struct ocg *)buf; 32 33 bzero((char *)newcg, (int)fs->fs_cgsize); 34 newcg->cg_niblk = fs->fs_ipg; 35 switch ((int)fs->fs_postblformat) { 36 37 case FS_42POSTBLFMT: 38 basesize = (char *)(&ocg->cg_btot[0]) - (char *)(&ocg->cg_link); 39 sumsize = &ocg->cg_iused[0] - (char *)(&ocg->cg_btot[0]); 40 mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] - 41 (u_char *)&ocg->cg_iused[0]; 42 ocg->cg_magic = CG_MAGIC; 43 savednrpos = fs->fs_nrpos; 44 fs->fs_nrpos = 8; 45 break; 46 47 case FS_DYNAMICPOSTBLFMT: 48 newcg->cg_btotoff = 49 &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 50 newcg->cg_boff = 51 newcg->cg_btotoff + fs->fs_cpg * sizeof(long); 52 newcg->cg_iusedoff = newcg->cg_boff + 53 fs->fs_cpg * fs->fs_nrpos * sizeof(short); 54 newcg->cg_freeoff = 55 newcg->cg_iusedoff + howmany(fs->fs_ipg, NBBY); 56 newcg->cg_nextfreeoff = newcg->cg_freeoff + 57 howmany(fs->fs_cpg * fs->fs_spc / NSPF(fs), 58 NBBY); 59 newcg->cg_magic = CG_MAGIC; 60 basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_link); 61 sumsize = newcg->cg_iusedoff - newcg->cg_btotoff; 62 mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff; 63 break; 64 65 default: 66 errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d\n", 67 fs->fs_postblformat); 68 } 69 bzero((char *)&idesc[0], sizeof idesc); 70 for (i = 0; i < 3; i++) 71 idesc[i].id_type = ADDR; 72 bzero((char *)&cstotal, sizeof(struct csum)); 73 (void)time(&now); 74 j = blknum(fs, fs->fs_size + fs->fs_frag - 1); 75 for (i = fs->fs_size; i < j; i++) 76 setbmap(i); 77 for (c = 0; c < fs->fs_ncg; c++) { 78 getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize); 79 if (!cg_chkmagic(cg)) 80 pfatal("CG %d: BAD MAGIC NUMBER\n", c); 81 dbase = cgbase(fs, c); 82 dmax = dbase + fs->fs_fpg; 83 if (dmax > fs->fs_size) 84 dmax = fs->fs_size; 85 if (now > cg->cg_time) 86 newcg->cg_time = cg->cg_time; 87 else 88 newcg->cg_time = now; 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], sumsize + mapsize); 113 if (fs->fs_postblformat == FS_42POSTBLFMT) 114 ocg->cg_magic = CG_MAGIC; 115 j = fs->fs_ipg * c; 116 for (i = 0; i < fs->fs_ipg; j++, i++) { 117 switch (statemap[j]) { 118 119 case USTATE: 120 break; 121 122 case DSTATE: 123 case DCLEAR: 124 case DFOUND: 125 newcg->cg_cs.cs_ndir++; 126 /* fall through */ 127 128 case FSTATE: 129 case FCLEAR: 130 newcg->cg_cs.cs_nifree--; 131 setbit(cg_inosused(newcg), i); 132 break; 133 134 default: 135 if (j < ROOTINO) 136 break; 137 errexit("BAD STATE %d FOR INODE I=%d", 138 statemap[j], j); 139 } 140 } 141 if (c == 0) 142 for (i = 0; i < ROOTINO; i++) { 143 setbit(cg_inosused(newcg), i); 144 newcg->cg_cs.cs_nifree--; 145 } 146 for (i = 0, d = dbase; 147 d < dmax; 148 d += fs->fs_frag, i += fs->fs_frag) { 149 frags = 0; 150 for (j = 0; j < fs->fs_frag; j++) { 151 if (testbmap(d + j)) 152 continue; 153 setbit(cg_blksfree(newcg), i + j); 154 frags++; 155 } 156 if (frags == fs->fs_frag) { 157 newcg->cg_cs.cs_nbfree++; 158 j = cbtocylno(fs, i); 159 cg_blktot(newcg)[j]++; 160 cg_blks(fs, newcg, j)[cbtorpos(fs, i)]++; 161 } else if (frags > 0) { 162 newcg->cg_cs.cs_nffree += frags; 163 blk = blkmap(fs, cg_blksfree(newcg), i); 164 fragacct(fs, blk, newcg->cg_frsum, 1); 165 } 166 } 167 cstotal.cs_nffree += newcg->cg_cs.cs_nffree; 168 cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree; 169 cstotal.cs_nifree += newcg->cg_cs.cs_nifree; 170 cstotal.cs_ndir += newcg->cg_cs.cs_ndir; 171 cs = &fs->fs_cs(fs, c); 172 if (bcmp((char *)&newcg->cg_cs, (char *)cs, sizeof *cs) != 0 && 173 dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 174 bcopy((char *)&newcg->cg_cs, (char *)cs, sizeof *cs); 175 sbdirty(); 176 } 177 if (cvtflag) { 178 bcopy((char *)newcg, (char *)cg, (int)fs->fs_cgsize); 179 cgdirty(); 180 continue; 181 } 182 if (bcmp(cg_inosused(newcg), 183 cg_inosused(cg), mapsize) != 0 && 184 dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) { 185 bcopy(cg_inosused(newcg), cg_inosused(cg), mapsize); 186 cgdirty(); 187 } 188 if ((bcmp((char *)newcg, (char *)cg, basesize) != 0 || 189 bcmp((char *)&cg_blktot(newcg)[0], 190 (char *)&cg_blktot(cg)[0], sumsize) != 0) && 191 dofix(&idesc[2], "SUMMARY INFORMATION BAD")) { 192 bcopy((char *)newcg, (char *)cg, basesize); 193 bcopy((char *)&cg_blktot(newcg)[0], 194 (char *)&cg_blktot(cg)[0], sumsize); 195 cgdirty(); 196 } 197 } 198 if (fs->fs_postblformat == FS_42POSTBLFMT) 199 fs->fs_nrpos = savednrpos; 200 if (bcmp((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs) != 0 201 && dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) { 202 bcopy((char *)&cstotal, (char *)&fs->fs_cstotal, sizeof *cs); 203 fs->fs_ronly = 0; 204 fs->fs_fmod = 0; 205 sbdirty(); 206 } 207 } 208