1 /*-
2 * SPDX-License-Identifier: BSD-4-Clause
3 *
4 * Copyright (c) 1999 Adrian Chadd
5 * Copyright (c) 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * Jan-Simon Pendry.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
26 *
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * SUCH DAMAGE.
38 */
39
40 /*
41 * To get resource.h to include our rlimit_ident[] array of rlimit identifiers
42 */
43
44 #define _RLIMIT_IDENT
45
46 #include <sys/param.h>
47 #include <sys/lock.h>
48 #include <sys/mutex.h>
49 #include <sys/systm.h>
50 #include <sys/proc.h>
51 #include <sys/resourcevar.h>
52 #include <sys/resource.h>
53 #include <sys/sbuf.h>
54 #include <sys/types.h>
55 #include <sys/malloc.h>
56
57 #include <fs/pseudofs/pseudofs.h>
58 #include <fs/procfs/procfs.h>
59
60 _Static_assert(nitems(rlimit_ident) == RLIM_NLIMITS,
61 "resource.h RLIMIT_IDENT needs update");
62
63 int
procfs_doprocrlimit(PFS_FILL_ARGS)64 procfs_doprocrlimit(PFS_FILL_ARGS)
65 {
66 struct plimit *limp;
67 int i;
68
69 /*
70 * Obtain a private reference to resource limits
71 */
72
73 PROC_LOCK(p);
74 limp = lim_hold(p->p_limit);
75 PROC_UNLOCK(p);
76
77 for (i = 0; i < RLIM_NLIMITS; i++) {
78 /*
79 * Add the rlimit ident
80 */
81
82 sbuf_printf(sb, "%s ", rlimit_ident[i]);
83
84 /*
85 * Replace RLIM_INFINITY with -1 in the string
86 */
87
88 /*
89 * current limit
90 */
91
92 if (limp->pl_rlimit[i].rlim_cur == RLIM_INFINITY) {
93 sbuf_printf(sb, "-1 ");
94 } else {
95 sbuf_printf(sb, "%llu ",
96 (unsigned long long)limp->pl_rlimit[i].rlim_cur);
97 }
98
99 /*
100 * maximum limit
101 */
102
103 if (limp->pl_rlimit[i].rlim_max == RLIM_INFINITY) {
104 sbuf_printf(sb, "-1\n");
105 } else {
106 sbuf_printf(sb, "%llu\n",
107 (unsigned long long)limp->pl_rlimit[i].rlim_max);
108 }
109 }
110
111 lim_free(limp);
112 return (0);
113 }
114