1 /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
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 Lesser General Public License as published by
10 the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details.
18 You should have received a copy of the GNU Lesser General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
25 #include "transaction.h"
26 #include "bus-errors.h"
28 static void transaction_unlink_job(Transaction *tr, Job *j, bool delete_dependencies);
30 static void transaction_delete_job(Transaction *tr, Job *j, bool delete_dependencies) {
34 /* Deletes one job from the transaction */
36 transaction_unlink_job(tr, j, delete_dependencies);
41 static void transaction_delete_unit(Transaction *tr, Unit *u) {
44 /* Deletes all jobs associated with a certain unit from the
47 while ((j = hashmap_get(tr->jobs, u)))
48 transaction_delete_job(tr, j, true);
51 void transaction_abort(Transaction *tr) {
56 while ((j = hashmap_first(tr->jobs)))
57 transaction_delete_job(tr, j, false);
59 assert(hashmap_isempty(tr->jobs));
62 static void transaction_find_jobs_that_matter_to_anchor(Job *j, unsigned generation) {
65 /* A recursive sweep through the graph that marks all units
66 * that matter to the anchor job, i.e. are directly or
67 * indirectly a dependency of the anchor job via paths that
68 * are fully marked as mattering. */
70 j->matters_to_anchor = true;
71 j->generation = generation;
73 LIST_FOREACH(subject, l, j->subject_list) {
75 /* This link does not matter */
79 /* This unit has already been marked */
80 if (l->object->generation == generation)
83 transaction_find_jobs_that_matter_to_anchor(l->object, generation);
87 static void transaction_merge_and_delete_job(Transaction *tr, Job *j, Job *other, JobType t) {
88 JobDependency *l, *last;
92 assert(j->unit == other->unit);
93 assert(!j->installed);
95 /* Merges 'other' into 'j' and then deletes 'other'. */
98 j->state = JOB_WAITING;
99 j->override = j->override || other->override;
101 j->matters_to_anchor = j->matters_to_anchor || other->matters_to_anchor;
103 /* Patch us in as new owner of the JobDependency objects */
105 LIST_FOREACH(subject, l, other->subject_list) {
106 assert(l->subject == other);
111 /* Merge both lists */
113 last->subject_next = j->subject_list;
115 j->subject_list->subject_prev = last;
116 j->subject_list = other->subject_list;
119 /* Patch us in as new owner of the JobDependency objects */
121 LIST_FOREACH(object, l, other->object_list) {
122 assert(l->object == other);
127 /* Merge both lists */
129 last->object_next = j->object_list;
131 j->object_list->object_prev = last;
132 j->object_list = other->object_list;
135 /* Kill the other job */
136 other->subject_list = NULL;
137 other->object_list = NULL;
138 transaction_delete_job(tr, other, true);
141 static bool job_is_conflicted_by(Job *j) {
146 /* Returns true if this job is pulled in by a least one
147 * ConflictedBy dependency. */
149 LIST_FOREACH(object, l, j->object_list)
156 static int delete_one_unmergeable_job(Transaction *tr, Job *j) {
161 /* Tries to delete one item in the linked list
162 * j->transaction_next->transaction_next->... that conflicts
163 * with another one, in an attempt to make an inconsistent
164 * transaction work. */
166 /* We rely here on the fact that if a merged with b does not
167 * merge with c, either a or b merge with c neither */
168 LIST_FOREACH(transaction, j, j)
169 LIST_FOREACH(transaction, k, j->transaction_next) {
172 /* Is this one mergeable? Then skip it */
173 if (job_type_is_mergeable(j->type, k->type))
176 /* Ok, we found two that conflict, let's see if we can
177 * drop one of them */
178 if (!j->matters_to_anchor && !k->matters_to_anchor) {
180 /* Both jobs don't matter, so let's
181 * find the one that is smarter to
182 * remove. Let's think positive and
183 * rather remove stops then starts --
184 * except if something is being
185 * stopped because it is conflicted by
186 * another unit in which case we
187 * rather remove the start. */
189 log_debug("Looking at job %s/%s conflicted_by=%s", j->unit->id, job_type_to_string(j->type), yes_no(j->type == JOB_STOP && job_is_conflicted_by(j)));
190 log_debug("Looking at job %s/%s conflicted_by=%s", k->unit->id, job_type_to_string(k->type), yes_no(k->type == JOB_STOP && job_is_conflicted_by(k)));
192 if (j->type == JOB_STOP) {
194 if (job_is_conflicted_by(j))
199 } else if (k->type == JOB_STOP) {
201 if (job_is_conflicted_by(k))
208 } else if (!j->matters_to_anchor)
210 else if (!k->matters_to_anchor)
215 /* Ok, we can drop one, so let's do so. */
216 log_debug("Fixing conflicting jobs by deleting job %s/%s", d->unit->id, job_type_to_string(d->type));
217 transaction_delete_job(tr, d, true);
224 static int transaction_merge_jobs(Transaction *tr, DBusError *e) {
231 /* First step, check whether any of the jobs for one specific
232 * task conflict. If so, try to drop one of them. */
233 HASHMAP_FOREACH(j, tr->jobs, i) {
238 LIST_FOREACH(transaction, k, j->transaction_next) {
239 if (job_type_merge_and_collapse(&t, k->type, j->unit) >= 0)
242 /* OK, we could not merge all jobs for this
243 * action. Let's see if we can get rid of one
246 r = delete_one_unmergeable_job(tr, j);
248 /* Ok, we managed to drop one, now
249 * let's ask our callers to call us
250 * again after garbage collecting */
253 /* We couldn't merge anything. Failure */
254 dbus_set_error(e, BUS_ERROR_TRANSACTION_JOBS_CONFLICTING, "Transaction contains conflicting jobs '%s' and '%s' for %s. Probably contradicting requirement dependencies configured.",
255 job_type_to_string(t), job_type_to_string(k->type), k->unit->id);
260 /* Second step, merge the jobs. */
261 HASHMAP_FOREACH(j, tr->jobs, i) {
265 /* Merge all transaction jobs for j->unit */
266 LIST_FOREACH(transaction, k, j->transaction_next)
267 assert_se(job_type_merge_and_collapse(&t, k->type, j->unit) == 0);
269 while ((k = j->transaction_next)) {
270 if (tr->anchor_job == k) {
271 transaction_merge_and_delete_job(tr, k, j, t);
274 transaction_merge_and_delete_job(tr, j, k, t);
277 assert(!j->transaction_next);
278 assert(!j->transaction_prev);
284 static void transaction_drop_redundant(Transaction *tr) {
288 /* Goes through the transaction and removes all jobs of the units
289 * whose jobs are all noops. If not all of a unit's jobs are
290 * redundant, they are kept. */
295 HASHMAP_FOREACH(j, tr->jobs, i) {
298 LIST_FOREACH(transaction, k, j) {
300 if (tr->anchor_job == k ||
301 !job_type_is_redundant(k->type, unit_active_state(k->unit)) ||
302 (k->unit->job && job_type_is_conflicting(k->type, k->unit->job->type)))
306 /* log_debug("Found redundant job %s/%s, dropping.", j->unit->id, job_type_to_string(j->type)); */
307 transaction_delete_job(tr, j, false);
313 static bool unit_matters_to_anchor(Unit *u, Job *j) {
315 assert(!j->transaction_prev);
317 /* Checks whether at least one of the jobs for this unit
318 * matters to the anchor. */
320 LIST_FOREACH(transaction, j, j)
321 if (j->matters_to_anchor)
327 static int transaction_verify_order_one(Transaction *tr, Job *j, Job *from, unsigned generation, DBusError *e) {
334 assert(!j->transaction_prev);
336 /* Does a recursive sweep through the ordering graph, looking
337 * for a cycle. If we find cycle we try to break it. */
339 /* Have we seen this before? */
340 if (j->generation == generation) {
343 /* If the marker is NULL we have been here already and
344 * decided the job was loop-free from here. Hence
345 * shortcut things and return right-away. */
349 /* So, the marker is not NULL and we already have been
350 * here. We have a cycle. Let's try to break it. We go
351 * backwards in our path and try to find a suitable
352 * job to remove. We use the marker to find our way
353 * back, since smart how we are we stored our way back
355 log_warning("Found ordering cycle on %s/%s", j->unit->id, job_type_to_string(j->type));
358 for (k = from; k; k = ((k->generation == generation && k->marker != k) ? k->marker : NULL)) {
360 log_info("Walked on cycle path to %s/%s", k->unit->id, job_type_to_string(k->type));
363 !unit_matters_to_anchor(k->unit, k)) {
364 /* Ok, we can drop this one, so let's
369 /* Check if this in fact was the beginning of
377 log_warning("Breaking ordering cycle by deleting job %s/%s", delete->unit->id, job_type_to_string(delete->type));
378 transaction_delete_unit(tr, delete->unit);
382 log_error("Unable to break cycle");
384 dbus_set_error(e, BUS_ERROR_TRANSACTION_ORDER_IS_CYCLIC, "Transaction order is cyclic. See system logs for details.");
388 /* Make the marker point to where we come from, so that we can
389 * find our way backwards if we want to break a cycle. We use
390 * a special marker for the beginning: we point to
392 j->marker = from ? from : j;
393 j->generation = generation;
395 /* We assume that the the dependencies are bidirectional, and
396 * hence can ignore UNIT_AFTER */
397 SET_FOREACH(u, j->unit->dependencies[UNIT_BEFORE], i) {
400 /* Is there a job for this unit? */
401 o = hashmap_get(tr->jobs, u);
403 /* Ok, there is no job for this in the
404 * transaction, but maybe there is already one
411 r = transaction_verify_order_one(tr, o, j, generation, e);
416 /* Ok, let's backtrack, and remember that this entry is not on
417 * our path anymore. */
423 static int transaction_verify_order(Transaction *tr, unsigned *generation, DBusError *e) {
432 /* Check if the ordering graph is cyclic. If it is, try to fix
433 * that up by dropping one of the jobs. */
437 HASHMAP_FOREACH(j, tr->jobs, i)
438 if ((r = transaction_verify_order_one(tr, j, NULL, g, e)) < 0)
444 static void transaction_collect_garbage(Transaction *tr) {
450 /* Drop jobs that are not required by any other job */
453 HASHMAP_FOREACH(j, tr->jobs, i) {
454 if (tr->anchor_job == j || j->object_list) {
455 /* log_debug("Keeping job %s/%s because of %s/%s", */
456 /* j->unit->id, job_type_to_string(j->type), */
457 /* j->object_list->subject ? j->object_list->subject->unit->id : "root", */
458 /* j->object_list->subject ? job_type_to_string(j->object_list->subject->type) : "root"); */
462 /* log_debug("Garbage collecting job %s/%s", j->unit->id, job_type_to_string(j->type)); */
463 transaction_delete_job(tr, j, true);
468 static int transaction_is_destructive(Transaction *tr, DBusError *e) {
474 /* Checks whether applying this transaction means that
475 * existing jobs would be replaced */
477 HASHMAP_FOREACH(j, tr->jobs, i) {
480 assert(!j->transaction_prev);
481 assert(!j->transaction_next);
484 !job_type_is_superset(j->type, j->unit->job->type)) {
486 dbus_set_error(e, BUS_ERROR_TRANSACTION_IS_DESTRUCTIVE, "Transaction is destructive.");
494 static void transaction_minimize_impact(Transaction *tr) {
500 /* Drops all unnecessary jobs that reverse already active jobs
501 * or that stop a running service. */
504 HASHMAP_FOREACH(j, tr->jobs, i) {
505 LIST_FOREACH(transaction, j, j) {
506 bool stops_running_service, changes_existing_job;
508 /* If it matters, we shouldn't drop it */
509 if (j->matters_to_anchor)
512 /* Would this stop a running service?
513 * Would this change an existing job?
514 * If so, let's drop this entry */
516 stops_running_service =
517 j->type == JOB_STOP && UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(j->unit));
519 changes_existing_job =
521 job_type_is_conflicting(j->type, j->unit->job->type);
523 if (!stops_running_service && !changes_existing_job)
526 if (stops_running_service)
527 log_debug("%s/%s would stop a running service.", j->unit->id, job_type_to_string(j->type));
529 if (changes_existing_job)
530 log_debug("%s/%s would change existing job.", j->unit->id, job_type_to_string(j->type));
532 /* Ok, let's get rid of this */
533 log_debug("Deleting %s/%s to minimize impact.", j->unit->id, job_type_to_string(j->type));
535 transaction_delete_job(tr, j, true);
541 static int transaction_apply(Transaction *tr, Manager *m, JobMode mode) {
546 /* Moves the transaction jobs to the set of active jobs */
548 if (mode == JOB_ISOLATE) {
550 /* When isolating first kill all installed jobs which
551 * aren't part of the new transaction */
552 HASHMAP_FOREACH(j, m->jobs, i) {
553 assert(j->installed);
555 if (hashmap_get(tr->jobs, j->unit))
558 /* Not invalidating recursively. Avoids triggering
559 * OnFailure= actions of dependent jobs. Also avoids
560 * invalidating our iterator. */
561 job_finish_and_invalidate(j, JOB_CANCELED, false);
565 HASHMAP_FOREACH(j, tr->jobs, i) {
567 assert(!j->transaction_prev);
568 assert(!j->transaction_next);
570 r = hashmap_put(m->jobs, UINT32_TO_PTR(j->id), j);
575 while ((j = hashmap_steal_first(tr->jobs))) {
578 /* Clean the job dependencies */
579 transaction_unlink_job(tr, j, false);
581 installed_job = job_install(j);
582 if (installed_job != j) {
583 /* j has been merged into a previously installed job */
584 if (tr->anchor_job == j)
585 tr->anchor_job = installed_job;
586 hashmap_remove(m->jobs, UINT32_TO_PTR(j->id));
591 job_add_to_run_queue(j);
592 job_add_to_dbus_queue(j);
600 HASHMAP_FOREACH(j, tr->jobs, i)
601 hashmap_remove(m->jobs, UINT32_TO_PTR(j->id));
606 int transaction_activate(Transaction *tr, Manager *m, JobMode mode, DBusError *e) {
610 unsigned generation = 1;
614 /* This applies the changes recorded in tr->jobs to
615 * the actual list of jobs, if possible. */
617 /* Reset the generation counter of all installed jobs. The detection of cycles
618 * looks at installed jobs. If they had a non-zero generation from some previous
619 * walk of the graph, the algorithm would break. */
620 HASHMAP_FOREACH(j, m->jobs, i)
623 /* First step: figure out which jobs matter */
624 transaction_find_jobs_that_matter_to_anchor(tr->anchor_job, generation++);
626 /* Second step: Try not to stop any running services if
627 * we don't have to. Don't try to reverse running
628 * jobs if we don't have to. */
629 if (mode == JOB_FAIL)
630 transaction_minimize_impact(tr);
632 /* Third step: Drop redundant jobs */
633 transaction_drop_redundant(tr);
636 /* Fourth step: Let's remove unneeded jobs that might
638 if (mode != JOB_ISOLATE)
639 transaction_collect_garbage(tr);
641 /* Fifth step: verify order makes sense and correct
642 * cycles if necessary and possible */
643 r = transaction_verify_order(tr, &generation, e);
648 log_warning("Requested transaction contains an unfixable cyclic ordering dependency: %s", bus_error(e, r));
652 /* Let's see if the resulting transaction ordering
653 * graph is still cyclic... */
657 /* Sixth step: let's drop unmergeable entries if
658 * necessary and possible, merge entries we can
660 r = transaction_merge_jobs(tr, e);
665 log_warning("Requested transaction contains unmergeable jobs: %s", bus_error(e, r));
669 /* Seventh step: an entry got dropped, let's garbage
670 * collect its dependencies. */
671 if (mode != JOB_ISOLATE)
672 transaction_collect_garbage(tr);
674 /* Let's see if the resulting transaction still has
675 * unmergeable entries ... */
678 /* Eights step: Drop redundant jobs again, if the merging now allows us to drop more. */
679 transaction_drop_redundant(tr);
681 /* Ninth step: check whether we can actually apply this */
682 if (mode == JOB_FAIL) {
683 r = transaction_is_destructive(tr, e);
685 log_notice("Requested transaction contradicts existing jobs: %s", bus_error(e, r));
690 /* Tenth step: apply changes */
691 r = transaction_apply(tr, m, mode);
693 log_warning("Failed to apply transaction: %s", strerror(-r));
697 assert(hashmap_isempty(tr->jobs));
699 if (!hashmap_isempty(m->jobs)) {
700 /* Are there any jobs now? Then make sure we have the
701 * idle pipe around. We don't really care too much
702 * whether this works or not, as the idle pipe is a
703 * feature for cosmetics, not actually useful for
704 * anything beyond that. */
706 if (m->idle_pipe[0] < 0 && m->idle_pipe[1] < 0)
707 pipe2(m->idle_pipe, O_NONBLOCK|O_CLOEXEC);
713 static Job* transaction_add_one_job(Transaction *tr, JobType type, Unit *unit, bool override, bool *is_new) {
719 /* Looks for an existing prospective job and returns that. If
720 * it doesn't exist it is created and added to the prospective
723 f = hashmap_get(tr->jobs, unit);
725 LIST_FOREACH(transaction, j, f) {
726 assert(j->unit == unit);
728 if (j->type == type) {
735 j = job_new(unit, type);
741 j->matters_to_anchor = false;
742 j->override = override;
744 LIST_PREPEND(Job, transaction, f, j);
746 if (hashmap_replace(tr->jobs, unit, f) < 0) {
747 LIST_REMOVE(Job, transaction, f, j);
755 /* log_debug("Added job %s/%s to transaction.", unit->id, job_type_to_string(type)); */
760 static void transaction_unlink_job(Transaction *tr, Job *j, bool delete_dependencies) {
764 if (j->transaction_prev)
765 j->transaction_prev->transaction_next = j->transaction_next;
766 else if (j->transaction_next)
767 hashmap_replace(tr->jobs, j->unit, j->transaction_next);
769 hashmap_remove_value(tr->jobs, j->unit, j);
771 if (j->transaction_next)
772 j->transaction_next->transaction_prev = j->transaction_prev;
774 j->transaction_prev = j->transaction_next = NULL;
776 while (j->subject_list)
777 job_dependency_free(j->subject_list);
779 while (j->object_list) {
780 Job *other = j->object_list->matters ? j->object_list->subject : NULL;
782 job_dependency_free(j->object_list);
784 if (other && delete_dependencies) {
785 log_debug("Deleting job %s/%s as dependency of job %s/%s",
786 other->unit->id, job_type_to_string(other->type),
787 j->unit->id, job_type_to_string(j->type));
788 transaction_delete_job(tr, other, delete_dependencies);
793 int transaction_add_job_and_dependencies(
801 bool ignore_requirements,
811 assert(type < _JOB_TYPE_MAX);
812 assert(type < _JOB_TYPE_MAX_IN_TRANSACTION);
815 /* log_debug("Pulling in %s/%s from %s/%s", */
816 /* unit->id, job_type_to_string(type), */
817 /* by ? by->unit->id : "NA", */
818 /* by ? job_type_to_string(by->type) : "NA"); */
820 if (unit->load_state != UNIT_LOADED &&
821 unit->load_state != UNIT_ERROR &&
822 unit->load_state != UNIT_MASKED) {
823 dbus_set_error(e, BUS_ERROR_LOAD_FAILED, "Unit %s is not loaded properly.", unit->id);
827 if (type != JOB_STOP && unit->load_state == UNIT_ERROR) {
828 dbus_set_error(e, BUS_ERROR_LOAD_FAILED,
829 "Unit %s failed to load: %s. "
830 "See system logs and 'systemctl status %s' for details.",
832 strerror(-unit->load_error),
837 if (type != JOB_STOP && unit->load_state == UNIT_MASKED) {
838 dbus_set_error(e, BUS_ERROR_MASKED, "Unit %s is masked.", unit->id);
839 return -EADDRNOTAVAIL;
842 if (!unit_job_is_applicable(unit, type)) {
843 dbus_set_error(e, BUS_ERROR_JOB_TYPE_NOT_APPLICABLE, "Job type %s is not applicable for unit %s.", job_type_to_string(type), unit->id);
847 /* First add the job. */
848 ret = transaction_add_one_job(tr, type, unit, override, &is_new);
852 ret->ignore_order = ret->ignore_order || ignore_order;
854 /* Then, add a link to the job. */
856 if (!job_dependency_new(by, ret, matters, conflicts))
859 /* If the job has no parent job, it is the anchor job. */
860 assert(!tr->anchor_job);
861 tr->anchor_job = ret;
864 if (is_new && !ignore_requirements && type != JOB_NOP) {
867 /* If we are following some other unit, make sure we
868 * add all dependencies of everybody following. */
869 if (unit_following_set(ret->unit, &following) > 0) {
870 SET_FOREACH(dep, following, i) {
871 r = transaction_add_job_and_dependencies(tr, type, dep, ret, false, override, false, false, ignore_order, e);
873 log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
883 /* Finally, recursively add in all dependencies. */
884 if (type == JOB_START || type == JOB_RESTART) {
885 SET_FOREACH(dep, ret->unit->dependencies[UNIT_REQUIRES], i) {
886 r = transaction_add_job_and_dependencies(tr, JOB_START, dep, ret, true, override, false, false, ignore_order, e);
896 SET_FOREACH(dep, ret->unit->dependencies[UNIT_BIND_TO], i) {
897 r = transaction_add_job_and_dependencies(tr, JOB_START, dep, ret, true, override, false, false, ignore_order, e);
907 SET_FOREACH(dep, ret->unit->dependencies[UNIT_REQUIRES_OVERRIDABLE], i) {
908 r = transaction_add_job_and_dependencies(tr, JOB_START, dep, ret, !override, override, false, false, ignore_order, e);
910 log_full(r == -EADDRNOTAVAIL ? LOG_DEBUG : LOG_WARNING,
911 "Cannot add dependency job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
918 SET_FOREACH(dep, ret->unit->dependencies[UNIT_WANTS], i) {
919 r = transaction_add_job_and_dependencies(tr, JOB_START, dep, ret, false, false, false, false, ignore_order, e);
921 log_full(r == -EADDRNOTAVAIL ? LOG_DEBUG : LOG_WARNING,
922 "Cannot add dependency job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
929 SET_FOREACH(dep, ret->unit->dependencies[UNIT_REQUISITE], i) {
930 r = transaction_add_job_and_dependencies(tr, JOB_VERIFY_ACTIVE, dep, ret, true, override, false, false, ignore_order, e);
940 SET_FOREACH(dep, ret->unit->dependencies[UNIT_REQUISITE_OVERRIDABLE], i) {
941 r = transaction_add_job_and_dependencies(tr, JOB_VERIFY_ACTIVE, dep, ret, !override, override, false, false, ignore_order, e);
943 log_full(r == -EADDRNOTAVAIL ? LOG_DEBUG : LOG_WARNING,
944 "Cannot add dependency job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
951 SET_FOREACH(dep, ret->unit->dependencies[UNIT_CONFLICTS], i) {
952 r = transaction_add_job_and_dependencies(tr, JOB_STOP, dep, ret, true, override, true, false, ignore_order, e);
962 SET_FOREACH(dep, ret->unit->dependencies[UNIT_CONFLICTED_BY], i) {
963 r = transaction_add_job_and_dependencies(tr, JOB_STOP, dep, ret, false, override, false, false, ignore_order, e);
965 log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
974 if (type == JOB_STOP || type == JOB_RESTART) {
976 SET_FOREACH(dep, ret->unit->dependencies[UNIT_REQUIRED_BY], i) {
977 r = transaction_add_job_and_dependencies(tr, type, dep, ret, true, override, false, false, ignore_order, e);
987 SET_FOREACH(dep, ret->unit->dependencies[UNIT_BOUND_BY], i) {
988 r = transaction_add_job_and_dependencies(tr, type, dep, ret, true, override, false, false, ignore_order, e);
999 if (type == JOB_RELOAD) {
1001 SET_FOREACH(dep, ret->unit->dependencies[UNIT_PROPAGATE_RELOAD_TO], i) {
1002 r = transaction_add_job_and_dependencies(tr, JOB_RELOAD, dep, ret, false, override, false, false, ignore_order, e);
1004 log_warning("Cannot add dependency reload job for unit %s, ignoring: %s", dep->id, bus_error(e, r));
1012 /* JOB_VERIFY_STARTED require no dependency handling */
1021 int transaction_add_isolate_jobs(Transaction *tr, Manager *m) {
1030 HASHMAP_FOREACH_KEY(u, k, m->units, i) {
1032 /* ignore aliases */
1036 if (u->ignore_on_isolate)
1039 /* No need to stop inactive jobs */
1040 if (UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u)) && !u->job)
1043 /* Is there already something listed for this? */
1044 if (hashmap_get(tr->jobs, u))
1047 r = transaction_add_job_and_dependencies(tr, JOB_STOP, u, tr->anchor_job, true, false, false, false, false, NULL);
1049 log_warning("Cannot add isolate job for unit %s, ignoring: %s", u->id, strerror(-r));
1055 Transaction *transaction_new(void) {
1058 tr = new0(Transaction, 1);
1062 tr->jobs = hashmap_new(trivial_hash_func, trivial_compare_func);
1071 void transaction_free(Transaction *tr) {
1072 assert(hashmap_isempty(tr->jobs));
1073 hashmap_free(tr->jobs);