2 This file is part of systemd.
4 Copyright 2010 Lennart Poettering
6 systemd is free software; you can redistribute it and/or modify it
7 under the terms of the GNU Lesser General Public License as published by
8 the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version.
11 systemd is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public License
17 along with systemd; If not, see <http://www.gnu.org/licenses/>.
23 #include "alloc-util.h"
24 #include "bus-common-errors.h"
25 #include "bus-error.h"
26 #include "terminal-util.h"
27 #include "transaction.h"
28 #include "dbus-unit.h"
30 static void transaction_unlink_job(Transaction
*tr
, Job
*j
, bool delete_dependencies
);
32 static void transaction_delete_job(Transaction
*tr
, Job
*j
, bool delete_dependencies
) {
36 /* Deletes one job from the transaction */
38 transaction_unlink_job(tr
, j
, delete_dependencies
);
43 static void transaction_delete_unit(Transaction
*tr
, Unit
*u
) {
46 /* Deletes all jobs associated with a certain unit from the
49 while ((j
= hashmap_get(tr
->jobs
, u
)))
50 transaction_delete_job(tr
, j
, true);
53 void transaction_abort(Transaction
*tr
) {
58 while ((j
= hashmap_first(tr
->jobs
)))
59 transaction_delete_job(tr
, j
, false);
61 assert(hashmap_isempty(tr
->jobs
));
64 static void transaction_find_jobs_that_matter_to_anchor(Job
*j
, unsigned generation
) {
67 /* A recursive sweep through the graph that marks all units
68 * that matter to the anchor job, i.e. are directly or
69 * indirectly a dependency of the anchor job via paths that
70 * are fully marked as mattering. */
72 j
->matters_to_anchor
= true;
73 j
->generation
= generation
;
75 LIST_FOREACH(subject
, l
, j
->subject_list
) {
77 /* This link does not matter */
81 /* This unit has already been marked */
82 if (l
->object
->generation
== generation
)
85 transaction_find_jobs_that_matter_to_anchor(l
->object
, generation
);
89 static void transaction_merge_and_delete_job(Transaction
*tr
, Job
*j
, Job
*other
, JobType t
) {
90 JobDependency
*l
, *last
;
94 assert(j
->unit
== other
->unit
);
95 assert(!j
->installed
);
97 /* Merges 'other' into 'j' and then deletes 'other'. */
100 j
->state
= JOB_WAITING
;
101 j
->irreversible
= j
->irreversible
|| other
->irreversible
;
102 j
->matters_to_anchor
= j
->matters_to_anchor
|| other
->matters_to_anchor
;
104 /* Patch us in as new owner of the JobDependency objects */
106 LIST_FOREACH(subject
, l
, other
->subject_list
) {
107 assert(l
->subject
== other
);
112 /* Merge both lists */
114 last
->subject_next
= j
->subject_list
;
116 j
->subject_list
->subject_prev
= last
;
117 j
->subject_list
= other
->subject_list
;
120 /* Patch us in as new owner of the JobDependency objects */
122 LIST_FOREACH(object
, l
, other
->object_list
) {
123 assert(l
->object
== other
);
128 /* Merge both lists */
130 last
->object_next
= j
->object_list
;
132 j
->object_list
->object_prev
= last
;
133 j
->object_list
= other
->object_list
;
136 /* Kill the other job */
137 other
->subject_list
= NULL
;
138 other
->object_list
= NULL
;
139 transaction_delete_job(tr
, other
, true);
142 _pure_
static bool job_is_conflicted_by(Job
*j
) {
147 /* Returns true if this job is pulled in by a least one
148 * ConflictedBy dependency. */
150 LIST_FOREACH(object
, l
, j
->object_list
)
157 static int delete_one_unmergeable_job(Transaction
*tr
, Job
*j
) {
162 /* Tries to delete one item in the linked list
163 * j->transaction_next->transaction_next->... that conflicts
164 * with another one, in an attempt to make an inconsistent
165 * transaction work. */
167 /* We rely here on the fact that if a merged with b does not
168 * merge with c, either a or b merge with c neither */
169 LIST_FOREACH(transaction
, j
, j
)
170 LIST_FOREACH(transaction
, k
, j
->transaction_next
) {
173 /* Is this one mergeable? Then skip it */
174 if (job_type_is_mergeable(j
->type
, k
->type
))
177 /* Ok, we found two that conflict, let's see if we can
178 * drop one of them */
179 if (!j
->matters_to_anchor
&& !k
->matters_to_anchor
) {
181 /* Both jobs don't matter, so let's
182 * find the one that is smarter to
183 * remove. Let's think positive and
184 * rather remove stops then starts --
185 * except if something is being
186 * stopped because it is conflicted by
187 * another unit in which case we
188 * rather remove the start. */
190 log_unit_debug(j
->unit
,
191 "Looking at job %s/%s conflicted_by=%s",
192 j
->unit
->id
, job_type_to_string(j
->type
),
193 yes_no(j
->type
== JOB_STOP
&& job_is_conflicted_by(j
)));
194 log_unit_debug(k
->unit
,
195 "Looking at job %s/%s conflicted_by=%s",
196 k
->unit
->id
, job_type_to_string(k
->type
),
197 yes_no(k
->type
== JOB_STOP
&& job_is_conflicted_by(k
)));
199 if (j
->type
== JOB_STOP
) {
201 if (job_is_conflicted_by(j
))
206 } else if (k
->type
== JOB_STOP
) {
208 if (job_is_conflicted_by(k
))
215 } else if (!j
->matters_to_anchor
)
217 else if (!k
->matters_to_anchor
)
222 /* Ok, we can drop one, so let's do so. */
223 log_unit_debug(d
->unit
,
224 "Fixing conflicting jobs %s/%s,%s/%s by deleting job %s/%s",
225 j
->unit
->id
, job_type_to_string(j
->type
),
226 k
->unit
->id
, job_type_to_string(k
->type
),
227 d
->unit
->id
, job_type_to_string(d
->type
));
228 transaction_delete_job(tr
, d
, true);
235 static int transaction_merge_jobs(Transaction
*tr
, sd_bus_error
*e
) {
242 /* First step, check whether any of the jobs for one specific
243 * task conflict. If so, try to drop one of them. */
244 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
249 LIST_FOREACH(transaction
, k
, j
->transaction_next
) {
250 if (job_type_merge_and_collapse(&t
, k
->type
, j
->unit
) >= 0)
253 /* OK, we could not merge all jobs for this
254 * action. Let's see if we can get rid of one
257 r
= delete_one_unmergeable_job(tr
, j
);
259 /* Ok, we managed to drop one, now
260 * let's ask our callers to call us
261 * again after garbage collecting */
264 /* We couldn't merge anything. Failure */
265 return sd_bus_error_setf(e
, BUS_ERROR_TRANSACTION_JOBS_CONFLICTING
,
266 "Transaction contains conflicting jobs '%s' and '%s' for %s. "
267 "Probably contradicting requirement dependencies configured.",
268 job_type_to_string(t
),
269 job_type_to_string(k
->type
),
274 /* Second step, merge the jobs. */
275 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
279 /* Merge all transaction jobs for j->unit */
280 LIST_FOREACH(transaction
, k
, j
->transaction_next
)
281 assert_se(job_type_merge_and_collapse(&t
, k
->type
, j
->unit
) == 0);
283 while ((k
= j
->transaction_next
)) {
284 if (tr
->anchor_job
== k
) {
285 transaction_merge_and_delete_job(tr
, k
, j
, t
);
288 transaction_merge_and_delete_job(tr
, j
, k
, t
);
291 assert(!j
->transaction_next
);
292 assert(!j
->transaction_prev
);
298 static void transaction_drop_redundant(Transaction
*tr
) {
302 /* Goes through the transaction and removes all jobs of the units
303 * whose jobs are all noops. If not all of a unit's jobs are
304 * redundant, they are kept. */
309 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
312 LIST_FOREACH(transaction
, k
, j
) {
314 if (tr
->anchor_job
== k
||
315 !job_type_is_redundant(k
->type
, unit_active_state(k
->unit
)) ||
316 (k
->unit
->job
&& job_type_is_conflicting(k
->type
, k
->unit
->job
->type
)))
320 /* log_debug("Found redundant job %s/%s, dropping.", j->unit->id, job_type_to_string(j->type)); */
321 transaction_delete_job(tr
, j
, false);
327 _pure_
static bool unit_matters_to_anchor(Unit
*u
, Job
*j
) {
329 assert(!j
->transaction_prev
);
331 /* Checks whether at least one of the jobs for this unit
332 * matters to the anchor. */
334 LIST_FOREACH(transaction
, j
, j
)
335 if (j
->matters_to_anchor
)
341 static int transaction_verify_order_one(Transaction
*tr
, Job
*j
, Job
*from
, unsigned generation
, sd_bus_error
*e
) {
348 assert(!j
->transaction_prev
);
350 /* Does a recursive sweep through the ordering graph, looking
351 * for a cycle. If we find a cycle we try to break it. */
353 /* Have we seen this before? */
354 if (j
->generation
== generation
) {
357 /* If the marker is NULL we have been here already and
358 * decided the job was loop-free from here. Hence
359 * shortcut things and return right-away. */
363 /* So, the marker is not NULL and we already have been
364 * here. We have a cycle. Let's try to break it. We go
365 * backwards in our path and try to find a suitable
366 * job to remove. We use the marker to find our way
367 * back, since smart how we are we stored our way back
369 log_unit_warning(j
->unit
,
370 "Found ordering cycle on %s/%s",
371 j
->unit
->id
, job_type_to_string(j
->type
));
374 for (k
= from
; k
; k
= ((k
->generation
== generation
&& k
->marker
!= k
) ? k
->marker
: NULL
)) {
376 /* logging for j not k here here to provide consistent narrative */
377 log_unit_warning(j
->unit
,
378 "Found dependency on %s/%s",
379 k
->unit
->id
, job_type_to_string(k
->type
));
381 if (!delete && hashmap_get(tr
->jobs
, k
->unit
) && !unit_matters_to_anchor(k
->unit
, k
))
382 /* Ok, we can drop this one, so let's
386 /* Check if this in fact was the beginning of
394 /* logging for j not k here here to provide consistent narrative */
395 log_unit_warning(j
->unit
,
396 "Breaking ordering cycle by deleting job %s/%s",
397 delete->unit
->id
, job_type_to_string(delete->type
));
398 log_unit_error(delete->unit
,
399 "Job %s/%s deleted to break ordering cycle starting with %s/%s",
400 delete->unit
->id
, job_type_to_string(delete->type
),
401 j
->unit
->id
, job_type_to_string(j
->type
));
402 unit_status_printf(delete->unit
, ANSI_HIGHLIGHT_RED
" SKIP " ANSI_NORMAL
,
403 "Ordering cycle found, skipping %s");
404 transaction_delete_unit(tr
, delete->unit
);
408 log_error("Unable to break cycle");
410 return sd_bus_error_setf(e
, BUS_ERROR_TRANSACTION_ORDER_IS_CYCLIC
,
411 "Transaction order is cyclic. See system logs for details.");
414 /* Make the marker point to where we come from, so that we can
415 * find our way backwards if we want to break a cycle. We use
416 * a special marker for the beginning: we point to
418 j
->marker
= from
? from
: j
;
419 j
->generation
= generation
;
421 /* We assume that the dependencies are bidirectional, and
422 * hence can ignore UNIT_AFTER */
423 SET_FOREACH(u
, j
->unit
->dependencies
[UNIT_BEFORE
], i
) {
426 /* Is there a job for this unit? */
427 o
= hashmap_get(tr
->jobs
, u
);
429 /* Ok, there is no job for this in the
430 * transaction, but maybe there is already one
437 r
= transaction_verify_order_one(tr
, o
, j
, generation
, e
);
442 /* Ok, let's backtrack, and remember that this entry is not on
443 * our path anymore. */
449 static int transaction_verify_order(Transaction
*tr
, unsigned *generation
, sd_bus_error
*e
) {
458 /* Check if the ordering graph is cyclic. If it is, try to fix
459 * that up by dropping one of the jobs. */
463 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
464 r
= transaction_verify_order_one(tr
, j
, NULL
, g
, e
);
472 static void transaction_collect_garbage(Transaction
*tr
) {
478 /* Drop jobs that are not required by any other job */
481 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
482 if (tr
->anchor_job
== j
|| j
->object_list
) {
483 /* log_debug("Keeping job %s/%s because of %s/%s", */
484 /* j->unit->id, job_type_to_string(j->type), */
485 /* j->object_list->subject ? j->object_list->subject->unit->id : "root", */
486 /* j->object_list->subject ? job_type_to_string(j->object_list->subject->type) : "root"); */
490 /* log_debug("Garbage collecting job %s/%s", j->unit->id, job_type_to_string(j->type)); */
491 transaction_delete_job(tr
, j
, true);
496 static int transaction_is_destructive(Transaction
*tr
, JobMode mode
, sd_bus_error
*e
) {
502 /* Checks whether applying this transaction means that
503 * existing jobs would be replaced */
505 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
508 assert(!j
->transaction_prev
);
509 assert(!j
->transaction_next
);
511 if (j
->unit
->job
&& (mode
== JOB_FAIL
|| j
->unit
->job
->irreversible
) &&
512 job_type_is_conflicting(j
->unit
->job
->type
, j
->type
))
513 return sd_bus_error_setf(e
, BUS_ERROR_TRANSACTION_IS_DESTRUCTIVE
,
514 "Transaction is destructive.");
520 static void transaction_minimize_impact(Transaction
*tr
) {
526 /* Drops all unnecessary jobs that reverse already active jobs
527 * or that stop a running service. */
530 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
531 LIST_FOREACH(transaction
, j
, j
) {
532 bool stops_running_service
, changes_existing_job
;
534 /* If it matters, we shouldn't drop it */
535 if (j
->matters_to_anchor
)
538 /* Would this stop a running service?
539 * Would this change an existing job?
540 * If so, let's drop this entry */
542 stops_running_service
=
543 j
->type
== JOB_STOP
&& UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(j
->unit
));
545 changes_existing_job
=
547 job_type_is_conflicting(j
->type
, j
->unit
->job
->type
);
549 if (!stops_running_service
&& !changes_existing_job
)
552 if (stops_running_service
)
553 log_unit_debug(j
->unit
,
554 "%s/%s would stop a running service.",
555 j
->unit
->id
, job_type_to_string(j
->type
));
557 if (changes_existing_job
)
558 log_unit_debug(j
->unit
,
559 "%s/%s would change existing job.",
560 j
->unit
->id
, job_type_to_string(j
->type
));
562 /* Ok, let's get rid of this */
563 log_unit_debug(j
->unit
,
564 "Deleting %s/%s to minimize impact.",
565 j
->unit
->id
, job_type_to_string(j
->type
));
567 transaction_delete_job(tr
, j
, true);
573 static int transaction_apply(Transaction
*tr
, Manager
*m
, JobMode mode
) {
578 /* Moves the transaction jobs to the set of active jobs */
580 if (mode
== JOB_ISOLATE
|| mode
== JOB_FLUSH
) {
582 /* When isolating first kill all installed jobs which
583 * aren't part of the new transaction */
584 HASHMAP_FOREACH(j
, m
->jobs
, i
) {
585 assert(j
->installed
);
587 if (hashmap_get(tr
->jobs
, j
->unit
))
590 /* Not invalidating recursively. Avoids triggering
591 * OnFailure= actions of dependent jobs. Also avoids
592 * invalidating our iterator. */
593 job_finish_and_invalidate(j
, JOB_CANCELED
, false);
597 HASHMAP_FOREACH(j
, tr
->jobs
, i
) {
599 assert(!j
->transaction_prev
);
600 assert(!j
->transaction_next
);
602 r
= hashmap_put(m
->jobs
, UINT32_TO_PTR(j
->id
), j
);
607 while ((j
= hashmap_steal_first(tr
->jobs
))) {
610 /* Clean the job dependencies */
611 transaction_unlink_job(tr
, j
, false);
613 installed_job
= job_install(j
);
614 if (installed_job
!= j
) {
615 /* j has been merged into a previously installed job */
616 if (tr
->anchor_job
== j
)
617 tr
->anchor_job
= installed_job
;
618 hashmap_remove(m
->jobs
, UINT32_TO_PTR(j
->id
));
623 job_add_to_run_queue(j
);
624 job_add_to_dbus_queue(j
);
626 job_shutdown_magic(j
);
633 HASHMAP_FOREACH(j
, tr
->jobs
, i
)
634 hashmap_remove(m
->jobs
, UINT32_TO_PTR(j
->id
));
639 int transaction_activate(Transaction
*tr
, Manager
*m
, JobMode mode
, sd_bus_error
*e
) {
643 unsigned generation
= 1;
647 /* This applies the changes recorded in tr->jobs to
648 * the actual list of jobs, if possible. */
650 /* Reset the generation counter of all installed jobs. The detection of cycles
651 * looks at installed jobs. If they had a non-zero generation from some previous
652 * walk of the graph, the algorithm would break. */
653 HASHMAP_FOREACH(j
, m
->jobs
, i
)
656 /* First step: figure out which jobs matter */
657 transaction_find_jobs_that_matter_to_anchor(tr
->anchor_job
, generation
++);
659 /* Second step: Try not to stop any running services if
660 * we don't have to. Don't try to reverse running
661 * jobs if we don't have to. */
662 if (mode
== JOB_FAIL
)
663 transaction_minimize_impact(tr
);
665 /* Third step: Drop redundant jobs */
666 transaction_drop_redundant(tr
);
669 /* Fourth step: Let's remove unneeded jobs that might
671 if (mode
!= JOB_ISOLATE
)
672 transaction_collect_garbage(tr
);
674 /* Fifth step: verify order makes sense and correct
675 * cycles if necessary and possible */
676 r
= transaction_verify_order(tr
, &generation
, e
);
681 log_warning("Requested transaction contains an unfixable cyclic ordering dependency: %s", bus_error_message(e
, r
));
685 /* Let's see if the resulting transaction ordering
686 * graph is still cyclic... */
690 /* Sixth step: let's drop unmergeable entries if
691 * necessary and possible, merge entries we can
693 r
= transaction_merge_jobs(tr
, e
);
698 log_warning("Requested transaction contains unmergeable jobs: %s", bus_error_message(e
, r
));
702 /* Seventh step: an entry got dropped, let's garbage
703 * collect its dependencies. */
704 if (mode
!= JOB_ISOLATE
)
705 transaction_collect_garbage(tr
);
707 /* Let's see if the resulting transaction still has
708 * unmergeable entries ... */
711 /* Eights step: Drop redundant jobs again, if the merging now allows us to drop more. */
712 transaction_drop_redundant(tr
);
714 /* Ninth step: check whether we can actually apply this */
715 r
= transaction_is_destructive(tr
, mode
, e
);
717 log_notice("Requested transaction contradicts existing jobs: %s", bus_error_message(e
, r
));
721 /* Tenth step: apply changes */
722 r
= transaction_apply(tr
, m
, mode
);
724 return log_warning_errno(r
, "Failed to apply transaction: %m");
726 assert(hashmap_isempty(tr
->jobs
));
728 if (!hashmap_isempty(m
->jobs
)) {
729 /* Are there any jobs now? Then make sure we have the
730 * idle pipe around. We don't really care too much
731 * whether this works or not, as the idle pipe is a
732 * feature for cosmetics, not actually useful for
733 * anything beyond that. */
735 if (m
->idle_pipe
[0] < 0 && m
->idle_pipe
[1] < 0 &&
736 m
->idle_pipe
[2] < 0 && m
->idle_pipe
[3] < 0) {
737 (void) pipe2(m
->idle_pipe
, O_NONBLOCK
|O_CLOEXEC
);
738 (void) pipe2(m
->idle_pipe
+ 2, O_NONBLOCK
|O_CLOEXEC
);
745 static Job
* transaction_add_one_job(Transaction
*tr
, JobType type
, Unit
*unit
, bool *is_new
) {
751 /* Looks for an existing prospective job and returns that. If
752 * it doesn't exist it is created and added to the prospective
755 f
= hashmap_get(tr
->jobs
, unit
);
757 LIST_FOREACH(transaction
, j
, f
) {
758 assert(j
->unit
== unit
);
760 if (j
->type
== type
) {
767 j
= job_new(unit
, type
);
773 j
->matters_to_anchor
= false;
774 j
->irreversible
= tr
->irreversible
;
776 LIST_PREPEND(transaction
, f
, j
);
778 if (hashmap_replace(tr
->jobs
, unit
, f
) < 0) {
779 LIST_REMOVE(transaction
, f
, j
);
787 /* log_debug("Added job %s/%s to transaction.", unit->id, job_type_to_string(type)); */
792 static void transaction_unlink_job(Transaction
*tr
, Job
*j
, bool delete_dependencies
) {
796 if (j
->transaction_prev
)
797 j
->transaction_prev
->transaction_next
= j
->transaction_next
;
798 else if (j
->transaction_next
)
799 hashmap_replace(tr
->jobs
, j
->unit
, j
->transaction_next
);
801 hashmap_remove_value(tr
->jobs
, j
->unit
, j
);
803 if (j
->transaction_next
)
804 j
->transaction_next
->transaction_prev
= j
->transaction_prev
;
806 j
->transaction_prev
= j
->transaction_next
= NULL
;
808 while (j
->subject_list
)
809 job_dependency_free(j
->subject_list
);
811 while (j
->object_list
) {
812 Job
*other
= j
->object_list
->matters
? j
->object_list
->subject
: NULL
;
814 job_dependency_free(j
->object_list
);
816 if (other
&& delete_dependencies
) {
817 log_unit_debug(other
->unit
,
818 "Deleting job %s/%s as dependency of job %s/%s",
819 other
->unit
->id
, job_type_to_string(other
->type
),
820 j
->unit
->id
, job_type_to_string(j
->type
));
821 transaction_delete_job(tr
, other
, delete_dependencies
);
826 int transaction_add_job_and_dependencies(
833 bool ignore_requirements
,
843 assert(type
< _JOB_TYPE_MAX
);
844 assert(type
< _JOB_TYPE_MAX_IN_TRANSACTION
);
847 /* Before adding jobs for this unit, let's ensure that its state has been loaded
848 * This matters when jobs are spawned as part of coldplugging itself (see e. g. path_coldplug()).
849 * This way, we "recursively" coldplug units, ensuring that we do not look at state of
850 * not-yet-coldplugged units. */
851 if (unit
->manager
->n_reloading
> 0)
854 /* log_debug("Pulling in %s/%s from %s/%s", */
855 /* unit->id, job_type_to_string(type), */
856 /* by ? by->unit->id : "NA", */
857 /* by ? job_type_to_string(by->type) : "NA"); */
859 if (!IN_SET(unit
->load_state
, UNIT_LOADED
, UNIT_ERROR
, UNIT_NOT_FOUND
, UNIT_MASKED
))
860 return sd_bus_error_setf(e
, BUS_ERROR_LOAD_FAILED
, "Unit %s is not loaded properly.", unit
->id
);
862 if (type
!= JOB_STOP
) {
863 r
= bus_unit_check_load_state(unit
, e
);
868 if (!unit_job_is_applicable(unit
, type
))
869 return sd_bus_error_setf(e
, BUS_ERROR_JOB_TYPE_NOT_APPLICABLE
,
870 "Job type %s is not applicable for unit %s.",
871 job_type_to_string(type
), unit
->id
);
874 /* First add the job. */
875 ret
= transaction_add_one_job(tr
, type
, unit
, &is_new
);
879 ret
->ignore_order
= ret
->ignore_order
|| ignore_order
;
881 /* Then, add a link to the job. */
883 if (!job_dependency_new(by
, ret
, matters
, conflicts
))
886 /* If the job has no parent job, it is the anchor job. */
887 assert(!tr
->anchor_job
);
888 tr
->anchor_job
= ret
;
891 if (is_new
&& !ignore_requirements
&& type
!= JOB_NOP
) {
894 /* If we are following some other unit, make sure we
895 * add all dependencies of everybody following. */
896 if (unit_following_set(ret
->unit
, &following
) > 0) {
897 SET_FOREACH(dep
, following
, i
) {
898 r
= transaction_add_job_and_dependencies(tr
, type
, dep
, ret
, false, false, false, ignore_order
, e
);
900 log_unit_warning(dep
, "Cannot add dependency job for, ignoring: %s", bus_error_message(e
, r
));
901 sd_bus_error_free(e
);
908 /* Finally, recursively add in all dependencies. */
909 if (type
== JOB_START
|| type
== JOB_RESTART
) {
910 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_REQUIRES
], i
) {
911 r
= transaction_add_job_and_dependencies(tr
, JOB_START
, dep
, ret
, true, false, false, ignore_order
, e
);
913 if (r
!= -EBADR
) /* job type not applicable */
916 sd_bus_error_free(e
);
920 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_BINDS_TO
], i
) {
921 r
= transaction_add_job_and_dependencies(tr
, JOB_START
, dep
, ret
, true, false, false, ignore_order
, e
);
923 if (r
!= -EBADR
) /* job type not applicable */
926 sd_bus_error_free(e
);
930 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_WANTS
], i
) {
931 r
= transaction_add_job_and_dependencies(tr
, JOB_START
, dep
, ret
, false, false, false, ignore_order
, e
);
933 /* unit masked, job type not applicable and unit not found are not considered as errors. */
935 IN_SET(r
, -ESHUTDOWN
, -EBADR
, -ENOENT
) ? LOG_DEBUG
: LOG_WARNING
,
936 r
, "Cannot add dependency job, ignoring: %s",
937 bus_error_message(e
, r
));
938 sd_bus_error_free(e
);
942 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_REQUISITE
], i
) {
943 r
= transaction_add_job_and_dependencies(tr
, JOB_VERIFY_ACTIVE
, dep
, ret
, true, false, false, ignore_order
, e
);
945 if (r
!= -EBADR
) /* job type not applicable */
948 sd_bus_error_free(e
);
952 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_CONFLICTS
], i
) {
953 r
= transaction_add_job_and_dependencies(tr
, JOB_STOP
, dep
, ret
, true, true, false, ignore_order
, e
);
955 if (r
!= -EBADR
) /* job type not applicable */
958 sd_bus_error_free(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, false, false, ignore_order
, e
);
965 log_unit_warning(dep
,
966 "Cannot add dependency job, ignoring: %s",
967 bus_error_message(e
, r
));
968 sd_bus_error_free(e
);
974 if (type
== JOB_STOP
|| type
== JOB_RESTART
) {
975 static const UnitDependency propagate_deps
[] = {
985 /* We propagate STOP as STOP, but RESTART only
986 * as TRY_RESTART, in order not to start
987 * dependencies that are not around. */
988 ptype
= type
== JOB_RESTART
? JOB_TRY_RESTART
: type
;
990 for (j
= 0; j
< ELEMENTSOF(propagate_deps
); j
++)
991 SET_FOREACH(dep
, ret
->unit
->dependencies
[propagate_deps
[j
]], i
) {
994 nt
= job_type_collapse(ptype
, dep
);
998 r
= transaction_add_job_and_dependencies(tr
, nt
, dep
, ret
, true, false, false, ignore_order
, e
);
1000 if (r
!= -EBADR
) /* job type not applicable */
1003 sd_bus_error_free(e
);
1008 if (type
== JOB_RELOAD
) {
1010 SET_FOREACH(dep
, ret
->unit
->dependencies
[UNIT_PROPAGATES_RELOAD_TO
], i
) {
1013 nt
= job_type_collapse(JOB_TRY_RELOAD
, dep
);
1017 r
= transaction_add_job_and_dependencies(tr
, nt
, dep
, ret
, false, false, false, ignore_order
, e
);
1019 log_unit_warning(dep
,
1020 "Cannot add dependency reload job, ignoring: %s",
1021 bus_error_message(e
, r
));
1022 sd_bus_error_free(e
);
1027 /* JOB_VERIFY_STARTED require no dependency handling */
1036 int transaction_add_isolate_jobs(Transaction
*tr
, Manager
*m
) {
1045 HASHMAP_FOREACH_KEY(u
, k
, m
->units
, i
) {
1047 /* ignore aliases */
1051 if (u
->ignore_on_isolate
)
1054 /* No need to stop inactive jobs */
1055 if (UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u
)) && !u
->job
)
1058 /* Is there already something listed for this? */
1059 if (hashmap_get(tr
->jobs
, u
))
1062 r
= transaction_add_job_and_dependencies(tr
, JOB_STOP
, u
, tr
->anchor_job
, true, false, false, false, NULL
);
1064 log_unit_warning_errno(u
, r
, "Cannot add isolate job, ignoring: %m");
1070 Transaction
*transaction_new(bool irreversible
) {
1073 tr
= new0(Transaction
, 1);
1077 tr
->jobs
= hashmap_new(NULL
);
1083 tr
->irreversible
= irreversible
;
1088 void transaction_free(Transaction
*tr
) {
1089 assert(hashmap_isempty(tr
->jobs
));
1090 hashmap_free(tr
->jobs
);