22508817992

Committed 27 Feb 2026 10:57PM UTC coverage: 72.532% (-0.04%) from 72.575%

Build # 22508817992

Build Type

push

github

Committed by

poettering

Commit Message

NEWS: add various more features added in v260, and introduce more sections

Run Details

315698 of 435256 relevant lines covered (72.53%)

1132137.23 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

93.67

/src/basic/uid-range.c

/* SPDX-License-Identifier: LGPL-2.1-or-later */

#include <sched.h>
#include <string.h>

#include "alloc-util.h"
#include "errno-util.h"
#include "fd-util.h"
#include "format-util.h"
#include "namespace-util.h"
#include "path-util.h"
#include "pidref.h"
#include "process-util.h"
#include "sort-util.h"
#include "stat-util.h"
#include "uid-range.h"
#include "user-util.h"

UIDRange *uid_range_free(UIDRange *range) {
        if (!range)
                return NULL;

        free(range->entries);
        return mfree(range);
}

static bool uid_range_entry_intersect(const UIDRangeEntry *a, const UIDRangeEntry *b) {
        assert(a);
        assert(b);

        return a->start <= b->start + b->nr && a->start + a->nr >= b->start;
}

static int uid_range_entry_compare(const UIDRangeEntry *a, const UIDRangeEntry *b) {
        int r;

        assert(a);
        assert(b);

        r = CMP(a->start, b->start);
        if (r != 0)
                return r;

        return CMP(a->nr, b->nr);
}

static void uid_range_coalesce(UIDRange *range) {
        assert(range);

        if (range->n_entries <= 0)
                return;

        typesafe_qsort(range->entries, range->n_entries, uid_range_entry_compare);

        for (size_t i = 0; i < range->n_entries; i++) {
                UIDRangeEntry *x = range->entries + i;

                for (size_t j = i + 1; j < range->n_entries; j++) {
                        UIDRangeEntry *y = range->entries + j;
                        uid_t begin, end;

                        if (!uid_range_entry_intersect(x, y))
                                break;

                        begin = MIN(x->start, y->start);
                        end = MAX(x->start + x->nr, y->start + y->nr);

                        x->start = begin;
                        x->nr = end - begin;

                        if (range->n_entries > j + 1)
                                memmove(y, y + 1, sizeof(UIDRangeEntry) * (range->n_entries - j - 1));

                        range->n_entries--;
                        j--;
                }
        }
}

int uid_range_add_internal(UIDRange **range, uid_t start, uid_t nr, bool coalesce) {
        _cleanup_(uid_range_freep) UIDRange *range_new = NULL;
        UIDRange *p;

        assert(range);

        if (nr <= 0)
                return 0;

        if (start > UINT32_MAX - nr) /* overflow check */
                return -ERANGE;

        if (*range)
                p = *range;
        else {
                range_new = new0(UIDRange, 1);
                if (!range_new)
                        return -ENOMEM;

                p = range_new;
        }

        if (!GREEDY_REALLOC(p->entries, p->n_entries + 1))
                return -ENOMEM;

        p->entries[p->n_entries++] = (UIDRangeEntry) {
                .start = start,
                .nr = nr,
        };

        if (coalesce)
                uid_range_coalesce(p);

        TAKE_PTR(range_new);
        *range = p;

        return 0;
}

int uid_range_add_str_full(UIDRange **range, const char *s, bool coalesce) {
        uid_t start, end;
        int r;

        assert(range);
        assert(s);

        r = parse_uid_range(s, &start, &end);
        if (r < 0)
                return r;

        return uid_range_add_internal(range, start, end - start + 1, coalesce);
}

int uid_range_next_lower(const UIDRange *range, uid_t *uid) {
        uid_t closest = UID_INVALID, candidate;

        assert(range);
        assert(uid);

        if (*uid == 0)
                return -EBUSY;

        candidate = *uid - 1;

        for (size_t i = 0; i < range->n_entries; i++) {
                uid_t begin, end;

                begin = range->entries[i].start;
                end = range->entries[i].start + range->entries[i].nr - 1;

                if (candidate >= begin && candidate <= end) {
                        *uid = candidate;
                        return 1;
                }

                if (end < candidate)
                        closest = end;
        }

        if (closest == UID_INVALID)
                return -EBUSY;

        *uid = closest;
        return 1;
}

bool uid_range_covers(const UIDRange *range, uid_t start, uid_t nr) {
        if (nr == 0) /* empty range? always covered... */
                return true;

        if (start > UINT32_MAX - nr) /* range overflows? definitely not covered... */
                return false;

        if (!range)
                return false;

        FOREACH_ARRAY(i, range->entries, range->n_entries)
                if (start >= i->start &&
                    start + nr <= i->start + i->nr)
                        return true;

        return false;
}

int uid_map_read_one(FILE *f, uid_t *ret_base, uid_t *ret_shift, uid_t *ret_range) {
        uid_t uid_base, uid_shift, uid_range;
        int r;

        assert(f);

        errno = 0;
        r = fscanf(f, UID_FMT " " UID_FMT " " UID_FMT "\n", &uid_base, &uid_shift, &uid_range);
        if (r == EOF)
                return errno_or_else(ENOMSG);
        assert(r >= 0);
        if (r != 3)
                return -EBADMSG;
        if (uid_range <= 0)
                return -EBADMSG;

        if (ret_base)
                *ret_base = uid_base;
        if (ret_shift)
                *ret_shift = uid_shift;
        if (ret_range)
                *ret_range = uid_range;

        return 0;
}

