1 /* $OpenBSD: procmap.c,v 1.14 2004/02/23 21:01:22 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 90 struct cache_entry { 91 LIST_ENTRY(cache_entry) ce_next; 92 struct vnode *ce_vp, *ce_pvp; 93 u_long ce_cid, ce_pcid; 94 unsigned int ce_nlen; 95 char ce_name[256]; 96 }; 97 98 LIST_HEAD(cache_head, cache_entry) lcache; 99 LIST_HEAD(nchashhead, namecache) *nchashtbl = NULL; 100 void *uvm_vnodeops, *uvm_deviceops, *aobj_pager; 101 #if 0 102 void *ubc_pager; 103 #endif 104 void *kernel_floor; 105 u_long nchash_addr, nchashtbl_addr, kernel_map_addr; 106 int debug, verbose; 107 int print_all, print_map, print_maps, print_solaris, print_ddb; 108 int rwx = VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE; 109 rlim_t maxssiz; 110 111 struct 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 163 struct 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 187 void load_symbols(kvm_t *); 188 void process_map(kvm_t *, pid_t, struct kinfo_proc *); 189 size_t dump_vm_map_entry(kvm_t *, struct kbit *, struct kbit *, int); 190 char *findname(kvm_t *, struct kbit *, struct kbit *, struct kbit *, 191 struct kbit *, struct kbit *); 192 int search_cache(kvm_t *, struct kbit *, char **, char *, size_t); 193 void load_name_cache(kvm_t *); 194 void cache_enter(struct namecache *); 195 static void __dead usage(void); 196 static pid_t strtopid(const char *); 197 198 int 199 main(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 336 void 337 process_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 A(vmspace) = (u_long)proc->kp_proc.p_vmspace; 372 S(vmspace) = sizeof(struct vmspace); 373 KDEREF(kd, vmspace); 374 thing = "proc->p_vmspace.vm_map"; 375 } else { 376 A(vmspace) = 0; 377 S(vmspace) = 0; 378 thing = "kernel_map"; 379 } 380 381 if (pid > 0 && (debug & PRINT_VMSPACE)) { 382 printf("proc->p_vmspace %p = {", P(vmspace)); 383 printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt); 384 printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm); 385 printf(" vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize); 386 printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss); 387 printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize); 388 printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize); 389 printf(" vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize); 390 printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr); 391 printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr); 392 printf(" vm_maxsaddr = %p,", 393 D(vmspace, vmspace)->vm_maxsaddr); 394 printf(" vm_minsaddr = %p }\n", 395 D(vmspace, vmspace)->vm_minsaddr); 396 } 397 398 S(vm_map) = sizeof(struct vm_map); 399 if (pid > 0) { 400 A(vm_map) = A(vmspace); 401 memcpy(D(vm_map, vm_map), &D(vmspace, vmspace)->vm_map, 402 S(vm_map)); 403 } else { 404 A(vm_map) = kernel_map_addr; 405 KDEREF(kd, vm_map); 406 } 407 if (debug & PRINT_VM_MAP) { 408 printf("%s %p = {", thing, P(vm_map)); 409 410 printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap); 411 printf(" lock = <struct lock>,"); 412 printf(" header = <struct vm_map_entry>,"); 413 printf(" nentries = %d,\n", D(vm_map, vm_map)->nentries); 414 printf(" size = %lx,", D(vm_map, vm_map)->size); 415 printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count); 416 printf(" ref_lock = <struct simplelock>,\n"); 417 printf(" hint = %p,", D(vm_map, vm_map)->hint); 418 printf(" hint_lock = <struct simplelock>,\n"); 419 printf(" first_free = %p,", D(vm_map, vm_map)->first_free); 420 printf(" flags = %x <%s%s%s%s%s%s >,\n", D(vm_map, vm_map)->flags, 421 D(vm_map, vm_map)->flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "", 422 D(vm_map, vm_map)->flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "", 423 D(vm_map, vm_map)->flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "", 424 D(vm_map, vm_map)->flags & VM_MAP_BUSY ? " BUSY" : "", 425 D(vm_map, vm_map)->flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "", 426 #if VM_MAP_TOPDOWN > 0 427 D(vm_map, vm_map)->flags & VM_MAP_TOPDOWN ? " TOPDOWN" : 428 #endif 429 ""); 430 printf(" flags_lock = <struct simplelock>,"); 431 printf(" timestamp = %u }\n", D(vm_map, vm_map)->timestamp); 432 } 433 if (print_ddb) { 434 printf("MAP %p: [0x%lx->0x%lx]\n", P(vm_map), 435 D(vm_map, vm_map)->min_offset, 436 D(vm_map, vm_map)->max_offset); 437 printf("\t#ent=%d, sz=%ld, ref=%d, version=%d, flags=0x%x\n", 438 D(vm_map, vm_map)->nentries, 439 D(vm_map, vm_map)->size, 440 D(vm_map, vm_map)->ref_count, 441 D(vm_map, vm_map)->timestamp, 442 D(vm_map, vm_map)->flags); 443 printf("\tpmap=%p(resident=<unknown>)\n", 444 D(vm_map, vm_map)->pmap); 445 } 446 447 A(header) = A(vm_map) + offsetof(struct vm_map, header); 448 S(header) = sizeof(struct vm_map_entry); 449 memcpy(D(header, vm_map_entry), &D(vm_map, vm_map)->header, S(header)); 450 dump_vm_map_entry(kd, vmspace, header, 1); 451 452 /* headers */ 453 #ifdef DISABLED_HEADERS 454 if (print_map) 455 printf("%-*s %-*s rwx RWX CPY NCP I W A\n", 456 (int)sizeof(long) * 2 + 2, "Start", 457 (int)sizeof(long) * 2 + 2, "End"); 458 if (print_maps) 459 printf("%-*s %-*s rwxp %-*s Dev Inode File\n", 460 (int)sizeof(long) * 2 + 0, "Start", 461 (int)sizeof(long) * 2 + 0, "End", 462 (int)sizeof(long) * 2 + 0, "Offset"); 463 if (print_solaris) 464 printf("%-*s %*s Protection File\n", 465 (int)sizeof(long) * 2 + 0, "Start", 466 (int)sizeof(int) * 2 - 1, "Size "); 467 #endif 468 if (print_all) 469 printf("%-*s %-*s %*s %-*s rwxpc RWX I/W/A Dev %*s - File\n", 470 (int)sizeof(long) * 2, "Start", 471 (int)sizeof(long) * 2, "End", 472 (int)sizeof(int) * 2, "Size ", 473 (int)sizeof(long) * 2, "Offset", 474 (int)sizeof(int) * 2, "Inode"); 475 476 /* these are the "sub entries" */ 477 total = 0; 478 next = (u_long)D(header, vm_map_entry)->next; 479 D(vm_map_entry, vm_map_entry)->next = 480 D(header, vm_map_entry)->next + 1; 481 last = P(header); 482 483 while (next != 0 && D(vm_map_entry, vm_map_entry)->next != last) { 484 addr = next; 485 A(vm_map_entry) = addr; 486 S(vm_map_entry) = sizeof(struct vm_map_entry); 487 KDEREF(kd, vm_map_entry); 488 total += dump_vm_map_entry(kd, vmspace, vm_map_entry, 0); 489 next = (u_long)D(vm_map_entry, vm_map_entry)->next; 490 } 491 if (print_solaris) 492 printf("%-*s %8luK\n", 493 (int)sizeof(void *) * 2 - 2, " total", 494 (unsigned long)total); 495 if (print_all) 496 printf("%-*s %9luk\n", 497 (int)sizeof(void *) * 4 - 1, " total", 498 (unsigned long)total); 499 } 500 501 void 502 load_symbols(kvm_t *kd) 503 { 504 int rc; 505 int i; 506 507 rc = kvm_nlist(kd, &nl[0]); 508 if (rc == -1) 509 errx(1, "%s == %d", kvm_geterr(kd), rc); 510 for (i = 0; i < sizeof(nl)/sizeof(nl[0]); i++) 511 if (nl[i].n_value == 0 && nl[i].n_name) 512 printf("%s not found\n", nl[i].n_name); 513 514 uvm_vnodeops = (void*)nl[NL_UVM_VNODEOPS].n_value; 515 uvm_deviceops = (void*)nl[NL_UVM_DEVICEOPS].n_value; 516 aobj_pager = (void*)nl[NL_AOBJ_PAGER].n_value; 517 #if 0 518 ubc_pager = (void*)nl[NL_UBC_PAGER].n_value; 519 #endif 520 521 kernel_floor = (void*)nl[NL_KENTER].n_value; 522 nchash_addr = nl[NL_NCHASH].n_value; 523 524 _KDEREF(kd, nl[NL_MAXSSIZ].n_value, &maxssiz, 525 sizeof(maxssiz)); 526 _KDEREF(kd, nl[NL_NCHASHTBL].n_value, &nchashtbl_addr, 527 sizeof(nchashtbl_addr)); 528 _KDEREF(kd, nl[NL_KERNEL_MAP].n_value, &kernel_map_addr, 529 sizeof(kernel_map_addr)); 530 } 531 532 size_t 533 dump_vm_map_entry(kvm_t *kd, struct kbit *vmspace, 534 struct kbit *vm_map_entry, int ishead) 535 { 536 struct kbit kbit[3]; 537 struct kbit *uvm_obj, *vp, *vfs; 538 struct vm_map_entry *vme; 539 size_t sz; 540 char *name; 541 dev_t dev; 542 ino_t inode; 543 544 uvm_obj = &kbit[0]; 545 vp = &kbit[1]; 546 vfs = &kbit[2]; 547 548 A(uvm_obj) = 0; 549 A(vp) = 0; 550 A(vfs) = 0; 551 552 vme = D(vm_map_entry, vm_map_entry); 553 554 if ((ishead && (debug & PRINT_VM_MAP_HEADER)) || 555 (!ishead && (debug & PRINT_VM_MAP_ENTRY))) { 556 printf("%s %p = {", ishead ? "vm_map.header" : "vm_map_entry", 557 P(vm_map_entry)); 558 printf(" prev = %p,", vme->prev); 559 printf(" next = %p,\n", vme->next); 560 printf(" start = %lx,", vme->start); 561 printf(" end = %lx,", vme->end); 562 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 563 printf(" offset = %lx,", (unsigned long)vme->offset); 564 printf(" etype = %x <%s%s%s%s >,", vme->etype, 565 vme->etype & UVM_ET_OBJ ? " OBJ" : "", 566 vme->etype & UVM_ET_SUBMAP ? " SUBMAP" : "", 567 vme->etype & UVM_ET_COPYONWRITE ? " COW" : "", 568 vme->etype & UVM_ET_NEEDSCOPY ? " NEEDSCOPY" : ""); 569 printf(" protection = %x,\n", vme->protection); 570 printf(" max_protection = %x,", vme->max_protection); 571 printf(" inheritance = %d,", vme->inheritance); 572 printf(" wired_count = %d,\n", vme->wired_count); 573 printf(" aref = <struct vm_aref>,"); 574 printf(" advice = %d,", vme->advice); 575 printf(" flags = %x <%s%s > }\n", vme->flags, 576 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 577 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 578 } 579 580 if (ishead) 581 return (0); 582 583 A(vp) = 0; 584 A(uvm_obj) = 0; 585 586 if (vme->object.uvm_obj != NULL) { 587 P(uvm_obj) = vme->object.uvm_obj; 588 S(uvm_obj) = sizeof(struct uvm_object); 589 KDEREF(kd, uvm_obj); 590 if (UVM_ET_ISOBJ(vme) && 591 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 592 P(vp) = P(uvm_obj); 593 S(vp) = sizeof(struct vnode); 594 KDEREF(kd, vp); 595 } 596 } 597 598 A(vfs) = NULL; 599 600 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 601 P(vfs) = D(vp, vnode)->v_mount; 602 S(vfs) = sizeof(struct mount); 603 KDEREF(kd, vfs); 604 D(vp, vnode)->v_mount = D(vfs, mount); 605 } 606 607 /* 608 * dig out the device number and inode number from certain 609 * file system types. 610 */ 611 #define V_DATA_IS(vp, type, d, i) do { \ 612 struct kbit data; \ 613 P(&data) = D(vp, vnode)->v_data; \ 614 S(&data) = sizeof(*D(&data, type)); \ 615 KDEREF(kd, &data); \ 616 dev = D(&data, type)->d; \ 617 inode = D(&data, type)->i; \ 618 } while (0/*CONSTCOND*/) 619 620 dev = 0; 621 inode = 0; 622 623 if (A(vp) && 624 D(vp, vnode)->v_type == VREG && 625 D(vp, vnode)->v_data != NULL) { 626 switch (D(vp, vnode)->v_tag) { 627 case VT_UFS: 628 case VT_LFS: 629 case VT_EXT2FS: 630 V_DATA_IS(vp, inode, i_dev, i_number); 631 break; 632 case VT_ISOFS: 633 V_DATA_IS(vp, iso_node, i_dev, i_number); 634 break; 635 case VT_NON: 636 case VT_NFS: 637 case VT_MFS: 638 case VT_MSDOSFS: 639 case VT_LOFS: 640 case VT_FDESC: 641 case VT_PORTAL: 642 case VT_NULL: 643 case VT_UMAP: 644 case VT_KERNFS: 645 case VT_PROCFS: 646 case VT_AFS: 647 case VT_UNION: 648 case VT_ADOSFS: 649 default: 650 break; 651 } 652 } 653 654 name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj); 655 656 if (print_map) { 657 printf("0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 658 vme->start, vme->end, 659 (vme->protection & VM_PROT_READ) ? 'r' : '-', 660 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 661 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 662 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 663 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 664 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 665 (vme->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 666 (vme->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 667 vme->inheritance, vme->wired_count, 668 vme->advice); 669 if (verbose) { 670 if (inode) 671 printf(" %d,%d %d", 672 major(dev), minor(dev), inode); 673 if (name[0]) 674 printf(" %s", name); 675 } 676 printf("\n"); 677 } 678 679 if (print_maps) 680 printf("%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %d %s\n", 681 (int)sizeof(void *) * 2, vme->start, 682 (int)sizeof(void *) * 2, vme->end, 683 (vme->protection & VM_PROT_READ) ? 'r' : '-', 684 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 685 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 686 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 687 (int)sizeof(void *) * 2, 688 (unsigned long)vme->offset, 689 major(dev), minor(dev), inode, inode ? name : ""); 690 691 if (print_ddb) { 692 printf(" - %p: 0x%lx->0x%lx: obj=%p/0x%lx, amap=%p/%d\n", 693 P(vm_map_entry), vme->start, vme->end, 694 vme->object.uvm_obj, (unsigned long)vme->offset, 695 vme->aref.ar_amap, vme->aref.ar_pageoff); 696 printf("\tsubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 697 "wc=%d, adv=%d\n", 698 (vme->etype & UVM_ET_SUBMAP) ? 'T' : 'F', 699 (vme->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F', 700 (vme->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F', 701 vme->protection, vme->max_protection, 702 vme->inheritance, vme->wired_count, vme->advice); 703 if (inode && verbose) 704 printf("\t(dev=%d,%d ino=%d [%s] [%p])\n", 705 major(dev), minor(dev), inode, 706 inode ? name : "", P(vp)); 707 else if (name[0] == ' ' && verbose) 708 printf("\t(%s)\n", &name[2]); 709 } 710 711 sz = 0; 712 if (print_solaris) { 713 char prot[30]; 714 715 prot[0] = '\0'; 716 prot[1] = '\0'; 717 if (vme->protection & VM_PROT_READ) 718 strlcat(prot, "/read", sizeof(prot)); 719 if (vme->protection & VM_PROT_WRITE) 720 strlcat(prot, "/write", sizeof(prot)); 721 if (vme->protection & VM_PROT_EXECUTE) 722 strlcat(prot, "/exec", sizeof(prot)); 723 724 sz = (size_t)((vme->end - vme->start) / 1024); 725 printf("%0*lX %6luK %-15s %s\n", 726 (int)sizeof(void *) * 2, 727 (unsigned long)vme->start, 728 (unsigned long)sz, 729 &prot[1], 730 name); 731 } 732 733 if (print_all) { 734 sz = (size_t)((vme->end - vme->start) / 1024); 735 printf(A(vp) ? 736 "%0*lx-%0*lx %7luk %0*lx %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s [%p]\n" : 737 "%0*lx-%0*lx %7luk %0*lx %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s\n", 738 (int)sizeof(void *) * 2, 739 vme->start, 740 (int)sizeof(void *) * 2, 741 vme->end - (vme->start != vme->end ? 1 : 0), 742 (unsigned long)sz, 743 (int)sizeof(void *) * 2, 744 (unsigned long)vme->offset, 745 (vme->protection & VM_PROT_READ) ? 'r' : '-', 746 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 747 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 748 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 749 (vme->etype & UVM_ET_NEEDSCOPY) ? '+' : '-', 750 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 751 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 752 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 753 vme->inheritance, 754 vme->wired_count, 755 vme->advice, 756 major(dev), minor(dev), inode, 757 name, P(vp)); 758 } 759 760 /* no access allowed, don't count space */ 761 if ((vme->protection & rwx) == 0) 762 sz = 0; 763 764 return (sz); 765 } 766 767 char* 768 findname(kvm_t *kd, struct kbit *vmspace, 769 struct kbit *vm_map_entry, struct kbit *vp, 770 struct kbit *vfs, struct kbit *uvm_obj) 771 { 772 static char buf[1024], *name; 773 struct vm_map_entry *vme; 774 size_t l; 775 776 vme = D(vm_map_entry, vm_map_entry); 777 778 if (UVM_ET_ISOBJ(vme)) { 779 if (A(vfs)) { 780 l = strlen(D(vfs, mount)->mnt_stat.f_mntonname); 781 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 782 case 0: /* found something */ 783 if (name - (1 + 11 + l) < buf) 784 break; 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 if (name - (1 + l) < buf) 797 break; 798 name--; 799 *name = '/'; 800 if (l != 1) { 801 name -= l; 802 memcpy(name, 803 D(vfs, mount)->mnt_stat.f_mntonname, l); 804 } 805 break; 806 } 807 } else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 808 struct kbit kdev; 809 dev_t dev; 810 811 P(&kdev) = P(uvm_obj); 812 S(&kdev) = sizeof(struct uvm_device); 813 KDEREF(kd, &kdev); 814 dev = D(&kdev, uvm_device)->u_device; 815 name = devname(dev, S_IFCHR); 816 if (name != NULL) 817 snprintf(buf, sizeof(buf), "/dev/%s", name); 818 else 819 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 820 major(dev), minor(dev)); 821 name = buf; 822 } else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 823 name = " [ uvm_aobj ]"; 824 #if 0 825 else if (UVM_OBJ_IS_UBCPAGER(D(uvm_obj, uvm_object))) 826 name = " [ ubc_pager ]"; 827 #endif 828 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 829 name = " [ ?VNODE? ]"; 830 else { 831 snprintf(buf, sizeof(buf), " [ unknown (%p) ]", 832 D(uvm_obj, uvm_object)->pgops); 833 name = buf; 834 } 835 } else if (D(vmspace, vmspace)->vm_maxsaddr <= 836 (caddr_t)vme->start && 837 (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 838 (caddr_t)vme->end) { 839 name = " [ stack ]"; 840 } else if (D(vmspace, vmspace)->vm_daddr <= (caddr_t)vme->start && 841 D(vmspace, vmspace)->vm_daddr + MAXDSIZ >= (caddr_t)vme->end && 842 D(vmspace, vmspace)->vm_dsize * getpagesize() / 2 < 843 (vme->end - vme->start)) { 844 name = " [ heap ]"; 845 } else 846 name = " [ anon ]"; 847 848 return (name); 849 } 850 851 int 852 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 853 { 854 char *o, *e; 855 struct cache_entry *ce; 856 struct kbit svp; 857 u_long cid; 858 859 if (nchashtbl == NULL) 860 load_name_cache(kd); 861 862 P(&svp) = P(vp); 863 S(&svp) = sizeof(struct vnode); 864 cid = D(vp, vnode)->v_id; 865 866 e = &buf[blen - 1]; 867 o = e; 868 do { 869 LIST_FOREACH(ce, &lcache, ce_next) 870 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 871 break; 872 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 873 if (o != e) 874 *(--o) = '/'; 875 if (o - ce->ce_nlen <= buf) 876 break; 877 o -= ce->ce_nlen; 878 memcpy(o, ce->ce_name, ce->ce_nlen); 879 P(&svp) = ce->ce_pvp; 880 cid = ce->ce_pcid; 881 } else 882 break; 883 } while (1/*CONSTCOND*/); 884 *e = '\0'; 885 *name = o; 886 887 if (e == o) 888 return (2); 889 890 KDEREF(kd, &svp); 891 return (D(&svp, vnode)->v_flag & VROOT); 892 } 893 894 void 895 load_name_cache(kvm_t *kd) 896 { 897 struct namecache _ncp, *ncp, *oncp; 898 struct nchashhead _ncpp, *ncpp; 899 u_long nchash; 900 int i; 901 902 LIST_INIT(&lcache); 903 904 _KDEREF(kd, nchash_addr, &nchash, sizeof(nchash)); 905 nchashtbl = malloc(sizeof(nchashtbl) * (int)nchash); 906 if (nchashtbl == NULL) 907 err(1, "load_name_cache"); 908 _KDEREF(kd, nchashtbl_addr, nchashtbl, 909 sizeof(nchashtbl) * (int)nchash); 910 911 ncpp = &_ncpp; 912 913 for (i = 0; i <= nchash; i++) { 914 ncpp = &nchashtbl[i]; 915 oncp = NULL; 916 LIST_FOREACH(ncp, ncpp, nc_hash) { 917 if (ncp == oncp || 918 (void*)ncp < kernel_floor || 919 ncp == (void*)0xdeadbeef) 920 break; 921 oncp = ncp; 922 _KDEREF(kd, (u_long)ncp, &_ncp, sizeof(*ncp)); 923 ncp = &_ncp; 924 if ((void*)ncp->nc_vp > kernel_floor && 925 ncp->nc_nlen > 0) { 926 if (ncp->nc_nlen > 2 || 927 ncp->nc_name[0] != '.' || 928 (ncp->nc_name[1] != '.' && 929 ncp->nc_nlen != 1)) 930 cache_enter(ncp); 931 } 932 } 933 } 934 } 935 936 void 937 cache_enter(struct namecache *ncp) 938 { 939 struct cache_entry *ce; 940 941 if (debug & DUMP_NAMEI_CACHE) 942 printf("ncp->nc_vp %10p, ncp->nc_dvp %10p, ncp->nc_nlen " 943 "%3d [%.*s] (nc_dvpid=%lu, nc_vpid=%lu)\n", 944 ncp->nc_vp, ncp->nc_dvp, 945 ncp->nc_nlen, ncp->nc_nlen, ncp->nc_name, 946 ncp->nc_dvpid, ncp->nc_vpid); 947 948 ce = malloc(sizeof(struct cache_entry)); 949 if (ce == NULL) 950 err(1, "cache_enter"); 951 952 ce->ce_vp = ncp->nc_vp; 953 ce->ce_pvp = ncp->nc_dvp; 954 ce->ce_cid = ncp->nc_vpid; 955 ce->ce_pcid = ncp->nc_dvpid; 956 ce->ce_nlen = (unsigned)ncp->nc_nlen; 957 strlcpy(ce->ce_name, ncp->nc_name, sizeof(ce->ce_name)); 958 959 LIST_INSERT_HEAD(&lcache, ce, ce_next); 960 } 961 962 static void __dead 963 usage(void) 964 { 965 extern char *__progname; 966 fprintf(stderr, "usage: %s [-adlmPsv] [-D number] " 967 "[-M core] [-N system] [-p pid] [pid ...]\n", 968 __progname); 969 exit(1); 970 } 971 972 static pid_t 973 strtopid(const char *str) 974 { 975 unsigned long pid; 976 char *endptr; 977 978 errno = 0; 979 pid = strtoul(str, &endptr, 10); 980 if (str[0] == '\0' || *endptr != '\0') 981 usage(); 982 if (errno == ERANGE && pid == ULONG_MAX) 983 usage(); 984 return (pid); 985 } 986