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