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