sbin/dmesg/dmesg.c

   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  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  * @(#) Copyright (c) 1991, 1993 The Regents of the University of California.  All rights reserved.
  34  * @(#)dmesg.c  8.1 (Berkeley) 6/5/93
  35  * $FreeBSD: src/sbin/dmesg/dmesg.c,v 1.11.2.3 2001/08/08 22:32:15 obrien Exp $
  36  * $DragonFly: src/sbin/dmesg/dmesg.c,v 1.7 2005/01/14 06:38:41 cpressey Exp $
  37  */
  38
  39 #include <sys/types.h>
  40 #include <sys/msgbuf.h>
  41 #include <sys/sysctl.h>
  42
  43 #include <err.h>
  44 #include <fcntl.h>
  45 #include <kvm.h>
  46 #include <locale.h>
  47 #include <stdio.h>
  48 #include <stdlib.h>
  49 #include <unistd.h>
  50 #include <vis.h>
  51 #include <sys/syslog.h>
  52
  53 struct nlist nl[] = {
  54 #define X_MSGBUF        0
  55         { "_msgbufp",   0, 0, 0, 0 },
  56         { NULL,         0, 0, 0, 0 },
  57 };
  58
  59 void usage(void);
  60
  61 #define KREAD(addr, var) \
  62         kvm_read(kd, addr, &var, sizeof(var)) != sizeof(var)
  63
  64 int
  65 main(int argc, char **argv)
  66 {
  67         int ch, newl, skip;
  68         char *p, *ep;
  69         struct msgbuf *bufp, cur;
  70         char *bp, *memf, *nlistf;
  71         kvm_t *kd;
  72         char buf[5];
  73         int all = 0;
  74         int pri = 0;
  75         size_t buflen, bufpos;
  76
  77         setlocale(LC_CTYPE, "");
  78         memf = nlistf = NULL;
  79         while ((ch = getopt(argc, argv, "aM:N:")) != -1)
  80                 switch(ch) {
  81                 case 'a':
  82                         all++;
  83                         break;
  84                 case 'M':
  85                         memf = optarg;
  86                         break;
  87                 case 'N':
  88                         nlistf = optarg;
  89                         break;
  90                 case '?':
  91                 default:
  92                         usage();
  93                 }
  94         argc -= optind;
  95         argv += optind;
  96
  97         if (memf == NULL && nlistf == NULL) {
  98                 /* Running kernel. Use sysctl. */
  99                 if (sysctlbyname("kern.msgbuf", NULL, &buflen, NULL, 0) == -1)
 100                         err(1, "sysctl kern.msgbuf");
 101                 if ((bp = malloc(buflen)) == NULL)
 102                         errx(1, "malloc failed");
 103                 if (sysctlbyname("kern.msgbuf", bp, &buflen, NULL, 0) == -1)
 104                         err(1, "sysctl kern.msgbuf");
 105                 /* We get a dewrapped buffer using sysctl. */
 106                 bufpos = 0;
 107         } else {
 108                 /* Read in kernel message buffer, do sanity checks. */
 109                 kd = kvm_open(nlistf, memf, NULL, O_RDONLY, "dmesg");
 110                 if (kd == NULL)
 111                         exit (1);
 112                 if (kvm_nlist(kd, nl) == -1)
 113                         errx(1, "kvm_nlist: %s", kvm_geterr(kd));
 114                 if (nl[X_MSGBUF].n_type == 0)
 115                         errx(1, "%s: msgbufp not found",
 116                             nlistf ? nlistf : "namelist");
 117                 if (KREAD(nl[X_MSGBUF].n_value, bufp) || KREAD((long)bufp, cur))
 118                         errx(1, "kvm_read: %s", kvm_geterr(kd));
 119                 if (cur.msg_magic != MSG_MAGIC)
 120                         errx(1, "kernel message buffer has different magic "
 121                             "number");
 122                 bp = malloc(cur.msg_size);
 123                 if (!bp)
 124                         errx(1, "malloc failed");
 125                 if (kvm_read(kd, (long)cur.msg_ptr, bp, cur.msg_size) !=
 126                     (ssize_t)cur.msg_size)
 127                         errx(1, "kvm_read: %s", kvm_geterr(kd));
 128                 kvm_close(kd);
 129                 buflen = cur.msg_size;
 130                 bufpos = cur.msg_bufx;
 131                 if (bufpos >= buflen)
 132                         bufpos = 0;
 133         }
 134
 135         /*
 136          * The message buffer is circular.  If the buffer has wrapped, the
 137          * write pointer points to the oldest data.  Otherwise, the write
 138          * pointer points to \0's following the data.  Read the entire
 139          * buffer starting at the write pointer and ignore nulls so that
 140          * we effectively start at the oldest data.
 141          */
 142         p = bp + bufpos;
 143         ep = (bufpos == 0 ? bp + buflen : p);
 144         newl = skip = 0;
 145         do {
 146                 if (p == bp + buflen)
 147                         p = bp;
 148                 ch = *p;
 149                 /* Skip "\n<.*>" syslog sequences. */
 150                 if (skip) {
 151                         if (ch == '\n') {
 152                                 skip = 0;
 153                                 newl = 1;
 154                         } if (ch == '>') {
 155                                 if (LOG_FAC(pri) == LOG_KERN || all)
 156                                         newl = skip = 0;
 157                         } else if (ch >= '0' && ch <= '9') {
 158                                 pri *= 10;
 159                                 pri += ch - '0';
 160                         }
 161                         continue;
 162                 }
 163                 if (newl && ch == '<') {
 164                         pri = 0;
 165                         skip = 1;
 166                         continue;
 167                 }
 168                 if (ch == '\0')
 169                         continue;
 170                 newl = ch == '\n';
 171                 vis(buf, ch, 0, 0);
 172                 if (buf[1] == 0)
 173                         putchar(buf[0]);
 174                 else
 175                         printf("%s", buf);
 176         } while (++p != ep);
 177         if (!newl)
 178                 putchar('\n');
 179         exit(0);
 180 }
 181
 182 void
 183 usage(void)
 184 {
 185         fprintf(stderr, "usage: dmesg [-a] [-M core] [-N system]\n");
 186         exit(1);
 187 }