1 /*-*- Mode: C; c-basic-offset: 8 -*-*/
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/>.
25 #include <sys/epoll.h>
26 #include <sys/timerfd.h>
35 #include "load-fragment.h"
36 #include "load-dropin.h"
38 #include "unit-name.h"
39 #include "specifier.h"
40 #include "dbus-unit.h"
42 const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = {
43 [UNIT_SERVICE] = &service_vtable,
44 [UNIT_TIMER] = &timer_vtable,
45 [UNIT_SOCKET] = &socket_vtable,
46 [UNIT_TARGET] = &target_vtable,
47 [UNIT_DEVICE] = &device_vtable,
48 [UNIT_MOUNT] = &mount_vtable,
49 [UNIT_AUTOMOUNT] = &automount_vtable,
50 [UNIT_SNAPSHOT] = &snapshot_vtable,
51 [UNIT_SWAP] = &swap_vtable
54 Unit *unit_new(Manager *m) {
59 if (!(u = new0(Unit, 1)))
62 if (!(u->meta.names = set_new(string_hash_func, string_compare_func))) {
68 u->meta.type = _UNIT_TYPE_INVALID;
73 bool unit_has_name(Unit *u, const char *name) {
77 return !!set_get(u->meta.names, (char*) name);
80 int unit_add_name(Unit *u, const char *text) {
82 char *s = NULL, *i = NULL;
88 if (unit_name_is_template(text)) {
89 if (!u->meta.instance)
92 s = unit_name_replace_instance(text, u->meta.instance);
99 if (!unit_name_is_valid(s)) {
104 assert_se((t = unit_name_to_type(s)) >= 0);
106 if (u->meta.type != _UNIT_TYPE_INVALID && t != u->meta.type) {
111 if ((r = unit_name_to_instance(s, &i)) < 0)
114 if (i && unit_vtable[t]->no_instances)
117 if (u->meta.type != _UNIT_TYPE_INVALID && !streq_ptr(u->meta.instance, i)) {
122 if (unit_vtable[t]->no_alias &&
123 !set_isempty(u->meta.names) &&
124 !set_get(u->meta.names, s)) {
129 if (hashmap_size(u->meta.manager->units) >= MANAGER_MAX_NAMES) {
134 if ((r = set_put(u->meta.names, s)) < 0) {
140 if ((r = hashmap_put(u->meta.manager->units, s, u)) < 0) {
141 set_remove(u->meta.names, s);
145 if (u->meta.type == _UNIT_TYPE_INVALID) {
149 u->meta.instance = i;
151 LIST_PREPEND(Meta, units_per_type, u->meta.manager->units_per_type[t], &u->meta);
153 if (UNIT_VTABLE(u)->init)
154 UNIT_VTABLE(u)->init(u);
158 unit_add_to_dbus_queue(u);
168 int unit_choose_id(Unit *u, const char *name) {
174 if (unit_name_is_template(name)) {
176 if (!u->meta.instance)
179 if (!(t = unit_name_replace_instance(name, u->meta.instance)))
185 /* Selects one of the names of this unit as the id */
186 s = set_get(u->meta.names, (char*) name);
193 unit_add_to_dbus_queue(u);
198 int unit_set_description(Unit *u, const char *description) {
203 if (!(s = strdup(description)))
206 free(u->meta.description);
207 u->meta.description = s;
209 unit_add_to_dbus_queue(u);
213 bool unit_check_gc(Unit *u) {
216 if (UNIT_VTABLE(u)->no_gc)
222 if (unit_active_state(u) != UNIT_INACTIVE)
225 if (UNIT_VTABLE(u)->check_gc)
226 if (UNIT_VTABLE(u)->check_gc(u))
232 void unit_add_to_load_queue(Unit *u) {
234 assert(u->meta.type != _UNIT_TYPE_INVALID);
236 if (u->meta.load_state != UNIT_STUB || u->meta.in_load_queue)
239 LIST_PREPEND(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
240 u->meta.in_load_queue = true;
243 void unit_add_to_cleanup_queue(Unit *u) {
246 if (u->meta.in_cleanup_queue)
249 LIST_PREPEND(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
250 u->meta.in_cleanup_queue = true;
253 void unit_add_to_gc_queue(Unit *u) {
256 if (u->meta.in_gc_queue || u->meta.in_cleanup_queue)
259 if (unit_check_gc(u))
262 LIST_PREPEND(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
263 u->meta.in_gc_queue = true;
265 u->meta.manager->n_in_gc_queue ++;
267 if (u->meta.manager->gc_queue_timestamp <= 0)
268 u->meta.manager->gc_queue_timestamp = now(CLOCK_MONOTONIC);
271 void unit_add_to_dbus_queue(Unit *u) {
273 assert(u->meta.type != _UNIT_TYPE_INVALID);
275 if (u->meta.load_state == UNIT_STUB || u->meta.in_dbus_queue || set_isempty(u->meta.manager->subscribed))
278 LIST_PREPEND(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
279 u->meta.in_dbus_queue = true;
282 static void bidi_set_free(Unit *u, Set *s) {
288 /* Frees the set and makes sure we are dropped from the
289 * inverse pointers */
291 SET_FOREACH(other, s, i) {
294 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
295 set_remove(other->meta.dependencies[d], u);
297 unit_add_to_gc_queue(other);
303 void unit_free(Unit *u) {
310 bus_unit_send_removed_signal(u);
312 /* Detach from next 'bigger' objects */
313 SET_FOREACH(t, u->meta.names, i)
314 hashmap_remove_value(u->meta.manager->units, t, u);
316 if (u->meta.type != _UNIT_TYPE_INVALID)
317 LIST_REMOVE(Meta, units_per_type, u->meta.manager->units_per_type[u->meta.type], &u->meta);
319 if (u->meta.in_load_queue)
320 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
322 if (u->meta.in_dbus_queue)
323 LIST_REMOVE(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
325 if (u->meta.in_cleanup_queue)
326 LIST_REMOVE(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
328 if (u->meta.in_gc_queue) {
329 LIST_REMOVE(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
330 u->meta.manager->n_in_gc_queue--;
333 /* Free data and next 'smaller' objects */
335 job_free(u->meta.job);
337 if (u->meta.load_state != UNIT_STUB)
338 if (UNIT_VTABLE(u)->done)
339 UNIT_VTABLE(u)->done(u);
341 cgroup_bonding_free_list(u->meta.cgroup_bondings);
343 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
344 bidi_set_free(u, u->meta.dependencies[d]);
346 free(u->meta.description);
347 free(u->meta.fragment_path);
349 while ((t = set_steal_first(u->meta.names)))
351 set_free(u->meta.names);
353 free(u->meta.instance);
358 UnitActiveState unit_active_state(Unit *u) {
361 if (u->meta.load_state != UNIT_LOADED)
362 return UNIT_INACTIVE;
364 return UNIT_VTABLE(u)->active_state(u);
367 const char* unit_sub_state_to_string(Unit *u) {
370 return UNIT_VTABLE(u)->sub_state_to_string(u);
373 static void complete_move(Set **s, Set **other) {
381 set_move(*s, *other);
388 static void merge_names(Unit *u, Unit *other) {
395 complete_move(&u->meta.names, &other->meta.names);
397 while ((t = set_steal_first(other->meta.names)))
400 set_free(other->meta.names);
401 other->meta.names = NULL;
402 other->meta.id = NULL;
404 SET_FOREACH(t, u->meta.names, i)
405 assert_se(hashmap_replace(u->meta.manager->units, t, u) == 0);
408 static void merge_dependencies(Unit *u, Unit *other, UnitDependency d) {
415 assert(d < _UNIT_DEPENDENCY_MAX);
417 SET_FOREACH(back, other->meta.dependencies[d], i) {
420 for (k = 0; k < _UNIT_DEPENDENCY_MAX; k++)
421 if ((r = set_remove_and_put(back->meta.dependencies[k], other, u)) < 0) {
424 set_remove(back->meta.dependencies[k], other);
426 assert(r == -ENOENT);
430 complete_move(&u->meta.dependencies[d], &other->meta.dependencies[d]);
432 set_free(other->meta.dependencies[d]);
433 other->meta.dependencies[d] = NULL;
436 int unit_merge(Unit *u, Unit *other) {
441 assert(u->meta.manager == other->meta.manager);
442 assert(u->meta.type != _UNIT_TYPE_INVALID);
444 other = unit_follow_merge(other);
449 if (u->meta.type != other->meta.type)
452 if (!streq_ptr(u->meta.instance, other->meta.instance))
455 if (other->meta.load_state != UNIT_STUB &&
456 other->meta.load_state != UNIT_FAILED)
462 if (unit_active_state(other) != UNIT_INACTIVE)
466 merge_names(u, other);
468 /* Merge dependencies */
469 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
470 merge_dependencies(u, other, d);
472 other->meta.load_state = UNIT_MERGED;
473 other->meta.merged_into = u;
475 /* If there is still some data attached to the other node, we
476 * don't need it anymore, and can free it. */
477 if (other->meta.load_state != UNIT_STUB)
478 if (UNIT_VTABLE(other)->done)
479 UNIT_VTABLE(other)->done(other);
481 unit_add_to_dbus_queue(u);
482 unit_add_to_cleanup_queue(other);
487 int unit_merge_by_name(Unit *u, const char *name) {
495 if (unit_name_is_template(name)) {
496 if (!u->meta.instance)
499 if (!(s = unit_name_replace_instance(name, u->meta.instance)))
505 if (!(other = manager_get_unit(u->meta.manager, name)))
506 r = unit_add_name(u, name);
508 r = unit_merge(u, other);
514 Unit* unit_follow_merge(Unit *u) {
517 while (u->meta.load_state == UNIT_MERGED)
518 assert_se(u = u->meta.merged_into);
523 int unit_add_exec_dependencies(Unit *u, ExecContext *c) {
529 if (c->std_output != EXEC_OUTPUT_KERNEL && c->std_output != EXEC_OUTPUT_SYSLOG)
532 /* If syslog or kernel logging is requested, make sure our own
533 * logging daemon is run first. */
535 if ((r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
538 if (u->meta.manager->running_as != MANAGER_SESSION)
539 if ((r = unit_add_dependency_by_name(u, UNIT_REQUIRES, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
545 const char *unit_description(Unit *u) {
548 if (u->meta.description)
549 return u->meta.description;
554 void unit_dump(Unit *u, FILE *f, const char *prefix) {
562 timestamp1[FORMAT_TIMESTAMP_MAX],
563 timestamp2[FORMAT_TIMESTAMP_MAX],
564 timestamp3[FORMAT_TIMESTAMP_MAX],
565 timestamp4[FORMAT_TIMESTAMP_MAX];
568 assert(u->meta.type >= 0);
572 p2 = strappend(prefix, "\t");
573 prefix2 = p2 ? p2 : prefix;
577 "%s\tDescription: %s\n"
579 "%s\tUnit Load State: %s\n"
580 "%s\tUnit Active State: %s\n"
581 "%s\tInactive Exit Timestamp: %s\n"
582 "%s\tActive Enter Timestamp: %s\n"
583 "%s\tActive Exit Timestamp: %s\n"
584 "%s\tInactive Enter Timestamp: %s\n"
585 "%s\tGC Check Good: %s\n",
587 prefix, unit_description(u),
588 prefix, strna(u->meta.instance),
589 prefix, unit_load_state_to_string(u->meta.load_state),
590 prefix, unit_active_state_to_string(unit_active_state(u)),
591 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->meta.inactive_exit_timestamp)),
592 prefix, strna(format_timestamp(timestamp2, sizeof(timestamp2), u->meta.active_enter_timestamp)),
593 prefix, strna(format_timestamp(timestamp3, sizeof(timestamp3), u->meta.active_exit_timestamp)),
594 prefix, strna(format_timestamp(timestamp4, sizeof(timestamp4), u->meta.inactive_enter_timestamp)),
595 prefix, yes_no(unit_check_gc(u)));
597 SET_FOREACH(t, u->meta.names, i)
598 fprintf(f, "%s\tName: %s\n", prefix, t);
600 if (u->meta.fragment_path)
601 fprintf(f, "%s\tFragment Path: %s\n", prefix, u->meta.fragment_path);
603 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
606 SET_FOREACH(other, u->meta.dependencies[d], i)
607 fprintf(f, "%s\t%s: %s\n", prefix, unit_dependency_to_string(d), other->meta.id);
610 if (u->meta.load_state == UNIT_LOADED) {
612 "%s\tRecursive Stop: %s\n"
613 "%s\tStop When Unneeded: %s\n",
614 prefix, yes_no(u->meta.recursive_stop),
615 prefix, yes_no(u->meta.stop_when_unneeded));
617 LIST_FOREACH(by_unit, b, u->meta.cgroup_bondings)
618 fprintf(f, "%s\tControlGroup: %s:%s\n",
619 prefix, b->controller, b->path);
621 if (UNIT_VTABLE(u)->dump)
622 UNIT_VTABLE(u)->dump(u, f, prefix2);
624 } else if (u->meta.load_state == UNIT_MERGED)
626 "%s\tMerged into: %s\n",
627 prefix, u->meta.merged_into->meta.id);
630 job_dump(u->meta.job, f, prefix2);
635 /* Common implementation for multiple backends */
636 int unit_load_fragment_and_dropin(Unit *u) {
641 /* Load a .service file */
642 if ((r = unit_load_fragment(u)) < 0)
645 if (u->meta.load_state == UNIT_STUB)
648 /* Load drop-in directory data */
649 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
655 /* Common implementation for multiple backends */
656 int unit_load_fragment_and_dropin_optional(Unit *u) {
661 /* Same as unit_load_fragment_and_dropin(), but whether
662 * something can be loaded or not doesn't matter. */
664 /* Load a .service file */
665 if ((r = unit_load_fragment(u)) < 0)
668 if (u->meta.load_state == UNIT_STUB)
669 u->meta.load_state = UNIT_LOADED;
671 /* Load drop-in directory data */
672 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
678 /* Common implementation for multiple backends */
679 int unit_load_nop(Unit *u) {
682 if (u->meta.load_state == UNIT_STUB)
683 u->meta.load_state = UNIT_LOADED;
688 int unit_load(Unit *u) {
693 if (u->meta.in_load_queue) {
694 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
695 u->meta.in_load_queue = false;
698 if (u->meta.type == _UNIT_TYPE_INVALID)
701 if (u->meta.load_state != UNIT_STUB)
704 if (UNIT_VTABLE(u)->load)
705 if ((r = UNIT_VTABLE(u)->load(u)) < 0)
708 if (u->meta.load_state == UNIT_STUB) {
713 assert((u->meta.load_state != UNIT_MERGED) == !u->meta.merged_into);
715 unit_add_to_dbus_queue(unit_follow_merge(u));
716 unit_add_to_gc_queue(u);
721 u->meta.load_state = UNIT_FAILED;
722 unit_add_to_dbus_queue(u);
724 log_debug("Failed to load configuration for %s: %s", u->meta.id, strerror(-r));
730 * -EBADR: This unit type does not support starting.
731 * -EALREADY: Unit is already started.
732 * -EAGAIN: An operation is already in progress. Retry later.
734 int unit_start(Unit *u) {
735 UnitActiveState state;
739 /* If this is already (being) started, then this will
740 * succeed. Note that this will even succeed if this unit is
741 * not startable by the user. This is relied on to detect when
742 * we need to wait for units and when waiting is finished. */
743 state = unit_active_state(u);
744 if (UNIT_IS_ACTIVE_OR_RELOADING(state))
747 /* If it is stopped, but we cannot start it, then fail */
748 if (!UNIT_VTABLE(u)->start)
751 /* We don't suppress calls to ->start() here when we are
752 * already starting, to allow this request to be used as a
753 * "hurry up" call, for example when the unit is in some "auto
754 * restart" state where it waits for a holdoff timer to elapse
755 * before it will start again. */
757 unit_add_to_dbus_queue(u);
758 return UNIT_VTABLE(u)->start(u);
761 bool unit_can_start(Unit *u) {
764 return !!UNIT_VTABLE(u)->start;
768 * -EBADR: This unit type does not support stopping.
769 * -EALREADY: Unit is already stopped.
770 * -EAGAIN: An operation is already in progress. Retry later.
772 int unit_stop(Unit *u) {
773 UnitActiveState state;
777 state = unit_active_state(u);
778 if (state == UNIT_INACTIVE)
781 if (!UNIT_VTABLE(u)->stop)
784 unit_add_to_dbus_queue(u);
785 return UNIT_VTABLE(u)->stop(u);
789 * -EBADR: This unit type does not support reloading.
790 * -ENOEXEC: Unit is not started.
791 * -EAGAIN: An operation is already in progress. Retry later.
793 int unit_reload(Unit *u) {
794 UnitActiveState state;
798 if (!unit_can_reload(u))
801 state = unit_active_state(u);
802 if (unit_active_state(u) == UNIT_ACTIVE_RELOADING)
805 if (unit_active_state(u) != UNIT_ACTIVE)
808 unit_add_to_dbus_queue(u);
809 return UNIT_VTABLE(u)->reload(u);
812 bool unit_can_reload(Unit *u) {
815 if (!UNIT_VTABLE(u)->reload)
818 if (!UNIT_VTABLE(u)->can_reload)
821 return UNIT_VTABLE(u)->can_reload(u);
824 static void unit_check_uneeded(Unit *u) {
830 /* If this service shall be shut down when unneeded then do
833 if (!u->meta.stop_when_unneeded)
836 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
839 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
840 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
843 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
844 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
847 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTED_BY], i)
848 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
851 log_debug("Service %s is not needed anymore. Stopping.", u->meta.id);
853 /* Ok, nobody needs us anymore. Sniff. Then let's commit suicide */
854 manager_add_job(u->meta.manager, JOB_STOP, u, JOB_FAIL, true, NULL);
857 static void retroactively_start_dependencies(Unit *u) {
862 assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)));
864 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
865 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
866 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL);
868 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
869 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
870 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL);
872 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
873 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
874 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL);
876 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
877 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
878 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL);
880 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTS], i)
881 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
882 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL);
885 static void retroactively_stop_dependencies(Unit *u) {
890 assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)));
892 if (u->meta.recursive_stop) {
893 /* Pull down units need us recursively if enabled */
894 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
895 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
896 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL);
899 /* Garbage collect services that might not be needed anymore, if enabled */
900 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
901 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
902 unit_check_uneeded(other);
903 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
904 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
905 unit_check_uneeded(other);
906 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
907 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
908 unit_check_uneeded(other);
909 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
910 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
911 unit_check_uneeded(other);
912 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE_OVERRIDABLE], i)
913 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
914 unit_check_uneeded(other);
917 void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns) {
918 bool unexpected = false;
922 assert(os < _UNIT_ACTIVE_STATE_MAX);
923 assert(ns < _UNIT_ACTIVE_STATE_MAX);
925 /* Note that this is called for all low-level state changes,
926 * even if they might map to the same high-level
927 * UnitActiveState! That means that ns == os is OK an expected
928 * behaviour here. For example: if a mount point is remounted
929 * this function will be called too and the utmp code below
932 ts = now(CLOCK_REALTIME);
934 if (os == UNIT_INACTIVE && ns != UNIT_INACTIVE)
935 u->meta.inactive_exit_timestamp = ts;
936 else if (os != UNIT_INACTIVE && ns == UNIT_INACTIVE)
937 u->meta.inactive_enter_timestamp = ts;
939 if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns))
940 u->meta.active_enter_timestamp = ts;
941 else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns))
942 u->meta.active_exit_timestamp = ts;
946 if (u->meta.job->state == JOB_WAITING)
948 /* So we reached a different state for this
949 * job. Let's see if we can run it now if it
950 * failed previously due to EAGAIN. */
951 job_add_to_run_queue(u->meta.job);
954 assert(u->meta.job->state == JOB_RUNNING);
956 /* Let's check whether this state change
957 * constitutes a finished job, or maybe
958 * cotradicts a running job and hence needs to
959 * invalidate jobs. */
961 switch (u->meta.job->type) {
964 case JOB_VERIFY_ACTIVE:
966 if (UNIT_IS_ACTIVE_OR_RELOADING(ns))
967 job_finish_and_invalidate(u->meta.job, true);
968 else if (ns != UNIT_ACTIVATING) {
970 job_finish_and_invalidate(u->meta.job, false);
976 case JOB_RELOAD_OR_START:
978 if (ns == UNIT_ACTIVE)
979 job_finish_and_invalidate(u->meta.job, true);
980 else if (ns != UNIT_ACTIVATING && ns != UNIT_ACTIVE_RELOADING) {
982 job_finish_and_invalidate(u->meta.job, false);
989 case JOB_TRY_RESTART:
991 if (ns == UNIT_INACTIVE)
992 job_finish_and_invalidate(u->meta.job, true);
993 else if (ns != UNIT_DEACTIVATING) {
995 job_finish_and_invalidate(u->meta.job, false);
1001 assert_not_reached("Job type unknown");
1006 /* If this state change happened without being requested by a
1007 * job, then let's retroactively start or stop dependencies */
1010 if (UNIT_IS_INACTIVE_OR_DEACTIVATING(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns))
1011 retroactively_start_dependencies(u);
1012 else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns))
1013 retroactively_stop_dependencies(u);
1016 /* Some names are special */
1017 if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) {
1018 if (unit_has_name(u, SPECIAL_DBUS_SERVICE)) {
1019 /* The bus just might have become available,
1020 * hence try to connect to it, if we aren't
1022 bus_init_system(u->meta.manager);
1023 bus_init_api(u->meta.manager);
1026 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1027 /* The syslog daemon just might have become
1028 * available, hence try to connect to it, if
1029 * we aren't yet connected. */
1032 if (u->meta.type == UNIT_MOUNT)
1033 /* Another directory became available, let's
1034 * check if that is enough to write our utmp
1036 manager_write_utmp_reboot(u->meta.manager);
1038 if (u->meta.type == UNIT_TARGET)
1039 /* A target got activated, maybe this is a runlevel? */
1040 manager_write_utmp_runlevel(u->meta.manager, u);
1042 } else if (!UNIT_IS_ACTIVE_OR_RELOADING(ns)) {
1044 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1045 /* The syslog daemon might just have
1046 * terminated, hence try to disconnect from
1050 /* We don't care about D-Bus here, since we'll get an
1051 * asynchronous notification for it anyway. */
1054 /* Maybe we finished startup and are now ready for being
1055 * stopped because unneeded? */
1056 unit_check_uneeded(u);
1058 unit_add_to_dbus_queue(u);
1059 unit_add_to_gc_queue(u);
1062 int unit_watch_fd(Unit *u, int fd, uint32_t events, Watch *w) {
1063 struct epoll_event ev;
1068 assert(w->type == WATCH_INVALID || (w->type == WATCH_FD && w->fd == fd && w->data.unit == u));
1074 if (epoll_ctl(u->meta.manager->epoll_fd,
1075 w->type == WATCH_INVALID ? EPOLL_CTL_ADD : EPOLL_CTL_MOD,
1087 void unit_unwatch_fd(Unit *u, Watch *w) {
1091 if (w->type == WATCH_INVALID)
1094 assert(w->type == WATCH_FD);
1095 assert(w->data.unit == u);
1096 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1099 w->type = WATCH_INVALID;
1100 w->data.unit = NULL;
1103 int unit_watch_pid(Unit *u, pid_t pid) {
1107 /* Watch a specific PID. We only support one unit watching
1108 * each PID for now. */
1110 return hashmap_put(u->meta.manager->watch_pids, UINT32_TO_PTR(pid), u);
1113 void unit_unwatch_pid(Unit *u, pid_t pid) {
1117 hashmap_remove_value(u->meta.manager->watch_pids, UINT32_TO_PTR(pid), u);
1120 int unit_watch_timer(Unit *u, usec_t delay, Watch *w) {
1121 struct itimerspec its;
1127 assert(w->type == WATCH_INVALID || (w->type == WATCH_TIMER && w->data.unit == u));
1129 /* This will try to reuse the old timer if there is one */
1131 if (w->type == WATCH_TIMER) {
1136 if ((fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK|TFD_CLOEXEC)) < 0)
1143 /* Set absolute time in the past, but not 0, since we
1144 * don't want to disarm the timer */
1145 its.it_value.tv_sec = 0;
1146 its.it_value.tv_nsec = 1;
1148 flags = TFD_TIMER_ABSTIME;
1150 timespec_store(&its.it_value, delay);
1154 /* This will also flush the elapse counter */
1155 if (timerfd_settime(fd, flags, &its, NULL) < 0)
1158 if (w->type == WATCH_INVALID) {
1159 struct epoll_event ev;
1163 ev.events = EPOLLIN;
1165 if (epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_ADD, fd, &ev) < 0)
1170 w->type = WATCH_TIMER;
1177 close_nointr_nofail(fd);
1182 void unit_unwatch_timer(Unit *u, Watch *w) {
1186 if (w->type == WATCH_INVALID)
1189 assert(w->type == WATCH_TIMER && w->data.unit == u);
1191 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1192 close_nointr_nofail(w->fd);
1195 w->type = WATCH_INVALID;
1196 w->data.unit = NULL;
1199 bool unit_job_is_applicable(Unit *u, JobType j) {
1201 assert(j >= 0 && j < _JOB_TYPE_MAX);
1205 case JOB_VERIFY_ACTIVE:
1211 case JOB_TRY_RESTART:
1212 return unit_can_start(u);
1215 return unit_can_reload(u);
1217 case JOB_RELOAD_OR_START:
1218 return unit_can_reload(u) && unit_can_start(u);
1221 assert_not_reached("Invalid job type");
1225 int unit_add_dependency(Unit *u, UnitDependency d, Unit *other, bool add_reference) {
1227 static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = {
1228 [UNIT_REQUIRES] = UNIT_REQUIRED_BY,
1229 [UNIT_REQUIRES_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1230 [UNIT_WANTS] = UNIT_WANTED_BY,
1231 [UNIT_REQUISITE] = UNIT_REQUIRED_BY,
1232 [UNIT_REQUISITE_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1233 [UNIT_REQUIRED_BY] = _UNIT_DEPENDENCY_INVALID,
1234 [UNIT_REQUIRED_BY_OVERRIDABLE] = _UNIT_DEPENDENCY_INVALID,
1235 [UNIT_WANTED_BY] = _UNIT_DEPENDENCY_INVALID,
1236 [UNIT_CONFLICTS] = UNIT_CONFLICTS,
1237 [UNIT_BEFORE] = UNIT_AFTER,
1238 [UNIT_AFTER] = UNIT_BEFORE,
1239 [UNIT_REFERENCES] = UNIT_REFERENCED_BY,
1240 [UNIT_REFERENCED_BY] = UNIT_REFERENCES
1242 int r, q = 0, v = 0, w = 0;
1245 assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX);
1246 assert(inverse_table[d] != _UNIT_DEPENDENCY_INVALID);
1249 /* We won't allow dependencies on ourselves. We will not
1250 * consider them an error however. */
1254 if (UNIT_VTABLE(u)->no_requires &&
1255 (d == UNIT_REQUIRES ||
1256 d == UNIT_REQUIRES_OVERRIDABLE ||
1257 d == UNIT_REQUISITE ||
1258 d == UNIT_REQUISITE_OVERRIDABLE)) {
1262 if ((r = set_ensure_allocated(&u->meta.dependencies[d], trivial_hash_func, trivial_compare_func)) < 0 ||
1263 (r = set_ensure_allocated(&other->meta.dependencies[inverse_table[d]], trivial_hash_func, trivial_compare_func)) < 0)
1267 if ((r = set_ensure_allocated(&u->meta.dependencies[UNIT_REFERENCES], trivial_hash_func, trivial_compare_func)) < 0 ||
1268 (r = set_ensure_allocated(&other->meta.dependencies[UNIT_REFERENCED_BY], trivial_hash_func, trivial_compare_func)) < 0)
1271 if ((q = set_put(u->meta.dependencies[d], other)) < 0)
1274 if ((v = set_put(other->meta.dependencies[inverse_table[d]], u)) < 0) {
1279 if (add_reference) {
1280 if ((w = set_put(u->meta.dependencies[UNIT_REFERENCES], other)) < 0) {
1285 if ((r = set_put(other->meta.dependencies[UNIT_REFERENCED_BY], u)) < 0)
1289 unit_add_to_dbus_queue(u);
1294 set_remove(u->meta.dependencies[d], other);
1297 set_remove(other->meta.dependencies[inverse_table[d]], u);
1300 set_remove(u->meta.dependencies[UNIT_REFERENCES], other);
1305 static const char *resolve_template(Unit *u, const char *name, const char*path, char **p) {
1309 assert(name || path);
1312 name = file_name_from_path(path);
1314 if (!unit_name_is_template(name)) {
1319 if (u->meta.instance)
1320 s = unit_name_replace_instance(name, u->meta.instance);
1324 if (!(i = unit_name_to_prefix(u->meta.id)))
1327 s = unit_name_replace_instance(name, i);
1338 int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1344 assert(name || path);
1346 if (!(name = resolve_template(u, name, path, &s)))
1349 if ((r = manager_load_unit(u->meta.manager, name, path, &other)) < 0)
1352 r = unit_add_dependency(u, d, other, add_reference);
1359 int unit_add_dependency_by_name_inverse(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1365 assert(name || path);
1367 if (!(name = resolve_template(u, name, path, &s)))
1370 if ((r = manager_load_unit(u->meta.manager, name, path, &other)) < 0)
1373 r = unit_add_dependency(other, d, u, add_reference);
1380 int set_unit_path(const char *p) {
1384 /* This is mostly for debug purposes */
1386 if (path_is_absolute(p)) {
1387 if (!(c = strdup(p)))
1390 if (!(cwd = get_current_dir_name()))
1393 r = asprintf(&c, "%s/%s", cwd, p);
1400 if (setenv("SYSTEMD_UNIT_PATH", c, 0) < 0) {
1409 char *unit_dbus_path(Unit *u) {
1414 if (!(e = bus_path_escape(u->meta.id)))
1417 if (asprintf(&p, "/org/freedesktop/systemd1/unit/%s", e) < 0) {
1426 int unit_add_cgroup(Unit *u, CGroupBonding *b) {
1434 /* Ensure this hasn't been added yet */
1437 l = hashmap_get(u->meta.manager->cgroup_bondings, b->path);
1438 LIST_PREPEND(CGroupBonding, by_path, l, b);
1440 if ((r = hashmap_replace(u->meta.manager->cgroup_bondings, b->path, l)) < 0) {
1441 LIST_REMOVE(CGroupBonding, by_path, l, b);
1445 LIST_PREPEND(CGroupBonding, by_unit, u->meta.cgroup_bondings, b);
1451 static char *default_cgroup_path(Unit *u) {
1457 if (u->meta.instance) {
1460 if (!(t = unit_name_template(u->meta.id)))
1463 r = asprintf(&p, "%s/%s/%s", u->meta.manager->cgroup_hierarchy, t, u->meta.instance);
1466 r = asprintf(&p, "%s/%s", u->meta.manager->cgroup_hierarchy, u->meta.id);
1468 return r < 0 ? NULL : p;
1471 int unit_add_cgroup_from_text(Unit *u, const char *name) {
1473 char *controller = NULL, *path = NULL;
1474 CGroupBonding *b = NULL;
1480 /* Detect controller name */
1481 n = strcspn(name, ":");
1484 (name[n] == ':' && name[n+1] == 0)) {
1486 /* Only controller name, no path? */
1488 if (!(path = default_cgroup_path(u)))
1494 /* Controller name, and path. */
1497 if (!path_is_absolute(p))
1500 if (!(path = strdup(p)))
1505 controller = strndup(name, n);
1507 controller = strdup(u->meta.manager->cgroup_controller);
1514 if (cgroup_bonding_find_list(u->meta.cgroup_bondings, controller)) {
1519 if (!(b = new0(CGroupBonding, 1))) {
1524 b->controller = controller;
1527 b->clean_up = false;
1529 if ((r = unit_add_cgroup(u, b)) < 0)
1542 int unit_add_default_cgroup(Unit *u) {
1548 /* Adds in the default cgroup data, if it wasn't specified yet */
1550 if (unit_get_default_cgroup(u))
1553 if (!(b = new0(CGroupBonding, 1)))
1556 if (!(b->controller = strdup(u->meta.manager->cgroup_controller)))
1559 if (!(b->path = default_cgroup_path(u)))
1565 if ((r = unit_add_cgroup(u, b)) < 0)
1572 free(b->controller);
1578 CGroupBonding* unit_get_default_cgroup(Unit *u) {
1581 return cgroup_bonding_find_list(u->meta.cgroup_bondings, u->meta.manager->cgroup_controller);
1584 int unit_load_related_unit(Unit *u, const char *type, Unit **_found) {
1592 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1595 assert(!unit_has_name(u, t));
1597 r = manager_load_unit(u->meta.manager, t, NULL, _found);
1600 assert(r < 0 || *_found != u);
1605 int unit_get_related_unit(Unit *u, const char *type, Unit **_found) {
1613 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1616 assert(!unit_has_name(u, t));
1618 found = manager_get_unit(u->meta.manager, t);
1628 static char *specifier_prefix_and_instance(char specifier, void *data, void *userdata) {
1632 return unit_name_to_prefix_and_instance(u->meta.id);
1635 static char *specifier_prefix(char specifier, void *data, void *userdata) {
1639 return unit_name_to_prefix(u->meta.id);
1642 static char *specifier_prefix_unescaped(char specifier, void *data, void *userdata) {
1648 if (!(p = unit_name_to_prefix(u->meta.id)))
1651 r = unit_name_unescape(p);
1657 static char *specifier_instance_unescaped(char specifier, void *data, void *userdata) {
1661 if (u->meta.instance)
1662 return unit_name_unescape(u->meta.instance);
1667 char *unit_name_printf(Unit *u, const char* format) {
1670 * This will use the passed string as format string and
1671 * replace the following specifiers:
1673 * %n: the full id of the unit (foo@bar.waldo)
1674 * %N: the id of the unit without the suffix (foo@bar)
1675 * %p: the prefix (foo)
1676 * %i: the instance (bar)
1679 const Specifier table[] = {
1680 { 'n', specifier_string, u->meta.id },
1681 { 'N', specifier_prefix_and_instance, NULL },
1682 { 'p', specifier_prefix, NULL },
1683 { 'i', specifier_string, u->meta.instance },
1690 return specifier_printf(format, table, u);
1693 char *unit_full_printf(Unit *u, const char *format) {
1695 /* This is similar to unit_name_printf() but also supports
1698 const Specifier table[] = {
1699 { 'n', specifier_string, u->meta.id },
1700 { 'N', specifier_prefix_and_instance, NULL },
1701 { 'p', specifier_prefix, NULL },
1702 { 'P', specifier_prefix_unescaped, NULL },
1703 { 'i', specifier_string, u->meta.instance },
1704 { 'I', specifier_instance_unescaped, NULL },
1711 return specifier_printf(format, table, u);
1714 char **unit_full_printf_strv(Unit *u, char **l) {
1718 /* Applies unit_full_printf to every entry in l */
1723 if (!(r = new(char*, n+1)))
1726 for (i = l, j = r; *i; i++, j++)
1727 if (!(*j = unit_full_printf(u, *i)))
1743 int unit_watch_bus_name(Unit *u, const char *name) {
1747 /* Watch a specific name on the bus. We only support one unit
1748 * watching each name for now. */
1750 return hashmap_put(u->meta.manager->watch_bus, name, u);
1753 void unit_unwatch_bus_name(Unit *u, const char *name) {
1757 hashmap_remove_value(u->meta.manager->watch_bus, name, u);
1760 bool unit_can_serialize(Unit *u) {
1763 return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item;
1766 int unit_serialize(Unit *u, FILE *f, FDSet *fds) {
1773 if (!unit_can_serialize(u))
1776 if ((r = UNIT_VTABLE(u)->serialize(u, f, fds)) < 0)
1784 void unit_serialize_item_format(Unit *u, FILE *f, const char *key, const char *format, ...) {
1795 va_start(ap, format);
1796 vfprintf(f, format, ap);
1802 void unit_serialize_item(Unit *u, FILE *f, const char *key, const char *value) {
1808 fprintf(f, "%s=%s\n", key, value);
1811 int unit_deserialize(Unit *u, FILE *f, FDSet *fds) {
1818 if (!unit_can_serialize(u))
1822 char line[1024], *l, *v;
1825 if (!fgets(line, sizeof(line), f)) {
1837 k = strcspn(l, "=");
1845 if ((r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds)) < 0)
1850 int unit_add_node_link(Unit *u, const char *what, bool wants) {
1860 /* Adds in links to the device node that this unit is based on */
1862 if (!path_startswith(what, "/dev/") && !path_startswith(what, "/sys/"))
1865 if (!(e = unit_name_build_escape(what+1, NULL, ".device")))
1868 r = manager_load_unit(u->meta.manager, e, NULL, &device);
1874 if ((r = unit_add_dependency(u, UNIT_AFTER, device, true)) < 0)
1877 if ((r = unit_add_dependency(u, UNIT_REQUIRES, device, true)) < 0)
1881 if ((r = unit_add_dependency(device, UNIT_WANTS, u, false)) < 0)
1887 static const char* const unit_type_table[_UNIT_TYPE_MAX] = {
1888 [UNIT_SERVICE] = "service",
1889 [UNIT_TIMER] = "timer",
1890 [UNIT_SOCKET] = "socket",
1891 [UNIT_TARGET] = "target",
1892 [UNIT_DEVICE] = "device",
1893 [UNIT_MOUNT] = "mount",
1894 [UNIT_AUTOMOUNT] = "automount",
1895 [UNIT_SNAPSHOT] = "snapshot",
1896 [UNIT_SWAP] = "swap"
1899 DEFINE_STRING_TABLE_LOOKUP(unit_type, UnitType);
1901 static const char* const unit_load_state_table[_UNIT_LOAD_STATE_MAX] = {
1902 [UNIT_STUB] = "stub",
1903 [UNIT_LOADED] = "loaded",
1904 [UNIT_FAILED] = "failed",
1905 [UNIT_MERGED] = "merged"
1908 DEFINE_STRING_TABLE_LOOKUP(unit_load_state, UnitLoadState);
1910 static const char* const unit_active_state_table[_UNIT_ACTIVE_STATE_MAX] = {
1911 [UNIT_ACTIVE] = "active",
1912 [UNIT_INACTIVE] = "inactive",
1913 [UNIT_ACTIVATING] = "activating",
1914 [UNIT_DEACTIVATING] = "deactivating"
1917 DEFINE_STRING_TABLE_LOOKUP(unit_active_state, UnitActiveState);
1919 static const char* const unit_dependency_table[_UNIT_DEPENDENCY_MAX] = {
1920 [UNIT_REQUIRES] = "Requires",
1921 [UNIT_REQUIRES_OVERRIDABLE] = "RequiresOverridable",
1922 [UNIT_WANTS] = "Wants",
1923 [UNIT_REQUISITE] = "Requisite",
1924 [UNIT_REQUISITE_OVERRIDABLE] = "RequisiteOverridable",
1925 [UNIT_REQUIRED_BY] = "RequiredBy",
1926 [UNIT_REQUIRED_BY_OVERRIDABLE] = "RequiredByOverridable",
1927 [UNIT_WANTED_BY] = "WantedBy",
1928 [UNIT_CONFLICTS] = "Conflicts",
1929 [UNIT_BEFORE] = "Before",
1930 [UNIT_AFTER] = "After",
1931 [UNIT_REFERENCES] = "References",
1932 [UNIT_REFERENCED_BY] = "ReferencedBy"
1935 DEFINE_STRING_TABLE_LOOKUP(unit_dependency, UnitDependency);
1937 static const char* const kill_mode_table[_KILL_MODE_MAX] = {
1938 [KILL_CONTROL_GROUP] = "control-group",
1939 [KILL_PROCESS_GROUP] = "process-group",
1940 [KILL_PROCESS] = "process",
1941 [KILL_NONE] = "none"
1944 DEFINE_STRING_TABLE_LOOKUP(kill_mode, KillMode);