1 /* $OpenBSD: procmap.c,v 1.41 2012/03/09 13:02:45 ariane 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 81 struct 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 89 LIST_HEAD(cache_head, cache_entry) lcache; 90 void *uvm_vnodeops, *uvm_deviceops, *aobj_pager; 91 u_long kernel_map_addr; 92 int debug, verbose; 93 int print_all, print_map, print_maps, print_solaris, print_ddb, print_amap; 94 int rwx = VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE; 95 rlim_t maxssiz; 96 97 struct sum { 98 unsigned long s_am_nslots; 99 unsigned long s_am_maxslots; 100 unsigned long s_am_nusedslots; 101 }; 102 103 struct 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 156 struct 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 170 void load_symbols(kvm_t *); 171 void process_map(kvm_t *, pid_t, struct kinfo_proc *, struct sum *); 172 struct vm_map_entry *load_vm_map_entries(kvm_t *, struct vm_map_entry *, 173 struct vm_map_entry *); 174 void unload_vm_map_entries(struct vm_map_entry *); 175 size_t dump_vm_map_entry(kvm_t *, struct kbit *, struct vm_map_entry *, 176 struct sum *); 177 char *findname(kvm_t *, struct kbit *, struct vm_map_entry *, struct kbit *, 178 struct kbit *, struct kbit *); 179 int search_cache(kvm_t *, struct kbit *, char **, char *, size_t); 180 #if 0 181 void load_name_cache(kvm_t *); 182 void cache_enter(struct namecache *); 183 #endif 184 static void __dead usage(void); 185 static pid_t strtopid(const char *); 186 void print_sum(struct sum *, struct sum *); 187 188 /* 189 * uvm_map address tree implementation. 190 */ 191 static int no_impl(void *, void *); 192 static int 193 no_impl(void *p, void *q) 194 { 195 errx(1, "uvm_map address comparison not implemented"); 196 return 0; 197 } 198 199 RB_GENERATE(uvm_map_addr, vm_map_entry, daddrs.addr_entry, no_impl); 200 201 int 202 main(int argc, char *argv[]) 203 { 204 char errbuf[_POSIX2_LINE_MAX], *kmem = NULL, *kernel = NULL; 205 struct kinfo_proc *kproc; 206 struct sum total_sum; 207 int many, ch, rc; 208 kvm_t *kd; 209 pid_t pid = -1; 210 gid_t gid; 211 212 while ((ch = getopt(argc, argv, "AaD:dlmM:N:p:Prsvx")) != -1) { 213 switch (ch) { 214 case 'A': 215 print_amap = 1; 216 break; 217 case 'a': 218 print_all = 1; 219 break; 220 case 'd': 221 print_ddb = 1; 222 break; 223 case 'D': 224 debug = atoi(optarg); 225 break; 226 case 'l': 227 print_maps = 1; 228 break; 229 case 'm': 230 print_map = 1; 231 break; 232 case 'M': 233 kmem = optarg; 234 break; 235 case 'N': 236 kernel = optarg; 237 break; 238 case 'p': 239 pid = strtopid(optarg); 240 break; 241 case 'P': 242 pid = getpid(); 243 break; 244 case 's': 245 print_solaris = 1; 246 break; 247 case 'v': 248 verbose = 1; 249 break; 250 case 'r': 251 case 'x': 252 errx(1, "-%c option not implemented, sorry", ch); 253 /*NOTREACHED*/ 254 default: 255 usage(); 256 } 257 } 258 259 /* 260 * Discard setgid privileges if not the running kernel so that bad 261 * guys can't print interesting stuff from kernel memory. 262 */ 263 gid = getgid(); 264 if (kernel != NULL || kmem != NULL) 265 if (setresgid(gid, gid, gid) == -1) 266 err(1, "setresgid"); 267 268 argc -= optind; 269 argv += optind; 270 271 /* more than one "process" to dump? */ 272 many = (argc > 1 - (pid == -1 ? 0 : 1)) ? 1 : 0; 273 274 /* apply default */ 275 if (print_all + print_map + print_maps + print_solaris + 276 print_ddb == 0) 277 print_solaris = 1; 278 279 /* start by opening libkvm */ 280 kd = kvm_openfiles(kernel, kmem, NULL, O_RDONLY, errbuf); 281 282 if (kernel == NULL && kmem == NULL) 283 if (setresgid(gid, gid, gid) == -1) 284 err(1, "setresgid"); 285 286 if (kd == NULL) 287 errx(1, "%s", errbuf); 288 289 /* get "bootstrap" addresses from kernel */ 290 load_symbols(kd); 291 292 memset(&total_sum, 0, sizeof(total_sum)); 293 294 do { 295 struct sum sum; 296 297 memset(&sum, 0, sizeof(sum)); 298 299 if (pid == -1) { 300 if (argc == 0) 301 pid = getppid(); 302 else { 303 pid = strtopid(argv[0]); 304 argv++; 305 argc--; 306 } 307 } 308 309 /* find the process id */ 310 if (pid == 0) 311 kproc = NULL; 312 else { 313 kproc = kvm_getprocs(kd, KERN_PROC_PID, pid, 314 sizeof(struct kinfo_proc), &rc); 315 if (kproc == NULL || rc == 0) { 316 errno = ESRCH; 317 warn("%d", pid); 318 pid = -1; 319 continue; 320 } 321 } 322 323 /* dump it */ 324 if (many) { 325 if (kproc) 326 printf("process %d:\n", pid); 327 else 328 printf("kernel:\n"); 329 } 330 331 process_map(kd, pid, kproc, &sum); 332 if (print_amap) 333 print_sum(&sum, &total_sum); 334 pid = -1; 335 } while (argc > 0); 336 337 if (print_amap) 338 print_sum(&total_sum, NULL); 339 340 /* done. go away. */ 341 rc = kvm_close(kd); 342 if (rc == -1) 343 err(1, "kvm_close"); 344 345 return (0); 346 } 347 348 void 349 print_sum(struct sum *sum, struct sum *total_sum) 350 { 351 const char *t = total_sum == NULL ? "total " : ""; 352 printf("%samap allocated slots: %lu\n", t, sum->s_am_maxslots); 353 printf("%samap mapped slots: %lu\n", t, sum->s_am_nslots); 354 printf("%samap used slots: %lu\n", t, sum->s_am_nusedslots); 355 356 if (total_sum) { 357 total_sum->s_am_maxslots += sum->s_am_maxslots; 358 total_sum->s_am_nslots += sum->s_am_nslots; 359 total_sum->s_am_nusedslots += sum->s_am_nusedslots; 360 } 361 } 362 363 void 364 process_map(kvm_t *kd, pid_t pid, struct kinfo_proc *proc, struct sum *sum) 365 { 366 struct kbit kbit[3], *vmspace, *vm_map; 367 struct vm_map_entry *vm_map_entry; 368 size_t total = 0; 369 char *thing; 370 uid_t uid; 371 int vmmap_flags; 372 373 if ((uid = getuid())) { 374 if (pid == 0) { 375 warnx("kernel map is restricted"); 376 return; 377 } 378 if (uid != proc->p_uid) { 379 warnx("other users' process maps are restricted"); 380 return; 381 } 382 } 383 384 vmspace = &kbit[0]; 385 vm_map = &kbit[1]; 386 387 A(vmspace) = 0; 388 A(vm_map) = 0; 389 390 if (pid > 0) { 391 A(vmspace) = (u_long)proc->p_vmspace; 392 S(vmspace) = sizeof(struct vmspace); 393 KDEREF(kd, vmspace); 394 thing = "proc->p_vmspace.vm_map"; 395 } else { 396 A(vmspace) = 0; 397 S(vmspace) = 0; 398 thing = "kernel_map"; 399 } 400 401 if (pid > 0 && (debug & PRINT_VMSPACE)) { 402 printf("proc->p_vmspace %p = {", P(vmspace)); 403 printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt); 404 printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm); 405 printf(" vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize); 406 printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss); 407 printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize); 408 printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize); 409 printf(" vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize); 410 printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr); 411 printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr); 412 printf(" vm_maxsaddr = %p,", 413 D(vmspace, vmspace)->vm_maxsaddr); 414 printf(" vm_minsaddr = %p }\n", 415 D(vmspace, vmspace)->vm_minsaddr); 416 } 417 418 S(vm_map) = sizeof(struct vm_map); 419 if (pid > 0) { 420 A(vm_map) = A(vmspace); 421 memcpy(D(vm_map, vm_map), &D(vmspace, vmspace)->vm_map, 422 S(vm_map)); 423 } else { 424 A(vm_map) = kernel_map_addr; 425 KDEREF(kd, vm_map); 426 } 427 if (debug & PRINT_VM_MAP) { 428 printf("%s %p = {", thing, P(vm_map)); 429 430 printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap); 431 printf(" lock = <struct lock>\n"); 432 printf(" size = %lx,", D(vm_map, vm_map)->size); 433 printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count); 434 printf(" ref_lock = <struct simplelock>,\n"); 435 printf(" min_offset-max_offset = 0x%lx-0x%lx\n", 436 D(vm_map, vm_map)->min_offset, 437 D(vm_map, vm_map)->max_offset); 438 printf(" b_start-b_end = 0x%lx-0x%lx\n", 439 D(vm_map, vm_map)->b_start, 440 D(vm_map, vm_map)->b_end); 441 printf(" s_start-s_end = 0x%lx-0x%lx\n", 442 D(vm_map, vm_map)->s_start, 443 D(vm_map, vm_map)->s_end); 444 vmmap_flags = D(vm_map, vm_map)->flags; 445 printf(" flags = %x <%s%s%s%s%s%s >,\n", 446 vmmap_flags, 447 vmmap_flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "", 448 vmmap_flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "", 449 vmmap_flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "", 450 vmmap_flags & VM_MAP_BUSY ? " BUSY" : "", 451 vmmap_flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "", 452 #if VM_MAP_TOPDOWN > 0 453 vmmap_flags & VM_MAP_TOPDOWN ? " TOPDOWN" : 454 #endif 455 ""); 456 printf(" timestamp = %u }\n", D(vm_map, vm_map)->timestamp); 457 } 458 if (print_ddb) { 459 printf("MAP %p: [0x%lx->0x%lx]\n", P(vm_map), 460 D(vm_map, vm_map)->min_offset, 461 D(vm_map, vm_map)->max_offset); 462 printf("\tsz=%ld, ref=%d, version=%d, flags=0x%x\n", 463 D(vm_map, vm_map)->size, 464 D(vm_map, vm_map)->ref_count, 465 D(vm_map, vm_map)->timestamp, 466 D(vm_map, vm_map)->flags); 467 printf("\tpmap=%p(resident=<unknown>)\n", 468 D(vm_map, vm_map)->pmap); 469 } 470 471 /* headers */ 472 #ifdef DISABLED_HEADERS 473 if (print_map) 474 printf("%-*s %-*s rwx RWX CPY NCP I W A\n", 475 (int)sizeof(long) * 2 + 2, "Start", 476 (int)sizeof(long) * 2 + 2, "End"); 477 if (print_maps) 478 printf("%-*s %-*s rwxp %-*s Dev Inode File\n", 479 (int)sizeof(long) * 2 + 0, "Start", 480 (int)sizeof(long) * 2 + 0, "End", 481 (int)sizeof(long) * 2 + 0, "Offset"); 482 if (print_solaris) 483 printf("%-*s %*s Protection File\n", 484 (int)sizeof(long) * 2 + 0, "Start", 485 (int)sizeof(int) * 2 - 1, "Size "); 486 #endif 487 if (print_all) 488 printf("%-*s %-*s %*s %-*s rwxpc RWX I/W/A Dev %*s - File\n", 489 (int)sizeof(long) * 2, "Start", 490 (int)sizeof(long) * 2, "End", 491 (int)sizeof(int) * 2, "Size ", 492 (int)sizeof(long) * 2, "Offset", 493 (int)sizeof(int) * 2, "Inode"); 494 495 /* these are the "sub entries" */ 496 RB_ROOT(&D(vm_map, vm_map)->addr) = 497 load_vm_map_entries(kd, RB_ROOT(&D(vm_map, vm_map)->addr), NULL); 498 RB_FOREACH(vm_map_entry, uvm_map_addr, &D(vm_map, vm_map)->addr) 499 total += dump_vm_map_entry(kd, vmspace, vm_map_entry, sum); 500 unload_vm_map_entries(RB_ROOT(&D(vm_map, vm_map)->addr)); 501 502 if (print_solaris) 503 printf("%-*s %8luK\n", 504 (int)sizeof(void *) * 2 - 2, " total", 505 (unsigned long)total); 506 if (print_all) 507 printf("%-*s %9luk\n", 508 (int)sizeof(void *) * 4 - 1, " total", 509 (unsigned long)total); 510 } 511 512 void 513 load_symbols(kvm_t *kd) 514 { 515 int rc, i; 516 517 rc = kvm_nlist(kd, &nl[0]); 518 if (rc == -1) 519 errx(1, "%s == %d", kvm_geterr(kd), rc); 520 for (i = 0; i < sizeof(nl)/sizeof(nl[0]); i++) 521 if (nl[i].n_value == 0 && nl[i].n_name) 522 printf("%s not found\n", nl[i].n_name); 523 524 uvm_vnodeops = (void*)nl[NL_UVM_VNODEOPS].n_value; 525 uvm_deviceops = (void*)nl[NL_UVM_DEVICEOPS].n_value; 526 aobj_pager = (void*)nl[NL_AOBJ_PAGER].n_value; 527 528 _KDEREF(kd, nl[NL_MAXSSIZ].n_value, &maxssiz, 529 sizeof(maxssiz)); 530 _KDEREF(kd, nl[NL_KERNEL_MAP].n_value, &kernel_map_addr, 531 sizeof(kernel_map_addr)); 532 } 533 534 /* 535 * Recreate the addr tree of vm_map in local memory. 536 */ 537 struct vm_map_entry * 538 load_vm_map_entries(kvm_t *kd, struct vm_map_entry *kptr, 539 struct vm_map_entry *parent) 540 { 541 static struct kbit map_ent; 542 struct vm_map_entry *result; 543 544 if (kptr == NULL) 545 return NULL; 546 547 A(&map_ent) = (u_long)kptr; 548 S(&map_ent) = sizeof(struct vm_map_entry); 549 KDEREF(kd, &map_ent); 550 551 result = malloc(sizeof(*result)); 552 if (result == NULL) 553 err(1, "malloc"); 554 memcpy(result, D(&map_ent, vm_map_entry), sizeof(struct vm_map_entry)); 555 556 /* 557 * Recurse to download rest of the tree. 558 */ 559 RB_LEFT(result, daddrs.addr_entry) = load_vm_map_entries(kd, 560 RB_LEFT(result, daddrs.addr_entry), result); 561 RB_RIGHT(result, daddrs.addr_entry) = load_vm_map_entries(kd, 562 RB_RIGHT(result, daddrs.addr_entry), result); 563 RB_PARENT(result, daddrs.addr_entry) = parent; 564 return result; 565 } 566 567 /* 568 * Release the addr tree of vm_map. 569 */ 570 void 571 unload_vm_map_entries(struct vm_map_entry *ent) 572 { 573 if (ent == NULL) 574 return; 575 576 unload_vm_map_entries(RB_LEFT(ent, daddrs.addr_entry)); 577 unload_vm_map_entries(RB_RIGHT(ent, daddrs.addr_entry)); 578 free(ent); 579 } 580 581 size_t 582 dump_vm_map_entry(kvm_t *kd, struct kbit *vmspace, 583 struct vm_map_entry *vme, struct sum *sum) 584 { 585 struct kbit kbit[4], *uvm_obj, *vp, *vfs, *amap; 586 ino_t inode = 0; 587 dev_t dev = 0; 588 size_t sz = 0; 589 char *name; 590 591 uvm_obj = &kbit[0]; 592 vp = &kbit[1]; 593 vfs = &kbit[2]; 594 amap = &kbit[3]; 595 596 A(uvm_obj) = 0; 597 A(vp) = 0; 598 A(vfs) = 0; 599 600 if (debug & PRINT_VM_MAP_ENTRY) { 601 printf("%s = {", "vm_map_entry"); 602 printf(" start = %lx,", vme->start); 603 printf(" end = %lx,", vme->end); 604 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 605 printf(" offset = %lx,", (unsigned long)vme->offset); 606 printf(" etype = %x <%s%s%s%s%s >,", vme->etype, 607 vme->etype & UVM_ET_OBJ ? " OBJ" : "", 608 vme->etype & UVM_ET_SUBMAP ? " SUBMAP" : "", 609 vme->etype & UVM_ET_COPYONWRITE ? " COW" : "", 610 vme->etype & UVM_ET_NEEDSCOPY ? " NEEDSCOPY" : "", 611 vme->etype & UVM_ET_HOLE ? " HOLE" : ""); 612 printf(" protection = %x,\n", vme->protection); 613 printf(" max_protection = %x,", vme->max_protection); 614 printf(" inheritance = %d,", vme->inheritance); 615 printf(" wired_count = %d,\n", vme->wired_count); 616 printf(" aref = <struct vm_aref>,"); 617 printf(" advice = %d,", vme->advice); 618 printf(" flags = %x <%s%s > }\n", vme->flags, 619 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 620 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 621 } 622 623 A(vp) = 0; 624 A(uvm_obj) = 0; 625 626 if (vme->object.uvm_obj != NULL) { 627 P(uvm_obj) = vme->object.uvm_obj; 628 S(uvm_obj) = sizeof(struct uvm_object); 629 KDEREF(kd, uvm_obj); 630 if (UVM_ET_ISOBJ(vme) && 631 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 632 P(vp) = P(uvm_obj); 633 S(vp) = sizeof(struct vnode); 634 KDEREF(kd, vp); 635 } 636 } 637 638 if (vme->aref.ar_amap != NULL) { 639 P(amap) = vme->aref.ar_amap; 640 S(amap) = sizeof(struct vm_amap); 641 KDEREF(kd, amap); 642 } 643 644 A(vfs) = 0; 645 646 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 647 P(vfs) = D(vp, vnode)->v_mount; 648 S(vfs) = sizeof(struct mount); 649 KDEREF(kd, vfs); 650 D(vp, vnode)->v_mount = D(vfs, mount); 651 } 652 653 /* 654 * dig out the device number and inode number from certain 655 * file system types. 656 */ 657 #define V_DATA_IS(vp, type, d, i) do { \ 658 struct kbit data; \ 659 P(&data) = D(vp, vnode)->v_data; \ 660 S(&data) = sizeof(*D(&data, type)); \ 661 KDEREF(kd, &data); \ 662 dev = D(&data, type)->d; \ 663 inode = D(&data, type)->i; \ 664 } while (0/*CONSTCOND*/) 665 666 if (A(vp) && 667 D(vp, vnode)->v_type == VREG && 668 D(vp, vnode)->v_data != NULL) { 669 switch (D(vp, vnode)->v_tag) { 670 case VT_UFS: 671 case VT_EXT2FS: 672 V_DATA_IS(vp, inode, i_dev, i_number); 673 break; 674 case VT_ISOFS: 675 V_DATA_IS(vp, iso_node, i_dev, i_number); 676 break; 677 case VT_NON: 678 case VT_NFS: 679 case VT_MFS: 680 case VT_MSDOSFS: 681 case VT_PROCFS: 682 default: 683 break; 684 } 685 } 686 687 name = findname(kd, vmspace, vme, vp, vfs, uvm_obj); 688 689 if (print_map) { 690 printf("0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 691 vme->start, vme->end, 692 (vme->protection & VM_PROT_READ) ? 'r' : '-', 693 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 694 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 695 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 696 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 697 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 698 (vme->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 699 (vme->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 700 vme->inheritance, vme->wired_count, 701 vme->advice); 702 if (verbose) { 703 if (inode) 704 printf(" %d,%d %u", 705 major(dev), minor(dev), inode); 706 if (name[0]) 707 printf(" %s", name); 708 } 709 printf("\n"); 710 } 711 712 if (print_maps) 713 printf("%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %u %s\n", 714 (int)sizeof(void *) * 2, vme->start, 715 (int)sizeof(void *) * 2, vme->end, 716 (vme->protection & VM_PROT_READ) ? 'r' : '-', 717 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 718 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 719 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 720 (int)sizeof(void *) * 2, 721 (unsigned long)vme->offset, 722 major(dev), minor(dev), inode, inode ? name : ""); 723 724 if (print_ddb) { 725 printf(" - <lost address>: 0x%lx->0x%lx: " 726 "obj=%p/0x%lx, amap=%p/%d\n", 727 vme->start, vme->end, 728 vme->object.uvm_obj, (unsigned long)vme->offset, 729 vme->aref.ar_amap, vme->aref.ar_pageoff); 730 printf("\tsubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 731 "wc=%d, adv=%d\n", 732 (vme->etype & UVM_ET_SUBMAP) ? 'T' : 'F', 733 (vme->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F', 734 (vme->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F', 735 vme->protection, vme->max_protection, 736 vme->inheritance, vme->wired_count, vme->advice); 737 if (inode && verbose) 738 printf("\t(dev=%d,%d ino=%u [%s] [%p])\n", 739 major(dev), minor(dev), inode, 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 %7u - %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), 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 804 char * 805 findname(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 880 int 881 search_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 #if 0 889 if (nchashtbl == NULL) 890 load_name_cache(kd); 891 #endif 892 893 P(&svp) = P(vp); 894 S(&svp) = sizeof(struct vnode); 895 cid = D(vp, vnode)->v_id; 896 897 e = &buf[blen - 1]; 898 o = e; 899 do { 900 LIST_FOREACH(ce, &lcache, ce_next) 901 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 902 break; 903 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 904 if (o != e) 905 *(--o) = '/'; 906 if (o - ce->ce_nlen <= buf) 907 break; 908 o -= ce->ce_nlen; 909 memcpy(o, ce->ce_name, ce->ce_nlen); 910 P(&svp) = ce->ce_pvp; 911 cid = ce->ce_pcid; 912 } else 913 break; 914 } while (1/*CONSTCOND*/); 915 *e = '\0'; 916 *name = o; 917 918 if (e == o) 919 return (2); 920 921 KDEREF(kd, &svp); 922 return (D(&svp, vnode)->v_flag & VROOT); 923 } 924 925 #if 0 926 void 927 load_name_cache(kvm_t *kd) 928 { 929 struct namecache _ncp, *ncp, *oncp; 930 struct nchashhead _ncpp, *ncpp; 931 u_long nchash; 932 int i; 933 934 LIST_INIT(&lcache); 935 936 _KDEREF(kd, nchash_addr, &nchash, sizeof(nchash)); 937 nchashtbl = calloc(sizeof(nchashtbl), (int)nchash); 938 if (nchashtbl == NULL) 939 err(1, "load_name_cache"); 940 _KDEREF(kd, nchashtbl_addr, nchashtbl, 941 sizeof(nchashtbl) * (int)nchash); 942 943 ncpp = &_ncpp; 944 945 for (i = 0; i < nchash; i++) { 946 ncpp = &nchashtbl[i]; 947 oncp = NULL; 948 LIST_FOREACH(ncp, ncpp, nc_hash) { 949 if (ncp == oncp || 950 ncp == (void*)0xdeadbeef) 951 break; 952 oncp = ncp; 953 _KDEREF(kd, (u_long)ncp, &_ncp, sizeof(*ncp)); 954 ncp = &_ncp; 955 if (ncp->nc_nlen > 0) { 956 if (ncp->nc_nlen > 2 || 957 ncp->nc_name[0] != '.' || 958 (ncp->nc_name[1] != '.' && 959 ncp->nc_nlen != 1)) 960 cache_enter(ncp); 961 } 962 } 963 } 964 } 965 966 void 967 cache_enter(struct namecache *ncp) 968 { 969 struct cache_entry *ce; 970 971 if (debug & DUMP_NAMEI_CACHE) 972 printf("ncp->nc_vp %10p, ncp->nc_dvp %10p, ncp->nc_nlen " 973 "%3d [%.*s] (nc_dvpid=%lu, nc_vpid=%lu)\n", 974 ncp->nc_vp, ncp->nc_dvp, 975 ncp->nc_nlen, ncp->nc_nlen, ncp->nc_name, 976 ncp->nc_dvpid, ncp->nc_vpid); 977 978 ce = malloc(sizeof(struct cache_entry)); 979 if (ce == NULL) 980 err(1, "cache_enter"); 981 982 ce->ce_vp = ncp->nc_vp; 983 ce->ce_pvp = ncp->nc_dvp; 984 ce->ce_cid = ncp->nc_vpid; 985 ce->ce_pcid = ncp->nc_dvpid; 986 ce->ce_nlen = (unsigned)ncp->nc_nlen; 987 strlcpy(ce->ce_name, ncp->nc_name, sizeof(ce->ce_name)); 988 989 LIST_INSERT_HEAD(&lcache, ce, ce_next); 990 } 991 #endif 992 993 static void __dead 994 usage(void) 995 { 996 extern char *__progname; 997 fprintf(stderr, "usage: %s [-AadlmPsv] [-D number] " 998 "[-M core] [-N system] [-p pid] [pid ...]\n", 999 __progname); 1000 exit(1); 1001 } 1002 1003 static pid_t 1004 strtopid(const char *str) 1005 { 1006 pid_t pid; 1007 1008 errno = 0; 1009 pid = (pid_t)strtonum(str, 0, INT_MAX, NULL); 1010 if (errno != 0) 1011 usage(); 1012 return (pid); 1013 } 1014