1 static char *sccsid = "@(#)icheck.c 1.19 (Berkeley) 02/25/82"; 2 3 /* 4 * icheck 5 */ 6 #define NB 500 7 #define MAXFN 500 8 #define MAXNINDIR (MAXBSIZE / sizeof (daddr_t)) 9 10 #ifndef STANDALONE 11 #include <stdio.h> 12 #endif 13 #include "../h/param.h" 14 #include "../h/inode.h" 15 #include "../h/fs.h" 16 17 union { 18 struct fs sb; 19 char pad[MAXBSIZE]; 20 } sbun; 21 #define sblock sbun.sb 22 23 union { 24 struct cg cg; 25 char pad[MAXBSIZE]; 26 } cgun; 27 #define cgrp cgun.cg 28 29 struct dinode itab[MAXIPG]; 30 daddr_t blist[NB]; 31 char *bmap; 32 33 int mflg; 34 int sflg; 35 int dflg; 36 int fi; 37 ino_t ino; 38 int cginit; 39 40 ino_t nrfile; 41 ino_t ndfile; 42 ino_t nbfile; 43 ino_t ncfile; 44 ino_t nmcfile; 45 46 daddr_t nblock; 47 daddr_t nfrag; 48 daddr_t nindir; 49 daddr_t niindir; 50 51 daddr_t nffree; 52 daddr_t nbfree; 53 54 daddr_t ndup; 55 56 int nerror; 57 58 extern int inside[], around[]; 59 extern unsigned char *fragtbl[]; 60 61 long atol(); 62 #ifndef STANDALONE 63 char *malloc(); 64 char *calloc(); 65 #endif 66 67 main(argc, argv) 68 int argc; 69 char *argv[]; 70 { 71 register i; 72 long n; 73 74 blist[0] = -1; 75 #ifndef STANDALONE 76 while (--argc) { 77 argv++; 78 if (**argv=='-') 79 switch ((*argv)[1]) { 80 case 'd': 81 dflg++; 82 continue; 83 84 case 'm': 85 mflg++; 86 continue; 87 88 case 's': 89 sflg++; 90 continue; 91 92 case 'b': 93 for(i=0; i<NB; i++) { 94 n = atol(argv[1]); 95 if(n == 0) 96 break; 97 blist[i] = n; 98 argv++; 99 argc--; 100 } 101 blist[i] = -1; 102 continue; 103 104 default: 105 printf("Bad flag\n"); 106 } 107 check(*argv); 108 } 109 #else 110 { 111 static char fname[128]; 112 113 printf("File: "); 114 gets(fname); 115 check(fname); 116 } 117 #endif 118 return(nerror); 119 } 120 121 check(file) 122 char *file; 123 { 124 register i, j, c; 125 daddr_t d, cgd, cbase, b; 126 long n; 127 128 fi = open(file, sflg ? 2 : 0); 129 if (fi < 0) { 130 perror(file); 131 nerror |= 04; 132 return; 133 } 134 printf("%s:\n", file); 135 nrfile = 0; 136 ndfile = 0; 137 ncfile = 0; 138 nbfile = 0; 139 nmcfile = 0; 140 141 nblock = 0; 142 nfrag = 0; 143 nindir = 0; 144 niindir = 0; 145 146 ndup = 0; 147 #ifndef STANDALONE 148 sync(); 149 #endif 150 getsb(&sblock, file); 151 if (nerror) 152 return; 153 ino = 0; 154 n = roundup(howmany(sblock.fs_size, NBBY), sizeof(short)); 155 #ifdef STANDALONE 156 bmap = NULL; 157 #else 158 bmap = malloc((unsigned)n); 159 #endif 160 if (bmap==NULL) { 161 printf("Not enough core; duplicates unchecked\n"); 162 dflg++; 163 if (sflg) { 164 printf("No Updates\n"); 165 sflg = 0; 166 } 167 } 168 ino = 0; 169 cginit = 1; 170 if(!dflg) { 171 for (i=0; i<(unsigned)n; i++) 172 bmap[i] = 0; 173 for (c=0; c < sblock.fs_ncg; c++) { 174 cgd = cgtod(&sblock, c); 175 for (d = cgbase(&sblock, c); d < cgd; d += sblock.fs_frag) 176 chk(d, "badcg", sblock.fs_bsize); 177 d = cgimin(&sblock, c); 178 while (cgd < d) { 179 chk(cgd, "cg", sblock.fs_bsize); 180 cgd += sblock.fs_frag; 181 } 182 d = cgdmin(&sblock, c); 183 for (; cgd < d; cgd += sblock.fs_frag) 184 chk(cgd, "inode", sblock.fs_bsize); 185 if (c == 0) { 186 d += howmany(sblock.fs_cssize, sblock.fs_bsize) 187 * sblock.fs_frag; 188 for (; cgd < d; cgd += sblock.fs_frag) 189 chk(cgd, "csum", sblock.fs_bsize); 190 } 191 } 192 } 193 cginit = 0; 194 for (c = 0; c < sblock.fs_ncg; c++) { 195 bread(fsbtodb(&sblock, cgimin(&sblock, c)), (char *)itab, 196 sblock.fs_ipg * sizeof (struct dinode)); 197 for (j=0; j < sblock.fs_ipg; j++) { 198 pass1(&itab[j]); 199 ino++; 200 } 201 } 202 ino = 0; 203 #ifndef STANDALONE 204 sync(); 205 #endif 206 if (sflg) { 207 makecg(); 208 close(fi); 209 #ifndef STANDALONE 210 if (bmap) 211 free(bmap); 212 #endif 213 return; 214 } 215 nffree = 0; 216 nbfree = 0; 217 for (c = 0; c < sblock.fs_ncg; c++) { 218 cbase = cgbase(&sblock, c); 219 bread(fsbtodb(&sblock, cgtod(&sblock, c)), (char *)&cgrp, 220 sblock.fs_cgsize); 221 for (b = 0; b < sblock.fs_fpg; b += sblock.fs_frag) { 222 if (isblock(&sblock, cgrp.cg_free, 223 b / sblock.fs_frag)) { 224 nbfree++; 225 chk(cbase+b, "block", sblock.fs_bsize); 226 } else { 227 for (d = 0; d < sblock.fs_frag; d++) 228 if (isset(cgrp.cg_free, b+d)) { 229 chk(cbase+b+d, "frag", sblock.fs_fsize); 230 nffree++; 231 } 232 } 233 } 234 } 235 close(fi); 236 #ifndef STANDALONE 237 if (bmap) 238 free(bmap); 239 #endif 240 241 i = nrfile + ndfile + ncfile + nbfile + nmcfile; 242 #ifndef STANDALONE 243 printf("files %6u (r=%u,d=%u,b=%u,c=%u,mc=%u)\n", 244 i, nrfile, ndfile, nbfile, ncfile, nmcfile); 245 #else 246 printf("files %u (r=%u,d=%u,b=%u,c=%u,mc=%u)\n", 247 i, nrfile, ndfile, nbfile, ncfile, nmcfile); 248 #endif 249 n = (nblock + nindir + niindir) * sblock.fs_frag + nfrag; 250 #ifdef STANDALONE 251 printf("used %ld (i=%ld,ii=%ld,b=%ld,f=%ld)\n", 252 n, nindir, niindir, nblock, nfrag); 253 printf("free %ld (b=%ld,f=%ld)\n", nffree + sblock.fs_frag * nbfree, 254 nbfree, nffree); 255 #else 256 printf("used %7ld (i=%ld,ii=%ld,b=%ld,f=%ld)\n", 257 n, nindir, niindir, nblock, nfrag); 258 printf("free %7ld (b=%ld,f=%ld)\n", nffree + sblock.fs_frag * nbfree, 259 nbfree, nffree); 260 #endif 261 if(!dflg) { 262 n = 0; 263 for (d = 0; d < sblock.fs_size; d++) 264 if(!duped(d, sblock.fs_fsize)) { 265 if(mflg) 266 printf("%ld missing\n", d); 267 n++; 268 } 269 printf("missing%5ld\n", n); 270 } 271 } 272 273 pass1(ip) 274 register struct dinode *ip; 275 { 276 daddr_t ind1[MAXNINDIR]; 277 daddr_t ind2[MAXNINDIR]; 278 daddr_t db, ib; 279 register int i, j, k, siz; 280 281 i = ip->di_mode & IFMT; 282 if(i == 0) 283 return; 284 switch (i) { 285 case IFCHR: 286 ncfile++; 287 return; 288 case IFBLK: 289 nbfile++; 290 return; 291 case IFDIR: 292 ndfile++; 293 break; 294 case IFREG: 295 nrfile++; 296 break; 297 default: 298 printf("bad mode %u\n", ino); 299 return; 300 } 301 for (i = 0; i < NDADDR; i++) { 302 db = ip->di_db[i]; 303 if (db == 0) 304 continue; 305 siz = dblksize(&sblock, ip, i); 306 chk(db, "data (block)", siz); 307 if (siz == sblock.fs_bsize) 308 nblock++; 309 else 310 nfrag += howmany(siz, sblock.fs_fsize); 311 } 312 for(i = 0; i < NIADDR; i++) { 313 ib = ip->di_ib[i]; 314 if(ib == 0) 315 continue; 316 if (chk(ib, "1st indirect", sblock.fs_bsize)) 317 continue; 318 bread(fsbtodb(&sblock, ib), (char *)ind1, sblock.fs_bsize); 319 nindir++; 320 for (j = 0; j < NINDIR(&sblock); j++) { 321 ib = ind1[j]; 322 if (ib == 0) 323 continue; 324 if (i == 0) { 325 siz = dblksize(&sblock, ip, NDADDR + j); 326 chk(ib, "data (large)", siz); 327 if (siz == sblock.fs_bsize) 328 nblock++; 329 else 330 nfrag += howmany(siz, sblock.fs_fsize); 331 continue; 332 } 333 if (chk(ib, "2nd indirect", sblock.fs_bsize)) 334 continue; 335 bread(fsbtodb(&sblock, ib), (char *)ind2, 336 sblock.fs_bsize); 337 niindir++; 338 for (k = 0; k < NINDIR(&sblock); k++) { 339 ib = ind2[k]; 340 if (ib == 0) 341 continue; 342 siz = dblksize(&sblock, ip, 343 NDADDR + NINDIR(&sblock) * (i + j) + k); 344 chk(ib, "data (huge)", siz); 345 if (siz == sblock.fs_bsize) 346 nblock++; 347 else 348 nfrag += howmany(siz, sblock.fs_fsize); 349 } 350 } 351 } 352 } 353 354 chk(bno, s, size) 355 daddr_t bno; 356 char *s; 357 int size; 358 { 359 register n, cg; 360 int frags; 361 362 cg = dtog(&sblock, bno); 363 if (cginit==0 && 364 bno<cgdmin(&sblock, cg) || bno >= sblock.fs_frag * sblock.fs_size) { 365 printf("%ld bad; inode=%u, class=%s\n", bno, ino, s); 366 return(1); 367 } 368 if (size == sblock.fs_bsize) { 369 if (duped(bno, size)) { 370 printf("%ld dup block; inode=%u, class=%s\n", 371 bno, ino, s); 372 ndup += sblock.fs_frag; 373 } 374 } else { 375 frags = numfrags(&sblock, size); 376 for (n = 0; n < frags; n++) { 377 if (duped(bno + n, sblock.fs_fsize)) { 378 printf("%ld dup frag; inode=%u, class=%s\n", 379 bno, ino, s); 380 ndup++; 381 } 382 } 383 } 384 for (n=0; blist[n] != -1; n++) 385 if (bno == blist[n]) 386 printf("%ld arg; inode=%u, class=%s\n", bno, ino, s); 387 return(0); 388 } 389 390 duped(bno, size) 391 daddr_t bno; 392 int size; 393 { 394 if(dflg) 395 return(0); 396 if (size != sblock.fs_fsize && size != sblock.fs_bsize) 397 printf("bad size %d to duped\n", size); 398 if (size == sblock.fs_fsize) { 399 if (isset(bmap, bno)) 400 return(1); 401 setbit(bmap, bno); 402 return (0); 403 } 404 if (bno % sblock.fs_frag != 0) 405 printf("bad bno %d to duped\n", bno); 406 if (isblock(&sblock, bmap, bno/sblock.fs_frag)) 407 return (1); 408 setblock(&sblock, bmap, bno/sblock.fs_frag); 409 return(0); 410 } 411 412 makecg() 413 { 414 int c, blk; 415 daddr_t dbase, d, dmin, dmax; 416 long i, j, s; 417 register struct csum *cs; 418 register struct dinode *dp; 419 420 sblock.fs_cstotal.cs_nbfree = 0; 421 sblock.fs_cstotal.cs_nffree = 0; 422 sblock.fs_cstotal.cs_nifree = 0; 423 sblock.fs_cstotal.cs_ndir = 0; 424 for (c = 0; c < sblock.fs_ncg; c++) { 425 dbase = cgbase(&sblock, c); 426 dmax = dbase + sblock.fs_fpg; 427 if (dmax > sblock.fs_size) { 428 for ( ; dmax >= sblock.fs_size; dmax--) 429 clrbit(cgrp.cg_free, dmax - dbase); 430 dmax++; 431 } 432 dmin = sblock.fs_dblkno; 433 cs = &sblock.fs_cs(&sblock, c); 434 cgrp.cg_time = time(0); 435 cgrp.cg_magic = CG_MAGIC; 436 cgrp.cg_cgx = c; 437 cgrp.cg_ncyl = sblock.fs_cpg; 438 cgrp.cg_niblk = sblock.fs_ipg; 439 cgrp.cg_ndblk = dmax - dbase; 440 cgrp.cg_cs.cs_ndir = 0; 441 cgrp.cg_cs.cs_nffree = 0; 442 cgrp.cg_cs.cs_nbfree = 0; 443 cgrp.cg_cs.cs_nifree = 0; 444 cgrp.cg_rotor = dmin; 445 cgrp.cg_frotor = dmin; 446 cgrp.cg_irotor = 0; 447 for (i = 0; i < sblock.fs_frag; i++) 448 cgrp.cg_frsum[i] = 0; 449 bread(fsbtodb(&sblock, cgimin(&sblock, c)), (char *)itab, 450 sblock.fs_ipg * sizeof(struct dinode)); 451 for (i = 0; i < sblock.fs_ipg; i++) { 452 cgrp.cg_cs.cs_nifree++; 453 clrbit(cgrp.cg_iused, i); 454 dp = &itab[i]; 455 if ((dp->di_mode & IFMT) != 0) { 456 if ((dp->di_mode & IFMT) == IFDIR) 457 cgrp.cg_cs.cs_ndir++; 458 cgrp.cg_cs.cs_nifree--; 459 setbit(cgrp.cg_iused, i); 460 continue; 461 } 462 } 463 while (i < MAXIPG) { 464 clrbit(cgrp.cg_iused, i); 465 i++; 466 } 467 if (c == 0) 468 for (i = 0; i < ROOTINO; i++) { 469 setbit(cgrp.cg_iused, i); 470 cgrp.cg_cs.cs_nifree--; 471 } 472 for (s = 0; s < MAXCPG; s++) { 473 cgrp.cg_btot[s] = 0; 474 for (i = 0; i < NRPOS; i++) 475 cgrp.cg_b[s][i] = 0; 476 } 477 if (c == 0) { 478 dmin += howmany(sblock.fs_cssize, sblock.fs_bsize) * 479 sblock.fs_frag; 480 } 481 for (d = 0; d < dmin; d++) 482 clrbit(cgrp.cg_free, d); 483 for (; (d + sblock.fs_frag) <= dmax - dbase; d += sblock.fs_frag) { 484 j = 0; 485 for (i = 0; i < sblock.fs_frag; i++) { 486 if (!isset(bmap, dbase+d+i)) { 487 setbit(cgrp.cg_free, d+i); 488 j++; 489 } else 490 clrbit(cgrp.cg_free, d+i); 491 } 492 if (j == sblock.fs_frag) { 493 cgrp.cg_cs.cs_nbfree++; 494 cgrp.cg_btot[cbtocylno(&sblock, d)]++; 495 cgrp.cg_b[cbtocylno(&sblock, d)] 496 [cbtorpos(&sblock, d)]++; 497 } else if (j > 0) { 498 cgrp.cg_cs.cs_nffree += j; 499 blk = ((cgrp.cg_free[d / NBBY] >> (d % NBBY)) & 500 (0xff >> (NBBY - sblock.fs_frag))); 501 fragacct(&sblock, blk, cgrp.cg_frsum, 1); 502 } 503 } 504 for (j = d; d < dmax - dbase; d++) { 505 if (!isset(bmap, dbase+d)) { 506 setbit(cgrp.cg_free, d); 507 cgrp.cg_cs.cs_nffree++; 508 } else 509 clrbit(cgrp.cg_free, d); 510 } 511 if (j != d) { 512 blk = ((cgrp.cg_free[j / NBBY] >> (j % NBBY)) & 513 (0xff >> (NBBY - sblock.fs_frag))); 514 fragacct(&sblock, blk, cgrp.cg_frsum, 1); 515 } 516 for (; d < MAXBPG(&sblock); d++) 517 clrbit(cgrp.cg_free, d); 518 sblock.fs_cstotal.cs_nffree += cgrp.cg_cs.cs_nffree; 519 sblock.fs_cstotal.cs_nbfree += cgrp.cg_cs.cs_nbfree; 520 sblock.fs_cstotal.cs_nifree += cgrp.cg_cs.cs_nifree; 521 sblock.fs_cstotal.cs_ndir += cgrp.cg_cs.cs_ndir; 522 *cs = cgrp.cg_cs; 523 bwrite(fsbtodb(&sblock, cgtod(&sblock, c)), &cgrp, 524 sblock.fs_cgsize); 525 } 526 for (i = 0; i < howmany(sblock.fs_cssize, sblock.fs_bsize); i++) { 527 bwrite(fsbtodb(&sblock, 528 sblock.fs_csaddr + (i * sblock.fs_frag)), 529 (char *)sblock.fs_csp[i], sblock.fs_bsize); 530 } 531 sblock.fs_ronly = 0; 532 sblock.fs_fmod = 0; 533 bwrite(SBLOCK, (char *)&sblock, SBSIZE); 534 } 535 536 /* 537 * update the frsum fields to reflect addition or deletion 538 * of some frags 539 */ 540 fragacct(fs, fragmap, fraglist, cnt) 541 struct fs *fs; 542 int fragmap; 543 long fraglist[]; 544 int cnt; 545 { 546 int inblk; 547 register int field, subfield; 548 register int siz, pos; 549 550 inblk = (int)(fragtbl[fs->fs_frag][fragmap] << 1); 551 fragmap <<= 1; 552 for (siz = 1; siz < fs->fs_frag; siz++) { 553 if (((1 << siz) & inblk) == 0) 554 continue; 555 field = around[siz]; 556 subfield = inside[siz]; 557 for (pos = siz; pos <= fs->fs_frag; pos++) { 558 if ((fragmap & field) == subfield) { 559 fraglist[siz] += cnt; 560 pos += siz; 561 field <<= siz; 562 subfield <<= siz; 563 } 564 field <<= 1; 565 subfield <<= 1; 566 } 567 } 568 } 569 570 getsb(fs, file) 571 register struct fs *fs; 572 char *file; 573 { 574 int i; 575 576 if (bread(SBLOCK, fs, SBSIZE)) { 577 printf("bad super block"); 578 perror(file); 579 nerror |= 04; 580 return; 581 } 582 if (fs->fs_magic != FS_MAGIC) { 583 printf("%s: bad magic number\n", file); 584 nerror |= 04; 585 return; 586 } 587 for (i = 0; i < howmany(fs->fs_cssize, fs->fs_bsize); i++) { 588 fs->fs_csp[i] = (struct csum *)calloc(1, fs->fs_bsize); 589 bread(fsbtodb(fs, fs->fs_csaddr + (i * fs->fs_frag)), 590 (char *)fs->fs_csp[i], fs->fs_bsize); 591 } 592 } 593 594 bwrite(blk, buf, size) 595 char *buf; 596 daddr_t blk; 597 register size; 598 { 599 if (lseek(fi, blk * DEV_BSIZE, 0) < 0) { 600 perror("FS SEEK"); 601 return(1); 602 } 603 if (write(fi, buf, size) != size) { 604 perror("FS WRITE"); 605 return(1); 606 } 607 return (0); 608 } 609 610 bread(bno, buf, cnt) 611 daddr_t bno; 612 char *buf; 613 { 614 register i; 615 616 lseek(fi, bno * DEV_BSIZE, 0); 617 if ((i = read(fi, buf, cnt)) != cnt) { 618 if (sflg) { 619 printf("No Update\n"); 620 sflg = 0; 621 } 622 for(i=0; i<sblock.fs_bsize; i++) 623 buf[i] = 0; 624 return (1); 625 } 626 return (0); 627 } 628 629 /* 630 * block operations 631 */ 632 633 isblock(fs, cp, h) 634 struct fs *fs; 635 unsigned char *cp; 636 int h; 637 { 638 unsigned char mask; 639 640 switch (fs->fs_frag) { 641 case 8: 642 return (cp[h] == 0xff); 643 case 4: 644 mask = 0x0f << ((h & 0x1) << 2); 645 return ((cp[h >> 1] & mask) == mask); 646 case 2: 647 mask = 0x03 << ((h & 0x3) << 1); 648 return ((cp[h >> 2] & mask) == mask); 649 case 1: 650 mask = 0x01 << (h & 0x7); 651 return ((cp[h >> 3] & mask) == mask); 652 default: 653 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); 654 return; 655 } 656 } 657 658 setblock(fs, cp, h) 659 struct fs *fs; 660 unsigned char *cp; 661 int h; 662 { 663 switch (fs->fs_frag) { 664 case 8: 665 cp[h] = 0xff; 666 return; 667 case 4: 668 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 669 return; 670 case 2: 671 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 672 return; 673 case 1: 674 cp[h >> 3] |= (0x01 << (h & 0x7)); 675 return; 676 default: 677 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); 678 return; 679 } 680 } 681