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