unsigned uid_range_size(const UIDRange *range) {
        if (!range)
                return 0;

        unsigned n = 0;

        FOREACH_ARRAY(e, range->entries, range->n_entries)
                n += e->nr;

        return n;
}

bool uid_range_is_empty(const UIDRange *range) {

        if (!range)
                return true;

        FOREACH_ARRAY(e, range->entries, range->n_entries)
                if (e->nr > 0)
                        return false;

        return true;
}

int uid_range_load_userns_full(const char *path, UIDRangeUsernsMode mode, bool coalesce, UIDRange **ret) {
        _cleanup_(uid_range_freep) UIDRange *range = NULL;
        _cleanup_fclose_ FILE *f = NULL;
        int r;

        /* If 'path' is NULL loads the UID range of the userns namespace we run. Otherwise load the data from
         * the specified file (which can be either uid_map or gid_map, in case caller needs to deal with GID
         * maps).
         *
         * To simplify things this will modify the passed array in case of later failure. */

        assert(mode >= 0);
        assert(mode < _UID_RANGE_USERNS_MODE_MAX);
        assert(ret);

        if (!path)
                path = IN_SET(mode, UID_RANGE_USERNS_INSIDE, UID_RANGE_USERNS_OUTSIDE) ? "/proc/self/uid_map" : "/proc/self/gid_map";

        f = fopen(path, "re");
        if (!f) {
                r = -errno;

                if (r == -ENOENT && path_startswith(path, "/proc/"))
                        return proc_mounted() > 0 ? -EOPNOTSUPP : -ENOSYS;

                return r;
        }

        range = new0(UIDRange, 1);
        if (!range)
                return -ENOMEM;

        for (;;) {
                uid_t uid_base, uid_shift, uid_range;

                r = uid_map_read_one(f, &uid_base, &uid_shift, &uid_range);
                if (r == -ENOMSG)
                        break;
                if (r < 0)
                        return r;

                r = uid_range_add_internal(
                                &range,
                                IN_SET(mode, UID_RANGE_USERNS_INSIDE, GID_RANGE_USERNS_INSIDE) ? uid_base : uid_shift,
                                uid_range,
                                /* coalesce= */ false);
                if (r < 0)
                        return r;
        }

        if (coalesce)
                uid_range_coalesce(range);

        *ret = TAKE_PTR(range);
        return 0;
}

int uid_range_load_userns_by_fd_full(int userns_fd, UIDRangeUsernsMode mode, bool coalesce, UIDRange **ret) {
        _cleanup_(pidref_done_sigkill_wait) PidRef pidref = PIDREF_NULL;
        int r;

        assert(userns_fd >= 0);
        assert(mode >= 0);
        assert(mode < _UID_RANGE_USERNS_MODE_MAX);
        assert(ret);

        r = is_our_namespace(userns_fd, NAMESPACE_USER);
        if (r < 0)
                return r;
        if (r > 0)
                return uid_range_load_userns_full(/* path= */ NULL, mode, coalesce, ret);

        r = userns_enter_and_pin(userns_fd, &pidref);
        if (r < 0)
                return r;

        const char *p = procfs_file_alloca(
                        pidref.pid,
                        IN_SET(mode, UID_RANGE_USERNS_INSIDE, UID_RANGE_USERNS_OUTSIDE) ? "uid_map" : "gid_map");

        return uid_range_load_userns_full(p, mode, coalesce, ret);
}

bool uid_range_overlaps(const UIDRange *range, uid_t start, uid_t nr) {

        if (!range)
                return false;

        /* Avoid overflow */
        if (start > UINT32_MAX - nr)
                nr = UINT32_MAX - start;

        if (nr == 0)
                return false;

        FOREACH_ARRAY(entry, range->entries, range->n_entries)
                if (start < entry->start + entry->nr &&
                    start + nr >= entry->start)
                        return true;

        return false;
}

int uid_range_clip(UIDRange *range, uid_t min, uid_t max) {
        assert(range);

        if (min > max)
                return -EINVAL;

        size_t t = 0;
        FOREACH_ARRAY(e, range->entries, range->n_entries) {
                uid_t entry_end = e->start + e->nr; /* one past the last UID in entry */

                /* Skip entries completely outside [min, max] */
                if (entry_end <= min || e->start > max)
                        continue;

                /* Trim the entry to fit within [min, max] */
                uid_t new_start = MAX(e->start, min);
                /* entry_end is exclusive, avoid overflow when max == UINT32_MAX */
                uid_t new_end = entry_end <= max ? entry_end : max + 1;
                assert(new_end > new_start);

                range->entries[t++] = (UIDRangeEntry) {
                        .start = new_start,
                        .nr = new_end - new_start,
                };
        }

        range->n_entries = t;

        return 0;
}

