utilities.c revision 1.9 1 1.9 agc /* $NetBSD: utilities.c,v 1.9 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.9 agc * 3. Neither the name of the University nor the names of its contributors
16 1.9 agc * may be used to endorse or promote products derived from this software
17 1.9 agc * without specific prior written permission.
18 1.9 agc *
19 1.9 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.9 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.9 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.9 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.9 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.9 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.9 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.9 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.9 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.9 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.9 agc * SUCH DAMAGE.
30 1.9 agc */
31 1.9 agc
32 1.9 agc /*
33 1.9 agc * Copyright (c) 1997 Manuel Bouyer.
34 1.9 agc *
35 1.9 agc * Redistribution and use in source and binary forms, with or without
36 1.9 agc * modification, are permitted provided that the following conditions
37 1.9 agc * are met:
38 1.9 agc * 1. Redistributions of source code must retain the above copyright
39 1.9 agc * notice, this list of conditions and the following disclaimer.
40 1.9 agc * 2. Redistributions in binary form must reproduce the above copyright
41 1.9 agc * notice, this list of conditions and the following disclaimer in the
42 1.9 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[] = "@(#)utilities.c 8.1 (Berkeley) 6/5/93";
68 1.1 bouyer #else
69 1.9 agc __RCSID("$NetBSD: utilities.c,v 1.9 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 #include <ufs/ufs/dinode.h> /* for IFMT & friends */
79 1.1 bouyer #include <stdio.h>
80 1.1 bouyer #include <stdlib.h>
81 1.1 bouyer #include <string.h>
82 1.1 bouyer #include <ctype.h>
83 1.1 bouyer #include <unistd.h>
84 1.1 bouyer
85 1.1 bouyer #include "fsutil.h"
86 1.1 bouyer #include "fsck.h"
87 1.1 bouyer #include "extern.h"
88 1.1 bouyer
89 1.1 bouyer long diskreads, totalreads; /* Disk cache statistics */
90 1.1 bouyer
91 1.1 bouyer static void rwerror __P((char *, daddr_t));
92 1.1 bouyer
93 1.6 christos extern int returntosingle;
94 1.6 christos
95 1.1 bouyer int
96 1.1 bouyer ftypeok(dp)
97 1.1 bouyer struct ext2fs_dinode *dp;
98 1.1 bouyer {
99 1.3 bouyer switch (fs2h16(dp->e2di_mode) & IFMT) {
100 1.1 bouyer
101 1.1 bouyer case IFDIR:
102 1.1 bouyer case IFREG:
103 1.1 bouyer case IFBLK:
104 1.1 bouyer case IFCHR:
105 1.1 bouyer case IFLNK:
106 1.1 bouyer case IFSOCK:
107 1.1 bouyer case IFIFO:
108 1.1 bouyer return (1);
109 1.1 bouyer
110 1.1 bouyer default:
111 1.1 bouyer if (debug)
112 1.3 bouyer printf("bad file type 0%o\n", fs2h16(dp->e2di_mode));
113 1.1 bouyer return (0);
114 1.1 bouyer }
115 1.1 bouyer }
116 1.1 bouyer
117 1.1 bouyer int
118 1.1 bouyer reply(question)
119 1.1 bouyer char *question;
120 1.1 bouyer {
121 1.1 bouyer int persevere;
122 1.1 bouyer char c;
123 1.1 bouyer
124 1.1 bouyer if (preen)
125 1.1 bouyer pfatal("INTERNAL ERROR: GOT TO reply()");
126 1.1 bouyer persevere = !strcmp(question, "CONTINUE");
127 1.1 bouyer printf("\n");
128 1.1 bouyer if (!persevere && (nflag || fswritefd < 0)) {
129 1.1 bouyer printf("%s? no\n\n", question);
130 1.1 bouyer return (0);
131 1.1 bouyer }
132 1.1 bouyer if (yflag || (persevere && nflag)) {
133 1.1 bouyer printf("%s? yes\n\n", question);
134 1.1 bouyer return (1);
135 1.1 bouyer }
136 1.1 bouyer do {
137 1.1 bouyer printf("%s? [yn] ", question);
138 1.1 bouyer (void) fflush(stdout);
139 1.1 bouyer c = getc(stdin);
140 1.1 bouyer while (c != '\n' && getc(stdin) != '\n')
141 1.1 bouyer if (feof(stdin))
142 1.1 bouyer return (0);
143 1.1 bouyer } while (c != 'y' && c != 'Y' && c != 'n' && c != 'N');
144 1.1 bouyer printf("\n");
145 1.1 bouyer if (c == 'y' || c == 'Y')
146 1.1 bouyer return (1);
147 1.1 bouyer return (0);
148 1.1 bouyer }
149 1.1 bouyer
150 1.1 bouyer /*
151 1.1 bouyer * Malloc buffers and set up cache.
152 1.1 bouyer */
153 1.1 bouyer void
154 1.1 bouyer bufinit()
155 1.1 bouyer {
156 1.2 lukem struct bufarea *bp;
157 1.1 bouyer long bufcnt, i;
158 1.1 bouyer char *bufp;
159 1.1 bouyer
160 1.3 bouyer diskreads = totalreads = 0;
161 1.1 bouyer pbp = pdirbp = (struct bufarea *)0;
162 1.1 bouyer bufhead.b_next = bufhead.b_prev = &bufhead;
163 1.1 bouyer bufcnt = MAXBUFSPACE / sblock.e2fs_bsize;
164 1.1 bouyer if (bufcnt < MINBUFS)
165 1.1 bouyer bufcnt = MINBUFS;
166 1.1 bouyer for (i = 0; i < bufcnt; i++) {
167 1.1 bouyer bp = (struct bufarea *)malloc(sizeof(struct bufarea));
168 1.1 bouyer bufp = malloc((unsigned int)sblock.e2fs_bsize);
169 1.1 bouyer if (bp == NULL || bufp == NULL) {
170 1.1 bouyer if (i >= MINBUFS)
171 1.1 bouyer break;
172 1.1 bouyer errexit("cannot allocate buffer pool\n");
173 1.1 bouyer }
174 1.1 bouyer bp->b_un.b_buf = bufp;
175 1.1 bouyer bp->b_prev = &bufhead;
176 1.1 bouyer bp->b_next = bufhead.b_next;
177 1.1 bouyer bufhead.b_next->b_prev = bp;
178 1.1 bouyer bufhead.b_next = bp;
179 1.1 bouyer initbarea(bp);
180 1.1 bouyer }
181 1.1 bouyer bufhead.b_size = i; /* save number of buffers */
182 1.1 bouyer }
183 1.1 bouyer
184 1.1 bouyer /*
185 1.1 bouyer * Manage a cache of directory blocks.
186 1.1 bouyer */
187 1.1 bouyer struct bufarea *
188 1.1 bouyer getdatablk(blkno, size)
189 1.1 bouyer daddr_t blkno;
190 1.1 bouyer long size;
191 1.1 bouyer {
192 1.2 lukem struct bufarea *bp;
193 1.1 bouyer
194 1.1 bouyer for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next)
195 1.1 bouyer if (bp->b_bno == fsbtodb(&sblock, blkno))
196 1.1 bouyer goto foundit;
197 1.1 bouyer for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev)
198 1.1 bouyer if ((bp->b_flags & B_INUSE) == 0)
199 1.1 bouyer break;
200 1.1 bouyer if (bp == &bufhead)
201 1.1 bouyer errexit("deadlocked buffer pool\n");
202 1.1 bouyer getblk(bp, blkno, size);
203 1.3 bouyer diskreads++;
204 1.1 bouyer /* fall through */
205 1.1 bouyer foundit:
206 1.1 bouyer totalreads++;
207 1.1 bouyer bp->b_prev->b_next = bp->b_next;
208 1.1 bouyer bp->b_next->b_prev = bp->b_prev;
209 1.1 bouyer bp->b_prev = &bufhead;
210 1.1 bouyer bp->b_next = bufhead.b_next;
211 1.1 bouyer bufhead.b_next->b_prev = bp;
212 1.1 bouyer bufhead.b_next = bp;
213 1.1 bouyer bp->b_flags |= B_INUSE;
214 1.1 bouyer return (bp);
215 1.1 bouyer }
216 1.1 bouyer
217 1.1 bouyer void
218 1.1 bouyer getblk(bp, blk, size)
219 1.2 lukem struct bufarea *bp;
220 1.1 bouyer daddr_t blk;
221 1.1 bouyer long size;
222 1.1 bouyer {
223 1.1 bouyer daddr_t dblk;
224 1.1 bouyer
225 1.1 bouyer dblk = fsbtodb(&sblock, blk);
226 1.1 bouyer if (bp->b_bno != dblk) {
227 1.1 bouyer flush(fswritefd, bp);
228 1.1 bouyer bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size);
229 1.1 bouyer bp->b_bno = dblk;
230 1.1 bouyer bp->b_size = size;
231 1.1 bouyer }
232 1.1 bouyer }
233 1.1 bouyer
234 1.1 bouyer void
235 1.1 bouyer flush(fd, bp)
236 1.1 bouyer int fd;
237 1.2 lukem struct bufarea *bp;
238 1.1 bouyer {
239 1.2 lukem int i;
240 1.1 bouyer
241 1.1 bouyer if (!bp->b_dirty)
242 1.1 bouyer return;
243 1.1 bouyer if (bp->b_errs != 0)
244 1.7 fvdl pfatal("WRITING %sZERO'ED BLOCK %lld TO DISK\n",
245 1.1 bouyer (bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ",
246 1.7 fvdl (long long)bp->b_bno);
247 1.1 bouyer bp->b_dirty = 0;
248 1.1 bouyer bp->b_errs = 0;
249 1.1 bouyer bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size);
250 1.1 bouyer if (bp != &sblk)
251 1.1 bouyer return;
252 1.1 bouyer for (i = 0; i < sblock.e2fs_ngdb; i++) {
253 1.1 bouyer bwrite(fswritefd, (char *)
254 1.1 bouyer &sblock.e2fs_gd[i* sblock.e2fs_bsize / sizeof(struct ext2_gd)],
255 1.1 bouyer fsbtodb(&sblock, ((sblock.e2fs_bsize>1024)?0:1)+i+1),
256 1.1 bouyer sblock.e2fs_bsize);
257 1.1 bouyer }
258 1.1 bouyer }
259 1.1 bouyer
260 1.1 bouyer static void
261 1.1 bouyer rwerror(mesg, blk)
262 1.1 bouyer char *mesg;
263 1.1 bouyer daddr_t blk;
264 1.1 bouyer {
265 1.1 bouyer
266 1.1 bouyer if (preen == 0)
267 1.1 bouyer printf("\n");
268 1.7 fvdl pfatal("CANNOT %s: BLK %lld", mesg, (long long)blk);
269 1.1 bouyer if (reply("CONTINUE") == 0)
270 1.1 bouyer errexit("Program terminated\n");
271 1.1 bouyer }
272 1.1 bouyer
273 1.1 bouyer void
274 1.1 bouyer ckfini(markclean)
275 1.1 bouyer int markclean;
276 1.1 bouyer {
277 1.2 lukem struct bufarea *bp, *nbp;
278 1.1 bouyer int cnt = 0;
279 1.1 bouyer
280 1.1 bouyer if (fswritefd < 0) {
281 1.1 bouyer (void)close(fsreadfd);
282 1.1 bouyer return;
283 1.1 bouyer }
284 1.1 bouyer flush(fswritefd, &sblk);
285 1.1 bouyer if (havesb && sblk.b_bno != SBOFF / dev_bsize &&
286 1.3 bouyer !preen && reply("UPDATE STANDARD SUPERBLOCKS")) {
287 1.1 bouyer sblk.b_bno = SBOFF / dev_bsize;
288 1.1 bouyer sbdirty();
289 1.1 bouyer flush(fswritefd, &sblk);
290 1.3 bouyer copyback_sb(&asblk);
291 1.3 bouyer asblk.b_dirty = 1;
292 1.3 bouyer flush(fswritefd, &asblk);
293 1.1 bouyer }
294 1.1 bouyer for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
295 1.1 bouyer cnt++;
296 1.1 bouyer flush(fswritefd, bp);
297 1.1 bouyer nbp = bp->b_prev;
298 1.1 bouyer free(bp->b_un.b_buf);
299 1.1 bouyer free((char *)bp);
300 1.1 bouyer }
301 1.1 bouyer if (bufhead.b_size != cnt)
302 1.1 bouyer errexit("Panic: lost %d buffers\n", bufhead.b_size - cnt);
303 1.1 bouyer pbp = pdirbp = (struct bufarea *)0;
304 1.1 bouyer if (markclean && (sblock.e2fs.e2fs_state & E2FS_ISCLEAN) == 0) {
305 1.1 bouyer /*
306 1.1 bouyer * Mark the file system as clean, and sync the superblock.
307 1.1 bouyer */
308 1.1 bouyer if (preen)
309 1.1 bouyer pwarn("MARKING FILE SYSTEM CLEAN\n");
310 1.1 bouyer else if (!reply("MARK FILE SYSTEM CLEAN"))
311 1.1 bouyer markclean = 0;
312 1.1 bouyer if (markclean) {
313 1.1 bouyer sblock.e2fs.e2fs_state = E2FS_ISCLEAN;
314 1.1 bouyer sbdirty();
315 1.1 bouyer flush(fswritefd, &sblk);
316 1.1 bouyer }
317 1.1 bouyer }
318 1.1 bouyer if (debug)
319 1.1 bouyer printf("cache missed %ld of %ld (%d%%)\n", diskreads,
320 1.1 bouyer totalreads, (int)(diskreads * 100 / totalreads));
321 1.1 bouyer (void)close(fsreadfd);
322 1.1 bouyer (void)close(fswritefd);
323 1.1 bouyer }
324 1.1 bouyer
325 1.1 bouyer int
326 1.1 bouyer bread(fd, buf, blk, size)
327 1.1 bouyer int fd;
328 1.1 bouyer char *buf;
329 1.1 bouyer daddr_t blk;
330 1.1 bouyer long size;
331 1.1 bouyer {
332 1.1 bouyer char *cp;
333 1.1 bouyer int i, errs;
334 1.1 bouyer off_t offset;
335 1.1 bouyer
336 1.1 bouyer offset = blk;
337 1.1 bouyer offset *= dev_bsize;
338 1.1 bouyer if (lseek(fd, offset, 0) < 0)
339 1.1 bouyer rwerror("SEEK", blk);
340 1.1 bouyer else if (read(fd, buf, (int)size) == size)
341 1.1 bouyer return (0);
342 1.1 bouyer rwerror("READ", blk);
343 1.1 bouyer if (lseek(fd, offset, 0) < 0)
344 1.1 bouyer rwerror("SEEK", blk);
345 1.1 bouyer errs = 0;
346 1.1 bouyer memset(buf, 0, (size_t)size);
347 1.1 bouyer printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
348 1.1 bouyer for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
349 1.1 bouyer if (read(fd, cp, (int)secsize) != secsize) {
350 1.1 bouyer (void)lseek(fd, offset + i + secsize, 0);
351 1.1 bouyer if (secsize != dev_bsize && dev_bsize != 1)
352 1.7 fvdl printf(" %lld (%lld),",
353 1.7 fvdl (long long)((blk*dev_bsize + i) / secsize),
354 1.7 fvdl (long long)(blk + i / dev_bsize));
355 1.1 bouyer else
356 1.7 fvdl printf(" %lld,", (long long)(blk +
357 1.7 fvdl i / dev_bsize));
358 1.1 bouyer errs++;
359 1.1 bouyer }
360 1.1 bouyer }
361 1.1 bouyer printf("\n");
362 1.1 bouyer return (errs);
363 1.1 bouyer }
364 1.1 bouyer
365 1.1 bouyer void
366 1.1 bouyer bwrite(fd, buf, blk, size)
367 1.1 bouyer int fd;
368 1.1 bouyer char *buf;
369 1.1 bouyer daddr_t blk;
370 1.1 bouyer long size;
371 1.1 bouyer {
372 1.1 bouyer int i;
373 1.1 bouyer char *cp;
374 1.1 bouyer off_t offset;
375 1.1 bouyer
376 1.1 bouyer if (fd < 0)
377 1.1 bouyer return;
378 1.1 bouyer offset = blk;
379 1.1 bouyer offset *= dev_bsize;
380 1.1 bouyer if (lseek(fd, offset, 0) < 0)
381 1.1 bouyer rwerror("SEEK", blk);
382 1.1 bouyer else if (write(fd, buf, (int)size) == size) {
383 1.1 bouyer fsmodified = 1;
384 1.1 bouyer return;
385 1.1 bouyer }
386 1.1 bouyer rwerror("WRITE", blk);
387 1.1 bouyer if (lseek(fd, offset, 0) < 0)
388 1.1 bouyer rwerror("SEEK", blk);
389 1.1 bouyer printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
390 1.1 bouyer for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
391 1.1 bouyer if (write(fd, cp, (int)dev_bsize) != dev_bsize) {
392 1.1 bouyer (void)lseek(fd, offset + i + dev_bsize, 0);
393 1.7 fvdl printf(" %lld,", (long long)(blk + i / dev_bsize));
394 1.1 bouyer }
395 1.1 bouyer printf("\n");
396 1.1 bouyer return;
397 1.1 bouyer }
398 1.1 bouyer
399 1.1 bouyer /*
400 1.1 bouyer * allocate a data block
401 1.1 bouyer */
402 1.1 bouyer int
403 1.1 bouyer allocblk()
404 1.1 bouyer {
405 1.2 lukem int i;
406 1.1 bouyer
407 1.1 bouyer for (i = 0; i < maxfsblock - 1; i++) {
408 1.1 bouyer if (testbmap(i))
409 1.1 bouyer continue;
410 1.1 bouyer setbmap(i);
411 1.1 bouyer n_blks ++;
412 1.1 bouyer return (i);
413 1.1 bouyer }
414 1.1 bouyer return (0);
415 1.1 bouyer }
416 1.1 bouyer
417 1.1 bouyer /*
418 1.1 bouyer * Free a previously allocated block
419 1.1 bouyer */
420 1.1 bouyer void
421 1.1 bouyer freeblk(blkno)
422 1.1 bouyer daddr_t blkno;
423 1.1 bouyer {
424 1.1 bouyer struct inodesc idesc;
425 1.1 bouyer
426 1.1 bouyer idesc.id_blkno = blkno;
427 1.1 bouyer idesc.id_numfrags = 1;
428 1.1 bouyer (void)pass4check(&idesc);
429 1.1 bouyer }
430 1.1 bouyer
431 1.1 bouyer /*
432 1.1 bouyer * Find a pathname
433 1.1 bouyer */
434 1.1 bouyer void
435 1.8 itojun getpathname(namebuf, namebuflen, curdir, ino)
436 1.1 bouyer char *namebuf;
437 1.8 itojun size_t namebuflen;
438 1.1 bouyer ino_t curdir, ino;
439 1.1 bouyer {
440 1.1 bouyer int len;
441 1.2 lukem char *cp;
442 1.1 bouyer struct inodesc idesc;
443 1.1 bouyer static int busy = 0;
444 1.1 bouyer
445 1.1 bouyer if (curdir == ino && ino == EXT2_ROOTINO) {
446 1.8 itojun (void)strlcpy(namebuf, "/", namebuflen);
447 1.1 bouyer return;
448 1.1 bouyer }
449 1.1 bouyer if (busy ||
450 1.1 bouyer (statemap[curdir] != DSTATE && statemap[curdir] != DFOUND)) {
451 1.8 itojun (void)strlcpy(namebuf, "?", namebuflen);
452 1.1 bouyer return;
453 1.1 bouyer }
454 1.1 bouyer busy = 1;
455 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
456 1.1 bouyer idesc.id_type = DATA;
457 1.1 bouyer idesc.id_fix = IGNORE;
458 1.1 bouyer cp = &namebuf[MAXPATHLEN - 1];
459 1.1 bouyer *cp = '\0';
460 1.1 bouyer if (curdir != ino) {
461 1.1 bouyer idesc.id_parent = curdir;
462 1.1 bouyer goto namelookup;
463 1.1 bouyer }
464 1.1 bouyer while (ino != EXT2_ROOTINO) {
465 1.1 bouyer idesc.id_number = ino;
466 1.1 bouyer idesc.id_func = findino;
467 1.1 bouyer idesc.id_name = "..";
468 1.1 bouyer if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
469 1.1 bouyer break;
470 1.1 bouyer namelookup:
471 1.1 bouyer idesc.id_number = idesc.id_parent;
472 1.1 bouyer idesc.id_parent = ino;
473 1.1 bouyer idesc.id_func = findname;
474 1.1 bouyer idesc.id_name = namebuf;
475 1.1 bouyer if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
476 1.1 bouyer break;
477 1.1 bouyer len = strlen(namebuf);
478 1.1 bouyer cp -= len;
479 1.1 bouyer memcpy(cp, namebuf, (size_t)len);
480 1.1 bouyer *--cp = '/';
481 1.1 bouyer if (cp < &namebuf[EXT2FS_MAXNAMLEN])
482 1.1 bouyer break;
483 1.1 bouyer ino = idesc.id_number;
484 1.1 bouyer }
485 1.1 bouyer busy = 0;
486 1.1 bouyer if (ino != EXT2_ROOTINO)
487 1.1 bouyer *--cp = '?';
488 1.1 bouyer memcpy(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
489 1.1 bouyer }
490 1.1 bouyer
491 1.1 bouyer void
492 1.1 bouyer catch(n)
493 1.1 bouyer int n;
494 1.1 bouyer {
495 1.1 bouyer ckfini(0);
496 1.1 bouyer exit(12);
497 1.1 bouyer }
498 1.1 bouyer
499 1.1 bouyer /*
500 1.1 bouyer * When preening, allow a single quit to signal
501 1.1 bouyer * a special exit after filesystem checks complete
502 1.1 bouyer * so that reboot sequence may be interrupted.
503 1.1 bouyer */
504 1.1 bouyer void
505 1.1 bouyer catchquit(n)
506 1.1 bouyer int n;
507 1.1 bouyer {
508 1.1 bouyer printf("returning to single-user after filesystem check\n");
509 1.1 bouyer returntosingle = 1;
510 1.1 bouyer (void)signal(SIGQUIT, SIG_DFL);
511 1.1 bouyer }
512 1.1 bouyer
513 1.1 bouyer /*
514 1.1 bouyer * Ignore a single quit signal; wait and flush just in case.
515 1.1 bouyer * Used by child processes in preen.
516 1.1 bouyer */
517 1.1 bouyer void
518 1.1 bouyer voidquit(n)
519 1.1 bouyer int n;
520 1.1 bouyer {
521 1.1 bouyer
522 1.1 bouyer sleep(1);
523 1.1 bouyer (void)signal(SIGQUIT, SIG_IGN);
524 1.1 bouyer (void)signal(SIGQUIT, SIG_DFL);
525 1.1 bouyer }
526 1.1 bouyer
527 1.1 bouyer /*
528 1.1 bouyer * determine whether an inode should be fixed.
529 1.1 bouyer */
530 1.1 bouyer int
531 1.1 bouyer dofix(idesc, msg)
532 1.2 lukem struct inodesc *idesc;
533 1.1 bouyer char *msg;
534 1.1 bouyer {
535 1.1 bouyer
536 1.1 bouyer switch (idesc->id_fix) {
537 1.1 bouyer
538 1.1 bouyer case DONTKNOW:
539 1.1 bouyer if (idesc->id_type == DATA)
540 1.1 bouyer direrror(idesc->id_number, msg);
541 1.1 bouyer else
542 1.5 is pwarn("%s", msg);
543 1.1 bouyer if (preen) {
544 1.1 bouyer printf(" (SALVAGED)\n");
545 1.1 bouyer idesc->id_fix = FIX;
546 1.1 bouyer return (ALTERED);
547 1.1 bouyer }
548 1.1 bouyer if (reply("SALVAGE") == 0) {
549 1.1 bouyer idesc->id_fix = NOFIX;
550 1.1 bouyer return (0);
551 1.1 bouyer }
552 1.1 bouyer idesc->id_fix = FIX;
553 1.1 bouyer return (ALTERED);
554 1.1 bouyer
555 1.1 bouyer case FIX:
556 1.1 bouyer return (ALTERED);
557 1.1 bouyer
558 1.1 bouyer case NOFIX:
559 1.1 bouyer case IGNORE:
560 1.1 bouyer return (0);
561 1.1 bouyer
562 1.1 bouyer default:
563 1.1 bouyer errexit("UNKNOWN INODESC FIX MODE %d\n", idesc->id_fix);
564 1.1 bouyer }
565 1.1 bouyer /* NOTREACHED */
566 1.1 bouyer }
567