utilities.c revision 1.3 1 1.3 bouyer /* $NetBSD: utilities.c,v 1.3 1997/10/09 13:19:41 bouyer 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.2 lukem #include <sys/cdefs.h>
38 1.1 bouyer #ifndef lint
39 1.1 bouyer #if 0
40 1.1 bouyer static char sccsid[] = "@(#)utilities.c 8.1 (Berkeley) 6/5/93";
41 1.1 bouyer #else
42 1.3 bouyer __RCSID("$NetBSD: utilities.c,v 1.3 1997/10/09 13:19:41 bouyer 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.1 bouyer #include <ufs/ext2fs/ext2fs_dinode.h>
49 1.1 bouyer #include <ufs/ext2fs/ext2fs_dir.h>
50 1.1 bouyer #include <ufs/ext2fs/ext2fs.h>
51 1.1 bouyer #include <ufs/ufs/dinode.h> /* for IFMT & friends */
52 1.1 bouyer #include <stdio.h>
53 1.1 bouyer #include <stdlib.h>
54 1.1 bouyer #include <string.h>
55 1.1 bouyer #include <ctype.h>
56 1.1 bouyer #include <unistd.h>
57 1.1 bouyer
58 1.1 bouyer #include "fsutil.h"
59 1.1 bouyer #include "fsck.h"
60 1.1 bouyer #include "extern.h"
61 1.1 bouyer
62 1.1 bouyer long diskreads, totalreads; /* Disk cache statistics */
63 1.1 bouyer
64 1.1 bouyer static void rwerror __P((char *, daddr_t));
65 1.1 bouyer
66 1.1 bouyer int
67 1.1 bouyer ftypeok(dp)
68 1.1 bouyer struct ext2fs_dinode *dp;
69 1.1 bouyer {
70 1.3 bouyer switch (fs2h16(dp->e2di_mode) & IFMT) {
71 1.1 bouyer
72 1.1 bouyer case IFDIR:
73 1.1 bouyer case IFREG:
74 1.1 bouyer case IFBLK:
75 1.1 bouyer case IFCHR:
76 1.1 bouyer case IFLNK:
77 1.1 bouyer case IFSOCK:
78 1.1 bouyer case IFIFO:
79 1.1 bouyer return (1);
80 1.1 bouyer
81 1.1 bouyer default:
82 1.1 bouyer if (debug)
83 1.3 bouyer printf("bad file type 0%o\n", fs2h16(dp->e2di_mode));
84 1.1 bouyer return (0);
85 1.1 bouyer }
86 1.1 bouyer }
87 1.1 bouyer
88 1.1 bouyer int
89 1.1 bouyer reply(question)
90 1.1 bouyer char *question;
91 1.1 bouyer {
92 1.1 bouyer int persevere;
93 1.1 bouyer char c;
94 1.1 bouyer
95 1.1 bouyer if (preen)
96 1.1 bouyer pfatal("INTERNAL ERROR: GOT TO reply()");
97 1.1 bouyer persevere = !strcmp(question, "CONTINUE");
98 1.1 bouyer printf("\n");
99 1.1 bouyer if (!persevere && (nflag || fswritefd < 0)) {
100 1.1 bouyer printf("%s? no\n\n", question);
101 1.1 bouyer return (0);
102 1.1 bouyer }
103 1.1 bouyer if (yflag || (persevere && nflag)) {
104 1.1 bouyer printf("%s? yes\n\n", question);
105 1.1 bouyer return (1);
106 1.1 bouyer }
107 1.1 bouyer do {
108 1.1 bouyer printf("%s? [yn] ", question);
109 1.1 bouyer (void) fflush(stdout);
110 1.1 bouyer c = getc(stdin);
111 1.1 bouyer while (c != '\n' && getc(stdin) != '\n')
112 1.1 bouyer if (feof(stdin))
113 1.1 bouyer return (0);
114 1.1 bouyer } while (c != 'y' && c != 'Y' && c != 'n' && c != 'N');
115 1.1 bouyer printf("\n");
116 1.1 bouyer if (c == 'y' || c == 'Y')
117 1.1 bouyer return (1);
118 1.1 bouyer return (0);
119 1.1 bouyer }
120 1.1 bouyer
121 1.1 bouyer /*
122 1.1 bouyer * Malloc buffers and set up cache.
123 1.1 bouyer */
124 1.1 bouyer void
125 1.1 bouyer bufinit()
126 1.1 bouyer {
127 1.2 lukem struct bufarea *bp;
128 1.1 bouyer long bufcnt, i;
129 1.1 bouyer char *bufp;
130 1.1 bouyer
131 1.3 bouyer diskreads = totalreads = 0;
132 1.1 bouyer pbp = pdirbp = (struct bufarea *)0;
133 1.1 bouyer bufhead.b_next = bufhead.b_prev = &bufhead;
134 1.1 bouyer bufcnt = MAXBUFSPACE / sblock.e2fs_bsize;
135 1.1 bouyer if (bufcnt < MINBUFS)
136 1.1 bouyer bufcnt = MINBUFS;
137 1.1 bouyer for (i = 0; i < bufcnt; i++) {
138 1.1 bouyer bp = (struct bufarea *)malloc(sizeof(struct bufarea));
139 1.1 bouyer bufp = malloc((unsigned int)sblock.e2fs_bsize);
140 1.1 bouyer if (bp == NULL || bufp == NULL) {
141 1.1 bouyer if (i >= MINBUFS)
142 1.1 bouyer break;
143 1.1 bouyer errexit("cannot allocate buffer pool\n");
144 1.1 bouyer }
145 1.1 bouyer bp->b_un.b_buf = bufp;
146 1.1 bouyer bp->b_prev = &bufhead;
147 1.1 bouyer bp->b_next = bufhead.b_next;
148 1.1 bouyer bufhead.b_next->b_prev = bp;
149 1.1 bouyer bufhead.b_next = bp;
150 1.1 bouyer initbarea(bp);
151 1.1 bouyer }
152 1.1 bouyer bufhead.b_size = i; /* save number of buffers */
153 1.1 bouyer }
154 1.1 bouyer
155 1.1 bouyer /*
156 1.1 bouyer * Manage a cache of directory blocks.
157 1.1 bouyer */
158 1.1 bouyer struct bufarea *
159 1.1 bouyer getdatablk(blkno, size)
160 1.1 bouyer daddr_t blkno;
161 1.1 bouyer long size;
162 1.1 bouyer {
163 1.2 lukem struct bufarea *bp;
164 1.1 bouyer
165 1.1 bouyer for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next)
166 1.1 bouyer if (bp->b_bno == fsbtodb(&sblock, blkno))
167 1.1 bouyer goto foundit;
168 1.1 bouyer for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev)
169 1.1 bouyer if ((bp->b_flags & B_INUSE) == 0)
170 1.1 bouyer break;
171 1.1 bouyer if (bp == &bufhead)
172 1.1 bouyer errexit("deadlocked buffer pool\n");
173 1.1 bouyer getblk(bp, blkno, size);
174 1.3 bouyer diskreads++;
175 1.1 bouyer /* fall through */
176 1.1 bouyer foundit:
177 1.1 bouyer totalreads++;
178 1.1 bouyer bp->b_prev->b_next = bp->b_next;
179 1.1 bouyer bp->b_next->b_prev = bp->b_prev;
180 1.1 bouyer bp->b_prev = &bufhead;
181 1.1 bouyer bp->b_next = bufhead.b_next;
182 1.1 bouyer bufhead.b_next->b_prev = bp;
183 1.1 bouyer bufhead.b_next = bp;
184 1.1 bouyer bp->b_flags |= B_INUSE;
185 1.1 bouyer return (bp);
186 1.1 bouyer }
187 1.1 bouyer
188 1.1 bouyer void
189 1.1 bouyer getblk(bp, blk, size)
190 1.2 lukem struct bufarea *bp;
191 1.1 bouyer daddr_t blk;
192 1.1 bouyer long size;
193 1.1 bouyer {
194 1.1 bouyer daddr_t dblk;
195 1.1 bouyer
196 1.1 bouyer dblk = fsbtodb(&sblock, blk);
197 1.1 bouyer if (bp->b_bno != dblk) {
198 1.1 bouyer flush(fswritefd, bp);
199 1.1 bouyer bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size);
200 1.1 bouyer bp->b_bno = dblk;
201 1.1 bouyer bp->b_size = size;
202 1.1 bouyer }
203 1.1 bouyer }
204 1.1 bouyer
205 1.1 bouyer void
206 1.1 bouyer flush(fd, bp)
207 1.1 bouyer int fd;
208 1.2 lukem struct bufarea *bp;
209 1.1 bouyer {
210 1.2 lukem int i;
211 1.1 bouyer
212 1.1 bouyer if (!bp->b_dirty)
213 1.1 bouyer return;
214 1.1 bouyer if (bp->b_errs != 0)
215 1.1 bouyer pfatal("WRITING %sZERO'ED BLOCK %d TO DISK\n",
216 1.1 bouyer (bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ",
217 1.1 bouyer bp->b_bno);
218 1.1 bouyer bp->b_dirty = 0;
219 1.1 bouyer bp->b_errs = 0;
220 1.1 bouyer bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size);
221 1.1 bouyer if (bp != &sblk)
222 1.1 bouyer return;
223 1.1 bouyer for (i = 0; i < sblock.e2fs_ngdb; i++) {
224 1.1 bouyer bwrite(fswritefd, (char *)
225 1.1 bouyer &sblock.e2fs_gd[i* sblock.e2fs_bsize / sizeof(struct ext2_gd)],
226 1.1 bouyer fsbtodb(&sblock, ((sblock.e2fs_bsize>1024)?0:1)+i+1),
227 1.1 bouyer sblock.e2fs_bsize);
228 1.1 bouyer }
229 1.1 bouyer }
230 1.1 bouyer
231 1.1 bouyer static void
232 1.1 bouyer rwerror(mesg, blk)
233 1.1 bouyer char *mesg;
234 1.1 bouyer daddr_t blk;
235 1.1 bouyer {
236 1.1 bouyer
237 1.1 bouyer if (preen == 0)
238 1.1 bouyer printf("\n");
239 1.1 bouyer pfatal("CANNOT %s: BLK %d", mesg, blk);
240 1.1 bouyer if (reply("CONTINUE") == 0)
241 1.1 bouyer errexit("Program terminated\n");
242 1.1 bouyer }
243 1.1 bouyer
244 1.1 bouyer void
245 1.1 bouyer ckfini(markclean)
246 1.1 bouyer int markclean;
247 1.1 bouyer {
248 1.2 lukem struct bufarea *bp, *nbp;
249 1.1 bouyer int cnt = 0;
250 1.1 bouyer
251 1.1 bouyer if (fswritefd < 0) {
252 1.1 bouyer (void)close(fsreadfd);
253 1.1 bouyer return;
254 1.1 bouyer }
255 1.1 bouyer flush(fswritefd, &sblk);
256 1.1 bouyer if (havesb && sblk.b_bno != SBOFF / dev_bsize &&
257 1.3 bouyer !preen && reply("UPDATE STANDARD SUPERBLOCKS")) {
258 1.1 bouyer sblk.b_bno = SBOFF / dev_bsize;
259 1.1 bouyer sbdirty();
260 1.1 bouyer flush(fswritefd, &sblk);
261 1.3 bouyer copyback_sb(&asblk);
262 1.3 bouyer asblk.b_dirty = 1;
263 1.3 bouyer flush(fswritefd, &asblk);
264 1.1 bouyer }
265 1.1 bouyer for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
266 1.1 bouyer cnt++;
267 1.1 bouyer flush(fswritefd, bp);
268 1.1 bouyer nbp = bp->b_prev;
269 1.1 bouyer free(bp->b_un.b_buf);
270 1.1 bouyer free((char *)bp);
271 1.1 bouyer }
272 1.1 bouyer if (bufhead.b_size != cnt)
273 1.1 bouyer errexit("Panic: lost %d buffers\n", bufhead.b_size - cnt);
274 1.1 bouyer pbp = pdirbp = (struct bufarea *)0;
275 1.1 bouyer if (markclean && (sblock.e2fs.e2fs_state & E2FS_ISCLEAN) == 0) {
276 1.1 bouyer /*
277 1.1 bouyer * Mark the file system as clean, and sync the superblock.
278 1.1 bouyer */
279 1.1 bouyer if (preen)
280 1.1 bouyer pwarn("MARKING FILE SYSTEM CLEAN\n");
281 1.1 bouyer else if (!reply("MARK FILE SYSTEM CLEAN"))
282 1.1 bouyer markclean = 0;
283 1.1 bouyer if (markclean) {
284 1.1 bouyer sblock.e2fs.e2fs_state = E2FS_ISCLEAN;
285 1.1 bouyer sbdirty();
286 1.1 bouyer flush(fswritefd, &sblk);
287 1.1 bouyer }
288 1.1 bouyer }
289 1.1 bouyer if (debug)
290 1.1 bouyer printf("cache missed %ld of %ld (%d%%)\n", diskreads,
291 1.1 bouyer totalreads, (int)(diskreads * 100 / totalreads));
292 1.1 bouyer (void)close(fsreadfd);
293 1.1 bouyer (void)close(fswritefd);
294 1.1 bouyer }
295 1.1 bouyer
296 1.1 bouyer int
297 1.1 bouyer bread(fd, buf, blk, size)
298 1.1 bouyer int fd;
299 1.1 bouyer char *buf;
300 1.1 bouyer daddr_t blk;
301 1.1 bouyer long size;
302 1.1 bouyer {
303 1.1 bouyer char *cp;
304 1.1 bouyer int i, errs;
305 1.1 bouyer off_t offset;
306 1.1 bouyer
307 1.1 bouyer offset = blk;
308 1.1 bouyer offset *= dev_bsize;
309 1.1 bouyer if (lseek(fd, offset, 0) < 0)
310 1.1 bouyer rwerror("SEEK", blk);
311 1.1 bouyer else if (read(fd, buf, (int)size) == size)
312 1.1 bouyer return (0);
313 1.1 bouyer rwerror("READ", blk);
314 1.1 bouyer if (lseek(fd, offset, 0) < 0)
315 1.1 bouyer rwerror("SEEK", blk);
316 1.1 bouyer errs = 0;
317 1.1 bouyer memset(buf, 0, (size_t)size);
318 1.1 bouyer printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
319 1.1 bouyer for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
320 1.1 bouyer if (read(fd, cp, (int)secsize) != secsize) {
321 1.1 bouyer (void)lseek(fd, offset + i + secsize, 0);
322 1.1 bouyer if (secsize != dev_bsize && dev_bsize != 1)
323 1.1 bouyer printf(" %ld (%ld),",
324 1.1 bouyer (blk * dev_bsize + i) / secsize,
325 1.1 bouyer blk + i / dev_bsize);
326 1.1 bouyer else
327 1.1 bouyer printf(" %ld,", blk + i / dev_bsize);
328 1.1 bouyer errs++;
329 1.1 bouyer }
330 1.1 bouyer }
331 1.1 bouyer printf("\n");
332 1.1 bouyer return (errs);
333 1.1 bouyer }
334 1.1 bouyer
335 1.1 bouyer void
336 1.1 bouyer bwrite(fd, buf, blk, size)
337 1.1 bouyer int fd;
338 1.1 bouyer char *buf;
339 1.1 bouyer daddr_t blk;
340 1.1 bouyer long size;
341 1.1 bouyer {
342 1.1 bouyer int i;
343 1.1 bouyer char *cp;
344 1.1 bouyer off_t offset;
345 1.1 bouyer
346 1.1 bouyer if (fd < 0)
347 1.1 bouyer return;
348 1.1 bouyer offset = blk;
349 1.1 bouyer offset *= dev_bsize;
350 1.1 bouyer if (lseek(fd, offset, 0) < 0)
351 1.1 bouyer rwerror("SEEK", blk);
352 1.1 bouyer else if (write(fd, buf, (int)size) == size) {
353 1.1 bouyer fsmodified = 1;
354 1.1 bouyer return;
355 1.1 bouyer }
356 1.1 bouyer rwerror("WRITE", blk);
357 1.1 bouyer if (lseek(fd, offset, 0) < 0)
358 1.1 bouyer rwerror("SEEK", blk);
359 1.1 bouyer printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
360 1.1 bouyer for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
361 1.1 bouyer if (write(fd, cp, (int)dev_bsize) != dev_bsize) {
362 1.1 bouyer (void)lseek(fd, offset + i + dev_bsize, 0);
363 1.1 bouyer printf(" %ld,", blk + i / dev_bsize);
364 1.1 bouyer }
365 1.1 bouyer printf("\n");
366 1.1 bouyer return;
367 1.1 bouyer }
368 1.1 bouyer
369 1.1 bouyer /*
370 1.1 bouyer * allocate a data block
371 1.1 bouyer */
372 1.1 bouyer int
373 1.1 bouyer allocblk()
374 1.1 bouyer {
375 1.2 lukem int i;
376 1.1 bouyer
377 1.1 bouyer for (i = 0; i < maxfsblock - 1; i++) {
378 1.1 bouyer if (testbmap(i))
379 1.1 bouyer continue;
380 1.1 bouyer setbmap(i);
381 1.1 bouyer n_blks ++;
382 1.1 bouyer return (i);
383 1.1 bouyer }
384 1.1 bouyer return (0);
385 1.1 bouyer }
386 1.1 bouyer
387 1.1 bouyer /*
388 1.1 bouyer * Free a previously allocated block
389 1.1 bouyer */
390 1.1 bouyer void
391 1.1 bouyer freeblk(blkno)
392 1.1 bouyer daddr_t blkno;
393 1.1 bouyer {
394 1.1 bouyer struct inodesc idesc;
395 1.1 bouyer
396 1.1 bouyer idesc.id_blkno = blkno;
397 1.1 bouyer idesc.id_numfrags = 1;
398 1.1 bouyer (void)pass4check(&idesc);
399 1.1 bouyer }
400 1.1 bouyer
401 1.1 bouyer /*
402 1.1 bouyer * Find a pathname
403 1.1 bouyer */
404 1.1 bouyer void
405 1.1 bouyer getpathname(namebuf, curdir, ino)
406 1.1 bouyer char *namebuf;
407 1.1 bouyer ino_t curdir, ino;
408 1.1 bouyer {
409 1.1 bouyer int len;
410 1.2 lukem char *cp;
411 1.1 bouyer struct inodesc idesc;
412 1.1 bouyer static int busy = 0;
413 1.1 bouyer
414 1.1 bouyer if (curdir == ino && ino == EXT2_ROOTINO) {
415 1.1 bouyer (void)strcpy(namebuf, "/");
416 1.1 bouyer return;
417 1.1 bouyer }
418 1.1 bouyer if (busy ||
419 1.1 bouyer (statemap[curdir] != DSTATE && statemap[curdir] != DFOUND)) {
420 1.1 bouyer (void)strcpy(namebuf, "?");
421 1.1 bouyer return;
422 1.1 bouyer }
423 1.1 bouyer busy = 1;
424 1.1 bouyer memset(&idesc, 0, sizeof(struct inodesc));
425 1.1 bouyer idesc.id_type = DATA;
426 1.1 bouyer idesc.id_fix = IGNORE;
427 1.1 bouyer cp = &namebuf[MAXPATHLEN - 1];
428 1.1 bouyer *cp = '\0';
429 1.1 bouyer if (curdir != ino) {
430 1.1 bouyer idesc.id_parent = curdir;
431 1.1 bouyer goto namelookup;
432 1.1 bouyer }
433 1.1 bouyer while (ino != EXT2_ROOTINO) {
434 1.1 bouyer idesc.id_number = ino;
435 1.1 bouyer idesc.id_func = findino;
436 1.1 bouyer idesc.id_name = "..";
437 1.1 bouyer if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
438 1.1 bouyer break;
439 1.1 bouyer namelookup:
440 1.1 bouyer idesc.id_number = idesc.id_parent;
441 1.1 bouyer idesc.id_parent = ino;
442 1.1 bouyer idesc.id_func = findname;
443 1.1 bouyer idesc.id_name = namebuf;
444 1.1 bouyer if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
445 1.1 bouyer break;
446 1.1 bouyer len = strlen(namebuf);
447 1.1 bouyer cp -= len;
448 1.1 bouyer memcpy(cp, namebuf, (size_t)len);
449 1.1 bouyer *--cp = '/';
450 1.1 bouyer if (cp < &namebuf[EXT2FS_MAXNAMLEN])
451 1.1 bouyer break;
452 1.1 bouyer ino = idesc.id_number;
453 1.1 bouyer }
454 1.1 bouyer busy = 0;
455 1.1 bouyer if (ino != EXT2_ROOTINO)
456 1.1 bouyer *--cp = '?';
457 1.1 bouyer memcpy(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
458 1.1 bouyer }
459 1.1 bouyer
460 1.1 bouyer void
461 1.1 bouyer catch(n)
462 1.1 bouyer int n;
463 1.1 bouyer {
464 1.1 bouyer ckfini(0);
465 1.1 bouyer exit(12);
466 1.1 bouyer }
467 1.1 bouyer
468 1.1 bouyer /*
469 1.1 bouyer * When preening, allow a single quit to signal
470 1.1 bouyer * a special exit after filesystem checks complete
471 1.1 bouyer * so that reboot sequence may be interrupted.
472 1.1 bouyer */
473 1.1 bouyer void
474 1.1 bouyer catchquit(n)
475 1.1 bouyer int n;
476 1.1 bouyer {
477 1.1 bouyer extern returntosingle;
478 1.1 bouyer
479 1.1 bouyer printf("returning to single-user after filesystem check\n");
480 1.1 bouyer returntosingle = 1;
481 1.1 bouyer (void)signal(SIGQUIT, SIG_DFL);
482 1.1 bouyer }
483 1.1 bouyer
484 1.1 bouyer /*
485 1.1 bouyer * Ignore a single quit signal; wait and flush just in case.
486 1.1 bouyer * Used by child processes in preen.
487 1.1 bouyer */
488 1.1 bouyer void
489 1.1 bouyer voidquit(n)
490 1.1 bouyer int n;
491 1.1 bouyer {
492 1.1 bouyer
493 1.1 bouyer sleep(1);
494 1.1 bouyer (void)signal(SIGQUIT, SIG_IGN);
495 1.1 bouyer (void)signal(SIGQUIT, SIG_DFL);
496 1.1 bouyer }
497 1.1 bouyer
498 1.1 bouyer /*
499 1.1 bouyer * determine whether an inode should be fixed.
500 1.1 bouyer */
501 1.1 bouyer int
502 1.1 bouyer dofix(idesc, msg)
503 1.2 lukem struct inodesc *idesc;
504 1.1 bouyer char *msg;
505 1.1 bouyer {
506 1.1 bouyer
507 1.1 bouyer switch (idesc->id_fix) {
508 1.1 bouyer
509 1.1 bouyer case DONTKNOW:
510 1.1 bouyer if (idesc->id_type == DATA)
511 1.1 bouyer direrror(idesc->id_number, msg);
512 1.1 bouyer else
513 1.1 bouyer pwarn(msg);
514 1.1 bouyer if (preen) {
515 1.1 bouyer printf(" (SALVAGED)\n");
516 1.1 bouyer idesc->id_fix = FIX;
517 1.1 bouyer return (ALTERED);
518 1.1 bouyer }
519 1.1 bouyer if (reply("SALVAGE") == 0) {
520 1.1 bouyer idesc->id_fix = NOFIX;
521 1.1 bouyer return (0);
522 1.1 bouyer }
523 1.1 bouyer idesc->id_fix = FIX;
524 1.1 bouyer return (ALTERED);
525 1.1 bouyer
526 1.1 bouyer case FIX:
527 1.1 bouyer return (ALTERED);
528 1.1 bouyer
529 1.1 bouyer case NOFIX:
530 1.1 bouyer case IGNORE:
531 1.1 bouyer return (0);
532 1.1 bouyer
533 1.1 bouyer default:
534 1.1 bouyer errexit("UNKNOWN INODESC FIX MODE %d\n", idesc->id_fix);
535 1.1 bouyer }
536 1.1 bouyer /* NOTREACHED */
537 1.1 bouyer }
538