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