test/debug/kmapinfo.c

   1 /*
   2  * KMAPINFO.C
   3  *
   4  * cc -I/usr/src/sys kmapinfo.c -o /usr/local/bin/kmapinfo -lkvm
   5  *
   6  * Dump the kernel_map
   7  *
   8  * Copyright (c) 2010 The DragonFly Project.  All rights reserved.
   9  *
  10  * This code is derived from software contributed to The DragonFly Project
  11  * by Matthew Dillon <dillon@backplane.com>
  12  *
  13  * Redistribution and use in source and binary forms, with or without
  14  * modification, are permitted provided that the following conditions
  15  * are met:
  16  *
  17  * 1. Redistributions of source code must retain the above copyright
  18  *    notice, this list of conditions and the following disclaimer.
  19  * 2. Redistributions in binary form must reproduce the above copyright
  20  *    notice, this list of conditions and the following disclaimer in
  21  *    the documentation and/or other materials provided with the
  22  *    distribution.
  23  * 3. Neither the name of The DragonFly Project nor the names of its
  24  *    contributors may be used to endorse or promote products derived
  25  *    from this software without specific, prior written permission.
  26  *
  27  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  28  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  29  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  30  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
  31  * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  32  * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
  33  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  34  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
  35  * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  36  * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  37  * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  38  * SUCH DAMAGE.
  39  */
  40
  41 #define _KERNEL_STRUCTURES_
  42 #include <sys/param.h>
  43 #include <sys/user.h>
  44 #include <sys/malloc.h>
  45 #include <sys/signalvar.h>
  46 #include <sys/vnode.h>
  47 #include <sys/namecache.h>
  48
  49 #include <vm/vm.h>
  50 #include <vm/vm_page.h>
  51 #include <vm/vm_kern.h>
  52 #include <vm/vm_page.h>
  53 #include <vm/vm_object.h>
  54 #include <vm/vm_map.h>
  55 #include <vm/swap_pager.h>
  56 #include <vm/vnode_pager.h>
  57
  58 #include <stdio.h>
  59 #include <stdlib.h>
  60 #include <string.h>
  61 #include <fcntl.h>
  62 #include <kvm.h>
  63 #include <nlist.h>
  64 #include <getopt.h>
  65
  66 struct nlist Nl[] = {
  67     { "_kernel_map" },
  68     { NULL }
  69 };
  70
  71 int debugopt;
  72 int verboseopt;
  73 struct vm_map kmap;
  74 vm_offset_t total_empty;
  75 vm_offset_t total_used;
  76
  77 static void kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes);
  78 static void mapscan(kvm_t *kd, vm_map_entry_t entry,
  79                     vm_offset_t *lastp);
  80
  81 int
  82 main(int ac, char **av)
  83 {
  84     const char *corefile = NULL;
  85     const char *sysfile = NULL;
  86     kvm_t *kd;
  87     int ch;
  88     vm_offset_t last;
  89
  90     while ((ch = getopt(ac, av, "M:N:dv")) != -1) {
  91         switch(ch) {
  92         case 'd':
  93             ++debugopt;
  94             break;
  95         case 'v':
  96             ++verboseopt;
  97             break;
  98         case 'M':
  99             corefile = optarg;
 100             break;
 101         case 'N':
 102             sysfile = optarg;
 103             break;
 104         default:
 105             fprintf(stderr, "%s [-M core] [-N system]\n", av[0]);
 106             exit(1);
 107         }
 108     }
 109     ac -= optind;
 110     av += optind;
 111
 112     if ((kd = kvm_open(sysfile, corefile, NULL, O_RDONLY, "kvm:")) == NULL) {
 113         perror("kvm_open");
 114         exit(1);
 115     }
 116     if (kvm_nlist(kd, Nl) != 0) {
 117         perror("kvm_nlist");
 118         exit(1);
 119     }
 120     kkread(kd, Nl[0].n_value, &kmap, sizeof(kmap));
 121     last = kmap.header.start;
 122     mapscan(kd, kmap.rb_root.rbh_root, &last);
 123
 124     printf("%4ldM 0x%016jx %08lx-%08lx (%6ldK) EMPTY\n",
 125         total_used / 1024 / 1024,
 126         (intmax_t)NULL,
 127         last, kmap.header.end,
 128         (kmap.header.end - last) / 1024);
 129     total_empty += kmap.header.end - last;
 130
 131     printf("-----------------------------------------------\n");
 132     printf("Total empty space: %7ldK\n", total_empty / 1024);
 133     printf("Total used  space: %7ldK\n", total_used / 1024);
 134 }
 135
 136 static void
 137 mapscan(kvm_t *kd, vm_map_entry_t entryp, vm_offset_t *lastp)
 138 {
 139     struct vm_map_entry entry;
 140
 141     if (entryp == NULL)
 142         return;
 143     kkread(kd, (u_long)entryp, &entry, sizeof(entry));
 144     mapscan(kd, entry.rb_entry.rbe_left, lastp);
 145     if (*lastp != entry.start) {
 146             printf("%4ldM %p %08lx-%08lx (%6ldK) EMPTY\n",
 147                 total_used / 1024 / 1024,
 148                 entryp,
 149                 *lastp, entry.start,
 150                 (entry.start - *lastp) / 1024);
 151             total_empty += entry.start - *lastp;
 152     }
 153     printf("%4ldM %p %08lx-%08lx (%6ldK) type=%d object=%p\n",
 154         total_used / 1024 / 1024,
 155         entryp,
 156         entry.start, entry.end,
 157         (entry.end - entry.start) / 1024,
 158         entry.maptype,
 159         entry.object.map_object);
 160     total_used += entry.end - entry.start;
 161     *lastp = entry.end;
 162     mapscan(kd, entry.rb_entry.rbe_right, lastp);
 163 }
 164
 165 static void
 166 kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes)
 167 {
 168     if (kvm_read(kd, addr, buf, nbytes) != nbytes) {
 169         perror("kvm_read");
 170         exit(1);
 171     }
 172 }