pmap.c revision 1.14
1 /* $NetBSD: pmap.c,v 1.14 2003/03/28 23:10:33 atatat Exp $ */ 2 3 /* 4 * Copyright (c) 2002, 2003 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Andrew Brown. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 __RCSID("$NetBSD: pmap.c,v 1.14 2003/03/28 23:10:33 atatat Exp $"); 42 #endif 43 44 #include <string.h> 45 46 #ifndef LOCKDEBUG 47 #define VERSION regular 48 #else /* LOCKDEBUG */ 49 #define VERSION lockdebug 50 #endif /* LOCKDEBUG */ 51 52 #include "pmap.h" 53 #include "main.h" 54 55 static void dump_vm_map(kvm_t *, pid_t, struct kinfo_proc2 *, struct kbit *, 56 struct kbit *, char *); 57 static size_t dump_vm_map_entry(kvm_t *, pid_t, struct kinfo_proc2 *, 58 struct kbit *, struct kbit *, int); 59 static void dump_amap(kvm_t *, struct kbit *); 60 static void dump_vm_anon(kvm_t *, struct vm_anon **, int); 61 static char *findname(kvm_t *, struct kbit *, struct kbit *, struct kbit *, 62 struct kbit *, struct kbit *); 63 static int search_cache(kvm_t *, struct kbit *, char **, char *, size_t); 64 65 /* when recursing, output is indented */ 66 #define indent(n) ((n) * (recurse > 1 ? recurse - 1 : 0)) 67 #define rwx (VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE) 68 69 int heapfound; 70 71 void 72 PMAPFUNC(process_map,VERSION)(kvm_t *kd, pid_t pid, struct kinfo_proc2 *proc) 73 { 74 struct kbit kbit[2], *vmspace, *vm_map; 75 char *thing; 76 77 vmspace = &kbit[0]; 78 vm_map = &kbit[1]; 79 80 A(vmspace) = 0; 81 A(vm_map) = 0; 82 83 if (pid > 0) { 84 heapfound = 0; 85 A(vmspace) = (u_long)proc->p_vmspace; 86 S(vmspace) = sizeof(struct vmspace); 87 KDEREF(kd, vmspace); 88 thing = "proc->p_vmspace.vm_map"; 89 } else { 90 heapfound = 1; /* but really, do kernels have a heap? */ 91 A(vmspace) = 0; 92 S(vmspace) = 0; 93 thing = "kernel_map"; 94 } 95 96 S(vm_map) = sizeof(struct vm_map); 97 if (pid > 0) { 98 A(vm_map) = A(vmspace) + offsetof(struct vmspace, vm_map); 99 memcpy(D(vm_map, vm_map), &D(vmspace, vmspace)->vm_map, 100 S(vm_map)); 101 } else { 102 A(vm_map) = kernel_map_addr; 103 KDEREF(kd, vm_map); 104 } 105 106 (*dump_vm_map)(kd, pid, proc, vmspace, vm_map, thing); 107 } 108 109 static void 110 dump_vm_map(kvm_t *kd, pid_t pid, struct kinfo_proc2 *proc, 111 struct kbit *vmspace, struct kbit *vm_map, char *mname) 112 { 113 struct kbit kbit[2], *header, *vm_map_entry; 114 struct vm_map_entry *last, *next; 115 size_t total; 116 u_long addr, end; 117 118 header = &kbit[0]; 119 vm_map_entry = &kbit[1]; 120 A(header) = 0; 121 A(vm_map_entry) = 0; 122 123 A(header) = A(vm_map) + offsetof(struct vm_map, header); 124 S(header) = sizeof(struct vm_map_entry); 125 memcpy(D(header, vm_map_entry), &D(vm_map, vm_map)->header, S(header)); 126 127 if (pid > 0 && (debug & PRINT_VMSPACE)) { 128 printf("proc->p_vmspace %p = {", P(vmspace)); 129 printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt); 130 printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm); 131 printf(" vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize); 132 printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss); 133 printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize); 134 printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize); 135 printf(" vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize); 136 printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr); 137 printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr); 138 printf(" vm_maxsaddr = %p,", 139 D(vmspace, vmspace)->vm_maxsaddr); 140 printf(" vm_minsaddr = %p }\n", 141 D(vmspace, vmspace)->vm_minsaddr); 142 } 143 144 if (debug & PRINT_VM_MAP) { 145 printf("%*s%s %p = {", indent(2), "", mname, P(vm_map)); 146 printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap); 147 printf("%*s lock = <struct lock>,", indent(2), ""); 148 printf(" header = <struct vm_map_entry>,"); 149 printf(" nentries = %d,\n", D(vm_map, vm_map)->nentries); 150 printf("%*s size = %lx,", indent(2), "", 151 D(vm_map, vm_map)->size); 152 printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count); 153 printf(" ref_lock = <struct simplelock>,\n"); 154 printf("%*s hint = %p,", indent(2), "", 155 D(vm_map, vm_map)->hint); 156 printf(" hint_lock = <struct simplelock>,\n"); 157 printf("%*s first_free = %p,", indent(2), "", 158 D(vm_map, vm_map)->first_free); 159 printf(" flags = %x <%s%s%s%s%s%s%s >,\n", D(vm_map, vm_map)->flags, 160 D(vm_map, vm_map)->flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "", 161 D(vm_map, vm_map)->flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "", 162 D(vm_map, vm_map)->flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "", 163 D(vm_map, vm_map)->flags & VM_MAP_BUSY ? " BUSY" : "", 164 D(vm_map, vm_map)->flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "", 165 #ifdef VM_MAP_DYING 166 D(vm_map, vm_map)->flags & VM_MAP_DYING ? " DYING" : 167 #endif 168 "", 169 #ifdef VM_MAP_TOPDOWN 170 D(vm_map, vm_map)->flags & VM_MAP_TOPDOWN ? " TOPDOWN" : 171 #endif 172 ""); 173 printf("%*s flags_lock = <struct simplelock>,", indent(2), ""); 174 printf(" timestamp = %u }\n", D(vm_map, vm_map)->timestamp); 175 } 176 if (print_ddb) { 177 const char *name = mapname(P(vm_map)); 178 179 printf("%*s%s %p: [0x%lx->0x%lx]\n", indent(2), "", 180 recurse < 2 ? "MAP" : "SUBMAP", P(vm_map), 181 D(vm_map, vm_map)->min_offset, 182 D(vm_map, vm_map)->max_offset); 183 printf("\t%*s#ent=%d, sz=%ld, ref=%d, version=%d, flags=0x%x\n", 184 indent(2), "", D(vm_map, vm_map)->nentries, 185 D(vm_map, vm_map)->size, D(vm_map, vm_map)->ref_count, 186 D(vm_map, vm_map)->timestamp, D(vm_map, vm_map)->flags); 187 printf("\t%*spmap=%p(resident=<unknown>)\n", indent(2), "", 188 D(vm_map, vm_map)->pmap); 189 if (verbose && name != NULL) 190 printf("\t%*s([ %s ])\n", indent(2), "", name); 191 } 192 193 (*dump_vm_map_entry)(kd, pid, proc, vmspace, header, 1); 194 195 /* 196 * we're not recursing into a submap, so print headers 197 */ 198 if (recurse < 2) { 199 /* headers */ 200 #ifdef DISABLED_HEADERS 201 if (print_map) 202 printf("%-*s %-*s rwx RWX CPY NCP I W A\n", 203 (int)sizeof(long) * 2 + 2, "Start", 204 (int)sizeof(long) * 2 + 2, "End"); 205 if (print_maps) 206 printf("%-*s %-*s rwxp %-*s Dev Inode File\n", 207 (int)sizeof(long) * 2 + 0, "Start", 208 (int)sizeof(long) * 2 + 0, "End", 209 (int)sizeof(long) * 2 + 0, "Offset"); 210 if (print_solaris) 211 printf("%-*s %*s Protection File\n", 212 (int)sizeof(long) * 2 + 0, "Start", 213 (int)sizeof(int) * 2 - 1, "Size "); 214 #endif 215 if (print_all) 216 printf("%-*s %-*s %*s %-*s rwxpc RWX I/W/A Dev %*s" 217 " - File\n", 218 (int)sizeof(long) * 2, "Start", 219 (int)sizeof(long) * 2, "End", 220 (int)sizeof(int) * 2, "Size ", 221 (int)sizeof(long) * 2, "Offset", 222 (int)sizeof(int) * 2, "Inode"); 223 } 224 225 /* these are the "sub entries" */ 226 total = 0; 227 next = D(header, vm_map_entry)->next; 228 last = P(header); 229 end = 0; 230 231 while (next != 0 && next != last) { 232 addr = (u_long)next; 233 A(vm_map_entry) = addr; 234 S(vm_map_entry) = sizeof(struct vm_map_entry); 235 KDEREF(kd, vm_map_entry); 236 next = D(vm_map_entry, vm_map_entry)->next; 237 238 if (end == 0) 239 end = D(vm_map_entry, vm_map_entry)->start; 240 else if (verbose > 1 && 241 end != D(vm_map_entry, vm_map_entry)->start) 242 printf("%*s[%lu pages / %luK]\n", indent(2), "", 243 (D(vm_map_entry, vm_map_entry)->start - end) / 244 page_size, 245 (D(vm_map_entry, vm_map_entry)->start - end) / 246 1024); 247 total += (*dump_vm_map_entry)(kd, pid, proc, vmspace, 248 vm_map_entry, 0); 249 250 end = D(vm_map_entry, vm_map_entry)->end; 251 } 252 253 /* 254 * we're not recursing into a submap, so print totals 255 */ 256 if (recurse < 2) { 257 if (print_solaris) 258 printf("%-*s %8luK\n", 259 (int)sizeof(void *) * 2 - 2, " total", 260 (unsigned long)total); 261 if (print_all) 262 printf("%-*s %9luk\n", 263 (int)sizeof(void *) * 4 - 1, " total", 264 (unsigned long)total); 265 } 266 } 267 268 static size_t 269 dump_vm_map_entry(kvm_t *kd, pid_t pid, struct kinfo_proc2 * proc, 270 struct kbit *vmspace, struct kbit *vm_map_entry, int ishead) 271 { 272 struct kbit kbit[3]; 273 struct kbit *uvm_obj, *vp, *vfs; 274 struct vm_map_entry *vme; 275 size_t sz; 276 char *name; 277 dev_t dev; 278 ino_t inode; 279 280 uvm_obj = &kbit[0]; 281 vp = &kbit[1]; 282 vfs = &kbit[2]; 283 284 A(uvm_obj) = 0; 285 A(vp) = 0; 286 A(vfs) = 0; 287 288 vme = D(vm_map_entry, vm_map_entry); 289 290 if ((ishead && (debug & PRINT_VM_MAP_HEADER)) || 291 (!ishead && (debug & PRINT_VM_MAP_ENTRY))) { 292 printf("%*s%s %p = {", indent(2), "", 293 ishead ? "vm_map.header" : "vm_map_entry", 294 P(vm_map_entry)); 295 printf(" prev = %p,", vme->prev); 296 printf(" next = %p,\n", vme->next); 297 printf("%*s start = %lx,", indent(2), "", vme->start); 298 printf(" end = %lx,", vme->end); 299 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 300 printf("%*s offset = %" PRIx64 ",", indent(2), "", 301 vme->offset); 302 printf(" etype = %x <%s%s%s%s >,", vme->etype, 303 UVM_ET_ISOBJ(vme) ? " OBJ" : "", 304 UVM_ET_ISSUBMAP(vme) ? " SUBMAP" : "", 305 UVM_ET_ISCOPYONWRITE(vme) ? " COW" : "", 306 UVM_ET_ISNEEDSCOPY(vme) ? " NEEDSCOPY" : ""); 307 printf(" protection = %x,\n", vme->protection); 308 printf("%*s max_protection = %x,", indent(2), "", 309 vme->max_protection); 310 printf(" inheritance = %d,", vme->inheritance); 311 printf(" wired_count = %d,\n", vme->wired_count); 312 printf("%*s aref = { ar_pageoff = %x, ar_amap = %p },", 313 indent(2), "", vme->aref.ar_pageoff, vme->aref.ar_amap); 314 printf(" advice = %d,\n", vme->advice); 315 printf("%*s flags = %x <%s%s > }\n", indent(2), "", 316 vme->flags, 317 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 318 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 319 } 320 321 if ((debug & PRINT_VM_AMAP) && (vme->aref.ar_amap != NULL)) { 322 struct kbit akbit, *amap; 323 324 amap = &akbit; 325 P(amap) = vme->aref.ar_amap; 326 S(amap) = sizeof(struct vm_amap); 327 KDEREF(kd, amap); 328 dump_amap(kd, amap); 329 } 330 331 if (ishead) 332 return (0); 333 334 A(vp) = 0; 335 A(uvm_obj) = 0; 336 337 if (vme->object.uvm_obj != NULL) { 338 P(uvm_obj) = vme->object.uvm_obj; 339 S(uvm_obj) = sizeof(struct uvm_object); 340 KDEREF(kd, uvm_obj); 341 if (UVM_ET_ISOBJ(vme) && 342 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 343 P(vp) = P(uvm_obj); 344 S(vp) = sizeof(struct vnode); 345 KDEREF(kd, vp); 346 } 347 } 348 349 A(vfs) = NULL; 350 351 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 352 P(vfs) = D(vp, vnode)->v_mount; 353 S(vfs) = sizeof(struct mount); 354 KDEREF(kd, vfs); 355 D(vp, vnode)->v_mount = D(vfs, mount); 356 } 357 358 /* 359 * dig out the device number and inode number from certain 360 * file system types. 361 */ 362 #define V_DATA_IS(vp, type, d, i) do { \ 363 struct kbit data; \ 364 P(&data) = D(vp, vnode)->v_data; \ 365 S(&data) = sizeof(*D(&data, type)); \ 366 KDEREF(kd, &data); \ 367 dev = D(&data, type)->d; \ 368 inode = D(&data, type)->i; \ 369 } while (0/*CONSTCOND*/) 370 371 dev = 0; 372 inode = 0; 373 374 if (A(vp) && 375 D(vp, vnode)->v_type == VREG && 376 D(vp, vnode)->v_data != NULL) { 377 switch (D(vp, vnode)->v_tag) { 378 case VT_UFS: 379 case VT_LFS: 380 case VT_EXT2FS: 381 V_DATA_IS(vp, inode, i_dev, i_number); 382 break; 383 case VT_ISOFS: 384 V_DATA_IS(vp, iso_node, i_dev, i_number); 385 break; 386 case VT_NON: 387 case VT_NFS: 388 case VT_MFS: 389 case VT_MSDOSFS: 390 case VT_LOFS: 391 case VT_FDESC: 392 case VT_PORTAL: 393 case VT_NULL: 394 case VT_UMAP: 395 case VT_KERNFS: 396 case VT_PROCFS: 397 case VT_AFS: 398 case VT_UNION: 399 case VT_ADOSFS: 400 case VT_CODA: 401 case VT_FILECORE: 402 case VT_NTFS: 403 case VT_VFS: 404 case VT_OVERLAY: 405 case VT_SMBFS: 406 break; 407 } 408 } 409 410 name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj); 411 412 if (print_map) { 413 printf("%*s0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 414 indent(2), "", 415 vme->start, vme->end, 416 (vme->protection & VM_PROT_READ) ? 'r' : '-', 417 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 418 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 419 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 420 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 421 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 422 UVM_ET_ISCOPYONWRITE(vme) ? "COW" : "NCOW", 423 UVM_ET_ISNEEDSCOPY(vme) ? "NC" : "NNC", 424 vme->inheritance, vme->wired_count, 425 vme->advice); 426 if (verbose) { 427 if (inode) 428 printf(" %d,%d %d", 429 major(dev), minor(dev), inode); 430 if (name[0]) 431 printf(" %s", name); 432 } 433 printf("\n"); 434 } 435 436 if (print_maps) { 437 printf("%*s%0*lx-%0*lx %c%c%c%c %0*" PRIx64 " %02x:%02x %d %s\n", 438 indent(2), "", 439 (int)sizeof(void *) * 2, vme->start, 440 (int)sizeof(void *) * 2, vme->end, 441 (vme->protection & VM_PROT_READ) ? 'r' : '-', 442 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 443 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 444 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 445 (int)sizeof(void *) * 2, 446 vme->offset, 447 major(dev), minor(dev), inode, 448 (name[0] != ' ') || verbose ? name : ""); 449 } 450 451 if (print_ddb) { 452 printf("%*s - %p: 0x%lx->0x%lx: obj=%p/0x%" PRIx64 ", amap=%p/%d\n", 453 indent(2), "", 454 P(vm_map_entry), vme->start, vme->end, 455 vme->object.uvm_obj, vme->offset, 456 vme->aref.ar_amap, vme->aref.ar_pageoff); 457 printf("\t%*ssubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 458 "wc=%d, adv=%d\n", 459 indent(2), "", 460 UVM_ET_ISSUBMAP(vme) ? 'T' : 'F', 461 UVM_ET_ISCOPYONWRITE(vme) ? 'T' : 'F', 462 UVM_ET_ISNEEDSCOPY(vme) ? 'T' : 'F', 463 vme->protection, vme->max_protection, 464 vme->inheritance, vme->wired_count, vme->advice); 465 if (verbose) { 466 printf("\t%*s", indent(2), ""); 467 if (inode) 468 printf("(dev=%d,%d ino=%d [%s] [%p])\n", 469 major(dev), minor(dev), inode, 470 name, P(vp)); 471 else if (name[0] == ' ') 472 printf("(%s)\n", &name[2]); 473 else 474 printf("(%s)\n", name); 475 } 476 } 477 478 sz = 0; 479 if (print_solaris) { 480 char prot[30]; 481 482 prot[0] = '\0'; 483 prot[1] = '\0'; 484 if (vme->protection & VM_PROT_READ) 485 strcat(prot, "/read"); 486 if (vme->protection & VM_PROT_WRITE) 487 strcat(prot, "/write"); 488 if (vme->protection & VM_PROT_EXECUTE) 489 strcat(prot, "/exec"); 490 491 sz = (size_t)((vme->end - vme->start) / 1024); 492 printf("%*s%0*lX %6luK %-15s %s\n", 493 indent(2), "", 494 (int)sizeof(void *) * 2, 495 (unsigned long)vme->start, 496 (unsigned long)sz, 497 &prot[1], 498 name); 499 } 500 501 if (print_all) { 502 sz = (size_t)((vme->end - vme->start) / 1024); 503 printf(A(vp) ? 504 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s [%p]\n" : 505 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s\n", 506 indent(2), "", 507 (int)sizeof(void *) * 2, 508 vme->start, 509 (int)sizeof(void *) * 2, 510 vme->end - (vme->start != vme->end ? 1 : 0), 511 (unsigned long)sz, 512 (int)sizeof(void *) * 2, 513 vme->offset, 514 (vme->protection & VM_PROT_READ) ? 'r' : '-', 515 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 516 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 517 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 518 UVM_ET_ISNEEDSCOPY(vme) ? '+' : '-', 519 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 520 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 521 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 522 vme->inheritance, 523 vme->wired_count, 524 vme->advice, 525 major(dev), minor(dev), inode, 526 name, P(vp)); 527 } 528 529 /* no access allowed, don't count space */ 530 if ((vme->protection & rwx) == 0) 531 sz = 0; 532 533 if (recurse && UVM_ET_ISSUBMAP(vme)) { 534 struct kbit mkbit, *submap; 535 536 recurse++; 537 submap = &mkbit; 538 P(submap) = vme->object.sub_map; 539 S(submap) = sizeof(*vme->object.sub_map); 540 KDEREF(kd, submap); 541 (*dump_vm_map)(kd, pid, proc, vmspace, submap, "submap"); 542 recurse--; 543 } 544 545 return (sz); 546 } 547 548 static void 549 dump_amap(kvm_t *kd, struct kbit *amap) 550 { 551 struct vm_anon **am_anon; 552 int *am_slots; 553 int *am_bckptr; 554 int *am_ppref; 555 size_t i, r, l, e; 556 557 printf("%*s amap %p = { am_l = <struct simplelock>, am_ref = %d, " 558 "am_flags = %x,\n" 559 "%*s am_maxslot = %d, am_nslot = %d, am_nused = %d, " 560 "am_slots = %p,\n" 561 "%*s am_bckptr = %p, am_anon = %p, am_ppref = %p }\n", 562 indent(2), "", 563 P(amap), 564 D(amap, amap)->am_ref, 565 D(amap, amap)->am_flags, 566 indent(2), "", 567 D(amap, amap)->am_maxslot, 568 D(amap, amap)->am_nslot, 569 D(amap, amap)->am_nused, 570 D(amap, amap)->am_slots, 571 indent(2), "", 572 D(amap, amap)->am_bckptr, 573 D(amap, amap)->am_anon, 574 D(amap, amap)->am_ppref); 575 576 if (!(debug & DUMP_VM_AMAP_DATA)) 577 return; 578 579 /* 580 * Assume that sizeof(struct vm_anon *) >= sizeof(size_t) and 581 * allocate that amount of space. 582 */ 583 l = sizeof(struct vm_anon *) * D(amap, amap)->am_maxslot; 584 am_anon = malloc(l); 585 _KDEREF(kd, (u_long)D(amap, amap)->am_anon, am_anon, l); 586 587 l = sizeof(int) * D(amap, amap)->am_maxslot; 588 am_bckptr = malloc(l); 589 _KDEREF(kd, (u_long)D(amap, amap)->am_bckptr, am_bckptr, l); 590 591 l = sizeof(int) * D(amap, amap)->am_maxslot; 592 am_slots = malloc(l); 593 _KDEREF(kd, (u_long)D(amap, amap)->am_slots, am_slots, l); 594 595 if (D(amap, amap)->am_ppref != NULL && 596 D(amap, amap)->am_ppref != PPREF_NONE) { 597 l = sizeof(int) * D(amap, amap)->am_maxslot; 598 am_ppref = malloc(l); 599 _KDEREF(kd, (u_long)D(amap, amap)->am_ppref, am_ppref, l); 600 } else { 601 am_ppref = NULL; 602 } 603 604 printf(" page# %9s %8s", "am_bckptr", "am_slots"); 605 if (am_ppref) 606 printf(" %8s ", "am_ppref"); 607 printf(" %10s\n", "am_anon"); 608 609 l = 0; 610 e = verbose > 1 ? D(amap, amap)->am_maxslot : D(amap, amap)->am_nslot; 611 for (i = 0; i < e; i++) { 612 printf(" %4lx", (unsigned long)i); 613 614 if (am_anon[i] || verbose > 1) 615 printf(" %8x", am_bckptr[i]); 616 else 617 printf(" %8s", "-"); 618 619 if (i < D(amap, amap)->am_nused || verbose > 1) 620 printf(" %8x", am_slots[i]); 621 else 622 printf(" %8s", "-"); 623 624 if (am_ppref) { 625 if (l == 0 || r || verbose > 1) 626 printf(" %8d", am_ppref[i]); 627 else 628 printf(" %8s", "-"); 629 r = 0; 630 if (l == 0) { 631 if (am_ppref[i] > 0) { 632 r = am_ppref[i] - 1; 633 l = 1; 634 } else { 635 r = -am_ppref[i] - 1; 636 l = am_ppref[i + 1]; 637 } 638 printf(" (%4ld @ %4ld)", (long)l, (long)r); 639 r = (l > 1) ? 1 : 0; 640 } 641 else 642 printf(" "); 643 l--; 644 } 645 646 dump_vm_anon(kd, am_anon, i); 647 } 648 649 free(am_anon); 650 free(am_bckptr); 651 free(am_slots); 652 if (am_ppref) 653 free(am_ppref); 654 } 655 656 static void 657 dump_vm_anon(kvm_t *kd, struct vm_anon **alist, int i) 658 { 659 660 printf(" %10p", alist[i]); 661 662 if (debug & PRINT_VM_ANON) { 663 struct kbit kbit, *anon = &kbit; 664 665 A(anon) = (u_long)alist[i]; 666 S(anon) = sizeof(struct vm_anon); 667 if (A(anon) == 0) { 668 printf(" = { }\n"); 669 return; 670 } 671 else 672 KDEREF(kd, anon); 673 674 printf(" = { an_ref = %d, an_lock = <struct simplelock>, an_nxt/an_page = %p, an_swslot = %d }", 675 D(anon, anon)->an_ref, D(anon, anon)->u.an_nxt, D(anon, anon)->an_swslot); 676 } 677 678 printf("\n"); 679 } 680 681 static char* 682 findname(kvm_t *kd, struct kbit *vmspace, 683 struct kbit *vm_map_entry, struct kbit *vp, 684 struct kbit *vfs, struct kbit *uvm_obj) 685 { 686 static char buf[1024], *name; 687 struct vm_map_entry *vme; 688 size_t l; 689 690 vme = D(vm_map_entry, vm_map_entry); 691 692 if (UVM_ET_ISOBJ(vme)) { 693 if (A(vfs)) { 694 l = (unsigned)strlen(D(vfs, mount)->mnt_stat.f_mntonname); 695 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 696 case 0: /* found something */ 697 name--; 698 *name = '/'; 699 /*FALLTHROUGH*/ 700 case 2: /* found nothing */ 701 name -= 5; 702 memcpy(name, " -?- ", (size_t)5); 703 name -= l; 704 memcpy(name, 705 D(vfs, mount)->mnt_stat.f_mntonname, l); 706 break; 707 case 1: /* all is well */ 708 name--; 709 *name = '/'; 710 if (l != 1) { 711 name -= l; 712 memcpy(name, 713 D(vfs, mount)->mnt_stat.f_mntonname, l); 714 } 715 break; 716 } 717 } 718 else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 719 struct kbit kdev; 720 dev_t dev; 721 722 P(&kdev) = P(uvm_obj); 723 S(&kdev) = sizeof(struct uvm_device); 724 KDEREF(kd, &kdev); 725 dev = D(&kdev, uvm_device)->u_device; 726 name = devname(dev, S_IFCHR); 727 if (name != NULL) 728 snprintf(buf, sizeof(buf), "/dev/%s", name); 729 else 730 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 731 major(dev), minor(dev)); 732 name = buf; 733 } 734 else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 735 name = " [ uvm_aobj ]"; 736 else if (UVM_OBJ_IS_UBCPAGER(D(uvm_obj, uvm_object))) 737 name = " [ ubc_pager ]"; 738 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 739 name = " [ ?VNODE? ]"; 740 else { 741 snprintf(buf, sizeof(buf), " [ ?? %p ?? ]", 742 D(uvm_obj, uvm_object)->pgops); 743 name = buf; 744 } 745 } 746 747 else if (D(vmspace, vmspace)->vm_maxsaddr <= 748 (caddr_t)vme->start && 749 (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 750 (caddr_t)vme->end) 751 name = " [ stack ]"; 752 753 else if (!heapfound && 754 (vme->protection & rwx) == rwx && 755 vme->start >= (u_long)D(vmspace, vmspace)->vm_daddr) { 756 heapfound = 1; 757 name = " [ heap ]"; 758 } 759 760 else if (UVM_ET_ISSUBMAP(vme)) { 761 const char *sub = mapname(vme->object.sub_map); 762 snprintf(buf, sizeof(buf), " [ %s ]", sub ? sub : "(submap)"); 763 name = buf; 764 } 765 766 else 767 name = " [ anon ]"; 768 769 return (name); 770 } 771 772 static int 773 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 774 { 775 char *o, *e; 776 struct cache_entry *ce; 777 struct kbit svp; 778 u_long cid; 779 780 if (nchashtbl == NULL) 781 load_name_cache(kd); 782 783 P(&svp) = P(vp); 784 S(&svp) = sizeof(struct vnode); 785 cid = D(vp, vnode)->v_id; 786 787 e = &buf[blen - 1]; 788 o = e; 789 do { 790 LIST_FOREACH(ce, &lcache, ce_next) 791 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 792 break; 793 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 794 if (o != e) 795 *(--o) = '/'; 796 o -= ce->ce_nlen; 797 memcpy(o, ce->ce_name, (unsigned)ce->ce_nlen); 798 P(&svp) = ce->ce_pvp; 799 cid = ce->ce_pcid; 800 } 801 else 802 break; 803 } while (1/*CONSTCOND*/); 804 *e = '\0'; 805 *name = o; 806 807 if (e == o) 808 return (2); 809 810 KDEREF(kd, &svp); 811 return (D(&svp, vnode)->v_flag & VROOT); 812 } 813
Indexes created Mon Sep 22 13:09:51 GMT 2025