dmesg.c revision 1.14 1 1.14 enami /* $NetBSD: dmesg.c,v 1.14 1997/09/20 09:43:22 enami Exp $ */
2 1.1 cgd /*-
3 1.6 cgd * Copyright (c) 1991, 1993
4 1.6 cgd * The Regents of the University of California. All rights reserved.
5 1.1 cgd *
6 1.1 cgd * Redistribution and use in source and binary forms, with or without
7 1.1 cgd * modification, are permitted provided that the following conditions
8 1.1 cgd * are met:
9 1.1 cgd * 1. Redistributions of source code must retain the above copyright
10 1.1 cgd * notice, this list of conditions and the following disclaimer.
11 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer in the
13 1.1 cgd * documentation and/or other materials provided with the distribution.
14 1.1 cgd * 3. All advertising materials mentioning features or use of this software
15 1.1 cgd * must display the following acknowledgement:
16 1.1 cgd * This product includes software developed by the University of
17 1.1 cgd * California, Berkeley and its contributors.
18 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.11 lukem #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.11 lukem __COPYRIGHT("@(#) Copyright (c) 1991, 1993\n\
38 1.11 lukem The Regents of the University of California. All rights reserved.\n");
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #ifndef lint
42 1.8 cgd #if 0
43 1.6 cgd static char sccsid[] = "@(#)dmesg.c 8.1 (Berkeley) 6/5/93";
44 1.8 cgd #else
45 1.14 enami __RCSID("$NetBSD: dmesg.c,v 1.14 1997/09/20 09:43:22 enami Exp $");
46 1.8 cgd #endif
47 1.1 cgd #endif /* not lint */
48 1.1 cgd
49 1.1 cgd #include <sys/msgbuf.h>
50 1.6 cgd
51 1.7 cgd #include <err.h>
52 1.6 cgd #include <fcntl.h>
53 1.6 cgd #include <kvm.h>
54 1.6 cgd #include <limits.h>
55 1.1 cgd #include <nlist.h>
56 1.6 cgd #include <stdio.h>
57 1.1 cgd #include <stdlib.h>
58 1.6 cgd #include <time.h>
59 1.5 jtc #include <unistd.h>
60 1.6 cgd #include <vis.h>
61 1.1 cgd
62 1.1 cgd struct nlist nl[] = {
63 1.6 cgd #define X_MSGBUF 0
64 1.1 cgd { "_msgbufp" },
65 1.1 cgd { NULL },
66 1.1 cgd };
67 1.1 cgd
68 1.11 lukem int main __P((int, char *[]));
69 1.11 lukem void usage __P((void));
70 1.1 cgd
71 1.6 cgd #define KREAD(addr, var) \
72 1.6 cgd kvm_read(kd, addr, &var, sizeof(var)) != sizeof(var)
73 1.6 cgd
74 1.6 cgd int
75 1.1 cgd main(argc, argv)
76 1.1 cgd int argc;
77 1.6 cgd char *argv[];
78 1.1 cgd {
79 1.14 enami int ch, newl, skip, i;
80 1.14 enami char *p;
81 1.12 leo struct kern_msgbuf *bufp, cur;
82 1.12 leo char *memf, *nlistf, *bufdata;
83 1.6 cgd kvm_t *kd;
84 1.6 cgd char buf[5];
85 1.1 cgd
86 1.6 cgd memf = nlistf = NULL;
87 1.11 lukem while ((ch = getopt(argc, argv, "M:N:")) != -1)
88 1.1 cgd switch(ch) {
89 1.1 cgd case 'M':
90 1.6 cgd memf = optarg;
91 1.1 cgd break;
92 1.1 cgd case 'N':
93 1.6 cgd nlistf = optarg;
94 1.1 cgd break;
95 1.1 cgd case '?':
96 1.1 cgd default:
97 1.1 cgd usage();
98 1.1 cgd }
99 1.1 cgd argc -= optind;
100 1.1 cgd argv += optind;
101 1.1 cgd
102 1.6 cgd /*
103 1.6 cgd * Discard setgid privileges if not the running kernel so that bad
104 1.6 cgd * guys can't print interesting stuff from kernel memory.
105 1.6 cgd */
106 1.6 cgd if (memf != NULL || nlistf != NULL)
107 1.6 cgd setgid(getgid());
108 1.6 cgd
109 1.12 leo /* Read in message buffer header and data, and do sanity checks. */
110 1.6 cgd if ((kd = kvm_open(nlistf, memf, NULL, O_RDONLY, "dmesg")) == NULL)
111 1.6 cgd exit (1);
112 1.6 cgd if (kvm_nlist(kd, nl) == -1)
113 1.6 cgd errx(1, "kvm_nlist: %s", kvm_geterr(kd));
114 1.6 cgd if (nl[X_MSGBUF].n_type == 0)
115 1.6 cgd errx(1, "%s: msgbufp not found", nlistf ? nlistf : "namelist");
116 1.10 mjacob if (KREAD(nl[X_MSGBUF].n_value, bufp))
117 1.11 lukem errx(1, "kvm_read: %s (0x%lx)", kvm_geterr(kd),
118 1.10 mjacob nl[X_MSGBUF].n_value);
119 1.10 mjacob if (KREAD((long)bufp, cur))
120 1.11 lukem errx(1, "kvm_read: %s (0x%lx)", kvm_geterr(kd),
121 1.11 lukem (unsigned long)bufp);
122 1.1 cgd if (cur.msg_magic != MSG_MAGIC)
123 1.6 cgd errx(1, "magic number incorrect");
124 1.12 leo bufdata = malloc(cur.msg_bufs);
125 1.12 leo if (bufdata == NULL)
126 1.12 leo errx(1, "couldn't allocate space for buffer data");
127 1.12 leo if (kvm_read(kd, (long)&bufp->msg_bufc, bufdata,
128 1.12 leo cur.msg_bufs) != cur.msg_bufs)
129 1.12 leo errx(1, "kvm_read: %s", kvm_geterr(kd));
130 1.12 leo kvm_close(kd);
131 1.12 leo if (cur.msg_bufx >= cur.msg_bufs)
132 1.1 cgd cur.msg_bufx = 0;
133 1.1 cgd
134 1.1 cgd /*
135 1.14 enami * The message buffer is circular; start at the write pointer
136 1.14 enami * (which points the oldest character), and go to the write
137 1.14 enami * pointer - 1 (which points the newest character). I.e, loop
138 1.14 enami * over cur.msg_bufs times. Unused area is skipped since it
139 1.14 enami * contains nul.
140 1.1 cgd */
141 1.14 enami for (newl = skip = i = 0, p = bufdata + cur.msg_bufx;
142 1.14 enami i < cur.msg_bufs; i++, p++) {
143 1.12 leo if (p == bufdata + cur.msg_bufs)
144 1.12 leo p = bufdata;
145 1.1 cgd ch = *p;
146 1.1 cgd /* Skip "\n<.*>" syslog sequences. */
147 1.1 cgd if (skip) {
148 1.1 cgd if (ch == '>')
149 1.1 cgd newl = skip = 0;
150 1.1 cgd continue;
151 1.1 cgd }
152 1.1 cgd if (newl && ch == '<') {
153 1.1 cgd skip = 1;
154 1.1 cgd continue;
155 1.1 cgd }
156 1.1 cgd if (ch == '\0')
157 1.1 cgd continue;
158 1.6 cgd newl = ch == '\n';
159 1.6 cgd (void)vis(buf, ch, 0, 0);
160 1.6 cgd if (buf[1] == 0)
161 1.6 cgd (void)putchar(buf[0]);
162 1.6 cgd else
163 1.6 cgd (void)printf("%s", buf);
164 1.12 leo }
165 1.1 cgd if (!newl)
166 1.1 cgd (void)putchar('\n');
167 1.1 cgd exit(0);
168 1.1 cgd }
169 1.1 cgd
170 1.1 cgd void
171 1.1 cgd usage()
172 1.1 cgd {
173 1.1 cgd (void)fprintf(stderr, "usage: dmesg [-M core] [-N system]\n");
174 1.1 cgd exit(1);
175 1.1 cgd }
176