1 /* $NetBSD: lfs_debug.c,v 1.35 2007/12/12 03:49:03 lukem Exp $ */ 2 3 /*- 4 * Copyright (c) 1999, 2000, 2001, 2002, 2003 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Konrad E. Schroder <perseant@hhhh.org>. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 /* 39 * Copyright (c) 1991, 1993 40 * The Regents of the University of California. All rights reserved. 41 * 42 * Redistribution and use in source and binary forms, with or without 43 * modification, are permitted provided that the following conditions 44 * are met: 45 * 1. Redistributions of source code must retain the above copyright 46 * notice, this list of conditions and the following disclaimer. 47 * 2. Redistributions in binary form must reproduce the above copyright 48 * notice, this list of conditions and the following disclaimer in the 49 * documentation and/or other materials provided with the distribution. 50 * 3. Neither the name of the University nor the names of its contributors 51 * may be used to endorse or promote products derived from this software 52 * without specific prior written permission. 53 * 54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 64 * SUCH DAMAGE. 65 * 66 * @(#)lfs_debug.c 8.1 (Berkeley) 6/11/93 67 */ 68 69 #include <sys/cdefs.h> 70 __KERNEL_RCSID(0, "$NetBSD: lfs_debug.c,v 1.35 2007/12/12 03:49:03 lukem Exp $"); 71 72 #ifdef DEBUG 73 74 #include <machine/stdarg.h> 75 76 #include <sys/param.h> 77 #include <sys/systm.h> 78 #include <sys/namei.h> 79 #include <sys/vnode.h> 80 #include <sys/mount.h> 81 #include <sys/buf.h> 82 #include <sys/syslog.h> 83 #include <sys/proc.h> 84 85 #include <ufs/ufs/inode.h> 86 #include <ufs/lfs/lfs.h> 87 #include <ufs/lfs/lfs_extern.h> 88 89 int lfs_lognum; 90 struct lfs_log_entry lfs_log[LFS_LOGLENGTH]; 91 92 int lfs_bwrite_log(struct buf *bp, const char *file, int line) 93 { 94 struct vop_bwrite_args a; 95 a.a_desc = VDESC(vop_bwrite); 96 a.a_bp = bp; 97 98 if (!(bp->b_flags & (B_DELWRI | B_GATHERED))) { 99 LFS_ENTER_LOG("write", file, line, bp->b_lblkno, bp->b_flags, 100 curproc->p_pid); 101 } 102 return (VCALL(bp->b_vp, VOFFSET(vop_bwrite), &a)); 103 } 104 105 void lfs_dumplog(void) 106 { 107 int i; 108 const char *cp; 109 110 for (i = lfs_lognum; i != (lfs_lognum - 1) % LFS_LOGLENGTH; 111 i = (i + 1) % LFS_LOGLENGTH) 112 if (lfs_log[i].file) { 113 /* Only print out basename, for readability */ 114 cp = lfs_log[i].file; 115 while(*cp) 116 ++cp; 117 while(*cp != '/' && cp > lfs_log[i].file) 118 --cp; 119 120 printf("lbn %" PRId64 " %s %lx %d, %d %s\n", 121 lfs_log[i].block, 122 lfs_log[i].op, 123 lfs_log[i].flags, 124 lfs_log[i].pid, 125 lfs_log[i].line, 126 cp); 127 } 128 } 129 130 void 131 lfs_dump_super(struct lfs *lfsp) 132 { 133 int i; 134 135 printf("%s%x\t%s%x\t%s%d\t%s%d\n", 136 "magic ", lfsp->lfs_magic, 137 "version ", lfsp->lfs_version, 138 "size ", lfsp->lfs_size, 139 "ssize ", lfsp->lfs_ssize); 140 printf("%s%d\t%s%d\t%s%d\t%s%d\n", 141 "dsize ", lfsp->lfs_dsize, 142 "bsize ", lfsp->lfs_bsize, 143 "fsize ", lfsp->lfs_fsize, 144 "frag ", lfsp->lfs_frag); 145 146 printf("%s%d\t%s%d\t%s%d\t%s%d\n", 147 "minfree ", lfsp->lfs_minfree, 148 "inopb ", lfsp->lfs_inopb, 149 "ifpb ", lfsp->lfs_ifpb, 150 "nindir ", lfsp->lfs_nindir); 151 152 printf("%s%d\t%s%d\t%s%d\t%s%d\n", 153 "nseg ", lfsp->lfs_nseg, 154 "nspf ", lfsp->lfs_nspf, 155 "cleansz ", lfsp->lfs_cleansz, 156 "segtabsz ", lfsp->lfs_segtabsz); 157 158 printf("%s%x\t%s%d\t%s%lx\t%s%d\n", 159 "segmask ", lfsp->lfs_segmask, 160 "segshift ", lfsp->lfs_segshift, 161 "bmask ", (unsigned long)lfsp->lfs_bmask, 162 "bshift ", lfsp->lfs_bshift); 163 164 printf("%s%lu\t%s%d\t%s%lx\t%s%u\n", 165 "ffmask ", (unsigned long)lfsp->lfs_ffmask, 166 "ffshift ", lfsp->lfs_ffshift, 167 "fbmask ", (unsigned long)lfsp->lfs_fbmask, 168 "fbshift ", lfsp->lfs_fbshift); 169 170 printf("%s%d\t%s%d\t%s%x\t%s%qx\n", 171 "sushift ", lfsp->lfs_sushift, 172 "fsbtodb ", lfsp->lfs_fsbtodb, 173 "cksum ", lfsp->lfs_cksum, 174 "maxfilesize ", (long long)lfsp->lfs_maxfilesize); 175 176 printf("Superblock disk addresses:"); 177 for (i = 0; i < LFS_MAXNUMSB; i++) 178 printf(" %x", lfsp->lfs_sboffs[i]); 179 printf("\n"); 180 181 printf("Checkpoint Info\n"); 182 printf("%s%d\t%s%x\t%s%d\n", 183 "freehd ", lfsp->lfs_freehd, 184 "idaddr ", lfsp->lfs_idaddr, 185 "ifile ", lfsp->lfs_ifile); 186 printf("%s%x\t%s%d\t%s%x\t%s%x\t%s%x\t%s%x\n", 187 "bfree ", lfsp->lfs_bfree, 188 "nfiles ", lfsp->lfs_nfiles, 189 "lastseg ", lfsp->lfs_lastseg, 190 "nextseg ", lfsp->lfs_nextseg, 191 "curseg ", lfsp->lfs_curseg, 192 "offset ", lfsp->lfs_offset); 193 printf("tstamp %llx\n", (long long)lfsp->lfs_tstamp); 194 } 195 196 void 197 lfs_dump_dinode(struct ufs1_dinode *dip) 198 { 199 int i; 200 201 printf("%s%u\t%s%d\t%s%u\t%s%u\t%s%qu\t%s%d\n", 202 "mode ", dip->di_mode, 203 "nlink ", dip->di_nlink, 204 "uid ", dip->di_uid, 205 "gid ", dip->di_gid, 206 "size ", (long long)dip->di_size, 207 "blocks ", dip->di_blocks); 208 printf("inum %d\n", dip->di_inumber); 209 printf("Direct Addresses\n"); 210 for (i = 0; i < NDADDR; i++) { 211 printf("\t%x", dip->di_db[i]); 212 if ((i % 6) == 5) 213 printf("\n"); 214 } 215 for (i = 0; i < NIADDR; i++) 216 printf("\t%x", dip->di_ib[i]); 217 printf("\n"); 218 } 219 220 void 221 lfs_check_segsum(struct lfs *fs, struct segment *sp, char *file, int line) 222 { 223 int actual; 224 #if 0 225 static int offset; 226 #endif 227 228 if ((actual = 1) == 1) 229 return; /* XXXX not checking this anymore, really */ 230 231 if (sp->sum_bytes_left >= FINFOSIZE 232 && sp->fip->fi_nblocks > 512) { 233 printf("%s:%d: fi_nblocks = %d\n",file,line,sp->fip->fi_nblocks); 234 #ifdef DDB 235 Debugger(); 236 #endif 237 } 238 239 if (sp->sum_bytes_left > 484) { 240 printf("%s:%d: bad value (%d = -%d) for sum_bytes_left\n", 241 file, line, sp->sum_bytes_left, fs->lfs_sumsize-sp->sum_bytes_left); 242 panic("too many bytes"); 243 } 244 245 actual = fs->lfs_sumsize 246 /* amount taken up by FINFOs */ 247 - ((char *)&(sp->fip->fi_blocks[sp->fip->fi_nblocks]) - (char *)(sp->segsum)) 248 /* amount taken up by inode blocks */ 249 - sizeof(int32_t)*((sp->ninodes+INOPB(fs)-1) / INOPB(fs)); 250 #if 0 251 if (actual - sp->sum_bytes_left < offset) 252 { 253 printf("%s:%d: offset changed %d -> %d\n", file, line, 254 offset, actual-sp->sum_bytes_left); 255 offset = actual - sp->sum_bytes_left; 256 /* panic("byte mismatch"); */ 257 } 258 #endif 259 #if 0 260 if (actual != sp->sum_bytes_left) 261 printf("%s:%d: warning: segsum miscalc at %d (-%d => %d)\n", 262 file, line, sp->sum_bytes_left, 263 fs->lfs_sumsize-sp->sum_bytes_left, 264 actual); 265 #endif 266 if (sp->sum_bytes_left > 0 267 && ((char *)(sp->segsum))[fs->lfs_sumsize 268 - sizeof(int32_t) * ((sp->ninodes+INOPB(fs)-1) / INOPB(fs)) 269 - sp->sum_bytes_left] != '\0') { 270 printf("%s:%d: warning: segsum overwrite at %d (-%d => %d)\n", 271 file, line, sp->sum_bytes_left, 272 fs->lfs_sumsize-sp->sum_bytes_left, 273 actual); 274 #ifdef DDB 275 Debugger(); 276 #endif 277 } 278 } 279 280 void 281 lfs_check_bpp(struct lfs *fs, struct segment *sp, char *file, int line) 282 { 283 daddr_t blkno; 284 struct buf **bpp; 285 struct vnode *devvp; 286 287 devvp = VTOI(fs->lfs_ivnode)->i_devvp; 288 blkno = (*(sp->bpp))->b_blkno; 289 for (bpp = sp->bpp; bpp < sp->cbpp; bpp++) { 290 if ((*bpp)->b_blkno != blkno) { 291 if ((*bpp)->b_vp == devvp) { 292 printf("Oops, would misplace raw block " 293 "0x%" PRIx64 " at 0x%" PRIx64 "\n", 294 (*bpp)->b_blkno, 295 blkno); 296 } else { 297 printf("%s:%d: misplace ino %llu lbn %" PRId64 298 " at 0x%" PRIx64 " instead of " 299 "0x%" PRIx64 "\n", 300 file, line, 301 (unsigned long long) 302 VTOI((*bpp)->b_vp)->i_number, 303 (*bpp)->b_lblkno, 304 blkno, 305 (*bpp)->b_blkno); 306 } 307 } 308 blkno += fsbtodb(fs, btofsb(fs, (*bpp)->b_bcount)); 309 } 310 } 311 312 int lfs_debug_log_subsys[DLOG_MAX]; 313 314 /* 315 * Log events from various debugging areas of LFS, depending on what 316 * the user has enabled. 317 */ 318 void 319 lfs_debug_log(int subsys, const char *fmt, ...) 320 { 321 va_list ap; 322 323 /* If not debugging this subsys, exit */ 324 if (lfs_debug_log_subsys[subsys] == 0) 325 return; 326 327 va_start(ap, fmt); 328 vlog(LOG_DEBUG, fmt, ap); 329 va_end(ap); 330 } 331 #endif /* DEBUG */ 332