1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2011 Mikolaj Golub 5 * Copyright (c) 2015 Allan Jude <allanjude@freebsd.org> 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 #include <sys/param.h> 31 #include <sys/time.h> 32 #include <sys/resource.h> 33 #include <sys/sysctl.h> 34 #include <sys/user.h> 35 36 #include <err.h> 37 #include <errno.h> 38 #include <libprocstat.h> 39 #include <libutil.h> 40 #include <limits.h> 41 #include <stdio.h> 42 #include <stdlib.h> 43 #include <string.h> 44 45 #include "procstat.h" 46 47 static struct { 48 const char *name; 49 const char *suffix; 50 } rlimit_param[15] = { 51 {"cputime", "sec"}, 52 {"filesize", "B "}, 53 {"datasize", "B "}, 54 {"stacksize", "B "}, 55 {"coredumpsize", "B "}, 56 {"memoryuse", "B "}, 57 {"memorylocked", "B "}, 58 {"maxprocesses", " "}, 59 {"openfiles", " "}, 60 {"sbsize", "B "}, 61 {"vmemoryuse", "B "}, 62 {"pseudo-terminals", " "}, 63 {"swapuse", "B "}, 64 {"kqueues", " "}, 65 {"umtxp", " "}, 66 }; 67 68 #if RLIM_NLIMITS > 15 69 #error "Resource limits have grown. Add new entries to rlimit_param[]." 70 #endif 71 72 static const char * 73 humanize_rlimit(int indx, rlim_t limit) 74 { 75 static char buf[14]; 76 int scale; 77 78 if (limit == RLIM_INFINITY) 79 return ("infinity "); 80 81 scale = humanize_number(buf, sizeof(buf) - 1, (int64_t)limit, 82 rlimit_param[indx].suffix, HN_AUTOSCALE | HN_GETSCALE, HN_DECIMAL); 83 (void)humanize_number(buf, sizeof(buf) - 1, (int64_t)limit, 84 rlimit_param[indx].suffix, HN_AUTOSCALE, HN_DECIMAL); 85 /* Pad with one space if there is no suffix prefix. */ 86 if (scale == 0) 87 sprintf(buf + strlen(buf), " "); 88 return (buf); 89 } 90 91 void 92 procstat_rlimit(struct procstat *prstat, struct kinfo_proc *kipp) 93 { 94 struct rlimit rlimit; 95 int i; 96 97 if ((procstat_opts & PS_OPT_NOHEADER) == 0) { 98 xo_emit("{T:/%5s %-16s %-16s %16s %16s}\n", 99 "PID", "COMM", "RLIMIT", "SOFT ", "HARD "); 100 } 101 xo_emit("{ek:process_id/%5d}{e:command/%-16s/%s}", kipp->ki_pid, 102 kipp->ki_comm); 103 for (i = 0; i < RLIM_NLIMITS; i++) { 104 if (procstat_getrlimit(prstat, kipp, i, &rlimit) == -1) 105 return; 106 xo_emit("{dk:process_id/%5d} {d:command/%-16s} " 107 "{d:rlimit_param/%-16s} ", kipp->ki_pid, kipp->ki_comm, 108 rlimit_param[i].name); 109 110 xo_open_container(rlimit_param[i].name); 111 if (rlimit.rlim_cur == RLIM_INFINITY) 112 xo_emit("{e:soft_limit/infinity}"); 113 else 114 xo_emit("{e:soft_limit/%U}", rlimit.rlim_cur); 115 116 if (rlimit.rlim_max == RLIM_INFINITY) 117 xo_emit("{e:hard_limit/infinity}"); 118 else 119 xo_emit("{e:hard_limit/%U}", rlimit.rlim_max); 120 xo_close_container(rlimit_param[i].name); 121 122 xo_emit("{d:rlim_cur/%16s} ", 123 humanize_rlimit(i, rlimit.rlim_cur)); 124 xo_emit("{d:rlim_max/%16s}\n", 125 humanize_rlimit(i, rlimit.rlim_max)); 126 } 127 } 128