HALF ECHO LEARN / REFERENCE COLLECTION

v262.2

src/core/transaction.c

58,344 bytesGit mode 100644Download original fileLGPL-2.1-or-later

Git blob: 9ce5cfa587c8b11c6908bb8e76551552991b477e

Lines 1–1000 of 1,410

/* SPDX-License-Identifier: LGPL-2.1-or-later */
 
#include "sd-bus.h"
#include "sd-messages.h"
 
#include "alloc-util.h"
#include "ansi-color.h"
#include "bus-common-errors.h"
#include "bus-error.h"
#include "dbus-unit.h"
#include "hash-funcs.h"
#include "manager.h"
#include "set.h"
#include "slice.h"
#include "string-util.h"
#include "strv.h"
#include "transaction.h"
 
#define CYCLIC_TRANSACTIONS_MAX 4096U
 
static bool job_matters_to_anchor(Job *job);
static void transaction_unlink_job(Transaction *tr, Job *j, bool delete_dependencies);
static void transaction_find_jobs_that_matter_to_anchor(Transaction *tr, unsigned generation);
 
static void transaction_delete_job(Transaction *tr, Job *j, bool delete_dependencies) {
        assert(tr);
        assert(j);
 
        /* Deletes one job from the transaction. */
 
        transaction_unlink_job(tr, j, delete_dependencies);
        (void) set_remove(tr->anchor_jobs, j);
 
        job_free(j);
}
 
static void transaction_delete_unit(Transaction *tr, Unit *u) {
        Job *j;
 
        /* Deletes all jobs associated with a certain unit from the transaction. */
 
        while ((j = hashmap_get(tr->jobs, u)))
                transaction_delete_job(tr, j, true);
}
 
static void transaction_abort(Transaction *tr) {
        Job *j;
 
        assert(tr);
 
        while ((j = hashmap_first(tr->jobs)))
                transaction_delete_job(tr, j, false);
 
        assert(hashmap_isempty(tr->jobs));
}
 
static void transaction_find_jobs_that_matter_to_anchor_one(Job *j, unsigned generation) {
        assert(j);
 
        /* A recursive sweep through the graph that marks all units that matter to the anchor job, i.e. are
         * directly or indirectly a dependency of the anchor job via paths that are fully marked as
         * mattering. */
 
        j->matters_to_anchor = true;
        j->generation = generation;
 
        LIST_FOREACH(subject, l, j->subject_list) {
 
                /* This link does not matter. */
                if (!l->matters)
                        continue;
 
                /* This unit has already been marked. */
                if (l->object->generation == generation)
                        continue;
 
                transaction_find_jobs_that_matter_to_anchor_one(l->object, generation);
        }
}
 
static void transaction_find_jobs_that_matter_to_anchor(Transaction *tr, unsigned generation) {
        Job *j;
 
        assert(tr);
 
        /* All anchor jobs (and reachable jobs) get marked in the same generation. The recursion uses the
         * generation only to avoid re-traversing already-visited nodes, so reusing the generation across
         * anchors is correct: nodes already marked by a previous anchor are skipped. */
        SET_FOREACH(j, tr->anchor_jobs)
                transaction_find_jobs_that_matter_to_anchor_one(j, generation);
}
 
static void transaction_merge_and_delete_job(Transaction *tr, Job *j, Job *other, JobType t) {
        JobDependency *last;
 
        assert(j);
        assert(other);
        assert(j->unit == other->unit);
        assert(!j->installed);
 
        /* Merges 'other' into 'j' and then deletes 'other'. */
 
        j->type = t;
        j->state = JOB_WAITING;
        j->irreversible = j->irreversible || other->irreversible;
        j->matters_to_anchor = j->matters_to_anchor || other->matters_to_anchor;
 
        /* Patch us in as new owner of the JobDependency objects. */
        last = NULL;
        LIST_FOREACH(subject, l, other->subject_list) {
                assert(l->subject == other);
                l->subject = j;
                last = l;
        }
 
        /* Merge both lists. */
        if (last) {
                last->subject_next = j->subject_list;
                if (j->subject_list)
                        j->subject_list->subject_prev = last;
                j->subject_list = other->subject_list;
        }
 
        /* Patch us in as new owner of the JobDependency objects. */
        last = NULL;
        LIST_FOREACH(object, l, other->object_list) {
                assert(l->object == other);
                l->object = j;
                last = l;
        }
 
        /* Merge both lists. */
        if (last) {
                last->object_next = j->object_list;
                if (j->object_list)
                        j->object_list->object_prev = last;
                j->object_list = other->object_list;
        }
 
        /* Kill the other job. */
        other->subject_list = NULL;
        other->object_list = NULL;
        transaction_delete_job(tr, other, true);
}
 
