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