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