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