]> git.ipfire.org Git - thirdparty/systemd.git/blob - src/core/unit.c
projects / thirdparty / systemd.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge pull request #11827 from keszybz/pkgconfig-variables
[thirdparty/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 static bool unit_condition_test_list(Unit *u, Condition *first, const char *(*to_string)(ConditionType t)) {
1593 Condition *c;
1594 int triggered = -1;
1595
1596 assert(u);
1597 assert(to_string);
1598
1599 /* If the condition list is empty, then it is true */
1600 if (!first)
1601 return true;
1602
1603 /* Otherwise, if all of the non-trigger conditions apply and
1604 * if any of the trigger conditions apply (unless there are
1605 * none) we return true */
1606 LIST_FOREACH(conditions, c, first) {
1607 int r;
1608
1609 r = condition_test(c);
1610 if (r < 0)
1611 log_unit_warning(u,
1612 "Couldn't determine result for %s=%s%s%s, assuming failed: %m",
1613 to_string(c->type),
1614 c->trigger ? "|" : "",
1615 c->negate ? "!" : "",
1616 c->parameter);
1617 else
1618 log_unit_debug(u,
1619 "%s=%s%s%s %s.",
1620 to_string(c->type),
1621 c->trigger ? "|" : "",
1622 c->negate ? "!" : "",
1623 c->parameter,
1624 condition_result_to_string(c->result));
1625
1626 if (!c->trigger && r <= 0)
1627 return false;
1628
1629 if (c->trigger && triggered <= 0)
1630 triggered = r > 0;
1631 }
1632
1633 return triggered != 0;
1634 }
1635
1636 static bool unit_condition_test(Unit *u) {
1637 assert(u);
1638
1639 dual_timestamp_get(&u->condition_timestamp);
1640 u->condition_result = unit_condition_test_list(u, u->conditions, condition_type_to_string);
1641
1642 unit_add_to_dbus_queue(u);
1643
1644 return u->condition_result;
1645 }
1646
1647 static bool unit_assert_test(Unit *u) {
1648 assert(u);
1649
1650 dual_timestamp_get(&u->assert_timestamp);
1651 u->assert_result = unit_condition_test_list(u, u->asserts, assert_type_to_string);
1652
1653 unit_add_to_dbus_queue(u);
1654
1655 return u->assert_result;
1656 }
1657
1658 void unit_status_printf(Unit *u, const char *status, const char *unit_status_msg_format) {
1659 const char *d;
1660
1661 d = unit_description(u);
1662 if (log_get_show_color())
1663 d = strjoina(ANSI_HIGHLIGHT, d, ANSI_NORMAL);
1664
1665 DISABLE_WARNING_FORMAT_NONLITERAL;
1666 manager_status_printf(u->manager, STATUS_TYPE_NORMAL, status, unit_status_msg_format, d);
1667 REENABLE_WARNING;
1668 }
1669
1670 int unit_start_limit_test(Unit *u) {
1671 const char *reason;
1672
1673 assert(u);
1674
1675 if (ratelimit_below(&u->start_limit)) {
1676 u->start_limit_hit = false;
1677 return 0;
1678 }
1679
1680 log_unit_warning(u, "Start request repeated too quickly.");
1681 u->start_limit_hit = true;
1682
1683 reason = strjoina("unit ", u->id, " failed");
1684
1685 return emergency_action(u->manager, u->start_limit_action,
1686 EMERGENCY_ACTION_IS_WATCHDOG|EMERGENCY_ACTION_WARN,
1687 u->reboot_arg, -1, reason);
1688 }
1689
1690 bool unit_shall_confirm_spawn(Unit *u) {
1691 assert(u);
1692
1693 if (manager_is_confirm_spawn_disabled(u->manager))
1694 return false;
1695
1696 /* For some reasons units remaining in the same process group
1697 * as PID 1 fail to acquire the console even if it's not used
1698 * by any process. So skip the confirmation question for them. */
1699 return !unit_get_exec_context(u)->same_pgrp;
1700 }
1701
1702 static bool unit_verify_deps(Unit *u) {
1703 Unit *other;
1704 Iterator j;
1705 void *v;
1706
1707 assert(u);
1708
1709 /* Checks whether all BindsTo= dependencies of this unit are fulfilled — if they are also combined with
1710 * After=. We do not check Requires= or Requisite= here as they only should have an effect on the job
1711 * processing, but do not have any effect afterwards. We don't check BindsTo= dependencies that are not used in
1712 * conjunction with After= as for them any such check would make things entirely racy. */
1713
1714 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], j) {
1715
1716 if (!hashmap_contains(u->dependencies[UNIT_AFTER], other))
1717 continue;
1718
1719 if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(other))) {
1720 log_unit_notice(u, "Bound to unit %s, but unit isn't active.", other->id);
1721 return false;
1722 }
1723 }
1724
1725 return true;
1726 }
1727
1728 /* Errors:
1729 * -EBADR: This unit type does not support starting.
1730 * -EALREADY: Unit is already started.
1731 * -EAGAIN: An operation is already in progress. Retry later.
1732 * -ECANCELED: Too many requests for now.
1733 * -EPROTO: Assert failed
1734 * -EINVAL: Unit not loaded
1735 * -EOPNOTSUPP: Unit type not supported
1736 * -ENOLINK: The necessary dependencies are not fulfilled.
1737 * -ESTALE: This unit has been started before and can't be started a second time
1738 */
1739 int unit_start(Unit *u) {
1740 UnitActiveState state;
1741 Unit *following;
1742
1743 assert(u);
1744
1745 /* If this is already started, then this will succeed. Note
1746 * that this will even succeed if this unit is not startable
1747 * by the user. This is relied on to detect when we need to
1748 * wait for units and when waiting is finished. */
1749 state = unit_active_state(u);
1750 if (UNIT_IS_ACTIVE_OR_RELOADING(state))
1751 return -EALREADY;
1752
1753 /* Units that aren't loaded cannot be started */
1754 if (u->load_state != UNIT_LOADED)
1755 return -EINVAL;
1756
1757 /* Refuse starting scope units more than once */
1758 if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_enter_timestamp))
1759 return -ESTALE;
1760
1761 /* If the conditions failed, don't do anything at all. If we
1762 * already are activating this call might still be useful to
1763 * speed up activation in case there is some hold-off time,
1764 * but we don't want to recheck the condition in that case. */
1765 if (state != UNIT_ACTIVATING &&
1766 !unit_condition_test(u)) {
1767 log_unit_debug(u, "Starting requested but condition failed. Not starting unit.");
1768 return -ECOMM;
1769 }
1770
1771 /* If the asserts failed, fail the entire job */
1772 if (state != UNIT_ACTIVATING &&
1773 !unit_assert_test(u)) {
1774 log_unit_notice(u, "Starting requested but asserts failed.");
1775 return -EPROTO;
1776 }
1777
1778 /* Units of types that aren't supported cannot be
1779 * started. Note that we do this test only after the condition
1780 * checks, so that we rather return condition check errors
1781 * (which are usually not considered a true failure) than "not
1782 * supported" errors (which are considered a failure).
1783 */
1784 if (!unit_supported(u))
1785 return -EOPNOTSUPP;
1786
1787 /* Let's make sure that the deps really are in order before we start this. Normally the job engine should have
1788 * taken care of this already, but let's check this here again. After all, our dependencies might not be in
1789 * effect anymore, due to a reload or due to a failed condition. */
1790 if (!unit_verify_deps(u))
1791 return -ENOLINK;
1792
1793 /* Forward to the main object, if we aren't it. */
1794 following = unit_following(u);
1795 if (following) {
1796 log_unit_debug(u, "Redirecting start request from %s to %s.", u->id, following->id);
1797 return unit_start(following);
1798 }
1799
1800 /* If it is stopped, but we cannot start it, then fail */
1801 if (!UNIT_VTABLE(u)->start)
1802 return -EBADR;
1803
1804 /* We don't suppress calls to ->start() here when we are
1805 * already starting, to allow this request to be used as a
1806 * "hurry up" call, for example when the unit is in some "auto
1807 * restart" state where it waits for a holdoff timer to elapse
1808 * before it will start again. */
1809
1810 unit_add_to_dbus_queue(u);
1811
1812 return UNIT_VTABLE(u)->start(u);
1813 }
1814
1815 bool unit_can_start(Unit *u) {
1816 assert(u);
1817
1818 if (u->load_state != UNIT_LOADED)
1819 return false;
1820
1821 if (!unit_supported(u))
1822 return false;
1823
1824 /* Scope units may be started only once */
1825 if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_exit_timestamp))
1826 return false;
1827
1828 return !!UNIT_VTABLE(u)->start;
1829 }
1830
1831 bool unit_can_isolate(Unit *u) {
1832 assert(u);
1833
1834 return unit_can_start(u) &&
1835 u->allow_isolate;
1836 }
1837
1838 /* Errors:
1839 * -EBADR: This unit type does not support stopping.
1840 * -EALREADY: Unit is already stopped.
1841 * -EAGAIN: An operation is already in progress. Retry later.
1842 */
1843 int unit_stop(Unit *u) {
1844 UnitActiveState state;
1845 Unit *following;
1846
1847 assert(u);
1848
1849 state = unit_active_state(u);
1850 if (UNIT_IS_INACTIVE_OR_FAILED(state))
1851 return -EALREADY;
1852
1853 following = unit_following(u);
1854 if (following) {
1855 log_unit_debug(u, "Redirecting stop request from %s to %s.", u->id, following->id);
1856 return unit_stop(following);
1857 }
1858
1859 if (!UNIT_VTABLE(u)->stop)
1860 return -EBADR;
1861
1862 unit_add_to_dbus_queue(u);
1863
1864 return UNIT_VTABLE(u)->stop(u);
1865 }
1866
1867 bool unit_can_stop(Unit *u) {
1868 assert(u);
1869
1870 if (!unit_supported(u))
1871 return false;
1872
1873 if (u->perpetual)
1874 return false;
1875
1876 return !!UNIT_VTABLE(u)->stop;
1877 }
1878
1879 /* Errors:
1880 * -EBADR: This unit type does not support reloading.
1881 * -ENOEXEC: Unit is not started.
1882 * -EAGAIN: An operation is already in progress. Retry later.
1883 */
1884 int unit_reload(Unit *u) {
1885 UnitActiveState state;
1886 Unit *following;
1887
1888 assert(u);
1889
1890 if (u->load_state != UNIT_LOADED)
1891 return -EINVAL;
1892
1893 if (!unit_can_reload(u))
1894 return -EBADR;
1895
1896 state = unit_active_state(u);
1897 if (state == UNIT_RELOADING)
1898 return -EAGAIN;
1899
1900 if (state != UNIT_ACTIVE) {
1901 log_unit_warning(u, "Unit cannot be reloaded because it is inactive.");
1902 return -ENOEXEC;
1903 }
1904
1905 following = unit_following(u);
1906 if (following) {
1907 log_unit_debug(u, "Redirecting reload request from %s to %s.", u->id, following->id);
1908 return unit_reload(following);
1909 }
1910
1911 unit_add_to_dbus_queue(u);
1912
1913 if (!UNIT_VTABLE(u)->reload) {
1914 /* Unit doesn't have a reload function, but we need to propagate the reload anyway */
1915 unit_notify(u, unit_active_state(u), unit_active_state(u), 0);
1916 return 0;
1917 }
1918
1919 return UNIT_VTABLE(u)->reload(u);
1920 }
1921
1922 bool unit_can_reload(Unit *u) {
1923 assert(u);
1924
1925 if (UNIT_VTABLE(u)->can_reload)
1926 return UNIT_VTABLE(u)->can_reload(u);
1927
1928 if (!hashmap_isempty(u->dependencies[UNIT_PROPAGATES_RELOAD_TO]))
1929 return true;
1930
1931 return UNIT_VTABLE(u)->reload;
1932 }
1933
1934 bool unit_is_unneeded(Unit *u) {
1935 static const UnitDependency deps[] = {
1936 UNIT_REQUIRED_BY,
1937 UNIT_REQUISITE_OF,
1938 UNIT_WANTED_BY,
1939 UNIT_BOUND_BY,
1940 };
1941 size_t j;
1942
1943 assert(u);
1944
1945 if (!u->stop_when_unneeded)
1946 return false;
1947
1948 /* Don't clean up while the unit is transitioning or is even inactive. */
1949 if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u)))
1950 return false;
1951 if (u->job)
1952 return false;
1953
1954 for (j = 0; j < ELEMENTSOF(deps); j++) {
1955 Unit *other;
1956 Iterator i;
1957 void *v;
1958
1959 /* If a dependent unit has a job queued, is active or transitioning, or is marked for
1960 * restart, then don't clean this one up. */
1961
1962 HASHMAP_FOREACH_KEY(v, other, u->dependencies[deps[j]], i) {
1963 if (other->job)
1964 return false;
1965
1966 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
1967 return false;
1968
1969 if (unit_will_restart(other))
1970 return false;
1971 }
1972 }
1973
1974 return true;
1975 }
1976
1977 static void check_unneeded_dependencies(Unit *u) {
1978
1979 static const UnitDependency deps[] = {
1980 UNIT_REQUIRES,
1981 UNIT_REQUISITE,
1982 UNIT_WANTS,
1983 UNIT_BINDS_TO,
1984 };
1985 size_t j;
1986
1987 assert(u);
1988
1989 /* Add all units this unit depends on to the queue that processes StopWhenUnneeded= behaviour. */
1990
1991 for (j = 0; j < ELEMENTSOF(deps); j++) {
1992 Unit *other;
1993 Iterator i;
1994 void *v;
1995
1996 HASHMAP_FOREACH_KEY(v, other, u->dependencies[deps[j]], i)
1997 unit_submit_to_stop_when_unneeded_queue(other);
1998 }
1999 }
2000
2001 static void unit_check_binds_to(Unit *u) {
2002 _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL;
2003 bool stop = false;
2004 Unit *other;
2005 Iterator i;
2006 void *v;
2007 int r;
2008
2009 assert(u);
2010
2011 if (u->job)
2012 return;
2013
2014 if (unit_active_state(u) != UNIT_ACTIVE)
2015 return;
2016
2017 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i) {
2018 if (other->job)
2019 continue;
2020
2021 if (!other->coldplugged)
2022 /* We might yet create a job for the other unit… */
2023 continue;
2024
2025 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
2026 continue;
2027
2028 stop = true;
2029 break;
2030 }
2031
2032 if (!stop)
2033 return;
2034
2035 /* If stopping a unit fails continuously we might enter a stop
2036 * loop here, hence stop acting on the service being
2037 * unnecessary after a while. */
2038 if (!ratelimit_below(&u->auto_stop_ratelimit)) {
2039 log_unit_warning(u, "Unit is bound to inactive unit %s, but not stopping since we tried this too often recently.", other->id);
2040 return;
2041 }
2042
2043 assert(other);
2044 log_unit_info(u, "Unit is bound to inactive unit %s. Stopping, too.", other->id);
2045
2046 /* A unit we need to run is gone. Sniff. Let's stop this. */
2047 r = manager_add_job(u->manager, JOB_STOP, u, JOB_FAIL, &error, NULL);
2048 if (r < 0)
2049 log_unit_warning_errno(u, r, "Failed to enqueue stop job, ignoring: %s", bus_error_message(&error, r));
2050 }
2051
2052 static void retroactively_start_dependencies(Unit *u) {
2053 Iterator i;
2054 Unit *other;
2055 void *v;
2056
2057 assert(u);
2058 assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)));
2059
2060 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_REQUIRES], i)
2061 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2062 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2063 manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL);
2064
2065 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i)
2066 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2067 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2068 manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL);
2069
2070 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_WANTS], i)
2071 if (!hashmap_get(u->dependencies[UNIT_AFTER], other) &&
2072 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
2073 manager_add_job(u->manager, JOB_START, other, JOB_FAIL, NULL, NULL);
2074
2075 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTS], i)
2076 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2077 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL);
2078
2079 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTED_BY], i)
2080 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2081 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL);
2082 }
2083
2084 static void retroactively_stop_dependencies(Unit *u) {
2085 Unit *other;
2086 Iterator i;
2087 void *v;
2088
2089 assert(u);
2090 assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)));
2091
2092 /* Pull down units which are bound to us recursively if enabled */
2093 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BOUND_BY], i)
2094 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
2095 manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL);
2096 }
2097
2098 void unit_start_on_failure(Unit *u) {
2099 Unit *other;
2100 Iterator i;
2101 void *v;
2102 int r;
2103
2104 assert(u);
2105
2106 if (hashmap_size(u->dependencies[UNIT_ON_FAILURE]) <= 0)
2107 return;
2108
2109 log_unit_info(u, "Triggering OnFailure= dependencies.");
2110
2111 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_ON_FAILURE], i) {
2112 _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL;
2113
2114 r = manager_add_job(u->manager, JOB_START, other, u->on_failure_job_mode, &error, NULL);
2115 if (r < 0)
2116 log_unit_warning_errno(u, r, "Failed to enqueue OnFailure= job, ignoring: %s", bus_error_message(&error, r));
2117 }
2118 }
2119
2120 void unit_trigger_notify(Unit *u) {
2121 Unit *other;
2122 Iterator i;
2123 void *v;
2124
2125 assert(u);
2126
2127 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_TRIGGERED_BY], i)
2128 if (UNIT_VTABLE(other)->trigger_notify)
2129 UNIT_VTABLE(other)->trigger_notify(other, u);
2130 }
2131
2132 static int unit_log_resources(Unit *u) {
2133 struct iovec iovec[1 + _CGROUP_IP_ACCOUNTING_METRIC_MAX + 4];
2134 bool any_traffic = false, have_ip_accounting = false;
2135 _cleanup_free_ char *igress = NULL, *egress = NULL;
2136 size_t n_message_parts = 0, n_iovec = 0;
2137 char* message_parts[3 + 1], *t;
2138 nsec_t nsec = NSEC_INFINITY;
2139 CGroupIPAccountingMetric m;
2140 size_t i;
2141 int r;
2142 const char* const ip_fields[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = {
2143 [CGROUP_IP_INGRESS_BYTES] = "IP_METRIC_INGRESS_BYTES",
2144 [CGROUP_IP_INGRESS_PACKETS] = "IP_METRIC_INGRESS_PACKETS",
2145 [CGROUP_IP_EGRESS_BYTES] = "IP_METRIC_EGRESS_BYTES",
2146 [CGROUP_IP_EGRESS_PACKETS] = "IP_METRIC_EGRESS_PACKETS",
2147 };
2148
2149 assert(u);
2150
2151 /* Invoked whenever a unit enters failed or dead state. Logs information about consumed resources if resource
2152 * accounting was enabled for a unit. It does this in two ways: a friendly human readable string with reduced
2153 * information and the complete data in structured fields. */
2154
2155 (void) unit_get_cpu_usage(u, &nsec);
2156 if (nsec != NSEC_INFINITY) {
2157 char buf[FORMAT_TIMESPAN_MAX] = "";
2158
2159 /* Format the CPU time for inclusion in the structured log message */
2160 if (asprintf(&t, "CPU_USAGE_NSEC=%" PRIu64, nsec) < 0) {
2161 r = log_oom();
2162 goto finish;
2163 }
2164 iovec[n_iovec++] = IOVEC_MAKE_STRING(t);
2165
2166 /* Format the CPU time for inclusion in the human language message string */
2167 format_timespan(buf, sizeof(buf), nsec / NSEC_PER_USEC, USEC_PER_MSEC);
2168 t = strjoin("consumed ", buf, " CPU time");
2169 if (!t) {
2170 r = log_oom();
2171 goto finish;
2172 }
2173
2174 message_parts[n_message_parts++] = t;
2175 }
2176
2177 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) {
2178 char buf[FORMAT_BYTES_MAX] = "";
2179 uint64_t value = UINT64_MAX;
2180
2181 assert(ip_fields[m]);
2182
2183 (void) unit_get_ip_accounting(u, m, &value);
2184 if (value == UINT64_MAX)
2185 continue;
2186
2187 have_ip_accounting = true;
2188 if (value > 0)
2189 any_traffic = true;
2190
2191 /* Format IP accounting data for inclusion in the structured log message */
2192 if (asprintf(&t, "%s=%" PRIu64, ip_fields[m], value) < 0) {
2193 r = log_oom();
2194 goto finish;
2195 }
2196 iovec[n_iovec++] = IOVEC_MAKE_STRING(t);
2197
2198 /* Format the IP accounting data for inclusion in the human language message string, but only for the
2199 * bytes counters (and not for the packets counters) */
2200 if (m == CGROUP_IP_INGRESS_BYTES) {
2201 assert(!igress);
2202 igress = strjoin("received ", format_bytes(buf, sizeof(buf), value), " IP traffic");
2203 if (!igress) {
2204 r = log_oom();
2205 goto finish;
2206 }
2207 } else if (m == CGROUP_IP_EGRESS_BYTES) {
2208 assert(!egress);
2209 egress = strjoin("sent ", format_bytes(buf, sizeof(buf), value), " IP traffic");
2210 if (!egress) {
2211 r = log_oom();
2212 goto finish;
2213 }
2214 }
2215 }
2216
2217 if (have_ip_accounting) {
2218 if (any_traffic) {
2219 if (igress)
2220 message_parts[n_message_parts++] = TAKE_PTR(igress);
2221 if (egress)
2222 message_parts[n_message_parts++] = TAKE_PTR(egress);
2223
2224 } else {
2225 char *k;
2226
2227 k = strdup("no IP traffic");
2228 if (!k) {
2229 r = log_oom();
2230 goto finish;
2231 }
2232
2233 message_parts[n_message_parts++] = k;
2234 }
2235 }
2236
2237 /* Is there any accounting data available at all? */
2238 if (n_iovec == 0) {
2239 r = 0;
2240 goto finish;
2241 }
2242
2243 if (n_message_parts == 0)
2244 t = strjoina("MESSAGE=", u->id, ": Completed.");
2245 else {
2246 _cleanup_free_ char *joined;
2247
2248 message_parts[n_message_parts] = NULL;
2249
2250 joined = strv_join(message_parts, ", ");
2251 if (!joined) {
2252 r = log_oom();
2253 goto finish;
2254 }
2255
2256 joined[0] = ascii_toupper(joined[0]);
2257 t = strjoina("MESSAGE=", u->id, ": ", joined, ".");
2258 }
2259
2260 /* The following four fields we allocate on the stack or are static strings, we hence don't want to free them,
2261 * and hence don't increase n_iovec for them */
2262 iovec[n_iovec] = IOVEC_MAKE_STRING(t);
2263 iovec[n_iovec + 1] = IOVEC_MAKE_STRING("MESSAGE_ID=" SD_MESSAGE_UNIT_RESOURCES_STR);
2264
2265 t = strjoina(u->manager->unit_log_field, u->id);
2266 iovec[n_iovec + 2] = IOVEC_MAKE_STRING(t);
2267
2268 t = strjoina(u->manager->invocation_log_field, u->invocation_id_string);
2269 iovec[n_iovec + 3] = IOVEC_MAKE_STRING(t);
2270
2271 log_struct_iovec(LOG_INFO, iovec, n_iovec + 4);
2272 r = 0;
2273
2274 finish:
2275 for (i = 0; i < n_message_parts; i++)
2276 free(message_parts[i]);
2277
2278 for (i = 0; i < n_iovec; i++)
2279 free(iovec[i].iov_base);
2280
2281 return r;
2282
2283 }
2284
2285 static void unit_update_on_console(Unit *u) {
2286 bool b;
2287
2288 assert(u);
2289
2290 b = unit_needs_console(u);
2291 if (u->on_console == b)
2292 return;
2293
2294 u->on_console = b;
2295 if (b)
2296 manager_ref_console(u->manager);
2297 else
2298 manager_unref_console(u->manager);
2299 }
2300
2301 static void unit_emit_audit_start(Unit *u) {
2302 assert(u);
2303
2304 if (u->type != UNIT_SERVICE)
2305 return;
2306
2307 /* Write audit record if we have just finished starting up */
2308 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_START, true);
2309 u->in_audit = true;
2310 }
2311
2312 static void unit_emit_audit_stop(Unit *u, UnitActiveState state) {
2313 assert(u);
2314
2315 if (u->type != UNIT_SERVICE)
2316 return;
2317
2318 if (u->in_audit) {
2319 /* Write audit record if we have just finished shutting down */
2320 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_STOP, state == UNIT_INACTIVE);
2321 u->in_audit = false;
2322 } else {
2323 /* Hmm, if there was no start record written write it now, so that we always have a nice pair */
2324 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_START, state == UNIT_INACTIVE);
2325
2326 if (state == UNIT_INACTIVE)
2327 manager_send_unit_audit(u->manager, u, AUDIT_SERVICE_STOP, true);
2328 }
2329 }
2330
2331 static bool unit_process_job(Job *j, UnitActiveState ns, UnitNotifyFlags flags) {
2332 bool unexpected = false;
2333
2334 assert(j);
2335
2336 if (j->state == JOB_WAITING)
2337
2338 /* So we reached a different state for this job. Let's see if we can run it now if it failed previously
2339 * due to EAGAIN. */
2340 job_add_to_run_queue(j);
2341
2342 /* Let's check whether the unit's new state constitutes a finished job, or maybe contradicts a running job and
2343 * hence needs to invalidate jobs. */
2344
2345 switch (j->type) {
2346
2347 case JOB_START:
2348 case JOB_VERIFY_ACTIVE:
2349
2350 if (UNIT_IS_ACTIVE_OR_RELOADING(ns))
2351 job_finish_and_invalidate(j, JOB_DONE, true, false);
2352 else if (j->state == JOB_RUNNING && ns != UNIT_ACTIVATING) {
2353 unexpected = true;
2354
2355 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2356 job_finish_and_invalidate(j, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false);
2357 }
2358
2359 break;
2360
2361 case JOB_RELOAD:
2362 case JOB_RELOAD_OR_START:
2363 case JOB_TRY_RELOAD:
2364
2365 if (j->state == JOB_RUNNING) {
2366 if (ns == UNIT_ACTIVE)
2367 job_finish_and_invalidate(j, (flags & UNIT_NOTIFY_RELOAD_FAILURE) ? JOB_FAILED : JOB_DONE, true, false);
2368 else if (!IN_SET(ns, UNIT_ACTIVATING, UNIT_RELOADING)) {
2369 unexpected = true;
2370
2371 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2372 job_finish_and_invalidate(j, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false);
2373 }
2374 }
2375
2376 break;
2377
2378 case JOB_STOP:
2379 case JOB_RESTART:
2380 case JOB_TRY_RESTART:
2381
2382 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2383 job_finish_and_invalidate(j, JOB_DONE, true, false);
2384 else if (j->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) {
2385 unexpected = true;
2386 job_finish_and_invalidate(j, JOB_FAILED, true, false);
2387 }
2388
2389 break;
2390
2391 default:
2392 assert_not_reached("Job type unknown");
2393 }
2394
2395 return unexpected;
2396 }
2397
2398 void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns, UnitNotifyFlags flags) {
2399 const char *reason;
2400 Manager *m;
2401
2402 assert(u);
2403 assert(os < _UNIT_ACTIVE_STATE_MAX);
2404 assert(ns < _UNIT_ACTIVE_STATE_MAX);
2405
2406 /* Note that this is called for all low-level state changes, even if they might map to the same high-level
2407 * UnitActiveState! That means that ns == os is an expected behavior here. For example: if a mount point is
2408 * remounted this function will be called too! */
2409
2410 m = u->manager;
2411
2412 /* Let's enqueue the change signal early. In case this unit has a job associated we want that this unit is in
2413 * the bus queue, so that any job change signal queued will force out the unit change signal first. */
2414 unit_add_to_dbus_queue(u);
2415
2416 /* Update timestamps for state changes */
2417 if (!MANAGER_IS_RELOADING(m)) {
2418 dual_timestamp_get(&u->state_change_timestamp);
2419
2420 if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns))
2421 u->inactive_exit_timestamp = u->state_change_timestamp;
2422 else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns))
2423 u->inactive_enter_timestamp = u->state_change_timestamp;
2424
2425 if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns))
2426 u->active_enter_timestamp = u->state_change_timestamp;
2427 else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns))
2428 u->active_exit_timestamp = u->state_change_timestamp;
2429 }
2430
2431 /* Keep track of failed units */
2432 (void) manager_update_failed_units(m, u, ns == UNIT_FAILED);
2433
2434 /* Make sure the cgroup and state files are always removed when we become inactive */
2435 if (UNIT_IS_INACTIVE_OR_FAILED(ns)) {
2436 unit_prune_cgroup(u);
2437 unit_unlink_state_files(u);
2438 }
2439
2440 unit_update_on_console(u);
2441
2442 if (!MANAGER_IS_RELOADING(m)) {
2443 bool unexpected;
2444
2445 /* Let's propagate state changes to the job */
2446 if (u->job)
2447 unexpected = unit_process_job(u->job, ns, flags);
2448 else
2449 unexpected = true;
2450
2451 /* If this state change happened without being requested by a job, then let's retroactively start or
2452 * stop dependencies. We skip that step when deserializing, since we don't want to create any
2453 * additional jobs just because something is already activated. */
2454
2455 if (unexpected) {
2456 if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns))
2457 retroactively_start_dependencies(u);
2458 else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns))
2459 retroactively_stop_dependencies(u);
2460 }
2461
2462 /* stop unneeded units regardless if going down was expected or not */
2463 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
2464 check_unneeded_dependencies(u);
2465
2466 if (ns != os && ns == UNIT_FAILED) {
2467 log_unit_debug(u, "Unit entered failed state.");
2468
2469 if (!(flags & UNIT_NOTIFY_WILL_AUTO_RESTART))
2470 unit_start_on_failure(u);
2471 }
2472
2473 if (UNIT_IS_ACTIVE_OR_RELOADING(ns) && !UNIT_IS_ACTIVE_OR_RELOADING(os)) {
2474 /* This unit just finished starting up */
2475
2476 unit_emit_audit_start(u);
2477 manager_send_unit_plymouth(m, u);
2478 }
2479
2480 if (UNIT_IS_INACTIVE_OR_FAILED(ns) && !UNIT_IS_INACTIVE_OR_FAILED(os)) {
2481 /* This unit just stopped/failed. */
2482
2483 unit_emit_audit_stop(u, ns);
2484 unit_log_resources(u);
2485 }
2486 }
2487
2488 manager_recheck_journal(m);
2489 manager_recheck_dbus(m);
2490
2491 unit_trigger_notify(u);
2492
2493 if (!MANAGER_IS_RELOADING(m)) {
2494 /* Maybe we finished startup and are now ready for being stopped because unneeded? */
2495 unit_submit_to_stop_when_unneeded_queue(u);
2496
2497 /* Maybe we finished startup, but something we needed has vanished? Let's die then. (This happens when
2498 * something BindsTo= to a Type=oneshot unit, as these units go directly from starting to inactive,
2499 * without ever entering started.) */
2500 unit_check_binds_to(u);
2501
2502 if (os != UNIT_FAILED && ns == UNIT_FAILED) {
2503 reason = strjoina("unit ", u->id, " failed");
2504 (void) emergency_action(m, u->failure_action, 0, u->reboot_arg, unit_failure_action_exit_status(u), reason);
2505 } else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && ns == UNIT_INACTIVE) {
2506 reason = strjoina("unit ", u->id, " succeeded");
2507 (void) emergency_action(m, u->success_action, 0, u->reboot_arg, unit_success_action_exit_status(u), reason);
2508 }
2509 }
2510
2511 unit_add_to_gc_queue(u);
2512 }
2513
2514 int unit_watch_pid(Unit *u, pid_t pid) {
2515 int r;
2516
2517 assert(u);
2518 assert(pid_is_valid(pid));
2519
2520 /* Watch a specific PID */
2521
2522 r = set_ensure_allocated(&u->pids, NULL);
2523 if (r < 0)
2524 return r;
2525
2526 r = hashmap_ensure_allocated(&u->manager->watch_pids, NULL);
2527 if (r < 0)
2528 return r;
2529
2530 /* First try, let's add the unit keyed by "pid". */
2531 r = hashmap_put(u->manager->watch_pids, PID_TO_PTR(pid), u);
2532 if (r == -EEXIST) {
2533 Unit **array;
2534 bool found = false;
2535 size_t n = 0;
2536
2537 /* OK, the "pid" key is already assigned to a different unit. Let's see if the "-pid" key (which points
2538 * to an array of Units rather than just a Unit), lists us already. */
2539
2540 array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid));
2541 if (array)
2542 for (; array[n]; n++)
2543 if (array[n] == u)
2544 found = true;
2545
2546 if (found) /* Found it already? if so, do nothing */
2547 r = 0;
2548 else {
2549 Unit **new_array;
2550
2551 /* Allocate a new array */
2552 new_array = new(Unit*, n + 2);
2553 if (!new_array)
2554 return -ENOMEM;
2555
2556 memcpy_safe(new_array, array, sizeof(Unit*) * n);
2557 new_array[n] = u;
2558 new_array[n+1] = NULL;
2559
2560 /* Add or replace the old array */
2561 r = hashmap_replace(u->manager->watch_pids, PID_TO_PTR(-pid), new_array);
2562 if (r < 0) {
2563 free(new_array);
2564 return r;
2565 }
2566
2567 free(array);
2568 }
2569 } else if (r < 0)
2570 return r;
2571
2572 r = set_put(u->pids, PID_TO_PTR(pid));
2573 if (r < 0)
2574 return r;
2575
2576 return 0;
2577 }
2578
2579 void unit_unwatch_pid(Unit *u, pid_t pid) {
2580 Unit **array;
2581
2582 assert(u);
2583 assert(pid_is_valid(pid));
2584
2585 /* First let's drop the unit in case it's keyed as "pid". */
2586 (void) hashmap_remove_value(u->manager->watch_pids, PID_TO_PTR(pid), u);
2587
2588 /* Then, let's also drop the unit, in case it's in the array keyed by -pid */
2589 array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid));
2590 if (array) {
2591 size_t n, m = 0;
2592
2593 /* Let's iterate through the array, dropping our own entry */
2594 for (n = 0; array[n]; n++)
2595 if (array[n] != u)
2596 array[m++] = array[n];
2597 array[m] = NULL;
2598
2599 if (m == 0) {
2600 /* The array is now empty, remove the entire entry */
2601 assert(hashmap_remove(u->manager->watch_pids, PID_TO_PTR(-pid)) == array);
2602 free(array);
2603 }
2604 }
2605
2606 (void) set_remove(u->pids, PID_TO_PTR(pid));
2607 }
2608
2609 void unit_unwatch_all_pids(Unit *u) {
2610 assert(u);
2611
2612 while (!set_isempty(u->pids))
2613 unit_unwatch_pid(u, PTR_TO_PID(set_first(u->pids)));
2614
2615 u->pids = set_free(u->pids);
2616 }
2617
2618 static void unit_tidy_watch_pids(Unit *u) {
2619 pid_t except1, except2;
2620 Iterator i;
2621 void *e;
2622
2623 assert(u);
2624
2625 /* Cleans dead PIDs from our list */
2626
2627 except1 = unit_main_pid(u);
2628 except2 = unit_control_pid(u);
2629
2630 SET_FOREACH(e, u->pids, i) {
2631 pid_t pid = PTR_TO_PID(e);
2632
2633 if (pid == except1 || pid == except2)
2634 continue;
2635
2636 if (!pid_is_unwaited(pid))
2637 unit_unwatch_pid(u, pid);
2638 }
2639 }
2640
2641 static int on_rewatch_pids_event(sd_event_source *s, void *userdata) {
2642 Unit *u = userdata;
2643
2644 assert(s);
2645 assert(u);
2646
2647 unit_tidy_watch_pids(u);
2648 unit_watch_all_pids(u);
2649
2650 /* If the PID set is empty now, then let's finish this off. */
2651 unit_synthesize_cgroup_empty_event(u);
2652
2653 return 0;
2654 }
2655
2656 int unit_enqueue_rewatch_pids(Unit *u) {
2657 int r;
2658
2659 assert(u);
2660
2661 if (!u->cgroup_path)
2662 return -ENOENT;
2663
2664 r = cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER);
2665 if (r < 0)
2666 return r;
2667 if (r > 0) /* On unified we can use proper notifications */
2668 return 0;
2669
2670 /* Enqueues a low-priority job that will clean up dead PIDs from our list of PIDs to watch and subscribe to new
2671 * PIDs that might have appeared. We do this in a delayed job because the work might be quite slow, as it
2672 * involves issuing kill(pid, 0) on all processes we watch. */
2673
2674 if (!u->rewatch_pids_event_source) {
2675 _cleanup_(sd_event_source_unrefp) sd_event_source *s = NULL;
2676
2677 r = sd_event_add_defer(u->manager->event, &s, on_rewatch_pids_event, u);
2678 if (r < 0)
2679 return log_error_errno(r, "Failed to allocate event source for tidying watched PIDs: %m");
2680
2681 r = sd_event_source_set_priority(s, SD_EVENT_PRIORITY_IDLE);
2682 if (r < 0)
2683 return log_error_errno(r, "Failed to adjust priority of event source for tidying watched PIDs: m");
2684
2685 (void) sd_event_source_set_description(s, "tidy-watch-pids");
2686
2687 u->rewatch_pids_event_source = TAKE_PTR(s);
2688 }
2689
2690 r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_ONESHOT);
2691 if (r < 0)
2692 return log_error_errno(r, "Failed to enable event source for tidying watched PIDs: %m");
2693
2694 return 0;
2695 }
2696
2697 void unit_dequeue_rewatch_pids(Unit *u) {
2698 int r;
2699 assert(u);
2700
2701 if (!u->rewatch_pids_event_source)
2702 return;
2703
2704 r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_OFF);
2705 if (r < 0)
2706 log_warning_errno(r, "Failed to disable event source for tidying watched PIDs, ignoring: %m");
2707
2708 u->rewatch_pids_event_source = sd_event_source_unref(u->rewatch_pids_event_source);
2709 }
2710
2711 bool unit_job_is_applicable(Unit *u, JobType j) {
2712 assert(u);
2713 assert(j >= 0 && j < _JOB_TYPE_MAX);
2714
2715 switch (j) {
2716
2717 case JOB_VERIFY_ACTIVE:
2718 case JOB_START:
2719 case JOB_NOP:
2720 /* Note that we don't check unit_can_start() here. That's because .device units and suchlike are not
2721 * startable by us but may appear due to external events, and it thus makes sense to permit enqueing
2722 * jobs for it. */
2723 return true;
2724
2725 case JOB_STOP:
2726 /* Similar as above. However, perpetual units can never be stopped (neither explicitly nor due to
2727 * external events), hence it makes no sense to permit enqueing such a request either. */
2728 return !u->perpetual;
2729
2730 case JOB_RESTART:
2731 case JOB_TRY_RESTART:
2732 return unit_can_stop(u) && unit_can_start(u);
2733
2734 case JOB_RELOAD:
2735 case JOB_TRY_RELOAD:
2736 return unit_can_reload(u);
2737
2738 case JOB_RELOAD_OR_START:
2739 return unit_can_reload(u) && unit_can_start(u);
2740
2741 default:
2742 assert_not_reached("Invalid job type");
2743 }
2744 }
2745
2746 static void maybe_warn_about_dependency(Unit *u, const char *other, UnitDependency dependency) {
2747 assert(u);
2748
2749 /* Only warn about some unit types */
2750 if (!IN_SET(dependency, UNIT_CONFLICTS, UNIT_CONFLICTED_BY, UNIT_BEFORE, UNIT_AFTER, UNIT_ON_FAILURE, UNIT_TRIGGERS, UNIT_TRIGGERED_BY))
2751 return;
2752
2753 if (streq_ptr(u->id, other))
2754 log_unit_warning(u, "Dependency %s=%s dropped", unit_dependency_to_string(dependency), u->id);
2755 else
2756 log_unit_warning(u, "Dependency %s=%s dropped, merged into %s", unit_dependency_to_string(dependency), strna(other), u->id);
2757 }
2758
2759 static int unit_add_dependency_hashmap(
2760 Hashmap **h,
2761 Unit *other,
2762 UnitDependencyMask origin_mask,
2763 UnitDependencyMask destination_mask) {
2764
2765 UnitDependencyInfo info;
2766 int r;
2767
2768 assert(h);
2769 assert(other);
2770 assert(origin_mask < _UNIT_DEPENDENCY_MASK_FULL);
2771 assert(destination_mask < _UNIT_DEPENDENCY_MASK_FULL);
2772 assert(origin_mask > 0 || destination_mask > 0);
2773
2774 r = hashmap_ensure_allocated(h, NULL);
2775 if (r < 0)
2776 return r;
2777
2778 assert_cc(sizeof(void*) == sizeof(info));
2779
2780 info.data = hashmap_get(*h, other);
2781 if (info.data) {
2782 /* Entry already exists. Add in our mask. */
2783
2784 if (FLAGS_SET(origin_mask, info.origin_mask) &&
2785 FLAGS_SET(destination_mask, info.destination_mask))
2786 return 0; /* NOP */
2787
2788 info.origin_mask |= origin_mask;
2789 info.destination_mask |= destination_mask;
2790
2791 r = hashmap_update(*h, other, info.data);
2792 } else {
2793 info = (UnitDependencyInfo) {
2794 .origin_mask = origin_mask,
2795 .destination_mask = destination_mask,
2796 };
2797
2798 r = hashmap_put(*h, other, info.data);
2799 }
2800 if (r < 0)
2801 return r;
2802
2803 return 1;
2804 }
2805
2806 int unit_add_dependency(
2807 Unit *u,
2808 UnitDependency d,
2809 Unit *other,
2810 bool add_reference,
2811 UnitDependencyMask mask) {
2812
2813 static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = {
2814 [UNIT_REQUIRES] = UNIT_REQUIRED_BY,
2815 [UNIT_WANTS] = UNIT_WANTED_BY,
2816 [UNIT_REQUISITE] = UNIT_REQUISITE_OF,
2817 [UNIT_BINDS_TO] = UNIT_BOUND_BY,
2818 [UNIT_PART_OF] = UNIT_CONSISTS_OF,
2819 [UNIT_REQUIRED_BY] = UNIT_REQUIRES,
2820 [UNIT_REQUISITE_OF] = UNIT_REQUISITE,
2821 [UNIT_WANTED_BY] = UNIT_WANTS,
2822 [UNIT_BOUND_BY] = UNIT_BINDS_TO,
2823 [UNIT_CONSISTS_OF] = UNIT_PART_OF,
2824 [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY,
2825 [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS,
2826 [UNIT_BEFORE] = UNIT_AFTER,
2827 [UNIT_AFTER] = UNIT_BEFORE,
2828 [UNIT_ON_FAILURE] = _UNIT_DEPENDENCY_INVALID,
2829 [UNIT_REFERENCES] = UNIT_REFERENCED_BY,
2830 [UNIT_REFERENCED_BY] = UNIT_REFERENCES,
2831 [UNIT_TRIGGERS] = UNIT_TRIGGERED_BY,
2832 [UNIT_TRIGGERED_BY] = UNIT_TRIGGERS,
2833 [UNIT_PROPAGATES_RELOAD_TO] = UNIT_RELOAD_PROPAGATED_FROM,
2834 [UNIT_RELOAD_PROPAGATED_FROM] = UNIT_PROPAGATES_RELOAD_TO,
2835 [UNIT_JOINS_NAMESPACE_OF] = UNIT_JOINS_NAMESPACE_OF,
2836 };
2837 Unit *original_u = u, *original_other = other;
2838 int r;
2839
2840 assert(u);
2841 assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX);
2842 assert(other);
2843
2844 u = unit_follow_merge(u);
2845 other = unit_follow_merge(other);
2846
2847 /* We won't allow dependencies on ourselves. We will not
2848 * consider them an error however. */
2849 if (u == other) {
2850 maybe_warn_about_dependency(original_u, original_other->id, d);
2851 return 0;
2852 }
2853
2854 if ((d == UNIT_BEFORE && other->type == UNIT_DEVICE) ||
2855 (d == UNIT_AFTER && u->type == UNIT_DEVICE)) {
2856 log_unit_warning(u, "Dependency Before=%s ignored (.device units cannot be delayed)", other->id);
2857 return 0;
2858 }
2859
2860 r = unit_add_dependency_hashmap(u->dependencies + d, other, mask, 0);
2861 if (r < 0)
2862 return r;
2863
2864 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID && inverse_table[d] != d) {
2865 r = unit_add_dependency_hashmap(other->dependencies + inverse_table[d], u, 0, mask);
2866 if (r < 0)
2867 return r;
2868 }
2869
2870 if (add_reference) {
2871 r = unit_add_dependency_hashmap(u->dependencies + UNIT_REFERENCES, other, mask, 0);
2872 if (r < 0)
2873 return r;
2874
2875 r = unit_add_dependency_hashmap(other->dependencies + UNIT_REFERENCED_BY, u, 0, mask);
2876 if (r < 0)
2877 return r;
2878 }
2879
2880 unit_add_to_dbus_queue(u);
2881 return 0;
2882 }
2883
2884 int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference, UnitDependencyMask mask) {
2885 int r;
2886
2887 assert(u);
2888
2889 r = unit_add_dependency(u, d, other, add_reference, mask);
2890 if (r < 0)
2891 return r;
2892
2893 return unit_add_dependency(u, e, other, add_reference, mask);
2894 }
2895
2896 static int resolve_template(Unit *u, const char *name, char **buf, const char **ret) {
2897 int r;
2898
2899 assert(u);
2900 assert(name);
2901 assert(buf);
2902 assert(ret);
2903
2904 if (!unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) {
2905 *buf = NULL;
2906 *ret = name;
2907 return 0;
2908 }
2909
2910 if (u->instance)
2911 r = unit_name_replace_instance(name, u->instance, buf);
2912 else {
2913 _cleanup_free_ char *i = NULL;
2914
2915 r = unit_name_to_prefix(u->id, &i);
2916 if (r < 0)
2917 return r;
2918
2919 r = unit_name_replace_instance(name, i, buf);
2920 }
2921 if (r < 0)
2922 return r;
2923
2924 *ret = *buf;
2925 return 0;
2926 }
2927
2928 int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, bool add_reference, UnitDependencyMask mask) {
2929 _cleanup_free_ char *buf = NULL;
2930 Unit *other;
2931 int r;
2932
2933 assert(u);
2934 assert(name);
2935
2936 r = resolve_template(u, name, &buf, &name);
2937 if (r < 0)
2938 return r;
2939
2940 r = manager_load_unit(u->manager, name, NULL, NULL, &other);
2941 if (r < 0)
2942 return r;
2943
2944 return unit_add_dependency(u, d, other, add_reference, mask);
2945 }
2946
2947 int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, bool add_reference, UnitDependencyMask mask) {
2948 _cleanup_free_ char *buf = NULL;
2949 Unit *other;
2950 int r;
2951
2952 assert(u);
2953 assert(name);
2954
2955 r = resolve_template(u, name, &buf, &name);
2956 if (r < 0)
2957 return r;
2958
2959 r = manager_load_unit(u->manager, name, NULL, NULL, &other);
2960 if (r < 0)
2961 return r;
2962
2963 return unit_add_two_dependencies(u, d, e, other, add_reference, mask);
2964 }
2965
2966 int set_unit_path(const char *p) {
2967 /* This is mostly for debug purposes */
2968 if (setenv("SYSTEMD_UNIT_PATH", p, 1) < 0)
2969 return -errno;
2970
2971 return 0;
2972 }
2973
2974 char *unit_dbus_path(Unit *u) {
2975 assert(u);
2976
2977 if (!u->id)
2978 return NULL;
2979
2980 return unit_dbus_path_from_name(u->id);
2981 }
2982
2983 char *unit_dbus_path_invocation_id(Unit *u) {
2984 assert(u);
2985
2986 if (sd_id128_is_null(u->invocation_id))
2987 return NULL;
2988
2989 return unit_dbus_path_from_name(u->invocation_id_string);
2990 }
2991
2992 int unit_set_slice(Unit *u, Unit *slice) {
2993 assert(u);
2994 assert(slice);
2995
2996 /* Sets the unit slice if it has not been set before. Is extra
2997 * careful, to only allow this for units that actually have a
2998 * cgroup context. Also, we don't allow to set this for slices
2999 * (since the parent slice is derived from the name). Make
3000 * sure the unit we set is actually a slice. */
3001
3002 if (!UNIT_HAS_CGROUP_CONTEXT(u))
3003 return -EOPNOTSUPP;
3004
3005 if (u->type == UNIT_SLICE)
3006 return -EINVAL;
3007
3008 if (unit_active_state(u) != UNIT_INACTIVE)
3009 return -EBUSY;
3010
3011 if (slice->type != UNIT_SLICE)
3012 return -EINVAL;
3013
3014 if (unit_has_name(u, SPECIAL_INIT_SCOPE) &&
3015 !unit_has_name(slice, SPECIAL_ROOT_SLICE))
3016 return -EPERM;
3017
3018 if (UNIT_DEREF(u->slice) == slice)
3019 return 0;
3020
3021 /* Disallow slice changes if @u is already bound to cgroups */
3022 if (UNIT_ISSET(u->slice) && u->cgroup_realized)
3023 return -EBUSY;
3024
3025 unit_ref_set(&u->slice, u, slice);
3026 return 1;
3027 }
3028
3029 int unit_set_default_slice(Unit *u) {
3030 const char *slice_name;
3031 Unit *slice;
3032 int r;
3033
3034 assert(u);
3035
3036 if (UNIT_ISSET(u->slice))
3037 return 0;
3038
3039 if (u->instance) {
3040 _cleanup_free_ char *prefix = NULL, *escaped = NULL;
3041
3042 /* Implicitly place all instantiated units in their
3043 * own per-template slice */
3044
3045 r = unit_name_to_prefix(u->id, &prefix);
3046 if (r < 0)
3047 return r;
3048
3049 /* The prefix is already escaped, but it might include
3050 * "-" which has a special meaning for slice units,
3051 * hence escape it here extra. */
3052 escaped = unit_name_escape(prefix);
3053 if (!escaped)
3054 return -ENOMEM;
3055
3056 if (MANAGER_IS_SYSTEM(u->manager))
3057 slice_name = strjoina("system-", escaped, ".slice");
3058 else
3059 slice_name = strjoina(escaped, ".slice");
3060 } else
3061 slice_name =
3062 MANAGER_IS_SYSTEM(u->manager) && !unit_has_name(u, SPECIAL_INIT_SCOPE)
3063 ? SPECIAL_SYSTEM_SLICE
3064 : SPECIAL_ROOT_SLICE;
3065
3066 r = manager_load_unit(u->manager, slice_name, NULL, NULL, &slice);
3067 if (r < 0)
3068 return r;
3069
3070 return unit_set_slice(u, slice);
3071 }
3072
3073 const char *unit_slice_name(Unit *u) {
3074 assert(u);
3075
3076 if (!UNIT_ISSET(u->slice))
3077 return NULL;
3078
3079 return UNIT_DEREF(u->slice)->id;
3080 }
3081
3082 int unit_load_related_unit(Unit *u, const char *type, Unit **_found) {
3083 _cleanup_free_ char *t = NULL;
3084 int r;
3085
3086 assert(u);
3087 assert(type);
3088 assert(_found);
3089
3090 r = unit_name_change_suffix(u->id, type, &t);
3091 if (r < 0)
3092 return r;
3093 if (unit_has_name(u, t))
3094 return -EINVAL;
3095
3096 r = manager_load_unit(u->manager, t, NULL, NULL, _found);
3097 assert(r < 0 || *_found != u);
3098 return r;
3099 }
3100
3101 static int signal_name_owner_changed(sd_bus_message *message, void *userdata, sd_bus_error *error) {
3102 const char *name, *old_owner, *new_owner;
3103 Unit *u = userdata;
3104 int r;
3105
3106 assert(message);
3107 assert(u);
3108
3109 r = sd_bus_message_read(message, "sss", &name, &old_owner, &new_owner);
3110 if (r < 0) {
3111 bus_log_parse_error(r);
3112 return 0;
3113 }
3114
3115 old_owner = empty_to_null(old_owner);
3116 new_owner = empty_to_null(new_owner);
3117
3118 if (UNIT_VTABLE(u)->bus_name_owner_change)
3119 UNIT_VTABLE(u)->bus_name_owner_change(u, name, old_owner, new_owner);
3120
3121 return 0;
3122 }
3123
3124 int unit_install_bus_match(Unit *u, sd_bus *bus, const char *name) {
3125 const char *match;
3126
3127 assert(u);
3128 assert(bus);
3129 assert(name);
3130
3131 if (u->match_bus_slot)
3132 return -EBUSY;
3133
3134 match = strjoina("type='signal',"
3135 "sender='org.freedesktop.DBus',"
3136 "path='/org/freedesktop/DBus',"
3137 "interface='org.freedesktop.DBus',"
3138 "member='NameOwnerChanged',"
3139 "arg0='", name, "'");
3140
3141 return sd_bus_add_match_async(bus, &u->match_bus_slot, match, signal_name_owner_changed, NULL, u);
3142 }
3143
3144 int unit_watch_bus_name(Unit *u, const char *name) {
3145 int r;
3146
3147 assert(u);
3148 assert(name);
3149
3150 /* Watch a specific name on the bus. We only support one unit
3151 * watching each name for now. */
3152
3153 if (u->manager->api_bus) {
3154 /* If the bus is already available, install the match directly.
3155 * Otherwise, just put the name in the list. bus_setup_api() will take care later. */
3156 r = unit_install_bus_match(u, u->manager->api_bus, name);
3157 if (r < 0)
3158 return log_warning_errno(r, "Failed to subscribe to NameOwnerChanged signal for '%s': %m", name);
3159 }
3160
3161 r = hashmap_put(u->manager->watch_bus, name, u);
3162 if (r < 0) {
3163 u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot);
3164 return log_warning_errno(r, "Failed to put bus name to hashmap: %m");
3165 }
3166
3167 return 0;
3168 }
3169
3170 void unit_unwatch_bus_name(Unit *u, const char *name) {
3171 assert(u);
3172 assert(name);
3173
3174 (void) hashmap_remove_value(u->manager->watch_bus, name, u);
3175 u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot);
3176 }
3177
3178 bool unit_can_serialize(Unit *u) {
3179 assert(u);
3180
3181 return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item;
3182 }
3183
3184 static int serialize_cgroup_mask(FILE *f, const char *key, CGroupMask mask) {
3185 _cleanup_free_ char *s = NULL;
3186 int r;
3187
3188 assert(f);
3189 assert(key);
3190
3191 if (mask == 0)
3192 return 0;
3193
3194 r = cg_mask_to_string(mask, &s);
3195 if (r < 0)
3196 return log_error_errno(r, "Failed to format cgroup mask: %m");
3197
3198 return serialize_item(f, key, s);
3199 }
3200
3201 static const char *ip_accounting_metric_field[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = {
3202 [CGROUP_IP_INGRESS_BYTES] = "ip-accounting-ingress-bytes",
3203 [CGROUP_IP_INGRESS_PACKETS] = "ip-accounting-ingress-packets",
3204 [CGROUP_IP_EGRESS_BYTES] = "ip-accounting-egress-bytes",
3205 [CGROUP_IP_EGRESS_PACKETS] = "ip-accounting-egress-packets",
3206 };
3207
3208 int unit_serialize(Unit *u, FILE *f, FDSet *fds, bool serialize_jobs) {
3209 CGroupIPAccountingMetric m;
3210 int r;
3211
3212 assert(u);
3213 assert(f);
3214 assert(fds);
3215
3216 if (unit_can_serialize(u)) {
3217 r = UNIT_VTABLE(u)->serialize(u, f, fds);
3218 if (r < 0)
3219 return r;
3220 }
3221
3222 (void) serialize_dual_timestamp(f, "state-change-timestamp", &u->state_change_timestamp);
3223
3224 (void) serialize_dual_timestamp(f, "inactive-exit-timestamp", &u->inactive_exit_timestamp);
3225 (void) serialize_dual_timestamp(f, "active-enter-timestamp", &u->active_enter_timestamp);
3226 (void) serialize_dual_timestamp(f, "active-exit-timestamp", &u->active_exit_timestamp);
3227 (void) serialize_dual_timestamp(f, "inactive-enter-timestamp", &u->inactive_enter_timestamp);
3228
3229 (void) serialize_dual_timestamp(f, "condition-timestamp", &u->condition_timestamp);
3230 (void) serialize_dual_timestamp(f, "assert-timestamp", &u->assert_timestamp);
3231
3232 if (dual_timestamp_is_set(&u->condition_timestamp))
3233 (void) serialize_bool(f, "condition-result", u->condition_result);
3234
3235 if (dual_timestamp_is_set(&u->assert_timestamp))
3236 (void) serialize_bool(f, "assert-result", u->assert_result);
3237
3238 (void) serialize_bool(f, "transient", u->transient);
3239 (void) serialize_bool(f, "in-audit", u->in_audit);
3240
3241 (void) serialize_bool(f, "exported-invocation-id", u->exported_invocation_id);
3242 (void) serialize_bool(f, "exported-log-level-max", u->exported_log_level_max);
3243 (void) serialize_bool(f, "exported-log-extra-fields", u->exported_log_extra_fields);
3244 (void) serialize_bool(f, "exported-log-rate-limit-interval", u->exported_log_rate_limit_interval);
3245 (void) serialize_bool(f, "exported-log-rate-limit-burst", u->exported_log_rate_limit_burst);
3246
3247 (void) serialize_item_format(f, "cpu-usage-base", "%" PRIu64, u->cpu_usage_base);
3248 if (u->cpu_usage_last != NSEC_INFINITY)
3249 (void) serialize_item_format(f, "cpu-usage-last", "%" PRIu64, u->cpu_usage_last);
3250
3251 if (u->cgroup_path)
3252 (void) serialize_item(f, "cgroup", u->cgroup_path);
3253
3254 (void) serialize_bool(f, "cgroup-realized", u->cgroup_realized);
3255 (void) serialize_cgroup_mask(f, "cgroup-realized-mask", u->cgroup_realized_mask);
3256 (void) serialize_cgroup_mask(f, "cgroup-enabled-mask", u->cgroup_enabled_mask);
3257 (void) serialize_cgroup_mask(f, "cgroup-invalidated-mask", u->cgroup_invalidated_mask);
3258
3259 if (uid_is_valid(u->ref_uid))
3260 (void) serialize_item_format(f, "ref-uid", UID_FMT, u->ref_uid);
3261 if (gid_is_valid(u->ref_gid))
3262 (void) serialize_item_format(f, "ref-gid", GID_FMT, u->ref_gid);
3263
3264 if (!sd_id128_is_null(u->invocation_id))
3265 (void) serialize_item_format(f, "invocation-id", SD_ID128_FORMAT_STR, SD_ID128_FORMAT_VAL(u->invocation_id));
3266
3267 bus_track_serialize(u->bus_track, f, "ref");
3268
3269 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) {
3270 uint64_t v;
3271
3272 r = unit_get_ip_accounting(u, m, &v);
3273 if (r >= 0)
3274 (void) serialize_item_format(f, ip_accounting_metric_field[m], "%" PRIu64, v);
3275 }
3276
3277 if (serialize_jobs) {
3278 if (u->job) {
3279 fputs("job\n", f);
3280 job_serialize(u->job, f);
3281 }
3282
3283 if (u->nop_job) {
3284 fputs("job\n", f);
3285 job_serialize(u->nop_job, f);
3286 }
3287 }
3288
3289 /* End marker */
3290 fputc('\n', f);
3291 return 0;
3292 }
3293
3294 static int unit_deserialize_job(Unit *u, FILE *f) {
3295 _cleanup_(job_freep) Job *j = NULL;
3296 int r;
3297
3298 assert(u);
3299 assert(f);
3300
3301 j = job_new_raw(u);
3302 if (!j)
3303 return log_oom();
3304
3305 r = job_deserialize(j, f);
3306 if (r < 0)
3307 return r;
3308
3309 r = job_install_deserialized(j);
3310 if (r < 0)
3311 return r;
3312
3313 TAKE_PTR(j);
3314 return 0;
3315 }
3316
3317 int unit_deserialize(Unit *u, FILE *f, FDSet *fds) {
3318 int r;
3319
3320 assert(u);
3321 assert(f);
3322 assert(fds);
3323
3324 for (;;) {
3325 _cleanup_free_ char *line = NULL;
3326 CGroupIPAccountingMetric m;
3327 char *l, *v;
3328 size_t k;
3329
3330 r = read_line(f, LONG_LINE_MAX, &line);
3331 if (r < 0)
3332 return log_error_errno(r, "Failed to read serialization line: %m");
3333 if (r == 0) /* eof */
3334 break;
3335
3336 l = strstrip(line);
3337 if (isempty(l)) /* End marker */
3338 break;
3339
3340 k = strcspn(l, "=");
3341
3342 if (l[k] == '=') {
3343 l[k] = 0;
3344 v = l+k+1;
3345 } else
3346 v = l+k;
3347
3348 if (streq(l, "job")) {
3349 if (v[0] == '\0') {
3350 /* New-style serialized job */
3351 r = unit_deserialize_job(u, f);
3352 if (r < 0)
3353 return r;
3354 } else /* Legacy for pre-44 */
3355 log_unit_warning(u, "Update from too old systemd versions are unsupported, cannot deserialize job: %s", v);
3356 continue;
3357 } else if (streq(l, "state-change-timestamp")) {
3358 (void) deserialize_dual_timestamp(v, &u->state_change_timestamp);
3359 continue;
3360 } else if (streq(l, "inactive-exit-timestamp")) {
3361 (void) deserialize_dual_timestamp(v, &u->inactive_exit_timestamp);
3362 continue;
3363 } else if (streq(l, "active-enter-timestamp")) {
3364 (void) deserialize_dual_timestamp(v, &u->active_enter_timestamp);
3365 continue;
3366 } else if (streq(l, "active-exit-timestamp")) {
3367 (void) deserialize_dual_timestamp(v, &u->active_exit_timestamp);
3368 continue;
3369 } else if (streq(l, "inactive-enter-timestamp")) {
3370 (void) deserialize_dual_timestamp(v, &u->inactive_enter_timestamp);
3371 continue;
3372 } else if (streq(l, "condition-timestamp")) {
3373 (void) deserialize_dual_timestamp(v, &u->condition_timestamp);
3374 continue;
3375 } else if (streq(l, "assert-timestamp")) {
3376 (void) deserialize_dual_timestamp(v, &u->assert_timestamp);
3377 continue;
3378 } else if (streq(l, "condition-result")) {
3379
3380 r = parse_boolean(v);
3381 if (r < 0)
3382 log_unit_debug(u, "Failed to parse condition result value %s, ignoring.", v);
3383 else
3384 u->condition_result = r;
3385
3386 continue;
3387
3388 } else if (streq(l, "assert-result")) {
3389
3390 r = parse_boolean(v);
3391 if (r < 0)
3392 log_unit_debug(u, "Failed to parse assert result value %s, ignoring.", v);
3393 else
3394 u->assert_result = r;
3395
3396 continue;
3397
3398 } else if (streq(l, "transient")) {
3399
3400 r = parse_boolean(v);
3401 if (r < 0)
3402 log_unit_debug(u, "Failed to parse transient bool %s, ignoring.", v);
3403 else
3404 u->transient = r;
3405
3406 continue;
3407
3408 } else if (streq(l, "in-audit")) {
3409
3410 r = parse_boolean(v);
3411 if (r < 0)
3412 log_unit_debug(u, "Failed to parse in-audit bool %s, ignoring.", v);
3413 else
3414 u->in_audit = r;
3415
3416 continue;
3417
3418 } else if (streq(l, "exported-invocation-id")) {
3419
3420 r = parse_boolean(v);
3421 if (r < 0)
3422 log_unit_debug(u, "Failed to parse exported invocation ID bool %s, ignoring.", v);
3423 else
3424 u->exported_invocation_id = r;
3425
3426 continue;
3427
3428 } else if (streq(l, "exported-log-level-max")) {
3429
3430 r = parse_boolean(v);
3431 if (r < 0)
3432 log_unit_debug(u, "Failed to parse exported log level max bool %s, ignoring.", v);
3433 else
3434 u->exported_log_level_max = r;
3435
3436 continue;
3437
3438 } else if (streq(l, "exported-log-extra-fields")) {
3439
3440 r = parse_boolean(v);
3441 if (r < 0)
3442 log_unit_debug(u, "Failed to parse exported log extra fields bool %s, ignoring.", v);
3443 else
3444 u->exported_log_extra_fields = r;
3445
3446 continue;
3447
3448 } else if (streq(l, "exported-log-rate-limit-interval")) {
3449
3450 r = parse_boolean(v);
3451 if (r < 0)
3452 log_unit_debug(u, "Failed to parse exported log rate limit interval %s, ignoring.", v);
3453 else
3454 u->exported_log_rate_limit_interval = r;
3455
3456 continue;
3457
3458 } else if (streq(l, "exported-log-rate-limit-burst")) {
3459
3460 r = parse_boolean(v);
3461 if (r < 0)
3462 log_unit_debug(u, "Failed to parse exported log rate limit burst %s, ignoring.", v);
3463 else
3464 u->exported_log_rate_limit_burst = r;
3465
3466 continue;
3467
3468 } else if (STR_IN_SET(l, "cpu-usage-base", "cpuacct-usage-base")) {
3469
3470 r = safe_atou64(v, &u->cpu_usage_base);
3471 if (r < 0)
3472 log_unit_debug(u, "Failed to parse CPU usage base %s, ignoring.", v);
3473
3474 continue;
3475
3476 } else if (streq(l, "cpu-usage-last")) {
3477
3478 r = safe_atou64(v, &u->cpu_usage_last);
3479 if (r < 0)
3480 log_unit_debug(u, "Failed to read CPU usage last %s, ignoring.", v);
3481
3482 continue;
3483
3484 } else if (streq(l, "cgroup")) {
3485
3486 r = unit_set_cgroup_path(u, v);
3487 if (r < 0)
3488 log_unit_debug_errno(u, r, "Failed to set cgroup path %s, ignoring: %m", v);
3489
3490 (void) unit_watch_cgroup(u);
3491
3492 continue;
3493 } else if (streq(l, "cgroup-realized")) {
3494 int b;
3495
3496 b = parse_boolean(v);
3497 if (b < 0)
3498 log_unit_debug(u, "Failed to parse cgroup-realized bool %s, ignoring.", v);
3499 else
3500 u->cgroup_realized = b;
3501
3502 continue;
3503
3504 } else if (streq(l, "cgroup-realized-mask")) {
3505
3506 r = cg_mask_from_string(v, &u->cgroup_realized_mask);
3507 if (r < 0)
3508 log_unit_debug(u, "Failed to parse cgroup-realized-mask %s, ignoring.", v);
3509 continue;
3510
3511 } else if (streq(l, "cgroup-enabled-mask")) {
3512
3513 r = cg_mask_from_string(v, &u->cgroup_enabled_mask);
3514 if (r < 0)
3515 log_unit_debug(u, "Failed to parse cgroup-enabled-mask %s, ignoring.", v);
3516 continue;
3517
3518 } else if (streq(l, "cgroup-invalidated-mask")) {
3519
3520 r = cg_mask_from_string(v, &u->cgroup_invalidated_mask);
3521 if (r < 0)
3522 log_unit_debug(u, "Failed to parse cgroup-invalidated-mask %s, ignoring.", v);
3523 continue;
3524
3525 } else if (streq(l, "ref-uid")) {
3526 uid_t uid;
3527
3528 r = parse_uid(v, &uid);
3529 if (r < 0)
3530 log_unit_debug(u, "Failed to parse referenced UID %s, ignoring.", v);
3531 else
3532 unit_ref_uid_gid(u, uid, GID_INVALID);
3533
3534 continue;
3535
3536 } else if (streq(l, "ref-gid")) {
3537 gid_t gid;
3538
3539 r = parse_gid(v, &gid);
3540 if (r < 0)
3541 log_unit_debug(u, "Failed to parse referenced GID %s, ignoring.", v);
3542 else
3543 unit_ref_uid_gid(u, UID_INVALID, gid);
3544
3545 continue;
3546
3547 } else if (streq(l, "ref")) {
3548
3549 r = strv_extend(&u->deserialized_refs, v);
3550 if (r < 0)
3551 return log_oom();
3552
3553 continue;
3554 } else if (streq(l, "invocation-id")) {
3555 sd_id128_t id;
3556
3557 r = sd_id128_from_string(v, &id);
3558 if (r < 0)
3559 log_unit_debug(u, "Failed to parse invocation id %s, ignoring.", v);
3560 else {
3561 r = unit_set_invocation_id(u, id);
3562 if (r < 0)
3563 log_unit_warning_errno(u, r, "Failed to set invocation ID for unit: %m");
3564 }
3565
3566 continue;
3567 }
3568
3569 /* Check if this is an IP accounting metric serialization field */
3570 for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++)
3571 if (streq(l, ip_accounting_metric_field[m]))
3572 break;
3573 if (m < _CGROUP_IP_ACCOUNTING_METRIC_MAX) {
3574 uint64_t c;
3575
3576 r = safe_atou64(v, &c);
3577 if (r < 0)
3578 log_unit_debug(u, "Failed to parse IP accounting value %s, ignoring.", v);
3579 else
3580 u->ip_accounting_extra[m] = c;
3581 continue;
3582 }
3583
3584 if (unit_can_serialize(u)) {
3585 r = exec_runtime_deserialize_compat(u, l, v, fds);
3586 if (r < 0) {
3587 log_unit_warning(u, "Failed to deserialize runtime parameter '%s', ignoring.", l);
3588 continue;
3589 }
3590
3591 /* Returns positive if key was handled by the call */
3592 if (r > 0)
3593 continue;
3594
3595 r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds);
3596 if (r < 0)
3597 log_unit_warning(u, "Failed to deserialize unit parameter '%s', ignoring.", l);
3598 }
3599 }
3600
3601 /* Versions before 228 did not carry a state change timestamp. In this case, take the current time. This is
3602 * useful, so that timeouts based on this timestamp don't trigger too early, and is in-line with the logic from
3603 * before 228 where the base for timeouts was not persistent across reboots. */
3604
3605 if (!dual_timestamp_is_set(&u->state_change_timestamp))
3606 dual_timestamp_get(&u->state_change_timestamp);
3607
3608 /* Let's make sure that everything that is deserialized also gets any potential new cgroup settings applied
3609 * after we are done. For that we invalidate anything already realized, so that we can realize it again. */
3610 unit_invalidate_cgroup(u, _CGROUP_MASK_ALL);
3611 unit_invalidate_cgroup_bpf(u);
3612
3613 return 0;
3614 }
3615
3616 int unit_deserialize_skip(FILE *f) {
3617 int r;
3618 assert(f);
3619
3620 /* Skip serialized data for this unit. We don't know what it is. */
3621
3622 for (;;) {
3623 _cleanup_free_ char *line = NULL;
3624 char *l;
3625
3626 r = read_line(f, LONG_LINE_MAX, &line);
3627 if (r < 0)
3628 return log_error_errno(r, "Failed to read serialization line: %m");
3629 if (r == 0)
3630 return 0;
3631
3632 l = strstrip(line);
3633
3634 /* End marker */
3635 if (isempty(l))
3636 return 1;
3637 }
3638 }
3639
3640 int unit_add_node_dependency(Unit *u, const char *what, bool wants, UnitDependency dep, UnitDependencyMask mask) {
3641 Unit *device;
3642 _cleanup_free_ char *e = NULL;
3643 int r;
3644
3645 assert(u);
3646
3647 /* Adds in links to the device node that this unit is based on */
3648 if (isempty(what))
3649 return 0;
3650
3651 if (!is_device_path(what))
3652 return 0;
3653
3654 /* When device units aren't supported (such as in a
3655 * container), don't create dependencies on them. */
3656 if (!unit_type_supported(UNIT_DEVICE))
3657 return 0;
3658
3659 r = unit_name_from_path(what, ".device", &e);
3660 if (r < 0)
3661 return r;
3662
3663 r = manager_load_unit(u->manager, e, NULL, NULL, &device);
3664 if (r < 0)
3665 return r;
3666
3667 if (dep == UNIT_REQUIRES && device_shall_be_bound_by(device, u))
3668 dep = UNIT_BINDS_TO;
3669
3670 r = unit_add_two_dependencies(u, UNIT_AFTER,
3671 MANAGER_IS_SYSTEM(u->manager) ? dep : UNIT_WANTS,
3672 device, true, mask);
3673 if (r < 0)
3674 return r;
3675
3676 if (wants) {
3677 r = unit_add_dependency(device, UNIT_WANTS, u, false, mask);
3678 if (r < 0)
3679 return r;
3680 }
3681
3682 return 0;
3683 }
3684
3685 int unit_coldplug(Unit *u) {
3686 int r = 0, q;
3687 char **i;
3688
3689 assert(u);
3690
3691 /* Make sure we don't enter a loop, when coldplugging recursively. */
3692 if (u->coldplugged)
3693 return 0;
3694
3695 u->coldplugged = true;
3696
3697 STRV_FOREACH(i, u->deserialized_refs) {
3698 q = bus_unit_track_add_name(u, *i);
3699 if (q < 0 && r >= 0)
3700 r = q;
3701 }
3702 u->deserialized_refs = strv_free(u->deserialized_refs);
3703
3704 if (UNIT_VTABLE(u)->coldplug) {
3705 q = UNIT_VTABLE(u)->coldplug(u);
3706 if (q < 0 && r >= 0)
3707 r = q;
3708 }
3709
3710 if (u->job) {
3711 q = job_coldplug(u->job);
3712 if (q < 0 && r >= 0)
3713 r = q;
3714 }
3715
3716 return r;
3717 }
3718
3719 void unit_catchup(Unit *u) {
3720 assert(u);
3721
3722 if (UNIT_VTABLE(u)->catchup)
3723 UNIT_VTABLE(u)->catchup(u);
3724 }
3725
3726 static bool fragment_mtime_newer(const char *path, usec_t mtime, bool path_masked) {
3727 struct stat st;
3728
3729 if (!path)
3730 return false;
3731
3732 /* If the source is some virtual kernel file system, then we assume we watch it anyway, and hence pretend we
3733 * are never out-of-date. */
3734 if (PATH_STARTSWITH_SET(path, "/proc", "/sys"))
3735 return false;
3736
3737 if (stat(path, &st) < 0)
3738 /* What, cannot access this anymore? */
3739 return true;
3740
3741 if (path_masked)
3742 /* For masked files check if they are still so */
3743 return !null_or_empty(&st);
3744 else
3745 /* For non-empty files check the mtime */
3746 return timespec_load(&st.st_mtim) > mtime;
3747
3748 return false;
3749 }
3750
3751 bool unit_need_daemon_reload(Unit *u) {
3752 _cleanup_strv_free_ char **t = NULL;
3753 char **path;
3754
3755 assert(u);
3756
3757 /* For unit files, we allow masking… */
3758 if (fragment_mtime_newer(u->fragment_path, u->fragment_mtime,
3759 u->load_state == UNIT_MASKED))
3760 return true;
3761
3762 /* Source paths should not be masked… */
3763 if (fragment_mtime_newer(u->source_path, u->source_mtime, false))
3764 return true;
3765
3766 if (u->load_state == UNIT_LOADED)
3767 (void) unit_find_dropin_paths(u, &t);
3768 if (!strv_equal(u->dropin_paths, t))
3769 return true;
3770
3771 /* … any drop-ins that are masked are simply omitted from the list. */
3772 STRV_FOREACH(path, u->dropin_paths)
3773 if (fragment_mtime_newer(*path, u->dropin_mtime, false))
3774 return true;
3775
3776 return false;
3777 }
3778
3779 void unit_reset_failed(Unit *u) {
3780 assert(u);
3781
3782 if (UNIT_VTABLE(u)->reset_failed)
3783 UNIT_VTABLE(u)->reset_failed(u);
3784
3785 RATELIMIT_RESET(u->start_limit);
3786 u->start_limit_hit = false;
3787 }
3788
3789 Unit *unit_following(Unit *u) {
3790 assert(u);
3791
3792 if (UNIT_VTABLE(u)->following)
3793 return UNIT_VTABLE(u)->following(u);
3794
3795 return NULL;
3796 }
3797
3798 bool unit_stop_pending(Unit *u) {
3799 assert(u);
3800
3801 /* This call does check the current state of the unit. It's
3802 * hence useful to be called from state change calls of the
3803 * unit itself, where the state isn't updated yet. This is
3804 * different from unit_inactive_or_pending() which checks both
3805 * the current state and for a queued job. */
3806
3807 return u->job && u->job->type == JOB_STOP;
3808 }
3809
3810 bool unit_inactive_or_pending(Unit *u) {
3811 assert(u);
3812
3813 /* Returns true if the unit is inactive or going down */
3814
3815 if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)))
3816 return true;
3817
3818 if (unit_stop_pending(u))
3819 return true;
3820
3821 return false;
3822 }
3823
3824 bool unit_active_or_pending(Unit *u) {
3825 assert(u);
3826
3827 /* Returns true if the unit is active or going up */
3828
3829 if (UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
3830 return true;
3831
3832 if (u->job &&
3833 IN_SET(u->job->type, JOB_START, JOB_RELOAD_OR_START, JOB_RESTART))
3834 return true;
3835
3836 return false;
3837 }
3838
3839 bool unit_will_restart(Unit *u) {
3840 assert(u);
3841
3842 if (!UNIT_VTABLE(u)->will_restart)
3843 return false;
3844
3845 return UNIT_VTABLE(u)->will_restart(u);
3846 }
3847
3848 int unit_kill(Unit *u, KillWho w, int signo, sd_bus_error *error) {
3849 assert(u);
3850 assert(w >= 0 && w < _KILL_WHO_MAX);
3851 assert(SIGNAL_VALID(signo));
3852
3853 if (!UNIT_VTABLE(u)->kill)
3854 return -EOPNOTSUPP;
3855
3856 return UNIT_VTABLE(u)->kill(u, w, signo, error);
3857 }
3858
3859 static Set *unit_pid_set(pid_t main_pid, pid_t control_pid) {
3860 _cleanup_set_free_ Set *pid_set = NULL;
3861 int r;
3862
3863 pid_set = set_new(NULL);
3864 if (!pid_set)
3865 return NULL;
3866
3867 /* Exclude the main/control pids from being killed via the cgroup */
3868 if (main_pid > 0) {
3869 r = set_put(pid_set, PID_TO_PTR(main_pid));
3870 if (r < 0)
3871 return NULL;
3872 }
3873
3874 if (control_pid > 0) {
3875 r = set_put(pid_set, PID_TO_PTR(control_pid));
3876 if (r < 0)
3877 return NULL;
3878 }
3879
3880 return TAKE_PTR(pid_set);
3881 }
3882
3883 int unit_kill_common(
3884 Unit *u,
3885 KillWho who,
3886 int signo,
3887 pid_t main_pid,
3888 pid_t control_pid,
3889 sd_bus_error *error) {
3890
3891 int r = 0;
3892 bool killed = false;
3893
3894 if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL)) {
3895 if (main_pid < 0)
3896 return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no main processes", unit_type_to_string(u->type));
3897 else if (main_pid == 0)
3898 return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No main process to kill");
3899 }
3900
3901 if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL)) {
3902 if (control_pid < 0)
3903 return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no control processes", unit_type_to_string(u->type));
3904 else if (control_pid == 0)
3905 return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No control process to kill");
3906 }
3907
3908 if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL, KILL_ALL, KILL_ALL_FAIL))
3909 if (control_pid > 0) {
3910 if (kill(control_pid, signo) < 0)
3911 r = -errno;
3912 else
3913 killed = true;
3914 }
3915
3916 if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL, KILL_ALL, KILL_ALL_FAIL))
3917 if (main_pid > 0) {
3918 if (kill(main_pid, signo) < 0)
3919 r = -errno;
3920 else
3921 killed = true;
3922 }
3923
3924 if (IN_SET(who, KILL_ALL, KILL_ALL_FAIL) && u->cgroup_path) {
3925 _cleanup_set_free_ Set *pid_set = NULL;
3926 int q;
3927
3928 /* Exclude the main/control pids from being killed via the cgroup */
3929 pid_set = unit_pid_set(main_pid, control_pid);
3930 if (!pid_set)
3931 return -ENOMEM;
3932
3933 q = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, signo, 0, pid_set, NULL, NULL);
3934 if (q < 0 && !IN_SET(q, -EAGAIN, -ESRCH, -ENOENT))
3935 r = q;
3936 else
3937 killed = true;
3938 }
3939
3940 if (r == 0 && !killed && IN_SET(who, KILL_ALL_FAIL, KILL_CONTROL_FAIL))
3941 return -ESRCH;
3942
3943 return r;
3944 }
3945
3946 int unit_following_set(Unit *u, Set **s) {
3947 assert(u);
3948 assert(s);
3949
3950 if (UNIT_VTABLE(u)->following_set)
3951 return UNIT_VTABLE(u)->following_set(u, s);
3952
3953 *s = NULL;
3954 return 0;
3955 }
3956
3957 UnitFileState unit_get_unit_file_state(Unit *u) {
3958 int r;
3959
3960 assert(u);
3961
3962 if (u->unit_file_state < 0 && u->fragment_path) {
3963 r = unit_file_get_state(
3964 u->manager->unit_file_scope,
3965 NULL,
3966 u->id,
3967 &u->unit_file_state);
3968 if (r < 0)
3969 u->unit_file_state = UNIT_FILE_BAD;
3970 }
3971
3972 return u->unit_file_state;
3973 }
3974
3975 int unit_get_unit_file_preset(Unit *u) {
3976 assert(u);
3977
3978 if (u->unit_file_preset < 0 && u->fragment_path)
3979 u->unit_file_preset = unit_file_query_preset(
3980 u->manager->unit_file_scope,
3981 NULL,
3982 basename(u->fragment_path));
3983
3984 return u->unit_file_preset;
3985 }
3986
3987 Unit* unit_ref_set(UnitRef *ref, Unit *source, Unit *target) {
3988 assert(ref);
3989 assert(source);
3990 assert(target);
3991
3992 if (ref->target)
3993 unit_ref_unset(ref);
3994
3995 ref->source = source;
3996 ref->target = target;
3997 LIST_PREPEND(refs_by_target, target->refs_by_target, ref);
3998 return target;
3999 }
4000
4001 void unit_ref_unset(UnitRef *ref) {
4002 assert(ref);
4003
4004 if (!ref->target)
4005 return;
4006
4007 /* We are about to drop a reference to the unit, make sure the garbage collection has a look at it as it might
4008 * be unreferenced now. */
4009 unit_add_to_gc_queue(ref->target);
4010
4011 LIST_REMOVE(refs_by_target, ref->target->refs_by_target, ref);
4012 ref->source = ref->target = NULL;
4013 }
4014
4015 static int user_from_unit_name(Unit *u, char **ret) {
4016
4017 static const uint8_t hash_key[] = {
4018 0x58, 0x1a, 0xaf, 0xe6, 0x28, 0x58, 0x4e, 0x96,
4019 0xb4, 0x4e, 0xf5, 0x3b, 0x8c, 0x92, 0x07, 0xec
4020 };
4021
4022 _cleanup_free_ char *n = NULL;
4023 int r;
4024
4025 r = unit_name_to_prefix(u->id, &n);
4026 if (r < 0)
4027 return r;
4028
4029 if (valid_user_group_name(n)) {
4030 *ret = TAKE_PTR(n);
4031 return 0;
4032 }
4033
4034 /* If we can't use the unit name as a user name, then let's hash it and use that */
4035 if (asprintf(ret, "_du%016" PRIx64, siphash24(n, strlen(n), hash_key)) < 0)
4036 return -ENOMEM;
4037
4038 return 0;
4039 }
4040
4041 int unit_patch_contexts(Unit *u) {
4042 CGroupContext *cc;
4043 ExecContext *ec;
4044 unsigned i;
4045 int r;
4046
4047 assert(u);
4048
4049 /* Patch in the manager defaults into the exec and cgroup
4050 * contexts, _after_ the rest of the settings have been
4051 * initialized */
4052
4053 ec = unit_get_exec_context(u);
4054 if (ec) {
4055 /* This only copies in the ones that need memory */
4056 for (i = 0; i < _RLIMIT_MAX; i++)
4057 if (u->manager->rlimit[i] && !ec->rlimit[i]) {
4058 ec->rlimit[i] = newdup(struct rlimit, u->manager->rlimit[i], 1);
4059 if (!ec->rlimit[i])
4060 return -ENOMEM;
4061 }
4062
4063 if (MANAGER_IS_USER(u->manager) &&
4064 !ec->working_directory) {
4065
4066 r = get_home_dir(&ec->working_directory);
4067 if (r < 0)
4068 return r;
4069
4070 /* Allow user services to run, even if the
4071 * home directory is missing */
4072 ec->working_directory_missing_ok = true;
4073 }
4074
4075 if (ec->private_devices)
4076 ec->capability_bounding_set &= ~((UINT64_C(1) << CAP_MKNOD) | (UINT64_C(1) << CAP_SYS_RAWIO));
4077
4078 if (ec->protect_kernel_modules)
4079 ec->capability_bounding_set &= ~(UINT64_C(1) << CAP_SYS_MODULE);
4080
4081 if (ec->dynamic_user) {
4082 if (!ec->user) {
4083 r = user_from_unit_name(u, &ec->user);
4084 if (r < 0)
4085 return r;
4086 }
4087
4088 if (!ec->group) {
4089 ec->group = strdup(ec->user);
4090 if (!ec->group)
4091 return -ENOMEM;
4092 }
4093
4094 /* If the dynamic user option is on, let's make sure that the unit can't leave its UID/GID
4095 * around in the file system or on IPC objects. Hence enforce a strict sandbox. */
4096
4097 ec->private_tmp = true;
4098 ec->remove_ipc = true;
4099 ec->protect_system = PROTECT_SYSTEM_STRICT;
4100 if (ec->protect_home == PROTECT_HOME_NO)
4101 ec->protect_home = PROTECT_HOME_READ_ONLY;
4102 }
4103 }
4104
4105 cc = unit_get_cgroup_context(u);
4106 if (cc && ec) {
4107
4108 if (ec->private_devices &&
4109 cc->device_policy == CGROUP_AUTO)
4110 cc->device_policy = CGROUP_CLOSED;
4111
4112 if (ec->root_image &&
4113 (cc->device_policy != CGROUP_AUTO || cc->device_allow)) {
4114
4115 /* When RootImage= is specified, the following devices are touched. */
4116 r = cgroup_add_device_allow(cc, "/dev/loop-control", "rw");
4117 if (r < 0)
4118 return r;
4119
4120 r = cgroup_add_device_allow(cc, "block-loop", "rwm");
4121 if (r < 0)
4122 return r;
4123
4124 r = cgroup_add_device_allow(cc, "block-blkext", "rwm");
4125 if (r < 0)
4126 return r;
4127 }
4128 }
4129
4130 return 0;
4131 }
4132
4133 ExecContext *unit_get_exec_context(Unit *u) {
4134 size_t offset;
4135 assert(u);
4136
4137 if (u->type < 0)
4138 return NULL;
4139
4140 offset = UNIT_VTABLE(u)->exec_context_offset;
4141 if (offset <= 0)
4142 return NULL;
4143
4144 return (ExecContext*) ((uint8_t*) u + offset);
4145 }
4146
4147 KillContext *unit_get_kill_context(Unit *u) {
4148 size_t offset;
4149 assert(u);
4150
4151 if (u->type < 0)
4152 return NULL;
4153
4154 offset = UNIT_VTABLE(u)->kill_context_offset;
4155 if (offset <= 0)
4156 return NULL;
4157
4158 return (KillContext*) ((uint8_t*) u + offset);
4159 }
4160
4161 CGroupContext *unit_get_cgroup_context(Unit *u) {
4162 size_t offset;
4163
4164 if (u->type < 0)
4165 return NULL;
4166
4167 offset = UNIT_VTABLE(u)->cgroup_context_offset;
4168 if (offset <= 0)
4169 return NULL;
4170
4171 return (CGroupContext*) ((uint8_t*) u + offset);
4172 }
4173
4174 ExecRuntime *unit_get_exec_runtime(Unit *u) {
4175 size_t offset;
4176
4177 if (u->type < 0)
4178 return NULL;
4179
4180 offset = UNIT_VTABLE(u)->exec_runtime_offset;
4181 if (offset <= 0)
4182 return NULL;
4183
4184 return *(ExecRuntime**) ((uint8_t*) u + offset);
4185 }
4186
4187 static const char* unit_drop_in_dir(Unit *u, UnitWriteFlags flags) {
4188 assert(u);
4189
4190 if (UNIT_WRITE_FLAGS_NOOP(flags))
4191 return NULL;
4192
4193 if (u->transient) /* Redirect drop-ins for transient units always into the transient directory. */
4194 return u->manager->lookup_paths.transient;
4195
4196 if (flags & UNIT_PERSISTENT)
4197 return u->manager->lookup_paths.persistent_control;
4198
4199 if (flags & UNIT_RUNTIME)
4200 return u->manager->lookup_paths.runtime_control;
4201
4202 return NULL;
4203 }
4204
4205 char* unit_escape_setting(const char *s, UnitWriteFlags flags, char **buf) {
4206 char *ret = NULL;
4207
4208 if (!s)
4209 return NULL;
4210
4211 /* Escapes the input string as requested. Returns the escaped string. If 'buf' is specified then the allocated
4212 * return buffer pointer is also written to *buf, except if no escaping was necessary, in which case *buf is
4213 * set to NULL, and the input pointer is returned as-is. This means the return value always contains a properly
4214 * escaped version, but *buf when passed only contains a pointer if an allocation was necessary. If *buf is
4215 * not specified, then the return value always needs to be freed. Callers can use this to optimize memory
4216 * allocations. */
4217
4218 if (flags & UNIT_ESCAPE_SPECIFIERS) {
4219 ret = specifier_escape(s);
4220 if (!ret)
4221 return NULL;
4222
4223 s = ret;
4224 }
4225
4226 if (flags & UNIT_ESCAPE_C) {
4227 char *a;
4228
4229 a = cescape(s);
4230 free(ret);
4231 if (!a)
4232 return NULL;
4233
4234 ret = a;
4235 }
4236
4237 if (buf) {
4238 *buf = ret;
4239 return ret ?: (char*) s;
4240 }
4241
4242 return ret ?: strdup(s);
4243 }
4244
4245 char* unit_concat_strv(char **l, UnitWriteFlags flags) {
4246 _cleanup_free_ char *result = NULL;
4247 size_t n = 0, allocated = 0;
4248 char **i;
4249
4250 /* Takes a list of strings, escapes them, and concatenates them. This may be used to format command lines in a
4251 * way suitable for ExecStart= stanzas */
4252
4253 STRV_FOREACH(i, l) {
4254 _cleanup_free_ char *buf = NULL;
4255 const char *p;
4256 size_t a;
4257 char *q;
4258
4259 p = unit_escape_setting(*i, flags, &buf);
4260 if (!p)
4261 return NULL;
4262
4263 a = (n > 0) + 1 + strlen(p) + 1; /* separating space + " + entry + " */
4264 if (!GREEDY_REALLOC(result, allocated, n + a + 1))
4265 return NULL;
4266
4267 q = result + n;
4268 if (n > 0)
4269 *(q++) = ' ';
4270
4271 *(q++) = '"';
4272 q = stpcpy(q, p);
4273 *(q++) = '"';
4274
4275 n += a;
4276 }
4277
4278 if (!GREEDY_REALLOC(result, allocated, n + 1))
4279 return NULL;
4280
4281 result[n] = 0;
4282
4283 return TAKE_PTR(result);
4284 }
4285
4286 int unit_write_setting(Unit *u, UnitWriteFlags flags, const char *name, const char *data) {
4287 _cleanup_free_ char *p = NULL, *q = NULL, *escaped = NULL;
4288 const char *dir, *wrapped;
4289 int r;
4290
4291 assert(u);
4292 assert(name);
4293 assert(data);
4294
4295 if (UNIT_WRITE_FLAGS_NOOP(flags))
4296 return 0;
4297
4298 data = unit_escape_setting(data, flags, &escaped);
4299 if (!data)
4300 return -ENOMEM;
4301
4302 /* Prefix the section header. If we are writing this out as transient file, then let's suppress this if the
4303 * previous section header is the same */
4304
4305 if (flags & UNIT_PRIVATE) {
4306 if (!UNIT_VTABLE(u)->private_section)
4307 return -EINVAL;
4308
4309 if (!u->transient_file || u->last_section_private < 0)
4310 data = strjoina("[", UNIT_VTABLE(u)->private_section, "]\n", data);
4311 else if (u->last_section_private == 0)
4312 data = strjoina("\n[", UNIT_VTABLE(u)->private_section, "]\n", data);
4313 } else {
4314 if (!u->transient_file || u->last_section_private < 0)
4315 data = strjoina("[Unit]\n", data);
4316 else if (u->last_section_private > 0)
4317 data = strjoina("\n[Unit]\n", data);
4318 }
4319
4320 if (u->transient_file) {
4321 /* When this is a transient unit file in creation, then let's not create a new drop-in but instead
4322 * write to the transient unit file. */
4323 fputs(data, u->transient_file);
4324
4325 if (!endswith(data, "\n"))
4326 fputc('\n', u->transient_file);
4327
4328 /* Remember which section we wrote this entry to */
4329 u->last_section_private = !!(flags & UNIT_PRIVATE);
4330 return 0;
4331 }
4332
4333 dir = unit_drop_in_dir(u, flags);
4334 if (!dir)
4335 return -EINVAL;
4336
4337 wrapped = strjoina("# This is a drop-in unit file extension, created via \"systemctl set-property\"\n"
4338 "# or an equivalent operation. Do not edit.\n",
4339 data,
4340 "\n");
4341
4342 r = drop_in_file(dir, u->id, 50, name, &p, &q);
4343 if (r < 0)
4344 return r;
4345
4346 (void) mkdir_p_label(p, 0755);
4347 r = write_string_file_atomic_label(q, wrapped);
4348 if (r < 0)
4349 return r;
4350
4351 r = strv_push(&u->dropin_paths, q);
4352 if (r < 0)
4353 return r;
4354 q = NULL;
4355
4356 strv_uniq(u->dropin_paths);
4357
4358 u->dropin_mtime = now(CLOCK_REALTIME);
4359
4360 return 0;
4361 }
4362
4363 int unit_write_settingf(Unit *u, UnitWriteFlags flags, const char *name, const char *format, ...) {
4364 _cleanup_free_ char *p = NULL;
4365 va_list ap;
4366 int r;
4367
4368 assert(u);
4369 assert(name);
4370 assert(format);
4371
4372 if (UNIT_WRITE_FLAGS_NOOP(flags))
4373 return 0;
4374
4375 va_start(ap, format);
4376 r = vasprintf(&p, format, ap);
4377 va_end(ap);
4378
4379 if (r < 0)
4380 return -ENOMEM;
4381
4382 return unit_write_setting(u, flags, name, p);
4383 }
4384
4385 int unit_make_transient(Unit *u) {
4386 _cleanup_free_ char *path = NULL;
4387 FILE *f;
4388
4389 assert(u);
4390
4391 if (!UNIT_VTABLE(u)->can_transient)
4392 return -EOPNOTSUPP;
4393
4394 (void) mkdir_p_label(u->manager->lookup_paths.transient, 0755);
4395
4396 path = strjoin(u->manager->lookup_paths.transient, "/", u->id);
4397 if (!path)
4398 return -ENOMEM;
4399
4400 /* Let's open the file we'll write the transient settings into. This file is kept open as long as we are
4401 * creating the transient, and is closed in unit_load(), as soon as we start loading the file. */
4402
4403 RUN_WITH_UMASK(0022) {
4404 f = fopen(path, "we");
4405 if (!f)
4406 return -errno;
4407 }
4408
4409 safe_fclose(u->transient_file);
4410 u->transient_file = f;
4411
4412 free_and_replace(u->fragment_path, path);
4413
4414 u->source_path = mfree(u->source_path);
4415 u->dropin_paths = strv_free(u->dropin_paths);
4416 u->fragment_mtime = u->source_mtime = u->dropin_mtime = 0;
4417
4418 u->load_state = UNIT_STUB;
4419 u->load_error = 0;
4420 u->transient = true;
4421
4422 unit_add_to_dbus_queue(u);
4423 unit_add_to_gc_queue(u);
4424
4425 fputs("# This is a transient unit file, created programmatically via the systemd API. Do not edit.\n",
4426 u->transient_file);
4427
4428 return 0;
4429 }
4430
4431 static int log_kill(pid_t pid, int sig, void *userdata) {
4432 _cleanup_free_ char *comm = NULL;
4433
4434 (void) get_process_comm(pid, &comm);
4435
4436 /* Don't log about processes marked with brackets, under the assumption that these are temporary processes
4437 only, like for example systemd's own PAM stub process. */
4438 if (comm && comm[0] == '(')
4439 return 0;
4440
4441 log_unit_notice(userdata,
4442 "Killing process " PID_FMT " (%s) with signal SIG%s.",
4443 pid,
4444 strna(comm),
4445 signal_to_string(sig));
4446
4447 return 1;
4448 }
4449
4450 static int operation_to_signal(KillContext *c, KillOperation k) {
4451 assert(c);
4452
4453 switch (k) {
4454
4455 case KILL_TERMINATE:
4456 case KILL_TERMINATE_AND_LOG:
4457 return c->kill_signal;
4458
4459 case KILL_KILL:
4460 return c->final_kill_signal;
4461
4462 case KILL_WATCHDOG:
4463 return c->watchdog_signal;
4464
4465 default:
4466 assert_not_reached("KillOperation unknown");
4467 }
4468 }
4469
4470 int unit_kill_context(
4471 Unit *u,
4472 KillContext *c,
4473 KillOperation k,
4474 pid_t main_pid,
4475 pid_t control_pid,
4476 bool main_pid_alien) {
4477
4478 bool wait_for_exit = false, send_sighup;
4479 cg_kill_log_func_t log_func = NULL;
4480 int sig, r;
4481
4482 assert(u);
4483 assert(c);
4484
4485 /* Kill the processes belonging to this unit, in preparation for shutting the unit down.
4486 * Returns > 0 if we killed something worth waiting for, 0 otherwise. */
4487
4488 if (c->kill_mode == KILL_NONE)
4489 return 0;
4490
4491 sig = operation_to_signal(c, k);
4492
4493 send_sighup =
4494 c->send_sighup &&
4495 IN_SET(k, KILL_TERMINATE, KILL_TERMINATE_AND_LOG) &&
4496 sig != SIGHUP;
4497
4498 if (k != KILL_TERMINATE || IN_SET(sig, SIGKILL, SIGABRT))
4499 log_func = log_kill;
4500
4501 if (main_pid > 0) {
4502 if (log_func)
4503 log_func(main_pid, sig, u);
4504
4505 r = kill_and_sigcont(main_pid, sig);
4506 if (r < 0 && r != -ESRCH) {
4507 _cleanup_free_ char *comm = NULL;
4508 (void) get_process_comm(main_pid, &comm);
4509
4510 log_unit_warning_errno(u, r, "Failed to kill main process " PID_FMT " (%s), ignoring: %m", main_pid, strna(comm));
4511 } else {
4512 if (!main_pid_alien)
4513 wait_for_exit = true;
4514
4515 if (r != -ESRCH && send_sighup)
4516 (void) kill(main_pid, SIGHUP);
4517 }
4518 }
4519
4520 if (control_pid > 0) {
4521 if (log_func)
4522 log_func(control_pid, sig, u);
4523
4524 r = kill_and_sigcont(control_pid, sig);
4525 if (r < 0 && r != -ESRCH) {
4526 _cleanup_free_ char *comm = NULL;
4527 (void) get_process_comm(control_pid, &comm);
4528
4529 log_unit_warning_errno(u, r, "Failed to kill control process " PID_FMT " (%s), ignoring: %m", control_pid, strna(comm));
4530 } else {
4531 wait_for_exit = true;
4532
4533 if (r != -ESRCH && send_sighup)
4534 (void) kill(control_pid, SIGHUP);
4535 }
4536 }
4537
4538 if (u->cgroup_path &&
4539 (c->kill_mode == KILL_CONTROL_GROUP || (c->kill_mode == KILL_MIXED && k == KILL_KILL))) {
4540 _cleanup_set_free_ Set *pid_set = NULL;
4541
4542 /* Exclude the main/control pids from being killed via the cgroup */
4543 pid_set = unit_pid_set(main_pid, control_pid);
4544 if (!pid_set)
4545 return -ENOMEM;
4546
4547 r = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path,
4548 sig,
4549 CGROUP_SIGCONT|CGROUP_IGNORE_SELF,
4550 pid_set,
4551 log_func, u);
4552 if (r < 0) {
4553 if (!IN_SET(r, -EAGAIN, -ESRCH, -ENOENT))
4554 log_unit_warning_errno(u, r, "Failed to kill control group %s, ignoring: %m", u->cgroup_path);
4555
4556 } else if (r > 0) {
4557
4558 /* FIXME: For now, on the legacy hierarchy, we will not wait for the cgroup members to die if
4559 * we are running in a container or if this is a delegation unit, simply because cgroup
4560 * notification is unreliable in these cases. It doesn't work at all in containers, and outside
4561 * of containers it can be confused easily by left-over directories in the cgroup — which
4562 * however should not exist in non-delegated units. On the unified hierarchy that's different,
4563 * there we get proper events. Hence rely on them. */
4564
4565 if (cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER) > 0 ||
4566 (detect_container() == 0 && !unit_cgroup_delegate(u)))
4567 wait_for_exit = true;
4568
4569 if (send_sighup) {
4570 set_free(pid_set);
4571
4572 pid_set = unit_pid_set(main_pid, control_pid);
4573 if (!pid_set)
4574 return -ENOMEM;
4575
4576 cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path,
4577 SIGHUP,
4578 CGROUP_IGNORE_SELF,
4579 pid_set,
4580 NULL, NULL);
4581 }
4582 }
4583 }
4584
4585 return wait_for_exit;
4586 }
4587
4588 int unit_require_mounts_for(Unit *u, const char *path, UnitDependencyMask mask) {
4589 _cleanup_free_ char *p = NULL;
4590 UnitDependencyInfo di;
4591 int r;
4592
4593 assert(u);
4594 assert(path);
4595
4596 /* Registers a unit for requiring a certain path and all its prefixes. We keep a hashtable of these paths in
4597 * the unit (from the path to the UnitDependencyInfo structure indicating how to the dependency came to
4598 * be). However, we build a prefix table for all possible prefixes so that new appearing mount units can easily
4599 * determine which units to make themselves a dependency of. */
4600
4601 if (!path_is_absolute(path))
4602 return -EINVAL;
4603
4604 r = hashmap_ensure_allocated(&u->requires_mounts_for, &path_hash_ops);
4605 if (r < 0)
4606 return r;
4607
4608 p = strdup(path);
4609 if (!p)
4610 return -ENOMEM;
4611
4612 path = path_simplify(p, false);
4613
4614 if (!path_is_normalized(path))
4615 return -EPERM;
4616
4617 if (hashmap_contains(u->requires_mounts_for, path))
4618 return 0;
4619
4620 di = (UnitDependencyInfo) {
4621 .origin_mask = mask
4622 };
4623
4624 r = hashmap_put(u->requires_mounts_for, path, di.data);
4625 if (r < 0)
4626 return r;
4627 p = NULL;
4628
4629 char prefix[strlen(path) + 1];
4630 PATH_FOREACH_PREFIX_MORE(prefix, path) {
4631 Set *x;
4632
4633 x = hashmap_get(u->manager->units_requiring_mounts_for, prefix);
4634 if (!x) {
4635 _cleanup_free_ char *q = NULL;
4636
4637 r = hashmap_ensure_allocated(&u->manager->units_requiring_mounts_for, &path_hash_ops);
4638 if (r < 0)
4639 return r;
4640
4641 q = strdup(prefix);
4642 if (!q)
4643 return -ENOMEM;
4644
4645 x = set_new(NULL);
4646 if (!x)
4647 return -ENOMEM;
4648
4649 r = hashmap_put(u->manager->units_requiring_mounts_for, q, x);
4650 if (r < 0) {
4651 set_free(x);
4652 return r;
4653 }
4654 q = NULL;
4655 }
4656
4657 r = set_put(x, u);
4658 if (r < 0)
4659 return r;
4660 }
4661
4662 return 0;
4663 }
4664
4665 int unit_setup_exec_runtime(Unit *u) {
4666 ExecRuntime **rt;
4667 size_t offset;
4668 Unit *other;
4669 Iterator i;
4670 void *v;
4671 int r;
4672
4673 offset = UNIT_VTABLE(u)->exec_runtime_offset;
4674 assert(offset > 0);
4675
4676 /* Check if there already is an ExecRuntime for this unit? */
4677 rt = (ExecRuntime**) ((uint8_t*) u + offset);
4678 if (*rt)
4679 return 0;
4680
4681 /* Try to get it from somebody else */
4682 HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_JOINS_NAMESPACE_OF], i) {
4683 r = exec_runtime_acquire(u->manager, NULL, other->id, false, rt);
4684 if (r == 1)
4685 return 1;
4686 }
4687
4688 return exec_runtime_acquire(u->manager, unit_get_exec_context(u), u->id, true, rt);
4689 }
4690
4691 int unit_setup_dynamic_creds(Unit *u) {
4692 ExecContext *ec;
4693 DynamicCreds *dcreds;
4694 size_t offset;
4695
4696 assert(u);
4697
4698 offset = UNIT_VTABLE(u)->dynamic_creds_offset;
4699 assert(offset > 0);
4700 dcreds = (DynamicCreds*) ((uint8_t*) u + offset);
4701
4702 ec = unit_get_exec_context(u);
4703 assert(ec);
4704
4705 if (!ec->dynamic_user)
4706 return 0;
4707
4708 return dynamic_creds_acquire(dcreds, u->manager, ec->user, ec->group);
4709 }
4710
4711 bool unit_type_supported(UnitType t) {
4712 if (_unlikely_(t < 0))
4713 return false;
4714 if (_unlikely_(t >= _UNIT_TYPE_MAX))
4715 return false;
4716
4717 if (!unit_vtable[t]->supported)
4718 return true;
4719
4720 return unit_vtable[t]->supported();
4721 }
4722
4723 void unit_warn_if_dir_nonempty(Unit *u, const char* where) {
4724 int r;
4725
4726 assert(u);
4727 assert(where);
4728
4729 r = dir_is_empty(where);
4730 if (r > 0 || r == -ENOTDIR)
4731 return;
4732 if (r < 0) {
4733 log_unit_warning_errno(u, r, "Failed to check directory %s: %m", where);
4734 return;
4735 }
4736
4737 log_struct(LOG_NOTICE,
4738 "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR,
4739 LOG_UNIT_ID(u),
4740 LOG_UNIT_INVOCATION_ID(u),
4741 LOG_UNIT_MESSAGE(u, "Directory %s to mount over is not empty, mounting anyway.", where),
4742 "WHERE=%s", where);
4743 }
4744
4745 int unit_fail_if_noncanonical(Unit *u, const char* where) {
4746 _cleanup_free_ char *canonical_where = NULL;
4747 int r;
4748
4749 assert(u);
4750 assert(where);
4751
4752 r = chase_symlinks(where, NULL, CHASE_NONEXISTENT, &canonical_where);
4753 if (r < 0) {
4754 log_unit_debug_errno(u, r, "Failed to check %s for symlinks, ignoring: %m", where);
4755 return 0;
4756 }
4757
4758 /* We will happily ignore a trailing slash (or any redundant slashes) */
4759 if (path_equal(where, canonical_where))
4760 return 0;
4761
4762 /* No need to mention "." or "..", they would already have been rejected by unit_name_from_path() */
4763 log_struct(LOG_ERR,
4764 "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR,
4765 LOG_UNIT_ID(u),
4766 LOG_UNIT_INVOCATION_ID(u),
4767 LOG_UNIT_MESSAGE(u, "Mount path %s is not canonical (contains a symlink).", where),
4768 "WHERE=%s", where);
4769
4770 return -ELOOP;
4771 }
4772
4773 bool unit_is_pristine(Unit *u) {
4774 assert(u);
4775
4776 /* Check if the unit already exists or is already around,
4777 * in a number of different ways. Note that to cater for unit
4778 * types such as slice, we are generally fine with units that
4779 * are marked UNIT_LOADED even though nothing was actually
4780 * loaded, as those unit types don't require a file on disk. */
4781
4782 return !(!IN_SET(u->load_state, UNIT_NOT_FOUND, UNIT_LOADED) ||
4783 u->fragment_path ||
4784 u->source_path ||
4785 !strv_isempty(u->dropin_paths) ||
4786 u->job ||
4787 u->merged_into);
4788 }
4789
4790 pid_t unit_control_pid(Unit *u) {
4791 assert(u);
4792
4793 if (UNIT_VTABLE(u)->control_pid)
4794 return UNIT_VTABLE(u)->control_pid(u);
4795
4796 return 0;
4797 }
4798
4799 pid_t unit_main_pid(Unit *u) {
4800 assert(u);
4801
4802 if (UNIT_VTABLE(u)->main_pid)
4803 return UNIT_VTABLE(u)->main_pid(u);
4804
4805 return 0;
4806 }
4807
4808 static void unit_unref_uid_internal(
4809 Unit *u,
4810 uid_t *ref_uid,
4811 bool destroy_now,
4812 void (*_manager_unref_uid)(Manager *m, uid_t uid, bool destroy_now)) {
4813
4814 assert(u);
4815 assert(ref_uid);
4816 assert(_manager_unref_uid);
4817
4818 /* Generic implementation of both unit_unref_uid() and unit_unref_gid(), under the assumption that uid_t and
4819 * gid_t are actually the same time, with the same validity rules.
4820 *
4821 * Drops a reference to UID/GID from a unit. */
4822
4823 assert_cc(sizeof(uid_t) == sizeof(gid_t));
4824 assert_cc(UID_INVALID == (uid_t) GID_INVALID);
4825
4826 if (!uid_is_valid(*ref_uid))
4827 return;
4828
4829 _manager_unref_uid(u->manager, *ref_uid, destroy_now);
4830 *ref_uid = UID_INVALID;
4831 }
4832
4833 void unit_unref_uid(Unit *u, bool destroy_now) {
4834 unit_unref_uid_internal(u, &u->ref_uid, destroy_now, manager_unref_uid);
4835 }
4836
4837 void unit_unref_gid(Unit *u, bool destroy_now) {
4838 unit_unref_uid_internal(u, (uid_t*) &u->ref_gid, destroy_now, manager_unref_gid);
4839 }
4840
4841 static int unit_ref_uid_internal(
4842 Unit *u,
4843 uid_t *ref_uid,
4844 uid_t uid,
4845 bool clean_ipc,
4846 int (*_manager_ref_uid)(Manager *m, uid_t uid, bool clean_ipc)) {
4847
4848 int r;
4849
4850 assert(u);
4851 assert(ref_uid);
4852 assert(uid_is_valid(uid));
4853 assert(_manager_ref_uid);
4854
4855 /* Generic implementation of both unit_ref_uid() and unit_ref_guid(), under the assumption that uid_t and gid_t
4856 * are actually the same type, and have the same validity rules.
4857 *
4858 * Adds a reference on a specific UID/GID to this unit. Each unit referencing the same UID/GID maintains a
4859 * reference so that we can destroy the UID/GID's IPC resources as soon as this is requested and the counter
4860 * drops to zero. */
4861
4862 assert_cc(sizeof(uid_t) == sizeof(gid_t));
4863 assert_cc(UID_INVALID == (uid_t) GID_INVALID);
4864
4865 if (*ref_uid == uid)
4866 return 0;
4867
4868 if (uid_is_valid(*ref_uid)) /* Already set? */
4869 return -EBUSY;
4870
4871 r = _manager_ref_uid(u->manager, uid, clean_ipc);
4872 if (r < 0)
4873 return r;
4874
4875 *ref_uid = uid;
4876 return 1;
4877 }
4878
4879 int unit_ref_uid(Unit *u, uid_t uid, bool clean_ipc) {
4880 return unit_ref_uid_internal(u, &u->ref_uid, uid, clean_ipc, manager_ref_uid);
4881 }
4882
4883 int unit_ref_gid(Unit *u, gid_t gid, bool clean_ipc) {
4884 return unit_ref_uid_internal(u, (uid_t*) &u->ref_gid, (uid_t) gid, clean_ipc, manager_ref_gid);
4885 }
4886
4887 static int unit_ref_uid_gid_internal(Unit *u, uid_t uid, gid_t gid, bool clean_ipc) {
4888 int r = 0, q = 0;
4889
4890 assert(u);
4891
4892 /* Reference both a UID and a GID in one go. Either references both, or neither. */
4893
4894 if (uid_is_valid(uid)) {
4895 r = unit_ref_uid(u, uid, clean_ipc);
4896 if (r < 0)
4897 return r;
4898 }
4899
4900 if (gid_is_valid(gid)) {
4901 q = unit_ref_gid(u, gid, clean_ipc);
4902 if (q < 0) {
4903 if (r > 0)
4904 unit_unref_uid(u, false);
4905
4906 return q;
4907 }
4908 }
4909
4910 return r > 0 || q > 0;
4911 }
4912
4913 int unit_ref_uid_gid(Unit *u, uid_t uid, gid_t gid) {
4914 ExecContext *c;
4915 int r;
4916
4917 assert(u);
4918
4919 c = unit_get_exec_context(u);
4920
4921 r = unit_ref_uid_gid_internal(u, uid, gid, c ? c->remove_ipc : false);
4922 if (r < 0)
4923 return log_unit_warning_errno(u, r, "Couldn't add UID/GID reference to unit, proceeding without: %m");
4924
4925 return r;
4926 }
4927
4928 void unit_unref_uid_gid(Unit *u, bool destroy_now) {
4929 assert(u);
4930
4931 unit_unref_uid(u, destroy_now);
4932 unit_unref_gid(u, destroy_now);
4933 }
4934
4935 void unit_notify_user_lookup(Unit *u, uid_t uid, gid_t gid) {
4936 int r;
4937
4938 assert(u);
4939
4940 /* This is invoked whenever one of the forked off processes let's us know the UID/GID its user name/group names
4941 * resolved to. We keep track of which UID/GID is currently assigned in order to be able to destroy its IPC
4942 * objects when no service references the UID/GID anymore. */
4943
4944 r = unit_ref_uid_gid(u, uid, gid);
4945 if (r > 0)
4946 unit_add_to_dbus_queue(u);
4947 }
4948
4949 int unit_set_invocation_id(Unit *u, sd_id128_t id) {
4950 int r;
4951
4952 assert(u);
4953
4954 /* Set the invocation ID for this unit. If we cannot, this will not roll back, but reset the whole thing. */
4955
4956 if (sd_id128_equal(u->invocation_id, id))
4957 return 0;
4958
4959 if (!sd_id128_is_null(u->invocation_id))
4960 (void) hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u);
4961
4962 if (sd_id128_is_null(id)) {
4963 r = 0;
4964 goto reset;
4965 }
4966
4967 r = hashmap_ensure_allocated(&u->manager->units_by_invocation_id, &id128_hash_ops);
4968 if (r < 0)
4969 goto reset;
4970
4971 u->invocation_id = id;
4972 sd_id128_to_string(id, u->invocation_id_string);
4973
4974 r = hashmap_put(u->manager->units_by_invocation_id, &u->invocation_id, u);
4975 if (r < 0)
4976 goto reset;
4977
4978 return 0;
4979
4980 reset:
4981 u->invocation_id = SD_ID128_NULL;
4982 u->invocation_id_string[0] = 0;
4983 return r;
4984 }
4985
4986 int unit_acquire_invocation_id(Unit *u) {
4987 sd_id128_t id;
4988 int r;
4989
4990 assert(u);
4991
4992 r = sd_id128_randomize(&id);
4993 if (r < 0)
4994 return log_unit_error_errno(u, r, "Failed to generate invocation ID for unit: %m");
4995
4996 r = unit_set_invocation_id(u, id);
4997 if (r < 0)
4998 return log_unit_error_errno(u, r, "Failed to set invocation ID for unit: %m");
4999
5000 unit_add_to_dbus_queue(u);
5001 return 0;
5002 }
5003
5004 int unit_set_exec_params(Unit *u, ExecParameters *p) {
5005 int r;
5006
5007 assert(u);
5008 assert(p);
5009
5010 /* Copy parameters from manager */
5011 r = manager_get_effective_environment(u->manager, &p->environment);
5012 if (r < 0)
5013 return r;
5014
5015 p->confirm_spawn = manager_get_confirm_spawn(u->manager);
5016 p->cgroup_supported = u->manager->cgroup_supported;
5017 p->prefix = u->manager->prefix;
5018 SET_FLAG(p->flags, EXEC_PASS_LOG_UNIT|EXEC_CHOWN_DIRECTORIES, MANAGER_IS_SYSTEM(u->manager));
5019
5020 /* Copy paramaters from unit */
5021 p->cgroup_path = u->cgroup_path;
5022 SET_FLAG(p->flags, EXEC_CGROUP_DELEGATE, unit_cgroup_delegate(u));
5023
5024 return 0;
5025 }
5026
5027 int unit_fork_helper_process(Unit *u, const char *name, pid_t *ret) {
5028 int r;
5029
5030 assert(u);
5031 assert(ret);
5032
5033 /* Forks off a helper process and makes sure it is a member of the unit's cgroup. Returns == 0 in the child,
5034 * and > 0 in the parent. The pid parameter is always filled in with the child's PID. */
5035
5036 (void) unit_realize_cgroup(u);
5037
5038 r = safe_fork(name, FORK_REOPEN_LOG, ret);
5039 if (r != 0)
5040 return r;
5041
5042 (void) default_signals(SIGNALS_CRASH_HANDLER, SIGNALS_IGNORE, -1);
5043 (void) ignore_signals(SIGPIPE, -1);
5044
5045 (void) prctl(PR_SET_PDEATHSIG, SIGTERM);
5046
5047 if (u->cgroup_path) {
5048 r = cg_attach_everywhere(u->manager->cgroup_supported, u->cgroup_path, 0, NULL, NULL);
5049 if (r < 0) {
5050 log_unit_error_errno(u, r, "Failed to join unit cgroup %s: %m", u->cgroup_path);
5051 _exit(EXIT_CGROUP);
5052 }
5053 }
5054
5055 return 0;
5056 }
5057
5058 static void unit_update_dependency_mask(Unit *u, UnitDependency d, Unit *other, UnitDependencyInfo di) {
5059 assert(u);
5060 assert(d >= 0);
5061 assert(d < _UNIT_DEPENDENCY_MAX);
5062 assert(other);
5063
5064 if (di.origin_mask == 0 && di.destination_mask == 0) {
5065 /* No bit set anymore, let's drop the whole entry */
5066 assert_se(hashmap_remove(u->dependencies[d], other));
5067 log_unit_debug(u, "%s lost dependency %s=%s", u->id, unit_dependency_to_string(d), other->id);
5068 } else
5069 /* Mask was reduced, let's update the entry */
5070 assert_se(hashmap_update(u->dependencies[d], other, di.data) == 0);
5071 }
5072
5073 void unit_remove_dependencies(Unit *u, UnitDependencyMask mask) {
5074 UnitDependency d;
5075
5076 assert(u);
5077
5078 /* Removes all dependencies u has on other units marked for ownership by 'mask'. */
5079
5080 if (mask == 0)
5081 return;
5082
5083 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
5084 bool done;
5085
5086 do {
5087 UnitDependencyInfo di;
5088 Unit *other;
5089 Iterator i;
5090
5091 done = true;
5092
5093 HASHMAP_FOREACH_KEY(di.data, other, u->dependencies[d], i) {
5094 UnitDependency q;
5095
5096 if ((di.origin_mask & ~mask) == di.origin_mask)
5097 continue;
5098 di.origin_mask &= ~mask;
5099 unit_update_dependency_mask(u, d, other, di);
5100
5101 /* We updated the dependency from our unit to the other unit now. But most dependencies
5102 * imply a reverse dependency. Hence, let's delete that one too. For that we go through
5103 * all dependency types on the other unit and delete all those which point to us and
5104 * have the right mask set. */
5105
5106 for (q = 0; q < _UNIT_DEPENDENCY_MAX; q++) {
5107 UnitDependencyInfo dj;
5108
5109 dj.data = hashmap_get(other->dependencies[q], u);
5110 if ((dj.destination_mask & ~mask) == dj.destination_mask)
5111 continue;
5112 dj.destination_mask &= ~mask;
5113
5114 unit_update_dependency_mask(other, q, u, dj);
5115 }
5116
5117 unit_add_to_gc_queue(other);
5118
5119 done = false;
5120 break;
5121 }
5122
5123 } while (!done);
5124 }
5125 }
5126
5127 static int unit_export_invocation_id(Unit *u) {
5128 const char *p;
5129 int r;
5130
5131 assert(u);
5132
5133 if (u->exported_invocation_id)
5134 return 0;
5135
5136 if (sd_id128_is_null(u->invocation_id))
5137 return 0;
5138
5139 p = strjoina("/run/systemd/units/invocation:", u->id);
5140 r = symlink_atomic(u->invocation_id_string, p);
5141 if (r < 0)
5142 return log_unit_debug_errno(u, r, "Failed to create invocation ID symlink %s: %m", p);
5143
5144 u->exported_invocation_id = true;
5145 return 0;
5146 }
5147
5148 static int unit_export_log_level_max(Unit *u, const ExecContext *c) {
5149 const char *p;
5150 char buf[2];
5151 int r;
5152
5153 assert(u);
5154 assert(c);
5155
5156 if (u->exported_log_level_max)
5157 return 0;
5158
5159 if (c->log_level_max < 0)
5160 return 0;
5161
5162 assert(c->log_level_max <= 7);
5163
5164 buf[0] = '0' + c->log_level_max;
5165 buf[1] = 0;
5166
5167 p = strjoina("/run/systemd/units/log-level-max:", u->id);
5168 r = symlink_atomic(buf, p);
5169 if (r < 0)
5170 return log_unit_debug_errno(u, r, "Failed to create maximum log level symlink %s: %m", p);
5171
5172 u->exported_log_level_max = true;
5173 return 0;
5174 }
5175
5176 static int unit_export_log_extra_fields(Unit *u, const ExecContext *c) {
5177 _cleanup_close_ int fd = -1;
5178 struct iovec *iovec;
5179 const char *p;
5180 char *pattern;
5181 le64_t *sizes;
5182 ssize_t n;
5183 size_t i;
5184 int r;
5185
5186 if (u->exported_log_extra_fields)
5187 return 0;
5188
5189 if (c->n_log_extra_fields <= 0)
5190 return 0;
5191
5192 sizes = newa(le64_t, c->n_log_extra_fields);
5193 iovec = newa(struct iovec, c->n_log_extra_fields * 2);
5194
5195 for (i = 0; i < c->n_log_extra_fields; i++) {
5196 sizes[i] = htole64(c->log_extra_fields[i].iov_len);
5197
5198 iovec[i*2] = IOVEC_MAKE(sizes + i, sizeof(le64_t));
5199 iovec[i*2+1] = c->log_extra_fields[i];
5200 }
5201
5202 p = strjoina("/run/systemd/units/log-extra-fields:", u->id);
5203 pattern = strjoina(p, ".XXXXXX");
5204
5205 fd = mkostemp_safe(pattern);
5206 if (fd < 0)
5207 return log_unit_debug_errno(u, fd, "Failed to create extra fields file %s: %m", p);
5208
5209 n = writev(fd, iovec, c->n_log_extra_fields*2);
5210 if (n < 0) {
5211 r = log_unit_debug_errno(u, errno, "Failed to write extra fields: %m");
5212 goto fail;
5213 }
5214
5215 (void) fchmod(fd, 0644);
5216
5217 if (rename(pattern, p) < 0) {
5218 r = log_unit_debug_errno(u, errno, "Failed to rename extra fields file: %m");
5219 goto fail;
5220 }
5221
5222 u->exported_log_extra_fields = true;
5223 return 0;
5224
5225 fail:
5226 (void) unlink(pattern);
5227 return r;
5228 }
5229
5230 static int unit_export_log_rate_limit_interval(Unit *u, const ExecContext *c) {
5231 _cleanup_free_ char *buf = NULL;
5232 const char *p;
5233 int r;
5234
5235 assert(u);
5236 assert(c);
5237
5238 if (u->exported_log_rate_limit_interval)
5239 return 0;
5240
5241 if (c->log_rate_limit_interval_usec == 0)
5242 return 0;
5243
5244 p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id);
5245
5246 if (asprintf(&buf, "%" PRIu64, c->log_rate_limit_interval_usec) < 0)
5247 return log_oom();
5248
5249 r = symlink_atomic(buf, p);
5250 if (r < 0)
5251 return log_unit_debug_errno(u, r, "Failed to create log rate limit interval symlink %s: %m", p);
5252
5253 u->exported_log_rate_limit_interval = true;
5254 return 0;
5255 }
5256
5257 static int unit_export_log_rate_limit_burst(Unit *u, const ExecContext *c) {
5258 _cleanup_free_ char *buf = NULL;
5259 const char *p;
5260 int r;
5261
5262 assert(u);
5263 assert(c);
5264
5265 if (u->exported_log_rate_limit_burst)
5266 return 0;
5267
5268 if (c->log_rate_limit_burst == 0)
5269 return 0;
5270
5271 p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id);
5272
5273 if (asprintf(&buf, "%u", c->log_rate_limit_burst) < 0)
5274 return log_oom();
5275
5276 r = symlink_atomic(buf, p);
5277 if (r < 0)
5278 return log_unit_debug_errno(u, r, "Failed to create log rate limit burst symlink %s: %m", p);
5279
5280 u->exported_log_rate_limit_burst = true;
5281 return 0;
5282 }
5283
5284 void unit_export_state_files(Unit *u) {
5285 const ExecContext *c;
5286
5287 assert(u);
5288
5289 if (!u->id)
5290 return;
5291
5292 if (!MANAGER_IS_SYSTEM(u->manager))
5293 return;
5294
5295 if (MANAGER_IS_TEST_RUN(u->manager))
5296 return;
5297
5298 /* Exports a couple of unit properties to /run/systemd/units/, so that journald can quickly query this data
5299 * from there. Ideally, journald would use IPC to query this, like everybody else, but that's hard, as long as
5300 * the IPC system itself and PID 1 also log to the journal.
5301 *
5302 * Note that these files really shouldn't be considered API for anyone else, as use a runtime file system as
5303 * IPC replacement is not compatible with today's world of file system namespaces. However, this doesn't really
5304 * apply to communication between the journal and systemd, as we assume that these two daemons live in the same
5305 * namespace at least.
5306 *
5307 * Note that some of the "files" exported here are actually symlinks and not regular files. Symlinks work
5308 * better for storing small bits of data, in particular as we can write them with two system calls, and read
5309 * them with one. */
5310
5311 (void) unit_export_invocation_id(u);
5312
5313 c = unit_get_exec_context(u);
5314 if (c) {
5315 (void) unit_export_log_level_max(u, c);
5316 (void) unit_export_log_extra_fields(u, c);
5317 (void) unit_export_log_rate_limit_interval(u, c);
5318 (void) unit_export_log_rate_limit_burst(u, c);
5319 }
5320 }
5321
5322 void unit_unlink_state_files(Unit *u) {
5323 const char *p;
5324
5325 assert(u);
5326
5327 if (!u->id)
5328 return;
5329
5330 if (!MANAGER_IS_SYSTEM(u->manager))
5331 return;
5332
5333 /* Undoes the effect of unit_export_state() */
5334
5335 if (u->exported_invocation_id) {
5336 p = strjoina("/run/systemd/units/invocation:", u->id);
5337 (void) unlink(p);
5338
5339 u->exported_invocation_id = false;
5340 }
5341
5342 if (u->exported_log_level_max) {
5343 p = strjoina("/run/systemd/units/log-level-max:", u->id);
5344 (void) unlink(p);
5345
5346 u->exported_log_level_max = false;
5347 }
5348
5349 if (u->exported_log_extra_fields) {
5350 p = strjoina("/run/systemd/units/extra-fields:", u->id);
5351 (void) unlink(p);
5352
5353 u->exported_log_extra_fields = false;
5354 }
5355
5356 if (u->exported_log_rate_limit_interval) {
5357 p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id);
5358 (void) unlink(p);
5359
5360 u->exported_log_rate_limit_interval = false;
5361 }
5362
5363 if (u->exported_log_rate_limit_burst) {
5364 p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id);
5365 (void) unlink(p);
5366
5367 u->exported_log_rate_limit_burst = false;
5368 }
5369 }
5370
5371 int unit_prepare_exec(Unit *u) {
5372 int r;
5373
5374 assert(u);
5375
5376 /* Prepares everything so that we can fork of a process for this unit */
5377
5378 (void) unit_realize_cgroup(u);
5379
5380 if (u->reset_accounting) {
5381 (void) unit_reset_cpu_accounting(u);
5382 (void) unit_reset_ip_accounting(u);
5383 u->reset_accounting = false;
5384 }
5385
5386 unit_export_state_files(u);
5387
5388 r = unit_setup_exec_runtime(u);
5389 if (r < 0)
5390 return r;
5391
5392 r = unit_setup_dynamic_creds(u);
5393 if (r < 0)
5394 return r;
5395
5396 return 0;
5397 }
5398
5399 static int log_leftover(pid_t pid, int sig, void *userdata) {
5400 _cleanup_free_ char *comm = NULL;
5401
5402 (void) get_process_comm(pid, &comm);
5403
5404 if (comm && comm[0] == '(') /* Most likely our own helper process (PAM?), ignore */
5405 return 0;
5406
5407 log_unit_warning(userdata,
5408 "Found left-over process " PID_FMT " (%s) in control group while starting unit. Ignoring.\n"
5409 "This usually indicates unclean termination of a previous run, or service implementation deficiencies.",
5410 pid, strna(comm));
5411
5412 return 1;
5413 }
5414
5415 int unit_warn_leftover_processes(Unit *u) {
5416 assert(u);
5417
5418 (void) unit_pick_cgroup_path(u);
5419
5420 if (!u->cgroup_path)
5421 return 0;
5422
5423 return cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, 0, 0, NULL, log_leftover, u);
5424 }
5425
5426 bool unit_needs_console(Unit *u) {
5427 ExecContext *ec;
5428 UnitActiveState state;
5429
5430 assert(u);
5431
5432 state = unit_active_state(u);
5433
5434 if (UNIT_IS_INACTIVE_OR_FAILED(state))
5435 return false;
5436
5437 if (UNIT_VTABLE(u)->needs_console)
5438 return UNIT_VTABLE(u)->needs_console(u);
5439
5440 /* If this unit type doesn't implement this call, let's use a generic fallback implementation: */
5441 ec = unit_get_exec_context(u);
5442 if (!ec)
5443 return false;
5444
5445 return exec_context_may_touch_console(ec);
5446 }
5447
5448 const char *unit_label_path(Unit *u) {
5449 const char *p;
5450
5451 /* Returns the file system path to use for MAC access decisions, i.e. the file to read the SELinux label off
5452 * when validating access checks. */
5453
5454 p = u->source_path ?: u->fragment_path;
5455 if (!p)
5456 return NULL;
5457
5458 /* If a unit is masked, then don't read the SELinux label of /dev/null, as that really makes no sense */
5459 if (path_equal(p, "/dev/null"))
5460 return NULL;
5461
5462 return p;
5463 }
5464
5465 int unit_pid_attachable(Unit *u, pid_t pid, sd_bus_error *error) {
5466 int r;
5467
5468 assert(u);
5469
5470 /* Checks whether the specified PID is generally good for attaching, i.e. a valid PID, not our manager itself,
5471 * and not a kernel thread either */
5472
5473 /* First, a simple range check */
5474 if (!pid_is_valid(pid))
5475 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process identifier " PID_FMT " is not valid.", pid);
5476
5477 /* Some extra safety check */
5478 if (pid == 1 || pid == getpid_cached())
5479 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a manager process, refusing.", pid);
5480
5481 /* Don't even begin to bother with kernel threads */
5482 r = is_kernel_thread(pid);
5483 if (r == -ESRCH)
5484 return sd_bus_error_setf(error, SD_BUS_ERROR_UNIX_PROCESS_ID_UNKNOWN, "Process with ID " PID_FMT " does not exist.", pid);
5485 if (r < 0)
5486 return sd_bus_error_set_errnof(error, r, "Failed to determine whether process " PID_FMT " is a kernel thread: %m", pid);
5487 if (r > 0)
5488 return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a kernel thread, refusing.", pid);
5489
5490 return 0;
5491 }
5492
5493 void unit_log_success(Unit *u) {
5494 assert(u);
5495
5496 log_struct(LOG_INFO,
5497 "MESSAGE_ID=" SD_MESSAGE_UNIT_SUCCESS_STR,
5498 LOG_UNIT_ID(u),
5499 LOG_UNIT_INVOCATION_ID(u),
5500 LOG_UNIT_MESSAGE(u, "Succeeded."));
5501 }
5502
5503 void unit_log_failure(Unit *u, const char *result) {
5504 assert(u);
5505 assert(result);
5506
5507 log_struct(LOG_WARNING,
5508 "MESSAGE_ID=" SD_MESSAGE_UNIT_FAILURE_RESULT_STR,
5509 LOG_UNIT_ID(u),
5510 LOG_UNIT_INVOCATION_ID(u),
5511 LOG_UNIT_MESSAGE(u, "Failed with result '%s'.", result),
5512 "UNIT_RESULT=%s", result);
5513 }
5514
5515 void unit_log_process_exit(
5516 Unit *u,
5517 int level,
5518 const char *kind,
5519 const char *command,
5520 int code,
5521 int status) {
5522
5523 assert(u);
5524 assert(kind);
5525
5526 if (code != CLD_EXITED)
5527 level = LOG_WARNING;
5528
5529 log_struct(level,
5530 "MESSAGE_ID=" SD_MESSAGE_UNIT_PROCESS_EXIT_STR,
5531 LOG_UNIT_MESSAGE(u, "%s exited, code=%s, status=%i/%s",
5532 kind,
5533 sigchld_code_to_string(code), status,
5534 strna(code == CLD_EXITED
5535 ? exit_status_to_string(status, EXIT_STATUS_FULL)
5536 : signal_to_string(status))),
5537 "EXIT_CODE=%s", sigchld_code_to_string(code),
5538 "EXIT_STATUS=%i", status,
5539 "COMMAND=%s", strna(command),
5540 LOG_UNIT_ID(u),
5541 LOG_UNIT_INVOCATION_ID(u));
5542 }
5543
5544 int unit_exit_status(Unit *u) {
5545 assert(u);
5546
5547 /* Returns the exit status to propagate for the most recent cycle of this unit. Returns a value in the range
5548 * 0…255 if there's something to propagate. EOPNOTSUPP if the concept does not apply to this unit type, ENODATA
5549 * if no data is currently known (for example because the unit hasn't deactivated yet) and EBADE if the main
5550 * service process has exited abnormally (signal/coredump). */
5551
5552 if (!UNIT_VTABLE(u)->exit_status)
5553 return -EOPNOTSUPP;
5554
5555 return UNIT_VTABLE(u)->exit_status(u);
5556 }
5557
5558 int unit_failure_action_exit_status(Unit *u) {
5559 int r;
5560
5561 assert(u);
5562
5563 /* Returns the exit status to propagate on failure, or an error if there's nothing to propagate */
5564
5565 if (u->failure_action_exit_status >= 0)
5566 return u->failure_action_exit_status;
5567
5568 r = unit_exit_status(u);
5569 if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */
5570 return 255;
5571
5572 return r;
5573 }
5574
5575 int unit_success_action_exit_status(Unit *u) {
5576 int r;
5577
5578 assert(u);
5579
5580 /* Returns the exit status to propagate on success, or an error if there's nothing to propagate */
5581
5582 if (u->success_action_exit_status >= 0)
5583 return u->success_action_exit_status;
5584
5585 r = unit_exit_status(u);
5586 if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */
5587 return 255;
5588
5589 return r;
5590 }
5591
5592 static const char* const collect_mode_table[_COLLECT_MODE_MAX] = {
5593 [COLLECT_INACTIVE] = "inactive",
5594 [COLLECT_INACTIVE_OR_FAILED] = "inactive-or-failed",
5595 };
5596
5597 DEFINE_STRING_TABLE_LOOKUP(collect_mode, CollectMode);
Unnamed repository; edit this file 'description' to name the repository.