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 * @(#)procfs_status.c 8.4 (Berkeley) 6/15/94
40 */
41
42 /*
43 * To get resource.h to include our rlimit_ident[] array of rlimit identifiers
44 */
45
46 #define _RLIMIT_IDENT
47
48 #include <sys/param.h>
49 #include <sys/lock.h>
50 #include <sys/mutex.h>
51 #include <sys/systm.h>
52 #include <sys/proc.h>
53 #include <sys/resourcevar.h>
54 #include <sys/resource.h>
55 #include <sys/sbuf.h>
56 #include <sys/types.h>
57 #include <sys/malloc.h>
58
59 #include <fs/pseudofs/pseudofs.h>
60 #include <fs/procfs/procfs.h>
61
62 int
procfs_doprocrlimit(PFS_FILL_ARGS)63 procfs_doprocrlimit(PFS_FILL_ARGS)
64 {
65 struct plimit *limp;
66 int i;
67
68 /*
69 * Obtain a private reference to resource limits
70 */
71
72 PROC_LOCK(p);
73 limp = lim_hold(p->p_limit);
74 PROC_UNLOCK(p);
75
76 for (i = 0; i < RLIM_NLIMITS; i++) {
77 /*
78 * Add the rlimit ident
79 */
80
81 sbuf_printf(sb, "%s ", rlimit_ident[i]);
82
83 /*
84 * Replace RLIM_INFINITY with -1 in the string
85 */
86
87 /*
88 * current limit
89 */
90
91 if (limp->pl_rlimit[i].rlim_cur == RLIM_INFINITY) {
92 sbuf_printf(sb, "-1 ");
93 } else {
94 sbuf_printf(sb, "%llu ",
95 (unsigned long long)limp->pl_rlimit[i].rlim_cur);
96 }
97
98 /*
99 * maximum limit
100 */
101
102 if (limp->pl_rlimit[i].rlim_max == RLIM_INFINITY) {
103 sbuf_printf(sb, "-1\n");
104 } else {
105 sbuf_printf(sb, "%llu\n",
106 (unsigned long long)limp->pl_rlimit[i].rlim_max);
107 }
108 }
109
110 lim_free(limp);
111 return (0);
112 }
113