]> git.proxmox.com Git - systemd.git/blob - src/core/unit.c
projects / systemd.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
New upstream version 242
[systemd.git] / src / core / unit.c
1 /* SPDX-License-Identifier: LGPL-2.1+ */
2
3 #include <errno.h>
4 #include <stdlib.h>
5 #include <string.h>
6 #include <sys/prctl.h>
7 #include <sys/stat.h>
8 #include <unistd.h>
9
10 #include "sd-id128.h"
11 #include "sd-messages.h"
12
13 #include "all-units.h"
14 #include "alloc-util.h"
15 #include "bus-common-errors.h"
16 #include "bus-util.h"
17 #include "cgroup-util.h"
18 #include "dbus-unit.h"
19 #include "dbus.h"
20 #include "dropin.h"
21 #include "escape.h"
22 #include "execute.h"
23 #include "fd-util.h"
24 #include "fileio-label.h"
25 #include "fileio.h"
26 #include "format-util.h"
27 #include "fs-util.h"
28 #include "id128-util.h"
29 #include "io-util.h"
30 #include "load-dropin.h"
31 #include "load-fragment.h"
32 #include "log.h"
33 #include "macro.h"
34 #include "missing.h"
35 #include "mkdir.h"
36 #include "parse-util.h"
37 #include "path-util.h"
38 #include "process-util.h"
39 #include "serialize.h"
40 #include "set.h"
41 #include "signal-util.h"
42 #include "sparse-endian.h"
43 #include "special.h"
44 #include "specifier.h"
45 #include "stat-util.h"
46 #include "stdio-util.h"
47 #include "string-table.h"
48 #include "string-util.h"
49 #include "strv.h"
50 #include "terminal-util.h"
51 #include "tmpfile-util.h"
52 #include "umask-util.h"
53 #include "unit-name.h"
54 #include "unit.h"
55 #include "user-util.h"
56 #include "virt.h"
57
58 const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = {
59 [UNIT_SERVICE] = &service_vtable,
60 [UNIT_SOCKET] = &socket_vtable,
61 [UNIT_TARGET] = &target_vtable,
62 [UNIT_DEVICE] = &device_vtable,
63 [UNIT_MOUNT] = &mount_vtable,
64 [UNIT_AUTOMOUNT] = &automount_vtable,
65 [UNIT_SWAP] = &swap_vtable,
66 [UNIT_TIMER] = &timer_vtable,
67 [UNIT_PATH] = &path_vtable,
68 [UNIT_SLICE] = &slice_vtable,
69 [UNIT_SCOPE] = &scope_vtable,
70 };
71
72 static void maybe_warn_about_dependency(Unit *u, const char *other, UnitDependency dependency);
73
74 Unit *unit_new(Manager *m, size_t size) {
75 Unit *u;
76
77 assert(m);
78 assert(size >= sizeof(Unit));
79
80 u = malloc0(size);
81 if (!u)
82 return NULL;
83
84 u->names = set_new(&string_hash_ops);
85 if (!u->names)
86 return mfree(u);
87
88 u->manager = m;
89 u->type = _UNIT_TYPE_INVALID;
90 u->default_dependencies = true;
91 u->unit_file_state = _UNIT_FILE_STATE_INVALID;
92 u->unit_file_preset = -1;
93 u->on_failure_job_mode = JOB_REPLACE;
94 u->cgroup_inotify_wd = -1;
95 u->job_timeout = USEC_INFINITY;
96 u->job_running_timeout = USEC_INFINITY;
97 u->ref_uid = UID_INVALID;
98 u->ref_gid = GID_INVALID;
99 u->cpu_usage_last = NSEC_INFINITY;
100 u->cgroup_invalidated_mask |= CGROUP_MASK_BPF_FIREWALL;
101 u->failure_action_exit_status = u->success_action_exit_status = -1;
102
103 u->ip_accounting_ingress_map_fd = -1;
104 u->ip_accounting_egress_map_fd = -1;
105 u->ipv4_allow_map_fd = -1;
106 u->ipv6_allow_map_fd = -1;
107 u->ipv4_deny_map_fd = -1;
108 u->ipv6_deny_map_fd = -1;
109
110 u->last_section_private = -1;
111
112 RATELIMIT_INIT(u->start_limit, m->default_start_limit_interval, m->default_start_limit_burst);
113 RATELIMIT_INIT(u->auto_stop_ratelimit, 10 * USEC_PER_SEC, 16);
114
115 return u;
116 }
117
118 int unit_new_for_name(Manager *m, size_t size, const char *name, Unit **ret) {
119 _cleanup_(unit_freep) Unit *u = NULL;
120 int r;
121
122 u = unit_new(m, size);
123 if (!u)
124 return -ENOMEM;
125
126 r = unit_add_name(u, name);
127 if (r < 0)
128 return r;
129
130 *ret = TAKE_PTR(u);
131
132 return r;
133 }
134
135 bool unit_has_name(const Unit *u, const char *name) {
136 assert(u);
137 assert(name);
138
139 return set_contains(u->names, (char*) name);
140 }
141
142 static void unit_init(Unit *u) {
143 CGroupContext *cc;
144 ExecContext *ec;
145 KillContext *kc;
146
147 assert(u);
148 assert(u->manager);
149 assert(u->type >= 0);
150
151 cc = unit_get_cgroup_context(u);
152 if (cc) {
153 cgroup_context_init(cc);
154
155 /* Copy in the manager defaults into the cgroup
156 * context, _before_ the rest of the settings have
157 * been initialized */
158
159 cc->cpu_accounting = u->manager->default_cpu_accounting;
160 cc->io_accounting = u->manager->default_io_accounting;
161 cc->ip_accounting = u->manager->default_ip_accounting;
162 cc->blockio_accounting = u->manager->default_blockio_accounting;
163 cc->memory_accounting = u->manager->default_memory_accounting;
164 cc->tasks_accounting = u->manager->default_tasks_accounting;
165 cc->ip_accounting = u->manager->default_ip_accounting;
166
167 if (u->type != UNIT_SLICE)
168 cc->tasks_max = u->manager->default_tasks_max;
169 }
170
171 ec = unit_get_exec_context(u);
172 if (ec) {
173 exec_context_init(ec);
174
175 ec->keyring_mode = MANAGER_IS_SYSTEM(u->manager) ?
176 EXEC_KEYRING_SHARED : EXEC_KEYRING_INHERIT;
177 }
178
179 kc = unit_get_kill_context(u);
180 if (kc)
181 kill_context_init(kc);
182
183 if (UNIT_VTABLE(u)->init)
184 UNIT_VTABLE(u)->init(u);
185 }
186
187 int unit_add_name(Unit *u, const char *text) {
188 _cleanup_free_ char *s = NULL, *i = NULL;
189 UnitType t;
190 int r;
191
192 assert(u);
193 assert(text);
194
195 if (unit_name_is_valid(text, UNIT_NAME_TEMPLATE)) {
196
197 if (!u->instance)
198 return -EINVAL;
199
200 r = unit_name_replace_instance(text, u->instance, &s);
201 if (r < 0)
202 return r;
203 } else {
204 s = strdup(text);
205 if (!s)
206 return -ENOMEM;
207 }
208
209 if (set_contains(u->names, s))
210 return 0;
211 if (hashmap_contains(u->manager->units, s))
212 return -EEXIST;
213
214 if (!unit_name_is_valid(s, UNIT_NAME_PLAIN|UNIT_NAME_INSTANCE))
215 return -EINVAL;
216
217 t = unit_name_to_type(s);
218 if (t < 0)
219 return -EINVAL;
220
221 if (u->type != _UNIT_TYPE_INVALID && t != u->type)
222 return -EINVAL;
223
224 r = unit_name_to_instance(s, &i);
225 if (r < 0)
226 return r;
227
228 if (i && !unit_type_may_template(t))
229 return -EINVAL;
230
231 /* Ensure that this unit is either instanced or not instanced,
232 * but not both. Note that we do allow names with different
233 * instance names however! */
234 if (u->type != _UNIT_TYPE_INVALID && !u->instance != !i)
235 return -EINVAL;
236
237 if (!unit_type_may_alias(t) && !set_isempty(u->names))
238 return -EEXIST;
239
240 if (hashmap_size(u->manager->units) >= MANAGER_MAX_NAMES)
241 return -E2BIG;
242
243 r = set_put(u->names, s);
244 if (r < 0)
245 return r;
246 assert(r > 0);
247
248 r = hashmap_put(u->manager->units, s, u);
249 if (r < 0) {
250 (void) set_remove(u->names, s);
251 return r;
252 }
253
254 if (u->type == _UNIT_TYPE_INVALID) {
255 u->type = t;
256 u->id = s;
257 u->instance = TAKE_PTR(i);
258
259 LIST_PREPEND(units_by_type, u->manager->units_by_type[t], u);
260
261 unit_init(u);
262 }
263
264 s = NULL;
265
266 unit_add_to_dbus_queue(u);
267 return 0;
268 }
269
270 int unit_choose_id(Unit *u, const char *name) {
271 _cleanup_free_ char *t = NULL;
272 char *s, *i;
273 int r;
274
275 assert(u);
276 assert(name);
277
278 if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) {
279
280 if (!u->instance)
281 return -EINVAL;
282
283 r = unit_name_replace_instance(name, u->instance, &t);
284 if (r < 0)
285 return r;
286
287 name = t;
288 }
289
290 /* Selects one of the names of this unit as the id */
291 s = set_get(u->names, (char*) name);
292 if (!s)
293 return -ENOENT;
294
295 /* Determine the new instance from the new id */
296 r = unit_name_to_instance(s, &i);
297 if (r < 0)
298 return r;
299
300 u->id = s;
301
302 free(u->instance);
303 u->instance = i;
304
305 unit_add_to_dbus_queue(u);
306
307 return 0;
308 }
309
310 int unit_set_description(Unit *u, const char *description) {
311 int r;
312
313 assert(u);
314
315 r = free_and_strdup(&u->description, empty_to_null(description));
316 if (r < 0)
317 return r;
318 if (r > 0)
319 unit_add_to_dbus_queue(u);
320
321 return 0;
322 }
323
324 bool unit_may_gc(Unit *u) {
325 UnitActiveState state;
326 int r;
327
328 assert(u);
329
330 /* Checks whether the unit is ready to be unloaded for garbage collection.
331 * Returns true when the unit may be collected, and false if there's some
332 * reason to keep it loaded.
333 *
334 * References from other units are *not* checked here. Instead, this is done
335 * in unit_gc_sweep(), but using markers to properly collect dependency loops.
336 */
337
338 if (u->job)
339 return false;
340
341 if (u->nop_job)
342 return false;
343
344 state = unit_active_state(u);
345
346 /* If the unit is inactive and failed and no job is queued for it, then release its runtime resources */
347 if (UNIT_IS_INACTIVE_OR_FAILED(state) &&
348 UNIT_VTABLE(u)->release_resources)
349 UNIT_VTABLE(u)->release_resources(u);
350
351 if (u->perpetual)
352 return false;
353
354 if (sd_bus_track_count(u->bus_track) > 0)
355 return false;
356
357 /* But we keep the unit object around for longer when it is referenced or configured to not be gc'ed */
358 switch (u->collect_mode) {
359
360 case COLLECT_INACTIVE:
361 if (state != UNIT_INACTIVE)
362 return false;
363
364 break;
365
366 case COLLECT_INACTIVE_OR_FAILED:
367 if (!IN_SET(state, UNIT_INACTIVE, UNIT_FAILED))
368 return false;
369
370 break;
371
372 default:
373 assert_not_reached("Unknown garbage collection mode");
374 }
375
376 if (u->cgroup_path) {
377 /* If the unit has a cgroup, then check whether there's anything in it. If so, we should stay
378 * around. Units with active processes should never be collected. */
379
380 r = cg_is_empty_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path);
381 if (r < 0)
382 log_unit_debug_errno(u, r, "Failed to determine whether cgroup %s is empty: %m", u->cgroup_path);
383 if (r <= 0)
384 return false;
385 }
386
387 if (UNIT_VTABLE(u)->may_gc && !UNIT_VTABLE(u)->may_gc(u))
388 return false;
389
390 return true;
391 }
392
393 void unit_add_to_load_queue(Unit *u) {
394 assert(u);
395 assert(u->type != _UNIT_TYPE_INVALID);
396
397 if (u->load_state != UNIT_STUB || u->in_load_queue)
398 return;
399
400 LIST_PREPEND(load_queue, u->manager->load_queue, u);
401 u->in_load_queue = true;
402 }
403
404 void unit_add_to_cleanup_queue(Unit *u) {
405 assert(u);
406
407 if (u->in_cleanup_queue)
408 return;
409
410 LIST_PREPEND(cleanup_queue, u->manager->cleanup_queue, u);
411 u->in_cleanup_queue = true;
412 }
413
414 void unit_add_to_gc_queue(Unit *u) {
415 assert(u);
416
417 if (u->in_gc_queue || u->in_cleanup_queue)
418 return;
419
420 if (!unit_may_gc(u))
421 return;
422
423 LIST_PREPEND(gc_queue, u->manager->gc_unit_queue, u);
424 u->in_gc_queue = true;
425 }
426
427 void unit_add_to_dbus_queue(Unit *u) {
428 assert(u);
429 assert(u->type != _UNIT_TYPE_INVALID);
430
431 if (u->load_state == UNIT_STUB || u->in_dbus_queue)
432 return;
433
434 /* Shortcut things if nobody cares */
435 if (sd_bus_track_count(u->manager->subscribed) <= 0 &&
436 sd_bus_track_count(u->bus_track) <= 0 &&
437 set_isempty(u->manager->private_buses)) {
438 u->sent_dbus_new_signal = true;
439 return;
440 }
441
442 LIST_PREPEND(dbus_queue, u->manager->dbus_unit_queue, u);
443 u->in_dbus_queue = true;
444 }
445
446 void unit_submit_to_stop_when_unneeded_queue(Unit *u) {
447 assert(u);
448
449 if (u->in_stop_when_unneeded_queue)
450 return;
451
452 if (!u->stop_when_unneeded)
453 return;
454
455 if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u)))
456 return;
457
458 LIST_PREPEND(stop_when_unneeded_queue, u->manager->stop_when_unneeded_queue, u);
459 u->in_stop_when_unneeded_queue = true;
460 }
461
462 static void bidi_set_free(Unit *u, Hashmap *h) {
463 Unit *other;
464 Iterator i;
465 void *v;
466
467 assert(u);
468
469 /* Frees the hashmap and makes sure we are dropped from the inverse pointers */
470
471 HASHMAP_FOREACH_KEY(v, other, h, i) {
472 UnitDependency d;
473
474 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
475 hashmap_remove(other->dependencies[d], u);
476
477 unit_add_to_gc_queue(other);
478 }
479
480 hashmap_free(h);
481 }
482
483 static void unit_remove_transient(Unit *u) {
484 char **i;
485
486 assert(u);
487
488 if (!u->transient)
489 return;
490
491 if (u->fragment_path)
492 (void) unlink(u->fragment_path);
493
494 STRV_FOREACH(i, u->dropin_paths) {
495 _cleanup_free_ char *p = NULL, *pp = NULL;
496
497 p = dirname_malloc(*i); /* Get the drop-in directory from the drop-in file */
498 if (!p)
499 continue;
500
501 pp = dirname_malloc(p); /* Get the config directory from the drop-in directory */
502 if (!pp)
503 continue;
504
505 /* Only drop transient drop-ins */
506 if (!path_equal(u->manager->lookup_paths.transient, pp))
507 continue;
508
509 (void) unlink(*i);
510 (void) rmdir(p);
511 }
512 }
513
514 static void unit_free_requires_mounts_for(Unit *u) {
515 assert(u);
516
517 for (;;) {
518 _cleanup_free_ char *path;
519
520 path = hashmap_steal_first_key(u->requires_mounts_for);
521 if (!path)
522 break;
523 else {
524 char s[strlen(path) + 1];
525
526 PATH_FOREACH_PREFIX_MORE(s, path) {
527 char *y;
528 Set *x;
529
530 x = hashmap_get2(u->manager->units_requiring_mounts_for, s, (void**) &y);
531 if (!x)
532 continue;
533
534 (void) set_remove(x, u);
535
536 if (set_isempty(x)) {
537 (void) hashmap_remove(u->manager->units_requiring_mounts_for, y);
538 free(y);
539 set_free(x);
540 }
541 }
542 }
543 }
544
545 u->requires_mounts_for = hashmap_free(u->requires_mounts_for);
546 }
547
548 static void unit_done(Unit *u) {
549 ExecContext *ec;
550 CGroupContext *cc;
551
552 assert(u);
553
554 if (u->type < 0)
555 return;
556
557 if (UNIT_VTABLE(u)->done)
558 UNIT_VTABLE(u)->done(u);
559
560 ec = unit_get_exec_context(u);
561 if (ec)
562 exec_context_done(ec);
563
564 cc = unit_get_cgroup_context(u);
565 if (cc)
566 cgroup_context_done(cc);
567 }
568
569 void unit_free(Unit *u) {
570 UnitDependency d;
571 Iterator i;
572 char *t;
573
574 if (!u)
575 return;
576
577 if (UNIT_ISSET(u->slice)) {
578 /* A unit is being dropped from the tree, make sure our parent slice recalculates the member mask */
579 unit_invalidate_cgroup_members_masks(UNIT_DEREF(u->slice));
580
581 /* And make sure the parent is realized again, updating cgroup memberships */
582 unit_add_to_cgroup_realize_queue(UNIT_DEREF(u->slice));
583 }
584
585 u->transient_file = safe_fclose(u->transient_file);
586
587 if (!MANAGER_IS_RELOADING(u->manager))
588 unit_remove_transient(u);
589
590 bus_unit_send_removed_signal(u);
591
592 unit_done(u);
593
594 unit_dequeue_rewatch_pids(u);
595
596 sd_bus_slot_unref(u->match_bus_slot);
597 sd_bus_track_unref(u->bus_track);
598 u->deserialized_refs = strv_free(u->deserialized_refs);
599
600 unit_free_requires_mounts_for(u);
601
602 SET_FOREACH(t, u->names, i)
603 hashmap_remove_value(u->manager->units, t, u);
604
605 if (!sd_id128_is_null(u->invocation_id))
606 hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u);
607
608 if (u->job) {
609 Job *j = u->job;
610 job_uninstall(j);
611 job_free(j);
612 }
613
614 if (u->nop_job) {
615 Job *j = u->nop_job;
616 job_uninstall(j);
617 job_free(j);
618 }
619
620 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
621 bidi_set_free(u, u->dependencies[d]);
622
623 if (u->on_console)
624 manager_unref_console(u->manager);
625
626 unit_release_cgroup(u);
627
628 if (!MANAGER_IS_RELOADING(u->manager))
629 unit_unlink_state_files(u);
630
631 unit_unref_uid_gid(u, false);
632
633 (void) manager_update_failed_units(u->manager, u, false);
634 set_remove(u->manager->startup_units, u);
635
636 unit_unwatch_all_pids(u);
637
638 unit_ref_unset(&u->slice);
639 while (u->refs_by_target)
640 unit_ref_unset(u->refs_by_target);
641
642 if (u->type != _UNIT_TYPE_INVALID)
643 LIST_REMOVE(units_by_type, u->manager->units_by_type[u->type], u);
644
645 if (u->in_load_queue)
646 LIST_REMOVE(load_queue, u->manager->load_queue, u);
647
648 if (u->in_dbus_queue)
649 LIST_REMOVE(dbus_queue, u->manager->dbus_unit_queue, u);
650
651 if (u->in_gc_queue)
652 LIST_REMOVE(gc_queue, u->manager->gc_unit_queue, u);
653
654 if (u->in_cgroup_realize_queue)
655 LIST_REMOVE(cgroup_realize_queue, u->manager->cgroup_realize_queue, u);
656
657 if (u->in_cgroup_empty_queue)
658 LIST_REMOVE(cgroup_empty_queue, u->manager->cgroup_empty_queue, u);
659
660 if (u->in_cleanup_queue)
661 LIST_REMOVE(cleanup_queue, u->manager->cleanup_queue, u);
662
663 if (u->in_target_deps_queue)
664 LIST_REMOVE(target_deps_queue, u->manager->target_deps_queue, u);
665
666 if (u->in_stop_when_unneeded_queue)
667 LIST_REMOVE(stop_when_unneeded_queue, u->manager->stop_when_unneeded_queue, u);
668
669 safe_close(u->ip_accounting_ingress_map_fd);
670 safe_close(u->ip_accounting_egress_map_fd);
671
672 safe_close(u->ipv4_allow_map_fd);
673 safe_close(u->ipv6_allow_map_fd);
674 safe_close(u->ipv4_deny_map_fd);
675 safe_close(u->ipv6_deny_map_fd);
676
677 bpf_program_unref(u->ip_bpf_ingress);
678 bpf_program_unref(u->ip_bpf_ingress_installed);
679 bpf_program_unref(u->ip_bpf_egress);
680 bpf_program_unref(u->ip_bpf_egress_installed);
681
682 bpf_program_unref(u->bpf_device_control_installed);
683
684 condition_free_list(u->conditions);
685 condition_free_list(u->asserts);
686
687 free(u->description);
688 strv_free(u->documentation);
689 free(u->fragment_path);
690 free(u->source_path);
691 strv_free(u->dropin_paths);
692 free(u->instance);
693
694 free(u->job_timeout_reboot_arg);
695
696 set_free_free(u->names);
697
698 free(u->reboot_arg);
699
700 free(u);
701 }
702
703 UnitActiveState unit_active_state(Unit *u) {
704 assert(u);
705
706 if (u->load_state == UNIT_MERGED)
707 return unit_active_state(unit_follow_merge(u));
708
709 /* After a reload it might happen that a unit is not correctly
710 * loaded but still has a process around. That's why we won't
711 * shortcut failed loading to UNIT_INACTIVE_FAILED. */
712
713 return UNIT_VTABLE(u)->active_state(u);
714 }
715
716 const char* unit_sub_state_to_string(Unit *u) {
717 assert(u);
718
719 return UNIT_VTABLE(u)->sub_state_to_string(u);
720 }
721
722 static int set_complete_move(Set **s, Set **other) {
723 assert(s);
724 assert(other);
725
726 if (!other)
727 return 0;
728
729 if (*s)
730 return set_move(*s, *other);
731 else
732 *s = TAKE_PTR(*other);
733
734 return 0;
735 }
736
737 static int hashmap_complete_move(Hashmap **s, Hashmap **other) {
738 assert(s);
739 assert(other);
740
741 if (!*other)
742 return 0;
743
744 if (*s)
745 return hashmap_move(*s, *other);
746 else
747 *s = TAKE_PTR(*other);
748
749 return 0;
750 }
751
752 static int merge_names(Unit *u, Unit *other) {
753 char *t;
754 Iterator i;
755 int r;
756
757 assert(u);
758 assert(other);
759
760 r = set_complete_move(&u->names, &other->names);
761 if (r < 0)
762 return r;
763
764 set_free_free(other->names);
765 other->names = NULL;
766 other->id = NULL;
767
768 SET_FOREACH(t, u->names, i)
769 assert_se(hashmap_replace(u->manager->units, t, u) == 0);
770
771 return 0;
772 }
773
774 static int reserve_dependencies(Unit *u, Unit *other, UnitDependency d) {
775 unsigned n_reserve;
776
777 assert(u);
778 assert(other);
779 assert(d < _UNIT_DEPENDENCY_MAX);
780
781 /*
782 * If u does not have this dependency set allocated, there is no need
783 * to reserve anything. In that case other's set will be transferred
784 * as a whole to u by complete_move().
785 */
786 if (!u->dependencies[d])
787 return 0;
788
789 /* merge_dependencies() will skip a u-on-u dependency */
790 n_reserve = hashmap_size(other->dependencies[d]) - !!hashmap_get(other->dependencies[d], u);
791
792 return hashmap_reserve(u->dependencies[d], n_reserve);
793 }
794
795 static void merge_dependencies(Unit *u, Unit *other, const char *other_id, UnitDependency d) {
796 Iterator i;
797 Unit *back;
798 void *v;
799 int r;
800
801 /* Merges all dependencies of type 'd' of the unit 'other' into the deps of the unit 'u' */
802
803 assert(u);
804 assert(other);
805 assert(d < _UNIT_DEPENDENCY_MAX);
806
807 /* Fix backwards pointers. Let's iterate through all dependendent units of the other unit. */
808 HASHMAP_FOREACH_KEY(v, back, other->dependencies[d], i) {
809 UnitDependency k;
810
811 /* Let's now iterate through the dependencies of that dependencies of the other units, looking for
812 * pointers back, and let's fix them up, to instead point to 'u'. */
813
814 for (k = 0; k < _UNIT_DEPENDENCY_MAX; k++) {
815 if (back == u) {
816 /* Do not add dependencies between u and itself. */
817 if (hashmap_remove(back->dependencies[k], other))
818 maybe_warn_about_dependency(u, other_id, k);
819 } else {
820 UnitDependencyInfo di_u, di_other, di_merged;
821
822 /* Let's drop this dependency between "back" and "other", and let's create it between
823 * "back" and "u" instead. Let's merge the bit masks of the dependency we are moving,
824 * and any such dependency which might already exist */
825
826 di_other.data = hashmap_get(back->dependencies[k], other);
827 if (!di_other.data)
828 continue; /* dependency isn't set, let's try the next one */
829
830 di_u.data = hashmap_get(back->dependencies[k], u);
831
832 di_merged = (UnitDependencyInfo) {
833 .origin_mask = di_u.origin_mask | di_other.origin_mask,
834 .destination_mask = di_u.destination_mask | di_other.destination_mask,
835 };
836
837 r = hashmap_remove_and_replace(back->dependencies[k], other, u, di_merged.data);
838 if (r < 0)
839 log_warning_errno(r, "Failed to remove/replace: back=%s other=%s u=%s: %m", back->id, other_id, u->id);
840 assert(r >= 0);
841
842 /* assert_se(hashmap_remove_and_replace(back->dependencies[k], other, u, di_merged.data) >= 0); */
843 }
844 }
845
846 }
847
848 /* Also do not move dependencies on u to itself */
849 back = hashmap_remove(other->dependencies[d], u);
850 if (back)
851 maybe_warn_about_dependency(u, other_id, d);
852
853 /* The move cannot fail. The caller must have performed a reservation. */
854 assert_se(hashmap_complete_move(&u->dependencies[d], &other->dependencies[d]) == 0);
855
856 other->dependencies[d] = hashmap_free(other->dependencies[d]);
857 }
858
859 int unit_merge(Unit *u, Unit *other) {
860 UnitDependency d;
861 const char *other_id = NULL;
862 int r;
863
864 assert(u);
865 assert(other);
866 assert(u->manager == other->manager);
867 assert(u->type != _UNIT_TYPE_INVALID);
868
869 other = unit_follow_merge(other);
870
871 if (other == u)
872 return 0;
873
874 if (u->type != other->type)
875 return -EINVAL;
876
877 if (!u->instance != !other->instance)
878 return -EINVAL;
879
880 if (!unit_type_may_alias(u->type)) /* Merging only applies to unit names that support aliases */
881 return -EEXIST;
882
883 if (!IN_SET(other->load_state, UNIT_STUB, UNIT_NOT_FOUND))
884 return -EEXIST;
885
886 if (other->job)
887 return -EEXIST;
888
889 if (other->nop_job)
890 return -EEXIST;
891
892 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
893 return -EEXIST;
894
895 if (other->id)
896 other_id = strdupa(other->id);
897
898 /* Make reservations to ensure merge_dependencies() won't fail */
899 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
900 r = reserve_dependencies(u, other, d);
901 /*
902 * We don't rollback reservations if we fail. We don't have
903 * a way to undo reservations. A reservation is not a leak.
904 */
905 if (r < 0)
906 return r;
907 }
908
909 /* Merge names */
910 r = merge_names(u, other);
911 if (r < 0)
912 return r;
913
914 /* Redirect all references */
915 while (other->refs_by_target)
916 unit_ref_set(other->refs_by_target, other->refs_by_target->source, u);
917
918 /* Merge dependencies */
919 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
920 merge_dependencies(u, other, other_id, d);
921
922 other->load_state = UNIT_MERGED;
923 other->merged_into = u;
924
925 /* If there is still some data attached to the other node, we
926 * don't need it anymore, and can free it. */
927 if (other->load_state != UNIT_STUB)
928 if (UNIT_VTABLE(other)->done)
929 UNIT_VTABLE(other)->done(other);
930
931 unit_add_to_dbus_queue(u);
932 unit_add_to_cleanup_queue(other);
933
934 return 0;
935 }
936
937 int unit_merge_by_name(Unit *u, const char *name) {
938 _cleanup_free_ char *s = NULL;
939 Unit *other;
940 int r;
941
942 assert(u);
943 assert(name);
944
945 if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) {
946 if (!u->instance)
947 return -EINVAL;
948
949 r = unit_name_replace_instance(name, u->instance, &s);
950 if (r < 0)
951 return r;
952
953 name = s;
954 }
955
956 other = manager_get_unit(u->manager, name);
957 if (other)
958 return unit_merge(u, other);
959
960 return unit_add_name(u, name);
961 }
962
963 Unit* unit_follow_merge(Unit *u) {
964 assert(u);
965
966 while (u->load_state == UNIT_MERGED)
967 assert_se(u = u->merged_into);
968
969 return u;
970 }
971
972 int unit_add_exec_dependencies(Unit *u, ExecContext *c) {
973 ExecDirectoryType dt;
974 char **dp;
975 int r;
976
977 assert(u);
978 assert(c);
979
980 if (c->working_directory && !c->working_directory_missing_ok) {
981 r = unit_require_mounts_for(u, c->working_directory, UNIT_DEPENDENCY_FILE);
982 if (r < 0)
983 return r;
984 }
985
986 if (c->root_directory) {
987 r = unit_require_mounts_for(u, c->root_directory, UNIT_DEPENDENCY_FILE);
988 if (r < 0)
989 return r;
990 }
991
992 if (c->root_image) {
993 r = unit_require_mounts_for(u, c->root_image, UNIT_DEPENDENCY_FILE);
994 if (r < 0)
995 return r;
996 }
997
998 for (dt = 0; dt < _EXEC_DIRECTORY_TYPE_MAX; dt++) {
999 if (!u->manager->prefix[dt])
1000 continue;
1001
1002 STRV_FOREACH(dp, c->directories[dt].paths) {
1003 _cleanup_free_ char *p;
1004
1005 p = strjoin(u->manager->prefix[dt], "/", *dp);
1006 if (!p)
1007 return -ENOMEM;
1008
1009 r = unit_require_mounts_for(u, p, UNIT_DEPENDENCY_FILE);
1010 if (r < 0)
1011 return r;
1012 }
1013 }
1014
1015 if (!MANAGER_IS_SYSTEM(u->manager))
1016 return 0;
1017
1018 if (c->private_tmp) {
1019 const char *p;
1020
1021 FOREACH_STRING(p, "/tmp", "/var/tmp") {
1022 r = unit_require_mounts_for(u, p, UNIT_DEPENDENCY_FILE);
1023 if (r < 0)
1024 return r;
1025 }
1026
1027 r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_TMPFILES_SETUP_SERVICE, true, UNIT_DEPENDENCY_FILE);
1028 if (r < 0)
1029 return r;
1030 }
1031
1032 if (!IN_SET(c->std_output,
1033 EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE,
1034 EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE,
1035 EXEC_OUTPUT_SYSLOG, EXEC_OUTPUT_SYSLOG_AND_CONSOLE) &&
1036 !IN_SET(c->std_error,
1037 EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE,
1038 EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE,
1039 EXEC_OUTPUT_SYSLOG, EXEC_OUTPUT_SYSLOG_AND_CONSOLE))
1040 return 0;
1041
1042 /* If syslog or kernel logging is requested, make sure our own
1043 * logging daemon is run first. */
1044
1045 r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_JOURNALD_SOCKET, true, UNIT_DEPENDENCY_FILE);
1046 if (r < 0)
1047 return r;
1048
1049 return 0;
1050 }
1051
1052 const char *unit_description(Unit *u) {
1053 assert(u);
1054
1055 if (u->description)
1056 return u->description;
1057
1058 return strna(u->id);
1059 }
1060
1061 static void print_unit_dependency_mask(FILE *f, const char *kind, UnitDependencyMask mask, bool *space) {
1062 const struct {
1063 UnitDependencyMask mask;
1064 const char *name;
1065 } table[] = {
1066 { UNIT_DEPENDENCY_FILE, "file" },
1067 { UNIT_DEPENDENCY_IMPLICIT, "implicit" },
1068 { UNIT_DEPENDENCY_DEFAULT, "default" },
1069 { UNIT_DEPENDENCY_UDEV, "udev" },
1070 { UNIT_DEPENDENCY_PATH, "path" },
1071 { UNIT_DEPENDENCY_MOUNTINFO_IMPLICIT, "mountinfo-implicit" },
1072 { UNIT_DEPENDENCY_MOUNTINFO_DEFAULT, "mountinfo-default" },
1073 { UNIT_DEPENDENCY_PROC_SWAP, "proc-swap" },
1074 };
1075 size_t i;
1076
1077 assert(f);
1078 assert(kind);
1079 assert(space);
1080
1081 for (i = 0; i < ELEMENTSOF(table); i++) {
1082
1083 if (mask == 0)
1084 break;
1085
1086 if (FLAGS_SET(mask, table[i].mask)) {
1087 if (*space)
1088 fputc(' ', f);
1089 else
1090 *space = true;
1091
1092 fputs(kind, f);
1093 fputs("-", f);
1094 fputs(table[i].name, f);
1095
1096 mask &= ~table[i].mask;
1097 }
1098 }
1099
1100 assert(mask == 0);
1101 }
1102
1103 void unit_dump(Unit *u, FILE *f, const char *prefix) {
1104 char *t, **j;
1105 UnitDependency d;
1106 Iterator i;
1107 const char *prefix2;
1108 char
1109 timestamp0[FORMAT_TIMESTAMP_MAX],
1110 timestamp1[FORMAT_TIMESTAMP_MAX],
1111 timestamp2[FORMAT_TIMESTAMP_MAX],
1112 timestamp3[FORMAT_TIMESTAMP_MAX],
1113 timestamp4[FORMAT_TIMESTAMP_MAX],
1114 timespan[FORMAT_TIMESPAN_MAX];
1115 Unit *following;
1116 _cleanup_set_free_ Set *following_set = NULL;
1117 const char *n;
1118 CGroupMask m;
1119 int r;
1120
1121 assert(u);
1122 assert(u->type >= 0);
1123
1124 prefix = strempty(prefix);
1125 prefix2 = strjoina(prefix, "\t");
1126
1127 fprintf(f,
1128 "%s-> Unit %s:\n"
1129 "%s\tDescription: %s\n"
1130 "%s\tInstance: %s\n"
1131 "%s\tUnit Load State: %s\n"
1132 "%s\tUnit Active State: %s\n"
1133 "%s\tState Change Timestamp: %s\n"
1134 "%s\tInactive Exit Timestamp: %s\n"
1135 "%s\tActive Enter Timestamp: %s\n"
1136 "%s\tActive Exit Timestamp: %s\n"
1137 "%s\tInactive Enter Timestamp: %s\n"
1138 "%s\tMay GC: %s\n"
1139 "%s\tNeed Daemon Reload: %s\n"
1140 "%s\tTransient: %s\n"
1141 "%s\tPerpetual: %s\n"
1142 "%s\tGarbage Collection Mode: %s\n"
1143 "%s\tSlice: %s\n"
1144 "%s\tCGroup: %s\n"
1145 "%s\tCGroup realized: %s\n",
1146 prefix, u->id,
1147 prefix, unit_description(u),
1148 prefix, strna(u->instance),
1149 prefix, unit_load_state_to_string(u->load_state),
1150 prefix, unit_active_state_to_string(unit_active_state(u)),
1151 prefix, strna(format_timestamp(timestamp0, sizeof(timestamp0), u->state_change_timestamp.realtime)),
1152 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->inactive_exit_timestamp.realtime)),
1153 prefix, strna(format_timestamp(timestamp2, sizeof(timestamp2), u->active_enter_timestamp.realtime)),
1154 prefix, strna(format_timestamp(timestamp3, sizeof(timestamp3), u->active_exit_timestamp.realtime)),
1155 prefix, strna(format_timestamp(timestamp4, sizeof(timestamp4), u->inactive_enter_timestamp.realtime)),
1156 prefix, yes_no(unit_may_gc(u)),
1157 prefix, yes_no(unit_need_daemon_reload(u)),
1158 prefix, yes_no(u->transient),
1159 prefix, yes_no(u->perpetual),
1160 prefix, collect_mode_to_string(u->collect_mode),
1161 prefix, strna(unit_slice_name(u)),
1162 prefix, strna(u->cgroup_path),
1163 prefix, yes_no(u->cgroup_realized));
1164
1165 if (u->cgroup_realized_mask != 0) {
1166 _cleanup_free_ char *s = NULL;
1167 (void) cg_mask_to_string(u->cgroup_realized_mask, &s);
1168 fprintf(f, "%s\tCGroup realized mask: %s\n", prefix, strnull(s));
1169 }
1170
1171 if (u->cgroup_enabled_mask != 0) {
1172 _cleanup_free_ char *s = NULL;
1173 (void) cg_mask_to_string(u->cgroup_enabled_mask, &s);
1174 fprintf(f, "%s\tCGroup enabled mask: %s\n", prefix, strnull(s));
1175 }
1176
1177 m = unit_get_own_mask(u);
1178 if (m != 0) {
1179 _cleanup_free_ char *s = NULL;
1180 (void) cg_mask_to_string(m, &s);
1181 fprintf(f, "%s\tCGroup own mask: %s\n", prefix, strnull(s));
1182 }
1183
1184 m = unit_get_members_mask(u);
1185 if (m != 0) {
1186 _cleanup_free_ char *s = NULL;
1187 (void) cg_mask_to_string(m, &s);
1188 fprintf(f, "%s\tCGroup members mask: %s\n", prefix, strnull(s));
1189 }
1190
1191 m = unit_get_delegate_mask(u);
1192 if (m != 0) {
1193 _cleanup_free_ char *s = NULL;
1194 (void) cg_mask_to_string(m, &s);
1195 fprintf(f, "%s\tCGroup delegate mask: %s\n", prefix, strnull(s));
1196 }
1197
1198 SET_FOREACH(t, u->names, i)
1199 fprintf(f, "%s\tName: %s\n", prefix, t);
1200
1201 if (!sd_id128_is_null(u->invocation_id))
1202 fprintf(f, "%s\tInvocation ID: " SD_ID128_FORMAT_STR "\n",
1203 prefix, SD_ID128_FORMAT_VAL(u->invocation_id));
1204
1205 STRV_FOREACH(j, u->documentation)
1206 fprintf(f, "%s\tDocumentation: %s\n", prefix, *j);
1207
1208 following = unit_following(u);
1209 if (following)
1210 fprintf(f, "%s\tFollowing: %s\n", prefix, following->id);
1211
1212 r = unit_following_set(u, &following_set);
1213 if (r >= 0) {
1214 Unit *other;
1215
1216 SET_FOREACH(other, following_set, i)
1217 fprintf(f, "%s\tFollowing Set Member: %s\n", prefix, other->id);
1218 }
1219
1220 if (u->fragment_path)
1221 fprintf(f, "%s\tFragment Path: %s\n", prefix, u->fragment_path);
1222
1223 if (u->source_path)
1224 fprintf(f, "%s\tSource Path: %s\n", prefix, u->source_path);
1225
1226 STRV_FOREACH(j, u->dropin_paths)
1227 fprintf(f, "%s\tDropIn Path: %s\n", prefix, *j);
1228
1229 if (u->failure_action != EMERGENCY_ACTION_NONE)
1230 fprintf(f, "%s\tFailure Action: %s\n", prefix, emergency_action_to_string(u->failure_action));
1231 if (u->failure_action_exit_status >= 0)
1232 fprintf(f, "%s\tFailure Action Exit Status: %i\n", prefix, u->failure_action_exit_status);
1233 if (u->success_action != EMERGENCY_ACTION_NONE)
1234 fprintf(f, "%s\tSuccess Action: %s\n", prefix, emergency_action_to_string(u->success_action));
1235 if (u->success_action_exit_status >= 0)
1236 fprintf(f, "%s\tSuccess Action Exit Status: %i\n", prefix, u->success_action_exit_status);
1237
1238 if (u->job_timeout != USEC_INFINITY)
1239 fprintf(f, "%s\tJob Timeout: %s\n", prefix, format_timespan(timespan, sizeof(timespan), u->job_timeout, 0));
1240
1241 if (u->job_timeout_action != EMERGENCY_ACTION_NONE)
1242 fprintf(f, "%s\tJob Timeout Action: %s\n", prefix, emergency_action_to_string(u->job_timeout_action));
1243
1244 if (u->job_timeout_reboot_arg)
1245 fprintf(f, "%s\tJob Timeout Reboot Argument: %s\n", prefix, u->job_timeout_reboot_arg);
1246
1247 condition_dump_list(u->conditions, f, prefix, condition_type_to_string);
1248 condition_dump_list(u->asserts, f, prefix, assert_type_to_string);
1249
1250 if (dual_timestamp_is_set(&u->condition_timestamp))
1251 fprintf(f,
1252 "%s\tCondition Timestamp: %s\n"
1253 "%s\tCondition Result: %s\n",
1254 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->condition_timestamp.realtime)),
1255 prefix, yes_no(u->condition_result));
1256
1257 if (dual_timestamp_is_set(&u->assert_timestamp))
1258 fprintf(f,
1259 "%s\tAssert Timestamp: %s\n"
1260 "%s\tAssert Result: %s\n",
1261 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->assert_timestamp.realtime)),
1262 prefix, yes_no(u->assert_result));
1263
1264 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
1265 UnitDependencyInfo di;
1266 Unit *other;
1267
1268 HASHMAP_FOREACH_KEY(di.data, other, u->dependencies[d], i) {
1269 bool space = false;
1270
1271 fprintf(f, "%s\t%s: %s (", prefix, unit_dependency_to_string(d), other->id);
1272
1273 print_unit_dependency_mask(f, "origin", di.origin_mask, &space);
1274 print_unit_dependency_mask(f, "destination", di.destination_mask, &space);
1275
1276 fputs(")\n", f);
1277 }
1278 }
1279
1280 if (!hashmap_isempty(u->requires_mounts_for)) {
1281 UnitDependencyInfo di;
1282 const char *path;
1283
1284 HASHMAP_FOREACH_KEY(di.data, path, u->requires_mounts_for, i) {
1285 bool space = false;
1286
1287 fprintf(f, "%s\tRequiresMountsFor: %s (", prefix, path);
1288
1289 print_unit_dependency_mask(f, "origin", di.origin_mask, &space);
1290 print_unit_dependency_mask(f, "destination", di.destination_mask, &space);
1291
1292 fputs(")\n", f);
1293 }
1294 }
1295
1296 if (u->load_state == UNIT_LOADED) {
1297
1298 fprintf(f,
1299 "%s\tStopWhenUnneeded: %s\n"
1300 "%s\tRefuseManualStart: %s\n"
1301 "%s\tRefuseManualStop: %s\n"
1302 "%s\tDefaultDependencies: %s\n"
1303 "%s\tOnFailureJobMode: %s\n"
1304 "%s\tIgnoreOnIsolate: %s\n",
1305 prefix, yes_no(u->stop_when_unneeded),
1306 prefix, yes_no(u->refuse_manual_start),
1307 prefix, yes_no(u->refuse_manual_stop),
1308 prefix, yes_no(u->default_dependencies),
1309 prefix, job_mode_to_string(u->on_failure_job_mode),
1310 prefix, yes_no(u->ignore_on_isolate));
1311
1312 if (UNIT_VTABLE(u)->dump)
1313 UNIT_VTABLE(u)->dump(u, f, prefix2);
1314
1315 } else if (u->load_state == UNIT_MERGED)
1316 fprintf(f,
1317 "%s\tMerged into: %s\n",
1318 prefix, u->merged_into->id);
1319 else if (u->load_state == UNIT_ERROR)
1320 fprintf(f, "%s\tLoad Error Code: %s\n", prefix, strerror(-u->load_error));
1321
1322 for (n = sd_bus_track_first(u->bus_track); n; n = sd_bus_track_next(u->bus_track))
1323 fprintf(f, "%s\tBus Ref: %s\n", prefix, n);
1324
1325 if (u->job)
1326 job_dump(u->job, f, prefix2);
1327
1328 if (u->nop_job)
1329 job_dump(u->nop_job, f, prefix2);
1330 }
1331
1332 /* Common implementation for multiple backends */
1333 int unit_load_fragment_and_dropin(Unit *u) {
1334 int r;
1335
1336 assert(u);
1337
1338 /* Load a .{service,socket,...} file */
1339 r = unit_load_fragment(u);
1340 if (r < 0)
1341 return r;
1342
1343 if (u->load_state == UNIT_STUB)
1344 return -ENOENT;
1345
1346 /* Load drop-in directory data. If u is an alias, we might be reloading the
1347 * target unit needlessly. But we cannot be sure which drops-ins have already
1348 * been loaded and which not, at least without doing complicated book-keeping,
1349 * so let's always reread all drop-ins. */
1350 return unit_load_dropin(unit_follow_merge(u));
1351 }
1352
1353 /* Common implementation for multiple backends */
1354 int unit_load_fragment_and_dropin_optional(Unit *u) {
1355 int r;
1356
1357 assert(u);
1358
1359 /* Same as unit_load_fragment_and_dropin(), but whether
1360 * something can be loaded or not doesn't matter. */
1361
1362 /* Load a .service/.socket/.slice/… file */
1363 r = unit_load_fragment(u);
1364 if (r < 0)
1365 return r;
1366
1367 if (u->load_state == UNIT_STUB)
1368 u->load_state = UNIT_LOADED;
1369
1370 /* Load drop-in directory data */
1371 return unit_load_dropin(unit_follow_merge(u));
1372 }
1373
1374 void unit_add_to_target_deps_queue(Unit *u) {
1375 Manager *m = u->manager;
1376
1377 assert(u);
1378
1379 if (u->in_target_deps_queue)
1380 return;
1381
1382 LIST_PREPEND(target_deps_queue, m->target_deps_queue, u);
1383 u->in_target_deps_queue = true;
1384 }
1385
1386 int unit_add_default_target_dependency(Unit *u, Unit *target) {
1387 assert(u);
1388 assert(target);
1389
1390 if (target->type != UNIT_TARGET)
1391 return 0;
1392
1393 /* Only add the dependency if both units are loaded, so that
1394 * that loop check below is reliable */
1395 if (u->load_state != UNIT_LOADED ||
1396 target->load_state != UNIT_LOADED)
1397 return 0;
1398
1399 /* If either side wants no automatic dependencies, then let's
1400 * skip this */
1401 if (!u->default_dependencies ||
1402 !target->default_dependencies)
1403 return 0;
1404
1405 /* Don't create loops */
1406 if (hashmap_get(target->dependencies[UNIT_BEFORE], u))
1407 return 0;
1408
1409 return unit_add_dependency(target, UNIT_AFTER, u, true, UNIT_DEPENDENCY_DEFAULT);
1410 }
1411
1412 static int unit_add_slice_dependencies(Unit *u) {
1413 UnitDependencyMask mask;
1414 assert(u);
1415
1416 if (!UNIT_HAS_CGROUP_CONTEXT(u))
1417 return 0;
1418
1419 /* Slice units are implicitly ordered against their parent slices (as this relationship is encoded in the
1420 name), while all other units are ordered based on configuration (as in their case Slice= configures the
1421 relationship). */
1422 mask = u->type == UNIT_SLICE ? UNIT_DEPENDENCY_IMPLICIT : UNIT_DEPENDENCY_FILE;
1423
1424 if (UNIT_ISSET(u->slice))
1425 return unit_add_two_dependencies(u, UNIT_AFTER, UNIT_REQUIRES, UNIT_DEREF(u->slice), true, mask);
1426
1427 if (unit_has_name(u, SPECIAL_ROOT_SLICE))
1428 return 0;
1429
1430 return unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_REQUIRES, SPECIAL_ROOT_SLICE, true, mask);
1431 }
1432
1433 static int unit_add_mount_dependencies(Unit *u) {
1434 UnitDependencyInfo di;
1435 const char *path;
1436 Iterator i;
1437 int r;
1438
1439 assert(u);
1440
1441 HASHMAP_FOREACH_KEY(di.data, path, u->requires_mounts_for, i) {
1442 char prefix[strlen(path) + 1];
1443
1444 PATH_FOREACH_PREFIX_MORE(prefix, path) {
1445 _cleanup_free_ char *p = NULL;
1446 Unit *m;
1447
1448 r = unit_name_from_path(prefix, ".mount", &p);
1449 if (r < 0)
1450 return r;
1451
1452 m = manager_get_unit(u->manager, p);
1453 if (!m) {
1454 /* Make sure to load the mount unit if
1455 * it exists. If so the dependencies
1456 * on this unit will be added later
1457 * during the loading of the mount
1458 * unit. */
1459 (void) manager_load_unit_prepare(u->manager, p, NULL, NULL, &m);
1460 continue;
1461 }
1462 if (m == u)
1463 continue;
1464
1465 if (m->load_state != UNIT_LOADED)
1466 continue;
1467
1468 r = unit_add_dependency(u, UNIT_AFTER, m, true, di.origin_mask);
1469 if (r < 0)
1470 return r;
1471
1472 if (m->fragment_path) {
1473 r = unit_add_dependency(u, UNIT_REQUIRES, m, true, di.origin_mask);
1474 if (r < 0)
1475 return r;
1476 }
1477 }
1478 }
1479
1480 return 0;
1481 }
1482
1483 static int unit_add_startup_units(Unit *u) {
1484 CGroupContext *c;
1485 int r;
1486
1487 c = unit_get_cgroup_context(u);
1488 if (!c)
1489 return 0;
1490
1491 if (c->startup_cpu_shares == CGROUP_CPU_SHARES_INVALID &&
1492 c->startup_io_weight == CGROUP_WEIGHT_INVALID &&
1493 c->startup_blockio_weight == CGROUP_BLKIO_WEIGHT_INVALID)
1494 return 0;
1495
1496 r = set_ensure_allocated(&u->manager->startup_units, NULL);
1497 if (r < 0)
1498 return r;
1499
1500 return set_put(u->manager->startup_units, u);
1501 }
1502
1503 int unit_load(Unit *u) {
1504 int r;
1505
1506 assert(u);
1507
1508 if (u->in_load_queue) {
1509 LIST_REMOVE(load_queue, u->manager->load_queue, u);
1510 u->in_load_queue = false;
1511 }
1512
1513 if (u->type == _UNIT_TYPE_INVALID)
1514 return -EINVAL;
1515
1516 if (u->load_state != UNIT_STUB)
1517 return 0;
1518
1519 if (u->transient_file) {
1520 /* Finalize transient file: if this is a transient unit file, as soon as we reach unit_load() the setup
1521 * is complete, hence let's synchronize the unit file we just wrote to disk. */
1522
1523 r = fflush_and_check(u->transient_file);
1524 if (r < 0)
1525 goto fail;
1526
1527 u->transient_file = safe_fclose(u->transient_file);
1528 u->fragment_mtime = now(CLOCK_REALTIME);
1529 }
1530
1531 if (UNIT_VTABLE(u)->load) {
1532 r = UNIT_VTABLE(u)->load(u);
1533 if (r < 0)
1534 goto fail;
1535 }
1536
1537 if (u->load_state == UNIT_STUB) {
1538 r = -ENOENT;
1539 goto fail;
1540 }
1541
1542 if (u->load_state == UNIT_LOADED) {
1543 unit_add_to_target_deps_queue(u);
1544
1545 r = unit_add_slice_dependencies(u);
1546 if (r < 0)
1547 goto fail;
1548
1549 r = unit_add_mount_dependencies(u);
1550 if (r < 0)
1551 goto fail;
1552
1553 r = unit_add_startup_units(u);
1554 if (r < 0)
1555 goto fail;
1556
1557 if (u->on_failure_job_mode == JOB_ISOLATE && hashmap_size(u->dependencies[UNIT_ON_FAILURE]) > 1) {
1558 log_unit_error(u, "More than one OnFailure= dependencies specified but OnFailureJobMode=isolate set. Refusing.");
1559 r = -ENOEXEC;
1560 goto fail;
1561 }
1562
1563 if (u->job_running_timeout != USEC_INFINITY && u->job_running_timeout > u->job_timeout)
1564 log_unit_warning(u, "JobRunningTimeoutSec= is greater than JobTimeoutSec=, it has no effect.");
1565
1566 /* We finished loading, let's ensure our parents recalculate the members mask */
1567 unit_invalidate_cgroup_members_masks(u);
1568 }
1569
1570 assert((u->load_state != UNIT_MERGED) == !u->merged_into);
1571
1572 unit_add_to_dbus_queue(unit_follow_merge(u));
1573 unit_add_to_gc_queue(u);
1574
1575 return 0;
1576
1577 fail:
1578 /* We convert ENOEXEC errors to the UNIT_BAD_SETTING load state here. Configuration parsing code should hence
1579 * return ENOEXEC to ensure units are placed in this state after loading */
1580
1581 u->load_state = u->load_state == UNIT_STUB ? UNIT_NOT_FOUND :
1582 r == -ENOEXEC ? UNIT_BAD_SETTING :
1583 UNIT_ERROR;
1584 u->load_error = r;
1585
1586 unit_add_to_dbus_queue(u);
1587 unit_add_to_gc_queue(u);
1588
1589 return log_unit_debug_errno(u, r, "Failed to load configuration: %m");
1590 }
1591
1592 _printf_(7, 8)
1593 static int log_unit_internal(void *userdata, int level, int error, const char *file, int line, const char *func, const char *format, ...) {
1594 Unit *u = userdata;
1595 va_list ap;
1596 int r;
1597
1598 va_start(ap, format);
1599 if (u)
1600 r = log_object_internalv(level, error, file, line, func,
1601 u->manager->unit_log_field,
1602 u->id,
1603 u->manager->invocation_log_field,
1604 u->invocation_id_string,
1605 format, ap);
1606 else
1607 r = log_internalv(level, error, file, line, func, format, ap);
1608 va_end(ap);
1609
1610 return r;
1611 }
1612
1613 static bool unit_test_condition(Unit *u) {
1614 assert(u);
1615
1616 dual_timestamp_get(&u->condition_timestamp);
1617 u->condition_result = condition_test_list(u->conditions, condition_type_to_string, log_unit_internal, u);
1618
1619 unit_add_to_dbus_queue(u);
1620
1621 return u->condition_result;
1622 }
1623
1624 static bool unit_test_assert(Unit *u) {
1625 assert(u);
1626
1627 dual_timestamp_get(&u->assert_timestamp);
1628 u->assert_result = condition_test_list(u->asserts, assert_type_to_string, log_unit_internal, u);
1629
1630 unit_add_to_dbus_queue(u);
1631
1632 return u->assert_result;
1633 }
1634
1635 void unit_status_printf(Unit *u, const char *status, const char *unit_status_msg_format) {
1636 const char *d;
1637
1638 d = unit_description(u);
1639 if (log_get_show_color())
1640 d = strjoina(ANSI_HIGHLIGHT, d, ANSI_NORMAL);
1641
1642 DISABLE_WARNING_FORMAT_NONLITERAL;
1643 manager_status_printf(u->manager, STATUS_TYPE_NORMAL, status, unit_status_msg_format, d);
1644 REENABLE_WARNING;
1645 }
1646
1647 int unit_test_start_limit(Unit *u) {
1648 const char *reason;
1649
1650 assert(u);
1651
1652 if (ratelimit_below(&u->start_limit)) {
1653 u->start_limit_hit = false;
1654 return 0;
1655 }
1656
1657 log_unit_warning(u, "Start request repeated too quickly.");
1658 u->start_limit_hit = true;
1659
1660 reason = strjoina("unit ", u->id, " failed");
1661
1662 emergency_action(u->manager, u->start_limit_action,
1663 EMERGENCY_ACTION_IS_WATCHDOG|EMERGENCY_ACTION_WARN,
1664 u->reboot_arg, -1, reason);
1665
1666 return -ECANCELED;
1667 }
1668
1669 bool unit_shall_confirm_spawn(Unit *u) {
1670 assert(u);
1671
1672 if (manager_is_confirm_spawn_disabled(u->manager))
1673 return false;
1674
1675 /* For some reasons units remaining in the same process group
1676 * as PID 1 fail to acquire the console even if it's not used
1677 * by any process. So skip the confirmation question for them. */
1678 return !unit_get_exec_context(u)->same_pgrp;
1679 }
1680
1681 static bool unit_verify_deps(Unit *u) {
1682 Unit *other;
1683 Iterator j;
1684 void *v;
1685
1686 assert(u);
1687
1688 /* Checks whether all BindsTo= dependencies of this unit are fulfilled — if they are also combined with
1689 * After=. We do not check Requires= or Requisite= here as they only should have an effect on the job
1690 * processing, but do not have any effect afterwards. We don't check BindsTo= dependencies that are not used in
1691 * conjunction with After= as for them any such check would make things entirely racy. */
1692
1693 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], j) {
1694
1695 if (!hashmap_contains(u->dependencies[UNIT_AFTER], other))
1696 continue;
1697
1698 if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(other))) {
1699 log_unit_notice(u, "Bound to unit %s, but unit isn't active.", other->id);
1700 return false;
1701 }
1702 }
1703
1704 return true;
1705 }
1706
1707 /* Errors that aren't really errors:
1708 * -EALREADY: Unit is already started.
1709 * -ECOMM: Condition failed
1710 * -EAGAIN: An operation is already in progress. Retry later.
1711 *
1712 * Errors that are real errors:
1713 * -EBADR: This unit type does not support starting.
1714 * -ECANCELED: Start limit hit, too many requests for now
1715 * -EPROTO: Assert failed
1716 * -EINVAL: Unit not loaded
1717 * -EOPNOTSUPP: Unit type not supported
1718 * -ENOLINK: The necessary dependencies are not fulfilled.
1719 * -ESTALE: This unit has been started before and can't be started a second time
1720 * -ENOENT: This is a triggering unit and unit to trigger is not loaded
1721 */
1722 int unit_start(Unit *u) {
1723 UnitActiveState state;
1724 Unit *following;
1725 int r;
1726
1727 assert(u);
1728
1729 /* If this is already started, then this will succeed. Note that this will even succeed if this unit
1730 * is not startable by the user. This is relied on to detect when we need to wait for units and when
1731 * waiting is finished. */
1732 state = unit_active_state(u);
1733 if (UNIT_IS_ACTIVE_OR_RELOADING(state))
1734 return -EALREADY;
1735
1736 /* Units that aren't loaded cannot be started */
1737 if (u->load_state != UNIT_LOADED)
1738 return -EINVAL;
1739
1740 /* Refuse starting scope units more than once */
1741 if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_enter_timestamp))
1742 return -ESTALE;
1743
1744 /* If the conditions failed, don't do anything at all. If we already are activating this call might
1745 * still be useful to speed up activation in case there is some hold-off time, but we don't want to
1746 * recheck the condition in that case. */
1747 if (state != UNIT_ACTIVATING &&
1748 !unit_test_condition(u)) {
1749
1750 /* Let's also check the start limit here. Normally, the start limit is only checked by the
1751 * .start() method of the unit type after it did some additional checks verifying everything
1752 * is in order (so that those other checks can propagate errors properly). However, if a
1753 * condition check doesn't hold we don't get that far but we should still ensure we are not
1754 * called in a tight loop without a rate limit check enforced, hence do the check here. Note
1755 * that ECOMM is generally not a reason for a job to fail, unlike most other errors here,
1756 * hence the chance is big that any triggering unit for us will trigger us again. Note this
1757 * condition check is a bit different from the condition check inside the per-unit .start()
1758 * function, as this one will not change the unit's state in any way (and we shouldn't here,
1759 * after all the condition failed). */
1760
1761 r = unit_test_start_limit(u);
1762 if (r < 0)
1763 return r;
1764
1765 return log_unit_debug_errno(u, SYNTHETIC_ERRNO(ECOMM), "Starting requested but condition failed. Not starting unit.");
1766 }
1767
1768 /* If the asserts failed, fail the entire job */
1769 if (state != UNIT_ACTIVATING &&
1770 !unit_test_assert(u))
1771 return log_unit_notice_errno(u, SYNTHETIC_ERRNO(EPROTO), "Starting requested but asserts failed.");
1772
1773 /* Units of types that aren't supported cannot be started. Note that we do this test only after the
1774 * condition checks, so that we rather return condition check errors (which are usually not
1775 * considered a true failure) than "not supported" errors (which are considered a failure).
1776 */
1777 if (!unit_supported(u))
1778 return -EOPNOTSUPP;
1779
1780 /* Let's make sure that the deps really are in order before we start this. Normally the job engine
1781 * should have taken care of this already, but let's check this here again. After all, our
1782 * dependencies might not be in effect anymore, due to a reload or due to a failed condition. */
1783 if (!unit_verify_deps(u))
1784 return -ENOLINK;
1785
1786 /* Forward to the main object, if we aren't it. */
1787 following = unit_following(u);
1788 if (following) {
1789 log_unit_debug(u, "Redirecting start request from %s to %s.", u->id, following->id);
1790 return unit_start(following);
1791 }
1792
1793 /* If it is stopped, but we cannot start it, then fail */
1794 if (!UNIT_VTABLE(u)->start)
1795 return -EBADR;
1796
1797 /* We don't suppress calls to ->start() here when we are already starting, to allow this request to
1798 * be used as a "hurry up" call, for example when the unit is in some "auto restart" state where it
1799 * waits for a holdoff timer to elapse before it will start again. */
1800
1801 unit_add_to_dbus_queue(u);
1802
1803 return UNIT_VTABLE(u)->start(u);
1804 }
1805
1806 bool unit_can_start(Unit *u) {
1807 assert(u);
1808
1809 if (u->load_state != UNIT_LOADED)
1810 return false;
1811
1812 if (!unit_supported(u))
1813 return false;
1814
1815 /* Scope units may be started only once */
1816 if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_exit_timestamp))
1817 return false;
1818
1819 return !!UNIT_VTABLE(u)->start;
1820 }
1821
1822 bool unit_can_isolate(Unit *u) {
1823 assert(u);
1824
1825 return unit_can_start(u) &&
1826 u->allow_isolate;
1827 }
1828
1829 /* Errors:
1830 * -EBADR: This unit type does not support stopping.
1831 * -EALREADY: Unit is already stopped.
1832 * -EAGAIN: An operation is already in progress. Retry later.
1833 */
1834 int unit_stop(Unit *u) {
1835 UnitActiveState state;
1836 Unit *following;
1837
1838 assert(u);
1839
1840 state = unit_active_state(u);
1841 if (UNIT_IS_INACTIVE_OR_FAILED(state))
1842 return -EALREADY;
1843
1844 following = unit_following(u);
1845 if (following) {
1846 log_unit_debug(u, "Redirecting stop request from %s to %s.", u->id, following->id);
1847 return unit_stop(following);
1848 }
1849
1850 if (!UNIT_VTABLE(u)->stop)
1851 return -EBADR;
1852
1853 unit_add_to_dbus_queue(u);
1854
1855 return UNIT_VTABLE(u)->stop(u);
1856 }
1857
1858 bool unit_can_stop(Unit *u) {
1859 assert(u);
1860
1861 if (!unit_supported(u))
1862 return false;
1863
1864 if (u->perpetual)
1865 return false;
1866
1867 return !!UNIT_VTABLE(u)->stop;
1868 }
1869
1870 /* Errors:
1871 * -EBADR: This unit type does not support reloading.
1872 * -ENOEXEC: Unit is not started.
1873 * -EAGAIN: An operation is already in progress. Retry later.
1874 */
1875 int unit_reload(Unit *u) {
1876 UnitActiveState state;
1877 Unit *following;
1878
1879 assert(u);
1880
1881 if (u->load_state != UNIT_LOADED)
1882 return -EINVAL;
1883
1884 if (!unit_can_reload(u))
1885 return -EBADR;
1886
1887 state = unit_active_state(u);
1888 if (state == UNIT_RELOADING)
1889 return -EAGAIN;
1890
1891 if (state != UNIT_ACTIVE) {
1892 log_unit_warning(u, "Unit cannot be reloaded because it is inactive.");
1893 return -ENOEXEC;
1894 }
1895
1896 following = unit_following(u);
1897 if (following) {
1898 log_unit_debug(u, "Redirecting reload request from %s to %s.", u->id, following->id);
1899 return unit_reload(following);
1900 }
1901
1902 unit_add_to_dbus_queue(u);
1903
1904 if (!UNIT_VTABLE(u)->reload) {
1905 /* Unit doesn't have a reload function, but we need to propagate the reload anyway */
1906 unit_notify(u, unit_active_state(u), unit_active_state(u), 0);
1907 return 0;
1908 }
1909
1910 return UNIT_VTABLE(u)->reload(u);
1911 }
1912
1913 bool unit_can_reload(Unit *u) {
1914 assert(u);
1915
1916 if (UNIT_VTABLE(u)->can_reload)
1917 return UNIT_VTABLE(u)->can_reload(u);
1918
1919 if (!hashmap_isempty(u->dependencies[UNIT_PROPAGATES_RELOAD_TO]))
1920 return true;
1921
1922 return UNIT_VTABLE(u)->reload;
1923 }
1924
1925 bool unit_is_unneeded(Unit *u) {
1926 static const UnitDependency deps[] = {
1927 UNIT_REQUIRED_BY,
1928 UNIT_REQUISITE_OF,
1929 UNIT_WANTED_BY,
1930 UNIT_BOUND_BY,
1931 };
1932 size_t j;
1933
1934 assert(u);
1935
1936 if (!u->stop_when_unneeded)
1937 return false;
1938
1939 /* Don't clean up while the unit is transitioning or is even inactive. */
1940 if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u)))
1941 return false;
1942 if (u->job)
1943 return false;
1944
1945 for (j = 0; j < ELEMENTSOF(deps); j++) {
1946 Unit *other;
1947 Iterator i;
1948 void *v;
1949
1950 /* If a dependent unit has a job queued, is active or transitioning, or is marked for
1951 * restart, then don't clean this one up. */
1952
1953 HASHMAP_FOREACH_KEY(v, other, u->dependencies[deps[j]], i) {
1954 if (other->job)
1955 return false;
1956
1957 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
1958 return false;
1959
1960 if (unit_will_restart(other))
1961 return false;
1962 }
1963 }
1964
1965 return true;
1966 }
1967
1968 static void check_unneeded_dependencies(Unit *u) {
1969
1970 static const UnitDependency deps[] = {
1971 UNIT_REQUIRES,
1972 UNIT_REQUISITE,
1973 UNIT_WANTS,
1974 UNIT_BINDS_TO,
1975 };
1976 size_t j;
1977
1978 assert(u);
1979
1980 /* Add all units this unit depends on to the queue that processes StopWhenUnneeded= behaviour. */
1981
1982 for (j = 0; j < ELEMENTSOF(deps); j++) {
1983 Unit *other;
1984 Iterator i;
1985 void *v;
1986
1987 HASHMAP_FOREACH_KEY(v, other, u->dependencies[deps[j]], i)
1988 unit_submit_to_stop_when_unneeded_queue(other);
1989 }
1990 }
1991
1992 static void unit_check_binds_to(Unit *u) {
1993 _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL;
1994 bool stop = false;
1995 Unit *other;
1996 Iterator i;
1997 void *v;
1998 int r;
1999
2000 assert(u);
2001
2002 if (u->job)
2003 return;
2004
2005 if (unit_active_state(u) != UNIT_ACTIVE)
2006 return;
2007
2008 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i) {
2009 if (other->job)
2010 continue;
2011
2012 if (!other->coldplugged)
2013 /* We might yet create a job for the other unit… */
2014 continue;
2015
2016 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
2017 continue;
2018
2019 stop = true;
2020 break;
2021 }
2022
2023 if (!stop)
2024 return;
2025
2026 /* If stopping a unit fails continuously we might enter a stop
2027 * loop here, hence stop acting on the service being
2028 * unnecessary after a while. */
2029 if (!ratelimit_below(&u->auto_stop_ratelimit)) {
2030 log_unit_warning(u, "Unit is bound to inactive unit %s, but not stopping since we tried this too often recently.", other->id);
2031 return;
2032 }
2033
2034 assert(other);
2035 log_unit_info(u, "Unit is bound to inactive unit %s. Stopping, too.", other->id);
2036
2037 /* A unit we need to run is gone. Sniff. Let's stop this. */
2038 r = manager_add_job(u->manager, JOB_STOP, u, JOB_FAIL, NULL, &error, NULL);
2039 if (r < 0)
2040 log_unit_warning_errno(u, r, "Failed to enqueue stop job, ignoring: %s", bus_error_message(&error, r));
2041 }
2042
2043 static void retroactively_start_dependencies(Unit *u) {
2044 Iterator i;
2045 Unit *other;
2046 void *v;
2047
2048 assert(u);
2049 assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)));
2050
2051 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_REQUIRES], i)
2052 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2053 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2054 manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL, NULL);
2055
2056 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i)
2057 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2058 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2059 manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL, NULL);
2060
2061 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_WANTS], i)
2062 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2063 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2064 manager_add_job(u->manager, JOB_START, other, JOB_FAIL, NULL, NULL, NULL);
2065
2066 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTS], i)
2067 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2068 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL, NULL);
2069
2070 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTED_BY], i)
2071 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2072 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL, NULL);
2073 }
2074
2075 static void retroactively_stop_dependencies(Unit *u) {
2076 Unit *other;
2077 Iterator i;
2078 void *v;
2079
2080 assert(u);
2081 assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)));
2082
2083 /* Pull down units which are bound to us recursively if enabled */
2084 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BOUND_BY], i)
2085 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2086 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL, NULL);
2087 }
2088
2089 void unit_start_on_failure(Unit *u) {
2090 Unit *other;
2091 Iterator i;
2092 void *v;
2093 int r;
2094
2095 assert(u);
2096
2097 if (hashmap_size(u->dependencies[UNIT_ON_FAILURE]) <= 0)
2098 return;
2099
2100 log_unit_info(u, "Triggering OnFailure= dependencies.");
2101
2102 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_ON_FAILURE], i) {
2103 _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL;
2104
2105 r = manager_add_job(u->manager, JOB_START, other, u->on_failure_job_mode, NULL, &error, NULL);
2106 if (r < 0)
2107 log_unit_warning_errno(u, r, "Failed to enqueue OnFailure= job, ignoring: %s", bus_error_message(&error, r));
2108 }
2109 }
2110
2111 void unit_trigger_notify(Unit *u) {
2112 Unit *other;
2113 Iterator i;
2114 void *v;
2115
2116 assert(u);
2117
2118 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_TRIGGERED_BY], i)
2119 if (UNIT_VTABLE(other)->trigger_notify)
2120 UNIT_VTABLE(other)->trigger_notify(other, u);
2121 }
2122
2123 static int unit_log_resources(Unit *u) {
2124 struct iovec iovec[1 + _CGROUP_IP_ACCOUNTING_METRIC_MAX + 4];
2125 bool any_traffic = false, have_ip_accounting = false;
2126 _cleanup_free_ char *igress = NULL, *egress = NULL;
2127 size_t n_message_parts = 0, n_iovec = 0;
2128 char* message_parts[3 + 1], *t;
2129 nsec_t nsec = NSEC_INFINITY;
2130 CGroupIPAccountingMetric m;
2131 size_t i;
2132 int r;
2133 const char* const ip_fields[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = {
2134 [CGROUP_IP_INGRESS_BYTES] = "IP_METRIC_INGRESS_BYTES",
2135 [CGROUP_IP_INGRESS_PACKETS] = "IP_METRIC_INGRESS_PACKETS",
2136 [CGROUP_IP_EGRESS_BYTES] = "IP_METRIC_EGRESS_BYTES",
2137 [CGROUP_IP_EGRESS_PACKETS] = "IP_METRIC_EGRESS_PACKETS",
2138 };
2139
2140 assert(u);
2141
2142 /* Invoked whenever a unit enters failed or dead state. Logs information about consumed resources if resource
2143 * accounting was enabled for a unit. It does this in two ways: a friendly human readable string with reduced
2144 * information and the complete data in structured fields. */
2145
2146 (void) unit_get_cpu_usage(u, &nsec);
2147 if (nsec != NSEC_INFINITY) {
2148 char buf[FORMAT_TIMESPAN_MAX] = "";
2149
2150 /* Format the CPU time for inclusion in the structured log message */
2151 if (asprintf(&t, "CPU_USAGE_NSEC=%" PRIu64, nsec) < 0) {
2152 r = log_oom();
2153 goto finish;
2154 }
2155 iovec[n_iovec++] = IOVEC_MAKE_STRING(t);
2156
2157 /* Format the CPU time for inclusion in the human language message string */
2158 format_timespan(buf, sizeof(buf), nsec / NSEC_PER_USEC, USEC_PER_MSEC);
2159 t = strjoin("consumed ", buf, " CPU time");
2160 if (!t) {
2161 r = log_oom();
2162 goto finish;
2163 }
2164
2165 message_parts[n_message_parts++] = t;
2166 }
2167
2168 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) {
2169 char buf[FORMAT_BYTES_MAX] = "";
2170 uint64_t value = UINT64_MAX;
2171
2172 assert(ip_fields[m]);
2173
2174 (void) unit_get_ip_accounting(u, m, &value);
2175 if (value == UINT64_MAX)
2176 continue;
2177
2178 have_ip_accounting = true;
2179 if (value > 0)
2180 any_traffic = true;
2181
2182 /* Format IP accounting data for inclusion in the structured log message */
2183 if (asprintf(&t, "%s=%" PRIu64, ip_fields[m], value) < 0) {
2184 r = log_oom();
2185 goto finish;
2186 }
2187 iovec[n_iovec++] = IOVEC_MAKE_STRING(t);
2188
2189 /* Format the IP accounting data for inclusion in the human language message string, but only for the
2190 * bytes counters (and not for the packets counters) */
2191 if (m == CGROUP_IP_INGRESS_BYTES) {
2192 assert(!igress);
2193 igress = strjoin("received ", format_bytes(buf, sizeof(buf), value), " IP traffic");
2194 if (!igress) {
2195 r = log_oom();
2196 goto finish;
2197 }
2198 } else if (m == CGROUP_IP_EGRESS_BYTES) {
2199 assert(!egress);
2200 egress = strjoin("sent ", format_bytes(buf, sizeof(buf), value), " IP traffic");
2201 if (!egress) {
2202 r = log_oom();
2203 goto finish;
2204 }
2205 }
2206 }
2207
2208 if (have_ip_accounting) {
2209 if (any_traffic) {
2210 if (igress)
2211 message_parts[n_message_parts++] = TAKE_PTR(igress);
2212 if (egress)
2213 message_parts[n_message_parts++] = TAKE_PTR(egress);
2214
2215 } else {
2216 char *k;
2217
2218 k = strdup("no IP traffic");
2219 if (!k) {
2220 r = log_oom();
2221 goto finish;
2222 }
2223
2224 message_parts[n_message_parts++] = k;
2225 }
2226 }
2227
2228 /* Is there any accounting data available at all? */
2229 if (n_iovec == 0) {
2230 r = 0;
2231 goto finish;
2232 }
2233
2234 if (n_message_parts == 0)
2235 t = strjoina("MESSAGE=", u->id, ": Completed.");
2236 else {
2237 _cleanup_free_ char *joined;
2238
2239 message_parts[n_message_parts] = NULL;
2240
2241 joined = strv_join(message_parts, ", ");
2242 if (!joined) {
2243 r = log_oom();
2244 goto finish;
2245 }
2246
2247 joined[0] = ascii_toupper(joined[0]);
2248 t = strjoina("MESSAGE=", u->id, ": ", joined, ".");
2249 }
2250
2251 /* The following four fields we allocate on the stack or are static strings, we hence don't want to free them,
2252 * and hence don't increase n_iovec for them */
2253 iovec[n_iovec] = IOVEC_MAKE_STRING(t);
2254 iovec[n_iovec + 1] = IOVEC_MAKE_STRING("MESSAGE_ID=" SD_MESSAGE_UNIT_RESOURCES_STR);
2255
2256 t = strjoina(u->manager->unit_log_field, u->id);
2257 iovec[n_iovec + 2] = IOVEC_MAKE_STRING(t);
2258
2259 t = strjoina(u->manager->invocation_log_field, u->invocation_id_string);
2260 iovec[n_iovec + 3] = IOVEC_MAKE_STRING(t);
2261
2262 log_struct_iovec(LOG_INFO, iovec, n_iovec + 4);
2263 r = 0;
2264
2265 finish:
2266 for (i = 0; i < n_message_parts; i++)
2267 free(message_parts[i]);
2268
2269 for (i = 0; i < n_iovec; i++)
2270 free(iovec[i].iov_base);
2271
2272 return r;
2273
2274 }
2275
2276 static void unit_update_on_console(Unit *u) {
2277 bool b;
2278
2279 assert(u);
2280
2281 b = unit_needs_console(u);
2282 if (u->on_console == b)
2283 return;
2284
2285 u->on_console = b;
2286 if (b)
2287 manager_ref_console(u->manager);
2288 else
2289 manager_unref_console(u->manager);
2290 }
2291
2292 static void unit_emit_audit_start(Unit *u) {
2293 assert(u);
2294
2295 if (u->type != UNIT_SERVICE)
2296 return;
2297
2298 /* Write audit record if we have just finished starting up */
2299 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_START, true);
2300 u->in_audit = true;
2301 }
2302
2303 static void unit_emit_audit_stop(Unit *u, UnitActiveState state) {
2304 assert(u);
2305
2306 if (u->type != UNIT_SERVICE)
2307 return;
2308
2309 if (u->in_audit) {
2310 /* Write audit record if we have just finished shutting down */
2311 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_STOP, state == UNIT_INACTIVE);
2312 u->in_audit = false;
2313 } else {
2314 /* Hmm, if there was no start record written write it now, so that we always have a nice pair */
2315 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_START, state == UNIT_INACTIVE);
2316
2317 if (state == UNIT_INACTIVE)
2318 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_STOP, true);
2319 }
2320 }
2321
2322 static bool unit_process_job(Job *j, UnitActiveState ns, UnitNotifyFlags flags) {
2323 bool unexpected = false;
2324
2325 assert(j);
2326
2327 if (j->state == JOB_WAITING)
2328
2329 /* So we reached a different state for this job. Let's see if we can run it now if it failed previously
2330 * due to EAGAIN. */
2331 job_add_to_run_queue(j);
2332
2333 /* Let's check whether the unit's new state constitutes a finished job, or maybe contradicts a running job and
2334 * hence needs to invalidate jobs. */
2335
2336 switch (j->type) {
2337
2338 case JOB_START:
2339 case JOB_VERIFY_ACTIVE:
2340
2341 if (UNIT_IS_ACTIVE_OR_RELOADING(ns))
2342 job_finish_and_invalidate(j, JOB_DONE, true, false);
2343 else if (j->state == JOB_RUNNING && ns != UNIT_ACTIVATING) {
2344 unexpected = true;
2345
2346 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2347 job_finish_and_invalidate(j, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false);
2348 }
2349
2350 break;
2351
2352 case JOB_RELOAD:
2353 case JOB_RELOAD_OR_START:
2354 case JOB_TRY_RELOAD:
2355
2356 if (j->state == JOB_RUNNING) {
2357 if (ns == UNIT_ACTIVE)
2358 job_finish_and_invalidate(j, (flags & UNIT_NOTIFY_RELOAD_FAILURE) ? JOB_FAILED : JOB_DONE, true, false);
2359 else if (!IN_SET(ns, UNIT_ACTIVATING, UNIT_RELOADING)) {
2360 unexpected = true;
2361
2362 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2363 job_finish_and_invalidate(j, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false);
2364 }
2365 }
2366
2367 break;
2368
2369 case JOB_STOP:
2370 case JOB_RESTART:
2371 case JOB_TRY_RESTART:
2372
2373 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2374 job_finish_and_invalidate(j, JOB_DONE, true, false);
2375 else if (j->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) {
2376 unexpected = true;
2377 job_finish_and_invalidate(j, JOB_FAILED, true, false);
2378 }
2379
2380 break;
2381
2382 default:
2383 assert_not_reached("Job type unknown");
2384 }
2385
2386 return unexpected;
2387 }
2388
2389 void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns, UnitNotifyFlags flags) {
2390 const char *reason;
2391 Manager *m;
2392
2393 assert(u);
2394 assert(os < _UNIT_ACTIVE_STATE_MAX);
2395 assert(ns < _UNIT_ACTIVE_STATE_MAX);
2396
2397 /* Note that this is called for all low-level state changes, even if they might map to the same high-level
2398 * UnitActiveState! That means that ns == os is an expected behavior here. For example: if a mount point is
2399 * remounted this function will be called too! */
2400
2401 m = u->manager;
2402
2403 /* Let's enqueue the change signal early. In case this unit has a job associated we want that this unit is in
2404 * the bus queue, so that any job change signal queued will force out the unit change signal first. */
2405 unit_add_to_dbus_queue(u);
2406
2407 /* Update timestamps for state changes */
2408 if (!MANAGER_IS_RELOADING(m)) {
2409 dual_timestamp_get(&u->state_change_timestamp);
2410
2411 if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns))
2412 u->inactive_exit_timestamp = u->state_change_timestamp;
2413 else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns))
2414 u->inactive_enter_timestamp = u->state_change_timestamp;
2415
2416 if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns))
2417 u->active_enter_timestamp = u->state_change_timestamp;
2418 else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns))
2419 u->active_exit_timestamp = u->state_change_timestamp;
2420 }
2421
2422 /* Keep track of failed units */
2423 (void) manager_update_failed_units(m, u, ns == UNIT_FAILED);
2424
2425 /* Make sure the cgroup and state files are always removed when we become inactive */
2426 if (UNIT_IS_INACTIVE_OR_FAILED(ns)) {
2427 unit_prune_cgroup(u);
2428 unit_unlink_state_files(u);
2429 }
2430
2431 unit_update_on_console(u);
2432
2433 if (!MANAGER_IS_RELOADING(m)) {
2434 bool unexpected;
2435
2436 /* Let's propagate state changes to the job */
2437 if (u->job)
2438 unexpected = unit_process_job(u->job, ns, flags);
2439 else
2440 unexpected = true;
2441
2442 /* If this state change happened without being requested by a job, then let's retroactively start or
2443 * stop dependencies. We skip that step when deserializing, since we don't want to create any
2444 * additional jobs just because something is already activated. */
2445
2446 if (unexpected) {
2447 if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns))
2448 retroactively_start_dependencies(u);
2449 else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns))
2450 retroactively_stop_dependencies(u);
2451 }
2452
2453 /* stop unneeded units regardless if going down was expected or not */
2454 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2455 check_unneeded_dependencies(u);
2456
2457 if (ns != os && ns == UNIT_FAILED) {
2458 log_unit_debug(u, "Unit entered failed state.");
2459
2460 if (!(flags & UNIT_NOTIFY_WILL_AUTO_RESTART))
2461 unit_start_on_failure(u);
2462 }
2463
2464 if (UNIT_IS_ACTIVE_OR_RELOADING(ns) && !UNIT_IS_ACTIVE_OR_RELOADING(os)) {
2465 /* This unit just finished starting up */
2466
2467 unit_emit_audit_start(u);
2468 manager_send_unit_plymouth(m, u);
2469 }
2470
2471 if (UNIT_IS_INACTIVE_OR_FAILED(ns) && !UNIT_IS_INACTIVE_OR_FAILED(os)) {
2472 /* This unit just stopped/failed. */
2473
2474 unit_emit_audit_stop(u, ns);
2475 unit_log_resources(u);
2476 }
2477 }
2478
2479 manager_recheck_journal(m);
2480 manager_recheck_dbus(m);
2481
2482 unit_trigger_notify(u);
2483
2484 if (!MANAGER_IS_RELOADING(m)) {
2485 /* Maybe we finished startup and are now ready for being stopped because unneeded? */
2486 unit_submit_to_stop_when_unneeded_queue(u);
2487
2488 /* Maybe we finished startup, but something we needed has vanished? Let's die then. (This happens when
2489 * something BindsTo= to a Type=oneshot unit, as these units go directly from starting to inactive,
2490 * without ever entering started.) */
2491 unit_check_binds_to(u);
2492
2493 if (os != UNIT_FAILED && ns == UNIT_FAILED) {
2494 reason = strjoina("unit ", u->id, " failed");
2495 emergency_action(m, u->failure_action, 0, u->reboot_arg, unit_failure_action_exit_status(u), reason);
2496 } else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && ns == UNIT_INACTIVE) {
2497 reason = strjoina("unit ", u->id, " succeeded");
2498 emergency_action(m, u->success_action, 0, u->reboot_arg, unit_success_action_exit_status(u), reason);
2499 }
2500 }
2501
2502 unit_add_to_gc_queue(u);
2503 }
2504
2505 int unit_watch_pid(Unit *u, pid_t pid, bool exclusive) {
2506 int r;
2507
2508 assert(u);
2509 assert(pid_is_valid(pid));
2510
2511 /* Watch a specific PID */
2512
2513 /* Caller might be sure that this PID belongs to this unit only. Let's take this
2514 * opportunity to remove any stalled references to this PID as they can be created
2515 * easily (when watching a process which is not our direct child). */
2516 if (exclusive)
2517 manager_unwatch_pid(u->manager, pid);
2518
2519 r = set_ensure_allocated(&u->pids, NULL);
2520 if (r < 0)
2521 return r;
2522
2523 r = hashmap_ensure_allocated(&u->manager->watch_pids, NULL);
2524 if (r < 0)
2525 return r;
2526
2527 /* First try, let's add the unit keyed by "pid". */
2528 r = hashmap_put(u->manager->watch_pids, PID_TO_PTR(pid), u);
2529 if (r == -EEXIST) {
2530 Unit **array;
2531 bool found = false;
2532 size_t n = 0;
2533
2534 /* OK, the "pid" key is already assigned to a different unit. Let's see if the "-pid" key (which points
2535 * to an array of Units rather than just a Unit), lists us already. */
2536
2537 array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid));
2538 if (array)
2539 for (; array[n]; n++)
2540 if (array[n] == u)
2541 found = true;
2542
2543 if (found) /* Found it already? if so, do nothing */
2544 r = 0;
2545 else {
2546 Unit **new_array;
2547
2548 /* Allocate a new array */
2549 new_array = new(Unit*, n + 2);
2550 if (!new_array)
2551 return -ENOMEM;
2552
2553 memcpy_safe(new_array, array, sizeof(Unit*) * n);
2554 new_array[n] = u;
2555 new_array[n+1] = NULL;
2556
2557 /* Add or replace the old array */
2558 r = hashmap_replace(u->manager->watch_pids, PID_TO_PTR(-pid), new_array);
2559 if (r < 0) {
2560 free(new_array);
2561 return r;
2562 }
2563
2564 free(array);
2565 }
2566 } else if (r < 0)
2567 return r;
2568
2569 r = set_put(u->pids, PID_TO_PTR(pid));
2570 if (r < 0)
2571 return r;
2572
2573 return 0;
2574 }
2575
2576 void unit_unwatch_pid(Unit *u, pid_t pid) {
2577 Unit **array;
2578
2579 assert(u);
2580 assert(pid_is_valid(pid));
2581
2582 /* First let's drop the unit in case it's keyed as "pid". */
2583 (void) hashmap_remove_value(u->manager->watch_pids, PID_TO_PTR(pid), u);
2584
2585 /* Then, let's also drop the unit, in case it's in the array keyed by -pid */
2586 array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid));
2587 if (array) {
2588 size_t n, m = 0;
2589
2590 /* Let's iterate through the array, dropping our own entry */
2591 for (n = 0; array[n]; n++)
2592 if (array[n] != u)
2593 array[m++] = array[n];
2594 array[m] = NULL;
2595
2596 if (m == 0) {
2597 /* The array is now empty, remove the entire entry */
2598 assert(hashmap_remove(u->manager->watch_pids, PID_TO_PTR(-pid)) == array);
2599 free(array);
2600 }
2601 }
2602
2603 (void) set_remove(u->pids, PID_TO_PTR(pid));
2604 }
2605
2606 void unit_unwatch_all_pids(Unit *u) {
2607 assert(u);
2608
2609 while (!set_isempty(u->pids))
2610 unit_unwatch_pid(u, PTR_TO_PID(set_first(u->pids)));
2611
2612 u->pids = set_free(u->pids);
2613 }
2614
2615 static void unit_tidy_watch_pids(Unit *u) {
2616 pid_t except1, except2;
2617 Iterator i;
2618 void *e;
2619
2620 assert(u);
2621
2622 /* Cleans dead PIDs from our list */
2623
2624 except1 = unit_main_pid(u);
2625 except2 = unit_control_pid(u);
2626
2627 SET_FOREACH(e, u->pids, i) {
2628 pid_t pid = PTR_TO_PID(e);
2629
2630 if (pid == except1 || pid == except2)
2631 continue;
2632
2633 if (!pid_is_unwaited(pid))
2634 unit_unwatch_pid(u, pid);
2635 }
2636 }
2637
2638 static int on_rewatch_pids_event(sd_event_source *s, void *userdata) {
2639 Unit *u = userdata;
2640
2641 assert(s);
2642 assert(u);
2643
2644 unit_tidy_watch_pids(u);
2645 unit_watch_all_pids(u);
2646
2647 /* If the PID set is empty now, then let's finish this off. */
2648 unit_synthesize_cgroup_empty_event(u);
2649
2650 return 0;
2651 }
2652
2653 int unit_enqueue_rewatch_pids(Unit *u) {
2654 int r;
2655
2656 assert(u);
2657
2658 if (!u->cgroup_path)
2659 return -ENOENT;
2660
2661 r = cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER);
2662 if (r < 0)
2663 return r;
2664 if (r > 0) /* On unified we can use proper notifications */
2665 return 0;
2666
2667 /* Enqueues a low-priority job that will clean up dead PIDs from our list of PIDs to watch and subscribe to new
2668 * PIDs that might have appeared. We do this in a delayed job because the work might be quite slow, as it
2669 * involves issuing kill(pid, 0) on all processes we watch. */
2670
2671 if (!u->rewatch_pids_event_source) {
2672 _cleanup_(sd_event_source_unrefp) sd_event_source *s = NULL;
2673
2674 r = sd_event_add_defer(u->manager->event, &s, on_rewatch_pids_event, u);
2675 if (r < 0)
2676 return log_error_errno(r, "Failed to allocate event source for tidying watched PIDs: %m");
2677
2678 r = sd_event_source_set_priority(s, SD_EVENT_PRIORITY_IDLE);
2679 if (r < 0)
2680 return log_error_errno(r, "Failed to adjust priority of event source for tidying watched PIDs: m");
2681
2682 (void) sd_event_source_set_description(s, "tidy-watch-pids");
2683
2684 u->rewatch_pids_event_source = TAKE_PTR(s);
2685 }
2686
2687 r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_ONESHOT);
2688 if (r < 0)
2689 return log_error_errno(r, "Failed to enable event source for tidying watched PIDs: %m");
2690
2691 return 0;
2692 }
2693
2694 void unit_dequeue_rewatch_pids(Unit *u) {
2695 int r;
2696 assert(u);
2697
2698 if (!u->rewatch_pids_event_source)
2699 return;
2700
2701 r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_OFF);
2702 if (r < 0)
2703 log_warning_errno(r, "Failed to disable event source for tidying watched PIDs, ignoring: %m");
2704
2705 u->rewatch_pids_event_source = sd_event_source_unref(u->rewatch_pids_event_source);
2706 }
2707
2708 bool unit_job_is_applicable(Unit *u, JobType j) {
2709 assert(u);
2710 assert(j >= 0 && j < _JOB_TYPE_MAX);
2711
2712 switch (j) {
2713
2714 case JOB_VERIFY_ACTIVE:
2715 case JOB_START:
2716 case JOB_NOP:
2717 /* Note that we don't check unit_can_start() here. That's because .device units and suchlike are not
2718 * startable by us but may appear due to external events, and it thus makes sense to permit enqueing
2719 * jobs for it. */
2720 return true;
2721
2722 case JOB_STOP:
2723 /* Similar as above. However, perpetual units can never be stopped (neither explicitly nor due to
2724 * external events), hence it makes no sense to permit enqueing such a request either. */
2725 return !u->perpetual;
2726
2727 case JOB_RESTART:
2728 case JOB_TRY_RESTART:
2729 return unit_can_stop(u) && unit_can_start(u);
2730
2731 case JOB_RELOAD:
2732 case JOB_TRY_RELOAD:
2733 return unit_can_reload(u);
2734
2735 case JOB_RELOAD_OR_START:
2736 return unit_can_reload(u) && unit_can_start(u);
2737
2738 default:
2739 assert_not_reached("Invalid job type");
2740 }
2741 }
2742
2743 static void maybe_warn_about_dependency(Unit *u, const char *other, UnitDependency dependency) {
2744 assert(u);
2745
2746 /* Only warn about some unit types */
2747 if (!IN_SET(dependency, UNIT_CONFLICTS, UNIT_CONFLICTED_BY, UNIT_BEFORE, UNIT_AFTER, UNIT_ON_FAILURE, UNIT_TRIGGERS, UNIT_TRIGGERED_BY))
2748 return;
2749
2750 if (streq_ptr(u->id, other))
2751 log_unit_warning(u, "Dependency %s=%s dropped", unit_dependency_to_string(dependency), u->id);
2752 else
2753 log_unit_warning(u, "Dependency %s=%s dropped, merged into %s", unit_dependency_to_string(dependency), strna(other), u->id);
2754 }
2755
2756 static int unit_add_dependency_hashmap(
2757 Hashmap **h,
2758 Unit *other,
2759 UnitDependencyMask origin_mask,
2760 UnitDependencyMask destination_mask) {
2761
2762 UnitDependencyInfo info;
2763 int r;
2764
2765 assert(h);
2766 assert(other);
2767 assert(origin_mask < _UNIT_DEPENDENCY_MASK_FULL);
2768 assert(destination_mask < _UNIT_DEPENDENCY_MASK_FULL);
2769 assert(origin_mask > 0 || destination_mask > 0);
2770
2771 r = hashmap_ensure_allocated(h, NULL);
2772 if (r < 0)
2773 return r;
2774
2775 assert_cc(sizeof(void*) == sizeof(info));
2776
2777 info.data = hashmap_get(*h, other);
2778 if (info.data) {
2779 /* Entry already exists. Add in our mask. */
2780
2781 if (FLAGS_SET(origin_mask, info.origin_mask) &&
2782 FLAGS_SET(destination_mask, info.destination_mask))
2783 return 0; /* NOP */
2784
2785 info.origin_mask |= origin_mask;
2786 info.destination_mask |= destination_mask;
2787
2788 r = hashmap_update(*h, other, info.data);
2789 } else {
2790 info = (UnitDependencyInfo) {
2791 .origin_mask = origin_mask,
2792 .destination_mask = destination_mask,
2793 };
2794
2795 r = hashmap_put(*h, other, info.data);
2796 }
2797 if (r < 0)
2798 return r;
2799
2800 return 1;
2801 }
2802
2803 int unit_add_dependency(
2804 Unit *u,
2805 UnitDependency d,
2806 Unit *other,
2807 bool add_reference,
2808 UnitDependencyMask mask) {
2809
2810 static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = {
2811 [UNIT_REQUIRES] = UNIT_REQUIRED_BY,
2812 [UNIT_WANTS] = UNIT_WANTED_BY,
2813 [UNIT_REQUISITE] = UNIT_REQUISITE_OF,
2814 [UNIT_BINDS_TO] = UNIT_BOUND_BY,
2815 [UNIT_PART_OF] = UNIT_CONSISTS_OF,
2816 [UNIT_REQUIRED_BY] = UNIT_REQUIRES,
2817 [UNIT_REQUISITE_OF] = UNIT_REQUISITE,
2818 [UNIT_WANTED_BY] = UNIT_WANTS,
2819 [UNIT_BOUND_BY] = UNIT_BINDS_TO,
2820 [UNIT_CONSISTS_OF] = UNIT_PART_OF,
2821 [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY,
2822 [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS,
2823 [UNIT_BEFORE] = UNIT_AFTER,
2824 [UNIT_AFTER] = UNIT_BEFORE,
2825 [UNIT_ON_FAILURE] = _UNIT_DEPENDENCY_INVALID,
2826 [UNIT_REFERENCES] = UNIT_REFERENCED_BY,
2827 [UNIT_REFERENCED_BY] = UNIT_REFERENCES,
2828 [UNIT_TRIGGERS] = UNIT_TRIGGERED_BY,
2829 [UNIT_TRIGGERED_BY] = UNIT_TRIGGERS,
2830 [UNIT_PROPAGATES_RELOAD_TO] = UNIT_RELOAD_PROPAGATED_FROM,
2831 [UNIT_RELOAD_PROPAGATED_FROM] = UNIT_PROPAGATES_RELOAD_TO,
2832 [UNIT_JOINS_NAMESPACE_OF] = UNIT_JOINS_NAMESPACE_OF,
2833 };
2834 Unit *original_u = u, *original_other = other;
2835 int r;
2836
2837 assert(u);
2838 assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX);
2839 assert(other);
2840
2841 u = unit_follow_merge(u);
2842 other = unit_follow_merge(other);
2843
2844 /* We won't allow dependencies on ourselves. We will not
2845 * consider them an error however. */
2846 if (u == other) {
2847 maybe_warn_about_dependency(original_u, original_other->id, d);
2848 return 0;
2849 }
2850
2851 if ((d == UNIT_BEFORE && other->type == UNIT_DEVICE) ||
2852 (d == UNIT_AFTER && u->type == UNIT_DEVICE)) {
2853 log_unit_warning(u, "Dependency Before=%s ignored (.device units cannot be delayed)", other->id);
2854 return 0;
2855 }
2856
2857 r = unit_add_dependency_hashmap(u->dependencies + d, other, mask, 0);
2858 if (r < 0)
2859 return r;
2860
2861 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID && inverse_table[d] != d) {
2862 r = unit_add_dependency_hashmap(other->dependencies + inverse_table[d], u, 0, mask);
2863 if (r < 0)
2864 return r;
2865 }
2866
2867 if (add_reference) {
2868 r = unit_add_dependency_hashmap(u->dependencies + UNIT_REFERENCES, other, mask, 0);
2869 if (r < 0)
2870 return r;
2871
2872 r = unit_add_dependency_hashmap(other->dependencies + UNIT_REFERENCED_BY, u, 0, mask);
2873 if (r < 0)
2874 return r;
2875 }
2876
2877 unit_add_to_dbus_queue(u);
2878 return 0;
2879 }
2880
2881 int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference, UnitDependencyMask mask) {
2882 int r;
2883
2884 assert(u);
2885
2886 r = unit_add_dependency(u, d, other, add_reference, mask);
2887 if (r < 0)
2888 return r;
2889
2890 return unit_add_dependency(u, e, other, add_reference, mask);
2891 }
2892
2893 static int resolve_template(Unit *u, const char *name, char **buf, const char **ret) {
2894 int r;
2895
2896 assert(u);
2897 assert(name);
2898 assert(buf);
2899 assert(ret);
2900
2901 if (!unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) {
2902 *buf = NULL;
2903 *ret = name;
2904 return 0;
2905 }
2906
2907 if (u->instance)
2908 r = unit_name_replace_instance(name, u->instance, buf);
2909 else {
2910 _cleanup_free_ char *i = NULL;
2911
2912 r = unit_name_to_prefix(u->id, &i);
2913 if (r < 0)
2914 return r;
2915
2916 r = unit_name_replace_instance(name, i, buf);
2917 }
2918 if (r < 0)
2919 return r;
2920
2921 *ret = *buf;
2922 return 0;
2923 }
2924
2925 int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, bool add_reference, UnitDependencyMask mask) {
2926 _cleanup_free_ char *buf = NULL;
2927 Unit *other;
2928 int r;
2929
2930 assert(u);
2931 assert(name);
2932
2933 r = resolve_template(u, name, &buf, &name);
2934 if (r < 0)
2935 return r;
2936
2937 r = manager_load_unit(u->manager, name, NULL, NULL, &other);
2938 if (r < 0)
2939 return r;
2940
2941 return unit_add_dependency(u, d, other, add_reference, mask);
2942 }
2943
2944 int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, bool add_reference, UnitDependencyMask mask) {
2945 _cleanup_free_ char *buf = NULL;
2946 Unit *other;
2947 int r;
2948
2949 assert(u);
2950 assert(name);
2951
2952 r = resolve_template(u, name, &buf, &name);
2953 if (r < 0)
2954 return r;
2955
2956 r = manager_load_unit(u->manager, name, NULL, NULL, &other);
2957 if (r < 0)
2958 return r;
2959
2960 return unit_add_two_dependencies(u, d, e, other, add_reference, mask);
2961 }
2962
2963 int set_unit_path(const char *p) {
2964 /* This is mostly for debug purposes */
2965 if (setenv("SYSTEMD_UNIT_PATH", p, 1) < 0)
2966 return -errno;
2967
2968 return 0;
2969 }
2970
2971 char *unit_dbus_path(Unit *u) {
2972 assert(u);
2973
2974 if (!u->id)
2975 return NULL;
2976
2977 return unit_dbus_path_from_name(u->id);
2978 }
2979
2980 char *unit_dbus_path_invocation_id(Unit *u) {
2981 assert(u);
2982
2983 if (sd_id128_is_null(u->invocation_id))
2984 return NULL;
2985
2986 return unit_dbus_path_from_name(u->invocation_id_string);
2987 }
2988
2989 int unit_set_slice(Unit *u, Unit *slice) {
2990 assert(u);
2991 assert(slice);
2992
2993 /* Sets the unit slice if it has not been set before. Is extra
2994 * careful, to only allow this for units that actually have a
2995 * cgroup context. Also, we don't allow to set this for slices
2996 * (since the parent slice is derived from the name). Make
2997 * sure the unit we set is actually a slice. */
2998
2999 if (!UNIT_HAS_CGROUP_CONTEXT(u))
3000 return -EOPNOTSUPP;
3001
3002 if (u->type == UNIT_SLICE)
3003 return -EINVAL;
3004
3005 if (unit_active_state(u) != UNIT_INACTIVE)
3006 return -EBUSY;
3007
3008 if (slice->type != UNIT_SLICE)
3009 return -EINVAL;
3010
3011 if (unit_has_name(u, SPECIAL_INIT_SCOPE) &&
3012 !unit_has_name(slice, SPECIAL_ROOT_SLICE))
3013 return -EPERM;
3014
3015 if (UNIT_DEREF(u->slice) == slice)
3016 return 0;
3017
3018 /* Disallow slice changes if @u is already bound to cgroups */
3019 if (UNIT_ISSET(u->slice) && u->cgroup_realized)
3020 return -EBUSY;
3021
3022 unit_ref_set(&u->slice, u, slice);
3023 return 1;
3024 }
3025
3026 int unit_set_default_slice(Unit *u) {
3027 const char *slice_name;
3028 Unit *slice;
3029 int r;
3030
3031 assert(u);
3032
3033 if (UNIT_ISSET(u->slice))
3034 return 0;
3035
3036 if (u->instance) {
3037 _cleanup_free_ char *prefix = NULL, *escaped = NULL;
3038
3039 /* Implicitly place all instantiated units in their
3040 * own per-template slice */
3041
3042 r = unit_name_to_prefix(u->id, &prefix);
3043 if (r < 0)
3044 return r;
3045
3046 /* The prefix is already escaped, but it might include
3047 * "-" which has a special meaning for slice units,
3048 * hence escape it here extra. */
3049 escaped = unit_name_escape(prefix);
3050 if (!escaped)
3051 return -ENOMEM;
3052
3053 if (MANAGER_IS_SYSTEM(u->manager))
3054 slice_name = strjoina("system-", escaped, ".slice");
3055 else
3056 slice_name = strjoina(escaped, ".slice");
3057 } else
3058 slice_name =
3059 MANAGER_IS_SYSTEM(u->manager) && !unit_has_name(u, SPECIAL_INIT_SCOPE)
3060 ? SPECIAL_SYSTEM_SLICE
3061 : SPECIAL_ROOT_SLICE;
3062
3063 r = manager_load_unit(u->manager, slice_name, NULL, NULL, &slice);
3064 if (r < 0)
3065 return r;
3066
3067 return unit_set_slice(u, slice);
3068 }
3069
3070 const char *unit_slice_name(Unit *u) {
3071 assert(u);
3072
3073 if (!UNIT_ISSET(u->slice))
3074 return NULL;
3075
3076 return UNIT_DEREF(u->slice)->id;
3077 }
3078
3079 int unit_load_related_unit(Unit *u, const char *type, Unit **_found) {
3080 _cleanup_free_ char *t = NULL;
3081 int r;
3082
3083 assert(u);
3084 assert(type);
3085 assert(_found);
3086
3087 r = unit_name_change_suffix(u->id, type, &t);
3088 if (r < 0)
3089 return r;
3090 if (unit_has_name(u, t))
3091 return -EINVAL;
3092
3093 r = manager_load_unit(u->manager, t, NULL, NULL, _found);
3094 assert(r < 0 || *_found != u);
3095 return r;
3096 }
3097
3098 static int signal_name_owner_changed(sd_bus_message *message, void *userdata, sd_bus_error *error) {
3099 const char *name, *old_owner, *new_owner;
3100 Unit *u = userdata;
3101 int r;
3102
3103 assert(message);
3104 assert(u);
3105
3106 r = sd_bus_message_read(message, "sss", &name, &old_owner, &new_owner);
3107 if (r < 0) {
3108 bus_log_parse_error(r);
3109 return 0;
3110 }
3111
3112 old_owner = empty_to_null(old_owner);
3113 new_owner = empty_to_null(new_owner);
3114
3115 if (UNIT_VTABLE(u)->bus_name_owner_change)
3116 UNIT_VTABLE(u)->bus_name_owner_change(u, name, old_owner, new_owner);
3117
3118 return 0;
3119 }
3120
3121 int unit_install_bus_match(Unit *u, sd_bus *bus, const char *name) {
3122 const char *match;
3123
3124 assert(u);
3125 assert(bus);
3126 assert(name);
3127
3128 if (u->match_bus_slot)
3129 return -EBUSY;
3130
3131 match = strjoina("type='signal',"
3132 "sender='org.freedesktop.DBus',"
3133 "path='/org/freedesktop/DBus',"
3134 "interface='org.freedesktop.DBus',"
3135 "member='NameOwnerChanged',"
3136 "arg0='", name, "'");
3137
3138 return sd_bus_add_match_async(bus, &u->match_bus_slot, match, signal_name_owner_changed, NULL, u);
3139 }
3140
3141 int unit_watch_bus_name(Unit *u, const char *name) {
3142 int r;
3143
3144 assert(u);
3145 assert(name);
3146
3147 /* Watch a specific name on the bus. We only support one unit
3148 * watching each name for now. */
3149
3150 if (u->manager->api_bus) {
3151 /* If the bus is already available, install the match directly.
3152 * Otherwise, just put the name in the list. bus_setup_api() will take care later. */
3153 r = unit_install_bus_match(u, u->manager->api_bus, name);
3154 if (r < 0)
3155 return log_warning_errno(r, "Failed to subscribe to NameOwnerChanged signal for '%s': %m", name);
3156 }
3157
3158 r = hashmap_put(u->manager->watch_bus, name, u);
3159 if (r < 0) {
3160 u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot);
3161 return log_warning_errno(r, "Failed to put bus name to hashmap: %m");
3162 }
3163
3164 return 0;
3165 }
3166
3167 void unit_unwatch_bus_name(Unit *u, const char *name) {
3168 assert(u);
3169 assert(name);
3170
3171 (void) hashmap_remove_value(u->manager->watch_bus, name, u);
3172 u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot);
3173 }
3174
3175 bool unit_can_serialize(Unit *u) {
3176 assert(u);
3177
3178 return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item;
3179 }
3180
3181 static int serialize_cgroup_mask(FILE *f, const char *key, CGroupMask mask) {
3182 _cleanup_free_ char *s = NULL;
3183 int r;
3184
3185 assert(f);
3186 assert(key);
3187
3188 if (mask == 0)
3189 return 0;
3190
3191 r = cg_mask_to_string(mask, &s);
3192 if (r < 0)
3193 return log_error_errno(r, "Failed to format cgroup mask: %m");
3194
3195 return serialize_item(f, key, s);
3196 }
3197
3198 static const char *const ip_accounting_metric_field[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = {
3199 [CGROUP_IP_INGRESS_BYTES] = "ip-accounting-ingress-bytes",
3200 [CGROUP_IP_INGRESS_PACKETS] = "ip-accounting-ingress-packets",
3201 [CGROUP_IP_EGRESS_BYTES] = "ip-accounting-egress-bytes",
3202 [CGROUP_IP_EGRESS_PACKETS] = "ip-accounting-egress-packets",
3203 };
3204
3205 int unit_serialize(Unit *u, FILE *f, FDSet *fds, bool serialize_jobs) {
3206 CGroupIPAccountingMetric m;
3207 int r;
3208
3209 assert(u);
3210 assert(f);
3211 assert(fds);
3212
3213 if (unit_can_serialize(u)) {
3214 r = UNIT_VTABLE(u)->serialize(u, f, fds);
3215 if (r < 0)
3216 return r;
3217 }
3218
3219 (void) serialize_dual_timestamp(f, "state-change-timestamp", &u->state_change_timestamp);
3220
3221 (void) serialize_dual_timestamp(f, "inactive-exit-timestamp", &u->inactive_exit_timestamp);
3222 (void) serialize_dual_timestamp(f, "active-enter-timestamp", &u->active_enter_timestamp);
3223 (void) serialize_dual_timestamp(f, "active-exit-timestamp", &u->active_exit_timestamp);
3224 (void) serialize_dual_timestamp(f, "inactive-enter-timestamp", &u->inactive_enter_timestamp);
3225
3226 (void) serialize_dual_timestamp(f, "condition-timestamp", &u->condition_timestamp);
3227 (void) serialize_dual_timestamp(f, "assert-timestamp", &u->assert_timestamp);
3228
3229 if (dual_timestamp_is_set(&u->condition_timestamp))
3230 (void) serialize_bool(f, "condition-result", u->condition_result);
3231
3232 if (dual_timestamp_is_set(&u->assert_timestamp))
3233 (void) serialize_bool(f, "assert-result", u->assert_result);
3234
3235 (void) serialize_bool(f, "transient", u->transient);
3236 (void) serialize_bool(f, "in-audit", u->in_audit);
3237
3238 (void) serialize_bool(f, "exported-invocation-id", u->exported_invocation_id);
3239 (void) serialize_bool(f, "exported-log-level-max", u->exported_log_level_max);
3240 (void) serialize_bool(f, "exported-log-extra-fields", u->exported_log_extra_fields);
3241 (void) serialize_bool(f, "exported-log-rate-limit-interval", u->exported_log_rate_limit_interval);
3242 (void) serialize_bool(f, "exported-log-rate-limit-burst", u->exported_log_rate_limit_burst);
3243
3244 (void) serialize_item_format(f, "cpu-usage-base", "%" PRIu64, u->cpu_usage_base);
3245 if (u->cpu_usage_last != NSEC_INFINITY)
3246 (void) serialize_item_format(f, "cpu-usage-last", "%" PRIu64, u->cpu_usage_last);
3247
3248 if (u->cgroup_path)
3249 (void) serialize_item(f, "cgroup", u->cgroup_path);
3250
3251 (void) serialize_bool(f, "cgroup-realized", u->cgroup_realized);
3252 (void) serialize_cgroup_mask(f, "cgroup-realized-mask", u->cgroup_realized_mask);
3253 (void) serialize_cgroup_mask(f, "cgroup-enabled-mask", u->cgroup_enabled_mask);
3254 (void) serialize_cgroup_mask(f, "cgroup-invalidated-mask", u->cgroup_invalidated_mask);
3255
3256 if (uid_is_valid(u->ref_uid))
3257 (void) serialize_item_format(f, "ref-uid", UID_FMT, u->ref_uid);
3258 if (gid_is_valid(u->ref_gid))
3259 (void) serialize_item_format(f, "ref-gid", GID_FMT, u->ref_gid);
3260
3261 if (!sd_id128_is_null(u->invocation_id))
3262 (void) serialize_item_format(f, "invocation-id", SD_ID128_FORMAT_STR, SD_ID128_FORMAT_VAL(u->invocation_id));
3263
3264 bus_track_serialize(u->bus_track, f, "ref");
3265
3266 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) {
3267 uint64_t v;
3268
3269 r = unit_get_ip_accounting(u, m, &v);
3270 if (r >= 0)
3271 (void) serialize_item_format(f, ip_accounting_metric_field[m], "%" PRIu64, v);
3272 }
3273
3274 if (serialize_jobs) {
3275 if (u->job) {
3276 fputs("job\n", f);
3277 job_serialize(u->job, f);
3278 }
3279
3280 if (u->nop_job) {
3281 fputs("job\n", f);
3282 job_serialize(u->nop_job, f);
3283 }
3284 }
3285
3286 /* End marker */
3287 fputc('\n', f);
3288 return 0;
3289 }
3290
3291 static int unit_deserialize_job(Unit *u, FILE *f) {
3292 _cleanup_(job_freep) Job *j = NULL;
3293 int r;
3294
3295 assert(u);
3296 assert(f);
3297
3298 j = job_new_raw(u);
3299 if (!j)
3300 return log_oom();
3301
3302 r = job_deserialize(j, f);
3303 if (r < 0)
3304 return r;
3305
3306 r = job_install_deserialized(j);
3307 if (r < 0)
3308 return r;
3309
3310 TAKE_PTR(j);
3311 return 0;
3312 }
3313
3314 int unit_deserialize(Unit *u, FILE *f, FDSet *fds) {
3315 int r;
3316
3317 assert(u);
3318 assert(f);
3319 assert(fds);
3320
3321 for (;;) {
3322 _cleanup_free_ char *line = NULL;
3323 CGroupIPAccountingMetric m;
3324 char *l, *v;
3325 size_t k;
3326
3327 r = read_line(f, LONG_LINE_MAX, &line);
3328 if (r < 0)
3329 return log_error_errno(r, "Failed to read serialization line: %m");
3330 if (r == 0) /* eof */
3331 break;
3332
3333 l = strstrip(line);
3334 if (isempty(l)) /* End marker */
3335 break;
3336
3337 k = strcspn(l, "=");
3338
3339 if (l[k] == '=') {
3340 l[k] = 0;
3341 v = l+k+1;
3342 } else
3343 v = l+k;
3344
3345 if (streq(l, "job")) {
3346 if (v[0] == '\0') {
3347 /* New-style serialized job */
3348 r = unit_deserialize_job(u, f);
3349 if (r < 0)
3350 return r;
3351 } else /* Legacy for pre-44 */
3352 log_unit_warning(u, "Update from too old systemd versions are unsupported, cannot deserialize job: %s", v);
3353 continue;
3354 } else if (streq(l, "state-change-timestamp")) {
3355 (void) deserialize_dual_timestamp(v, &u->state_change_timestamp);
3356 continue;
3357 } else if (streq(l, "inactive-exit-timestamp")) {
3358 (void) deserialize_dual_timestamp(v, &u->inactive_exit_timestamp);
3359 continue;
3360 } else if (streq(l, "active-enter-timestamp")) {
3361 (void) deserialize_dual_timestamp(v, &u->active_enter_timestamp);
3362 continue;
3363 } else if (streq(l, "active-exit-timestamp")) {
3364 (void) deserialize_dual_timestamp(v, &u->active_exit_timestamp);
3365 continue;
3366 } else if (streq(l, "inactive-enter-timestamp")) {
3367 (void) deserialize_dual_timestamp(v, &u->inactive_enter_timestamp);
3368 continue;
3369 } else if (streq(l, "condition-timestamp")) {
3370 (void) deserialize_dual_timestamp(v, &u->condition_timestamp);
3371 continue;
3372 } else if (streq(l, "assert-timestamp")) {
3373 (void) deserialize_dual_timestamp(v, &u->assert_timestamp);
3374 continue;
3375 } else if (streq(l, "condition-result")) {
3376
3377 r = parse_boolean(v);
3378 if (r < 0)
3379 log_unit_debug(u, "Failed to parse condition result value %s, ignoring.", v);
3380 else
3381 u->condition_result = r;
3382
3383 continue;
3384
3385 } else if (streq(l, "assert-result")) {
3386
3387 r = parse_boolean(v);
3388 if (r < 0)
3389 log_unit_debug(u, "Failed to parse assert result value %s, ignoring.", v);
3390 else
3391 u->assert_result = r;
3392
3393 continue;
3394
3395 } else if (streq(l, "transient")) {
3396
3397 r = parse_boolean(v);
3398 if (r < 0)
3399 log_unit_debug(u, "Failed to parse transient bool %s, ignoring.", v);
3400 else
3401 u->transient = r;
3402
3403 continue;
3404
3405 } else if (streq(l, "in-audit")) {
3406
3407 r = parse_boolean(v);
3408 if (r < 0)
3409 log_unit_debug(u, "Failed to parse in-audit bool %s, ignoring.", v);
3410 else
3411 u->in_audit = r;
3412
3413 continue;
3414
3415 } else if (streq(l, "exported-invocation-id")) {
3416
3417 r = parse_boolean(v);
3418 if (r < 0)
3419 log_unit_debug(u, "Failed to parse exported invocation ID bool %s, ignoring.", v);
3420 else
3421 u->exported_invocation_id = r;
3422
3423 continue;
3424
3425 } else if (streq(l, "exported-log-level-max")) {
3426
3427 r = parse_boolean(v);
3428 if (r < 0)
3429 log_unit_debug(u, "Failed to parse exported log level max bool %s, ignoring.", v);
3430 else
3431 u->exported_log_level_max = r;
3432
3433 continue;
3434
3435 } else if (streq(l, "exported-log-extra-fields")) {
3436
3437 r = parse_boolean(v);
3438 if (r < 0)
3439 log_unit_debug(u, "Failed to parse exported log extra fields bool %s, ignoring.", v);
3440 else
3441 u->exported_log_extra_fields = r;
3442
3443 continue;
3444
3445 } else if (streq(l, "exported-log-rate-limit-interval")) {
3446
3447 r = parse_boolean(v);
3448 if (r < 0)
3449 log_unit_debug(u, "Failed to parse exported log rate limit interval %s, ignoring.", v);
3450 else
3451 u->exported_log_rate_limit_interval = r;
3452
3453 continue;
3454
3455 } else if (streq(l, "exported-log-rate-limit-burst")) {
3456
3457 r = parse_boolean(v);
3458 if (r < 0)
3459 log_unit_debug(u, "Failed to parse exported log rate limit burst %s, ignoring.", v);
3460 else
3461 u->exported_log_rate_limit_burst = r;
3462
3463 continue;
3464
3465 } else if (STR_IN_SET(l, "cpu-usage-base", "cpuacct-usage-base")) {
3466
3467 r = safe_atou64(v, &u->cpu_usage_base);
3468 if (r < 0)
3469 log_unit_debug(u, "Failed to parse CPU usage base %s, ignoring.", v);
3470
3471 continue;
3472
3473 } else if (streq(l, "cpu-usage-last")) {
3474
3475 r = safe_atou64(v, &u->cpu_usage_last);
3476 if (r < 0)
3477 log_unit_debug(u, "Failed to read CPU usage last %s, ignoring.", v);
3478
3479 continue;
3480
3481 } else if (streq(l, "cgroup")) {
3482
3483 r = unit_set_cgroup_path(u, v);
3484 if (r < 0)
3485 log_unit_debug_errno(u, r, "Failed to set cgroup path %s, ignoring: %m", v);
3486
3487 (void) unit_watch_cgroup(u);
3488
3489 continue;
3490 } else if (streq(l, "cgroup-realized")) {
3491 int b;
3492
3493 b = parse_boolean(v);
3494 if (b < 0)
3495 log_unit_debug(u, "Failed to parse cgroup-realized bool %s, ignoring.", v);
3496 else
3497 u->cgroup_realized = b;
3498
3499 continue;
3500
3501 } else if (streq(l, "cgroup-realized-mask")) {
3502
3503 r = cg_mask_from_string(v, &u->cgroup_realized_mask);
3504 if (r < 0)
3505 log_unit_debug(u, "Failed to parse cgroup-realized-mask %s, ignoring.", v);
3506 continue;
3507
3508 } else if (streq(l, "cgroup-enabled-mask")) {
3509
3510 r = cg_mask_from_string(v, &u->cgroup_enabled_mask);
3511 if (r < 0)
3512 log_unit_debug(u, "Failed to parse cgroup-enabled-mask %s, ignoring.", v);
3513 continue;
3514
3515 } else if (streq(l, "cgroup-invalidated-mask")) {
3516
3517 r = cg_mask_from_string(v, &u->cgroup_invalidated_mask);
3518 if (r < 0)
3519 log_unit_debug(u, "Failed to parse cgroup-invalidated-mask %s, ignoring.", v);
3520 continue;
3521
3522 } else if (streq(l, "ref-uid")) {
3523 uid_t uid;
3524
3525 r = parse_uid(v, &uid);
3526 if (r < 0)
3527 log_unit_debug(u, "Failed to parse referenced UID %s, ignoring.", v);
3528 else
3529 unit_ref_uid_gid(u, uid, GID_INVALID);
3530
3531 continue;
3532
3533 } else if (streq(l, "ref-gid")) {
3534 gid_t gid;
3535
3536 r = parse_gid(v, &gid);
3537 if (r < 0)
3538 log_unit_debug(u, "Failed to parse referenced GID %s, ignoring.", v);
3539 else
3540 unit_ref_uid_gid(u, UID_INVALID, gid);
3541
3542 continue;
3543
3544 } else if (streq(l, "ref")) {
3545
3546 r = strv_extend(&u->deserialized_refs, v);
3547 if (r < 0)
3548 return log_oom();
3549
3550 continue;
3551 } else if (streq(l, "invocation-id")) {
3552 sd_id128_t id;
3553
3554 r = sd_id128_from_string(v, &id);
3555 if (r < 0)
3556 log_unit_debug(u, "Failed to parse invocation id %s, ignoring.", v);
3557 else {
3558 r = unit_set_invocation_id(u, id);
3559 if (r < 0)
3560 log_unit_warning_errno(u, r, "Failed to set invocation ID for unit: %m");
3561 }
3562
3563 continue;
3564 }
3565
3566 /* Check if this is an IP accounting metric serialization field */
3567 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++)
3568 if (streq(l, ip_accounting_metric_field[m]))
3569 break;
3570 if (m < _CGROUP_IP_ACCOUNTING_METRIC_MAX) {
3571 uint64_t c;
3572
3573 r = safe_atou64(v, &c);
3574 if (r < 0)
3575 log_unit_debug(u, "Failed to parse IP accounting value %s, ignoring.", v);
3576 else
3577 u->ip_accounting_extra[m] = c;
3578 continue;
3579 }
3580
3581 if (unit_can_serialize(u)) {
3582 r = exec_runtime_deserialize_compat(u, l, v, fds);
3583 if (r < 0) {
3584 log_unit_warning(u, "Failed to deserialize runtime parameter '%s', ignoring.", l);
3585 continue;
3586 }
3587
3588 /* Returns positive if key was handled by the call */
3589 if (r > 0)
3590 continue;
3591
3592 r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds);
3593 if (r < 0)
3594 log_unit_warning(u, "Failed to deserialize unit parameter '%s', ignoring.", l);
3595 }
3596 }
3597
3598 /* Versions before 228 did not carry a state change timestamp. In this case, take the current time. This is
3599 * useful, so that timeouts based on this timestamp don't trigger too early, and is in-line with the logic from
3600 * before 228 where the base for timeouts was not persistent across reboots. */
3601
3602 if (!dual_timestamp_is_set(&u->state_change_timestamp))
3603 dual_timestamp_get(&u->state_change_timestamp);
3604
3605 /* Let's make sure that everything that is deserialized also gets any potential new cgroup settings applied
3606 * after we are done. For that we invalidate anything already realized, so that we can realize it again. */
3607 unit_invalidate_cgroup(u, _CGROUP_MASK_ALL);
3608 unit_invalidate_cgroup_bpf(u);
3609
3610 return 0;
3611 }
3612
3613 int unit_deserialize_skip(FILE *f) {
3614 int r;
3615 assert(f);
3616
3617 /* Skip serialized data for this unit. We don't know what it is. */
3618
3619 for (;;) {
3620 _cleanup_free_ char *line = NULL;
3621 char *l;
3622
3623 r = read_line(f, LONG_LINE_MAX, &line);
3624 if (r < 0)
3625 return log_error_errno(r, "Failed to read serialization line: %m");
3626 if (r == 0)
3627 return 0;
3628
3629 l = strstrip(line);
3630
3631 /* End marker */
3632 if (isempty(l))
3633 return 1;
3634 }
3635 }
3636
3637 int unit_add_node_dependency(Unit *u, const char *what, bool wants, UnitDependency dep, UnitDependencyMask mask) {
3638 Unit *device;
3639 _cleanup_free_ char *e = NULL;
3640 int r;
3641
3642 assert(u);
3643
3644 /* Adds in links to the device node that this unit is based on */
3645 if (isempty(what))
3646 return 0;
3647
3648 if (!is_device_path(what))
3649 return 0;
3650
3651 /* When device units aren't supported (such as in a
3652 * container), don't create dependencies on them. */
3653 if (!unit_type_supported(UNIT_DEVICE))
3654 return 0;
3655
3656 r = unit_name_from_path(what, ".device", &e);
3657 if (r < 0)
3658 return r;
3659
3660 r = manager_load_unit(u->manager, e, NULL, NULL, &device);
3661 if (r < 0)
3662 return r;
3663
3664 if (dep == UNIT_REQUIRES && device_shall_be_bound_by(device, u))
3665 dep = UNIT_BINDS_TO;
3666
3667 r = unit_add_two_dependencies(u, UNIT_AFTER,
3668 MANAGER_IS_SYSTEM(u->manager) ? dep : UNIT_WANTS,
3669 device, true, mask);
3670 if (r < 0)
3671 return r;
3672
3673 if (wants) {
3674 r = unit_add_dependency(device, UNIT_WANTS, u, false, mask);
3675 if (r < 0)
3676 return r;
3677 }
3678
3679 return 0;
3680 }
3681
3682 int unit_coldplug(Unit *u) {
3683 int r = 0, q;
3684 char **i;
3685
3686 assert(u);
3687
3688 /* Make sure we don't enter a loop, when coldplugging recursively. */
3689 if (u->coldplugged)
3690 return 0;
3691
3692 u->coldplugged = true;
3693
3694 STRV_FOREACH(i, u->deserialized_refs) {
3695 q = bus_unit_track_add_name(u, *i);
3696 if (q < 0 && r >= 0)
3697 r = q;
3698 }
3699 u->deserialized_refs = strv_free(u->deserialized_refs);
3700
3701 if (UNIT_VTABLE(u)->coldplug) {
3702 q = UNIT_VTABLE(u)->coldplug(u);
3703 if (q < 0 && r >= 0)
3704 r = q;
3705 }
3706
3707 if (u->job) {
3708 q = job_coldplug(u->job);
3709 if (q < 0 && r >= 0)
3710 r = q;
3711 }
3712
3713 return r;
3714 }
3715
3716 void unit_catchup(Unit *u) {
3717 assert(u);
3718
3719 if (UNIT_VTABLE(u)->catchup)
3720 UNIT_VTABLE(u)->catchup(u);
3721 }
3722
3723 static bool fragment_mtime_newer(const char *path, usec_t mtime, bool path_masked) {
3724 struct stat st;
3725
3726 if (!path)
3727 return false;
3728
3729 /* If the source is some virtual kernel file system, then we assume we watch it anyway, and hence pretend we
3730 * are never out-of-date. */
3731 if (PATH_STARTSWITH_SET(path, "/proc", "/sys"))
3732 return false;
3733
3734 if (stat(path, &st) < 0)
3735 /* What, cannot access this anymore? */
3736 return true;
3737
3738 if (path_masked)
3739 /* For masked files check if they are still so */
3740 return !null_or_empty(&st);
3741 else
3742 /* For non-empty files check the mtime */
3743 return timespec_load(&st.st_mtim) > mtime;
3744
3745 return false;
3746 }
3747
3748 bool unit_need_daemon_reload(Unit *u) {
3749 _cleanup_strv_free_ char **t = NULL;
3750 char **path;
3751
3752 assert(u);
3753
3754 /* For unit files, we allow masking… */
3755 if (fragment_mtime_newer(u->fragment_path, u->fragment_mtime,
3756 u->load_state == UNIT_MASKED))
3757 return true;
3758
3759 /* Source paths should not be masked… */
3760 if (fragment_mtime_newer(u->source_path, u->source_mtime, false))
3761 return true;
3762
3763 if (u->load_state == UNIT_LOADED)
3764 (void) unit_find_dropin_paths(u, &t);
3765 if (!strv_equal(u->dropin_paths, t))
3766 return true;
3767
3768 /* … any drop-ins that are masked are simply omitted from the list. */
3769 STRV_FOREACH(path, u->dropin_paths)
3770 if (fragment_mtime_newer(*path, u->dropin_mtime, false))
3771 return true;
3772
3773 return false;
3774 }
3775
3776 void unit_reset_failed(Unit *u) {
3777 assert(u);
3778
3779 if (UNIT_VTABLE(u)->reset_failed)
3780 UNIT_VTABLE(u)->reset_failed(u);
3781
3782 RATELIMIT_RESET(u->start_limit);
3783 u->start_limit_hit = false;
3784 }
3785
3786 Unit *unit_following(Unit *u) {
3787 assert(u);
3788
3789 if (UNIT_VTABLE(u)->following)
3790 return UNIT_VTABLE(u)->following(u);
3791
3792 return NULL;
3793 }
3794
3795 bool unit_stop_pending(Unit *u) {
3796 assert(u);
3797
3798 /* This call does check the current state of the unit. It's
3799 * hence useful to be called from state change calls of the
3800 * unit itself, where the state isn't updated yet. This is
3801 * different from unit_inactive_or_pending() which checks both
3802 * the current state and for a queued job. */
3803
3804 return u->job && u->job->type == JOB_STOP;
3805 }
3806
3807 bool unit_inactive_or_pending(Unit *u) {
3808 assert(u);
3809
3810 /* Returns true if the unit is inactive or going down */
3811
3812 if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)))
3813 return true;
3814
3815 if (unit_stop_pending(u))
3816 return true;
3817
3818 return false;
3819 }
3820
3821 bool unit_active_or_pending(Unit *u) {
3822 assert(u);
3823
3824 /* Returns true if the unit is active or going up */
3825
3826 if (UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
3827 return true;
3828
3829 if (u->job &&
3830 IN_SET(u->job->type, JOB_START, JOB_RELOAD_OR_START, JOB_RESTART))
3831 return true;
3832
3833 return false;
3834 }
3835
3836 bool unit_will_restart(Unit *u) {
3837 assert(u);
3838
3839 if (!UNIT_VTABLE(u)->will_restart)
3840 return false;
3841
3842 return UNIT_VTABLE(u)->will_restart(u);
3843 }
3844
3845 int unit_kill(Unit *u, KillWho w, int signo, sd_bus_error *error) {
3846 assert(u);
3847 assert(w >= 0 && w < _KILL_WHO_MAX);
3848 assert(SIGNAL_VALID(signo));
3849
3850 if (!UNIT_VTABLE(u)->kill)
3851 return -EOPNOTSUPP;
3852
3853 return UNIT_VTABLE(u)->kill(u, w, signo, error);
3854 }
3855
3856 static Set *unit_pid_set(pid_t main_pid, pid_t control_pid) {
3857 _cleanup_set_free_ Set *pid_set = NULL;
3858 int r;
3859
3860 pid_set = set_new(NULL);
3861 if (!pid_set)
3862 return NULL;
3863
3864 /* Exclude the main/control pids from being killed via the cgroup */
3865 if (main_pid > 0) {
3866 r = set_put(pid_set, PID_TO_PTR(main_pid));
3867 if (r < 0)
3868 return NULL;
3869 }
3870
3871 if (control_pid > 0) {
3872 r = set_put(pid_set, PID_TO_PTR(control_pid));
3873 if (r < 0)
3874 return NULL;
3875 }
3876
3877 return TAKE_PTR(pid_set);
3878 }
3879
3880 int unit_kill_common(
3881 Unit *u,
3882 KillWho who,
3883 int signo,
3884 pid_t main_pid,
3885 pid_t control_pid,
3886 sd_bus_error *error) {
3887
3888 int r = 0;
3889 bool killed = false;
3890
3891 if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL)) {
3892 if (main_pid < 0)
3893 return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no main processes", unit_type_to_string(u->type));
3894 else if (main_pid == 0)
3895 return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No main process to kill");
3896 }
3897
3898 if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL)) {
3899 if (control_pid < 0)
3900 return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no control processes", unit_type_to_string(u->type));
3901 else if (control_pid == 0)
3902 return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No control process to kill");
3903 }
3904
3905 if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL, KILL_ALL, KILL_ALL_FAIL))
3906 if (control_pid > 0) {
3907 if (kill(control_pid, signo) < 0)
3908 r = -errno;
3909 else
3910 killed = true;
3911 }
3912
3913 if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL, KILL_ALL, KILL_ALL_FAIL))
3914 if (main_pid > 0) {
3915 if (kill(main_pid, signo) < 0)
3916 r = -errno;
3917 else
3918 killed = true;
3919 }
3920
3921 if (IN_SET(who, KILL_ALL, KILL_ALL_FAIL) && u->cgroup_path) {
3922 _cleanup_set_free_ Set *pid_set = NULL;
3923 int q;
3924
3925 /* Exclude the main/control pids from being killed via the cgroup */
3926 pid_set = unit_pid_set(main_pid, control_pid);
3927 if (!pid_set)
3928 return -ENOMEM;
3929
3930 q = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, signo, 0, pid_set, NULL, NULL);
3931 if (q < 0 && !IN_SET(q, -EAGAIN, -ESRCH, -ENOENT))
3932 r = q;
3933 else
3934 killed = true;
3935 }
3936
3937 if (r == 0 && !killed && IN_SET(who, KILL_ALL_FAIL, KILL_CONTROL_FAIL))
3938 return -ESRCH;
3939
3940 return r;
3941 }
3942
3943 int unit_following_set(Unit *u, Set **s) {
3944 assert(u);
3945 assert(s);
3946
3947 if (UNIT_VTABLE(u)->following_set)
3948 return UNIT_VTABLE(u)->following_set(u, s);
3949
3950 *s = NULL;
3951 return 0;
3952 }
3953
3954 UnitFileState unit_get_unit_file_state(Unit *u) {
3955 int r;
3956
3957 assert(u);
3958
3959 if (u->unit_file_state < 0 && u->fragment_path) {
3960 r = unit_file_get_state(
3961 u->manager->unit_file_scope,
3962 NULL,
3963 u->id,
3964 &u->unit_file_state);
3965 if (r < 0)
3966 u->unit_file_state = UNIT_FILE_BAD;
3967 }
3968
3969 return u->unit_file_state;
3970 }
3971
3972 int unit_get_unit_file_preset(Unit *u) {
3973 assert(u);
3974
3975 if (u->unit_file_preset < 0 && u->fragment_path)
3976 u->unit_file_preset = unit_file_query_preset(
3977 u->manager->unit_file_scope,
3978 NULL,
3979 basename(u->fragment_path));
3980
3981 return u->unit_file_preset;
3982 }
3983
3984 Unit* unit_ref_set(UnitRef *ref, Unit *source, Unit *target) {
3985 assert(ref);
3986 assert(source);
3987 assert(target);
3988
3989 if (ref->target)
3990 unit_ref_unset(ref);
3991
3992 ref->source = source;
3993 ref->target = target;
3994 LIST_PREPEND(refs_by_target, target->refs_by_target, ref);
3995 return target;
3996 }
3997
3998 void unit_ref_unset(UnitRef *ref) {
3999 assert(ref);
4000
4001 if (!ref->target)
4002 return;
4003
4004 /* We are about to drop a reference to the unit, make sure the garbage collection has a look at it as it might
4005 * be unreferenced now. */
4006 unit_add_to_gc_queue(ref->target);
4007
4008 LIST_REMOVE(refs_by_target, ref->target->refs_by_target, ref);
4009 ref->source = ref->target = NULL;
4010 }
4011
4012 static int user_from_unit_name(Unit *u, char **ret) {
4013
4014 static const uint8_t hash_key[] = {
4015 0x58, 0x1a, 0xaf, 0xe6, 0x28, 0x58, 0x4e, 0x96,
4016 0xb4, 0x4e, 0xf5, 0x3b, 0x8c, 0x92, 0x07, 0xec
4017 };
4018
4019 _cleanup_free_ char *n = NULL;
4020 int r;
4021
4022 r = unit_name_to_prefix(u->id, &n);
4023 if (r < 0)
4024 return r;
4025
4026 if (valid_user_group_name(n)) {
4027 *ret = TAKE_PTR(n);
4028 return 0;
4029 }
4030
4031 /* If we can't use the unit name as a user name, then let's hash it and use that */
4032 if (asprintf(ret, "_du%016" PRIx64, siphash24(n, strlen(n), hash_key)) < 0)
4033 return -ENOMEM;
4034
4035 return 0;
4036 }
4037
4038 int unit_patch_contexts(Unit *u) {
4039 CGroupContext *cc;
4040 ExecContext *ec;
4041 unsigned i;
4042 int r;
4043
4044 assert(u);
4045
4046 /* Patch in the manager defaults into the exec and cgroup
4047 * contexts, _after_ the rest of the settings have been
4048 * initialized */
4049
4050 ec = unit_get_exec_context(u);
4051 if (ec) {
4052 /* This only copies in the ones that need memory */
4053 for (i = 0; i < _RLIMIT_MAX; i++)
4054 if (u->manager->rlimit[i] && !ec->rlimit[i]) {
4055 ec->rlimit[i] = newdup(struct rlimit, u->manager->rlimit[i], 1);
4056 if (!ec->rlimit[i])
4057 return -ENOMEM;
4058 }
4059
4060 if (MANAGER_IS_USER(u->manager) &&
4061 !ec->working_directory) {
4062
4063 r = get_home_dir(&ec->working_directory);
4064 if (r < 0)
4065 return r;
4066
4067 /* Allow user services to run, even if the
4068 * home directory is missing */
4069 ec->working_directory_missing_ok = true;
4070 }
4071
4072 if (ec->private_devices)
4073 ec->capability_bounding_set &= ~((UINT64_C(1) << CAP_MKNOD) | (UINT64_C(1) << CAP_SYS_RAWIO));
4074
4075 if (ec->protect_kernel_modules)
4076 ec->capability_bounding_set &= ~(UINT64_C(1) << CAP_SYS_MODULE);
4077
4078 if (ec->dynamic_user) {
4079 if (!ec->user) {
4080 r = user_from_unit_name(u, &ec->user);
4081 if (r < 0)
4082 return r;
4083 }
4084
4085 if (!ec->group) {
4086 ec->group = strdup(ec->user);
4087 if (!ec->group)
4088 return -ENOMEM;
4089 }
4090
4091 /* If the dynamic user option is on, let's make sure that the unit can't leave its
4092 * UID/GID around in the file system or on IPC objects. Hence enforce a strict
4093 * sandbox. */
4094
4095 ec->private_tmp = true;
4096 ec->remove_ipc = true;
4097 ec->protect_system = PROTECT_SYSTEM_STRICT;
4098 if (ec->protect_home == PROTECT_HOME_NO)
4099 ec->protect_home = PROTECT_HOME_READ_ONLY;
4100
4101 /* Make sure this service can neither benefit from SUID/SGID binaries nor create
4102 * them. */
4103 ec->no_new_privileges = true;
4104 ec->restrict_suid_sgid = true;
4105 }
4106 }
4107
4108 cc = unit_get_cgroup_context(u);
4109 if (cc && ec) {
4110
4111 if (ec->private_devices &&
4112 cc->device_policy == CGROUP_AUTO)
4113 cc->device_policy = CGROUP_CLOSED;
4114
4115 if (ec->root_image &&
4116 (cc->device_policy != CGROUP_AUTO || cc->device_allow)) {
4117
4118 /* When RootImage= is specified, the following devices are touched. */
4119 r = cgroup_add_device_allow(cc, "/dev/loop-control", "rw");
4120 if (r < 0)
4121 return r;
4122
4123 r = cgroup_add_device_allow(cc, "block-loop", "rwm");
4124 if (r < 0)
4125 return r;
4126
4127 r = cgroup_add_device_allow(cc, "block-blkext", "rwm");
4128 if (r < 0)
4129 return r;
4130 }
4131 }
4132
4133 return 0;
4134 }
4135
4136 ExecContext *unit_get_exec_context(Unit *u) {
4137 size_t offset;
4138 assert(u);
4139
4140 if (u->type < 0)
4141 return NULL;
4142
4143 offset = UNIT_VTABLE(u)->exec_context_offset;
4144 if (offset <= 0)
4145 return NULL;
4146
4147 return (ExecContext*) ((uint8_t*) u + offset);
4148 }
4149
4150 KillContext *unit_get_kill_context(Unit *u) {
4151 size_t offset;
4152 assert(u);
4153
4154 if (u->type < 0)
4155 return NULL;
4156
4157 offset = UNIT_VTABLE(u)->kill_context_offset;
4158 if (offset <= 0)
4159 return NULL;
4160
4161 return (KillContext*) ((uint8_t*) u + offset);
4162 }
4163
4164 CGroupContext *unit_get_cgroup_context(Unit *u) {
4165 size_t offset;
4166
4167 if (u->type < 0)
4168 return NULL;
4169
4170 offset = UNIT_VTABLE(u)->cgroup_context_offset;
4171 if (offset <= 0)
4172 return NULL;
4173
4174 return (CGroupContext*) ((uint8_t*) u + offset);
4175 }
4176
4177 ExecRuntime *unit_get_exec_runtime(Unit *u) {
4178 size_t offset;
4179
4180 if (u->type < 0)
4181 return NULL;
4182
4183 offset = UNIT_VTABLE(u)->exec_runtime_offset;
4184 if (offset <= 0)
4185 return NULL;
4186
4187 return *(ExecRuntime**) ((uint8_t*) u + offset);
4188 }
4189
4190 static const char* unit_drop_in_dir(Unit *u, UnitWriteFlags flags) {
4191 assert(u);
4192
4193 if (UNIT_WRITE_FLAGS_NOOP(flags))
4194 return NULL;
4195
4196 if (u->transient) /* Redirect drop-ins for transient units always into the transient directory. */
4197 return u->manager->lookup_paths.transient;
4198
4199 if (flags & UNIT_PERSISTENT)
4200 return u->manager->lookup_paths.persistent_control;
4201
4202 if (flags & UNIT_RUNTIME)
4203 return u->manager->lookup_paths.runtime_control;
4204
4205 return NULL;
4206 }
4207
4208 char* unit_escape_setting(const char *s, UnitWriteFlags flags, char **buf) {
4209 char *ret = NULL;
4210
4211 if (!s)
4212 return NULL;
4213
4214 /* Escapes the input string as requested. Returns the escaped string. If 'buf' is specified then the allocated
4215 * return buffer pointer is also written to *buf, except if no escaping was necessary, in which case *buf is
4216 * set to NULL, and the input pointer is returned as-is. This means the return value always contains a properly
4217 * escaped version, but *buf when passed only contains a pointer if an allocation was necessary. If *buf is
4218 * not specified, then the return value always needs to be freed. Callers can use this to optimize memory
4219 * allocations. */
4220
4221 if (flags & UNIT_ESCAPE_SPECIFIERS) {
4222 ret = specifier_escape(s);
4223 if (!ret)
4224 return NULL;
4225
4226 s = ret;
4227 }
4228
4229 if (flags & UNIT_ESCAPE_C) {
4230 char *a;
4231
4232 a = cescape(s);
4233 free(ret);
4234 if (!a)
4235 return NULL;
4236
4237 ret = a;
4238 }
4239
4240 if (buf) {
4241 *buf = ret;
4242 return ret ?: (char*) s;
4243 }
4244
4245 return ret ?: strdup(s);
4246 }
4247
4248 char* unit_concat_strv(char **l, UnitWriteFlags flags) {
4249 _cleanup_free_ char *result = NULL;
4250 size_t n = 0, allocated = 0;
4251 char **i;
4252
4253 /* Takes a list of strings, escapes them, and concatenates them. This may be used to format command lines in a
4254 * way suitable for ExecStart= stanzas */
4255
4256 STRV_FOREACH(i, l) {
4257 _cleanup_free_ char *buf = NULL;
4258 const char *p;
4259 size_t a;
4260 char *q;
4261
4262 p = unit_escape_setting(*i, flags, &buf);
4263 if (!p)
4264 return NULL;
4265
4266 a = (n > 0) + 1 + strlen(p) + 1; /* separating space + " + entry + " */
4267 if (!GREEDY_REALLOC(result, allocated, n + a + 1))
4268 return NULL;
4269
4270 q = result + n;
4271 if (n > 0)
4272 *(q++) = ' ';
4273
4274 *(q++) = '"';
4275 q = stpcpy(q, p);
4276 *(q++) = '"';
4277
4278 n += a;
4279 }
4280
4281 if (!GREEDY_REALLOC(result, allocated, n + 1))
4282 return NULL;
4283
4284 result[n] = 0;
4285
4286 return TAKE_PTR(result);
4287 }
4288
4289 int unit_write_setting(Unit *u, UnitWriteFlags flags, const char *name, const char *data) {
4290 _cleanup_free_ char *p = NULL, *q = NULL, *escaped = NULL;
4291 const char *dir, *wrapped;
4292 int r;
4293
4294 assert(u);
4295 assert(name);
4296 assert(data);
4297
4298 if (UNIT_WRITE_FLAGS_NOOP(flags))
4299 return 0;
4300
4301 data = unit_escape_setting(data, flags, &escaped);
4302 if (!data)
4303 return -ENOMEM;
4304
4305 /* Prefix the section header. If we are writing this out as transient file, then let's suppress this if the
4306 * previous section header is the same */
4307
4308 if (flags & UNIT_PRIVATE) {
4309 if (!UNIT_VTABLE(u)->private_section)
4310 return -EINVAL;
4311
4312 if (!u->transient_file || u->last_section_private < 0)
4313 data = strjoina("[", UNIT_VTABLE(u)->private_section, "]\n", data);
4314 else if (u->last_section_private == 0)
4315 data = strjoina("\n[", UNIT_VTABLE(u)->private_section, "]\n", data);
4316 } else {
4317 if (!u->transient_file || u->last_section_private < 0)
4318 data = strjoina("[Unit]\n", data);
4319 else if (u->last_section_private > 0)
4320 data = strjoina("\n[Unit]\n", data);
4321 }
4322
4323 if (u->transient_file) {
4324 /* When this is a transient unit file in creation, then let's not create a new drop-in but instead
4325 * write to the transient unit file. */
4326 fputs(data, u->transient_file);
4327
4328 if (!endswith(data, "\n"))
4329 fputc('\n', u->transient_file);
4330
4331 /* Remember which section we wrote this entry to */
4332 u->last_section_private = !!(flags & UNIT_PRIVATE);
4333 return 0;
4334 }
4335
4336 dir = unit_drop_in_dir(u, flags);
4337 if (!dir)
4338 return -EINVAL;
4339
4340 wrapped = strjoina("# This is a drop-in unit file extension, created via \"systemctl set-property\"\n"
4341 "# or an equivalent operation. Do not edit.\n",
4342 data,
4343 "\n");
4344
4345 r = drop_in_file(dir, u->id, 50, name, &p, &q);
4346 if (r < 0)
4347 return r;
4348
4349 (void) mkdir_p_label(p, 0755);
4350 r = write_string_file_atomic_label(q, wrapped);
4351 if (r < 0)
4352 return r;
4353
4354 r = strv_push(&u->dropin_paths, q);
4355 if (r < 0)
4356 return r;
4357 q = NULL;
4358
4359 strv_uniq(u->dropin_paths);
4360
4361 u->dropin_mtime = now(CLOCK_REALTIME);
4362
4363 return 0;
4364 }
4365
4366 int unit_write_settingf(Unit *u, UnitWriteFlags flags, const char *name, const char *format, ...) {
4367 _cleanup_free_ char *p = NULL;
4368 va_list ap;
4369 int r;
4370
4371 assert(u);
4372 assert(name);
4373 assert(format);
4374
4375 if (UNIT_WRITE_FLAGS_NOOP(flags))
4376 return 0;
4377
4378 va_start(ap, format);
4379 r = vasprintf(&p, format, ap);
4380 va_end(ap);
4381
4382 if (r < 0)
4383 return -ENOMEM;
4384
4385 return unit_write_setting(u, flags, name, p);
4386 }
4387
4388 int unit_make_transient(Unit *u) {
4389 _cleanup_free_ char *path = NULL;
4390 FILE *f;
4391
4392 assert(u);
4393
4394 if (!UNIT_VTABLE(u)->can_transient)
4395 return -EOPNOTSUPP;
4396
4397 (void) mkdir_p_label(u->manager->lookup_paths.transient, 0755);
4398
4399 path = strjoin(u->manager->lookup_paths.transient, "/", u->id);
4400 if (!path)
4401 return -ENOMEM;
4402
4403 /* Let's open the file we'll write the transient settings into. This file is kept open as long as we are
4404 * creating the transient, and is closed in unit_load(), as soon as we start loading the file. */
4405
4406 RUN_WITH_UMASK(0022) {
4407 f = fopen(path, "we");
4408 if (!f)
4409 return -errno;
4410 }
4411
4412 safe_fclose(u->transient_file);
4413 u->transient_file = f;
4414
4415 free_and_replace(u->fragment_path, path);
4416
4417 u->source_path = mfree(u->source_path);
4418 u->dropin_paths = strv_free(u->dropin_paths);
4419 u->fragment_mtime = u->source_mtime = u->dropin_mtime = 0;
4420
4421 u->load_state = UNIT_STUB;
4422 u->load_error = 0;
4423 u->transient = true;
4424
4425 unit_add_to_dbus_queue(u);
4426 unit_add_to_gc_queue(u);
4427
4428 fputs("# This is a transient unit file, created programmatically via the systemd API. Do not edit.\n",
4429 u->transient_file);
4430
4431 return 0;
4432 }
4433
4434 static int log_kill(pid_t pid, int sig, void *userdata) {
4435 _cleanup_free_ char *comm = NULL;
4436
4437 (void) get_process_comm(pid, &comm);
4438
4439 /* Don't log about processes marked with brackets, under the assumption that these are temporary processes
4440 only, like for example systemd's own PAM stub process. */
4441 if (comm && comm[0] == '(')
4442 return 0;
4443
4444 log_unit_notice(userdata,
4445 "Killing process " PID_FMT " (%s) with signal SIG%s.",
4446 pid,
4447 strna(comm),
4448 signal_to_string(sig));
4449
4450 return 1;
4451 }
4452
4453 static int operation_to_signal(KillContext *c, KillOperation k) {
4454 assert(c);
4455
4456 switch (k) {
4457
4458 case KILL_TERMINATE:
4459 case KILL_TERMINATE_AND_LOG:
4460 return c->kill_signal;
4461
4462 case KILL_KILL:
4463 return c->final_kill_signal;
4464
4465 case KILL_WATCHDOG:
4466 return c->watchdog_signal;
4467
4468 default:
4469 assert_not_reached("KillOperation unknown");
4470 }
4471 }
4472
4473 int unit_kill_context(
4474 Unit *u,
4475 KillContext *c,
4476 KillOperation k,
4477 pid_t main_pid,
4478 pid_t control_pid,
4479 bool main_pid_alien) {
4480
4481 bool wait_for_exit = false, send_sighup;
4482 cg_kill_log_func_t log_func = NULL;
4483 int sig, r;
4484
4485 assert(u);
4486 assert(c);
4487
4488 /* Kill the processes belonging to this unit, in preparation for shutting the unit down.
4489 * Returns > 0 if we killed something worth waiting for, 0 otherwise. */
4490
4491 if (c->kill_mode == KILL_NONE)
4492 return 0;
4493
4494 sig = operation_to_signal(c, k);
4495
4496 send_sighup =
4497 c->send_sighup &&
4498 IN_SET(k, KILL_TERMINATE, KILL_TERMINATE_AND_LOG) &&
4499 sig != SIGHUP;
4500
4501 if (k != KILL_TERMINATE || IN_SET(sig, SIGKILL, SIGABRT))
4502 log_func = log_kill;
4503
4504 if (main_pid > 0) {
4505 if (log_func)
4506 log_func(main_pid, sig, u);
4507
4508 r = kill_and_sigcont(main_pid, sig);
4509 if (r < 0 && r != -ESRCH) {
4510 _cleanup_free_ char *comm = NULL;
4511 (void) get_process_comm(main_pid, &comm);
4512
4513 log_unit_warning_errno(u, r, "Failed to kill main process " PID_FMT " (%s), ignoring: %m", main_pid, strna(comm));
4514 } else {
4515 if (!main_pid_alien)
4516 wait_for_exit = true;
4517
4518 if (r != -ESRCH && send_sighup)
4519 (void) kill(main_pid, SIGHUP);
4520 }
4521 }
4522
4523 if (control_pid > 0) {
4524 if (log_func)
4525 log_func(control_pid, sig, u);
4526
4527 r = kill_and_sigcont(control_pid, sig);
4528 if (r < 0 && r != -ESRCH) {
4529 _cleanup_free_ char *comm = NULL;
4530 (void) get_process_comm(control_pid, &comm);
4531
4532 log_unit_warning_errno(u, r, "Failed to kill control process " PID_FMT " (%s), ignoring: %m", control_pid, strna(comm));
4533 } else {
4534 wait_for_exit = true;
4535
4536 if (r != -ESRCH && send_sighup)
4537 (void) kill(control_pid, SIGHUP);
4538 }
4539 }
4540
4541 if (u->cgroup_path &&
4542 (c->kill_mode == KILL_CONTROL_GROUP || (c->kill_mode == KILL_MIXED && k == KILL_KILL))) {
4543 _cleanup_set_free_ Set *pid_set = NULL;
4544
4545 /* Exclude the main/control pids from being killed via the cgroup */
4546 pid_set = unit_pid_set(main_pid, control_pid);
4547 if (!pid_set)
4548 return -ENOMEM;
4549
4550 r = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path,
4551 sig,
4552 CGROUP_SIGCONT|CGROUP_IGNORE_SELF,
4553 pid_set,
4554 log_func, u);
4555 if (r < 0) {
4556 if (!IN_SET(r, -EAGAIN, -ESRCH, -ENOENT))
4557 log_unit_warning_errno(u, r, "Failed to kill control group %s, ignoring: %m", u->cgroup_path);
4558
4559 } else if (r > 0) {
4560
4561 /* FIXME: For now, on the legacy hierarchy, we will not wait for the cgroup members to die if
4562 * we are running in a container or if this is a delegation unit, simply because cgroup
4563 * notification is unreliable in these cases. It doesn't work at all in containers, and outside
4564 * of containers it can be confused easily by left-over directories in the cgroup — which
4565 * however should not exist in non-delegated units. On the unified hierarchy that's different,
4566 * there we get proper events. Hence rely on them. */
4567
4568 if (cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER) > 0 ||
4569 (detect_container() == 0 && !unit_cgroup_delegate(u)))
4570 wait_for_exit = true;
4571
4572 if (send_sighup) {
4573 set_free(pid_set);
4574
4575 pid_set = unit_pid_set(main_pid, control_pid);
4576 if (!pid_set)
4577 return -ENOMEM;
4578
4579 cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path,
4580 SIGHUP,
4581 CGROUP_IGNORE_SELF,
4582 pid_set,
4583 NULL, NULL);
4584 }
4585 }
4586 }
4587
4588 return wait_for_exit;
4589 }
4590
4591 int unit_require_mounts_for(Unit *u, const char *path, UnitDependencyMask mask) {
4592 _cleanup_free_ char *p = NULL;
4593 UnitDependencyInfo di;
4594 int r;
4595
4596 assert(u);
4597 assert(path);
4598
4599 /* Registers a unit for requiring a certain path and all its prefixes. We keep a hashtable of these paths in
4600 * the unit (from the path to the UnitDependencyInfo structure indicating how to the dependency came to
4601 * be). However, we build a prefix table for all possible prefixes so that new appearing mount units can easily
4602 * determine which units to make themselves a dependency of. */
4603
4604 if (!path_is_absolute(path))
4605 return -EINVAL;
4606
4607 r = hashmap_ensure_allocated(&u->requires_mounts_for, &path_hash_ops);
4608 if (r < 0)
4609 return r;
4610
4611 p = strdup(path);
4612 if (!p)
4613 return -ENOMEM;
4614
4615 path = path_simplify(p, true);
4616
4617 if (!path_is_normalized(path))
4618 return -EPERM;
4619
4620 if (hashmap_contains(u->requires_mounts_for, path))
4621 return 0;
4622
4623 di = (UnitDependencyInfo) {
4624 .origin_mask = mask
4625 };
4626
4627 r = hashmap_put(u->requires_mounts_for, path, di.data);
4628 if (r < 0)
4629 return r;
4630 p = NULL;
4631
4632 char prefix[strlen(path) + 1];
4633 PATH_FOREACH_PREFIX_MORE(prefix, path) {
4634 Set *x;
4635
4636 x = hashmap_get(u->manager->units_requiring_mounts_for, prefix);
4637 if (!x) {
4638 _cleanup_free_ char *q = NULL;
4639
4640 r = hashmap_ensure_allocated(&u->manager->units_requiring_mounts_for, &path_hash_ops);
4641 if (r < 0)
4642 return r;
4643
4644 q = strdup(prefix);
4645 if (!q)
4646 return -ENOMEM;
4647
4648 x = set_new(NULL);
4649 if (!x)
4650 return -ENOMEM;
4651
4652 r = hashmap_put(u->manager->units_requiring_mounts_for, q, x);
4653 if (r < 0) {
4654 set_free(x);
4655 return r;
4656 }
4657 q = NULL;
4658 }
4659
4660 r = set_put(x, u);
4661 if (r < 0)
4662 return r;
4663 }
4664
4665 return 0;
4666 }
4667
4668 int unit_setup_exec_runtime(Unit *u) {
4669 ExecRuntime **rt;
4670 size_t offset;
4671 Unit *other;
4672 Iterator i;
4673 void *v;
4674 int r;
4675
4676 offset = UNIT_VTABLE(u)->exec_runtime_offset;
4677 assert(offset > 0);
4678
4679 /* Check if there already is an ExecRuntime for this unit? */
4680 rt = (ExecRuntime**) ((uint8_t*) u + offset);
4681 if (*rt)
4682 return 0;
4683
4684 /* Try to get it from somebody else */
4685 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_JOINS_NAMESPACE_OF], i) {
4686 r = exec_runtime_acquire(u->manager, NULL, other->id, false, rt);
4687 if (r == 1)
4688 return 1;
4689 }
4690
4691 return exec_runtime_acquire(u->manager, unit_get_exec_context(u), u->id, true, rt);
4692 }
4693
4694 int unit_setup_dynamic_creds(Unit *u) {
4695 ExecContext *ec;
4696 DynamicCreds *dcreds;
4697 size_t offset;
4698
4699 assert(u);
4700
4701 offset = UNIT_VTABLE(u)->dynamic_creds_offset;
4702 assert(offset > 0);
4703 dcreds = (DynamicCreds*) ((uint8_t*) u + offset);
4704
4705 ec = unit_get_exec_context(u);
4706 assert(ec);
4707
4708 if (!ec->dynamic_user)
4709 return 0;
4710
4711 return dynamic_creds_acquire(dcreds, u->manager, ec->user, ec->group);
4712 }
4713
4714 bool unit_type_supported(UnitType t) {
4715 if (_unlikely_(t < 0))
4716 return false;
4717 if (_unlikely_(t >= _UNIT_TYPE_MAX))
4718 return false;
4719
4720 if (!unit_vtable[t]->supported)
4721 return true;
4722
4723 return unit_vtable[t]->supported();
4724 }
4725
4726 void unit_warn_if_dir_nonempty(Unit *u, const char* where) {
4727 int r;
4728
4729 assert(u);
4730 assert(where);
4731
4732 r = dir_is_empty(where);
4733 if (r > 0 || r == -ENOTDIR)
4734 return;
4735 if (r < 0) {
4736 log_unit_warning_errno(u, r, "Failed to check directory %s: %m", where);
4737 return;
4738 }
4739
4740 log_struct(LOG_NOTICE,
4741 "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR,
4742 LOG_UNIT_ID(u),
4743 LOG_UNIT_INVOCATION_ID(u),
4744 LOG_UNIT_MESSAGE(u, "Directory %s to mount over is not empty, mounting anyway.", where),
4745 "WHERE=%s", where);
4746 }
4747
4748 int unit_fail_if_noncanonical(Unit *u, const char* where) {
4749 _cleanup_free_ char *canonical_where = NULL;
4750 int r;
4751
4752 assert(u);
4753 assert(where);
4754
4755 r = chase_symlinks(where, NULL, CHASE_NONEXISTENT, &canonical_where);
4756 if (r < 0) {
4757 log_unit_debug_errno(u, r, "Failed to check %s for symlinks, ignoring: %m", where);
4758 return 0;
4759 }
4760
4761 /* We will happily ignore a trailing slash (or any redundant slashes) */
4762 if (path_equal(where, canonical_where))
4763 return 0;
4764
4765 /* No need to mention "." or "..", they would already have been rejected by unit_name_from_path() */
4766 log_struct(LOG_ERR,
4767 "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR,
4768 LOG_UNIT_ID(u),
4769 LOG_UNIT_INVOCATION_ID(u),
4770 LOG_UNIT_MESSAGE(u, "Mount path %s is not canonical (contains a symlink).", where),
4771 "WHERE=%s", where);
4772
4773 return -ELOOP;
4774 }
4775
4776 bool unit_is_pristine(Unit *u) {
4777 assert(u);
4778
4779 /* Check if the unit already exists or is already around,
4780 * in a number of different ways. Note that to cater for unit
4781 * types such as slice, we are generally fine with units that
4782 * are marked UNIT_LOADED even though nothing was actually
4783 * loaded, as those unit types don't require a file on disk. */
4784
4785 return !(!IN_SET(u->load_state, UNIT_NOT_FOUND, UNIT_LOADED) ||
4786 u->fragment_path ||
4787 u->source_path ||
4788 !strv_isempty(u->dropin_paths) ||
4789 u->job ||
4790 u->merged_into);
4791 }
4792
4793 pid_t unit_control_pid(Unit *u) {
4794 assert(u);
4795
4796 if (UNIT_VTABLE(u)->control_pid)
4797 return UNIT_VTABLE(u)->control_pid(u);
4798
4799 return 0;
4800 }
4801
4802 pid_t unit_main_pid(Unit *u) {
4803 assert(u);
4804
4805 if (UNIT_VTABLE(u)->main_pid)
4806 return UNIT_VTABLE(u)->main_pid(u);
4807
4808 return 0;
4809 }
4810
4811 static void unit_unref_uid_internal(
4812 Unit *u,
4813 uid_t *ref_uid,
4814 bool destroy_now,
4815 void (*_manager_unref_uid)(Manager *m, uid_t uid, bool destroy_now)) {
4816
4817 assert(u);
4818 assert(ref_uid);
4819 assert(_manager_unref_uid);
4820
4821 /* Generic implementation of both unit_unref_uid() and unit_unref_gid(), under the assumption that uid_t and
4822 * gid_t are actually the same time, with the same validity rules.
4823 *
4824 * Drops a reference to UID/GID from a unit. */
4825
4826 assert_cc(sizeof(uid_t) == sizeof(gid_t));
4827 assert_cc(UID_INVALID == (uid_t) GID_INVALID);
4828
4829 if (!uid_is_valid(*ref_uid))
4830 return;
4831
4832 _manager_unref_uid(u->manager, *ref_uid, destroy_now);
4833 *ref_uid = UID_INVALID;
4834 }
4835
4836 void unit_unref_uid(Unit *u, bool destroy_now) {
4837 unit_unref_uid_internal(u, &u->ref_uid, destroy_now, manager_unref_uid);
4838 }
4839
4840 void unit_unref_gid(Unit *u, bool destroy_now) {
4841 unit_unref_uid_internal(u, (uid_t*) &u->ref_gid, destroy_now, manager_unref_gid);
4842 }
4843
4844 static int unit_ref_uid_internal(
4845 Unit *u,
4846 uid_t *ref_uid,
4847 uid_t uid,
4848 bool clean_ipc,
4849 int (*_manager_ref_uid)(Manager *m, uid_t uid, bool clean_ipc)) {
4850
4851 int r;
4852
4853 assert(u);
4854 assert(ref_uid);
4855 assert(uid_is_valid(uid));
4856 assert(_manager_ref_uid);
4857
4858 /* Generic implementation of both unit_ref_uid() and unit_ref_guid(), under the assumption that uid_t and gid_t
4859 * are actually the same type, and have the same validity rules.
4860 *
4861 * Adds a reference on a specific UID/GID to this unit. Each unit referencing the same UID/GID maintains a
4862 * reference so that we can destroy the UID/GID's IPC resources as soon as this is requested and the counter
4863 * drops to zero. */
4864
4865 assert_cc(sizeof(uid_t) == sizeof(gid_t));
4866 assert_cc(UID_INVALID == (uid_t) GID_INVALID);
4867
4868 if (*ref_uid == uid)
4869 return 0;
4870
4871 if (uid_is_valid(*ref_uid)) /* Already set? */
4872 return -EBUSY;
4873
4874 r = _manager_ref_uid(u->manager, uid, clean_ipc);
4875 if (r < 0)
4876 return r;
4877
4878 *ref_uid = uid;
4879 return 1;
4880 }
4881
4882 int unit_ref_uid(Unit *u, uid_t uid, bool clean_ipc) {
4883 return unit_ref_uid_internal(u, &u->ref_uid, uid, clean_ipc, manager_ref_uid);
4884 }
4885
4886 int unit_ref_gid(Unit *u, gid_t gid, bool clean_ipc) {
4887 return unit_ref_uid_internal(u, (uid_t*) &u->ref_gid, (uid_t) gid, clean_ipc, manager_ref_gid);
4888 }
4889
4890 static int unit_ref_uid_gid_internal(Unit *u, uid_t uid, gid_t gid, bool clean_ipc) {
4891 int r = 0, q = 0;
4892
4893 assert(u);
4894
4895 /* Reference both a UID and a GID in one go. Either references both, or neither. */
4896
4897 if (uid_is_valid(uid)) {
4898 r = unit_ref_uid(u, uid, clean_ipc);
4899 if (r < 0)
4900 return r;
4901 }
4902
4903 if (gid_is_valid(gid)) {
4904 q = unit_ref_gid(u, gid, clean_ipc);
4905 if (q < 0) {
4906 if (r > 0)
4907 unit_unref_uid(u, false);
4908
4909 return q;
4910 }
4911 }
4912
4913 return r > 0 || q > 0;
4914 }
4915
4916 int unit_ref_uid_gid(Unit *u, uid_t uid, gid_t gid) {
4917 ExecContext *c;
4918 int r;
4919
4920 assert(u);
4921
4922 c = unit_get_exec_context(u);
4923
4924 r = unit_ref_uid_gid_internal(u, uid, gid, c ? c->remove_ipc : false);
4925 if (r < 0)
4926 return log_unit_warning_errno(u, r, "Couldn't add UID/GID reference to unit, proceeding without: %m");
4927
4928 return r;
4929 }
4930
4931 void unit_unref_uid_gid(Unit *u, bool destroy_now) {
4932 assert(u);
4933
4934 unit_unref_uid(u, destroy_now);
4935 unit_unref_gid(u, destroy_now);
4936 }
4937
4938 void unit_notify_user_lookup(Unit *u, uid_t uid, gid_t gid) {
4939 int r;
4940
4941 assert(u);
4942
4943 /* This is invoked whenever one of the forked off processes let's us know the UID/GID its user name/group names
4944 * resolved to. We keep track of which UID/GID is currently assigned in order to be able to destroy its IPC
4945 * objects when no service references the UID/GID anymore. */
4946
4947 r = unit_ref_uid_gid(u, uid, gid);
4948 if (r > 0)
4949 unit_add_to_dbus_queue(u);
4950 }
4951
4952 int unit_set_invocation_id(Unit *u, sd_id128_t id) {
4953 int r;
4954
4955 assert(u);
4956
4957 /* Set the invocation ID for this unit. If we cannot, this will not roll back, but reset the whole thing. */
4958
4959 if (sd_id128_equal(u->invocation_id, id))
4960 return 0;
4961
4962 if (!sd_id128_is_null(u->invocation_id))
4963 (void) hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u);
4964
4965 if (sd_id128_is_null(id)) {
4966 r = 0;
4967 goto reset;
4968 }
4969
4970 r = hashmap_ensure_allocated(&u->manager->units_by_invocation_id, &id128_hash_ops);
4971 if (r < 0)
4972 goto reset;
4973
4974 u->invocation_id = id;
4975 sd_id128_to_string(id, u->invocation_id_string);
4976
4977 r = hashmap_put(u->manager->units_by_invocation_id, &u->invocation_id, u);
4978 if (r < 0)
4979 goto reset;
4980
4981 return 0;
4982
4983 reset:
4984 u->invocation_id = SD_ID128_NULL;
4985 u->invocation_id_string[0] = 0;
4986 return r;
4987 }
4988
4989 int unit_acquire_invocation_id(Unit *u) {
4990 sd_id128_t id;
4991 int r;
4992
4993 assert(u);
4994
4995 r = sd_id128_randomize(&id);
4996 if (r < 0)
4997 return log_unit_error_errno(u, r, "Failed to generate invocation ID for unit: %m");
4998
4999 r = unit_set_invocation_id(u, id);
5000 if (r < 0)
5001 return log_unit_error_errno(u, r, "Failed to set invocation ID for unit: %m");
5002
5003 unit_add_to_dbus_queue(u);
5004 return 0;
5005 }
5006
5007 int unit_set_exec_params(Unit *u, ExecParameters *p) {
5008 int r;
5009
5010 assert(u);
5011 assert(p);
5012
5013 /* Copy parameters from manager */
5014 r = manager_get_effective_environment(u->manager, &p->environment);
5015 if (r < 0)
5016 return r;
5017
5018 p->confirm_spawn = manager_get_confirm_spawn(u->manager);
5019 p->cgroup_supported = u->manager->cgroup_supported;
5020 p->prefix = u->manager->prefix;
5021 SET_FLAG(p->flags, EXEC_PASS_LOG_UNIT|EXEC_CHOWN_DIRECTORIES, MANAGER_IS_SYSTEM(u->manager));
5022
5023 /* Copy paramaters from unit */
5024 p->cgroup_path = u->cgroup_path;
5025 SET_FLAG(p->flags, EXEC_CGROUP_DELEGATE, unit_cgroup_delegate(u));
5026
5027 return 0;
5028 }
5029
5030 int unit_fork_helper_process(Unit *u, const char *name, pid_t *ret) {
5031 int r;
5032
5033 assert(u);
5034 assert(ret);
5035
5036 /* Forks off a helper process and makes sure it is a member of the unit's cgroup. Returns == 0 in the child,
5037 * and > 0 in the parent. The pid parameter is always filled in with the child's PID. */
5038
5039 (void) unit_realize_cgroup(u);
5040
5041 r = safe_fork(name, FORK_REOPEN_LOG, ret);
5042 if (r != 0)
5043 return r;
5044
5045 (void) default_signals(SIGNALS_CRASH_HANDLER, SIGNALS_IGNORE, -1);
5046 (void) ignore_signals(SIGPIPE, -1);
5047
5048 (void) prctl(PR_SET_PDEATHSIG, SIGTERM);
5049
5050 if (u->cgroup_path) {
5051 r = cg_attach_everywhere(u->manager->cgroup_supported, u->cgroup_path, 0, NULL, NULL);
5052 if (r < 0) {
5053 log_unit_error_errno(u, r, "Failed to join unit cgroup %s: %m", u->cgroup_path);
5054 _exit(EXIT_CGROUP);
5055 }
5056 }
5057
5058 return 0;
5059 }
5060
5061 static void unit_update_dependency_mask(Unit *u, UnitDependency d, Unit *other, UnitDependencyInfo di) {
5062 assert(u);
5063 assert(d >= 0);
5064 assert(d < _UNIT_DEPENDENCY_MAX);
5065 assert(other);
5066
5067 if (di.origin_mask == 0 && di.destination_mask == 0) {
5068 /* No bit set anymore, let's drop the whole entry */
5069 assert_se(hashmap_remove(u->dependencies[d], other));
5070 log_unit_debug(u, "%s lost dependency %s=%s", u->id, unit_dependency_to_string(d), other->id);
5071 } else
5072 /* Mask was reduced, let's update the entry */
5073 assert_se(hashmap_update(u->dependencies[d], other, di.data) == 0);
5074 }
5075
5076 void unit_remove_dependencies(Unit *u, UnitDependencyMask mask) {
5077 UnitDependency d;
5078
5079 assert(u);
5080
5081 /* Removes all dependencies u has on other units marked for ownership by 'mask'. */
5082
5083 if (mask == 0)
5084 return;
5085
5086 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
5087 bool done;
5088
5089 do {
5090 UnitDependencyInfo di;
5091 Unit *other;
5092 Iterator i;
5093
5094 done = true;
5095
5096 HASHMAP_FOREACH_KEY(di.data, other, u->dependencies[d], i) {
5097 UnitDependency q;
5098
5099 if ((di.origin_mask & ~mask) == di.origin_mask)
5100 continue;
5101 di.origin_mask &= ~mask;
5102 unit_update_dependency_mask(u, d, other, di);
5103
5104 /* We updated the dependency from our unit to the other unit now. But most dependencies
5105 * imply a reverse dependency. Hence, let's delete that one too. For that we go through
5106 * all dependency types on the other unit and delete all those which point to us and
5107 * have the right mask set. */
5108
5109 for (q = 0; q < _UNIT_DEPENDENCY_MAX; q++) {
5110 UnitDependencyInfo dj;
5111
5112 dj.data = hashmap_get(other->dependencies[q], u);
5113 if ((dj.destination_mask & ~mask) == dj.destination_mask)
5114 continue;
5115 dj.destination_mask &= ~mask;
5116
5117 unit_update_dependency_mask(other, q, u, dj);
5118 }
5119
5120 unit_add_to_gc_queue(other);
5121
5122 done = false;
5123 break;
5124 }
5125
5126 } while (!done);
5127 }
5128 }
5129
5130 static int unit_export_invocation_id(Unit *u) {
5131 const char *p;
5132 int r;
5133
5134 assert(u);
5135
5136 if (u->exported_invocation_id)
5137 return 0;
5138
5139 if (sd_id128_is_null(u->invocation_id))
5140 return 0;
5141
5142 p = strjoina("/run/systemd/units/invocation:", u->id);
5143 r = symlink_atomic(u->invocation_id_string, p);
5144 if (r < 0)
5145 return log_unit_debug_errno(u, r, "Failed to create invocation ID symlink %s: %m", p);
5146
5147 u->exported_invocation_id = true;
5148 return 0;
5149 }
5150
5151 static int unit_export_log_level_max(Unit *u, const ExecContext *c) {
5152 const char *p;
5153 char buf[2];
5154 int r;
5155
5156 assert(u);
5157 assert(c);
5158
5159 if (u->exported_log_level_max)
5160 return 0;
5161
5162 if (c->log_level_max < 0)
5163 return 0;
5164
5165 assert(c->log_level_max <= 7);
5166
5167 buf[0] = '0' + c->log_level_max;
5168 buf[1] = 0;
5169
5170 p = strjoina("/run/systemd/units/log-level-max:", u->id);
5171 r = symlink_atomic(buf, p);
5172 if (r < 0)
5173 return log_unit_debug_errno(u, r, "Failed to create maximum log level symlink %s: %m", p);
5174
5175 u->exported_log_level_max = true;
5176 return 0;
5177 }
5178
5179 static int unit_export_log_extra_fields(Unit *u, const ExecContext *c) {
5180 _cleanup_close_ int fd = -1;
5181 struct iovec *iovec;
5182 const char *p;
5183 char *pattern;
5184 le64_t *sizes;
5185 ssize_t n;
5186 size_t i;
5187 int r;
5188
5189 if (u->exported_log_extra_fields)
5190 return 0;
5191
5192 if (c->n_log_extra_fields <= 0)
5193 return 0;
5194
5195 sizes = newa(le64_t, c->n_log_extra_fields);
5196 iovec = newa(struct iovec, c->n_log_extra_fields * 2);
5197
5198 for (i = 0; i < c->n_log_extra_fields; i++) {
5199 sizes[i] = htole64(c->log_extra_fields[i].iov_len);
5200
5201 iovec[i*2] = IOVEC_MAKE(sizes + i, sizeof(le64_t));
5202 iovec[i*2+1] = c->log_extra_fields[i];
5203 }
5204
5205 p = strjoina("/run/systemd/units/log-extra-fields:", u->id);
5206 pattern = strjoina(p, ".XXXXXX");
5207
5208 fd = mkostemp_safe(pattern);
5209 if (fd < 0)
5210 return log_unit_debug_errno(u, fd, "Failed to create extra fields file %s: %m", p);
5211
5212 n = writev(fd, iovec, c->n_log_extra_fields*2);
5213 if (n < 0) {
5214 r = log_unit_debug_errno(u, errno, "Failed to write extra fields: %m");
5215 goto fail;
5216 }
5217
5218 (void) fchmod(fd, 0644);
5219
5220 if (rename(pattern, p) < 0) {
5221 r = log_unit_debug_errno(u, errno, "Failed to rename extra fields file: %m");
5222 goto fail;
5223 }
5224
5225 u->exported_log_extra_fields = true;
5226 return 0;
5227
5228 fail:
5229 (void) unlink(pattern);
5230 return r;
5231 }
5232
5233 static int unit_export_log_rate_limit_interval(Unit *u, const ExecContext *c) {
5234 _cleanup_free_ char *buf = NULL;
5235 const char *p;
5236 int r;
5237
5238 assert(u);
5239 assert(c);
5240
5241 if (u->exported_log_rate_limit_interval)
5242 return 0;
5243
5244 if (c->log_rate_limit_interval_usec == 0)
5245 return 0;
5246
5247 p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id);
5248
5249 if (asprintf(&buf, "%" PRIu64, c->log_rate_limit_interval_usec) < 0)
5250 return log_oom();
5251
5252 r = symlink_atomic(buf, p);
5253 if (r < 0)
5254 return log_unit_debug_errno(u, r, "Failed to create log rate limit interval symlink %s: %m", p);
5255
5256 u->exported_log_rate_limit_interval = true;
5257 return 0;
5258 }
5259
5260 static int unit_export_log_rate_limit_burst(Unit *u, const ExecContext *c) {
5261 _cleanup_free_ char *buf = NULL;
5262 const char *p;
5263 int r;
5264
5265 assert(u);
5266 assert(c);
5267
5268 if (u->exported_log_rate_limit_burst)
5269 return 0;
5270
5271 if (c->log_rate_limit_burst == 0)
5272 return 0;
5273
5274 p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id);
5275
5276 if (asprintf(&buf, "%u", c->log_rate_limit_burst) < 0)
5277 return log_oom();
5278
5279 r = symlink_atomic(buf, p);
5280 if (r < 0)
5281 return log_unit_debug_errno(u, r, "Failed to create log rate limit burst symlink %s: %m", p);
5282
5283 u->exported_log_rate_limit_burst = true;
5284 return 0;
5285 }
5286
5287 void unit_export_state_files(Unit *u) {
5288 const ExecContext *c;
5289
5290 assert(u);
5291
5292 if (!u->id)
5293 return;
5294
5295 if (!MANAGER_IS_SYSTEM(u->manager))
5296 return;
5297
5298 if (MANAGER_IS_TEST_RUN(u->manager))
5299 return;
5300
5301 /* Exports a couple of unit properties to /run/systemd/units/, so that journald can quickly query this data
5302 * from there. Ideally, journald would use IPC to query this, like everybody else, but that's hard, as long as
5303 * the IPC system itself and PID 1 also log to the journal.
5304 *
5305 * Note that these files really shouldn't be considered API for anyone else, as use a runtime file system as
5306 * IPC replacement is not compatible with today's world of file system namespaces. However, this doesn't really
5307 * apply to communication between the journal and systemd, as we assume that these two daemons live in the same
5308 * namespace at least.
5309 *
5310 * Note that some of the "files" exported here are actually symlinks and not regular files. Symlinks work
5311 * better for storing small bits of data, in particular as we can write them with two system calls, and read
5312 * them with one. */
5313
5314 (void) unit_export_invocation_id(u);
5315
5316 c = unit_get_exec_context(u);
5317 if (c) {
5318 (void) unit_export_log_level_max(u, c);
5319 (void) unit_export_log_extra_fields(u, c);
5320 (void) unit_export_log_rate_limit_interval(u, c);
5321 (void) unit_export_log_rate_limit_burst(u, c);
5322 }
5323 }
5324
5325 void unit_unlink_state_files(Unit *u) {
5326 const char *p;
5327
5328 assert(u);
5329
5330 if (!u->id)
5331 return;
5332
5333 if (!MANAGER_IS_SYSTEM(u->manager))
5334 return;
5335
5336 /* Undoes the effect of unit_export_state() */
5337
5338 if (u->exported_invocation_id) {
5339 p = strjoina("/run/systemd/units/invocation:", u->id);
5340 (void) unlink(p);
5341
5342 u->exported_invocation_id = false;
5343 }
5344
5345 if (u->exported_log_level_max) {
5346 p = strjoina("/run/systemd/units/log-level-max:", u->id);
5347 (void) unlink(p);
5348
5349 u->exported_log_level_max = false;
5350 }
5351
5352 if (u->exported_log_extra_fields) {
5353 p = strjoina("/run/systemd/units/extra-fields:", u->id);
5354 (void) unlink(p);
5355
5356 u->exported_log_extra_fields = false;
5357 }
5358
5359 if (u->exported_log_rate_limit_interval) {
5360 p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id);
5361 (void) unlink(p);
5362
5363 u->exported_log_rate_limit_interval = false;
5364 }
5365
5366 if (u->exported_log_rate_limit_burst) {
5367 p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id);
5368 (void) unlink(p);
5369
5370 u->exported_log_rate_limit_burst = false;
5371 }
5372 }
5373
5374 int unit_prepare_exec(Unit *u) {
5375 int r;
5376
5377 assert(u);
5378
5379 /* Prepares everything so that we can fork of a process for this unit */
5380
5381 (void) unit_realize_cgroup(u);
5382
5383 if (u->reset_accounting) {
5384 (void) unit_reset_cpu_accounting(u);
5385 (void) unit_reset_ip_accounting(u);
5386 u->reset_accounting = false;
5387 }
5388
5389 unit_export_state_files(u);
5390
5391 r = unit_setup_exec_runtime(u);
5392 if (r < 0)
5393 return r;
5394
5395 r = unit_setup_dynamic_creds(u);
5396 if (r < 0)
5397 return r;
5398
5399 return 0;
5400 }
5401
5402 static int log_leftover(pid_t pid, int sig, void *userdata) {
5403 _cleanup_free_ char *comm = NULL;
5404
5405 (void) get_process_comm(pid, &comm);
5406
5407 if (comm && comm[0] == '(') /* Most likely our own helper process (PAM?), ignore */
5408 return 0;
5409
5410 log_unit_warning(userdata,
5411 "Found left-over process " PID_FMT " (%s) in control group while starting unit. Ignoring.\n"
5412 "This usually indicates unclean termination of a previous run, or service implementation deficiencies.",
5413 pid, strna(comm));
5414
5415 return 1;
5416 }
5417
5418 int unit_warn_leftover_processes(Unit *u) {
5419 assert(u);
5420
5421 (void) unit_pick_cgroup_path(u);
5422
5423 if (!u->cgroup_path)
5424 return 0;
5425
5426 return cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, 0, 0, NULL, log_leftover, u);
5427 }
5428
5429 bool unit_needs_console(Unit *u) {
5430 ExecContext *ec;
5431 UnitActiveState state;
5432
5433 assert(u);
5434
5435 state = unit_active_state(u);
5436
5437 if (UNIT_IS_INACTIVE_OR_FAILED(state))
5438 return false;
5439
5440 if (UNIT_VTABLE(u)->needs_console)
5441 return UNIT_VTABLE(u)->needs_console(u);
5442
5443 /* If this unit type doesn't implement this call, let's use a generic fallback implementation: */
5444 ec = unit_get_exec_context(u);
5445 if (!ec)
5446 return false;
5447
5448 return exec_context_may_touch_console(ec);
5449 }
5450
5451 const char *unit_label_path(Unit *u) {
5452 const char *p;
5453
5454 /* Returns the file system path to use for MAC access decisions, i.e. the file to read the SELinux label off
5455 * when validating access checks. */
5456
5457 p = u->source_path ?: u->fragment_path;
5458 if (!p)
5459 return NULL;
5460
5461 /* If a unit is masked, then don't read the SELinux label of /dev/null, as that really makes no sense */
5462 if (path_equal(p, "/dev/null"))
5463 return NULL;
5464
5465 return p;
5466 }
5467
5468 int unit_pid_attachable(Unit *u, pid_t pid, sd_bus_error *error) {
5469 int r;
5470
5471 assert(u);
5472
5473 /* Checks whether the specified PID is generally good for attaching, i.e. a valid PID, not our manager itself,
5474 * and not a kernel thread either */
5475
5476 /* First, a simple range check */
5477 if (!pid_is_valid(pid))
5478 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process identifier " PID_FMT " is not valid.", pid);
5479
5480 /* Some extra safety check */
5481 if (pid == 1 || pid == getpid_cached())
5482 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a manager process, refusing.", pid);
5483
5484 /* Don't even begin to bother with kernel threads */
5485 r = is_kernel_thread(pid);
5486 if (r == -ESRCH)
5487 return sd_bus_error_setf(error, SD_BUS_ERROR_UNIX_PROCESS_ID_UNKNOWN, "Process with ID " PID_FMT " does not exist.", pid);
5488 if (r < 0)
5489 return sd_bus_error_set_errnof(error, r, "Failed to determine whether process " PID_FMT " is a kernel thread: %m", pid);
5490 if (r > 0)
5491 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a kernel thread, refusing.", pid);
5492
5493 return 0;
5494 }
5495
5496 void unit_log_success(Unit *u) {
5497 assert(u);
5498
5499 log_struct(LOG_INFO,
5500 "MESSAGE_ID=" SD_MESSAGE_UNIT_SUCCESS_STR,
5501 LOG_UNIT_ID(u),
5502 LOG_UNIT_INVOCATION_ID(u),
5503 LOG_UNIT_MESSAGE(u, "Succeeded."));
5504 }
5505
5506 void unit_log_failure(Unit *u, const char *result) {
5507 assert(u);
5508 assert(result);
5509
5510 log_struct(LOG_WARNING,
5511 "MESSAGE_ID=" SD_MESSAGE_UNIT_FAILURE_RESULT_STR,
5512 LOG_UNIT_ID(u),
5513 LOG_UNIT_INVOCATION_ID(u),
5514 LOG_UNIT_MESSAGE(u, "Failed with result '%s'.", result),
5515 "UNIT_RESULT=%s", result);
5516 }
5517
5518 void unit_log_process_exit(
5519 Unit *u,
5520 int level,
5521 const char *kind,
5522 const char *command,
5523 int code,
5524 int status) {
5525
5526 assert(u);
5527 assert(kind);
5528
5529 if (code != CLD_EXITED)
5530 level = LOG_WARNING;
5531
5532 log_struct(level,
5533 "MESSAGE_ID=" SD_MESSAGE_UNIT_PROCESS_EXIT_STR,
5534 LOG_UNIT_MESSAGE(u, "%s exited, code=%s, status=%i/%s",
5535 kind,
5536 sigchld_code_to_string(code), status,
5537 strna(code == CLD_EXITED
5538 ? exit_status_to_string(status, EXIT_STATUS_FULL)
5539 : signal_to_string(status))),
5540 "EXIT_CODE=%s", sigchld_code_to_string(code),
5541 "EXIT_STATUS=%i", status,
5542 "COMMAND=%s", strna(command),
5543 LOG_UNIT_ID(u),
5544 LOG_UNIT_INVOCATION_ID(u));
5545 }
5546
5547 int unit_exit_status(Unit *u) {
5548 assert(u);
5549
5550 /* Returns the exit status to propagate for the most recent cycle of this unit. Returns a value in the range
5551 * 0…255 if there's something to propagate. EOPNOTSUPP if the concept does not apply to this unit type, ENODATA
5552 * if no data is currently known (for example because the unit hasn't deactivated yet) and EBADE if the main
5553 * service process has exited abnormally (signal/coredump). */
5554
5555 if (!UNIT_VTABLE(u)->exit_status)
5556 return -EOPNOTSUPP;
5557
5558 return UNIT_VTABLE(u)->exit_status(u);
5559 }
5560
5561 int unit_failure_action_exit_status(Unit *u) {
5562 int r;
5563
5564 assert(u);
5565
5566 /* Returns the exit status to propagate on failure, or an error if there's nothing to propagate */
5567
5568 if (u->failure_action_exit_status >= 0)
5569 return u->failure_action_exit_status;
5570
5571 r = unit_exit_status(u);
5572 if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */
5573 return 255;
5574
5575 return r;
5576 }
5577
5578 int unit_success_action_exit_status(Unit *u) {
5579 int r;
5580
5581 assert(u);
5582
5583 /* Returns the exit status to propagate on success, or an error if there's nothing to propagate */
5584
5585 if (u->success_action_exit_status >= 0)
5586 return u->success_action_exit_status;
5587
5588 r = unit_exit_status(u);
5589 if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */
5590 return 255;
5591
5592 return r;
5593 }
5594
5595 int unit_test_trigger_loaded(Unit *u) {
5596 Unit *trigger;
5597
5598 /* Tests whether the unit to trigger is loaded */
5599
5600 trigger = UNIT_TRIGGER(u);
5601 if (!trigger)
5602 return log_unit_error_errno(u, SYNTHETIC_ERRNO(ENOENT), "Refusing to start, unit to trigger not loaded.");
5603 if (trigger->load_state != UNIT_LOADED)
5604 return log_unit_error_errno(u, SYNTHETIC_ERRNO(ENOENT), "Refusing to start, unit %s to trigger not loaded.", u->id);
5605
5606 return 0;
5607 }
5608
5609 static const char* const collect_mode_table[_COLLECT_MODE_MAX] = {
5610 [COLLECT_INACTIVE] = "inactive",
5611 [COLLECT_INACTIVE_OR_FAILED] = "inactive-or-failed",
5612 };
5613
5614 DEFINE_STRING_TABLE_LOOKUP(collect_mode, CollectMode);
systemd for Proxmox projects