xref: /openbsd-src/usr.sbin/procmap/procmap.c (revision 66f21f29879c0f5f50cee22bbdf231dc1883bf1d)
1 /*	$OpenBSD: procmap.c,v 1.48 2013/04/24 14:29:00 deraadt Exp $ */
2 /*	$NetBSD: pmap.c,v 1.1 2002/09/01 20:32:44 atatat Exp $ */
3 
4 /*
5  * Copyright (c) 2002 The NetBSD Foundation, Inc.
6  * All rights reserved.
7  *
8  * This code is derived from software contributed to The NetBSD Foundation
9  * by Andrew Brown.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  *
20  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30  * POSSIBILITY OF SUCH DAMAGE.
31  */
32 
33 #include <sys/types.h>
34 #include <sys/param.h>
35 #include <sys/time.h>
36 #include <sys/exec.h>
37 #include <sys/proc.h>
38 #include <sys/vnode.h>
39 #include <sys/mount.h>
40 #include <sys/uio.h>
41 #include <sys/namei.h>
42 #include <sys/sysctl.h>
43 
44 #include <uvm/uvm.h>
45 #include <uvm/uvm_device.h>
46 #include <uvm/uvm_amap.h>
47 
48 #include <ufs/ufs/quota.h>
49 #include <ufs/ufs/inode.h>
50 #undef doff_t
51 #undef IN_ACCESS
52 #undef i_size
53 #undef i_devvp
54 #include <isofs/cd9660/iso.h>
55 #include <isofs/cd9660/cd9660_node.h>
56 
57 #include <kvm.h>
58 #include <fcntl.h>
59 #include <errno.h>
60 #include <err.h>
61 #include <stdlib.h>
62 #include <stddef.h>
63 #include <unistd.h>
64 #include <stdio.h>
65 #include <limits.h>
66 #include <string.h>
67 
68 /*
69  * stolen (and munged) from #include <uvm/uvm_object.h>
70  */
71 #define UVM_OBJ_IS_VNODE(uobj)	((uobj)->pgops == uvm_vnodeops)
72 #define UVM_OBJ_IS_AOBJ(uobj)	((uobj)->pgops == aobj_pager)
73 #define UVM_OBJ_IS_DEVICE(uobj)	((uobj)->pgops == uvm_deviceops)
74 
75 #define PRINT_VMSPACE		0x00000001
76 #define PRINT_VM_MAP		0x00000002
77 #define PRINT_VM_MAP_HEADER	0x00000004
78 #define PRINT_VM_MAP_ENTRY	0x00000008
79 #define DUMP_NAMEI_CACHE	0x00000010
80 
81 struct cache_entry {
82 	LIST_ENTRY(cache_entry) ce_next;
83 	struct vnode *ce_vp, *ce_pvp;
84 	u_long ce_cid, ce_pcid;
85 	unsigned int ce_nlen;
86 	char ce_name[256];
87 };
88 
89 LIST_HEAD(cache_head, cache_entry) lcache;
90 void *uvm_vnodeops, *uvm_deviceops, *aobj_pager;
91 u_long kernel_map_addr;
92 int debug, verbose;
93 int print_all, print_map, print_maps, print_solaris, print_ddb, print_amap;
94 int rwx = VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE;
95 rlim_t maxssiz;
96 
97 struct sum {
98 	unsigned long s_am_nslots;
99 	unsigned long s_am_maxslots;
100 	unsigned long s_am_nusedslots;
101 };
102 
103 struct kbit {
104 	/*
105 	 * size of data chunk
106 	 */
107 	size_t k_size;
108 
109 	/*
110 	 * something for printf() and something for kvm_read()
111 	 */
112 	union {
113 		void *k_addr_p;
114 		u_long k_addr_ul;
115 	} k_addr;
116 
117 	/*
118 	 * where we actually put the "stuff"
119 	 */
120 	union {
121 		char data[1];
122 		struct vmspace vmspace;
123 		struct vm_map vm_map;
124 		struct vm_map_entry vm_map_entry;
125 		struct vnode vnode;
126 		struct uvm_object uvm_object;
127 		struct mount mount;
128 		struct namecache namecache;
129 		struct inode inode;
130 		struct iso_node iso_node;
131 		struct uvm_device uvm_device;
132 		struct vm_amap vm_amap;
133 	} k_data;
134 };
135 
136 /* the size of the object in the kernel */
137 #define S(x)	((x)->k_size)
138 /* the address of the object in kernel, two forms */
139 #define A(x)	((x)->k_addr.k_addr_ul)
140 #define P(x)	((x)->k_addr.k_addr_p)
141 /* the data from the kernel */
142 #define D(x,d)	(&((x)->k_data.d))
143 
144 /* suck the data from the kernel */
145 #define _KDEREF(kd, addr, dst, sz) do { \
146 	ssize_t len; \
147 	len = kvm_read((kd), (addr), (dst), (sz)); \
148 	if (len != (sz)) \
149 		errx(1, "%s == %ld vs. %lu @ %lx", \
150 		    kvm_geterr(kd), (long)len, (unsigned long)(sz), (addr)); \
151 } while (0/*CONSTCOND*/)
152 
153 /* suck the data using the structure */
154 #define KDEREF(kd, item) _KDEREF((kd), A(item), D(item, data), S(item))
155 
156 struct nlist nl[] = {
157 	{ "_maxsmap" },
158 #define NL_MAXSSIZ		0
159 	{ "_uvm_vnodeops" },
160 #define NL_UVM_VNODEOPS		1
161 	{ "_uvm_deviceops" },
162 #define NL_UVM_DEVICEOPS	2
163 	{ "_aobj_pager" },
164 #define NL_AOBJ_PAGER		3
165 	{ "_kernel_map" },
166 #define NL_KERNEL_MAP		4
167 	{ NULL }
168 };
169 
170 void load_symbols(kvm_t *);
171 void process_map(kvm_t *, pid_t, struct kinfo_proc *, struct sum *);
172 struct vm_map_entry *load_vm_map_entries(kvm_t *, struct vm_map_entry *,
173     struct vm_map_entry *);
174 void unload_vm_map_entries(struct vm_map_entry *);
175 size_t dump_vm_map_entry(kvm_t *, struct kbit *, struct vm_map_entry *,
176     struct sum *);
177 char *findname(kvm_t *, struct kbit *, struct vm_map_entry *, struct kbit *,
178     struct kbit *, struct kbit *);
179 int search_cache(kvm_t *, struct kbit *, char **, char *, size_t);
180 static void __dead usage(void);
181 static pid_t strtopid(const char *);
182 void print_sum(struct sum *, struct sum *);
183 
184 /*
185  * uvm_map address tree implementation.
186  */
187 static int no_impl(void *, void *);
188 static int
189 no_impl(void *p, void *q)
190 {
191 	errx(1, "uvm_map address comparison not implemented");
192 	return 0;
193 }
194 
195 RB_GENERATE(uvm_map_addr, vm_map_entry, daddrs.addr_entry, no_impl);
196 
197 int
198 main(int argc, char *argv[])
199 {
200 	char errbuf[_POSIX2_LINE_MAX], *kmem = NULL, *kernel = NULL;
201 	struct kinfo_proc *kproc;
202 	struct sum total_sum;
203 	int many, ch, rc;
204 	kvm_t *kd;
205 	pid_t pid = -1;
206 	gid_t gid;
207 
208 	while ((ch = getopt(argc, argv, "AaD:dlmM:N:p:Prsvx")) != -1) {
209 		switch (ch) {
210 		case 'A':
211 			print_amap = 1;
212 			break;
213 		case 'a':
214 			print_all = 1;
215 			break;
216 		case 'd':
217 			print_ddb = 1;
218 			break;
219 		case 'D':
220 			debug = atoi(optarg);
221 			break;
222 		case 'l':
223 			print_maps = 1;
224 			break;
225 		case 'm':
226 			print_map = 1;
227 			break;
228 		case 'M':
229 			kmem = optarg;
230 			break;
231 		case 'N':
232 			kernel = optarg;
233 			break;
234 		case 'p':
235 			pid = strtopid(optarg);
236 			break;
237 		case 'P':
238 			pid = getpid();
239 			break;
240 		case 's':
241 			print_solaris = 1;
242 			break;
243 		case 'v':
244 			verbose = 1;
245 			break;
246 		case 'r':
247 		case 'x':
248 			errx(1, "-%c option not implemented, sorry", ch);
249 			/*NOTREACHED*/
250 		default:
251 			usage();
252 		}
253 	}
254 
255 	/*
256 	 * Discard setgid privileges if not the running kernel so that bad
257 	 * guys can't print interesting stuff from kernel memory.
258 	 */
259 	gid = getgid();
260 	if (kernel != NULL || kmem != NULL)
261 		if (setresgid(gid, gid, gid) == -1)
262 			err(1, "setresgid");
263 
264 	argc -= optind;
265 	argv += optind;
266 
267 	/* more than one "process" to dump? */
268 	many = (argc > 1 - (pid == -1 ? 0 : 1)) ? 1 : 0;
269 
270 	/* apply default */
271 	if (print_all + print_map + print_maps + print_solaris +
272 	    print_ddb == 0)
273 		print_solaris = 1;
274 
275 	/* start by opening libkvm */
276 	kd = kvm_openfiles(kernel, kmem, NULL, O_RDONLY, errbuf);
277 
278 	if (kernel == NULL && kmem == NULL)
279 		if (setresgid(gid, gid, gid) == -1)
280 			err(1, "setresgid");
281 
282 	if (kd == NULL)
283 		errx(1, "%s", errbuf);
284 
285 	/* get "bootstrap" addresses from kernel */
286 	load_symbols(kd);
287 
288 	memset(&total_sum, 0, sizeof(total_sum));
289 
290 	do {
291 		struct sum sum;
292 
293 		memset(&sum, 0, sizeof(sum));
294 
295 		if (pid == -1) {
296 			if (argc == 0)
297 				pid = getppid();
298 			else {
299 				pid = strtopid(argv[0]);
300 				argv++;
301 				argc--;
302 			}
303 		}
304 
305 		/* find the process id */
306 		if (pid == 0)
307 			kproc = NULL;
308 		else {
309 			kproc = kvm_getprocs(kd, KERN_PROC_PID, pid,
310 			    sizeof(struct kinfo_proc), &rc);
311 			if (kproc == NULL || rc == 0) {
312 				errno = ESRCH;
313 				warn("%d", pid);
314 				pid = -1;
315 				continue;
316 			}
317 		}
318 
319 		/* dump it */
320 		if (many) {
321 			if (kproc)
322 				printf("process %d:\n", pid);
323 			else
324 				printf("kernel:\n");
325 		}
326 
327 		process_map(kd, pid, kproc, &sum);
328 		if (print_amap)
329 			print_sum(&sum, &total_sum);
330 		pid = -1;
331 	} while (argc > 0);
332 
333 	if (print_amap)
334 		print_sum(&total_sum, NULL);
335 
336 	/* done.  go away. */
337 	rc = kvm_close(kd);
338 	if (rc == -1)
339 		err(1, "kvm_close");
340 
341 	return (0);
342 }
343 
344 void
345 print_sum(struct sum *sum, struct sum *total_sum)
346 {
347 	const char *t = total_sum == NULL ? "total " : "";
348 	printf("%samap allocated slots: %lu\n", t, sum->s_am_maxslots);
349 	printf("%samap mapped slots: %lu\n", t, sum->s_am_nslots);
350 	printf("%samap used slots: %lu\n", t, sum->s_am_nusedslots);
351 
352 	if (total_sum) {
353 		total_sum->s_am_maxslots += sum->s_am_maxslots;
354 		total_sum->s_am_nslots += sum->s_am_nslots;
355 		total_sum->s_am_nusedslots += sum->s_am_nusedslots;
356 	}
357 }
358 
359 void
360 process_map(kvm_t *kd, pid_t pid, struct kinfo_proc *proc, struct sum *sum)
361 {
362 	struct kbit kbit[3], *vmspace, *vm_map;
363 	struct vm_map_entry *vm_map_entry;
364 	size_t total = 0;
365 	char *thing;
366 	uid_t uid;
367 	int vmmap_flags;
368 
369 	if ((uid = getuid())) {
370 		if (pid == 0) {
371 			warnx("kernel map is restricted");
372 			return;
373 		}
374 		if (uid != proc->p_uid) {
375 			warnx("other users' process maps are restricted");
376 			return;
377 		}
378 	}
379 
380 	vmspace = &kbit[0];
381 	vm_map = &kbit[1];
382 
383 	A(vmspace) = 0;
384 	A(vm_map) = 0;
385 
386 	if (pid > 0) {
387 		A(vmspace) = (u_long)proc->p_vmspace;
388 		S(vmspace) = sizeof(struct vmspace);
389 		KDEREF(kd, vmspace);
390 		thing = "proc->p_vmspace.vm_map";
391 	} else {
392 		A(vmspace) = 0;
393 		S(vmspace) = 0;
394 		thing = "kernel_map";
395 	}
396 
397 	if (pid > 0 && (debug & PRINT_VMSPACE)) {
398 		printf("proc->p_vmspace %p = {", P(vmspace));
399 		printf(" vm_refcnt = %d,", D(vmspace, vmspace)->vm_refcnt);
400 		printf(" vm_shm = %p,\n", D(vmspace, vmspace)->vm_shm);
401 		printf("    vm_rssize = %d,", D(vmspace, vmspace)->vm_rssize);
402 		printf(" vm_swrss = %d,", D(vmspace, vmspace)->vm_swrss);
403 		printf(" vm_tsize = %d,", D(vmspace, vmspace)->vm_tsize);
404 		printf(" vm_dsize = %d,\n", D(vmspace, vmspace)->vm_dsize);
405 		printf("    vm_ssize = %d,", D(vmspace, vmspace)->vm_ssize);
406 		printf(" vm_taddr = %p,", D(vmspace, vmspace)->vm_taddr);
407 		printf(" vm_daddr = %p,\n", D(vmspace, vmspace)->vm_daddr);
408 		printf("    vm_maxsaddr = %p,",
409 		    D(vmspace, vmspace)->vm_maxsaddr);
410 		printf(" vm_minsaddr = %p }\n",
411 		    D(vmspace, vmspace)->vm_minsaddr);
412 	}
413 
414 	S(vm_map) = sizeof(struct vm_map);
415 	if (pid > 0) {
416 		A(vm_map) = A(vmspace);
417 		memcpy(D(vm_map, vm_map), &D(vmspace, vmspace)->vm_map,
418 		    S(vm_map));
419 	} else {
420 		A(vm_map) = kernel_map_addr;
421 		KDEREF(kd, vm_map);
422 	}
423 	if (debug & PRINT_VM_MAP) {
424 		printf("%s %p = {", thing, P(vm_map));
425 
426 		printf(" pmap = %p,\n", D(vm_map, vm_map)->pmap);
427 		printf("    lock = <struct lock>\n");
428 		printf("    size = %lx,", D(vm_map, vm_map)->size);
429 		printf(" ref_count = %d,", D(vm_map, vm_map)->ref_count);
430 		printf(" ref_lock = <struct simplelock>,\n");
431 		printf("    min_offset-max_offset = 0x%lx-0x%lx\n",
432 		    D(vm_map, vm_map)->min_offset,
433 		    D(vm_map, vm_map)->max_offset);
434 		printf("    b_start-b_end = 0x%lx-0x%lx\n",
435 		    D(vm_map, vm_map)->b_start,
436 		    D(vm_map, vm_map)->b_end);
437 		printf("    s_start-s_end = 0x%lx-0x%lx\n",
438 		    D(vm_map, vm_map)->s_start,
439 		    D(vm_map, vm_map)->s_end);
440 		vmmap_flags = D(vm_map, vm_map)->flags;
441 		printf("    flags = %x <%s%s%s%s%s%s >,\n",
442 		    vmmap_flags,
443 		    vmmap_flags & VM_MAP_PAGEABLE ? " PAGEABLE" : "",
444 		    vmmap_flags & VM_MAP_INTRSAFE ? " INTRSAFE" : "",
445 		    vmmap_flags & VM_MAP_WIREFUTURE ? " WIREFUTURE" : "",
446 		    vmmap_flags & VM_MAP_BUSY ? " BUSY" : "",
447 		    vmmap_flags & VM_MAP_WANTLOCK ? " WANTLOCK" : "",
448 #if VM_MAP_TOPDOWN > 0
449 		    vmmap_flags & VM_MAP_TOPDOWN ? " TOPDOWN" :
450 #endif
451 		    "");
452 		printf("    timestamp = %u }\n", D(vm_map, vm_map)->timestamp);
453 	}
454 	if (print_ddb) {
455 		printf("MAP %p: [0x%lx->0x%lx]\n", P(vm_map),
456 		    D(vm_map, vm_map)->min_offset,
457 		    D(vm_map, vm_map)->max_offset);
458 		printf("\tsz=%ld, ref=%d, version=%d, flags=0x%x\n",
459 		    D(vm_map, vm_map)->size,
460 		    D(vm_map, vm_map)->ref_count,
461 		    D(vm_map, vm_map)->timestamp,
462 		    D(vm_map, vm_map)->flags);
463 		printf("\tpmap=%p(resident=<unknown>)\n",
464 		    D(vm_map, vm_map)->pmap);
465 	}
466 
467 	/* headers */
468 #ifdef DISABLED_HEADERS
469 	if (print_map)
470 		printf("%-*s %-*s rwx RWX CPY NCP I W A\n",
471 		    (int)sizeof(long) * 2 + 2, "Start",
472 		    (int)sizeof(long) * 2 + 2, "End");
473 	if (print_maps)
474 		printf("%-*s %-*s rwxp %-*s Dev   Inode      File\n",
475 		    (int)sizeof(long) * 2 + 0, "Start",
476 		    (int)sizeof(long) * 2 + 0, "End",
477 		    (int)sizeof(long) * 2 + 0, "Offset");
478 	if (print_solaris)
479 		printf("%-*s %*s Protection        File\n",
480 		    (int)sizeof(long) * 2 + 0, "Start",
481 		    (int)sizeof(int) * 2 - 1,  "Size ");
482 #endif
483 	if (print_all)
484 		printf("%-*s %-*s %*s %-*s rwxpc  RWX  I/W/A Dev  %*s - File\n",
485 		    (int)sizeof(long) * 2, "Start",
486 		    (int)sizeof(long) * 2, "End",
487 		    (int)sizeof(int)  * 2, "Size ",
488 		    (int)sizeof(long) * 2, "Offset",
489 		    (int)sizeof(int)  * 2, "Inode");
490 
491 	/* these are the "sub entries" */
492 	RB_ROOT(&D(vm_map, vm_map)->addr) =
493 	    load_vm_map_entries(kd, RB_ROOT(&D(vm_map, vm_map)->addr), NULL);
494 	RB_FOREACH(vm_map_entry, uvm_map_addr, &D(vm_map, vm_map)->addr)
495 		total += dump_vm_map_entry(kd, vmspace, vm_map_entry, sum);
496 	unload_vm_map_entries(RB_ROOT(&D(vm_map, vm_map)->addr));
497 
498 	if (print_solaris)
499 		printf("%-*s %8luK\n",
500 		    (int)sizeof(void *) * 2 - 2, " total",
501 		    (unsigned long)total);
502 	if (print_all)
503 		printf("%-*s %9luk\n",
504 		    (int)sizeof(void *) * 4 - 1, " total",
505 		    (unsigned long)total);
506 }
507 
508 void
509 load_symbols(kvm_t *kd)
510 {
511 	int rc, i;
512 
513 	rc = kvm_nlist(kd, &nl[0]);
514 	if (rc == -1)
515 		errx(1, "%s == %d", kvm_geterr(kd), rc);
516 	for (i = 0; i < sizeof(nl)/sizeof(nl[0]); i++)
517 		if (nl[i].n_value == 0 && nl[i].n_name)
518 			printf("%s not found\n", nl[i].n_name);
519 
520 	uvm_vnodeops =	(void*)nl[NL_UVM_VNODEOPS].n_value;
521 	uvm_deviceops =	(void*)nl[NL_UVM_DEVICEOPS].n_value;
522 	aobj_pager =	(void*)nl[NL_AOBJ_PAGER].n_value;
523 
524 	_KDEREF(kd, nl[NL_MAXSSIZ].n_value, &maxssiz,
525 	    sizeof(maxssiz));
526 	_KDEREF(kd, nl[NL_KERNEL_MAP].n_value, &kernel_map_addr,
527 	    sizeof(kernel_map_addr));
528 }
529 
530 /*
531  * Recreate the addr tree of vm_map in local memory.
532  */
533 struct vm_map_entry *
534 load_vm_map_entries(kvm_t *kd, struct vm_map_entry *kptr,
535     struct vm_map_entry *parent)
536 {
537 	static struct kbit map_ent;
538 	struct vm_map_entry *result;
539 
540 	if (kptr == NULL)
541 		return NULL;
542 
543 	A(&map_ent) = (u_long)kptr;
544 	S(&map_ent) = sizeof(struct vm_map_entry);
545 	KDEREF(kd, &map_ent);
546 
547 	result = malloc(sizeof(*result));
548 	if (result == NULL)
549 		err(1, "malloc");
550 	memcpy(result, D(&map_ent, vm_map_entry), sizeof(struct vm_map_entry));
551 
552 	/*
553 	 * Recurse to download rest of the tree.
554 	 */
555 	RB_LEFT(result, daddrs.addr_entry) = load_vm_map_entries(kd,
556 	    RB_LEFT(result, daddrs.addr_entry), result);
557 	RB_RIGHT(result, daddrs.addr_entry) = load_vm_map_entries(kd,
558 	    RB_RIGHT(result, daddrs.addr_entry), result);
559 	RB_PARENT(result, daddrs.addr_entry) = parent;
560 	return result;
561 }
562 
563 /*
564  * Release the addr tree of vm_map.
565  */
566 void
567 unload_vm_map_entries(struct vm_map_entry *ent)
568 {
569 	if (ent == NULL)
570 		return;
571 
572 	unload_vm_map_entries(RB_LEFT(ent, daddrs.addr_entry));
573 	unload_vm_map_entries(RB_RIGHT(ent, daddrs.addr_entry));
574 	free(ent);
575 }
576 
577 size_t
578 dump_vm_map_entry(kvm_t *kd, struct kbit *vmspace,
579     struct vm_map_entry *vme, struct sum *sum)
580 {
581 	struct kbit kbit[4], *uvm_obj, *vp, *vfs, *amap;
582 	ino_t inode = 0;
583 	dev_t dev = 0;
584 	size_t sz = 0;
585 	char *name;
586 
587 	uvm_obj = &kbit[0];
588 	vp = &kbit[1];
589 	vfs = &kbit[2];
590 	amap = &kbit[3];
591 
592 	A(uvm_obj) = 0;
593 	A(vp) = 0;
594 	A(vfs) = 0;
595 
596 	if (debug & PRINT_VM_MAP_ENTRY) {
597 		printf("%s = {", "vm_map_entry");
598 		printf(" start = %lx,", vme->start);
599 		printf(" end = %lx,", vme->end);
600 		printf(" object.uvm_obj/sub_map = %p,\n", vme->object.uvm_obj);
601 		printf("    offset = %lx,", (unsigned long)vme->offset);
602 		printf(" etype = %x <%s%s%s%s%s >,", vme->etype,
603 		    vme->etype & UVM_ET_OBJ ? " OBJ" : "",
604 		    vme->etype & UVM_ET_SUBMAP ? " SUBMAP" : "",
605 		    vme->etype & UVM_ET_COPYONWRITE ? " COW" : "",
606 		    vme->etype & UVM_ET_NEEDSCOPY ? " NEEDSCOPY" : "",
607 		    vme->etype & UVM_ET_HOLE ? " HOLE" : "");
608 		printf(" protection = %x,\n", vme->protection);
609 		printf("    max_protection = %x,", vme->max_protection);
610 		printf(" inheritance = %d,", vme->inheritance);
611 		printf(" wired_count = %d,\n", vme->wired_count);
612 		printf("    aref = <struct vm_aref>,");
613 		printf(" advice = %d,", vme->advice);
614 		printf(" flags = %x <%s%s > }\n", vme->flags,
615 		    vme->flags & UVM_MAP_STATIC ? " STATIC" : "",
616 		    vme->flags & UVM_MAP_KMEM ? " KMEM" : "");
617 	}
618 
619 	A(vp) = 0;
620 	A(uvm_obj) = 0;
621 
622 	if (vme->object.uvm_obj != NULL) {
623 		P(uvm_obj) = vme->object.uvm_obj;
624 		S(uvm_obj) = sizeof(struct uvm_object);
625 		KDEREF(kd, uvm_obj);
626 		if (UVM_ET_ISOBJ(vme) &&
627 		    UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object))) {
628 			P(vp) = P(uvm_obj);
629 			S(vp) = sizeof(struct vnode);
630 			KDEREF(kd, vp);
631 		}
632 	}
633 
634 	if (vme->aref.ar_amap != NULL) {
635 		P(amap) = vme->aref.ar_amap;
636 		S(amap) = sizeof(struct vm_amap);
637 		KDEREF(kd, amap);
638 	}
639 
640 	A(vfs) = 0;
641 
642 	if (P(vp) != NULL && D(vp, vnode)->v_mount != NULL) {
643 		P(vfs) = D(vp, vnode)->v_mount;
644 		S(vfs) = sizeof(struct mount);
645 		KDEREF(kd, vfs);
646 		D(vp, vnode)->v_mount = D(vfs, mount);
647 	}
648 
649 	/*
650 	 * dig out the device number and inode number from certain
651 	 * file system types.
652 	 */
653 #define V_DATA_IS(vp, type, d, i) do { \
654 	struct kbit data; \
655 	P(&data) = D(vp, vnode)->v_data; \
656 	S(&data) = sizeof(*D(&data, type)); \
657 	KDEREF(kd, &data); \
658 	dev = D(&data, type)->d; \
659 	inode = D(&data, type)->i; \
660 } while (0/*CONSTCOND*/)
661 
662 	if (A(vp) &&
663 	    D(vp, vnode)->v_type == VREG &&
664 	    D(vp, vnode)->v_data != NULL) {
665 		switch (D(vp, vnode)->v_tag) {
666 		case VT_UFS:
667 		case VT_EXT2FS:
668 			V_DATA_IS(vp, inode, i_dev, i_number);
669 			break;
670 		case VT_ISOFS:
671 			V_DATA_IS(vp, iso_node, i_dev, i_number);
672 			break;
673 		case VT_NON:
674 		case VT_NFS:
675 		case VT_MFS:
676 		case VT_MSDOSFS:
677 		case VT_PROCFS:
678 		default:
679 			break;
680 		}
681 	}
682 
683 	name = findname(kd, vmspace, vme, vp, vfs, uvm_obj);
684 
685 	if (print_map) {
686 		printf("0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d",
687 		    vme->start, vme->end,
688 		    (vme->protection & VM_PROT_READ) ? 'r' : '-',
689 		    (vme->protection & VM_PROT_WRITE) ? 'w' : '-',
690 		    (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-',
691 		    (vme->max_protection & VM_PROT_READ) ? 'r' : '-',
692 		    (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-',
693 		    (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-',
694 		    (vme->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW",
695 		    (vme->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC",
696 		    vme->inheritance, vme->wired_count,
697 		    vme->advice);
698 		if (verbose) {
699 			if (inode)
700 				printf(" %d,%d %u",
701 				    major(dev), minor(dev), inode);
702 			if (name[0])
703 				printf(" %s", name);
704 		}
705 		printf("\n");
706 	}
707 
708 	if (print_maps)
709 		printf("%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %llu     %s\n",
710 		    (int)sizeof(void *) * 2, vme->start,
711 		    (int)sizeof(void *) * 2, vme->end,
712 		    (vme->protection & VM_PROT_READ) ? 'r' : '-',
713 		    (vme->protection & VM_PROT_WRITE) ? 'w' : '-',
714 		    (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-',
715 		    (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's',
716 		    (int)sizeof(void *) * 2,
717 		    (unsigned long)vme->offset,
718 		    major(dev), minor(dev), (unsigned long long)inode,
719 		    inode ? name : "");
720 
721 	if (print_ddb) {
722 		printf(" - <lost address>: 0x%lx->0x%lx: "
723 		    "obj=%p/0x%lx, amap=%p/%d\n",
724 		    vme->start, vme->end,
725 		    vme->object.uvm_obj, (unsigned long)vme->offset,
726 		    vme->aref.ar_amap, vme->aref.ar_pageoff);
727 		printf("\tsubmap=%c, cow=%c, nc=%c, prot(max)=%d/%d, inh=%d, "
728 		    "wc=%d, adv=%d\n",
729 		    (vme->etype & UVM_ET_SUBMAP) ? 'T' : 'F',
730 		    (vme->etype & UVM_ET_COPYONWRITE) ? 'T' : 'F',
731 		    (vme->etype & UVM_ET_NEEDSCOPY) ? 'T' : 'F',
732 		    vme->protection, vme->max_protection,
733 		    vme->inheritance, vme->wired_count, vme->advice);
734 		if (inode && verbose)
735 			printf("\t(dev=%d,%d ino=%llu [%s] [%p])\n",
736 			    major(dev), minor(dev), (unsigned long long)inode,
737 			    inode ? name : "", P(vp));
738 		else if (name[0] == ' ' && verbose)
739 			printf("\t(%s)\n", &name[2]);
740 	}
741 
742 	if (print_solaris) {
743 		char prot[30];
744 
745 		prot[0] = '\0';
746 		prot[1] = '\0';
747 		if (vme->protection & VM_PROT_READ)
748 			strlcat(prot, "/read", sizeof(prot));
749 		if (vme->protection & VM_PROT_WRITE)
750 			strlcat(prot, "/write", sizeof(prot));
751 		if (vme->protection & VM_PROT_EXECUTE)
752 			strlcat(prot, "/exec", sizeof(prot));
753 
754 		sz = (size_t)((vme->end - vme->start) / 1024);
755 		printf("%0*lX %6luK %-15s   %s\n",
756 		    (int)sizeof(void *) * 2, (unsigned long)vme->start,
757 		    (unsigned long)sz, &prot[1], name);
758 	}
759 
760 	if (print_all) {
761 		sz = (size_t)((vme->end - vme->start) / 1024);
762 		printf("%0*lx-%0*lx %7luk %0*lx %c%c%c%c%c (%c%c%c) %d/%d/%d %02d:%02d %7llu - %s",
763 		    (int)sizeof(void *) * 2, vme->start, (int)sizeof(void *) * 2,
764 		    vme->end - (vme->start != vme->end ? 1 : 0), (unsigned long)sz,
765 		    (int)sizeof(void *) * 2, (unsigned long)vme->offset,
766 		    (vme->protection & VM_PROT_READ) ? 'r' : '-',
767 		    (vme->protection & VM_PROT_WRITE) ? 'w' : '-',
768 		    (vme->protection & VM_PROT_EXECUTE) ? 'x' : '-',
769 		    (vme->etype & UVM_ET_COPYONWRITE) ? 'p' : 's',
770 		    (vme->etype & UVM_ET_NEEDSCOPY) ? '+' : '-',
771 		    (vme->max_protection & VM_PROT_READ) ? 'r' : '-',
772 		    (vme->max_protection & VM_PROT_WRITE) ? 'w' : '-',
773 		    (vme->max_protection & VM_PROT_EXECUTE) ? 'x' : '-',
774 		    vme->inheritance, vme->wired_count, vme->advice,
775 		    major(dev), minor(dev), (unsigned long long)inode, name);
776 		if (A(vp))
777 			printf(" [%p]", P(vp));
778 		printf("\n");
779 	}
780 
781 	if (print_amap && vme->aref.ar_amap) {
782 		printf(" amap - ref: %d fl: 0x%x maxsl: %d nsl: %d nuse: %d\n",
783 		    D(amap, vm_amap)->am_ref,
784 		    D(amap, vm_amap)->am_flags,
785 		    D(amap, vm_amap)->am_maxslot,
786 		    D(amap, vm_amap)->am_nslot,
787 		    D(amap, vm_amap)->am_nused);
788 		if (sum) {
789 			sum->s_am_nslots += D(amap, vm_amap)->am_nslot;
790 			sum->s_am_maxslots += D(amap, vm_amap)->am_maxslot;
791 			sum->s_am_nusedslots += D(amap, vm_amap)->am_nused;
792 		}
793 	}
794 
795 	/* no access allowed, don't count space */
796 	if ((vme->protection & rwx) == 0)
797 		sz = 0;
798 
799 	return (sz);
800 }
801 
802 char *
803 findname(kvm_t *kd, struct kbit *vmspace,
804     struct vm_map_entry *vme, struct kbit *vp,
805     struct kbit *vfs, struct kbit *uvm_obj)
806 {
807 	static char buf[1024], *name;
808 	size_t l;
809 
810 	if (UVM_ET_ISOBJ(vme)) {
811 		if (A(vfs)) {
812 			l = strlen(D(vfs, mount)->mnt_stat.f_mntonname);
813 			switch (search_cache(kd, vp, &name, buf, sizeof(buf))) {
814 			case 0: /* found something */
815 				if (name - (1 + 11 + l) < buf)
816 					break;
817 				name--;
818 				*name = '/';
819 				/*FALLTHROUGH*/
820 			case 2: /* found nothing */
821 				name -= 11;
822 				memcpy(name, " -unknown- ", (size_t)11);
823 				name -= l;
824 				memcpy(name,
825 				    D(vfs, mount)->mnt_stat.f_mntonname, l);
826 				break;
827 			case 1: /* all is well */
828 				if (name - (1 + l) < buf)
829 					break;
830 				name--;
831 				*name = '/';
832 				if (l != 1) {
833 					name -= l;
834 					memcpy(name,
835 					    D(vfs, mount)->mnt_stat.f_mntonname, l);
836 				}
837 				break;
838 			}
839 		} else if (UVM_OBJ_IS_DEVICE(D(uvm_obj, uvm_object))) {
840 			struct kbit kdev;
841 			dev_t dev;
842 
843 			P(&kdev) = P(uvm_obj);
844 			S(&kdev) = sizeof(struct uvm_device);
845 			KDEREF(kd, &kdev);
846 			dev = D(&kdev, uvm_device)->u_device;
847 			name = devname(dev, S_IFCHR);
848 			if (name != NULL)
849 				snprintf(buf, sizeof(buf), "/dev/%s", name);
850 			else
851 				snprintf(buf, sizeof(buf), "  [ device %d,%d ]",
852 				    major(dev), minor(dev));
853 			name = buf;
854 		} else if (UVM_OBJ_IS_AOBJ(D(uvm_obj, uvm_object)))
855 			name = "  [ uvm_aobj ]";
856 		else if (UVM_OBJ_IS_VNODE(D(uvm_obj, uvm_object)))
857 			name = "  [ ?VNODE? ]";
858 		else {
859 			snprintf(buf, sizeof(buf), "  [ unknown (%p) ]",
860 			    D(uvm_obj, uvm_object)->pgops);
861 			name = buf;
862 		}
863 	} else if (D(vmspace, vmspace)->vm_maxsaddr <= (caddr_t)vme->start &&
864 	    (D(vmspace, vmspace)->vm_maxsaddr + (size_t)maxssiz) >=
865 	    (caddr_t)vme->end) {
866 		name = "  [ stack ]";
867 	} else if (D(vmspace, vmspace)->vm_daddr <= (caddr_t)vme->start &&
868 	    D(vmspace, vmspace)->vm_daddr + BRKSIZ >= (caddr_t)vme->end) {
869 		name = "  [ heap ]";
870 	} else if (UVM_ET_ISHOLE(vme))
871 		name = "  [ hole ]";
872 	else
873 		name = "  [ anon ]";
874 
875 	return (name);
876 }
877 
878 int
879 search_cache(kvm_t *kd, struct kbit *vp, char **name, char *buf, size_t blen)
880 {
881 	struct cache_entry *ce;
882 	struct kbit svp;
883 	char *o, *e;
884 	u_long cid;
885 
886 	P(&svp) = P(vp);
887 	S(&svp) = sizeof(struct vnode);
888 	cid = D(vp, vnode)->v_id;
889 
890 	e = &buf[blen - 1];
891 	o = e;
892 	do {
893 		LIST_FOREACH(ce, &lcache, ce_next)
894 			if (ce->ce_vp == P(&svp) && ce->ce_cid == cid)
895 				break;
896 		if (ce && ce->ce_vp == P(&svp) && ce->ce_cid == cid) {
897 			if (o != e)
898 				*(--o) = '/';
899 			if (o - ce->ce_nlen <= buf)
900 				break;
901 			o -= ce->ce_nlen;
902 			memcpy(o, ce->ce_name, ce->ce_nlen);
903 			P(&svp) = ce->ce_pvp;
904 			cid = ce->ce_pcid;
905 		} else
906 			break;
907 	} while (1/*CONSTCOND*/);
908 	*e = '\0';
909 	*name = o;
910 
911 	if (e == o)
912 		return (2);
913 
914 	KDEREF(kd, &svp);
915 	return (D(&svp, vnode)->v_flag & VROOT);
916 }
917 
918 static void __dead
919 usage(void)
920 {
921 	extern char *__progname;
922 	fprintf(stderr, "usage: %s [-AadlmPsv] [-D number] "
923 	    "[-M core] [-N system] [-p pid] [pid ...]\n",
924 	    __progname);
925 	exit(1);
926 }
927 
928 static pid_t
929 strtopid(const char *str)
930 {
931 	pid_t pid;
932 
933 	errno = 0;
934 	pid = (pid_t)strtonum(str, 0, INT_MAX, NULL);
935 	if (errno != 0)
936 		usage();
937 	return (pid);
938 }
939