Debian Codegraph @

src/basic/uid-range.h

raw
1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
2 #pragma once
3
4 #include "basic-forward.h"
5
6 typedef struct UIDRangeEntry {
7 uid_t start, nr;
8 } UIDRangeEntry;
9
10 typedef struct UIDRange {
11 UIDRangeEntry *entries;
12 size_t n_entries;
13 } UIDRange;
14
15 UIDRange* uid_range_free(UIDRange *range);
16 DEFINE_TRIVIAL_CLEANUP_FUNC(UIDRange*, uid_range_free);
17
18 int uid_range_add_internal(UIDRange **range, uid_t start, uid_t nr, bool coalesce);
19 static inline int uid_range_add(UIDRange **range, uid_t start, uid_t nr) {
20 return uid_range_add_internal(range, start, nr, true);
21 }
22 int uid_range_add_str_full(UIDRange **range, const char *s, bool coalesce);
23 static inline int uid_range_add_str(UIDRange **range, const char *s) {
24 return uid_range_add_str_full(range, s, true);
25 }
26
27 int uid_range_next_lower(const UIDRange *range, uid_t *uid);
28
29 bool uid_range_covers(const UIDRange *range, uid_t start, uid_t nr);
30 static inline bool uid_range_contains(const UIDRange *range, uid_t uid) {
31 return uid_range_covers(range, uid, 1);
32 }
33
34 int uid_map_read_one(FILE *f, uid_t *ret_base, uid_t *ret_shift, uid_t *ret_range);
35
36 static inline size_t uid_range_entries(const UIDRange *range) {
37 return range ? range->n_entries : 0;
38 }
39
40 unsigned uid_range_size(const UIDRange *range) _pure_;
41 bool uid_range_is_empty(const UIDRange *range) _pure_;
42
43 bool uid_range_equal(const UIDRange *a, const UIDRange *b);
44
45 typedef enum UIDRangeUsernsMode {
46 UID_RANGE_USERNS_INSIDE,
47 UID_RANGE_USERNS_OUTSIDE,
48 GID_RANGE_USERNS_INSIDE,
49 GID_RANGE_USERNS_OUTSIDE,
50 _UID_RANGE_USERNS_MODE_MAX,
51 _UID_RANGE_USERNS_MODE_INVALID = -EINVAL,
52 } UIDRangeUsernsMode;
53
54 int uid_range_load_userns_full(const char *path, UIDRangeUsernsMode mode, bool coalesce, UIDRange **ret);
55 static inline int uid_range_load_userns(const char *path, UIDRangeUsernsMode mode, UIDRange **ret) {
56 return uid_range_load_userns_full(path, mode, true, ret);
57 }
58 int uid_range_load_userns_by_fd_full(int userns_fd, UIDRangeUsernsMode mode, bool coalesce, UIDRange **ret);
59 static inline int uid_range_load_userns_by_fd(int userns_fd, UIDRangeUsernsMode mode, UIDRange **ret) {
60 return uid_range_load_userns_by_fd_full(userns_fd, mode, true, ret);
61 }
62
63 bool uid_range_overlaps(const UIDRange *range, uid_t start, uid_t nr);
64
65 int uid_range_clip(UIDRange *range, uid_t min, uid_t max);
66 int uid_range_partition(UIDRange *range, uid_t size);
67 int uid_range_copy(const UIDRange *range, UIDRange **ret);
68 int uid_range_remove(UIDRange *range, uid_t start, uid_t size);
69 int uid_range_translate(const UIDRange *outside, const UIDRange *inside, uid_t uid, uid_t *ret);
70 int uid_range_translate_userns_fd(int userns_fd, UIDRangeUsernsMode mode, uid_t uid, uid_t *ret);
71
72 int uid_map_search_root(pid_t pid, UIDRangeUsernsMode mode, uid_t *ret);
73
74 uid_t uid_range_base(const UIDRange *range);