mount: don't relabel /dev twice in a row
[systemd_ALT/systemd_imz.git] / src / unit.c
blob410ff9f6071c8faca98a0219fbb5a991d0eba58e
1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
3 /***
4 This file is part of systemd.
6 Copyright 2010 Lennart Poettering
8 systemd is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
20 ***/
22 #include <assert.h>
23 #include <errno.h>
24 #include <string.h>
25 #include <sys/epoll.h>
26 #include <sys/timerfd.h>
27 #include <sys/poll.h>
28 #include <stdlib.h>
29 #include <unistd.h>
30 #include <sys/stat.h>
32 #include "set.h"
33 #include "unit.h"
34 #include "macro.h"
35 #include "strv.h"
36 #include "load-fragment.h"
37 #include "load-dropin.h"
38 #include "log.h"
39 #include "unit-name.h"
40 #include "specifier.h"
41 #include "dbus-unit.h"
42 #include "special.h"
43 #include "cgroup-util.h"
44 #include "missing.h"
46 const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = {
47 [UNIT_SERVICE] = &service_vtable,
48 [UNIT_TIMER] = &timer_vtable,
49 [UNIT_SOCKET] = &socket_vtable,
50 [UNIT_TARGET] = &target_vtable,
51 [UNIT_DEVICE] = &device_vtable,
52 [UNIT_MOUNT] = &mount_vtable,
53 [UNIT_AUTOMOUNT] = &automount_vtable,
54 [UNIT_SNAPSHOT] = &snapshot_vtable,
55 [UNIT_SWAP] = &swap_vtable,
56 [UNIT_PATH] = &path_vtable
59 Unit *unit_new(Manager *m) {
60 Unit *u;
62 assert(m);
64 if (!(u = new0(Unit, 1)))
65 return NULL;
67 if (!(u->meta.names = set_new(string_hash_func, string_compare_func))) {
68 free(u);
69 return NULL;
72 u->meta.manager = m;
73 u->meta.type = _UNIT_TYPE_INVALID;
74 u->meta.deserialized_job = _JOB_TYPE_INVALID;
75 u->meta.default_dependencies = true;
77 return u;
80 bool unit_has_name(Unit *u, const char *name) {
81 assert(u);
82 assert(name);
84 return !!set_get(u->meta.names, (char*) name);
87 int unit_add_name(Unit *u, const char *text) {
88 UnitType t;
89 char *s, *i = NULL;
90 int r;
92 assert(u);
93 assert(text);
95 if (unit_name_is_template(text)) {
96 if (!u->meta.instance)
97 return -EINVAL;
99 s = unit_name_replace_instance(text, u->meta.instance);
100 } else
101 s = strdup(text);
103 if (!s)
104 return -ENOMEM;
106 if (!unit_name_is_valid(s, false)) {
107 r = -EINVAL;
108 goto fail;
111 assert_se((t = unit_name_to_type(s)) >= 0);
113 if (u->meta.type != _UNIT_TYPE_INVALID && t != u->meta.type) {
114 r = -EINVAL;
115 goto fail;
118 if ((r = unit_name_to_instance(s, &i)) < 0)
119 goto fail;
121 if (i && unit_vtable[t]->no_instances)
122 goto fail;
124 /* Ensure that this unit is either instanced or not instanced,
125 * but not both. */
126 if (u->meta.type != _UNIT_TYPE_INVALID && !u->meta.instance != !i) {
127 r = -EINVAL;
128 goto fail;
131 if (unit_vtable[t]->no_alias &&
132 !set_isempty(u->meta.names) &&
133 !set_get(u->meta.names, s)) {
134 r = -EEXIST;
135 goto fail;
138 if (hashmap_size(u->meta.manager->units) >= MANAGER_MAX_NAMES) {
139 r = -E2BIG;
140 goto fail;
143 if ((r = set_put(u->meta.names, s)) < 0) {
144 if (r == -EEXIST)
145 r = 0;
146 goto fail;
149 if ((r = hashmap_put(u->meta.manager->units, s, u)) < 0) {
150 set_remove(u->meta.names, s);
151 goto fail;
154 if (u->meta.type == _UNIT_TYPE_INVALID) {
156 u->meta.type = t;
157 u->meta.id = s;
158 u->meta.instance = i;
160 LIST_PREPEND(Meta, units_per_type, u->meta.manager->units_per_type[t], &u->meta);
162 if (UNIT_VTABLE(u)->init)
163 UNIT_VTABLE(u)->init(u);
164 } else
165 free(i);
167 unit_add_to_dbus_queue(u);
168 return 0;
170 fail:
171 free(s);
172 free(i);
174 return r;
177 int unit_choose_id(Unit *u, const char *name) {
178 char *s, *t = NULL, *i;
179 int r;
181 assert(u);
182 assert(name);
184 if (unit_name_is_template(name)) {
186 if (!u->meta.instance)
187 return -EINVAL;
189 if (!(t = unit_name_replace_instance(name, u->meta.instance)))
190 return -ENOMEM;
192 name = t;
195 /* Selects one of the names of this unit as the id */
196 s = set_get(u->meta.names, (char*) name);
197 free(t);
199 if (!s)
200 return -ENOENT;
202 if ((r = unit_name_to_instance(s, &i)) < 0)
203 return r;
205 u->meta.id = s;
207 free(u->meta.instance);
208 u->meta.instance = i;
210 unit_add_to_dbus_queue(u);
212 return 0;
215 int unit_set_description(Unit *u, const char *description) {
216 char *s;
218 assert(u);
220 if (!(s = strdup(description)))
221 return -ENOMEM;
223 free(u->meta.description);
224 u->meta.description = s;
226 unit_add_to_dbus_queue(u);
227 return 0;
230 bool unit_check_gc(Unit *u) {
231 assert(u);
233 if (u->meta.load_state == UNIT_STUB)
234 return true;
236 if (UNIT_VTABLE(u)->no_gc)
237 return true;
239 if (u->meta.no_gc)
240 return true;
242 if (u->meta.job)
243 return true;
245 if (unit_active_state(u) != UNIT_INACTIVE)
246 return true;
248 if (UNIT_VTABLE(u)->check_gc)
249 if (UNIT_VTABLE(u)->check_gc(u))
250 return true;
252 return false;
255 void unit_add_to_load_queue(Unit *u) {
256 assert(u);
257 assert(u->meta.type != _UNIT_TYPE_INVALID);
259 if (u->meta.load_state != UNIT_STUB || u->meta.in_load_queue)
260 return;
262 LIST_PREPEND(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
263 u->meta.in_load_queue = true;
266 void unit_add_to_cleanup_queue(Unit *u) {
267 assert(u);
269 if (u->meta.in_cleanup_queue)
270 return;
272 LIST_PREPEND(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
273 u->meta.in_cleanup_queue = true;
276 void unit_add_to_gc_queue(Unit *u) {
277 assert(u);
279 if (u->meta.in_gc_queue || u->meta.in_cleanup_queue)
280 return;
282 if (unit_check_gc(u))
283 return;
285 LIST_PREPEND(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
286 u->meta.in_gc_queue = true;
288 u->meta.manager->n_in_gc_queue ++;
290 if (u->meta.manager->gc_queue_timestamp <= 0)
291 u->meta.manager->gc_queue_timestamp = now(CLOCK_MONOTONIC);
294 void unit_add_to_dbus_queue(Unit *u) {
295 assert(u);
296 assert(u->meta.type != _UNIT_TYPE_INVALID);
298 if (u->meta.load_state == UNIT_STUB || u->meta.in_dbus_queue)
299 return;
301 /* Shortcut things if nobody cares */
302 if (!bus_has_subscriber(u->meta.manager)) {
303 u->meta.sent_dbus_new_signal = true;
304 return;
307 LIST_PREPEND(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
308 u->meta.in_dbus_queue = true;
311 static void bidi_set_free(Unit *u, Set *s) {
312 Iterator i;
313 Unit *other;
315 assert(u);
317 /* Frees the set and makes sure we are dropped from the
318 * inverse pointers */
320 SET_FOREACH(other, s, i) {
321 UnitDependency d;
323 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
324 set_remove(other->meta.dependencies[d], u);
326 unit_add_to_gc_queue(other);
329 set_free(s);
332 void unit_free(Unit *u) {
333 UnitDependency d;
334 Iterator i;
335 char *t;
337 assert(u);
339 bus_unit_send_removed_signal(u);
341 if (u->meta.load_state != UNIT_STUB)
342 if (UNIT_VTABLE(u)->done)
343 UNIT_VTABLE(u)->done(u);
345 SET_FOREACH(t, u->meta.names, i)
346 hashmap_remove_value(u->meta.manager->units, t, u);
348 if (u->meta.job)
349 job_free(u->meta.job);
351 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
352 bidi_set_free(u, u->meta.dependencies[d]);
354 if (u->meta.type != _UNIT_TYPE_INVALID)
355 LIST_REMOVE(Meta, units_per_type, u->meta.manager->units_per_type[u->meta.type], &u->meta);
357 if (u->meta.in_load_queue)
358 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
360 if (u->meta.in_dbus_queue)
361 LIST_REMOVE(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
363 if (u->meta.in_cleanup_queue)
364 LIST_REMOVE(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
366 if (u->meta.in_gc_queue) {
367 LIST_REMOVE(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
368 u->meta.manager->n_in_gc_queue--;
371 cgroup_bonding_free_list(u->meta.cgroup_bondings);
373 free(u->meta.description);
374 free(u->meta.fragment_path);
376 set_free_free(u->meta.names);
378 condition_free_list(u->meta.conditions);
380 free(u->meta.instance);
381 free(u);
384 UnitActiveState unit_active_state(Unit *u) {
385 assert(u);
387 if (u->meta.load_state == UNIT_MERGED)
388 return unit_active_state(unit_follow_merge(u));
390 /* After a reload it might happen that a unit is not correctly
391 * loaded but still has a process around. That's why we won't
392 * shortcut failed loading to UNIT_INACTIVE_FAILED. */
394 return UNIT_VTABLE(u)->active_state(u);
397 const char* unit_sub_state_to_string(Unit *u) {
398 assert(u);
400 return UNIT_VTABLE(u)->sub_state_to_string(u);
403 static void complete_move(Set **s, Set **other) {
404 assert(s);
405 assert(other);
407 if (!*other)
408 return;
410 if (*s)
411 set_move(*s, *other);
412 else {
413 *s = *other;
414 *other = NULL;
418 static void merge_names(Unit *u, Unit *other) {
419 char *t;
420 Iterator i;
422 assert(u);
423 assert(other);
425 complete_move(&u->meta.names, &other->meta.names);
427 set_free_free(other->meta.names);
428 other->meta.names = NULL;
429 other->meta.id = NULL;
431 SET_FOREACH(t, u->meta.names, i)
432 assert_se(hashmap_replace(u->meta.manager->units, t, u) == 0);
435 static void merge_dependencies(Unit *u, Unit *other, UnitDependency d) {
436 Iterator i;
437 Unit *back;
438 int r;
440 assert(u);
441 assert(other);
442 assert(d < _UNIT_DEPENDENCY_MAX);
444 /* Fix backwards pointers */
445 SET_FOREACH(back, other->meta.dependencies[d], i) {
446 UnitDependency k;
448 for (k = 0; k < _UNIT_DEPENDENCY_MAX; k++)
449 if ((r = set_remove_and_put(back->meta.dependencies[k], other, u)) < 0) {
451 if (r == -EEXIST)
452 set_remove(back->meta.dependencies[k], other);
453 else
454 assert(r == -ENOENT);
458 complete_move(&u->meta.dependencies[d], &other->meta.dependencies[d]);
460 set_free(other->meta.dependencies[d]);
461 other->meta.dependencies[d] = NULL;
464 int unit_merge(Unit *u, Unit *other) {
465 UnitDependency d;
467 assert(u);
468 assert(other);
469 assert(u->meta.manager == other->meta.manager);
470 assert(u->meta.type != _UNIT_TYPE_INVALID);
472 other = unit_follow_merge(other);
474 if (other == u)
475 return 0;
477 if (u->meta.type != other->meta.type)
478 return -EINVAL;
480 if (!u->meta.instance != !other->meta.instance)
481 return -EINVAL;
483 if (other->meta.load_state != UNIT_STUB &&
484 other->meta.load_state != UNIT_ERROR)
485 return -EEXIST;
487 if (other->meta.job)
488 return -EEXIST;
490 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
491 return -EEXIST;
493 /* Merge names */
494 merge_names(u, other);
496 /* Merge dependencies */
497 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
498 merge_dependencies(u, other, d);
500 other->meta.load_state = UNIT_MERGED;
501 other->meta.merged_into = u;
503 /* If there is still some data attached to the other node, we
504 * don't need it anymore, and can free it. */
505 if (other->meta.load_state != UNIT_STUB)
506 if (UNIT_VTABLE(other)->done)
507 UNIT_VTABLE(other)->done(other);
509 unit_add_to_dbus_queue(u);
510 unit_add_to_cleanup_queue(other);
512 return 0;
515 int unit_merge_by_name(Unit *u, const char *name) {
516 Unit *other;
517 int r;
518 char *s = NULL;
520 assert(u);
521 assert(name);
523 if (unit_name_is_template(name)) {
524 if (!u->meta.instance)
525 return -EINVAL;
527 if (!(s = unit_name_replace_instance(name, u->meta.instance)))
528 return -ENOMEM;
530 name = s;
533 if (!(other = manager_get_unit(u->meta.manager, name)))
534 r = unit_add_name(u, name);
535 else
536 r = unit_merge(u, other);
538 free(s);
539 return r;
542 Unit* unit_follow_merge(Unit *u) {
543 assert(u);
545 while (u->meta.load_state == UNIT_MERGED)
546 assert_se(u = u->meta.merged_into);
548 return u;
551 int unit_add_exec_dependencies(Unit *u, ExecContext *c) {
552 int r;
554 assert(u);
555 assert(c);
557 if (c->std_output != EXEC_OUTPUT_KMSG &&
558 c->std_output != EXEC_OUTPUT_SYSLOG &&
559 c->std_error != EXEC_OUTPUT_KMSG &&
560 c->std_error != EXEC_OUTPUT_SYSLOG)
561 return 0;
563 /* If syslog or kernel logging is requested, make sure our own
564 * logging daemon is run first. */
566 if ((r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
567 return r;
569 if (u->meta.manager->running_as == MANAGER_SYSTEM)
570 if ((r = unit_add_dependency_by_name(u, UNIT_REQUIRES, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
571 return r;
573 return 0;
576 const char *unit_description(Unit *u) {
577 assert(u);
579 if (u->meta.description)
580 return u->meta.description;
582 return strna(u->meta.id);
585 void unit_dump(Unit *u, FILE *f, const char *prefix) {
586 char *t;
587 UnitDependency d;
588 Iterator i;
589 char *p2;
590 const char *prefix2;
591 CGroupBonding *b;
592 char
593 timestamp1[FORMAT_TIMESTAMP_MAX],
594 timestamp2[FORMAT_TIMESTAMP_MAX],
595 timestamp3[FORMAT_TIMESTAMP_MAX],
596 timestamp4[FORMAT_TIMESTAMP_MAX],
597 timespan[FORMAT_TIMESPAN_MAX];
598 Unit *following;
600 assert(u);
601 assert(u->meta.type >= 0);
603 if (!prefix)
604 prefix = "";
605 p2 = strappend(prefix, "\t");
606 prefix2 = p2 ? p2 : prefix;
608 fprintf(f,
609 "%s-> Unit %s:\n"
610 "%s\tDescription: %s\n"
611 "%s\tInstance: %s\n"
612 "%s\tUnit Load State: %s\n"
613 "%s\tUnit Active State: %s\n"
614 "%s\tInactive Exit Timestamp: %s\n"
615 "%s\tActive Enter Timestamp: %s\n"
616 "%s\tActive Exit Timestamp: %s\n"
617 "%s\tInactive Enter Timestamp: %s\n"
618 "%s\tGC Check Good: %s\n"
619 "%s\tNeed Daemon Reload: %s\n",
620 prefix, u->meta.id,
621 prefix, unit_description(u),
622 prefix, strna(u->meta.instance),
623 prefix, unit_load_state_to_string(u->meta.load_state),
624 prefix, unit_active_state_to_string(unit_active_state(u)),
625 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->meta.inactive_exit_timestamp.realtime)),
626 prefix, strna(format_timestamp(timestamp2, sizeof(timestamp2), u->meta.active_enter_timestamp.realtime)),
627 prefix, strna(format_timestamp(timestamp3, sizeof(timestamp3), u->meta.active_exit_timestamp.realtime)),
628 prefix, strna(format_timestamp(timestamp4, sizeof(timestamp4), u->meta.inactive_enter_timestamp.realtime)),
629 prefix, yes_no(unit_check_gc(u)),
630 prefix, yes_no(unit_need_daemon_reload(u)));
632 SET_FOREACH(t, u->meta.names, i)
633 fprintf(f, "%s\tName: %s\n", prefix, t);
635 if ((following = unit_following(u)))
636 fprintf(f, "%s\tFollowing: %s\n", prefix, following->meta.id);
638 if (u->meta.fragment_path)
639 fprintf(f, "%s\tFragment Path: %s\n", prefix, u->meta.fragment_path);
641 if (u->meta.job_timeout > 0)
642 fprintf(f, "%s\tJob Timeout: %s\n", prefix, format_timespan(timespan, sizeof(timespan), u->meta.job_timeout));
644 condition_dump_list(u->meta.conditions, f, prefix);
646 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
647 Unit *other;
649 SET_FOREACH(other, u->meta.dependencies[d], i)
650 fprintf(f, "%s\t%s: %s\n", prefix, unit_dependency_to_string(d), other->meta.id);
653 if (u->meta.load_state == UNIT_LOADED) {
654 fprintf(f,
655 "%s\tStopWhenUnneeded: %s\n"
656 "%s\tRefuseManualStart: %s\n"
657 "%s\tRefuseManualStop: %s\n"
658 "%s\tDefaultDependencies: %s\n",
659 prefix, yes_no(u->meta.stop_when_unneeded),
660 prefix, yes_no(u->meta.refuse_manual_start),
661 prefix, yes_no(u->meta.refuse_manual_stop),
662 prefix, yes_no(u->meta.default_dependencies));
664 LIST_FOREACH(by_unit, b, u->meta.cgroup_bondings)
665 fprintf(f, "%s\tControlGroup: %s:%s\n",
666 prefix, b->controller, b->path);
668 if (UNIT_VTABLE(u)->dump)
669 UNIT_VTABLE(u)->dump(u, f, prefix2);
671 } else if (u->meta.load_state == UNIT_MERGED)
672 fprintf(f,
673 "%s\tMerged into: %s\n",
674 prefix, u->meta.merged_into->meta.id);
675 else if (u->meta.load_state == UNIT_ERROR)
676 fprintf(f, "%s\tLoad Error Code: %s\n", prefix, strerror(-u->meta.load_error));
679 if (u->meta.job)
680 job_dump(u->meta.job, f, prefix2);
682 free(p2);
685 /* Common implementation for multiple backends */
686 int unit_load_fragment_and_dropin(Unit *u) {
687 int r;
689 assert(u);
691 /* Load a .service file */
692 if ((r = unit_load_fragment(u)) < 0)
693 return r;
695 if (u->meta.load_state == UNIT_STUB)
696 return -ENOENT;
698 /* Load drop-in directory data */
699 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
700 return r;
702 return 0;
705 /* Common implementation for multiple backends */
706 int unit_load_fragment_and_dropin_optional(Unit *u) {
707 int r;
709 assert(u);
711 /* Same as unit_load_fragment_and_dropin(), but whether
712 * something can be loaded or not doesn't matter. */
714 /* Load a .service file */
715 if ((r = unit_load_fragment(u)) < 0)
716 return r;
718 if (u->meta.load_state == UNIT_STUB)
719 u->meta.load_state = UNIT_LOADED;
721 /* Load drop-in directory data */
722 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
723 return r;
725 return 0;
728 int unit_add_default_target_dependency(Unit *u, Unit *target) {
729 assert(u);
730 assert(target);
732 if (target->meta.type != UNIT_TARGET)
733 return 0;
735 /* Only add the dependency if boths units are loaded, so that
736 * that loop check below is reliable */
737 if (u->meta.load_state != UNIT_LOADED ||
738 target->meta.load_state != UNIT_LOADED)
739 return 0;
741 /* Don't create loops */
742 if (set_get(target->meta.dependencies[UNIT_BEFORE], u))
743 return 0;
745 return unit_add_dependency(target, UNIT_AFTER, u, true);
748 static int unit_add_default_dependencies(Unit *u) {
749 Unit *target;
750 Iterator i;
751 int r;
753 assert(u);
755 SET_FOREACH(target, u->meta.dependencies[UNIT_REQUIRED_BY], i)
756 if ((r = unit_add_default_target_dependency(u, target)) < 0)
757 return r;
759 SET_FOREACH(target, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
760 if ((r = unit_add_default_target_dependency(u, target)) < 0)
761 return r;
763 SET_FOREACH(target, u->meta.dependencies[UNIT_WANTED_BY], i)
764 if ((r = unit_add_default_target_dependency(u, target)) < 0)
765 return r;
767 SET_FOREACH(target, u->meta.dependencies[UNIT_BOUND_BY], i)
768 if ((r = unit_add_default_target_dependency(u, target)) < 0)
769 return r;
771 return 0;
774 int unit_load(Unit *u) {
775 int r;
777 assert(u);
779 if (u->meta.in_load_queue) {
780 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
781 u->meta.in_load_queue = false;
784 if (u->meta.type == _UNIT_TYPE_INVALID)
785 return -EINVAL;
787 if (u->meta.load_state != UNIT_STUB)
788 return 0;
790 if (UNIT_VTABLE(u)->load)
791 if ((r = UNIT_VTABLE(u)->load(u)) < 0)
792 goto fail;
794 if (u->meta.load_state == UNIT_STUB) {
795 r = -ENOENT;
796 goto fail;
799 if (u->meta.load_state == UNIT_LOADED &&
800 u->meta.default_dependencies)
801 if ((r = unit_add_default_dependencies(u)) < 0)
802 goto fail;
804 assert((u->meta.load_state != UNIT_MERGED) == !u->meta.merged_into);
806 unit_add_to_dbus_queue(unit_follow_merge(u));
807 unit_add_to_gc_queue(u);
809 return 0;
811 fail:
812 u->meta.load_state = UNIT_ERROR;
813 u->meta.load_error = r;
814 unit_add_to_dbus_queue(u);
816 log_debug("Failed to load configuration for %s: %s", u->meta.id, strerror(-r));
818 return r;
821 /* Errors:
822 * -EBADR: This unit type does not support starting.
823 * -EALREADY: Unit is already started.
824 * -EAGAIN: An operation is already in progress. Retry later.
825 * -ECANCELED: Too many requests for now.
827 int unit_start(Unit *u) {
828 UnitActiveState state;
830 assert(u);
832 if (u->meta.load_state != UNIT_LOADED)
833 return -EINVAL;
835 /* If this is already (being) started, then this will
836 * succeed. Note that this will even succeed if this unit is
837 * not startable by the user. This is relied on to detect when
838 * we need to wait for units and when waiting is finished. */
839 state = unit_active_state(u);
840 if (UNIT_IS_ACTIVE_OR_RELOADING(state))
841 return -EALREADY;
843 /* If it is stopped, but we cannot start it, then fail */
844 if (!UNIT_VTABLE(u)->start)
845 return -EBADR;
847 /* If the conditions failed, don't do anything at all */
848 if (!condition_test_list(u->meta.conditions)) {
849 log_debug("Starting of %s requested but condition failed. Ignoring.", u->meta.id);
850 return -EALREADY;
853 /* We don't suppress calls to ->start() here when we are
854 * already starting, to allow this request to be used as a
855 * "hurry up" call, for example when the unit is in some "auto
856 * restart" state where it waits for a holdoff timer to elapse
857 * before it will start again. */
859 unit_add_to_dbus_queue(u);
861 unit_status_printf(u, "Starting %s...\n", unit_description(u));
863 return UNIT_VTABLE(u)->start(u);
866 bool unit_can_start(Unit *u) {
867 assert(u);
869 return !!UNIT_VTABLE(u)->start;
872 bool unit_can_isolate(Unit *u) {
873 assert(u);
875 return unit_can_start(u) &&
876 u->meta.allow_isolate;
879 /* Errors:
880 * -EBADR: This unit type does not support stopping.
881 * -EALREADY: Unit is already stopped.
882 * -EAGAIN: An operation is already in progress. Retry later.
884 int unit_stop(Unit *u) {
885 UnitActiveState state;
887 assert(u);
889 state = unit_active_state(u);
890 if (UNIT_IS_INACTIVE_OR_FAILED(state))
891 return -EALREADY;
893 if (!UNIT_VTABLE(u)->stop)
894 return -EBADR;
896 unit_add_to_dbus_queue(u);
898 unit_status_printf(u, "Stopping %s...\n", unit_description(u));
900 return UNIT_VTABLE(u)->stop(u);
903 /* Errors:
904 * -EBADR: This unit type does not support reloading.
905 * -ENOEXEC: Unit is not started.
906 * -EAGAIN: An operation is already in progress. Retry later.
908 int unit_reload(Unit *u) {
909 UnitActiveState state;
911 assert(u);
913 if (u->meta.load_state != UNIT_LOADED)
914 return -EINVAL;
916 if (!unit_can_reload(u))
917 return -EBADR;
919 state = unit_active_state(u);
920 if (state == UNIT_RELOADING)
921 return -EALREADY;
923 if (state != UNIT_ACTIVE)
924 return -ENOEXEC;
926 unit_add_to_dbus_queue(u);
927 return UNIT_VTABLE(u)->reload(u);
930 bool unit_can_reload(Unit *u) {
931 assert(u);
933 if (!UNIT_VTABLE(u)->reload)
934 return false;
936 if (!UNIT_VTABLE(u)->can_reload)
937 return true;
939 return UNIT_VTABLE(u)->can_reload(u);
942 static void unit_check_unneeded(Unit *u) {
943 Iterator i;
944 Unit *other;
946 assert(u);
948 /* If this service shall be shut down when unneeded then do
949 * so. */
951 if (!u->meta.stop_when_unneeded)
952 return;
954 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
955 return;
957 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
958 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
959 return;
961 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
962 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
963 return;
965 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTED_BY], i)
966 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
967 return;
969 SET_FOREACH(other, u->meta.dependencies[UNIT_BOUND_BY], i)
970 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
971 return;
973 log_info("Service %s is not needed anymore. Stopping.", u->meta.id);
975 /* Ok, nobody needs us anymore. Sniff. Then let's commit suicide */
976 manager_add_job(u->meta.manager, JOB_STOP, u, JOB_FAIL, true, NULL, NULL);
979 static void retroactively_start_dependencies(Unit *u) {
980 Iterator i;
981 Unit *other;
983 assert(u);
984 assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)));
986 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
987 if (!set_get(u->meta.dependencies[UNIT_AFTER], other) &&
988 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
989 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
991 SET_FOREACH(other, u->meta.dependencies[UNIT_BIND_TO], i)
992 if (!set_get(u->meta.dependencies[UNIT_AFTER], other) &&
993 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
994 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
996 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
997 if (!set_get(u->meta.dependencies[UNIT_AFTER], other) &&
998 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
999 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL, NULL);
1001 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
1002 if (!set_get(u->meta.dependencies[UNIT_AFTER], other) &&
1003 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
1004 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
1006 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
1007 if (!set_get(u->meta.dependencies[UNIT_AFTER], other) &&
1008 !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
1009 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL, NULL);
1011 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTS], i)
1012 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1013 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
1015 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTED_BY], i)
1016 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1017 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
1020 static void retroactively_stop_dependencies(Unit *u) {
1021 Iterator i;
1022 Unit *other;
1024 assert(u);
1025 assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)));
1027 /* Pull down units which are bound to us recursively if enabled */
1028 SET_FOREACH(other, u->meta.dependencies[UNIT_BOUND_BY], i)
1029 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1030 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
1032 /* Garbage collect services that might not be needed anymore, if enabled */
1033 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
1034 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1035 unit_check_unneeded(other);
1036 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
1037 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1038 unit_check_unneeded(other);
1039 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
1040 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1041 unit_check_unneeded(other);
1042 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
1043 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1044 unit_check_unneeded(other);
1045 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE_OVERRIDABLE], i)
1046 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1047 unit_check_unneeded(other);
1048 SET_FOREACH(other, u->meta.dependencies[UNIT_BIND_TO], i)
1049 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1050 unit_check_unneeded(other);
1053 void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns) {
1054 dual_timestamp ts;
1055 bool unexpected;
1057 assert(u);
1058 assert(os < _UNIT_ACTIVE_STATE_MAX);
1059 assert(ns < _UNIT_ACTIVE_STATE_MAX);
1061 /* Note that this is called for all low-level state changes,
1062 * even if they might map to the same high-level
1063 * UnitActiveState! That means that ns == os is OK an expected
1064 * behaviour here. For example: if a mount point is remounted
1065 * this function will be called too! */
1067 dual_timestamp_get(&ts);
1069 if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns))
1070 u->meta.inactive_exit_timestamp = ts;
1071 else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns))
1072 u->meta.inactive_enter_timestamp = ts;
1074 if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns))
1075 u->meta.active_enter_timestamp = ts;
1076 else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns))
1077 u->meta.active_exit_timestamp = ts;
1079 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1080 cgroup_bonding_trim_list(u->meta.cgroup_bondings, true);
1082 timer_unit_notify(u, ns);
1083 path_unit_notify(u, ns);
1085 if (u->meta.job) {
1086 unexpected = false;
1088 if (u->meta.job->state == JOB_WAITING)
1090 /* So we reached a different state for this
1091 * job. Let's see if we can run it now if it
1092 * failed previously due to EAGAIN. */
1093 job_add_to_run_queue(u->meta.job);
1095 /* Let's check whether this state change constitutes a
1096 * finished job, or maybe cotradicts a running job and
1097 * hence needs to invalidate jobs. */
1099 switch (u->meta.job->type) {
1101 case JOB_START:
1102 case JOB_VERIFY_ACTIVE:
1104 if (UNIT_IS_ACTIVE_OR_RELOADING(ns))
1105 job_finish_and_invalidate(u->meta.job, true);
1106 else if (u->meta.job->state == JOB_RUNNING && ns != UNIT_ACTIVATING) {
1107 unexpected = true;
1109 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1110 job_finish_and_invalidate(u->meta.job, ns != UNIT_FAILED);
1113 break;
1115 case JOB_RELOAD:
1116 case JOB_RELOAD_OR_START:
1118 if (u->meta.job->state == JOB_RUNNING) {
1119 if (ns == UNIT_ACTIVE)
1120 job_finish_and_invalidate(u->meta.job, true);
1121 else if (ns != UNIT_ACTIVATING && ns != UNIT_RELOADING) {
1122 unexpected = true;
1124 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1125 job_finish_and_invalidate(u->meta.job, ns != UNIT_FAILED);
1129 break;
1131 case JOB_STOP:
1132 case JOB_RESTART:
1133 case JOB_TRY_RESTART:
1135 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1136 job_finish_and_invalidate(u->meta.job, true);
1137 else if (u->meta.job->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) {
1138 unexpected = true;
1139 job_finish_and_invalidate(u->meta.job, false);
1142 break;
1144 default:
1145 assert_not_reached("Job type unknown");
1148 } else
1149 unexpected = true;
1151 /* If this state change happened without being requested by a
1152 * job, then let's retroactively start or stop
1153 * dependencies. We skip that step when deserializing, since
1154 * we don't want to create any additional jobs just because
1155 * something is already activated. */
1157 if (unexpected && u->meta.manager->n_deserializing <= 0) {
1158 if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns))
1159 retroactively_start_dependencies(u);
1160 else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns))
1161 retroactively_stop_dependencies(u);
1164 if (ns != os && ns == UNIT_FAILED) {
1165 Iterator i;
1166 Unit *other;
1168 SET_FOREACH(other, u->meta.dependencies[UNIT_ON_FAILURE], i)
1169 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
1171 log_notice("Unit %s entered failed state.", u->meta.id);
1174 /* Some names are special */
1175 if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) {
1176 if (unit_has_name(u, SPECIAL_DBUS_SERVICE))
1177 /* The bus just might have become available,
1178 * hence try to connect to it, if we aren't
1179 * yet connected. */
1180 bus_init(u->meta.manager);
1182 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1183 /* The syslog daemon just might have become
1184 * available, hence try to connect to it, if
1185 * we aren't yet connected. */
1186 log_open();
1188 if (u->meta.type == UNIT_SERVICE &&
1189 !UNIT_IS_ACTIVE_OR_RELOADING(os)) {
1190 /* Write audit record if we have just finished starting up */
1191 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_START, true);
1192 u->meta.in_audit = true;
1195 if (!UNIT_IS_ACTIVE_OR_RELOADING(os))
1196 manager_send_unit_plymouth(u->meta.manager, u);
1198 } else {
1200 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1201 /* The syslog daemon might just have
1202 * terminated, hence try to disconnect from
1203 * it. */
1204 log_close_syslog();
1206 /* We don't care about D-Bus here, since we'll get an
1207 * asynchronous notification for it anyway. */
1209 if (u->meta.type == UNIT_SERVICE &&
1210 UNIT_IS_INACTIVE_OR_FAILED(ns) &&
1211 !UNIT_IS_INACTIVE_OR_FAILED(os)) {
1213 /* Hmm, if there was no start record written
1214 * write it now, so that we always have a nice
1215 * pair */
1216 if (!u->meta.in_audit) {
1217 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_START, ns == UNIT_INACTIVE);
1219 if (ns == UNIT_INACTIVE)
1220 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_STOP, true);
1221 } else
1222 /* Write audit record if we have just finished shutting down */
1223 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_STOP, ns == UNIT_INACTIVE);
1225 u->meta.in_audit = false;
1229 /* Maybe we finished startup and are now ready for being
1230 * stopped because unneeded? */
1231 unit_check_unneeded(u);
1233 unit_add_to_dbus_queue(u);
1234 unit_add_to_gc_queue(u);
1237 int unit_watch_fd(Unit *u, int fd, uint32_t events, Watch *w) {
1238 struct epoll_event ev;
1240 assert(u);
1241 assert(fd >= 0);
1242 assert(w);
1243 assert(w->type == WATCH_INVALID || (w->type == WATCH_FD && w->fd == fd && w->data.unit == u));
1245 zero(ev);
1246 ev.data.ptr = w;
1247 ev.events = events;
1249 if (epoll_ctl(u->meta.manager->epoll_fd,
1250 w->type == WATCH_INVALID ? EPOLL_CTL_ADD : EPOLL_CTL_MOD,
1252 &ev) < 0)
1253 return -errno;
1255 w->fd = fd;
1256 w->type = WATCH_FD;
1257 w->data.unit = u;
1259 return 0;
1262 void unit_unwatch_fd(Unit *u, Watch *w) {
1263 assert(u);
1264 assert(w);
1266 if (w->type == WATCH_INVALID)
1267 return;
1269 assert(w->type == WATCH_FD);
1270 assert(w->data.unit == u);
1271 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1273 w->fd = -1;
1274 w->type = WATCH_INVALID;
1275 w->data.unit = NULL;
1278 int unit_watch_pid(Unit *u, pid_t pid) {
1279 assert(u);
1280 assert(pid >= 1);
1282 /* Watch a specific PID. We only support one unit watching
1283 * each PID for now. */
1285 return hashmap_put(u->meta.manager->watch_pids, LONG_TO_PTR(pid), u);
1288 void unit_unwatch_pid(Unit *u, pid_t pid) {
1289 assert(u);
1290 assert(pid >= 1);
1292 hashmap_remove_value(u->meta.manager->watch_pids, LONG_TO_PTR(pid), u);
1295 int unit_watch_timer(Unit *u, usec_t delay, Watch *w) {
1296 struct itimerspec its;
1297 int flags, fd;
1298 bool ours;
1300 assert(u);
1301 assert(w);
1302 assert(w->type == WATCH_INVALID || (w->type == WATCH_UNIT_TIMER && w->data.unit == u));
1304 /* This will try to reuse the old timer if there is one */
1306 if (w->type == WATCH_UNIT_TIMER) {
1307 assert(w->data.unit == u);
1308 assert(w->fd >= 0);
1310 ours = false;
1311 fd = w->fd;
1312 } else if (w->type == WATCH_INVALID) {
1314 ours = true;
1315 if ((fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK|TFD_CLOEXEC)) < 0)
1316 return -errno;
1317 } else
1318 assert_not_reached("Invalid watch type");
1320 zero(its);
1322 if (delay <= 0) {
1323 /* Set absolute time in the past, but not 0, since we
1324 * don't want to disarm the timer */
1325 its.it_value.tv_sec = 0;
1326 its.it_value.tv_nsec = 1;
1328 flags = TFD_TIMER_ABSTIME;
1329 } else {
1330 timespec_store(&its.it_value, delay);
1331 flags = 0;
1334 /* This will also flush the elapse counter */
1335 if (timerfd_settime(fd, flags, &its, NULL) < 0)
1336 goto fail;
1338 if (w->type == WATCH_INVALID) {
1339 struct epoll_event ev;
1341 zero(ev);
1342 ev.data.ptr = w;
1343 ev.events = EPOLLIN;
1345 if (epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_ADD, fd, &ev) < 0)
1346 goto fail;
1349 w->type = WATCH_UNIT_TIMER;
1350 w->fd = fd;
1351 w->data.unit = u;
1353 return 0;
1355 fail:
1356 if (ours)
1357 close_nointr_nofail(fd);
1359 return -errno;
1362 void unit_unwatch_timer(Unit *u, Watch *w) {
1363 assert(u);
1364 assert(w);
1366 if (w->type == WATCH_INVALID)
1367 return;
1369 assert(w->type == WATCH_UNIT_TIMER);
1370 assert(w->data.unit == u);
1371 assert(w->fd >= 0);
1373 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1374 close_nointr_nofail(w->fd);
1376 w->fd = -1;
1377 w->type = WATCH_INVALID;
1378 w->data.unit = NULL;
1381 bool unit_job_is_applicable(Unit *u, JobType j) {
1382 assert(u);
1383 assert(j >= 0 && j < _JOB_TYPE_MAX);
1385 switch (j) {
1387 case JOB_VERIFY_ACTIVE:
1388 case JOB_START:
1389 return true;
1391 case JOB_STOP:
1392 case JOB_RESTART:
1393 case JOB_TRY_RESTART:
1394 return unit_can_start(u);
1396 case JOB_RELOAD:
1397 return unit_can_reload(u);
1399 case JOB_RELOAD_OR_START:
1400 return unit_can_reload(u) && unit_can_start(u);
1402 default:
1403 assert_not_reached("Invalid job type");
1407 int unit_add_dependency(Unit *u, UnitDependency d, Unit *other, bool add_reference) {
1409 static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = {
1410 [UNIT_REQUIRES] = UNIT_REQUIRED_BY,
1411 [UNIT_REQUIRES_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1412 [UNIT_WANTS] = UNIT_WANTED_BY,
1413 [UNIT_REQUISITE] = UNIT_REQUIRED_BY,
1414 [UNIT_REQUISITE_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1415 [UNIT_BIND_TO] = UNIT_BOUND_BY,
1416 [UNIT_REQUIRED_BY] = _UNIT_DEPENDENCY_INVALID,
1417 [UNIT_REQUIRED_BY_OVERRIDABLE] = _UNIT_DEPENDENCY_INVALID,
1418 [UNIT_WANTED_BY] = _UNIT_DEPENDENCY_INVALID,
1419 [UNIT_BOUND_BY] = UNIT_BIND_TO,
1420 [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY,
1421 [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS,
1422 [UNIT_BEFORE] = UNIT_AFTER,
1423 [UNIT_AFTER] = UNIT_BEFORE,
1424 [UNIT_ON_FAILURE] = _UNIT_DEPENDENCY_INVALID,
1425 [UNIT_REFERENCES] = UNIT_REFERENCED_BY,
1426 [UNIT_REFERENCED_BY] = UNIT_REFERENCES
1428 int r, q = 0, v = 0, w = 0;
1430 assert(u);
1431 assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX);
1432 assert(other);
1434 u = unit_follow_merge(u);
1435 other = unit_follow_merge(other);
1437 /* We won't allow dependencies on ourselves. We will not
1438 * consider them an error however. */
1439 if (u == other)
1440 return 0;
1442 if (UNIT_VTABLE(u)->no_requires &&
1443 (d == UNIT_REQUIRES ||
1444 d == UNIT_REQUIRES_OVERRIDABLE ||
1445 d == UNIT_REQUISITE ||
1446 d == UNIT_REQUISITE_OVERRIDABLE ||
1447 d == UNIT_BIND_TO)) {
1448 return -EINVAL;
1451 if ((r = set_ensure_allocated(&u->meta.dependencies[d], trivial_hash_func, trivial_compare_func)) < 0)
1452 return r;
1454 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID)
1455 if ((r = set_ensure_allocated(&other->meta.dependencies[inverse_table[d]], trivial_hash_func, trivial_compare_func)) < 0)
1456 return r;
1458 if (add_reference)
1459 if ((r = set_ensure_allocated(&u->meta.dependencies[UNIT_REFERENCES], trivial_hash_func, trivial_compare_func)) < 0 ||
1460 (r = set_ensure_allocated(&other->meta.dependencies[UNIT_REFERENCED_BY], trivial_hash_func, trivial_compare_func)) < 0)
1461 return r;
1463 if ((q = set_put(u->meta.dependencies[d], other)) < 0)
1464 return q;
1466 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID)
1467 if ((v = set_put(other->meta.dependencies[inverse_table[d]], u)) < 0) {
1468 r = v;
1469 goto fail;
1472 if (add_reference) {
1473 if ((w = set_put(u->meta.dependencies[UNIT_REFERENCES], other)) < 0) {
1474 r = w;
1475 goto fail;
1478 if ((r = set_put(other->meta.dependencies[UNIT_REFERENCED_BY], u)) < 0)
1479 goto fail;
1482 unit_add_to_dbus_queue(u);
1483 return 0;
1485 fail:
1486 if (q > 0)
1487 set_remove(u->meta.dependencies[d], other);
1489 if (v > 0)
1490 set_remove(other->meta.dependencies[inverse_table[d]], u);
1492 if (w > 0)
1493 set_remove(u->meta.dependencies[UNIT_REFERENCES], other);
1495 return r;
1498 int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference) {
1499 int r;
1501 assert(u);
1503 if ((r = unit_add_dependency(u, d, other, add_reference)) < 0)
1504 return r;
1506 if ((r = unit_add_dependency(u, e, other, add_reference)) < 0)
1507 return r;
1509 return 0;
1512 static const char *resolve_template(Unit *u, const char *name, const char*path, char **p) {
1513 char *s;
1515 assert(u);
1516 assert(name || path);
1518 if (!name)
1519 name = file_name_from_path(path);
1521 if (!unit_name_is_template(name)) {
1522 *p = NULL;
1523 return name;
1526 if (u->meta.instance)
1527 s = unit_name_replace_instance(name, u->meta.instance);
1528 else {
1529 char *i;
1531 if (!(i = unit_name_to_prefix(u->meta.id)))
1532 return NULL;
1534 s = unit_name_replace_instance(name, i);
1535 free(i);
1538 if (!s)
1539 return NULL;
1541 *p = s;
1542 return s;
1545 int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1546 Unit *other;
1547 int r;
1548 char *s;
1550 assert(u);
1551 assert(name || path);
1553 if (!(name = resolve_template(u, name, path, &s)))
1554 return -ENOMEM;
1556 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1557 goto finish;
1559 r = unit_add_dependency(u, d, other, add_reference);
1561 finish:
1562 free(s);
1563 return r;
1566 int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, const char *path, bool add_reference) {
1567 Unit *other;
1568 int r;
1569 char *s;
1571 assert(u);
1572 assert(name || path);
1574 if (!(name = resolve_template(u, name, path, &s)))
1575 return -ENOMEM;
1577 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1578 goto finish;
1580 r = unit_add_two_dependencies(u, d, e, other, add_reference);
1582 finish:
1583 free(s);
1584 return r;
1587 int unit_add_dependency_by_name_inverse(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1588 Unit *other;
1589 int r;
1590 char *s;
1592 assert(u);
1593 assert(name || path);
1595 if (!(name = resolve_template(u, name, path, &s)))
1596 return -ENOMEM;
1598 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1599 goto finish;
1601 r = unit_add_dependency(other, d, u, add_reference);
1603 finish:
1604 free(s);
1605 return r;
1608 int unit_add_two_dependencies_by_name_inverse(Unit *u, UnitDependency d, UnitDependency e, const char *name, const char *path, bool add_reference) {
1609 Unit *other;
1610 int r;
1611 char *s;
1613 assert(u);
1614 assert(name || path);
1616 if (!(name = resolve_template(u, name, path, &s)))
1617 return -ENOMEM;
1619 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1620 goto finish;
1622 if ((r = unit_add_two_dependencies(other, d, e, u, add_reference)) < 0)
1623 goto finish;
1625 finish:
1626 free(s);
1627 return r;
1630 int set_unit_path(const char *p) {
1631 char *cwd, *c;
1632 int r;
1634 /* This is mostly for debug purposes */
1636 if (path_is_absolute(p)) {
1637 if (!(c = strdup(p)))
1638 return -ENOMEM;
1639 } else {
1640 if (!(cwd = get_current_dir_name()))
1641 return -errno;
1643 r = asprintf(&c, "%s/%s", cwd, p);
1644 free(cwd);
1646 if (r < 0)
1647 return -ENOMEM;
1650 if (setenv("SYSTEMD_UNIT_PATH", c, 0) < 0) {
1651 r = -errno;
1652 free(c);
1653 return r;
1656 return 0;
1659 char *unit_dbus_path(Unit *u) {
1660 char *p, *e;
1662 assert(u);
1664 if (!u->meta.id)
1665 return NULL;
1667 if (!(e = bus_path_escape(u->meta.id)))
1668 return NULL;
1670 p = strappend("/org/freedesktop/systemd1/unit/", e);
1671 free(e);
1673 return p;
1676 int unit_add_cgroup(Unit *u, CGroupBonding *b) {
1677 CGroupBonding *l;
1678 int r;
1680 assert(u);
1681 assert(b);
1683 assert(b->path);
1685 if (!b->controller)
1686 if (!(b->controller = strdup(SYSTEMD_CGROUP_CONTROLLER)))
1687 return -ENOMEM;
1689 /* Ensure this hasn't been added yet */
1690 assert(!b->unit);
1692 l = hashmap_get(u->meta.manager->cgroup_bondings, b->path);
1693 LIST_PREPEND(CGroupBonding, by_path, l, b);
1695 if ((r = hashmap_replace(u->meta.manager->cgroup_bondings, b->path, l)) < 0) {
1696 LIST_REMOVE(CGroupBonding, by_path, l, b);
1697 return r;
1700 LIST_PREPEND(CGroupBonding, by_unit, u->meta.cgroup_bondings, b);
1701 b->unit = u;
1703 return 0;
1706 static char *default_cgroup_path(Unit *u) {
1707 char *p;
1708 int r;
1710 assert(u);
1712 if (u->meta.instance) {
1713 char *t;
1715 if (!(t = unit_name_template(u->meta.id)))
1716 return NULL;
1718 r = asprintf(&p, "%s/%s/%s", u->meta.manager->cgroup_hierarchy, t, u->meta.instance);
1719 free(t);
1720 } else
1721 r = asprintf(&p, "%s/%s", u->meta.manager->cgroup_hierarchy, u->meta.id);
1723 return r < 0 ? NULL : p;
1726 int unit_add_cgroup_from_text(Unit *u, const char *name) {
1727 char *controller = NULL, *path = NULL;
1728 CGroupBonding *b = NULL;
1729 int r;
1731 assert(u);
1732 assert(name);
1734 if ((r = cg_split_spec(name, &controller, &path)) < 0)
1735 return r;
1737 if (!path)
1738 path = default_cgroup_path(u);
1740 if (!controller)
1741 controller = strdup(SYSTEMD_CGROUP_CONTROLLER);
1743 if (!path || !controller) {
1744 free(path);
1745 free(controller);
1747 return -ENOMEM;
1750 if (cgroup_bonding_find_list(u->meta.cgroup_bondings, controller)) {
1751 r = -EEXIST;
1752 goto fail;
1755 if (!(b = new0(CGroupBonding, 1))) {
1756 r = -ENOMEM;
1757 goto fail;
1760 b->controller = controller;
1761 b->path = path;
1762 b->only_us = false;
1763 b->clean_up = false;
1765 if ((r = unit_add_cgroup(u, b)) < 0)
1766 goto fail;
1768 return 0;
1770 fail:
1771 free(path);
1772 free(controller);
1773 free(b);
1775 return r;
1778 int unit_add_default_cgroup(Unit *u) {
1779 CGroupBonding *b;
1780 int r = -ENOMEM;
1782 assert(u);
1784 /* Adds in the default cgroup data, if it wasn't specified yet */
1786 if (unit_get_default_cgroup(u))
1787 return 0;
1789 if (!(b = new0(CGroupBonding, 1)))
1790 return -ENOMEM;
1792 if (!(b->path = default_cgroup_path(u)))
1793 goto fail;
1795 b->clean_up = true;
1796 b->only_us = true;
1798 if ((r = unit_add_cgroup(u, b)) < 0)
1799 goto fail;
1801 return 0;
1803 fail:
1804 free(b->path);
1805 free(b->controller);
1806 free(b);
1808 return r;
1811 CGroupBonding* unit_get_default_cgroup(Unit *u) {
1812 assert(u);
1814 return cgroup_bonding_find_list(u->meta.cgroup_bondings, SYSTEMD_CGROUP_CONTROLLER);
1817 int unit_load_related_unit(Unit *u, const char *type, Unit **_found) {
1818 char *t;
1819 int r;
1821 assert(u);
1822 assert(type);
1823 assert(_found);
1825 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1826 return -ENOMEM;
1828 assert(!unit_has_name(u, t));
1830 r = manager_load_unit(u->meta.manager, t, NULL, NULL, _found);
1831 free(t);
1833 assert(r < 0 || *_found != u);
1835 return r;
1838 int unit_get_related_unit(Unit *u, const char *type, Unit **_found) {
1839 Unit *found;
1840 char *t;
1842 assert(u);
1843 assert(type);
1844 assert(_found);
1846 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1847 return -ENOMEM;
1849 assert(!unit_has_name(u, t));
1851 found = manager_get_unit(u->meta.manager, t);
1852 free(t);
1854 if (!found)
1855 return -ENOENT;
1857 *_found = found;
1858 return 0;
1861 static char *specifier_prefix_and_instance(char specifier, void *data, void *userdata) {
1862 Unit *u = userdata;
1863 assert(u);
1865 return unit_name_to_prefix_and_instance(u->meta.id);
1868 static char *specifier_prefix(char specifier, void *data, void *userdata) {
1869 Unit *u = userdata;
1870 assert(u);
1872 return unit_name_to_prefix(u->meta.id);
1875 static char *specifier_prefix_unescaped(char specifier, void *data, void *userdata) {
1876 Unit *u = userdata;
1877 char *p, *r;
1879 assert(u);
1881 if (!(p = unit_name_to_prefix(u->meta.id)))
1882 return NULL;
1884 r = unit_name_unescape(p);
1885 free(p);
1887 return r;
1890 static char *specifier_instance_unescaped(char specifier, void *data, void *userdata) {
1891 Unit *u = userdata;
1892 assert(u);
1894 if (u->meta.instance)
1895 return unit_name_unescape(u->meta.instance);
1897 return strdup("");
1900 static char *specifier_filename(char specifier, void *data, void *userdata) {
1901 Unit *u = userdata;
1902 assert(u);
1904 if (u->meta.instance)
1905 return unit_name_path_unescape(u->meta.instance);
1907 return unit_name_to_path(u->meta.instance);
1910 char *unit_name_printf(Unit *u, const char* format) {
1913 * This will use the passed string as format string and
1914 * replace the following specifiers:
1916 * %n: the full id of the unit (foo@bar.waldo)
1917 * %N: the id of the unit without the suffix (foo@bar)
1918 * %p: the prefix (foo)
1919 * %i: the instance (bar)
1922 const Specifier table[] = {
1923 { 'n', specifier_string, u->meta.id },
1924 { 'N', specifier_prefix_and_instance, NULL },
1925 { 'p', specifier_prefix, NULL },
1926 { 'i', specifier_string, u->meta.instance },
1927 { 0, NULL, NULL }
1930 assert(u);
1931 assert(format);
1933 return specifier_printf(format, table, u);
1936 char *unit_full_printf(Unit *u, const char *format) {
1938 /* This is similar to unit_name_printf() but also supports
1939 * unescaping */
1941 const Specifier table[] = {
1942 { 'n', specifier_string, u->meta.id },
1943 { 'N', specifier_prefix_and_instance, NULL },
1944 { 'p', specifier_prefix, NULL },
1945 { 'P', specifier_prefix_unescaped, NULL },
1946 { 'i', specifier_string, u->meta.instance },
1947 { 'I', specifier_instance_unescaped, NULL },
1948 { 'f', specifier_filename, NULL },
1949 { 0, NULL, NULL }
1952 assert(u);
1953 assert(format);
1955 return specifier_printf(format, table, u);
1958 char **unit_full_printf_strv(Unit *u, char **l) {
1959 size_t n;
1960 char **r, **i, **j;
1962 /* Applies unit_full_printf to every entry in l */
1964 assert(u);
1966 n = strv_length(l);
1967 if (!(r = new(char*, n+1)))
1968 return NULL;
1970 for (i = l, j = r; *i; i++, j++)
1971 if (!(*j = unit_full_printf(u, *i)))
1972 goto fail;
1974 *j = NULL;
1975 return r;
1977 fail:
1978 j--;
1979 while (j >= r)
1980 free(*j);
1982 free(r);
1984 return NULL;
1987 int unit_watch_bus_name(Unit *u, const char *name) {
1988 assert(u);
1989 assert(name);
1991 /* Watch a specific name on the bus. We only support one unit
1992 * watching each name for now. */
1994 return hashmap_put(u->meta.manager->watch_bus, name, u);
1997 void unit_unwatch_bus_name(Unit *u, const char *name) {
1998 assert(u);
1999 assert(name);
2001 hashmap_remove_value(u->meta.manager->watch_bus, name, u);
2004 bool unit_can_serialize(Unit *u) {
2005 assert(u);
2007 return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item;
2010 int unit_serialize(Unit *u, FILE *f, FDSet *fds) {
2011 int r;
2013 assert(u);
2014 assert(f);
2015 assert(fds);
2017 if (!unit_can_serialize(u))
2018 return 0;
2020 if ((r = UNIT_VTABLE(u)->serialize(u, f, fds)) < 0)
2021 return r;
2023 if (u->meta.job)
2024 unit_serialize_item(u, f, "job", job_type_to_string(u->meta.job->type));
2026 dual_timestamp_serialize(f, "inactive-exit-timestamp", &u->meta.inactive_exit_timestamp);
2027 dual_timestamp_serialize(f, "active-enter-timestamp", &u->meta.active_enter_timestamp);
2028 dual_timestamp_serialize(f, "active-exit-timestamp", &u->meta.active_exit_timestamp);
2029 dual_timestamp_serialize(f, "inactive-enter-timestamp", &u->meta.inactive_enter_timestamp);
2031 /* End marker */
2032 fputc('\n', f);
2033 return 0;
2036 void unit_serialize_item_format(Unit *u, FILE *f, const char *key, const char *format, ...) {
2037 va_list ap;
2039 assert(u);
2040 assert(f);
2041 assert(key);
2042 assert(format);
2044 fputs(key, f);
2045 fputc('=', f);
2047 va_start(ap, format);
2048 vfprintf(f, format, ap);
2049 va_end(ap);
2051 fputc('\n', f);
2054 void unit_serialize_item(Unit *u, FILE *f, const char *key, const char *value) {
2055 assert(u);
2056 assert(f);
2057 assert(key);
2058 assert(value);
2060 fprintf(f, "%s=%s\n", key, value);
2063 int unit_deserialize(Unit *u, FILE *f, FDSet *fds) {
2064 int r;
2066 assert(u);
2067 assert(f);
2068 assert(fds);
2070 if (!unit_can_serialize(u))
2071 return 0;
2073 for (;;) {
2074 char line[1024], *l, *v;
2075 size_t k;
2077 if (!fgets(line, sizeof(line), f)) {
2078 if (feof(f))
2079 return 0;
2080 return -errno;
2083 char_array_0(line);
2084 l = strstrip(line);
2086 /* End marker */
2087 if (l[0] == 0)
2088 return 0;
2090 k = strcspn(l, "=");
2092 if (l[k] == '=') {
2093 l[k] = 0;
2094 v = l+k+1;
2095 } else
2096 v = l+k;
2098 if (streq(l, "job")) {
2099 JobType type;
2101 if ((type = job_type_from_string(v)) < 0)
2102 log_debug("Failed to parse job type value %s", v);
2103 else
2104 u->meta.deserialized_job = type;
2106 continue;
2107 } else if (streq(l, "inactive-exit-timestamp")) {
2108 dual_timestamp_deserialize(v, &u->meta.inactive_exit_timestamp);
2109 continue;
2110 } else if (streq(l, "active-enter-timestamp")) {
2111 dual_timestamp_deserialize(v, &u->meta.active_enter_timestamp);
2112 continue;
2113 } else if (streq(l, "active-exit-timestamp")) {
2114 dual_timestamp_deserialize(v, &u->meta.active_exit_timestamp);
2115 continue;
2116 } else if (streq(l, "inactive-enter-timestamp")) {
2117 dual_timestamp_deserialize(v, &u->meta.inactive_enter_timestamp);
2118 continue;
2121 if ((r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds)) < 0)
2122 return r;
2126 int unit_add_node_link(Unit *u, const char *what, bool wants) {
2127 Unit *device;
2128 char *e;
2129 int r;
2131 assert(u);
2133 if (!what)
2134 return 0;
2136 /* Adds in links to the device node that this unit is based on */
2138 if (!is_device_path(what))
2139 return 0;
2141 if (!(e = unit_name_build_escape(what+1, NULL, ".device")))
2142 return -ENOMEM;
2144 r = manager_load_unit(u->meta.manager, e, NULL, NULL, &device);
2145 free(e);
2147 if (r < 0)
2148 return r;
2150 if ((r = unit_add_two_dependencies(u, UNIT_AFTER, UNIT_BIND_TO, device, true)) < 0)
2151 return r;
2153 if (wants)
2154 if ((r = unit_add_dependency(device, UNIT_WANTS, u, false)) < 0)
2155 return r;
2157 return 0;
2160 int unit_coldplug(Unit *u) {
2161 int r;
2163 assert(u);
2165 if (UNIT_VTABLE(u)->coldplug)
2166 if ((r = UNIT_VTABLE(u)->coldplug(u)) < 0)
2167 return r;
2169 if (u->meta.deserialized_job >= 0) {
2170 if ((r = manager_add_job(u->meta.manager, u->meta.deserialized_job, u, JOB_FAIL, false, NULL, NULL)) < 0)
2171 return r;
2173 u->meta.deserialized_job = _JOB_TYPE_INVALID;
2176 return 0;
2179 void unit_status_printf(Unit *u, const char *format, ...) {
2180 va_list ap;
2182 assert(u);
2183 assert(format);
2185 if (!UNIT_VTABLE(u)->show_status)
2186 return;
2188 if (u->meta.manager->running_as != MANAGER_SYSTEM)
2189 return;
2191 if (!u->meta.manager->show_status)
2192 return;
2194 if (!manager_is_booting_or_shutting_down(u->meta.manager))
2195 return;
2197 va_start(ap, format);
2198 status_vprintf(format, ap);
2199 va_end(ap);
2202 bool unit_need_daemon_reload(Unit *u) {
2203 struct stat st;
2205 assert(u);
2207 if (!u->meta.fragment_path)
2208 return false;
2210 zero(st);
2211 if (stat(u->meta.fragment_path, &st) < 0)
2212 /* What, cannot access this anymore? */
2213 return true;
2215 return
2216 u->meta.fragment_mtime &&
2217 timespec_load(&st.st_mtim) != u->meta.fragment_mtime;
2220 void unit_reset_failed(Unit *u) {
2221 assert(u);
2223 if (UNIT_VTABLE(u)->reset_failed)
2224 UNIT_VTABLE(u)->reset_failed(u);
2227 Unit *unit_following(Unit *u) {
2228 assert(u);
2230 if (UNIT_VTABLE(u)->following)
2231 return UNIT_VTABLE(u)->following(u);
2233 return NULL;
2236 bool unit_pending_inactive(Unit *u) {
2237 assert(u);
2239 /* Returns true if the unit is inactive or going down */
2241 if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)))
2242 return true;
2244 if (u->meta.job && u->meta.job->type == JOB_STOP)
2245 return true;
2247 return false;
2250 bool unit_pending_active(Unit *u) {
2251 assert(u);
2253 /* Returns true if the unit is inactive or going down */
2255 if (UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
2256 return true;
2258 if (u->meta.job &&
2259 (u->meta.job->type == JOB_START ||
2260 u->meta.job->type == JOB_RELOAD_OR_START ||
2261 u->meta.job->type == JOB_RESTART))
2262 return true;
2264 return false;
2267 UnitType unit_name_to_type(const char *n) {
2268 UnitType t;
2270 assert(n);
2272 for (t = 0; t < _UNIT_TYPE_MAX; t++)
2273 if (endswith(n, unit_vtable[t]->suffix))
2274 return t;
2276 return _UNIT_TYPE_INVALID;
2279 bool unit_name_is_valid(const char *n, bool template_ok) {
2280 UnitType t;
2282 t = unit_name_to_type(n);
2283 if (t < 0 || t >= _UNIT_TYPE_MAX)
2284 return false;
2286 return unit_name_is_valid_no_type(n, template_ok);
2289 int unit_kill(Unit *u, KillWho w, KillMode m, int signo, DBusError *error) {
2290 assert(u);
2291 assert(w >= 0 && w < _KILL_WHO_MAX);
2292 assert(m >= 0 && m < _KILL_MODE_MAX);
2293 assert(signo > 0);
2294 assert(signo < _NSIG);
2296 if (m == KILL_NONE)
2297 return 0;
2299 if (!UNIT_VTABLE(u)->kill)
2300 return -ENOTSUP;
2302 return UNIT_VTABLE(u)->kill(u, w, m, signo, error);
2305 static const char* const unit_load_state_table[_UNIT_LOAD_STATE_MAX] = {
2306 [UNIT_STUB] = "stub",
2307 [UNIT_LOADED] = "loaded",
2308 [UNIT_ERROR] = "error",
2309 [UNIT_MERGED] = "merged",
2310 [UNIT_MASKED] = "masked"
2313 DEFINE_STRING_TABLE_LOOKUP(unit_load_state, UnitLoadState);
2315 static const char* const unit_active_state_table[_UNIT_ACTIVE_STATE_MAX] = {
2316 [UNIT_ACTIVE] = "active",
2317 [UNIT_RELOADING] = "reloading",
2318 [UNIT_INACTIVE] = "inactive",
2319 [UNIT_FAILED] = "failed",
2320 [UNIT_ACTIVATING] = "activating",
2321 [UNIT_DEACTIVATING] = "deactivating"
2324 DEFINE_STRING_TABLE_LOOKUP(unit_active_state, UnitActiveState);
2326 static const char* const unit_dependency_table[_UNIT_DEPENDENCY_MAX] = {
2327 [UNIT_REQUIRES] = "Requires",
2328 [UNIT_REQUIRES_OVERRIDABLE] = "RequiresOverridable",
2329 [UNIT_WANTS] = "Wants",
2330 [UNIT_REQUISITE] = "Requisite",
2331 [UNIT_REQUISITE_OVERRIDABLE] = "RequisiteOverridable",
2332 [UNIT_REQUIRED_BY] = "RequiredBy",
2333 [UNIT_REQUIRED_BY_OVERRIDABLE] = "RequiredByOverridable",
2334 [UNIT_BIND_TO] = "BindTo",
2335 [UNIT_WANTED_BY] = "WantedBy",
2336 [UNIT_CONFLICTS] = "Conflicts",
2337 [UNIT_CONFLICTED_BY] = "ConflictedBy",
2338 [UNIT_BOUND_BY] = "BoundBy",
2339 [UNIT_BEFORE] = "Before",
2340 [UNIT_AFTER] = "After",
2341 [UNIT_REFERENCES] = "References",
2342 [UNIT_REFERENCED_BY] = "ReferencedBy",
2343 [UNIT_ON_FAILURE] = "OnFailure"
2346 DEFINE_STRING_TABLE_LOOKUP(unit_dependency, UnitDependency);