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