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