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