static bool job_is_conflicted_by(Job *j) {
        assert(j);
 
        /* Returns true if this job is pulled in by a least one ConflictedBy= dependency. */
 
        LIST_FOREACH(object, l, j->object_list)
                if (l->conflicts)
                        return true;
 
        return false;
}
 
static int delete_one_unmergeable_job(Transaction *tr, Job *job) {
        assert(job);
 
        /* Tries to delete one item in the linked list
         * j->transaction_next->transaction_next->... that conflicts with another one, in an attempt to make
         * an inconsistent transaction work. */
 
        /* We rely here on the fact that if a merged with b does not merge with c, either a or b merge with c
         * neither. */
        LIST_FOREACH(transaction, j, job)
                LIST_FOREACH(transaction, k, j->transaction_next) {
                        Job *d;
 
                        /* Is this one mergeable? Then skip it. */
                        if (job_type_is_mergeable(j->type, k->type))
                                continue;
 
                        /* Ok, we found two that conflict, let's see if we can drop one of them. */
                        if (!j->matters_to_anchor && !k->matters_to_anchor) {
 
                                /* Both jobs don't matter, so let's find the one that is smarter to remove.
                                 * Let's think positive and rather remove stops than starts -- except if
                                 * something is being stopped because it is conflicted by another unit in
                                 * which case we rather remove the start. */
 
                                bool j_is_conflicted_by = job_is_conflicted_by(j),
                                        k_is_conflicted_by = job_is_conflicted_by(k);
 
                                /* Update test/units/TEST-87-AUX-UTILS-VM.sh when logs below are changed. */
                                log_unit_debug(j->unit,
                                               "Looking at job %s/%s conflicted_by=%s",
                                               j->unit->id, job_type_to_string(j->type),
                                               yes_no(j->type == JOB_STOP && j_is_conflicted_by));
                                log_unit_debug(k->unit,
                                               "Looking at job %s/%s conflicted_by=%s",
                                               k->unit->id, job_type_to_string(k->type),
                                               yes_no(k->type == JOB_STOP && k_is_conflicted_by));
 
                                if (j->type == JOB_STOP && j_is_conflicted_by)
                                        d = k;
                                else if (k->type == JOB_STOP && k_is_conflicted_by)
                                        d = j;
                                else if (j->type == JOB_STOP)
                                        d = j;
                                else if (k->type == JOB_STOP)
                                        d = k;
                                else
                                        d = j;
 
                        } else if (!j->matters_to_anchor)
                                d = j;
                        else if (!k->matters_to_anchor)
                                d = k;
                        else
                                return -ENOEXEC;
 
                        /* Ok, we can drop one, so let's do so. */
                        log_unit_debug(d->unit,
                                       "Fixing conflicting jobs %s/%s,%s/%s by deleting job %s/%s",
                                       j->unit->id, job_type_to_string(j->type),
                                       k->unit->id, job_type_to_string(k->type),
                                       d->unit->id, job_type_to_string(d->type));
                        transaction_delete_job(tr, d, true);
                        return 0;
                }
 
        return -EINVAL;
}
 
static int transaction_ensure_mergeable(Transaction *tr, bool matters_to_anchor, sd_bus_error *e) {
        Job *j;
        int r;
 
        assert(tr);
 
        HASHMAP_FOREACH(j, tr->jobs) {
                JobType t;
 
                if (job_matters_to_anchor(j) != matters_to_anchor)
                        continue;
 
                t = j->type;
                LIST_FOREACH(transaction, k, j->transaction_next) {
                        if (job_type_merge_and_collapse(&t, k->type, j->unit) >= 0)
                                continue;
 
                        /* OK, we could not merge all jobs for this action. Let's see if we can get rid of
                         * one of them. */
 
                        r = delete_one_unmergeable_job(tr, j);
                        if (r >= 0)
                                /* Ok, we managed to drop one, now let's ask our callers to call us again
                                 * after garbage collecting. */
                                return -EAGAIN;
 
                        /* We couldn't merge anything. Failure. */
                        return sd_bus_error_setf(e, BUS_ERROR_TRANSACTION_JOBS_CONFLICTING,
                                                 "Transaction contains conflicting jobs '%s' and '%s' for %s. "
                                                 "Probably contradicting requirement dependencies configured.",
                                                 job_type_to_string(t),
                                                 job_type_to_string(k->type),
                                                 k->unit->id);
                }
        }
 
        return 0;
}
 
