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