1 /* $NetBSD: dumpfs.c,v 1.31 2001/11/09 12:01:13 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.31 2001/11/09 12:01:13 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 <errno.h> 59 #include <fcntl.h> 60 #include <fstab.h> 61 #include <stdio.h> 62 #include <stdlib.h> 63 #include <string.h> 64 #include <unistd.h> 65 #include <util.h> 66 67 union { 68 struct fs fs; 69 char pad[MAXBSIZE]; 70 } fsun; 71 #define afs fsun.fs 72 73 union { 74 struct cg cg; 75 char pad[MAXBSIZE]; 76 } cgun; 77 #define acg cgun.cg 78 79 long dev_bsize = 1; 80 int needswap, Fflag; 81 82 int dumpfs(const char *); 83 int dumpcg(const char *, int, int); 84 int main(int, char **); 85 int openpartition(const char *, int, char *, size_t); 86 void pbits(void *, int); 87 void usage(void); 88 void swap_cg(struct cg *); 89 90 int 91 main(int argc, char *argv[]) 92 { 93 int ch, eval; 94 95 while ((ch = getopt(argc, argv, "F")) != -1) 96 switch(ch) { 97 case 'F': 98 Fflag = 1; 99 break; 100 case '?': 101 default: 102 usage(); 103 } 104 argc -= optind; 105 argv += optind; 106 107 if (argc < 1) 108 usage(); 109 110 for (eval = 0; *argv; ++argv) { 111 eval |= dumpfs(*argv); 112 printf("\n"); 113 } 114 115 exit(eval); 116 } 117 118 int 119 dumpfs(const char *name) 120 { 121 int fd, c, i, j, k, size; 122 time_t t; 123 char device[MAXPATHLEN]; 124 struct csum *ccsp; 125 126 if (Fflag) 127 fd = open(name, O_RDONLY); 128 else { 129 fd = openpartition(name, O_RDONLY, device, sizeof(device)); 130 name = device; 131 } 132 if (fd == -1) 133 goto err; 134 135 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 136 goto err; 137 if (read(fd, &afs, SBSIZE) != SBSIZE) 138 goto err; 139 140 if (afs.fs_magic != FS_MAGIC) { 141 if (afs.fs_magic == bswap32(FS_MAGIC)) { 142 ffs_sb_swap(&afs, &afs); 143 needswap = 1; 144 } else { 145 warnx("%s: superblock has bad magic number, skipped", 146 name); 147 (void)close(fd); 148 return (1); 149 } 150 } 151 152 printf("file system: %s\n", name); 153 #if BYTE_ORDER == LITTLE_ENDIAN 154 if (needswap) 155 #else 156 if (!needswap) 157 #endif 158 printf("endian\tbig-endian\n"); 159 else 160 printf("endian\tlittle-endian\n"); 161 if (afs.fs_postblformat == FS_42POSTBLFMT) 162 afs.fs_nrpos = 8; 163 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 164 t = afs.fs_time; 165 printf("magic\t%x\ttime\t%s", afs.fs_magic, 166 ctime(&t)); 167 i = 0; 168 if (afs.fs_postblformat != FS_42POSTBLFMT) { 169 i++; 170 if (afs.fs_inodefmt >= FS_44INODEFMT) { 171 int max; 172 173 i++; 174 max = afs.fs_maxcontig; 175 size = afs.fs_contigsumsize; 176 if ((max < 2 && size == 0) 177 || (max > 1 && size >= MIN(max, FS_MAXCONTIG))) 178 i++; 179 } 180 } 181 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 182 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\tsoftdep %sabled\n", 183 i < 1 ? "static" : "dynamic", i < 2 ? "4.2/4.3BSD" : "4.4BSD", i, 184 (afs.fs_flags & FS_DOSOFTDEP) ? "en" : "dis"); 185 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 186 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 187 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 188 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 189 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 190 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 191 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 192 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 193 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 194 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 195 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 196 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 197 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 198 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 199 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 200 afs.fs_maxcontig, afs.fs_maxbpg); 201 printf("rotdelay %dms\trps\t%d\n", 202 afs.fs_rotdelay, afs.fs_rps); 203 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 204 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 205 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 206 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 207 afs.fs_contigsumsize); 208 printf("maxfilesize 0x%016llx\n", 209 (unsigned long long)afs.fs_maxfilesize); 210 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 211 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 212 printf("avgfilesize %d\tavgfpdir %d\n", 213 afs.fs_avgfilesize, afs.fs_avgfpdir); 214 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 215 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 216 printf("sbsize\t%d\tcgsize\t%d\toffset\t%d\tmask\t0x%08x\n", 217 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 218 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 219 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 220 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n", 221 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 222 if (afs.fs_cpc != 0) 223 printf("blocks available in each of %d rotational positions", 224 afs.fs_nrpos); 225 else 226 printf("(no rotational position table)\n"); 227 for (c = 0; c < afs.fs_cpc; c++) { 228 printf("\ncylinder number %d:", c); 229 for (i = 0; i < afs.fs_nrpos; i++) { 230 if (fs_postbl(&afs, c)[i] == -1) 231 continue; 232 printf("\n position %d:\t", i); 233 for (j = fs_postbl(&afs, c)[i], k = 1; ; 234 j += fs_rotbl(&afs)[j], k++) { 235 printf("%5d", j); 236 if (k % 12 == 0) 237 printf("\n\t\t"); 238 if (fs_rotbl(&afs)[j] == 0) 239 break; 240 } 241 } 242 } 243 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 244 afs.fs_csp = calloc(1, afs.fs_cssize); 245 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 246 size = afs.fs_cssize - i < afs.fs_bsize ? 247 afs.fs_cssize - i : afs.fs_bsize; 248 ccsp = (struct csum *)((char *)afs.fs_csp + i); 249 if (lseek(fd, 250 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) * 251 dev_bsize, SEEK_SET) == (off_t)-1) 252 goto err; 253 if (read(fd, ccsp, size) != size) 254 goto err; 255 if (needswap) 256 ffs_csum_swap(ccsp, ccsp, size); 257 } 258 for (i = 0; i < afs.fs_ncg; i++) { 259 struct csum *cs = &afs.fs_cs(&afs, i); 260 if (i && i % 4 == 0) 261 printf("\n\t"); 262 printf("(%d,%d,%d,%d) ", 263 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 264 } 265 printf("\n"); 266 if (afs.fs_ncyl % afs.fs_cpg) { 267 printf("cylinders in last group %d\n", 268 i = afs.fs_ncyl % afs.fs_cpg); 269 printf("blocks in last group %d\n", 270 i * afs.fs_spc / NSPB(&afs)); 271 } 272 printf("\n"); 273 for (i = 0; i < afs.fs_ncg; i++) 274 if (dumpcg(name, fd, i)) 275 goto err; 276 (void)close(fd); 277 return (0); 278 279 err: if (fd != -1) 280 (void)close(fd); 281 warn("%s", name); 282 return (1); 283 }; 284 285 int 286 dumpcg(const char *name, int fd, int c) 287 { 288 off_t cur; 289 int i, j; 290 time_t t; 291 292 printf("\ncg %d:\n", c); 293 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize, 294 SEEK_SET)) == (off_t)-1) 295 return (1); 296 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 297 warnx("%s: error reading cg", name); 298 return (1); 299 } 300 if (needswap) 301 swap_cg(&acg); 302 t = acg.cg_time; 303 printf("magic\t%x\ttell\t%llx\ttime\t%s", 304 afs.fs_postblformat == FS_42POSTBLFMT ? 305 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 306 (long long)cur, ctime(&t)); 307 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 308 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 309 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 310 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 311 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 312 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 313 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 314 for (i = 1, j = 0; i < afs.fs_frag; i++) { 315 printf("\t%d", acg.cg_frsum[i]); 316 j += i * acg.cg_frsum[i]; 317 } 318 printf("\nsum of frsum: %d", j); 319 if (afs.fs_contigsumsize > 0) { 320 for (i = 1; i < afs.fs_contigsumsize; i++) { 321 if ((i - 1) % 8 == 0) 322 printf("\nclusters %d-%d:", i, 323 afs.fs_contigsumsize - 1 < i + 7 ? 324 afs.fs_contigsumsize - 1 : i + 7); 325 printf("\t%d", cg_clustersum(&acg, 0)[i]); 326 } 327 printf("\nclusters size %d and over: %d\n", 328 afs.fs_contigsumsize, 329 cg_clustersum(&acg, 0)[afs.fs_contigsumsize]); 330 printf("clusters free:\t"); 331 pbits(cg_clustersfree(&acg, 0), acg.cg_nclusterblks); 332 } else 333 printf("\n"); 334 printf("iused:\t"); 335 pbits(cg_inosused(&acg, 0), afs.fs_ipg); 336 printf("free:\t"); 337 pbits(cg_blksfree(&acg, 0), afs.fs_fpg); 338 printf("b:\n"); 339 for (i = 0; i < afs.fs_cpg; i++) { 340 if (cg_blktot(&acg, 0)[i] == 0) 341 continue; 342 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg, 0)[i]); 343 for (j = 0; j < afs.fs_nrpos; j++) { 344 if (afs.fs_cpc > 0 && 345 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 346 continue; 347 printf(" %d", cg_blks(&afs, &acg, i, 0)[j]); 348 } 349 printf("\n"); 350 } 351 return (0); 352 }; 353 354 void 355 pbits(void *vp, int max) 356 { 357 int i; 358 char *p; 359 int count, j; 360 361 for (count = i = 0, p = vp; i < max; i++) 362 if (isset(p, i)) { 363 if (count) 364 printf(",%s", count % 6 ? " " : "\n\t"); 365 count++; 366 printf("%d", i); 367 j = i; 368 while ((i+1)<max && isset(p, i+1)) 369 i++; 370 if (i != j) 371 printf("-%d", i); 372 } 373 printf("\n"); 374 } 375 376 void 377 usage(void) 378 { 379 380 (void)fprintf(stderr, "usage: dumpfs [-F] filesys | device [...]\n"); 381 exit(1); 382 } 383 384 void 385 swap_cg(struct cg *cg) 386 { 387 int i; 388 u_int32_t *n32; 389 u_int16_t *n16; 390 391 cg->cg_firstfield = bswap32(cg->cg_firstfield); 392 cg->cg_magic = bswap32(cg->cg_magic); 393 cg->cg_time = bswap32(cg->cg_time); 394 cg->cg_cgx = bswap32(cg->cg_cgx); 395 cg->cg_ncyl = bswap16(cg->cg_ncyl); 396 cg->cg_niblk = bswap16(cg->cg_niblk); 397 cg->cg_ndblk = bswap32(cg->cg_ndblk); 398 cg->cg_cs.cs_ndir = bswap32(cg->cg_cs.cs_ndir); 399 cg->cg_cs.cs_nbfree = bswap32(cg->cg_cs.cs_nbfree); 400 cg->cg_cs.cs_nifree = bswap32(cg->cg_cs.cs_nifree); 401 cg->cg_cs.cs_nffree = bswap32(cg->cg_cs.cs_nffree); 402 cg->cg_rotor = bswap32(cg->cg_rotor); 403 cg->cg_frotor = bswap32(cg->cg_frotor); 404 cg->cg_irotor = bswap32(cg->cg_irotor); 405 cg->cg_btotoff = bswap32(cg->cg_btotoff); 406 cg->cg_boff = bswap32(cg->cg_boff); 407 cg->cg_iusedoff = bswap32(cg->cg_iusedoff); 408 cg->cg_freeoff = bswap32(cg->cg_freeoff); 409 cg->cg_nextfreeoff = bswap32(cg->cg_nextfreeoff); 410 cg->cg_clustersumoff = bswap32(cg->cg_clustersumoff); 411 cg->cg_clusteroff = bswap32(cg->cg_clusteroff); 412 cg->cg_nclusterblks = bswap32(cg->cg_nclusterblks); 413 for (i=0; i < MAXFRAG; i++) 414 cg->cg_frsum[i] = bswap32(cg->cg_frsum[i]); 415 416 if (afs.fs_postblformat == FS_42POSTBLFMT) { /* old format */ 417 struct ocg *ocg; 418 int j; 419 ocg = (struct ocg *)cg; 420 for(i = 0; i < 8; i++) { 421 ocg->cg_frsum[i] = bswap32(ocg->cg_frsum[i]); 422 } 423 for(i = 0; i < 32; i++) { 424 ocg->cg_btot[i] = bswap32(ocg->cg_btot[i]); 425 for (j = 0; j < 8; j++) 426 ocg->cg_b[i][j] = bswap16(ocg->cg_b[i][j]); 427 } 428 ocg->cg_magic = bswap32(ocg->cg_magic); 429 } else { /* new format */ 430 if (cg->cg_magic == CG_MAGIC) { 431 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_btotoff); 432 n16 = (u_int16_t*)((u_int8_t*)cg + cg->cg_boff); 433 } else { 434 n32 = (u_int32_t*)((u_int8_t*)cg + bswap32(cg->cg_btotoff)); 435 n16 = (u_int16_t*)((u_int8_t*)cg + bswap32(cg->cg_boff)); 436 } 437 for (i=0; i< afs.fs_cpg; i++) 438 n32[i] = bswap32(n32[i]); 439 440 for (i=0; i < afs.fs_cpg * afs.fs_nrpos; i++) 441 n16[i] = bswap16(n16[i]); 442 443 if (cg->cg_magic == CG_MAGIC) { 444 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 445 } else { 446 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 447 } 448 for (i = 0; i < afs.fs_contigsumsize + 1; i++) 449 n32[i] = bswap32(n32[i]); 450 } 451 } 452 453 int 454 openpartition(const char *name, int flags, char *device, size_t devicelen) 455 { 456 char rawspec[MAXPATHLEN], *p; 457 struct fstab *fs; 458 int fd, oerrno; 459 460 fs = getfsfile(name); 461 if (fs) { 462 if ((p = strrchr(fs->fs_spec, '/')) != NULL) { 463 snprintf(rawspec, sizeof(rawspec), "%.*s/r%s", 464 (int)(p - fs->fs_spec), fs->fs_spec, p + 1); 465 name = rawspec; 466 } else 467 name = fs->fs_spec; 468 } 469 fd = opendisk(name, flags, device, devicelen, 0); 470 if (fd == -1 && errno == ENOENT) { 471 oerrno = errno; 472 strlcpy(device, name, devicelen); 473 errno = oerrno; 474 } 475 return (fd); 476 } 477