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