1 /* $OpenBSD: dumpfs.c,v 1.36 2020/06/20 07:49:04 otto Exp $ */ 2 3 /* 4 * Copyright (c) 2002 Networks Associates Technology, Inc. 5 * All rights reserved. 6 * 7 * This software was developed for the FreeBSD Project by Marshall 8 * Kirk McKusick and Network Associates Laboratories, the Security 9 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 10 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 11 * research program. 12 * 13 * Copyright (c) 1983, 1992, 1993 14 * The Regents of the University of California. All rights reserved. 15 * 16 * Redistribution and use in source and binary forms, with or without 17 * modification, are permitted provided that the following conditions 18 * are met: 19 * 1. Redistributions of source code must retain the above copyright 20 * notice, this list of conditions and the following disclaimer. 21 * 2. Redistributions in binary form must reproduce the above copyright 22 * notice, this list of conditions and the following disclaimer in the 23 * documentation and/or other materials provided with the distribution. 24 * 3. Neither the name of the University nor the names of its contributors 25 * may be used to endorse or promote products derived from this software 26 * without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 38 * SUCH DAMAGE. 39 */ 40 41 #include <sys/param.h> /* DEV_BSIZE MAXBSIZE isset */ 42 #include <sys/time.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ffs/fs.h> 46 47 #include <err.h> 48 #include <errno.h> 49 #include <fcntl.h> 50 #include <fstab.h> 51 #include <stdint.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <unistd.h> 55 #include <util.h> 56 57 #define MINIMUM(a, b) (((a) < (b)) ? (a) : (b)) 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 int dumpfs(int, const char *); 72 int dumpcg(const char *, int, u_int); 73 int marshal(const char *); 74 int open_disk(const char *); 75 void pbits(void *, int); 76 __dead void usage(void); 77 78 int 79 main(int argc, char *argv[]) 80 { 81 struct fstab *fs; 82 const char *name; 83 int ch, domarshal, eval, fd; 84 85 domarshal = eval = 0; 86 87 while ((ch = getopt(argc, argv, "m")) != -1) { 88 switch (ch) { 89 case 'm': 90 domarshal = 1; 91 break; 92 case '?': 93 default: 94 usage(); 95 } 96 } 97 argc -= optind; 98 argv += optind; 99 100 if (argc < 1) 101 usage(); 102 103 if (pledge("stdio rpath disklabel", NULL) == -1) 104 err(1, "pledge"); 105 106 for (; *argv != NULL; argv++) { 107 if ((fs = getfsfile(*argv)) != NULL) 108 name = fs->fs_spec; 109 else 110 name = *argv; 111 if ((fd = open_disk(name)) == -1) { 112 eval |= 1; 113 continue; 114 } 115 if (domarshal) 116 eval |= marshal(name); 117 else 118 eval |= dumpfs(fd, name); 119 close(fd); 120 } 121 exit(eval); 122 } 123 124 int 125 open_disk(const char *name) 126 { 127 int fd, i, sbtry[] = SBLOCKSEARCH; 128 ssize_t n; 129 130 /* XXX - should retry w/raw device on failure */ 131 if ((fd = opendev(name, O_RDONLY, 0, NULL)) == -1) { 132 warn("%s", name); 133 return(-1); 134 } 135 136 /* Read superblock, could be UFS1 or UFS2. */ 137 for (i = 0; sbtry[i] != -1; i++) { 138 n = pread(fd, &afs, SBLOCKSIZE, (off_t)sbtry[i]); 139 if (n == SBLOCKSIZE && (afs.fs_magic == FS_UFS1_MAGIC || 140 (afs.fs_magic == FS_UFS2_MAGIC && 141 afs.fs_sblockloc == sbtry[i])) && 142 !(afs.fs_magic == FS_UFS1_MAGIC && 143 sbtry[i] == SBLOCK_UFS2) && 144 afs.fs_bsize <= MAXBSIZE && 145 afs.fs_bsize >= sizeof(struct fs)) 146 break; 147 } 148 if (sbtry[i] == -1) { 149 warnx("cannot find filesystem superblock"); 150 close(fd); 151 return (-1); 152 } 153 154 return (fd); 155 } 156 157 int 158 dumpfs(int fd, const char *name) 159 { 160 time_t fstime; 161 int64_t fssize; 162 int32_t fsflags; 163 size_t size; 164 off_t off; 165 int i, j; 166 u_int cg; 167 168 switch (afs.fs_magic) { 169 case FS_UFS2_MAGIC: 170 fssize = afs.fs_size; 171 fstime = afs.fs_time; 172 printf("magic\t%x (FFS2)\ttime\t%s", 173 afs.fs_magic, ctime(&fstime)); 174 printf("superblock location\t%jd\tid\t[ %x %x ]\n", 175 (intmax_t)afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]); 176 printf("ncg\t%u\tsize\t%jd\tblocks\t%jd\n", 177 afs.fs_ncg, (intmax_t)fssize, (intmax_t)afs.fs_dsize); 178 break; 179 case FS_UFS1_MAGIC: 180 fssize = afs.fs_ffs1_size; 181 fstime = afs.fs_ffs1_time; 182 printf("magic\t%x (FFS1)\ttime\t%s", 183 afs.fs_magic, ctime(&fstime)); 184 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 185 i = 0; 186 if (afs.fs_postblformat != FS_42POSTBLFMT) { 187 i++; 188 if (afs.fs_inodefmt >= FS_44INODEFMT) { 189 size_t max; 190 191 i++; 192 max = afs.fs_maxcontig; 193 size = afs.fs_contigsumsize; 194 if ((max < 2 && size == 0) || 195 (max > 1 && size >= MINIMUM(max, FS_MAXCONTIG))) 196 i++; 197 } 198 } 199 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\n", 200 i < 1 ? "static" : "dynamic", 201 i < 2 ? "4.2/4.3BSD" : "4.4BSD", i); 202 printf("ncg\t%u\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 203 afs.fs_ncg, afs.fs_ncyl, afs.fs_ffs1_size, afs.fs_ffs1_dsize); 204 break; 205 default: 206 goto err; 207 } 208 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 209 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 210 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 211 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 212 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 213 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 214 printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n", 215 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 216 afs.fs_maxsymlinklen); 217 switch (afs.fs_magic) { 218 case FS_UFS2_MAGIC: 219 printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 220 "maxbsize", afs.fs_maxbsize, afs.fs_maxbpg, 221 afs.fs_maxcontig, afs.fs_contigsumsize); 222 printf("nbfree\t%jd\tndir\t%jd\tnifree\t%jd\tnffree\t%jd\n", 223 (intmax_t)afs.fs_cstotal.cs_nbfree, 224 (intmax_t)afs.fs_cstotal.cs_ndir, 225 (intmax_t)afs.fs_cstotal.cs_nifree, 226 (intmax_t)afs.fs_cstotal.cs_nffree); 227 printf("bpg\t%d\tfpg\t%d\tipg\t%u\n", 228 afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 229 printf("nindir\t%d\tinopb\t%u\tmaxfilesize\t%ju\n", 230 afs.fs_nindir, afs.fs_inopb, 231 (uintmax_t)afs.fs_maxfilesize); 232 printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%jd\tcssize\t%d\n", 233 afs.fs_sbsize, afs.fs_cgsize, (intmax_t)afs.fs_csaddr, 234 afs.fs_cssize); 235 break; 236 case FS_UFS1_MAGIC: 237 printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 238 afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize); 239 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 240 afs.fs_ffs1_cstotal.cs_nbfree, afs.fs_ffs1_cstotal.cs_ndir, 241 afs.fs_ffs1_cstotal.cs_nifree, afs.fs_ffs1_cstotal.cs_nffree); 242 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%u\n", 243 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, 244 afs.fs_ipg); 245 printf("nindir\t%d\tinopb\t%u\tnspf\t%d\tmaxfilesize\t%ju\n", 246 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf, 247 (uintmax_t)afs.fs_maxfilesize); 248 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 249 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, 250 afs.fs_cgmask); 251 printf("csaddr\t%d\tcssize\t%d\n", 252 afs.fs_ffs1_csaddr, afs.fs_cssize); 253 printf("rotdelay %dms\trps\t%d\tinterleave %d\n", 254 afs.fs_rotdelay, afs.fs_rps, afs.fs_interleave); 255 printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n", 256 afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 257 break; 258 default: 259 goto err; 260 } 261 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 262 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 263 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n", 264 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 265 printf("avgfpdir %u\tavgfilesize %u\n", 266 afs.fs_avgfpdir, afs.fs_avgfilesize); 267 printf("flags\t"); 268 if (afs.fs_magic == FS_UFS2_MAGIC || 269 afs.fs_ffs1_flags & FS_FLAGS_UPDATED) 270 fsflags = afs.fs_flags; 271 else 272 fsflags = afs.fs_ffs1_flags; 273 if (fsflags == 0) 274 printf("none"); 275 if (fsflags & FS_UNCLEAN) 276 printf("unclean "); 277 if (fsflags & FS_DOSOFTDEP) 278 printf("soft-updates "); 279 if (fsflags & FS_FLAGS_UPDATED) 280 printf("updated "); 281 #if 0 282 fsflags &= ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_FLAGS_UPDATED); 283 if (fsflags != 0) 284 printf("unknown flags (%#x)", fsflags); 285 #endif 286 putchar('\n'); 287 printf("fsmnt\t%s\n", afs.fs_fsmnt); 288 printf("volname\t%s\tswuid\t%ju\n", 289 afs.fs_volname, (uintmax_t)afs.fs_swuid); 290 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 291 afs.fs_csp = calloc(1, afs.fs_cssize); 292 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 293 size = afs.fs_cssize - i < afs.fs_bsize ? 294 afs.fs_cssize - i : afs.fs_bsize; 295 off = (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * 296 afs.fs_frag))) * DEV_BSIZE; 297 if (pread(fd, (char *)afs.fs_csp + i, size, off) != size) 298 goto err; 299 } 300 for (cg = 0; cg < afs.fs_ncg; cg++) { 301 struct csum *cs = &afs.fs_cs(&afs, cg); 302 if (i && i % 4 == 0) 303 printf("\n\t"); 304 printf("(%d,%d,%d,%d) ", 305 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 306 } 307 printf("\n"); 308 if (fssize % afs.fs_fpg) { 309 if (afs.fs_magic == FS_UFS1_MAGIC) 310 printf("cylinders in last group %d\n", 311 howmany(afs.fs_ffs1_size % afs.fs_fpg, 312 afs.fs_spc / afs.fs_nspf)); 313 printf("blocks in last group %ld\n\n", 314 (long)((fssize % afs.fs_fpg) / afs.fs_frag)); 315 } 316 for (cg = 0; cg < afs.fs_ncg; cg++) 317 if (dumpcg(name, fd, cg)) 318 goto err; 319 return (0); 320 321 err: warn("%s", name); 322 return (1); 323 } 324 325 int 326 dumpcg(const char *name, int fd, u_int c) 327 { 328 time_t cgtime; 329 off_t cur; 330 int i, j; 331 332 printf("\ncg %u:\n", c); 333 cur = (off_t)fsbtodb(&afs, cgtod(&afs, c)) * DEV_BSIZE; 334 if (pread(fd, &acg, afs.fs_bsize, cur) != afs.fs_bsize) { 335 warn("%s: error reading cg", name); 336 return(1); 337 } 338 switch (afs.fs_magic) { 339 case FS_UFS2_MAGIC: 340 cgtime = acg.cg_ffs2_time; 341 printf("magic\t%x\ttell\t%jx\ttime\t%s", 342 acg.cg_magic, (intmax_t)cur, ctime(&cgtime)); 343 printf("cgx\t%u\tndblk\t%u\tniblk\t%u\tinitiblk %u\n", 344 acg.cg_cgx, acg.cg_ndblk, acg.cg_ffs2_niblk, 345 acg.cg_initediblk); 346 break; 347 case FS_UFS1_MAGIC: 348 cgtime = acg.cg_time; 349 printf("magic\t%x\ttell\t%jx\ttime\t%s", 350 afs.fs_postblformat == FS_42POSTBLFMT ? 351 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 352 (intmax_t)cur, ctime(&cgtime)); 353 printf("cgx\t%u\tncyl\t%d\tniblk\t%d\tndblk\t%u\n", 354 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 355 break; 356 default: 357 break; 358 } 359 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 360 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 361 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 362 printf("rotor\t%u\tirotor\t%u\tfrotor\t%u\nfrsum", 363 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 364 for (i = 1, j = 0; i < afs.fs_frag; i++) { 365 printf("\t%u", acg.cg_frsum[i]); 366 j += i * acg.cg_frsum[i]; 367 } 368 printf("\nsum of frsum: %d", j); 369 if (afs.fs_contigsumsize > 0) { 370 for (i = 1; i < afs.fs_contigsumsize; i++) { 371 if ((i - 1) % 8 == 0) 372 printf("\nclusters %d-%d:", i, 373 afs.fs_contigsumsize - 1 < i + 7 ? 374 afs.fs_contigsumsize - 1 : i + 7); 375 printf("\t%d", cg_clustersum(&acg)[i]); 376 } 377 printf("\nclusters size %d and over: %d\n", 378 afs.fs_contigsumsize, 379 cg_clustersum(&acg)[afs.fs_contigsumsize]); 380 printf("clusters free:\t"); 381 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks); 382 } else 383 printf("\n"); 384 printf("inodes used:\t"); 385 pbits(cg_inosused(&acg), afs.fs_ipg); 386 printf("blks free:\t"); 387 pbits(cg_blksfree(&acg), afs.fs_fpg); 388 #if 0 389 /* XXX - keep this? */ 390 if (afs.fs_magic == FS_UFS1_MAGIC) { 391 printf("b:\n"); 392 for (i = 0; i < afs.fs_cpg; i++) { 393 if (cg_blktot(&acg)[i] == 0) 394 continue; 395 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]); 396 printf("\n"); 397 } 398 } 399 #endif 400 return (0); 401 } 402 403 int 404 marshal(const char *name) 405 { 406 int Oflag; 407 408 printf("# newfs command for %s\n", name); 409 printf("newfs "); 410 if (afs.fs_volname[0] != '\0') 411 printf("-L %s ", afs.fs_volname); 412 413 Oflag = (afs.fs_magic == FS_UFS2_MAGIC) + 414 (afs.fs_inodefmt == FS_44INODEFMT); 415 printf("-O %d ", Oflag); 416 printf("-b %d ", afs.fs_bsize); 417 /* -c unimplemented */ 418 printf("-e %d ", afs.fs_maxbpg); 419 printf("-f %d ", afs.fs_fsize); 420 printf("-g %u ", afs.fs_avgfilesize); 421 printf("-h %u ", afs.fs_avgfpdir); 422 /* -i unimplemented */ 423 printf("-m %d ", afs.fs_minfree); 424 printf("-o "); 425 switch (afs.fs_optim) { 426 case FS_OPTSPACE: 427 printf("space "); 428 break; 429 case FS_OPTTIME: 430 printf("time "); 431 break; 432 default: 433 printf("unknown "); 434 break; 435 } 436 /* -S unimplemented */ 437 printf("-s %jd ", (intmax_t)afs.fs_size * (afs.fs_fsize / DEV_BSIZE)); 438 printf("%s ", name); 439 printf("\n"); 440 441 return 0; 442 } 443 444 void 445 pbits(void *vp, int max) 446 { 447 int i; 448 char *p; 449 int count, j; 450 451 for (count = i = 0, p = vp; i < max; i++) 452 if (isset(p, i)) { 453 if (count) 454 printf(",%s", count % 6 ? " " : "\n\t"); 455 count++; 456 printf("%d", i); 457 j = i; 458 while ((i+1)<max && isset(p, i+1)) 459 i++; 460 if (i != j) 461 printf("-%d", i); 462 } 463 printf("\n"); 464 } 465 466 __dead void 467 usage(void) 468 { 469 (void)fprintf(stderr, "usage: dumpfs [-m] filesys | device\n"); 470 exit(1); 471 } 472