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