1 /* 2 * Copyright (c) 1983 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 char copyright[] = 36 "@(#) Copyright (c) 1983 The Regents of the University of California.\n\ 37 All rights reserved.\n"; 38 #endif /* not lint */ 39 40 #ifndef lint 41 /*static char sccsid[] = "from: @(#)dumpfs.c 5.10 (Berkeley) 6/1/90";*/ 42 static char rcsid[] = "$Id: dumpfs.c,v 1.5 1994/04/25 18:23:19 cgd Exp $"; 43 #endif /* not lint */ 44 45 #include <sys/param.h> 46 #include <sys/time.h> 47 #include <ufs/dinode.h> 48 #include <ufs/fs.h> 49 50 #include <stdio.h> 51 #include <fstab.h> 52 53 /* 54 * dumpfs 55 */ 56 57 union { 58 struct fs fs; 59 char pad[MAXBSIZE]; 60 } fsun; 61 #define afs fsun.fs 62 63 union { 64 struct cg cg; 65 char pad[MAXBSIZE]; 66 } cgun; 67 #define acg cgun.cg 68 69 long dev_bsize = 1; 70 71 main(argc, argv) 72 char **argv; 73 { 74 register struct fstab *fs; 75 76 argc--, argv++; 77 if (argc < 1) { 78 fprintf(stderr, "usage: dumpfs fs ...\n"); 79 exit(1); 80 } 81 for (; argc > 0; argv++, argc--) { 82 fs = getfsfile(*argv); 83 if (fs == 0) 84 dumpfs(*argv); 85 else 86 dumpfs(fs->fs_spec); 87 } 88 } 89 90 dumpfs(name) 91 char *name; 92 { 93 int c, i, j, k, size; 94 95 close(0); 96 if (open(name, 0) != 0) { 97 perror(name); 98 return; 99 } 100 lseek(0, SBOFF, 0); 101 if (read(0, &afs, SBSIZE) != SBSIZE) { 102 perror(name); 103 return; 104 } 105 if (afs.fs_postblformat == FS_42POSTBLFMT) 106 afs.fs_nrpos = 8; 107 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 108 printf("magic\t%x\tformat\t%s\ttime\t%s", afs.fs_magic, 109 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic", 110 ctime(&afs.fs_time)); 111 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 112 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 113 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 114 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 115 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 116 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 117 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 118 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 119 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 120 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 121 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 122 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 123 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 124 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 125 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 126 afs.fs_maxcontig, afs.fs_maxbpg); 127 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n", 128 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps); 129 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 130 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 131 printf("trackskew %d\tinterleave %d\n", 132 afs.fs_trackskew, afs.fs_interleave); 133 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 134 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 135 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 136 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 137 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 138 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 139 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 140 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 141 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n", 142 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly); 143 if (afs.fs_cpc != 0) 144 printf("blocks available in each of %d rotational positions", 145 afs.fs_nrpos); 146 else 147 printf("insufficient space to maintain rotational tables\n"); 148 for (c = 0; c < afs.fs_cpc; c++) { 149 printf("\ncylinder number %d:", c); 150 for (i = 0; i < afs.fs_nrpos; i++) { 151 if (fs_postbl(&afs, c)[i] == -1) 152 continue; 153 printf("\n position %d:\t", i); 154 for (j = fs_postbl(&afs, c)[i], k = 1; ; 155 j += fs_rotbl(&afs)[j], k++) { 156 printf("%5d", j); 157 if (k % 12 == 0) 158 printf("\n\t\t"); 159 if (fs_rotbl(&afs)[j] == 0) 160 break; 161 } 162 } 163 } 164 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 165 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 166 size = afs.fs_cssize - i < afs.fs_bsize ? 167 afs.fs_cssize - i : afs.fs_bsize; 168 afs.fs_csp[j] = (struct csum *)calloc(1, size); 169 lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) * 170 dev_bsize, 0); 171 if (read(0, afs.fs_csp[j], size) != size) { 172 perror(name); 173 return; 174 } 175 } 176 for (i = 0; i < afs.fs_ncg; i++) { 177 struct csum *cs = &afs.fs_cs(&afs, i); 178 if (i && i % 4 == 0) 179 printf("\n\t"); 180 printf("(%d,%d,%d,%d) ", 181 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 182 } 183 printf("\n"); 184 if (afs.fs_ncyl % afs.fs_cpg) { 185 printf("cylinders in last group %d\n", 186 i = afs.fs_ncyl % afs.fs_cpg); 187 printf("blocks in last group %d\n", 188 i * afs.fs_spc / NSPB(&afs)); 189 } 190 printf("\n"); 191 for (i = 0; i < afs.fs_ncg; i++) 192 dumpcg(name, i); 193 close(0); 194 }; 195 196 dumpcg(name, c) 197 char *name; 198 int c; 199 { 200 int i,j; 201 202 printf("\ncg %d:\n", c); 203 lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0); 204 i = lseek(0, 0, 1); 205 if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) { 206 printf("dumpfs: %s: error reading cg\n", name); 207 return; 208 } 209 printf("magic\t%x\ttell\t%x\ttime\t%s", 210 afs.fs_postblformat == FS_42POSTBLFMT ? 211 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 212 i, ctime(&acg.cg_time)); 213 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 214 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 215 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 216 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 217 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 218 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 219 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 220 for (i = 1, j = 0; i < afs.fs_frag; i++) { 221 printf("\t%d", acg.cg_frsum[i]); 222 j += i * acg.cg_frsum[i]; 223 } 224 printf("\nsum of frsum: %d\niused:\t", j); 225 pbits(cg_inosused(&acg), afs.fs_ipg); 226 printf("free:\t"); 227 pbits(cg_blksfree(&acg), afs.fs_fpg); 228 printf("b:\n"); 229 for (i = 0; i < afs.fs_cpg; i++) { 230 if (cg_blktot(&acg)[i] == 0) 231 continue; 232 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]); 233 for (j = 0; j < afs.fs_nrpos; j++) { 234 if (afs.fs_cpc > 0 && 235 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 236 continue; 237 printf(" %d", cg_blks(&afs, &acg, i)[j]); 238 } 239 printf("\n"); 240 } 241 }; 242 243 pbits(cp, max) 244 register char *cp; 245 int max; 246 { 247 register int i; 248 int count = 0, j; 249 250 for (i = 0; i < max; i++) 251 if (isset(cp, i)) { 252 if (count) 253 printf(",%s", count % 6 ? " " : "\n\t"); 254 count++; 255 printf("%d", i); 256 j = i; 257 while ((i+1)<max && isset(cp, i+1)) 258 i++; 259 if (i != j) 260 printf("-%d", i); 261 } 262 printf("\n"); 263 } 264