static void transaction_drop_nop(Transaction *tr) {
        Job *j;
        int r;
 
        assert(tr);
 
        /* While a transaction is being built, a NOP job sits in the same per-unit list in tr->jobs (linked
         * via transaction_next/transaction_prev) as the regular jobs for that unit; the dedicated 'nop_job'
         * slot in Unit is only populated later, at install time. JOB_NOP equals _JOB_TYPE_MAX_MERGING and is
         * thus outside the domain of job_type_lookup_merge(), so it cannot be merged with a regular job and
         * would trip the assertion there. A unit can end up with both a NOP job (e.g. a try-restart/try-reload
         * anchor that collapsed to JOB_NOP because the unit is inactive) and a regular job (typically pulled
         * in as a dependency by another job in the same transaction, which is possible since
         * EnqueueUnitJobMany() allows more than one anchor). In that case the NOP carries no meaning of its
         * own, as the regular job is what determines the fate of the unit, so drop it to keep each unit's
         * transaction list mergeable. */
 
        HASHMAP_FOREACH(j, tr->jobs) {
                Job *nop = NULL, *regular = NULL;
 
                LIST_FOREACH(transaction, k, j)
                        if (k->type == JOB_NOP)
                                nop = k; /* At most one NOP per unit, as jobs are deduplicated by type. */
                        else
                                regular = k;
 
                /* Only drop the NOP when a regular job for the same unit remains. A lone NOP anchor must be
                 * kept so that e.g. 'try-restart' on an inactive unit still completes successfully. */
                if (!nop || !regular)
                        continue;
 
                log_unit_debug(nop->unit,
                               "Dropping NOP job for %s, a regular job for the same unit is part of the transaction.",
                               nop->unit->id);
 
                /* A NOP job only ever enters the transaction as a client-requested anchor: propagated
                 * try-restart/try-reload that would collapse to JOB_NOP is skipped before being added. Hand
                 * the anchor identity over to the surviving regular job (which was pulled in by another job
                 * and is not an anchor itself) so the unit the client explicitly named still shows up in the
                 * set reported back by EnqueueUnitJobMany(). */
                if (set_contains(tr->anchor_jobs, nop)) {
                        r = set_remove_and_put(tr->anchor_jobs, nop, regular);
                        if (r == -EEXIST)
                                /* The regular job is already an anchor; just drop the about-to-be-freed NOP
                                 * key so it doesn't linger. */
                                (void) set_remove(tr->anchor_jobs, nop);
                        else
                                /* nop was present (we just checked) and put cannot fail after a remove. */
                                assert(r >= 0);
                }
 
                transaction_delete_job(tr, nop, /* delete_dependencies= */ false);
        }
}
 
static int transaction_merge_jobs(Transaction *tr, sd_bus_error *e) {
        Job *j;
        int r;
 
        assert(tr);
 
        /* NOP jobs cannot be merged with regular jobs, so drop the ones that would collide first. */
        transaction_drop_nop(tr);
 
        /* First step, try to drop unmergeable jobs for jobs that matter to anchor. */
        r = transaction_ensure_mergeable(tr, /* matters_to_anchor= */ true, e);
        if (r < 0)
                return r;
 
        /* Second step, do the same for jobs that not matter to anchor. */
        r = transaction_ensure_mergeable(tr, /* matters_to_anchor= */ false, e);
        if (r < 0)
                return r;
 
        /* Third step, merge the jobs. */
        HASHMAP_FOREACH(j, tr->jobs) {
                JobType t = j->type;
 
                /* Merge all transaction jobs for j->unit. */
                LIST_FOREACH(transaction, k, j->transaction_next)
                        assert_se(job_type_merge_and_collapse(&t, k->type, j->unit) == 0);
 
                Job *k;
                while ((k = j->transaction_next)) {
                        if (set_contains(tr->anchor_jobs, k)) {
                                transaction_merge_and_delete_job(tr, k, j, t);
                                j = k;
                        } else
                                transaction_merge_and_delete_job(tr, j, k, t);
                }
 
                assert(!j->transaction_next);
                assert(!j->transaction_prev);
        }
 
        return 0;
}
 
