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