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