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