dmesg.c revision 288498
1/*- 2 * Copyright (c) 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30#if 0 31#ifndef lint 32static const char copyright[] = 33"@(#) Copyright (c) 1991, 1993\n\ 34 The Regents of the University of California. All rights reserved.\n"; 35#endif /* not lint */ 36 37#ifndef lint 38static const char sccsid[] = "@(#)dmesg.c 8.1 (Berkeley) 6/5/93"; 39#endif /* not lint */ 40#endif 41#include <sys/cdefs.h> 42__FBSDID("$FreeBSD: stable/10/sbin/dmesg/dmesg.c 288498 2015-10-02 14:24:39Z vangyzen $"); 43 44#include <sys/types.h> 45#include <sys/msgbuf.h> 46#include <sys/sysctl.h> 47 48#include <ctype.h> 49#include <err.h> 50#include <errno.h> 51#include <fcntl.h> 52#include <kvm.h> 53#include <limits.h> 54#include <locale.h> 55#include <nlist.h> 56#include <stdio.h> 57#include <stdbool.h> 58#include <stdlib.h> 59#include <string.h> 60#include <unistd.h> 61#include <vis.h> 62#include <sys/syslog.h> 63 64static struct nlist nl[] = { 65#define X_MSGBUF 0 66 { "_msgbufp", 0, 0, 0, 0 }, 67 { NULL, 0, 0, 0, 0 }, 68}; 69 70void usage(void) __dead2; 71 72#define KREAD(addr, var) \ 73 kvm_read(kd, addr, &var, sizeof(var)) != sizeof(var) 74 75int 76main(int argc, char *argv[]) 77{ 78 struct msgbuf *bufp, cur; 79 char *bp, *ep, *memf, *nextp, *nlistf, *p, *q, *visbp; 80 kvm_t *kd; 81 size_t buflen, bufpos; 82 long pri; 83 int ch, clear; 84 bool all; 85 86 all = false; 87 clear = false; 88 (void) setlocale(LC_CTYPE, ""); 89 memf = nlistf = NULL; 90 while ((ch = getopt(argc, argv, "acM:N:")) != -1) 91 switch(ch) { 92 case 'a': 93 all = true; 94 break; 95 case 'c': 96 clear = true; 97 break; 98 case 'M': 99 memf = optarg; 100 break; 101 case 'N': 102 nlistf = optarg; 103 break; 104 case '?': 105 default: 106 usage(); 107 } 108 argc -= optind; 109 if (argc != 0) 110 usage(); 111 112 if (memf == NULL) { 113 /* 114 * Running kernel. Use sysctl. This gives an unwrapped 115 * buffer as a side effect. 116 */ 117 if (sysctlbyname("kern.msgbuf", NULL, &buflen, NULL, 0) == -1) 118 err(1, "sysctl kern.msgbuf"); 119 /* Allocate extra room for growth between the sysctl calls. */ 120 buflen += buflen/8; 121 /* Allocate more than sysctl sees, for room to append \n\0. */ 122 if ((bp = malloc(buflen + 2)) == NULL) 123 errx(1, "malloc failed"); 124 if (sysctlbyname("kern.msgbuf", bp, &buflen, NULL, 0) == -1) 125 err(1, "sysctl kern.msgbuf"); 126 if (clear) 127 if (sysctlbyname("kern.msgbuf_clear", NULL, NULL, &clear, sizeof(int))) 128 err(1, "sysctl kern.msgbuf_clear"); 129 } else { 130 /* Read in kernel message buffer and do sanity checks. */ 131 kd = kvm_open(nlistf, memf, NULL, O_RDONLY, "dmesg"); 132 if (kd == NULL) 133 exit (1); 134 if (kvm_nlist(kd, nl) == -1) 135 errx(1, "kvm_nlist: %s", kvm_geterr(kd)); 136 if (nl[X_MSGBUF].n_type == 0) 137 errx(1, "%s: msgbufp not found", 138 nlistf ? nlistf : "namelist"); 139 if (KREAD(nl[X_MSGBUF].n_value, bufp) || KREAD((long)bufp, cur)) 140 errx(1, "kvm_read: %s", kvm_geterr(kd)); 141 if (cur.msg_magic != MSG_MAGIC) 142 errx(1, "kernel message buffer has different magic " 143 "number"); 144 if ((bp = malloc(cur.msg_size + 2)) == NULL) 145 errx(1, "malloc failed"); 146 147 /* Unwrap the circular buffer to start from the oldest data. */ 148 bufpos = MSGBUF_SEQ_TO_POS(&cur, cur.msg_wseq); 149 if (kvm_read(kd, (long)&cur.msg_ptr[bufpos], bp, 150 cur.msg_size - bufpos) != (ssize_t)(cur.msg_size - bufpos)) 151 errx(1, "kvm_read: %s", kvm_geterr(kd)); 152 if (bufpos != 0 && kvm_read(kd, (long)cur.msg_ptr, 153 &bp[cur.msg_size - bufpos], bufpos) != (ssize_t)bufpos) 154 errx(1, "kvm_read: %s", kvm_geterr(kd)); 155 kvm_close(kd); 156 buflen = cur.msg_size; 157 } 158 159 /* 160 * Ensure that the buffer ends with a newline and a \0 to avoid 161 * complications below. We left space above. 162 */ 163 if (buflen == 0 || bp[buflen - 1] != '\n') 164 bp[buflen++] = '\n'; 165 bp[buflen] = '\0'; 166 167 if ((visbp = malloc(4 * buflen + 1)) == NULL) 168 errx(1, "malloc failed"); 169 170 /* 171 * The message buffer is circular, but has been unwrapped so that 172 * the oldest data comes first. The data will be preceded by \0's 173 * if the message buffer was not full. 174 */ 175 p = bp; 176 ep = &bp[buflen]; 177 if (*p == '\0') { 178 /* Strip leading \0's */ 179 while (*p == '\0') 180 p++; 181 } else if (!all) { 182 /* Skip the first line, since it is probably incomplete. */ 183 p = memchr(p, '\n', ep - p); 184 p++; 185 } 186 for (; p < ep; p = nextp) { 187 nextp = memchr(p, '\n', ep - p); 188 nextp++; 189 190 /* Skip ^<[0-9]+> syslog sequences. */ 191 if (*p == '<' && isdigit(*(p+1))) { 192 errno = 0; 193 pri = strtol(p + 1, &q, 10); 194 if (*q == '>' && pri >= 0 && pri < INT_MAX && 195 errno == 0) { 196 if (LOG_FAC(pri) != LOG_KERN && !all) 197 continue; 198 p = q + 1; 199 } 200 } 201 202 (void)strvisx(visbp, p, nextp - p, 0); 203 (void)printf("%s", visbp); 204 } 205 exit(0); 206} 207 208void 209usage(void) 210{ 211 fprintf(stderr, "usage: dmesg [-ac] [-M core [-N system]]\n"); 212 exit(1); 213} 214