4 * cc -I/usr/src/sys psinfo.c -o ~/bin/psinfo -lkvm
6 * Dump information about processes and threads in the system.
8 * Copyright (c) 2019 The DragonFly Project. All rights reserved.
10 * This code is derived from software contributed to The DragonFly Project
11 * by Matthew Dillon <dillon@backplane.com>
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
17 * 1. Redistributions of source code must retain the above copyright
18 * notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in
21 * the documentation and/or other materials provided with the
23 * 3. Neither the name of The DragonFly Project nor the names of its
24 * contributors may be used to endorse or promote products derived
25 * from this software without specific, prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
29 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
30 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
31 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
32 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
33 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
34 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
35 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
36 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
37 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 #define _KERNEL_STRUCTURES_
42 #include <sys/param.h>
44 #include <sys/malloc.h>
45 #include <sys/signalvar.h>
46 #include <sys/vnode.h>
47 #include <sys/namecache.h>
48 #include <sys/sysctl.h>
49 #include <sys/thread.h>
53 #include <vm/vm_page.h>
54 #include <vm/vm_kern.h>
55 #include <vm/vm_object.h>
56 #include <vm/vm_map.h>
57 #include <vm/swap_pager.h>
58 #include <vm/vnode_pager.h>
76 vm_offset_t total_empty
;
77 vm_offset_t total_used
;
78 vm_offset_t total_used_byid
[VM_SUBSYS_LIMIT
];
81 static const char *formatnum(int64_t value
);
82 static const char *entryid(vm_subsys_t id
);
83 static void mapscan(kvm_t
*kd
, vm_map_entry_t kptr
, vm_map_entry_t ken
,
86 static void kkread(kvm_t
*kd
, u_long addr
, void *buf
, size_t nbytes
);
88 static void dumpproc(kvm_t
*kd
, struct kinfo_proc
*kp
);
91 main(int ac
, char **av
)
93 const char *corefile
= NULL
;
94 const char *sysfile
= NULL
;
100 struct vm_map_entry entry
;
101 struct vm_map_entry
*kptr
;
102 struct kinfo_proc
*kp
;
104 while ((ch
= getopt(ac
, av
, "M:N:dv")) != -1) {
119 fprintf(stderr
, "%s [-M core] [-N system]\n", av
[0]);
126 if ((kd
= kvm_open(sysfile
, corefile
, NULL
, O_RDONLY
, "kvm:")) == NULL
) {
130 if (kvm_nlist(kd
, Nl
) != 0) {
135 kp
= kvm_getprocs(kd
, KERN_PROC_ALL
, 0, &count
);
136 for (i
= 0; i
< count
; ++i
) {
137 dumpproc(kd
, &kp
[i
]);
164 dumpproc(kvm_t
*kd
, struct kinfo_proc
*kp
)
168 struct vm_map_entry entry
;
169 struct vm_map_backing
*ba
;
170 struct vm_object obj
;
174 printf("Process %6d:%-3d %6.6s (%s)",
175 kp
->kp_pid
, kp
->kp_lwp
.kl_tid
,
176 kp
->kp_lwp
.kl_wmesg
, kp
->kp_comm
);
178 if ((int)kp
->kp_pid
<= 0) {
182 kkread(kd
, (u_long
)kp
->kp_paddr
, &p
, sizeof(p
));
183 kkread(kd
, (u_long
)p
.p_vmspace
, &vms
, sizeof(vms
));
185 printf(" (%6.2fM resident, %6.2f wired)\n",
186 vms
.vm_pmap
.pm_stats
.resident_count
* 4096.0 / 1048576.0,
187 vms
.vm_pmap
.pm_stats
.wired_count
* 4096.0 / 1048576.0);
189 kptr
= kvm_vm_map_entry_first(kd
, &vms
.vm_map
, &entry
);
192 printf(" entry %016jx-%016jx eflags=%04x prot=%02x max_prot=%02x",
193 entry
.ba
.start
, entry
.ba
.end
,
194 entry
.eflags
, entry
.protection
, entry
.max_protection
);
198 if (++bacount
== 3) {
202 printf(" [obj=%016jx,off=%016jx",
203 (uintptr_t)ba
->object
, ba
->offset
);
205 kkread(kd
, (u_long
)ba
->object
, &obj
, sizeof(obj
));
206 if (obj
.flags
& OBJ_DEAD
)
211 if (ba
->backing_ba
== NULL
)
213 kkread(kd
, (u_long
)ba
->backing_ba
, ba
, sizeof(*ba
));
216 kptr
= kvm_vm_map_entry_next(kd
, kptr
, &entry
);
223 kkread(kd
, Nl
[0].n_value
, &kmap
, sizeof(kmap
));
224 last
= kmap
.min_addr
;
226 kptr
= kvm_vm_map_entry_first(kd
, &kmap
, &entry
);
228 mapscan(kd
, kptr
, &entry
, &last
);
229 kptr
= kvm_vm_map_entry_next(kd
, kptr
, &entry
);
232 printf("%4ldM 0x%016jx %08lx-%08lx (%6s) EMPTY\n",
233 total_used
/ 1024 / 1024,
236 formatnum(kmap
.max_addr
- last
));
237 total_empty
+= kmap
.max_addr
- last
;
239 printf("-----------------------------------------------\n");
240 for (i
= 0; i
< VM_SUBSYS_LIMIT
; ++i
)
241 printf("Total-id: %9s %s\n", entryid(i
), formatnum(total_used_byid
[i
]));
243 printf("-----------------------------------------------\n");
244 printf("Total empty space: %s\n", formatnum(total_empty
));
245 printf("Total used space: %s\n", formatnum(total_used
));
249 formatnum(int64_t value
)
262 if (value
< 100000) {
265 } else if (value
< 1 * 1024 * 1024) {
268 } else if (value
< 1024 * 1024 * 1024) {
271 } else if (value
< 1024LL * 1024 * 1024 * 1024) {
272 div
= 1024 * 1024 * 1024;
275 div
= 1024LL * 1024 * 1024 * 1024;
279 snprintf(buf
, sizeof(buf
), "");
280 } else if (div
== 1) {
281 snprintf(buf
, sizeof(buf
), "%s%7.0f%s",
283 (double)value
/ (double)div
,
286 snprintf(buf
, sizeof(buf
), "%s%6.2f%s",
288 (double)value
/ (double)div
,
295 mapscan(kvm_t
*kd
, vm_map_entry_t kptr
, vm_map_entry_t ken
, vm_offset_t
*lastp
)
297 if (*lastp
!= ken
->ba
.start
) {
298 printf("%4ldM %p %08lx-%08lx (%s) EMPTY\n",
299 total_used
/ 1024 / 1024,
301 *lastp
, ken
->ba
.start
,
302 formatnum(ken
->ba
.start
- *lastp
));
303 total_empty
+= ken
->ba
.start
- *lastp
;
305 printf("%4ldM %p %08lx-%08lx (%6ldK) id=%-8s object=%p\n",
306 total_used
/ 1024 / 1024,
308 ken
->ba
.start
, ken
->ba
.end
,
309 (ken
->ba
.end
- ken
->ba
.start
) / 1024,
311 ken
->object
.map_object
);
312 total_used
+= ken
->ba
.end
- ken
->ba
.start
;
313 if (ken
->id
< VM_SUBSYS_LIMIT
)
314 total_used_byid
[ken
->id
] += ken
->ba
.end
- ken
->ba
.start
;
316 total_used_byid
[0] += ken
->ba
.end
- ken
->ba
.start
;
317 *lastp
= ken
->ba
.end
;
322 entryid(vm_subsys_t id
)
327 case VM_SUBSYS_UNKNOWN
:
329 case VM_SUBSYS_KMALLOC
:
331 case VM_SUBSYS_STACK
:
333 case VM_SUBSYS_IMGACT
:
337 case VM_SUBSYS_RESERVED
:
345 case VM_SUBSYS_SHMEM
:
347 case VM_SUBSYS_SYSMAP
:
353 case VM_SUBSYS_BOGUS
:
357 case VM_SUBSYS_BUFDATA
:
363 case VM_SUBSYS_PVENTRY
:
367 case VM_SUBSYS_MAPDEV
:
369 case VM_SUBSYS_ZALLOC
:
374 case VM_SUBSYS_CONTIG
:
378 case VM_SUBSYS_DRM_GEM
:
380 case VM_SUBSYS_DRM_SCAT
:
382 case VM_SUBSYS_DRM_VMAP
:
384 case VM_SUBSYS_DRM_TTM
:
386 case VM_SUBSYS_HAMMER
:
388 case VM_SUBSYS_VMPGHASH
:
393 snprintf(buf
, sizeof(buf
), "%d", (int)id
);
401 kkread(kvm_t
*kd
, u_long addr
, void *buf
, size_t nbytes
)
403 if (kvm_read(kd
, addr
, buf
, nbytes
) != nbytes
) {