static void transaction_drop_redundant(Transaction *tr) {
        bool again;
 
        /* Goes through the transaction and removes all jobs of the units whose jobs are all noops. If not
         * all of a unit's jobs are redundant, they are kept. */
 
        assert(tr);
 
        do {
                Job *j;
 
                again = false;
 
                HASHMAP_FOREACH(j, tr->jobs) {
                        bool keep = false;
 
                        LIST_FOREACH(transaction, k, j)
                                if (set_contains(tr->anchor_jobs, k) ||
                                    !job_type_is_redundant(k->type, unit_active_state(k->unit)) ||
                                    (k->unit->job && job_type_is_conflicting(k->type, k->unit->job->type))) {
                                        keep = true;
                                        break;
                                }
 
                        if (!keep) {
                                log_trace("Found redundant job %s/%s, dropping from transaction.",
                                          j->unit->id, job_type_to_string(j->type));
                                transaction_delete_job(tr, j, false);
                                again = true;
                                break;
                        }
                }
        } while (again);
}
 
static bool job_matters_to_anchor(Job *job) {
        assert(job);
        assert(!job->transaction_prev);
 
        /* Checks whether at least one of the jobs for this transaction matters to the anchor. */
 
        LIST_FOREACH(transaction, j, job)
                if (j->matters_to_anchor)
                        return true;
 
        return false;
}
 
static int transaction_verify_order_one(Transaction *tr, Job *j, Job *from, unsigned generation, sd_bus_error *e) {
 
        static const UnitDependencyAtom directions[] = {
                UNIT_ATOM_BEFORE,
                UNIT_ATOM_AFTER,
        };
 
        int r;
 
        assert(tr);
        assert(j);
        assert(!j->transaction_prev);
 
        /* Does a recursive sweep through the ordering graph, looking for a cycle. If we find a cycle we try
         * to break it. */
 
        /* Have we seen this before? */
        if (j->generation == generation) {
                _cleanup_free_ char **array = NULL;
                Job *delete = NULL;
 
                /* If the marker is NULL we have been here already and decided the job was loop-free from
                 * here. Hence shortcut things and return right-away. */
                if (!j->marker)
                        return 0;
 
                /* So, the marker is not NULL and we already have been here. We have a cycle. Let's try to
                 * break it. We go backwards in our path and try to find a suitable job to remove. We use the
                 * marker to find our way back, since smart how we are we stored our way back in there. */
                for (Job *k = from; k; k = (k->generation == generation && k->marker != k) ? k->marker : NULL) {
 
                        /* For logging below. */
                        if (strv_push_pair(&array, k->unit->id, (char*) job_type_to_string(k->type)) < 0)
                                (void) log_oom_warning();
 
                        if (!delete && hashmap_contains(tr->jobs, k->unit) && !job_matters_to_anchor(k))
                                /* Ok, we can drop this one, so let's do so. */
                                delete = k;
 
                        /* Check if this in fact was the beginning of the cycle. */
                        if (k == j)
                                break;
                }
 
                _cleanup_free_ char *unit_ids = NULL;
                STRV_FOREACH_PAIR(unit_id, job_type, array)
                        (void) strextendf_with_separator(&unit_ids, "\n", "%s%s", unit_log_field(j->unit), *unit_id);
 
                _cleanup_free_ char *cycle_path_text = strdup("Found ordering cycle");
                if (!strv_isempty(array)) {
                        (void) strextendf(&cycle_path_text, ": %s/%s", array[0], array[1]);
 
                        STRV_FOREACH_PAIR(unit_id, job_type, strv_skip(array, 2))
                                (void) strextendf(&cycle_path_text, " after %s/%s", *unit_id, *job_type);
 
                        (void) strextendf(&cycle_path_text, " - after %s", array[0]);
                }
 
                /* logging for j not k here to provide a consistent narrative */
                if (cycle_path_text)
                        log_struct(LOG_ERR,
                                   LOG_UNIT_MESSAGE(j->unit, "%s", cycle_path_text),
                                   LOG_MESSAGE_ID(SD_MESSAGE_UNIT_ORDERING_CYCLE_STR),
                                   LOG_ITEM("%s", strempty(unit_ids)));
 
                if (set_size(j->manager->transactions_with_cycle) >= CYCLIC_TRANSACTIONS_MAX)
                        log_warning("Too many transactions with ordering cycle, suppressing record.");
                else {
                        uint64_t *id_buf = newdup(uint64_t, &tr->id, 1);
                        if (!id_buf)
                                log_oom_warning();
                        else
                                (void) set_ensure_consume(&j->manager->transactions_with_cycle, &uint64_hash_ops_value_free, id_buf);
                }
 
                if (delete) {
                        const char *status;
                        /* logging for j not k here to provide a consistent narrative */
                        log_struct(LOG_WARNING,
                                   LOG_UNIT_MESSAGE(j->unit,
                                                    "Job %s/%s deleted to break ordering cycle starting with %s/%s",
                                                    delete->unit->id, job_type_to_string(delete->type),
                                                    j->unit->id, job_type_to_string(j->type)),
                                   LOG_MESSAGE_ID(SD_MESSAGE_DELETING_JOB_BECAUSE_ORDERING_CYCLE_STR),
                                   LOG_ITEM("DELETED_UNIT=%s", delete->unit->id),
                                   LOG_ITEM("DELETED_TYPE=%s", job_type_to_string(delete->type)),
                                   LOG_ITEM("%s", strempty(unit_ids)));
 
                        if (log_get_show_color())
                                status = ANSI_HIGHLIGHT_RED " SKIP " ANSI_NORMAL;
                        else
                                status = " SKIP ";
 
                        unit_status_printf(delete->unit,
                                           STATUS_TYPE_NOTICE,
                                           status,
                                           "Ordering cycle found, skipping %s",
                                           unit_status_string(delete->unit, NULL));
                        transaction_delete_unit(tr, delete->unit);
                        return -EAGAIN;
                }
 
                log_struct(LOG_ERR,
                           LOG_UNIT_MESSAGE(j->unit, "Unable to break cycle starting with %s/%s",
                                            j->unit->id, job_type_to_string(j->type)),
                           LOG_MESSAGE_ID(SD_MESSAGE_CANT_BREAK_ORDERING_CYCLE_STR),
                           LOG_ITEM("%s", strempty(unit_ids)));
 
                return sd_bus_error_setf(e, BUS_ERROR_TRANSACTION_ORDER_IS_CYCLIC,
                                         "Transaction order is cyclic. See system logs for details.");
        }
 
        /* Make the marker point to where we come from, so that we can find our way backwards if we want to
         * break a cycle. We use a special marker for the beginning: we point to ourselves. */
        j->marker = from ?: j;
        j->generation = generation;
 
        /* Actual ordering of jobs depends on the unit ordering dependency and job types. We need to traverse
         * the graph over 'before' edges in the actual job execution order. We traverse over both unit
         * ordering dependencies and we test with job_compare() whether it is the 'before' edge in the job
         * execution ordering. */
        FOREACH_ELEMENT(d, directions) {
                Unit *u;
 
                UNIT_FOREACH_DEPENDENCY(u, j->unit, *d) {
                        Job *o;
 
                        /* Is there a job for this unit? */
                        o = hashmap_get(tr->jobs, u);
                        if (!o) {
                                /* Ok, there is no job for this in the transaction, but maybe there is
                                 * already one running? */
                                o = u->job;
                                if (!o)
                                        continue;
                        }
 
                        /* Cut traversing if the job j is not really *before* o. */
                        if (job_compare(j, o, *d) >= 0)
                                continue;
 
                        r = transaction_verify_order_one(tr, o, j, generation, e);
                        if (r < 0)
                                return r;
                }
        }
 
        /* Ok, let's backtrack, and remember that this entry is not on our path anymore. */
        j->marker = NULL;
 
        return 0;
}
 
