1 /* 2 * Copyright (c) 1983 Regents of the University of California. 3 * All rights reserved. The Berkeley software License Agreement 4 * specifies the terms and conditions for redistribution. 5 */ 6 7 #ifndef lint 8 char copyright[] = 9 "@(#) Copyright (c) 1983 Regents of the University of California.\n\ 10 All rights reserved.\n"; 11 #endif not lint 12 13 #ifndef lint 14 static char sccsid[] = "@(#)dumpfs.c 5.5 (Berkeley) 02/23/87"; 15 #endif not lint 16 17 #include <sys/param.h> 18 #include <sys/inode.h> 19 #include <sys/fs.h> 20 21 #include <stdio.h> 22 #include <fstab.h> 23 24 /* 25 * dumpfs 26 */ 27 28 union { 29 struct fs fs; 30 char pad[MAXBSIZE]; 31 } fsun; 32 #define afs fsun.fs 33 34 union { 35 struct cg cg; 36 char pad[MAXBSIZE]; 37 } cgun; 38 #define acg cgun.cg 39 40 long dev_bsize = 1; 41 42 main(argc, argv) 43 char **argv; 44 { 45 register struct fstab *fs; 46 47 argc--, argv++; 48 if (argc < 1) { 49 fprintf(stderr, "usage: dumpfs fs ...\n"); 50 exit(1); 51 } 52 for (; argc > 0; argv++, argc--) { 53 fs = getfsfile(*argv); 54 if (fs == 0) 55 dumpfs(*argv); 56 else 57 dumpfs(fs->fs_spec); 58 } 59 } 60 61 dumpfs(name) 62 char *name; 63 { 64 int c, i, j, k, size; 65 66 close(0); 67 if (open(name, 0) != 0) { 68 perror(name); 69 return; 70 } 71 lseek(0, SBOFF, 0); 72 if (read(0, &afs, SBSIZE) != SBSIZE) { 73 perror(name); 74 return; 75 } 76 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 77 printf("magic\t%x\ttime\t%s", afs.fs_magic, ctime(&afs.fs_time)); 78 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 79 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 80 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 81 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 82 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 83 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 84 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 85 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 86 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 87 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 88 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 89 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 90 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 91 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 92 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 93 afs.fs_maxcontig, afs.fs_maxbpg); 94 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n", 95 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps); 96 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 97 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 98 printf("trackskew %d\tinterleave %d\n", 99 afs.fs_trackskew, afs.fs_interleave); 100 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 101 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 102 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 103 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 104 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 105 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 106 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 107 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 108 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n", 109 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly); 110 if (afs.fs_cpc != 0) 111 printf("blocks available in each rotational position"); 112 else 113 printf("insufficient space to maintain rotational tables\n"); 114 for (c = 0; c < afs.fs_cpc; c++) { 115 printf("\ncylinder number %d:", c); 116 for (i = 0; i < NRPOS; i++) { 117 if (afs.fs_postbl[c][i] == -1) 118 continue; 119 printf("\n position %d:\t", i); 120 for (j = afs.fs_postbl[c][i], k = 1; ; 121 j += afs.fs_rotbl[j], k++) { 122 printf("%5d", j); 123 if (k % 12 == 0) 124 printf("\n\t\t"); 125 if (afs.fs_rotbl[j] == 0) 126 break; 127 } 128 } 129 } 130 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 131 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 132 size = afs.fs_cssize - i < afs.fs_bsize ? 133 afs.fs_cssize - i : afs.fs_bsize; 134 afs.fs_csp[j] = (struct csum *)calloc(1, size); 135 lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) * 136 dev_bsize, 0); 137 if (read(0, afs.fs_csp[j], size) != size) { 138 perror(name); 139 return; 140 } 141 } 142 for (i = 0; i < afs.fs_ncg; i++) { 143 struct csum *cs = &afs.fs_cs(&afs, i); 144 if (i && i % 4 == 0) 145 printf("\n\t"); 146 printf("(%d,%d,%d,%d) ", 147 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 148 } 149 printf("\n"); 150 if (afs.fs_ncyl % afs.fs_cpg) { 151 printf("cylinders in last group %d\n", 152 i = afs.fs_ncyl % afs.fs_cpg); 153 printf("blocks in last group %d\n", 154 i * afs.fs_spc / NSPB(&afs)); 155 } 156 printf("\n"); 157 for (i = 0; i < afs.fs_ncg; i++) 158 dumpcg(name, i); 159 close(0); 160 }; 161 162 dumpcg(name, c) 163 char *name; 164 int c; 165 { 166 int i,j; 167 168 printf("\ncg %d:\n", c); 169 lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0); 170 i = lseek(0, 0, 1); 171 if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) { 172 printf("dumpfs: %s: error reading cg\n", name); 173 return; 174 } 175 printf("magic\t%x\ttell\t%x\ttime\t%s", 176 acg.cg_magic, i, ctime(&acg.cg_time)); 177 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 178 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 179 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 180 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 181 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 182 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 183 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 184 for (i = 1, j = 0; i < afs.fs_frag; i++) { 185 printf("\t%d", acg.cg_frsum[i]); 186 j += i * acg.cg_frsum[i]; 187 } 188 printf("\nsum of frsum: %d\niused:\t", j); 189 pbits(acg.cg_iused, afs.fs_ipg); 190 printf("free:\t"); 191 pbits(acg.cg_free, afs.fs_fpg); 192 printf("b:\n"); 193 for (i = 0; i < afs.fs_cpg; i++) { 194 printf(" c%d:\t(%d)\t", i, acg.cg_btot[i]); 195 for (j = 0; j < NRPOS; j++) 196 printf(" %d", acg.cg_b[i][j]); 197 printf("\n"); 198 } 199 }; 200 201 pbits(cp, max) 202 register char *cp; 203 int max; 204 { 205 register int i; 206 int count = 0, j; 207 208 for (i = 0; i < max; i++) 209 if (isset(cp, i)) { 210 if (count) 211 printf(",%s", count %9 == 8 ? "\n\t" : " "); 212 count++; 213 printf("%d", i); 214 j = i; 215 while ((i+1)<max && isset(cp, i+1)) 216 i++; 217 if (i != j) 218 printf("-%d", i); 219 } 220 printf("\n"); 221 } 222