]>
Commit | Line | Data |
---|---|---|
663996b3 MS |
1 | /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ |
2 | ||
3 | /*** | |
4 | This file is part of systemd. | |
5 | ||
6 | Copyright 2010 Lennart Poettering | |
7 | ||
8 | systemd is free software; you can redistribute it and/or modify it | |
9 | under the terms of the GNU Lesser General Public License as published by | |
10 | the Free Software Foundation; either version 2.1 of the License, or | |
11 | (at your option) any later version. | |
12 | ||
13 | systemd is distributed in the hope that it will be useful, but | |
14 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 | Lesser General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU Lesser General Public License | |
19 | along with systemd; If not, see <http://www.gnu.org/licenses/>. | |
20 | ***/ | |
21 | ||
22 | #include <assert.h> | |
23 | #include <string.h> | |
24 | #include <unistd.h> | |
25 | #include <errno.h> | |
26 | #include <stdlib.h> | |
27 | #include <signal.h> | |
28 | #include <stdio.h> | |
29 | #include <syslog.h> | |
30 | #include <sched.h> | |
31 | #include <sys/resource.h> | |
32 | #include <linux/sched.h> | |
33 | #include <sys/types.h> | |
34 | #include <sys/stat.h> | |
35 | #include <fcntl.h> | |
36 | #include <dirent.h> | |
37 | #include <sys/ioctl.h> | |
38 | #include <linux/vt.h> | |
39 | #include <linux/tiocl.h> | |
40 | #include <termios.h> | |
41 | #include <stdarg.h> | |
e735f4d4 | 42 | #include <poll.h> |
663996b3 MS |
43 | #include <ctype.h> |
44 | #include <sys/prctl.h> | |
45 | #include <sys/utsname.h> | |
46 | #include <pwd.h> | |
47 | #include <netinet/ip.h> | |
48 | #include <linux/kd.h> | |
49 | #include <dlfcn.h> | |
50 | #include <sys/wait.h> | |
51 | #include <sys/time.h> | |
52 | #include <glob.h> | |
53 | #include <grp.h> | |
54 | #include <sys/mman.h> | |
55 | #include <sys/vfs.h> | |
60f067b4 | 56 | #include <sys/mount.h> |
663996b3 MS |
57 | #include <linux/magic.h> |
58 | #include <limits.h> | |
59 | #include <langinfo.h> | |
60 | #include <locale.h> | |
60f067b4 | 61 | #include <sys/personality.h> |
e735f4d4 MP |
62 | #include <sys/xattr.h> |
63 | #include <sys/statvfs.h> | |
64 | #include <sys/file.h> | |
65 | #include <linux/fs.h> | |
66 | ||
67 | /* When we include libgen.h because we need dirname() we immediately | |
68 | * undefine basename() since libgen.h defines it as a macro to the XDG | |
69 | * version which is really broken. */ | |
663996b3 | 70 | #include <libgen.h> |
60f067b4 JS |
71 | #undef basename |
72 | ||
73 | #ifdef HAVE_SYS_AUXV_H | |
74 | #include <sys/auxv.h> | |
75 | #endif | |
663996b3 MS |
76 | |
77 | #include "macro.h" | |
78 | #include "util.h" | |
79 | #include "ioprio.h" | |
80 | #include "missing.h" | |
81 | #include "log.h" | |
82 | #include "strv.h" | |
83 | #include "label.h" | |
60f067b4 | 84 | #include "mkdir.h" |
663996b3 MS |
85 | #include "path-util.h" |
86 | #include "exit-status.h" | |
87 | #include "hashmap.h" | |
88 | #include "env-util.h" | |
89 | #include "fileio.h" | |
14228c0d | 90 | #include "device-nodes.h" |
60f067b4 JS |
91 | #include "utf8.h" |
92 | #include "gunicode.h" | |
93 | #include "virt.h" | |
94 | #include "def.h" | |
e735f4d4 | 95 | #include "sparse-endian.h" |
663996b3 MS |
96 | |
97 | int saved_argc = 0; | |
98 | char **saved_argv = NULL; | |
99 | ||
100 | static volatile unsigned cached_columns = 0; | |
101 | static volatile unsigned cached_lines = 0; | |
102 | ||
103 | size_t page_size(void) { | |
60f067b4 | 104 | static thread_local size_t pgsz = 0; |
663996b3 MS |
105 | long r; |
106 | ||
107 | if (_likely_(pgsz > 0)) | |
108 | return pgsz; | |
109 | ||
110 | r = sysconf(_SC_PAGESIZE); | |
111 | assert(r > 0); | |
112 | ||
113 | pgsz = (size_t) r; | |
114 | return pgsz; | |
115 | } | |
116 | ||
117 | bool streq_ptr(const char *a, const char *b) { | |
118 | ||
119 | /* Like streq(), but tries to make sense of NULL pointers */ | |
120 | ||
121 | if (a && b) | |
122 | return streq(a, b); | |
123 | ||
124 | if (!a && !b) | |
125 | return true; | |
126 | ||
127 | return false; | |
128 | } | |
129 | ||
130 | char* endswith(const char *s, const char *postfix) { | |
131 | size_t sl, pl; | |
132 | ||
133 | assert(s); | |
134 | assert(postfix); | |
135 | ||
136 | sl = strlen(s); | |
137 | pl = strlen(postfix); | |
138 | ||
139 | if (pl == 0) | |
140 | return (char*) s + sl; | |
141 | ||
142 | if (sl < pl) | |
143 | return NULL; | |
144 | ||
145 | if (memcmp(s + sl - pl, postfix, pl) != 0) | |
146 | return NULL; | |
147 | ||
148 | return (char*) s + sl - pl; | |
149 | } | |
150 | ||
5eef597e | 151 | char* first_word(const char *s, const char *word) { |
663996b3 | 152 | size_t sl, wl; |
5eef597e | 153 | const char *p; |
663996b3 MS |
154 | |
155 | assert(s); | |
156 | assert(word); | |
157 | ||
5eef597e MP |
158 | /* Checks if the string starts with the specified word, either |
159 | * followed by NUL or by whitespace. Returns a pointer to the | |
160 | * NUL or the first character after the whitespace. */ | |
161 | ||
663996b3 MS |
162 | sl = strlen(s); |
163 | wl = strlen(word); | |
164 | ||
165 | if (sl < wl) | |
5eef597e | 166 | return NULL; |
663996b3 MS |
167 | |
168 | if (wl == 0) | |
5eef597e | 169 | return (char*) s; |
663996b3 MS |
170 | |
171 | if (memcmp(s, word, wl) != 0) | |
5eef597e MP |
172 | return NULL; |
173 | ||
174 | p = s + wl; | |
175 | if (*p == 0) | |
176 | return (char*) p; | |
177 | ||
178 | if (!strchr(WHITESPACE, *p)) | |
179 | return NULL; | |
663996b3 | 180 | |
5eef597e MP |
181 | p += strspn(p, WHITESPACE); |
182 | return (char*) p; | |
663996b3 MS |
183 | } |
184 | ||
f47781d8 MP |
185 | static size_t cescape_char(char c, char *buf) { |
186 | char * buf_old = buf; | |
187 | ||
188 | switch (c) { | |
189 | ||
190 | case '\a': | |
191 | *(buf++) = '\\'; | |
192 | *(buf++) = 'a'; | |
193 | break; | |
194 | case '\b': | |
195 | *(buf++) = '\\'; | |
196 | *(buf++) = 'b'; | |
197 | break; | |
198 | case '\f': | |
199 | *(buf++) = '\\'; | |
200 | *(buf++) = 'f'; | |
201 | break; | |
202 | case '\n': | |
203 | *(buf++) = '\\'; | |
204 | *(buf++) = 'n'; | |
205 | break; | |
206 | case '\r': | |
207 | *(buf++) = '\\'; | |
208 | *(buf++) = 'r'; | |
209 | break; | |
210 | case '\t': | |
211 | *(buf++) = '\\'; | |
212 | *(buf++) = 't'; | |
213 | break; | |
214 | case '\v': | |
215 | *(buf++) = '\\'; | |
216 | *(buf++) = 'v'; | |
217 | break; | |
218 | case '\\': | |
219 | *(buf++) = '\\'; | |
220 | *(buf++) = '\\'; | |
221 | break; | |
222 | case '"': | |
223 | *(buf++) = '\\'; | |
224 | *(buf++) = '"'; | |
225 | break; | |
226 | case '\'': | |
227 | *(buf++) = '\\'; | |
228 | *(buf++) = '\''; | |
229 | break; | |
230 | ||
231 | default: | |
232 | /* For special chars we prefer octal over | |
233 | * hexadecimal encoding, simply because glib's | |
234 | * g_strescape() does the same */ | |
235 | if ((c < ' ') || (c >= 127)) { | |
236 | *(buf++) = '\\'; | |
237 | *(buf++) = octchar((unsigned char) c >> 6); | |
238 | *(buf++) = octchar((unsigned char) c >> 3); | |
239 | *(buf++) = octchar((unsigned char) c); | |
240 | } else | |
241 | *(buf++) = c; | |
242 | break; | |
243 | } | |
244 | ||
245 | return buf - buf_old; | |
246 | } | |
247 | ||
663996b3 | 248 | int close_nointr(int fd) { |
663996b3 | 249 | assert(fd >= 0); |
5eef597e MP |
250 | |
251 | if (close(fd) >= 0) | |
60f067b4 | 252 | return 0; |
5eef597e MP |
253 | |
254 | /* | |
255 | * Just ignore EINTR; a retry loop is the wrong thing to do on | |
256 | * Linux. | |
257 | * | |
258 | * http://lkml.indiana.edu/hypermail/linux/kernel/0509.1/0877.html | |
259 | * https://bugzilla.gnome.org/show_bug.cgi?id=682819 | |
260 | * http://utcc.utoronto.ca/~cks/space/blog/unix/CloseEINTR | |
261 | * https://sites.google.com/site/michaelsafyan/software-engineering/checkforeintrwheninvokingclosethinkagain | |
262 | */ | |
263 | if (errno == EINTR) | |
264 | return 0; | |
265 | ||
266 | return -errno; | |
663996b3 MS |
267 | } |
268 | ||
60f067b4 JS |
269 | int safe_close(int fd) { |
270 | ||
271 | /* | |
272 | * Like close_nointr() but cannot fail. Guarantees errno is | |
273 | * unchanged. Is a NOP with negative fds passed, and returns | |
274 | * -1, so that it can be used in this syntax: | |
275 | * | |
276 | * fd = safe_close(fd); | |
277 | */ | |
278 | ||
279 | if (fd >= 0) { | |
280 | PROTECT_ERRNO; | |
281 | ||
282 | /* The kernel might return pretty much any error code | |
283 | * via close(), but the fd will be closed anyway. The | |
284 | * only condition we want to check for here is whether | |
285 | * the fd was invalid at all... */ | |
663996b3 | 286 | |
60f067b4 JS |
287 | assert_se(close_nointr(fd) != -EBADF); |
288 | } | |
663996b3 | 289 | |
60f067b4 | 290 | return -1; |
663996b3 MS |
291 | } |
292 | ||
293 | void close_many(const int fds[], unsigned n_fd) { | |
294 | unsigned i; | |
295 | ||
296 | assert(fds || n_fd <= 0); | |
297 | ||
298 | for (i = 0; i < n_fd; i++) | |
60f067b4 | 299 | safe_close(fds[i]); |
663996b3 MS |
300 | } |
301 | ||
302 | int unlink_noerrno(const char *path) { | |
303 | PROTECT_ERRNO; | |
304 | int r; | |
305 | ||
306 | r = unlink(path); | |
307 | if (r < 0) | |
308 | return -errno; | |
309 | ||
310 | return 0; | |
311 | } | |
312 | ||
313 | int parse_boolean(const char *v) { | |
314 | assert(v); | |
315 | ||
5eef597e | 316 | if (streq(v, "1") || strcaseeq(v, "yes") || strcaseeq(v, "y") || strcaseeq(v, "true") || strcaseeq(v, "t") || strcaseeq(v, "on")) |
663996b3 | 317 | return 1; |
5eef597e | 318 | else if (streq(v, "0") || strcaseeq(v, "no") || strcaseeq(v, "n") || strcaseeq(v, "false") || strcaseeq(v, "f") || strcaseeq(v, "off")) |
663996b3 MS |
319 | return 0; |
320 | ||
321 | return -EINVAL; | |
322 | } | |
323 | ||
324 | int parse_pid(const char *s, pid_t* ret_pid) { | |
325 | unsigned long ul = 0; | |
326 | pid_t pid; | |
327 | int r; | |
328 | ||
329 | assert(s); | |
330 | assert(ret_pid); | |
331 | ||
332 | r = safe_atolu(s, &ul); | |
333 | if (r < 0) | |
334 | return r; | |
335 | ||
336 | pid = (pid_t) ul; | |
337 | ||
338 | if ((unsigned long) pid != ul) | |
339 | return -ERANGE; | |
340 | ||
341 | if (pid <= 0) | |
342 | return -ERANGE; | |
343 | ||
344 | *ret_pid = pid; | |
345 | return 0; | |
346 | } | |
347 | ||
348 | int parse_uid(const char *s, uid_t* ret_uid) { | |
349 | unsigned long ul = 0; | |
350 | uid_t uid; | |
351 | int r; | |
352 | ||
353 | assert(s); | |
354 | assert(ret_uid); | |
355 | ||
356 | r = safe_atolu(s, &ul); | |
357 | if (r < 0) | |
358 | return r; | |
359 | ||
360 | uid = (uid_t) ul; | |
361 | ||
362 | if ((unsigned long) uid != ul) | |
363 | return -ERANGE; | |
364 | ||
f47781d8 | 365 | /* Some libc APIs use UID_INVALID as special placeholder */ |
e842803a MB |
366 | if (uid == (uid_t) 0xFFFFFFFF) |
367 | return -ENXIO; | |
368 | ||
369 | /* A long time ago UIDs where 16bit, hence explicitly avoid the 16bit -1 too */ | |
370 | if (uid == (uid_t) 0xFFFF) | |
371 | return -ENXIO; | |
372 | ||
663996b3 MS |
373 | *ret_uid = uid; |
374 | return 0; | |
375 | } | |
376 | ||
377 | int safe_atou(const char *s, unsigned *ret_u) { | |
378 | char *x = NULL; | |
379 | unsigned long l; | |
380 | ||
381 | assert(s); | |
382 | assert(ret_u); | |
383 | ||
384 | errno = 0; | |
385 | l = strtoul(s, &x, 0); | |
386 | ||
387 | if (!x || x == s || *x || errno) | |
388 | return errno > 0 ? -errno : -EINVAL; | |
389 | ||
390 | if ((unsigned long) (unsigned) l != l) | |
391 | return -ERANGE; | |
392 | ||
393 | *ret_u = (unsigned) l; | |
394 | return 0; | |
395 | } | |
396 | ||
397 | int safe_atoi(const char *s, int *ret_i) { | |
398 | char *x = NULL; | |
399 | long l; | |
400 | ||
401 | assert(s); | |
402 | assert(ret_i); | |
403 | ||
404 | errno = 0; | |
405 | l = strtol(s, &x, 0); | |
406 | ||
407 | if (!x || x == s || *x || errno) | |
408 | return errno > 0 ? -errno : -EINVAL; | |
409 | ||
410 | if ((long) (int) l != l) | |
411 | return -ERANGE; | |
412 | ||
413 | *ret_i = (int) l; | |
414 | return 0; | |
415 | } | |
416 | ||
5eef597e MP |
417 | int safe_atou8(const char *s, uint8_t *ret) { |
418 | char *x = NULL; | |
419 | unsigned long l; | |
420 | ||
421 | assert(s); | |
422 | assert(ret); | |
423 | ||
424 | errno = 0; | |
425 | l = strtoul(s, &x, 0); | |
426 | ||
427 | if (!x || x == s || *x || errno) | |
428 | return errno > 0 ? -errno : -EINVAL; | |
429 | ||
430 | if ((unsigned long) (uint8_t) l != l) | |
431 | return -ERANGE; | |
432 | ||
433 | *ret = (uint8_t) l; | |
434 | return 0; | |
435 | } | |
436 | ||
f47781d8 MP |
437 | int safe_atou16(const char *s, uint16_t *ret) { |
438 | char *x = NULL; | |
439 | unsigned long l; | |
440 | ||
441 | assert(s); | |
442 | assert(ret); | |
443 | ||
444 | errno = 0; | |
445 | l = strtoul(s, &x, 0); | |
446 | ||
447 | if (!x || x == s || *x || errno) | |
448 | return errno > 0 ? -errno : -EINVAL; | |
449 | ||
450 | if ((unsigned long) (uint16_t) l != l) | |
451 | return -ERANGE; | |
452 | ||
453 | *ret = (uint16_t) l; | |
454 | return 0; | |
455 | } | |
456 | ||
457 | int safe_atoi16(const char *s, int16_t *ret) { | |
458 | char *x = NULL; | |
459 | long l; | |
460 | ||
461 | assert(s); | |
462 | assert(ret); | |
463 | ||
464 | errno = 0; | |
465 | l = strtol(s, &x, 0); | |
466 | ||
467 | if (!x || x == s || *x || errno) | |
468 | return errno > 0 ? -errno : -EINVAL; | |
469 | ||
470 | if ((long) (int16_t) l != l) | |
471 | return -ERANGE; | |
472 | ||
473 | *ret = (int16_t) l; | |
474 | return 0; | |
475 | } | |
476 | ||
663996b3 MS |
477 | int safe_atollu(const char *s, long long unsigned *ret_llu) { |
478 | char *x = NULL; | |
479 | unsigned long long l; | |
480 | ||
481 | assert(s); | |
482 | assert(ret_llu); | |
483 | ||
484 | errno = 0; | |
485 | l = strtoull(s, &x, 0); | |
486 | ||
487 | if (!x || x == s || *x || errno) | |
488 | return errno ? -errno : -EINVAL; | |
489 | ||
490 | *ret_llu = l; | |
491 | return 0; | |
492 | } | |
493 | ||
494 | int safe_atolli(const char *s, long long int *ret_lli) { | |
495 | char *x = NULL; | |
496 | long long l; | |
497 | ||
498 | assert(s); | |
499 | assert(ret_lli); | |
500 | ||
501 | errno = 0; | |
502 | l = strtoll(s, &x, 0); | |
503 | ||
504 | if (!x || x == s || *x || errno) | |
505 | return errno ? -errno : -EINVAL; | |
506 | ||
507 | *ret_lli = l; | |
508 | return 0; | |
509 | } | |
510 | ||
511 | int safe_atod(const char *s, double *ret_d) { | |
512 | char *x = NULL; | |
14228c0d | 513 | double d = 0; |
e735f4d4 | 514 | locale_t loc; |
663996b3 MS |
515 | |
516 | assert(s); | |
517 | assert(ret_d); | |
518 | ||
e735f4d4 MP |
519 | loc = newlocale(LC_NUMERIC_MASK, "C", (locale_t) 0); |
520 | if (loc == (locale_t) 0) | |
521 | return -errno; | |
663996b3 | 522 | |
e735f4d4 MP |
523 | errno = 0; |
524 | d = strtod_l(s, &x, loc); | |
525 | ||
526 | if (!x || x == s || *x || errno) { | |
527 | freelocale(loc); | |
663996b3 | 528 | return errno ? -errno : -EINVAL; |
e735f4d4 | 529 | } |
663996b3 | 530 | |
e735f4d4 | 531 | freelocale(loc); |
663996b3 MS |
532 | *ret_d = (double) d; |
533 | return 0; | |
534 | } | |
535 | ||
60f067b4 JS |
536 | static size_t strcspn_escaped(const char *s, const char *reject) { |
537 | bool escaped = false; | |
e735f4d4 | 538 | int n; |
60f067b4 JS |
539 | |
540 | for (n=0; s[n]; n++) { | |
541 | if (escaped) | |
542 | escaped = false; | |
543 | else if (s[n] == '\\') | |
544 | escaped = true; | |
545 | else if (strchr(reject, s[n])) | |
5eef597e | 546 | break; |
60f067b4 | 547 | } |
e735f4d4 | 548 | |
5eef597e MP |
549 | /* if s ends in \, return index of previous char */ |
550 | return n - escaped; | |
60f067b4 JS |
551 | } |
552 | ||
663996b3 | 553 | /* Split a string into words. */ |
5eef597e MP |
554 | const char* split(const char **state, size_t *l, const char *separator, bool quoted) { |
555 | const char *current; | |
663996b3 | 556 | |
5eef597e | 557 | current = *state; |
663996b3 | 558 | |
5eef597e MP |
559 | if (!*current) { |
560 | assert(**state == '\0'); | |
663996b3 | 561 | return NULL; |
5eef597e | 562 | } |
663996b3 MS |
563 | |
564 | current += strspn(current, separator); | |
5eef597e MP |
565 | if (!*current) { |
566 | *state = current; | |
663996b3 | 567 | return NULL; |
5eef597e | 568 | } |
663996b3 | 569 | |
60f067b4 | 570 | if (quoted && strchr("\'\"", *current)) { |
5eef597e MP |
571 | char quotechars[2] = {*current, '\0'}; |
572 | ||
573 | *l = strcspn_escaped(current + 1, quotechars); | |
574 | if (current[*l + 1] == '\0' || | |
575 | (current[*l + 2] && !strchr(separator, current[*l + 2]))) { | |
e735f4d4 | 576 | /* right quote missing or garbage at the end */ |
5eef597e MP |
577 | *state = current; |
578 | return NULL; | |
579 | } | |
580 | assert(current[*l + 1] == quotechars[0]); | |
581 | *state = current++ + *l + 2; | |
60f067b4 JS |
582 | } else if (quoted) { |
583 | *l = strcspn_escaped(current, separator); | |
e735f4d4 MP |
584 | if (current[*l] && !strchr(separator, current[*l])) { |
585 | /* unfinished escape */ | |
586 | *state = current; | |
587 | return NULL; | |
588 | } | |
5eef597e | 589 | *state = current + *l; |
663996b3 | 590 | } else { |
60f067b4 | 591 | *l = strcspn(current, separator); |
5eef597e | 592 | *state = current + *l; |
663996b3 MS |
593 | } |
594 | ||
5eef597e | 595 | return current; |
663996b3 MS |
596 | } |
597 | ||
598 | int get_parent_of_pid(pid_t pid, pid_t *_ppid) { | |
599 | int r; | |
60f067b4 | 600 | _cleanup_free_ char *line = NULL; |
663996b3 MS |
601 | long unsigned ppid; |
602 | const char *p; | |
603 | ||
604 | assert(pid >= 0); | |
605 | assert(_ppid); | |
606 | ||
607 | if (pid == 0) { | |
608 | *_ppid = getppid(); | |
609 | return 0; | |
610 | } | |
611 | ||
612 | p = procfs_file_alloca(pid, "stat"); | |
60f067b4 JS |
613 | r = read_one_line_file(p, &line); |
614 | if (r < 0) | |
663996b3 | 615 | return r; |
663996b3 MS |
616 | |
617 | /* Let's skip the pid and comm fields. The latter is enclosed | |
618 | * in () but does not escape any () in its value, so let's | |
619 | * skip over it manually */ | |
620 | ||
621 | p = strrchr(line, ')'); | |
622 | if (!p) | |
623 | return -EIO; | |
624 | ||
625 | p++; | |
626 | ||
627 | if (sscanf(p, " " | |
628 | "%*c " /* state */ | |
629 | "%lu ", /* ppid */ | |
630 | &ppid) != 1) | |
631 | return -EIO; | |
632 | ||
633 | if ((long unsigned) (pid_t) ppid != ppid) | |
634 | return -ERANGE; | |
635 | ||
636 | *_ppid = (pid_t) ppid; | |
637 | ||
638 | return 0; | |
639 | } | |
640 | ||
663996b3 MS |
641 | int fchmod_umask(int fd, mode_t m) { |
642 | mode_t u; | |
643 | int r; | |
644 | ||
645 | u = umask(0777); | |
646 | r = fchmod(fd, m & (~u)) < 0 ? -errno : 0; | |
647 | umask(u); | |
648 | ||
649 | return r; | |
650 | } | |
651 | ||
652 | char *truncate_nl(char *s) { | |
653 | assert(s); | |
654 | ||
655 | s[strcspn(s, NEWLINE)] = 0; | |
656 | return s; | |
657 | } | |
658 | ||
60f067b4 JS |
659 | int get_process_state(pid_t pid) { |
660 | const char *p; | |
661 | char state; | |
662 | int r; | |
663 | _cleanup_free_ char *line = NULL; | |
664 | ||
665 | assert(pid >= 0); | |
666 | ||
667 | p = procfs_file_alloca(pid, "stat"); | |
668 | r = read_one_line_file(p, &line); | |
669 | if (r < 0) | |
670 | return r; | |
671 | ||
672 | p = strrchr(line, ')'); | |
673 | if (!p) | |
674 | return -EIO; | |
675 | ||
676 | p++; | |
677 | ||
678 | if (sscanf(p, " %c", &state) != 1) | |
679 | return -EIO; | |
680 | ||
681 | return (unsigned char) state; | |
682 | } | |
683 | ||
663996b3 MS |
684 | int get_process_comm(pid_t pid, char **name) { |
685 | const char *p; | |
60f067b4 | 686 | int r; |
663996b3 MS |
687 | |
688 | assert(name); | |
689 | assert(pid >= 0); | |
690 | ||
60f067b4 JS |
691 | p = procfs_file_alloca(pid, "comm"); |
692 | ||
693 | r = read_one_line_file(p, name); | |
694 | if (r == -ENOENT) | |
695 | return -ESRCH; | |
663996b3 | 696 | |
60f067b4 | 697 | return r; |
663996b3 MS |
698 | } |
699 | ||
700 | int get_process_cmdline(pid_t pid, size_t max_length, bool comm_fallback, char **line) { | |
701 | _cleanup_fclose_ FILE *f = NULL; | |
702 | char *r = NULL, *k; | |
703 | const char *p; | |
704 | int c; | |
705 | ||
706 | assert(line); | |
707 | assert(pid >= 0); | |
708 | ||
60f067b4 | 709 | p = procfs_file_alloca(pid, "cmdline"); |
663996b3 MS |
710 | |
711 | f = fopen(p, "re"); | |
712 | if (!f) | |
713 | return -errno; | |
714 | ||
715 | if (max_length == 0) { | |
716 | size_t len = 0, allocated = 0; | |
717 | ||
718 | while ((c = getc(f)) != EOF) { | |
719 | ||
720 | if (!GREEDY_REALLOC(r, allocated, len+2)) { | |
721 | free(r); | |
722 | return -ENOMEM; | |
723 | } | |
724 | ||
725 | r[len++] = isprint(c) ? c : ' '; | |
726 | } | |
727 | ||
728 | if (len > 0) | |
729 | r[len-1] = 0; | |
730 | ||
731 | } else { | |
732 | bool space = false; | |
733 | size_t left; | |
734 | ||
735 | r = new(char, max_length); | |
736 | if (!r) | |
737 | return -ENOMEM; | |
738 | ||
739 | k = r; | |
740 | left = max_length; | |
741 | while ((c = getc(f)) != EOF) { | |
742 | ||
743 | if (isprint(c)) { | |
744 | if (space) { | |
745 | if (left <= 4) | |
746 | break; | |
747 | ||
748 | *(k++) = ' '; | |
749 | left--; | |
750 | space = false; | |
751 | } | |
752 | ||
753 | if (left <= 4) | |
754 | break; | |
755 | ||
756 | *(k++) = (char) c; | |
757 | left--; | |
758 | } else | |
759 | space = true; | |
760 | } | |
761 | ||
762 | if (left <= 4) { | |
763 | size_t n = MIN(left-1, 3U); | |
764 | memcpy(k, "...", n); | |
765 | k[n] = 0; | |
766 | } else | |
767 | *k = 0; | |
768 | } | |
769 | ||
770 | /* Kernel threads have no argv[] */ | |
f47781d8 | 771 | if (isempty(r)) { |
60f067b4 | 772 | _cleanup_free_ char *t = NULL; |
663996b3 MS |
773 | int h; |
774 | ||
775 | free(r); | |
776 | ||
777 | if (!comm_fallback) | |
778 | return -ENOENT; | |
779 | ||
780 | h = get_process_comm(pid, &t); | |
781 | if (h < 0) | |
782 | return h; | |
783 | ||
784 | r = strjoin("[", t, "]", NULL); | |
663996b3 MS |
785 | if (!r) |
786 | return -ENOMEM; | |
787 | } | |
788 | ||
789 | *line = r; | |
790 | return 0; | |
791 | } | |
792 | ||
793 | int is_kernel_thread(pid_t pid) { | |
794 | const char *p; | |
795 | size_t count; | |
796 | char c; | |
797 | bool eof; | |
798 | FILE *f; | |
799 | ||
800 | if (pid == 0) | |
801 | return 0; | |
802 | ||
803 | assert(pid > 0); | |
804 | ||
805 | p = procfs_file_alloca(pid, "cmdline"); | |
806 | f = fopen(p, "re"); | |
807 | if (!f) | |
808 | return -errno; | |
809 | ||
810 | count = fread(&c, 1, 1, f); | |
811 | eof = feof(f); | |
812 | fclose(f); | |
813 | ||
814 | /* Kernel threads have an empty cmdline */ | |
815 | ||
816 | if (count <= 0) | |
817 | return eof ? 1 : -errno; | |
818 | ||
819 | return 0; | |
820 | } | |
821 | ||
14228c0d MB |
822 | int get_process_capeff(pid_t pid, char **capeff) { |
823 | const char *p; | |
824 | ||
825 | assert(capeff); | |
826 | assert(pid >= 0); | |
827 | ||
60f067b4 | 828 | p = procfs_file_alloca(pid, "status"); |
14228c0d MB |
829 | |
830 | return get_status_field(p, "\nCapEff:", capeff); | |
831 | } | |
663996b3 | 832 | |
f47781d8 MP |
833 | static int get_process_link_contents(const char *proc_file, char **name) { |
834 | int r; | |
835 | ||
836 | assert(proc_file); | |
837 | assert(name); | |
838 | ||
839 | r = readlink_malloc(proc_file, name); | |
840 | if (r < 0) | |
841 | return r == -ENOENT ? -ESRCH : r; | |
842 | ||
843 | return 0; | |
844 | } | |
845 | ||
663996b3 MS |
846 | int get_process_exe(pid_t pid, char **name) { |
847 | const char *p; | |
14228c0d MB |
848 | char *d; |
849 | int r; | |
663996b3 MS |
850 | |
851 | assert(pid >= 0); | |
663996b3 | 852 | |
60f067b4 | 853 | p = procfs_file_alloca(pid, "exe"); |
f47781d8 | 854 | r = get_process_link_contents(p, name); |
14228c0d | 855 | if (r < 0) |
f47781d8 | 856 | return r; |
14228c0d MB |
857 | |
858 | d = endswith(*name, " (deleted)"); | |
859 | if (d) | |
860 | *d = '\0'; | |
861 | ||
862 | return 0; | |
663996b3 MS |
863 | } |
864 | ||
865 | static int get_process_id(pid_t pid, const char *field, uid_t *uid) { | |
866 | _cleanup_fclose_ FILE *f = NULL; | |
867 | char line[LINE_MAX]; | |
868 | const char *p; | |
869 | ||
870 | assert(field); | |
871 | assert(uid); | |
872 | ||
873 | if (pid == 0) | |
874 | return getuid(); | |
875 | ||
876 | p = procfs_file_alloca(pid, "status"); | |
877 | f = fopen(p, "re"); | |
878 | if (!f) | |
879 | return -errno; | |
880 | ||
881 | FOREACH_LINE(line, f, return -errno) { | |
882 | char *l; | |
883 | ||
884 | l = strstrip(line); | |
885 | ||
886 | if (startswith(l, field)) { | |
887 | l += strlen(field); | |
888 | l += strspn(l, WHITESPACE); | |
889 | ||
890 | l[strcspn(l, WHITESPACE)] = 0; | |
891 | ||
892 | return parse_uid(l, uid); | |
893 | } | |
894 | } | |
895 | ||
896 | return -EIO; | |
897 | } | |
898 | ||
899 | int get_process_uid(pid_t pid, uid_t *uid) { | |
900 | return get_process_id(pid, "Uid:", uid); | |
901 | } | |
902 | ||
903 | int get_process_gid(pid_t pid, gid_t *gid) { | |
904 | assert_cc(sizeof(uid_t) == sizeof(gid_t)); | |
905 | return get_process_id(pid, "Gid:", gid); | |
906 | } | |
907 | ||
f47781d8 MP |
908 | int get_process_cwd(pid_t pid, char **cwd) { |
909 | const char *p; | |
910 | ||
911 | assert(pid >= 0); | |
912 | ||
913 | p = procfs_file_alloca(pid, "cwd"); | |
914 | ||
915 | return get_process_link_contents(p, cwd); | |
916 | } | |
917 | ||
918 | int get_process_root(pid_t pid, char **root) { | |
919 | const char *p; | |
920 | ||
921 | assert(pid >= 0); | |
922 | ||
923 | p = procfs_file_alloca(pid, "root"); | |
924 | ||
925 | return get_process_link_contents(p, root); | |
926 | } | |
927 | ||
928 | int get_process_environ(pid_t pid, char **env) { | |
929 | _cleanup_fclose_ FILE *f = NULL; | |
930 | _cleanup_free_ char *outcome = NULL; | |
931 | int c; | |
932 | const char *p; | |
933 | size_t allocated = 0, sz = 0; | |
934 | ||
935 | assert(pid >= 0); | |
936 | assert(env); | |
937 | ||
938 | p = procfs_file_alloca(pid, "environ"); | |
939 | ||
940 | f = fopen(p, "re"); | |
941 | if (!f) | |
942 | return -errno; | |
943 | ||
944 | while ((c = fgetc(f)) != EOF) { | |
945 | if (!GREEDY_REALLOC(outcome, allocated, sz + 5)) | |
946 | return -ENOMEM; | |
947 | ||
948 | if (c == '\0') | |
949 | outcome[sz++] = '\n'; | |
950 | else | |
951 | sz += cescape_char(c, outcome + sz); | |
952 | } | |
953 | ||
954 | outcome[sz] = '\0'; | |
955 | *env = outcome; | |
956 | outcome = NULL; | |
957 | ||
958 | return 0; | |
959 | } | |
960 | ||
663996b3 MS |
961 | char *strnappend(const char *s, const char *suffix, size_t b) { |
962 | size_t a; | |
963 | char *r; | |
964 | ||
965 | if (!s && !suffix) | |
966 | return strdup(""); | |
967 | ||
968 | if (!s) | |
969 | return strndup(suffix, b); | |
970 | ||
971 | if (!suffix) | |
972 | return strdup(s); | |
973 | ||
974 | assert(s); | |
975 | assert(suffix); | |
976 | ||
977 | a = strlen(s); | |
978 | if (b > ((size_t) -1) - a) | |
979 | return NULL; | |
980 | ||
981 | r = new(char, a+b+1); | |
982 | if (!r) | |
983 | return NULL; | |
984 | ||
985 | memcpy(r, s, a); | |
986 | memcpy(r+a, suffix, b); | |
987 | r[a+b] = 0; | |
988 | ||
989 | return r; | |
990 | } | |
991 | ||
992 | char *strappend(const char *s, const char *suffix) { | |
993 | return strnappend(s, suffix, suffix ? strlen(suffix) : 0); | |
994 | } | |
995 | ||
60f067b4 | 996 | int readlinkat_malloc(int fd, const char *p, char **ret) { |
663996b3 | 997 | size_t l = 100; |
60f067b4 | 998 | int r; |
663996b3 MS |
999 | |
1000 | assert(p); | |
60f067b4 | 1001 | assert(ret); |
663996b3 MS |
1002 | |
1003 | for (;;) { | |
1004 | char *c; | |
1005 | ssize_t n; | |
1006 | ||
60f067b4 JS |
1007 | c = new(char, l); |
1008 | if (!c) | |
663996b3 MS |
1009 | return -ENOMEM; |
1010 | ||
60f067b4 JS |
1011 | n = readlinkat(fd, p, c, l-1); |
1012 | if (n < 0) { | |
1013 | r = -errno; | |
663996b3 | 1014 | free(c); |
60f067b4 | 1015 | return r; |
663996b3 MS |
1016 | } |
1017 | ||
1018 | if ((size_t) n < l-1) { | |
1019 | c[n] = 0; | |
60f067b4 | 1020 | *ret = c; |
663996b3 MS |
1021 | return 0; |
1022 | } | |
1023 | ||
1024 | free(c); | |
1025 | l *= 2; | |
1026 | } | |
1027 | } | |
1028 | ||
60f067b4 JS |
1029 | int readlink_malloc(const char *p, char **ret) { |
1030 | return readlinkat_malloc(AT_FDCWD, p, ret); | |
1031 | } | |
1032 | ||
f47781d8 MP |
1033 | int readlink_value(const char *p, char **ret) { |
1034 | _cleanup_free_ char *link = NULL; | |
1035 | char *value; | |
1036 | int r; | |
1037 | ||
1038 | r = readlink_malloc(p, &link); | |
1039 | if (r < 0) | |
1040 | return r; | |
1041 | ||
1042 | value = basename(link); | |
1043 | if (!value) | |
1044 | return -ENOENT; | |
1045 | ||
1046 | value = strdup(value); | |
1047 | if (!value) | |
1048 | return -ENOMEM; | |
1049 | ||
1050 | *ret = value; | |
1051 | ||
1052 | return 0; | |
1053 | } | |
1054 | ||
663996b3 | 1055 | int readlink_and_make_absolute(const char *p, char **r) { |
14228c0d MB |
1056 | _cleanup_free_ char *target = NULL; |
1057 | char *k; | |
663996b3 MS |
1058 | int j; |
1059 | ||
1060 | assert(p); | |
1061 | assert(r); | |
1062 | ||
14228c0d MB |
1063 | j = readlink_malloc(p, &target); |
1064 | if (j < 0) | |
663996b3 MS |
1065 | return j; |
1066 | ||
1067 | k = file_in_same_dir(p, target); | |
663996b3 MS |
1068 | if (!k) |
1069 | return -ENOMEM; | |
1070 | ||
1071 | *r = k; | |
1072 | return 0; | |
1073 | } | |
1074 | ||
1075 | int readlink_and_canonicalize(const char *p, char **r) { | |
1076 | char *t, *s; | |
1077 | int j; | |
1078 | ||
1079 | assert(p); | |
1080 | assert(r); | |
1081 | ||
1082 | j = readlink_and_make_absolute(p, &t); | |
1083 | if (j < 0) | |
1084 | return j; | |
1085 | ||
1086 | s = canonicalize_file_name(t); | |
1087 | if (s) { | |
1088 | free(t); | |
1089 | *r = s; | |
1090 | } else | |
1091 | *r = t; | |
1092 | ||
1093 | path_kill_slashes(*r); | |
1094 | ||
1095 | return 0; | |
1096 | } | |
1097 | ||
1098 | int reset_all_signal_handlers(void) { | |
5eef597e | 1099 | int sig, r = 0; |
663996b3 MS |
1100 | |
1101 | for (sig = 1; sig < _NSIG; sig++) { | |
1102 | struct sigaction sa = { | |
1103 | .sa_handler = SIG_DFL, | |
1104 | .sa_flags = SA_RESTART, | |
1105 | }; | |
1106 | ||
5eef597e | 1107 | /* These two cannot be caught... */ |
663996b3 MS |
1108 | if (sig == SIGKILL || sig == SIGSTOP) |
1109 | continue; | |
1110 | ||
1111 | /* On Linux the first two RT signals are reserved by | |
1112 | * glibc, and sigaction() will return EINVAL for them. */ | |
1113 | if ((sigaction(sig, &sa, NULL) < 0)) | |
5eef597e MP |
1114 | if (errno != EINVAL && r == 0) |
1115 | r = -errno; | |
663996b3 MS |
1116 | } |
1117 | ||
5eef597e MP |
1118 | return r; |
1119 | } | |
1120 | ||
1121 | int reset_signal_mask(void) { | |
1122 | sigset_t ss; | |
1123 | ||
1124 | if (sigemptyset(&ss) < 0) | |
1125 | return -errno; | |
1126 | ||
1127 | if (sigprocmask(SIG_SETMASK, &ss, NULL) < 0) | |
1128 | return -errno; | |
1129 | ||
663996b3 MS |
1130 | return 0; |
1131 | } | |
1132 | ||
1133 | char *strstrip(char *s) { | |
1134 | char *e; | |
1135 | ||
1136 | /* Drops trailing whitespace. Modifies the string in | |
1137 | * place. Returns pointer to first non-space character */ | |
1138 | ||
1139 | s += strspn(s, WHITESPACE); | |
1140 | ||
1141 | for (e = strchr(s, 0); e > s; e --) | |
1142 | if (!strchr(WHITESPACE, e[-1])) | |
1143 | break; | |
1144 | ||
1145 | *e = 0; | |
1146 | ||
1147 | return s; | |
1148 | } | |
1149 | ||
1150 | char *delete_chars(char *s, const char *bad) { | |
1151 | char *f, *t; | |
1152 | ||
1153 | /* Drops all whitespace, regardless where in the string */ | |
1154 | ||
1155 | for (f = s, t = s; *f; f++) { | |
1156 | if (strchr(bad, *f)) | |
1157 | continue; | |
1158 | ||
1159 | *(t++) = *f; | |
1160 | } | |
1161 | ||
1162 | *t = 0; | |
1163 | ||
1164 | return s; | |
1165 | } | |
1166 | ||
663996b3 | 1167 | char *file_in_same_dir(const char *path, const char *filename) { |
e735f4d4 | 1168 | char *e, *ret; |
663996b3 MS |
1169 | size_t k; |
1170 | ||
1171 | assert(path); | |
1172 | assert(filename); | |
1173 | ||
1174 | /* This removes the last component of path and appends | |
1175 | * filename, unless the latter is absolute anyway or the | |
1176 | * former isn't */ | |
1177 | ||
1178 | if (path_is_absolute(filename)) | |
1179 | return strdup(filename); | |
1180 | ||
e735f4d4 MP |
1181 | e = strrchr(path, '/'); |
1182 | if (!e) | |
663996b3 MS |
1183 | return strdup(filename); |
1184 | ||
1185 | k = strlen(filename); | |
e735f4d4 MP |
1186 | ret = new(char, (e + 1 - path) + k + 1); |
1187 | if (!ret) | |
663996b3 MS |
1188 | return NULL; |
1189 | ||
e735f4d4 MP |
1190 | memcpy(mempcpy(ret, path, e + 1 - path), filename, k + 1); |
1191 | return ret; | |
663996b3 MS |
1192 | } |
1193 | ||
1194 | int rmdir_parents(const char *path, const char *stop) { | |
1195 | size_t l; | |
1196 | int r = 0; | |
1197 | ||
1198 | assert(path); | |
1199 | assert(stop); | |
1200 | ||
1201 | l = strlen(path); | |
1202 | ||
1203 | /* Skip trailing slashes */ | |
1204 | while (l > 0 && path[l-1] == '/') | |
1205 | l--; | |
1206 | ||
1207 | while (l > 0) { | |
1208 | char *t; | |
1209 | ||
1210 | /* Skip last component */ | |
1211 | while (l > 0 && path[l-1] != '/') | |
1212 | l--; | |
1213 | ||
1214 | /* Skip trailing slashes */ | |
1215 | while (l > 0 && path[l-1] == '/') | |
1216 | l--; | |
1217 | ||
1218 | if (l <= 0) | |
1219 | break; | |
1220 | ||
1221 | if (!(t = strndup(path, l))) | |
1222 | return -ENOMEM; | |
1223 | ||
1224 | if (path_startswith(stop, t)) { | |
1225 | free(t); | |
1226 | return 0; | |
1227 | } | |
1228 | ||
1229 | r = rmdir(t); | |
1230 | free(t); | |
1231 | ||
1232 | if (r < 0) | |
1233 | if (errno != ENOENT) | |
1234 | return -errno; | |
1235 | } | |
1236 | ||
1237 | return 0; | |
1238 | } | |
1239 | ||
1240 | char hexchar(int x) { | |
1241 | static const char table[16] = "0123456789abcdef"; | |
1242 | ||
1243 | return table[x & 15]; | |
1244 | } | |
1245 | ||
1246 | int unhexchar(char c) { | |
1247 | ||
1248 | if (c >= '0' && c <= '9') | |
1249 | return c - '0'; | |
1250 | ||
1251 | if (c >= 'a' && c <= 'f') | |
1252 | return c - 'a' + 10; | |
1253 | ||
1254 | if (c >= 'A' && c <= 'F') | |
1255 | return c - 'A' + 10; | |
1256 | ||
5eef597e | 1257 | return -EINVAL; |
663996b3 MS |
1258 | } |
1259 | ||
1260 | char *hexmem(const void *p, size_t l) { | |
1261 | char *r, *z; | |
1262 | const uint8_t *x; | |
1263 | ||
1264 | z = r = malloc(l * 2 + 1); | |
1265 | if (!r) | |
1266 | return NULL; | |
1267 | ||
1268 | for (x = p; x < (const uint8_t*) p + l; x++) { | |
1269 | *(z++) = hexchar(*x >> 4); | |
1270 | *(z++) = hexchar(*x & 15); | |
1271 | } | |
1272 | ||
1273 | *z = 0; | |
1274 | return r; | |
1275 | } | |
1276 | ||
1277 | void *unhexmem(const char *p, size_t l) { | |
1278 | uint8_t *r, *z; | |
1279 | const char *x; | |
1280 | ||
1281 | assert(p); | |
1282 | ||
1283 | z = r = malloc((l + 1) / 2 + 1); | |
1284 | if (!r) | |
1285 | return NULL; | |
1286 | ||
1287 | for (x = p; x < p + l; x += 2) { | |
1288 | int a, b; | |
1289 | ||
1290 | a = unhexchar(x[0]); | |
1291 | if (x+1 < p + l) | |
1292 | b = unhexchar(x[1]); | |
1293 | else | |
1294 | b = 0; | |
1295 | ||
1296 | *(z++) = (uint8_t) a << 4 | (uint8_t) b; | |
1297 | } | |
1298 | ||
1299 | *z = 0; | |
1300 | return r; | |
1301 | } | |
1302 | ||
1303 | char octchar(int x) { | |
1304 | return '0' + (x & 7); | |
1305 | } | |
1306 | ||
1307 | int unoctchar(char c) { | |
1308 | ||
1309 | if (c >= '0' && c <= '7') | |
1310 | return c - '0'; | |
1311 | ||
5eef597e | 1312 | return -EINVAL; |
663996b3 MS |
1313 | } |
1314 | ||
1315 | char decchar(int x) { | |
1316 | return '0' + (x % 10); | |
1317 | } | |
1318 | ||
1319 | int undecchar(char c) { | |
1320 | ||
1321 | if (c >= '0' && c <= '9') | |
1322 | return c - '0'; | |
1323 | ||
5eef597e | 1324 | return -EINVAL; |
663996b3 MS |
1325 | } |
1326 | ||
1327 | char *cescape(const char *s) { | |
1328 | char *r, *t; | |
1329 | const char *f; | |
1330 | ||
1331 | assert(s); | |
1332 | ||
1333 | /* Does C style string escaping. */ | |
1334 | ||
1335 | r = new(char, strlen(s)*4 + 1); | |
1336 | if (!r) | |
1337 | return NULL; | |
1338 | ||
1339 | for (f = s, t = r; *f; f++) | |
f47781d8 | 1340 | t += cescape_char(*f, t); |
663996b3 MS |
1341 | |
1342 | *t = 0; | |
1343 | ||
1344 | return r; | |
1345 | } | |
1346 | ||
1347 | char *cunescape_length_with_prefix(const char *s, size_t length, const char *prefix) { | |
1348 | char *r, *t; | |
1349 | const char *f; | |
1350 | size_t pl; | |
1351 | ||
1352 | assert(s); | |
1353 | ||
1354 | /* Undoes C style string escaping, and optionally prefixes it. */ | |
1355 | ||
1356 | pl = prefix ? strlen(prefix) : 0; | |
1357 | ||
1358 | r = new(char, pl+length+1); | |
1359 | if (!r) | |
5eef597e | 1360 | return NULL; |
663996b3 MS |
1361 | |
1362 | if (prefix) | |
1363 | memcpy(r, prefix, pl); | |
1364 | ||
1365 | for (f = s, t = r + pl; f < s + length; f++) { | |
e735f4d4 MP |
1366 | size_t remaining = s + length - f; |
1367 | assert(remaining > 0); | |
663996b3 | 1368 | |
e735f4d4 | 1369 | if (*f != '\\') { /* a literal literal */ |
663996b3 MS |
1370 | *(t++) = *f; |
1371 | continue; | |
1372 | } | |
1373 | ||
e735f4d4 MP |
1374 | if (--remaining == 0) { /* copy trailing backslash verbatim */ |
1375 | *(t++) = *f; | |
1376 | break; | |
1377 | } | |
1378 | ||
663996b3 MS |
1379 | f++; |
1380 | ||
1381 | switch (*f) { | |
1382 | ||
1383 | case 'a': | |
1384 | *(t++) = '\a'; | |
1385 | break; | |
1386 | case 'b': | |
1387 | *(t++) = '\b'; | |
1388 | break; | |
1389 | case 'f': | |
1390 | *(t++) = '\f'; | |
1391 | break; | |
1392 | case 'n': | |
1393 | *(t++) = '\n'; | |
1394 | break; | |
1395 | case 'r': | |
1396 | *(t++) = '\r'; | |
1397 | break; | |
1398 | case 't': | |
1399 | *(t++) = '\t'; | |
1400 | break; | |
1401 | case 'v': | |
1402 | *(t++) = '\v'; | |
1403 | break; | |
1404 | case '\\': | |
1405 | *(t++) = '\\'; | |
1406 | break; | |
1407 | case '"': | |
1408 | *(t++) = '"'; | |
1409 | break; | |
1410 | case '\'': | |
1411 | *(t++) = '\''; | |
1412 | break; | |
1413 | ||
1414 | case 's': | |
1415 | /* This is an extension of the XDG syntax files */ | |
1416 | *(t++) = ' '; | |
1417 | break; | |
1418 | ||
1419 | case 'x': { | |
1420 | /* hexadecimal encoding */ | |
e735f4d4 | 1421 | int a = -1, b = -1; |
663996b3 | 1422 | |
e735f4d4 MP |
1423 | if (remaining >= 2) { |
1424 | a = unhexchar(f[1]); | |
1425 | b = unhexchar(f[2]); | |
1426 | } | |
663996b3 | 1427 | |
e842803a | 1428 | if (a < 0 || b < 0 || (a == 0 && b == 0)) { |
663996b3 MS |
1429 | /* Invalid escape code, let's take it literal then */ |
1430 | *(t++) = '\\'; | |
1431 | *(t++) = 'x'; | |
1432 | } else { | |
1433 | *(t++) = (char) ((a << 4) | b); | |
1434 | f += 2; | |
1435 | } | |
1436 | ||
1437 | break; | |
1438 | } | |
1439 | ||
1440 | case '0': | |
1441 | case '1': | |
1442 | case '2': | |
1443 | case '3': | |
1444 | case '4': | |
1445 | case '5': | |
1446 | case '6': | |
1447 | case '7': { | |
1448 | /* octal encoding */ | |
e735f4d4 | 1449 | int a = -1, b = -1, c = -1; |
663996b3 | 1450 | |
e735f4d4 MP |
1451 | if (remaining >= 3) { |
1452 | a = unoctchar(f[0]); | |
1453 | b = unoctchar(f[1]); | |
1454 | c = unoctchar(f[2]); | |
1455 | } | |
663996b3 | 1456 | |
e842803a | 1457 | if (a < 0 || b < 0 || c < 0 || (a == 0 && b == 0 && c == 0)) { |
663996b3 MS |
1458 | /* Invalid escape code, let's take it literal then */ |
1459 | *(t++) = '\\'; | |
1460 | *(t++) = f[0]; | |
1461 | } else { | |
1462 | *(t++) = (char) ((a << 6) | (b << 3) | c); | |
1463 | f += 2; | |
1464 | } | |
1465 | ||
1466 | break; | |
1467 | } | |
1468 | ||
663996b3 MS |
1469 | default: |
1470 | /* Invalid escape code, let's take it literal then */ | |
1471 | *(t++) = '\\'; | |
1472 | *(t++) = *f; | |
1473 | break; | |
1474 | } | |
1475 | } | |
1476 | ||
663996b3 MS |
1477 | *t = 0; |
1478 | return r; | |
1479 | } | |
1480 | ||
1481 | char *cunescape_length(const char *s, size_t length) { | |
1482 | return cunescape_length_with_prefix(s, length, NULL); | |
1483 | } | |
1484 | ||
1485 | char *cunescape(const char *s) { | |
1486 | assert(s); | |
1487 | ||
1488 | return cunescape_length(s, strlen(s)); | |
1489 | } | |
1490 | ||
1491 | char *xescape(const char *s, const char *bad) { | |
1492 | char *r, *t; | |
1493 | const char *f; | |
1494 | ||
1495 | /* Escapes all chars in bad, in addition to \ and all special | |
1496 | * chars, in \xFF style escaping. May be reversed with | |
1497 | * cunescape. */ | |
1498 | ||
1499 | r = new(char, strlen(s) * 4 + 1); | |
1500 | if (!r) | |
1501 | return NULL; | |
1502 | ||
1503 | for (f = s, t = r; *f; f++) { | |
1504 | ||
1505 | if ((*f < ' ') || (*f >= 127) || | |
1506 | (*f == '\\') || strchr(bad, *f)) { | |
1507 | *(t++) = '\\'; | |
1508 | *(t++) = 'x'; | |
1509 | *(t++) = hexchar(*f >> 4); | |
1510 | *(t++) = hexchar(*f); | |
1511 | } else | |
1512 | *(t++) = *f; | |
1513 | } | |
1514 | ||
1515 | *t = 0; | |
1516 | ||
1517 | return r; | |
1518 | } | |
1519 | ||
663996b3 MS |
1520 | char *ascii_strlower(char *t) { |
1521 | char *p; | |
1522 | ||
1523 | assert(t); | |
1524 | ||
1525 | for (p = t; *p; p++) | |
1526 | if (*p >= 'A' && *p <= 'Z') | |
1527 | *p = *p - 'A' + 'a'; | |
1528 | ||
1529 | return t; | |
1530 | } | |
1531 | ||
e735f4d4 | 1532 | _pure_ static bool hidden_file_allow_backup(const char *filename) { |
663996b3 MS |
1533 | assert(filename); |
1534 | ||
1535 | return | |
1536 | filename[0] == '.' || | |
1537 | streq(filename, "lost+found") || | |
1538 | streq(filename, "aquota.user") || | |
1539 | streq(filename, "aquota.group") || | |
1540 | endswith(filename, ".rpmnew") || | |
1541 | endswith(filename, ".rpmsave") || | |
1542 | endswith(filename, ".rpmorig") || | |
1543 | endswith(filename, ".dpkg-old") || | |
1544 | endswith(filename, ".dpkg-new") || | |
5eef597e | 1545 | endswith(filename, ".dpkg-tmp") || |
e735f4d4 MP |
1546 | endswith(filename, ".dpkg-dist") || |
1547 | endswith(filename, ".dpkg-bak") || | |
1548 | endswith(filename, ".dpkg-backup") || | |
1549 | endswith(filename, ".dpkg-remove") || | |
663996b3 MS |
1550 | endswith(filename, ".swp"); |
1551 | } | |
1552 | ||
e735f4d4 | 1553 | bool hidden_file(const char *filename) { |
663996b3 MS |
1554 | assert(filename); |
1555 | ||
1556 | if (endswith(filename, "~")) | |
60f067b4 | 1557 | return true; |
663996b3 | 1558 | |
e735f4d4 | 1559 | return hidden_file_allow_backup(filename); |
663996b3 MS |
1560 | } |
1561 | ||
1562 | int fd_nonblock(int fd, bool nonblock) { | |
60f067b4 | 1563 | int flags, nflags; |
663996b3 MS |
1564 | |
1565 | assert(fd >= 0); | |
1566 | ||
60f067b4 JS |
1567 | flags = fcntl(fd, F_GETFL, 0); |
1568 | if (flags < 0) | |
663996b3 MS |
1569 | return -errno; |
1570 | ||
1571 | if (nonblock) | |
60f067b4 | 1572 | nflags = flags | O_NONBLOCK; |
663996b3 | 1573 | else |
60f067b4 JS |
1574 | nflags = flags & ~O_NONBLOCK; |
1575 | ||
1576 | if (nflags == flags) | |
1577 | return 0; | |
663996b3 | 1578 | |
60f067b4 | 1579 | if (fcntl(fd, F_SETFL, nflags) < 0) |
663996b3 MS |
1580 | return -errno; |
1581 | ||
1582 | return 0; | |
1583 | } | |
1584 | ||
1585 | int fd_cloexec(int fd, bool cloexec) { | |
60f067b4 | 1586 | int flags, nflags; |
663996b3 MS |
1587 | |
1588 | assert(fd >= 0); | |
1589 | ||
60f067b4 JS |
1590 | flags = fcntl(fd, F_GETFD, 0); |
1591 | if (flags < 0) | |
663996b3 MS |
1592 | return -errno; |
1593 | ||
1594 | if (cloexec) | |
60f067b4 | 1595 | nflags = flags | FD_CLOEXEC; |
663996b3 | 1596 | else |
60f067b4 JS |
1597 | nflags = flags & ~FD_CLOEXEC; |
1598 | ||
1599 | if (nflags == flags) | |
1600 | return 0; | |
663996b3 | 1601 | |
60f067b4 | 1602 | if (fcntl(fd, F_SETFD, nflags) < 0) |
663996b3 MS |
1603 | return -errno; |
1604 | ||
1605 | return 0; | |
1606 | } | |
1607 | ||
1608 | _pure_ static bool fd_in_set(int fd, const int fdset[], unsigned n_fdset) { | |
1609 | unsigned i; | |
1610 | ||
1611 | assert(n_fdset == 0 || fdset); | |
1612 | ||
1613 | for (i = 0; i < n_fdset; i++) | |
1614 | if (fdset[i] == fd) | |
1615 | return true; | |
1616 | ||
1617 | return false; | |
1618 | } | |
1619 | ||
1620 | int close_all_fds(const int except[], unsigned n_except) { | |
e842803a | 1621 | _cleanup_closedir_ DIR *d = NULL; |
663996b3 MS |
1622 | struct dirent *de; |
1623 | int r = 0; | |
1624 | ||
1625 | assert(n_except == 0 || except); | |
1626 | ||
1627 | d = opendir("/proc/self/fd"); | |
1628 | if (!d) { | |
1629 | int fd; | |
1630 | struct rlimit rl; | |
1631 | ||
1632 | /* When /proc isn't available (for example in chroots) | |
1633 | * the fallback is brute forcing through the fd | |
1634 | * table */ | |
1635 | ||
1636 | assert_se(getrlimit(RLIMIT_NOFILE, &rl) >= 0); | |
1637 | for (fd = 3; fd < (int) rl.rlim_max; fd ++) { | |
1638 | ||
1639 | if (fd_in_set(fd, except, n_except)) | |
1640 | continue; | |
1641 | ||
1642 | if (close_nointr(fd) < 0) | |
1643 | if (errno != EBADF && r == 0) | |
1644 | r = -errno; | |
1645 | } | |
1646 | ||
1647 | return r; | |
1648 | } | |
1649 | ||
1650 | while ((de = readdir(d))) { | |
1651 | int fd = -1; | |
1652 | ||
e735f4d4 | 1653 | if (hidden_file(de->d_name)) |
663996b3 MS |
1654 | continue; |
1655 | ||
1656 | if (safe_atoi(de->d_name, &fd) < 0) | |
1657 | /* Let's better ignore this, just in case */ | |
1658 | continue; | |
1659 | ||
1660 | if (fd < 3) | |
1661 | continue; | |
1662 | ||
1663 | if (fd == dirfd(d)) | |
1664 | continue; | |
1665 | ||
1666 | if (fd_in_set(fd, except, n_except)) | |
1667 | continue; | |
1668 | ||
1669 | if (close_nointr(fd) < 0) { | |
1670 | /* Valgrind has its own FD and doesn't want to have it closed */ | |
1671 | if (errno != EBADF && r == 0) | |
1672 | r = -errno; | |
1673 | } | |
1674 | } | |
1675 | ||
663996b3 MS |
1676 | return r; |
1677 | } | |
1678 | ||
1679 | bool chars_intersect(const char *a, const char *b) { | |
1680 | const char *p; | |
1681 | ||
1682 | /* Returns true if any of the chars in a are in b. */ | |
1683 | for (p = a; *p; p++) | |
1684 | if (strchr(b, *p)) | |
1685 | return true; | |
1686 | ||
1687 | return false; | |
1688 | } | |
1689 | ||
1690 | bool fstype_is_network(const char *fstype) { | |
1691 | static const char table[] = | |
1692 | "cifs\0" | |
1693 | "smbfs\0" | |
e842803a | 1694 | "sshfs\0" |
663996b3 | 1695 | "ncpfs\0" |
14228c0d | 1696 | "ncp\0" |
663996b3 MS |
1697 | "nfs\0" |
1698 | "nfs4\0" | |
1699 | "gfs\0" | |
60f067b4 JS |
1700 | "gfs2\0" |
1701 | "glusterfs\0"; | |
1702 | ||
1703 | const char *x; | |
1704 | ||
1705 | x = startswith(fstype, "fuse."); | |
1706 | if (x) | |
1707 | fstype = x; | |
663996b3 MS |
1708 | |
1709 | return nulstr_contains(table, fstype); | |
1710 | } | |
1711 | ||
1712 | int chvt(int vt) { | |
1713 | _cleanup_close_ int fd; | |
1714 | ||
1715 | fd = open_terminal("/dev/tty0", O_RDWR|O_NOCTTY|O_CLOEXEC); | |
1716 | if (fd < 0) | |
1717 | return -errno; | |
1718 | ||
1719 | if (vt < 0) { | |
1720 | int tiocl[2] = { | |
1721 | TIOCL_GETKMSGREDIRECT, | |
1722 | 0 | |
1723 | }; | |
1724 | ||
1725 | if (ioctl(fd, TIOCLINUX, tiocl) < 0) | |
1726 | return -errno; | |
1727 | ||
1728 | vt = tiocl[0] <= 0 ? 1 : tiocl[0]; | |
1729 | } | |
1730 | ||
1731 | if (ioctl(fd, VT_ACTIVATE, vt) < 0) | |
1732 | return -errno; | |
1733 | ||
1734 | return 0; | |
1735 | } | |
1736 | ||
1737 | int read_one_char(FILE *f, char *ret, usec_t t, bool *need_nl) { | |
1738 | struct termios old_termios, new_termios; | |
e842803a | 1739 | char c, line[LINE_MAX]; |
663996b3 MS |
1740 | |
1741 | assert(f); | |
1742 | assert(ret); | |
1743 | ||
1744 | if (tcgetattr(fileno(f), &old_termios) >= 0) { | |
1745 | new_termios = old_termios; | |
1746 | ||
1747 | new_termios.c_lflag &= ~ICANON; | |
1748 | new_termios.c_cc[VMIN] = 1; | |
1749 | new_termios.c_cc[VTIME] = 0; | |
1750 | ||
1751 | if (tcsetattr(fileno(f), TCSADRAIN, &new_termios) >= 0) { | |
1752 | size_t k; | |
1753 | ||
5eef597e | 1754 | if (t != USEC_INFINITY) { |
663996b3 MS |
1755 | if (fd_wait_for_event(fileno(f), POLLIN, t) <= 0) { |
1756 | tcsetattr(fileno(f), TCSADRAIN, &old_termios); | |
1757 | return -ETIMEDOUT; | |
1758 | } | |
1759 | } | |
1760 | ||
1761 | k = fread(&c, 1, 1, f); | |
1762 | ||
1763 | tcsetattr(fileno(f), TCSADRAIN, &old_termios); | |
1764 | ||
1765 | if (k <= 0) | |
1766 | return -EIO; | |
1767 | ||
1768 | if (need_nl) | |
1769 | *need_nl = c != '\n'; | |
1770 | ||
1771 | *ret = c; | |
1772 | return 0; | |
1773 | } | |
1774 | } | |
1775 | ||
5eef597e | 1776 | if (t != USEC_INFINITY) { |
663996b3 MS |
1777 | if (fd_wait_for_event(fileno(f), POLLIN, t) <= 0) |
1778 | return -ETIMEDOUT; | |
e842803a | 1779 | } |
663996b3 | 1780 | |
5eef597e | 1781 | errno = 0; |
663996b3 | 1782 | if (!fgets(line, sizeof(line), f)) |
5eef597e | 1783 | return errno ? -errno : -EIO; |
663996b3 MS |
1784 | |
1785 | truncate_nl(line); | |
1786 | ||
1787 | if (strlen(line) != 1) | |
1788 | return -EBADMSG; | |
1789 | ||
1790 | if (need_nl) | |
1791 | *need_nl = false; | |
1792 | ||
1793 | *ret = line[0]; | |
1794 | return 0; | |
1795 | } | |
1796 | ||
5eef597e | 1797 | int ask_char(char *ret, const char *replies, const char *text, ...) { |
e842803a | 1798 | int r; |
663996b3 MS |
1799 | |
1800 | assert(ret); | |
1801 | assert(replies); | |
1802 | assert(text); | |
1803 | ||
1804 | for (;;) { | |
1805 | va_list ap; | |
1806 | char c; | |
663996b3 MS |
1807 | bool need_nl = true; |
1808 | ||
1809 | if (on_tty()) | |
1810 | fputs(ANSI_HIGHLIGHT_ON, stdout); | |
1811 | ||
1812 | va_start(ap, text); | |
1813 | vprintf(text, ap); | |
1814 | va_end(ap); | |
1815 | ||
1816 | if (on_tty()) | |
1817 | fputs(ANSI_HIGHLIGHT_OFF, stdout); | |
1818 | ||
1819 | fflush(stdout); | |
1820 | ||
5eef597e | 1821 | r = read_one_char(stdin, &c, USEC_INFINITY, &need_nl); |
663996b3 MS |
1822 | if (r < 0) { |
1823 | ||
1824 | if (r == -EBADMSG) { | |
1825 | puts("Bad input, please try again."); | |
1826 | continue; | |
1827 | } | |
1828 | ||
1829 | putchar('\n'); | |
1830 | return r; | |
1831 | } | |
1832 | ||
1833 | if (need_nl) | |
1834 | putchar('\n'); | |
1835 | ||
1836 | if (strchr(replies, c)) { | |
1837 | *ret = c; | |
1838 | return 0; | |
1839 | } | |
1840 | ||
1841 | puts("Read unexpected character, please try again."); | |
1842 | } | |
1843 | } | |
1844 | ||
5eef597e MP |
1845 | int ask_string(char **ret, const char *text, ...) { |
1846 | assert(ret); | |
1847 | assert(text); | |
1848 | ||
1849 | for (;;) { | |
1850 | char line[LINE_MAX]; | |
1851 | va_list ap; | |
1852 | ||
1853 | if (on_tty()) | |
1854 | fputs(ANSI_HIGHLIGHT_ON, stdout); | |
1855 | ||
1856 | va_start(ap, text); | |
1857 | vprintf(text, ap); | |
1858 | va_end(ap); | |
1859 | ||
1860 | if (on_tty()) | |
1861 | fputs(ANSI_HIGHLIGHT_OFF, stdout); | |
1862 | ||
1863 | fflush(stdout); | |
1864 | ||
1865 | errno = 0; | |
1866 | if (!fgets(line, sizeof(line), stdin)) | |
1867 | return errno ? -errno : -EIO; | |
1868 | ||
1869 | if (!endswith(line, "\n")) | |
1870 | putchar('\n'); | |
1871 | else { | |
1872 | char *s; | |
1873 | ||
1874 | if (isempty(line)) | |
1875 | continue; | |
1876 | ||
1877 | truncate_nl(line); | |
1878 | s = strdup(line); | |
1879 | if (!s) | |
1880 | return -ENOMEM; | |
1881 | ||
1882 | *ret = s; | |
1883 | return 0; | |
1884 | } | |
1885 | } | |
1886 | } | |
1887 | ||
663996b3 MS |
1888 | int reset_terminal_fd(int fd, bool switch_to_text) { |
1889 | struct termios termios; | |
1890 | int r = 0; | |
1891 | ||
1892 | /* Set terminal to some sane defaults */ | |
1893 | ||
1894 | assert(fd >= 0); | |
1895 | ||
1896 | /* We leave locked terminal attributes untouched, so that | |
1897 | * Plymouth may set whatever it wants to set, and we don't | |
1898 | * interfere with that. */ | |
1899 | ||
1900 | /* Disable exclusive mode, just in case */ | |
1901 | ioctl(fd, TIOCNXCL); | |
1902 | ||
1903 | /* Switch to text mode */ | |
1904 | if (switch_to_text) | |
1905 | ioctl(fd, KDSETMODE, KD_TEXT); | |
1906 | ||
1907 | /* Enable console unicode mode */ | |
1908 | ioctl(fd, KDSKBMODE, K_UNICODE); | |
1909 | ||
1910 | if (tcgetattr(fd, &termios) < 0) { | |
1911 | r = -errno; | |
1912 | goto finish; | |
1913 | } | |
1914 | ||
1915 | /* We only reset the stuff that matters to the software. How | |
1916 | * hardware is set up we don't touch assuming that somebody | |
1917 | * else will do that for us */ | |
1918 | ||
1919 | termios.c_iflag &= ~(IGNBRK | BRKINT | ISTRIP | INLCR | IGNCR | IUCLC); | |
1920 | termios.c_iflag |= ICRNL | IMAXBEL | IUTF8; | |
1921 | termios.c_oflag |= ONLCR; | |
1922 | termios.c_cflag |= CREAD; | |
1923 | termios.c_lflag = ISIG | ICANON | IEXTEN | ECHO | ECHOE | ECHOK | ECHOCTL | ECHOPRT | ECHOKE; | |
1924 | ||
1925 | termios.c_cc[VINTR] = 03; /* ^C */ | |
1926 | termios.c_cc[VQUIT] = 034; /* ^\ */ | |
1927 | termios.c_cc[VERASE] = 0177; | |
1928 | termios.c_cc[VKILL] = 025; /* ^X */ | |
1929 | termios.c_cc[VEOF] = 04; /* ^D */ | |
1930 | termios.c_cc[VSTART] = 021; /* ^Q */ | |
1931 | termios.c_cc[VSTOP] = 023; /* ^S */ | |
1932 | termios.c_cc[VSUSP] = 032; /* ^Z */ | |
1933 | termios.c_cc[VLNEXT] = 026; /* ^V */ | |
1934 | termios.c_cc[VWERASE] = 027; /* ^W */ | |
1935 | termios.c_cc[VREPRINT] = 022; /* ^R */ | |
1936 | termios.c_cc[VEOL] = 0; | |
1937 | termios.c_cc[VEOL2] = 0; | |
1938 | ||
1939 | termios.c_cc[VTIME] = 0; | |
1940 | termios.c_cc[VMIN] = 1; | |
1941 | ||
1942 | if (tcsetattr(fd, TCSANOW, &termios) < 0) | |
1943 | r = -errno; | |
1944 | ||
1945 | finish: | |
1946 | /* Just in case, flush all crap out */ | |
1947 | tcflush(fd, TCIOFLUSH); | |
1948 | ||
1949 | return r; | |
1950 | } | |
1951 | ||
1952 | int reset_terminal(const char *name) { | |
60f067b4 | 1953 | _cleanup_close_ int fd = -1; |
663996b3 MS |
1954 | |
1955 | fd = open_terminal(name, O_RDWR|O_NOCTTY|O_CLOEXEC); | |
1956 | if (fd < 0) | |
1957 | return fd; | |
1958 | ||
60f067b4 | 1959 | return reset_terminal_fd(fd, true); |
663996b3 MS |
1960 | } |
1961 | ||
1962 | int open_terminal(const char *name, int mode) { | |
1963 | int fd, r; | |
1964 | unsigned c = 0; | |
1965 | ||
1966 | /* | |
1967 | * If a TTY is in the process of being closed opening it might | |
1968 | * cause EIO. This is horribly awful, but unlikely to be | |
1969 | * changed in the kernel. Hence we work around this problem by | |
1970 | * retrying a couple of times. | |
1971 | * | |
1972 | * https://bugs.launchpad.net/ubuntu/+source/linux/+bug/554172/comments/245 | |
1973 | */ | |
1974 | ||
14228c0d MB |
1975 | assert(!(mode & O_CREAT)); |
1976 | ||
663996b3 | 1977 | for (;;) { |
14228c0d | 1978 | fd = open(name, mode, 0); |
663996b3 MS |
1979 | if (fd >= 0) |
1980 | break; | |
1981 | ||
1982 | if (errno != EIO) | |
1983 | return -errno; | |
1984 | ||
1985 | /* Max 1s in total */ | |
1986 | if (c >= 20) | |
1987 | return -errno; | |
1988 | ||
1989 | usleep(50 * USEC_PER_MSEC); | |
1990 | c++; | |
1991 | } | |
1992 | ||
663996b3 MS |
1993 | r = isatty(fd); |
1994 | if (r < 0) { | |
60f067b4 | 1995 | safe_close(fd); |
663996b3 MS |
1996 | return -errno; |
1997 | } | |
1998 | ||
1999 | if (!r) { | |
60f067b4 | 2000 | safe_close(fd); |
663996b3 MS |
2001 | return -ENOTTY; |
2002 | } | |
2003 | ||
2004 | return fd; | |
2005 | } | |
2006 | ||
2007 | int flush_fd(int fd) { | |
2008 | struct pollfd pollfd = { | |
2009 | .fd = fd, | |
2010 | .events = POLLIN, | |
2011 | }; | |
2012 | ||
2013 | for (;;) { | |
2014 | char buf[LINE_MAX]; | |
2015 | ssize_t l; | |
2016 | int r; | |
2017 | ||
2018 | r = poll(&pollfd, 1, 0); | |
2019 | if (r < 0) { | |
2020 | if (errno == EINTR) | |
2021 | continue; | |
2022 | ||
2023 | return -errno; | |
2024 | ||
2025 | } else if (r == 0) | |
2026 | return 0; | |
2027 | ||
2028 | l = read(fd, buf, sizeof(buf)); | |
2029 | if (l < 0) { | |
2030 | ||
2031 | if (errno == EINTR) | |
2032 | continue; | |
2033 | ||
2034 | if (errno == EAGAIN) | |
2035 | return 0; | |
2036 | ||
2037 | return -errno; | |
2038 | } else if (l == 0) | |
2039 | return 0; | |
2040 | } | |
2041 | } | |
2042 | ||
2043 | int acquire_terminal( | |
2044 | const char *name, | |
2045 | bool fail, | |
2046 | bool force, | |
2047 | bool ignore_tiocstty_eperm, | |
2048 | usec_t timeout) { | |
2049 | ||
2050 | int fd = -1, notify = -1, r = 0, wd = -1; | |
2051 | usec_t ts = 0; | |
2052 | ||
2053 | assert(name); | |
2054 | ||
2055 | /* We use inotify to be notified when the tty is closed. We | |
2056 | * create the watch before checking if we can actually acquire | |
2057 | * it, so that we don't lose any event. | |
2058 | * | |
2059 | * Note: strictly speaking this actually watches for the | |
2060 | * device being closed, it does *not* really watch whether a | |
2061 | * tty loses its controlling process. However, unless some | |
2062 | * rogue process uses TIOCNOTTY on /dev/tty *after* closing | |
2063 | * its tty otherwise this will not become a problem. As long | |
2064 | * as the administrator makes sure not configure any service | |
2065 | * on the same tty as an untrusted user this should not be a | |
2066 | * problem. (Which he probably should not do anyway.) */ | |
2067 | ||
5eef597e | 2068 | if (timeout != USEC_INFINITY) |
663996b3 MS |
2069 | ts = now(CLOCK_MONOTONIC); |
2070 | ||
2071 | if (!fail && !force) { | |
5eef597e | 2072 | notify = inotify_init1(IN_CLOEXEC | (timeout != USEC_INFINITY ? IN_NONBLOCK : 0)); |
663996b3 MS |
2073 | if (notify < 0) { |
2074 | r = -errno; | |
2075 | goto fail; | |
2076 | } | |
2077 | ||
2078 | wd = inotify_add_watch(notify, name, IN_CLOSE); | |
2079 | if (wd < 0) { | |
2080 | r = -errno; | |
2081 | goto fail; | |
2082 | } | |
2083 | } | |
2084 | ||
2085 | for (;;) { | |
2086 | struct sigaction sa_old, sa_new = { | |
2087 | .sa_handler = SIG_IGN, | |
2088 | .sa_flags = SA_RESTART, | |
2089 | }; | |
2090 | ||
2091 | if (notify >= 0) { | |
2092 | r = flush_fd(notify); | |
2093 | if (r < 0) | |
2094 | goto fail; | |
2095 | } | |
2096 | ||
2097 | /* We pass here O_NOCTTY only so that we can check the return | |
2098 | * value TIOCSCTTY and have a reliable way to figure out if we | |
2099 | * successfully became the controlling process of the tty */ | |
2100 | fd = open_terminal(name, O_RDWR|O_NOCTTY|O_CLOEXEC); | |
2101 | if (fd < 0) | |
2102 | return fd; | |
2103 | ||
2104 | /* Temporarily ignore SIGHUP, so that we don't get SIGHUP'ed | |
2105 | * if we already own the tty. */ | |
2106 | assert_se(sigaction(SIGHUP, &sa_new, &sa_old) == 0); | |
2107 | ||
2108 | /* First, try to get the tty */ | |
2109 | if (ioctl(fd, TIOCSCTTY, force) < 0) | |
2110 | r = -errno; | |
2111 | ||
2112 | assert_se(sigaction(SIGHUP, &sa_old, NULL) == 0); | |
2113 | ||
2114 | /* Sometimes it makes sense to ignore TIOCSCTTY | |
2115 | * returning EPERM, i.e. when very likely we already | |
2116 | * are have this controlling terminal. */ | |
2117 | if (r < 0 && r == -EPERM && ignore_tiocstty_eperm) | |
2118 | r = 0; | |
2119 | ||
2120 | if (r < 0 && (force || fail || r != -EPERM)) { | |
2121 | goto fail; | |
2122 | } | |
2123 | ||
2124 | if (r >= 0) | |
2125 | break; | |
2126 | ||
2127 | assert(!fail); | |
2128 | assert(!force); | |
2129 | assert(notify >= 0); | |
2130 | ||
2131 | for (;;) { | |
e735f4d4 | 2132 | union inotify_event_buffer buffer; |
663996b3 | 2133 | struct inotify_event *e; |
f47781d8 | 2134 | ssize_t l; |
663996b3 | 2135 | |
5eef597e | 2136 | if (timeout != USEC_INFINITY) { |
663996b3 MS |
2137 | usec_t n; |
2138 | ||
2139 | n = now(CLOCK_MONOTONIC); | |
2140 | if (ts + timeout < n) { | |
2141 | r = -ETIMEDOUT; | |
2142 | goto fail; | |
2143 | } | |
2144 | ||
2145 | r = fd_wait_for_event(fd, POLLIN, ts + timeout - n); | |
2146 | if (r < 0) | |
2147 | goto fail; | |
2148 | ||
2149 | if (r == 0) { | |
2150 | r = -ETIMEDOUT; | |
2151 | goto fail; | |
2152 | } | |
2153 | } | |
2154 | ||
e735f4d4 | 2155 | l = read(notify, &buffer, sizeof(buffer)); |
663996b3 | 2156 | if (l < 0) { |
663996b3 MS |
2157 | if (errno == EINTR || errno == EAGAIN) |
2158 | continue; | |
2159 | ||
2160 | r = -errno; | |
2161 | goto fail; | |
2162 | } | |
2163 | ||
f47781d8 | 2164 | FOREACH_INOTIFY_EVENT(e, buffer, l) { |
663996b3 MS |
2165 | if (e->wd != wd || !(e->mask & IN_CLOSE)) { |
2166 | r = -EIO; | |
2167 | goto fail; | |
2168 | } | |
663996b3 MS |
2169 | } |
2170 | ||
2171 | break; | |
2172 | } | |
2173 | ||
2174 | /* We close the tty fd here since if the old session | |
2175 | * ended our handle will be dead. It's important that | |
2176 | * we do this after sleeping, so that we don't enter | |
2177 | * an endless loop. */ | |
5eef597e | 2178 | fd = safe_close(fd); |
663996b3 MS |
2179 | } |
2180 | ||
60f067b4 | 2181 | safe_close(notify); |
663996b3 MS |
2182 | |
2183 | r = reset_terminal_fd(fd, true); | |
2184 | if (r < 0) | |
f47781d8 | 2185 | log_warning_errno(r, "Failed to reset terminal: %m"); |
663996b3 MS |
2186 | |
2187 | return fd; | |
2188 | ||
2189 | fail: | |
60f067b4 JS |
2190 | safe_close(fd); |
2191 | safe_close(notify); | |
663996b3 MS |
2192 | |
2193 | return r; | |
2194 | } | |
2195 | ||
2196 | int release_terminal(void) { | |
5eef597e | 2197 | static const struct sigaction sa_new = { |
663996b3 MS |
2198 | .sa_handler = SIG_IGN, |
2199 | .sa_flags = SA_RESTART, | |
2200 | }; | |
5eef597e MP |
2201 | |
2202 | _cleanup_close_ int fd = -1; | |
2203 | struct sigaction sa_old; | |
2204 | int r = 0; | |
663996b3 MS |
2205 | |
2206 | fd = open("/dev/tty", O_RDWR|O_NOCTTY|O_NDELAY|O_CLOEXEC); | |
2207 | if (fd < 0) | |
2208 | return -errno; | |
2209 | ||
2210 | /* Temporarily ignore SIGHUP, so that we don't get SIGHUP'ed | |
2211 | * by our own TIOCNOTTY */ | |
2212 | assert_se(sigaction(SIGHUP, &sa_new, &sa_old) == 0); | |
2213 | ||
2214 | if (ioctl(fd, TIOCNOTTY) < 0) | |
2215 | r = -errno; | |
2216 | ||
2217 | assert_se(sigaction(SIGHUP, &sa_old, NULL) == 0); | |
2218 | ||
2219 | return r; | |
2220 | } | |
2221 | ||
2222 | int sigaction_many(const struct sigaction *sa, ...) { | |
2223 | va_list ap; | |
2224 | int r = 0, sig; | |
2225 | ||
2226 | va_start(ap, sa); | |
2227 | while ((sig = va_arg(ap, int)) > 0) | |
2228 | if (sigaction(sig, sa, NULL) < 0) | |
2229 | r = -errno; | |
2230 | va_end(ap); | |
2231 | ||
2232 | return r; | |
2233 | } | |
2234 | ||
2235 | int ignore_signals(int sig, ...) { | |
2236 | struct sigaction sa = { | |
2237 | .sa_handler = SIG_IGN, | |
2238 | .sa_flags = SA_RESTART, | |
2239 | }; | |
2240 | va_list ap; | |
2241 | int r = 0; | |
2242 | ||
663996b3 MS |
2243 | if (sigaction(sig, &sa, NULL) < 0) |
2244 | r = -errno; | |
2245 | ||
2246 | va_start(ap, sig); | |
2247 | while ((sig = va_arg(ap, int)) > 0) | |
2248 | if (sigaction(sig, &sa, NULL) < 0) | |
2249 | r = -errno; | |
2250 | va_end(ap); | |
2251 | ||
2252 | return r; | |
2253 | } | |
2254 | ||
2255 | int default_signals(int sig, ...) { | |
2256 | struct sigaction sa = { | |
2257 | .sa_handler = SIG_DFL, | |
2258 | .sa_flags = SA_RESTART, | |
2259 | }; | |
2260 | va_list ap; | |
2261 | int r = 0; | |
2262 | ||
2263 | if (sigaction(sig, &sa, NULL) < 0) | |
2264 | r = -errno; | |
2265 | ||
2266 | va_start(ap, sig); | |
2267 | while ((sig = va_arg(ap, int)) > 0) | |
2268 | if (sigaction(sig, &sa, NULL) < 0) | |
2269 | r = -errno; | |
2270 | va_end(ap); | |
2271 | ||
2272 | return r; | |
2273 | } | |
2274 | ||
60f067b4 | 2275 | void safe_close_pair(int p[]) { |
663996b3 MS |
2276 | assert(p); |
2277 | ||
60f067b4 JS |
2278 | if (p[0] == p[1]) { |
2279 | /* Special case pairs which use the same fd in both | |
2280 | * directions... */ | |
2281 | p[0] = p[1] = safe_close(p[0]); | |
2282 | return; | |
663996b3 MS |
2283 | } |
2284 | ||
60f067b4 JS |
2285 | p[0] = safe_close(p[0]); |
2286 | p[1] = safe_close(p[1]); | |
663996b3 MS |
2287 | } |
2288 | ||
2289 | ssize_t loop_read(int fd, void *buf, size_t nbytes, bool do_poll) { | |
60f067b4 | 2290 | uint8_t *p = buf; |
663996b3 MS |
2291 | ssize_t n = 0; |
2292 | ||
2293 | assert(fd >= 0); | |
2294 | assert(buf); | |
2295 | ||
663996b3 MS |
2296 | while (nbytes > 0) { |
2297 | ssize_t k; | |
2298 | ||
60f067b4 | 2299 | k = read(fd, p, nbytes); |
e735f4d4 MP |
2300 | if (k < 0) { |
2301 | if (errno == EINTR) | |
2302 | continue; | |
663996b3 | 2303 | |
e735f4d4 | 2304 | if (errno == EAGAIN && do_poll) { |
663996b3 | 2305 | |
e735f4d4 MP |
2306 | /* We knowingly ignore any return value here, |
2307 | * and expect that any error/EOF is reported | |
2308 | * via read() */ | |
663996b3 | 2309 | |
e735f4d4 MP |
2310 | fd_wait_for_event(fd, POLLIN, USEC_INFINITY); |
2311 | continue; | |
2312 | } | |
2313 | ||
2314 | return n > 0 ? n : -errno; | |
60f067b4 | 2315 | } |
663996b3 | 2316 | |
e735f4d4 MP |
2317 | if (k == 0) |
2318 | return n; | |
663996b3 MS |
2319 | |
2320 | p += k; | |
2321 | nbytes -= k; | |
2322 | n += k; | |
2323 | } | |
2324 | ||
2325 | return n; | |
2326 | } | |
2327 | ||
f47781d8 | 2328 | int loop_write(int fd, const void *buf, size_t nbytes, bool do_poll) { |
60f067b4 | 2329 | const uint8_t *p = buf; |
663996b3 MS |
2330 | |
2331 | assert(fd >= 0); | |
2332 | assert(buf); | |
2333 | ||
f47781d8 MP |
2334 | errno = 0; |
2335 | ||
663996b3 MS |
2336 | while (nbytes > 0) { |
2337 | ssize_t k; | |
2338 | ||
2339 | k = write(fd, p, nbytes); | |
e735f4d4 MP |
2340 | if (k < 0) { |
2341 | if (errno == EINTR) | |
2342 | continue; | |
663996b3 | 2343 | |
e735f4d4 MP |
2344 | if (errno == EAGAIN && do_poll) { |
2345 | /* We knowingly ignore any return value here, | |
2346 | * and expect that any error/EOF is reported | |
2347 | * via write() */ | |
663996b3 | 2348 | |
e735f4d4 MP |
2349 | fd_wait_for_event(fd, POLLOUT, USEC_INFINITY); |
2350 | continue; | |
2351 | } | |
663996b3 | 2352 | |
e735f4d4 | 2353 | return -errno; |
60f067b4 | 2354 | } |
663996b3 | 2355 | |
e735f4d4 MP |
2356 | if (k == 0) /* Can't really happen */ |
2357 | return -EIO; | |
663996b3 MS |
2358 | |
2359 | p += k; | |
2360 | nbytes -= k; | |
663996b3 MS |
2361 | } |
2362 | ||
f47781d8 | 2363 | return 0; |
663996b3 MS |
2364 | } |
2365 | ||
60f067b4 JS |
2366 | int parse_size(const char *t, off_t base, off_t *size) { |
2367 | ||
2368 | /* Soo, sometimes we want to parse IEC binary suffxies, and | |
2369 | * sometimes SI decimal suffixes. This function can parse | |
2370 | * both. Which one is the right way depends on the | |
2371 | * context. Wikipedia suggests that SI is customary for | |
2372 | * hardrware metrics and network speeds, while IEC is | |
2373 | * customary for most data sizes used by software and volatile | |
2374 | * (RAM) memory. Hence be careful which one you pick! | |
2375 | * | |
2376 | * In either case we use just K, M, G as suffix, and not Ki, | |
2377 | * Mi, Gi or so (as IEC would suggest). That's because that's | |
2378 | * frickin' ugly. But this means you really need to make sure | |
2379 | * to document which base you are parsing when you use this | |
2380 | * call. */ | |
2381 | ||
2382 | struct table { | |
663996b3 | 2383 | const char *suffix; |
14228c0d | 2384 | unsigned long long factor; |
60f067b4 JS |
2385 | }; |
2386 | ||
2387 | static const struct table iec[] = { | |
663996b3 | 2388 | { "E", 1024ULL*1024ULL*1024ULL*1024ULL*1024ULL*1024ULL }, |
60f067b4 JS |
2389 | { "P", 1024ULL*1024ULL*1024ULL*1024ULL*1024ULL }, |
2390 | { "T", 1024ULL*1024ULL*1024ULL*1024ULL }, | |
2391 | { "G", 1024ULL*1024ULL*1024ULL }, | |
2392 | { "M", 1024ULL*1024ULL }, | |
2393 | { "K", 1024ULL }, | |
2394 | { "B", 1 }, | |
2395 | { "", 1 }, | |
2396 | }; | |
2397 | ||
2398 | static const struct table si[] = { | |
2399 | { "E", 1000ULL*1000ULL*1000ULL*1000ULL*1000ULL*1000ULL }, | |
2400 | { "P", 1000ULL*1000ULL*1000ULL*1000ULL*1000ULL }, | |
2401 | { "T", 1000ULL*1000ULL*1000ULL*1000ULL }, | |
2402 | { "G", 1000ULL*1000ULL*1000ULL }, | |
2403 | { "M", 1000ULL*1000ULL }, | |
2404 | { "K", 1000ULL }, | |
2405 | { "B", 1 }, | |
663996b3 MS |
2406 | { "", 1 }, |
2407 | }; | |
2408 | ||
60f067b4 | 2409 | const struct table *table; |
663996b3 | 2410 | const char *p; |
14228c0d | 2411 | unsigned long long r = 0; |
60f067b4 | 2412 | unsigned n_entries, start_pos = 0; |
663996b3 MS |
2413 | |
2414 | assert(t); | |
60f067b4 JS |
2415 | assert(base == 1000 || base == 1024); |
2416 | assert(size); | |
2417 | ||
2418 | if (base == 1000) { | |
2419 | table = si; | |
2420 | n_entries = ELEMENTSOF(si); | |
2421 | } else { | |
2422 | table = iec; | |
2423 | n_entries = ELEMENTSOF(iec); | |
2424 | } | |
663996b3 MS |
2425 | |
2426 | p = t; | |
2427 | do { | |
2428 | long long l; | |
60f067b4 JS |
2429 | unsigned long long l2; |
2430 | double frac = 0; | |
663996b3 MS |
2431 | char *e; |
2432 | unsigned i; | |
2433 | ||
2434 | errno = 0; | |
2435 | l = strtoll(p, &e, 10); | |
2436 | ||
2437 | if (errno > 0) | |
2438 | return -errno; | |
2439 | ||
2440 | if (l < 0) | |
2441 | return -ERANGE; | |
2442 | ||
2443 | if (e == p) | |
2444 | return -EINVAL; | |
2445 | ||
60f067b4 JS |
2446 | if (*e == '.') { |
2447 | e++; | |
2448 | if (*e >= '0' && *e <= '9') { | |
2449 | char *e2; | |
2450 | ||
2451 | /* strotoull itself would accept space/+/- */ | |
2452 | l2 = strtoull(e, &e2, 10); | |
2453 | ||
2454 | if (errno == ERANGE) | |
2455 | return -errno; | |
2456 | ||
2457 | /* Ignore failure. E.g. 10.M is valid */ | |
2458 | frac = l2; | |
2459 | for (; e < e2; e++) | |
2460 | frac /= 10; | |
2461 | } | |
2462 | } | |
2463 | ||
663996b3 MS |
2464 | e += strspn(e, WHITESPACE); |
2465 | ||
60f067b4 | 2466 | for (i = start_pos; i < n_entries; i++) |
663996b3 | 2467 | if (startswith(e, table[i].suffix)) { |
14228c0d | 2468 | unsigned long long tmp; |
60f067b4 | 2469 | if ((unsigned long long) l + (frac > 0) > ULLONG_MAX / table[i].factor) |
14228c0d | 2470 | return -ERANGE; |
60f067b4 | 2471 | tmp = l * table[i].factor + (unsigned long long) (frac * table[i].factor); |
14228c0d MB |
2472 | if (tmp > ULLONG_MAX - r) |
2473 | return -ERANGE; | |
2474 | ||
2475 | r += tmp; | |
2476 | if ((unsigned long long) (off_t) r != r) | |
2477 | return -ERANGE; | |
2478 | ||
663996b3 | 2479 | p = e + strlen(table[i].suffix); |
60f067b4 JS |
2480 | |
2481 | start_pos = i + 1; | |
663996b3 MS |
2482 | break; |
2483 | } | |
2484 | ||
60f067b4 | 2485 | if (i >= n_entries) |
663996b3 MS |
2486 | return -EINVAL; |
2487 | ||
14228c0d | 2488 | } while (*p); |
663996b3 | 2489 | |
60f067b4 | 2490 | *size = r; |
663996b3 MS |
2491 | |
2492 | return 0; | |
2493 | } | |
2494 | ||
2495 | int make_stdio(int fd) { | |
2496 | int r, s, t; | |
2497 | ||
2498 | assert(fd >= 0); | |
2499 | ||
e735f4d4 MP |
2500 | r = dup2(fd, STDIN_FILENO); |
2501 | s = dup2(fd, STDOUT_FILENO); | |
2502 | t = dup2(fd, STDERR_FILENO); | |
663996b3 MS |
2503 | |
2504 | if (fd >= 3) | |
60f067b4 | 2505 | safe_close(fd); |
663996b3 MS |
2506 | |
2507 | if (r < 0 || s < 0 || t < 0) | |
2508 | return -errno; | |
2509 | ||
e735f4d4 MP |
2510 | /* Explicitly unset O_CLOEXEC, since if fd was < 3, then |
2511 | * dup2() was a NOP and the bit hence possibly set. */ | |
2512 | fd_cloexec(STDIN_FILENO, false); | |
2513 | fd_cloexec(STDOUT_FILENO, false); | |
2514 | fd_cloexec(STDERR_FILENO, false); | |
663996b3 MS |
2515 | |
2516 | return 0; | |
2517 | } | |
2518 | ||
2519 | int make_null_stdio(void) { | |
2520 | int null_fd; | |
2521 | ||
2522 | null_fd = open("/dev/null", O_RDWR|O_NOCTTY); | |
2523 | if (null_fd < 0) | |
2524 | return -errno; | |
2525 | ||
2526 | return make_stdio(null_fd); | |
2527 | } | |
2528 | ||
2529 | bool is_device_path(const char *path) { | |
2530 | ||
2531 | /* Returns true on paths that refer to a device, either in | |
2532 | * sysfs or in /dev */ | |
2533 | ||
2534 | return | |
2535 | path_startswith(path, "/dev/") || | |
2536 | path_startswith(path, "/sys/"); | |
2537 | } | |
2538 | ||
2539 | int dir_is_empty(const char *path) { | |
2540 | _cleanup_closedir_ DIR *d; | |
663996b3 MS |
2541 | |
2542 | d = opendir(path); | |
2543 | if (!d) | |
2544 | return -errno; | |
2545 | ||
2546 | for (;;) { | |
2547 | struct dirent *de; | |
663996b3 | 2548 | |
60f067b4 JS |
2549 | errno = 0; |
2550 | de = readdir(d); | |
2551 | if (!de && errno != 0) | |
2552 | return -errno; | |
663996b3 MS |
2553 | |
2554 | if (!de) | |
2555 | return 1; | |
2556 | ||
e735f4d4 | 2557 | if (!hidden_file(de->d_name)) |
663996b3 MS |
2558 | return 0; |
2559 | } | |
2560 | } | |
2561 | ||
2562 | char* dirname_malloc(const char *path) { | |
2563 | char *d, *dir, *dir2; | |
2564 | ||
2565 | d = strdup(path); | |
2566 | if (!d) | |
2567 | return NULL; | |
2568 | dir = dirname(d); | |
2569 | assert(dir); | |
2570 | ||
2571 | if (dir != d) { | |
2572 | dir2 = strdup(dir); | |
2573 | free(d); | |
2574 | return dir2; | |
2575 | } | |
2576 | ||
2577 | return dir; | |
2578 | } | |
2579 | ||
60f067b4 | 2580 | int dev_urandom(void *p, size_t n) { |
f47781d8 MP |
2581 | static int have_syscall = -1; |
2582 | int r, fd; | |
60f067b4 | 2583 | ssize_t k; |
663996b3 | 2584 | |
f47781d8 MP |
2585 | /* Gathers some randomness from the kernel. This call will |
2586 | * never block, and will always return some data from the | |
2587 | * kernel, regardless if the random pool is fully initialized | |
2588 | * or not. It thus makes no guarantee for the quality of the | |
2589 | * returned entropy, but is good enough for or usual usecases | |
2590 | * of seeding the hash functions for hashtable */ | |
2591 | ||
2592 | /* Use the getrandom() syscall unless we know we don't have | |
2593 | * it, or when the requested size is too large for it. */ | |
2594 | if (have_syscall != 0 || (size_t) (int) n != n) { | |
2595 | r = getrandom(p, n, GRND_NONBLOCK); | |
2596 | if (r == (int) n) { | |
2597 | have_syscall = true; | |
2598 | return 0; | |
2599 | } | |
2600 | ||
2601 | if (r < 0) { | |
2602 | if (errno == ENOSYS) | |
2603 | /* we lack the syscall, continue with | |
2604 | * reading from /dev/urandom */ | |
2605 | have_syscall = false; | |
2606 | else if (errno == EAGAIN) | |
2607 | /* not enough entropy for now. Let's | |
2608 | * remember to use the syscall the | |
2609 | * next time, again, but also read | |
2610 | * from /dev/urandom for now, which | |
2611 | * doesn't care about the current | |
2612 | * amount of entropy. */ | |
2613 | have_syscall = true; | |
2614 | else | |
2615 | return -errno; | |
2616 | } else | |
2617 | /* too short read? */ | |
2618 | return -EIO; | |
2619 | } | |
2620 | ||
663996b3 MS |
2621 | fd = open("/dev/urandom", O_RDONLY|O_CLOEXEC|O_NOCTTY); |
2622 | if (fd < 0) | |
60f067b4 | 2623 | return errno == ENOENT ? -ENOSYS : -errno; |
663996b3 | 2624 | |
60f067b4 | 2625 | k = loop_read(fd, p, n, true); |
f47781d8 MP |
2626 | safe_close(fd); |
2627 | ||
60f067b4 JS |
2628 | if (k < 0) |
2629 | return (int) k; | |
2630 | if ((size_t) k != n) | |
2631 | return -EIO; | |
663996b3 | 2632 | |
60f067b4 | 2633 | return 0; |
663996b3 MS |
2634 | } |
2635 | ||
f47781d8 | 2636 | void initialize_srand(void) { |
60f067b4 | 2637 | static bool srand_called = false; |
f47781d8 MP |
2638 | unsigned x; |
2639 | #ifdef HAVE_SYS_AUXV_H | |
2640 | void *auxv; | |
2641 | #endif | |
2642 | ||
2643 | if (srand_called) | |
2644 | return; | |
2645 | ||
2646 | x = 0; | |
2647 | ||
2648 | #ifdef HAVE_SYS_AUXV_H | |
2649 | /* The kernel provides us with a bit of entropy in auxv, so | |
2650 | * let's try to make use of that to seed the pseudo-random | |
2651 | * generator. It's better than nothing... */ | |
2652 | ||
2653 | auxv = (void*) getauxval(AT_RANDOM); | |
2654 | if (auxv) | |
2655 | x ^= *(unsigned*) auxv; | |
2656 | #endif | |
2657 | ||
2658 | x ^= (unsigned) now(CLOCK_REALTIME); | |
2659 | x ^= (unsigned) gettid(); | |
2660 | ||
2661 | srand(x); | |
2662 | srand_called = true; | |
2663 | } | |
2664 | ||
2665 | void random_bytes(void *p, size_t n) { | |
60f067b4 JS |
2666 | uint8_t *q; |
2667 | int r; | |
14228c0d | 2668 | |
60f067b4 JS |
2669 | r = dev_urandom(p, n); |
2670 | if (r >= 0) | |
2671 | return; | |
2672 | ||
2673 | /* If some idiot made /dev/urandom unavailable to us, he'll | |
2674 | * get a PRNG instead. */ | |
14228c0d | 2675 | |
f47781d8 | 2676 | initialize_srand(); |
60f067b4 JS |
2677 | |
2678 | for (q = p; q < (uint8_t*) p + n; q ++) | |
2679 | *q = rand(); | |
14228c0d MB |
2680 | } |
2681 | ||
663996b3 MS |
2682 | void rename_process(const char name[8]) { |
2683 | assert(name); | |
2684 | ||
2685 | /* This is a like a poor man's setproctitle(). It changes the | |
2686 | * comm field, argv[0], and also the glibc's internally used | |
2687 | * name of the process. For the first one a limit of 16 chars | |
2688 | * applies, to the second one usually one of 10 (i.e. length | |
2689 | * of "/sbin/init"), to the third one one of 7 (i.e. length of | |
2690 | * "systemd"). If you pass a longer string it will be | |
2691 | * truncated */ | |
2692 | ||
2693 | prctl(PR_SET_NAME, name); | |
2694 | ||
2695 | if (program_invocation_name) | |
2696 | strncpy(program_invocation_name, name, strlen(program_invocation_name)); | |
2697 | ||
2698 | if (saved_argc > 0) { | |
2699 | int i; | |
2700 | ||
2701 | if (saved_argv[0]) | |
2702 | strncpy(saved_argv[0], name, strlen(saved_argv[0])); | |
2703 | ||
2704 | for (i = 1; i < saved_argc; i++) { | |
2705 | if (!saved_argv[i]) | |
2706 | break; | |
2707 | ||
60f067b4 | 2708 | memzero(saved_argv[i], strlen(saved_argv[i])); |
663996b3 MS |
2709 | } |
2710 | } | |
2711 | } | |
2712 | ||
2713 | void sigset_add_many(sigset_t *ss, ...) { | |
2714 | va_list ap; | |
2715 | int sig; | |
2716 | ||
2717 | assert(ss); | |
2718 | ||
2719 | va_start(ap, ss); | |
2720 | while ((sig = va_arg(ap, int)) > 0) | |
2721 | assert_se(sigaddset(ss, sig) == 0); | |
2722 | va_end(ap); | |
2723 | } | |
2724 | ||
60f067b4 JS |
2725 | int sigprocmask_many(int how, ...) { |
2726 | va_list ap; | |
2727 | sigset_t ss; | |
2728 | int sig; | |
2729 | ||
2730 | assert_se(sigemptyset(&ss) == 0); | |
2731 | ||
2732 | va_start(ap, how); | |
2733 | while ((sig = va_arg(ap, int)) > 0) | |
2734 | assert_se(sigaddset(&ss, sig) == 0); | |
2735 | va_end(ap); | |
2736 | ||
2737 | if (sigprocmask(how, &ss, NULL) < 0) | |
2738 | return -errno; | |
2739 | ||
2740 | return 0; | |
2741 | } | |
2742 | ||
663996b3 MS |
2743 | char* gethostname_malloc(void) { |
2744 | struct utsname u; | |
2745 | ||
2746 | assert_se(uname(&u) >= 0); | |
2747 | ||
2748 | if (!isempty(u.nodename) && !streq(u.nodename, "(none)")) | |
2749 | return strdup(u.nodename); | |
2750 | ||
2751 | return strdup(u.sysname); | |
2752 | } | |
2753 | ||
2754 | bool hostname_is_set(void) { | |
2755 | struct utsname u; | |
2756 | ||
2757 | assert_se(uname(&u) >= 0); | |
2758 | ||
2759 | return !isempty(u.nodename) && !streq(u.nodename, "(none)"); | |
2760 | } | |
2761 | ||
5eef597e | 2762 | char *lookup_uid(uid_t uid) { |
663996b3 MS |
2763 | long bufsize; |
2764 | char *name; | |
2765 | _cleanup_free_ char *buf = NULL; | |
2766 | struct passwd pwbuf, *pw = NULL; | |
2767 | ||
2768 | /* Shortcut things to avoid NSS lookups */ | |
2769 | if (uid == 0) | |
2770 | return strdup("root"); | |
2771 | ||
2772 | bufsize = sysconf(_SC_GETPW_R_SIZE_MAX); | |
2773 | if (bufsize <= 0) | |
2774 | bufsize = 4096; | |
2775 | ||
2776 | buf = malloc(bufsize); | |
2777 | if (!buf) | |
2778 | return NULL; | |
2779 | ||
2780 | if (getpwuid_r(uid, &pwbuf, buf, bufsize, &pw) == 0 && pw) | |
2781 | return strdup(pw->pw_name); | |
2782 | ||
60f067b4 | 2783 | if (asprintf(&name, UID_FMT, uid) < 0) |
663996b3 MS |
2784 | return NULL; |
2785 | ||
2786 | return name; | |
2787 | } | |
2788 | ||
2789 | char* getlogname_malloc(void) { | |
2790 | uid_t uid; | |
2791 | struct stat st; | |
2792 | ||
2793 | if (isatty(STDIN_FILENO) && fstat(STDIN_FILENO, &st) >= 0) | |
2794 | uid = st.st_uid; | |
2795 | else | |
2796 | uid = getuid(); | |
2797 | ||
2798 | return lookup_uid(uid); | |
2799 | } | |
2800 | ||
2801 | char *getusername_malloc(void) { | |
2802 | const char *e; | |
2803 | ||
2804 | e = getenv("USER"); | |
2805 | if (e) | |
2806 | return strdup(e); | |
2807 | ||
2808 | return lookup_uid(getuid()); | |
2809 | } | |
2810 | ||
e735f4d4 MP |
2811 | int getttyname_malloc(int fd, char **ret) { |
2812 | size_t l = 100; | |
2813 | int r; | |
663996b3 | 2814 | |
e735f4d4 MP |
2815 | assert(fd >= 0); |
2816 | assert(ret); | |
663996b3 | 2817 | |
e735f4d4 MP |
2818 | for (;;) { |
2819 | char path[l]; | |
663996b3 | 2820 | |
e735f4d4 MP |
2821 | r = ttyname_r(fd, path, sizeof(path)); |
2822 | if (r == 0) { | |
2823 | const char *p; | |
2824 | char *c; | |
663996b3 | 2825 | |
e735f4d4 MP |
2826 | p = startswith(path, "/dev/"); |
2827 | c = strdup(p ?: path); | |
2828 | if (!c) | |
2829 | return -ENOMEM; | |
2830 | ||
2831 | *ret = c; | |
2832 | return 0; | |
2833 | } | |
2834 | ||
2835 | if (r != ERANGE) | |
2836 | return -r; | |
2837 | ||
2838 | l *= 2; | |
2839 | } | |
663996b3 | 2840 | |
663996b3 MS |
2841 | return 0; |
2842 | } | |
2843 | ||
2844 | int getttyname_harder(int fd, char **r) { | |
2845 | int k; | |
2846 | char *s; | |
2847 | ||
2848 | k = getttyname_malloc(fd, &s); | |
2849 | if (k < 0) | |
2850 | return k; | |
2851 | ||
2852 | if (streq(s, "tty")) { | |
2853 | free(s); | |
2854 | return get_ctty(0, NULL, r); | |
2855 | } | |
2856 | ||
2857 | *r = s; | |
2858 | return 0; | |
2859 | } | |
2860 | ||
2861 | int get_ctty_devnr(pid_t pid, dev_t *d) { | |
60f067b4 JS |
2862 | int r; |
2863 | _cleanup_free_ char *line = NULL; | |
2864 | const char *p; | |
663996b3 | 2865 | unsigned long ttynr; |
663996b3 MS |
2866 | |
2867 | assert(pid >= 0); | |
663996b3 | 2868 | |
60f067b4 JS |
2869 | p = procfs_file_alloca(pid, "stat"); |
2870 | r = read_one_line_file(p, &line); | |
2871 | if (r < 0) | |
2872 | return r; | |
663996b3 MS |
2873 | |
2874 | p = strrchr(line, ')'); | |
2875 | if (!p) | |
2876 | return -EIO; | |
2877 | ||
2878 | p++; | |
2879 | ||
2880 | if (sscanf(p, " " | |
2881 | "%*c " /* state */ | |
2882 | "%*d " /* ppid */ | |
2883 | "%*d " /* pgrp */ | |
2884 | "%*d " /* session */ | |
2885 | "%lu ", /* ttynr */ | |
2886 | &ttynr) != 1) | |
2887 | return -EIO; | |
2888 | ||
2889 | if (major(ttynr) == 0 && minor(ttynr) == 0) | |
2890 | return -ENOENT; | |
2891 | ||
60f067b4 JS |
2892 | if (d) |
2893 | *d = (dev_t) ttynr; | |
2894 | ||
663996b3 MS |
2895 | return 0; |
2896 | } | |
2897 | ||
2898 | int get_ctty(pid_t pid, dev_t *_devnr, char **r) { | |
60f067b4 JS |
2899 | char fn[sizeof("/dev/char/")-1 + 2*DECIMAL_STR_MAX(unsigned) + 1 + 1], *b = NULL; |
2900 | _cleanup_free_ char *s = NULL; | |
2901 | const char *p; | |
663996b3 | 2902 | dev_t devnr; |
60f067b4 | 2903 | int k; |
663996b3 MS |
2904 | |
2905 | assert(r); | |
2906 | ||
2907 | k = get_ctty_devnr(pid, &devnr); | |
2908 | if (k < 0) | |
2909 | return k; | |
2910 | ||
f47781d8 | 2911 | sprintf(fn, "/dev/char/%u:%u", major(devnr), minor(devnr)); |
663996b3 MS |
2912 | |
2913 | k = readlink_malloc(fn, &s); | |
2914 | if (k < 0) { | |
2915 | ||
2916 | if (k != -ENOENT) | |
2917 | return k; | |
2918 | ||
2919 | /* This is an ugly hack */ | |
2920 | if (major(devnr) == 136) { | |
60f067b4 JS |
2921 | asprintf(&b, "pts/%u", minor(devnr)); |
2922 | goto finish; | |
663996b3 MS |
2923 | } |
2924 | ||
2925 | /* Probably something like the ptys which have no | |
2926 | * symlink in /dev/char. Let's return something | |
2927 | * vaguely useful. */ | |
2928 | ||
2929 | b = strdup(fn + 5); | |
60f067b4 | 2930 | goto finish; |
663996b3 MS |
2931 | } |
2932 | ||
2933 | if (startswith(s, "/dev/")) | |
2934 | p = s + 5; | |
2935 | else if (startswith(s, "../")) | |
2936 | p = s + 3; | |
2937 | else | |
2938 | p = s; | |
2939 | ||
2940 | b = strdup(p); | |
663996b3 | 2941 | |
60f067b4 | 2942 | finish: |
663996b3 MS |
2943 | if (!b) |
2944 | return -ENOMEM; | |
2945 | ||
2946 | *r = b; | |
2947 | if (_devnr) | |
2948 | *_devnr = devnr; | |
2949 | ||
2950 | return 0; | |
2951 | } | |
2952 | ||
2953 | int rm_rf_children_dangerous(int fd, bool only_dirs, bool honour_sticky, struct stat *root_dev) { | |
e842803a | 2954 | _cleanup_closedir_ DIR *d = NULL; |
663996b3 MS |
2955 | int ret = 0; |
2956 | ||
2957 | assert(fd >= 0); | |
2958 | ||
2959 | /* This returns the first error we run into, but nevertheless | |
2960 | * tries to go on. This closes the passed fd. */ | |
2961 | ||
2962 | d = fdopendir(fd); | |
2963 | if (!d) { | |
60f067b4 | 2964 | safe_close(fd); |
663996b3 MS |
2965 | |
2966 | return errno == ENOENT ? 0 : -errno; | |
2967 | } | |
2968 | ||
2969 | for (;;) { | |
2970 | struct dirent *de; | |
663996b3 MS |
2971 | bool is_dir, keep_around; |
2972 | struct stat st; | |
2973 | int r; | |
2974 | ||
60f067b4 JS |
2975 | errno = 0; |
2976 | de = readdir(d); | |
e842803a MB |
2977 | if (!de) { |
2978 | if (errno != 0 && ret == 0) | |
60f067b4 | 2979 | ret = -errno; |
e842803a | 2980 | return ret; |
663996b3 MS |
2981 | } |
2982 | ||
663996b3 MS |
2983 | if (streq(de->d_name, ".") || streq(de->d_name, "..")) |
2984 | continue; | |
2985 | ||
2986 | if (de->d_type == DT_UNKNOWN || | |
2987 | honour_sticky || | |
2988 | (de->d_type == DT_DIR && root_dev)) { | |
2989 | if (fstatat(fd, de->d_name, &st, AT_SYMLINK_NOFOLLOW) < 0) { | |
2990 | if (ret == 0 && errno != ENOENT) | |
2991 | ret = -errno; | |
2992 | continue; | |
2993 | } | |
2994 | ||
2995 | is_dir = S_ISDIR(st.st_mode); | |
2996 | keep_around = | |
2997 | honour_sticky && | |
2998 | (st.st_uid == 0 || st.st_uid == getuid()) && | |
2999 | (st.st_mode & S_ISVTX); | |
3000 | } else { | |
3001 | is_dir = de->d_type == DT_DIR; | |
3002 | keep_around = false; | |
3003 | } | |
3004 | ||
3005 | if (is_dir) { | |
3006 | int subdir_fd; | |
3007 | ||
3008 | /* if root_dev is set, remove subdirectories only, if device is same as dir */ | |
3009 | if (root_dev && st.st_dev != root_dev->st_dev) | |
3010 | continue; | |
3011 | ||
3012 | subdir_fd = openat(fd, de->d_name, | |
3013 | O_RDONLY|O_NONBLOCK|O_DIRECTORY|O_CLOEXEC|O_NOFOLLOW|O_NOATIME); | |
3014 | if (subdir_fd < 0) { | |
3015 | if (ret == 0 && errno != ENOENT) | |
3016 | ret = -errno; | |
3017 | continue; | |
3018 | } | |
3019 | ||
3020 | r = rm_rf_children_dangerous(subdir_fd, only_dirs, honour_sticky, root_dev); | |
3021 | if (r < 0 && ret == 0) | |
3022 | ret = r; | |
3023 | ||
3024 | if (!keep_around) | |
3025 | if (unlinkat(fd, de->d_name, AT_REMOVEDIR) < 0) { | |
3026 | if (ret == 0 && errno != ENOENT) | |
3027 | ret = -errno; | |
3028 | } | |
3029 | ||
3030 | } else if (!only_dirs && !keep_around) { | |
3031 | ||
3032 | if (unlinkat(fd, de->d_name, 0) < 0) { | |
3033 | if (ret == 0 && errno != ENOENT) | |
3034 | ret = -errno; | |
3035 | } | |
3036 | } | |
3037 | } | |
663996b3 MS |
3038 | } |
3039 | ||
3040 | _pure_ static int is_temporary_fs(struct statfs *s) { | |
3041 | assert(s); | |
60f067b4 JS |
3042 | |
3043 | return F_TYPE_EQUAL(s->f_type, TMPFS_MAGIC) || | |
3044 | F_TYPE_EQUAL(s->f_type, RAMFS_MAGIC); | |
663996b3 MS |
3045 | } |
3046 | ||
f47781d8 MP |
3047 | int is_fd_on_temporary_fs(int fd) { |
3048 | struct statfs s; | |
3049 | ||
3050 | if (fstatfs(fd, &s) < 0) | |
3051 | return -errno; | |
3052 | ||
3053 | return is_temporary_fs(&s); | |
3054 | } | |
3055 | ||
663996b3 MS |
3056 | int rm_rf_children(int fd, bool only_dirs, bool honour_sticky, struct stat *root_dev) { |
3057 | struct statfs s; | |
3058 | ||
3059 | assert(fd >= 0); | |
3060 | ||
3061 | if (fstatfs(fd, &s) < 0) { | |
60f067b4 | 3062 | safe_close(fd); |
663996b3 MS |
3063 | return -errno; |
3064 | } | |
3065 | ||
3066 | /* We refuse to clean disk file systems with this call. This | |
3067 | * is extra paranoia just to be sure we never ever remove | |
3068 | * non-state data */ | |
3069 | if (!is_temporary_fs(&s)) { | |
3070 | log_error("Attempted to remove disk file system, and we can't allow that."); | |
60f067b4 | 3071 | safe_close(fd); |
663996b3 MS |
3072 | return -EPERM; |
3073 | } | |
3074 | ||
3075 | return rm_rf_children_dangerous(fd, only_dirs, honour_sticky, root_dev); | |
3076 | } | |
3077 | ||
f47781d8 MP |
3078 | static int file_is_priv_sticky(const char *p) { |
3079 | struct stat st; | |
3080 | ||
3081 | assert(p); | |
3082 | ||
3083 | if (lstat(p, &st) < 0) | |
3084 | return -errno; | |
3085 | ||
3086 | return | |
3087 | (st.st_uid == 0 || st.st_uid == getuid()) && | |
3088 | (st.st_mode & S_ISVTX); | |
3089 | } | |
3090 | ||
663996b3 MS |
3091 | static int rm_rf_internal(const char *path, bool only_dirs, bool delete_root, bool honour_sticky, bool dangerous) { |
3092 | int fd, r; | |
3093 | struct statfs s; | |
3094 | ||
3095 | assert(path); | |
3096 | ||
3097 | /* We refuse to clean the root file system with this | |
3098 | * call. This is extra paranoia to never cause a really | |
3099 | * seriously broken system. */ | |
3100 | if (path_equal(path, "/")) { | |
3101 | log_error("Attempted to remove entire root file system, and we can't allow that."); | |
3102 | return -EPERM; | |
3103 | } | |
3104 | ||
3105 | fd = open(path, O_RDONLY|O_NONBLOCK|O_DIRECTORY|O_CLOEXEC|O_NOFOLLOW|O_NOATIME); | |
3106 | if (fd < 0) { | |
3107 | ||
e735f4d4 | 3108 | if (errno != ENOTDIR && errno != ELOOP) |
663996b3 MS |
3109 | return -errno; |
3110 | ||
3111 | if (!dangerous) { | |
3112 | if (statfs(path, &s) < 0) | |
3113 | return -errno; | |
3114 | ||
3115 | if (!is_temporary_fs(&s)) { | |
3116 | log_error("Attempted to remove disk file system, and we can't allow that."); | |
3117 | return -EPERM; | |
3118 | } | |
3119 | } | |
3120 | ||
3121 | if (delete_root && !only_dirs) | |
3122 | if (unlink(path) < 0 && errno != ENOENT) | |
3123 | return -errno; | |
3124 | ||
3125 | return 0; | |
3126 | } | |
3127 | ||
3128 | if (!dangerous) { | |
3129 | if (fstatfs(fd, &s) < 0) { | |
60f067b4 | 3130 | safe_close(fd); |
663996b3 MS |
3131 | return -errno; |
3132 | } | |
3133 | ||
3134 | if (!is_temporary_fs(&s)) { | |
3135 | log_error("Attempted to remove disk file system, and we can't allow that."); | |
60f067b4 | 3136 | safe_close(fd); |
663996b3 MS |
3137 | return -EPERM; |
3138 | } | |
3139 | } | |
3140 | ||
3141 | r = rm_rf_children_dangerous(fd, only_dirs, honour_sticky, NULL); | |
3142 | if (delete_root) { | |
3143 | ||
3144 | if (honour_sticky && file_is_priv_sticky(path) > 0) | |
3145 | return r; | |
3146 | ||
3147 | if (rmdir(path) < 0 && errno != ENOENT) { | |
3148 | if (r == 0) | |
3149 | r = -errno; | |
3150 | } | |
3151 | } | |
3152 | ||
3153 | return r; | |
3154 | } | |
3155 | ||
3156 | int rm_rf(const char *path, bool only_dirs, bool delete_root, bool honour_sticky) { | |
3157 | return rm_rf_internal(path, only_dirs, delete_root, honour_sticky, false); | |
3158 | } | |
3159 | ||
3160 | int rm_rf_dangerous(const char *path, bool only_dirs, bool delete_root, bool honour_sticky) { | |
3161 | return rm_rf_internal(path, only_dirs, delete_root, honour_sticky, true); | |
3162 | } | |
3163 | ||
3164 | int chmod_and_chown(const char *path, mode_t mode, uid_t uid, gid_t gid) { | |
3165 | assert(path); | |
3166 | ||
3167 | /* Under the assumption that we are running privileged we | |
3168 | * first change the access mode and only then hand out | |
3169 | * ownership to avoid a window where access is too open. */ | |
3170 | ||
f47781d8 | 3171 | if (mode != MODE_INVALID) |
663996b3 MS |
3172 | if (chmod(path, mode) < 0) |
3173 | return -errno; | |
3174 | ||
f47781d8 | 3175 | if (uid != UID_INVALID || gid != GID_INVALID) |
663996b3 MS |
3176 | if (chown(path, uid, gid) < 0) |
3177 | return -errno; | |
3178 | ||
3179 | return 0; | |
3180 | } | |
3181 | ||
3182 | int fchmod_and_fchown(int fd, mode_t mode, uid_t uid, gid_t gid) { | |
3183 | assert(fd >= 0); | |
3184 | ||
3185 | /* Under the assumption that we are running privileged we | |
3186 | * first change the access mode and only then hand out | |
3187 | * ownership to avoid a window where access is too open. */ | |
3188 | ||
f47781d8 | 3189 | if (mode != MODE_INVALID) |
60f067b4 JS |
3190 | if (fchmod(fd, mode) < 0) |
3191 | return -errno; | |
663996b3 | 3192 | |
f47781d8 | 3193 | if (uid != UID_INVALID || gid != GID_INVALID) |
60f067b4 JS |
3194 | if (fchown(fd, uid, gid) < 0) |
3195 | return -errno; | |
663996b3 MS |
3196 | |
3197 | return 0; | |
3198 | } | |
3199 | ||
3200 | cpu_set_t* cpu_set_malloc(unsigned *ncpus) { | |
3201 | cpu_set_t *r; | |
3202 | unsigned n = 1024; | |
3203 | ||
3204 | /* Allocates the cpuset in the right size */ | |
3205 | ||
3206 | for (;;) { | |
3207 | if (!(r = CPU_ALLOC(n))) | |
3208 | return NULL; | |
3209 | ||
3210 | if (sched_getaffinity(0, CPU_ALLOC_SIZE(n), r) >= 0) { | |
3211 | CPU_ZERO_S(CPU_ALLOC_SIZE(n), r); | |
3212 | ||
3213 | if (ncpus) | |
3214 | *ncpus = n; | |
3215 | ||
3216 | return r; | |
3217 | } | |
3218 | ||
3219 | CPU_FREE(r); | |
3220 | ||
3221 | if (errno != EINVAL) | |
3222 | return NULL; | |
3223 | ||
3224 | n *= 2; | |
3225 | } | |
3226 | } | |
3227 | ||
3228 | int status_vprintf(const char *status, bool ellipse, bool ephemeral, const char *format, va_list ap) { | |
3229 | static const char status_indent[] = " "; /* "[" STATUS "] " */ | |
3230 | _cleanup_free_ char *s = NULL; | |
3231 | _cleanup_close_ int fd = -1; | |
3232 | struct iovec iovec[6] = {}; | |
3233 | int n = 0; | |
3234 | static bool prev_ephemeral; | |
3235 | ||
3236 | assert(format); | |
3237 | ||
3238 | /* This is independent of logging, as status messages are | |
3239 | * optional and go exclusively to the console. */ | |
3240 | ||
3241 | if (vasprintf(&s, format, ap) < 0) | |
3242 | return log_oom(); | |
3243 | ||
3244 | fd = open_terminal("/dev/console", O_WRONLY|O_NOCTTY|O_CLOEXEC); | |
3245 | if (fd < 0) | |
3246 | return fd; | |
3247 | ||
3248 | if (ellipse) { | |
3249 | char *e; | |
3250 | size_t emax, sl; | |
3251 | int c; | |
3252 | ||
3253 | c = fd_columns(fd); | |
3254 | if (c <= 0) | |
3255 | c = 80; | |
3256 | ||
3257 | sl = status ? sizeof(status_indent)-1 : 0; | |
3258 | ||
3259 | emax = c - sl - 1; | |
3260 | if (emax < 3) | |
3261 | emax = 3; | |
3262 | ||
5eef597e | 3263 | e = ellipsize(s, emax, 50); |
663996b3 MS |
3264 | if (e) { |
3265 | free(s); | |
3266 | s = e; | |
3267 | } | |
3268 | } | |
3269 | ||
3270 | if (prev_ephemeral) | |
3271 | IOVEC_SET_STRING(iovec[n++], "\r" ANSI_ERASE_TO_END_OF_LINE); | |
3272 | prev_ephemeral = ephemeral; | |
3273 | ||
3274 | if (status) { | |
3275 | if (!isempty(status)) { | |
3276 | IOVEC_SET_STRING(iovec[n++], "["); | |
3277 | IOVEC_SET_STRING(iovec[n++], status); | |
3278 | IOVEC_SET_STRING(iovec[n++], "] "); | |
3279 | } else | |
3280 | IOVEC_SET_STRING(iovec[n++], status_indent); | |
3281 | } | |
3282 | ||
3283 | IOVEC_SET_STRING(iovec[n++], s); | |
3284 | if (!ephemeral) | |
3285 | IOVEC_SET_STRING(iovec[n++], "\n"); | |
3286 | ||
3287 | if (writev(fd, iovec, n) < 0) | |
3288 | return -errno; | |
3289 | ||
3290 | return 0; | |
3291 | } | |
3292 | ||
3293 | int status_printf(const char *status, bool ellipse, bool ephemeral, const char *format, ...) { | |
3294 | va_list ap; | |
3295 | int r; | |
3296 | ||
3297 | assert(format); | |
3298 | ||
3299 | va_start(ap, format); | |
3300 | r = status_vprintf(status, ellipse, ephemeral, format, ap); | |
3301 | va_end(ap); | |
3302 | ||
3303 | return r; | |
3304 | } | |
3305 | ||
663996b3 MS |
3306 | char *replace_env(const char *format, char **env) { |
3307 | enum { | |
3308 | WORD, | |
3309 | CURLY, | |
3310 | VARIABLE | |
3311 | } state = WORD; | |
3312 | ||
3313 | const char *e, *word = format; | |
3314 | char *r = NULL, *k; | |
3315 | ||
3316 | assert(format); | |
3317 | ||
3318 | for (e = format; *e; e ++) { | |
3319 | ||
3320 | switch (state) { | |
3321 | ||
3322 | case WORD: | |
3323 | if (*e == '$') | |
3324 | state = CURLY; | |
3325 | break; | |
3326 | ||
3327 | case CURLY: | |
3328 | if (*e == '{') { | |
f47781d8 MP |
3329 | k = strnappend(r, word, e-word-1); |
3330 | if (!k) | |
663996b3 MS |
3331 | goto fail; |
3332 | ||
3333 | free(r); | |
3334 | r = k; | |
3335 | ||
3336 | word = e-1; | |
3337 | state = VARIABLE; | |
3338 | ||
3339 | } else if (*e == '$') { | |
f47781d8 MP |
3340 | k = strnappend(r, word, e-word); |
3341 | if (!k) | |
663996b3 MS |
3342 | goto fail; |
3343 | ||
3344 | free(r); | |
3345 | r = k; | |
3346 | ||
3347 | word = e+1; | |
3348 | state = WORD; | |
3349 | } else | |
3350 | state = WORD; | |
3351 | break; | |
3352 | ||
3353 | case VARIABLE: | |
3354 | if (*e == '}') { | |
3355 | const char *t; | |
3356 | ||
3357 | t = strempty(strv_env_get_n(env, word+2, e-word-2)); | |
3358 | ||
3359 | k = strappend(r, t); | |
3360 | if (!k) | |
3361 | goto fail; | |
3362 | ||
3363 | free(r); | |
3364 | r = k; | |
3365 | ||
3366 | word = e+1; | |
3367 | state = WORD; | |
3368 | } | |
3369 | break; | |
3370 | } | |
3371 | } | |
3372 | ||
f47781d8 MP |
3373 | k = strnappend(r, word, e-word); |
3374 | if (!k) | |
663996b3 MS |
3375 | goto fail; |
3376 | ||
3377 | free(r); | |
3378 | return k; | |
3379 | ||
3380 | fail: | |
3381 | free(r); | |
3382 | return NULL; | |
3383 | } | |
3384 | ||
3385 | char **replace_env_argv(char **argv, char **env) { | |
5eef597e | 3386 | char **ret, **i; |
663996b3 MS |
3387 | unsigned k = 0, l = 0; |
3388 | ||
3389 | l = strv_length(argv); | |
3390 | ||
5eef597e MP |
3391 | ret = new(char*, l+1); |
3392 | if (!ret) | |
663996b3 MS |
3393 | return NULL; |
3394 | ||
3395 | STRV_FOREACH(i, argv) { | |
3396 | ||
3397 | /* If $FOO appears as single word, replace it by the split up variable */ | |
3398 | if ((*i)[0] == '$' && (*i)[1] != '{') { | |
3399 | char *e; | |
3400 | char **w, **m; | |
3401 | unsigned q; | |
3402 | ||
3403 | e = strv_env_get(env, *i+1); | |
3404 | if (e) { | |
5eef597e | 3405 | int r; |
663996b3 | 3406 | |
f47781d8 | 3407 | r = strv_split_quoted(&m, e, true); |
5eef597e MP |
3408 | if (r < 0) { |
3409 | ret[k] = NULL; | |
3410 | strv_free(ret); | |
663996b3 MS |
3411 | return NULL; |
3412 | } | |
3413 | } else | |
3414 | m = NULL; | |
3415 | ||
3416 | q = strv_length(m); | |
3417 | l = l + q - 1; | |
3418 | ||
5eef597e MP |
3419 | w = realloc(ret, sizeof(char*) * (l+1)); |
3420 | if (!w) { | |
3421 | ret[k] = NULL; | |
3422 | strv_free(ret); | |
663996b3 MS |
3423 | strv_free(m); |
3424 | return NULL; | |
3425 | } | |
3426 | ||
5eef597e | 3427 | ret = w; |
663996b3 | 3428 | if (m) { |
5eef597e | 3429 | memcpy(ret + k, m, q * sizeof(char*)); |
663996b3 MS |
3430 | free(m); |
3431 | } | |
3432 | ||
3433 | k += q; | |
3434 | continue; | |
3435 | } | |
3436 | ||
3437 | /* If ${FOO} appears as part of a word, replace it by the variable as-is */ | |
5eef597e MP |
3438 | ret[k] = replace_env(*i, env); |
3439 | if (!ret[k]) { | |
3440 | strv_free(ret); | |
663996b3 MS |
3441 | return NULL; |
3442 | } | |
5eef597e | 3443 | k++; |
663996b3 MS |
3444 | } |
3445 | ||
5eef597e MP |
3446 | ret[k] = NULL; |
3447 | return ret; | |
663996b3 MS |
3448 | } |
3449 | ||
3450 | int fd_columns(int fd) { | |
3451 | struct winsize ws = {}; | |
3452 | ||
3453 | if (ioctl(fd, TIOCGWINSZ, &ws) < 0) | |
3454 | return -errno; | |
3455 | ||
3456 | if (ws.ws_col <= 0) | |
3457 | return -EIO; | |
3458 | ||
3459 | return ws.ws_col; | |
3460 | } | |
3461 | ||
3462 | unsigned columns(void) { | |
3463 | const char *e; | |
3464 | int c; | |
3465 | ||
3466 | if (_likely_(cached_columns > 0)) | |
3467 | return cached_columns; | |
3468 | ||
3469 | c = 0; | |
3470 | e = getenv("COLUMNS"); | |
3471 | if (e) | |
5eef597e | 3472 | (void) safe_atoi(e, &c); |
663996b3 MS |
3473 | |
3474 | if (c <= 0) | |
3475 | c = fd_columns(STDOUT_FILENO); | |
3476 | ||
3477 | if (c <= 0) | |
3478 | c = 80; | |
3479 | ||
3480 | cached_columns = c; | |
e735f4d4 | 3481 | return cached_columns; |
663996b3 MS |
3482 | } |
3483 | ||
3484 | int fd_lines(int fd) { | |
3485 | struct winsize ws = {}; | |
3486 | ||
3487 | if (ioctl(fd, TIOCGWINSZ, &ws) < 0) | |
3488 | return -errno; | |
3489 | ||
3490 | if (ws.ws_row <= 0) | |
3491 | return -EIO; | |
3492 | ||
3493 | return ws.ws_row; | |
3494 | } | |
3495 | ||
3496 | unsigned lines(void) { | |
3497 | const char *e; | |
e735f4d4 | 3498 | int l; |
663996b3 MS |
3499 | |
3500 | if (_likely_(cached_lines > 0)) | |
3501 | return cached_lines; | |
3502 | ||
3503 | l = 0; | |
3504 | e = getenv("LINES"); | |
3505 | if (e) | |
e735f4d4 | 3506 | (void) safe_atoi(e, &l); |
663996b3 MS |
3507 | |
3508 | if (l <= 0) | |
3509 | l = fd_lines(STDOUT_FILENO); | |
3510 | ||
3511 | if (l <= 0) | |
3512 | l = 24; | |
3513 | ||
3514 | cached_lines = l; | |
3515 | return cached_lines; | |
3516 | } | |
3517 | ||
3518 | /* intended to be used as a SIGWINCH sighandler */ | |
3519 | void columns_lines_cache_reset(int signum) { | |
3520 | cached_columns = 0; | |
3521 | cached_lines = 0; | |
3522 | } | |
3523 | ||
3524 | bool on_tty(void) { | |
3525 | static int cached_on_tty = -1; | |
3526 | ||
3527 | if (_unlikely_(cached_on_tty < 0)) | |
3528 | cached_on_tty = isatty(STDOUT_FILENO) > 0; | |
3529 | ||
3530 | return cached_on_tty; | |
3531 | } | |
3532 | ||
60f067b4 JS |
3533 | int files_same(const char *filea, const char *fileb) { |
3534 | struct stat a, b; | |
663996b3 | 3535 | |
60f067b4 | 3536 | if (stat(filea, &a) < 0) |
663996b3 MS |
3537 | return -errno; |
3538 | ||
60f067b4 | 3539 | if (stat(fileb, &b) < 0) |
663996b3 MS |
3540 | return -errno; |
3541 | ||
60f067b4 JS |
3542 | return a.st_dev == b.st_dev && |
3543 | a.st_ino == b.st_ino; | |
663996b3 MS |
3544 | } |
3545 | ||
60f067b4 JS |
3546 | int running_in_chroot(void) { |
3547 | int ret; | |
3548 | ||
3549 | ret = files_same("/proc/1/root", "/"); | |
3550 | if (ret < 0) | |
3551 | return ret; | |
3552 | ||
3553 | return ret == 0; | |
3554 | } | |
3555 | ||
3556 | static char *ascii_ellipsize_mem(const char *s, size_t old_length, size_t new_length, unsigned percent) { | |
663996b3 MS |
3557 | size_t x; |
3558 | char *r; | |
3559 | ||
3560 | assert(s); | |
3561 | assert(percent <= 100); | |
3562 | assert(new_length >= 3); | |
3563 | ||
3564 | if (old_length <= 3 || old_length <= new_length) | |
3565 | return strndup(s, old_length); | |
3566 | ||
3567 | r = new0(char, new_length+1); | |
3568 | if (!r) | |
14228c0d | 3569 | return NULL; |
663996b3 MS |
3570 | |
3571 | x = (new_length * percent) / 100; | |
3572 | ||
3573 | if (x > new_length - 3) | |
3574 | x = new_length - 3; | |
3575 | ||
3576 | memcpy(r, s, x); | |
3577 | r[x] = '.'; | |
3578 | r[x+1] = '.'; | |
3579 | r[x+2] = '.'; | |
3580 | memcpy(r + x + 3, | |
3581 | s + old_length - (new_length - x - 3), | |
3582 | new_length - x - 3); | |
3583 | ||
3584 | return r; | |
3585 | } | |
3586 | ||
60f067b4 JS |
3587 | char *ellipsize_mem(const char *s, size_t old_length, size_t new_length, unsigned percent) { |
3588 | size_t x; | |
3589 | char *e; | |
3590 | const char *i, *j; | |
3591 | unsigned k, len, len2; | |
3592 | ||
3593 | assert(s); | |
3594 | assert(percent <= 100); | |
3595 | assert(new_length >= 3); | |
3596 | ||
3597 | /* if no multibyte characters use ascii_ellipsize_mem for speed */ | |
3598 | if (ascii_is_valid(s)) | |
3599 | return ascii_ellipsize_mem(s, old_length, new_length, percent); | |
3600 | ||
3601 | if (old_length <= 3 || old_length <= new_length) | |
3602 | return strndup(s, old_length); | |
3603 | ||
3604 | x = (new_length * percent) / 100; | |
3605 | ||
3606 | if (x > new_length - 3) | |
3607 | x = new_length - 3; | |
3608 | ||
3609 | k = 0; | |
3610 | for (i = s; k < x && i < s + old_length; i = utf8_next_char(i)) { | |
3611 | int c; | |
3612 | ||
3613 | c = utf8_encoded_to_unichar(i); | |
3614 | if (c < 0) | |
3615 | return NULL; | |
3616 | k += unichar_iswide(c) ? 2 : 1; | |
3617 | } | |
3618 | ||
3619 | if (k > x) /* last character was wide and went over quota */ | |
3620 | x ++; | |
3621 | ||
3622 | for (j = s + old_length; k < new_length && j > i; ) { | |
3623 | int c; | |
3624 | ||
3625 | j = utf8_prev_char(j); | |
3626 | c = utf8_encoded_to_unichar(j); | |
3627 | if (c < 0) | |
3628 | return NULL; | |
3629 | k += unichar_iswide(c) ? 2 : 1; | |
3630 | } | |
3631 | assert(i <= j); | |
3632 | ||
3633 | /* we don't actually need to ellipsize */ | |
3634 | if (i == j) | |
3635 | return memdup(s, old_length + 1); | |
3636 | ||
3637 | /* make space for ellipsis */ | |
3638 | j = utf8_next_char(j); | |
3639 | ||
3640 | len = i - s; | |
3641 | len2 = s + old_length - j; | |
3642 | e = new(char, len + 3 + len2 + 1); | |
3643 | if (!e) | |
3644 | return NULL; | |
3645 | ||
3646 | /* | |
3647 | printf("old_length=%zu new_length=%zu x=%zu len=%u len2=%u k=%u\n", | |
3648 | old_length, new_length, x, len, len2, k); | |
3649 | */ | |
3650 | ||
3651 | memcpy(e, s, len); | |
3652 | e[len] = 0xe2; /* tri-dot ellipsis: … */ | |
3653 | e[len + 1] = 0x80; | |
3654 | e[len + 2] = 0xa6; | |
3655 | ||
3656 | memcpy(e + len + 3, j, len2 + 1); | |
3657 | ||
3658 | return e; | |
3659 | } | |
3660 | ||
663996b3 MS |
3661 | char *ellipsize(const char *s, size_t length, unsigned percent) { |
3662 | return ellipsize_mem(s, strlen(s), length, percent); | |
3663 | } | |
3664 | ||
60f067b4 JS |
3665 | int touch_file(const char *path, bool parents, usec_t stamp, uid_t uid, gid_t gid, mode_t mode) { |
3666 | _cleanup_close_ int fd; | |
3667 | int r; | |
663996b3 MS |
3668 | |
3669 | assert(path); | |
3670 | ||
60f067b4 JS |
3671 | if (parents) |
3672 | mkdir_parents(path, 0755); | |
663996b3 | 3673 | |
60f067b4 | 3674 | fd = open(path, O_WRONLY|O_CREAT|O_CLOEXEC|O_NOCTTY, mode > 0 ? mode : 0644); |
663996b3 MS |
3675 | if (fd < 0) |
3676 | return -errno; | |
3677 | ||
60f067b4 JS |
3678 | if (mode > 0) { |
3679 | r = fchmod(fd, mode); | |
3680 | if (r < 0) | |
3681 | return -errno; | |
3682 | } | |
3683 | ||
f47781d8 | 3684 | if (uid != UID_INVALID || gid != GID_INVALID) { |
60f067b4 JS |
3685 | r = fchown(fd, uid, gid); |
3686 | if (r < 0) | |
3687 | return -errno; | |
3688 | } | |
3689 | ||
5eef597e | 3690 | if (stamp != USEC_INFINITY) { |
60f067b4 JS |
3691 | struct timespec ts[2]; |
3692 | ||
3693 | timespec_store(&ts[0], stamp); | |
3694 | ts[1] = ts[0]; | |
3695 | r = futimens(fd, ts); | |
3696 | } else | |
3697 | r = futimens(fd, NULL); | |
3698 | if (r < 0) | |
3699 | return -errno; | |
3700 | ||
663996b3 MS |
3701 | return 0; |
3702 | } | |
3703 | ||
60f067b4 | 3704 | int touch(const char *path) { |
f47781d8 | 3705 | return touch_file(path, false, USEC_INFINITY, UID_INVALID, GID_INVALID, 0); |
60f067b4 JS |
3706 | } |
3707 | ||
663996b3 MS |
3708 | char *unquote(const char *s, const char* quotes) { |
3709 | size_t l; | |
3710 | assert(s); | |
3711 | ||
3712 | /* This is rather stupid, simply removes the heading and | |
3713 | * trailing quotes if there is one. Doesn't care about | |
3714 | * escaping or anything. We should make this smarter one | |
e735f4d4 | 3715 | * day... */ |
663996b3 MS |
3716 | |
3717 | l = strlen(s); | |
3718 | if (l < 2) | |
3719 | return strdup(s); | |
3720 | ||
3721 | if (strchr(quotes, s[0]) && s[l-1] == s[0]) | |
3722 | return strndup(s+1, l-2); | |
3723 | ||
3724 | return strdup(s); | |
3725 | } | |
3726 | ||
3727 | char *normalize_env_assignment(const char *s) { | |
f47781d8 MP |
3728 | _cleanup_free_ char *value = NULL; |
3729 | const char *eq; | |
3730 | char *p, *name; | |
663996b3 MS |
3731 | |
3732 | eq = strchr(s, '='); | |
3733 | if (!eq) { | |
f47781d8 | 3734 | char *r, *t; |
663996b3 MS |
3735 | |
3736 | r = strdup(s); | |
3737 | if (!r) | |
3738 | return NULL; | |
3739 | ||
3740 | t = strstrip(r); | |
f47781d8 MP |
3741 | if (t != r) |
3742 | memmove(r, t, strlen(t) + 1); | |
663996b3 | 3743 | |
663996b3 MS |
3744 | return r; |
3745 | } | |
3746 | ||
f47781d8 MP |
3747 | name = strndupa(s, eq - s); |
3748 | p = strdupa(eq + 1); | |
663996b3 MS |
3749 | |
3750 | value = unquote(strstrip(p), QUOTES); | |
3751 | if (!value) | |
3752 | return NULL; | |
3753 | ||
f47781d8 | 3754 | return strjoin(strstrip(name), "=", value, NULL); |
663996b3 MS |
3755 | } |
3756 | ||
3757 | int wait_for_terminate(pid_t pid, siginfo_t *status) { | |
3758 | siginfo_t dummy; | |
3759 | ||
3760 | assert(pid >= 1); | |
3761 | ||
3762 | if (!status) | |
3763 | status = &dummy; | |
3764 | ||
3765 | for (;;) { | |
3766 | zero(*status); | |
3767 | ||
3768 | if (waitid(P_PID, pid, status, WEXITED) < 0) { | |
3769 | ||
3770 | if (errno == EINTR) | |
3771 | continue; | |
3772 | ||
3773 | return -errno; | |
3774 | } | |
3775 | ||
3776 | return 0; | |
3777 | } | |
3778 | } | |
3779 | ||
e842803a MB |
3780 | /* |
3781 | * Return values: | |
3782 | * < 0 : wait_for_terminate() failed to get the state of the | |
3783 | * process, the process was terminated by a signal, or | |
3784 | * failed for an unknown reason. | |
3785 | * >=0 : The process terminated normally, and its exit code is | |
3786 | * returned. | |
3787 | * | |
3788 | * That is, success is indicated by a return value of zero, and an | |
3789 | * error is indicated by a non-zero value. | |
f47781d8 MP |
3790 | * |
3791 | * A warning is emitted if the process terminates abnormally, | |
3792 | * and also if it returns non-zero unless check_exit_code is true. | |
e842803a | 3793 | */ |
f47781d8 | 3794 | int wait_for_terminate_and_warn(const char *name, pid_t pid, bool check_exit_code) { |
663996b3 MS |
3795 | int r; |
3796 | siginfo_t status; | |
3797 | ||
3798 | assert(name); | |
3799 | assert(pid > 1); | |
3800 | ||
3801 | r = wait_for_terminate(pid, &status); | |
f47781d8 MP |
3802 | if (r < 0) |
3803 | return log_warning_errno(r, "Failed to wait for %s: %m", name); | |
663996b3 MS |
3804 | |
3805 | if (status.si_code == CLD_EXITED) { | |
f47781d8 MP |
3806 | if (status.si_status != 0) |
3807 | log_full(check_exit_code ? LOG_WARNING : LOG_DEBUG, | |
3808 | "%s failed with error code %i.", name, status.si_status); | |
3809 | else | |
3810 | log_debug("%s succeeded.", name); | |
663996b3 | 3811 | |
f47781d8 | 3812 | return status.si_status; |
663996b3 MS |
3813 | } else if (status.si_code == CLD_KILLED || |
3814 | status.si_code == CLD_DUMPED) { | |
3815 | ||
3816 | log_warning("%s terminated by signal %s.", name, signal_to_string(status.si_status)); | |
3817 | return -EPROTO; | |
3818 | } | |
3819 | ||
3820 | log_warning("%s failed due to unknown reason.", name); | |
3821 | return -EPROTO; | |
3822 | } | |
3823 | ||
60f067b4 | 3824 | noreturn void freeze(void) { |
663996b3 MS |
3825 | |
3826 | /* Make sure nobody waits for us on a socket anymore */ | |
3827 | close_all_fds(NULL, 0); | |
3828 | ||
3829 | sync(); | |
3830 | ||
3831 | for (;;) | |
3832 | pause(); | |
3833 | } | |
3834 | ||
3835 | bool null_or_empty(struct stat *st) { | |
3836 | assert(st); | |
3837 | ||
3838 | if (S_ISREG(st->st_mode) && st->st_size <= 0) | |
3839 | return true; | |
3840 | ||
3841 | if (S_ISCHR(st->st_mode) || S_ISBLK(st->st_mode)) | |
3842 | return true; | |
3843 | ||
3844 | return false; | |
3845 | } | |
3846 | ||
3847 | int null_or_empty_path(const char *fn) { | |
3848 | struct stat st; | |
3849 | ||
3850 | assert(fn); | |
3851 | ||
3852 | if (stat(fn, &st) < 0) | |
3853 | return -errno; | |
3854 | ||
3855 | return null_or_empty(&st); | |
3856 | } | |
3857 | ||
5eef597e MP |
3858 | int null_or_empty_fd(int fd) { |
3859 | struct stat st; | |
3860 | ||
3861 | assert(fd >= 0); | |
3862 | ||
3863 | if (fstat(fd, &st) < 0) | |
3864 | return -errno; | |
3865 | ||
3866 | return null_or_empty(&st); | |
3867 | } | |
3868 | ||
663996b3 MS |
3869 | DIR *xopendirat(int fd, const char *name, int flags) { |
3870 | int nfd; | |
3871 | DIR *d; | |
3872 | ||
14228c0d MB |
3873 | assert(!(flags & O_CREAT)); |
3874 | ||
3875 | nfd = openat(fd, name, O_RDONLY|O_NONBLOCK|O_DIRECTORY|O_CLOEXEC|flags, 0); | |
663996b3 MS |
3876 | if (nfd < 0) |
3877 | return NULL; | |
3878 | ||
3879 | d = fdopendir(nfd); | |
3880 | if (!d) { | |
60f067b4 | 3881 | safe_close(nfd); |
663996b3 MS |
3882 | return NULL; |
3883 | } | |
3884 | ||
3885 | return d; | |
3886 | } | |
3887 | ||
3888 | int signal_from_string_try_harder(const char *s) { | |
3889 | int signo; | |
3890 | assert(s); | |
3891 | ||
3892 | signo = signal_from_string(s); | |
3893 | if (signo <= 0) | |
3894 | if (startswith(s, "SIG")) | |
3895 | return signal_from_string(s+3); | |
3896 | ||
3897 | return signo; | |
3898 | } | |
3899 | ||
3900 | static char *tag_to_udev_node(const char *tagvalue, const char *by) { | |
14228c0d | 3901 | _cleanup_free_ char *t = NULL, *u = NULL; |
14228c0d | 3902 | size_t enc_len; |
663996b3 MS |
3903 | |
3904 | u = unquote(tagvalue, "\"\'"); | |
60f067b4 | 3905 | if (!u) |
663996b3 MS |
3906 | return NULL; |
3907 | ||
60f067b4 | 3908 | enc_len = strlen(u) * 4 + 1; |
14228c0d | 3909 | t = new(char, enc_len); |
60f067b4 | 3910 | if (!t) |
663996b3 MS |
3911 | return NULL; |
3912 | ||
14228c0d MB |
3913 | if (encode_devnode_name(u, t, enc_len) < 0) |
3914 | return NULL; | |
663996b3 | 3915 | |
60f067b4 | 3916 | return strjoin("/dev/disk/by-", by, "/", t, NULL); |
663996b3 MS |
3917 | } |
3918 | ||
3919 | char *fstab_node_to_udev_node(const char *p) { | |
3920 | assert(p); | |
3921 | ||
3922 | if (startswith(p, "LABEL=")) | |
3923 | return tag_to_udev_node(p+6, "label"); | |
3924 | ||
3925 | if (startswith(p, "UUID=")) | |
3926 | return tag_to_udev_node(p+5, "uuid"); | |
3927 | ||
3928 | if (startswith(p, "PARTUUID=")) | |
3929 | return tag_to_udev_node(p+9, "partuuid"); | |
3930 | ||
3931 | if (startswith(p, "PARTLABEL=")) | |
3932 | return tag_to_udev_node(p+10, "partlabel"); | |
3933 | ||
3934 | return strdup(p); | |
3935 | } | |
3936 | ||
3937 | bool tty_is_vc(const char *tty) { | |
3938 | assert(tty); | |
3939 | ||
663996b3 MS |
3940 | return vtnr_from_tty(tty) >= 0; |
3941 | } | |
3942 | ||
3943 | bool tty_is_console(const char *tty) { | |
3944 | assert(tty); | |
3945 | ||
3946 | if (startswith(tty, "/dev/")) | |
3947 | tty += 5; | |
3948 | ||
3949 | return streq(tty, "console"); | |
3950 | } | |
3951 | ||
3952 | int vtnr_from_tty(const char *tty) { | |
3953 | int i, r; | |
3954 | ||
3955 | assert(tty); | |
3956 | ||
3957 | if (startswith(tty, "/dev/")) | |
3958 | tty += 5; | |
3959 | ||
3960 | if (!startswith(tty, "tty") ) | |
3961 | return -EINVAL; | |
3962 | ||
3963 | if (tty[3] < '0' || tty[3] > '9') | |
3964 | return -EINVAL; | |
3965 | ||
3966 | r = safe_atoi(tty+3, &i); | |
3967 | if (r < 0) | |
3968 | return r; | |
3969 | ||
3970 | if (i < 0 || i > 63) | |
3971 | return -EINVAL; | |
3972 | ||
3973 | return i; | |
3974 | } | |
3975 | ||
3976 | char *resolve_dev_console(char **active) { | |
3977 | char *tty; | |
3978 | ||
3979 | /* Resolve where /dev/console is pointing to, if /sys is actually ours | |
3980 | * (i.e. not read-only-mounted which is a sign for container setups) */ | |
3981 | ||
3982 | if (path_is_read_only_fs("/sys") > 0) | |
3983 | return NULL; | |
3984 | ||
3985 | if (read_one_line_file("/sys/class/tty/console/active", active) < 0) | |
3986 | return NULL; | |
3987 | ||
3988 | /* If multiple log outputs are configured the last one is what | |
3989 | * /dev/console points to */ | |
3990 | tty = strrchr(*active, ' '); | |
3991 | if (tty) | |
3992 | tty++; | |
3993 | else | |
3994 | tty = *active; | |
3995 | ||
60f067b4 JS |
3996 | if (streq(tty, "tty0")) { |
3997 | char *tmp; | |
3998 | ||
3999 | /* Get the active VC (e.g. tty1) */ | |
4000 | if (read_one_line_file("/sys/class/tty/tty0/active", &tmp) >= 0) { | |
4001 | free(*active); | |
4002 | tty = *active = tmp; | |
4003 | } | |
4004 | } | |
4005 | ||
663996b3 MS |
4006 | return tty; |
4007 | } | |
4008 | ||
4009 | bool tty_is_vc_resolve(const char *tty) { | |
60f067b4 | 4010 | _cleanup_free_ char *active = NULL; |
663996b3 MS |
4011 | |
4012 | assert(tty); | |
4013 | ||
4014 | if (startswith(tty, "/dev/")) | |
4015 | tty += 5; | |
4016 | ||
4017 | if (streq(tty, "console")) { | |
4018 | tty = resolve_dev_console(&active); | |
4019 | if (!tty) | |
4020 | return false; | |
4021 | } | |
4022 | ||
60f067b4 | 4023 | return tty_is_vc(tty); |
663996b3 MS |
4024 | } |
4025 | ||
4026 | const char *default_term_for_tty(const char *tty) { | |
4027 | assert(tty); | |
4028 | ||
e735f4d4 | 4029 | return tty_is_vc_resolve(tty) ? "TERM=linux" : "TERM=vt220"; |
663996b3 MS |
4030 | } |
4031 | ||
4032 | bool dirent_is_file(const struct dirent *de) { | |
4033 | assert(de); | |
4034 | ||
e735f4d4 | 4035 | if (hidden_file(de->d_name)) |
663996b3 MS |
4036 | return false; |
4037 | ||
4038 | if (de->d_type != DT_REG && | |
4039 | de->d_type != DT_LNK && | |
4040 | de->d_type != DT_UNKNOWN) | |
4041 | return false; | |
4042 | ||
4043 | return true; | |
4044 | } | |
4045 | ||
4046 | bool dirent_is_file_with_suffix(const struct dirent *de, const char *suffix) { | |
4047 | assert(de); | |
4048 | ||
4049 | if (de->d_type != DT_REG && | |
4050 | de->d_type != DT_LNK && | |
4051 | de->d_type != DT_UNKNOWN) | |
4052 | return false; | |
4053 | ||
e735f4d4 | 4054 | if (hidden_file_allow_backup(de->d_name)) |
663996b3 MS |
4055 | return false; |
4056 | ||
4057 | return endswith(de->d_name, suffix); | |
4058 | } | |
4059 | ||
e735f4d4 MP |
4060 | static int do_execute(char **directories, usec_t timeout, char *argv[]) { |
4061 | _cleanup_hashmap_free_free_ Hashmap *pids = NULL; | |
4062 | _cleanup_set_free_free_ Set *seen = NULL; | |
4063 | char **directory; | |
663996b3 | 4064 | |
e735f4d4 MP |
4065 | /* We fork this all off from a child process so that we can |
4066 | * somewhat cleanly make use of SIGALRM to set a time limit */ | |
663996b3 | 4067 | |
e735f4d4 MP |
4068 | reset_all_signal_handlers(); |
4069 | reset_signal_mask(); | |
663996b3 | 4070 | |
e735f4d4 | 4071 | assert_se(prctl(PR_SET_PDEATHSIG, SIGTERM) == 0); |
663996b3 | 4072 | |
e735f4d4 MP |
4073 | pids = hashmap_new(NULL); |
4074 | if (!pids) | |
4075 | return log_oom(); | |
663996b3 | 4076 | |
e735f4d4 MP |
4077 | seen = set_new(&string_hash_ops); |
4078 | if (!seen) | |
4079 | return log_oom(); | |
663996b3 | 4080 | |
e735f4d4 MP |
4081 | STRV_FOREACH(directory, directories) { |
4082 | _cleanup_closedir_ DIR *d; | |
4083 | struct dirent *de; | |
663996b3 | 4084 | |
e735f4d4 | 4085 | d = opendir(*directory); |
60f067b4 | 4086 | if (!d) { |
e735f4d4 MP |
4087 | if (errno == ENOENT) |
4088 | continue; | |
663996b3 | 4089 | |
e735f4d4 | 4090 | return log_error_errno(errno, "Failed to open directory %s: %m", *directory); |
663996b3 MS |
4091 | } |
4092 | ||
60f067b4 JS |
4093 | FOREACH_DIRENT(de, d, break) { |
4094 | _cleanup_free_ char *path = NULL; | |
4095 | pid_t pid; | |
e735f4d4 | 4096 | int r; |
663996b3 | 4097 | |
60f067b4 JS |
4098 | if (!dirent_is_file(de)) |
4099 | continue; | |
663996b3 | 4100 | |
e735f4d4 MP |
4101 | if (set_contains(seen, de->d_name)) { |
4102 | log_debug("%1$s/%2$s skipped (%2$s was already seen).", *directory, de->d_name); | |
4103 | continue; | |
60f067b4 | 4104 | } |
663996b3 | 4105 | |
e735f4d4 MP |
4106 | r = set_put_strdup(seen, de->d_name); |
4107 | if (r < 0) | |
4108 | return log_oom(); | |
4109 | ||
4110 | path = strjoin(*directory, "/", de->d_name, NULL); | |
4111 | if (!path) | |
4112 | return log_oom(); | |
4113 | ||
4114 | if (null_or_empty_path(path)) { | |
4115 | log_debug("%s is empty (a mask).", path); | |
4116 | continue; | |
4117 | } else | |
4118 | log_debug("%s will be executed.", path); | |
4119 | ||
60f067b4 JS |
4120 | pid = fork(); |
4121 | if (pid < 0) { | |
f47781d8 | 4122 | log_error_errno(errno, "Failed to fork: %m"); |
60f067b4 JS |
4123 | continue; |
4124 | } else if (pid == 0) { | |
4125 | char *_argv[2]; | |
663996b3 | 4126 | |
60f067b4 | 4127 | assert_se(prctl(PR_SET_PDEATHSIG, SIGTERM) == 0); |
663996b3 | 4128 | |
60f067b4 JS |
4129 | if (!argv) { |
4130 | _argv[0] = path; | |
4131 | _argv[1] = NULL; | |
4132 | argv = _argv; | |
4133 | } else | |
4134 | argv[0] = path; | |
663996b3 | 4135 | |
60f067b4 | 4136 | execv(path, argv); |
e735f4d4 | 4137 | return log_error_errno(errno, "Failed to execute %s: %m", path); |
60f067b4 | 4138 | } |
663996b3 | 4139 | |
60f067b4 | 4140 | log_debug("Spawned %s as " PID_FMT ".", path, pid); |
663996b3 | 4141 | |
60f067b4 | 4142 | r = hashmap_put(pids, UINT_TO_PTR(pid), path); |
e735f4d4 MP |
4143 | if (r < 0) |
4144 | return log_oom(); | |
60f067b4 | 4145 | path = NULL; |
663996b3 | 4146 | } |
e735f4d4 | 4147 | } |
663996b3 | 4148 | |
e735f4d4 MP |
4149 | /* Abort execution of this process after the timout. We simply |
4150 | * rely on SIGALRM as default action terminating the process, | |
4151 | * and turn on alarm(). */ | |
663996b3 | 4152 | |
e735f4d4 MP |
4153 | if (timeout != USEC_INFINITY) |
4154 | alarm((timeout + USEC_PER_SEC - 1) / USEC_PER_SEC); | |
60f067b4 | 4155 | |
e735f4d4 MP |
4156 | while (!hashmap_isempty(pids)) { |
4157 | _cleanup_free_ char *path = NULL; | |
4158 | pid_t pid; | |
60f067b4 | 4159 | |
e735f4d4 MP |
4160 | pid = PTR_TO_UINT(hashmap_first_key(pids)); |
4161 | assert(pid > 0); | |
60f067b4 | 4162 | |
e735f4d4 MP |
4163 | path = hashmap_remove(pids, UINT_TO_PTR(pid)); |
4164 | assert(path); | |
60f067b4 | 4165 | |
e735f4d4 MP |
4166 | wait_for_terminate_and_warn(path, pid, true); |
4167 | } | |
663996b3 | 4168 | |
e735f4d4 MP |
4169 | return 0; |
4170 | } | |
4171 | ||
4172 | void execute_directories(const char* const* directories, usec_t timeout, char *argv[]) { | |
4173 | pid_t executor_pid; | |
4174 | int r; | |
4175 | char *name; | |
4176 | char **dirs = (char**) directories; | |
4177 | ||
4178 | assert(!strv_isempty(dirs)); | |
4179 | ||
4180 | name = basename(dirs[0]); | |
4181 | assert(!isempty(name)); | |
4182 | ||
4183 | /* Executes all binaries in the directories in parallel and waits | |
4184 | * for them to finish. Optionally a timeout is applied. If a file | |
4185 | * with the same name exists in more than one directory, the | |
4186 | * earliest one wins. */ | |
4187 | ||
4188 | executor_pid = fork(); | |
4189 | if (executor_pid < 0) { | |
4190 | log_error_errno(errno, "Failed to fork: %m"); | |
4191 | return; | |
4192 | ||
4193 | } else if (executor_pid == 0) { | |
4194 | r = do_execute(dirs, timeout, argv); | |
4195 | _exit(r < 0 ? EXIT_FAILURE : EXIT_SUCCESS); | |
60f067b4 | 4196 | } |
663996b3 | 4197 | |
e735f4d4 | 4198 | wait_for_terminate_and_warn(name, executor_pid, true); |
663996b3 MS |
4199 | } |
4200 | ||
4201 | int kill_and_sigcont(pid_t pid, int sig) { | |
4202 | int r; | |
4203 | ||
4204 | r = kill(pid, sig) < 0 ? -errno : 0; | |
4205 | ||
4206 | if (r >= 0) | |
4207 | kill(pid, SIGCONT); | |
4208 | ||
4209 | return r; | |
4210 | } | |
4211 | ||
4212 | bool nulstr_contains(const char*nulstr, const char *needle) { | |
4213 | const char *i; | |
4214 | ||
4215 | if (!nulstr) | |
4216 | return false; | |
4217 | ||
4218 | NULSTR_FOREACH(i, nulstr) | |
4219 | if (streq(i, needle)) | |
4220 | return true; | |
4221 | ||
4222 | return false; | |
4223 | } | |
4224 | ||
4225 | bool plymouth_running(void) { | |
4226 | return access("/run/plymouth/pid", F_OK) >= 0; | |
4227 | } | |
4228 | ||
4229 | char* strshorten(char *s, size_t l) { | |
4230 | assert(s); | |
4231 | ||
4232 | if (l < strlen(s)) | |
4233 | s[l] = 0; | |
4234 | ||
4235 | return s; | |
4236 | } | |
4237 | ||
4238 | static bool hostname_valid_char(char c) { | |
4239 | return | |
4240 | (c >= 'a' && c <= 'z') || | |
4241 | (c >= 'A' && c <= 'Z') || | |
4242 | (c >= '0' && c <= '9') || | |
4243 | c == '-' || | |
4244 | c == '_' || | |
4245 | c == '.'; | |
4246 | } | |
4247 | ||
4248 | bool hostname_is_valid(const char *s) { | |
4249 | const char *p; | |
4250 | bool dot; | |
4251 | ||
4252 | if (isempty(s)) | |
4253 | return false; | |
4254 | ||
e735f4d4 MP |
4255 | /* Doesn't accept empty hostnames, hostnames with trailing or |
4256 | * leading dots, and hostnames with multiple dots in a | |
4257 | * sequence. Also ensures that the length stays below | |
4258 | * HOST_NAME_MAX. */ | |
4259 | ||
663996b3 MS |
4260 | for (p = s, dot = true; *p; p++) { |
4261 | if (*p == '.') { | |
4262 | if (dot) | |
4263 | return false; | |
4264 | ||
4265 | dot = true; | |
4266 | } else { | |
4267 | if (!hostname_valid_char(*p)) | |
4268 | return false; | |
4269 | ||
4270 | dot = false; | |
4271 | } | |
4272 | } | |
4273 | ||
4274 | if (dot) | |
4275 | return false; | |
4276 | ||
4277 | if (p-s > HOST_NAME_MAX) | |
4278 | return false; | |
4279 | ||
4280 | return true; | |
4281 | } | |
4282 | ||
4283 | char* hostname_cleanup(char *s, bool lowercase) { | |
4284 | char *p, *d; | |
4285 | bool dot; | |
4286 | ||
4287 | for (p = s, d = s, dot = true; *p; p++) { | |
4288 | if (*p == '.') { | |
4289 | if (dot) | |
4290 | continue; | |
4291 | ||
4292 | *(d++) = '.'; | |
4293 | dot = true; | |
4294 | } else if (hostname_valid_char(*p)) { | |
4295 | *(d++) = lowercase ? tolower(*p) : *p; | |
4296 | dot = false; | |
4297 | } | |
4298 | ||
4299 | } | |
4300 | ||
4301 | if (dot && d > s) | |
4302 | d[-1] = 0; | |
4303 | else | |
4304 | *d = 0; | |
4305 | ||
4306 | strshorten(s, HOST_NAME_MAX); | |
4307 | ||
4308 | return s; | |
4309 | } | |
4310 | ||
e842803a MB |
4311 | bool machine_name_is_valid(const char *s) { |
4312 | ||
4313 | if (!hostname_is_valid(s)) | |
4314 | return false; | |
4315 | ||
4316 | /* Machine names should be useful hostnames, but also be | |
4317 | * useful in unit names, hence we enforce a stricter length | |
4318 | * limitation. */ | |
4319 | ||
4320 | if (strlen(s) > 64) | |
4321 | return false; | |
4322 | ||
4323 | return true; | |
4324 | } | |
4325 | ||
663996b3 | 4326 | int pipe_eof(int fd) { |
663996b3 MS |
4327 | struct pollfd pollfd = { |
4328 | .fd = fd, | |
4329 | .events = POLLIN|POLLHUP, | |
4330 | }; | |
4331 | ||
60f067b4 JS |
4332 | int r; |
4333 | ||
663996b3 MS |
4334 | r = poll(&pollfd, 1, 0); |
4335 | if (r < 0) | |
4336 | return -errno; | |
4337 | ||
4338 | if (r == 0) | |
4339 | return 0; | |
4340 | ||
4341 | return pollfd.revents & POLLHUP; | |
4342 | } | |
4343 | ||
4344 | int fd_wait_for_event(int fd, int event, usec_t t) { | |
60f067b4 | 4345 | |
663996b3 MS |
4346 | struct pollfd pollfd = { |
4347 | .fd = fd, | |
4348 | .events = event, | |
4349 | }; | |
4350 | ||
60f067b4 JS |
4351 | struct timespec ts; |
4352 | int r; | |
4353 | ||
5eef597e | 4354 | r = ppoll(&pollfd, 1, t == USEC_INFINITY ? NULL : timespec_store(&ts, t), NULL); |
663996b3 MS |
4355 | if (r < 0) |
4356 | return -errno; | |
4357 | ||
4358 | if (r == 0) | |
4359 | return 0; | |
4360 | ||
4361 | return pollfd.revents; | |
4362 | } | |
4363 | ||
4364 | int fopen_temporary(const char *path, FILE **_f, char **_temp_path) { | |
4365 | FILE *f; | |
4366 | char *t; | |
e735f4d4 | 4367 | int r, fd; |
663996b3 MS |
4368 | |
4369 | assert(path); | |
4370 | assert(_f); | |
4371 | assert(_temp_path); | |
4372 | ||
e735f4d4 MP |
4373 | r = tempfn_xxxxxx(path, &t); |
4374 | if (r < 0) | |
4375 | return r; | |
663996b3 | 4376 | |
60f067b4 | 4377 | fd = mkostemp_safe(t, O_WRONLY|O_CLOEXEC); |
663996b3 MS |
4378 | if (fd < 0) { |
4379 | free(t); | |
4380 | return -errno; | |
4381 | } | |
4382 | ||
4383 | f = fdopen(fd, "we"); | |
4384 | if (!f) { | |
4385 | unlink(t); | |
4386 | free(t); | |
4387 | return -errno; | |
4388 | } | |
4389 | ||
4390 | *_f = f; | |
4391 | *_temp_path = t; | |
4392 | ||
4393 | return 0; | |
4394 | } | |
4395 | ||
4396 | int terminal_vhangup_fd(int fd) { | |
4397 | assert(fd >= 0); | |
4398 | ||
4399 | if (ioctl(fd, TIOCVHANGUP) < 0) | |
4400 | return -errno; | |
4401 | ||
4402 | return 0; | |
4403 | } | |
4404 | ||
4405 | int terminal_vhangup(const char *name) { | |
60f067b4 | 4406 | _cleanup_close_ int fd; |
663996b3 MS |
4407 | |
4408 | fd = open_terminal(name, O_RDWR|O_NOCTTY|O_CLOEXEC); | |
4409 | if (fd < 0) | |
4410 | return fd; | |
4411 | ||
60f067b4 | 4412 | return terminal_vhangup_fd(fd); |
663996b3 MS |
4413 | } |
4414 | ||
4415 | int vt_disallocate(const char *name) { | |
4416 | int fd, r; | |
4417 | unsigned u; | |
4418 | ||
4419 | /* Deallocate the VT if possible. If not possible | |
4420 | * (i.e. because it is the active one), at least clear it | |
4421 | * entirely (including the scrollback buffer) */ | |
4422 | ||
4423 | if (!startswith(name, "/dev/")) | |
4424 | return -EINVAL; | |
4425 | ||
4426 | if (!tty_is_vc(name)) { | |
4427 | /* So this is not a VT. I guess we cannot deallocate | |
4428 | * it then. But let's at least clear the screen */ | |
4429 | ||
4430 | fd = open_terminal(name, O_RDWR|O_NOCTTY|O_CLOEXEC); | |
4431 | if (fd < 0) | |
4432 | return fd; | |
4433 | ||
4434 | loop_write(fd, | |
4435 | "\033[r" /* clear scrolling region */ | |
4436 | "\033[H" /* move home */ | |
4437 | "\033[2J", /* clear screen */ | |
4438 | 10, false); | |
60f067b4 | 4439 | safe_close(fd); |
663996b3 MS |
4440 | |
4441 | return 0; | |
4442 | } | |
4443 | ||
4444 | if (!startswith(name, "/dev/tty")) | |
4445 | return -EINVAL; | |
4446 | ||
4447 | r = safe_atou(name+8, &u); | |
4448 | if (r < 0) | |
4449 | return r; | |
4450 | ||
4451 | if (u <= 0) | |
4452 | return -EINVAL; | |
4453 | ||
4454 | /* Try to deallocate */ | |
4455 | fd = open_terminal("/dev/tty0", O_RDWR|O_NOCTTY|O_CLOEXEC); | |
4456 | if (fd < 0) | |
4457 | return fd; | |
4458 | ||
4459 | r = ioctl(fd, VT_DISALLOCATE, u); | |
60f067b4 | 4460 | safe_close(fd); |
663996b3 MS |
4461 | |
4462 | if (r >= 0) | |
4463 | return 0; | |
4464 | ||
4465 | if (errno != EBUSY) | |
4466 | return -errno; | |
4467 | ||
4468 | /* Couldn't deallocate, so let's clear it fully with | |
4469 | * scrollback */ | |
4470 | fd = open_terminal(name, O_RDWR|O_NOCTTY|O_CLOEXEC); | |
4471 | if (fd < 0) | |
4472 | return fd; | |
4473 | ||
4474 | loop_write(fd, | |
4475 | "\033[r" /* clear scrolling region */ | |
4476 | "\033[H" /* move home */ | |
4477 | "\033[3J", /* clear screen including scrollback, requires Linux 2.6.40 */ | |
4478 | 10, false); | |
60f067b4 | 4479 | safe_close(fd); |
663996b3 MS |
4480 | |
4481 | return 0; | |
4482 | } | |
4483 | ||
4484 | int symlink_atomic(const char *from, const char *to) { | |
e842803a | 4485 | _cleanup_free_ char *t = NULL; |
e735f4d4 | 4486 | int r; |
663996b3 MS |
4487 | |
4488 | assert(from); | |
4489 | assert(to); | |
4490 | ||
e735f4d4 MP |
4491 | r = tempfn_random(to, &t); |
4492 | if (r < 0) | |
4493 | return r; | |
663996b3 | 4494 | |
e842803a MB |
4495 | if (symlink(from, t) < 0) |
4496 | return -errno; | |
663996b3 | 4497 | |
e842803a MB |
4498 | if (rename(t, to) < 0) { |
4499 | unlink_noerrno(t); | |
4500 | return -errno; | |
663996b3 MS |
4501 | } |
4502 | ||
e842803a MB |
4503 | return 0; |
4504 | } | |
663996b3 | 4505 | |
e842803a MB |
4506 | int mknod_atomic(const char *path, mode_t mode, dev_t dev) { |
4507 | _cleanup_free_ char *t = NULL; | |
e735f4d4 | 4508 | int r; |
e842803a MB |
4509 | |
4510 | assert(path); | |
4511 | ||
e735f4d4 MP |
4512 | r = tempfn_random(path, &t); |
4513 | if (r < 0) | |
4514 | return r; | |
e842803a MB |
4515 | |
4516 | if (mknod(t, mode, dev) < 0) | |
663996b3 MS |
4517 | return -errno; |
4518 | ||
e842803a MB |
4519 | if (rename(t, path) < 0) { |
4520 | unlink_noerrno(t); | |
4521 | return -errno; | |
4522 | } | |
4523 | ||
4524 | return 0; | |
4525 | } | |
4526 | ||
4527 | int mkfifo_atomic(const char *path, mode_t mode) { | |
4528 | _cleanup_free_ char *t = NULL; | |
e735f4d4 | 4529 | int r; |
e842803a MB |
4530 | |
4531 | assert(path); | |
4532 | ||
e735f4d4 MP |
4533 | r = tempfn_random(path, &t); |
4534 | if (r < 0) | |
4535 | return r; | |
e842803a MB |
4536 | |
4537 | if (mkfifo(t, mode) < 0) | |
4538 | return -errno; | |
4539 | ||
4540 | if (rename(t, path) < 0) { | |
4541 | unlink_noerrno(t); | |
4542 | return -errno; | |
663996b3 MS |
4543 | } |
4544 | ||
4545 | return 0; | |
4546 | } | |
4547 | ||
4548 | bool display_is_local(const char *display) { | |
4549 | assert(display); | |
4550 | ||
4551 | return | |
4552 | display[0] == ':' && | |
4553 | display[1] >= '0' && | |
4554 | display[1] <= '9'; | |
4555 | } | |
4556 | ||
4557 | int socket_from_display(const char *display, char **path) { | |
4558 | size_t k; | |
4559 | char *f, *c; | |
4560 | ||
4561 | assert(display); | |
4562 | assert(path); | |
4563 | ||
4564 | if (!display_is_local(display)) | |
4565 | return -EINVAL; | |
4566 | ||
4567 | k = strspn(display+1, "0123456789"); | |
4568 | ||
60f067b4 | 4569 | f = new(char, strlen("/tmp/.X11-unix/X") + k + 1); |
663996b3 MS |
4570 | if (!f) |
4571 | return -ENOMEM; | |
4572 | ||
4573 | c = stpcpy(f, "/tmp/.X11-unix/X"); | |
4574 | memcpy(c, display+1, k); | |
4575 | c[k] = 0; | |
4576 | ||
4577 | *path = f; | |
4578 | ||
4579 | return 0; | |
4580 | } | |
4581 | ||
4582 | int get_user_creds( | |
4583 | const char **username, | |
4584 | uid_t *uid, gid_t *gid, | |
4585 | const char **home, | |
4586 | const char **shell) { | |
4587 | ||
4588 | struct passwd *p; | |
4589 | uid_t u; | |
4590 | ||
4591 | assert(username); | |
4592 | assert(*username); | |
4593 | ||
4594 | /* We enforce some special rules for uid=0: in order to avoid | |
4595 | * NSS lookups for root we hardcode its data. */ | |
4596 | ||
4597 | if (streq(*username, "root") || streq(*username, "0")) { | |
4598 | *username = "root"; | |
4599 | ||
4600 | if (uid) | |
4601 | *uid = 0; | |
4602 | ||
4603 | if (gid) | |
4604 | *gid = 0; | |
4605 | ||
4606 | if (home) | |
4607 | *home = "/root"; | |
4608 | ||
4609 | if (shell) | |
4610 | *shell = "/bin/sh"; | |
4611 | ||
4612 | return 0; | |
4613 | } | |
4614 | ||
4615 | if (parse_uid(*username, &u) >= 0) { | |
4616 | errno = 0; | |
4617 | p = getpwuid(u); | |
4618 | ||
4619 | /* If there are multiple users with the same id, make | |
4620 | * sure to leave $USER to the configured value instead | |
4621 | * of the first occurrence in the database. However if | |
4622 | * the uid was configured by a numeric uid, then let's | |
4623 | * pick the real username from /etc/passwd. */ | |
4624 | if (p) | |
4625 | *username = p->pw_name; | |
4626 | } else { | |
4627 | errno = 0; | |
4628 | p = getpwnam(*username); | |
4629 | } | |
4630 | ||
4631 | if (!p) | |
4632 | return errno > 0 ? -errno : -ESRCH; | |
4633 | ||
4634 | if (uid) | |
4635 | *uid = p->pw_uid; | |
4636 | ||
4637 | if (gid) | |
4638 | *gid = p->pw_gid; | |
4639 | ||
4640 | if (home) | |
4641 | *home = p->pw_dir; | |
4642 | ||
4643 | if (shell) | |
4644 | *shell = p->pw_shell; | |
4645 | ||
4646 | return 0; | |
4647 | } | |
4648 | ||
4649 | char* uid_to_name(uid_t uid) { | |
4650 | struct passwd *p; | |
4651 | char *r; | |
4652 | ||
4653 | if (uid == 0) | |
4654 | return strdup("root"); | |
4655 | ||
4656 | p = getpwuid(uid); | |
4657 | if (p) | |
4658 | return strdup(p->pw_name); | |
4659 | ||
60f067b4 | 4660 | if (asprintf(&r, UID_FMT, uid) < 0) |
663996b3 MS |
4661 | return NULL; |
4662 | ||
4663 | return r; | |
4664 | } | |
4665 | ||
4666 | char* gid_to_name(gid_t gid) { | |
4667 | struct group *p; | |
4668 | char *r; | |
4669 | ||
4670 | if (gid == 0) | |
4671 | return strdup("root"); | |
4672 | ||
4673 | p = getgrgid(gid); | |
4674 | if (p) | |
4675 | return strdup(p->gr_name); | |
4676 | ||
60f067b4 | 4677 | if (asprintf(&r, GID_FMT, gid) < 0) |
663996b3 MS |
4678 | return NULL; |
4679 | ||
4680 | return r; | |
4681 | } | |
4682 | ||
4683 | int get_group_creds(const char **groupname, gid_t *gid) { | |
4684 | struct group *g; | |
4685 | gid_t id; | |
4686 | ||
4687 | assert(groupname); | |
4688 | ||
4689 | /* We enforce some special rules for gid=0: in order to avoid | |
4690 | * NSS lookups for root we hardcode its data. */ | |
4691 | ||
4692 | if (streq(*groupname, "root") || streq(*groupname, "0")) { | |
4693 | *groupname = "root"; | |
4694 | ||
4695 | if (gid) | |
4696 | *gid = 0; | |
4697 | ||
4698 | return 0; | |
4699 | } | |
4700 | ||
4701 | if (parse_gid(*groupname, &id) >= 0) { | |
4702 | errno = 0; | |
4703 | g = getgrgid(id); | |
4704 | ||
4705 | if (g) | |
4706 | *groupname = g->gr_name; | |
4707 | } else { | |
4708 | errno = 0; | |
4709 | g = getgrnam(*groupname); | |
4710 | } | |
4711 | ||
4712 | if (!g) | |
4713 | return errno > 0 ? -errno : -ESRCH; | |
4714 | ||
4715 | if (gid) | |
4716 | *gid = g->gr_gid; | |
4717 | ||
4718 | return 0; | |
4719 | } | |
4720 | ||
4721 | int in_gid(gid_t gid) { | |
4722 | gid_t *gids; | |
4723 | int ngroups_max, r, i; | |
4724 | ||
4725 | if (getgid() == gid) | |
4726 | return 1; | |
4727 | ||
4728 | if (getegid() == gid) | |
4729 | return 1; | |
4730 | ||
4731 | ngroups_max = sysconf(_SC_NGROUPS_MAX); | |
4732 | assert(ngroups_max > 0); | |
4733 | ||
4734 | gids = alloca(sizeof(gid_t) * ngroups_max); | |
4735 | ||
4736 | r = getgroups(ngroups_max, gids); | |
4737 | if (r < 0) | |
4738 | return -errno; | |
4739 | ||
4740 | for (i = 0; i < r; i++) | |
4741 | if (gids[i] == gid) | |
4742 | return 1; | |
4743 | ||
4744 | return 0; | |
4745 | } | |
4746 | ||
4747 | int in_group(const char *name) { | |
4748 | int r; | |
4749 | gid_t gid; | |
4750 | ||
4751 | r = get_group_creds(&name, &gid); | |
4752 | if (r < 0) | |
4753 | return r; | |
4754 | ||
4755 | return in_gid(gid); | |
4756 | } | |
4757 | ||
4758 | int glob_exists(const char *path) { | |
4759 | _cleanup_globfree_ glob_t g = {}; | |
14228c0d | 4760 | int k; |
663996b3 MS |
4761 | |
4762 | assert(path); | |
4763 | ||
4764 | errno = 0; | |
4765 | k = glob(path, GLOB_NOSORT|GLOB_BRACE, NULL, &g); | |
4766 | ||
4767 | if (k == GLOB_NOMATCH) | |
14228c0d | 4768 | return 0; |
663996b3 | 4769 | else if (k == GLOB_NOSPACE) |
14228c0d | 4770 | return -ENOMEM; |
663996b3 | 4771 | else if (k == 0) |
14228c0d | 4772 | return !strv_isempty(g.gl_pathv); |
663996b3 | 4773 | else |
14228c0d MB |
4774 | return errno ? -errno : -EIO; |
4775 | } | |
663996b3 | 4776 | |
14228c0d MB |
4777 | int glob_extend(char ***strv, const char *path) { |
4778 | _cleanup_globfree_ glob_t g = {}; | |
4779 | int k; | |
4780 | char **p; | |
4781 | ||
4782 | errno = 0; | |
60f067b4 | 4783 | k = glob(path, GLOB_NOSORT|GLOB_BRACE, NULL, &g); |
14228c0d MB |
4784 | |
4785 | if (k == GLOB_NOMATCH) | |
4786 | return -ENOENT; | |
4787 | else if (k == GLOB_NOSPACE) | |
4788 | return -ENOMEM; | |
4789 | else if (k != 0 || strv_isempty(g.gl_pathv)) | |
4790 | return errno ? -errno : -EIO; | |
4791 | ||
4792 | STRV_FOREACH(p, g.gl_pathv) { | |
4793 | k = strv_extend(strv, *p); | |
4794 | if (k < 0) | |
4795 | break; | |
4796 | } | |
4797 | ||
4798 | return k; | |
663996b3 MS |
4799 | } |
4800 | ||
4801 | int dirent_ensure_type(DIR *d, struct dirent *de) { | |
4802 | struct stat st; | |
4803 | ||
4804 | assert(d); | |
4805 | assert(de); | |
4806 | ||
4807 | if (de->d_type != DT_UNKNOWN) | |
4808 | return 0; | |
4809 | ||
4810 | if (fstatat(dirfd(d), de->d_name, &st, AT_SYMLINK_NOFOLLOW) < 0) | |
4811 | return -errno; | |
4812 | ||
4813 | de->d_type = | |
4814 | S_ISREG(st.st_mode) ? DT_REG : | |
4815 | S_ISDIR(st.st_mode) ? DT_DIR : | |
4816 | S_ISLNK(st.st_mode) ? DT_LNK : | |
4817 | S_ISFIFO(st.st_mode) ? DT_FIFO : | |
4818 | S_ISSOCK(st.st_mode) ? DT_SOCK : | |
4819 | S_ISCHR(st.st_mode) ? DT_CHR : | |
4820 | S_ISBLK(st.st_mode) ? DT_BLK : | |
4821 | DT_UNKNOWN; | |
4822 | ||
4823 | return 0; | |
4824 | } | |
4825 | ||
663996b3 | 4826 | int get_files_in_directory(const char *path, char ***list) { |
14228c0d MB |
4827 | _cleanup_closedir_ DIR *d = NULL; |
4828 | size_t bufsize = 0, n = 0; | |
4829 | _cleanup_strv_free_ char **l = NULL; | |
663996b3 MS |
4830 | |
4831 | assert(path); | |
4832 | ||
4833 | /* Returns all files in a directory in *list, and the number | |
4834 | * of files as return value. If list is NULL returns only the | |
14228c0d | 4835 | * number. */ |
663996b3 MS |
4836 | |
4837 | d = opendir(path); | |
4838 | if (!d) | |
4839 | return -errno; | |
4840 | ||
4841 | for (;;) { | |
4842 | struct dirent *de; | |
663996b3 | 4843 | |
60f067b4 JS |
4844 | errno = 0; |
4845 | de = readdir(d); | |
4846 | if (!de && errno != 0) | |
4847 | return -errno; | |
663996b3 MS |
4848 | if (!de) |
4849 | break; | |
4850 | ||
4851 | dirent_ensure_type(d, de); | |
4852 | ||
4853 | if (!dirent_is_file(de)) | |
4854 | continue; | |
4855 | ||
4856 | if (list) { | |
14228c0d MB |
4857 | /* one extra slot is needed for the terminating NULL */ |
4858 | if (!GREEDY_REALLOC(l, bufsize, n + 2)) | |
4859 | return -ENOMEM; | |
663996b3 | 4860 | |
14228c0d MB |
4861 | l[n] = strdup(de->d_name); |
4862 | if (!l[n]) | |
4863 | return -ENOMEM; | |
663996b3 | 4864 | |
14228c0d | 4865 | l[++n] = NULL; |
663996b3 | 4866 | } else |
14228c0d | 4867 | n++; |
663996b3 MS |
4868 | } |
4869 | ||
14228c0d MB |
4870 | if (list) { |
4871 | *list = l; | |
4872 | l = NULL; /* avoid freeing */ | |
4873 | } | |
663996b3 | 4874 | |
14228c0d | 4875 | return n; |
663996b3 MS |
4876 | } |
4877 | ||
4878 | char *strjoin(const char *x, ...) { | |
4879 | va_list ap; | |
4880 | size_t l; | |
4881 | char *r, *p; | |
4882 | ||
4883 | va_start(ap, x); | |
4884 | ||
4885 | if (x) { | |
4886 | l = strlen(x); | |
4887 | ||
4888 | for (;;) { | |
4889 | const char *t; | |
4890 | size_t n; | |
4891 | ||
4892 | t = va_arg(ap, const char *); | |
4893 | if (!t) | |
4894 | break; | |
4895 | ||
4896 | n = strlen(t); | |
4897 | if (n > ((size_t) -1) - l) { | |
4898 | va_end(ap); | |
4899 | return NULL; | |
4900 | } | |
4901 | ||
4902 | l += n; | |
4903 | } | |
4904 | } else | |
4905 | l = 0; | |
4906 | ||
4907 | va_end(ap); | |
4908 | ||
4909 | r = new(char, l+1); | |
4910 | if (!r) | |
4911 | return NULL; | |
4912 | ||
4913 | if (x) { | |
4914 | p = stpcpy(r, x); | |
4915 | ||
4916 | va_start(ap, x); | |
4917 | ||
4918 | for (;;) { | |
4919 | const char *t; | |
4920 | ||
4921 | t = va_arg(ap, const char *); | |
4922 | if (!t) | |
4923 | break; | |
4924 | ||
4925 | p = stpcpy(p, t); | |
4926 | } | |
4927 | ||
4928 | va_end(ap); | |
4929 | } else | |
4930 | r[0] = 0; | |
4931 | ||
4932 | return r; | |
4933 | } | |
4934 | ||
4935 | bool is_main_thread(void) { | |
60f067b4 | 4936 | static thread_local int cached = 0; |
663996b3 MS |
4937 | |
4938 | if (_unlikely_(cached == 0)) | |
4939 | cached = getpid() == gettid() ? 1 : -1; | |
4940 | ||
4941 | return cached > 0; | |
4942 | } | |
4943 | ||
4944 | int block_get_whole_disk(dev_t d, dev_t *ret) { | |
4945 | char *p, *s; | |
4946 | int r; | |
4947 | unsigned n, m; | |
4948 | ||
4949 | assert(ret); | |
4950 | ||
4951 | /* If it has a queue this is good enough for us */ | |
4952 | if (asprintf(&p, "/sys/dev/block/%u:%u/queue", major(d), minor(d)) < 0) | |
4953 | return -ENOMEM; | |
4954 | ||
4955 | r = access(p, F_OK); | |
4956 | free(p); | |
4957 | ||
4958 | if (r >= 0) { | |
4959 | *ret = d; | |
4960 | return 0; | |
4961 | } | |
4962 | ||
4963 | /* If it is a partition find the originating device */ | |
4964 | if (asprintf(&p, "/sys/dev/block/%u:%u/partition", major(d), minor(d)) < 0) | |
4965 | return -ENOMEM; | |
4966 | ||
4967 | r = access(p, F_OK); | |
4968 | free(p); | |
4969 | ||
4970 | if (r < 0) | |
4971 | return -ENOENT; | |
4972 | ||
4973 | /* Get parent dev_t */ | |
4974 | if (asprintf(&p, "/sys/dev/block/%u:%u/../dev", major(d), minor(d)) < 0) | |
4975 | return -ENOMEM; | |
4976 | ||
4977 | r = read_one_line_file(p, &s); | |
4978 | free(p); | |
4979 | ||
4980 | if (r < 0) | |
4981 | return r; | |
4982 | ||
4983 | r = sscanf(s, "%u:%u", &m, &n); | |
4984 | free(s); | |
4985 | ||
4986 | if (r != 2) | |
4987 | return -EINVAL; | |
4988 | ||
4989 | /* Only return this if it is really good enough for us. */ | |
4990 | if (asprintf(&p, "/sys/dev/block/%u:%u/queue", m, n) < 0) | |
4991 | return -ENOMEM; | |
4992 | ||
4993 | r = access(p, F_OK); | |
4994 | free(p); | |
4995 | ||
4996 | if (r >= 0) { | |
4997 | *ret = makedev(m, n); | |
4998 | return 0; | |
4999 | } | |
5000 | ||
5001 | return -ENOENT; | |
5002 | } | |
5003 | ||
663996b3 MS |
5004 | static const char *const ioprio_class_table[] = { |
5005 | [IOPRIO_CLASS_NONE] = "none", | |
5006 | [IOPRIO_CLASS_RT] = "realtime", | |
5007 | [IOPRIO_CLASS_BE] = "best-effort", | |
5008 | [IOPRIO_CLASS_IDLE] = "idle" | |
5009 | }; | |
5010 | ||
5011 | DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(ioprio_class, int, INT_MAX); | |
5012 | ||
5013 | static const char *const sigchld_code_table[] = { | |
5014 | [CLD_EXITED] = "exited", | |
5015 | [CLD_KILLED] = "killed", | |
5016 | [CLD_DUMPED] = "dumped", | |
5017 | [CLD_TRAPPED] = "trapped", | |
5018 | [CLD_STOPPED] = "stopped", | |
5019 | [CLD_CONTINUED] = "continued", | |
5020 | }; | |
5021 | ||
5022 | DEFINE_STRING_TABLE_LOOKUP(sigchld_code, int); | |
5023 | ||
5024 | static const char *const log_facility_unshifted_table[LOG_NFACILITIES] = { | |
5025 | [LOG_FAC(LOG_KERN)] = "kern", | |
5026 | [LOG_FAC(LOG_USER)] = "user", | |
5027 | [LOG_FAC(LOG_MAIL)] = "mail", | |
5028 | [LOG_FAC(LOG_DAEMON)] = "daemon", | |
5029 | [LOG_FAC(LOG_AUTH)] = "auth", | |
5030 | [LOG_FAC(LOG_SYSLOG)] = "syslog", | |
5031 | [LOG_FAC(LOG_LPR)] = "lpr", | |
5032 | [LOG_FAC(LOG_NEWS)] = "news", | |
5033 | [LOG_FAC(LOG_UUCP)] = "uucp", | |
5034 | [LOG_FAC(LOG_CRON)] = "cron", | |
5035 | [LOG_FAC(LOG_AUTHPRIV)] = "authpriv", | |
5036 | [LOG_FAC(LOG_FTP)] = "ftp", | |
5037 | [LOG_FAC(LOG_LOCAL0)] = "local0", | |
5038 | [LOG_FAC(LOG_LOCAL1)] = "local1", | |
5039 | [LOG_FAC(LOG_LOCAL2)] = "local2", | |
5040 | [LOG_FAC(LOG_LOCAL3)] = "local3", | |
5041 | [LOG_FAC(LOG_LOCAL4)] = "local4", | |
5042 | [LOG_FAC(LOG_LOCAL5)] = "local5", | |
5043 | [LOG_FAC(LOG_LOCAL6)] = "local6", | |
5044 | [LOG_FAC(LOG_LOCAL7)] = "local7" | |
5045 | }; | |
5046 | ||
5047 | DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(log_facility_unshifted, int, LOG_FAC(~0)); | |
5048 | ||
5049 | static const char *const log_level_table[] = { | |
5050 | [LOG_EMERG] = "emerg", | |
5051 | [LOG_ALERT] = "alert", | |
5052 | [LOG_CRIT] = "crit", | |
5053 | [LOG_ERR] = "err", | |
5054 | [LOG_WARNING] = "warning", | |
5055 | [LOG_NOTICE] = "notice", | |
5056 | [LOG_INFO] = "info", | |
5057 | [LOG_DEBUG] = "debug" | |
5058 | }; | |
5059 | ||
5060 | DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(log_level, int, LOG_DEBUG); | |
5061 | ||
5062 | static const char* const sched_policy_table[] = { | |
5063 | [SCHED_OTHER] = "other", | |
5064 | [SCHED_BATCH] = "batch", | |
5065 | [SCHED_IDLE] = "idle", | |
5066 | [SCHED_FIFO] = "fifo", | |
5067 | [SCHED_RR] = "rr" | |
5068 | }; | |
5069 | ||
5070 | DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(sched_policy, int, INT_MAX); | |
5071 | ||
60f067b4 | 5072 | static const char* const rlimit_table[_RLIMIT_MAX] = { |
663996b3 MS |
5073 | [RLIMIT_CPU] = "LimitCPU", |
5074 | [RLIMIT_FSIZE] = "LimitFSIZE", | |
5075 | [RLIMIT_DATA] = "LimitDATA", | |
5076 | [RLIMIT_STACK] = "LimitSTACK", | |
5077 | [RLIMIT_CORE] = "LimitCORE", | |
5078 | [RLIMIT_RSS] = "LimitRSS", | |
5079 | [RLIMIT_NOFILE] = "LimitNOFILE", | |
5080 | [RLIMIT_AS] = "LimitAS", | |
5081 | [RLIMIT_NPROC] = "LimitNPROC", | |
5082 | [RLIMIT_MEMLOCK] = "LimitMEMLOCK", | |
5083 | [RLIMIT_LOCKS] = "LimitLOCKS", | |
5084 | [RLIMIT_SIGPENDING] = "LimitSIGPENDING", | |
5085 | [RLIMIT_MSGQUEUE] = "LimitMSGQUEUE", | |
5086 | [RLIMIT_NICE] = "LimitNICE", | |
5087 | [RLIMIT_RTPRIO] = "LimitRTPRIO", | |
5088 | [RLIMIT_RTTIME] = "LimitRTTIME" | |
5089 | }; | |
5090 | ||
5091 | DEFINE_STRING_TABLE_LOOKUP(rlimit, int); | |
5092 | ||
5093 | static const char* const ip_tos_table[] = { | |
5094 | [IPTOS_LOWDELAY] = "low-delay", | |
5095 | [IPTOS_THROUGHPUT] = "throughput", | |
5096 | [IPTOS_RELIABILITY] = "reliability", | |
5097 | [IPTOS_LOWCOST] = "low-cost", | |
5098 | }; | |
5099 | ||
5100 | DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(ip_tos, int, 0xff); | |
5101 | ||
5102 | static const char *const __signal_table[] = { | |
5103 | [SIGHUP] = "HUP", | |
5104 | [SIGINT] = "INT", | |
5105 | [SIGQUIT] = "QUIT", | |
5106 | [SIGILL] = "ILL", | |
5107 | [SIGTRAP] = "TRAP", | |
5108 | [SIGABRT] = "ABRT", | |
5109 | [SIGBUS] = "BUS", | |
5110 | [SIGFPE] = "FPE", | |
5111 | [SIGKILL] = "KILL", | |
5112 | [SIGUSR1] = "USR1", | |
5113 | [SIGSEGV] = "SEGV", | |
5114 | [SIGUSR2] = "USR2", | |
5115 | [SIGPIPE] = "PIPE", | |
5116 | [SIGALRM] = "ALRM", | |
5117 | [SIGTERM] = "TERM", | |
5118 | #ifdef SIGSTKFLT | |
5119 | [SIGSTKFLT] = "STKFLT", /* Linux on SPARC doesn't know SIGSTKFLT */ | |
5120 | #endif | |
5121 | [SIGCHLD] = "CHLD", | |
5122 | [SIGCONT] = "CONT", | |
5123 | [SIGSTOP] = "STOP", | |
5124 | [SIGTSTP] = "TSTP", | |
5125 | [SIGTTIN] = "TTIN", | |
5126 | [SIGTTOU] = "TTOU", | |
5127 | [SIGURG] = "URG", | |
5128 | [SIGXCPU] = "XCPU", | |
5129 | [SIGXFSZ] = "XFSZ", | |
5130 | [SIGVTALRM] = "VTALRM", | |
5131 | [SIGPROF] = "PROF", | |
5132 | [SIGWINCH] = "WINCH", | |
5133 | [SIGIO] = "IO", | |
5134 | [SIGPWR] = "PWR", | |
5135 | [SIGSYS] = "SYS" | |
5136 | }; | |
5137 | ||
5138 | DEFINE_PRIVATE_STRING_TABLE_LOOKUP(__signal, int); | |
5139 | ||
5140 | const char *signal_to_string(int signo) { | |
60f067b4 | 5141 | static thread_local char buf[sizeof("RTMIN+")-1 + DECIMAL_STR_MAX(int) + 1]; |
663996b3 MS |
5142 | const char *name; |
5143 | ||
5144 | name = __signal_to_string(signo); | |
5145 | if (name) | |
5146 | return name; | |
5147 | ||
5148 | if (signo >= SIGRTMIN && signo <= SIGRTMAX) | |
5149 | snprintf(buf, sizeof(buf), "RTMIN+%d", signo - SIGRTMIN); | |
5150 | else | |
5151 | snprintf(buf, sizeof(buf), "%d", signo); | |
5152 | ||
5153 | return buf; | |
5154 | } | |
5155 | ||
5156 | int signal_from_string(const char *s) { | |
5157 | int signo; | |
5158 | int offset = 0; | |
5159 | unsigned u; | |
5160 | ||
5161 | signo = __signal_from_string(s); | |
5162 | if (signo > 0) | |
5163 | return signo; | |
5164 | ||
5165 | if (startswith(s, "RTMIN+")) { | |
5166 | s += 6; | |
5167 | offset = SIGRTMIN; | |
5168 | } | |
5169 | if (safe_atou(s, &u) >= 0) { | |
5170 | signo = (int) u + offset; | |
5171 | if (signo > 0 && signo < _NSIG) | |
5172 | return signo; | |
5173 | } | |
5eef597e | 5174 | return -EINVAL; |
663996b3 MS |
5175 | } |
5176 | ||
5177 | bool kexec_loaded(void) { | |
5178 | bool loaded = false; | |
5179 | char *s; | |
5180 | ||
5181 | if (read_one_line_file("/sys/kernel/kexec_loaded", &s) >= 0) { | |
5182 | if (s[0] == '1') | |
5183 | loaded = true; | |
5184 | free(s); | |
5185 | } | |
5186 | return loaded; | |
5187 | } | |
5188 | ||
663996b3 MS |
5189 | int prot_from_flags(int flags) { |
5190 | ||
5191 | switch (flags & O_ACCMODE) { | |
5192 | ||
5193 | case O_RDONLY: | |
5194 | return PROT_READ; | |
5195 | ||
5196 | case O_WRONLY: | |
5197 | return PROT_WRITE; | |
5198 | ||
5199 | case O_RDWR: | |
5200 | return PROT_READ|PROT_WRITE; | |
5201 | ||
5202 | default: | |
5203 | return -EINVAL; | |
5204 | } | |
5205 | } | |
5206 | ||
5207 | char *format_bytes(char *buf, size_t l, off_t t) { | |
5208 | unsigned i; | |
5209 | ||
5210 | static const struct { | |
5211 | const char *suffix; | |
5212 | off_t factor; | |
5213 | } table[] = { | |
5214 | { "E", 1024ULL*1024ULL*1024ULL*1024ULL*1024ULL*1024ULL }, | |
5215 | { "P", 1024ULL*1024ULL*1024ULL*1024ULL*1024ULL }, | |
5216 | { "T", 1024ULL*1024ULL*1024ULL*1024ULL }, | |
5217 | { "G", 1024ULL*1024ULL*1024ULL }, | |
5218 | { "M", 1024ULL*1024ULL }, | |
5219 | { "K", 1024ULL }, | |
5220 | }; | |
5221 | ||
e735f4d4 MP |
5222 | if (t == (off_t) -1) |
5223 | return NULL; | |
5224 | ||
663996b3 MS |
5225 | for (i = 0; i < ELEMENTSOF(table); i++) { |
5226 | ||
5227 | if (t >= table[i].factor) { | |
5228 | snprintf(buf, l, | |
5229 | "%llu.%llu%s", | |
5230 | (unsigned long long) (t / table[i].factor), | |
5231 | (unsigned long long) (((t*10ULL) / table[i].factor) % 10ULL), | |
5232 | table[i].suffix); | |
5233 | ||
5234 | goto finish; | |
5235 | } | |
5236 | } | |
5237 | ||
5238 | snprintf(buf, l, "%lluB", (unsigned long long) t); | |
5239 | ||
5240 | finish: | |
5241 | buf[l-1] = 0; | |
5242 | return buf; | |
5243 | ||
5244 | } | |
5245 | ||
5246 | void* memdup(const void *p, size_t l) { | |
5247 | void *r; | |
5248 | ||
5249 | assert(p); | |
5250 | ||
5251 | r = malloc(l); | |
5252 | if (!r) | |
5253 | return NULL; | |
5254 | ||
5255 | memcpy(r, p, l); | |
5256 | return r; | |
5257 | } | |
5258 | ||
5259 | int fd_inc_sndbuf(int fd, size_t n) { | |
5260 | int r, value; | |
5261 | socklen_t l = sizeof(value); | |
5262 | ||
5263 | r = getsockopt(fd, SOL_SOCKET, SO_SNDBUF, &value, &l); | |
60f067b4 | 5264 | if (r >= 0 && l == sizeof(value) && (size_t) value >= n*2) |
663996b3 MS |
5265 | return 0; |
5266 | ||
60f067b4 JS |
5267 | /* If we have the privileges we will ignore the kernel limit. */ |
5268 | ||
663996b3 | 5269 | value = (int) n; |
60f067b4 JS |
5270 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUFFORCE, &value, sizeof(value)) < 0) |
5271 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &value, sizeof(value)) < 0) | |
5272 | return -errno; | |
663996b3 MS |
5273 | |
5274 | return 1; | |
5275 | } | |
5276 | ||
5277 | int fd_inc_rcvbuf(int fd, size_t n) { | |
5278 | int r, value; | |
5279 | socklen_t l = sizeof(value); | |
5280 | ||
5281 | r = getsockopt(fd, SOL_SOCKET, SO_RCVBUF, &value, &l); | |
60f067b4 | 5282 | if (r >= 0 && l == sizeof(value) && (size_t) value >= n*2) |
663996b3 MS |
5283 | return 0; |
5284 | ||
60f067b4 | 5285 | /* If we have the privileges we will ignore the kernel limit. */ |
663996b3 | 5286 | |
60f067b4 JS |
5287 | value = (int) n; |
5288 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUFFORCE, &value, sizeof(value)) < 0) | |
5289 | if (setsockopt(fd, SOL_SOCKET, SO_RCVBUF, &value, sizeof(value)) < 0) | |
5290 | return -errno; | |
663996b3 MS |
5291 | return 1; |
5292 | } | |
5293 | ||
5294 | int fork_agent(pid_t *pid, const int except[], unsigned n_except, const char *path, ...) { | |
663996b3 | 5295 | bool stdout_is_tty, stderr_is_tty; |
5eef597e MP |
5296 | pid_t parent_pid, agent_pid; |
5297 | sigset_t ss, saved_ss; | |
663996b3 MS |
5298 | unsigned n, i; |
5299 | va_list ap; | |
5300 | char **l; | |
5301 | ||
5302 | assert(pid); | |
5303 | assert(path); | |
5304 | ||
663996b3 MS |
5305 | /* Spawns a temporary TTY agent, making sure it goes away when |
5306 | * we go away */ | |
5307 | ||
5eef597e MP |
5308 | parent_pid = getpid(); |
5309 | ||
5310 | /* First we temporarily block all signals, so that the new | |
5311 | * child has them blocked initially. This way, we can be sure | |
5312 | * that SIGTERMs are not lost we might send to the agent. */ | |
5313 | assert_se(sigfillset(&ss) >= 0); | |
5314 | assert_se(sigprocmask(SIG_SETMASK, &ss, &saved_ss) >= 0); | |
5315 | ||
663996b3 | 5316 | agent_pid = fork(); |
5eef597e MP |
5317 | if (agent_pid < 0) { |
5318 | assert_se(sigprocmask(SIG_SETMASK, &saved_ss, NULL) >= 0); | |
663996b3 | 5319 | return -errno; |
5eef597e | 5320 | } |
663996b3 MS |
5321 | |
5322 | if (agent_pid != 0) { | |
5eef597e | 5323 | assert_se(sigprocmask(SIG_SETMASK, &saved_ss, NULL) >= 0); |
663996b3 MS |
5324 | *pid = agent_pid; |
5325 | return 0; | |
5326 | } | |
5327 | ||
5328 | /* In the child: | |
5329 | * | |
5330 | * Make sure the agent goes away when the parent dies */ | |
5331 | if (prctl(PR_SET_PDEATHSIG, SIGTERM) < 0) | |
5332 | _exit(EXIT_FAILURE); | |
5333 | ||
5eef597e MP |
5334 | /* Make sure we actually can kill the agent, if we need to, in |
5335 | * case somebody invoked us from a shell script that trapped | |
5336 | * SIGTERM or so... */ | |
5337 | reset_all_signal_handlers(); | |
5338 | reset_signal_mask(); | |
5339 | ||
663996b3 | 5340 | /* Check whether our parent died before we were able |
5eef597e | 5341 | * to set the death signal and unblock the signals */ |
663996b3 MS |
5342 | if (getppid() != parent_pid) |
5343 | _exit(EXIT_SUCCESS); | |
5344 | ||
5345 | /* Don't leak fds to the agent */ | |
5346 | close_all_fds(except, n_except); | |
5347 | ||
5348 | stdout_is_tty = isatty(STDOUT_FILENO); | |
5349 | stderr_is_tty = isatty(STDERR_FILENO); | |
5350 | ||
5351 | if (!stdout_is_tty || !stderr_is_tty) { | |
5eef597e MP |
5352 | int fd; |
5353 | ||
663996b3 MS |
5354 | /* Detach from stdout/stderr. and reopen |
5355 | * /dev/tty for them. This is important to | |
5356 | * ensure that when systemctl is started via | |
5357 | * popen() or a similar call that expects to | |
5358 | * read EOF we actually do generate EOF and | |
5359 | * not delay this indefinitely by because we | |
5360 | * keep an unused copy of stdin around. */ | |
5361 | fd = open("/dev/tty", O_WRONLY); | |
5362 | if (fd < 0) { | |
f47781d8 | 5363 | log_error_errno(errno, "Failed to open /dev/tty: %m"); |
663996b3 MS |
5364 | _exit(EXIT_FAILURE); |
5365 | } | |
5366 | ||
5367 | if (!stdout_is_tty) | |
5368 | dup2(fd, STDOUT_FILENO); | |
5369 | ||
5370 | if (!stderr_is_tty) | |
5371 | dup2(fd, STDERR_FILENO); | |
5372 | ||
5373 | if (fd > 2) | |
5374 | close(fd); | |
5375 | } | |
5376 | ||
5377 | /* Count arguments */ | |
5378 | va_start(ap, path); | |
5379 | for (n = 0; va_arg(ap, char*); n++) | |
5380 | ; | |
5381 | va_end(ap); | |
5382 | ||
5383 | /* Allocate strv */ | |
5384 | l = alloca(sizeof(char *) * (n + 1)); | |
5385 | ||
5386 | /* Fill in arguments */ | |
5387 | va_start(ap, path); | |
5388 | for (i = 0; i <= n; i++) | |
5389 | l[i] = va_arg(ap, char*); | |
5390 | va_end(ap); | |
5391 | ||
5392 | execv(path, l); | |
5393 | _exit(EXIT_FAILURE); | |
5394 | } | |
5395 | ||
5396 | int setrlimit_closest(int resource, const struct rlimit *rlim) { | |
5397 | struct rlimit highest, fixed; | |
5398 | ||
5399 | assert(rlim); | |
5400 | ||
5401 | if (setrlimit(resource, rlim) >= 0) | |
5402 | return 0; | |
5403 | ||
5404 | if (errno != EPERM) | |
5405 | return -errno; | |
5406 | ||
5407 | /* So we failed to set the desired setrlimit, then let's try | |
5408 | * to get as close as we can */ | |
5409 | assert_se(getrlimit(resource, &highest) == 0); | |
5410 | ||
5411 | fixed.rlim_cur = MIN(rlim->rlim_cur, highest.rlim_max); | |
5412 | fixed.rlim_max = MIN(rlim->rlim_max, highest.rlim_max); | |
5413 | ||
5414 | if (setrlimit(resource, &fixed) < 0) | |
5415 | return -errno; | |
5416 | ||
5417 | return 0; | |
5418 | } | |
5419 | ||
5420 | int getenv_for_pid(pid_t pid, const char *field, char **_value) { | |
5421 | _cleanup_fclose_ FILE *f = NULL; | |
5422 | char *value = NULL; | |
5423 | int r; | |
5424 | bool done = false; | |
5425 | size_t l; | |
5426 | const char *path; | |
5427 | ||
5428 | assert(pid >= 0); | |
5429 | assert(field); | |
5430 | assert(_value); | |
5431 | ||
60f067b4 | 5432 | path = procfs_file_alloca(pid, "environ"); |
663996b3 MS |
5433 | |
5434 | f = fopen(path, "re"); | |
5435 | if (!f) | |
5436 | return -errno; | |
5437 | ||
5438 | l = strlen(field); | |
5439 | r = 0; | |
5440 | ||
5441 | do { | |
5442 | char line[LINE_MAX]; | |
5443 | unsigned i; | |
5444 | ||
5445 | for (i = 0; i < sizeof(line)-1; i++) { | |
5446 | int c; | |
5447 | ||
5448 | c = getc(f); | |
5449 | if (_unlikely_(c == EOF)) { | |
5450 | done = true; | |
5451 | break; | |
5452 | } else if (c == 0) | |
5453 | break; | |
5454 | ||
5455 | line[i] = c; | |
5456 | } | |
5457 | line[i] = 0; | |
5458 | ||
5459 | if (memcmp(line, field, l) == 0 && line[l] == '=') { | |
5460 | value = strdup(line + l + 1); | |
5461 | if (!value) | |
5462 | return -ENOMEM; | |
5463 | ||
5464 | r = 1; | |
5465 | break; | |
5466 | } | |
5467 | ||
5468 | } while (!done); | |
5469 | ||
5470 | *_value = value; | |
5471 | return r; | |
5472 | } | |
5473 | ||
e735f4d4 MP |
5474 | bool http_etag_is_valid(const char *etag) { |
5475 | if (isempty(etag)) | |
5476 | return false; | |
663996b3 | 5477 | |
e735f4d4 MP |
5478 | if (!endswith(etag, "\"")) |
5479 | return false; | |
663996b3 | 5480 | |
e735f4d4 MP |
5481 | if (!startswith(etag, "\"") && !startswith(etag, "W/\"")) |
5482 | return false; | |
663996b3 | 5483 | |
e735f4d4 MP |
5484 | return true; |
5485 | } | |
663996b3 | 5486 | |
e735f4d4 MP |
5487 | bool http_url_is_valid(const char *url) { |
5488 | const char *p; | |
5489 | ||
5490 | if (isempty(url)) | |
5491 | return false; | |
5492 | ||
5493 | p = startswith(url, "http://"); | |
5494 | if (!p) | |
5495 | p = startswith(url, "https://"); | |
5496 | if (!p) | |
5497 | return false; | |
5498 | ||
5499 | if (isempty(p)) | |
5500 | return false; | |
5501 | ||
5502 | return ascii_is_valid(p); | |
5503 | } | |
663996b3 | 5504 | |
e735f4d4 MP |
5505 | bool documentation_url_is_valid(const char *url) { |
5506 | const char *p; | |
5507 | ||
5508 | if (isempty(url)) | |
5509 | return false; | |
5510 | ||
5511 | if (http_url_is_valid(url)) | |
663996b3 MS |
5512 | return true; |
5513 | ||
e735f4d4 MP |
5514 | p = startswith(url, "file:/"); |
5515 | if (!p) | |
5516 | p = startswith(url, "info:"); | |
5517 | if (!p) | |
5518 | p = startswith(url, "man:"); | |
5519 | ||
5520 | if (isempty(p)) | |
5521 | return false; | |
5522 | ||
5523 | return ascii_is_valid(p); | |
663996b3 MS |
5524 | } |
5525 | ||
5526 | bool in_initrd(void) { | |
60f067b4 | 5527 | static int saved = -1; |
663996b3 MS |
5528 | struct statfs s; |
5529 | ||
5530 | if (saved >= 0) | |
5531 | return saved; | |
5532 | ||
5533 | /* We make two checks here: | |
5534 | * | |
5535 | * 1. the flag file /etc/initrd-release must exist | |
5536 | * 2. the root file system must be a memory file system | |
5537 | * | |
5538 | * The second check is extra paranoia, since misdetecting an | |
5539 | * initrd can have bad bad consequences due the initrd | |
5540 | * emptying when transititioning to the main systemd. | |
5541 | */ | |
5542 | ||
5543 | saved = access("/etc/initrd-release", F_OK) >= 0 && | |
5544 | statfs("/", &s) >= 0 && | |
5545 | is_temporary_fs(&s); | |
5546 | ||
5547 | return saved; | |
5548 | } | |
5549 | ||
5550 | void warn_melody(void) { | |
5551 | _cleanup_close_ int fd = -1; | |
5552 | ||
5553 | fd = open("/dev/console", O_WRONLY|O_CLOEXEC|O_NOCTTY); | |
5554 | if (fd < 0) | |
5555 | return; | |
5556 | ||
5557 | /* Yeah, this is synchronous. Kinda sucks. But well... */ | |
5558 | ||
5559 | ioctl(fd, KIOCSOUND, (int)(1193180/440)); | |
5560 | usleep(125*USEC_PER_MSEC); | |
5561 | ||
5562 | ioctl(fd, KIOCSOUND, (int)(1193180/220)); | |
5563 | usleep(125*USEC_PER_MSEC); | |
5564 | ||
5565 | ioctl(fd, KIOCSOUND, (int)(1193180/220)); | |
5566 | usleep(125*USEC_PER_MSEC); | |
5567 | ||
5568 | ioctl(fd, KIOCSOUND, 0); | |
5569 | } | |
5570 | ||
5571 | int make_console_stdio(void) { | |
5572 | int fd, r; | |
5573 | ||
5574 | /* Make /dev/console the controlling terminal and stdin/stdout/stderr */ | |
5575 | ||
5eef597e | 5576 | fd = acquire_terminal("/dev/console", false, true, true, USEC_INFINITY); |
f47781d8 MP |
5577 | if (fd < 0) |
5578 | return log_error_errno(fd, "Failed to acquire terminal: %m"); | |
663996b3 MS |
5579 | |
5580 | r = make_stdio(fd); | |
f47781d8 MP |
5581 | if (r < 0) |
5582 | return log_error_errno(r, "Failed to duplicate terminal fd: %m"); | |
663996b3 MS |
5583 | |
5584 | return 0; | |
5585 | } | |
5586 | ||
5587 | int get_home_dir(char **_h) { | |
60f067b4 | 5588 | struct passwd *p; |
663996b3 | 5589 | const char *e; |
60f067b4 | 5590 | char *h; |
663996b3 | 5591 | uid_t u; |
663996b3 MS |
5592 | |
5593 | assert(_h); | |
5594 | ||
5595 | /* Take the user specified one */ | |
e842803a MB |
5596 | e = secure_getenv("HOME"); |
5597 | if (e && path_is_absolute(e)) { | |
663996b3 MS |
5598 | h = strdup(e); |
5599 | if (!h) | |
5600 | return -ENOMEM; | |
5601 | ||
5602 | *_h = h; | |
5603 | return 0; | |
5604 | } | |
5605 | ||
5606 | /* Hardcode home directory for root to avoid NSS */ | |
5607 | u = getuid(); | |
5608 | if (u == 0) { | |
5609 | h = strdup("/root"); | |
5610 | if (!h) | |
5611 | return -ENOMEM; | |
5612 | ||
5613 | *_h = h; | |
5614 | return 0; | |
5615 | } | |
5616 | ||
5617 | /* Check the database... */ | |
5618 | errno = 0; | |
5619 | p = getpwuid(u); | |
5620 | if (!p) | |
5621 | return errno > 0 ? -errno : -ESRCH; | |
5622 | ||
5623 | if (!path_is_absolute(p->pw_dir)) | |
5624 | return -EINVAL; | |
5625 | ||
5626 | h = strdup(p->pw_dir); | |
5627 | if (!h) | |
5628 | return -ENOMEM; | |
5629 | ||
5630 | *_h = h; | |
5631 | return 0; | |
5632 | } | |
5633 | ||
60f067b4 JS |
5634 | int get_shell(char **_s) { |
5635 | struct passwd *p; | |
5636 | const char *e; | |
5637 | char *s; | |
5638 | uid_t u; | |
5639 | ||
5640 | assert(_s); | |
5641 | ||
5642 | /* Take the user specified one */ | |
5643 | e = getenv("SHELL"); | |
5644 | if (e) { | |
5645 | s = strdup(e); | |
5646 | if (!s) | |
5647 | return -ENOMEM; | |
5648 | ||
5649 | *_s = s; | |
5650 | return 0; | |
5651 | } | |
5652 | ||
5653 | /* Hardcode home directory for root to avoid NSS */ | |
5654 | u = getuid(); | |
5655 | if (u == 0) { | |
5656 | s = strdup("/bin/sh"); | |
5657 | if (!s) | |
5658 | return -ENOMEM; | |
5659 | ||
5660 | *_s = s; | |
5661 | return 0; | |
5662 | } | |
5663 | ||
5664 | /* Check the database... */ | |
5665 | errno = 0; | |
5666 | p = getpwuid(u); | |
5667 | if (!p) | |
5668 | return errno > 0 ? -errno : -ESRCH; | |
5669 | ||
5670 | if (!path_is_absolute(p->pw_shell)) | |
5671 | return -EINVAL; | |
5672 | ||
5673 | s = strdup(p->pw_shell); | |
5674 | if (!s) | |
5675 | return -ENOMEM; | |
5676 | ||
5677 | *_s = s; | |
5678 | return 0; | |
5679 | } | |
5680 | ||
e735f4d4 | 5681 | bool filename_is_valid(const char *p) { |
663996b3 MS |
5682 | |
5683 | if (isempty(p)) | |
5684 | return false; | |
5685 | ||
5686 | if (strchr(p, '/')) | |
5687 | return false; | |
5688 | ||
5689 | if (streq(p, ".")) | |
5690 | return false; | |
5691 | ||
5692 | if (streq(p, "..")) | |
5693 | return false; | |
5694 | ||
5695 | if (strlen(p) > FILENAME_MAX) | |
5696 | return false; | |
5697 | ||
5698 | return true; | |
5699 | } | |
5700 | ||
5701 | bool string_is_safe(const char *p) { | |
5702 | const char *t; | |
5703 | ||
5eef597e MP |
5704 | if (!p) |
5705 | return false; | |
663996b3 MS |
5706 | |
5707 | for (t = p; *t; t++) { | |
5708 | if (*t > 0 && *t < ' ') | |
5709 | return false; | |
5710 | ||
5eef597e | 5711 | if (strchr("\\\"\'\0x7f", *t)) |
663996b3 MS |
5712 | return false; |
5713 | } | |
5714 | ||
5715 | return true; | |
5716 | } | |
5717 | ||
14228c0d | 5718 | /** |
5eef597e MP |
5719 | * Check if a string contains control characters. If 'ok' is non-NULL |
5720 | * it may be a string containing additional CCs to be considered OK. | |
14228c0d | 5721 | */ |
5eef597e | 5722 | bool string_has_cc(const char *p, const char *ok) { |
663996b3 MS |
5723 | const char *t; |
5724 | ||
5725 | assert(p); | |
5726 | ||
5eef597e MP |
5727 | for (t = p; *t; t++) { |
5728 | if (ok && strchr(ok, *t)) | |
5729 | continue; | |
5730 | ||
5731 | if (*t > 0 && *t < ' ') | |
663996b3 MS |
5732 | return true; |
5733 | ||
5eef597e MP |
5734 | if (*t == 127) |
5735 | return true; | |
5736 | } | |
5737 | ||
663996b3 MS |
5738 | return false; |
5739 | } | |
5740 | ||
5741 | bool path_is_safe(const char *p) { | |
5742 | ||
5743 | if (isempty(p)) | |
5744 | return false; | |
5745 | ||
5746 | if (streq(p, "..") || startswith(p, "../") || endswith(p, "/..") || strstr(p, "/../")) | |
5747 | return false; | |
5748 | ||
5749 | if (strlen(p) > PATH_MAX) | |
5750 | return false; | |
5751 | ||
5752 | /* The following two checks are not really dangerous, but hey, they still are confusing */ | |
5753 | if (streq(p, ".") || startswith(p, "./") || endswith(p, "/.") || strstr(p, "/./")) | |
5754 | return false; | |
5755 | ||
5756 | if (strstr(p, "//")) | |
5757 | return false; | |
5758 | ||
5759 | return true; | |
5760 | } | |
5761 | ||
5762 | /* hey glibc, APIs with callbacks without a user pointer are so useless */ | |
5763 | void *xbsearch_r(const void *key, const void *base, size_t nmemb, size_t size, | |
5764 | int (*compar) (const void *, const void *, void *), void *arg) { | |
5765 | size_t l, u, idx; | |
5766 | const void *p; | |
5767 | int comparison; | |
5768 | ||
5769 | l = 0; | |
5770 | u = nmemb; | |
5771 | while (l < u) { | |
5772 | idx = (l + u) / 2; | |
5773 | p = (void *)(((const char *) base) + (idx * size)); | |
5774 | comparison = compar(key, p, arg); | |
5775 | if (comparison < 0) | |
5776 | u = idx; | |
5777 | else if (comparison > 0) | |
5778 | l = idx + 1; | |
5779 | else | |
5780 | return (void *)p; | |
5781 | } | |
5782 | return NULL; | |
5783 | } | |
5784 | ||
5785 | bool is_locale_utf8(void) { | |
5786 | const char *set; | |
5787 | static int cached_answer = -1; | |
5788 | ||
5789 | if (cached_answer >= 0) | |
5790 | goto out; | |
5791 | ||
5792 | if (!setlocale(LC_ALL, "")) { | |
5793 | cached_answer = true; | |
5794 | goto out; | |
5795 | } | |
5796 | ||
5797 | set = nl_langinfo(CODESET); | |
5798 | if (!set) { | |
5799 | cached_answer = true; | |
5800 | goto out; | |
5801 | } | |
5802 | ||
60f067b4 | 5803 | if (streq(set, "UTF-8")) { |
663996b3 MS |
5804 | cached_answer = true; |
5805 | goto out; | |
5806 | } | |
5807 | ||
14228c0d MB |
5808 | /* For LC_CTYPE=="C" return true, because CTYPE is effectly |
5809 | * unset and everything can do to UTF-8 nowadays. */ | |
663996b3 MS |
5810 | set = setlocale(LC_CTYPE, NULL); |
5811 | if (!set) { | |
5812 | cached_answer = true; | |
5813 | goto out; | |
5814 | } | |
5815 | ||
14228c0d MB |
5816 | /* Check result, but ignore the result if C was set |
5817 | * explicitly. */ | |
5818 | cached_answer = | |
5819 | streq(set, "C") && | |
5820 | !getenv("LC_ALL") && | |
5821 | !getenv("LC_CTYPE") && | |
5822 | !getenv("LANG"); | |
663996b3 MS |
5823 | |
5824 | out: | |
14228c0d | 5825 | return (bool) cached_answer; |
663996b3 MS |
5826 | } |
5827 | ||
5828 | const char *draw_special_char(DrawSpecialChar ch) { | |
5829 | static const char *draw_table[2][_DRAW_SPECIAL_CHAR_MAX] = { | |
60f067b4 | 5830 | |
663996b3 | 5831 | /* UTF-8 */ { |
60f067b4 | 5832 | [DRAW_TREE_VERTICAL] = "\342\224\202 ", /* │ */ |
663996b3 MS |
5833 | [DRAW_TREE_BRANCH] = "\342\224\234\342\224\200", /* ├─ */ |
5834 | [DRAW_TREE_RIGHT] = "\342\224\224\342\224\200", /* └─ */ | |
5835 | [DRAW_TREE_SPACE] = " ", /* */ | |
60f067b4 JS |
5836 | [DRAW_TRIANGULAR_BULLET] = "\342\200\243", /* ‣ */ |
5837 | [DRAW_BLACK_CIRCLE] = "\342\227\217", /* ● */ | |
5838 | [DRAW_ARROW] = "\342\206\222", /* → */ | |
5839 | [DRAW_DASH] = "\342\200\223", /* – */ | |
663996b3 | 5840 | }, |
60f067b4 | 5841 | |
663996b3 | 5842 | /* ASCII fallback */ { |
60f067b4 | 5843 | [DRAW_TREE_VERTICAL] = "| ", |
663996b3 MS |
5844 | [DRAW_TREE_BRANCH] = "|-", |
5845 | [DRAW_TREE_RIGHT] = "`-", | |
5846 | [DRAW_TREE_SPACE] = " ", | |
60f067b4 JS |
5847 | [DRAW_TRIANGULAR_BULLET] = ">", |
5848 | [DRAW_BLACK_CIRCLE] = "*", | |
5849 | [DRAW_ARROW] = "->", | |
5850 | [DRAW_DASH] = "-", | |
663996b3 MS |
5851 | } |
5852 | }; | |
5853 | ||
5854 | return draw_table[!is_locale_utf8()][ch]; | |
5855 | } | |
5856 | ||
5857 | char *strreplace(const char *text, const char *old_string, const char *new_string) { | |
5858 | const char *f; | |
5859 | char *t, *r; | |
5860 | size_t l, old_len, new_len; | |
5861 | ||
5862 | assert(text); | |
5863 | assert(old_string); | |
5864 | assert(new_string); | |
5865 | ||
5866 | old_len = strlen(old_string); | |
5867 | new_len = strlen(new_string); | |
5868 | ||
5869 | l = strlen(text); | |
5870 | r = new(char, l+1); | |
5871 | if (!r) | |
5872 | return NULL; | |
5873 | ||
5874 | f = text; | |
5875 | t = r; | |
5876 | while (*f) { | |
5877 | char *a; | |
5878 | size_t d, nl; | |
5879 | ||
5880 | if (!startswith(f, old_string)) { | |
5881 | *(t++) = *(f++); | |
5882 | continue; | |
5883 | } | |
5884 | ||
5885 | d = t - r; | |
5886 | nl = l - old_len + new_len; | |
5887 | a = realloc(r, nl + 1); | |
5888 | if (!a) | |
5889 | goto oom; | |
5890 | ||
5891 | l = nl; | |
5892 | r = a; | |
5893 | t = r + d; | |
5894 | ||
5895 | t = stpcpy(t, new_string); | |
5896 | f += old_len; | |
5897 | } | |
5898 | ||
5899 | *t = 0; | |
5900 | return r; | |
5901 | ||
5902 | oom: | |
5903 | free(r); | |
5904 | return NULL; | |
5905 | } | |
5906 | ||
5907 | char *strip_tab_ansi(char **ibuf, size_t *_isz) { | |
5908 | const char *i, *begin = NULL; | |
5909 | enum { | |
5910 | STATE_OTHER, | |
5911 | STATE_ESCAPE, | |
5912 | STATE_BRACKET | |
5913 | } state = STATE_OTHER; | |
5914 | char *obuf = NULL; | |
5915 | size_t osz = 0, isz; | |
5916 | FILE *f; | |
5917 | ||
5918 | assert(ibuf); | |
5919 | assert(*ibuf); | |
5920 | ||
5921 | /* Strips ANSI color and replaces TABs by 8 spaces */ | |
5922 | ||
5923 | isz = _isz ? *_isz : strlen(*ibuf); | |
5924 | ||
5925 | f = open_memstream(&obuf, &osz); | |
5926 | if (!f) | |
5927 | return NULL; | |
5928 | ||
5929 | for (i = *ibuf; i < *ibuf + isz + 1; i++) { | |
5930 | ||
5931 | switch (state) { | |
5932 | ||
5933 | case STATE_OTHER: | |
5934 | if (i >= *ibuf + isz) /* EOT */ | |
5935 | break; | |
5936 | else if (*i == '\x1B') | |
5937 | state = STATE_ESCAPE; | |
5938 | else if (*i == '\t') | |
5939 | fputs(" ", f); | |
5940 | else | |
5941 | fputc(*i, f); | |
5942 | break; | |
5943 | ||
5944 | case STATE_ESCAPE: | |
5945 | if (i >= *ibuf + isz) { /* EOT */ | |
5946 | fputc('\x1B', f); | |
5947 | break; | |
5948 | } else if (*i == '[') { | |
5949 | state = STATE_BRACKET; | |
5950 | begin = i + 1; | |
5951 | } else { | |
5952 | fputc('\x1B', f); | |
5953 | fputc(*i, f); | |
5954 | state = STATE_OTHER; | |
5955 | } | |
5956 | ||
5957 | break; | |
5958 | ||
5959 | case STATE_BRACKET: | |
5960 | ||
5961 | if (i >= *ibuf + isz || /* EOT */ | |
5962 | (!(*i >= '0' && *i <= '9') && *i != ';' && *i != 'm')) { | |
5963 | fputc('\x1B', f); | |
5964 | fputc('[', f); | |
5965 | state = STATE_OTHER; | |
5966 | i = begin-1; | |
5967 | } else if (*i == 'm') | |
5968 | state = STATE_OTHER; | |
5969 | break; | |
5970 | } | |
5971 | } | |
5972 | ||
5973 | if (ferror(f)) { | |
5974 | fclose(f); | |
5975 | free(obuf); | |
5976 | return NULL; | |
5977 | } | |
5978 | ||
5979 | fclose(f); | |
5980 | ||
5981 | free(*ibuf); | |
5982 | *ibuf = obuf; | |
5983 | ||
5984 | if (_isz) | |
5985 | *_isz = osz; | |
5986 | ||
5987 | return obuf; | |
5988 | } | |
5989 | ||
5990 | int on_ac_power(void) { | |
5991 | bool found_offline = false, found_online = false; | |
5992 | _cleanup_closedir_ DIR *d = NULL; | |
5993 | ||
5994 | d = opendir("/sys/class/power_supply"); | |
5995 | if (!d) | |
5996 | return -errno; | |
5997 | ||
5998 | for (;;) { | |
5999 | struct dirent *de; | |
663996b3 MS |
6000 | _cleanup_close_ int fd = -1, device = -1; |
6001 | char contents[6]; | |
6002 | ssize_t n; | |
663996b3 | 6003 | |
60f067b4 JS |
6004 | errno = 0; |
6005 | de = readdir(d); | |
6006 | if (!de && errno != 0) | |
6007 | return -errno; | |
663996b3 MS |
6008 | |
6009 | if (!de) | |
6010 | break; | |
6011 | ||
e735f4d4 | 6012 | if (hidden_file(de->d_name)) |
663996b3 MS |
6013 | continue; |
6014 | ||
6015 | device = openat(dirfd(d), de->d_name, O_DIRECTORY|O_RDONLY|O_CLOEXEC|O_NOCTTY); | |
6016 | if (device < 0) { | |
6017 | if (errno == ENOENT || errno == ENOTDIR) | |
6018 | continue; | |
6019 | ||
6020 | return -errno; | |
6021 | } | |
6022 | ||
6023 | fd = openat(device, "type", O_RDONLY|O_CLOEXEC|O_NOCTTY); | |
6024 | if (fd < 0) { | |
6025 | if (errno == ENOENT) | |
6026 | continue; | |
6027 | ||
6028 | return -errno; | |
6029 | } | |
6030 | ||
6031 | n = read(fd, contents, sizeof(contents)); | |
6032 | if (n < 0) | |
6033 | return -errno; | |
6034 | ||
6035 | if (n != 6 || memcmp(contents, "Mains\n", 6)) | |
6036 | continue; | |
6037 | ||
60f067b4 | 6038 | safe_close(fd); |
663996b3 MS |
6039 | fd = openat(device, "online", O_RDONLY|O_CLOEXEC|O_NOCTTY); |
6040 | if (fd < 0) { | |
6041 | if (errno == ENOENT) | |
6042 | continue; | |
6043 | ||
6044 | return -errno; | |
6045 | } | |
6046 | ||
6047 | n = read(fd, contents, sizeof(contents)); | |
6048 | if (n < 0) | |
6049 | return -errno; | |
6050 | ||
6051 | if (n != 2 || contents[1] != '\n') | |
6052 | return -EIO; | |
6053 | ||
6054 | if (contents[0] == '1') { | |
6055 | found_online = true; | |
6056 | break; | |
6057 | } else if (contents[0] == '0') | |
6058 | found_offline = true; | |
6059 | else | |
6060 | return -EIO; | |
6061 | } | |
6062 | ||
6063 | return found_online || !found_offline; | |
6064 | } | |
6065 | ||
60f067b4 | 6066 | static int search_and_fopen_internal(const char *path, const char *mode, const char *root, char **search, FILE **_f) { |
663996b3 MS |
6067 | char **i; |
6068 | ||
6069 | assert(path); | |
6070 | assert(mode); | |
6071 | assert(_f); | |
6072 | ||
e842803a | 6073 | if (!path_strv_resolve_uniq(search, root)) |
663996b3 MS |
6074 | return -ENOMEM; |
6075 | ||
6076 | STRV_FOREACH(i, search) { | |
6077 | _cleanup_free_ char *p = NULL; | |
6078 | FILE *f; | |
6079 | ||
e842803a MB |
6080 | if (root) |
6081 | p = strjoin(root, *i, "/", path, NULL); | |
6082 | else | |
6083 | p = strjoin(*i, "/", path, NULL); | |
663996b3 MS |
6084 | if (!p) |
6085 | return -ENOMEM; | |
6086 | ||
6087 | f = fopen(p, mode); | |
6088 | if (f) { | |
6089 | *_f = f; | |
6090 | return 0; | |
6091 | } | |
6092 | ||
6093 | if (errno != ENOENT) | |
6094 | return -errno; | |
6095 | } | |
6096 | ||
6097 | return -ENOENT; | |
6098 | } | |
6099 | ||
60f067b4 | 6100 | int search_and_fopen(const char *path, const char *mode, const char *root, const char **search, FILE **_f) { |
663996b3 MS |
6101 | _cleanup_strv_free_ char **copy = NULL; |
6102 | ||
6103 | assert(path); | |
6104 | assert(mode); | |
6105 | assert(_f); | |
6106 | ||
6107 | if (path_is_absolute(path)) { | |
6108 | FILE *f; | |
6109 | ||
6110 | f = fopen(path, mode); | |
6111 | if (f) { | |
6112 | *_f = f; | |
6113 | return 0; | |
6114 | } | |
6115 | ||
6116 | return -errno; | |
6117 | } | |
6118 | ||
6119 | copy = strv_copy((char**) search); | |
6120 | if (!copy) | |
6121 | return -ENOMEM; | |
6122 | ||
60f067b4 | 6123 | return search_and_fopen_internal(path, mode, root, copy, _f); |
663996b3 MS |
6124 | } |
6125 | ||
60f067b4 | 6126 | int search_and_fopen_nulstr(const char *path, const char *mode, const char *root, const char *search, FILE **_f) { |
663996b3 MS |
6127 | _cleanup_strv_free_ char **s = NULL; |
6128 | ||
6129 | if (path_is_absolute(path)) { | |
6130 | FILE *f; | |
6131 | ||
6132 | f = fopen(path, mode); | |
6133 | if (f) { | |
6134 | *_f = f; | |
6135 | return 0; | |
6136 | } | |
6137 | ||
6138 | return -errno; | |
6139 | } | |
6140 | ||
6141 | s = strv_split_nulstr(search); | |
6142 | if (!s) | |
6143 | return -ENOMEM; | |
6144 | ||
60f067b4 | 6145 | return search_and_fopen_internal(path, mode, root, s, _f); |
663996b3 MS |
6146 | } |
6147 | ||
6148 | char *strextend(char **x, ...) { | |
6149 | va_list ap; | |
6150 | size_t f, l; | |
6151 | char *r, *p; | |
6152 | ||
6153 | assert(x); | |
6154 | ||
6155 | l = f = *x ? strlen(*x) : 0; | |
6156 | ||
6157 | va_start(ap, x); | |
6158 | for (;;) { | |
6159 | const char *t; | |
6160 | size_t n; | |
6161 | ||
6162 | t = va_arg(ap, const char *); | |
6163 | if (!t) | |
6164 | break; | |
6165 | ||
6166 | n = strlen(t); | |
6167 | if (n > ((size_t) -1) - l) { | |
6168 | va_end(ap); | |
6169 | return NULL; | |
6170 | } | |
6171 | ||
6172 | l += n; | |
6173 | } | |
6174 | va_end(ap); | |
6175 | ||
6176 | r = realloc(*x, l+1); | |
6177 | if (!r) | |
6178 | return NULL; | |
6179 | ||
6180 | p = r + f; | |
6181 | ||
6182 | va_start(ap, x); | |
6183 | for (;;) { | |
6184 | const char *t; | |
6185 | ||
6186 | t = va_arg(ap, const char *); | |
6187 | if (!t) | |
6188 | break; | |
6189 | ||
6190 | p = stpcpy(p, t); | |
6191 | } | |
6192 | va_end(ap); | |
6193 | ||
6194 | *p = 0; | |
6195 | *x = r; | |
6196 | ||
6197 | return r + l; | |
6198 | } | |
6199 | ||
6200 | char *strrep(const char *s, unsigned n) { | |
6201 | size_t l; | |
6202 | char *r, *p; | |
6203 | unsigned i; | |
6204 | ||
6205 | assert(s); | |
6206 | ||
6207 | l = strlen(s); | |
6208 | p = r = malloc(l * n + 1); | |
6209 | if (!r) | |
6210 | return NULL; | |
6211 | ||
6212 | for (i = 0; i < n; i++) | |
6213 | p = stpcpy(p, s); | |
6214 | ||
6215 | *p = 0; | |
6216 | return r; | |
6217 | } | |
6218 | ||
60f067b4 JS |
6219 | void* greedy_realloc(void **p, size_t *allocated, size_t need, size_t size) { |
6220 | size_t a, newalloc; | |
663996b3 MS |
6221 | void *q; |
6222 | ||
60f067b4 JS |
6223 | assert(p); |
6224 | assert(allocated); | |
6225 | ||
663996b3 MS |
6226 | if (*allocated >= need) |
6227 | return *p; | |
6228 | ||
60f067b4 JS |
6229 | newalloc = MAX(need * 2, 64u / size); |
6230 | a = newalloc * size; | |
6231 | ||
6232 | /* check for overflows */ | |
6233 | if (a < size * need) | |
6234 | return NULL; | |
6235 | ||
663996b3 MS |
6236 | q = realloc(*p, a); |
6237 | if (!q) | |
6238 | return NULL; | |
6239 | ||
6240 | *p = q; | |
60f067b4 JS |
6241 | *allocated = newalloc; |
6242 | return q; | |
6243 | } | |
6244 | ||
6245 | void* greedy_realloc0(void **p, size_t *allocated, size_t need, size_t size) { | |
6246 | size_t prev; | |
6247 | uint8_t *q; | |
6248 | ||
6249 | assert(p); | |
6250 | assert(allocated); | |
6251 | ||
6252 | prev = *allocated; | |
6253 | ||
6254 | q = greedy_realloc(p, allocated, need, size); | |
6255 | if (!q) | |
6256 | return NULL; | |
6257 | ||
6258 | if (*allocated > prev) | |
6259 | memzero(q + prev * size, (*allocated - prev) * size); | |
6260 | ||
663996b3 MS |
6261 | return q; |
6262 | } | |
6263 | ||
6264 | bool id128_is_valid(const char *s) { | |
6265 | size_t i, l; | |
6266 | ||
6267 | l = strlen(s); | |
6268 | if (l == 32) { | |
6269 | ||
6270 | /* Simple formatted 128bit hex string */ | |
6271 | ||
6272 | for (i = 0; i < l; i++) { | |
6273 | char c = s[i]; | |
6274 | ||
6275 | if (!(c >= '0' && c <= '9') && | |
6276 | !(c >= 'a' && c <= 'z') && | |
6277 | !(c >= 'A' && c <= 'Z')) | |
6278 | return false; | |
6279 | } | |
6280 | ||
6281 | } else if (l == 36) { | |
6282 | ||
6283 | /* Formatted UUID */ | |
6284 | ||
6285 | for (i = 0; i < l; i++) { | |
6286 | char c = s[i]; | |
6287 | ||
6288 | if ((i == 8 || i == 13 || i == 18 || i == 23)) { | |
6289 | if (c != '-') | |
6290 | return false; | |
6291 | } else { | |
6292 | if (!(c >= '0' && c <= '9') && | |
6293 | !(c >= 'a' && c <= 'z') && | |
6294 | !(c >= 'A' && c <= 'Z')) | |
6295 | return false; | |
6296 | } | |
6297 | } | |
6298 | ||
6299 | } else | |
6300 | return false; | |
6301 | ||
6302 | return true; | |
6303 | } | |
14228c0d | 6304 | |
14228c0d MB |
6305 | int split_pair(const char *s, const char *sep, char **l, char **r) { |
6306 | char *x, *a, *b; | |
6307 | ||
6308 | assert(s); | |
6309 | assert(sep); | |
6310 | assert(l); | |
6311 | assert(r); | |
6312 | ||
6313 | if (isempty(sep)) | |
6314 | return -EINVAL; | |
6315 | ||
6316 | x = strstr(s, sep); | |
6317 | if (!x) | |
6318 | return -EINVAL; | |
6319 | ||
6320 | a = strndup(s, x - s); | |
6321 | if (!a) | |
6322 | return -ENOMEM; | |
6323 | ||
6324 | b = strdup(x + strlen(sep)); | |
6325 | if (!b) { | |
6326 | free(a); | |
6327 | return -ENOMEM; | |
6328 | } | |
6329 | ||
6330 | *l = a; | |
6331 | *r = b; | |
6332 | ||
6333 | return 0; | |
6334 | } | |
60f067b4 JS |
6335 | |
6336 | int shall_restore_state(void) { | |
f47781d8 | 6337 | _cleanup_free_ char *value = NULL; |
60f067b4 JS |
6338 | int r; |
6339 | ||
f47781d8 | 6340 | r = get_proc_cmdline_key("systemd.restore_state=", &value); |
60f067b4 JS |
6341 | if (r < 0) |
6342 | return r; | |
f47781d8 MP |
6343 | if (r == 0) |
6344 | return true; | |
60f067b4 | 6345 | |
f47781d8 | 6346 | return parse_boolean(value) != 0; |
60f067b4 JS |
6347 | } |
6348 | ||
6349 | int proc_cmdline(char **ret) { | |
f47781d8 | 6350 | assert(ret); |
60f067b4 | 6351 | |
f47781d8 MP |
6352 | if (detect_container(NULL) > 0) |
6353 | return get_process_cmdline(1, 0, false, ret); | |
6354 | else | |
6355 | return read_one_line_file("/proc/cmdline", ret); | |
60f067b4 JS |
6356 | } |
6357 | ||
6358 | int parse_proc_cmdline(int (*parse_item)(const char *key, const char *value)) { | |
6359 | _cleanup_free_ char *line = NULL; | |
f47781d8 | 6360 | const char *p; |
60f067b4 JS |
6361 | int r; |
6362 | ||
6363 | assert(parse_item); | |
6364 | ||
6365 | r = proc_cmdline(&line); | |
6366 | if (r < 0) | |
f47781d8 | 6367 | return r; |
60f067b4 | 6368 | |
f47781d8 MP |
6369 | p = line; |
6370 | for (;;) { | |
6371 | _cleanup_free_ char *word = NULL; | |
6372 | char *value = NULL; | |
60f067b4 | 6373 | |
f47781d8 MP |
6374 | r = unquote_first_word(&p, &word, true); |
6375 | if (r < 0) | |
6376 | return r; | |
6377 | if (r == 0) | |
6378 | break; | |
60f067b4 JS |
6379 | |
6380 | /* Filter out arguments that are intended only for the | |
6381 | * initrd */ | |
6382 | if (!in_initrd() && startswith(word, "rd.")) | |
6383 | continue; | |
6384 | ||
6385 | value = strchr(word, '='); | |
6386 | if (value) | |
6387 | *(value++) = 0; | |
6388 | ||
6389 | r = parse_item(word, value); | |
6390 | if (r < 0) | |
6391 | return r; | |
6392 | } | |
6393 | ||
6394 | return 0; | |
6395 | } | |
6396 | ||
f47781d8 MP |
6397 | int get_proc_cmdline_key(const char *key, char **value) { |
6398 | _cleanup_free_ char *line = NULL, *ret = NULL; | |
6399 | bool found = false; | |
6400 | const char *p; | |
6401 | int r; | |
6402 | ||
6403 | assert(key); | |
6404 | ||
6405 | r = proc_cmdline(&line); | |
6406 | if (r < 0) | |
6407 | return r; | |
6408 | ||
6409 | p = line; | |
6410 | for (;;) { | |
6411 | _cleanup_free_ char *word = NULL; | |
6412 | const char *e; | |
6413 | ||
6414 | r = unquote_first_word(&p, &word, true); | |
6415 | if (r < 0) | |
6416 | return r; | |
6417 | if (r == 0) | |
6418 | break; | |
6419 | ||
6420 | /* Filter out arguments that are intended only for the | |
6421 | * initrd */ | |
6422 | if (!in_initrd() && startswith(word, "rd.")) | |
6423 | continue; | |
6424 | ||
6425 | if (value) { | |
6426 | e = startswith(word, key); | |
6427 | if (!e) | |
6428 | continue; | |
6429 | ||
6430 | r = free_and_strdup(&ret, e); | |
6431 | if (r < 0) | |
6432 | return r; | |
6433 | ||
6434 | found = true; | |
6435 | } else { | |
6436 | if (streq(word, key)) | |
6437 | found = true; | |
6438 | } | |
6439 | } | |
6440 | ||
6441 | if (value) { | |
6442 | *value = ret; | |
6443 | ret = NULL; | |
6444 | } | |
6445 | ||
6446 | return found; | |
6447 | ||
6448 | } | |
6449 | ||
60f067b4 JS |
6450 | int container_get_leader(const char *machine, pid_t *pid) { |
6451 | _cleanup_free_ char *s = NULL, *class = NULL; | |
6452 | const char *p; | |
6453 | pid_t leader; | |
6454 | int r; | |
6455 | ||
6456 | assert(machine); | |
6457 | assert(pid); | |
6458 | ||
e735f4d4 | 6459 | p = strjoina("/run/systemd/machines/", machine); |
60f067b4 JS |
6460 | r = parse_env_file(p, NEWLINE, "LEADER", &s, "CLASS", &class, NULL); |
6461 | if (r == -ENOENT) | |
6462 | return -EHOSTDOWN; | |
6463 | if (r < 0) | |
6464 | return r; | |
6465 | if (!s) | |
6466 | return -EIO; | |
6467 | ||
6468 | if (!streq_ptr(class, "container")) | |
6469 | return -EIO; | |
6470 | ||
6471 | r = parse_pid(s, &leader); | |
6472 | if (r < 0) | |
6473 | return r; | |
6474 | if (leader <= 1) | |
6475 | return -EIO; | |
6476 | ||
6477 | *pid = leader; | |
6478 | return 0; | |
6479 | } | |
6480 | ||
6481 | int namespace_open(pid_t pid, int *pidns_fd, int *mntns_fd, int *netns_fd, int *root_fd) { | |
6482 | _cleanup_close_ int pidnsfd = -1, mntnsfd = -1, netnsfd = -1; | |
6483 | int rfd = -1; | |
6484 | ||
6485 | assert(pid >= 0); | |
6486 | ||
6487 | if (mntns_fd) { | |
6488 | const char *mntns; | |
6489 | ||
6490 | mntns = procfs_file_alloca(pid, "ns/mnt"); | |
6491 | mntnsfd = open(mntns, O_RDONLY|O_NOCTTY|O_CLOEXEC); | |
6492 | if (mntnsfd < 0) | |
6493 | return -errno; | |
6494 | } | |
6495 | ||
6496 | if (pidns_fd) { | |
6497 | const char *pidns; | |
6498 | ||
6499 | pidns = procfs_file_alloca(pid, "ns/pid"); | |
6500 | pidnsfd = open(pidns, O_RDONLY|O_NOCTTY|O_CLOEXEC); | |
6501 | if (pidnsfd < 0) | |
6502 | return -errno; | |
6503 | } | |
6504 | ||
6505 | if (netns_fd) { | |
6506 | const char *netns; | |
6507 | ||
6508 | netns = procfs_file_alloca(pid, "ns/net"); | |
6509 | netnsfd = open(netns, O_RDONLY|O_NOCTTY|O_CLOEXEC); | |
6510 | if (netnsfd < 0) | |
6511 | return -errno; | |
6512 | } | |
6513 | ||
6514 | if (root_fd) { | |
6515 | const char *root; | |
6516 | ||
6517 | root = procfs_file_alloca(pid, "root"); | |
6518 | rfd = open(root, O_RDONLY|O_NOCTTY|O_CLOEXEC|O_DIRECTORY); | |
6519 | if (rfd < 0) | |
6520 | return -errno; | |
6521 | } | |
6522 | ||
6523 | if (pidns_fd) | |
6524 | *pidns_fd = pidnsfd; | |
6525 | ||
6526 | if (mntns_fd) | |
6527 | *mntns_fd = mntnsfd; | |
6528 | ||
6529 | if (netns_fd) | |
6530 | *netns_fd = netnsfd; | |
6531 | ||
6532 | if (root_fd) | |
6533 | *root_fd = rfd; | |
6534 | ||
6535 | pidnsfd = mntnsfd = netnsfd = -1; | |
6536 | ||
6537 | return 0; | |
6538 | } | |
6539 | ||
6540 | int namespace_enter(int pidns_fd, int mntns_fd, int netns_fd, int root_fd) { | |
6541 | ||
6542 | if (pidns_fd >= 0) | |
6543 | if (setns(pidns_fd, CLONE_NEWPID) < 0) | |
6544 | return -errno; | |
6545 | ||
6546 | if (mntns_fd >= 0) | |
6547 | if (setns(mntns_fd, CLONE_NEWNS) < 0) | |
6548 | return -errno; | |
6549 | ||
6550 | if (netns_fd >= 0) | |
6551 | if (setns(netns_fd, CLONE_NEWNET) < 0) | |
6552 | return -errno; | |
6553 | ||
6554 | if (root_fd >= 0) { | |
6555 | if (fchdir(root_fd) < 0) | |
6556 | return -errno; | |
6557 | ||
6558 | if (chroot(".") < 0) | |
6559 | return -errno; | |
6560 | } | |
6561 | ||
6562 | if (setresgid(0, 0, 0) < 0) | |
6563 | return -errno; | |
6564 | ||
6565 | if (setgroups(0, NULL) < 0) | |
6566 | return -errno; | |
6567 | ||
6568 | if (setresuid(0, 0, 0) < 0) | |
6569 | return -errno; | |
6570 | ||
6571 | return 0; | |
6572 | } | |
6573 | ||
6574 | bool pid_is_unwaited(pid_t pid) { | |
6575 | /* Checks whether a PID is still valid at all, including a zombie */ | |
6576 | ||
6577 | if (pid <= 0) | |
6578 | return false; | |
6579 | ||
6580 | if (kill(pid, 0) >= 0) | |
6581 | return true; | |
6582 | ||
6583 | return errno != ESRCH; | |
6584 | } | |
6585 | ||
6586 | bool pid_is_alive(pid_t pid) { | |
6587 | int r; | |
6588 | ||
6589 | /* Checks whether a PID is still valid and not a zombie */ | |
6590 | ||
6591 | if (pid <= 0) | |
6592 | return false; | |
6593 | ||
6594 | r = get_process_state(pid); | |
6595 | if (r == -ENOENT || r == 'Z') | |
6596 | return false; | |
6597 | ||
6598 | return true; | |
6599 | } | |
6600 | ||
6601 | int getpeercred(int fd, struct ucred *ucred) { | |
6602 | socklen_t n = sizeof(struct ucred); | |
6603 | struct ucred u; | |
6604 | int r; | |
6605 | ||
6606 | assert(fd >= 0); | |
6607 | assert(ucred); | |
6608 | ||
6609 | r = getsockopt(fd, SOL_SOCKET, SO_PEERCRED, &u, &n); | |
6610 | if (r < 0) | |
6611 | return -errno; | |
6612 | ||
6613 | if (n != sizeof(struct ucred)) | |
6614 | return -EIO; | |
6615 | ||
6616 | /* Check if the data is actually useful and not suppressed due | |
6617 | * to namespacing issues */ | |
6618 | if (u.pid <= 0) | |
6619 | return -ENODATA; | |
f47781d8 MP |
6620 | if (u.uid == UID_INVALID) |
6621 | return -ENODATA; | |
6622 | if (u.gid == GID_INVALID) | |
6623 | return -ENODATA; | |
60f067b4 JS |
6624 | |
6625 | *ucred = u; | |
6626 | return 0; | |
6627 | } | |
6628 | ||
6629 | int getpeersec(int fd, char **ret) { | |
6630 | socklen_t n = 64; | |
6631 | char *s; | |
6632 | int r; | |
6633 | ||
6634 | assert(fd >= 0); | |
6635 | assert(ret); | |
6636 | ||
6637 | s = new0(char, n); | |
6638 | if (!s) | |
6639 | return -ENOMEM; | |
6640 | ||
6641 | r = getsockopt(fd, SOL_SOCKET, SO_PEERSEC, s, &n); | |
6642 | if (r < 0) { | |
6643 | free(s); | |
6644 | ||
6645 | if (errno != ERANGE) | |
6646 | return -errno; | |
6647 | ||
6648 | s = new0(char, n); | |
6649 | if (!s) | |
6650 | return -ENOMEM; | |
6651 | ||
6652 | r = getsockopt(fd, SOL_SOCKET, SO_PEERSEC, s, &n); | |
6653 | if (r < 0) { | |
6654 | free(s); | |
6655 | return -errno; | |
6656 | } | |
6657 | } | |
6658 | ||
6659 | if (isempty(s)) { | |
6660 | free(s); | |
6661 | return -ENOTSUP; | |
6662 | } | |
6663 | ||
6664 | *ret = s; | |
6665 | return 0; | |
6666 | } | |
6667 | ||
6668 | /* This is much like like mkostemp() but is subject to umask(). */ | |
6669 | int mkostemp_safe(char *pattern, int flags) { | |
6670 | _cleanup_umask_ mode_t u; | |
6671 | int fd; | |
6672 | ||
6673 | assert(pattern); | |
6674 | ||
6675 | u = umask(077); | |
6676 | ||
6677 | fd = mkostemp(pattern, flags); | |
6678 | if (fd < 0) | |
6679 | return -errno; | |
6680 | ||
6681 | return fd; | |
6682 | } | |
6683 | ||
6684 | int open_tmpfile(const char *path, int flags) { | |
6685 | char *p; | |
6686 | int fd; | |
6687 | ||
6688 | assert(path); | |
6689 | ||
6690 | #ifdef O_TMPFILE | |
6691 | /* Try O_TMPFILE first, if it is supported */ | |
6692 | fd = open(path, flags|O_TMPFILE, S_IRUSR|S_IWUSR); | |
6693 | if (fd >= 0) | |
6694 | return fd; | |
6695 | #endif | |
6696 | ||
6697 | /* Fall back to unguessable name + unlinking */ | |
e735f4d4 | 6698 | p = strjoina(path, "/systemd-tmp-XXXXXX"); |
60f067b4 JS |
6699 | |
6700 | fd = mkostemp_safe(p, flags); | |
6701 | if (fd < 0) | |
6702 | return fd; | |
6703 | ||
6704 | unlink(p); | |
6705 | return fd; | |
6706 | } | |
6707 | ||
6708 | int fd_warn_permissions(const char *path, int fd) { | |
6709 | struct stat st; | |
6710 | ||
6711 | if (fstat(fd, &st) < 0) | |
6712 | return -errno; | |
6713 | ||
6714 | if (st.st_mode & 0111) | |
6715 | log_warning("Configuration file %s is marked executable. Please remove executable permission bits. Proceeding anyway.", path); | |
6716 | ||
6717 | if (st.st_mode & 0002) | |
6718 | log_warning("Configuration file %s is marked world-writable. Please remove world writability permission bits. Proceeding anyway.", path); | |
6719 | ||
6720 | if (getpid() == 1 && (st.st_mode & 0044) != 0044) | |
6721 | log_warning("Configuration file %s is marked world-inaccessible. This has no effect as configuration data is accessible via APIs without restrictions. Proceeding anyway.", path); | |
6722 | ||
6723 | return 0; | |
6724 | } | |
6725 | ||
6726 | unsigned long personality_from_string(const char *p) { | |
6727 | ||
6728 | /* Parse a personality specifier. We introduce our own | |
6729 | * identifiers that indicate specific ABIs, rather than just | |
6730 | * hints regarding the register size, since we want to keep | |
6731 | * things open for multiple locally supported ABIs for the | |
6732 | * same register size. We try to reuse the ABI identifiers | |
6733 | * used by libseccomp. */ | |
6734 | ||
6735 | #if defined(__x86_64__) | |
6736 | ||
6737 | if (streq(p, "x86")) | |
6738 | return PER_LINUX32; | |
6739 | ||
6740 | if (streq(p, "x86-64")) | |
6741 | return PER_LINUX; | |
6742 | ||
6743 | #elif defined(__i386__) | |
6744 | ||
6745 | if (streq(p, "x86")) | |
6746 | return PER_LINUX; | |
6747 | #endif | |
6748 | ||
6749 | /* personality(7) documents that 0xffffffffUL is used for | |
6750 | * querying the current personality, hence let's use that here | |
6751 | * as error indicator. */ | |
6752 | return 0xffffffffUL; | |
6753 | } | |
6754 | ||
6755 | const char* personality_to_string(unsigned long p) { | |
6756 | ||
6757 | #if defined(__x86_64__) | |
6758 | ||
6759 | if (p == PER_LINUX32) | |
6760 | return "x86"; | |
6761 | ||
6762 | if (p == PER_LINUX) | |
6763 | return "x86-64"; | |
6764 | ||
6765 | #elif defined(__i386__) | |
6766 | ||
6767 | if (p == PER_LINUX) | |
6768 | return "x86"; | |
6769 | #endif | |
6770 | ||
6771 | return NULL; | |
6772 | } | |
6773 | ||
6774 | uint64_t physical_memory(void) { | |
6775 | long mem; | |
6776 | ||
6777 | /* We return this as uint64_t in case we are running as 32bit | |
6778 | * process on a 64bit kernel with huge amounts of memory */ | |
6779 | ||
6780 | mem = sysconf(_SC_PHYS_PAGES); | |
6781 | assert(mem > 0); | |
6782 | ||
6783 | return (uint64_t) mem * (uint64_t) page_size(); | |
6784 | } | |
6785 | ||
60f067b4 JS |
6786 | void hexdump(FILE *f, const void *p, size_t s) { |
6787 | const uint8_t *b = p; | |
6788 | unsigned n = 0; | |
6789 | ||
6790 | assert(s == 0 || b); | |
6791 | ||
6792 | while (s > 0) { | |
6793 | size_t i; | |
6794 | ||
6795 | fprintf(f, "%04x ", n); | |
6796 | ||
6797 | for (i = 0; i < 16; i++) { | |
6798 | ||
6799 | if (i >= s) | |
6800 | fputs(" ", f); | |
6801 | else | |
6802 | fprintf(f, "%02x ", b[i]); | |
6803 | ||
6804 | if (i == 7) | |
6805 | fputc(' ', f); | |
6806 | } | |
6807 | ||
6808 | fputc(' ', f); | |
6809 | ||
6810 | for (i = 0; i < 16; i++) { | |
6811 | ||
6812 | if (i >= s) | |
6813 | fputc(' ', f); | |
6814 | else | |
6815 | fputc(isprint(b[i]) ? (char) b[i] : '.', f); | |
6816 | } | |
6817 | ||
6818 | fputc('\n', f); | |
6819 | ||
6820 | if (s < 16) | |
6821 | break; | |
6822 | ||
6823 | n += 16; | |
6824 | b += 16; | |
6825 | s -= 16; | |
6826 | } | |
6827 | } | |
6828 | ||
6829 | int update_reboot_param_file(const char *param) { | |
6830 | int r = 0; | |
6831 | ||
6832 | if (param) { | |
6833 | ||
6834 | r = write_string_file(REBOOT_PARAM_FILE, param); | |
6835 | if (r < 0) | |
6836 | log_error("Failed to write reboot param to " | |
6837 | REBOOT_PARAM_FILE": %s", strerror(-r)); | |
6838 | } else | |
6839 | unlink(REBOOT_PARAM_FILE); | |
6840 | ||
6841 | return r; | |
6842 | } | |
6843 | ||
6844 | int umount_recursive(const char *prefix, int flags) { | |
6845 | bool again; | |
6846 | int n = 0, r; | |
6847 | ||
6848 | /* Try to umount everything recursively below a | |
6849 | * directory. Also, take care of stacked mounts, and keep | |
6850 | * unmounting them until they are gone. */ | |
6851 | ||
6852 | do { | |
6853 | _cleanup_fclose_ FILE *proc_self_mountinfo = NULL; | |
6854 | ||
6855 | again = false; | |
6856 | r = 0; | |
6857 | ||
6858 | proc_self_mountinfo = fopen("/proc/self/mountinfo", "re"); | |
6859 | if (!proc_self_mountinfo) | |
6860 | return -errno; | |
6861 | ||
6862 | for (;;) { | |
6863 | _cleanup_free_ char *path = NULL, *p = NULL; | |
6864 | int k; | |
6865 | ||
6866 | k = fscanf(proc_self_mountinfo, | |
6867 | "%*s " /* (1) mount id */ | |
6868 | "%*s " /* (2) parent id */ | |
6869 | "%*s " /* (3) major:minor */ | |
6870 | "%*s " /* (4) root */ | |
6871 | "%ms " /* (5) mount point */ | |
6872 | "%*s" /* (6) mount options */ | |
6873 | "%*[^-]" /* (7) optional fields */ | |
6874 | "- " /* (8) separator */ | |
6875 | "%*s " /* (9) file system type */ | |
6876 | "%*s" /* (10) mount source */ | |
6877 | "%*s" /* (11) mount options 2 */ | |
6878 | "%*[^\n]", /* some rubbish at the end */ | |
6879 | &path); | |
6880 | if (k != 1) { | |
6881 | if (k == EOF) | |
6882 | break; | |
6883 | ||
6884 | continue; | |
6885 | } | |
6886 | ||
6887 | p = cunescape(path); | |
6888 | if (!p) | |
6889 | return -ENOMEM; | |
6890 | ||
6891 | if (!path_startswith(p, prefix)) | |
6892 | continue; | |
6893 | ||
6894 | if (umount2(p, flags) < 0) { | |
6895 | r = -errno; | |
6896 | continue; | |
6897 | } | |
6898 | ||
6899 | again = true; | |
6900 | n++; | |
6901 | ||
6902 | break; | |
6903 | } | |
6904 | ||
6905 | } while (again); | |
6906 | ||
6907 | return r ? r : n; | |
6908 | } | |
6909 | ||
e735f4d4 MP |
6910 | static int get_mount_flags(const char *path, unsigned long *flags) { |
6911 | struct statvfs buf; | |
6912 | ||
6913 | if (statvfs(path, &buf) < 0) | |
6914 | return -errno; | |
6915 | *flags = buf.f_flag; | |
6916 | return 0; | |
6917 | } | |
6918 | ||
60f067b4 JS |
6919 | int bind_remount_recursive(const char *prefix, bool ro) { |
6920 | _cleanup_set_free_free_ Set *done = NULL; | |
6921 | _cleanup_free_ char *cleaned = NULL; | |
6922 | int r; | |
6923 | ||
6924 | /* Recursively remount a directory (and all its submounts) | |
6925 | * read-only or read-write. If the directory is already | |
6926 | * mounted, we reuse the mount and simply mark it | |
6927 | * MS_BIND|MS_RDONLY (or remove the MS_RDONLY for read-write | |
6928 | * operation). If it isn't we first make it one. Afterwards we | |
6929 | * apply MS_BIND|MS_RDONLY (or remove MS_RDONLY) to all | |
6930 | * submounts we can access, too. When mounts are stacked on | |
6931 | * the same mount point we only care for each individual | |
6932 | * "top-level" mount on each point, as we cannot | |
6933 | * influence/access the underlying mounts anyway. We do not | |
6934 | * have any effect on future submounts that might get | |
6935 | * propagated, they migt be writable. This includes future | |
6936 | * submounts that have been triggered via autofs. */ | |
6937 | ||
6938 | cleaned = strdup(prefix); | |
6939 | if (!cleaned) | |
6940 | return -ENOMEM; | |
6941 | ||
6942 | path_kill_slashes(cleaned); | |
6943 | ||
5eef597e | 6944 | done = set_new(&string_hash_ops); |
60f067b4 JS |
6945 | if (!done) |
6946 | return -ENOMEM; | |
6947 | ||
6948 | for (;;) { | |
6949 | _cleanup_fclose_ FILE *proc_self_mountinfo = NULL; | |
6950 | _cleanup_set_free_free_ Set *todo = NULL; | |
6951 | bool top_autofs = false; | |
6952 | char *x; | |
e735f4d4 | 6953 | unsigned long orig_flags; |
60f067b4 | 6954 | |
5eef597e | 6955 | todo = set_new(&string_hash_ops); |
60f067b4 JS |
6956 | if (!todo) |
6957 | return -ENOMEM; | |
6958 | ||
6959 | proc_self_mountinfo = fopen("/proc/self/mountinfo", "re"); | |
6960 | if (!proc_self_mountinfo) | |
6961 | return -errno; | |
6962 | ||
6963 | for (;;) { | |
6964 | _cleanup_free_ char *path = NULL, *p = NULL, *type = NULL; | |
6965 | int k; | |
6966 | ||
6967 | k = fscanf(proc_self_mountinfo, | |
6968 | "%*s " /* (1) mount id */ | |
6969 | "%*s " /* (2) parent id */ | |
6970 | "%*s " /* (3) major:minor */ | |
6971 | "%*s " /* (4) root */ | |
6972 | "%ms " /* (5) mount point */ | |
6973 | "%*s" /* (6) mount options (superblock) */ | |
6974 | "%*[^-]" /* (7) optional fields */ | |
6975 | "- " /* (8) separator */ | |
6976 | "%ms " /* (9) file system type */ | |
6977 | "%*s" /* (10) mount source */ | |
6978 | "%*s" /* (11) mount options (bind mount) */ | |
6979 | "%*[^\n]", /* some rubbish at the end */ | |
6980 | &path, | |
6981 | &type); | |
6982 | if (k != 2) { | |
6983 | if (k == EOF) | |
6984 | break; | |
6985 | ||
6986 | continue; | |
6987 | } | |
6988 | ||
6989 | p = cunescape(path); | |
6990 | if (!p) | |
6991 | return -ENOMEM; | |
6992 | ||
6993 | /* Let's ignore autofs mounts. If they aren't | |
6994 | * triggered yet, we want to avoid triggering | |
6995 | * them, as we don't make any guarantees for | |
6996 | * future submounts anyway. If they are | |
6997 | * already triggered, then we will find | |
6998 | * another entry for this. */ | |
6999 | if (streq(type, "autofs")) { | |
7000 | top_autofs = top_autofs || path_equal(cleaned, p); | |
7001 | continue; | |
7002 | } | |
7003 | ||
7004 | if (path_startswith(p, cleaned) && | |
7005 | !set_contains(done, p)) { | |
7006 | ||
7007 | r = set_consume(todo, p); | |
7008 | p = NULL; | |
7009 | ||
7010 | if (r == -EEXIST) | |
7011 | continue; | |
7012 | if (r < 0) | |
7013 | return r; | |
7014 | } | |
7015 | } | |
7016 | ||
7017 | /* If we have no submounts to process anymore and if | |
7018 | * the root is either already done, or an autofs, we | |
7019 | * are done */ | |
7020 | if (set_isempty(todo) && | |
7021 | (top_autofs || set_contains(done, cleaned))) | |
7022 | return 0; | |
7023 | ||
7024 | if (!set_contains(done, cleaned) && | |
7025 | !set_contains(todo, cleaned)) { | |
7026 | /* The prefix directory itself is not yet a | |
7027 | * mount, make it one. */ | |
7028 | if (mount(cleaned, cleaned, NULL, MS_BIND|MS_REC, NULL) < 0) | |
7029 | return -errno; | |
7030 | ||
e735f4d4 MP |
7031 | orig_flags = 0; |
7032 | (void) get_mount_flags(cleaned, &orig_flags); | |
7033 | orig_flags &= ~MS_RDONLY; | |
7034 | ||
7035 | if (mount(NULL, prefix, NULL, orig_flags|MS_BIND|MS_REMOUNT|(ro ? MS_RDONLY : 0), NULL) < 0) | |
60f067b4 JS |
7036 | return -errno; |
7037 | ||
7038 | x = strdup(cleaned); | |
7039 | if (!x) | |
7040 | return -ENOMEM; | |
7041 | ||
7042 | r = set_consume(done, x); | |
7043 | if (r < 0) | |
7044 | return r; | |
7045 | } | |
7046 | ||
7047 | while ((x = set_steal_first(todo))) { | |
7048 | ||
7049 | r = set_consume(done, x); | |
7050 | if (r == -EEXIST) | |
7051 | continue; | |
7052 | if (r < 0) | |
7053 | return r; | |
7054 | ||
e735f4d4 MP |
7055 | /* Try to reuse the original flag set, but |
7056 | * don't care for errors, in case of | |
7057 | * obstructed mounts */ | |
7058 | orig_flags = 0; | |
7059 | (void) get_mount_flags(x, &orig_flags); | |
7060 | orig_flags &= ~MS_RDONLY; | |
7061 | ||
7062 | if (mount(NULL, x, NULL, orig_flags|MS_BIND|MS_REMOUNT|(ro ? MS_RDONLY : 0), NULL) < 0) { | |
60f067b4 JS |
7063 | |
7064 | /* Deal with mount points that are | |
7065 | * obstructed by a later mount */ | |
7066 | ||
7067 | if (errno != ENOENT) | |
7068 | return -errno; | |
7069 | } | |
7070 | ||
7071 | } | |
7072 | } | |
7073 | } | |
e842803a MB |
7074 | |
7075 | int fflush_and_check(FILE *f) { | |
7076 | assert(f); | |
7077 | ||
7078 | errno = 0; | |
7079 | fflush(f); | |
7080 | ||
7081 | if (ferror(f)) | |
7082 | return errno ? -errno : -EIO; | |
7083 | ||
7084 | return 0; | |
7085 | } | |
7086 | ||
e735f4d4 | 7087 | int tempfn_xxxxxx(const char *p, char **ret) { |
e842803a MB |
7088 | const char *fn; |
7089 | char *t; | |
e842803a MB |
7090 | |
7091 | assert(p); | |
e735f4d4 | 7092 | assert(ret); |
e842803a | 7093 | |
e735f4d4 MP |
7094 | /* |
7095 | * Turns this: | |
7096 | * /foo/bar/waldo | |
7097 | * | |
7098 | * Into this: | |
7099 | * /foo/bar/.#waldoXXXXXX | |
7100 | */ | |
e842803a MB |
7101 | |
7102 | fn = basename(p); | |
e735f4d4 MP |
7103 | if (!filename_is_valid(fn)) |
7104 | return -EINVAL; | |
7105 | ||
7106 | t = new(char, strlen(p) + 2 + 6 + 1); | |
7107 | if (!t) | |
7108 | return -ENOMEM; | |
e842803a | 7109 | |
e735f4d4 | 7110 | strcpy(stpcpy(stpcpy(mempcpy(t, p, fn - p), ".#"), fn), "XXXXXX"); |
e842803a | 7111 | |
e735f4d4 MP |
7112 | *ret = path_kill_slashes(t); |
7113 | return 0; | |
e842803a MB |
7114 | } |
7115 | ||
e735f4d4 | 7116 | int tempfn_random(const char *p, char **ret) { |
e842803a MB |
7117 | const char *fn; |
7118 | char *t, *x; | |
7119 | uint64_t u; | |
e842803a MB |
7120 | unsigned i; |
7121 | ||
7122 | assert(p); | |
e735f4d4 | 7123 | assert(ret); |
e842803a | 7124 | |
e735f4d4 MP |
7125 | /* |
7126 | * Turns this: | |
7127 | * /foo/bar/waldo | |
7128 | * | |
7129 | * Into this: | |
7130 | * /foo/bar/.#waldobaa2a261115984a9 | |
7131 | */ | |
e842803a MB |
7132 | |
7133 | fn = basename(p); | |
e735f4d4 MP |
7134 | if (!filename_is_valid(fn)) |
7135 | return -EINVAL; | |
e842803a | 7136 | |
e735f4d4 MP |
7137 | t = new(char, strlen(p) + 2 + 16 + 1); |
7138 | if (!t) | |
7139 | return -ENOMEM; | |
7140 | ||
7141 | x = stpcpy(stpcpy(mempcpy(t, p, fn - p), ".#"), fn); | |
e842803a MB |
7142 | |
7143 | u = random_u64(); | |
7144 | for (i = 0; i < 16; i++) { | |
7145 | *(x++) = hexchar(u & 0xF); | |
7146 | u >>= 4; | |
7147 | } | |
7148 | ||
7149 | *x = 0; | |
7150 | ||
e735f4d4 MP |
7151 | *ret = path_kill_slashes(t); |
7152 | return 0; | |
7153 | } | |
7154 | ||
7155 | int tempfn_random_child(const char *p, char **ret) { | |
7156 | char *t, *x; | |
7157 | uint64_t u; | |
7158 | unsigned i; | |
7159 | ||
7160 | assert(p); | |
7161 | assert(ret); | |
7162 | ||
7163 | /* Turns this: | |
7164 | * /foo/bar/waldo | |
7165 | * Into this: | |
7166 | * /foo/bar/waldo/.#3c2b6219aa75d7d0 | |
7167 | */ | |
7168 | ||
7169 | t = new(char, strlen(p) + 3 + 16 + 1); | |
7170 | if (!t) | |
7171 | return -ENOMEM; | |
7172 | ||
7173 | x = stpcpy(stpcpy(t, p), "/.#"); | |
7174 | ||
7175 | u = random_u64(); | |
7176 | for (i = 0; i < 16; i++) { | |
7177 | *(x++) = hexchar(u & 0xF); | |
7178 | u >>= 4; | |
7179 | } | |
7180 | ||
7181 | *x = 0; | |
7182 | ||
7183 | *ret = path_kill_slashes(t); | |
7184 | return 0; | |
e842803a MB |
7185 | } |
7186 | ||
7187 | /* make sure the hostname is not "localhost" */ | |
7188 | bool is_localhost(const char *hostname) { | |
7189 | assert(hostname); | |
7190 | ||
5eef597e MP |
7191 | /* This tries to identify local host and domain names |
7192 | * described in RFC6761 plus the redhatism of .localdomain */ | |
e842803a MB |
7193 | |
7194 | return streq(hostname, "localhost") || | |
7195 | streq(hostname, "localhost.") || | |
5eef597e MP |
7196 | streq(hostname, "localdomain.") || |
7197 | streq(hostname, "localdomain") || | |
e842803a MB |
7198 | endswith(hostname, ".localhost") || |
7199 | endswith(hostname, ".localhost.") || | |
7200 | endswith(hostname, ".localdomain") || | |
7201 | endswith(hostname, ".localdomain."); | |
7202 | } | |
5eef597e MP |
7203 | |
7204 | int take_password_lock(const char *root) { | |
7205 | ||
7206 | struct flock flock = { | |
7207 | .l_type = F_WRLCK, | |
7208 | .l_whence = SEEK_SET, | |
7209 | .l_start = 0, | |
7210 | .l_len = 0, | |
7211 | }; | |
7212 | ||
7213 | const char *path; | |
7214 | int fd, r; | |
7215 | ||
7216 | /* This is roughly the same as lckpwdf(), but not as awful. We | |
7217 | * don't want to use alarm() and signals, hence we implement | |
7218 | * our own trivial version of this. | |
7219 | * | |
7220 | * Note that shadow-utils also takes per-database locks in | |
7221 | * addition to lckpwdf(). However, we don't given that they | |
7222 | * are redundant as they they invoke lckpwdf() first and keep | |
7223 | * it during everything they do. The per-database locks are | |
7224 | * awfully racy, and thus we just won't do them. */ | |
7225 | ||
7226 | if (root) | |
e735f4d4 | 7227 | path = strjoina(root, "/etc/.pwd.lock"); |
5eef597e MP |
7228 | else |
7229 | path = "/etc/.pwd.lock"; | |
7230 | ||
7231 | fd = open(path, O_WRONLY|O_CREAT|O_CLOEXEC|O_NOCTTY|O_NOFOLLOW, 0600); | |
7232 | if (fd < 0) | |
7233 | return -errno; | |
7234 | ||
7235 | r = fcntl(fd, F_SETLKW, &flock); | |
7236 | if (r < 0) { | |
7237 | safe_close(fd); | |
7238 | return -errno; | |
7239 | } | |
7240 | ||
7241 | return fd; | |
7242 | } | |
7243 | ||
7244 | int is_symlink(const char *path) { | |
7245 | struct stat info; | |
7246 | ||
7247 | if (lstat(path, &info) < 0) | |
7248 | return -errno; | |
7249 | ||
7250 | return !!S_ISLNK(info.st_mode); | |
7251 | } | |
7252 | ||
7253 | int is_dir(const char* path, bool follow) { | |
7254 | struct stat st; | |
f47781d8 | 7255 | int r; |
5eef597e | 7256 | |
f47781d8 MP |
7257 | if (follow) |
7258 | r = stat(path, &st); | |
7259 | else | |
7260 | r = lstat(path, &st); | |
7261 | if (r < 0) | |
7262 | return -errno; | |
5eef597e MP |
7263 | |
7264 | return !!S_ISDIR(st.st_mode); | |
7265 | } | |
7266 | ||
f47781d8 | 7267 | int unquote_first_word(const char **p, char **ret, bool relax) { |
5eef597e MP |
7268 | _cleanup_free_ char *s = NULL; |
7269 | size_t allocated = 0, sz = 0; | |
7270 | ||
7271 | enum { | |
7272 | START, | |
7273 | VALUE, | |
7274 | VALUE_ESCAPE, | |
7275 | SINGLE_QUOTE, | |
7276 | SINGLE_QUOTE_ESCAPE, | |
7277 | DOUBLE_QUOTE, | |
7278 | DOUBLE_QUOTE_ESCAPE, | |
7279 | SPACE, | |
7280 | } state = START; | |
7281 | ||
7282 | assert(p); | |
7283 | assert(*p); | |
7284 | assert(ret); | |
7285 | ||
7286 | /* Parses the first word of a string, and returns it in | |
7287 | * *ret. Removes all quotes in the process. When parsing fails | |
7288 | * (because of an uneven number of quotes or similar), leaves | |
7289 | * the pointer *p at the first invalid character. */ | |
7290 | ||
7291 | for (;;) { | |
7292 | char c = **p; | |
7293 | ||
7294 | switch (state) { | |
7295 | ||
7296 | case START: | |
7297 | if (c == 0) | |
7298 | goto finish; | |
7299 | else if (strchr(WHITESPACE, c)) | |
7300 | break; | |
7301 | ||
7302 | state = VALUE; | |
7303 | /* fallthrough */ | |
7304 | ||
7305 | case VALUE: | |
7306 | if (c == 0) | |
7307 | goto finish; | |
7308 | else if (c == '\'') | |
7309 | state = SINGLE_QUOTE; | |
7310 | else if (c == '\\') | |
7311 | state = VALUE_ESCAPE; | |
7312 | else if (c == '\"') | |
7313 | state = DOUBLE_QUOTE; | |
7314 | else if (strchr(WHITESPACE, c)) | |
7315 | state = SPACE; | |
7316 | else { | |
7317 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7318 | return -ENOMEM; | |
7319 | ||
7320 | s[sz++] = c; | |
7321 | } | |
7322 | ||
7323 | break; | |
7324 | ||
7325 | case VALUE_ESCAPE: | |
f47781d8 MP |
7326 | if (c == 0) { |
7327 | if (relax) | |
7328 | goto finish; | |
5eef597e | 7329 | return -EINVAL; |
f47781d8 | 7330 | } |
5eef597e MP |
7331 | |
7332 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7333 | return -ENOMEM; | |
7334 | ||
7335 | s[sz++] = c; | |
7336 | state = VALUE; | |
7337 | ||
7338 | break; | |
7339 | ||
7340 | case SINGLE_QUOTE: | |
f47781d8 MP |
7341 | if (c == 0) { |
7342 | if (relax) | |
7343 | goto finish; | |
5eef597e | 7344 | return -EINVAL; |
f47781d8 | 7345 | } else if (c == '\'') |
5eef597e MP |
7346 | state = VALUE; |
7347 | else if (c == '\\') | |
7348 | state = SINGLE_QUOTE_ESCAPE; | |
7349 | else { | |
7350 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7351 | return -ENOMEM; | |
7352 | ||
7353 | s[sz++] = c; | |
7354 | } | |
7355 | ||
7356 | break; | |
7357 | ||
7358 | case SINGLE_QUOTE_ESCAPE: | |
f47781d8 MP |
7359 | if (c == 0) { |
7360 | if (relax) | |
7361 | goto finish; | |
5eef597e | 7362 | return -EINVAL; |
f47781d8 | 7363 | } |
5eef597e MP |
7364 | |
7365 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7366 | return -ENOMEM; | |
7367 | ||
7368 | s[sz++] = c; | |
7369 | state = SINGLE_QUOTE; | |
7370 | break; | |
7371 | ||
7372 | case DOUBLE_QUOTE: | |
7373 | if (c == 0) | |
7374 | return -EINVAL; | |
7375 | else if (c == '\"') | |
7376 | state = VALUE; | |
7377 | else if (c == '\\') | |
7378 | state = DOUBLE_QUOTE_ESCAPE; | |
7379 | else { | |
7380 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7381 | return -ENOMEM; | |
7382 | ||
7383 | s[sz++] = c; | |
7384 | } | |
7385 | ||
7386 | break; | |
7387 | ||
7388 | case DOUBLE_QUOTE_ESCAPE: | |
f47781d8 MP |
7389 | if (c == 0) { |
7390 | if (relax) | |
7391 | goto finish; | |
5eef597e | 7392 | return -EINVAL; |
f47781d8 | 7393 | } |
5eef597e MP |
7394 | |
7395 | if (!GREEDY_REALLOC(s, allocated, sz+2)) | |
7396 | return -ENOMEM; | |
7397 | ||
7398 | s[sz++] = c; | |
7399 | state = DOUBLE_QUOTE; | |
7400 | break; | |
7401 | ||
7402 | case SPACE: | |
7403 | if (c == 0) | |
7404 | goto finish; | |
7405 | if (!strchr(WHITESPACE, c)) | |
7406 | goto finish; | |
7407 | ||
7408 | break; | |
7409 | } | |
7410 | ||
7411 | (*p) ++; | |
7412 | } | |
7413 | ||
7414 | finish: | |
7415 | if (!s) { | |
7416 | *ret = NULL; | |
7417 | return 0; | |
7418 | } | |
7419 | ||
7420 | s[sz] = 0; | |
7421 | *ret = s; | |
7422 | s = NULL; | |
7423 | ||
7424 | return 1; | |
7425 | } | |
7426 | ||
7427 | int unquote_many_words(const char **p, ...) { | |
7428 | va_list ap; | |
7429 | char **l; | |
7430 | int n = 0, i, c, r; | |
7431 | ||
7432 | /* Parses a number of words from a string, stripping any | |
7433 | * quotes if necessary. */ | |
7434 | ||
7435 | assert(p); | |
7436 | ||
7437 | /* Count how many words are expected */ | |
7438 | va_start(ap, p); | |
7439 | for (;;) { | |
7440 | if (!va_arg(ap, char **)) | |
7441 | break; | |
7442 | n++; | |
7443 | } | |
7444 | va_end(ap); | |
7445 | ||
7446 | if (n <= 0) | |
7447 | return 0; | |
7448 | ||
7449 | /* Read all words into a temporary array */ | |
7450 | l = newa0(char*, n); | |
7451 | for (c = 0; c < n; c++) { | |
7452 | ||
f47781d8 | 7453 | r = unquote_first_word(p, &l[c], false); |
5eef597e MP |
7454 | if (r < 0) { |
7455 | int j; | |
7456 | ||
7457 | for (j = 0; j < c; j++) | |
7458 | free(l[j]); | |
7459 | ||
7460 | return r; | |
7461 | } | |
7462 | ||
7463 | if (r == 0) | |
7464 | break; | |
7465 | } | |
7466 | ||
7467 | /* If we managed to parse all words, return them in the passed | |
7468 | * in parameters */ | |
7469 | va_start(ap, p); | |
7470 | for (i = 0; i < n; i++) { | |
7471 | char **v; | |
7472 | ||
7473 | v = va_arg(ap, char **); | |
7474 | assert(v); | |
7475 | ||
7476 | *v = l[i]; | |
7477 | } | |
7478 | va_end(ap); | |
7479 | ||
7480 | return c; | |
7481 | } | |
7482 | ||
7483 | int free_and_strdup(char **p, const char *s) { | |
7484 | char *t; | |
7485 | ||
7486 | assert(p); | |
7487 | ||
7488 | /* Replaces a string pointer with an strdup()ed new string, | |
7489 | * possibly freeing the old one. */ | |
7490 | ||
7491 | if (s) { | |
7492 | t = strdup(s); | |
7493 | if (!t) | |
7494 | return -ENOMEM; | |
7495 | } else | |
7496 | t = NULL; | |
7497 | ||
7498 | free(*p); | |
7499 | *p = t; | |
7500 | ||
7501 | return 0; | |
7502 | } | |
7503 | ||
7504 | int sethostname_idempotent(const char *s) { | |
7505 | int r; | |
7506 | char buf[HOST_NAME_MAX + 1] = {}; | |
7507 | ||
7508 | assert(s); | |
7509 | ||
7510 | r = gethostname(buf, sizeof(buf)); | |
7511 | if (r < 0) | |
7512 | return -errno; | |
7513 | ||
7514 | if (streq(buf, s)) | |
7515 | return 0; | |
7516 | ||
7517 | r = sethostname(s, strlen(s)); | |
7518 | if (r < 0) | |
7519 | return -errno; | |
7520 | ||
7521 | return 1; | |
7522 | } | |
e735f4d4 MP |
7523 | |
7524 | int ptsname_malloc(int fd, char **ret) { | |
7525 | size_t l = 100; | |
7526 | ||
7527 | assert(fd >= 0); | |
7528 | assert(ret); | |
7529 | ||
7530 | for (;;) { | |
7531 | char *c; | |
7532 | ||
7533 | c = new(char, l); | |
7534 | if (!c) | |
7535 | return -ENOMEM; | |
7536 | ||
7537 | if (ptsname_r(fd, c, l) == 0) { | |
7538 | *ret = c; | |
7539 | return 0; | |
7540 | } | |
7541 | if (errno != ERANGE) { | |
7542 | free(c); | |
7543 | return -errno; | |
7544 | } | |
7545 | ||
7546 | free(c); | |
7547 | l *= 2; | |
7548 | } | |
7549 | } | |
7550 | ||
7551 | int openpt_in_namespace(pid_t pid, int flags) { | |
7552 | _cleanup_close_ int pidnsfd = -1, mntnsfd = -1, rootfd = -1; | |
7553 | _cleanup_close_pair_ int pair[2] = { -1, -1 }; | |
7554 | union { | |
7555 | struct cmsghdr cmsghdr; | |
7556 | uint8_t buf[CMSG_SPACE(sizeof(int))]; | |
7557 | } control = {}; | |
7558 | struct msghdr mh = { | |
7559 | .msg_control = &control, | |
7560 | .msg_controllen = sizeof(control), | |
7561 | }; | |
7562 | struct cmsghdr *cmsg; | |
7563 | siginfo_t si; | |
7564 | pid_t child; | |
7565 | int r; | |
7566 | ||
7567 | assert(pid > 0); | |
7568 | ||
7569 | r = namespace_open(pid, &pidnsfd, &mntnsfd, NULL, &rootfd); | |
7570 | if (r < 0) | |
7571 | return r; | |
7572 | ||
7573 | if (socketpair(AF_UNIX, SOCK_DGRAM, 0, pair) < 0) | |
7574 | return -errno; | |
7575 | ||
7576 | child = fork(); | |
7577 | if (child < 0) | |
7578 | return -errno; | |
7579 | ||
7580 | if (child == 0) { | |
7581 | int master; | |
7582 | ||
7583 | pair[0] = safe_close(pair[0]); | |
7584 | ||
7585 | r = namespace_enter(pidnsfd, mntnsfd, -1, rootfd); | |
7586 | if (r < 0) | |
7587 | _exit(EXIT_FAILURE); | |
7588 | ||
7589 | master = posix_openpt(flags); | |
7590 | if (master < 0) | |
7591 | _exit(EXIT_FAILURE); | |
7592 | ||
7593 | cmsg = CMSG_FIRSTHDR(&mh); | |
7594 | cmsg->cmsg_level = SOL_SOCKET; | |
7595 | cmsg->cmsg_type = SCM_RIGHTS; | |
7596 | cmsg->cmsg_len = CMSG_LEN(sizeof(int)); | |
7597 | memcpy(CMSG_DATA(cmsg), &master, sizeof(int)); | |
7598 | ||
7599 | mh.msg_controllen = cmsg->cmsg_len; | |
7600 | ||
7601 | if (sendmsg(pair[1], &mh, MSG_NOSIGNAL) < 0) | |
7602 | _exit(EXIT_FAILURE); | |
7603 | ||
7604 | _exit(EXIT_SUCCESS); | |
7605 | } | |
7606 | ||
7607 | pair[1] = safe_close(pair[1]); | |
7608 | ||
7609 | r = wait_for_terminate(child, &si); | |
7610 | if (r < 0) | |
7611 | return r; | |
7612 | if (si.si_code != CLD_EXITED || si.si_status != EXIT_SUCCESS) | |
7613 | return -EIO; | |
7614 | ||
7615 | if (recvmsg(pair[0], &mh, MSG_NOSIGNAL|MSG_CMSG_CLOEXEC) < 0) | |
7616 | return -errno; | |
7617 | ||
7618 | for (cmsg = CMSG_FIRSTHDR(&mh); cmsg; cmsg = CMSG_NXTHDR(&mh, cmsg)) | |
7619 | if (cmsg->cmsg_level == SOL_SOCKET && cmsg->cmsg_type == SCM_RIGHTS) { | |
7620 | int *fds; | |
7621 | unsigned n_fds; | |
7622 | ||
7623 | fds = (int*) CMSG_DATA(cmsg); | |
7624 | n_fds = (cmsg->cmsg_len - CMSG_LEN(0)) / sizeof(int); | |
7625 | ||
7626 | if (n_fds != 1) { | |
7627 | close_many(fds, n_fds); | |
7628 | return -EIO; | |
7629 | } | |
7630 | ||
7631 | return fds[0]; | |
7632 | } | |
7633 | ||
7634 | return -EIO; | |
7635 | } | |
7636 | ||
7637 | ssize_t fgetxattrat_fake(int dirfd, const char *filename, const char *attribute, void *value, size_t size, int flags) { | |
7638 | _cleanup_close_ int fd = -1; | |
7639 | ssize_t l; | |
7640 | ||
7641 | /* The kernel doesn't have a fgetxattrat() command, hence let's emulate one */ | |
7642 | ||
7643 | fd = openat(dirfd, filename, O_RDONLY|O_CLOEXEC|O_NOCTTY|O_NOATIME|(flags & AT_SYMLINK_NOFOLLOW ? O_NOFOLLOW : 0)); | |
7644 | if (fd < 0) | |
7645 | return -errno; | |
7646 | ||
7647 | l = fgetxattr(fd, attribute, value, size); | |
7648 | if (l < 0) | |
7649 | return -errno; | |
7650 | ||
7651 | return l; | |
7652 | } | |
7653 | ||
7654 | static int parse_crtime(le64_t le, usec_t *usec) { | |
7655 | uint64_t u; | |
7656 | ||
7657 | assert(usec); | |
7658 | ||
7659 | u = le64toh(le); | |
7660 | if (u == 0 || u == (uint64_t) -1) | |
7661 | return -EIO; | |
7662 | ||
7663 | *usec = (usec_t) u; | |
7664 | return 0; | |
7665 | } | |
7666 | ||
7667 | int fd_getcrtime(int fd, usec_t *usec) { | |
7668 | le64_t le; | |
7669 | ssize_t n; | |
7670 | ||
7671 | assert(fd >= 0); | |
7672 | assert(usec); | |
7673 | ||
7674 | /* Until Linux gets a real concept of birthtime/creation time, | |
7675 | * let's fake one with xattrs */ | |
7676 | ||
7677 | n = fgetxattr(fd, "user.crtime_usec", &le, sizeof(le)); | |
7678 | if (n < 0) | |
7679 | return -errno; | |
7680 | if (n != sizeof(le)) | |
7681 | return -EIO; | |
7682 | ||
7683 | return parse_crtime(le, usec); | |
7684 | } | |
7685 | ||
7686 | int fd_getcrtime_at(int dirfd, const char *name, usec_t *usec, int flags) { | |
7687 | le64_t le; | |
7688 | ssize_t n; | |
7689 | ||
7690 | n = fgetxattrat_fake(dirfd, name, "user.crtime_usec", &le, sizeof(le), flags); | |
7691 | if (n < 0) | |
7692 | return -errno; | |
7693 | if (n != sizeof(le)) | |
7694 | return -EIO; | |
7695 | ||
7696 | return parse_crtime(le, usec); | |
7697 | } | |
7698 | ||
7699 | int path_getcrtime(const char *p, usec_t *usec) { | |
7700 | le64_t le; | |
7701 | ssize_t n; | |
7702 | ||
7703 | assert(p); | |
7704 | assert(usec); | |
7705 | ||
7706 | n = getxattr(p, "user.crtime_usec", &le, sizeof(le)); | |
7707 | if (n < 0) | |
7708 | return -errno; | |
7709 | if (n != sizeof(le)) | |
7710 | return -EIO; | |
7711 | ||
7712 | return parse_crtime(le, usec); | |
7713 | } | |
7714 | ||
7715 | int fd_setcrtime(int fd, usec_t usec) { | |
7716 | le64_t le; | |
7717 | ||
7718 | assert(fd >= 0); | |
7719 | ||
7720 | if (usec <= 0) | |
7721 | usec = now(CLOCK_REALTIME); | |
7722 | ||
7723 | le = htole64((uint64_t) usec); | |
7724 | if (fsetxattr(fd, "user.crtime_usec", &le, sizeof(le), 0) < 0) | |
7725 | return -errno; | |
7726 | ||
7727 | return 0; | |
7728 | } | |
7729 | ||
7730 | int same_fd(int a, int b) { | |
7731 | struct stat sta, stb; | |
7732 | pid_t pid; | |
7733 | int r, fa, fb; | |
7734 | ||
7735 | assert(a >= 0); | |
7736 | assert(b >= 0); | |
7737 | ||
7738 | /* Compares two file descriptors. Note that semantics are | |
7739 | * quite different depending on whether we have kcmp() or we | |
7740 | * don't. If we have kcmp() this will only return true for | |
7741 | * dup()ed file descriptors, but not otherwise. If we don't | |
7742 | * have kcmp() this will also return true for two fds of the same | |
7743 | * file, created by separate open() calls. Since we use this | |
7744 | * call mostly for filtering out duplicates in the fd store | |
7745 | * this difference hopefully doesn't matter too much. */ | |
7746 | ||
7747 | if (a == b) | |
7748 | return true; | |
7749 | ||
7750 | /* Try to use kcmp() if we have it. */ | |
7751 | pid = getpid(); | |
7752 | r = kcmp(pid, pid, KCMP_FILE, a, b); | |
7753 | if (r == 0) | |
7754 | return true; | |
7755 | if (r > 0) | |
7756 | return false; | |
7757 | if (errno != ENOSYS) | |
7758 | return -errno; | |
7759 | ||
7760 | /* We don't have kcmp(), use fstat() instead. */ | |
7761 | if (fstat(a, &sta) < 0) | |
7762 | return -errno; | |
7763 | ||
7764 | if (fstat(b, &stb) < 0) | |
7765 | return -errno; | |
7766 | ||
7767 | if ((sta.st_mode & S_IFMT) != (stb.st_mode & S_IFMT)) | |
7768 | return false; | |
7769 | ||
7770 | /* We consider all device fds different, since two device fds | |
7771 | * might refer to quite different device contexts even though | |
7772 | * they share the same inode and backing dev_t. */ | |
7773 | ||
7774 | if (S_ISCHR(sta.st_mode) || S_ISBLK(sta.st_mode)) | |
7775 | return false; | |
7776 | ||
7777 | if (sta.st_dev != stb.st_dev || sta.st_ino != stb.st_ino) | |
7778 | return false; | |
7779 | ||
7780 | /* The fds refer to the same inode on disk, let's also check | |
7781 | * if they have the same fd flags. This is useful to | |
7782 | * distuingish the read and write side of a pipe created with | |
7783 | * pipe(). */ | |
7784 | fa = fcntl(a, F_GETFL); | |
7785 | if (fa < 0) | |
7786 | return -errno; | |
7787 | ||
7788 | fb = fcntl(b, F_GETFL); | |
7789 | if (fb < 0) | |
7790 | return -errno; | |
7791 | ||
7792 | return fa == fb; | |
7793 | } | |
7794 | ||
7795 | int chattr_fd(int fd, bool b, unsigned mask) { | |
7796 | unsigned old_attr, new_attr; | |
7797 | ||
7798 | assert(fd >= 0); | |
7799 | ||
7800 | if (mask == 0) | |
7801 | return 0; | |
7802 | ||
7803 | if (ioctl(fd, FS_IOC_GETFLAGS, &old_attr) < 0) | |
7804 | return -errno; | |
7805 | ||
7806 | if (b) | |
7807 | new_attr = old_attr | mask; | |
7808 | else | |
7809 | new_attr = old_attr & ~mask; | |
7810 | ||
7811 | if (new_attr == old_attr) | |
7812 | return 0; | |
7813 | ||
7814 | if (ioctl(fd, FS_IOC_SETFLAGS, &new_attr) < 0) | |
7815 | return -errno; | |
7816 | ||
7817 | return 0; | |
7818 | } | |
7819 | ||
7820 | int chattr_path(const char *p, bool b, unsigned mask) { | |
7821 | _cleanup_close_ int fd = -1; | |
7822 | ||
7823 | assert(p); | |
7824 | ||
7825 | if (mask == 0) | |
7826 | return 0; | |
7827 | ||
7828 | fd = open(p, O_RDONLY|O_CLOEXEC|O_NOCTTY|O_NOFOLLOW); | |
7829 | if (fd < 0) | |
7830 | return -errno; | |
7831 | ||
7832 | return chattr_fd(fd, b, mask); | |
7833 | } | |
7834 | ||
7835 | int read_attr_fd(int fd, unsigned *ret) { | |
7836 | assert(fd >= 0); | |
7837 | ||
7838 | if (ioctl(fd, FS_IOC_GETFLAGS, ret) < 0) | |
7839 | return -errno; | |
7840 | ||
7841 | return 0; | |
7842 | } | |
7843 | ||
7844 | int read_attr_path(const char *p, unsigned *ret) { | |
7845 | _cleanup_close_ int fd = -1; | |
7846 | ||
7847 | assert(p); | |
7848 | assert(ret); | |
7849 | ||
7850 | fd = open(p, O_RDONLY|O_CLOEXEC|O_NOCTTY|O_NOFOLLOW); | |
7851 | if (fd < 0) | |
7852 | return -errno; | |
7853 | ||
7854 | return read_attr_fd(fd, ret); | |
7855 | } | |
7856 | ||
7857 | int make_lock_file(const char *p, int operation, LockFile *ret) { | |
7858 | _cleanup_close_ int fd = -1; | |
7859 | _cleanup_free_ char *t = NULL; | |
7860 | int r; | |
7861 | ||
7862 | /* | |
7863 | * We use UNPOSIX locks if they are available. They have nice | |
7864 | * semantics, and are mostly compatible with NFS. However, | |
7865 | * they are only available on new kernels. When we detect we | |
7866 | * are running on an older kernel, then we fall back to good | |
7867 | * old BSD locks. They also have nice semantics, but are | |
7868 | * slightly problematic on NFS, where they are upgraded to | |
7869 | * POSIX locks, even though locally they are orthogonal to | |
7870 | * POSIX locks. | |
7871 | */ | |
7872 | ||
7873 | t = strdup(p); | |
7874 | if (!t) | |
7875 | return -ENOMEM; | |
7876 | ||
7877 | for (;;) { | |
7878 | struct flock fl = { | |
7879 | .l_type = (operation & ~LOCK_NB) == LOCK_EX ? F_WRLCK : F_RDLCK, | |
7880 | .l_whence = SEEK_SET, | |
7881 | }; | |
7882 | struct stat st; | |
7883 | ||
7884 | fd = open(p, O_CREAT|O_RDWR|O_NOFOLLOW|O_CLOEXEC|O_NOCTTY, 0600); | |
7885 | if (fd < 0) | |
7886 | return -errno; | |
7887 | ||
7888 | r = fcntl(fd, (operation & LOCK_NB) ? F_OFD_SETLK : F_OFD_SETLKW, &fl); | |
7889 | if (r < 0) { | |
7890 | ||
7891 | /* If the kernel is too old, use good old BSD locks */ | |
7892 | if (errno == EINVAL) | |
7893 | r = flock(fd, operation); | |
7894 | ||
7895 | if (r < 0) | |
7896 | return errno == EAGAIN ? -EBUSY : -errno; | |
7897 | } | |
7898 | ||
7899 | /* If we acquired the lock, let's check if the file | |
7900 | * still exists in the file system. If not, then the | |
7901 | * previous exclusive owner removed it and then closed | |
7902 | * it. In such a case our acquired lock is worthless, | |
7903 | * hence try again. */ | |
7904 | ||
7905 | r = fstat(fd, &st); | |
7906 | if (r < 0) | |
7907 | return -errno; | |
7908 | if (st.st_nlink > 0) | |
7909 | break; | |
7910 | ||
7911 | fd = safe_close(fd); | |
7912 | } | |
7913 | ||
7914 | ret->path = t; | |
7915 | ret->fd = fd; | |
7916 | ret->operation = operation; | |
7917 | ||
7918 | fd = -1; | |
7919 | t = NULL; | |
7920 | ||
7921 | return r; | |
7922 | } | |
7923 | ||
7924 | int make_lock_file_for(const char *p, int operation, LockFile *ret) { | |
7925 | const char *fn; | |
7926 | char *t; | |
7927 | ||
7928 | assert(p); | |
7929 | assert(ret); | |
7930 | ||
7931 | fn = basename(p); | |
7932 | if (!filename_is_valid(fn)) | |
7933 | return -EINVAL; | |
7934 | ||
7935 | t = newa(char, strlen(p) + 2 + 4 + 1); | |
7936 | stpcpy(stpcpy(stpcpy(mempcpy(t, p, fn - p), ".#"), fn), ".lck"); | |
7937 | ||
7938 | return make_lock_file(t, operation, ret); | |
7939 | } | |
7940 | ||
7941 | void release_lock_file(LockFile *f) { | |
7942 | int r; | |
7943 | ||
7944 | if (!f) | |
7945 | return; | |
7946 | ||
7947 | if (f->path) { | |
7948 | ||
7949 | /* If we are the exclusive owner we can safely delete | |
7950 | * the lock file itself. If we are not the exclusive | |
7951 | * owner, we can try becoming it. */ | |
7952 | ||
7953 | if (f->fd >= 0 && | |
7954 | (f->operation & ~LOCK_NB) == LOCK_SH) { | |
7955 | static const struct flock fl = { | |
7956 | .l_type = F_WRLCK, | |
7957 | .l_whence = SEEK_SET, | |
7958 | }; | |
7959 | ||
7960 | r = fcntl(f->fd, F_OFD_SETLK, &fl); | |
7961 | if (r < 0 && errno == EINVAL) | |
7962 | r = flock(f->fd, LOCK_EX|LOCK_NB); | |
7963 | ||
7964 | if (r >= 0) | |
7965 | f->operation = LOCK_EX|LOCK_NB; | |
7966 | } | |
7967 | ||
7968 | if ((f->operation & ~LOCK_NB) == LOCK_EX) | |
7969 | unlink_noerrno(f->path); | |
7970 | ||
7971 | free(f->path); | |
7972 | f->path = NULL; | |
7973 | } | |
7974 | ||
7975 | f->fd = safe_close(f->fd); | |
7976 | f->operation = 0; | |
7977 | } | |
7978 | ||
7979 | static size_t nul_length(const uint8_t *p, size_t sz) { | |
7980 | size_t n = 0; | |
7981 | ||
7982 | while (sz > 0) { | |
7983 | if (*p != 0) | |
7984 | break; | |
7985 | ||
7986 | n++; | |
7987 | p++; | |
7988 | sz--; | |
7989 | } | |
7990 | ||
7991 | return n; | |
7992 | } | |
7993 | ||
7994 | ssize_t sparse_write(int fd, const void *p, size_t sz, size_t run_length) { | |
7995 | const uint8_t *q, *w, *e; | |
7996 | ssize_t l; | |
7997 | ||
7998 | q = w = p; | |
7999 | e = q + sz; | |
8000 | while (q < e) { | |
8001 | size_t n; | |
8002 | ||
8003 | n = nul_length(q, e - q); | |
8004 | ||
8005 | /* If there are more than the specified run length of | |
8006 | * NUL bytes, or if this is the beginning or the end | |
8007 | * of the buffer, then seek instead of write */ | |
8008 | if ((n > run_length) || | |
8009 | (n > 0 && q == p) || | |
8010 | (n > 0 && q + n >= e)) { | |
8011 | if (q > w) { | |
8012 | l = write(fd, w, q - w); | |
8013 | if (l < 0) | |
8014 | return -errno; | |
8015 | if (l != q -w) | |
8016 | return -EIO; | |
8017 | } | |
8018 | ||
8019 | if (lseek(fd, n, SEEK_CUR) == (off_t) -1) | |
8020 | return -errno; | |
8021 | ||
8022 | q += n; | |
8023 | w = q; | |
8024 | } else if (n > 0) | |
8025 | q += n; | |
8026 | else | |
8027 | q ++; | |
8028 | } | |
8029 | ||
8030 | if (q > w) { | |
8031 | l = write(fd, w, q - w); | |
8032 | if (l < 0) | |
8033 | return -errno; | |
8034 | if (l != q - w) | |
8035 | return -EIO; | |
8036 | } | |
8037 | ||
8038 | return q - (const uint8_t*) p; | |
8039 | } | |
8040 | ||
8041 | void sigkill_wait(pid_t *pid) { | |
8042 | if (!pid) | |
8043 | return; | |
8044 | if (*pid <= 1) | |
8045 | return; | |
8046 | ||
8047 | if (kill(*pid, SIGKILL) > 0) | |
8048 | (void) wait_for_terminate(*pid, NULL); | |
8049 | } | |
8050 | ||
8051 | int syslog_parse_priority(const char **p, int *priority, bool with_facility) { | |
8052 | int a = 0, b = 0, c = 0; | |
8053 | int k; | |
8054 | ||
8055 | assert(p); | |
8056 | assert(*p); | |
8057 | assert(priority); | |
8058 | ||
8059 | if ((*p)[0] != '<') | |
8060 | return 0; | |
8061 | ||
8062 | if (!strchr(*p, '>')) | |
8063 | return 0; | |
8064 | ||
8065 | if ((*p)[2] == '>') { | |
8066 | c = undecchar((*p)[1]); | |
8067 | k = 3; | |
8068 | } else if ((*p)[3] == '>') { | |
8069 | b = undecchar((*p)[1]); | |
8070 | c = undecchar((*p)[2]); | |
8071 | k = 4; | |
8072 | } else if ((*p)[4] == '>') { | |
8073 | a = undecchar((*p)[1]); | |
8074 | b = undecchar((*p)[2]); | |
8075 | c = undecchar((*p)[3]); | |
8076 | k = 5; | |
8077 | } else | |
8078 | return 0; | |
8079 | ||
8080 | if (a < 0 || b < 0 || c < 0 || | |
8081 | (!with_facility && (a || b || c > 7))) | |
8082 | return 0; | |
8083 | ||
8084 | if (with_facility) | |
8085 | *priority = a*100 + b*10 + c; | |
8086 | else | |
8087 | *priority = (*priority & LOG_FACMASK) | c; | |
8088 | ||
8089 | *p += k; | |
8090 | return 1; | |
8091 | } | |
8092 | ||
8093 | ssize_t string_table_lookup(const char * const *table, size_t len, const char *key) { | |
8094 | size_t i; | |
8095 | ||
8096 | if (!key) | |
8097 | return -1; | |
8098 | ||
8099 | for (i = 0; i < len; ++i) | |
8100 | if (streq_ptr(table[i], key)) | |
8101 | return (ssize_t)i; | |
8102 | ||
8103 | return -1; | |
8104 | } |