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