/* $OpenBSD: lfs_debug.c,v 1.4 1996/07/01 07:41:50 downsj Exp $ */ /* $NetBSD: lfs_debug.c,v 1.4 1996/03/17 02:16:28 christos Exp $ */ /* * Copyright (c) 1991, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)lfs_debug.c 8.1 (Berkeley) 6/11/93 */ #ifdef DEBUG #include #include #include #include #include #include #include #include #include void lfs_dump_super(lfsp) struct lfs *lfsp; { int i; (void)printf("%s%lx\t%s%lx\t%s%d\t%s%d\n", "magic ", lfsp->lfs_magic, "version ", lfsp->lfs_version, "size ", lfsp->lfs_size, "ssize ", lfsp->lfs_ssize); (void)printf("%s%d\t%s%d\t%s%d\t%s%d\n", "dsize ", lfsp->lfs_dsize, "bsize ", lfsp->lfs_bsize, "fsize ", lfsp->lfs_fsize, "frag ", lfsp->lfs_frag); (void)printf("%s%d\t%s%d\t%s%d\t%s%d\n", "minfree ", lfsp->lfs_minfree, "inopb ", lfsp->lfs_inopb, "ifpb ", lfsp->lfs_ifpb, "nindir ", lfsp->lfs_nindir); (void)printf("%s%d\t%s%d\t%s%d\t%s%d\n", "nseg ", lfsp->lfs_nseg, "nspf ", lfsp->lfs_nspf, "cleansz ", lfsp->lfs_cleansz, "segtabsz ", lfsp->lfs_segtabsz); (void)printf("%s%lx\t%s%d\t%s%lx\t%s%d\n", "segmask ", lfsp->lfs_segmask, "segshift ", lfsp->lfs_segshift, "bmask ", lfsp->lfs_bmask, "bshift ", lfsp->lfs_bshift); (void)printf("%s%lx\t%s%d\t%s%lx\t%s%d\n", "ffmask ", lfsp->lfs_ffmask, "ffshift ", lfsp->lfs_ffshift, "fbmask ", lfsp->lfs_fbmask, "fbshift ", lfsp->lfs_fbshift); (void)printf("%s%d\t%s%d\t%s%lx\t%s%qx\n", "sushift ", lfsp->lfs_sushift, "fsbtodb ", lfsp->lfs_fsbtodb, "cksum ", lfsp->lfs_cksum, "maxfilesize ", lfsp->lfs_maxfilesize); (void)printf("Superblock disk addresses:"); for (i = 0; i < LFS_MAXNUMSB; i++) (void)printf(" %lx", lfsp->lfs_sboffs[i]); (void)printf("\n"); (void)printf("Checkpoint Info\n"); (void)printf("%s%d\t%s%lx\t%s%d\n", "free ", lfsp->lfs_free, "idaddr ", lfsp->lfs_idaddr, "ifile ", lfsp->lfs_ifile); (void)printf("%s%lx\t%s%d\t%s%lx\t%s%lx\t%s%lx\t%s%lx\n", "bfree ", lfsp->lfs_bfree, "nfiles ", lfsp->lfs_nfiles, "lastseg ", lfsp->lfs_lastseg, "nextseg ", lfsp->lfs_nextseg, "curseg ", lfsp->lfs_curseg, "offset ", lfsp->lfs_offset); (void)printf("tstamp %lx\n", lfsp->lfs_tstamp); } void lfs_dump_dinode(dip) struct dinode *dip; { int i; (void)printf("%s%u\t%s%d\t%s%u\t%s%u\t%s%qu\n", "mode ", dip->di_mode, "nlink ", dip->di_nlink, "uid ", dip->di_uid, "gid ", dip->di_gid, "size ", dip->di_size); (void)printf("inum %ld\n", dip->di_inumber); (void)printf("Direct Addresses\n"); for (i = 0; i < NDADDR; i++) { (void)printf("\t%lx", dip->di_db[i]); if ((i % 6) == 5) (void)printf("\n"); } for (i = 0; i < NIADDR; i++) (void)printf("\t%lx", dip->di_ib[i]); (void)printf("\n"); } #endif /* DEBUG */