Home | History | Annotate | Line # | Download | only in dmesg
dmesg.c revision 1.1
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1991 The Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd char copyright[] =
     36  1.1  cgd "@(#) Copyright (c) 1991 The Regents of the University of California.\n\
     37  1.1  cgd  All rights reserved.\n";
     38  1.1  cgd #endif /* not lint */
     39  1.1  cgd 
     40  1.1  cgd #ifndef lint
     41  1.1  cgd static char sccsid[] = "@(#)dmesg.c	5.9 (Berkeley) 5/2/91";
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.1  cgd #include <sys/cdefs.h>
     45  1.1  cgd #include <sys/msgbuf.h>
     46  1.1  cgd #include <time.h>
     47  1.1  cgd #include <nlist.h>
     48  1.1  cgd #include <kvm.h>
     49  1.1  cgd #include <stdlib.h>
     50  1.1  cgd #include <stdio.h>
     51  1.1  cgd #include <ctype.h>
     52  1.1  cgd 
     53  1.1  cgd struct nlist nl[] = {
     54  1.1  cgd #define	X_MSGBUFP	0
     55  1.1  cgd 	{ "_msgbufp" },
     56  1.1  cgd 	{ NULL },
     57  1.1  cgd };
     58  1.1  cgd 
     59  1.1  cgd void usage(), vputc();
     60  1.1  cgd void err __P((const char *, ...));
     61  1.1  cgd 
     62  1.1  cgd main(argc, argv)
     63  1.1  cgd 	int argc;
     64  1.1  cgd 	char **argv;
     65  1.1  cgd {
     66  1.1  cgd 	register int ch, newl, skip;
     67  1.1  cgd 	register char *p, *ep;
     68  1.1  cgd 	struct msgbuf cur;
     69  1.1  cgd 	int msgbufat;
     70  1.1  cgd 	char *core, *namelist;
     71  1.1  cgd 
     72  1.1  cgd 	core = namelist = NULL;
     73  1.1  cgd 	while ((ch = getopt(argc, argv, "M:N:")) != EOF)
     74  1.1  cgd 		switch(ch) {
     75  1.1  cgd 		case 'M':
     76  1.1  cgd 			core = optarg;
     77  1.1  cgd 			break;
     78  1.1  cgd 		case 'N':
     79  1.1  cgd 			namelist = optarg;
     80  1.1  cgd 			break;
     81  1.1  cgd 		case '?':
     82  1.1  cgd 		default:
     83  1.1  cgd 			usage();
     84  1.1  cgd 		}
     85  1.1  cgd 	argc -= optind;
     86  1.1  cgd 	argv += optind;
     87  1.1  cgd 
     88  1.1  cgd 	/* Read in kernel message buffer, do sanity checks. */
     89  1.1  cgd 	if (kvm_openfiles(namelist, core, NULL) == -1)
     90  1.1  cgd 		err("kvm_openfiles: %s", kvm_geterr());
     91  1.1  cgd 	if (kvm_nlist(nl) == -1)
     92  1.1  cgd 		err("kvm_nlist: %s", kvm_geterr());
     93  1.1  cgd 	if (nl[X_MSGBUFP].n_type == 0)
     94  1.1  cgd 		err("msgbufp not found namelist");
     95  1.1  cgd 
     96  1.1  cgd         kvm_read((void *)nl[X_MSGBUFP].n_value, (void *)&msgbufat, sizeof(msgbufat));
     97  1.1  cgd         kvm_read((void *)msgbufat, (void *)&cur, sizeof(cur));
     98  1.1  cgd 	if (cur.msg_magic != MSG_MAGIC)
     99  1.1  cgd 		err("magic number incorrect");
    100  1.1  cgd 	if (cur.msg_bufx >= MSG_BSIZE)
    101  1.1  cgd 		cur.msg_bufx = 0;
    102  1.1  cgd 
    103  1.1  cgd 	/*
    104  1.1  cgd 	 * The message buffer is circular; start at the read pointer, and
    105  1.1  cgd 	 * go to the write pointer - 1.
    106  1.1  cgd 	 */
    107  1.1  cgd 	p = cur.msg_bufc + cur.msg_bufx;
    108  1.1  cgd 	ep = cur.msg_bufc + cur.msg_bufx - 1;
    109  1.1  cgd 	for (newl = skip = 0; p != ep; ++p) {
    110  1.1  cgd 		if (p == cur.msg_bufc + MSG_BSIZE)
    111  1.1  cgd 			p = cur.msg_bufc;
    112  1.1  cgd 		ch = *p;
    113  1.1  cgd 		/* Skip "\n<.*>" syslog sequences. */
    114  1.1  cgd 		if (skip) {
    115  1.1  cgd 			if (ch == '>')
    116  1.1  cgd 				newl = skip = 0;
    117  1.1  cgd 			continue;
    118  1.1  cgd 		}
    119  1.1  cgd 		if (newl && ch == '<') {
    120  1.1  cgd 			skip = 1;
    121  1.1  cgd 			continue;
    122  1.1  cgd 		}
    123  1.1  cgd 		if (ch == '\0')
    124  1.1  cgd 			continue;
    125  1.1  cgd 		newl = (ch = *p) == '\n';
    126  1.1  cgd 		vputc(ch);
    127  1.1  cgd 	}
    128  1.1  cgd 	if (!newl)
    129  1.1  cgd 		(void)putchar('\n');
    130  1.1  cgd 	exit(0);
    131  1.1  cgd }
    132  1.1  cgd 
    133  1.1  cgd void
    134  1.1  cgd vputc(ch)
    135  1.1  cgd 	register int ch;
    136  1.1  cgd {
    137  1.1  cgd 	int meta;
    138  1.1  cgd 
    139  1.1  cgd 	if (!isascii(ch)) {
    140  1.1  cgd 		(void)putchar('M');
    141  1.1  cgd 		(void)putchar('-');
    142  1.1  cgd 		ch = toascii(ch);
    143  1.1  cgd 		meta = 1;
    144  1.1  cgd 	} else
    145  1.1  cgd 		meta = 0;
    146  1.1  cgd 	if (isprint(ch) || !meta && (ch == ' ' || ch == '\t' || ch == '\n'))
    147  1.1  cgd 		(void)putchar(ch);
    148  1.1  cgd 	else {
    149  1.1  cgd 		(void)putchar('^');
    150  1.1  cgd 		(void)putchar(ch == '\177' ? '?' : ch | 0100);
    151  1.1  cgd 	}
    152  1.1  cgd }
    153  1.1  cgd 
    154  1.1  cgd #if __STDC__
    155  1.1  cgd #include <stdarg.h>
    156  1.1  cgd #else
    157  1.1  cgd #include <varargs.h>
    158  1.1  cgd #endif
    159  1.1  cgd 
    160  1.1  cgd void
    161  1.1  cgd #if __STDC__
    162  1.1  cgd err(const char *fmt, ...)
    163  1.1  cgd #else
    164  1.1  cgd err(fmt, va_alist)
    165  1.1  cgd 	char *fmt;
    166  1.1  cgd         va_dcl
    167  1.1  cgd #endif
    168  1.1  cgd {
    169  1.1  cgd 	va_list ap;
    170  1.1  cgd #if __STDC__
    171  1.1  cgd 	va_start(ap, fmt);
    172  1.1  cgd #else
    173  1.1  cgd 	va_start(ap);
    174  1.1  cgd #endif
    175  1.1  cgd 	(void)fprintf(stderr, "dmesg: ");
    176  1.1  cgd 	(void)vfprintf(stderr, fmt, ap);
    177  1.1  cgd 	va_end(ap);
    178  1.1  cgd 	(void)fprintf(stderr, "\n");
    179  1.1  cgd 	exit(1);
    180  1.1  cgd 	/* NOTREACHED */
    181  1.1  cgd }
    182  1.1  cgd 
    183  1.1  cgd void
    184  1.1  cgd usage()
    185  1.1  cgd {
    186  1.1  cgd 	(void)fprintf(stderr, "usage: dmesg [-M core] [-N system]\n");
    187  1.1  cgd 	exit(1);
    188  1.1  cgd }
    189