int uid_range_partition(UIDRange *range, uid_t size) {
        assert(range);
        assert(size > 0);

        /* Partitions the UID range entries into buckets of the given size. Any entry larger than the given
         * size will be partitioned into multiple entries, each of the given size. Any leftover UIDs in the
         * entry are dropped. Any entries smaller than the given size are also dropped. */

        /* Count how many entries we'll need after partitioning */
        size_t n_new_entries = 0;
        FOREACH_ARRAY(e, range->entries, range->n_entries)
                n_new_entries += e->nr / size;

        if (n_new_entries == 0) {
                range->n_entries = 0;
                return 0;
        }

        if (n_new_entries > range->n_entries && !GREEDY_REALLOC(range->entries, n_new_entries))
                return -ENOMEM;

        /* Work backwards to avoid overwriting entries we still need to read */
        size_t t = n_new_entries;
        for (size_t i = range->n_entries; i > 0; i--) {
                UIDRangeEntry *e = range->entries + i - 1;
                unsigned n_parts = e->nr / size;

                for (unsigned j = n_parts; j > 0; j--)
                        range->entries[--t] = (UIDRangeEntry) {
                                .start = e->start + (j - 1) * size,
                                .nr = size,
                        };
        }

        range->n_entries = n_new_entries;

        return 0;
}

int uid_range_copy(const UIDRange *range, UIDRange **ret) {
        assert(ret);

        if (!range) {
                *ret = NULL;
                return 0;
        }

        _cleanup_(uid_range_freep) UIDRange *copy = new0(UIDRange, 1);
        if (!copy)
                return -ENOMEM;

        if (range->n_entries > 0) {
                copy->entries = newdup(UIDRangeEntry, range->entries, range->n_entries);
                if (!copy->entries)
                        return -ENOMEM;

                copy->n_entries = range->n_entries;
        }

        *ret = TAKE_PTR(copy);
        return 0;
}

int uid_range_remove(UIDRange *range, uid_t start, uid_t size) {
        assert(range);

        if (size == 0)
                return 0;

        uid_t end = start + size; /* one past the last UID to remove */

        for (size_t i = 0; i < range->n_entries; i++) {
                UIDRangeEntry *e = range->entries + i;
                uid_t entry_end = e->start + e->nr;

                /* No overlap */
                if (entry_end <= start || e->start >= end)
                        continue;

                /* Check if this removal splits the entry into two parts */
                if (e->start < start && entry_end > end) {
                        /* Need to split: grow the array first */
                        if (!GREEDY_REALLOC(range->entries, range->n_entries + 1))
                                return -ENOMEM;

                        /* Re-fetch pointer after potential realloc */
                        e = range->entries + i;
                        entry_end = e->start + e->nr;

                        /* Shift everything after this entry to make room */
                        memmove(range->entries + i + 2, range->entries + i + 1,
                                (range->n_entries - i - 1) * sizeof(UIDRangeEntry));
                        range->n_entries++;

                        /* First part: before the removed range */
                        range->entries[i] = (UIDRangeEntry) {
                                .start = e->start,
                                .nr = start - e->start,
                        };

                        /* Second part: after the removed range */
                        range->entries[i + 1] = (UIDRangeEntry) {
                                .start = end,
                                .nr = entry_end - end,
                        };

                        /* Skip the newly inserted entry */
                        i++;
                        continue;
                }

                /* Removal covers the entire entry */
                if (start <= e->start && end >= entry_end) {
                        memmove(e, e + 1, (range->n_entries - i - 1) * sizeof(UIDRangeEntry));
                        range->n_entries--;
                        i--;
                        continue;
                }

                /* Removal trims the start of the entry */
                if (start <= e->start && end > e->start) {
                        e->nr = entry_end - end;
                        e->start = end;
                        continue;
                }

                /* Removal trims the end of the entry */
                if (start < entry_end && end >= entry_end) {
                        e->nr = start - e->start;
                        continue;
                }
        }

        return 0;
}

int uid_range_translate(const UIDRange *outside, const UIDRange *inside, uid_t uid, uid_t *ret) {
        assert(uid_range_entries(outside) == uid_range_entries(inside));
        assert(ret);

        /* Given two UID ranges that represent the outside UID range of a user namespace (the 2nd and 3rd
         * columns in /proc/xxx/uid_map) and the inside UID range of a user namespace (the 1st and 3rd
         * columns in /proc/xxx/uid_map), translates the given UID from the outside range to the inside
         * range. For example, given the following UID range:
         *
         * 0 1000 1
         *
         * calling uid_range_translate(outside, inside, 1000) will return 0 as the output UID. Alternatively,
         * calling uid_range_translate(inside, outside, 0) will return 1000 as the output UID.
         */

        for (size_t i = 0; i < uid_range_entries(outside); i++)
                assert(outside->entries[i].nr == inside->entries[i].nr);

        for (size_t i = 0; i < uid_range_entries(outside); i++) {
                const UIDRangeEntry *e = outside->entries + i;

                if (uid < e->start || uid >= e->start + e->nr)
                        continue;

                *ret = inside->entries[i].start + uid - e->start;
                return 0;
        }

        return -ESRCH;
}

