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