1 /* $NetBSD: dumpfs.c,v 1.30 2001/09/06 02:16:02 lukem Exp $ */ 2 3 /* 4 * Copyright (c) 1983, 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 __COPYRIGHT("@(#) Copyright (c) 1983, 1992, 1993\n\ 39 The Regents of the University of California. All rights reserved.\n"); 40 #endif /* not lint */ 41 42 #ifndef lint 43 #if 0 44 static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95"; 45 #else 46 __RCSID("$NetBSD: dumpfs.c,v 1.30 2001/09/06 02:16:02 lukem Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 #include <sys/param.h> 51 #include <sys/time.h> 52 53 #include <ufs/ufs/ufs_bswap.h> 54 #include <ufs/ffs/fs.h> 55 #include <ufs/ffs/ffs_extern.h> 56 57 #include <err.h> 58 #include <fcntl.h> 59 #include <fstab.h> 60 #include <stdio.h> 61 #include <stdlib.h> 62 #include <unistd.h> 63 64 union { 65 struct fs fs; 66 char pad[MAXBSIZE]; 67 } fsun; 68 #define afs fsun.fs 69 70 union { 71 struct cg cg; 72 char pad[MAXBSIZE]; 73 } cgun; 74 #define acg cgun.cg 75 76 long dev_bsize = 1; 77 int needswap = 0; 78 79 int dumpfs(const char *); 80 int dumpcg(const char *, int, int); 81 int main(int, char **); 82 void pbits(void *, int); 83 void usage(void); 84 void swap_cg(struct cg *); 85 86 int 87 main(int argc, char *argv[]) 88 { 89 struct fstab *fs; 90 int ch, eval; 91 int Fflag; 92 93 Fflag = 0; 94 while ((ch = getopt(argc, argv, "F")) != -1) 95 switch(ch) { 96 case 'F': 97 Fflag = 1; 98 break; 99 case '?': 100 default: 101 usage(); 102 } 103 argc -= optind; 104 argv += optind; 105 106 if (argc < 1) 107 usage(); 108 109 for (eval = 0; *argv; ++argv) 110 if (Fflag || ((fs = getfsfile(*argv)) == NULL)) 111 eval |= dumpfs(*argv); 112 else 113 eval |= dumpfs(fs->fs_spec); 114 exit(eval); 115 } 116 117 int 118 dumpfs(const char *name) 119 { 120 int fd, c, i, j, k, size; 121 time_t t; 122 struct csum *ccsp; 123 124 if ((fd = open(name, O_RDONLY, 0)) < 0) 125 goto err; 126 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 127 goto err; 128 if (read(fd, &afs, SBSIZE) != SBSIZE) 129 goto err; 130 131 if (afs.fs_magic != FS_MAGIC) { 132 if (afs.fs_magic == bswap32(FS_MAGIC)) { 133 ffs_sb_swap(&afs, &afs); 134 needswap = 1; 135 } else { 136 warnx("%s: superblock has bad magic number, skipped", 137 name); 138 (void)close(fd); 139 return (1); 140 } 141 } 142 #if BYTE_ORDER == LITTLE_ENDIAN 143 if (needswap) 144 #else 145 if (!needswap) 146 #endif 147 printf("endian\tbig-endian\n"); 148 else 149 printf("endian\tlittle-endian\n"); 150 if (afs.fs_postblformat == FS_42POSTBLFMT) 151 afs.fs_nrpos = 8; 152 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 153 t = afs.fs_time; 154 printf("magic\t%x\ttime\t%s", afs.fs_magic, 155 ctime(&t)); 156 i = 0; 157 if (afs.fs_postblformat != FS_42POSTBLFMT) { 158 i++; 159 if (afs.fs_inodefmt >= FS_44INODEFMT) { 160 int max; 161 162 i++; 163 max = afs.fs_maxcontig; 164 size = afs.fs_contigsumsize; 165 if ((max < 2 && size == 0) 166 || (max > 1 && size >= MIN(max, FS_MAXCONTIG))) 167 i++; 168 } 169 } 170 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 171 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\tsoftdep %sabled\n", 172 i < 1 ? "static" : "dynamic", i < 2 ? "4.2/4.3BSD" : "4.4BSD", i, 173 (afs.fs_flags & FS_DOSOFTDEP) ? "en" : "dis"); 174 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 175 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 176 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 177 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 178 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 179 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 180 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 181 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 182 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 183 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 184 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 185 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 186 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 187 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 188 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 189 afs.fs_maxcontig, afs.fs_maxbpg); 190 printf("rotdelay %dms\trps\t%d\n", 191 afs.fs_rotdelay, afs.fs_rps); 192 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 193 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 194 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 195 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 196 afs.fs_contigsumsize); 197 printf("maxfilesize 0x%016llx\n", 198 (unsigned long long)afs.fs_maxfilesize); 199 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 200 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 201 printf("avgfilesize %d\tavgfpdir %d\n", 202 afs.fs_avgfilesize, afs.fs_avgfpdir); 203 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 204 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 205 printf("sbsize\t%d\tcgsize\t%d\toffset\t%d\tmask\t0x%08x\n", 206 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 207 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 208 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 209 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n", 210 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 211 if (afs.fs_cpc != 0) 212 printf("blocks available in each of %d rotational positions", 213 afs.fs_nrpos); 214 else 215 printf("(no rotational position table)\n"); 216 for (c = 0; c < afs.fs_cpc; c++) { 217 printf("\ncylinder number %d:", c); 218 for (i = 0; i < afs.fs_nrpos; i++) { 219 if (fs_postbl(&afs, c)[i] == -1) 220 continue; 221 printf("\n position %d:\t", i); 222 for (j = fs_postbl(&afs, c)[i], k = 1; ; 223 j += fs_rotbl(&afs)[j], k++) { 224 printf("%5d", j); 225 if (k % 12 == 0) 226 printf("\n\t\t"); 227 if (fs_rotbl(&afs)[j] == 0) 228 break; 229 } 230 } 231 } 232 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 233 afs.fs_csp = calloc(1, afs.fs_cssize); 234 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 235 size = afs.fs_cssize - i < afs.fs_bsize ? 236 afs.fs_cssize - i : afs.fs_bsize; 237 ccsp = (struct csum *)((char *)afs.fs_csp + i); 238 if (lseek(fd, 239 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) * 240 dev_bsize, SEEK_SET) == (off_t)-1) 241 goto err; 242 if (read(fd, ccsp, size) != size) 243 goto err; 244 if (needswap) 245 ffs_csum_swap(ccsp, ccsp, size); 246 } 247 for (i = 0; i < afs.fs_ncg; i++) { 248 struct csum *cs = &afs.fs_cs(&afs, i); 249 if (i && i % 4 == 0) 250 printf("\n\t"); 251 printf("(%d,%d,%d,%d) ", 252 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 253 } 254 printf("\n"); 255 if (afs.fs_ncyl % afs.fs_cpg) { 256 printf("cylinders in last group %d\n", 257 i = afs.fs_ncyl % afs.fs_cpg); 258 printf("blocks in last group %d\n", 259 i * afs.fs_spc / NSPB(&afs)); 260 } 261 printf("\n"); 262 for (i = 0; i < afs.fs_ncg; i++) 263 if (dumpcg(name, fd, i)) 264 goto err; 265 (void)close(fd); 266 return (0); 267 268 err: if (fd != -1) 269 (void)close(fd); 270 warn("%s", name); 271 return (1); 272 }; 273 274 int 275 dumpcg(const char *name, int fd, int c) 276 { 277 off_t cur; 278 int i, j; 279 time_t t; 280 281 printf("\ncg %d:\n", c); 282 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize, 283 SEEK_SET)) == (off_t)-1) 284 return (1); 285 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 286 warnx("%s: error reading cg", name); 287 return (1); 288 } 289 if (needswap) 290 swap_cg(&acg); 291 t = acg.cg_time; 292 printf("magic\t%x\ttell\t%llx\ttime\t%s", 293 afs.fs_postblformat == FS_42POSTBLFMT ? 294 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 295 (long long)cur, ctime(&t)); 296 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 297 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 298 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 299 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 300 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 301 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 302 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 303 for (i = 1, j = 0; i < afs.fs_frag; i++) { 304 printf("\t%d", acg.cg_frsum[i]); 305 j += i * acg.cg_frsum[i]; 306 } 307 printf("\nsum of frsum: %d", j); 308 if (afs.fs_contigsumsize > 0) { 309 for (i = 1; i < afs.fs_contigsumsize; i++) { 310 if ((i - 1) % 8 == 0) 311 printf("\nclusters %d-%d:", i, 312 afs.fs_contigsumsize - 1 < i + 7 ? 313 afs.fs_contigsumsize - 1 : i + 7); 314 printf("\t%d", cg_clustersum(&acg, 0)[i]); 315 } 316 printf("\nclusters size %d and over: %d\n", 317 afs.fs_contigsumsize, 318 cg_clustersum(&acg, 0)[afs.fs_contigsumsize]); 319 printf("clusters free:\t"); 320 pbits(cg_clustersfree(&acg, 0), acg.cg_nclusterblks); 321 } else 322 printf("\n"); 323 printf("iused:\t"); 324 pbits(cg_inosused(&acg, 0), afs.fs_ipg); 325 printf("free:\t"); 326 pbits(cg_blksfree(&acg, 0), afs.fs_fpg); 327 printf("b:\n"); 328 for (i = 0; i < afs.fs_cpg; i++) { 329 if (cg_blktot(&acg, 0)[i] == 0) 330 continue; 331 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg, 0)[i]); 332 for (j = 0; j < afs.fs_nrpos; j++) { 333 if (afs.fs_cpc > 0 && 334 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 335 continue; 336 printf(" %d", cg_blks(&afs, &acg, i, 0)[j]); 337 } 338 printf("\n"); 339 } 340 return (0); 341 }; 342 343 void 344 pbits(void *vp, int max) 345 { 346 int i; 347 char *p; 348 int count, j; 349 350 for (count = i = 0, p = vp; i < max; i++) 351 if (isset(p, i)) { 352 if (count) 353 printf(",%s", count % 6 ? " " : "\n\t"); 354 count++; 355 printf("%d", i); 356 j = i; 357 while ((i+1)<max && isset(p, i+1)) 358 i++; 359 if (i != j) 360 printf("-%d", i); 361 } 362 printf("\n"); 363 } 364 365 void 366 usage(void) 367 { 368 369 (void)fprintf(stderr, "usage: dumpfs [-F] filesys | device [...]\n"); 370 exit(1); 371 } 372 373 void 374 swap_cg(struct cg *cg) 375 { 376 int i; 377 u_int32_t *n32; 378 u_int16_t *n16; 379 380 cg->cg_firstfield = bswap32(cg->cg_firstfield); 381 cg->cg_magic = bswap32(cg->cg_magic); 382 cg->cg_time = bswap32(cg->cg_time); 383 cg->cg_cgx = bswap32(cg->cg_cgx); 384 cg->cg_ncyl = bswap16(cg->cg_ncyl); 385 cg->cg_niblk = bswap16(cg->cg_niblk); 386 cg->cg_ndblk = bswap32(cg->cg_ndblk); 387 cg->cg_cs.cs_ndir = bswap32(cg->cg_cs.cs_ndir); 388 cg->cg_cs.cs_nbfree = bswap32(cg->cg_cs.cs_nbfree); 389 cg->cg_cs.cs_nifree = bswap32(cg->cg_cs.cs_nifree); 390 cg->cg_cs.cs_nffree = bswap32(cg->cg_cs.cs_nffree); 391 cg->cg_rotor = bswap32(cg->cg_rotor); 392 cg->cg_frotor = bswap32(cg->cg_frotor); 393 cg->cg_irotor = bswap32(cg->cg_irotor); 394 cg->cg_btotoff = bswap32(cg->cg_btotoff); 395 cg->cg_boff = bswap32(cg->cg_boff); 396 cg->cg_iusedoff = bswap32(cg->cg_iusedoff); 397 cg->cg_freeoff = bswap32(cg->cg_freeoff); 398 cg->cg_nextfreeoff = bswap32(cg->cg_nextfreeoff); 399 cg->cg_clustersumoff = bswap32(cg->cg_clustersumoff); 400 cg->cg_clusteroff = bswap32(cg->cg_clusteroff); 401 cg->cg_nclusterblks = bswap32(cg->cg_nclusterblks); 402 for (i=0; i < MAXFRAG; i++) 403 cg->cg_frsum[i] = bswap32(cg->cg_frsum[i]); 404 405 if (afs.fs_postblformat == FS_42POSTBLFMT) { /* old format */ 406 struct ocg *ocg; 407 int j; 408 ocg = (struct ocg *)cg; 409 for(i = 0; i < 8; i++) { 410 ocg->cg_frsum[i] = bswap32(ocg->cg_frsum[i]); 411 } 412 for(i = 0; i < 32; i++) { 413 ocg->cg_btot[i] = bswap32(ocg->cg_btot[i]); 414 for (j = 0; j < 8; j++) 415 ocg->cg_b[i][j] = bswap16(ocg->cg_b[i][j]); 416 } 417 ocg->cg_magic = bswap32(ocg->cg_magic); 418 } else { /* new format */ 419 if (cg->cg_magic == CG_MAGIC) { 420 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_btotoff); 421 n16 = (u_int16_t*)((u_int8_t*)cg + cg->cg_boff); 422 } else { 423 n32 = (u_int32_t*)((u_int8_t*)cg + bswap32(cg->cg_btotoff)); 424 n16 = (u_int16_t*)((u_int8_t*)cg + bswap32(cg->cg_boff)); 425 } 426 for (i=0; i< afs.fs_cpg; i++) 427 n32[i] = bswap32(n32[i]); 428 429 for (i=0; i < afs.fs_cpg * afs.fs_nrpos; i++) 430 n16[i] = bswap16(n16[i]); 431 432 if (cg->cg_magic == CG_MAGIC) { 433 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 434 } else { 435 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 436 } 437 for (i = 0; i < afs.fs_contigsumsize + 1; i++) 438 n32[i] = bswap32(n32[i]); 439 } 440 } 441