/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ #ifndef foojobhfoo #define foojobhfoo /*** This file is part of systemd. Copyright 2010 Lennart Poettering systemd is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. systemd is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with systemd; If not, see <http://www.gnu.org/licenses/>. ***/ #include <stdbool.h> #include <inttypes.h> #include <errno.h> typedef struct Job Job; typedef struct JobDependency JobDependency; typedef enum JobType JobType; typedef enum JobState JobState; typedef enum JobMode JobMode; typedef enum JobResult JobResult; #include "manager.h" #include "unit.h" #include "hashmap.h" #include "list.h" /* Be careful when changing the job types! Adjust job_merging_table[] accordingly! */ enum JobType { JOB_START, /* if a unit does not support being started, we'll just wait until it becomes active */ JOB_VERIFY_ACTIVE, JOB_STOP, JOB_RELOAD, /* if running reload */ JOB_RELOAD_OR_START, /* if running reload, if not running start */ /* Note that restarts are first treated like JOB_STOP, but * then instead of finishing are patched to become * JOB_START. */ JOB_RESTART, /* if running stop, then start unconditionally */ JOB_TRY_RESTART, /* if running stop and then start */ _JOB_TYPE_MAX, _JOB_TYPE_INVALID = -1 }; enum JobState { JOB_WAITING, JOB_RUNNING, _JOB_STATE_MAX, _JOB_STATE_INVALID = -1 }; enum JobMode { JOB_FAIL, /* Fail if a conflicting job is already queued */ JOB_REPLACE, /* Replace an existing conflicting job */ JOB_ISOLATE, /* Start a unit, and stop all others */ JOB_IGNORE_DEPENDENCIES, /* Ignore both requirement and ordering dependencies */ JOB_IGNORE_REQUIREMENTS, /* Ignore requirement dependencies */ _JOB_MODE_MAX, _JOB_MODE_INVALID = -1 }; enum JobResult { JOB_DONE, JOB_CANCELED, JOB_TIMEOUT, JOB_FAILED, JOB_DEPENDENCY, JOB_SKIPPED, _JOB_RESULT_MAX, _JOB_RESULT_INVALID = -1 }; struct JobDependency { /* Encodes that the 'subject' job needs the 'object' job in * some way. This structure is used only while building a transaction. */ Job *subject; Job *object; LIST_FIELDS(JobDependency, subject); LIST_FIELDS(JobDependency, object); bool matters; bool conflicts; }; struct Job { Manager *manager; Unit *unit; LIST_FIELDS(Job, transaction); LIST_FIELDS(Job, run_queue); LIST_FIELDS(Job, dbus_queue); LIST_HEAD(JobDependency, subject_list); LIST_HEAD(JobDependency, object_list); /* Used for graph algs as a "I have been here" marker */ Job* marker; unsigned generation; uint32_t id; JobType type; JobState state; Watch timer_watch; /* Note that this bus object is not ref counted here. */ DBusConnection *bus; char *bus_client; JobResult result; bool installed:1; bool in_run_queue:1; bool matters_to_anchor:1; bool override:1; bool in_dbus_queue:1; bool sent_dbus_new_signal:1; bool ignore_order:1; }; Job* job_new(Unit *unit, JobType type); void job_uninstall(Job *j); void job_free(Job *job); void job_dump(Job *j, FILE*f, const char *prefix); JobDependency* job_dependency_new(Job *subject, Job *object, bool matters, bool conflicts); void job_dependency_free(JobDependency *l); int job_merge(Job *j, Job *other); JobType job_type_lookup_merge(JobType a, JobType b); static inline int job_type_merge(JobType *a, JobType b) { JobType t = job_type_lookup_merge(*a, b); if (t < 0) return -EEXIST; *a = t; return 0; } static inline bool job_type_is_mergeable(JobType a, JobType b) { return job_type_lookup_merge(a, b) >= 0; } static inline bool job_type_is_conflicting(JobType a, JobType b) { return !job_type_is_mergeable(a, b); } static inline bool job_type_is_superset(JobType a, JobType b) { /* Checks whether operation a is a "superset" of b in its actions */ return a == job_type_lookup_merge(a, b); } bool job_type_is_redundant(JobType a, UnitActiveState b); bool job_is_runnable(Job *j); void job_add_to_run_queue(Job *j); void job_add_to_dbus_queue(Job *j); int job_start_timer(Job *j); void job_timer_event(Job *j, uint64_t n_elapsed, Watch *w); int job_run_and_invalidate(Job *j); int job_finish_and_invalidate(Job *j, JobResult result); char *job_dbus_path(Job *j); const char* job_type_to_string(JobType t); JobType job_type_from_string(const char *s); const char* job_state_to_string(JobState t); JobState job_state_from_string(const char *s); const char* job_mode_to_string(JobMode t); JobMode job_mode_from_string(const char *s); const char* job_result_to_string(JobResult t); JobResult job_result_from_string(const char *s); #endif