pmap.c revision 1.16
1 /* $NetBSD: pmap.c,v 1.16 2003/05/04 15:09:45 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.16 2003/05/04 15:09:45 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) == -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) == -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) == -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 > }\n", indent(2), "", 325 vme->flags, 326 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 327 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 328 } 329 330 if ((debug & PRINT_VM_AMAP) && (vme->aref.ar_amap != NULL)) { 331 struct kbit akbit, *amap; 332 333 amap = &akbit; 334 P(amap) = vme->aref.ar_amap; 335 S(amap) = sizeof(struct vm_amap); 336 KDEREF(kd, amap); 337 PMAPFUNC(dump_amap,VERSION)(kd, amap); 338 } 339 340 if (ishead) 341 return (0); 342 343 A(vp) = 0; 344 A(uvm_obj) = 0; 345 346 if (vme->object.uvm_obj != NULL) { 347 P(uvm_obj) = vme->object.uvm_obj; 348 S(uvm_obj) = sizeof(struct uvm_object); 349 KDEREF(kd, uvm_obj); 350 if (UVM_ET_ISOBJ(vme) && 351 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 352 P(vp) = P(uvm_obj); 353 S(vp) = sizeof(struct vnode); 354 KDEREF(kd, vp); 355 } 356 } 357 358 A(vfs) = NULL; 359 360 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 361 P(vfs) = D(vp, vnode)->v_mount; 362 S(vfs) = sizeof(struct mount); 363 KDEREF(kd, vfs); 364 D(vp, vnode)->v_mount = D(vfs, mount); 365 } 366 367 /* 368 * dig out the device number and inode number from certain 369 * file system types. 370 */ 371 #define V_DATA_IS(vp, type, d, i) do { \ 372 struct kbit data; \ 373 P(&data) = D(vp, vnode)->v_data; \ 374 S(&data) = sizeof(*D(&data, type)); \ 375 KDEREF(kd, &data); \ 376 dev = D(&data, type)->d; \ 377 inode = D(&data, type)->i; \ 378 } while (0/*CONSTCOND*/) 379 380 dev = 0; 381 inode = 0; 382 383 if (A(vp) && 384 D(vp, vnode)->v_type == VREG && 385 D(vp, vnode)->v_data != NULL) { 386 switch (D(vp, vnode)->v_tag) { 387 case VT_UFS: 388 case VT_LFS: 389 case VT_EXT2FS: 390 V_DATA_IS(vp, inode, i_dev, i_number); 391 break; 392 case VT_ISOFS: 393 V_DATA_IS(vp, iso_node, i_dev, i_number); 394 break; 395 case VT_NON: 396 case VT_NFS: 397 case VT_MFS: 398 case VT_MSDOSFS: 399 case VT_LOFS: 400 case VT_FDESC: 401 case VT_PORTAL: 402 case VT_NULL: 403 case VT_UMAP: 404 case VT_KERNFS: 405 case VT_PROCFS: 406 case VT_AFS: 407 case VT_UNION: 408 case VT_ADOSFS: 409 case VT_CODA: 410 case VT_FILECORE: 411 case VT_NTFS: 412 case VT_VFS: 413 case VT_OVERLAY: 414 case VT_SMBFS: 415 break; 416 } 417 } 418 419 name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj); 420 421 if (print_map) { 422 printf("%*s0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 423 indent(2), "", 424 vme->start, vme->end, 425 (vme->protection & VM_PROT_READ) ? 'r' : '-', 426 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 427 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 428 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 429 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 430 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 431 UVM_ET_ISCOPYONWRITE(vme) ? "COW" : "NCOW", 432 UVM_ET_ISNEEDSCOPY(vme) ? "NC" : "NNC", 433 vme->inheritance, vme->wired_count, 434 vme->advice); 435 if (verbose) { 436 if (inode) 437 printf(" %d,%d %d", 438 major(dev), minor(dev), inode); 439 if (name[0]) 440 printf(" %s", name); 441 } 442 printf("\n"); 443 } 444 445 if (print_maps) { 446 printf("%*s%0*lx-%0*lx %c%c%c%c %0*" PRIx64 " %02x:%02x %d %s\n", 447 indent(2), "", 448 (int)sizeof(void *) * 2, vme->start, 449 (int)sizeof(void *) * 2, vme->end, 450 (vme->protection & VM_PROT_READ) ? 'r' : '-', 451 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 452 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 453 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 454 (int)sizeof(void *) * 2, 455 vme->offset, 456 major(dev), minor(dev), inode, 457 (name[0] != ' ') || verbose ? name : ""); 458 } 459 460 if (print_ddb) { 461 printf("%*s - %p: 0x%lx->0x%lx: obj=%p/0x%" PRIx64 ", amap=%p/%d\n", 462 indent(2), "", 463 P(vm_map_entry), vme->start, vme->end, 464 vme->object.uvm_obj, vme->offset, 465 vme->aref.ar_amap, vme->aref.ar_pageoff); 466 printf("\t%*ssubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 467 "wc=%d, adv=%d\n", 468 indent(2), "", 469 UVM_ET_ISSUBMAP(vme) ? 'T' : 'F', 470 UVM_ET_ISCOPYONWRITE(vme) ? 'T' : 'F', 471 UVM_ET_ISNEEDSCOPY(vme) ? 'T' : 'F', 472 vme->protection, vme->max_protection, 473 vme->inheritance, vme->wired_count, vme->advice); 474 if (verbose) { 475 printf("\t%*s", indent(2), ""); 476 if (inode) 477 printf("(dev=%d,%d ino=%d [%s] [%p])\n", 478 major(dev), minor(dev), inode, 479 name, P(vp)); 480 else if (name[0] == ' ') 481 printf("(%s)\n", &name[2]); 482 else 483 printf("(%s)\n", name); 484 } 485 } 486 487 sz = 0; 488 if (print_solaris) { 489 char prot[30]; 490 491 prot[0] = '\0'; 492 prot[1] = '\0'; 493 if (vme->protection & VM_PROT_READ) 494 strcat(prot, "/read"); 495 if (vme->protection & VM_PROT_WRITE) 496 strcat(prot, "/write"); 497 if (vme->protection & VM_PROT_EXECUTE) 498 strcat(prot, "/exec"); 499 500 sz = (size_t)((vme->end - vme->start) / 1024); 501 printf("%*s%0*lX %6luK %-15s %s\n", 502 indent(2), "", 503 (int)sizeof(void *) * 2, 504 (unsigned long)vme->start, 505 (unsigned long)sz, 506 &prot[1], 507 name); 508 } 509 510 if (print_all) { 511 sz = (size_t)((vme->end - vme->start) / 1024); 512 printf(A(vp) ? 513 "%*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" : 514 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s\n", 515 indent(2), "", 516 (int)sizeof(void *) * 2, 517 vme->start, 518 (int)sizeof(void *) * 2, 519 vme->end - (vme->start != vme->end ? 1 : 0), 520 (unsigned long)sz, 521 (int)sizeof(void *) * 2, 522 vme->offset, 523 (vme->protection & VM_PROT_READ) ? 'r' : '-', 524 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 525 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 526 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 527 UVM_ET_ISNEEDSCOPY(vme) ? '+' : '-', 528 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 529 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 530 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 531 vme->inheritance, 532 vme->wired_count, 533 vme->advice, 534 major(dev), minor(dev), inode, 535 name, P(vp)); 536 } 537 538 /* no access allowed, don't count space */ 539 if ((vme->protection & rwx) == 0) 540 sz = 0; 541 542 if (recurse && UVM_ET_ISSUBMAP(vme)) { 543 struct kbit mkbit, *submap; 544 545 recurse++; 546 submap = &mkbit; 547 P(submap) = vme->object.sub_map; 548 S(submap) = sizeof(*vme->object.sub_map); 549 KDEREF(kd, submap); 550 PMAPFUNC(dump_vm_map,VERSION)(kd, proc, vmspace, submap, "submap"); 551 recurse--; 552 } 553 554 return (sz); 555 } 556 557 void 558 PMAPFUNC(dump_amap,VERSION)(kvm_t *kd, struct kbit *amap) 559 { 560 struct vm_anon **am_anon; 561 int *am_slots; 562 int *am_bckptr; 563 int *am_ppref; 564 size_t i, r, l, e; 565 566 if (S(amap) == -1) { 567 heapfound = 1; 568 S(amap) = sizeof(struct vm_amap); 569 KDEREF(kd, amap); 570 } 571 572 printf("%*s amap %p = { am_l = <struct simplelock>, am_ref = %d, " 573 "am_flags = %x,\n" 574 "%*s am_maxslot = %d, am_nslot = %d, am_nused = %d, " 575 "am_slots = %p,\n" 576 "%*s am_bckptr = %p, am_anon = %p, am_ppref = %p }\n", 577 indent(2), "", 578 P(amap), 579 D(amap, amap)->am_ref, 580 D(amap, amap)->am_flags, 581 indent(2), "", 582 D(amap, amap)->am_maxslot, 583 D(amap, amap)->am_nslot, 584 D(amap, amap)->am_nused, 585 D(amap, amap)->am_slots, 586 indent(2), "", 587 D(amap, amap)->am_bckptr, 588 D(amap, amap)->am_anon, 589 D(amap, amap)->am_ppref); 590 591 if (!(debug & DUMP_VM_AMAP_DATA)) 592 return; 593 594 /* 595 * Assume that sizeof(struct vm_anon *) >= sizeof(size_t) and 596 * allocate that amount of space. 597 */ 598 l = sizeof(struct vm_anon *) * D(amap, amap)->am_maxslot; 599 am_anon = malloc(l); 600 _KDEREF(kd, (u_long)D(amap, amap)->am_anon, am_anon, l); 601 602 l = sizeof(int) * D(amap, amap)->am_maxslot; 603 am_bckptr = malloc(l); 604 _KDEREF(kd, (u_long)D(amap, amap)->am_bckptr, am_bckptr, l); 605 606 l = sizeof(int) * D(amap, amap)->am_maxslot; 607 am_slots = malloc(l); 608 _KDEREF(kd, (u_long)D(amap, amap)->am_slots, am_slots, l); 609 610 if (D(amap, amap)->am_ppref != NULL && 611 D(amap, amap)->am_ppref != PPREF_NONE) { 612 l = sizeof(int) * D(amap, amap)->am_maxslot; 613 am_ppref = malloc(l); 614 _KDEREF(kd, (u_long)D(amap, amap)->am_ppref, am_ppref, l); 615 } else { 616 am_ppref = NULL; 617 } 618 619 printf(" page# %9s %8s", "am_bckptr", "am_slots"); 620 if (am_ppref) 621 printf(" %8s ", "am_ppref"); 622 printf(" %10s\n", "am_anon"); 623 624 l = 0; 625 e = verbose > 1 ? D(amap, amap)->am_maxslot : D(amap, amap)->am_nslot; 626 for (i = 0; i < e; i++) { 627 printf(" %4lx", (unsigned long)i); 628 629 if (am_anon[i] || verbose > 1) 630 printf(" %8x", am_bckptr[i]); 631 else 632 printf(" %8s", "-"); 633 634 if (i < D(amap, amap)->am_nused || verbose > 1) 635 printf(" %8x", am_slots[i]); 636 else 637 printf(" %8s", "-"); 638 639 if (am_ppref) { 640 if (l == 0 || r || verbose > 1) 641 printf(" %8d", am_ppref[i]); 642 else 643 printf(" %8s", "-"); 644 r = 0; 645 if (l == 0) { 646 if (am_ppref[i] > 0) { 647 r = am_ppref[i] - 1; 648 l = 1; 649 } else { 650 r = -am_ppref[i] - 1; 651 l = am_ppref[i + 1]; 652 } 653 printf(" (%4ld @ %4ld)", (long)l, (long)r); 654 r = (l > 1) ? 1 : 0; 655 } 656 else 657 printf(" "); 658 l--; 659 } 660 661 dump_vm_anon(kd, am_anon, i); 662 } 663 664 free(am_anon); 665 free(am_bckptr); 666 free(am_slots); 667 if (am_ppref) 668 free(am_ppref); 669 } 670 671 static void 672 dump_vm_anon(kvm_t *kd, struct vm_anon **alist, int i) 673 { 674 675 printf(" %10p", alist[i]); 676 677 if (debug & PRINT_VM_ANON) { 678 struct kbit kbit, *anon = &kbit; 679 680 A(anon) = (u_long)alist[i]; 681 S(anon) = sizeof(struct vm_anon); 682 if (A(anon) == 0) { 683 printf(" = { }\n"); 684 return; 685 } 686 else 687 KDEREF(kd, anon); 688 689 printf(" = { an_ref = %d, an_lock = <struct simplelock>, an_nxt/an_page = %p, an_swslot = %d }", 690 D(anon, anon)->an_ref, D(anon, anon)->u.an_nxt, D(anon, anon)->an_swslot); 691 } 692 693 printf("\n"); 694 } 695 696 static char* 697 findname(kvm_t *kd, struct kbit *vmspace, 698 struct kbit *vm_map_entry, struct kbit *vp, 699 struct kbit *vfs, struct kbit *uvm_obj) 700 { 701 static char buf[1024], *name; 702 struct vm_map_entry *vme; 703 size_t l; 704 705 vme = D(vm_map_entry, vm_map_entry); 706 707 if (UVM_ET_ISOBJ(vme)) { 708 if (A(vfs)) { 709 l = (unsigned)strlen(D(vfs, mount)->mnt_stat.f_mntonname); 710 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 711 case 0: /* found something */ 712 name--; 713 *name = '/'; 714 /*FALLTHROUGH*/ 715 case 2: /* found nothing */ 716 name -= 5; 717 memcpy(name, " -?- ", (size_t)5); 718 name -= l; 719 memcpy(name, 720 D(vfs, mount)->mnt_stat.f_mntonname, l); 721 break; 722 case 1: /* all is well */ 723 name--; 724 *name = '/'; 725 if (l != 1) { 726 name -= l; 727 memcpy(name, 728 D(vfs, mount)->mnt_stat.f_mntonname, l); 729 } 730 break; 731 } 732 } 733 else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 734 struct kbit kdev; 735 dev_t dev; 736 737 P(&kdev) = P(uvm_obj); 738 S(&kdev) = sizeof(struct uvm_device); 739 KDEREF(kd, &kdev); 740 dev = D(&kdev, uvm_device)->u_device; 741 name = devname(dev, S_IFCHR); 742 if (name != NULL) 743 snprintf(buf, sizeof(buf), "/dev/%s", name); 744 else 745 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 746 major(dev), minor(dev)); 747 name = buf; 748 } 749 else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 750 name = " [ uvm_aobj ]"; 751 else if (UVM_OBJ_IS_UBCPAGER(D(uvm_obj, uvm_object))) 752 name = " [ ubc_pager ]"; 753 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 754 name = " [ ?VNODE? ]"; 755 else { 756 snprintf(buf, sizeof(buf), " [ ?? %p ?? ]", 757 D(uvm_obj, uvm_object)->pgops); 758 name = buf; 759 } 760 } 761 762 else if (D(vmspace, vmspace)->vm_maxsaddr <= 763 (caddr_t)vme->start && 764 (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 765 (caddr_t)vme->end) 766 name = " [ stack ]"; 767 768 else if (!heapfound && 769 (vme->protection & rwx) == rwx && 770 vme->start >= (u_long)D(vmspace, vmspace)->vm_daddr) { 771 heapfound = 1; 772 name = " [ heap ]"; 773 } 774 775 else if (UVM_ET_ISSUBMAP(vme)) { 776 const char *sub = mapname(vme->object.sub_map); 777 snprintf(buf, sizeof(buf), " [ %s ]", sub ? sub : "(submap)"); 778 name = buf; 779 } 780 781 else 782 name = " [ anon ]"; 783 784 return (name); 785 } 786 787 static int 788 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 789 { 790 char *o, *e; 791 struct cache_entry *ce; 792 struct kbit svp; 793 u_long cid; 794 795 if (nchashtbl == NULL) 796 load_name_cache(kd); 797 798 P(&svp) = P(vp); 799 S(&svp) = sizeof(struct vnode); 800 cid = D(vp, vnode)->v_id; 801 802 e = &buf[blen - 1]; 803 o = e; 804 do { 805 LIST_FOREACH(ce, &lcache, ce_next) 806 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 807 break; 808 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 809 if (o != e) 810 *(--o) = '/'; 811 o -= ce->ce_nlen; 812 memcpy(o, ce->ce_name, (unsigned)ce->ce_nlen); 813 P(&svp) = ce->ce_pvp; 814 cid = ce->ce_pcid; 815 } 816 else 817 break; 818 } while (1/*CONSTCOND*/); 819 *e = '\0'; 820 *name = o; 821 822 if (e == o) 823 return (2); 824 825 KDEREF(kd, &svp); 826 return (D(&svp, vnode)->v_flag & VROOT); 827 } 828
Indexes created Wed Sep 24 22:09:59 GMT 2025