int uid_range_translate_userns_fd(int userns_fd, UIDRangeUsernsMode mode, uid_t uid, uid_t *ret) {
        int r;

        assert(userns_fd >= 0);
        assert(IN_SET(mode, UID_RANGE_USERNS_OUTSIDE, GID_RANGE_USERNS_OUTSIDE));

        _cleanup_(uid_range_freep) UIDRange *outside_range = NULL;
        r = uid_range_load_userns_by_fd_full(userns_fd, mode, /* coalesce= */ false, &outside_range);
        if (r < 0)
                return r;

        mode = mode == UID_RANGE_USERNS_OUTSIDE ? UID_RANGE_USERNS_INSIDE : GID_RANGE_USERNS_INSIDE;

        _cleanup_(uid_range_freep) UIDRange *inside_range = NULL;
        r = uid_range_load_userns_by_fd_full(userns_fd, mode, /* coalesce= */ false, &inside_range);
        if (r < 0)
                return r;

        return uid_range_translate(outside_range, inside_range, uid, ret);
}

bool uid_range_equal(const UIDRange *a, const UIDRange *b) {
        if (a == b)
                return true;

        if (!a || !b)
                return false;

        if (a->n_entries != b->n_entries)
                return false;

        for (size_t i = 0; i < a->n_entries; i++) {
                if (a->entries[i].start != b->entries[i].start)
                        return false;
                if (a->entries[i].nr != b->entries[i].nr)
                        return false;
        }

        return true;
}

int uid_map_search_root(pid_t pid, UIDRangeUsernsMode mode, uid_t *ret) {
        int r;

        assert(pid_is_valid(pid));
        assert(IN_SET(mode, UID_RANGE_USERNS_OUTSIDE, GID_RANGE_USERNS_OUTSIDE));

        const char *p = procfs_file_alloca(pid, mode == UID_RANGE_USERNS_OUTSIDE ? "uid_map" : "gid_map");
        _cleanup_fclose_ FILE *f = fopen(p, "re");
        if (!f) {
                if (errno != ENOENT)
                        return -errno;

                r = proc_mounted();
                if (r < 0)
                        return -ENOENT; /* original error, if we can't determine /proc/ state */

                return r ? -ENOPKG : -ENOSYS;
        }

        for (;;) {
                uid_t uid_base = UID_INVALID, uid_shift = UID_INVALID;

                r = uid_map_read_one(f, &uid_base, &uid_shift, /* ret_range= */ NULL);
                if (r < 0)
                        return r;

                if (uid_base == 0) {
                        if (ret)
                                *ret = uid_shift;
                        return 0;
                }
        }
}

uid_t uid_range_base(const UIDRange *range) {

        /* Returns the lowest UID in the range (notw that elements are sorted, hence we just need to look at
         * the first one that is populated. */

        if (uid_range_is_empty(range))
                return UID_INVALID;

        FOREACH_ARRAY(e, range->entries, range->n_entries)
                if (e->nr > 0)
                        return e->start;

        return UID_INVALID;
}

