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