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 General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 systemd is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with systemd; If not, see <http://www.gnu.org/licenses/>.
24 #include <sys/timerfd.h>
25 #include <sys/epoll.h>
31 #include "load-fragment.h"
32 #include "load-dropin.h"
36 Job* job_new(Manager *m, JobType type, Unit *unit) {
40 assert(type < _JOB_TYPE_MAX);
43 if (!(j = new0(Job, 1)))
47 j->id = m->current_job_id++;
51 j->timer_watch.type = WATCH_INVALID;
53 /* We don't link it here, that's what job_dependency() is for */
58 void job_free(Job *j) {
61 /* Detach from next 'bigger' objects */
63 bus_job_send_removed_signal(j, !j->failed);
65 if (j->unit->meta.job == j) {
66 j->unit->meta.job = NULL;
67 unit_add_to_gc_queue(j->unit);
70 hashmap_remove(j->manager->jobs, UINT32_TO_PTR(j->id));
74 /* Detach from next 'smaller' objects */
75 manager_transaction_unlink_job(j->manager, j, true);
78 LIST_REMOVE(Job, run_queue, j->manager->run_queue, j);
81 LIST_REMOVE(Job, dbus_queue, j->manager->dbus_job_queue, j);
83 if (j->timer_watch.type != WATCH_INVALID) {
84 assert(j->timer_watch.type == WATCH_JOB_TIMER);
85 assert(j->timer_watch.data.job == j);
86 assert(j->timer_watch.fd >= 0);
88 assert_se(epoll_ctl(j->manager->epoll_fd, EPOLL_CTL_DEL, j->timer_watch.fd, NULL) >= 0);
89 close_nointr_nofail(j->timer_watch.fd);
96 JobDependency* job_dependency_new(Job *subject, Job *object, bool matters, bool conflicts) {
101 /* Adds a new job link, which encodes that the 'subject' job
102 * needs the 'object' job in some way. If 'subject' is NULL
103 * this means the 'anchor' job (i.e. the one the user
104 * explcitily asked for) is the requester. */
106 if (!(l = new0(JobDependency, 1)))
109 l->subject = subject;
111 l->matters = matters;
112 l->conflicts = conflicts;
115 LIST_PREPEND(JobDependency, subject, subject->subject_list, l);
117 LIST_PREPEND(JobDependency, subject, object->manager->transaction_anchor, l);
119 LIST_PREPEND(JobDependency, object, object->object_list, l);
124 void job_dependency_free(JobDependency *l) {
128 LIST_REMOVE(JobDependency, subject, l->subject->subject_list, l);
130 LIST_REMOVE(JobDependency, subject, l->object->manager->transaction_anchor, l);
132 LIST_REMOVE(JobDependency, object, l->object->object_list, l);
137 void job_dump(Job *j, FILE*f, const char *prefix) {
146 "%s\tAction: %s -> %s\n"
150 prefix, j->unit->meta.id, job_type_to_string(j->type),
151 prefix, job_state_to_string(j->state),
152 prefix, yes_no(j->override));
155 bool job_is_anchor(Job *j) {
160 LIST_FOREACH(object, l, j->object_list)
167 static bool types_match(JobType a, JobType b, JobType c, JobType d) {
169 (a == c && b == d) ||
173 int job_type_merge(JobType *a, JobType b) {
177 /* Merging is associative! a merged with b merged with c is
178 * the same as a merged with c merged with b. */
180 /* Mergeability is transitive! if a can be merged with b and b
181 * with c then a also with c */
183 /* Also, if a merged with b cannot be merged with c, then
184 * either a or b cannot be merged with c either */
186 if (types_match(*a, b, JOB_START, JOB_VERIFY_ACTIVE))
188 else if (types_match(*a, b, JOB_START, JOB_RELOAD) ||
189 types_match(*a, b, JOB_START, JOB_RELOAD_OR_START) ||
190 types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD_OR_START) ||
191 types_match(*a, b, JOB_RELOAD, JOB_RELOAD_OR_START))
192 *a = JOB_RELOAD_OR_START;
193 else if (types_match(*a, b, JOB_START, JOB_RESTART) ||
194 types_match(*a, b, JOB_START, JOB_TRY_RESTART) ||
195 types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RESTART) ||
196 types_match(*a, b, JOB_RELOAD, JOB_RESTART) ||
197 types_match(*a, b, JOB_RELOAD_OR_START, JOB_RESTART) ||
198 types_match(*a, b, JOB_RELOAD_OR_START, JOB_TRY_RESTART) ||
199 types_match(*a, b, JOB_RESTART, JOB_TRY_RESTART))
201 else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD))
203 else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_TRY_RESTART) ||
204 types_match(*a, b, JOB_RELOAD, JOB_TRY_RESTART))
205 *a = JOB_TRY_RESTART;
212 bool job_type_is_mergeable(JobType a, JobType b) {
213 return job_type_merge(&a, b) >= 0;
216 bool job_type_is_superset(JobType a, JobType b) {
218 /* Checks whether operation a is a "superset" of b in its
226 return b == JOB_VERIFY_ACTIVE;
230 b == JOB_VERIFY_ACTIVE;
232 case JOB_RELOAD_OR_START:
236 b == JOB_VERIFY_ACTIVE;
241 b == JOB_VERIFY_ACTIVE ||
243 b == JOB_RELOAD_OR_START ||
244 b == JOB_TRY_RESTART;
246 case JOB_TRY_RESTART:
248 b == JOB_VERIFY_ACTIVE ||
256 bool job_type_is_conflicting(JobType a, JobType b) {
257 assert(a >= 0 && a < _JOB_TYPE_MAX);
258 assert(b >= 0 && b < _JOB_TYPE_MAX);
260 return (a == JOB_STOP) != (b == JOB_STOP);
263 bool job_type_is_redundant(JobType a, UnitActiveState b) {
273 b == UNIT_INACTIVE ||
276 case JOB_VERIFY_ACTIVE:
285 case JOB_RELOAD_OR_START:
287 b == UNIT_ACTIVATING ||
292 b == UNIT_ACTIVATING;
294 case JOB_TRY_RESTART:
296 b == UNIT_ACTIVATING;
299 assert_not_reached("Invalid job type");
303 bool job_is_runnable(Job *j) {
308 assert(j->installed);
310 /* Checks whether there is any job running for the units this
311 * job needs to be running after (in the case of a 'positive'
312 * job type) or before (in the case of a 'negative' job type
315 if (j->type == JOB_START ||
316 j->type == JOB_VERIFY_ACTIVE ||
317 j->type == JOB_RELOAD ||
318 j->type == JOB_RELOAD_OR_START) {
320 /* Immediate result is that the job is or might be
321 * started. In this case lets wait for the
322 * dependencies, regardless whether they are
323 * starting or stopping something. */
325 SET_FOREACH(other, j->unit->meta.dependencies[UNIT_AFTER], i)
330 /* Also, if something else is being stopped and we should
331 * change state after it, then lets wait. */
333 SET_FOREACH(other, j->unit->meta.dependencies[UNIT_BEFORE], i)
334 if (other->meta.job &&
335 (other->meta.job->type == JOB_STOP ||
336 other->meta.job->type == JOB_RESTART ||
337 other->meta.job->type == JOB_TRY_RESTART))
340 /* This means that for a service a and a service b where b
341 * shall be started after a:
343 * start a + start b → 1st step start a, 2nd step start b
344 * start a + stop b → 1st step stop b, 2nd step start a
345 * stop a + start b → 1st step stop a, 2nd step start b
346 * stop a + stop b → 1st step stop b, 2nd step stop a
348 * This has the side effect that restarts are properly
349 * synchronized too. */
354 int job_run_and_invalidate(Job *j) {
360 assert(j->installed);
362 if (j->in_run_queue) {
363 LIST_REMOVE(Job, run_queue, j->manager->run_queue, j);
364 j->in_run_queue = false;
367 if (j->state != JOB_WAITING)
370 if (!job_is_runnable(j))
373 j->state = JOB_RUNNING;
374 job_add_to_dbus_queue(j);
376 /* While we execute this operation the job might go away (for
377 * example: because it is replaced by a new, conflicting
378 * job.) To make sure we don't access a freed job later on we
379 * store the id here, so that we can verify the job is still
387 r = unit_start(j->unit);
392 case JOB_VERIFY_ACTIVE: {
393 UnitActiveState t = unit_active_state(j->unit);
394 if (UNIT_IS_ACTIVE_OR_RELOADING(t))
396 else if (t == UNIT_ACTIVATING)
404 r = unit_stop(j->unit);
408 r = unit_reload(j->unit);
411 case JOB_RELOAD_OR_START:
412 if (unit_active_state(j->unit) == UNIT_ACTIVE)
413 r = unit_reload(j->unit);
415 r = unit_start(j->unit);
419 UnitActiveState t = unit_active_state(j->unit);
420 if (t == UNIT_INACTIVE || t == UNIT_FAILED || t == UNIT_ACTIVATING) {
422 r = unit_start(j->unit);
424 r = unit_stop(j->unit);
428 case JOB_TRY_RESTART: {
429 UnitActiveState t = unit_active_state(j->unit);
430 if (t == UNIT_INACTIVE || t == UNIT_FAILED || t == UNIT_DEACTIVATING)
432 else if (t == UNIT_ACTIVATING) {
434 r = unit_start(j->unit);
436 r = unit_stop(j->unit);
441 assert_not_reached("Unknown job type");
444 if ((j = manager_get_job(m, id))) {
446 r = job_finish_and_invalidate(j, true);
447 else if (r == -EAGAIN)
448 j->state = JOB_WAITING;
450 r = job_finish_and_invalidate(j, false);
456 int job_finish_and_invalidate(Job *j, bool success) {
463 assert(j->installed);
465 job_add_to_dbus_queue(j);
467 /* Patch restart jobs so that they become normal start jobs */
468 if (success && (j->type == JOB_RESTART || j->type == JOB_TRY_RESTART)) {
470 log_debug("Converting job %s/%s -> %s/%s",
471 j->unit->meta.id, job_type_to_string(j->type),
472 j->unit->meta.id, job_type_to_string(JOB_START));
474 j->state = JOB_WAITING;
477 job_add_to_run_queue(j);
481 j->failed = !success;
483 log_debug("Job %s/%s finished, success=%s", j->unit->meta.id, job_type_to_string(j->type), yes_no(success));
486 j->manager->n_failed_jobs ++;
492 if (!success && j->type == JOB_START)
493 unit_status_printf(u, "Starting %s " ANSI_HIGHLIGHT_ON "failed" ANSI_HIGHLIGHT_OFF ".\n", unit_description(u));
495 /* Fail depending jobs on failure */
498 if (t == JOB_START ||
499 t == JOB_VERIFY_ACTIVE ||
500 t == JOB_RELOAD_OR_START) {
502 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
503 if (other->meta.job &&
504 (other->meta.job->type == JOB_START ||
505 other->meta.job->type == JOB_VERIFY_ACTIVE ||
506 other->meta.job->type == JOB_RELOAD_OR_START))
507 job_finish_and_invalidate(other->meta.job, false);
509 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
510 if (other->meta.job &&
511 !other->meta.job->override &&
512 (other->meta.job->type == JOB_START ||
513 other->meta.job->type == JOB_VERIFY_ACTIVE ||
514 other->meta.job->type == JOB_RELOAD_OR_START))
515 job_finish_and_invalidate(other->meta.job, false);
517 } else if (t == JOB_STOP) {
519 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTS], i)
520 if (other->meta.job &&
521 (other->meta.job->type == JOB_START ||
522 other->meta.job->type == JOB_VERIFY_ACTIVE ||
523 other->meta.job->type == JOB_RELOAD_OR_START))
524 job_finish_and_invalidate(other->meta.job, false);
528 /* Try to start the next jobs that can be started */
529 SET_FOREACH(other, u->meta.dependencies[UNIT_AFTER], i)
531 job_add_to_run_queue(other->meta.job);
532 SET_FOREACH(other, u->meta.dependencies[UNIT_BEFORE], i)
534 job_add_to_run_queue(other->meta.job);
536 manager_check_finished(u->meta.manager);
541 int job_start_timer(Job *j) {
542 struct itimerspec its;
543 struct epoll_event ev;
547 if (j->unit->meta.job_timeout <= 0 ||
548 j->timer_watch.type == WATCH_JOB_TIMER)
551 assert(j->timer_watch.type == WATCH_INVALID);
553 if ((fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK|TFD_CLOEXEC)) < 0) {
559 timespec_store(&its.it_value, j->unit->meta.job_timeout);
561 if (timerfd_settime(fd, 0, &its, NULL) < 0) {
567 ev.data.ptr = &j->timer_watch;
570 if (epoll_ctl(j->manager->epoll_fd, EPOLL_CTL_ADD, fd, &ev) < 0) {
575 j->timer_watch.type = WATCH_JOB_TIMER;
576 j->timer_watch.fd = fd;
577 j->timer_watch.data.job = j;
583 close_nointr_nofail(fd);
588 void job_add_to_run_queue(Job *j) {
590 assert(j->installed);
595 LIST_PREPEND(Job, run_queue, j->manager->run_queue, j);
596 j->in_run_queue = true;
599 void job_add_to_dbus_queue(Job *j) {
601 assert(j->installed);
603 if (j->in_dbus_queue)
606 /* We don't check if anybody is subscribed here, since this
607 * job might just have been created and not yet assigned to a
608 * connection/client. */
610 LIST_PREPEND(Job, dbus_queue, j->manager->dbus_job_queue, j);
611 j->in_dbus_queue = true;
614 char *job_dbus_path(Job *j) {
619 if (asprintf(&p, "/org/freedesktop/systemd1/job/%lu", (unsigned long) j->id) < 0)
625 void job_timer_event(Job *j, uint64_t n_elapsed, Watch *w) {
627 assert(w == &j->timer_watch);
629 log_warning("Job %s/%s timed out.", j->unit->meta.id, job_type_to_string(j->type));
630 job_finish_and_invalidate(j, false);
633 static const char* const job_state_table[_JOB_STATE_MAX] = {
634 [JOB_WAITING] = "waiting",
635 [JOB_RUNNING] = "running"
638 DEFINE_STRING_TABLE_LOOKUP(job_state, JobState);
640 static const char* const job_type_table[_JOB_TYPE_MAX] = {
641 [JOB_START] = "start",
642 [JOB_VERIFY_ACTIVE] = "verify-active",
644 [JOB_RELOAD] = "reload",
645 [JOB_RELOAD_OR_START] = "reload-or-start",
646 [JOB_RESTART] = "restart",
647 [JOB_TRY_RESTART] = "try-restart",
650 DEFINE_STRING_TABLE_LOOKUP(job_type, JobType);
652 static const char* const job_mode_table[_JOB_MODE_MAX] = {
654 [JOB_REPLACE] = "replace",
655 [JOB_ISOLATE] = "isolate"
658 DEFINE_STRING_TABLE_LOOKUP(job_mode, JobMode);