static int transaction_verify_order(Transaction *tr, unsigned *generation, sd_bus_error *e) {
        Job *j;
        int r;
        unsigned g;
 
        assert(tr);
        assert(generation);
 
        /* Check if the ordering graph is cyclic. If it is, try to fix that up by dropping one of the jobs. */
 
        g = (*generation)++;
 
        HASHMAP_FOREACH(j, tr->jobs) {
                r = transaction_verify_order_one(tr, j, NULL, g, e);
                if (r < 0)
                        return r;
        }
 
        return 0;
}
 
static void transaction_collect_garbage_mark_reachable(Job *j, unsigned generation) {
        assert(j);
 
        if (j->generation == generation)
                return;
 
        j->generation = generation;
 
        /* Follow every job this one pulls in — regardless of whether the link matters — so that everything
         * reachable from an anchor job is retained. */
        LIST_FOREACH(subject, l, j->subject_list)
                transaction_collect_garbage_mark_reachable(l->object, generation);
}
 
static void transaction_collect_garbage(Transaction *tr, unsigned generation) {
        assert(tr);
 
        /* Drop all jobs that are not reachable from any anchor job. Unlike merely dropping jobs that nothing
         * else pulls in anymore, this also collects dependency cycles (e.g. a BindsTo=/Upholds= loop) that are
         * no longer anchored to any requested job. */
 
        Job *j;
        SET_FOREACH(j, tr->anchor_jobs)
                transaction_collect_garbage_mark_reachable(j, generation);
 
        HASHMAP_FOREACH(j, tr->jobs) {
                LIST_FOREACH(transaction, k, j) {
                        if (k->generation == generation)
                                continue; /* reachable from an anchor, keep it */
 
                        log_trace("Garbage collecting job %s/%s", k->unit->id, job_type_to_string(k->type));
                        transaction_delete_job(tr, k, /* delete_dependencies= */ false);
                }
        }
}
 
