1 /* 2 * KMAPINFO.C 3 * 4 * cc -I/usr/src/sys kmapinfo.c -o ~/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 vm_offset_t total_used_byid[VM_SUBSYS_LIMIT]; 77 78 static const char *formatnum(int64_t value); 79 static const char *entryid(vm_subsys_t id); 80 static void kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes); 81 static void mapscan(kvm_t *kd, vm_map_entry_t entry, 82 vm_offset_t *lastp); 83 84 int 85 main(int ac, char **av) 86 { 87 const char *corefile = NULL; 88 const char *sysfile = NULL; 89 kvm_t *kd; 90 int ch; 91 int i; 92 vm_offset_t last; 93 94 while ((ch = getopt(ac, av, "M:N:dv")) != -1) { 95 switch(ch) { 96 case 'd': 97 ++debugopt; 98 break; 99 case 'v': 100 ++verboseopt; 101 break; 102 case 'M': 103 corefile = optarg; 104 break; 105 case 'N': 106 sysfile = optarg; 107 break; 108 default: 109 fprintf(stderr, "%s [-M core] [-N system]\n", av[0]); 110 exit(1); 111 } 112 } 113 ac -= optind; 114 av += optind; 115 116 if ((kd = kvm_open(sysfile, corefile, NULL, O_RDONLY, "kvm:")) == NULL) { 117 perror("kvm_open"); 118 exit(1); 119 } 120 if (kvm_nlist(kd, Nl) != 0) { 121 perror("kvm_nlist"); 122 exit(1); 123 } 124 kkread(kd, Nl[0].n_value, &kmap, sizeof(kmap)); 125 last = kmap.header.start; 126 mapscan(kd, kmap.rb_root.rbh_root, &last); 127 128 printf("%4ldM 0x%016jx %08lx-%08lx (%6s) EMPTY\n", 129 total_used / 1024 / 1024, 130 (intmax_t)NULL, 131 last, kmap.header.end, 132 formatnum(kmap.header.end - last)); 133 total_empty += kmap.header.end - last; 134 135 printf("-----------------------------------------------\n"); 136 for (i = 0; i < VM_SUBSYS_LIMIT; ++i) 137 printf("Total-id: %9s %s\n", entryid(i), formatnum(total_used_byid[i])); 138 139 printf("-----------------------------------------------\n"); 140 printf("Total empty space: %s\n", formatnum(total_empty)); 141 printf("Total used space: %s\n", formatnum(total_used)); 142 } 143 144 static const char * 145 formatnum(int64_t value) 146 { 147 static char buf[64]; 148 const char *neg; 149 const char *suffix; 150 int64_t div = 1; 151 152 if (value < 0) { 153 value = -value; 154 neg = "-"; 155 } else { 156 neg = ""; 157 } 158 if (value < 100000) { 159 div = 1; 160 suffix = ""; 161 } else if (value < 1 * 1024 * 1024) { 162 div = 1024; 163 suffix = "K"; 164 } else if (value < 1024 * 1024 * 1024) { 165 div = 1024 * 1024; 166 suffix = "M"; 167 } else if (value < 1024LL * 1024 * 1024 * 1024) { 168 div = 1024 * 1024 * 1024; 169 suffix = "G"; 170 } else { 171 div = 1024LL * 1024 * 1024 * 1024; 172 suffix = "T"; 173 } 174 if (value == 0) { 175 snprintf(buf, sizeof(buf), ""); 176 } else if (div == 1) { 177 snprintf(buf, sizeof(buf), "%s%7.0f%s", 178 neg, 179 (double)value / (double)div, 180 suffix); 181 } else { 182 snprintf(buf, sizeof(buf), "%s%6.2f%s", 183 neg, 184 (double)value / (double)div, 185 suffix); 186 } 187 return buf; 188 } 189 190 static void 191 mapscan(kvm_t *kd, vm_map_entry_t entryp, vm_offset_t *lastp) 192 { 193 struct vm_map_entry entry; 194 195 if (entryp == NULL) 196 return; 197 kkread(kd, (u_long)entryp, &entry, sizeof(entry)); 198 mapscan(kd, entry.rb_entry.rbe_left, lastp); 199 if (*lastp != entry.start) { 200 printf("%4ldM %p %08lx-%08lx (%6ldK) EMPTY\n", 201 total_used / 1024 / 1024, 202 entryp, 203 *lastp, entry.start, 204 (entry.start - *lastp) / 1024); 205 total_empty += entry.start - *lastp; 206 } 207 printf("%4ldM %p %08lx-%08lx (%6ldK) id=%-8s object=%p\n", 208 total_used / 1024 / 1024, 209 entryp, 210 entry.start, entry.end, 211 (entry.end - entry.start) / 1024, 212 entryid(entry.id), 213 entry.object.map_object); 214 total_used += entry.end - entry.start; 215 if (entry.id < VM_SUBSYS_LIMIT) 216 total_used_byid[entry.id] += entry.end - entry.start; 217 else 218 total_used_byid[0] += entry.end - entry.start; 219 *lastp = entry.end; 220 mapscan(kd, entry.rb_entry.rbe_right, lastp); 221 } 222 223 static 224 const char * 225 entryid(vm_subsys_t id) 226 { 227 static char buf[32]; 228 229 switch(id) { 230 case VM_SUBSYS_UNKNOWN: 231 return("UNKNOWN"); 232 case VM_SUBSYS_KMALLOC: 233 return("KMALLOC"); 234 case VM_SUBSYS_STACK: 235 return("STACK"); 236 case VM_SUBSYS_IMGACT: 237 return("IMGACT"); 238 case VM_SUBSYS_EFI: 239 return("EFI"); 240 case VM_SUBSYS_RESERVED: 241 return("RESERVED"); 242 case VM_SUBSYS_INIT: 243 return("INIT"); 244 case VM_SUBSYS_PIPE: 245 return("PIPE"); 246 case VM_SUBSYS_PROC: 247 return("PROC"); 248 case VM_SUBSYS_SHMEM: 249 return("SHMEM"); 250 case VM_SUBSYS_SYSMAP: 251 return("SYSMAP"); 252 case VM_SUBSYS_MMAP: 253 return("MMAP"); 254 case VM_SUBSYS_BRK: 255 return("BRK"); 256 case VM_SUBSYS_BOGUS: 257 return("BOGUS"); 258 case VM_SUBSYS_BUF: 259 return("BUF"); 260 case VM_SUBSYS_BUFDATA: 261 return("BUFDATA"); 262 case VM_SUBSYS_GD: 263 return("GD"); 264 case VM_SUBSYS_IPIQ: 265 return("IPIQ"); 266 case VM_SUBSYS_PVENTRY: 267 return("PVENTRY"); 268 case VM_SUBSYS_PML4: 269 return("PML4"); 270 case VM_SUBSYS_MAPDEV: 271 return("MAPDEV"); 272 case VM_SUBSYS_ZALLOC: 273 return("ZALLOC"); 274 275 case VM_SUBSYS_DM: 276 return("DM"); 277 case VM_SUBSYS_CONTIG: 278 return("CONTIG"); 279 case VM_SUBSYS_DRM: 280 return("DRM"); 281 case VM_SUBSYS_DRM_GEM: 282 return("DRM_GEM"); 283 case VM_SUBSYS_DRM_SCAT: 284 return("DRM_SCAT"); 285 case VM_SUBSYS_DRM_VMAP: 286 return("DRM_VMAP"); 287 case VM_SUBSYS_DRM_TTM: 288 return("DRM_TTM"); 289 case VM_SUBSYS_HAMMER: 290 return("HAMMER"); 291 default: 292 break; 293 } 294 snprintf(buf, sizeof(buf), "%d", (int)id); 295 296 return buf; 297 } 298 299 300 static void 301 kkread(kvm_t *kd, u_long addr, void *buf, size_t nbytes) 302 { 303 if (kvm_read(kd, addr, buf, nbytes) != nbytes) { 304 perror("kvm_read"); 305 exit(1); 306 } 307 } 308