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>
27 #include <sys/signalfd.h>
31 #include <sys/reboot.h>
32 #include <sys/ioctl.h>
34 #include <libcgroup.h>
42 #include "ratelimit.h"
44 #include "mount-setup.h"
46 static int manager_setup_signals(Manager *m) {
48 struct epoll_event ev;
52 assert_se(sigemptyset(&mask) == 0);
53 assert_se(sigaddset(&mask, SIGCHLD) == 0);
54 assert_se(sigaddset(&mask, SIGINT) == 0); /* Kernel sends us this on control-alt-del */
55 assert_se(sigaddset(&mask, SIGWINCH) == 0); /* Kernel sends us this on kbrequest (alt-arrowup) */
56 assert_se(sigaddset(&mask, SIGTERM) == 0);
57 assert_se(sigaddset(&mask, SIGHUP) == 0);
58 assert_se(sigaddset(&mask, SIGUSR1) == 0);
59 assert_se(sigaddset(&mask, SIGUSR2) == 0);
60 assert_se(sigaddset(&mask, SIGPIPE) == 0);
61 assert_se(sigaddset(&mask, SIGPWR) == 0);
62 assert_se(sigaddset(&mask, SIGTTIN) == 0);
63 assert_se(sigprocmask(SIG_SETMASK, &mask, NULL) == 0);
65 m->signal_watch.type = WATCH_SIGNAL;
66 if ((m->signal_watch.fd = signalfd(-1, &mask, SFD_NONBLOCK|SFD_CLOEXEC)) < 0)
71 ev.data.ptr = &m->signal_watch;
73 if (epoll_ctl(m->epoll_fd, EPOLL_CTL_ADD, m->signal_watch.fd, &ev) < 0)
76 if (m->running_as == MANAGER_INIT) {
77 /* Enable that we get SIGINT on control-alt-del */
78 if (reboot(RB_DISABLE_CAD) < 0)
79 log_warning("Failed to enable ctrl-alt-del handling: %s", strerror(errno));
81 /* Enable that we get SIGWINCH on kbrequest */
82 if (ioctl(0, KDSIGACCEPT, SIGWINCH) < 0)
83 log_warning("Failed to enable kbrequest handling: %s", strerror(errno));
89 static char** session_dirs(void) {
91 char *config_home = NULL, *data_home = NULL;
92 char **config_dirs = NULL, **data_dirs = NULL;
95 /* Implement the mechanisms defined in
97 * http://standards.freedesktop.org/basedir-spec/basedir-spec-0.6.html
99 * We look in both the config and the data dirs because we
100 * want to encourage that distributors ship their unit files
101 * as data, and allow overriding as configuration.
104 home = getenv("HOME");
106 if ((e = getenv("XDG_CONFIG_HOME"))) {
107 if (asprintf(&config_home, "%s/systemd/session", e) < 0)
111 if (asprintf(&config_home, "%s/.config/systemd/session", home) < 0)
115 if ((e = getenv("XDG_CONFIG_DIRS")))
116 config_dirs = strv_split(e, ":");
118 config_dirs = strv_new("/etc/xdg", NULL);
123 if ((e = getenv("XDG_DATA_HOME"))) {
124 if (asprintf(&data_home, "%s/systemd/session", e) < 0)
128 if (asprintf(&data_home, "%s/.local/share/systemd/session", home) < 0)
132 if ((e = getenv("XDG_DATA_DIRS")))
133 data_dirs = strv_split(e, ":");
135 data_dirs = strv_new("/usr/local/share", "/usr/share", NULL);
140 /* Now merge everything we found. */
142 if (!(t = strv_append(r, config_home)))
148 if (!(t = strv_merge_concat(r, config_dirs, "/systemd/session")))
153 if (!(t = strv_append(r, SESSION_CONFIG_UNIT_PATH)))
159 if (!(t = strv_append(r, data_home)))
165 if (!(t = strv_merge_concat(r, data_dirs, "/systemd/session")))
170 if (!(t = strv_append(r, SESSION_DATA_UNIT_PATH)))
175 if (!strv_path_make_absolute_cwd(r))
180 strv_free(config_dirs);
182 strv_free(data_dirs);
192 static int manager_find_paths(Manager *m) {
198 /* First priority is whatever has been passed to us via env
200 if ((e = getenv("SYSTEMD_UNIT_PATH")))
201 if (!(m->unit_path = split_path_and_make_absolute(e)))
204 if (strv_isempty(m->unit_path)) {
206 /* Nothing is set, so let's figure something out. */
207 strv_free(m->unit_path);
209 if (m->running_as == MANAGER_SESSION) {
210 if (!(m->unit_path = session_dirs()))
213 if (!(m->unit_path = strv_new(
214 SYSTEM_CONFIG_UNIT_PATH, /* /etc/systemd/system/ */
215 SYSTEM_DATA_UNIT_PATH, /* /lib/systemd/system/ */
220 if (m->running_as == MANAGER_INIT) {
221 /* /etc/init.d/ compativility does not matter to users */
223 if ((e = getenv("SYSTEMD_SYSVINIT_PATH")))
224 if (!(m->sysvinit_path = split_path_and_make_absolute(e)))
227 if (strv_isempty(m->sysvinit_path)) {
228 strv_free(m->sysvinit_path);
230 if (!(m->sysvinit_path = strv_new(
231 SYSTEM_SYSVINIT_PATH, /* /etc/init.d/ */
236 if ((e = getenv("SYSTEMD_SYSVRCND_PATH")))
237 if (!(m->sysvrcnd_path = split_path_and_make_absolute(e)))
240 if (strv_isempty(m->sysvrcnd_path)) {
241 strv_free(m->sysvrcnd_path);
243 if (!(m->sysvrcnd_path = strv_new(
244 SYSTEM_SYSVRCND_PATH, /* /etc/rcN.d/ */
250 strv_uniq(m->unit_path);
251 strv_uniq(m->sysvinit_path);
252 strv_uniq(m->sysvrcnd_path);
254 assert(!strv_isempty(m->unit_path));
255 if (!(t = strv_join(m->unit_path, "\n\t")))
257 log_debug("Looking for unit files in:\n\t%s", t);
260 if (!strv_isempty(m->sysvinit_path)) {
262 if (!(t = strv_join(m->sysvinit_path, "\n\t")))
265 log_debug("Looking for SysV init scripts in:\n\t%s", t);
268 log_debug("Ignoring SysV init scripts.");
270 if (!strv_isempty(m->sysvrcnd_path)) {
272 if (!(t = strv_join(m->sysvrcnd_path, "\n\t")))
275 log_debug("Looking for SysV rcN.d links in:\n\t%s", t);
278 log_debug("Ignoring SysV rcN.d links.");
283 int manager_new(ManagerRunningAs running_as, Manager **_m) {
288 assert(running_as >= 0);
289 assert(running_as < _MANAGER_RUNNING_AS_MAX);
291 if (!(m = new0(Manager, 1)))
294 m->running_as = running_as;
295 m->signal_watch.fd = m->mount_watch.fd = m->udev_watch.fd = m->epoll_fd = -1;
296 m->current_job_id = 1; /* start as id #1, so that we can leave #0 around as "null-like" value */
298 if (!(m->units = hashmap_new(string_hash_func, string_compare_func)))
301 if (!(m->jobs = hashmap_new(trivial_hash_func, trivial_compare_func)))
304 if (!(m->transaction_jobs = hashmap_new(trivial_hash_func, trivial_compare_func)))
307 if (!(m->watch_pids = hashmap_new(trivial_hash_func, trivial_compare_func)))
310 if (!(m->cgroup_bondings = hashmap_new(string_hash_func, string_compare_func)))
313 if ((m->epoll_fd = epoll_create1(EPOLL_CLOEXEC)) < 0)
316 if ((r = manager_find_paths(m)) < 0)
319 if ((r = manager_setup_signals(m)) < 0)
322 if ((r = manager_setup_cgroup(m)) < 0)
325 /* Try to connect to the busses, if possible. */
326 if ((r = bus_init_system(m)) < 0 ||
327 (r = bus_init_api(m)) < 0)
338 static unsigned manager_dispatch_cleanup_queue(Manager *m) {
344 while ((meta = m->cleanup_queue)) {
345 assert(meta->in_cleanup_queue);
347 unit_free(UNIT(meta));
354 void manager_free(Manager *m) {
361 while ((j = hashmap_first(m->transaction_jobs)))
364 while ((u = hashmap_first(m->units)))
367 manager_dispatch_cleanup_queue(m);
369 for (c = 0; c < _UNIT_TYPE_MAX; c++)
370 if (unit_vtable[c]->shutdown)
371 unit_vtable[c]->shutdown(m);
373 manager_shutdown_cgroup(m);
378 hashmap_free(m->units);
379 hashmap_free(m->jobs);
380 hashmap_free(m->transaction_jobs);
381 hashmap_free(m->watch_pids);
383 if (m->epoll_fd >= 0)
384 close_nointr(m->epoll_fd);
385 if (m->signal_watch.fd >= 0)
386 close_nointr(m->signal_watch.fd);
388 strv_free(m->unit_path);
389 strv_free(m->sysvinit_path);
390 strv_free(m->sysvrcnd_path);
392 free(m->cgroup_controller);
393 free(m->cgroup_hierarchy);
395 assert(hashmap_isempty(m->cgroup_bondings));
396 hashmap_free(m->cgroup_bondings);
401 int manager_coldplug(Manager *m) {
410 /* First, let's ask every type to load all units from
411 * disk/kernel that it might know */
412 for (c = 0; c < _UNIT_TYPE_MAX; c++)
413 if (unit_vtable[c]->enumerate)
414 if ((r = unit_vtable[c]->enumerate(m)) < 0)
417 manager_dispatch_load_queue(m);
419 /* Then, let's set up their initial state. */
420 HASHMAP_FOREACH_KEY(u, k, m->units, i) {
426 if (UNIT_VTABLE(u)->coldplug)
427 if ((r = UNIT_VTABLE(u)->coldplug(u)) < 0)
434 static void transaction_delete_job(Manager *m, Job *j, bool delete_dependencies) {
438 /* Deletes one job from the transaction */
440 manager_transaction_unlink_job(m, j, delete_dependencies);
446 static void transaction_delete_unit(Manager *m, Unit *u) {
449 /* Deletes all jobs associated with a certain unit from the
452 while ((j = hashmap_get(m->transaction_jobs, u)))
453 transaction_delete_job(m, j, true);
456 static void transaction_clean_dependencies(Manager *m) {
462 /* Drops all dependencies of all installed jobs */
464 HASHMAP_FOREACH(j, m->jobs, i) {
465 while (j->subject_list)
466 job_dependency_free(j->subject_list);
467 while (j->object_list)
468 job_dependency_free(j->object_list);
471 assert(!m->transaction_anchor);
474 static void transaction_abort(Manager *m) {
479 while ((j = hashmap_first(m->transaction_jobs)))
481 transaction_delete_job(m, j, true);
485 assert(hashmap_isempty(m->transaction_jobs));
487 transaction_clean_dependencies(m);
490 static void transaction_find_jobs_that_matter_to_anchor(Manager *m, Job *j, unsigned generation) {
495 /* A recursive sweep through the graph that marks all units
496 * that matter to the anchor job, i.e. are directly or
497 * indirectly a dependency of the anchor job via paths that
498 * are fully marked as mattering. */
503 l = m->transaction_anchor;
505 LIST_FOREACH(subject, l, l) {
507 /* This link does not matter */
511 /* This unit has already been marked */
512 if (l->object->generation == generation)
515 l->object->matters_to_anchor = true;
516 l->object->generation = generation;
518 transaction_find_jobs_that_matter_to_anchor(m, l->object, generation);
522 static void transaction_merge_and_delete_job(Manager *m, Job *j, Job *other, JobType t) {
523 JobDependency *l, *last;
527 assert(j->unit == other->unit);
528 assert(!j->installed);
530 /* Merges 'other' into 'j' and then deletes j. */
533 j->state = JOB_WAITING;
534 j->forced = j->forced || other->forced;
536 j->matters_to_anchor = j->matters_to_anchor || other->matters_to_anchor;
538 /* Patch us in as new owner of the JobDependency objects */
540 LIST_FOREACH(subject, l, other->subject_list) {
541 assert(l->subject == other);
546 /* Merge both lists */
548 last->subject_next = j->subject_list;
550 j->subject_list->subject_prev = last;
551 j->subject_list = other->subject_list;
554 /* Patch us in as new owner of the JobDependency objects */
556 LIST_FOREACH(object, l, other->object_list) {
557 assert(l->object == other);
562 /* Merge both lists */
564 last->object_next = j->object_list;
566 j->object_list->object_prev = last;
567 j->object_list = other->object_list;
570 /* Kill the other job */
571 other->subject_list = NULL;
572 other->object_list = NULL;
573 transaction_delete_job(m, other, true);
576 static int delete_one_unmergeable_job(Manager *m, Job *j) {
581 /* Tries to delete one item in the linked list
582 * j->transaction_next->transaction_next->... that conflicts
583 * whith another one, in an attempt to make an inconsistent
584 * transaction work. */
586 /* We rely here on the fact that if a merged with b does not
587 * merge with c, either a or b merge with c neither */
588 LIST_FOREACH(transaction, j, j)
589 LIST_FOREACH(transaction, k, j->transaction_next) {
592 /* Is this one mergeable? Then skip it */
593 if (job_type_is_mergeable(j->type, k->type))
596 /* Ok, we found two that conflict, let's see if we can
597 * drop one of them */
598 if (!j->matters_to_anchor)
600 else if (!k->matters_to_anchor)
605 /* Ok, we can drop one, so let's do so. */
606 log_debug("Trying to fix job merging by deleting job %s/%s", unit_id(d->unit), job_type_to_string(d->type));
607 transaction_delete_job(m, d, true);
614 static int transaction_merge_jobs(Manager *m) {
621 /* First step, check whether any of the jobs for one specific
622 * task conflict. If so, try to drop one of them. */
623 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
628 LIST_FOREACH(transaction, k, j->transaction_next) {
629 if ((r = job_type_merge(&t, k->type)) >= 0)
632 /* OK, we could not merge all jobs for this
633 * action. Let's see if we can get rid of one
636 if ((r = delete_one_unmergeable_job(m, j)) >= 0)
637 /* Ok, we managed to drop one, now
638 * let's ask our callers to call us
639 * again after garbage collecting */
642 /* We couldn't merge anything. Failure */
647 /* Second step, merge the jobs. */
648 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
652 /* Merge all transactions */
653 LIST_FOREACH(transaction, k, j->transaction_next)
654 assert_se(job_type_merge(&t, k->type) == 0);
656 /* If an active job is mergeable, merge it too */
657 if (j->unit->meta.job)
658 job_type_merge(&t, j->unit->meta.job->type); /* Might fail. Which is OK */
660 while ((k = j->transaction_next)) {
662 transaction_merge_and_delete_job(m, k, j, t);
665 transaction_merge_and_delete_job(m, j, k, t);
668 assert(!j->transaction_next);
669 assert(!j->transaction_prev);
675 static void transaction_drop_redundant(Manager *m) {
680 /* Goes through the transaction and removes all jobs that are
689 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
690 bool changes_something = false;
693 LIST_FOREACH(transaction, k, j) {
695 if (!job_is_anchor(k) &&
696 job_type_is_redundant(k->type, unit_active_state(k->unit)))
699 changes_something = true;
703 if (changes_something)
706 log_debug("Found redundant job %s/%s, dropping.", unit_id(j->unit), job_type_to_string(j->type));
707 transaction_delete_job(m, j, false);
715 static bool unit_matters_to_anchor(Unit *u, Job *j) {
717 assert(!j->transaction_prev);
719 /* Checks whether at least one of the jobs for this unit
720 * matters to the anchor. */
722 LIST_FOREACH(transaction, j, j)
723 if (j->matters_to_anchor)
729 static int transaction_verify_order_one(Manager *m, Job *j, Job *from, unsigned generation) {
736 assert(!j->transaction_prev);
738 /* Does a recursive sweep through the ordering graph, looking
739 * for a cycle. If we find cycle we try to break it. */
741 /* Did we find a cycle? */
742 if (j->marker && j->generation == generation) {
745 /* So, we already have been here. We have a
746 * cycle. Let's try to break it. We go backwards in
747 * our path and try to find a suitable job to
748 * remove. We use the marker to find our way back,
749 * since smart how we are we stored our way back in
752 log_debug("Found ordering cycle on %s/%s", unit_id(j->unit), job_type_to_string(j->type));
754 for (k = from; k; k = (k->generation == generation ? k->marker : NULL)) {
756 log_debug("Walked on cycle path to %s/%s", unit_id(k->unit), job_type_to_string(k->type));
759 !unit_matters_to_anchor(k->unit, k)) {
760 /* Ok, we can drop this one, so let's
762 log_debug("Breaking order cycle by deleting job %s/%s", unit_id(k->unit), job_type_to_string(k->type));
763 transaction_delete_unit(m, k->unit);
767 /* Check if this in fact was the beginning of
773 log_debug("Unable to break cycle");
778 /* Make the marker point to where we come from, so that we can
779 * find our way backwards if we want to break a cycle */
781 j->generation = generation;
783 /* We assume that the the dependencies are bidirectional, and
784 * hence can ignore UNIT_AFTER */
785 SET_FOREACH(u, j->unit->meta.dependencies[UNIT_BEFORE], i) {
788 /* Is there a job for this unit? */
789 if (!(o = hashmap_get(m->transaction_jobs, u)))
791 /* Ok, there is no job for this in the
792 * transaction, but maybe there is already one
794 if (!(o = u->meta.job))
797 if ((r = transaction_verify_order_one(m, o, j, generation)) < 0)
801 /* Ok, let's backtrack, and remember that this entry is not on
802 * our path anymore. */
808 static int transaction_verify_order(Manager *m, unsigned *generation) {
816 /* Check if the ordering graph is cyclic. If it is, try to fix
817 * that up by dropping one of the jobs. */
819 HASHMAP_FOREACH(j, m->transaction_jobs, i)
820 if ((r = transaction_verify_order_one(m, j, NULL, (*generation)++)) < 0)
826 static void transaction_collect_garbage(Manager *m) {
831 /* Drop jobs that are not required by any other job */
839 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
843 log_debug("Garbage collecting job %s/%s", unit_id(j->unit), job_type_to_string(j->type));
844 transaction_delete_job(m, j, true);
852 static int transaction_is_destructive(Manager *m, JobMode mode) {
858 /* Checks whether applying this transaction means that
859 * existing jobs would be replaced */
861 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
864 assert(!j->transaction_prev);
865 assert(!j->transaction_next);
867 if (j->unit->meta.job &&
868 j->unit->meta.job != j &&
869 !job_type_is_superset(j->type, j->unit->meta.job->type))
876 static void transaction_minimize_impact(Manager *m) {
880 /* Drops all unnecessary jobs that reverse already active jobs
881 * or that stop a running service. */
889 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
890 LIST_FOREACH(transaction, j, j) {
891 bool stops_running_service, changes_existing_job;
893 /* If it matters, we shouldn't drop it */
894 if (j->matters_to_anchor)
897 /* Would this stop a running service?
898 * Would this change an existing job?
899 * If so, let's drop this entry */
901 stops_running_service =
902 j->type == JOB_STOP && UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(j->unit));
904 changes_existing_job =
905 j->unit->meta.job && job_type_is_conflicting(j->type, j->unit->meta.job->state);
907 if (!stops_running_service && !changes_existing_job)
910 if (stops_running_service)
911 log_debug("%s/%s would stop a running service.", unit_id(j->unit), job_type_to_string(j->type));
913 if (changes_existing_job)
914 log_debug("%s/%s would change existing job.", unit_id(j->unit), job_type_to_string(j->type));
916 /* Ok, let's get rid of this */
917 log_debug("Deleting %s/%s to minimize impact.", unit_id(j->unit), job_type_to_string(j->type));
919 transaction_delete_job(m, j, true);
931 static int transaction_apply(Manager *m, JobMode mode) {
936 /* Moves the transaction jobs to the set of active jobs */
938 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
940 assert(!j->transaction_prev);
941 assert(!j->transaction_next);
946 if ((r = hashmap_put(m->jobs, UINT32_TO_PTR(j->id), j)) < 0)
950 while ((j = hashmap_steal_first(m->transaction_jobs))) {
954 if (j->unit->meta.job)
955 job_free(j->unit->meta.job);
957 j->unit->meta.job = j;
960 /* We're fully installed. Now let's free data we don't
963 assert(!j->transaction_next);
964 assert(!j->transaction_prev);
966 job_add_to_run_queue(j);
967 job_add_to_dbus_queue(j);
970 /* As last step, kill all remaining job dependencies. */
971 transaction_clean_dependencies(m);
977 HASHMAP_FOREACH(j, m->transaction_jobs, i) {
981 hashmap_remove(m->jobs, UINT32_TO_PTR(j->id));
987 static int transaction_activate(Manager *m, JobMode mode) {
989 unsigned generation = 1;
993 /* This applies the changes recorded in transaction_jobs to
994 * the actual list of jobs, if possible. */
996 /* First step: figure out which jobs matter */
997 transaction_find_jobs_that_matter_to_anchor(m, NULL, generation++);
999 /* Second step: Try not to stop any running services if
1000 * we don't have to. Don't try to reverse running
1001 * jobs if we don't have to. */
1002 transaction_minimize_impact(m);
1004 /* Third step: Drop redundant jobs */
1005 transaction_drop_redundant(m);
1008 /* Fourth step: Let's remove unneeded jobs that might
1010 transaction_collect_garbage(m);
1012 /* Fifth step: verify order makes sense and correct
1013 * cycles if necessary and possible */
1014 if ((r = transaction_verify_order(m, &generation)) >= 0)
1018 log_debug("Requested transaction contains an unfixable cyclic ordering dependency: %s", strerror(-r));
1022 /* Let's see if the resulting transaction ordering
1023 * graph is still cyclic... */
1027 /* Sixth step: let's drop unmergeable entries if
1028 * necessary and possible, merge entries we can
1030 if ((r = transaction_merge_jobs(m)) >= 0)
1034 log_debug("Requested transaction contains unmergable jobs: %s", strerror(-r));
1038 /* Seventh step: an entry got dropped, let's garbage
1039 * collect its dependencies. */
1040 transaction_collect_garbage(m);
1042 /* Let's see if the resulting transaction still has
1043 * unmergeable entries ... */
1046 /* Eights step: Drop redundant jobs again, if the merging now allows us to drop more. */
1047 transaction_drop_redundant(m);
1049 /* Ninth step: check whether we can actually apply this */
1050 if (mode == JOB_FAIL)
1051 if ((r = transaction_is_destructive(m, mode)) < 0) {
1052 log_debug("Requested transaction contradicts existing jobs: %s", strerror(-r));
1056 /* Tenth step: apply changes */
1057 if ((r = transaction_apply(m, mode)) < 0) {
1058 log_debug("Failed to apply transaction: %s", strerror(-r));
1062 assert(hashmap_isempty(m->transaction_jobs));
1063 assert(!m->transaction_anchor);
1068 transaction_abort(m);
1072 static Job* transaction_add_one_job(Manager *m, JobType type, Unit *unit, bool force, bool *is_new) {
1079 /* Looks for an axisting prospective job and returns that. If
1080 * it doesn't exist it is created and added to the prospective
1083 f = hashmap_get(m->transaction_jobs, unit);
1085 LIST_FOREACH(transaction, j, f) {
1086 assert(j->unit == unit);
1088 if (j->type == type) {
1095 if (unit->meta.job && unit->meta.job->type == type)
1097 else if (!(j = job_new(m, type, unit)))
1102 j->matters_to_anchor = false;
1105 LIST_PREPEND(Job, transaction, f, j);
1107 if ((r = hashmap_replace(m->transaction_jobs, unit, f)) < 0) {
1115 log_debug("Added job %s/%s to transaction.", unit_id(unit), job_type_to_string(type));
1120 void manager_transaction_unlink_job(Manager *m, Job *j, bool delete_dependencies) {
1124 if (j->transaction_prev)
1125 j->transaction_prev->transaction_next = j->transaction_next;
1126 else if (j->transaction_next)
1127 hashmap_replace(m->transaction_jobs, j->unit, j->transaction_next);
1129 hashmap_remove_value(m->transaction_jobs, j->unit, j);
1131 if (j->transaction_next)
1132 j->transaction_next->transaction_prev = j->transaction_prev;
1134 j->transaction_prev = j->transaction_next = NULL;
1136 while (j->subject_list)
1137 job_dependency_free(j->subject_list);
1139 while (j->object_list) {
1140 Job *other = j->object_list->matters ? j->object_list->subject : NULL;
1142 job_dependency_free(j->object_list);
1144 if (other && delete_dependencies) {
1145 log_debug("Deleting job %s/%s as dependency of job %s/%s",
1146 unit_id(other->unit), job_type_to_string(other->type),
1147 unit_id(j->unit), job_type_to_string(j->type));
1148 transaction_delete_job(m, other, delete_dependencies);
1153 static int transaction_add_job_and_dependencies(Manager *m, JobType type, Unit *unit, Job *by, bool matters, bool force, Job **_ret) {
1161 assert(type < _JOB_TYPE_MAX);
1164 if (unit->meta.load_state != UNIT_LOADED)
1167 if (!unit_job_is_applicable(unit, type))
1170 /* First add the job. */
1171 if (!(ret = transaction_add_one_job(m, type, unit, force, &is_new)))
1174 /* Then, add a link to the job. */
1175 if (!job_dependency_new(by, ret, matters))
1179 /* Finally, recursively add in all dependencies. */
1180 if (type == JOB_START || type == JOB_RELOAD_OR_START) {
1181 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES], i)
1182 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, force, NULL)) < 0 && r != -EBADR)
1184 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_SOFT_REQUIRES], i)
1185 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, !force, force, NULL)) < 0 && r != -EBADR)
1187 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_WANTS], i)
1188 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, false, force, NULL)) < 0)
1189 log_warning("Cannot add dependency job for unit %s, ignoring: %s", unit_id(dep), strerror(-r));
1190 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE], i)
1191 if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, true, force, NULL)) < 0 && r != -EBADR)
1193 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_SOFT_REQUISITE], i)
1194 if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, !force, force, NULL)) < 0 && r != -EBADR)
1196 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTS], i)
1197 if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, true, force, NULL)) < 0 && r != -EBADR)
1200 } else if (type == JOB_STOP || type == JOB_RESTART || type == JOB_TRY_RESTART) {
1202 SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRED_BY], i)
1203 if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, force, NULL)) < 0 && r != -EBADR)
1207 /* JOB_VERIFY_STARTED, JOB_RELOAD require no dependency handling */
1219 int manager_add_job(Manager *m, JobType type, Unit *unit, JobMode mode, bool force, Job **_ret) {
1224 assert(type < _JOB_TYPE_MAX);
1226 assert(mode < _JOB_MODE_MAX);
1228 log_debug("Trying to enqueue job %s/%s", unit_id(unit), job_type_to_string(type));
1230 if ((r = transaction_add_job_and_dependencies(m, type, unit, NULL, true, force, &ret)) < 0) {
1231 transaction_abort(m);
1235 if ((r = transaction_activate(m, mode)) < 0)
1238 log_debug("Enqueued job %s/%s as %u", unit_id(unit), job_type_to_string(type), (unsigned) ret->id);
1246 Job *manager_get_job(Manager *m, uint32_t id) {
1249 return hashmap_get(m->jobs, UINT32_TO_PTR(id));
1252 Unit *manager_get_unit(Manager *m, const char *name) {
1256 return hashmap_get(m->units, name);
1259 unsigned manager_dispatch_load_queue(Manager *m) {
1265 /* Make sure we are not run recursively */
1266 if (m->dispatching_load_queue)
1269 m->dispatching_load_queue = true;
1271 /* Dispatches the load queue. Takes a unit from the queue and
1272 * tries to load its data until the queue is empty */
1274 while ((meta = m->load_queue)) {
1275 assert(meta->in_load_queue);
1277 unit_load(UNIT(meta));
1281 m->dispatching_load_queue = false;
1285 int manager_load_unit(Manager *m, const char *path, Unit **_ret) {
1294 /* This will load the service information files, but not actually
1295 * start any services or anything. */
1297 name = file_name_from_path(path);
1299 if ((ret = manager_get_unit(m, name))) {
1304 if (!(ret = unit_new(m)))
1307 if (is_path(path)) {
1308 if (!(ret->meta.fragment_path = strdup(path))) {
1314 if ((r = unit_add_name(ret, name)) < 0) {
1319 unit_add_to_load_queue(ret);
1320 unit_add_to_dbus_queue(ret);
1322 manager_dispatch_load_queue(m);
1324 *_ret = unit_follow_merge(ret);
1328 void manager_dump_jobs(Manager *s, FILE *f, const char *prefix) {
1335 HASHMAP_FOREACH(j, s->jobs, i)
1336 job_dump(j, f, prefix);
1339 void manager_dump_units(Manager *s, FILE *f, const char *prefix) {
1347 HASHMAP_FOREACH_KEY(u, t, s->units, i)
1348 if (unit_id(u) == t)
1349 unit_dump(u, f, prefix);
1352 void manager_clear_jobs(Manager *m) {
1357 transaction_abort(m);
1359 while ((j = hashmap_first(m->jobs)))
1363 unsigned manager_dispatch_run_queue(Manager *m) {
1367 if (m->dispatching_run_queue)
1370 m->dispatching_run_queue = true;
1372 while ((j = m->run_queue)) {
1373 assert(j->installed);
1374 assert(j->in_run_queue);
1376 job_run_and_invalidate(j);
1380 m->dispatching_run_queue = false;
1384 unsigned manager_dispatch_dbus_queue(Manager *m) {
1391 if (m->dispatching_dbus_queue)
1394 m->dispatching_dbus_queue = true;
1396 while ((meta = m->dbus_unit_queue)) {
1397 assert(meta->in_dbus_queue);
1399 bus_unit_send_change_signal(UNIT(meta));
1403 while ((j = m->dbus_job_queue)) {
1404 assert(j->in_dbus_queue);
1406 bus_job_send_change_signal(j);
1410 m->dispatching_dbus_queue = false;
1414 static int manager_dispatch_sigchld(Manager *m) {
1417 log_debug("dispatching SIGCHLD");
1424 if (waitid(P_ALL, 0, &si, WEXITED|WNOHANG) < 0) {
1426 if (errno == ECHILD)
1435 if (si.si_code != CLD_EXITED && si.si_code != CLD_KILLED && si.si_code != CLD_DUMPED)
1438 log_debug("child %llu died (code=%s, status=%i)", (long long unsigned) si.si_pid, sigchld_code_to_string(si.si_code), si.si_status);
1440 if (!(u = hashmap_remove(m->watch_pids, UINT32_TO_PTR(si.si_pid))))
1443 log_debug("child %llu belongs to %s", (long long unsigned) si.si_pid, unit_id(u));
1445 UNIT_VTABLE(u)->sigchld_event(u, si.si_pid, si.si_code, si.si_status);
1451 static int manager_process_signal_fd(Manager *m, bool *quit) {
1453 struct signalfd_siginfo sfsi;
1454 bool sigchld = false;
1459 if ((n = read(m->signal_watch.fd, &sfsi, sizeof(sfsi))) != sizeof(sfsi)) {
1464 if (errno == EAGAIN)
1470 switch (sfsi.ssi_signo) {
1479 if (m->running_as != MANAGER_INIT) {
1487 if ((r = manager_load_unit(m, SPECIAL_CTRL_ALT_DEL_TARGET, &target)) < 0)
1488 log_error("Failed to load ctrl-alt-del target: %s", strerror(-r));
1489 else if ((r = manager_add_job(m, JOB_START, target, JOB_REPLACE, true, NULL)) < 0)
1490 log_error("Failed to enqueue ctrl-alt-del job: %s", strerror(-r));
1497 if (m->running_as == MANAGER_INIT) {
1501 if ((r = manager_load_unit(m, SPECIAL_KBREQUEST_TARGET, &target)) < 0)
1502 log_error("Failed to load kbrequest target: %s", strerror(-r));
1503 else if ((r = manager_add_job(m, JOB_START, target, JOB_REPLACE, true, NULL)) < 0)
1504 log_error("Failed to enqueue kbrequest job: %s", strerror(-r));
1509 /* This is a nop on non-init systemd's */
1515 printf("→ By units:\n");
1516 manager_dump_units(m, stdout, "\t");
1518 printf("→ By jobs:\n");
1519 manager_dump_jobs(m, stdout, "\t");
1524 log_info("Got unhandled signal <%s>.", strsignal(sfsi.ssi_signo));
1529 return manager_dispatch_sigchld(m);
1534 static int process_event(Manager *m, struct epoll_event *ev, bool *quit) {
1541 assert(w = ev->data.ptr);
1547 /* An incoming signal? */
1548 if (ev->events != EPOLLIN)
1551 if ((r = manager_process_signal_fd(m, quit)) < 0)
1558 /* Some fd event, to be dispatched to the units */
1559 UNIT_VTABLE(w->data.unit)->fd_event(w->data.unit, w->fd, ev->events, w);
1566 /* Some timer event, to be dispatched to the units */
1567 if ((k = read(w->fd, &v, sizeof(v))) != sizeof(v)) {
1569 if (k < 0 && (errno == EINTR || errno == EAGAIN))
1572 return k < 0 ? -errno : -EIO;
1575 UNIT_VTABLE(w->data.unit)->timer_event(w->data.unit, v, w);
1580 /* Some mount table change, intended for the mount subsystem */
1581 mount_fd_event(m, ev->events);
1585 /* Some notification from udev, intended for the device subsystem */
1586 device_fd_event(m, ev->events);
1589 case WATCH_DBUS_WATCH:
1590 bus_watch_event(m, w, ev->events);
1593 case WATCH_DBUS_TIMEOUT:
1594 bus_timeout_event(m, w, ev->events);
1598 assert_not_reached("Unknown epoll event type.");
1604 int manager_loop(Manager *m) {
1608 RATELIMIT_DEFINE(rl, 1*USEC_PER_SEC, 1000);
1613 struct epoll_event event;
1616 if (!ratelimit_test(&rl)) {
1617 /* Yay, something is going seriously wrong, pause a little */
1618 log_warning("Looping too fast. Throttling execution a little.");
1622 if (manager_dispatch_cleanup_queue(m) > 0)
1625 if (manager_dispatch_load_queue(m) > 0)
1628 if (manager_dispatch_run_queue(m) > 0)
1631 if (bus_dispatch(m) > 0)
1634 if (manager_dispatch_dbus_queue(m) > 0)
1637 if ((n = epoll_wait(m->epoll_fd, &event, 1, -1)) < 0) {
1639 if (errno == -EINTR)
1647 if ((r = process_event(m, &event, &quit)) < 0)
1654 int manager_get_unit_from_dbus_path(Manager *m, const char *s, Unit **_u) {
1662 if (!startswith(s, "/org/freedesktop/systemd1/unit/"))
1665 if (!(n = bus_path_unescape(s+31)))
1668 u = manager_get_unit(m, n);
1679 int manager_get_job_from_dbus_path(Manager *m, const char *s, Job **_j) {
1688 if (!startswith(s, "/org/freedesktop/systemd1/job/"))
1691 if ((r = safe_atou(s + 30, &id)) < 0)
1694 if (!(j = manager_get_job(m, id)))
1702 static const char* const manager_running_as_table[_MANAGER_RUNNING_AS_MAX] = {
1703 [MANAGER_INIT] = "init",
1704 [MANAGER_SYSTEM] = "system",
1705 [MANAGER_SESSION] = "session"
1708 DEFINE_STRING_TABLE_LOOKUP(manager_running_as, ManagerRunningAs);