procmap.c revision 1.49
1/* $OpenBSD: procmap.c,v 1.49 2013/05/14 20:18:52 miod Exp $ */ 2/* $NetBSD: pmap.c,v 1.1 2002/09/01 20:32:44 atatat Exp $ */ 3 4/* 5 * Copyright (c) 2002 The NetBSD Foundation, Inc. 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to The NetBSD Foundation 9 * by Andrew Brown. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 21 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 22 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 23 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 24 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 25 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 26 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 27 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33#include <sys/types.h> 34#include <sys/param.h> 35#include <sys/time.h> 36#include <sys/exec.h> 37#include <sys/proc.h> 38#include <sys/vnode.h> 39#include <sys/mount.h> 40#include <sys/uio.h> 41#include <sys/namei.h> 42#include <sys/sysctl.h> 43 44#include <uvm/uvm.h> 45#include <uvm/uvm_device.h> 46#include <uvm/uvm_amap.h> 47 48#include <ufs/ufs/quota.h> 49#include <ufs/ufs/inode.h> 50#undef doff_t 51#undef IN_ACCESS 52#undef i_size 53#undef i_devvp 54#include <isofs/cd9660/iso.h> 55#include <isofs/cd9660/cd9660_node.h> 56 57#include <kvm.h> 58#include <fcntl.h> 59#include <errno.h> 60#include <err.h> 61#include <stdlib.h> 62#include <stddef.h> 63#include <unistd.h> 64#include <stdio.h> 65#include <limits.h> 66#include <string.h> 67 68/* 69 * stolen (and munged) from #include <uvm/uvm_object.h> 70 */ 71#define UVM_OBJ_IS_VNODE(uobj) ((uobj)->pgops == uvm_vnodeops) 72#define UVM_OBJ_IS_AOBJ(uobj) ((uobj)->pgops == aobj_pager) 73#define UVM_OBJ_IS_DEVICE(uobj) ((uobj)->pgops == uvm_deviceops) 74 75#define PRINT_VMSPACE 0x00000001 76#define PRINT_VM_MAP 0x00000002 77#define PRINT_VM_MAP_HEADER 0x00000004 78#define PRINT_VM_MAP_ENTRY 0x00000008 79#define DUMP_NAMEI_CACHE 0x00000010 80 81struct cache_entry { 82 LIST_ENTRY(cache_entry) ce_next; 83 struct vnode *ce_vp, *ce_pvp; 84 u_long ce_cid, ce_pcid; 85 unsigned int ce_nlen; 86 char ce_name[256]; 87}; 88 89LIST_HEAD(cache_head, cache_entry) lcache; 90void *uvm_vnodeops, *uvm_deviceops, *aobj_pager; 91u_long kernel_map_addr; 92int debug, verbose; 93int print_all, print_map, print_maps, print_solaris, print_ddb, print_amap; 94int rwx = VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE; 95rlim_t maxssiz; 96 97struct sum { 98 unsigned long s_am_nslots; 99 unsigned long s_am_maxslots; 100 unsigned long s_am_nusedslots; 101}; 102 103struct kbit { 104 /* 105 * size of data chunk 106 */ 107 size_t k_size; 108 109 /* 110 * something for printf() and something for kvm_read() 111 */ 112 union { 113 void *k_addr_p; 114 u_long k_addr_ul; 115 } k_addr; 116 117 /* 118 * where we actually put the "stuff" 119 */ 120 union { 121 char data[1]; 122 struct vmspace vmspace; 123 struct vm_map vm_map; 124 struct vm_map_entry vm_map_entry; 125 struct vnode vnode; 126 struct uvm_object uvm_object; 127 struct mount mount; 128 struct namecache namecache; 129 struct inode inode; 130 struct iso_node iso_node; 131 struct uvm_device uvm_device; 132 struct vm_amap vm_amap; 133 } k_data; 134}; 135 136/* the size of the object in the kernel */ 137#define S(x) ((x)->k_size) 138/* the address of the object in kernel, two forms */ 139#define A(x) ((x)->k_addr.k_addr_ul) 140#define P(x) ((x)->k_addr.k_addr_p) 141/* the data from the kernel */ 142#define D(x,d) (&((x)->k_data.d)) 143 144/* suck the data from the kernel */ 145#define _KDEREF(kd, addr, dst, sz) do { \ 146 ssize_t len; \ 147 len = kvm_read((kd), (addr), (dst), (sz)); \ 148 if (len != (sz)) \ 149 errx(1, "%s == %ld vs. %lu @ %lx", \ 150 kvm_geterr(kd), (long)len, (unsigned long)(sz), (addr)); \ 151} while (0/*CONSTCOND*/) 152 153/* suck the data using the structure */ 154#define KDEREF(kd, item) _KDEREF((kd), A(item), D(item, data), S(item)) 155 156struct nlist nl[] = { 157 { "_maxsmap" }, 158#define NL_MAXSSIZ 0 159 { "_uvm_vnodeops" }, 160#define NL_UVM_VNODEOPS 1 161 { "_uvm_deviceops" }, 162#define NL_UVM_DEVICEOPS 2 163 { "_aobj_pager" }, 164#define NL_AOBJ_PAGER 3 165 { "_kernel_map" }, 166#define NL_KERNEL_MAP 4 167 { NULL } 168}; 169 170void load_symbols(kvm_t *); 171void process_map(kvm_t *, pid_t, struct kinfo_proc *, struct sum *); 172struct vm_map_entry *load_vm_map_entries(kvm_t *, struct vm_map_entry *, 173 struct vm_map_entry *); 174void unload_vm_map_entries(struct vm_map_entry *); 175size_t dump_vm_map_entry(kvm_t *, struct kbit *, struct vm_map_entry *, 176 struct sum *); 177char *findname(kvm_t *, struct kbit *, struct vm_map_entry *, struct kbit *, 178 struct kbit *, struct kbit *); 179int search_cache(kvm_t *, struct kbit *, char **, char *, size_t); 180static void __dead usage(void); 181static pid_t strtopid(const char *); 182void print_sum(struct sum *, struct sum *); 183 184/* 185 * uvm_map address tree implementation. 186 */ 187static int no_impl(void *, void *); 188static int 189no_impl(void *p, void *q) 190{ 191 errx(1, "uvm_map address comparison not implemented"); 192 return 0; 193} 194 195RB_GENERATE(uvm_map_addr, vm_map_entry, daddrs.addr_entry, no_impl); 196 197int 198main(int argc, char *argv[]) 199{ 200 char errbuf[_POSIX2_LINE_MAX], *kmem = NULL, *kernel = NULL; 201 struct kinfo_proc *kproc; 202 struct sum total_sum; 203 int many, ch, rc; 204 kvm_t *kd; 205 pid_t pid = -1; 206 gid_t gid; 207 208 while ((ch = getopt(argc, argv, "AaD:dlmM:N:p:Prsvx")) != -1) { 209 switch (ch) { 210 case 'A': 211 print_amap = 1; 212 break; 213 case 'a': 214 print_all = 1; 215 break; 216 case 'd': 217 print_ddb = 1; 218 break; 219 case 'D': 220 debug = atoi(optarg); 221 break; 222 case 'l': 223 print_maps = 1; 224 break; 225 case 'm': 226 print_map = 1; 227 break; 228 case 'M': 229 kmem = optarg; 230 break; 231 case 'N': 232 kernel = optarg; 233 break; 234 case 'p': 235 pid = strtopid(optarg); 236 break; 237 case 'P': 238 pid = getpid(); 239 break; 240 case 's': 241 print_solaris = 1; 242 break; 243 case 'v': 244 verbose = 1; 245 break; 246 case 'r': 247 case 'x': 248 errx(1, "-%c option not implemented, sorry", ch); 249 /*NOTREACHED*/ 250 default: 251 usage(); 252 } 253 } 254 255 /* 256 * Discard setgid privileges if not the running kernel so that bad 257 * guys can't print interesting stuff from kernel memory. 258 */ 259 gid = getgid(); 260 if (kernel != NULL || kmem != NULL) 261 if (setresgid(gid, gid, gid) == -1) 262 err(1, "setresgid"); 263 264 argc -= optind; 265 argv += optind; 266 267 /* more than one "process" to dump? */ 268 many = (argc > 1 - (pid == -1 ? 0 : 1)) ? 1 : 0; 269 270 /* apply default */ 271 if (print_all + print_map + print_maps + print_solaris + 272 print_ddb == 0) 273 print_solaris = 1; 274 275 /* start by opening libkvm */ 276 kd = kvm_openfiles(kernel, kmem, NULL, O_RDONLY, errbuf); 277 278 if (kernel == NULL && kmem == NULL) 279 if (setresgid(gid, gid, gid) == -1) 280 err(1, "setresgid"); 281 282 if (kd == NULL) 283 errx(1, "%s", errbuf); 284 285 /* get "bootstrap" addresses from kernel */ 286 load_symbols(kd); 287 288 memset(&total_sum, 0, sizeof(total_sum)); 289 290 do { 291 struct sum sum; 292 293 memset(&sum, 0, sizeof(sum)); 294 295 if (pid == -1) { 296 if (argc == 0) 297 pid = getppid(); 298 else { 299 pid = strtopid(argv[0]); 300 argv++; 301 argc--; 302 } 303 } 304 305 /* find the process id */ 306 if (pid == 0) 307 kproc = NULL; 308 else { 309 kproc = kvm_getprocs(kd, KERN_PROC_PID, pid, 310 sizeof(struct kinfo_proc), &rc); 311 if (kproc == NULL || rc == 0) { 312 errno = ESRCH; 313 warn("%d", pid); 314 pid = -1; 315 continue; 316 } 317 } 318 319 /* dump it */ 320 if (many) { 321 if (kproc) 322 printf("process %d:\n", pid); 323 else 324 printf("kernel:\n"); 325 } 326 327 process_map(kd, pid, kproc, &sum); 328 if (print_amap) 329 print_sum(&sum, &total_sum); 330 pid = -1; 331 } while (argc > 0); 332 333 if (print_amap) 334 print_sum(&total_sum, NULL); 335 336 /* done. go away. */ 337 rc = kvm_close(kd); 338 if (rc == -1) 339 err(1, "kvm_close"); 340 341 return (0); 342} 343 344void 345print_sum(struct sum *sum, struct sum *total_sum) 346{ 347 const char *t = total_sum == NULL ? "total " : ""; 348 printf("%samap allocated slots: %lu\n", t, sum->s_am_maxslots); 349 printf("%samap mapped slots: %lu\n", t, sum->s_am_nslots); 350 printf("%samap used slots: %lu\n", t, sum->s_am_nusedslots); 351 352 if (total_sum) { 353 total_sum->s_am_maxslots += sum->s_am_maxslots; 354 total_sum->s_am_nslots += sum->s_am_nslots; 355 total_sum->s_am_nusedslots += sum->s_am_nusedslots; 356 } 357} 358 359void 360process_map(kvm_t *kd, pid_t pid, struct kinfo_proc *proc, struct sum *sum) 361{ 362 struct kbit kbit[3], *vmspace, *vm_map; 363 struct vm_map_entry *vm_map_entry; 364 size_t total = 0; 365 char *thing; 366 uid_t uid; 367 int vmmap_flags; 368 369 if ((uid = getuid())) { 370 if (pid == 0) { 371 warnx("kernel map is restricted"); 372 return; 373 } 374 if (uid != proc->p_uid) { 375 warnx("other users' process maps are restricted"); 376 return; 377 } 378 } 379 380 vmspace = &kbit[0]; 381 vm_map = &kbit[1]; 382 383 A(vmspace) = 0; 384 A(vm_map) = 0; 385 386 if (pid > 0) { 387 A(vmspace) = (u_long)proc->p_vmspace; 388 S(vmspace) = sizeof(struct vmspace); 389 KDEREF(kd, vmspace); 390 thing = "proc->p_vmspace.vm_map"; 391 } else { 392 A(vmspace) = 0; 393 S(vmspace) = 0; 394 thing = "kernel_map"; 395 } 396 397 if (pid > 0 && (debug & PRINT_VMSPACE)) { 398 printf("proc->p_vmspace %p = {", P(vmspace)); 399 printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt); 400 printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm); 401 printf(" vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize); 402#if 0 403 printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss); 404#endif 405 printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize); 406 printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize); 407 printf(" vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize); 408 printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr); 409 printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr); 410 printf(" vm_maxsaddr = %p,", 411 D(vmspace, vmspace)->vm_maxsaddr); 412 printf(" vm_minsaddr = %p }\n", 413 D(vmspace, vmspace)->vm_minsaddr); 414 } 415 416 S(vm_map) = sizeof(struct vm_map); 417 if (pid > 0) { 418 A(vm_map) = A(vmspace); 419 memcpy(D(vm_map, vm_map), &D(vmspace, vmspace)->vm_map, 420 S(vm_map)); 421 } else { 422 A(vm_map) = kernel_map_addr; 423 KDEREF(kd, vm_map); 424 } 425 if (debug & PRINT_VM_MAP) { 426 printf("%s %p = {", thing, P(vm_map)); 427 428 printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap); 429 printf(" lock = <struct lock>\n"); 430 printf(" size = %lx,", D(vm_map, vm_map)->size); 431 printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count); 432 printf(" ref_lock = <struct simplelock>,\n"); 433 printf(" min_offset-max_offset = 0x%lx-0x%lx\n", 434 D(vm_map, vm_map)->min_offset, 435 D(vm_map, vm_map)->max_offset); 436 printf(" b_start-b_end = 0x%lx-0x%lx\n", 437 D(vm_map, vm_map)->b_start, 438 D(vm_map, vm_map)->b_end); 439 printf(" s_start-s_end = 0x%lx-0x%lx\n", 440 D(vm_map, vm_map)->s_start, 441 D(vm_map, vm_map)->s_end); 442 vmmap_flags = D(vm_map, vm_map)->flags; 443 printf(" flags = %x <%s%s%s%s%s%s >,\n", 444 vmmap_flags, 445 vmmap_flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "", 446 vmmap_flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "", 447 vmmap_flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "", 448 vmmap_flags & VM_MAP_BUSY ? " BUSY" : "", 449 vmmap_flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "", 450#if VM_MAP_TOPDOWN > 0 451 vmmap_flags & VM_MAP_TOPDOWN ? " TOPDOWN" : 452#endif 453 ""); 454 printf(" timestamp = %u }\n", D(vm_map, vm_map)->timestamp); 455 } 456 if (print_ddb) { 457 printf("MAP %p: [0x%lx->0x%lx]\n", P(vm_map), 458 D(vm_map, vm_map)->min_offset, 459 D(vm_map, vm_map)->max_offset); 460 printf("\tsz=%ld, ref=%d, version=%d, flags=0x%x\n", 461 D(vm_map, vm_map)->size, 462 D(vm_map, vm_map)->ref_count, 463 D(vm_map, vm_map)->timestamp, 464 D(vm_map, vm_map)->flags); 465 printf("\tpmap=%p(resident=<unknown>)\n", 466 D(vm_map, vm_map)->pmap); 467 } 468 469 /* headers */ 470#ifdef DISABLED_HEADERS 471 if (print_map) 472 printf("%-*s %-*s rwx RWX CPY NCP I W A\n", 473 (int)sizeof(long) * 2 + 2, "Start", 474 (int)sizeof(long) * 2 + 2, "End"); 475 if (print_maps) 476 printf("%-*s %-*s rwxp %-*s Dev Inode File\n", 477 (int)sizeof(long) * 2 + 0, "Start", 478 (int)sizeof(long) * 2 + 0, "End", 479 (int)sizeof(long) * 2 + 0, "Offset"); 480 if (print_solaris) 481 printf("%-*s %*s Protection File\n", 482 (int)sizeof(long) * 2 + 0, "Start", 483 (int)sizeof(int) * 2 - 1, "Size "); 484#endif 485 if (print_all) 486 printf("%-*s %-*s %*s %-*s rwxpc RWX I/W/A Dev %*s - File\n", 487 (int)sizeof(long) * 2, "Start", 488 (int)sizeof(long) * 2, "End", 489 (int)sizeof(int) * 2, "Size ", 490 (int)sizeof(long) * 2, "Offset", 491 (int)sizeof(int) * 2, "Inode"); 492 493 /* these are the "sub entries" */ 494 RB_ROOT(&D(vm_map, vm_map)->addr) = 495 load_vm_map_entries(kd, RB_ROOT(&D(vm_map, vm_map)->addr), NULL); 496 RB_FOREACH(vm_map_entry, uvm_map_addr, &D(vm_map, vm_map)->addr) 497 total += dump_vm_map_entry(kd, vmspace, vm_map_entry, sum); 498 unload_vm_map_entries(RB_ROOT(&D(vm_map, vm_map)->addr)); 499 500 if (print_solaris) 501 printf("%-*s %8luK\n", 502 (int)sizeof(void *) * 2 - 2, " total", 503 (unsigned long)total); 504 if (print_all) 505 printf("%-*s %9luk\n", 506 (int)sizeof(void *) * 4 - 1, " total", 507 (unsigned long)total); 508} 509 510void 511load_symbols(kvm_t *kd) 512{ 513 int rc, i; 514 515 rc = kvm_nlist(kd, &nl[0]); 516 if (rc == -1) 517 errx(1, "%s == %d", kvm_geterr(kd), rc); 518 for (i = 0; i < sizeof(nl)/sizeof(nl[0]); i++) 519 if (nl[i].n_value == 0 && nl[i].n_name) 520 printf("%s not found\n", nl[i].n_name); 521 522 uvm_vnodeops = (void*)nl[NL_UVM_VNODEOPS].n_value; 523 uvm_deviceops = (void*)nl[NL_UVM_DEVICEOPS].n_value; 524 aobj_pager = (void*)nl[NL_AOBJ_PAGER].n_value; 525 526 _KDEREF(kd, nl[NL_MAXSSIZ].n_value, &maxssiz, 527 sizeof(maxssiz)); 528 _KDEREF(kd, nl[NL_KERNEL_MAP].n_value, &kernel_map_addr, 529 sizeof(kernel_map_addr)); 530} 531 532/* 533 * Recreate the addr tree of vm_map in local memory. 534 */ 535struct vm_map_entry * 536load_vm_map_entries(kvm_t *kd, struct vm_map_entry *kptr, 537 struct vm_map_entry *parent) 538{ 539 static struct kbit map_ent; 540 struct vm_map_entry *result; 541 542 if (kptr == NULL) 543 return NULL; 544 545 A(&map_ent) = (u_long)kptr; 546 S(&map_ent) = sizeof(struct vm_map_entry); 547 KDEREF(kd, &map_ent); 548 549 result = malloc(sizeof(*result)); 550 if (result == NULL) 551 err(1, "malloc"); 552 memcpy(result, D(&map_ent, vm_map_entry), sizeof(struct vm_map_entry)); 553 554 /* 555 * Recurse to download rest of the tree. 556 */ 557 RB_LEFT(result, daddrs.addr_entry) = load_vm_map_entries(kd, 558 RB_LEFT(result, daddrs.addr_entry), result); 559 RB_RIGHT(result, daddrs.addr_entry) = load_vm_map_entries(kd, 560 RB_RIGHT(result, daddrs.addr_entry), result); 561 RB_PARENT(result, daddrs.addr_entry) = parent; 562 return result; 563} 564 565/* 566 * Release the addr tree of vm_map. 567 */ 568void 569unload_vm_map_entries(struct vm_map_entry *ent) 570{ 571 if (ent == NULL) 572 return; 573 574 unload_vm_map_entries(RB_LEFT(ent, daddrs.addr_entry)); 575 unload_vm_map_entries(RB_RIGHT(ent, daddrs.addr_entry)); 576 free(ent); 577} 578 579size_t 580dump_vm_map_entry(kvm_t *kd, struct kbit *vmspace, 581 struct vm_map_entry *vme, struct sum *sum) 582{ 583 struct kbit kbit[4], *uvm_obj, *vp, *vfs, *amap; 584 ino_t inode = 0; 585 dev_t dev = 0; 586 size_t sz = 0; 587 char *name; 588 589 uvm_obj = &kbit[0]; 590 vp = &kbit[1]; 591 vfs = &kbit[2]; 592 amap = &kbit[3]; 593 594 A(uvm_obj) = 0; 595 A(vp) = 0; 596 A(vfs) = 0; 597 598 if (debug & PRINT_VM_MAP_ENTRY) { 599 printf("%s = {", "vm_map_entry"); 600 printf(" start = %lx,", vme->start); 601 printf(" end = %lx,", vme->end); 602 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 603 printf(" offset = %lx,", (unsigned long)vme->offset); 604 printf(" etype = %x <%s%s%s%s%s >,", vme->etype, 605 vme->etype & UVM_ET_OBJ ? " OBJ" : "", 606 vme->etype & UVM_ET_SUBMAP ? " SUBMAP" : "", 607 vme->etype & UVM_ET_COPYONWRITE ? " COW" : "", 608 vme->etype & UVM_ET_NEEDSCOPY ? " NEEDSCOPY" : "", 609 vme->etype & UVM_ET_HOLE ? " HOLE" : ""); 610 printf(" protection = %x,\n", vme->protection); 611 printf(" max_protection = %x,", vme->max_protection); 612 printf(" inheritance = %d,", vme->inheritance); 613 printf(" wired_count = %d,\n", vme->wired_count); 614 printf(" aref = <struct vm_aref>,"); 615 printf(" advice = %d,", vme->advice); 616 printf(" flags = %x <%s%s > }\n", vme->flags, 617 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 618 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 619 } 620 621 A(vp) = 0; 622 A(uvm_obj) = 0; 623 624 if (vme->object.uvm_obj != NULL) { 625 P(uvm_obj) = vme->object.uvm_obj; 626 S(uvm_obj) = sizeof(struct uvm_object); 627 KDEREF(kd, uvm_obj); 628 if (UVM_ET_ISOBJ(vme) && 629 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 630 P(vp) = P(uvm_obj); 631 S(vp) = sizeof(struct vnode); 632 KDEREF(kd, vp); 633 } 634 } 635 636 if (vme->aref.ar_amap != NULL) { 637 P(amap) = vme->aref.ar_amap; 638 S(amap) = sizeof(struct vm_amap); 639 KDEREF(kd, amap); 640 } 641 642 A(vfs) = 0; 643 644 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 645 P(vfs) = D(vp, vnode)->v_mount; 646 S(vfs) = sizeof(struct mount); 647 KDEREF(kd, vfs); 648 D(vp, vnode)->v_mount = D(vfs, mount); 649 } 650 651 /* 652 * dig out the device number and inode number from certain 653 * file system types. 654 */ 655#define V_DATA_IS(vp, type, d, i) do { \ 656 struct kbit data; \ 657 P(&data) = D(vp, vnode)->v_data; \ 658 S(&data) = sizeof(*D(&data, type)); \ 659 KDEREF(kd, &data); \ 660 dev = D(&data, type)->d; \ 661 inode = D(&data, type)->i; \ 662} while (0/*CONSTCOND*/) 663 664 if (A(vp) && 665 D(vp, vnode)->v_type == VREG && 666 D(vp, vnode)->v_data != NULL) { 667 switch (D(vp, vnode)->v_tag) { 668 case VT_UFS: 669 case VT_EXT2FS: 670 V_DATA_IS(vp, inode, i_dev, i_number); 671 break; 672 case VT_ISOFS: 673 V_DATA_IS(vp, iso_node, i_dev, i_number); 674 break; 675 case VT_NON: 676 case VT_NFS: 677 case VT_MFS: 678 case VT_MSDOSFS: 679 case VT_PROCFS: 680 default: 681 break; 682 } 683 } 684 685 name = findname(kd, vmspace, vme, vp, vfs, uvm_obj); 686 687 if (print_map) { 688 printf("0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 689 vme->start, vme->end, 690 (vme->protection & VM_PROT_READ) ? 'r' : '-', 691 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 692 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 693 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 694 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 695 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 696 (vme->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 697 (vme->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 698 vme->inheritance, vme->wired_count, 699 vme->advice); 700 if (verbose) { 701 if (inode) 702 printf(" %d,%d %u", 703 major(dev), minor(dev), inode); 704 if (name[0]) 705 printf(" %s", name); 706 } 707 printf("\n"); 708 } 709 710 if (print_maps) 711 printf("%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %llu %s\n", 712 (int)sizeof(void *) * 2, vme->start, 713 (int)sizeof(void *) * 2, vme->end, 714 (vme->protection & VM_PROT_READ) ? 'r' : '-', 715 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 716 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 717 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 718 (int)sizeof(void *) * 2, 719 (unsigned long)vme->offset, 720 major(dev), minor(dev), (unsigned long long)inode, 721 inode ? name : ""); 722 723 if (print_ddb) { 724 printf(" - <lost address>: 0x%lx->0x%lx: " 725 "obj=%p/0x%lx, amap=%p/%d\n", 726 vme->start, vme->end, 727 vme->object.uvm_obj, (unsigned long)vme->offset, 728 vme->aref.ar_amap, vme->aref.ar_pageoff); 729 printf("\tsubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 730 "wc=%d, adv=%d\n", 731 (vme->etype & UVM_ET_SUBMAP) ? 'T' : 'F', 732 (vme->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F', 733 (vme->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F', 734 vme->protection, vme->max_protection, 735 vme->inheritance, vme->wired_count, vme->advice); 736 if (inode && verbose) 737 printf("\t(dev=%d,%d ino=%llu [%s] [%p])\n", 738 major(dev), minor(dev), (unsigned long long)inode, 739 inode ? name : "", P(vp)); 740 else if (name[0] == ' ' && verbose) 741 printf("\t(%s)\n", &name[2]); 742 } 743 744 if (print_solaris) { 745 char prot[30]; 746 747 prot[0] = '\0'; 748 prot[1] = '\0'; 749 if (vme->protection & VM_PROT_READ) 750 strlcat(prot, "/read", sizeof(prot)); 751 if (vme->protection & VM_PROT_WRITE) 752 strlcat(prot, "/write", sizeof(prot)); 753 if (vme->protection & VM_PROT_EXECUTE) 754 strlcat(prot, "/exec", sizeof(prot)); 755 756 sz = (size_t)((vme->end - vme->start) / 1024); 757 printf("%0*lX %6luK %-15s %s\n", 758 (int)sizeof(void *) * 2, (unsigned long)vme->start, 759 (unsigned long)sz, &prot[1], name); 760 } 761 762 if (print_all) { 763 sz = (size_t)((vme->end - vme->start) / 1024); 764 printf("%0*lx-%0*lx %7luk %0*lx %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7llu - %s", 765 (int)sizeof(void *) * 2, vme->start, (int)sizeof(void *) * 2, 766 vme->end - (vme->start != vme->end ? 1 : 0), (unsigned long)sz, 767 (int)sizeof(void *) * 2, (unsigned long)vme->offset, 768 (vme->protection & VM_PROT_READ) ? 'r' : '-', 769 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 770 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 771 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 772 (vme->etype & UVM_ET_NEEDSCOPY) ? '+' : '-', 773 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 774 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 775 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 776 vme->inheritance, vme->wired_count, vme->advice, 777 major(dev), minor(dev), (unsigned long long)inode, name); 778 if (A(vp)) 779 printf(" [%p]", P(vp)); 780 printf("\n"); 781 } 782 783 if (print_amap && vme->aref.ar_amap) { 784 printf(" amap - ref: %d fl: 0x%x maxsl: %d nsl: %d nuse: %d\n", 785 D(amap, vm_amap)->am_ref, 786 D(amap, vm_amap)->am_flags, 787 D(amap, vm_amap)->am_maxslot, 788 D(amap, vm_amap)->am_nslot, 789 D(amap, vm_amap)->am_nused); 790 if (sum) { 791 sum->s_am_nslots += D(amap, vm_amap)->am_nslot; 792 sum->s_am_maxslots += D(amap, vm_amap)->am_maxslot; 793 sum->s_am_nusedslots += D(amap, vm_amap)->am_nused; 794 } 795 } 796 797 /* no access allowed, don't count space */ 798 if ((vme->protection & rwx) == 0) 799 sz = 0; 800 801 return (sz); 802} 803 804char * 805findname(kvm_t *kd, struct kbit *vmspace, 806 struct vm_map_entry *vme, struct kbit *vp, 807 struct kbit *vfs, struct kbit *uvm_obj) 808{ 809 static char buf[1024], *name; 810 size_t l; 811 812 if (UVM_ET_ISOBJ(vme)) { 813 if (A(vfs)) { 814 l = strlen(D(vfs, mount)->mnt_stat.f_mntonname); 815 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 816 case 0: /* found something */ 817 if (name - (1 + 11 + l) < buf) 818 break; 819 name--; 820 *name = '/'; 821 /*FALLTHROUGH*/ 822 case 2: /* found nothing */ 823 name -= 11; 824 memcpy(name, " -unknown- ", (size_t)11); 825 name -= l; 826 memcpy(name, 827 D(vfs, mount)->mnt_stat.f_mntonname, l); 828 break; 829 case 1: /* all is well */ 830 if (name - (1 + l) < buf) 831 break; 832 name--; 833 *name = '/'; 834 if (l != 1) { 835 name -= l; 836 memcpy(name, 837 D(vfs, mount)->mnt_stat.f_mntonname, l); 838 } 839 break; 840 } 841 } else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 842 struct kbit kdev; 843 dev_t dev; 844 845 P(&kdev) = P(uvm_obj); 846 S(&kdev) = sizeof(struct uvm_device); 847 KDEREF(kd, &kdev); 848 dev = D(&kdev, uvm_device)->u_device; 849 name = devname(dev, S_IFCHR); 850 if (name != NULL) 851 snprintf(buf, sizeof(buf), "/dev/%s", name); 852 else 853 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 854 major(dev), minor(dev)); 855 name = buf; 856 } else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 857 name = " [ uvm_aobj ]"; 858 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 859 name = " [ ?VNODE? ]"; 860 else { 861 snprintf(buf, sizeof(buf), " [ unknown (%p) ]", 862 D(uvm_obj, uvm_object)->pgops); 863 name = buf; 864 } 865 } else if (D(vmspace, vmspace)->vm_maxsaddr <= (caddr_t)vme->start && 866 (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 867 (caddr_t)vme->end) { 868 name = " [ stack ]"; 869 } else if (D(vmspace, vmspace)->vm_daddr <= (caddr_t)vme->start && 870 D(vmspace, vmspace)->vm_daddr + BRKSIZ >= (caddr_t)vme->end) { 871 name = " [ heap ]"; 872 } else if (UVM_ET_ISHOLE(vme)) 873 name = " [ hole ]"; 874 else 875 name = " [ anon ]"; 876 877 return (name); 878} 879 880int 881search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 882{ 883 struct cache_entry *ce; 884 struct kbit svp; 885 char *o, *e; 886 u_long cid; 887 888 P(&svp) = P(vp); 889 S(&svp) = sizeof(struct vnode); 890 cid = D(vp, vnode)->v_id; 891 892 e = &buf[blen - 1]; 893 o = e; 894 do { 895 LIST_FOREACH(ce, &lcache, ce_next) 896 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 897 break; 898 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 899 if (o != e) 900 *(--o) = '/'; 901 if (o - ce->ce_nlen <= buf) 902 break; 903 o -= ce->ce_nlen; 904 memcpy(o, ce->ce_name, ce->ce_nlen); 905 P(&svp) = ce->ce_pvp; 906 cid = ce->ce_pcid; 907 } else 908 break; 909 } while (1/*CONSTCOND*/); 910 *e = '\0'; 911 *name = o; 912 913 if (e == o) 914 return (2); 915 916 KDEREF(kd, &svp); 917 return (D(&svp, vnode)->v_flag & VROOT); 918} 919 920static void __dead 921usage(void) 922{ 923 extern char *__progname; 924 fprintf(stderr, "usage: %s [-AadlmPsv] [-D number] " 925 "[-M core] [-N system] [-p pid] [pid ...]\n", 926 __progname); 927 exit(1); 928} 929 930static pid_t 931strtopid(const char *str) 932{ 933 pid_t pid; 934 935 errno = 0; 936 pid = (pid_t)strtonum(str, 0, INT_MAX, NULL); 937 if (errno != 0) 938 usage(); 939 return (pid); 940} 941