1	/* SPDX-License-Identifier: LGPL-2.1-or-later */
2
3	#include <sched.h>
4	#include <string.h>
5
6	#include "alloc-util.h"
7	#include "errno-util.h"
8	#include "fd-util.h"
9	#include "format-util.h"
10	#include "namespace-util.h"
11	#include "path-util.h"
12	#include "pidref.h"
13	#include "process-util.h"
14	#include "sort-util.h"
15	#include "stat-util.h"
16	#include "uid-range.h"
17	#include "user-util.h"
18
19	UIDRange uid_range_free(UIDRange range) {	3,969✔
20	if (!range)	3,969✔
21	return NULL;
22
23	free(range->entries);	1,210✔
24	return mfree(range);	1,210✔
25	}
26
27	static bool uid_range_entry_intersect(const UIDRangeEntry a, const UIDRangeEntry b) {	108✔
28	assert(a);	108✔
29	assert(b);	108✔
30
31	return a->start <= b->start + b->nr && a->start + a->nr >= b->start;	108✔
32	}
33
34	static int uid_range_entry_compare(const UIDRangeEntry a, const UIDRangeEntry b) {	298✔
35	int r;	298✔
36
37	assert(a);	298✔
38	assert(b);	298✔
39
40	r = CMP(a->start, b->start);	298✔
41	if (r != 0)	141✔
42	return r;	278✔
43
44	return CMP(a->nr, b->nr);	20✔
45	}
46
47	static void uid_range_coalesce(UIDRange *range) {	760✔
48	assert(range);	760✔
49
50	if (range->n_entries <= 0)	760✔
51	return;
52
53	typesafe_qsort(range->entries, range->n_entries, uid_range_entry_compare);	402✔
54
55	for (size_t i = 0; i < range->n_entries; i++) {	824✔
56	UIDRangeEntry *x = range->entries + i;	422✔
57
58	for (size_t j = i + 1; j < range->n_entries; j++) {	510✔
59	UIDRangeEntry *y = range->entries + j;	108✔
60	uid_t begin, end;	108✔
61
62	if (!uid_range_entry_intersect(x, y))	108✔
63	break;
64
65	begin = MIN(x->start, y->start);	88✔
66	end = MAX(x->start + x->nr, y->start + y->nr);	88✔
67
68	x->start = begin;	88✔
69	x->nr = end - begin;	88✔
70
71	if (range->n_entries > j + 1)	88✔
72	memmove(y, y + 1, sizeof(UIDRangeEntry) * (range->n_entries - j - 1));	81✔
73
74	range->n_entries--;	88✔
75	j--;	88✔
76	}
77	}
78	}
79
80	int uid_range_add_internal(UIDRange **range, uid_t start, uid_t nr, bool coalesce) {	868✔
81	_cleanup_(uid_range_freep) UIDRange *range_new = NULL;	868✔
82	UIDRange *p;	868✔
83
84	assert(range);	868✔
85
86	if (nr <= 0)	868✔
87	return 0;
88
89	if (start > UINT32_MAX - nr) /* overflow check */	868✔
90	return -ERANGE;
91
92	if (*range)	868✔
93	p = *range;
94	else {
95	range_new = new0(UIDRange, 1);	139✔
96	if (!range_new)	139✔
97	return -ENOMEM;
98
99	p = range_new;
100	}
101
102	if (!GREEDY_REALLOC(p->entries, p->n_entries + 1))	868✔
103	return -ENOMEM;
104
105	p->entries[p->n_entries++] = (UIDRangeEntry) {	868✔
106	.start = start,
107	.nr = nr,
108	};
109
110	if (coalesce)	868✔
111	uid_range_coalesce(p);	151✔
112
113	TAKE_PTR(range_new);	868✔
114	*range = p;	868✔
115
116	return 0;	868✔
117	}
118
119	int uid_range_add_str_full(UIDRange *range, const char s, bool coalesce) {	40✔
120	uid_t start, end;	40✔
121	int r;	40✔
122
123	assert(range);	40✔
124	assert(s);	40✔
125
126	r = parse_uid_range(s, &start, &end);	40✔
127	if (r < 0)	40✔
128	return r;	40✔
129
130	return uid_range_add_internal(range, start, end - start + 1, coalesce);	40✔
131	}
132
133	int uid_range_next_lower(const UIDRange range, uid_t uid) {	229✔
134	uid_t closest = UID_INVALID, candidate;	229✔
135
136	assert(range);	229✔
137	assert(uid);	229✔
138
139	if (*uid == 0)	229✔
140	return -EBUSY;
141
142	candidate = *uid - 1;	229✔
143
144	for (size_t i = 0; i < range->n_entries; i++) {	276✔
145	uid_t begin, end;	229✔
146
147	begin = range->entries[i].start;	229✔
148	end = range->entries[i].start + range->entries[i].nr - 1;	229✔
149
150	if (candidate >= begin && candidate <= end) {	229✔
151	*uid = candidate;	182✔
152	return 1;	182✔
153	}
154
155	if (end < candidate)	47✔
156	closest = end;	46✔
157	}
158
159	if (closest == UID_INVALID)	47✔
160	return -EBUSY;
161
162	*uid = closest;	46✔
163	return 1;	46✔
164	}
165
166	bool uid_range_covers(const UIDRange *range, uid_t start, uid_t nr) {	237✔
167	if (nr == 0) /* empty range? always covered... */	237✔
168	return true;
169
170	if (start > UINT32_MAX - nr) /* range overflows? definitely not covered... */	236✔
171	return false;
172
173	if (!range)	233✔
174	return false;
175
176	FOREACH_ARRAY(i, range->entries, range->n_entries)	249✔
177	if (start >= i->start &&	237✔
178	start + nr <= i->start + i->nr)	231✔
179	return true;
180
181	return false;
182	}
183
184	int uid_map_read_one(FILE f, uid_t ret_base, uid_t ret_shift, uid_t ret_range) {	1,854✔
185	uid_t uid_base, uid_shift, uid_range;	1,854✔
186	int r;	1,854✔
187
188	assert(f);	1,854✔
189
190	errno = 0;	1,854✔
191	r = fscanf(f, UID_FMT " " UID_FMT " " UID_FMT "\n", &uid_base, &uid_shift, &uid_range);	1,854✔
192	if (r == EOF)	1,854✔
193	return errno_or_else(ENOMSG);	1,044✔
194	assert(r >= 0);	810✔
195	if (r != 3)	810✔
196	return -EBADMSG;
197	if (uid_range <= 0)	810✔
198	return -EBADMSG;
199
200	if (ret_base)	810✔
201	*ret_base = uid_base;	810✔
202	if (ret_shift)	810✔
203	*ret_shift = uid_shift;	810✔
204	if (ret_range)	810✔
205	*ret_range = uid_range;	748✔
206
207	return 0;
208	}
209
210	unsigned uid_range_size(const UIDRange *range) {	7✔
211	if (!range)	7✔
212	return 0;
213
214	unsigned n = 0;	6✔
215
216	FOREACH_ARRAY(e, range->entries, range->n_entries)	16✔
217	n += e->nr;	10✔
218
219	return n;
220	}
221
222	bool uid_range_is_empty(const UIDRange *range) {	566✔
223
224	if (!range)	566✔
225	return true;
226
227	FOREACH_ARRAY(e, range->entries, range->n_entries)	564✔
228	if (e->nr > 0)	201✔
229	return false;
230
231	return true;
232	}
233
234	int uid_range_load_userns_full(const char path, UIDRangeUsernsMode mode, bool coalesce, UIDRange *ret) {	973✔
235	_cleanup_(uid_range_freep) UIDRange *range = NULL;	×
236	_cleanup_fclose_ FILE *f = NULL;	973✔
237	int r;	973✔
238
239	/* If 'path' is NULL loads the UID range of the userns namespace we run. Otherwise load the data from
240	* the specified file (which can be either uid_map or gid_map, in case caller needs to deal with GID
241	* maps).
242	*
243	* To simplify things this will modify the passed array in case of later failure. */
244
245	assert(mode >= 0);	973✔
246	assert(mode < _UID_RANGE_USERNS_MODE_MAX);	973✔
247	assert(ret);	973✔
248
249	if (!path)	973✔
250	path = IN_SET(mode, UID_RANGE_USERNS_INSIDE, UID_RANGE_USERNS_OUTSIDE) ? "/proc/self/uid_map" : "/proc/self/gid_map";	601✔
251
252	f = fopen(path, "re");	973✔
253	if (!f) {	973✔
254	r = -errno;	×
255
256	if (r == -ENOENT && path_startswith(path, "/proc/"))	×
257	return proc_mounted() > 0 ? -EOPNOTSUPP : -ENOSYS;	×
258
259	return r;
260	}
261
262	range = new0(UIDRange, 1);	973✔
263	if (!range)	973✔
264	return -ENOMEM;
265
266	for (;;) {	631✔
267	uid_t uid_base, uid_shift, uid_range;	1,604✔
268
269	r = uid_map_read_one(f, &uid_base, &uid_shift, &uid_range);	1,604✔
270	if (r == -ENOMSG)	1,604✔
271	break;
272	if (r < 0)	631✔
273	return r;	×
274
275	r = uid_range_add_internal(	631✔
276	&range,
277	IN_SET(mode, UID_RANGE_USERNS_INSIDE, GID_RANGE_USERNS_INSIDE) ? uid_base : uid_shift,	631✔
278	uid_range,
279	/* coalesce= */ false);
280	if (r < 0)	631✔
281	return r;
282	}
283
284	if (coalesce)	973✔
285	uid_range_coalesce(range);	609✔
286
287	*ret = TAKE_PTR(range);	973✔
288	return 0;	973✔
289	}
290
291	int uid_range_load_userns_by_fd_full(int userns_fd, UIDRangeUsernsMode mode, bool coalesce, UIDRange **ret) {	820✔
292	_cleanup_(pidref_done_sigkill_wait) PidRef pidref = PIDREF_NULL;	820✔
293	int r;	820✔
294
295	assert(userns_fd >= 0);	820✔
296	assert(mode >= 0);	820✔
297	assert(mode < _UID_RANGE_USERNS_MODE_MAX);	820✔
298	assert(ret);	820✔
299
300	r = is_our_namespace(userns_fd, NAMESPACE_USER);	820✔
301	if (r < 0)	820✔
302	return r;
303	if (r > 0)	820✔
304	return uid_range_load_userns_full(/* path= */ NULL, mode, coalesce, ret);	449✔
305
306	r = userns_enter_and_pin(userns_fd, &pidref);	371✔
307	if (r < 0)	371✔
308	return r;
309
310	const char *p = procfs_file_alloca(	371✔
311	pidref.pid,
312	IN_SET(mode, UID_RANGE_USERNS_INSIDE, UID_RANGE_USERNS_OUTSIDE) ? "uid_map" : "gid_map");
313
314	return uid_range_load_userns_full(p, mode, coalesce, ret);	371✔
315	}
316
317	bool uid_range_overlaps(const UIDRange *range, uid_t start, uid_t nr) {	×
318
319	if (!range)	×
320	return false;
321
322	/* Avoid overflow */
323	if (start > UINT32_MAX - nr)	×
324	nr = UINT32_MAX - start;	×
325
326	if (nr == 0)	×
327	return false;
328
329	FOREACH_ARRAY(entry, range->entries, range->n_entries)	×
330	if (start < entry->start + entry->nr &&	×
331	start + nr >= entry->start)	×
332	return true;
333
334	return false;
335	}
336
337	int uid_range_clip(UIDRange *range, uid_t min, uid_t max) {	102✔
338	assert(range);	102✔
339
340	if (min > max)	102✔
341	return -EINVAL;
342
343	size_t t = 0;	101✔
344	FOREACH_ARRAY(e, range->entries, range->n_entries) {	219✔
345	uid_t entry_end = e->start + e->nr; /* one past the last UID in entry */	118✔
346
347	/* Skip entries completely outside [min, max] */
348	if (entry_end <= min \|\| e->start > max)	118✔
349	continue;	6✔
350
351	/* Trim the entry to fit within [min, max] */
352	uid_t new_start = MAX(e->start, min);	112✔
353	/* entry_end is exclusive, avoid overflow when max == UINT32_MAX */
354	uid_t new_end = entry_end <= max ? entry_end : max + 1;	112✔
355	assert(new_end > new_start);	112✔
356
357	range->entries[t++] = (UIDRangeEntry) {	112✔
358	.start = new_start,
359	.nr = new_end - new_start,	112✔
360	};
361	}
362
363	range->n_entries = t;	101✔
364
365	return 0;	101✔
366	}
367
368	int uid_range_partition(UIDRange *range, uid_t size) {	100✔
369	assert(range);	100✔
370	assert(size > 0);	100✔
371
372	/* Partitions the UID range entries into buckets of the given size. Any entry larger than the given
373	* size will be partitioned into multiple entries, each of the given size. Any leftover UIDs in the
374	* entry are dropped. Any entries smaller than the given size are also dropped. */
375
376	/* Count how many entries we'll need after partitioning */
377	size_t n_new_entries = 0;	100✔
378	FOREACH_ARRAY(e, range->entries, range->n_entries)	210✔
379	n_new_entries += e->nr / size;	110✔
380
381	if (n_new_entries == 0) {	100✔
382	range->n_entries = 0;	1✔
383	return 0;	1✔
384	}
385
386	if (n_new_entries > range->n_entries && !GREEDY_REALLOC(range->entries, n_new_entries))	99✔
387	return -ENOMEM;
388
389	/* Work backwards to avoid overwriting entries we still need to read */
390	size_t t = n_new_entries;	99✔
391	for (size_t i = range->n_entries; i > 0; i--) {	208✔
392	UIDRangeEntry *e = range->entries + i - 1;	109✔
393	unsigned n_parts = e->nr / size;	109✔
394
395	for (unsigned j = n_parts; j > 0; j--)	2,637,118✔
396	range->entries[--t] = (UIDRangeEntry) {	2,637,009✔
397	.start = e->start + (j - 1) * size,	2,637,009✔
398	.nr = size,
399	};
400	}
401
402	range->n_entries = n_new_entries;	99✔
403
404	return 0;	99✔
405	}
406
407	int uid_range_copy(const UIDRange range, UIDRange *ret) {	98✔
408	assert(ret);	98✔
409
410	if (!range) {	98✔
411	*ret = NULL;	1✔
412	return 0;	98✔
413	}
414
415	_cleanup_(uid_range_freep) UIDRange *copy = new0(UIDRange, 1);	97✔
416	if (!copy)	97✔
417	return -ENOMEM;
418
419	if (range->n_entries > 0) {	97✔
420	copy->entries = newdup(UIDRangeEntry, range->entries, range->n_entries);	96✔
421	if (!copy->entries)	96✔
422	return -ENOMEM;
423
424	copy->n_entries = range->n_entries;	96✔
425	}
426
427	*ret = TAKE_PTR(copy);	97✔
428	return 0;	97✔
429	}
430
431	int uid_range_remove(UIDRange *range, uid_t start, uid_t size) {	104✔
432	assert(range);	104✔
433
434	if (size == 0)	104✔
435	return 0;
436
437	uid_t end = start + size; /* one past the last UID to remove */	103✔
438
439	for (size_t i = 0; i < range->n_entries; i++) {	220✔
440	UIDRangeEntry *e = range->entries + i;	117✔
441	uid_t entry_end = e->start + e->nr;	117✔
442
443	/* No overlap */
444	if (entry_end <= start \|\| e->start >= end)	117✔
445	continue;	14✔
446
447	/* Check if this removal splits the entry into two parts */
448	if (e->start < start && entry_end > end) {	103✔
449	/* Need to split: grow the array first */
450	if (!GREEDY_REALLOC(range->entries, range->n_entries + 1))	93✔
451	return -ENOMEM;
452
453	/* Re-fetch pointer after potential realloc */
454	e = range->entries + i;	93✔
455	entry_end = e->start + e->nr;	93✔
456
457	/* Shift everything after this entry to make room */
458	memmove(range->entries + i + 2, range->entries + i + 1,	93✔
459	(range->n_entries - i - 1) * sizeof(UIDRangeEntry));	93✔
460	range->n_entries++;	93✔
461
462	/* First part: before the removed range */
463	range->entries[i] = (UIDRangeEntry) {	93✔
464	.start = e->start,	93✔
465	.nr = start - e->start,	93✔
466	};
467
468	/* Second part: after the removed range */
469	range->entries[i + 1] = (UIDRangeEntry) {	93✔
470	.start = end,
471	.nr = entry_end - end,	93✔
472	};
473
474	/* Skip the newly inserted entry */
475	i++;	93✔
476	continue;	93✔
477	}
478
479	/* Removal covers the entire entry */
480	if (start <= e->start && end >= entry_end) {	10✔
481	memmove(e, e + 1, (range->n_entries - i - 1) * sizeof(UIDRangeEntry));	6✔
482	range->n_entries--;	6✔
483	i--;	6✔
484	continue;	6✔
485	}
486
487	/* Removal trims the start of the entry */
488	if (start <= e->start && end > e->start) {	4✔
489	e->nr = entry_end - end;	2✔
490	e->start = end;	2✔
491	continue;	2✔
492	}
493
494	/* Removal trims the end of the entry */
495	if (start < entry_end && end >= entry_end) {	2✔
496	e->nr = start - e->start;	2✔
497	continue;	2✔
498	}
499	}
500
501	return 0;
502	}
503
504	int uid_range_translate(const UIDRange outside, const UIDRange inside, uid_t uid, uid_t *ret) {	224✔
505	assert(uid_range_entries(outside) == uid_range_entries(inside));	672✔
506	assert(ret);	224✔
507
508	/* Given two UID ranges that represent the outside UID range of a user namespace (the 2nd and 3rd
509	* columns in /proc/xxx/uid_map) and the inside UID range of a user namespace (the 1st and 3rd
510	* columns in /proc/xxx/uid_map), translates the given UID from the outside range to the inside
511	* range. For example, given the following UID range:
512	*
513	* 0 1000 1
514	*
515	* calling uid_range_translate(outside, inside, 1000) will return 0 as the output UID. Alternatively,
516	* calling uid_range_translate(inside, outside, 0) will return 1000 as the output UID.
517	*/
518
519	for (size_t i = 0; i < uid_range_entries(outside); i++)	484✔
520	assert(outside->entries[i].nr == inside->entries[i].nr);	260✔
521
522	for (size_t i = 0; i < uid_range_entries(outside); i++) {	260✔
523	const UIDRangeEntry *e = outside->entries + i;	250✔
524
525	if (uid < e->start \|\| uid >= e->start + e->nr)	250✔
526	continue;	36✔
527
528	*ret = inside->entries[i].start + uid - e->start;	214✔
529	return 0;	214✔
530	}
531
532	return -ESRCH;
533	}
534
535	int uid_range_translate_userns_fd(int userns_fd, UIDRangeUsernsMode mode, uid_t uid, uid_t *ret) {	2✔
536	int r;	2✔
537
538	assert(userns_fd >= 0);	2✔
539	assert(IN_SET(mode, UID_RANGE_USERNS_OUTSIDE, GID_RANGE_USERNS_OUTSIDE));	2✔
540
541	_cleanup_(uid_range_freep) UIDRange *outside_range = NULL;	2✔
542	r = uid_range_load_userns_by_fd_full(userns_fd, mode, /* coalesce= */ false, &outside_range);	2✔
543	if (r < 0)	2✔
544	return r;
545
546	mode = mode == UID_RANGE_USERNS_OUTSIDE ? UID_RANGE_USERNS_INSIDE : GID_RANGE_USERNS_INSIDE;	2✔
547
548	_cleanup_(uid_range_freep) UIDRange *inside_range = NULL;	2✔
549	r = uid_range_load_userns_by_fd_full(userns_fd, mode, /* coalesce= */ false, &inside_range);	2✔
550	if (r < 0)	2✔
551	return r;
552
553	return uid_range_translate(outside_range, inside_range, uid, ret);	2✔
554	}
555
556	bool uid_range_equal(const UIDRange a, const UIDRange b) {	6✔
557	if (a == b)	6✔
558	return true;
559
560	if (!a \|\| !b)	6✔
561	return false;
562
563	if (a->n_entries != b->n_entries)	5✔
564	return false;
565
566	for (size_t i = 0; i < a->n_entries; i++) {	8✔
567	if (a->entries[i].start != b->entries[i].start)	5✔
568	return false;
569	if (a->entries[i].nr != b->entries[i].nr)	5✔
570	return false;
571	}
572
573	return true;
574	}
575
576	int uid_map_search_root(pid_t pid, UIDRangeUsernsMode mode, uid_t *ret) {	63✔
577	int r;	63✔
578
579	assert(pid_is_valid(pid));	63✔
580	assert(IN_SET(mode, UID_RANGE_USERNS_OUTSIDE, GID_RANGE_USERNS_OUTSIDE));	63✔
581
582	const char *p = procfs_file_alloca(pid, mode == UID_RANGE_USERNS_OUTSIDE ? "uid_map" : "gid_map");	63✔
583	_cleanup_fclose_ FILE *f = fopen(p, "re");	126✔
584	if (!f) {	63✔
585	if (errno != ENOENT)	×
586	return -errno;	×
587
588	r = proc_mounted();	×
589	if (r < 0)	×
590	return -ENOENT; /* original error, if we can't determine /proc/ state */
591
592	return r ? -ENOPKG : -ENOSYS;	×
593	}
594
595	for (;;) {	×
596	uid_t uid_base = UID_INVALID, uid_shift = UID_INVALID;	63✔
597
598	r = uid_map_read_one(f, &uid_base, &uid_shift, /* ret_range= */ NULL);	63✔
599	if (r < 0)	63✔
600	return r;	63✔
601
602	if (uid_base == 0) {	62✔
603	if (ret)	62✔
604	*ret = uid_shift;	62✔
605	return 0;	62✔
606	}
607	}
608	}
609
610	uid_t uid_range_base(const UIDRange *range) {	8✔
611
612	/* Returns the lowest UID in the range (notw that elements are sorted, hence we just need to look at
613	* the first one that is populated. */
614
615	if (uid_range_is_empty(range))	8✔
616	return UID_INVALID;
617
618	FOREACH_ARRAY(e, range->entries, range->n_entries)	8✔
619	if (e->nr > 0)	8✔
620	return e->start;	8✔
621
622	return UID_INVALID;
623	}

systemd / systemd / 22508817992

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous