pass5.c revision 1.6 1 1.6 mycroft /* $NetBSD: pass5.c,v 1.6 1998/07/28 19:22:54 mycroft Exp $ */
2 1.1 bouyer
3 1.1 bouyer /*
4 1.1 bouyer * Copyright (c) 1997 Manuel Bouyer.
5 1.1 bouyer * Copyright (c) 1980, 1986, 1993
6 1.1 bouyer * The Regents of the University of California. All rights reserved.
7 1.1 bouyer *
8 1.1 bouyer * Redistribution and use in source and binary forms, with or without
9 1.1 bouyer * modification, are permitted provided that the following conditions
10 1.1 bouyer * are met:
11 1.1 bouyer * 1. Redistributions of source code must retain the above copyright
12 1.1 bouyer * notice, this list of conditions and the following disclaimer.
13 1.1 bouyer * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 bouyer * notice, this list of conditions and the following disclaimer in the
15 1.1 bouyer * documentation and/or other materials provided with the distribution.
16 1.1 bouyer * 3. All advertising materials mentioning features or use of this software
17 1.1 bouyer * must display the following acknowledgement:
18 1.1 bouyer * This product includes software developed by the University of
19 1.1 bouyer * California, Berkeley and its contributors.
20 1.1 bouyer * 4. Neither the name of the University nor the names of its contributors
21 1.1 bouyer * may be used to endorse or promote products derived from this software
22 1.1 bouyer * without specific prior written permission.
23 1.1 bouyer *
24 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 bouyer * SUCH DAMAGE.
35 1.1 bouyer */
36 1.1 bouyer
37 1.3 lukem #include <sys/cdefs.h>
38 1.1 bouyer #ifndef lint
39 1.1 bouyer #if 0
40 1.1 bouyer static char sccsid[] = "@(#)pass5.c 8.6 (Berkeley) 11/30/94";
41 1.1 bouyer #else
42 1.6 mycroft __RCSID("$NetBSD: pass5.c,v 1.6 1998/07/28 19:22:54 mycroft Exp $");
43 1.1 bouyer #endif
44 1.1 bouyer #endif /* not lint */
45 1.1 bouyer
46 1.1 bouyer #include <sys/param.h>
47 1.1 bouyer #include <sys/time.h>
48 1.5 fvdl #include <ufs/ufs/dinode.h>
49 1.1 bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
50 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
51 1.1 bouyer #include <ufs/ext2fs/ext2fs_extern.h>
52 1.1 bouyer #include <string.h>
53 1.1 bouyer #include <malloc.h>
54 1.1 bouyer #include <stdio.h>
55 1.1 bouyer
56 1.1 bouyer #include "fsutil.h"
57 1.1 bouyer #include "fsck.h"
58 1.1 bouyer #include "extern.h"
59 1.1 bouyer
60 1.1 bouyer
61 1.1 bouyer void print_bmap __P((u_char *,u_int32_t));
62 1.1 bouyer
63 1.1 bouyer void
64 1.1 bouyer pass5()
65 1.1 bouyer {
66 1.3 lukem int c;
67 1.3 lukem struct m_ext2fs *fs = &sblock;
68 1.1 bouyer daddr_t dbase, dmax;
69 1.3 lukem daddr_t d;
70 1.3 lukem long i, j;
71 1.1 bouyer struct inodesc idesc[3];
72 1.1 bouyer struct bufarea *ino_bitmap = NULL, *blk_bitmap = NULL;
73 1.1 bouyer char *ibmap, *bbmap;
74 1.1 bouyer u_int32_t cs_ndir, cs_nbfree, cs_nifree;
75 1.1 bouyer char msg[255];
76 1.1 bouyer
77 1.1 bouyer cs_ndir = 0;
78 1.1 bouyer cs_nbfree = 0;
79 1.1 bouyer cs_nifree = 0;
80 1.1 bouyer
81 1.1 bouyer ibmap = malloc(fs->e2fs_bsize);
82 1.1 bouyer bbmap = malloc(fs->e2fs_bsize);
83 1.1 bouyer if (ibmap == NULL || bbmap == NULL) {
84 1.1 bouyer errexit("out of memory\n");
85 1.1 bouyer }
86 1.1 bouyer
87 1.1 bouyer for (c = 0; c < fs->e2fs_ncg; c++) {
88 1.1 bouyer u_int32_t nbfree = 0;
89 1.1 bouyer u_int32_t nifree = 0;
90 1.1 bouyer u_int32_t ndirs = 0;
91 1.1 bouyer
92 1.1 bouyer nbfree = 0;
93 1.1 bouyer nifree = fs->e2fs.e2fs_ipg;
94 1.1 bouyer ndirs = 0;
95 1.1 bouyer
96 1.1 bouyer if (blk_bitmap == NULL) {
97 1.4 bouyer blk_bitmap = getdatablk(fs2h32(fs->e2fs_gd[c].ext2bgd_b_bitmap),
98 1.1 bouyer fs->e2fs_bsize);
99 1.1 bouyer } else {
100 1.4 bouyer getblk(blk_bitmap, fs2h32(fs->e2fs_gd[c].ext2bgd_b_bitmap),
101 1.1 bouyer fs->e2fs_bsize);
102 1.1 bouyer }
103 1.1 bouyer if (ino_bitmap == NULL) {
104 1.4 bouyer ino_bitmap = getdatablk(fs2h32(fs->e2fs_gd[c].ext2bgd_i_bitmap),
105 1.1 bouyer fs->e2fs_bsize);
106 1.1 bouyer } else {
107 1.4 bouyer getblk(ino_bitmap, fs2h32(fs->e2fs_gd[c].ext2bgd_i_bitmap),
108 1.1 bouyer fs->e2fs_bsize);
109 1.1 bouyer }
110 1.1 bouyer memset(bbmap, 0, fs->e2fs_bsize);
111 1.1 bouyer memset(ibmap, 0, fs->e2fs_bsize);
112 1.1 bouyer memset(&idesc[0], 0, sizeof idesc);
113 1.1 bouyer for (i = 0; i < 3; i++) {
114 1.1 bouyer idesc[i].id_type = ADDR;
115 1.1 bouyer }
116 1.1 bouyer
117 1.1 bouyer j = fs->e2fs.e2fs_ipg * c + 1;
118 1.1 bouyer
119 1.1 bouyer for (i = 0; i < fs->e2fs.e2fs_ipg; j++, i++) {
120 1.1 bouyer if ((j < EXT2_FIRSTINO) && (j != EXT2_ROOTINO)) {
121 1.1 bouyer setbit(ibmap, i);
122 1.1 bouyer nifree--;
123 1.1 bouyer continue;
124 1.1 bouyer }
125 1.1 bouyer if (j > fs->e2fs.e2fs_icount) {
126 1.1 bouyer setbit(ibmap, i);
127 1.1 bouyer continue;
128 1.1 bouyer }
129 1.1 bouyer switch (statemap[j]) {
130 1.1 bouyer
131 1.1 bouyer case USTATE:
132 1.1 bouyer break;
133 1.1 bouyer
134 1.1 bouyer case DSTATE:
135 1.1 bouyer case DCLEAR:
136 1.1 bouyer case DFOUND:
137 1.1 bouyer ndirs++;
138 1.1 bouyer /* fall through */
139 1.1 bouyer
140 1.1 bouyer case FSTATE:
141 1.1 bouyer case FCLEAR:
142 1.1 bouyer nifree--;
143 1.1 bouyer setbit(ibmap, i);
144 1.1 bouyer break;
145 1.1 bouyer
146 1.1 bouyer default:
147 1.2 mikel errexit("BAD STATE %d FOR INODE I=%ld\n",
148 1.1 bouyer statemap[j], j);
149 1.1 bouyer }
150 1.1 bouyer }
151 1.1 bouyer
152 1.1 bouyer /* fill in unused par of the inode map */
153 1.1 bouyer for (i = fs->e2fs.e2fs_ipg / NBBY; i < fs->e2fs_bsize; i++)
154 1.1 bouyer ibmap[i] = 0xff;
155 1.1 bouyer
156 1.1 bouyer dbase = c * sblock.e2fs.e2fs_bpg + sblock.e2fs.e2fs_first_dblock +
157 1.1 bouyer cgoverhead;
158 1.1 bouyer dmax = (c+1) * sblock.e2fs.e2fs_bpg + sblock.e2fs.e2fs_first_dblock;
159 1.1 bouyer
160 1.1 bouyer for (i = 0; i < cgoverhead; i++)
161 1.1 bouyer setbit(bbmap, i); /* blks allocated to fs metadata */
162 1.1 bouyer for (i = cgoverhead, d = dbase;
163 1.1 bouyer d < dmax;
164 1.1 bouyer d ++, i ++) {
165 1.1 bouyer if (testbmap(d) || d >= sblock.e2fs.e2fs_bcount) {
166 1.1 bouyer setbit(bbmap, i);
167 1.1 bouyer continue;
168 1.1 bouyer } else {
169 1.1 bouyer nbfree++;
170 1.1 bouyer }
171 1.1 bouyer
172 1.1 bouyer }
173 1.1 bouyer cs_nbfree += nbfree;
174 1.1 bouyer cs_nifree += nifree;
175 1.1 bouyer cs_ndir += ndirs;
176 1.1 bouyer
177 1.4 bouyer if (debug && (fs2h16(fs->e2fs_gd[c].ext2bgd_nbfree) != nbfree ||
178 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_nifree) != nifree ||
179 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_ndirs) != ndirs)) {
180 1.1 bouyer printf("summary info for cg %d is %d, %d, %d,"
181 1.1 bouyer "should be %d, %d, %d\n", c,
182 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_nbfree),
183 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_nifree),
184 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_ndirs),
185 1.1 bouyer nbfree,
186 1.1 bouyer nifree,
187 1.1 bouyer ndirs);
188 1.1 bouyer }
189 1.6 mycroft (void)snprintf(msg, sizeof(msg),
190 1.6 mycroft "SUMMARY INFORMATIONS WRONG FOR CG #%d", c);
191 1.4 bouyer if ((fs2h16(fs->e2fs_gd[c].ext2bgd_nbfree) != nbfree ||
192 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_nifree) != nifree ||
193 1.4 bouyer fs2h16(fs->e2fs_gd[c].ext2bgd_ndirs) != ndirs) &&
194 1.1 bouyer dofix(&idesc[0], msg)) {
195 1.4 bouyer fs->e2fs_gd[c].ext2bgd_nbfree = h2fs16(nbfree);
196 1.4 bouyer fs->e2fs_gd[c].ext2bgd_nifree = h2fs16(nifree);
197 1.4 bouyer fs->e2fs_gd[c].ext2bgd_ndirs = h2fs16(ndirs);
198 1.1 bouyer sbdirty();
199 1.1 bouyer }
200 1.1 bouyer
201 1.1 bouyer if (debug && memcmp(blk_bitmap->b_un.b_buf, bbmap, fs->e2fs_bsize)) {
202 1.1 bouyer printf("blk_bitmap:\n");
203 1.1 bouyer print_bmap(blk_bitmap->b_un.b_buf, fs->e2fs_bsize);
204 1.1 bouyer printf("bbmap:\n");
205 1.1 bouyer print_bmap(bbmap, fs->e2fs_bsize);
206 1.1 bouyer }
207 1.1 bouyer
208 1.6 mycroft (void)snprintf(msg, sizeof(msg),
209 1.6 mycroft "BLK(S) MISSING IN BIT MAPS #%d", c);
210 1.1 bouyer if (memcmp(blk_bitmap->b_un.b_buf, bbmap, fs->e2fs_bsize) &&
211 1.1 bouyer dofix(&idesc[1], msg)) {
212 1.1 bouyer memcpy(blk_bitmap->b_un.b_buf, bbmap, fs->e2fs_bsize);
213 1.1 bouyer dirty(blk_bitmap);
214 1.1 bouyer }
215 1.1 bouyer if (debug && memcmp(ino_bitmap->b_un.b_buf, ibmap, fs->e2fs_bsize)) {
216 1.1 bouyer printf("ino_bitmap:\n");
217 1.1 bouyer print_bmap(ino_bitmap->b_un.b_buf, fs->e2fs_bsize);
218 1.1 bouyer printf("ibmap:\n");
219 1.1 bouyer print_bmap(ibmap, fs->e2fs_bsize);
220 1.1 bouyer }
221 1.6 mycroft (void)snprintf(msg, sizeof(msg),
222 1.6 mycroft "INODE(S) MISSING IN BIT MAPS #%d", c);
223 1.1 bouyer if (memcmp(ino_bitmap->b_un.b_buf, ibmap, fs->e2fs_bsize) &&
224 1.1 bouyer dofix(&idesc[1], msg)) {
225 1.1 bouyer memcpy(ino_bitmap->b_un.b_buf, ibmap, fs->e2fs_bsize);
226 1.1 bouyer dirty(ino_bitmap);
227 1.1 bouyer }
228 1.1 bouyer
229 1.1 bouyer }
230 1.1 bouyer if (debug && (fs->e2fs.e2fs_fbcount != cs_nbfree ||
231 1.1 bouyer fs->e2fs.e2fs_ficount != cs_nifree)) {
232 1.1 bouyer printf("summary info bad in superblock: %d, %d should be %d, %d\n",
233 1.1 bouyer fs->e2fs.e2fs_fbcount, fs->e2fs.e2fs_ficount,
234 1.1 bouyer cs_nbfree, cs_nifree);
235 1.1 bouyer }
236 1.1 bouyer if ((fs->e2fs.e2fs_fbcount != cs_nbfree ||
237 1.1 bouyer fs->e2fs.e2fs_ficount != cs_nifree)
238 1.1 bouyer && dofix(&idesc[0], "SUPERBLK SUMMARY INFORMATION BAD")) {
239 1.1 bouyer fs->e2fs.e2fs_fbcount = cs_nbfree;
240 1.1 bouyer fs->e2fs.e2fs_ficount = cs_nifree;
241 1.1 bouyer sbdirty();
242 1.1 bouyer }
243 1.1 bouyer }
244 1.1 bouyer
245 1.1 bouyer void
246 1.1 bouyer print_bmap(map, size)
247 1.1 bouyer u_char *map;
248 1.1 bouyer u_int32_t size;
249 1.1 bouyer {
250 1.1 bouyer int i, j;
251 1.1 bouyer
252 1.1 bouyer i = 0;
253 1.1 bouyer while (i < size) {
254 1.1 bouyer printf("%u: ",i);
255 1.1 bouyer for (j = 0; j < 16; j++, i++)
256 1.3 lukem printf("%2x ", (u_int)map[i] & 0xff);
257 1.1 bouyer printf("\n");
258 1.1 bouyer }
259 1.1 bouyer }
260