static int transaction_is_destructive(Transaction *tr, JobMode mode, sd_bus_error *e) {
        Job *j;
 
        assert(tr);
 
        /* Checks whether applying this transaction means that existing jobs would be replaced. */
 
        HASHMAP_FOREACH(j, tr->jobs) {
 
                /* Assume merged */
                assert(!j->transaction_prev);
                assert(!j->transaction_next);
 
                if (j->unit->job && (IN_SET(mode, JOB_FAIL, JOB_LENIENT) || j->unit->job->irreversible) &&
                    job_type_is_conflicting(j->unit->job->type, j->type)) {
                        _cleanup_free_ char *anchors = NULL;
                        Job *a;
 
                        SET_FOREACH(a, tr->anchor_jobs)
                                if (strextendf_with_separator(&anchors, ", ", "%s/%s",
                                                              a->unit->id, job_type_to_string(a->type)) < 0)
                                        return -ENOMEM;
 
                        return sd_bus_error_setf(e, BUS_ERROR_TRANSACTION_IS_DESTRUCTIVE,
                                                 "Transaction for %s is destructive (%s has '%s' job queued, but '%s' is included in transaction).",
                                                 strna(anchors),
                                                 j->unit->id, job_type_to_string(j->unit->job->type), job_type_to_string(j->type));
                }
        }
 
        return 0;
}
 
static int transaction_minimize_impact(Transaction *tr, JobMode mode, sd_bus_error *e) {
        Job *head;
 
        assert(tr);
 
        /* Drops all unnecessary jobs that reverse already active jobs or that stop a running service. */
 
        if (!IN_SET(mode, JOB_FAIL, JOB_LENIENT))
                return 0;
 
rescan:
        HASHMAP_FOREACH(head, tr->jobs) {
                LIST_FOREACH(transaction, j, head) {
                        bool stops_running_service, changes_existing_job;
 
                        /* If it matters, we shouldn't drop it. */
                        if (j->matters_to_anchor && mode != JOB_LENIENT)
                                continue;
 
                        /* Would this stop a running service? Would this change an existing job? If so, let's
                         * drop this entry. */
 
                        stops_running_service =
                                j->type == JOB_STOP && UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(j->unit));
 
                        changes_existing_job =
                                j->unit->job &&
                                job_type_is_conflicting(j->type, j->unit->job->type);
 
                        if (!stops_running_service && !changes_existing_job)
                                continue;
 
                        if (j->matters_to_anchor) {
                                assert(mode == JOB_LENIENT);
                                return sd_bus_error_setf(e, BUS_ERROR_TRANSACTION_IS_DESTRUCTIVE,
                                                         "%s/%s would stop a running unit or change existing job, bailing",
                                                         j->unit->id, job_type_to_string(j->type));
                        }
 
                        if (stops_running_service)
                                log_unit_debug(j->unit,
                                               "%s/%s would stop a running service.",
                                               j->unit->id, job_type_to_string(j->type));
 
                        if (changes_existing_job)
                                log_unit_debug(j->unit,
                                               "%s/%s would change existing job.",
                                               j->unit->id, job_type_to_string(j->type));
 
                        /* Ok, let's get rid of this. */
                        log_unit_debug(j->unit,
                                       "Deleting %s/%s to minimize impact.",
                                       j->unit->id, job_type_to_string(j->type));
 
                        transaction_delete_job(tr, j, true);
                        goto rescan;
                }
        }
 
        return 0;
}
 
