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