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.2 (Berkeley) 03/21/95"; 10 #endif /* not lint */ 11 12 #include <sys/param.h> 13 #include <sys/time.h> 14 #include <ufs/ufs/dinode.h> 15 #include <ufs/ufs/dir.h> 16 #include <ufs/ffs/fs.h> 17 #include <stdio.h> 18 #include <stdlib.h> 19 #include <string.h> 20 #include <ctype.h> 21 #include "fsck.h" 22 23 long diskreads, totalreads; /* Disk cache statistics */ 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 ufs_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 ufs_daddr_t blk; 151 long size; 152 { 153 ufs_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 ufs_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 if (fswritefd < 0) { 208 (void)close(fsreadfd); 209 return; 210 } 211 flush(fswritefd, &sblk); 212 if (havesb && sblk.b_bno != SBOFF / dev_bsize && 213 !preen && reply("UPDATE STANDARD SUPERBLOCK")) { 214 sblk.b_bno = SBOFF / dev_bsize; 215 sbdirty(); 216 flush(fswritefd, &sblk); 217 } 218 flush(fswritefd, &cgblk); 219 free(cgblk.b_un.b_buf); 220 for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) { 221 cnt++; 222 flush(fswritefd, bp); 223 nbp = bp->b_prev; 224 free(bp->b_un.b_buf); 225 free((char *)bp); 226 } 227 if (bufhead.b_size != cnt) 228 errexit("Panic: lost %d buffers\n", bufhead.b_size - cnt); 229 pbp = pdirbp = (struct bufarea *)0; 230 if (debug) 231 printf("cache missed %ld of %ld (%d%%)\n", diskreads, 232 totalreads, (int)(diskreads * 100 / totalreads)); 233 (void)close(fsreadfd); 234 (void)close(fswritefd); 235 } 236 237 bread(fd, buf, blk, size) 238 int fd; 239 char *buf; 240 ufs_daddr_t blk; 241 long size; 242 { 243 char *cp; 244 int i, errs; 245 off_t offset; 246 247 offset = blk; 248 offset *= dev_bsize; 249 if (lseek(fd, offset, 0) < 0) 250 rwerror("SEEK", blk); 251 else if (read(fd, buf, (int)size) == size) 252 return (0); 253 rwerror("READ", blk); 254 if (lseek(fd, offset, 0) < 0) 255 rwerror("SEEK", blk); 256 errs = 0; 257 bzero(buf, (size_t)size); 258 printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:"); 259 for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) { 260 if (read(fd, cp, (int)secsize) != secsize) { 261 (void)lseek(fd, offset + i + secsize, 0); 262 if (secsize != dev_bsize && dev_bsize != 1) 263 printf(" %ld (%ld),", 264 (blk * dev_bsize + i) / secsize, 265 blk + i / dev_bsize); 266 else 267 printf(" %ld,", blk + i / dev_bsize); 268 errs++; 269 } 270 } 271 printf("\n"); 272 return (errs); 273 } 274 275 bwrite(fd, buf, blk, size) 276 int fd; 277 char *buf; 278 ufs_daddr_t blk; 279 long size; 280 { 281 int i; 282 char *cp; 283 off_t offset; 284 285 if (fd < 0) 286 return; 287 offset = blk; 288 offset *= dev_bsize; 289 if (lseek(fd, offset, 0) < 0) 290 rwerror("SEEK", blk); 291 else if (write(fd, buf, (int)size) == size) { 292 fsmodified = 1; 293 return; 294 } 295 rwerror("WRITE", blk); 296 if (lseek(fd, offset, 0) < 0) 297 rwerror("SEEK", blk); 298 printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:"); 299 for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize) 300 if (write(fd, cp, (int)dev_bsize) != dev_bsize) { 301 (void)lseek(fd, offset + i + dev_bsize, 0); 302 printf(" %ld,", blk + i / dev_bsize); 303 } 304 printf("\n"); 305 return; 306 } 307 308 /* 309 * allocate a data block with the specified number of fragments 310 */ 311 allocblk(frags) 312 long frags; 313 { 314 register int i, j, k; 315 316 if (frags <= 0 || frags > sblock.fs_frag) 317 return (0); 318 for (i = 0; i < maxfsblock - sblock.fs_frag; i += sblock.fs_frag) { 319 for (j = 0; j <= sblock.fs_frag - frags; j++) { 320 if (testbmap(i + j)) 321 continue; 322 for (k = 1; k < frags; k++) 323 if (testbmap(i + j + k)) 324 break; 325 if (k < frags) { 326 j += k; 327 continue; 328 } 329 for (k = 0; k < frags; k++) 330 setbmap(i + j + k); 331 n_blks += frags; 332 return (i + j); 333 } 334 } 335 return (0); 336 } 337 338 /* 339 * Free a previously allocated block 340 */ 341 freeblk(blkno, frags) 342 ufs_daddr_t blkno; 343 long frags; 344 { 345 struct inodesc idesc; 346 347 idesc.id_blkno = blkno; 348 idesc.id_numfrags = frags; 349 (void)pass4check(&idesc); 350 } 351 352 /* 353 * Find a pathname 354 */ 355 getpathname(namebuf, curdir, ino) 356 char *namebuf; 357 ino_t curdir, ino; 358 { 359 int len; 360 register char *cp; 361 struct inodesc idesc; 362 static int busy = 0; 363 extern int findname(); 364 365 if (curdir == ino && ino == ROOTINO) { 366 (void)strcpy(namebuf, "/"); 367 return; 368 } 369 if (busy || 370 (statemap[curdir] != DSTATE && statemap[curdir] != DFOUND)) { 371 (void)strcpy(namebuf, "?"); 372 return; 373 } 374 busy = 1; 375 bzero((char *)&idesc, sizeof(struct inodesc)); 376 idesc.id_type = DATA; 377 idesc.id_fix = IGNORE; 378 cp = &namebuf[MAXPATHLEN - 1]; 379 *cp = '\0'; 380 if (curdir != ino) { 381 idesc.id_parent = curdir; 382 goto namelookup; 383 } 384 while (ino != ROOTINO) { 385 idesc.id_number = ino; 386 idesc.id_func = findino; 387 idesc.id_name = ".."; 388 if ((ckinode(ginode(ino), &idesc) & FOUND) == 0) 389 break; 390 namelookup: 391 idesc.id_number = idesc.id_parent; 392 idesc.id_parent = ino; 393 idesc.id_func = findname; 394 idesc.id_name = namebuf; 395 if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0) 396 break; 397 len = strlen(namebuf); 398 cp -= len; 399 bcopy(namebuf, cp, (size_t)len); 400 *--cp = '/'; 401 if (cp < &namebuf[MAXNAMLEN]) 402 break; 403 ino = idesc.id_number; 404 } 405 busy = 0; 406 if (ino != ROOTINO) 407 *--cp = '?'; 408 bcopy(cp, namebuf, (size_t)(&namebuf[MAXPATHLEN] - cp)); 409 } 410 411 void 412 catch() 413 { 414 if (!doinglevel2) 415 ckfini(); 416 exit(12); 417 } 418 419 /* 420 * When preening, allow a single quit to signal 421 * a special exit after filesystem checks complete 422 * so that reboot sequence may be interrupted. 423 */ 424 void 425 catchquit() 426 { 427 extern returntosingle; 428 429 printf("returning to single-user after filesystem check\n"); 430 returntosingle = 1; 431 (void)signal(SIGQUIT, SIG_DFL); 432 } 433 434 /* 435 * Ignore a single quit signal; wait and flush just in case. 436 * Used by child processes in preen. 437 */ 438 void 439 voidquit() 440 { 441 442 sleep(1); 443 (void)signal(SIGQUIT, SIG_IGN); 444 (void)signal(SIGQUIT, SIG_DFL); 445 } 446 447 /* 448 * determine whether an inode should be fixed. 449 */ 450 dofix(idesc, msg) 451 register struct inodesc *idesc; 452 char *msg; 453 { 454 455 switch (idesc->id_fix) { 456 457 case DONTKNOW: 458 if (idesc->id_type == DATA) 459 direrror(idesc->id_number, msg); 460 else 461 pwarn(msg); 462 if (preen) { 463 printf(" (SALVAGED)\n"); 464 idesc->id_fix = FIX; 465 return (ALTERED); 466 } 467 if (reply("SALVAGE") == 0) { 468 idesc->id_fix = NOFIX; 469 return (0); 470 } 471 idesc->id_fix = FIX; 472 return (ALTERED); 473 474 case FIX: 475 return (ALTERED); 476 477 case NOFIX: 478 case IGNORE: 479 return (0); 480 481 default: 482 errexit("UNKNOWN INODESC FIX MODE %d\n", idesc->id_fix); 483 } 484 /* NOTREACHED */ 485 } 486 487 /* VARARGS1 */ 488 errexit(s1, s2, s3, s4) 489 char *s1; 490 { 491 printf(s1, s2, s3, s4); 492 exit(8); 493 } 494 495 /* 496 * An unexpected inconsistency occured. 497 * Die if preening, otherwise just print message and continue. 498 */ 499 /* VARARGS1 */ 500 pfatal(s, a1, a2, a3) 501 char *s; 502 { 503 504 if (preen) { 505 printf("%s: ", cdevname); 506 printf(s, a1, a2, a3); 507 printf("\n"); 508 printf("%s: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY.\n", 509 cdevname); 510 exit(8); 511 } 512 printf(s, a1, a2, a3); 513 } 514 515 /* 516 * Pwarn just prints a message when not preening, 517 * or a warning (preceded by filename) when preening. 518 */ 519 /* VARARGS1 */ 520 pwarn(s, a1, a2, a3, a4, a5, a6) 521 char *s; 522 { 523 524 if (preen) 525 printf("%s: ", cdevname); 526 printf(s, a1, a2, a3, a4, a5, a6); 527 } 528 529 #ifndef lint 530 /* 531 * Stub for routines from kernel. 532 */ 533 panic(s) 534 char *s; 535 { 536 537 pfatal("INTERNAL INCONSISTENCY:"); 538 errexit(s); 539 } 540 #endif 541