1 /* 2 * Copyright (c) 1983, 1992, 1993 3 * The Regents of the University of California. 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 static char copyright[] = 36 "@(#) Copyright (c) 1983, 1992, 1993\n\ 37 The Regents of the University of California. All rights reserved.\n"; 38 #endif /* not lint */ 39 40 #ifndef lint 41 /*static char sccsid[] = "from: @(#)dumpfs.c 8.2 (Berkeley) 2/2/94";*/ 42 static char *rcsid = "$Id: dumpfs.c,v 1.6 1994/06/08 18:58:23 mycroft Exp $"; 43 #endif /* not lint */ 44 45 #include <sys/param.h> 46 #include <sys/time.h> 47 48 #include <ufs/ufs/dinode.h> 49 #include <ufs/ffs/fs.h> 50 51 #include <unistd.h> 52 #include <fcntl.h> 53 #include <errno.h> 54 #include <fstab.h> 55 #include <stdio.h> 56 #include <stdlib.h> 57 #include <string.h> 58 59 union { 60 struct fs fs; 61 char pad[MAXBSIZE]; 62 } fsun; 63 #define afs fsun.fs 64 65 union { 66 struct cg cg; 67 char pad[MAXBSIZE]; 68 } cgun; 69 #define acg cgun.cg 70 71 long dev_bsize = 1; 72 73 int dumpfs __P((char *)); 74 int dumpcg __P((char *, int, int)); 75 void pbits __P((void *, int)); 76 void usage __P((void)); 77 78 int 79 main(argc, argv) 80 int argc; 81 char *argv[]; 82 { 83 register struct fstab *fs; 84 int ch, eval; 85 86 while ((ch = getopt(argc, argv, "")) != EOF) 87 switch(ch) { 88 case '?': 89 default: 90 usage(); 91 } 92 argc -= optind; 93 argv += optind; 94 95 if (argc < 1) 96 usage(); 97 98 for (eval = 0; *argv; ++argv) 99 if ((fs = getfsfile(*argv)) == NULL) 100 eval |= dumpfs(*argv); 101 else 102 eval |= dumpfs(fs->fs_spec); 103 exit(eval); 104 } 105 106 int 107 dumpfs(name) 108 char *name; 109 { 110 int fd, c, i, j, k, size; 111 112 if ((fd = open(name, O_RDONLY, 0)) < 0) 113 goto err; 114 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 115 goto err; 116 if (read(fd, &afs, SBSIZE) != SBSIZE) 117 goto err; 118 119 if (afs.fs_postblformat == FS_42POSTBLFMT) 120 afs.fs_nrpos = 8; 121 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 122 printf("magic\t%x\ttime\t%s", afs.fs_magic, 123 ctime(&afs.fs_time)); 124 printf("cylgrp\t%s\tinodes\t%s\n", 125 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic", 126 afs.fs_inodefmt < FS_44INODEFMT ? "4.2/4.3BSD" : "4.4BSD"); 127 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 128 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 129 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 130 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 131 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 132 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 133 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 134 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 135 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 136 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 137 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 138 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 139 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 140 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 141 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 142 afs.fs_maxcontig, afs.fs_maxbpg); 143 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n", 144 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps); 145 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 146 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 147 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 148 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 149 afs.fs_contigsumsize); 150 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 151 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 152 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 153 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 154 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 155 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 156 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 157 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 158 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n", 159 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly); 160 if (afs.fs_cpc != 0) 161 printf("blocks available in each of %d rotational positions", 162 afs.fs_nrpos); 163 else 164 printf("insufficient space to maintain rotational tables\n"); 165 for (c = 0; c < afs.fs_cpc; c++) { 166 printf("\ncylinder number %d:", c); 167 for (i = 0; i < afs.fs_nrpos; i++) { 168 if (fs_postbl(&afs, c)[i] == -1) 169 continue; 170 printf("\n position %d:\t", i); 171 for (j = fs_postbl(&afs, c)[i], k = 1; ; 172 j += fs_rotbl(&afs)[j], k++) { 173 printf("%5d", j); 174 if (k % 12 == 0) 175 printf("\n\t\t"); 176 if (fs_rotbl(&afs)[j] == 0) 177 break; 178 } 179 } 180 } 181 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 182 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 183 size = afs.fs_cssize - i < afs.fs_bsize ? 184 afs.fs_cssize - i : afs.fs_bsize; 185 afs.fs_csp[j] = calloc(1, size); 186 if (lseek(fd, 187 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) * 188 dev_bsize), SEEK_SET) == (off_t)-1) 189 goto err; 190 if (read(fd, afs.fs_csp[j], size) != size) 191 goto err; 192 } 193 for (i = 0; i < afs.fs_ncg; i++) { 194 struct csum *cs = &afs.fs_cs(&afs, i); 195 if (i && i % 4 == 0) 196 printf("\n\t"); 197 printf("(%d,%d,%d,%d) ", 198 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 199 } 200 printf("\n"); 201 if (afs.fs_ncyl % afs.fs_cpg) { 202 printf("cylinders in last group %d\n", 203 i = afs.fs_ncyl % afs.fs_cpg); 204 printf("blocks in last group %d\n", 205 i * afs.fs_spc / NSPB(&afs)); 206 } 207 printf("\n"); 208 for (i = 0; i < afs.fs_ncg; i++) 209 if (dumpcg(name, fd, i)) 210 goto err; 211 (void)close(fd); 212 return (0); 213 214 err: if (fd != -1) 215 (void)close(fd); 216 (void)fprintf(stderr, "dumpfs: %s: %s\n", name, strerror(errno)); 217 return (1); 218 }; 219 220 int 221 dumpcg(name, fd, c) 222 char *name; 223 int fd, c; 224 { 225 off_t cur; 226 int i, j; 227 228 printf("\ncg %d:\n", c); 229 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize), 230 SEEK_SET)) == (off_t)-1) 231 return (1); 232 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 233 (void)fprintf(stderr, "dumpfs: %s: error reading cg\n", name); 234 return (1); 235 } 236 printf("magic\t%x\ttell\t%qx\ttime\t%s", 237 afs.fs_postblformat == FS_42POSTBLFMT ? 238 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 239 cur, ctime(&acg.cg_time)); 240 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 241 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 242 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 243 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 244 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 245 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 246 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 247 for (i = 1, j = 0; i < afs.fs_frag; i++) { 248 printf("\t%d", acg.cg_frsum[i]); 249 j += i * acg.cg_frsum[i]; 250 } 251 printf("\nsum of frsum: %d", j); 252 if (afs.fs_contigsumsize > 0) { 253 for (i = 1; i < afs.fs_contigsumsize; i++) { 254 if ((i - 1) % 8 == 0) 255 printf("\nclusters %d-%d:", i, 256 afs.fs_contigsumsize - 1 < i + 7 ? 257 afs.fs_contigsumsize - 1 : i + 7); 258 printf("\t%d", cg_clustersum(&acg)[i]); 259 } 260 printf("\nclusters size %d and over: %d\n", 261 afs.fs_contigsumsize, 262 cg_clustersum(&acg)[afs.fs_contigsumsize]); 263 printf("clusters free:\t"); 264 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks); 265 } else 266 printf("\n"); 267 printf("iused:\t"); 268 pbits(cg_inosused(&acg), afs.fs_ipg); 269 printf("free:\t"); 270 pbits(cg_blksfree(&acg), afs.fs_fpg); 271 printf("b:\n"); 272 for (i = 0; i < afs.fs_cpg; i++) { 273 if (cg_blktot(&acg)[i] == 0) 274 continue; 275 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]); 276 for (j = 0; j < afs.fs_nrpos; j++) { 277 if (afs.fs_cpc > 0 && 278 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 279 continue; 280 printf(" %d", cg_blks(&afs, &acg, i)[j]); 281 } 282 printf("\n"); 283 } 284 return (0); 285 }; 286 287 void 288 pbits(vp, max) 289 register void *vp; 290 int max; 291 { 292 register int i; 293 register char *p; 294 int count, j; 295 296 for (count = i = 0, p = vp; i < max; i++) 297 if (isset(p, i)) { 298 if (count) 299 printf(",%s", count % 6 ? " " : "\n\t"); 300 count++; 301 printf("%d", i); 302 j = i; 303 while ((i+1)<max && isset(p, i+1)) 304 i++; 305 if (i != j) 306 printf("-%d", i); 307 } 308 printf("\n"); 309 } 310 311 void 312 usage() 313 { 314 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 315 exit(1); 316 } 317