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