1 /* 2 * Copyright (c) 2002 Networks Associates Technology, Inc. 3 * All rights reserved. 4 * 5 * This software was developed for the FreeBSD Project by Marshall 6 * Kirk McKusick and Network Associates Laboratories, the Security 7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 9 * research program 10 * 11 * Copyright (c) 1982, 1989, 1993 12 * The Regents of the University of California. All rights reserved. 13 * (c) UNIX System Laboratories, Inc. 14 * Copyright (c) 1983, 1992, 1993 15 * The Regents of the University of California. All rights reserved. 16 * 17 * Redistribution and use in source and binary forms, with or without 18 * modification, are permitted provided that the following conditions 19 * are met: 20 * 1. Redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer. 22 * 2. Redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution. 25 * 3. All advertising materials mentioning features or use of this software 26 * must display the following acknowledgement: 27 * This product includes software developed by the University of 28 * California, Berkeley and its contributors. 29 * 4. Neither the name of the University nor the names of its contributors 30 * may be used to endorse or promote products derived from this software 31 * without specific prior written permission. 32 * 33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 */ 45 46 #ifndef lint 47 static const char copyright[] = 48 "@(#) Copyright (c) 1983, 1992, 1993\n\ 49 The Regents of the University of California. All rights reserved.\n"; 50 #endif /* not lint */ 51 52 #ifndef lint 53 #if 0 54 static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95"; 55 #endif 56 static const char rcsid[] = 57 "$FreeBSD$"; 58 #endif /* not lint */ 59 60 #include <sys/param.h> 61 #include <sys/time.h> 62 #include <sys/disklabel.h> 63 64 #include <ufs/ufs/dinode.h> 65 #include <ufs/ffs/fs.h> 66 67 #include <err.h> 68 #include <fcntl.h> 69 #include <fstab.h> 70 #include <libufs.h> 71 #include <stdio.h> 72 #include <stdlib.h> 73 #include <unistd.h> 74 75 #define afs disk.d_fs 76 77 union { 78 struct cg cg; 79 char pad[MAXBSIZE]; 80 } cgun; 81 #define acg cgun.cg 82 83 struct uufsd disk; 84 85 int dumpfs(const char *); 86 int dumpcg(int); 87 void pbits(void *, int); 88 void usage(void) __dead2; 89 90 int 91 main(int argc, char *argv[]) 92 { 93 struct fstab *fs; 94 int ch, eval; 95 96 while ((ch = getopt(argc, argv, "")) != -1) 97 switch(ch) { 98 case '?': 99 default: 100 usage(); 101 } 102 argc -= optind; 103 argv += optind; 104 105 if (argc < 1) 106 usage(); 107 108 for (eval = 0; *argv; ++argv) 109 if ((fs = getfsfile(*argv)) == NULL) 110 eval |= dumpfs(*argv); 111 else 112 eval |= dumpfs(fs->fs_spec); 113 exit(eval); 114 } 115 116 int 117 dumpfs(const char *name) 118 { 119 time_t time; 120 int64_t fssize; 121 int i; 122 123 if (ufs_disk_fillout(&disk, name) == -1) 124 goto err; 125 126 switch (disk.d_ufs) { 127 case 2: 128 fssize = afs.fs_size; 129 time = afs.fs_time; 130 printf("magic\t%x (UFS2)\ttime\t%s", 131 afs.fs_magic, ctime(&time)); 132 printf("offset\t%qd\tid\t[ %x %x ]\n", 133 afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]); 134 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n", 135 afs.fs_ncg, fssize, afs.fs_dsize); 136 break; 137 case 1: 138 fssize = afs.fs_old_size; 139 printf("magic\t%x (UFS1)\ttime\t%s", 140 afs.fs_magic, ctime(&afs.fs_old_time)); 141 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 142 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n", 143 afs.fs_ncg, fssize, afs.fs_dsize); 144 break; 145 default: 146 break; 147 } 148 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 149 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 150 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 151 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 152 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 153 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 154 printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n", 155 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 156 afs.fs_maxsymlinklen); 157 switch (disk.d_ufs) { 158 case 2: 159 printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 160 "maxbsize", afs.fs_maxbsize, afs.fs_maxbpg, 161 afs.fs_maxcontig, afs.fs_contigsumsize); 162 printf("nbfree\t%qd\tndir\t%qd\tnifree\t%qd\tnffree\t%qd\n", 163 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 164 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 165 printf("bpg\t%d\tfpg\t%d\tipg\t%d\n", 166 afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 167 printf("nindir\t%d\tinopb\t%d\tmaxfilesize\t%qu\n", 168 afs.fs_nindir, afs.fs_inopb, afs.fs_maxfilesize); 169 printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%d\tcssize\t%d\n", 170 afs.fs_sbsize, afs.fs_cgsize, afs.fs_csaddr, afs.fs_cssize); 171 break; 172 case 1: 173 printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 174 afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize); 175 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 176 afs.fs_old_cstotal.cs_nbfree, afs.fs_old_cstotal.cs_ndir, 177 afs.fs_old_cstotal.cs_nifree, afs.fs_old_cstotal.cs_nffree); 178 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 179 afs.fs_old_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, 180 afs.fs_ipg); 181 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%qu\n", 182 afs.fs_nindir, afs.fs_inopb, afs.fs_old_nspf, 183 afs.fs_maxfilesize); 184 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 185 afs.fs_sbsize, afs.fs_cgsize, afs.fs_old_cgoffset, 186 afs.fs_old_cgmask); 187 printf("csaddr\t%d\tcssize\t%d\n", 188 afs.fs_old_csaddr, afs.fs_cssize); 189 printf("rotdelay %dms\trps\t%d\ttrackskew %d\tinterleave %d\n", 190 afs.fs_old_rotdelay, afs.fs_old_rps, afs.fs_old_trackskew, 191 afs.fs_old_interleave); 192 printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n", 193 afs.fs_old_nsect, afs.fs_old_npsect, afs.fs_old_spc); 194 break; 195 default: 196 break; 197 } 198 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 199 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 200 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n", 201 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 202 printf("flags\t"); 203 if (afs.fs_flags == 0) 204 printf("none"); 205 if (afs.fs_flags & FS_UNCLEAN) 206 printf("unclean "); 207 if (afs.fs_flags & FS_DOSOFTDEP) 208 printf("soft-updates "); 209 if (afs.fs_flags & FS_NEEDSFSCK) 210 printf("needs fsck run "); 211 if (afs.fs_flags & FS_INDEXDIRS) 212 printf("indexed directories "); 213 if ((afs.fs_flags & 214 ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_NEEDSFSCK | FS_INDEXDIRS)) != 0) 215 printf("unknown flags (%#x)", afs.fs_flags & 216 ~(FS_UNCLEAN | FS_DOSOFTDEP | 217 FS_NEEDSFSCK | FS_INDEXDIRS)); 218 putchar('\n'); 219 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 220 afs.fs_csp = calloc(1, afs.fs_cssize); 221 if (bread(&disk, fsbtodb(&afs, afs.fs_csaddr), afs.fs_csp, afs.fs_cssize) == -1) 222 goto err; 223 for (i = 0; i < afs.fs_ncg; i++) { 224 struct csum *cs = &afs.fs_cs(&afs, i); 225 if (i && i % 4 == 0) 226 printf("\n\t"); 227 printf("(%d,%d,%d,%d) ", 228 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 229 } 230 printf("\n"); 231 if (fssize % afs.fs_fpg) { 232 if (disk.d_ufs == 1) 233 printf("cylinders in last group %d\n", 234 howmany(afs.fs_old_size % afs.fs_fpg, 235 afs.fs_old_spc / afs.fs_old_nspf)); 236 printf("blocks in last group %d\n\n", 237 (fssize % afs.fs_fpg) / afs.fs_frag); 238 } 239 for (i = 0; i < afs.fs_ncg; i++) 240 if (dumpcg(i)) 241 goto err; 242 ufs_disk_close(&disk); 243 return (0); 244 245 err: ufs_disk_close(&disk); 246 warn("%s", name); 247 return (1); 248 } 249 250 int 251 dumpcg(int c) 252 { 253 time_t time; 254 off_t cur; 255 int i, j; 256 257 printf("\ncg %d:\n", c); 258 cur = fsbtodb(&afs, cgtod(&afs, c)) * disk.d_bsize; 259 if (bread(&disk, fsbtodb(&afs, cgtod(&afs, c)), &acg, afs.fs_bsize) == -1) 260 return (1); 261 switch (disk.d_ufs) { 262 case 2: 263 time = acg.cg_time; 264 printf("magic\t%x\ttell\t%qx\ttime\t%s", 265 acg.cg_magic, cur, ctime(&time)); 266 printf("cgx\t%d\tndblk\t%d\tniblk\t%d\tinitiblk %d\n", 267 acg.cg_cgx, acg.cg_ndblk, acg.cg_niblk, acg.cg_initediblk); 268 break; 269 case 1: 270 printf("magic\t%x\ttell\t%qx\ttime\t%s", 271 acg.cg_magic, cur, ctime(&acg.cg_old_time)); 272 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 273 acg.cg_cgx, acg.cg_old_ncyl, acg.cg_old_niblk, 274 acg.cg_ndblk); 275 break; 276 default: 277 break; 278 } 279 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 280 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 281 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 282 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 283 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 284 for (i = 1, j = 0; i < afs.fs_frag; i++) { 285 printf("\t%d", acg.cg_frsum[i]); 286 j += i * acg.cg_frsum[i]; 287 } 288 printf("\nsum of frsum: %d", j); 289 if (afs.fs_contigsumsize > 0) { 290 for (i = 1; i < afs.fs_contigsumsize; i++) { 291 if ((i - 1) % 8 == 0) 292 printf("\nclusters %d-%d:", i, 293 afs.fs_contigsumsize - 1 < i + 7 ? 294 afs.fs_contigsumsize - 1 : i + 7); 295 printf("\t%d", cg_clustersum(&acg)[i]); 296 } 297 printf("\nclusters size %d and over: %d\n", 298 afs.fs_contigsumsize, 299 cg_clustersum(&acg)[afs.fs_contigsumsize]); 300 printf("clusters free:\t"); 301 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks); 302 } else 303 printf("\n"); 304 printf("inodes used:\t"); 305 pbits(cg_inosused(&acg), afs.fs_ipg); 306 printf("blks free:\t"); 307 pbits(cg_blksfree(&acg), afs.fs_fpg); 308 return (0); 309 } 310 311 void 312 pbits(void *vp, int max) 313 { 314 int i; 315 char *p; 316 int count, j; 317 318 for (count = i = 0, p = vp; i < max; i++) 319 if (isset(p, i)) { 320 if (count) 321 printf(",%s", count % 6 ? " " : "\n\t"); 322 count++; 323 printf("%d", i); 324 j = i; 325 while ((i+1)<max && isset(p, i+1)) 326 i++; 327 if (i != j) 328 printf("-%d", i); 329 } 330 printf("\n"); 331 } 332 333 void 334 usage(void) 335 { 336 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 337 exit(1); 338 } 339