]> git.ipfire.org Git - thirdparty/systemd.git/blob - src/basic/rlimit-util.c
Merge pull request #2569 from zonque/removals
[thirdparty/systemd.git] / src / basic / rlimit-util.c
1 /***
2 This file is part of systemd.
3
4 Copyright 2010 Lennart Poettering
5
6 systemd is free software; you can redistribute it and/or modify it
7 under the terms of the GNU Lesser General Public License as published by
8 the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version.
10
11 systemd is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
15
16 You should have received a copy of the GNU Lesser General Public License
17 along with systemd; If not, see <http://www.gnu.org/licenses/>.
18 ***/
19
20 #include <errno.h>
21 #include <sys/resource.h>
22
23 #include "alloc-util.h"
24 #include "extract-word.h"
25 #include "formats-util.h"
26 #include "macro.h"
27 #include "missing.h"
28 #include "rlimit-util.h"
29 #include "string-table.h"
30 #include "time-util.h"
31
32 int setrlimit_closest(int resource, const struct rlimit *rlim) {
33 struct rlimit highest, fixed;
34
35 assert(rlim);
36
37 if (setrlimit(resource, rlim) >= 0)
38 return 0;
39
40 if (errno != EPERM)
41 return -errno;
42
43 /* So we failed to set the desired setrlimit, then let's try
44 * to get as close as we can */
45 assert_se(getrlimit(resource, &highest) == 0);
46
47 fixed.rlim_cur = MIN(rlim->rlim_cur, highest.rlim_max);
48 fixed.rlim_max = MIN(rlim->rlim_max, highest.rlim_max);
49
50 if (setrlimit(resource, &fixed) < 0)
51 return -errno;
52
53 return 0;
54 }
55
56 static int rlimit_parse_u64(const char *val, rlim_t *ret) {
57 uint64_t u;
58 int r;
59
60 assert(val);
61 assert(ret);
62
63 if (streq(val, "infinity")) {
64 *ret = RLIM_INFINITY;
65 return 0;
66 }
67
68 /* setrlimit(2) suggests rlim_t is always 64bit on Linux. */
69 assert_cc(sizeof(rlim_t) == sizeof(uint64_t));
70
71 r = safe_atou64(val, &u);
72 if (r < 0)
73 return r;
74 if (u >= (uint64_t) RLIM_INFINITY)
75 return -ERANGE;
76
77 *ret = (rlim_t) u;
78 return 0;
79 }
80
81 static int rlimit_parse_size(const char *val, rlim_t *ret) {
82 uint64_t u;
83 int r;
84
85 assert(val);
86 assert(ret);
87
88 if (streq(val, "infinity")) {
89 *ret = RLIM_INFINITY;
90 return 0;
91 }
92
93 r = parse_size(val, 1024, &u);
94 if (r < 0)
95 return r;
96 if (u >= (uint64_t) RLIM_INFINITY)
97 return -ERANGE;
98
99 *ret = (rlim_t) u;
100 return 0;
101 }
102
103 static int rlimit_parse_sec(const char *val, rlim_t *ret) {
104 uint64_t u;
105 usec_t t;
106 int r;
107
108 assert(val);
109 assert(ret);
110
111 if (streq(val, "infinity")) {
112 *ret = RLIM_INFINITY;
113 return 0;
114 }
115
116 r = parse_sec(val, &t);
117 if (r < 0)
118 return r;
119 if (t == USEC_INFINITY) {
120 *ret = RLIM_INFINITY;
121 return 0;
122 }
123
124 u = (uint64_t) DIV_ROUND_UP(t, USEC_PER_SEC);
125 if (u >= (uint64_t) RLIM_INFINITY)
126 return -ERANGE;
127
128 *ret = (rlim_t) u;
129 return 0;
130 }
131
132 static int rlimit_parse_usec(const char *val, rlim_t *ret) {
133 usec_t t;
134 int r;
135
136 assert(val);
137 assert(ret);
138
139 if (streq(val, "infinity")) {
140 *ret = RLIM_INFINITY;
141 return 0;
142 }
143
144 r = parse_time(val, &t, 1);
145 if (r < 0)
146 return r;
147 if (t == USEC_INFINITY) {
148 *ret = RLIM_INFINITY;
149 return 0;
150 }
151
152 *ret = (rlim_t) t;
153 return 0;
154 }
155
156 static int (*const rlimit_parse_table[_RLIMIT_MAX])(const char *val, rlim_t *ret) = {
157 [RLIMIT_CPU] = rlimit_parse_sec,
158 [RLIMIT_FSIZE] = rlimit_parse_size,
159 [RLIMIT_DATA] = rlimit_parse_size,
160 [RLIMIT_STACK] = rlimit_parse_size,
161 [RLIMIT_CORE] = rlimit_parse_size,
162 [RLIMIT_RSS] = rlimit_parse_size,
163 [RLIMIT_NOFILE] = rlimit_parse_u64,
164 [RLIMIT_AS] = rlimit_parse_size,
165 [RLIMIT_NPROC] = rlimit_parse_u64,
166 [RLIMIT_MEMLOCK] = rlimit_parse_size,
167 [RLIMIT_LOCKS] = rlimit_parse_u64,
168 [RLIMIT_SIGPENDING] = rlimit_parse_u64,
169 [RLIMIT_MSGQUEUE] = rlimit_parse_size,
170 [RLIMIT_NICE] = rlimit_parse_u64,
171 [RLIMIT_RTPRIO] = rlimit_parse_u64,
172 [RLIMIT_RTTIME] = rlimit_parse_usec,
173 };
174
175 int rlimit_parse_one(int resource, const char *val, rlim_t *ret) {
176 assert(val);
177 assert(ret);
178
179 if (resource < 0)
180 return -EINVAL;
181 if (resource >= _RLIMIT_MAX)
182 return -EINVAL;
183
184 return rlimit_parse_table[resource](val, ret);
185 }
186
187 int rlimit_parse(int resource, const char *val, struct rlimit *ret) {
188 _cleanup_free_ char *hard = NULL, *soft = NULL;
189 rlim_t hl, sl;
190 int r;
191
192 assert(val);
193 assert(ret);
194
195 r = extract_first_word(&val, &soft, ":", EXTRACT_DONT_COALESCE_SEPARATORS);
196 if (r < 0)
197 return r;
198 if (r == 0)
199 return -EINVAL;
200
201 r = rlimit_parse_one(resource, soft, &sl);
202 if (r < 0)
203 return r;
204
205 r = extract_first_word(&val, &hard, ":", EXTRACT_DONT_COALESCE_SEPARATORS);
206 if (r < 0)
207 return r;
208 if (!isempty(val))
209 return -EINVAL;
210 if (r == 0)
211 hl = sl;
212 else {
213 r = rlimit_parse_one(resource, hard, &hl);
214 if (r < 0)
215 return r;
216 if (sl > hl)
217 return -EILSEQ;
218 }
219
220 *ret = (struct rlimit) {
221 .rlim_cur = sl,
222 .rlim_max = hl,
223 };
224
225 return 0;
226 }
227
228 int rlimit_format(const struct rlimit *rl, char **ret) {
229 char *s = NULL;
230
231 assert(rl);
232 assert(ret);
233
234 if (rl->rlim_cur >= RLIM_INFINITY && rl->rlim_max >= RLIM_INFINITY)
235 s = strdup("infinity");
236 else if (rl->rlim_cur >= RLIM_INFINITY)
237 (void) asprintf(&s, "infinity:" RLIM_FMT, rl->rlim_max);
238 else if (rl->rlim_max >= RLIM_INFINITY)
239 (void) asprintf(&s, RLIM_FMT ":infinity", rl->rlim_cur);
240 else if (rl->rlim_cur == rl->rlim_max)
241 (void) asprintf(&s, RLIM_FMT, rl->rlim_cur);
242 else
243 (void) asprintf(&s, RLIM_FMT ":" RLIM_FMT, rl->rlim_cur, rl->rlim_max);
244
245 if (!s)
246 return -ENOMEM;
247
248 *ret = s;
249 return 0;
250 }
251
252 static const char* const rlimit_table[_RLIMIT_MAX] = {
253 [RLIMIT_CPU] = "LimitCPU",
254 [RLIMIT_FSIZE] = "LimitFSIZE",
255 [RLIMIT_DATA] = "LimitDATA",
256 [RLIMIT_STACK] = "LimitSTACK",
257 [RLIMIT_CORE] = "LimitCORE",
258 [RLIMIT_RSS] = "LimitRSS",
259 [RLIMIT_NOFILE] = "LimitNOFILE",
260 [RLIMIT_AS] = "LimitAS",
261 [RLIMIT_NPROC] = "LimitNPROC",
262 [RLIMIT_MEMLOCK] = "LimitMEMLOCK",
263 [RLIMIT_LOCKS] = "LimitLOCKS",
264 [RLIMIT_SIGPENDING] = "LimitSIGPENDING",
265 [RLIMIT_MSGQUEUE] = "LimitMSGQUEUE",
266 [RLIMIT_NICE] = "LimitNICE",
267 [RLIMIT_RTPRIO] = "LimitRTPRIO",
268 [RLIMIT_RTTIME] = "LimitRTTIME"
269 };
270
271 DEFINE_STRING_TABLE_LOOKUP(rlimit, int);