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