udev: String substitutions can be done in ENV, too
[systemd_ALT.git] / src / core / dynamic-user.c
blobe99a6694f6f6f34ca65798614fb03b9677d0c18d
1 /* SPDX-License-Identifier: LGPL-2.1-or-later */
3 #include <sys/file.h>
4 #include <sys/stat.h>
5 #include <sys/types.h>
7 #include "clean-ipc.h"
8 #include "dynamic-user.h"
9 #include "fd-util.h"
10 #include "fileio.h"
11 #include "format-util.h"
12 #include "fs-util.h"
13 #include "io-util.h"
14 #include "lock-util.h"
15 #include "nscd-flush.h"
16 #include "parse-util.h"
17 #include "random-util.h"
18 #include "serialize.h"
19 #include "socket-util.h"
20 #include "stdio-util.h"
21 #include "string-util.h"
22 #include "strv.h"
23 #include "uid-alloc-range.h"
24 #include "user-util.h"
26 /* Takes a value generated randomly or by hashing and turns it into a UID in the right range */
27 #define UID_CLAMP_INTO_RANGE(rnd) (((uid_t) (rnd) % (DYNAMIC_UID_MAX - DYNAMIC_UID_MIN + 1)) + DYNAMIC_UID_MIN)
29 DEFINE_PRIVATE_TRIVIAL_REF_FUNC(DynamicUser, dynamic_user);
31 static DynamicUser* dynamic_user_free(DynamicUser *d) {
32 if (!d)
33 return NULL;
35 if (d->manager)
36 (void) hashmap_remove(d->manager->dynamic_users, d->name);
38 safe_close_pair(d->storage_socket);
39 return mfree(d);
42 static int dynamic_user_add(Manager *m, const char *name, int storage_socket[static 2], DynamicUser **ret) {
43 DynamicUser *d;
44 int r;
46 assert(m);
47 assert(name);
48 assert(storage_socket);
50 r = hashmap_ensure_allocated(&m->dynamic_users, &string_hash_ops);
51 if (r < 0)
52 return r;
54 d = malloc0(offsetof(DynamicUser, name) + strlen(name) + 1);
55 if (!d)
56 return -ENOMEM;
58 strcpy(d->name, name);
60 d->storage_socket[0] = storage_socket[0];
61 d->storage_socket[1] = storage_socket[1];
63 r = hashmap_put(m->dynamic_users, d->name, d);
64 if (r < 0) {
65 free(d);
66 return r;
69 d->manager = m;
71 if (ret)
72 *ret = d;
74 return 0;
77 static int dynamic_user_acquire(Manager *m, const char *name, DynamicUser** ret) {
78 _cleanup_close_pair_ int storage_socket[2] = PIPE_EBADF;
79 DynamicUser *d;
80 int r;
82 assert(m);
83 assert(name);
85 /* Return the DynamicUser structure for a specific user name. Note that this won't actually allocate a UID for
86 * it, but just prepare the data structure for it. The UID is allocated only on demand, when it's really
87 * needed, and in the child process we fork off, since allocation involves NSS checks which are not OK to do
88 * from PID 1. To allow the children and PID 1 share information about allocated UIDs we use an anonymous
89 * AF_UNIX/SOCK_DGRAM socket (called the "storage socket") that contains at most one datagram with the
90 * allocated UID number, plus an fd referencing the lock file for the UID
91 * (i.e. /run/systemd/dynamic-uid/$UID). Why involve the socket pair? So that PID 1 and all its children can
92 * share the same storage for the UID and lock fd, simply by inheriting the storage socket fds. The socket pair
93 * may exist in three different states:
95 * a) no datagram stored. This is the initial state. In this case the dynamic user was never realized.
97 * b) a datagram containing a UID stored, but no lock fd attached to it. In this case there was already a
98 * statically assigned UID by the same name, which we are reusing.
100 * c) a datagram containing a UID stored, and a lock fd is attached to it. In this case we allocated a dynamic
101 * UID and locked it in the file system, using the lock fd.
103 * As PID 1 and various children might access the socket pair simultaneously, and pop the datagram or push it
104 * back in any time, we also maintain a lock on the socket pair. Note one peculiarity regarding locking here:
105 * the UID lock on disk is protected via a BSD file lock (i.e. an fd-bound lock), so that the lock is kept in
106 * place as long as there's a reference to the fd open. The lock on the storage socket pair however is a POSIX
107 * file lock (i.e. a process-bound lock), as all users share the same fd of this (after all it is anonymous,
108 * nobody else could get any access to it except via our own fd) and we want to synchronize access between all
109 * processes that have access to it. */
111 d = hashmap_get(m->dynamic_users, name);
112 if (d) {
113 if (ret) {
114 /* We already have a structure for the dynamic user, let's increase the ref count and reuse it */
115 d->n_ref++;
116 *ret = d;
118 return 0;
121 if (!valid_user_group_name(name, VALID_USER_ALLOW_NUMERIC))
122 return -EINVAL;
124 if (socketpair(AF_UNIX, SOCK_DGRAM|SOCK_CLOEXEC, 0, storage_socket) < 0)
125 return -errno;
127 r = dynamic_user_add(m, name, storage_socket, &d);
128 if (r < 0)
129 return r;
131 storage_socket[0] = storage_socket[1] = -EBADF;
133 if (ret) {
134 d->n_ref++;
135 *ret = d;
138 return 1;
141 static int make_uid_symlinks(uid_t uid, const char *name, bool b) {
143 char path1[STRLEN("/run/systemd/dynamic-uid/direct:") + DECIMAL_STR_MAX(uid_t) + 1];
144 const char *path2;
145 int r = 0, k;
147 /* Add direct additional symlinks for direct lookups of dynamic UIDs and their names by userspace code. The
148 * only reason we have this is because dbus-daemon cannot use D-Bus for resolving users and groups (since it
149 * would be its own client then). We hence keep these world-readable symlinks in place, so that the
150 * unprivileged dbus user can read the mappings when it needs them via these symlinks instead of having to go
151 * via the bus. Ideally, we'd use the lock files we keep for this anyway, but we can't since we use BSD locks
152 * on them and as those may be taken by any user with read access we can't make them world-readable. */
154 xsprintf(path1, "/run/systemd/dynamic-uid/direct:" UID_FMT, uid);
155 if (unlink(path1) < 0 && errno != ENOENT)
156 r = -errno;
158 if (b && symlink(name, path1) < 0) {
159 k = log_warning_errno(errno, "Failed to symlink \"%s\": %m", path1);
160 if (r == 0)
161 r = k;
164 path2 = strjoina("/run/systemd/dynamic-uid/direct:", name);
165 if (unlink(path2) < 0 && errno != ENOENT) {
166 k = -errno;
167 if (r == 0)
168 r = k;
171 if (b && symlink(path1 + STRLEN("/run/systemd/dynamic-uid/direct:"), path2) < 0) {
172 k = log_warning_errno(errno, "Failed to symlink \"%s\": %m", path2);
173 if (r == 0)
174 r = k;
177 return r;
180 static int pick_uid(char **suggested_paths, const char *name, uid_t *ret_uid) {
182 /* Find a suitable free UID. We use the following strategy to find a suitable UID:
184 * 1. Initially, we try to read the UID of a number of specified paths. If any of these UIDs works, we use
185 * them. We use in order to increase the chance of UID reuse, if StateDirectory=, CacheDirectory= or
186 * LogsDirectory= are used, as reusing the UID these directories are owned by saves us from having to
187 * recursively chown() them to new users.
189 * 2. If that didn't yield a currently unused UID, we hash the user name, and try to use that. This should be
190 * pretty good, as the use ris by default derived from the unit name, and hence the same service and same
191 * user should usually get the same UID as long as our hashing doesn't clash.
193 * 3. Finally, if that didn't work, we randomly pick UIDs, until we find one that is empty.
195 * Since the dynamic UID space is relatively small we'll stop trying after 100 iterations, giving up. */
197 enum {
198 PHASE_SUGGESTED, /* the first phase, reusing directory ownership UIDs */
199 PHASE_HASHED, /* the second phase, deriving a UID from the username by hashing */
200 PHASE_RANDOM, /* the last phase, randomly picking UIDs */
201 } phase = PHASE_SUGGESTED;
203 static const uint8_t hash_key[] = {
204 0x37, 0x53, 0x7e, 0x31, 0xcf, 0xce, 0x48, 0xf5,
205 0x8a, 0xbb, 0x39, 0x57, 0x8d, 0xd9, 0xec, 0x59
208 unsigned n_tries = 100, current_suggested = 0;
209 int r;
211 (void) mkdir("/run/systemd/dynamic-uid", 0755);
213 for (;;) {
214 char lock_path[STRLEN("/run/systemd/dynamic-uid/") + DECIMAL_STR_MAX(uid_t) + 1];
215 _cleanup_close_ int lock_fd = -EBADF;
216 uid_t candidate;
217 ssize_t l;
219 if (--n_tries <= 0) /* Give up retrying eventually */
220 return -EBUSY;
222 switch (phase) {
224 case PHASE_SUGGESTED: {
225 struct stat st;
227 if (!suggested_paths || !suggested_paths[current_suggested]) {
228 /* We reached the end of the suggested paths list, let's try by hashing the name */
229 phase = PHASE_HASHED;
230 continue;
233 if (stat(suggested_paths[current_suggested++], &st) < 0)
234 continue; /* We can't read the UID of this path, but that doesn't matter, just try the next */
236 candidate = st.st_uid;
237 break;
240 case PHASE_HASHED:
241 /* A static user by this name does not exist yet. Let's find a free ID then, and use that. We
242 * start with a UID generated as hash from the user name. */
243 candidate = UID_CLAMP_INTO_RANGE(siphash24(name, strlen(name), hash_key));
245 /* If this one fails, we should proceed with random tries */
246 phase = PHASE_RANDOM;
247 break;
249 case PHASE_RANDOM:
251 /* Pick another random UID, and see if that works for us. */
252 random_bytes(&candidate, sizeof(candidate));
253 candidate = UID_CLAMP_INTO_RANGE(candidate);
254 break;
256 default:
257 assert_not_reached();
260 /* Make sure whatever we picked here actually is in the right range */
261 if (!uid_is_dynamic(candidate))
262 continue;
264 xsprintf(lock_path, "/run/systemd/dynamic-uid/" UID_FMT, candidate);
266 for (;;) {
267 struct stat st;
269 lock_fd = open(lock_path, O_CREAT|O_RDWR|O_NOFOLLOW|O_CLOEXEC|O_NOCTTY, 0600);
270 if (lock_fd < 0)
271 return -errno;
273 r = flock(lock_fd, LOCK_EX|LOCK_NB); /* Try to get a BSD file lock on the UID lock file */
274 if (r < 0) {
275 if (IN_SET(errno, EBUSY, EAGAIN))
276 goto next; /* already in use */
278 return -errno;
281 if (fstat(lock_fd, &st) < 0)
282 return -errno;
283 if (st.st_nlink > 0)
284 break;
286 /* Oh, bummer, we got the lock, but the file was unlinked between the time we opened it and
287 * got the lock. Close it, and try again. */
288 lock_fd = safe_close(lock_fd);
291 /* Some superficial check whether this UID/GID might already be taken by some static user */
292 if (getpwuid(candidate) ||
293 getgrgid((gid_t) candidate) ||
294 search_ipc(candidate, (gid_t) candidate) != 0) {
295 (void) unlink(lock_path);
296 continue;
299 /* Let's store the user name in the lock file, so that we can use it for looking up the username for a UID */
300 l = pwritev(lock_fd,
301 (struct iovec[2]) {
302 IOVEC_MAKE_STRING(name),
303 IOVEC_MAKE((char[1]) { '\n' }, 1),
304 }, 2, 0);
305 if (l < 0) {
306 r = -errno;
307 (void) unlink(lock_path);
308 return r;
311 (void) ftruncate(lock_fd, l);
312 (void) make_uid_symlinks(candidate, name, true); /* also add direct lookup symlinks */
314 *ret_uid = candidate;
315 return TAKE_FD(lock_fd);
317 next:
322 static int dynamic_user_pop(DynamicUser *d, uid_t *ret_uid, int *ret_lock_fd) {
323 uid_t uid = UID_INVALID;
324 struct iovec iov = IOVEC_MAKE(&uid, sizeof(uid));
325 int lock_fd;
326 ssize_t k;
328 assert(d);
329 assert(ret_uid);
330 assert(ret_lock_fd);
332 /* Read the UID and lock fd that is stored in the storage AF_UNIX socket. This should be called with
333 * the lock on the socket taken. */
335 k = receive_one_fd_iov(d->storage_socket[0], &iov, 1, MSG_DONTWAIT, &lock_fd);
336 if (k < 0)
337 return (int) k;
339 *ret_uid = uid;
340 *ret_lock_fd = lock_fd;
342 return 0;
345 static int dynamic_user_push(DynamicUser *d, uid_t uid, int lock_fd) {
346 struct iovec iov = IOVEC_MAKE(&uid, sizeof(uid));
348 assert(d);
350 /* Store the UID and lock_fd in the storage socket. This should be called with the socket pair lock taken. */
351 return send_one_fd_iov(d->storage_socket[1], lock_fd, &iov, 1, MSG_DONTWAIT);
354 static void unlink_uid_lock(int lock_fd, uid_t uid, const char *name) {
355 char lock_path[STRLEN("/run/systemd/dynamic-uid/") + DECIMAL_STR_MAX(uid_t) + 1];
357 if (lock_fd < 0)
358 return;
360 xsprintf(lock_path, "/run/systemd/dynamic-uid/" UID_FMT, uid);
361 (void) unlink(lock_path);
363 (void) make_uid_symlinks(uid, name, false); /* remove direct lookup symlinks */
366 static int dynamic_user_realize(
367 DynamicUser *d,
368 char **suggested_dirs,
369 uid_t *ret_uid, gid_t *ret_gid,
370 bool is_user) {
372 _cleanup_close_ int uid_lock_fd = -EBADF;
373 _cleanup_close_ int etc_passwd_lock_fd = -EBADF;
374 uid_t num = UID_INVALID; /* a uid if is_user, and a gid otherwise */
375 gid_t gid = GID_INVALID; /* a gid if is_user, ignored otherwise */
376 bool flush_cache = false;
377 int r;
379 assert(d);
380 assert(is_user == !!ret_uid);
381 assert(ret_gid);
383 /* Acquire a UID for the user name. This will allocate a UID for the user name if the user doesn't exist
384 * yet. If it already exists its existing UID/GID will be reused. */
386 r = posix_lock(d->storage_socket[0], LOCK_EX);
387 if (r < 0)
388 return r;
390 CLEANUP_POSIX_UNLOCK(d->storage_socket[0]);
392 r = dynamic_user_pop(d, &num, &uid_lock_fd);
393 if (r < 0) {
394 int new_uid_lock_fd;
395 uid_t new_uid;
397 if (r != -EAGAIN)
398 return r;
400 /* OK, nothing stored yet, let's try to find something useful. While we are working on this release the
401 * lock however, so that nobody else blocks on our NSS lookups. */
402 r = posix_lock(d->storage_socket[0], LOCK_UN);
403 if (r < 0)
404 return r;
406 /* Let's see if a proper, static user or group by this name exists. Try to take the lock on
407 * /etc/passwd, if that fails with EROFS then /etc is read-only. In that case it's fine if we don't
408 * take the lock, given that users can't be added there anyway in this case. */
409 etc_passwd_lock_fd = take_etc_passwd_lock(NULL);
410 if (etc_passwd_lock_fd < 0 && etc_passwd_lock_fd != -EROFS)
411 return etc_passwd_lock_fd;
413 /* First, let's parse this as numeric UID */
414 r = parse_uid(d->name, &num);
415 if (r < 0) {
416 struct passwd *p;
417 struct group *g;
419 if (is_user) {
420 /* OK, this is not a numeric UID. Let's see if there's a user by this name */
421 p = getpwnam(d->name);
422 if (p) {
423 num = p->pw_uid;
424 gid = p->pw_gid;
425 } else {
426 /* if the user does not exist but the group with the same name exists, refuse operation */
427 g = getgrnam(d->name);
428 if (g)
429 return -EILSEQ;
431 } else {
432 /* Let's see if there's a group by this name */
433 g = getgrnam(d->name);
434 if (g)
435 num = (uid_t) g->gr_gid;
436 else {
437 /* if the group does not exist but the user with the same name exists, refuse operation */
438 p = getpwnam(d->name);
439 if (p)
440 return -EILSEQ;
445 if (num == UID_INVALID) {
446 /* No static UID assigned yet, excellent. Let's pick a new dynamic one, and lock it. */
448 uid_lock_fd = pick_uid(suggested_dirs, d->name, &num);
449 if (uid_lock_fd < 0)
450 return uid_lock_fd;
453 /* So, we found a working UID/lock combination. Let's see if we actually still need it. */
454 r = posix_lock(d->storage_socket[0], LOCK_EX);
455 if (r < 0) {
456 unlink_uid_lock(uid_lock_fd, num, d->name);
457 return r;
460 r = dynamic_user_pop(d, &new_uid, &new_uid_lock_fd);
461 if (r < 0) {
462 if (r != -EAGAIN) {
463 /* OK, something bad happened, let's get rid of the bits we acquired. */
464 unlink_uid_lock(uid_lock_fd, num, d->name);
465 return r;
468 /* Great! Nothing is stored here, still. Store our newly acquired data. */
469 flush_cache = true;
470 } else {
471 /* Hmm, so as it appears there's now something stored in the storage socket. Throw away what we
472 * acquired, and use what's stored now. */
474 unlink_uid_lock(uid_lock_fd, num, d->name);
475 safe_close(uid_lock_fd);
477 num = new_uid;
478 uid_lock_fd = new_uid_lock_fd;
480 } else if (is_user && !uid_is_dynamic(num)) {
481 struct passwd *p;
483 /* Statically allocated user may have different uid and gid. So, let's obtain the gid. */
484 errno = 0;
485 p = getpwuid(num);
486 if (!p)
487 return errno_or_else(ESRCH);
489 gid = p->pw_gid;
492 /* If the UID/GID was already allocated dynamically, push the data we popped out back in. If it was already
493 * allocated statically, push the UID back too, but do not push the lock fd in. If we allocated the UID
494 * dynamically right here, push that in along with the lock fd for it. */
495 r = dynamic_user_push(d, num, uid_lock_fd);
496 if (r < 0)
497 return r;
499 if (flush_cache) {
500 /* If we allocated a new dynamic UID, refresh nscd, so that it forgets about potentially cached
501 * negative entries. But let's do so after we release the /etc/passwd lock, so that there's no
502 * potential for nscd wanting to lock that for completing the invalidation. */
503 etc_passwd_lock_fd = safe_close(etc_passwd_lock_fd);
504 (void) nscd_flush_cache(STRV_MAKE("passwd", "group"));
507 if (is_user) {
508 *ret_uid = num;
509 *ret_gid = gid != GID_INVALID ? gid : num;
510 } else
511 *ret_gid = num;
513 return 0;
516 int dynamic_user_current(DynamicUser *d, uid_t *ret) {
517 _cleanup_close_ int lock_fd = -EBADF;
518 uid_t uid;
519 int r;
521 assert(d);
523 /* Get the currently assigned UID for the user, if there's any. This simply pops the data from the
524 * storage socket, and pushes it back in right-away. */
526 r = posix_lock(d->storage_socket[0], LOCK_EX);
527 if (r < 0)
528 return r;
530 CLEANUP_POSIX_UNLOCK(d->storage_socket[0]);
532 r = dynamic_user_pop(d, &uid, &lock_fd);
533 if (r < 0)
534 return r;
536 r = dynamic_user_push(d, uid, lock_fd);
537 if (r < 0)
538 return r;
540 if (ret)
541 *ret = uid;
543 return 0;
546 static DynamicUser* dynamic_user_unref(DynamicUser *d) {
547 if (!d)
548 return NULL;
550 /* Note that this doesn't actually release any resources itself. If a dynamic user should be fully
551 * destroyed and its UID released, use dynamic_user_destroy() instead. NB: the dynamic user table may
552 * contain entries with no references, which is commonly the case right before a daemon reload. */
554 assert(d->n_ref > 0);
555 d->n_ref--;
557 return NULL;
560 static int dynamic_user_close(DynamicUser *d) {
561 _cleanup_close_ int lock_fd = -EBADF;
562 uid_t uid;
563 int r;
565 /* Release the user ID, by releasing the lock on it, and emptying the storage socket. After this the
566 * user is unrealized again, much like it was after it the DynamicUser object was first allocated. */
568 r = posix_lock(d->storage_socket[0], LOCK_EX);
569 if (r < 0)
570 return r;
572 CLEANUP_POSIX_UNLOCK(d->storage_socket[0]);
574 r = dynamic_user_pop(d, &uid, &lock_fd);
575 if (r == -EAGAIN)
576 /* User wasn't realized yet, nothing to do. */
577 return 0;
578 if (r < 0)
579 return r;
581 /* This dynamic user was realized and dynamically allocated. In this case, let's remove the lock file. */
582 unlink_uid_lock(lock_fd, uid, d->name);
584 (void) nscd_flush_cache(STRV_MAKE("passwd", "group"));
585 return 1;
588 static DynamicUser* dynamic_user_destroy(DynamicUser *d) {
589 if (!d)
590 return NULL;
592 /* Drop a reference to a DynamicUser object, and destroy the user completely if this was the last
593 * reference. This is called whenever a service is shut down and wants its dynamic UID gone. Note that
594 * dynamic_user_unref() is what is called whenever a service is simply freed, for example during a reload
595 * cycle, where the dynamic users should not be destroyed, but our datastructures should. */
597 dynamic_user_unref(d);
599 if (d->n_ref > 0)
600 return NULL;
602 (void) dynamic_user_close(d);
603 return dynamic_user_free(d);
606 int dynamic_user_serialize(Manager *m, FILE *f, FDSet *fds) {
607 DynamicUser *d;
609 assert(m);
610 assert(f);
611 assert(fds);
613 /* Dump the dynamic user database into the manager serialization, to deal with daemon reloads. */
615 HASHMAP_FOREACH(d, m->dynamic_users) {
616 int copy0, copy1;
618 copy0 = fdset_put_dup(fds, d->storage_socket[0]);
619 if (copy0 < 0)
620 return log_error_errno(copy0, "Failed to add dynamic user storage fd to serialization: %m");
622 copy1 = fdset_put_dup(fds, d->storage_socket[1]);
623 if (copy1 < 0)
624 return log_error_errno(copy1, "Failed to add dynamic user storage fd to serialization: %m");
626 (void) serialize_item_format(f, "dynamic-user", "%s %i %i", d->name, copy0, copy1);
629 return 0;
632 void dynamic_user_deserialize_one(Manager *m, const char *value, FDSet *fds) {
633 _cleanup_free_ char *name = NULL, *s0 = NULL, *s1 = NULL;
634 int r, fd0, fd1;
636 assert(m);
637 assert(value);
638 assert(fds);
640 /* Parse the serialization again, after a daemon reload */
642 r = extract_many_words(&value, NULL, 0, &name, &s0, &s1, NULL);
643 if (r != 3 || !isempty(value)) {
644 log_debug("Unable to parse dynamic user line.");
645 return;
648 if ((fd0 = parse_fd(s0)) < 0 || !fdset_contains(fds, fd0)) {
649 log_debug("Unable to process dynamic user fd specification.");
650 return;
653 if ((fd1 = parse_fd(s1)) < 0 || !fdset_contains(fds, fd1)) {
654 log_debug("Unable to process dynamic user fd specification.");
655 return;
658 r = dynamic_user_add(m, name, (int[]) { fd0, fd1 }, NULL);
659 if (r < 0) {
660 log_debug_errno(r, "Failed to add dynamic user: %m");
661 return;
664 (void) fdset_remove(fds, fd0);
665 (void) fdset_remove(fds, fd1);
668 void dynamic_user_vacuum(Manager *m, bool close_user) {
669 DynamicUser *d;
671 assert(m);
673 /* Empty the dynamic user database, optionally cleaning up orphaned dynamic users, i.e. destroy and free users
674 * to which no reference exist. This is called after a daemon reload finished, in order to destroy users which
675 * might not be referenced anymore. */
677 HASHMAP_FOREACH(d, m->dynamic_users) {
678 if (d->n_ref > 0)
679 continue;
681 if (close_user) {
682 log_debug("Removing orphaned dynamic user %s", d->name);
683 (void) dynamic_user_close(d);
686 dynamic_user_free(d);
690 int dynamic_user_lookup_uid(Manager *m, uid_t uid, char **ret) {
691 char lock_path[STRLEN("/run/systemd/dynamic-uid/") + DECIMAL_STR_MAX(uid_t) + 1];
692 _cleanup_free_ char *user = NULL;
693 uid_t check_uid;
694 int r;
696 assert(m);
697 assert(ret);
699 /* A friendly way to translate a dynamic user's UID into a name. */
700 if (!uid_is_dynamic(uid))
701 return -ESRCH;
703 xsprintf(lock_path, "/run/systemd/dynamic-uid/" UID_FMT, uid);
704 r = read_one_line_file(lock_path, &user);
705 if (IN_SET(r, -ENOENT, 0))
706 return -ESRCH;
707 if (r < 0)
708 return r;
710 /* The lock file might be stale, hence let's verify the data before we return it */
711 r = dynamic_user_lookup_name(m, user, &check_uid);
712 if (r < 0)
713 return r;
714 if (check_uid != uid) /* lock file doesn't match our own idea */
715 return -ESRCH;
717 *ret = TAKE_PTR(user);
719 return 0;
722 int dynamic_user_lookup_name(Manager *m, const char *name, uid_t *ret) {
723 DynamicUser *d;
724 int r;
726 assert(m);
727 assert(name);
729 /* A friendly call for translating a dynamic user's name into its UID */
731 d = hashmap_get(m->dynamic_users, name);
732 if (!d)
733 return -ESRCH;
735 r = dynamic_user_current(d, ret);
736 if (r == -EAGAIN) /* not realized yet? */
737 return -ESRCH;
739 return r;
742 int dynamic_creds_make(Manager *m, const char *user, const char *group, DynamicCreds **ret) {
743 _cleanup_(dynamic_creds_unrefp) DynamicCreds *creds = NULL;
744 bool acquired = false;
745 int r;
747 assert(m);
748 assert(ret);
750 if (!user && !group) {
751 *ret = NULL;
752 return 0;
755 creds = new0(DynamicCreds, 1);
756 if (!creds)
757 return -ENOMEM;
759 /* A DynamicUser object encapsulates an allocation of both a UID and a GID for a specific name. However, some
760 * services use different user and groups. For cases like that there's DynamicCreds containing a pair of user
761 * and group. This call allocates a pair. */
763 if (user) {
764 r = dynamic_user_acquire(m, user, &creds->user);
765 if (r < 0)
766 return r;
768 acquired = true;
771 if (creds->user && (!group || streq_ptr(user, group)))
772 creds->group = dynamic_user_ref(creds->user);
773 else if (group) {
774 r = dynamic_user_acquire(m, group, &creds->group);
775 if (r < 0) {
776 if (acquired)
777 creds->user = dynamic_user_unref(creds->user);
778 return r;
782 *ret = TAKE_PTR(creds);
784 return 0;
787 int dynamic_creds_realize(DynamicCreds *creds, char **suggested_paths, uid_t *uid, gid_t *gid) {
788 uid_t u = UID_INVALID;
789 gid_t g = GID_INVALID;
790 int r;
792 assert(creds);
793 assert(uid);
794 assert(gid);
796 /* Realize both the referenced user and group */
798 if (creds->user) {
799 r = dynamic_user_realize(creds->user, suggested_paths, &u, &g, true);
800 if (r < 0)
801 return r;
804 if (creds->group && creds->group != creds->user) {
805 r = dynamic_user_realize(creds->group, suggested_paths, NULL, &g, false);
806 if (r < 0)
807 return r;
810 *uid = u;
811 *gid = g;
812 return 0;
815 DynamicCreds* dynamic_creds_unref(DynamicCreds *creds) {
816 if (!creds)
817 return NULL;
819 creds->user = dynamic_user_unref(creds->user);
820 creds->group = dynamic_user_unref(creds->group);
822 return mfree(creds);
825 DynamicCreds* dynamic_creds_destroy(DynamicCreds *creds) {
826 if (!creds)
827 return NULL;
829 creds->user = dynamic_user_destroy(creds->user);
830 creds->group = dynamic_user_destroy(creds->group);
832 return mfree(creds);