static int transaction_apply(
                Transaction *tr,
                Manager *m,
                JobMode mode,
                Set *affected_jobs) {
 
        Job *j;
        int r;
 
        assert(tr);
        assert(m);
 
        /* Moves the transaction jobs to the set of active jobs. */
 
        if (IN_SET(mode, JOB_ISOLATE, JOB_FLUSH)) {
 
                /* When isolating first kill all installed jobs which aren't part of the new transaction. */
                HASHMAP_FOREACH(j, m->jobs) {
                        assert(j->installed);
 
                        if (j->unit->ignore_on_isolate)
                                continue;
 
                        if (hashmap_contains(tr->jobs, j->unit))
                                continue;
 
                        /* Not invalidating recursively. Avoids triggering OnFailure= actions of dependent
                         * jobs. Also avoids invalidating our iterator. */
                        job_finish_and_invalidate(j, JOB_CANCELED, false, false);
                }
        }
 
        HASHMAP_FOREACH(j, tr->jobs) {
                /* Assume merged. */
                assert(!j->transaction_prev);
                assert(!j->transaction_next);
 
                r = hashmap_ensure_put(&m->jobs, NULL, UINT32_TO_PTR(j->id), j);
                if (r < 0)
                        goto rollback;
        }
 
        while ((j = hashmap_steal_first(tr->jobs))) {
                Job *installed_job;
 
                /* Clean the job dependencies. */
                transaction_unlink_job(tr, j, false);
 
                installed_job = job_install(j);
                if (installed_job != j) {
                        /* j has been merged into a previously installed job. */
                        if (set_contains(tr->anchor_jobs, j)) {
                                r = set_remove_and_put(tr->anchor_jobs, j, installed_job);
                                if (r == -EEXIST)
                                        /* installed_job is already an anchor; just drop the
                                         * about-to-be-freed key so it doesn't linger. */
                                        (void) set_remove(tr->anchor_jobs, j);
                                else
                                        /* Old key was present and remove -> put cannot fail */
                                        assert(r >= 0);
                        }
 
                        hashmap_remove_value(m->jobs, UINT32_TO_PTR(j->id), j);
                        free_and_replace_full(j, installed_job, job_free);
                }
 
                job_add_to_run_queue(j);
                job_add_to_dbus_queue(j);
                job_start_timer(j, false);
                job_shutdown_magic(j);
 
                /* When 'affected' is specified, let's track all in it all jobs that were touched because of
                 * this transaction. */
                if (affected_jobs)
                        (void) set_put(affected_jobs, j);
        }
 
        return 0;
 
rollback:
 
        HASHMAP_FOREACH(j, tr->jobs)
                hashmap_remove_value(m->jobs, UINT32_TO_PTR(j->id), j);
 
        return r;
}
 
int transaction_activate(
                Transaction *tr,
                Manager *m,
                JobMode mode,
                Set *affected_jobs,
                sd_bus_error *e) {
 
        Job *j;
        int r;
        unsigned generation = 1;
 
        /* This applies the changes recorded in tr->jobs to the actual list of jobs, if possible. */
 
        assert(tr);
        assert(m);
 
        /* Reset the generation counter of all installed jobs. The detection of cycles looks at installed
         * jobs. If they had a non-zero generation from some previous walk of the graph, the algorithm would
         * break. */
        HASHMAP_FOREACH(j, m->jobs)
                j->generation = 0;
 
        /* First step: figure out which jobs matter. */
        transaction_find_jobs_that_matter_to_anchor(tr, generation++);
 
        /* Second step: Try not to stop any running services if we don't have to. Don't try to reverse
         * running jobs if we don't have to. */
        r = transaction_minimize_impact(tr, mode, e);
        if (r < 0)
                return r; /* Note that we don't log here, because for JOB_LENIENT conflicts are very much
                           * expected and shouldn't appear to be fatal for the unit. Only inform the caller
                           * via bus error. */
 
        /* Third step: Drop redundant jobs. */
        transaction_drop_redundant(tr);
 
        for (;;) {
                /* Fourth step: Let's remove unneeded jobs that might be lurking. */
                if (mode != JOB_ISOLATE)
                        transaction_collect_garbage(tr, generation++);
 
                /* Fifth step: verify order makes sense and correct cycles if necessary and possible. */
                r = transaction_verify_order(tr, &generation, e);
                if (r >= 0)
                        break;
                if (r != -EAGAIN)
                        return log_warning_errno(r, "Requested transaction contains an unfixable cyclic ordering dependency: %s",
                                                 bus_error_message(e, r));
 
                /* Let's see if the resulting transaction ordering graph is still cyclic... */
        }
 
        for (;;) {
                /* Sixth step: let's drop unmergeable entries if necessary and possible, merge entries we can
                 * merge. */
                r = transaction_merge_jobs(tr, e);
                if (r >= 0)
                        break;
                if (r != -EAGAIN)
                        return log_warning_errno(r, "Requested transaction contains unmergeable jobs: %s",
                                                 bus_error_message(e, r));
 
                /* Seventh step: an entry got dropped, let's garbage collect its dependencies. */
                if (mode != JOB_ISOLATE)
                        transaction_collect_garbage(tr, generation++);
 
                /* Let's see if the resulting transaction still has unmergeable entries... */
        }
 
        /* Eights step: Drop redundant jobs again, if the merging now allows us to drop more. */
        transaction_drop_redundant(tr);
 
        /* Ninth step: check whether we can actually apply this. */
        r = transaction_is_destructive(tr, mode, e);
        if (r < 0)
                return log_notice_errno(r, "Requested transaction contradicts existing jobs: %s",
                                        bus_error_message(e, r));
 
        /* Tenth step: apply changes. */
        r = transaction_apply(tr, m, mode, affected_jobs);
        if (r < 0)
                return log_warning_errno(r, "Failed to apply transaction: %m");
 
        assert(hashmap_isempty(tr->jobs));
 
        /* Are there any jobs now? Then make sure we have the idle pipe around. We don't really care too much
         * whether this works or not, as the idle pipe is a feature for cosmetics, not actually useful for
         * anything beyond that. */
        if (!hashmap_isempty(m->jobs))
                (void) manager_allocate_idle_pipe(m);
 
        return 0;
}
 
