pmap.c revision 1.35
1 /* $NetBSD: pmap.c,v 1.35 2007/03/06 11:28:46 dillo 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.35 2007/03/06 11:28:46 dillo 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("%*s hint = %p,", indent(2), "", 156 D(vm_map, vm_map)->hint); 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 timestamp = %u }\n", indent(2), "", 174 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 vm_map_min(D(vm_map, vm_map)), 182 vm_map_max(D(vm_map, vm_map))); 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 PMAPFUNC(dump_vm_map_entry,VERSION)(kd, 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 += PMAPFUNC(dump_vm_map_entry,VERSION)(kd, proc, 248 vmspace, 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 size_t 269 PMAPFUNC(dump_vm_map_entry,VERSION)(kvm_t *kd, 270 struct kinfo_proc2 *proc, struct kbit *vmspace, 271 struct kbit *vm_map_entry, int ishead) 272 { 273 struct kbit kbit[3]; 274 struct kbit *uvm_obj, *vp, *vfs; 275 struct vm_map_entry *vme; 276 size_t sz; 277 char *name; 278 dev_t dev; 279 ino_t inode; 280 281 if (S(vm_map_entry) == (size_t)-1) { 282 heapfound = 1; 283 S(vm_map_entry) = sizeof(struct vm_map_entry); 284 KDEREF(kd, vm_map_entry); 285 } 286 287 uvm_obj = &kbit[0]; 288 vp = &kbit[1]; 289 vfs = &kbit[2]; 290 291 A(uvm_obj) = 0; 292 A(vp) = 0; 293 A(vfs) = 0; 294 295 vme = D(vm_map_entry, vm_map_entry); 296 297 if ((ishead && (debug & PRINT_VM_MAP_HEADER)) || 298 (!ishead && (debug & PRINT_VM_MAP_ENTRY))) { 299 printf("%*s%s %p = {", indent(2), "", 300 ishead ? "vm_map.header" : "vm_map_entry", 301 P(vm_map_entry)); 302 printf(" prev = %p,", vme->prev); 303 printf(" next = %p,\n", vme->next); 304 printf("%*s start = %lx,", indent(2), "", vme->start); 305 printf(" end = %lx,", vme->end); 306 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 307 printf("%*s offset = %" PRIx64 ",", indent(2), "", 308 vme->offset); 309 printf(" etype = %x <%s%s%s%s >,", vme->etype, 310 UVM_ET_ISOBJ(vme) ? " OBJ" : "", 311 UVM_ET_ISSUBMAP(vme) ? " SUBMAP" : "", 312 UVM_ET_ISCOPYONWRITE(vme) ? " COW" : "", 313 UVM_ET_ISNEEDSCOPY(vme) ? " NEEDSCOPY" : ""); 314 printf(" protection = %x,\n", vme->protection); 315 printf("%*s max_protection = %x,", indent(2), "", 316 vme->max_protection); 317 printf(" inheritance = %d,", vme->inheritance); 318 printf(" wired_count = %d,\n", vme->wired_count); 319 printf("%*s aref = { ar_pageoff = %x, ar_amap = %p },", 320 indent(2), "", vme->aref.ar_pageoff, vme->aref.ar_amap); 321 printf(" advice = %d,\n", vme->advice); 322 printf("%*s flags = %x <%s%s%s%s%s > }\n", indent(2), "", 323 vme->flags, 324 vme->flags & UVM_MAP_KERNEL ? " KERNEL" : "", 325 vme->flags & UVM_MAP_KMAPENT ? " KMAPENT" : "", 326 vme->flags & UVM_MAP_FIRST ? " FIRST" : "", 327 vme->flags & UVM_MAP_QUANTUM ? " QUANTUM" : "", 328 vme->flags & UVM_MAP_NOMERGE ? " NOMERGE" : ""); 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 case VT_PTYFS: 417 case VT_TMPFS: 418 case VT_UDF: 419 case VT_SYSVBFS: 420 case VT_PUFFS: 421 case VT_HFS: 422 break; 423 } 424 } 425 426 name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj); 427 428 if (print_map) { 429 printf("%*s0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 430 indent(2), "", 431 vme->start, vme->end, 432 (vme->protection & VM_PROT_READ) ? 'r' : '-', 433 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 434 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 435 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 436 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 437 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 438 UVM_ET_ISCOPYONWRITE(vme) ? "COW" : "NCOW", 439 UVM_ET_ISNEEDSCOPY(vme) ? "NC" : "NNC", 440 vme->inheritance, vme->wired_count, 441 vme->advice); 442 if (verbose) { 443 if (inode) 444 printf(" %u,%u %llu", major(dev), minor(dev), 445 (unsigned long long)inode); 446 if (name[0]) 447 printf(" %s", name); 448 } 449 printf("\n"); 450 } 451 452 if (print_maps) { 453 printf("%*s%0*lx-%0*lx %c%c%c%c %0*" PRIx64 " %02x:%02x %llu %s\n", 454 indent(2), "", 455 (int)sizeof(void *) * 2, vme->start, 456 (int)sizeof(void *) * 2, vme->end, 457 (vme->protection & VM_PROT_READ) ? 'r' : '-', 458 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 459 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 460 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 461 (int)sizeof(void *) * 2, 462 vme->offset, 463 major(dev), minor(dev), (unsigned long long)inode, 464 (name[0] != ' ') || verbose ? name : ""); 465 } 466 467 if (print_ddb) { 468 printf("%*s - %p: 0x%lx->0x%lx: obj=%p/0x%" PRIx64 ", amap=%p/%d\n", 469 indent(2), "", 470 P(vm_map_entry), vme->start, vme->end, 471 vme->object.uvm_obj, vme->offset, 472 vme->aref.ar_amap, vme->aref.ar_pageoff); 473 printf("\t%*ssubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 474 "wc=%d, adv=%d\n", 475 indent(2), "", 476 UVM_ET_ISSUBMAP(vme) ? 'T' : 'F', 477 UVM_ET_ISCOPYONWRITE(vme) ? 'T' : 'F', 478 UVM_ET_ISNEEDSCOPY(vme) ? 'T' : 'F', 479 vme->protection, vme->max_protection, 480 vme->inheritance, vme->wired_count, vme->advice); 481 if (verbose) { 482 printf("\t%*s", indent(2), ""); 483 if (inode) 484 printf("(dev=%u,%u ino=%llu [%s] [%p])\n", 485 major(dev), minor(dev), 486 (unsigned long long)inode, name, P(vp)); 487 else if (name[0] == ' ') 488 printf("(%s)\n", &name[2]); 489 else 490 printf("(%s)\n", name); 491 } 492 } 493 494 sz = 0; 495 if (print_solaris) { 496 char prot[30]; 497 498 prot[0] = '\0'; 499 prot[1] = '\0'; 500 if (vme->protection & VM_PROT_READ) 501 strlcat(prot, "/read", sizeof(prot)); 502 if (vme->protection & VM_PROT_WRITE) 503 strlcat(prot, "/write", sizeof(prot)); 504 if (vme->protection & VM_PROT_EXECUTE) 505 strlcat(prot, "/exec", sizeof(prot)); 506 507 sz = (size_t)((vme->end - vme->start) / 1024); 508 printf("%*s%0*lX %6luK %-15s %s\n", 509 indent(2), "", 510 (int)sizeof(void *) * 2, 511 (unsigned long)vme->start, 512 (unsigned long)sz, 513 &prot[1], 514 name); 515 } 516 517 if (print_all) { 518 sz = (size_t)((vme->end - vme->start) / 1024); 519 printf(A(vp) ? 520 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02u:%02u %7llu - %s [%p]\n" : 521 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02u:%02u %7llu - %s\n", 522 indent(2), "", 523 (int)sizeof(void *) * 2, 524 vme->start, 525 (int)sizeof(void *) * 2, 526 vme->end - (vme->start != vme->end ? 1 : 0), 527 (unsigned long)sz, 528 (int)sizeof(void *) * 2, 529 vme->offset, 530 (vme->protection & VM_PROT_READ) ? 'r' : '-', 531 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 532 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 533 UVM_ET_ISCOPYONWRITE(vme) ? 'p' : 's', 534 UVM_ET_ISNEEDSCOPY(vme) ? '+' : '-', 535 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 536 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 537 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 538 vme->inheritance, 539 vme->wired_count, 540 vme->advice, 541 major(dev), minor(dev), (unsigned long long)inode, 542 name, P(vp)); 543 } 544 545 /* no access allowed, don't count space */ 546 if ((vme->protection & rwx) == 0) 547 sz = 0; 548 549 if (recurse && UVM_ET_ISSUBMAP(vme)) { 550 struct kbit mkbit, *submap; 551 552 recurse++; 553 submap = &mkbit; 554 P(submap) = vme->object.sub_map; 555 S(submap) = sizeof(*vme->object.sub_map); 556 KDEREF(kd, submap); 557 PMAPFUNC(dump_vm_map,VERSION)(kd, proc, vmspace, submap, "submap"); 558 recurse--; 559 } 560 561 return (sz); 562 } 563 564 void 565 PMAPFUNC(dump_amap,VERSION)(kvm_t *kd, struct kbit *amap) 566 { 567 struct vm_anon **am_anon; 568 int *am_slots; 569 int *am_bckptr; 570 int *am_ppref; 571 size_t i, r, l, e; 572 573 if (S(amap) == (size_t)-1) { 574 heapfound = 1; 575 S(amap) = sizeof(struct vm_amap); 576 KDEREF(kd, amap); 577 } 578 579 printf("%*s amap %p = { am_ref = %d, " 580 "am_flags = %x,\n" 581 "%*s am_maxslot = %d, am_nslot = %d, am_nused = %d, " 582 "am_slots = %p,\n" 583 "%*s am_bckptr = %p, am_anon = %p, am_ppref = %p }\n", 584 indent(2), "", 585 P(amap), 586 D(amap, amap)->am_ref, 587 D(amap, amap)->am_flags, 588 indent(2), "", 589 D(amap, amap)->am_maxslot, 590 D(amap, amap)->am_nslot, 591 D(amap, amap)->am_nused, 592 D(amap, amap)->am_slots, 593 indent(2), "", 594 D(amap, amap)->am_bckptr, 595 D(amap, amap)->am_anon, 596 D(amap, amap)->am_ppref); 597 598 if (!(debug & DUMP_VM_AMAP_DATA)) 599 return; 600 601 /* 602 * Assume that sizeof(struct vm_anon *) >= sizeof(size_t) and 603 * allocate that amount of space. 604 */ 605 l = sizeof(struct vm_anon *) * D(amap, amap)->am_maxslot; 606 am_anon = malloc(l); 607 _KDEREF(kd, (u_long)D(amap, amap)->am_anon, am_anon, l); 608 609 l = sizeof(int) * D(amap, amap)->am_maxslot; 610 am_bckptr = malloc(l); 611 _KDEREF(kd, (u_long)D(amap, amap)->am_bckptr, am_bckptr, l); 612 613 l = sizeof(int) * D(amap, amap)->am_maxslot; 614 am_slots = malloc(l); 615 _KDEREF(kd, (u_long)D(amap, amap)->am_slots, am_slots, l); 616 617 if (D(amap, amap)->am_ppref != NULL && 618 D(amap, amap)->am_ppref != PPREF_NONE) { 619 l = sizeof(int) * D(amap, amap)->am_maxslot; 620 am_ppref = malloc(l); 621 _KDEREF(kd, (u_long)D(amap, amap)->am_ppref, am_ppref, l); 622 } else { 623 am_ppref = NULL; 624 } 625 626 printf(" page# %9s %8s", "am_bckptr", "am_slots"); 627 if (am_ppref) 628 printf(" %8s ", "am_ppref"); 629 printf(" %10s\n", "am_anon"); 630 631 l = r = 0; 632 e = verbose > 1 ? D(amap, amap)->am_maxslot : D(amap, amap)->am_nslot; 633 for (i = 0; i < e; i++) { 634 printf(" %4lx", (unsigned long)i); 635 636 if (am_anon[i] || verbose > 1) 637 printf(" %8x", am_bckptr[i]); 638 else 639 printf(" %8s", "-"); 640 641 if (i < D(amap, amap)->am_nused || verbose > 1) 642 printf(" %8x", am_slots[i]); 643 else 644 printf(" %8s", "-"); 645 646 if (am_ppref) { 647 if (l == 0 || r || verbose > 1) 648 printf(" %8d", am_ppref[i]); 649 else 650 printf(" %8s", "-"); 651 r = 0; 652 if (l == 0) { 653 if (am_ppref[i] > 0) { 654 r = am_ppref[i] - 1; 655 l = 1; 656 } else { 657 r = -am_ppref[i] - 1; 658 l = am_ppref[i + 1]; 659 } 660 printf(" (%4ld @ %4ld)", (long)l, (long)r); 661 r = (l > 1) ? 1 : 0; 662 } 663 else 664 printf(" "); 665 l--; 666 } 667 668 dump_vm_anon(kd, am_anon, (int)i); 669 } 670 671 free(am_anon); 672 free(am_bckptr); 673 free(am_slots); 674 if (am_ppref) 675 free(am_ppref); 676 } 677 678 static void 679 dump_vm_anon(kvm_t *kd, struct vm_anon **alist, int i) 680 { 681 682 printf(" %10p", alist[i]); 683 684 if (debug & PRINT_VM_ANON) { 685 struct kbit kbit, *anon = &kbit; 686 687 A(anon) = (u_long)alist[i]; 688 S(anon) = sizeof(struct vm_anon); 689 if (A(anon) == 0) { 690 printf(" = { }\n"); 691 return; 692 } 693 else 694 KDEREF(kd, anon); 695 696 printf(" = { an_ref = %d, an_page = %p, an_swslot = %d }", 697 D(anon, anon)->an_ref, D(anon, anon)->an_page, 698 D(anon, anon)->an_swslot); 699 } 700 701 printf("\n"); 702 } 703 704 static char* 705 findname(kvm_t *kd, struct kbit *vmspace, 706 struct kbit *vm_map_entry, struct kbit *vp, 707 struct kbit *vfs, struct kbit *uvm_obj) 708 { 709 static char buf[1024], *name; 710 struct vm_map_entry *vme; 711 size_t l; 712 713 vme = D(vm_map_entry, vm_map_entry); 714 715 if (UVM_ET_ISOBJ(vme)) { 716 if (A(vfs)) { 717 l = (unsigned)strlen(D(vfs, mount)->mnt_stat.f_mntonname); 718 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 719 case 0: /* found something */ 720 name--; 721 *name = '/'; 722 /*FALLTHROUGH*/ 723 case 2: /* found nothing */ 724 name -= 5; 725 memcpy(name, " -?- ", (size_t)5); 726 name -= l; 727 memcpy(name, 728 D(vfs, mount)->mnt_stat.f_mntonname, l); 729 break; 730 case 1: /* all is well */ 731 name--; 732 *name = '/'; 733 if (l != 1) { 734 name -= l; 735 memcpy(name, 736 D(vfs, mount)->mnt_stat.f_mntonname, l); 737 } 738 break; 739 } 740 } 741 else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 742 struct kbit kdev; 743 dev_t dev; 744 745 P(&kdev) = P(uvm_obj); 746 S(&kdev) = sizeof(struct uvm_device); 747 KDEREF(kd, &kdev); 748 dev = D(&kdev, uvm_device)->u_device; 749 name = devname(dev, S_IFCHR); 750 if (name != NULL) 751 snprintf(buf, sizeof(buf), "/dev/%s", name); 752 else 753 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 754 major(dev), minor(dev)); 755 name = buf; 756 } 757 else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 758 name = " [ uvm_aobj ]"; 759 else if (UVM_OBJ_IS_UBCPAGER(D(uvm_obj, uvm_object))) 760 name = " [ ubc_pager ]"; 761 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 762 name = " [ ?VNODE? ]"; 763 else { 764 snprintf(buf, sizeof(buf), " [ ?? %p ?? ]", 765 D(uvm_obj, uvm_object)->pgops); 766 name = buf; 767 } 768 } 769 770 else if ((char *)D(vmspace, vmspace)->vm_maxsaddr <= 771 (char *)vme->start && 772 ((char *)D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 773 (char *)vme->end) 774 name = " [ stack ]"; 775 776 else if (!heapfound && 777 (vme->protection & rwx) == rwx && 778 vme->start >= (u_long)D(vmspace, vmspace)->vm_daddr) { 779 heapfound = 1; 780 name = " [ heap ]"; 781 } 782 783 else if (UVM_ET_ISSUBMAP(vme)) { 784 const char *sub = mapname(vme->object.sub_map); 785 snprintf(buf, sizeof(buf), " [ %s ]", sub ? sub : "(submap)"); 786 name = buf; 787 } 788 789 else 790 name = " [ anon ]"; 791 792 return (name); 793 } 794 795 static int 796 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 797 { 798 char *o, *e; 799 struct cache_entry *ce; 800 struct kbit svp; 801 802 if (nchashtbl == NULL) 803 load_name_cache(kd); 804 805 P(&svp) = P(vp); 806 S(&svp) = sizeof(struct vnode); 807 808 e = &buf[blen - 1]; 809 o = e; 810 do { 811 LIST_FOREACH(ce, &lcache, ce_next) 812 if (ce->ce_vp == P(&svp)) 813 break; 814 if (ce && ce->ce_vp == P(&svp)) { 815 if (o != e) 816 *(--o) = '/'; 817 o -= ce->ce_nlen; 818 memcpy(o, ce->ce_name, (unsigned)ce->ce_nlen); 819 P(&svp) = ce->ce_pvp; 820 } 821 else 822 break; 823 } while (1/*CONSTCOND*/); 824 *e = '\0'; 825 *name = o; 826 827 if (e == o) 828 return (2); 829 830 KDEREF(kd, &svp); 831 return (D(&svp, vnode)->v_flag & VROOT); 832 } 833
Indexes created Wed Sep 24 22:09:59 GMT 2025