dmesg.c revision 1.6 1 1.1 cgd /*-
2 1.6 cgd * Copyright (c) 1991, 1993
3 1.6 cgd * The Regents of the University of California. 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.6 cgd static char copyright[] =
36 1.6 cgd "@(#) Copyright (c) 1991, 1993\n\
37 1.6 cgd The Regents of the University of California. All rights reserved.\n";
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.6 cgd static char sccsid[] = "@(#)dmesg.c 8.1 (Berkeley) 6/5/93";
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.6 cgd
47 1.6 cgd #include <fcntl.h>
48 1.6 cgd #include <kvm.h>
49 1.6 cgd #include <limits.h>
50 1.1 cgd #include <nlist.h>
51 1.6 cgd #include <stdio.h>
52 1.1 cgd #include <stdlib.h>
53 1.6 cgd #include <time.h>
54 1.5 jtc #include <unistd.h>
55 1.6 cgd #include <vis.h>
56 1.1 cgd
57 1.1 cgd struct nlist nl[] = {
58 1.6 cgd #define X_MSGBUF 0
59 1.1 cgd { "_msgbufp" },
60 1.1 cgd { NULL },
61 1.1 cgd };
62 1.1 cgd
63 1.6 cgd void usage __P((void));
64 1.1 cgd
65 1.6 cgd #define KREAD(addr, var) \
66 1.6 cgd kvm_read(kd, addr, &var, sizeof(var)) != sizeof(var)
67 1.6 cgd
68 1.6 cgd int
69 1.1 cgd main(argc, argv)
70 1.1 cgd int argc;
71 1.6 cgd char *argv[];
72 1.1 cgd {
73 1.1 cgd register int ch, newl, skip;
74 1.1 cgd register char *p, *ep;
75 1.6 cgd struct msgbuf *bufp, cur;
76 1.6 cgd char *memf, *nlistf;
77 1.6 cgd kvm_t *kd;
78 1.6 cgd char buf[5];
79 1.1 cgd
80 1.6 cgd memf = nlistf = NULL;
81 1.1 cgd while ((ch = getopt(argc, argv, "M:N:")) != EOF)
82 1.1 cgd switch(ch) {
83 1.1 cgd case 'M':
84 1.6 cgd memf = optarg;
85 1.1 cgd break;
86 1.1 cgd case 'N':
87 1.6 cgd nlistf = optarg;
88 1.1 cgd break;
89 1.1 cgd case '?':
90 1.1 cgd default:
91 1.1 cgd usage();
92 1.1 cgd }
93 1.1 cgd argc -= optind;
94 1.1 cgd argv += optind;
95 1.1 cgd
96 1.6 cgd /*
97 1.6 cgd * Discard setgid privileges if not the running kernel so that bad
98 1.6 cgd * guys can't print interesting stuff from kernel memory.
99 1.6 cgd */
100 1.6 cgd if (memf != NULL || nlistf != NULL)
101 1.6 cgd setgid(getgid());
102 1.6 cgd
103 1.1 cgd /* Read in kernel message buffer, do sanity checks. */
104 1.6 cgd if ((kd = kvm_open(nlistf, memf, NULL, O_RDONLY, "dmesg")) == NULL)
105 1.6 cgd exit (1);
106 1.6 cgd if (kvm_nlist(kd, nl) == -1)
107 1.6 cgd errx(1, "kvm_nlist: %s", kvm_geterr(kd));
108 1.6 cgd if (nl[X_MSGBUF].n_type == 0)
109 1.6 cgd errx(1, "%s: msgbufp not found", nlistf ? nlistf : "namelist");
110 1.6 cgd if (KREAD(nl[X_MSGBUF].n_value, bufp) || KREAD((long)bufp, cur))
111 1.6 cgd errx(1, "kvm_read: %s", kvm_geterr(kd));
112 1.6 cgd kvm_close(kd);
113 1.1 cgd if (cur.msg_magic != MSG_MAGIC)
114 1.6 cgd errx(1, "magic number incorrect");
115 1.1 cgd if (cur.msg_bufx >= MSG_BSIZE)
116 1.1 cgd cur.msg_bufx = 0;
117 1.1 cgd
118 1.1 cgd /*
119 1.1 cgd * The message buffer is circular; start at the read pointer, and
120 1.1 cgd * go to the write pointer - 1.
121 1.1 cgd */
122 1.1 cgd p = cur.msg_bufc + cur.msg_bufx;
123 1.1 cgd ep = cur.msg_bufc + cur.msg_bufx - 1;
124 1.1 cgd for (newl = skip = 0; p != ep; ++p) {
125 1.1 cgd if (p == cur.msg_bufc + MSG_BSIZE)
126 1.1 cgd p = cur.msg_bufc;
127 1.1 cgd ch = *p;
128 1.1 cgd /* Skip "\n<.*>" syslog sequences. */
129 1.1 cgd if (skip) {
130 1.1 cgd if (ch == '>')
131 1.1 cgd newl = skip = 0;
132 1.1 cgd continue;
133 1.1 cgd }
134 1.1 cgd if (newl && ch == '<') {
135 1.1 cgd skip = 1;
136 1.1 cgd continue;
137 1.1 cgd }
138 1.1 cgd if (ch == '\0')
139 1.1 cgd continue;
140 1.6 cgd newl = ch == '\n';
141 1.6 cgd (void)vis(buf, ch, 0, 0);
142 1.6 cgd if (buf[1] == 0)
143 1.6 cgd (void)putchar(buf[0]);
144 1.6 cgd else
145 1.6 cgd (void)printf("%s", buf);
146 1.1 cgd }
147 1.1 cgd if (!newl)
148 1.1 cgd (void)putchar('\n');
149 1.1 cgd exit(0);
150 1.1 cgd }
151 1.1 cgd
152 1.1 cgd void
153 1.1 cgd usage()
154 1.1 cgd {
155 1.1 cgd (void)fprintf(stderr, "usage: dmesg [-M core] [-N system]\n");
156 1.1 cgd exit(1);
157 1.1 cgd }
158