]> git.ipfire.org Git - thirdparty/systemd.git/blob - src/basic/util.h
process-util: move more process related calls to process-util.[ch]
[thirdparty/systemd.git] / src / basic / util.h
1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
2
3 #pragma once
4
5 /***
6 This file is part of systemd.
7
8 Copyright 2010 Lennart Poettering
9
10 systemd is free software; you can redistribute it and/or modify it
11 under the terms of the GNU Lesser General Public License as published by
12 the Free Software Foundation; either version 2.1 of the License, or
13 (at your option) any later version.
14
15 systemd is distributed in the hope that it will be useful, but
16 WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 Lesser General Public License for more details.
19
20 You should have received a copy of the GNU Lesser General Public License
21 along with systemd; If not, see <http://www.gnu.org/licenses/>.
22 ***/
23
24 #include <alloca.h>
25 #include <dirent.h>
26 #include <fcntl.h>
27 #include <inttypes.h>
28 #include <limits.h>
29 #include <locale.h>
30 #include <mntent.h>
31 #include <stdarg.h>
32 #include <stdbool.h>
33 #include <stddef.h>
34 #include <stdio.h>
35 #include <stdlib.h>
36 #include <sys/inotify.h>
37 #include <sys/socket.h>
38 #include <sys/stat.h>
39 #include <sys/statfs.h>
40 #include <sys/types.h>
41 #include <time.h>
42 #include <unistd.h>
43
44 #include "formats-util.h"
45 #include "macro.h"
46 #include "missing.h"
47 #include "time-util.h"
48
49 /* What is interpreted as whitespace? */
50 #define WHITESPACE " \t\n\r"
51 #define NEWLINE "\n\r"
52 #define QUOTES "\"\'"
53 #define COMMENTS "#;"
54 #define GLOB_CHARS "*?["
55
56 #define FORMAT_BYTES_MAX 8
57
58 size_t page_size(void) _pure_;
59 #define PAGE_ALIGN(l) ALIGN_TO((l), page_size())
60
61 #define new(t, n) ((t*) malloc_multiply(sizeof(t), (n)))
62
63 #define new0(t, n) ((t*) calloc((n), sizeof(t)))
64
65 #define newa(t, n) ((t*) alloca(sizeof(t)*(n)))
66
67 #define newa0(t, n) ((t*) alloca0(sizeof(t)*(n)))
68
69 #define newdup(t, p, n) ((t*) memdup_multiply(p, sizeof(t), (n)))
70
71 #define malloc0(n) (calloc(1, (n)))
72
73 static inline void *mfree(void *memory) {
74 free(memory);
75 return NULL;
76 }
77
78 static inline const char* yes_no(bool b) {
79 return b ? "yes" : "no";
80 }
81
82 static inline const char* true_false(bool b) {
83 return b ? "true" : "false";
84 }
85
86 static inline const char* one_zero(bool b) {
87 return b ? "1" : "0";
88 }
89
90 int parse_size(const char *t, uint64_t base, uint64_t *size);
91
92 int parse_boolean(const char *v) _pure_;
93 int parse_pid(const char *s, pid_t* ret_pid);
94
95 int safe_atou(const char *s, unsigned *ret_u);
96 int safe_atoi(const char *s, int *ret_i);
97
98 int safe_atollu(const char *s, unsigned long long *ret_u);
99 int safe_atolli(const char *s, long long int *ret_i);
100
101 int safe_atod(const char *s, double *ret_d);
102
103 int safe_atou8(const char *s, uint8_t *ret);
104
105 #if LONG_MAX == INT_MAX
106 static inline int safe_atolu(const char *s, unsigned long *ret_u) {
107 assert_cc(sizeof(unsigned long) == sizeof(unsigned));
108 return safe_atou(s, (unsigned*) ret_u);
109 }
110 static inline int safe_atoli(const char *s, long int *ret_u) {
111 assert_cc(sizeof(long int) == sizeof(int));
112 return safe_atoi(s, (int*) ret_u);
113 }
114 #else
115 static inline int safe_atolu(const char *s, unsigned long *ret_u) {
116 assert_cc(sizeof(unsigned long) == sizeof(unsigned long long));
117 return safe_atollu(s, (unsigned long long*) ret_u);
118 }
119 static inline int safe_atoli(const char *s, long int *ret_u) {
120 assert_cc(sizeof(long int) == sizeof(long long int));
121 return safe_atolli(s, (long long int*) ret_u);
122 }
123 #endif
124
125 static inline int safe_atou32(const char *s, uint32_t *ret_u) {
126 assert_cc(sizeof(uint32_t) == sizeof(unsigned));
127 return safe_atou(s, (unsigned*) ret_u);
128 }
129
130 static inline int safe_atoi32(const char *s, int32_t *ret_i) {
131 assert_cc(sizeof(int32_t) == sizeof(int));
132 return safe_atoi(s, (int*) ret_i);
133 }
134
135 static inline int safe_atou64(const char *s, uint64_t *ret_u) {
136 assert_cc(sizeof(uint64_t) == sizeof(unsigned long long));
137 return safe_atollu(s, (unsigned long long*) ret_u);
138 }
139
140 static inline int safe_atoi64(const char *s, int64_t *ret_i) {
141 assert_cc(sizeof(int64_t) == sizeof(long long int));
142 return safe_atolli(s, (long long int*) ret_i);
143 }
144
145 int safe_atou16(const char *s, uint16_t *ret);
146 int safe_atoi16(const char *s, int16_t *ret);
147
148 int readlinkat_malloc(int fd, const char *p, char **ret);
149 int readlink_malloc(const char *p, char **r);
150 int readlink_value(const char *p, char **ret);
151 int readlink_and_make_absolute(const char *p, char **r);
152 int readlink_and_canonicalize(const char *p, char **r);
153
154 char *file_in_same_dir(const char *path, const char *filename);
155
156 int rmdir_parents(const char *path, const char *stop);
157
158 char hexchar(int x) _const_;
159 int unhexchar(char c) _const_;
160 char octchar(int x) _const_;
161 int unoctchar(char c) _const_;
162 char decchar(int x) _const_;
163 int undecchar(char c) _const_;
164 char base32hexchar(int x) _const_;
165 int unbase32hexchar(char c) _const_;
166 char base64char(int x) _const_;
167 int unbase64char(char c) _const_;
168
169 bool dirent_is_file(const struct dirent *de) _pure_;
170 bool dirent_is_file_with_suffix(const struct dirent *de, const char *suffix) _pure_;
171
172 bool hidden_file(const char *filename) _pure_;
173
174 /* For basic lookup tables with strictly enumerated entries */
175 #define _DEFINE_STRING_TABLE_LOOKUP_TO_STRING(name,type,scope) \
176 scope const char *name##_to_string(type i) { \
177 if (i < 0 || i >= (type) ELEMENTSOF(name##_table)) \
178 return NULL; \
179 return name##_table[i]; \
180 }
181
182 ssize_t string_table_lookup(const char * const *table, size_t len, const char *key);
183
184 #define _DEFINE_STRING_TABLE_LOOKUP_FROM_STRING(name,type,scope) \
185 scope type name##_from_string(const char *s) { \
186 return (type) string_table_lookup(name##_table, ELEMENTSOF(name##_table), s); \
187 }
188
189 #define _DEFINE_STRING_TABLE_LOOKUP(name,type,scope) \
190 _DEFINE_STRING_TABLE_LOOKUP_TO_STRING(name,type,scope) \
191 _DEFINE_STRING_TABLE_LOOKUP_FROM_STRING(name,type,scope) \
192 struct __useless_struct_to_allow_trailing_semicolon__
193
194 #define DEFINE_STRING_TABLE_LOOKUP(name,type) _DEFINE_STRING_TABLE_LOOKUP(name,type,)
195 #define DEFINE_PRIVATE_STRING_TABLE_LOOKUP(name,type) _DEFINE_STRING_TABLE_LOOKUP(name,type,static)
196 #define DEFINE_PRIVATE_STRING_TABLE_LOOKUP_TO_STRING(name,type) _DEFINE_STRING_TABLE_LOOKUP_TO_STRING(name,type,static)
197 #define DEFINE_PRIVATE_STRING_TABLE_LOOKUP_FROM_STRING(name,type) _DEFINE_STRING_TABLE_LOOKUP_FROM_STRING(name,type,static)
198
199 /* For string conversions where numbers are also acceptable */
200 #define DEFINE_STRING_TABLE_LOOKUP_WITH_FALLBACK(name,type,max) \
201 int name##_to_string_alloc(type i, char **str) { \
202 char *s; \
203 if (i < 0 || i > max) \
204 return -ERANGE; \
205 if (i < (type) ELEMENTSOF(name##_table)) { \
206 s = strdup(name##_table[i]); \
207 if (!s) \
208 return -ENOMEM; \
209 } else { \
210 if (asprintf(&s, "%i", i) < 0) \
211 return -ENOMEM; \
212 } \
213 *str = s; \
214 return 0; \
215 } \
216 type name##_from_string(const char *s) { \
217 type i; \
218 unsigned u = 0; \
219 if (!s) \
220 return (type) -1; \
221 for (i = 0; i < (type) ELEMENTSOF(name##_table); i++) \
222 if (streq_ptr(name##_table[i], s)) \
223 return i; \
224 if (safe_atou(s, &u) >= 0 && u <= max) \
225 return (type) u; \
226 return (type) -1; \
227 } \
228 struct __useless_struct_to_allow_trailing_semicolon__
229
230 bool fstype_is_network(const char *fstype);
231
232 int fopen_temporary(const char *path, FILE **_f, char **_temp_path);
233
234 bool is_device_path(const char *path);
235
236 int dir_is_empty(const char *path);
237 char* dirname_malloc(const char *path);
238
239 static inline int dir_is_populated(const char *path) {
240 int r;
241 r = dir_is_empty(path);
242 if (r < 0)
243 return r;
244 return !r;
245 }
246
247 int chmod_and_chown(const char *path, mode_t mode, uid_t uid, gid_t gid);
248 int fchmod_and_fchown(int fd, mode_t mode, uid_t uid, gid_t gid);
249
250 typedef long statfs_f_type_t;
251
252 bool is_fs_type(const struct statfs *s, statfs_f_type_t magic_value) _pure_;
253 int fd_check_fstype(int fd, statfs_f_type_t magic_value);
254 int path_check_fstype(const char *path, statfs_f_type_t magic_value);
255
256 bool is_temporary_fs(const struct statfs *s) _pure_;
257 int fd_is_temporary_fs(int fd);
258
259 #define xsprintf(buf, fmt, ...) \
260 assert_message_se((size_t) snprintf(buf, ELEMENTSOF(buf), fmt, __VA_ARGS__) < ELEMENTSOF(buf), \
261 "xsprintf: " #buf "[] must be big enough")
262
263 int files_same(const char *filea, const char *fileb);
264
265 int running_in_chroot(void);
266
267 int touch_file(const char *path, bool parents, usec_t stamp, uid_t uid, gid_t gid, mode_t mode);
268 int touch(const char *path);
269
270 noreturn void freeze(void);
271
272 bool null_or_empty(struct stat *st) _pure_;
273 int null_or_empty_path(const char *fn);
274 int null_or_empty_fd(int fd);
275
276 DIR *xopendirat(int dirfd, const char *name, int flags);
277
278 char *fstab_node_to_udev_node(const char *p);
279
280 void execute_directories(const char* const* directories, usec_t timeout, char *argv[]);
281
282 bool plymouth_running(void);
283
284 int symlink_idempotent(const char *from, const char *to);
285
286 int symlink_atomic(const char *from, const char *to);
287 int mknod_atomic(const char *path, mode_t mode, dev_t dev);
288 int mkfifo_atomic(const char *path, mode_t mode);
289
290 int fchmod_umask(int fd, mode_t mode);
291
292 bool display_is_local(const char *display) _pure_;
293 int socket_from_display(const char *display, char **path);
294
295 int glob_exists(const char *path);
296 int glob_extend(char ***strv, const char *path);
297
298 int dirent_ensure_type(DIR *d, struct dirent *de);
299
300 int get_files_in_directory(const char *path, char ***list);
301
302 bool is_main_thread(void);
303
304 int block_get_whole_disk(dev_t d, dev_t *ret);
305
306 #define NULSTR_FOREACH(i, l) \
307 for ((i) = (l); (i) && *(i); (i) = strchr((i), 0)+1)
308
309 #define NULSTR_FOREACH_PAIR(i, j, l) \
310 for ((i) = (l), (j) = strchr((i), 0)+1; (i) && *(i); (i) = strchr((j), 0)+1, (j) = *(i) ? strchr((i), 0)+1 : (i))
311
312 int ioprio_class_to_string_alloc(int i, char **s);
313 int ioprio_class_from_string(const char *s);
314
315 const char *sigchld_code_to_string(int i) _const_;
316 int sigchld_code_from_string(const char *s) _pure_;
317
318 int log_facility_unshifted_to_string_alloc(int i, char **s);
319 int log_facility_unshifted_from_string(const char *s);
320 bool log_facility_unshifted_is_valid(int faciliy);
321
322 int log_level_to_string_alloc(int i, char **s);
323 int log_level_from_string(const char *s);
324 bool log_level_is_valid(int level);
325
326 int sched_policy_to_string_alloc(int i, char **s);
327 int sched_policy_from_string(const char *s);
328
329 const char *rlimit_to_string(int i) _const_;
330 int rlimit_from_string(const char *s) _pure_;
331
332 extern int saved_argc;
333 extern char **saved_argv;
334
335 bool kexec_loaded(void);
336
337 int prot_from_flags(int flags) _const_;
338
339 char *format_bytes(char *buf, size_t l, uint64_t t);
340
341 void* memdup(const void *p, size_t l) _alloc_(2);
342
343 int fork_agent(pid_t *pid, const int except[], unsigned n_except, const char *path, ...);
344
345 int setrlimit_closest(int resource, const struct rlimit *rlim);
346
347 bool http_url_is_valid(const char *url) _pure_;
348 bool documentation_url_is_valid(const char *url) _pure_;
349
350 bool http_etag_is_valid(const char *etag);
351
352 bool in_initrd(void);
353
354 static inline void freep(void *p) {
355 free(*(void**) p);
356 }
357
358 static inline void umaskp(mode_t *u) {
359 umask(*u);
360 }
361
362 DEFINE_TRIVIAL_CLEANUP_FUNC(FILE*, endmntent);
363
364 #define _cleanup_free_ _cleanup_(freep)
365 #define _cleanup_umask_ _cleanup_(umaskp)
366 #define _cleanup_globfree_ _cleanup_(globfree)
367 #define _cleanup_endmntent_ _cleanup_(endmntentp)
368
369 _malloc_ _alloc_(1, 2) static inline void *malloc_multiply(size_t a, size_t b) {
370 if (_unlikely_(b != 0 && a > ((size_t) -1) / b))
371 return NULL;
372
373 return malloc(a * b);
374 }
375
376 _alloc_(2, 3) static inline void *realloc_multiply(void *p, size_t a, size_t b) {
377 if (_unlikely_(b != 0 && a > ((size_t) -1) / b))
378 return NULL;
379
380 return realloc(p, a * b);
381 }
382
383 _alloc_(2, 3) static inline void *memdup_multiply(const void *p, size_t a, size_t b) {
384 if (_unlikely_(b != 0 && a > ((size_t) -1) / b))
385 return NULL;
386
387 return memdup(p, a * b);
388 }
389
390 bool filename_is_valid(const char *p) _pure_;
391 bool path_is_safe(const char *p) _pure_;
392 bool string_is_safe(const char *p) _pure_;
393
394 /**
395 * Check if a string contains any glob patterns.
396 */
397 _pure_ static inline bool string_is_glob(const char *p) {
398 return !!strpbrk(p, GLOB_CHARS);
399 }
400
401 void *xbsearch_r(const void *key, const void *base, size_t nmemb, size_t size,
402 int (*compar) (const void *, const void *, void *),
403 void *arg);
404
405 #define _(String) gettext (String)
406 #define N_(String) String
407 void init_gettext(void);
408 bool is_locale_utf8(void);
409
410 typedef enum DrawSpecialChar {
411 DRAW_TREE_VERTICAL,
412 DRAW_TREE_BRANCH,
413 DRAW_TREE_RIGHT,
414 DRAW_TREE_SPACE,
415 DRAW_TRIANGULAR_BULLET,
416 DRAW_BLACK_CIRCLE,
417 DRAW_ARROW,
418 DRAW_DASH,
419 _DRAW_SPECIAL_CHAR_MAX
420 } DrawSpecialChar;
421
422 const char *draw_special_char(DrawSpecialChar ch);
423
424 int on_ac_power(void);
425
426 int search_and_fopen(const char *path, const char *mode, const char *root, const char **search, FILE **_f);
427 int search_and_fopen_nulstr(const char *path, const char *mode, const char *root, const char *search, FILE **_f);
428
429 #define FOREACH_LINE(line, f, on_error) \
430 for (;;) \
431 if (!fgets(line, sizeof(line), f)) { \
432 if (ferror(f)) { \
433 on_error; \
434 } \
435 break; \
436 } else
437
438 #define FOREACH_DIRENT(de, d, on_error) \
439 for (errno = 0, de = readdir(d);; errno = 0, de = readdir(d)) \
440 if (!de) { \
441 if (errno > 0) { \
442 on_error; \
443 } \
444 break; \
445 } else if (hidden_file((de)->d_name)) \
446 continue; \
447 else
448
449 #define FOREACH_DIRENT_ALL(de, d, on_error) \
450 for (errno = 0, de = readdir(d);; errno = 0, de = readdir(d)) \
451 if (!de) { \
452 if (errno > 0) { \
453 on_error; \
454 } \
455 break; \
456 } else
457
458 static inline void *mempset(void *s, int c, size_t n) {
459 memset(s, c, n);
460 return (uint8_t*)s + n;
461 }
462
463 char *hexmem(const void *p, size_t l);
464 int unhexmem(const char *p, size_t l, void **mem, size_t *len);
465
466 char *base32hexmem(const void *p, size_t l, bool padding);
467 int unbase32hexmem(const char *p, size_t l, bool padding, void **mem, size_t *len);
468
469 char *base64mem(const void *p, size_t l);
470 int unbase64mem(const char *p, size_t l, void **mem, size_t *len);
471
472 void* greedy_realloc(void **p, size_t *allocated, size_t need, size_t size);
473 void* greedy_realloc0(void **p, size_t *allocated, size_t need, size_t size);
474 #define GREEDY_REALLOC(array, allocated, need) \
475 greedy_realloc((void**) &(array), &(allocated), (need), sizeof((array)[0]))
476
477 #define GREEDY_REALLOC0(array, allocated, need) \
478 greedy_realloc0((void**) &(array), &(allocated), (need), sizeof((array)[0]))
479
480 static inline void _reset_errno_(int *saved_errno) {
481 errno = *saved_errno;
482 }
483
484 #define PROTECT_ERRNO _cleanup_(_reset_errno_) __attribute__((unused)) int _saved_errno_ = errno
485
486 static inline int negative_errno(void) {
487 /* This helper should be used to shut up gcc if you know 'errno' is
488 * negative. Instead of "return -errno;", use "return negative_errno();"
489 * It will suppress bogus gcc warnings in case it assumes 'errno' might
490 * be 0 and thus the caller's error-handling might not be triggered. */
491 assert_return(errno > 0, -EINVAL);
492 return -errno;
493 }
494
495 struct _umask_struct_ {
496 mode_t mask;
497 bool quit;
498 };
499
500 static inline void _reset_umask_(struct _umask_struct_ *s) {
501 umask(s->mask);
502 };
503
504 #define RUN_WITH_UMASK(mask) \
505 for (_cleanup_(_reset_umask_) struct _umask_struct_ _saved_umask_ = { umask(mask), false }; \
506 !_saved_umask_.quit ; \
507 _saved_umask_.quit = true)
508
509 static inline unsigned u64log2(uint64_t n) {
510 #if __SIZEOF_LONG_LONG__ == 8
511 return (n > 1) ? (unsigned) __builtin_clzll(n) ^ 63U : 0;
512 #else
513 #error "Wut?"
514 #endif
515 }
516
517 static inline unsigned u32ctz(uint32_t n) {
518 #if __SIZEOF_INT__ == 4
519 return __builtin_ctz(n);
520 #else
521 #error "Wut?"
522 #endif
523 }
524
525 static inline unsigned log2i(int x) {
526 assert(x > 0);
527
528 return __SIZEOF_INT__ * 8 - __builtin_clz(x) - 1;
529 }
530
531 static inline unsigned log2u(unsigned x) {
532 assert(x > 0);
533
534 return sizeof(unsigned) * 8 - __builtin_clz(x) - 1;
535 }
536
537 static inline unsigned log2u_round_up(unsigned x) {
538 assert(x > 0);
539
540 if (x == 1)
541 return 0;
542
543 return log2u(x - 1) + 1;
544 }
545
546 #define DECIMAL_STR_WIDTH(x) \
547 ({ \
548 typeof(x) _x_ = (x); \
549 unsigned ans = 1; \
550 while (_x_ /= 10) \
551 ans++; \
552 ans; \
553 })
554
555 int unlink_noerrno(const char *path);
556
557 #define alloca0(n) \
558 ({ \
559 char *_new_; \
560 size_t _len_ = n; \
561 _new_ = alloca(_len_); \
562 (void *) memset(_new_, 0, _len_); \
563 })
564
565 /* It's not clear what alignment glibc/gcc alloca() guarantee, hence provide a guaranteed safe version */
566 #define alloca_align(size, align) \
567 ({ \
568 void *_ptr_; \
569 size_t _mask_ = (align) - 1; \
570 _ptr_ = alloca((size) + _mask_); \
571 (void*)(((uintptr_t)_ptr_ + _mask_) & ~_mask_); \
572 })
573
574 #define alloca0_align(size, align) \
575 ({ \
576 void *_new_; \
577 size_t _size_ = (size); \
578 _new_ = alloca_align(_size_, (align)); \
579 (void*)memset(_new_, 0, _size_); \
580 })
581
582 bool id128_is_valid(const char *s) _pure_;
583
584 int shall_restore_state(void);
585
586 /**
587 * Normal qsort requires base to be nonnull. Here were require
588 * that only if nmemb > 0.
589 */
590 static inline void qsort_safe(void *base, size_t nmemb, size_t size, comparison_fn_t compar) {
591 if (nmemb <= 1)
592 return;
593
594 assert(base);
595 qsort(base, nmemb, size, compar);
596 }
597
598 int proc_cmdline(char **ret);
599 int parse_proc_cmdline(int (*parse_word)(const char *key, const char *value));
600 int get_proc_cmdline_key(const char *parameter, char **value);
601
602 int container_get_leader(const char *machine, pid_t *pid);
603
604 int namespace_open(pid_t pid, int *pidns_fd, int *mntns_fd, int *netns_fd, int *userns_fd, int *root_fd);
605 int namespace_enter(int pidns_fd, int mntns_fd, int netns_fd, int userns_fd, int root_fd);
606
607 int mkostemp_safe(char *pattern, int flags);
608 int open_tmpfile(const char *path, int flags);
609
610 int fd_warn_permissions(const char *path, int fd);
611
612 #ifndef PERSONALITY_INVALID
613 /* personality(7) documents that 0xffffffffUL is used for querying the
614 * current personality, hence let's use that here as error
615 * indicator. */
616 #define PERSONALITY_INVALID 0xffffffffLU
617 #endif
618
619 unsigned long personality_from_string(const char *p);
620 const char *personality_to_string(unsigned long);
621
622 uint64_t physical_memory(void);
623
624 void hexdump(FILE *f, const void *p, size_t s);
625
626 union file_handle_union {
627 struct file_handle handle;
628 char padding[sizeof(struct file_handle) + MAX_HANDLE_SZ];
629 };
630 #define FILE_HANDLE_INIT { .handle.handle_bytes = MAX_HANDLE_SZ }
631
632 int update_reboot_param_file(const char *param);
633
634 int umount_recursive(const char *target, int flags);
635
636 int bind_remount_recursive(const char *prefix, bool ro);
637
638 int fflush_and_check(FILE *f);
639
640 int tempfn_xxxxxx(const char *p, const char *extra, char **ret);
641 int tempfn_random(const char *p, const char *extra, char **ret);
642 int tempfn_random_child(const char *p, const char *extra, char **ret);
643
644 int take_password_lock(const char *root);
645
646 int is_symlink(const char *path);
647 int is_dir(const char *path, bool follow);
648 int is_device_node(const char *path);
649
650 #define INOTIFY_EVENT_MAX (sizeof(struct inotify_event) + NAME_MAX + 1)
651
652 #define FOREACH_INOTIFY_EVENT(e, buffer, sz) \
653 for ((e) = &buffer.ev; \
654 (uint8_t*) (e) < (uint8_t*) (buffer.raw) + (sz); \
655 (e) = (struct inotify_event*) ((uint8_t*) (e) + sizeof(struct inotify_event) + (e)->len))
656
657 union inotify_event_buffer {
658 struct inotify_event ev;
659 uint8_t raw[INOTIFY_EVENT_MAX];
660 };
661
662 #define laccess(path, mode) faccessat(AT_FDCWD, (path), (mode), AT_SYMLINK_NOFOLLOW)
663
664 ssize_t fgetxattrat_fake(int dirfd, const char *filename, const char *attribute, void *value, size_t size, int flags);
665
666 int fd_setcrtime(int fd, usec_t usec);
667 int fd_getcrtime(int fd, usec_t *usec);
668 int path_getcrtime(const char *p, usec_t *usec);
669 int fd_getcrtime_at(int dirfd, const char *name, usec_t *usec, int flags);
670
671 int chattr_fd(int fd, unsigned value, unsigned mask);
672 int chattr_path(const char *p, unsigned value, unsigned mask);
673
674 int read_attr_fd(int fd, unsigned *ret);
675 int read_attr_path(const char *p, unsigned *ret);
676
677 #define RLIMIT_MAKE_CONST(lim) ((struct rlimit) { lim, lim })
678
679 int syslog_parse_priority(const char **p, int *priority, bool with_facility);
680
681 int rename_noreplace(int olddirfd, const char *oldpath, int newdirfd, const char *newpath);
682
683 int parse_mode(const char *s, mode_t *ret);
684
685 int mount_move_root(const char *path);
686
687 int getxattr_malloc(const char *path, const char *name, char **value, bool allow_symlink);
688 int fgetxattr_malloc(int fd, const char *name, char **value);
689
690 void nop_signal_handler(int sig);
691
692 int version(void);
693
694 bool fdname_is_valid(const char *s);
695
696 bool oom_score_adjust_is_valid(int oa);