pmap.c revision 1.10
1 /* $NetBSD: pmap.c,v 1.10 2003/01/08 20:25:12 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.10 2003/01/08 20:25:12 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_map(kvm_t *, pid_t, struct kinfo_proc2 *, struct kbit *, 56 struct kbit *, char *); 57 static size_t dump_vm_map_entry(kvm_t *, pid_t, struct kinfo_proc2 *, 58 struct kbit *, struct kbit *, int); 59 static char *findname(kvm_t *, struct kbit *, struct kbit *, struct kbit *, 60 struct kbit *, struct kbit *); 61 static int search_cache(kvm_t *, struct kbit *, char **, char *, size_t); 62 63 /* when recursing, output is indented */ 64 #define indent(n) ((n) * (recurse > 1 ? recurse - 1 : 0)) 65 66 void 67 PMAPFUNC(process_map,VERSION)(kvm_t *kd, pid_t pid, struct kinfo_proc2 *proc) 68 { 69 struct kbit kbit[2], *vmspace, *vm_map; 70 char *thing; 71 72 vmspace = &kbit[0]; 73 vm_map = &kbit[1]; 74 75 A(vmspace) = 0; 76 A(vm_map) = 0; 77 78 if (pid > 0) { 79 heapfound = 0; 80 A(vmspace) = (u_long)proc->p_vmspace; 81 S(vmspace) = sizeof(struct vmspace); 82 KDEREF(kd, vmspace); 83 thing = "proc->p_vmspace.vm_map"; 84 } else { 85 heapfound = 1; /* but really, do kernels have a heap? */ 86 A(vmspace) = 0; 87 S(vmspace) = 0; 88 thing = "kernel_map"; 89 } 90 91 S(vm_map) = sizeof(struct vm_map); 92 if (pid > 0) { 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 A(vm_map) = kernel_map_addr; 98 KDEREF(kd, vm_map); 99 } 100 101 (*dump_vm_map)(kd, pid, proc, vmspace, vm_map, thing); 102 } 103 104 static void 105 dump_vm_map(kvm_t *kd, pid_t pid, struct kinfo_proc2 *proc, 106 struct kbit *vmspace, struct kbit *vm_map, char *mname) 107 { 108 struct kbit kbit[2], *header, *vm_map_entry; 109 struct vm_map_entry *last, *next; 110 size_t total; 111 u_long addr, end; 112 113 header = &kbit[0]; 114 vm_map_entry = &kbit[1]; 115 A(header) = 0; 116 A(vm_map_entry) = 0; 117 118 A(header) = A(vm_map) + offsetof(struct vm_map, header); 119 S(header) = sizeof(struct vm_map_entry); 120 memcpy(D(header, vm_map_entry), &D(vm_map, vm_map)->header, S(header)); 121 122 if (pid > 0 && (debug & PRINT_VMSPACE)) { 123 printf("proc->p_vmspace %p = {", P(vmspace)); 124 printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt); 125 printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm); 126 printf(" vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize); 127 printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss); 128 printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize); 129 printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize); 130 printf(" vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize); 131 printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr); 132 printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr); 133 printf(" vm_maxsaddr = %p,", 134 D(vmspace, vmspace)->vm_maxsaddr); 135 printf(" vm_minsaddr = %p }\n", 136 D(vmspace, vmspace)->vm_minsaddr); 137 } 138 139 if (debug & PRINT_VM_MAP) { 140 printf("%*s%s %p = {", indent(2), "", mname, P(vm_map)); 141 printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap); 142 printf("%*s lock = <struct lock>,", indent(2), ""); 143 printf(" header = <struct vm_map_entry>,"); 144 printf(" nentries = %d,\n", D(vm_map, vm_map)->nentries); 145 printf("%*s size = %lx,", indent(2), "", 146 D(vm_map, vm_map)->size); 147 printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count); 148 printf(" ref_lock = <struct simplelock>,\n"); 149 printf("%*s hint = %p,", indent(2), "", 150 D(vm_map, vm_map)->hint); 151 printf(" hint_lock = <struct simplelock>,\n"); 152 printf("%*s first_free = %p,", indent(2), "", 153 D(vm_map, vm_map)->first_free); 154 printf(" flags = %x <%s%s%s%s%s%s >,\n", D(vm_map, vm_map)->flags, 155 D(vm_map, vm_map)->flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "", 156 D(vm_map, vm_map)->flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "", 157 D(vm_map, vm_map)->flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "", 158 D(vm_map, vm_map)->flags & VM_MAP_BUSY ? " BUSY" : "", 159 D(vm_map, vm_map)->flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "" 160 #ifdef VM_MAP_DYING 161 , D(vm_map, vm_map)->flags & VM_MAP_DYING ? " DYING" : "" 162 #endif 163 #ifdef VM_MAP_TOPDOWN 164 , D(vm_map, vm_map)->flags & VM_MAP_TOPDOWN ? " TOPDOWN" : "" 165 #endif 166 ); 167 printf("%*s flags_lock = <struct simplelock>,", indent(2), ""); 168 printf(" timestamp = %u }\n", D(vm_map, vm_map)->timestamp); 169 } 170 if (print_ddb) { 171 char *name; 172 173 if (A(vm_map) == kernel_map_addr) 174 name = "kernel_map"; 175 else if (P(vm_map) == kmem_map) 176 name = "kmem_map"; 177 else if (P(vm_map) == mb_map) 178 name = "mb_map"; 179 else if (P(vm_map) == phys_map) 180 name = "phys_map"; 181 else if (P(vm_map) == exec_map) 182 name = "exec_map"; 183 else if (P(vm_map) == pager_map) 184 name = "pager_map"; 185 else 186 name = NULL; 187 188 printf("%*s%s %p: [0x%lx->0x%lx]\n", indent(2), "", 189 recurse < 2 ? "MAP" : "SUBMAP", P(vm_map), 190 D(vm_map, vm_map)->min_offset, 191 D(vm_map, vm_map)->max_offset); 192 printf("\t%*s#ent=%d, sz=%ld, ref=%d, version=%d, flags=0x%x\n", 193 indent(2), "", D(vm_map, vm_map)->nentries, 194 D(vm_map, vm_map)->size, D(vm_map, vm_map)->ref_count, 195 D(vm_map, vm_map)->timestamp, D(vm_map, vm_map)->flags); 196 printf("\t%*spmap=%p(resident=<unknown>)\n", indent(2), "", 197 D(vm_map, vm_map)->pmap); 198 if (verbose && name != NULL) 199 printf("\t%*s([ %s ])\n", indent(2), "", name); 200 } 201 202 (*dump_vm_map_entry)(kd, pid, proc, vmspace, header, 1); 203 204 /* 205 * we're not recursing into a submap, so print headers 206 */ 207 if (recurse < 2) { 208 /* headers */ 209 #ifdef DISABLED_HEADERS 210 if (print_map) 211 printf("%-*s %-*s rwx RWX CPY NCP I W A\n", 212 (int)sizeof(long) * 2 + 2, "Start", 213 (int)sizeof(long) * 2 + 2, "End"); 214 if (print_maps) 215 printf("%-*s %-*s rwxp %-*s Dev Inode File\n", 216 (int)sizeof(long) * 2 + 0, "Start", 217 (int)sizeof(long) * 2 + 0, "End", 218 (int)sizeof(long) * 2 + 0, "Offset"); 219 if (print_solaris) 220 printf("%-*s %*s Protection File\n", 221 (int)sizeof(long) * 2 + 0, "Start", 222 (int)sizeof(int) * 2 - 1, "Size "); 223 #endif 224 if (print_all) 225 printf("%-*s %-*s %*s %-*s rwxpc RWX I/W/A Dev %*s" 226 " - File\n", 227 (int)sizeof(long) * 2, "Start", 228 (int)sizeof(long) * 2, "End", 229 (int)sizeof(int) * 2, "Size ", 230 (int)sizeof(long) * 2, "Offset", 231 (int)sizeof(int) * 2, "Inode"); 232 } 233 234 /* these are the "sub entries" */ 235 total = 0; 236 next = D(header, vm_map_entry)->next; 237 last = P(header); 238 end = 0; 239 240 while (next != 0 && next != last) { 241 addr = (u_long)next; 242 A(vm_map_entry) = addr; 243 S(vm_map_entry) = sizeof(struct vm_map_entry); 244 KDEREF(kd, vm_map_entry); 245 next = D(vm_map_entry, vm_map_entry)->next; 246 247 if (end == 0) 248 end = D(vm_map_entry, vm_map_entry)->start; 249 else if (verbose > 1 && 250 end != D(vm_map_entry, vm_map_entry)->start) 251 printf("%*s*\n", indent(2), ""); 252 total += (*dump_vm_map_entry)(kd, pid, proc, vmspace, 253 vm_map_entry, 0); 254 255 end = D(vm_map_entry, vm_map_entry)->end; 256 } 257 258 /* 259 * we're not recursing into a submap, so print totals 260 */ 261 if (recurse < 2) { 262 if (print_solaris) 263 printf("%-*s %8luK\n", 264 (int)sizeof(void *) * 2 - 2, " total", 265 (unsigned long)total); 266 if (print_all) 267 printf("%-*s %9luk\n", 268 (int)sizeof(void *) * 4 - 1, " total", 269 (unsigned long)total); 270 } 271 } 272 273 static size_t 274 dump_vm_map_entry(kvm_t *kd, pid_t pid, struct kinfo_proc2 * proc, 275 struct kbit *vmspace, struct kbit *vm_map_entry, int ishead) 276 { 277 struct kbit kbit[3]; 278 struct kbit *uvm_obj, *vp, *vfs; 279 struct vm_map_entry *vme; 280 size_t sz; 281 char *name; 282 dev_t dev; 283 ino_t inode; 284 285 uvm_obj = &kbit[0]; 286 vp = &kbit[1]; 287 vfs = &kbit[2]; 288 289 A(uvm_obj) = 0; 290 A(vp) = 0; 291 A(vfs) = 0; 292 293 vme = D(vm_map_entry, vm_map_entry); 294 295 if ((ishead && (debug & PRINT_VM_MAP_HEADER)) || 296 (!ishead && (debug & PRINT_VM_MAP_ENTRY))) { 297 printf("%*s%s %p = {", indent(2), "", 298 ishead ? "vm_map.header" : "vm_map_entry", 299 P(vm_map_entry)); 300 printf(" prev = %p,", vme->prev); 301 printf(" next = %p,\n", vme->next); 302 printf("%*s start = %lx,", indent(2), "", vme->start); 303 printf(" end = %lx,", vme->end); 304 printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj); 305 printf("%*s offset = %" PRIx64 ",", indent(2), "", 306 vme->offset); 307 printf(" etype = %x <%s%s%s%s >,", vme->etype, 308 vme->etype & UVM_ET_OBJ ? " OBJ" : "", 309 vme->etype & UVM_ET_SUBMAP ? " SUBMAP" : "", 310 vme->etype & UVM_ET_COPYONWRITE ? " COW" : "", 311 vme->etype & UVM_ET_NEEDSCOPY ? " NEEDSCOPY" : ""); 312 printf(" protection = %x,\n", vme->protection); 313 printf("%*s max_protection = %x,", indent(2), "", 314 vme->max_protection); 315 printf(" inheritance = %d,", vme->inheritance); 316 printf(" wired_count = %d,\n", vme->wired_count); 317 printf("%*s aref = { ar_pageoff = %x, ar_amap = %p },", 318 indent(2), "", vme->aref.ar_pageoff, vme->aref.ar_amap); 319 printf(" advice = %d,\n", vme->advice); 320 printf("%*s flags = %x <%s%s > }\n", indent(2), "", 321 vme->flags, 322 vme->flags & UVM_MAP_STATIC ? " STATIC" : "", 323 vme->flags & UVM_MAP_KMEM ? " KMEM" : ""); 324 } 325 326 if (ishead) 327 return (0); 328 329 A(vp) = 0; 330 A(uvm_obj) = 0; 331 332 if (vme->object.uvm_obj != NULL) { 333 P(uvm_obj) = vme->object.uvm_obj; 334 S(uvm_obj) = sizeof(struct uvm_object); 335 KDEREF(kd, uvm_obj); 336 if (UVM_ET_ISOBJ(vme) && 337 UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) { 338 P(vp) = P(uvm_obj); 339 S(vp) = sizeof(struct vnode); 340 KDEREF(kd, vp); 341 } 342 } 343 344 A(vfs) = NULL; 345 346 if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) { 347 P(vfs) = D(vp, vnode)->v_mount; 348 S(vfs) = sizeof(struct mount); 349 KDEREF(kd, vfs); 350 D(vp, vnode)->v_mount = D(vfs, mount); 351 } 352 353 /* 354 * dig out the device number and inode number from certain 355 * file system types. 356 */ 357 #define V_DATA_IS(vp, type, d, i) do { \ 358 struct kbit data; \ 359 P(&data) = D(vp, vnode)->v_data; \ 360 S(&data) = sizeof(*D(&data, type)); \ 361 KDEREF(kd, &data); \ 362 dev = D(&data, type)->d; \ 363 inode = D(&data, type)->i; \ 364 } while (0/*CONSTCOND*/) 365 366 dev = 0; 367 inode = 0; 368 369 if (A(vp) && 370 D(vp, vnode)->v_type == VREG && 371 D(vp, vnode)->v_data != NULL) { 372 switch (D(vp, vnode)->v_tag) { 373 case VT_UFS: 374 case VT_LFS: 375 case VT_EXT2FS: 376 V_DATA_IS(vp, inode, i_dev, i_number); 377 break; 378 case VT_ISOFS: 379 V_DATA_IS(vp, iso_node, i_dev, i_number); 380 break; 381 case VT_NON: 382 case VT_NFS: 383 case VT_MFS: 384 case VT_MSDOSFS: 385 case VT_LOFS: 386 case VT_FDESC: 387 case VT_PORTAL: 388 case VT_NULL: 389 case VT_UMAP: 390 case VT_KERNFS: 391 case VT_PROCFS: 392 case VT_AFS: 393 case VT_UNION: 394 case VT_ADOSFS: 395 case VT_CODA: 396 case VT_FILECORE: 397 case VT_NTFS: 398 case VT_VFS: 399 case VT_OVERLAY: 400 case VT_SMBFS: 401 break; 402 } 403 } 404 405 name = findname(kd, vmspace, vm_map_entry, vp, vfs, uvm_obj); 406 407 if (print_map) { 408 printf("%*s0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d", 409 indent(2), "", 410 vme->start, vme->end, 411 (vme->protection & VM_PROT_READ) ? 'r' : '-', 412 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 413 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 414 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 415 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 416 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 417 (vme->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 418 (vme->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 419 vme->inheritance, vme->wired_count, 420 vme->advice); 421 if (verbose) { 422 if (inode) 423 printf(" %d,%d %d", 424 major(dev), minor(dev), inode); 425 if (name[0]) 426 printf(" %s", name); 427 } 428 printf("\n"); 429 } 430 431 if (print_maps) { 432 printf("%*s%0*lx-%0*lx %c%c%c%c %0*" PRIx64 " %02x:%02x %d %s\n", 433 indent(2), "", 434 (int)sizeof(void *) * 2, vme->start, 435 (int)sizeof(void *) * 2, vme->end, 436 (vme->protection & VM_PROT_READ) ? 'r' : '-', 437 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 438 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 439 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 440 (int)sizeof(void *) * 2, 441 vme->offset, 442 major(dev), minor(dev), inode, 443 (name[0] != ' ') || verbose ? name : ""); 444 } 445 446 if (print_ddb) { 447 printf("%*s - %p: 0x%lx->0x%lx: obj=%p/0x%" PRIx64 ", amap=%p/%d\n", 448 indent(2), "", 449 P(vm_map_entry), vme->start, vme->end, 450 vme->object.uvm_obj, vme->offset, 451 vme->aref.ar_amap, vme->aref.ar_pageoff); 452 printf("\t%*ssubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, " 453 "wc=%d, adv=%d\n", 454 indent(2), "", 455 (vme->etype & UVM_ET_SUBMAP) ? 'T' : 'F', 456 (vme->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F', 457 (vme->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F', 458 vme->protection, vme->max_protection, 459 vme->inheritance, vme->wired_count, vme->advice); 460 if (verbose) { 461 printf("\t%*s", indent(2), ""); 462 if (inode) 463 printf("(dev=%d,%d ino=%d [%s] [%p])\n", 464 major(dev), minor(dev), inode, 465 name, P(vp)); 466 else if (name[0] == ' ') 467 printf("(%s)\n", &name[2]); 468 else 469 printf("(%s)\n", name); 470 } 471 } 472 473 sz = 0; 474 if (print_solaris) { 475 char prot[30]; 476 477 prot[0] = '\0'; 478 prot[1] = '\0'; 479 if (vme->protection & VM_PROT_READ) 480 strcat(prot, "/read"); 481 if (vme->protection & VM_PROT_WRITE) 482 strcat(prot, "/write"); 483 if (vme->protection & VM_PROT_EXECUTE) 484 strcat(prot, "/exec"); 485 486 sz = (size_t)((vme->end - vme->start) / 1024); 487 printf("%*s%0*lX %6luK %-15s %s\n", 488 indent(2), "", 489 (int)sizeof(void *) * 2, 490 (unsigned long)vme->start, 491 (unsigned long)sz, 492 &prot[1], 493 name); 494 } 495 496 if (print_all) { 497 sz = (size_t)((vme->end - vme->start) / 1024); 498 printf(A(vp) ? 499 "%*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" : 500 "%*s%0*lx-%0*lx %7luk %0*" PRIx64 " %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7d - %s\n", 501 indent(2), "", 502 (int)sizeof(void *) * 2, 503 vme->start, 504 (int)sizeof(void *) * 2, 505 vme->end - (vme->start != vme->end ? 1 : 0), 506 (unsigned long)sz, 507 (int)sizeof(void *) * 2, 508 vme->offset, 509 (vme->protection & VM_PROT_READ) ? 'r' : '-', 510 (vme->protection & VM_PROT_WRITE) ? 'w' : '-', 511 (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-', 512 (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 513 (vme->etype & UVM_ET_NEEDSCOPY) ? '+' : '-', 514 (vme->max_protection & VM_PROT_READ) ? 'r' : '-', 515 (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-', 516 (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 517 vme->inheritance, 518 vme->wired_count, 519 vme->advice, 520 major(dev), minor(dev), inode, 521 name, P(vp)); 522 } 523 524 /* no access allowed, don't count space */ 525 if ((vme->protection & rwx) == 0) 526 sz = 0; 527 528 if (recurse && (vme->etype & UVM_ET_SUBMAP)) { 529 struct kbit mkbit, *submap; 530 531 recurse++; 532 submap = &mkbit; 533 P(submap) = vme->object.sub_map; 534 S(submap) = sizeof(*vme->object.sub_map); 535 KDEREF(kd, submap); 536 (*dump_vm_map)(kd, pid, proc, vmspace, submap, "submap"); 537 recurse--; 538 } 539 540 return (sz); 541 } 542 543 static char* 544 findname(kvm_t *kd, struct kbit *vmspace, 545 struct kbit *vm_map_entry, struct kbit *vp, 546 struct kbit *vfs, struct kbit *uvm_obj) 547 { 548 static char buf[1024], *name; 549 struct vm_map_entry *vme; 550 size_t l; 551 552 vme = D(vm_map_entry, vm_map_entry); 553 554 if (UVM_ET_ISOBJ(vme)) { 555 if (A(vfs)) { 556 l = (unsigned)strlen(D(vfs, mount)->mnt_stat.f_mntonname); 557 switch (search_cache(kd, vp, &name, buf, sizeof(buf))) { 558 case 0: /* found something */ 559 name--; 560 *name = '/'; 561 /*FALLTHROUGH*/ 562 case 2: /* found nothing */ 563 name -= 5; 564 memcpy(name, " -?- ", (size_t)5); 565 name -= l; 566 memcpy(name, 567 D(vfs, mount)->mnt_stat.f_mntonname, l); 568 break; 569 case 1: /* all is well */ 570 name--; 571 *name = '/'; 572 if (l != 1) { 573 name -= l; 574 memcpy(name, 575 D(vfs, mount)->mnt_stat.f_mntonname, l); 576 } 577 break; 578 } 579 } 580 else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) { 581 struct kbit kdev; 582 dev_t dev; 583 584 P(&kdev) = P(uvm_obj); 585 S(&kdev) = sizeof(struct uvm_device); 586 KDEREF(kd, &kdev); 587 dev = D(&kdev, uvm_device)->u_device; 588 name = devname(dev, S_IFCHR); 589 if (name != NULL) 590 snprintf(buf, sizeof(buf), "/dev/%s", name); 591 else 592 snprintf(buf, sizeof(buf), " [ device %d,%d ]", 593 major(dev), minor(dev)); 594 name = buf; 595 } 596 else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object))) 597 name = " [ uvm_aobj ]"; 598 else if (UVM_OBJ_IS_UBCPAGER(D(uvm_obj, uvm_object))) 599 name = " [ ubc_pager ]"; 600 else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) 601 name = " [ ?VNODE? ]"; 602 else { 603 snprintf(buf, sizeof(buf), " [ ?? %p ?? ]", 604 D(uvm_obj, uvm_object)->pgops); 605 name = buf; 606 } 607 } 608 609 else if (D(vmspace, vmspace)->vm_maxsaddr <= 610 (caddr_t)vme->start && 611 (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >= 612 (caddr_t)vme->end) 613 name = " [ stack ]"; 614 615 else if ((vme->protection & rwx) == rwx && !heapfound) { 616 /* XXX this could probably be done better */ 617 heapfound = 1; 618 name = " [ heap ]"; 619 } 620 621 else 622 name = " [ anon ]"; 623 624 return (name); 625 } 626 627 static int 628 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen) 629 { 630 char *o, *e; 631 struct cache_entry *ce; 632 struct kbit svp; 633 u_long cid; 634 635 if (nchashtbl == NULL) 636 load_name_cache(kd); 637 638 P(&svp) = P(vp); 639 S(&svp) = sizeof(struct vnode); 640 cid = D(vp, vnode)->v_id; 641 642 e = &buf[blen - 1]; 643 o = e; 644 do { 645 LIST_FOREACH(ce, &lcache, ce_next) 646 if (ce->ce_vp == P(&svp) && ce->ce_cid == cid) 647 break; 648 if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) { 649 if (o != e) 650 *(--o) = '/'; 651 o -= ce->ce_nlen; 652 memcpy(o, ce->ce_name, (unsigned)ce->ce_nlen); 653 P(&svp) = ce->ce_pvp; 654 cid = ce->ce_pcid; 655 } 656 else 657 break; 658 } while (1/*CONSTCOND*/); 659 *e = '\0'; 660 *name = o; 661 662 if (e == o) 663 return (2); 664 665 KDEREF(kd, &svp); 666 return (D(&svp, vnode)->v_flag & VROOT); 667 } 668
Indexes created Wed Sep 24 05:09:52 GMT 2025