static Job* transaction_add_one_job(Transaction *tr, JobType type, Unit *unit, bool *is_new) {
        Job *j, *f;
 
        assert(tr);
        assert(unit);
 
        /* Looks for an existing prospective job and returns that. If it doesn't exist it is created and
         * added to the prospective jobs list. */
 
        f = hashmap_get(tr->jobs, unit);
 
        LIST_FOREACH(transaction, i, f) {
                assert(i->unit == unit);
 
                if (i->type == type) {
                        if (is_new)
                                *is_new = false;
                        return i;
                }
        }
 
        j = job_new(unit, type);
        if (!j)
                return NULL;
 
        j->irreversible = tr->irreversible;
 
        LIST_PREPEND(transaction, f, j);
 
        if (hashmap_replace(tr->jobs, unit, f) < 0) {
                LIST_REMOVE(transaction, f, j);
                job_free(j);
                return NULL;
        }
 
        if (is_new)
                *is_new = true;
 
        log_trace("Added job %s/%s to transaction.", unit->id, job_type_to_string(type));
 
        return j;
}
 
static void transaction_unlink_job(Transaction *tr, Job *j, bool delete_dependencies) {
        assert(tr);
        assert(j);
 
        if (j->transaction_prev)
                j->transaction_prev->transaction_next = j->transaction_next;
        else if (j->transaction_next)
                hashmap_replace(tr->jobs, j->unit, j->transaction_next);
        else
                hashmap_remove_value(tr->jobs, j->unit, j);
 
        if (j->transaction_next)
                j->transaction_next->transaction_prev = j->transaction_prev;
 
        j->transaction_prev = j->transaction_next = NULL;
 
        while (j->subject_list)
                job_dependency_free(j->subject_list);
 
        while (j->object_list) {
                Job *other = j->object_list->matters ? j->object_list->subject : NULL;
 
                job_dependency_free(j->object_list);
 
                if (other && delete_dependencies) {
                        log_unit_debug(other->unit,
                                       "Deleting job %s/%s as dependency of job %s/%s",
                                       other->unit->id, job_type_to_string(other->type),
                                       j->unit->id, job_type_to_string(j->type));
                        transaction_delete_job(tr, other, delete_dependencies);
                }
        }
}
 
void transaction_add_propagate_reload_jobs(
                Transaction *tr,
                Unit *unit,
                Job *by,
                TransactionAddFlags flags) {
 
        JobType nt;
        Unit *dep;
        int r;
 
        assert(tr);
        assert(unit);
 
        UNIT_FOREACH_DEPENDENCY_SAFE(dep, unit, UNIT_ATOM_PROPAGATES_RELOAD_TO) {
                _cleanup_(sd_bus_error_free) sd_bus_error e = SD_BUS_ERROR_NULL;
 
                nt = job_type_collapse(JOB_TRY_RELOAD, dep);
                if (nt == JOB_NOP)
                        continue;
 
                r = transaction_add_job_and_dependencies(tr, nt, dep, by, flags, &e);
                if (r < 0)
                        log_unit_warning(dep,
                                         "Cannot add dependency reload job, ignoring: %s",
                                         bus_error_message(&e, r));
        }