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