2
* Copyright (c) 2009 Robert N. M. Watson
5
* This software was developed at the University of Cambridge Computer
6
* Laboratory with support from a grant from Google, Inc.
8
* Copyright (c) 2002 Networks Associates Technology, Inc.
11
* This software was developed for the FreeBSD Project by Marshall
12
* Kirk McKusick and Network Associates Laboratories, the Security
13
* Research Division of Network Associates, Inc. under DARPA/SPAWAR
14
* contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
17
* Copyright (c) 1983, 1992, 1993
18
* The Regents of the University of California. All rights reserved.
20
* Redistribution and use in source and binary forms, with or without
21
* modification, are permitted provided that the following conditions
23
* 1. Redistributions of source code must retain the above copyright
24
* notice, this list of conditions and the following disclaimer.
25
* 2. Redistributions in binary form must reproduce the above copyright
26
* notice, this list of conditions and the following disclaimer in the
27
* documentation and/or other materials provided with the distribution.
28
* 4. Neither the name of the University nor the names of its contributors
29
* may be used to endorse or promote products derived from this software
30
* without specific prior written permission.
32
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46
static const char copyright[] =
47
"@(#) Copyright (c) 1983, 1992, 1993\n\
48
The Regents of the University of California. All rights reserved.\n";
53
static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95";
55
static const char rcsid[] =
59
#include <sys/param.h>
61
#include <sys/disklabel.h>
63
#include <ufs/ufs/dinode.h>
64
#include <ufs/ffs/fs.h>
82
int dumpfs(const char *);
84
int dumpfreespace(const char *, int);
85
void dumpfreespacecg(int);
86
int marshal(const char *);
87
void pbits(void *, int);
88
void pblklist(void *, int, off_t, int);
89
void ufserr(const char *);
90
void usage(void) __dead2;
93
main(int argc, char *argv[])
96
int ch, dofreespace, domarshal, eval;
98
dofreespace = domarshal = eval = 0;
100
while ((ch = getopt(argc, argv, "fm")) != -1) {
118
if (dofreespace && domarshal)
123
while ((name = *argv++) != NULL) {
124
if (ufs_disk_fillout(&disk, name) == -1) {
130
eval |= dumpfreespace(name, dofreespace);
132
eval |= marshal(name);
134
eval |= dumpfs(name);
135
ufs_disk_close(&disk);
141
dumpfs(const char *name)
148
switch (disk.d_ufs) {
150
fssize = afs.fs_size;
151
fstime = afs.fs_time;
152
printf("magic\t%x (UFS2)\ttime\t%s",
153
afs.fs_magic, ctime(&fstime));
154
printf("superblock location\t%jd\tid\t[ %x %x ]\n",
155
(intmax_t)afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]);
156
printf("ncg\t%d\tsize\t%jd\tblocks\t%jd\n",
157
afs.fs_ncg, (intmax_t)fssize, (intmax_t)afs.fs_dsize);
160
fssize = afs.fs_old_size;
161
fstime = afs.fs_old_time;
162
printf("magic\t%x (UFS1)\ttime\t%s",
163
afs.fs_magic, ctime(&fstime));
164
printf("id\t[ %08x %08x ]\n", afs.fs_id[0], afs.fs_id[1]);
165
printf("ncg\t%d\tsize\t%jd\tblocks\t%jd\n",
166
afs.fs_ncg, (intmax_t)fssize, (intmax_t)afs.fs_dsize);
171
printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
172
afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
173
printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
174
afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
175
printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
176
afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
177
printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n",
178
afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
179
afs.fs_maxsymlinklen);
180
switch (disk.d_ufs) {
182
printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
183
"maxbsize", afs.fs_maxbsize, afs.fs_maxbpg,
184
afs.fs_maxcontig, afs.fs_contigsumsize);
185
printf("nbfree\t%jd\tndir\t%jd\tnifree\t%jd\tnffree\t%jd\n",
186
(intmax_t)afs.fs_cstotal.cs_nbfree,
187
(intmax_t)afs.fs_cstotal.cs_ndir,
188
(intmax_t)afs.fs_cstotal.cs_nifree,
189
(intmax_t)afs.fs_cstotal.cs_nffree);
190
printf("bpg\t%d\tfpg\t%d\tipg\t%d\tunrefs\t%jd\n",
191
afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg,
192
(intmax_t)afs.fs_unrefs);
193
printf("nindir\t%d\tinopb\t%d\tmaxfilesize\t%ju\n",
194
afs.fs_nindir, afs.fs_inopb,
195
(uintmax_t)afs.fs_maxfilesize);
196
printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%jd\tcssize\t%d\n",
197
afs.fs_sbsize, afs.fs_cgsize, (intmax_t)afs.fs_csaddr,
201
printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
202
afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize);
203
printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
204
afs.fs_old_cstotal.cs_nbfree, afs.fs_old_cstotal.cs_ndir,
205
afs.fs_old_cstotal.cs_nifree, afs.fs_old_cstotal.cs_nffree);
206
printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
207
afs.fs_old_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg,
209
printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%ju\n",
210
afs.fs_nindir, afs.fs_inopb, afs.fs_old_nspf,
211
(uintmax_t)afs.fs_maxfilesize);
212
printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
213
afs.fs_sbsize, afs.fs_cgsize, afs.fs_old_cgoffset,
215
printf("csaddr\t%d\tcssize\t%d\n",
216
afs.fs_old_csaddr, afs.fs_cssize);
217
printf("rotdelay %dms\trps\t%d\ttrackskew %d\tinterleave %d\n",
218
afs.fs_old_rotdelay, afs.fs_old_rps, afs.fs_old_trackskew,
219
afs.fs_old_interleave);
220
printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n",
221
afs.fs_old_nsect, afs.fs_old_npsect, afs.fs_old_spc);
226
printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
227
afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
228
printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n",
229
afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
230
printf("avgfpdir %d\tavgfilesize %d\n",
231
afs.fs_avgfpdir, afs.fs_avgfilesize);
233
if (afs.fs_old_flags & FS_FLAGS_UPDATED)
234
fsflags = afs.fs_flags;
236
fsflags = afs.fs_old_flags;
239
if (fsflags & FS_UNCLEAN)
241
if (fsflags & FS_DOSOFTDEP)
242
printf("soft-updates ");
243
if (fsflags & FS_NEEDSFSCK)
244
printf("needs fsck run ");
245
if (fsflags & FS_INDEXDIRS)
246
printf("indexed directories ");
247
if (fsflags & FS_ACLS)
249
if (fsflags & FS_MULTILABEL)
250
printf("multilabel ");
251
if (fsflags & FS_GJOURNAL)
253
if (fsflags & FS_FLAGS_UPDATED)
254
printf("fs_flags expanded ");
255
if (fsflags & FS_NFS4ACLS)
256
printf("nfsv4acls ");
257
fsflags &= ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_NEEDSFSCK | FS_INDEXDIRS |
258
FS_ACLS | FS_MULTILABEL | FS_GJOURNAL | FS_FLAGS_UPDATED |
261
printf("unknown flags (%#x)", fsflags);
263
printf("fsmnt\t%s\n", afs.fs_fsmnt);
264
printf("volname\t%s\tswuid\t%ju\n",
265
afs.fs_volname, (uintmax_t)afs.fs_swuid);
266
printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
267
afs.fs_csp = calloc(1, afs.fs_cssize);
268
if (bread(&disk, fsbtodb(&afs, afs.fs_csaddr), afs.fs_csp, afs.fs_cssize) == -1)
270
for (i = 0; i < afs.fs_ncg; i++) {
271
struct csum *cs = &afs.fs_cs(&afs, i);
274
printf("(%d,%d,%d,%d) ",
275
cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
278
if (fssize % afs.fs_fpg) {
280
printf("cylinders in last group %d\n",
281
howmany(afs.fs_old_size % afs.fs_fpg,
282
afs.fs_old_spc / afs.fs_old_nspf));
283
printf("blocks in last group %ld\n\n",
284
(long)((fssize % afs.fs_fpg) / afs.fs_frag));
286
while ((i = cgread(&disk)) != 0) {
287
if (i == -1 || dumpcg())
303
printf("\ncg %d:\n", disk.d_lcg);
304
cur = fsbtodb(&afs, cgtod(&afs, disk.d_lcg)) * disk.d_bsize;
305
switch (disk.d_ufs) {
307
cgtime = acg.cg_time;
308
printf("magic\t%x\ttell\t%jx\ttime\t%s",
309
acg.cg_magic, (intmax_t)cur, ctime(&cgtime));
310
printf("cgx\t%d\tndblk\t%d\tniblk\t%d\tinitiblk %d\tunrefs %d\n",
311
acg.cg_cgx, acg.cg_ndblk, acg.cg_niblk, acg.cg_initediblk,
315
cgtime = acg.cg_old_time;
316
printf("magic\t%x\ttell\t%jx\ttime\t%s",
317
acg.cg_magic, (intmax_t)cur, ctime(&cgtime));
318
printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
319
acg.cg_cgx, acg.cg_old_ncyl, acg.cg_old_niblk,
325
printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
326
acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
327
acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
328
printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
329
acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
330
for (i = 1, j = 0; i < afs.fs_frag; i++) {
331
printf("\t%d", acg.cg_frsum[i]);
332
j += i * acg.cg_frsum[i];
334
printf("\nsum of frsum: %d", j);
335
if (afs.fs_contigsumsize > 0) {
336
for (i = 1; i < afs.fs_contigsumsize; i++) {
337
if ((i - 1) % 8 == 0)
338
printf("\nclusters %d-%d:", i,
339
afs.fs_contigsumsize - 1 < i + 7 ?
340
afs.fs_contigsumsize - 1 : i + 7);
341
printf("\t%d", cg_clustersum(&acg)[i]);
343
printf("\nclusters size %d and over: %d\n",
344
afs.fs_contigsumsize,
345
cg_clustersum(&acg)[afs.fs_contigsumsize]);
346
printf("clusters free:\t");
347
pbits(cg_clustersfree(&acg), acg.cg_nclusterblks);
350
printf("inodes used:\t");
351
pbits(cg_inosused(&acg), afs.fs_ipg);
352
printf("blks free:\t");
353
pbits(cg_blksfree(&acg), afs.fs_fpg);
358
dumpfreespace(const char *name, int fflag)
362
while ((i = cgread(&disk)) != 0) {
365
dumpfreespacecg(fflag);
374
dumpfreespacecg(int fflag)
377
pblklist(cg_blksfree(&acg), afs.fs_fpg, disk.d_lcg * afs.fs_fpg,
382
marshal(const char *name)
388
printf("# newfs command for %s (%s)\n", name, disk.d_name);
390
if (fs->fs_volname[0] != '\0')
391
printf("-L %s ", fs->fs_volname);
392
printf("-O %d ", disk.d_ufs);
393
if (fs->fs_flags & FS_DOSOFTDEP)
395
printf("-a %d ", fs->fs_maxcontig);
396
printf("-b %d ", fs->fs_bsize);
398
printf("-d %d ", fs->fs_maxbsize);
399
printf("-e %d ", fs->fs_maxbpg);
400
printf("-f %d ", fs->fs_fsize);
401
printf("-g %d ", fs->fs_avgfilesize);
402
printf("-h %d ", fs->fs_avgfpdir);
404
/* -j..l unimplemented */
405
printf("-m %d ", fs->fs_minfree);
406
/* -n unimplemented */
408
switch (fs->fs_optim) {
419
/* -p..r unimplemented */
420
printf("-s %jd ", (intmax_t)fsbtodb(fs, fs->fs_size));
421
printf("%s ", disk.d_name);
428
pbits(void *vp, int max)
434
for (count = i = 0, p = vp; i < max; i++)
437
printf(",%s", count % 6 ? " " : "\n\t");
441
while ((i+1)<max && isset(p, i+1))
450
pblklist(void *vp, int max, off_t offset, int fflag)
455
for (i = 0, p = vp; i < max; i++) {
457
printf("%jd", (intmax_t)(i + offset));
460
while ((i+1)<max && isset(p, i+1))
463
printf("-%jd", (intmax_t)(i + offset));
471
ufserr(const char *name)
473
if (disk.d_error != NULL)
474
warnx("%s: %s", name, disk.d_error);
482
(void)fprintf(stderr, "usage: dumpfs [-fm] filesys | device\n");