pass2.c revision 1.8 1 1.8 agc /* $NetBSD: pass2.c,v 1.8 2003/08/07 10:04:18 agc 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 * 3. All advertising materials mentioning features or use of this software
44 1.1 bouyer * must display the following acknowledgement:
45 1.1 bouyer * This product includes software developed by the University of
46 1.1 bouyer * California, Berkeley and its contributors.
47 1.1 bouyer * 4. Neither the name of the University nor the names of its contributors
48 1.1 bouyer * may be used to endorse or promote products derived from this software
49 1.1 bouyer * without specific prior written permission.
50 1.1 bouyer *
51 1.1 bouyer * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52 1.1 bouyer * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53 1.1 bouyer * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54 1.1 bouyer * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55 1.1 bouyer * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56 1.1 bouyer * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57 1.1 bouyer * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58 1.1 bouyer * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59 1.1 bouyer * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60 1.1 bouyer * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 1.1 bouyer * SUCH DAMAGE.
62 1.1 bouyer */
63 1.1 bouyer
64 1.2 lukem #include <sys/cdefs.h>
65 1.1 bouyer #ifndef lint
66 1.1 bouyer #if 0
67 1.1 bouyer static char sccsid[] = "@(#)pass2.c 8.6 (Berkeley) 10/27/94";
68 1.1 bouyer #else
69 1.8 agc __RCSID("$NetBSD: pass2.c,v 1.8 2003/08/07 10:04:18 agc Exp $");
70 1.1 bouyer #endif
71 1.1 bouyer #endif /* not lint */
72 1.1 bouyer
73 1.1 bouyer #include <sys/param.h>
74 1.1 bouyer #include <sys/time.h>
75 1.1 bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
76 1.1 bouyer #include <ufs/ext2fs/ext2fs_dir.h>
77 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
78 1.1 bouyer
79 1.1 bouyer #include <ufs/ufs/dinode.h> /* for IFMT & friends */
80 1.1 bouyer
81 1.1 bouyer #include <stdio.h>
82 1.1 bouyer #include <stdlib.h>
83 1.1 bouyer #include <string.h>
84 1.1 bouyer
85 1.1 bouyer #include "fsck.h"
86 1.1 bouyer #include "fsutil.h"
87 1.1 bouyer #include "extern.h"
88 1.1 bouyer
89 1.1 bouyer #define MINDIRSIZE (sizeof (struct ext2fs_dirtemplate))
90 1.1 bouyer
91 1.1 bouyer static int pass2check __P((struct inodesc *));
92 1.1 bouyer static int blksort __P((const void *, const void *));
93 1.1 bouyer
94 1.1 bouyer void
95 1.1 bouyer pass2()
96 1.1 bouyer {
97 1.2 lukem struct ext2fs_dinode *dp;
98 1.2 lukem struct inoinfo **inpp, *inp;
99 1.1 bouyer struct inoinfo **inpend;
100 1.1 bouyer struct inodesc curino;
101 1.1 bouyer struct ext2fs_dinode dino;
102 1.1 bouyer char pathbuf[MAXPATHLEN + 1];
103 1.1 bouyer
104 1.1 bouyer switch (statemap[EXT2_ROOTINO]) {
105 1.1 bouyer
106 1.1 bouyer case USTATE:
107 1.1 bouyer pfatal("ROOT INODE UNALLOCATED");
108 1.1 bouyer if (reply("ALLOCATE") == 0)
109 1.1 bouyer errexit("%s\n", "");
110 1.1 bouyer if (allocdir(EXT2_ROOTINO, EXT2_ROOTINO, 0755) != EXT2_ROOTINO)
111 1.1 bouyer errexit("CANNOT ALLOCATE ROOT INODE\n");
112 1.1 bouyer break;
113 1.1 bouyer
114 1.1 bouyer case DCLEAR:
115 1.1 bouyer pfatal("DUPS/BAD IN ROOT INODE");
116 1.1 bouyer if (reply("REALLOCATE")) {
117 1.1 bouyer freeino(EXT2_ROOTINO);
118 1.1 bouyer if (allocdir(EXT2_ROOTINO, EXT2_ROOTINO, 0755) != EXT2_ROOTINO)
119 1.1 bouyer errexit("CANNOT ALLOCATE ROOT INODE\n");
120 1.1 bouyer break;
121 1.1 bouyer }
122 1.1 bouyer if (reply("CONTINUE") == 0)
123 1.1 bouyer errexit("%s\n", "");
124 1.1 bouyer break;
125 1.1 bouyer
126 1.1 bouyer case FSTATE:
127 1.1 bouyer case FCLEAR:
128 1.1 bouyer pfatal("ROOT INODE NOT DIRECTORY");
129 1.1 bouyer if (reply("REALLOCATE")) {
130 1.1 bouyer freeino(EXT2_ROOTINO);
131 1.1 bouyer if (allocdir(EXT2_ROOTINO, EXT2_ROOTINO, 0755) != EXT2_ROOTINO)
132 1.1 bouyer errexit("CANNOT ALLOCATE ROOT INODE\n");
133 1.1 bouyer break;
134 1.1 bouyer }
135 1.1 bouyer if (reply("FIX") == 0)
136 1.1 bouyer errexit("%s\n", "");
137 1.1 bouyer dp = ginode(EXT2_ROOTINO);
138 1.4 bouyer dp->e2di_mode = h2fs16((fs2h16(dp->e2di_mode) & ~IFMT) | IFDIR);
139 1.1 bouyer inodirty();
140 1.1 bouyer break;
141 1.1 bouyer
142 1.1 bouyer case DSTATE:
143 1.1 bouyer break;
144 1.1 bouyer
145 1.1 bouyer default:
146 1.1 bouyer errexit("BAD STATE %d FOR ROOT INODE\n", statemap[EXT2_ROOTINO]);
147 1.1 bouyer }
148 1.1 bouyer
149 1.1 bouyer /*
150 1.1 bouyer * Sort the directory list into disk block order.
151 1.1 bouyer */
152 1.1 bouyer qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort);
153 1.1 bouyer /*
154 1.1 bouyer * Check the integrity of each directory.
155 1.1 bouyer */
156 1.1 bouyer memset(&curino, 0, sizeof(struct inodesc));
157 1.1 bouyer curino.id_type = DATA;
158 1.1 bouyer curino.id_func = pass2check;
159 1.1 bouyer inpend = &inpsort[inplast];
160 1.1 bouyer for (inpp = inpsort; inpp < inpend; inpp++) {
161 1.1 bouyer inp = *inpp;
162 1.1 bouyer if (inp->i_isize == 0)
163 1.1 bouyer continue;
164 1.1 bouyer if (inp->i_isize < MINDIRSIZE) {
165 1.1 bouyer direrror(inp->i_number, "DIRECTORY TOO SHORT");
166 1.1 bouyer inp->i_isize = roundup(MINDIRSIZE, sblock.e2fs_bsize);
167 1.1 bouyer if (reply("FIX") == 1) {
168 1.1 bouyer dp = ginode(inp->i_number);
169 1.4 bouyer dp->e2di_size = h2fs32(inp->i_isize);
170 1.1 bouyer inodirty();
171 1.1 bouyer }
172 1.1 bouyer } else if ((inp->i_isize & (sblock.e2fs_bsize - 1)) != 0) {
173 1.7 itojun getpathname(pathbuf, sizeof(pathbuf), inp->i_number,
174 1.7 itojun inp->i_number);
175 1.3 mrg pwarn("DIRECTORY %s: LENGTH %lu NOT MULTIPLE OF %d",
176 1.3 mrg pathbuf, (u_long)inp->i_isize, sblock.e2fs_bsize);
177 1.1 bouyer if (preen)
178 1.1 bouyer printf(" (ADJUSTED)\n");
179 1.1 bouyer inp->i_isize = roundup(inp->i_isize, sblock.e2fs_bsize);
180 1.1 bouyer if (preen || reply("ADJUST") == 1) {
181 1.1 bouyer dp = ginode(inp->i_number);
182 1.4 bouyer dp->e2di_size = h2fs32(inp->i_isize);
183 1.1 bouyer inodirty();
184 1.1 bouyer }
185 1.1 bouyer }
186 1.1 bouyer memset(&dino, 0, sizeof(struct ext2fs_dinode));
187 1.4 bouyer dino.e2di_mode = h2fs16(IFDIR);
188 1.4 bouyer dino.e2di_size = h2fs32(inp->i_isize);
189 1.1 bouyer memcpy(&dino.e2di_blocks[0], &inp->i_blks[0], (size_t)inp->i_numblks);
190 1.1 bouyer curino.id_number = inp->i_number;
191 1.1 bouyer curino.id_parent = inp->i_parent;
192 1.1 bouyer (void)ckinode(&dino, &curino);
193 1.1 bouyer }
194 1.1 bouyer /*
195 1.1 bouyer * Now that the parents of all directories have been found,
196 1.1 bouyer * make another pass to verify the value of `..'
197 1.1 bouyer */
198 1.1 bouyer for (inpp = inpsort; inpp < inpend; inpp++) {
199 1.1 bouyer inp = *inpp;
200 1.1 bouyer if (inp->i_parent == 0 || inp->i_isize == 0)
201 1.1 bouyer continue;
202 1.1 bouyer if (inp->i_dotdot == inp->i_parent ||
203 1.1 bouyer inp->i_dotdot == (ino_t)-1)
204 1.1 bouyer continue;
205 1.1 bouyer if (inp->i_dotdot == 0) {
206 1.1 bouyer inp->i_dotdot = inp->i_parent;
207 1.1 bouyer fileerror(inp->i_parent, inp->i_number, "MISSING '..'");
208 1.1 bouyer if (reply("FIX") == 0)
209 1.1 bouyer continue;
210 1.1 bouyer (void)makeentry(inp->i_number, inp->i_parent, "..");
211 1.1 bouyer lncntp[inp->i_parent]--;
212 1.1 bouyer continue;
213 1.1 bouyer }
214 1.1 bouyer fileerror(inp->i_parent, inp->i_number,
215 1.1 bouyer "BAD INODE NUMBER FOR '..'");
216 1.1 bouyer if (reply("FIX") == 0)
217 1.1 bouyer continue;
218 1.1 bouyer lncntp[inp->i_dotdot]++;
219 1.1 bouyer lncntp[inp->i_parent]--;
220 1.1 bouyer inp->i_dotdot = inp->i_parent;
221 1.1 bouyer (void)changeino(inp->i_number, "..", inp->i_parent);
222 1.1 bouyer }
223 1.1 bouyer /*
224 1.1 bouyer * Mark all the directories that can be found from the root.
225 1.1 bouyer */
226 1.1 bouyer propagate();
227 1.1 bouyer }
228 1.1 bouyer
229 1.1 bouyer static int
230 1.1 bouyer pass2check(idesc)
231 1.1 bouyer struct inodesc *idesc;
232 1.1 bouyer {
233 1.2 lukem struct ext2fs_direct *dirp = idesc->id_dirp;
234 1.2 lukem struct inoinfo *inp;
235 1.1 bouyer int n, entrysize, ret = 0;
236 1.1 bouyer struct ext2fs_dinode *dp;
237 1.1 bouyer char *errmsg;
238 1.1 bouyer struct ext2fs_direct proto;
239 1.1 bouyer char namebuf[MAXPATHLEN + 1];
240 1.1 bouyer char pathbuf[MAXPATHLEN + 1];
241 1.1 bouyer
242 1.1 bouyer /*
243 1.1 bouyer * check for "."
244 1.1 bouyer */
245 1.1 bouyer if (idesc->id_entryno != 0)
246 1.1 bouyer goto chk1;
247 1.5 bouyer if (fs2h32(dirp->e2d_ino) != 0 && dirp->e2d_namlen == 1 &&
248 1.1 bouyer dirp->e2d_name[0] == '.') {
249 1.4 bouyer if (fs2h32(dirp->e2d_ino) != idesc->id_number) {
250 1.1 bouyer direrror(idesc->id_number, "BAD INODE NUMBER FOR '.'");
251 1.4 bouyer dirp->e2d_ino = h2fs32(idesc->id_number);
252 1.1 bouyer if (reply("FIX") == 1)
253 1.1 bouyer ret |= ALTERED;
254 1.1 bouyer }
255 1.5 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
256 1.5 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE)
257 1.6 bouyer && (dirp->e2d_type != EXT2_FT_DIR)) {
258 1.5 bouyer direrror(idesc->id_number, "BAD TYPE VALUE FOR '.'");
259 1.6 bouyer dirp->e2d_type = EXT2_FT_DIR;
260 1.5 bouyer if (reply("FIX") == 1)
261 1.5 bouyer ret |= ALTERED;
262 1.5 bouyer }
263 1.1 bouyer goto chk1;
264 1.1 bouyer }
265 1.1 bouyer direrror(idesc->id_number, "MISSING '.'");
266 1.4 bouyer proto.e2d_ino = h2fs32(idesc->id_number);
267 1.5 bouyer proto.e2d_namlen = 1;
268 1.5 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
269 1.5 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
270 1.6 bouyer proto.e2d_type = EXT2_FT_DIR;
271 1.5 bouyer else
272 1.5 bouyer proto.e2d_type = 0;
273 1.7 itojun (void)strlcpy(proto.e2d_name, ".", sizeof(proto.e2d_name));
274 1.5 bouyer entrysize = EXT2FS_DIRSIZ(proto.e2d_namlen);
275 1.4 bouyer if (fs2h32(dirp->e2d_ino) != 0 && strcmp(dirp->e2d_name, "..") != 0) {
276 1.1 bouyer pfatal("CANNOT FIX, FIRST ENTRY IN DIRECTORY CONTAINS %s\n",
277 1.1 bouyer dirp->e2d_name);
278 1.4 bouyer } else if (fs2h16(dirp->e2d_reclen) < entrysize) {
279 1.1 bouyer pfatal("CANNOT FIX, INSUFFICIENT SPACE TO ADD '.'\n");
280 1.4 bouyer } else if (fs2h16(dirp->e2d_reclen) < 2 * entrysize) {
281 1.1 bouyer proto.e2d_reclen = dirp->e2d_reclen;
282 1.1 bouyer memcpy(dirp, &proto, (size_t)entrysize);
283 1.1 bouyer if (reply("FIX") == 1)
284 1.1 bouyer ret |= ALTERED;
285 1.1 bouyer } else {
286 1.4 bouyer n = fs2h16(dirp->e2d_reclen) - entrysize;
287 1.4 bouyer proto.e2d_reclen = h2fs16(entrysize);
288 1.1 bouyer memcpy(dirp, &proto, (size_t)entrysize);
289 1.1 bouyer idesc->id_entryno++;
290 1.4 bouyer lncntp[fs2h32(dirp->e2d_ino)]--;
291 1.1 bouyer dirp = (struct ext2fs_direct *)((char *)(dirp) + entrysize);
292 1.1 bouyer memset(dirp, 0, (size_t)n);
293 1.4 bouyer dirp->e2d_reclen = h2fs16(n);
294 1.1 bouyer if (reply("FIX") == 1)
295 1.1 bouyer ret |= ALTERED;
296 1.1 bouyer }
297 1.1 bouyer chk1:
298 1.1 bouyer if (idesc->id_entryno > 1)
299 1.1 bouyer goto chk2;
300 1.1 bouyer inp = getinoinfo(idesc->id_number);
301 1.4 bouyer proto.e2d_ino = h2fs32(inp->i_parent);
302 1.5 bouyer proto.e2d_namlen = 2;
303 1.5 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
304 1.5 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE))
305 1.6 bouyer proto.e2d_type = EXT2_FT_DIR;
306 1.5 bouyer else
307 1.5 bouyer proto.e2d_type = 0;
308 1.7 itojun (void)strlcpy(proto.e2d_name, "..", sizeof(proto.e2d_name));
309 1.4 bouyer entrysize = EXT2FS_DIRSIZ(2);
310 1.1 bouyer if (idesc->id_entryno == 0) {
311 1.5 bouyer n = EXT2FS_DIRSIZ(dirp->e2d_namlen);
312 1.4 bouyer if (fs2h16(dirp->e2d_reclen) < n + entrysize)
313 1.1 bouyer goto chk2;
314 1.4 bouyer proto.e2d_reclen = h2fs16(fs2h16(dirp->e2d_reclen) - n);
315 1.4 bouyer dirp->e2d_reclen = h2fs16(n);
316 1.1 bouyer idesc->id_entryno++;
317 1.4 bouyer lncntp[fs2h32(dirp->e2d_ino)]--;
318 1.1 bouyer dirp = (struct ext2fs_direct *)((char *)(dirp) + n);
319 1.4 bouyer memset(dirp, 0, (size_t)fs2h16(proto.e2d_reclen));
320 1.1 bouyer dirp->e2d_reclen = proto.e2d_reclen;
321 1.1 bouyer }
322 1.4 bouyer if (fs2h32(dirp->e2d_ino) != 0 &&
323 1.5 bouyer dirp->e2d_namlen == 2 &&
324 1.5 bouyer strncmp(dirp->e2d_name, "..", 2) == 0) {
325 1.4 bouyer inp->i_dotdot = fs2h32(dirp->e2d_ino);
326 1.5 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
327 1.5 bouyer (sblock.e2fs.e2fs_features_incompat & EXT2F_INCOMPAT_FTYPE)
328 1.6 bouyer && dirp->e2d_type != EXT2_FT_DIR) {
329 1.5 bouyer direrror(idesc->id_number, "BAD TYPE VALUE FOR '..'");
330 1.6 bouyer dirp->e2d_type = EXT2_FT_DIR;
331 1.5 bouyer if (reply("FIX") == 1)
332 1.5 bouyer ret |= ALTERED;
333 1.5 bouyer }
334 1.1 bouyer goto chk2;
335 1.1 bouyer }
336 1.4 bouyer if (fs2h32(dirp->e2d_ino) != 0 &&
337 1.5 bouyer dirp->e2d_namlen == 1 &&
338 1.4 bouyer strncmp(dirp->e2d_name, ".", 1) != 0) {
339 1.1 bouyer fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
340 1.1 bouyer pfatal("CANNOT FIX, SECOND ENTRY IN DIRECTORY CONTAINS %s\n",
341 1.1 bouyer dirp->e2d_name);
342 1.1 bouyer inp->i_dotdot = (ino_t)-1;
343 1.4 bouyer } else if (fs2h16(dirp->e2d_reclen) < entrysize) {
344 1.1 bouyer fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
345 1.1 bouyer pfatal("CANNOT FIX, INSUFFICIENT SPACE TO ADD '..'\n");
346 1.1 bouyer inp->i_dotdot = (ino_t)-1;
347 1.1 bouyer } else if (inp->i_parent != 0) {
348 1.1 bouyer /*
349 1.1 bouyer * We know the parent, so fix now.
350 1.1 bouyer */
351 1.1 bouyer inp->i_dotdot = inp->i_parent;
352 1.1 bouyer fileerror(inp->i_parent, idesc->id_number, "MISSING '..'");
353 1.1 bouyer proto.e2d_reclen = dirp->e2d_reclen;
354 1.1 bouyer memcpy(dirp, &proto, (size_t)entrysize);
355 1.1 bouyer if (reply("FIX") == 1)
356 1.1 bouyer ret |= ALTERED;
357 1.1 bouyer }
358 1.1 bouyer idesc->id_entryno++;
359 1.4 bouyer if (fs2h32(dirp->e2d_ino) != 0)
360 1.4 bouyer lncntp[fs2h32(dirp->e2d_ino)]--;
361 1.1 bouyer return (ret|KEEPON);
362 1.1 bouyer chk2:
363 1.4 bouyer if (fs2h32(dirp->e2d_ino) == 0)
364 1.1 bouyer return (ret|KEEPON);
365 1.5 bouyer if (dirp->e2d_namlen <= 2 &&
366 1.1 bouyer dirp->e2d_name[0] == '.' &&
367 1.1 bouyer idesc->id_entryno >= 2) {
368 1.5 bouyer if (dirp->e2d_namlen == 1) {
369 1.1 bouyer direrror(idesc->id_number, "EXTRA '.' ENTRY");
370 1.1 bouyer dirp->e2d_ino = 0;
371 1.1 bouyer if (reply("FIX") == 1)
372 1.1 bouyer ret |= ALTERED;
373 1.1 bouyer return (KEEPON | ret);
374 1.1 bouyer }
375 1.1 bouyer if (dirp->e2d_name[1] == '.') {
376 1.1 bouyer direrror(idesc->id_number, "EXTRA '..' ENTRY");
377 1.1 bouyer dirp->e2d_ino = 0;
378 1.1 bouyer if (reply("FIX") == 1)
379 1.1 bouyer ret |= ALTERED;
380 1.1 bouyer return (KEEPON | ret);
381 1.1 bouyer }
382 1.1 bouyer }
383 1.1 bouyer idesc->id_entryno++;
384 1.1 bouyer n = 0;
385 1.4 bouyer if (fs2h32(dirp->e2d_ino) > maxino ||
386 1.4 bouyer (fs2h32(dirp->e2d_ino) < EXT2_FIRSTINO &&
387 1.4 bouyer fs2h32(dirp->e2d_ino) != EXT2_ROOTINO)) {
388 1.4 bouyer fileerror(idesc->id_number, fs2h32(dirp->e2d_ino), "I OUT OF RANGE");
389 1.1 bouyer n = reply("REMOVE");
390 1.1 bouyer } else {
391 1.1 bouyer again:
392 1.4 bouyer switch (statemap[fs2h32(dirp->e2d_ino)]) {
393 1.1 bouyer case USTATE:
394 1.1 bouyer if (idesc->id_entryno <= 2)
395 1.1 bouyer break;
396 1.4 bouyer fileerror(idesc->id_number, fs2h32(dirp->e2d_ino), "UNALLOCATED");
397 1.1 bouyer n = reply("REMOVE");
398 1.1 bouyer break;
399 1.1 bouyer
400 1.1 bouyer case DCLEAR:
401 1.1 bouyer case FCLEAR:
402 1.1 bouyer if (idesc->id_entryno <= 2)
403 1.1 bouyer break;
404 1.4 bouyer if (statemap[fs2h32(dirp->e2d_ino)] == FCLEAR)
405 1.1 bouyer errmsg = "DUP/BAD";
406 1.1 bouyer else if (!preen)
407 1.1 bouyer errmsg = "ZERO LENGTH DIRECTORY";
408 1.1 bouyer else {
409 1.1 bouyer n = 1;
410 1.1 bouyer break;
411 1.1 bouyer }
412 1.4 bouyer fileerror(idesc->id_number, fs2h32(dirp->e2d_ino), errmsg);
413 1.1 bouyer if ((n = reply("REMOVE")) == 1)
414 1.1 bouyer break;
415 1.4 bouyer dp = ginode(fs2h32(dirp->e2d_ino));
416 1.4 bouyer statemap[fs2h32(dirp->e2d_ino)] =
417 1.4 bouyer (fs2h16(dp->e2di_mode) & IFMT) == IFDIR ? DSTATE : FSTATE;
418 1.4 bouyer lncntp[fs2h32(dirp->e2d_ino)] = fs2h16(dp->e2di_nlink);
419 1.1 bouyer goto again;
420 1.1 bouyer
421 1.1 bouyer case DSTATE:
422 1.1 bouyer case DFOUND:
423 1.4 bouyer inp = getinoinfo(fs2h32(dirp->e2d_ino));
424 1.1 bouyer if (inp->i_parent != 0 && idesc->id_entryno > 2) {
425 1.7 itojun getpathname(pathbuf, sizeof(pathbuf),
426 1.7 itojun idesc->id_number, idesc->id_number);
427 1.7 itojun getpathname(namebuf, sizeof(namebuf),
428 1.7 itojun fs2h32(dirp->e2d_ino),
429 1.7 itojun fs2h32(dirp->e2d_ino));
430 1.1 bouyer pwarn("%s %s %s\n", pathbuf,
431 1.1 bouyer "IS AN EXTRANEOUS HARD LINK TO DIRECTORY",
432 1.1 bouyer namebuf);
433 1.1 bouyer if (preen)
434 1.1 bouyer printf(" (IGNORED)\n");
435 1.1 bouyer else if ((n = reply("REMOVE")) == 1)
436 1.1 bouyer break;
437 1.1 bouyer }
438 1.1 bouyer if (idesc->id_entryno > 2)
439 1.1 bouyer inp->i_parent = idesc->id_number;
440 1.1 bouyer /* fall through */
441 1.1 bouyer
442 1.1 bouyer case FSTATE:
443 1.5 bouyer if (sblock.e2fs.e2fs_rev > E2FS_REV0 &&
444 1.5 bouyer (sblock.e2fs.e2fs_features_incompat &
445 1.5 bouyer EXT2F_INCOMPAT_FTYPE) &&
446 1.6 bouyer dirp->e2d_type !=
447 1.6 bouyer inot2ext2dt(typemap[fs2h32(dirp->e2d_ino)])) {
448 1.6 bouyer dirp->e2d_type =
449 1.6 bouyer inot2ext2dt(typemap[fs2h32(dirp->e2d_ino)]);
450 1.5 bouyer fileerror(idesc->id_number,
451 1.5 bouyer fs2h32(dirp->e2d_ino),
452 1.5 bouyer "BAD TYPE VALUE");
453 1.5 bouyer if (reply("FIX") == 1)
454 1.5 bouyer ret |= ALTERED;
455 1.5 bouyer }
456 1.4 bouyer lncntp[fs2h32(dirp->e2d_ino)]--;
457 1.1 bouyer break;
458 1.1 bouyer
459 1.1 bouyer default:
460 1.1 bouyer errexit("BAD STATE %d FOR INODE I=%d\n",
461 1.4 bouyer statemap[fs2h32(dirp->e2d_ino)], fs2h32(dirp->e2d_ino));
462 1.1 bouyer }
463 1.1 bouyer }
464 1.1 bouyer if (n == 0)
465 1.1 bouyer return (ret|KEEPON);
466 1.1 bouyer dirp->e2d_ino = 0;
467 1.1 bouyer return (ret|KEEPON|ALTERED);
468 1.1 bouyer }
469 1.1 bouyer
470 1.1 bouyer /*
471 1.1 bouyer * Routine to sort disk blocks.
472 1.1 bouyer */
473 1.1 bouyer static int
474 1.1 bouyer blksort(inpp1, inpp2)
475 1.1 bouyer const void *inpp1, *inpp2;
476 1.1 bouyer {
477 1.1 bouyer return ((* (struct inoinfo **) inpp1)->i_blks[0] -
478 1.1 bouyer (* (struct inoinfo **) inpp2)->i_blks[0]);
479 1.1 bouyer }
480