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