⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 dbgprf.c

📁 早期freebsd实现
💻 C
字号:
/* * Copyright (c) 1992 OMRON Corporation. * Copyright (c) 1992, 1993 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * OMRON Corporation. * * 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. * *	@(#)dbgprf.c	8.1 (Berkeley) 6/10/93 *//* * dbgprf.c -- batched printf for device driver debugging * by A.Fujita, May-3-1992 */#ifdef DEBUGPRINT#include <sys/param.h>#include <sys/systm.h>#include <machine/stdarg.h>static char *sprintn __P((u_long num, int base, int *len));#define DBG_LINES	 80#define DBG_BUFS	300struct dbgprf {	struct dbgprf *dbg_forw;	struct dbgprf *dbg_back;	char dbg_buf[DBG_LINES];};struct dbgprf dbgprf[DBG_BUFS];struct dbgprf dbgroot = {	&dbgroot,	&dbgroot,};int dbg_used = 0;voiddbgprintall(){	register struct dbgprf *dbgp;	for (dbgp = dbgroot.dbg_forw; dbgp != &dbgroot; dbgp = dbgp->dbg_forw) {		printf("%s", dbgp->dbg_buf);	}}void#ifdef __STDC__dbgprintf(const char *cfmt, ...)#elsedbgprintf(cfmt /*, va_alist */)	char *cfmt;#endif{	register struct dbgprf *dbgp;	register const char *fmt = cfmt;	register char *p, *bp;	register int ch, base;	u_long ul;	int lflag;	va_list ap;	if (dbg_used < DBG_BUFS) {		dbgp = &dbgprf[dbg_used++];	} else {		dbgp = dbgroot.dbg_forw;		remque(dbgp);	}	va_start(ap, cfmt);	for (bp = dbgp->dbg_buf; ; ) {		while ((ch = *(u_char *)fmt++) != '%')			if ((*bp++ = ch) == '\0')				goto done;		lflag = 0;reswitch:	switch (ch = *(u_char *)fmt++) {		case 'l':			lflag = 1;			goto reswitch;		case 'c':			*bp++ = va_arg(ap, int);			break;		case 's':			p = va_arg(ap, char *);			while (*bp++ = *p++)				;			--bp;			break;		case 'd':			ul = lflag ? va_arg(ap, long) : va_arg(ap, int);			if ((long)ul < 0) {				*bp++ = '-';				ul = -(long)ul;			}			base = 10;			goto number;			break;		case 'o':			ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);			base = 8;			goto number;			break;		case 'u':			ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);			base = 10;			goto number;			break;		case 'x':			ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);			base = 16;number:			for (p = sprintn(ul, base, NULL); ch = *p--;)				*bp++ = ch;			break;		default:			*bp++ = '%';			if (lflag)				*bp++ = 'l';			/* FALLTHROUGH */		case '%':			*bp++ = ch;		}	}	va_end(ap); done:	insque(dbgp, dbgroot.dbg_back);/*	printf("%s", dbgp->dbg_buf);	*/}/* * Put a number (base <= 16) in a buffer in reverse order; return an * optional length and a pointer to the NULL terminated (preceded?) * buffer. */static char *sprintn(ul, base, lenp)	register u_long ul;	register int base, *lenp;{					/* A long in base 8, plus NULL. */	static char buf[sizeof(long) * NBBY / 3 + 2];	register char *p;	p = buf;	do {		*++p = "0123456789abcdef"[ul % base];	} while (ul /= base);	if (lenp)		*lenp = p - buf;	return (p);}#endif

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -