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