2
* prlimit - get/set process resource limits.
4
* Copyright (C) 2011 Davidlohr Bueso <dave@gnu.org>
6
* This program is free software; you can redistribute it and/or modify
7
* it under the terms of the GNU General Public License as published by
8
* the Free Software Foundation; either version 2 of the License, or
9
* (at your option) any later version.
11
* This program is distributed in the hope that it will be useful,
12
* but WITHOUT ANY WARRANTY; without even the implied warranty of
13
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
* GNU General Public License for more details.
16
* You should have received a copy of the GNU General Public License along
17
* with this program; if not, write to the Free Software Foundation, Inc.,
18
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
28
#include <sys/resource.h>
30
#include <libsmartcols.h>
37
#include "closestream.h"
40
# define RLIMIT_RTTIME 15
62
/* basic output flags */
63
static int no_headings;
73
static struct prlimit_desc prlimit_desc[] =
75
[AS] = { "AS", N_("address space limit"), N_("bytes"), RLIMIT_AS },
76
[CORE] = { "CORE", N_("max core file size"), N_("blocks"), RLIMIT_CORE },
77
[CPU] = { "CPU", N_("CPU time"), N_("seconds"), RLIMIT_CPU },
78
[DATA] = { "DATA", N_("max data size"), N_("bytes"), RLIMIT_DATA },
79
[FSIZE] = { "FSIZE", N_("max file size"), N_("blocks"), RLIMIT_FSIZE },
80
[LOCKS] = { "LOCKS", N_("max number of file locks held"), NULL, RLIMIT_LOCKS },
81
[MEMLOCK] = { "MEMLOCK", N_("max locked-in-memory address space"), N_("bytes"), RLIMIT_MEMLOCK },
82
[MSGQUEUE] = { "MSGQUEUE", N_("max bytes in POSIX mqueues"), N_("bytes"), RLIMIT_MSGQUEUE },
83
[NICE] = { "NICE", N_("max nice prio allowed to raise"), NULL, RLIMIT_NICE },
84
[NOFILE] = { "NOFILE", N_("max number of open files"), NULL, RLIMIT_NOFILE },
85
[NPROC] = { "NPROC", N_("max number of processes"), NULL, RLIMIT_NPROC },
86
[RSS] = { "RSS", N_("max resident set size"), N_("pages"), RLIMIT_RSS },
87
[RTPRIO] = { "RTPRIO", N_("max real-time priority"), NULL, RLIMIT_RTPRIO },
88
[RTTIME] = { "RTTIME", N_("timeout for real-time tasks"), N_("microsecs"), RLIMIT_RTTIME },
89
[SIGPENDING] = { "SIGPENDING", N_("max number of pending signals"), NULL, RLIMIT_SIGPENDING },
90
[STACK] = { "STACK", N_("max stack size"), N_("bytes"), RLIMIT_STACK }
93
#define MAX_RESOURCES ARRAY_SIZE(prlimit_desc)
96
struct list_head lims;
99
struct prlimit_desc *desc;
100
int modify; /* PRLIMIT_{SOFT,HARD} mask */
103
#define PRLIMIT_EMPTY_LIMIT {{ 0, 0, }, NULL, 0 }
115
const char *name; /* header */
116
double whint; /* width hint (N < 1 is in percent of termwidth) */
117
int flags; /* SCOLS_FL_* */
121
/* columns descriptions */
122
struct colinfo infos[] = {
123
[COL_RES] = { "RESOURCE", 0.25, SCOLS_FL_TRUNC, N_("resource name") },
124
[COL_HELP] = { "DESCRIPTION", 0.1, SCOLS_FL_TRUNC, N_("resource description")},
125
[COL_SOFT] = { "SOFT", 0.1, SCOLS_FL_RIGHT, N_("soft limit")},
126
[COL_HARD] = { "HARD", 1, SCOLS_FL_RIGHT, N_("hard limit (ceiling)")},
127
[COL_UNITS] = { "UNITS", 0.1, SCOLS_FL_TRUNC, N_("units")},
130
static int columns[ARRAY_SIZE(infos) * 2];
135
#define INFINITY_STR "unlimited"
136
#define INFINITY_STRLEN (sizeof(INFINITY_STR) - 1)
138
#define PRLIMIT_SOFT (1 << 1)
139
#define PRLIMIT_HARD (1 << 2)
141
static pid_t pid; /* calling process (default) */
145
# include <sys/syscall.h>
146
static int prlimit(pid_t p, int resource,
147
const struct rlimit *new_limit,
148
struct rlimit *old_limit)
150
return syscall(SYS_prlimit64, p, resource, new_limit, old_limit);
154
static void __attribute__ ((__noreturn__)) usage(FILE * out)
158
fputs(USAGE_HEADER, out);
161
_(" %s [options] [-p PID]\n"), program_invocation_short_name);
163
_(" %s [options] COMMAND\n"), program_invocation_short_name);
165
fputs(_("\nGeneral Options:\n"), out);
166
fputs(_(" -p, --pid <pid> process id\n"
167
" -o, --output <list> define which output columns to use\n"
168
" --noheadings don't print headings\n"
169
" --raw use the raw output format\n"
170
" --verbose verbose output\n"
171
" -h, --help display this help and exit\n"
172
" -V, --version output version information and exit\n"), out);
174
fputs(_("\nResources Options:\n"), out);
175
fputs(_(" -c, --core maximum size of core files created\n"
176
" -d, --data maximum size of a process's data segment\n"
177
" -e, --nice maximum nice priority allowed to raise\n"
178
" -f, --fsize maximum size of files written by the process\n"
179
" -i, --sigpending maximum number of pending signals\n"
180
" -l, --memlock maximum size a process may lock into memory\n"
181
" -m, --rss maximum resident set size\n"
182
" -n, --nofile maximum number of open files\n"
183
" -q, --msgqueue maximum bytes in POSIX message queues\n"
184
" -r, --rtprio maximum real-time scheduling priority\n"
185
" -s, --stack maximum stack size\n"
186
" -t, --cpu maximum amount of CPU time in seconds\n"
187
" -u, --nproc maximum number of user processes\n"
188
" -v, --as size of virtual memory\n"
189
" -x, --locks maximum number of file locks\n"
190
" -y, --rttime CPU time in microseconds a process scheduled\n"
191
" under real-time scheduling\n"), out);
193
fputs(_("\nAvailable columns (for --output):\n"), out);
195
for (i = 0; i < ARRAY_SIZE(infos); i++)
196
fprintf(out, " %11s %s\n", infos[i].name, _(infos[i].help));
198
fprintf(out, USAGE_MAN_TAIL("prlimit(1)"));
200
exit(out == stderr ? EXIT_FAILURE : EXIT_SUCCESS);
203
static inline int get_column_id(int num)
205
assert(num < ncolumns);
206
assert(columns[num] < (int) ARRAY_SIZE(infos));
211
static inline struct colinfo *get_column_info(unsigned num)
213
return &infos[ get_column_id(num) ];
216
static void add_scols_line(struct libscols_table *table, struct prlimit *l)
219
struct libscols_line *line;
224
line = scols_table_new_line(table, NULL);
226
err(EXIT_FAILURE, _("failed to initialize output line"));
228
for (i = 0; i < ncolumns; i++) {
231
switch (get_column_id(i)) {
233
str = xstrdup(l->desc->name);
236
str = xstrdup(l->desc->help);
239
if (l->rlim.rlim_cur == RLIM_INFINITY)
240
str = xstrdup(_("unlimited"));
242
xasprintf(&str, "%llu", (unsigned long long) l->rlim.rlim_cur);
245
if (l->rlim.rlim_max == RLIM_INFINITY)
246
str = xstrdup(_("unlimited"));
248
xasprintf(&str, "%llu", (unsigned long long) l->rlim.rlim_max);
251
str = l->desc->unit ? xstrdup(_(l->desc->unit)) : NULL;
258
scols_line_refer_data(line, i, str);
262
static int column_name_to_id(const char *name, size_t namesz)
268
for (i = 0; i < ARRAY_SIZE(infos); i++) {
269
const char *cn = infos[i].name;
271
if (!strncasecmp(name, cn, namesz) && !*(cn + namesz))
274
warnx(_("unknown column: %s"), name);
278
static void rem_prlim(struct prlimit *lim)
282
list_del(&lim->lims);
286
static int show_limits(struct list_head *lims)
289
struct list_head *p, *pnext;
290
struct libscols_table *table;
292
table = scols_new_table();
294
err(EXIT_FAILURE, _("failed to initialize output table"));
296
scols_table_enable_raw(table, raw);
297
scols_table_enable_noheadings(table, no_headings);
299
for (i = 0; i < ncolumns; i++) {
300
struct colinfo *col = get_column_info(i);
302
if (!scols_table_new_column(table, col->name, col->whint, col->flags))
303
err(EXIT_FAILURE, _("failed to initialize output column"));
307
list_for_each_safe(p, pnext, lims) {
308
struct prlimit *lim = list_entry(p, struct prlimit, lims);
310
add_scols_line(table, lim);
314
scols_print_table(table);
315
scols_unref_table(table);
320
* If one of the limits is unknown (default value for not being passed), we
321
* need to get the current limit and use it. I see no other way other than
324
static void get_unknown_hardsoft(struct prlimit *lim)
328
if (prlimit(pid, lim->desc->resource, NULL, &old) == -1)
329
err(EXIT_FAILURE, _("failed to get old %s limit"),
332
if (!(lim->modify & PRLIMIT_SOFT))
333
lim->rlim.rlim_cur = old.rlim_cur;
334
else if (!(lim->modify & PRLIMIT_HARD))
335
lim->rlim.rlim_max = old.rlim_max;
338
static void do_prlimit(struct list_head *lims)
340
struct list_head *p, *pnext;
342
list_for_each_safe(p, pnext, lims) {
343
struct rlimit *new = NULL, *old = NULL;
344
struct prlimit *lim = list_entry(p, struct prlimit, lims);
347
if (lim->modify != (PRLIMIT_HARD | PRLIMIT_SOFT))
348
get_unknown_hardsoft(lim);
350
if ((lim->rlim.rlim_cur > lim->rlim.rlim_max) &&
351
(lim->rlim.rlim_cur != RLIM_INFINITY ||
352
lim->rlim.rlim_max != RLIM_INFINITY))
353
errx(EXIT_FAILURE, _("the soft limit %s cannot exceed the hard limit"),
359
if (verbose && new) {
360
printf(_("New %s limit: "), lim->desc->name);
361
if (new->rlim_cur == RLIM_INFINITY)
362
printf("<%s", _("unlimited"));
364
printf("<%ju", new->rlim_cur);
366
if (new->rlim_max == RLIM_INFINITY)
367
printf(":%s>\n", _("unlimited"));
369
printf(":%ju>\n", new->rlim_max);
372
if (prlimit(pid, lim->desc->resource, new, old) == -1)
373
err(EXIT_FAILURE, lim->modify ?
374
_("failed to set the %s resource limit") :
375
_("failed to get the %s resource limit"),
379
rem_prlim(lim); /* modify only; don't show */
383
static int get_range(char *str, rlim_t *soft, rlim_t *hard, int *found)
391
*soft = *hard = RLIM_INFINITY;
393
if (!strcmp(str, INFINITY_STR)) { /* <unlimited> */
394
*found |= PRLIMIT_SOFT | PRLIMIT_HARD;
397
} else if (*str == ':') { /* <:hard> */
400
if (strcmp(str, INFINITY_STR) != 0) {
401
*hard = strtoull(str, &end, 10);
403
if (errno || !end || *end || end == str)
406
*found |= PRLIMIT_HARD;
411
if (strncmp(str, INFINITY_STR, INFINITY_STRLEN) == 0) {
412
/* <unlimited> or <unlimited:> */
413
end = str + INFINITY_STRLEN;
415
/* <value> or <soft:> */
416
*hard = *soft = strtoull(str, &end, 10);
417
if (errno || !end || end == str)
421
if (*end == ':' && !*(end + 1)) /* <soft:> */
422
*found |= PRLIMIT_SOFT;
424
else if (*end == ':') { /* <soft:hard> */
427
if (!strcmp(str, INFINITY_STR))
428
*hard = RLIM_INFINITY;
432
*hard = strtoull(str, &end, 10);
434
if (errno || !end || *end || end == str)
437
*found |= PRLIMIT_SOFT | PRLIMIT_HARD;
440
*found |= PRLIMIT_SOFT | PRLIMIT_HARD;
446
static int parse_prlim(struct rlimit *lim, char *ops, size_t id)
451
if (get_range(ops, &soft, &hard, &found))
452
errx(EXIT_FAILURE, _("failed to parse %s limit"),
453
prlimit_desc[id].name);
455
lim->rlim_cur = soft;
456
lim->rlim_max = hard;
461
static int add_prlim(char *ops, struct list_head *lims, size_t id)
463
struct prlimit *lim = xcalloc(1, sizeof(*lim));
465
INIT_LIST_HEAD(&lim->lims);
466
lim->desc = &prlimit_desc[id];
469
lim->modify = parse_prlim(&lim->rlim, ops, id);
471
list_add_tail(&lim->lims, lims);
475
int main(int argc, char **argv)
478
struct list_head lims;
481
VERBOSE_OPTION = CHAR_MAX + 1,
486
static const struct option longopts[] = {
487
{ "pid", required_argument, NULL, 'p' },
488
{ "output", required_argument, NULL, 'o' },
489
{ "as", optional_argument, NULL, 'v' },
490
{ "core", optional_argument, NULL, 'c' },
491
{ "cpu", optional_argument, NULL, 't' },
492
{ "data", optional_argument, NULL, 'd' },
493
{ "fsize", optional_argument, NULL, 'f' },
494
{ "locks", optional_argument, NULL, 'x' },
495
{ "memlock", optional_argument, NULL, 'l' },
496
{ "msgqueue", optional_argument, NULL, 'q' },
497
{ "nice", optional_argument, NULL, 'e' },
498
{ "nofile", optional_argument, NULL, 'n' },
499
{ "nproc", optional_argument, NULL, 'u' },
500
{ "rss", optional_argument, NULL, 'm' },
501
{ "rtprio", optional_argument, NULL, 'r' },
502
{ "rttime", optional_argument, NULL, 'y' },
503
{ "sigpending", optional_argument, NULL, 'i' },
504
{ "stack", optional_argument, NULL, 's' },
505
{ "version", no_argument, NULL, 'V' },
506
{ "help", no_argument, NULL, 'h' },
507
{ "noheadings", no_argument, NULL, NOHEADINGS_OPTION },
508
{ "raw", no_argument, NULL, RAW_OPTION },
509
{ "verbose", no_argument, NULL, VERBOSE_OPTION },
513
setlocale(LC_ALL, "");
514
bindtextdomain(PACKAGE, LOCALEDIR);
516
atexit(close_stdout);
518
INIT_LIST_HEAD(&lims);
521
* Something is very wrong if this doesn't succeed,
522
* assuming STACK is the last resource, of course.
524
assert(MAX_RESOURCES == STACK + 1);
526
while((opt = getopt_long(argc, argv,
527
"+c::d::e::f::i::l::m::n::q::r::s::t::u::v::x::y::p:o:vVh",
528
longopts, NULL)) != -1) {
531
add_prlim(optarg, &lims, CORE);
534
add_prlim(optarg, &lims, DATA);
537
add_prlim(optarg, &lims, NICE);
540
add_prlim(optarg, &lims, FSIZE);
543
add_prlim(optarg, &lims, SIGPENDING);
546
add_prlim(optarg, &lims, MEMLOCK);
549
add_prlim(optarg, &lims, RSS);
552
add_prlim(optarg, &lims, NOFILE);
555
add_prlim(optarg, &lims, MSGQUEUE);
558
add_prlim(optarg, &lims, RTPRIO);
561
add_prlim(optarg, &lims, STACK);
564
add_prlim(optarg, &lims, CPU);
567
add_prlim(optarg, &lims, NPROC);
570
add_prlim(optarg, &lims, AS);
573
add_prlim(optarg, &lims, LOCKS);
576
add_prlim(optarg, &lims, RTTIME);
581
errx(EXIT_FAILURE, _("option --pid may be specified only once"));
582
pid = strtos32_or_err(optarg, _("invalid PID argument"));
587
ncolumns = string_to_idarray(optarg,
588
columns, ARRAY_SIZE(columns),
594
printf(UTIL_LINUX_VERSION);
597
case NOHEADINGS_OPTION:
611
if (argc > optind && pid)
612
errx(EXIT_FAILURE, _("options --pid and COMMAND are mutually exclusive"));
614
/* default columns */
615
columns[ncolumns++] = COL_RES;
616
columns[ncolumns++] = COL_HELP;
617
columns[ncolumns++] = COL_SOFT;
618
columns[ncolumns++] = COL_HARD;
619
columns[ncolumns++] = COL_UNITS;
624
if (list_empty(&lims)) {
625
/* default is to print all resources */
628
for (n = 0; n < MAX_RESOURCES; n++)
629
add_prlim(NULL, &lims, n);
634
if (!list_empty(&lims))
638
/* prlimit [options] COMMAND */
639
execvp(argv[optind], &argv[optind]);
640
err(EXIT_FAILURE, _("failed to execute %s"), argv[optind]);