xref: /freebsd/usr.bin/procstat/procstat_rusage.c (revision 179fa75e6e218d71a85a6b17ccc231036a148543)
1dc0aa067SJohn Baldwin /*-
2*179fa75eSJohn Baldwin  * Copyright (c) 2012 Hudson River Trading LLC
3dc0aa067SJohn Baldwin  * Written by: John H. Baldwin <jhb@FreeBSD.org>
4dc0aa067SJohn Baldwin  * All rights reserved.
5dc0aa067SJohn Baldwin  *
6dc0aa067SJohn Baldwin  * Redistribution and use in source and binary forms, with or without
7dc0aa067SJohn Baldwin  * modification, are permitted provided that the following conditions
8dc0aa067SJohn Baldwin  * are met:
9dc0aa067SJohn Baldwin  * 1. Redistributions of source code must retain the above copyright
10dc0aa067SJohn Baldwin  *    notice, this list of conditions and the following disclaimer.
11dc0aa067SJohn Baldwin  * 2. Redistributions in binary form must reproduce the above copyright
12dc0aa067SJohn Baldwin  *    notice, this list of conditions and the following disclaimer in the
13dc0aa067SJohn Baldwin  *    documentation and/or other materials provided with the distribution.
14dc0aa067SJohn Baldwin  *
15dc0aa067SJohn Baldwin  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16dc0aa067SJohn Baldwin  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17dc0aa067SJohn Baldwin  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18dc0aa067SJohn Baldwin  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19dc0aa067SJohn Baldwin  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20dc0aa067SJohn Baldwin  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21dc0aa067SJohn Baldwin  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22dc0aa067SJohn Baldwin  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23dc0aa067SJohn Baldwin  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24dc0aa067SJohn Baldwin  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25dc0aa067SJohn Baldwin  * SUCH DAMAGE.
26dc0aa067SJohn Baldwin  */
27dc0aa067SJohn Baldwin 
28dc0aa067SJohn Baldwin #include <sys/cdefs.h>
29dc0aa067SJohn Baldwin __FBSDID("$FreeBSD$");
30dc0aa067SJohn Baldwin 
31dc0aa067SJohn Baldwin #include <sys/param.h>
32dc0aa067SJohn Baldwin #include <sys/sysctl.h>
33dc0aa067SJohn Baldwin #include <sys/user.h>
34dc0aa067SJohn Baldwin 
35dc0aa067SJohn Baldwin #include <libprocstat.h>
36dc0aa067SJohn Baldwin #include <stdbool.h>
37dc0aa067SJohn Baldwin #include <stdio.h>
38dc0aa067SJohn Baldwin #include <libutil.h>
39dc0aa067SJohn Baldwin 
40dc0aa067SJohn Baldwin #include "procstat.h"
41dc0aa067SJohn Baldwin 
42dc0aa067SJohn Baldwin static struct {
43dc0aa067SJohn Baldwin 	const char *ri_name;
44dc0aa067SJohn Baldwin 	bool	ri_humanize;
45dc0aa067SJohn Baldwin 	int	ri_scale;
46dc0aa067SJohn Baldwin } rusage_info[] = {
47dc0aa067SJohn Baldwin 	{ "maximum RSS", true, 1 },
48dc0aa067SJohn Baldwin 	{ "integral shared memory", true, 1 },
49dc0aa067SJohn Baldwin 	{ "integral unshared data", true, 1 },
50dc0aa067SJohn Baldwin 	{ "integral unshared stack", true, 1 },
51dc0aa067SJohn Baldwin 	{ "page reclaims", false, 0 },
52dc0aa067SJohn Baldwin 	{ "page faults", false, 0 },
53dc0aa067SJohn Baldwin 	{ "swaps", false, 0 },
54dc0aa067SJohn Baldwin 	{ "block reads", false, 0 },
55dc0aa067SJohn Baldwin 	{ "block writes", false, 0 },
56dc0aa067SJohn Baldwin 	{ "messages sent", false, 0 },
57dc0aa067SJohn Baldwin 	{ "messages received", false, 0 },
58dc0aa067SJohn Baldwin 	{ "signals received", false, 0 },
59dc0aa067SJohn Baldwin 	{ "voluntary context switches", false, 0 },
60dc0aa067SJohn Baldwin 	{ "involuntary context switches", false, 0 }
61dc0aa067SJohn Baldwin };
62dc0aa067SJohn Baldwin 
63dc0aa067SJohn Baldwin /* xxx days hh:mm:ss.uuuuuu */
64dc0aa067SJohn Baldwin static const char *
65dc0aa067SJohn Baldwin format_time(struct timeval *tv)
66dc0aa067SJohn Baldwin {
67dc0aa067SJohn Baldwin 	static char buffer[32];
68dc0aa067SJohn Baldwin 	int days, hours, minutes, seconds, used;
69dc0aa067SJohn Baldwin 
70dc0aa067SJohn Baldwin 	minutes = tv->tv_sec / 60;
71dc0aa067SJohn Baldwin 	seconds = tv->tv_sec % 60;
72dc0aa067SJohn Baldwin 	hours = minutes / 60;
73dc0aa067SJohn Baldwin 	minutes %= 60;
74dc0aa067SJohn Baldwin 	days = hours / 24;
75dc0aa067SJohn Baldwin 	hours %= 24;
76dc0aa067SJohn Baldwin 	used = 0;
77dc0aa067SJohn Baldwin 	if (days == 1)
78dc0aa067SJohn Baldwin 		used += snprintf(buffer, sizeof(buffer), "1 day ");
79dc0aa067SJohn Baldwin 	else if (days > 0)
80dc0aa067SJohn Baldwin 		used += snprintf(buffer, sizeof(buffer), "%u days ", days);
81dc0aa067SJohn Baldwin 
82dc0aa067SJohn Baldwin 	snprintf(buffer + used, sizeof(buffer) - used, "%02u:%02u:%02u.%06u   ",
83dc0aa067SJohn Baldwin 	    hours, minutes, seconds, (unsigned int)tv->tv_usec);
84dc0aa067SJohn Baldwin 	return (buffer);
85dc0aa067SJohn Baldwin }
86dc0aa067SJohn Baldwin 
87dc0aa067SJohn Baldwin static const char *
88dc0aa067SJohn Baldwin format_value(long value, bool humanize, int scale)
89dc0aa067SJohn Baldwin {
90dc0aa067SJohn Baldwin 	static char buffer[14];
91dc0aa067SJohn Baldwin 
92dc0aa067SJohn Baldwin 	if (scale != 0)
93dc0aa067SJohn Baldwin 		value <<= scale * 10;
94dc0aa067SJohn Baldwin 	if (humanize)
95dc0aa067SJohn Baldwin 		humanize_number(buffer, sizeof(buffer), value, "B",
96dc0aa067SJohn Baldwin 		    scale, HN_DECIMAL);
97dc0aa067SJohn Baldwin 	else
98dc0aa067SJohn Baldwin 		snprintf(buffer, sizeof(buffer), "%ld   ", value);
99dc0aa067SJohn Baldwin 	return (buffer);
100dc0aa067SJohn Baldwin }
101dc0aa067SJohn Baldwin 
102dc0aa067SJohn Baldwin static void
103dc0aa067SJohn Baldwin print_prefix(struct kinfo_proc *kipp)
104dc0aa067SJohn Baldwin {
105dc0aa067SJohn Baldwin 
106dc0aa067SJohn Baldwin 	printf("%5d ", kipp->ki_pid);
107dc0aa067SJohn Baldwin 	if (Hflag)
108dc0aa067SJohn Baldwin 		printf("%6d ", kipp->ki_tid);
109dc0aa067SJohn Baldwin 	printf("%-16s ", kipp->ki_comm);
110dc0aa067SJohn Baldwin }
111dc0aa067SJohn Baldwin 
112dc0aa067SJohn Baldwin static void
113dc0aa067SJohn Baldwin print_rusage(struct kinfo_proc *kipp)
114dc0aa067SJohn Baldwin {
115dc0aa067SJohn Baldwin 	long *lp;
116dc0aa067SJohn Baldwin 	unsigned int i;
117dc0aa067SJohn Baldwin 
118dc0aa067SJohn Baldwin 	print_prefix(kipp);
119dc0aa067SJohn Baldwin 	printf("%-14s %32s\n", "user time",
120dc0aa067SJohn Baldwin 	    format_time(&kipp->ki_rusage.ru_utime));
121dc0aa067SJohn Baldwin 	print_prefix(kipp);
122dc0aa067SJohn Baldwin 	printf("%-14s %32s\n", "system time",
123dc0aa067SJohn Baldwin 	    format_time(&kipp->ki_rusage.ru_stime));
124dc0aa067SJohn Baldwin 	lp = &kipp->ki_rusage.ru_maxrss;
125dc0aa067SJohn Baldwin 	for (i = 0; i < nitems(rusage_info); i++) {
126dc0aa067SJohn Baldwin 		print_prefix(kipp);
127dc0aa067SJohn Baldwin 		printf("%-32s %14s\n", rusage_info[i].ri_name,
128dc0aa067SJohn Baldwin 		    format_value(*lp, rusage_info[i].ri_humanize,
129dc0aa067SJohn Baldwin 			rusage_info[i].ri_scale));
130dc0aa067SJohn Baldwin 		lp++;
131dc0aa067SJohn Baldwin 	}
132dc0aa067SJohn Baldwin }
133dc0aa067SJohn Baldwin 
134dc0aa067SJohn Baldwin void
135dc0aa067SJohn Baldwin procstat_rusage(struct procstat *procstat, struct kinfo_proc *kipp)
136dc0aa067SJohn Baldwin {
137dc0aa067SJohn Baldwin 	struct kinfo_proc *kip;
138dc0aa067SJohn Baldwin 	unsigned int count, i;
139dc0aa067SJohn Baldwin 
140dc0aa067SJohn Baldwin 	if (!hflag) {
141dc0aa067SJohn Baldwin 		printf("%5s ", "PID");
142dc0aa067SJohn Baldwin 		if (Hflag)
143dc0aa067SJohn Baldwin 			printf("%6s ", "TID");
14427705da4SJohn Baldwin 		printf("%-16s %-32s %14s\n", "COMM", "RESOURCE",
14527705da4SJohn Baldwin 		    "VALUE        ");
146dc0aa067SJohn Baldwin 	}
147dc0aa067SJohn Baldwin 
148dc0aa067SJohn Baldwin 	if (!Hflag) {
149dc0aa067SJohn Baldwin 		print_rusage(kipp);
150dc0aa067SJohn Baldwin 		return;
151dc0aa067SJohn Baldwin 	}
152dc0aa067SJohn Baldwin 
153dc0aa067SJohn Baldwin 	kip = procstat_getprocs(procstat, KERN_PROC_PID | KERN_PROC_INC_THREAD,
154dc0aa067SJohn Baldwin 	    kipp->ki_pid, &count);
155dc0aa067SJohn Baldwin 	if (kip == NULL)
156dc0aa067SJohn Baldwin 		return;
157dc0aa067SJohn Baldwin 	kinfo_proc_sort(kip, count);
158dc0aa067SJohn Baldwin 	for (i = 0; i < count; i++)
159dc0aa067SJohn Baldwin 		print_rusage(&kip[i]);
160dc0aa067SJohn Baldwin 	procstat_freeprocs(procstat, kip);
161dc0aa067SJohn Baldwin }
162