[people/ms/systemd.git] / job.c

/*-*- Mode: C; c-basic-offset: 8 -*-*/

#include <assert.h>
#include <errno.h>

#include "macro.h"
#include "job.h"

Job* job_new(Manager *m, JobType type, Name *name) {
        Job *j;

        assert(m);
        assert(type < _JOB_TYPE_MAX);
        assert(name);

        if (!(j = new0(Job, 1)))
                return NULL;

        j->manager = m;
        j->id = m->current_job_id++;
        j->type = type;
        j->name = name;

        /* We don't link it here, that's what job_dependency() is for */

        return j;
}

void job_free(Job *j) {
        assert(j);

        /* Detach from next 'bigger' objects */
        if (j->linked) {
                if (j->name->meta.job == j)
                        j->name->meta.job = NULL;

                hashmap_remove(j->manager->jobs, UINT32_TO_PTR(j->id));
                j->linked = false;
        }

        /* Detach from next 'smaller' objects */
        manager_transaction_unlink_job(j->manager, j);

        free(j);
}

JobDependency* job_dependency_new(Job *subject, Job *object, bool matters) {
        JobDependency *l;

        assert(object);

        /* Adds a new job link, which encodes that the 'subject' job
         * needs the 'object' job in some way. If 'subject' is NULL
         * this means the 'anchor' job (i.e. the one the user
         * explcitily asked for) is the requester. */

        if (!(l = new0(JobDependency, 1)))
                return NULL;

        l->subject = subject;
        l->object = object;
        l->matters = matters;

        if (subject)
                LIST_PREPEND(JobDependency, subject, subject->subject_list, l);
        else
                LIST_PREPEND(JobDependency, subject, object->manager->transaction_anchor, l);

        LIST_PREPEND(JobDependency, object, object->object_list, l);

        return l;
}

void job_dependency_free(JobDependency *l) {
        assert(l);

        if (l->subject)
                LIST_REMOVE(JobDependency, subject, l->subject->subject_list, l);
        else
                LIST_REMOVE(JobDependency, subject, l->object->manager->transaction_anchor, l);

        LIST_REMOVE(JobDependency, object, l->object->object_list, l);

        free(l);
}

void job_dependency_delete(Job *subject, Job *object, bool *matters) {
        JobDependency *l;

        assert(object);

        LIST_FOREACH(object, l, object->object_list) {
                assert(l->object == object);

                if (l->subject == subject)
                        break;
        }

        if (!l) {
                if (matters)
                        *matters = false;
                return;
        }

        if (matters)
                *matters = l->matters;

        job_dependency_free(l);
}

const char* job_type_to_string(JobType t) {

        static const char* const job_type_table[_JOB_TYPE_MAX] = {
                [JOB_START] = "start",
                [JOB_VERIFY_ACTIVE] = "verify-active",
                [JOB_STOP] = "stop",
                [JOB_RELOAD] = "reload",
                [JOB_RELOAD_OR_START] = "reload-or-start",
                [JOB_RESTART] = "restart",
                [JOB_TRY_RESTART] = "try-restart",
        };

        if (t < 0 || t >= _JOB_TYPE_MAX)
                return "n/a";

        return job_type_table[t];
}

void job_dump(Job *j, FILE*f, const char *prefix) {

        static const char* const job_state_table[_JOB_STATE_MAX] = {
                [JOB_WAITING] = "waiting",
                [JOB_RUNNING] = "running"
        };

        assert(j);
        assert(f);

        fprintf(f,
                "%s→ Job %u:\n"
                "%s\tAction: %s → %s\n"
                "%s\tState: %s\n"
                "%s\tForced: %s\n",
                prefix, j->id,
                prefix, name_id(j->name), job_type_to_string(j->type),
                prefix, job_state_table[j->state],
                prefix, yes_no(j->forced));
}

bool job_is_anchor(Job *j) {
        JobDependency *l;

        assert(j);

        LIST_FOREACH(object, l, j->object_list)
                if (!l->subject)
                        return true;

        return false;
}

static bool types_match(JobType a, JobType b, JobType c, JobType d) {
        return
                (a == c && b == d) ||
                (a == d && b == c);
}

int job_type_merge(JobType *a, JobType b) {
        if (*a == b)
                return 0;

        /* Merging is associative! a merged with b merged with c is
         * the same as a merged with c merged with b. */

        /* Mergeability is transitive! if a can be merged with b and b
         * with c then a also with c */

        /* Also, if a merged with b cannot be merged with c, then
         * either a or b cannot be merged with c either */

        if (types_match(*a, b, JOB_START, JOB_VERIFY_ACTIVE))
                *a = JOB_START;
        else if (types_match(*a, b, JOB_START, JOB_RELOAD) ||
                 types_match(*a, b, JOB_START, JOB_RELOAD_OR_START) ||
                 types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD_OR_START) ||
                 types_match(*a, b, JOB_RELOAD, JOB_RELOAD_OR_START))
                *a = JOB_RELOAD_OR_START;
        else if (types_match(*a, b, JOB_START, JOB_RESTART) ||
                 types_match(*a, b, JOB_START, JOB_TRY_RESTART) ||
                 types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RESTART) ||
                 types_match(*a, b, JOB_RELOAD, JOB_RESTART) ||
                 types_match(*a, b, JOB_RELOAD_OR_START, JOB_RESTART) ||
                 types_match(*a, b, JOB_RELOAD_OR_START, JOB_TRY_RESTART) ||
                 types_match(*a, b, JOB_RESTART, JOB_TRY_RESTART))
                *a = JOB_RESTART;
        else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD))
                *a = JOB_RELOAD;
        else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_TRY_RESTART) ||
                 types_match(*a, b, JOB_RELOAD, JOB_TRY_RESTART))
                *a = JOB_TRY_RESTART;
        else
                return -EEXIST;

        return 0;
}

bool job_type_is_mergeable(JobType a, JobType b) {
        return job_type_merge(&a, b) >= 0;
}

bool job_type_is_superset(JobType a, JobType b) {

        /* Checks whether operation a is a "superset" of b in its
         * actions */

        if (a == b)
                return true;

        switch (a) {
                case JOB_START:
                        return b == JOB_VERIFY_ACTIVE;

                case JOB_RELOAD:
                        return
                                b == JOB_VERIFY_ACTIVE;

                case JOB_RELOAD_OR_START:
                        return
                                b == JOB_RELOAD ||
                                b == JOB_START ||
                                b == JOB_VERIFY_ACTIVE;

                case JOB_RESTART:
                        return
                                b == JOB_START ||
                                b == JOB_VERIFY_ACTIVE ||
                                b == JOB_RELOAD ||
                                b == JOB_RELOAD_OR_START ||
                                b == JOB_TRY_RESTART;

                case JOB_TRY_RESTART:
                        return
                                b == JOB_VERIFY_ACTIVE ||
                                b == JOB_RELOAD;
                default:
                        return false;

        }
}

bool job_type_is_conflicting(JobType a, JobType b) {
        assert(a >= 0 && a < _JOB_TYPE_MAX);
        assert(b >= 0 && b < _JOB_TYPE_MAX);

        return (a == JOB_STOP) != (b == JOB_STOP);
}

bool job_is_runnable(Job *j) {
        Iterator i;
        Name *other;

        assert(j);
        assert(j->linked);

        /* Checks whether there is any job running for the names this
         * job needs to be running after (in the case of a 'positive'
         * job type) or before (in the case of a 'negative' job type
         * . */

        if (j->type == JOB_START ||
            j->type == JOB_VERIFY_ACTIVE ||
            j->type == JOB_RELOAD ||
            j->type == JOB_RELOAD_OR_START) {

                /* Immediate result is that the job is or might be
                 * started. In this case lets wait for the
                 * dependencies, regardless whether they are
                 * starting or stopping something. */

                SET_FOREACH(other, j->name->meta.dependencies[NAME_AFTER], i)
                        if (other->meta.job)
                                return false;
        }

        /* Also, if something else is being stopped and we should
         * change state after it, then lets wait. */

        SET_FOREACH(other, j->name->meta.dependencies[NAME_BEFORE], i)
                if (other->meta.job &&
                    (other->meta.job->type == JOB_STOP ||
                     other->meta.job->type == JOB_RESTART ||
                     other->meta.job->type == JOB_TRY_RESTART))
                        return false;

        /* This means that for a service a and a service b where b
         * shall be started after a:
         *
         *  start a + start b → 1st step start a, 2nd step start b
         *  start a + stop b  → 1st step stop b,  2nd step start a
         *  stop a  + start b → 1st step stop a,  2nd step start b
         *  stop a  + stop b  → 1st step stop b,  2nd step stop a
         *
         *  This has the side effect that restarts are properly
         *  synchronized too. */

        return true;
}

int job_run_and_invalidate(Job *j) {
        int r;
        assert(j);

        if (j->in_run_queue) {
                LIST_REMOVE(Job, run_queue, j->manager->run_queue, j);
                j->in_run_queue = false;
        }

        if (j->state != JOB_WAITING)
                return 0;

        if (!job_is_runnable(j))
                return -EAGAIN;

        j->state = JOB_RUNNING;

        switch (j->type) {

                case JOB_START:
                        r = name_start(j->name);
                        if (r == -EBADR)
                                r = 0;
                        break;

                case JOB_VERIFY_ACTIVE: {
                        NameActiveState t = name_active_state(j->name);
                        if (NAME_IS_ACTIVE_OR_RELOADING(t))
                                r = -EALREADY;
                        else if (t == NAME_ACTIVATING)
                                r = -EAGAIN;
                        else
                                r = -ENOEXEC;
                        break;
                }

                case JOB_STOP:
                        r = name_stop(j->name);
                        break;

                case JOB_RELOAD:
                        r = name_reload(j->name);
                        break;

                case JOB_RELOAD_OR_START:
                        if (name_active_state(j->name) == NAME_ACTIVE)
                                r = name_reload(j->name);
                        else
                                r = name_start(j->name);
                        break;

                case JOB_RESTART: {
                        NameActiveState t = name_active_state(j->name);
                        if (t == NAME_INACTIVE || t == NAME_ACTIVATING) {
                                j->type = JOB_START;
                                r = name_start(j->name);
                        } else
                                r = name_stop(j->name);
                        break;
                }

                case JOB_TRY_RESTART: {
                        NameActiveState t = name_active_state(j->name);
                        if (t == NAME_INACTIVE || t == NAME_DEACTIVATING)
                                r = -ENOEXEC;
                        else if (t == NAME_ACTIVATING) {
                                j->type = JOB_START;
                                r = name_start(j->name);
                        } else
                                r = name_stop(j->name);
                        break;
                }

                default:
                        assert_not_reached("Unknown job type");
        }

        if (r == -EALREADY)
                r = job_finish_and_invalidate(j, true);
        else if (r == -EAGAIN) {
                j->state = JOB_WAITING;
                return -EAGAIN;
        } else if (r < 0)
                r = job_finish_and_invalidate(j, false);

        return r;
}

int job_finish_and_invalidate(Job *j, bool success) {
        Name *n;
        Name *other;
        NameType t;
        Iterator i;

        assert(j);

        /* Patch restart jobs so that they become normal start jobs */
        if (success && (j->type == JOB_RESTART || j->type == JOB_TRY_RESTART)) {
                j->state = JOB_RUNNING;
                j->type = JOB_START;
                job_schedule_run(j);
                return 0;
        }

        n = j->name;
        t = j->type;
        job_free(j);

        /* Fail depending jobs on failure */
        if (!success) {

                if (t == JOB_START ||
                    t == JOB_VERIFY_ACTIVE ||
                    t == JOB_RELOAD_OR_START) {

                        SET_FOREACH(other, n->meta.dependencies[NAME_REQUIRED_BY], i)
                                if (other->meta.job &&
                                    (other->meta.type == JOB_START ||
                                     other->meta.type == JOB_VERIFY_ACTIVE ||
                                     other->meta.type == JOB_RELOAD_OR_START))
                                        job_finish_and_invalidate(other->meta.job, false);

                        SET_FOREACH(other, n->meta.dependencies[NAME_SOFT_REQUIRED_BY], i)
                                if (other->meta.job &&
                                    !other->meta.job->forced &&
                                    (other->meta.type == JOB_START ||
                                     other->meta.type == JOB_VERIFY_ACTIVE ||
                                     other->meta.type == JOB_RELOAD_OR_START))
                                        job_finish_and_invalidate(other->meta.job, false);

                } else if (t == JOB_STOP) {

                        SET_FOREACH(other, n->meta.dependencies[NAME_CONFLICTS], i)
                                if (other->meta.job &&
                                    (t == JOB_START ||
                                     t == JOB_VERIFY_ACTIVE ||
                                     t == JOB_RELOAD_OR_START))
                                        job_finish_and_invalidate(other->meta.job, false);
                }
        }

        /* Try to start the next jobs that can be started */
        SET_FOREACH(other, n->meta.dependencies[NAME_AFTER], i)
                if (other->meta.job)
                        job_schedule_run(other->meta.job);
        SET_FOREACH(other, n->meta.dependencies[NAME_BEFORE], i)
                if (other->meta.job)
                        job_schedule_run(other->meta.job);

        return 0;
}

void job_schedule_run(Job *j) {
        assert(j);
        assert(j->linked);

        if (j->in_run_queue)
                return;

        LIST_PREPEND(Job, run_queue, j->manager->run_queue, j);
        j->in_run_queue = true;
}
Commit	Line	Data
60918275 LP	1	/-- Mode: C; c-basic-offset: 8 --/
	2
	3	#include <assert.h>
1ffba6fe	4	#include <errno.h>
60918275 LP	5
	6	#include "macro.h"
	7	#include "job.h"
	8
	9	Job* job_new(Manager m, JobType type, Name name) {
	10	Job *j;
	11
	12	assert(m);
	13	assert(type < _JOB_TYPE_MAX);
	14	assert(name);
	15
	16	if (!(j = new0(Job, 1)))
	17	return NULL;
	18
	19	j->manager = m;
	20	j->id = m->current_job_id++;
	21	j->type = type;
	22	j->name = name;
	23
e5b5ae50	24	/* We don't link it here, that's what job_dependency() is for */
60918275 LP	25
	26	return j;
	27	}
	28
60918275 LP	29	void job_free(Job *j) {
	30	assert(j);
	31
	32	/* Detach from next 'bigger' objects */
60918275	33	if (j->linked) {
11dd41ce LP	34	if (j->name->meta.job == j)
11dd41ce LP	35	j->name->meta.job = NULL;
60918275 LP	36
60918275 LP	37	hashmap_remove(j->manager->jobs, UINT32_TO_PTR(j->id));
5cb5a6ff	38	j->linked = false;
60918275 LP	39	}
60918275 LP	40
5cb5a6ff	41	/* Detach from next 'smaller' objects */
302d0040	42	manager_transaction_unlink_job(j->manager, j);
60918275 LP	43
	44	free(j);
	45	}
a66d02c3	46
e5b5ae50 LP	47	JobDependency* job_dependency_new(Job subject, Job object, bool matters) {
	48	JobDependency *l;
	49
	50	assert(object);
	51
	52	/* Adds a new job link, which encodes that the 'subject' job
	53	* needs the 'object' job in some way. If 'subject' is NULL
	54	* this means the 'anchor' job (i.e. the one the user
	55	* explcitily asked for) is the requester. */
	56
ceed3570	57	if (!(l = new0(JobDependency, 1)))
e5b5ae50 LP	58	return NULL;
	59
	60	l->subject = subject;
	61	l->object = object;
	62	l->matters = matters;
	63
44d8db9e LP	64	if (subject)
	65	LIST_PREPEND(JobDependency, subject, subject->subject_list, l);
	66	else
	67	LIST_PREPEND(JobDependency, subject, object->manager->transaction_anchor, l);
e5b5ae50	68
44d8db9e	69	LIST_PREPEND(JobDependency, object, object->object_list, l);
e5b5ae50 LP	70
	71	return l;
	72	}
	73
	74	void job_dependency_free(JobDependency *l) {
	75	assert(l);
	76
44d8db9e LP	77	if (l->subject)
44d8db9e LP	78	LIST_REMOVE(JobDependency, subject, l->subject->subject_list, l);
e5b5ae50	79	else
44d8db9e	80	LIST_REMOVE(JobDependency, subject, l->object->manager->transaction_anchor, l);
e5b5ae50	81
44d8db9e	82	LIST_REMOVE(JobDependency, object, l->object->object_list, l);
e5b5ae50 LP	83
	84	free(l);
	85	}
	86
	87	void job_dependency_delete(Job subject, Job object, bool *matters) {
	88	JobDependency *l;
	89
	90	assert(object);
	91
44d8db9e	92	LIST_FOREACH(object, l, object->object_list) {
e5b5ae50 LP	93	assert(l->object == object);
	94
	95	if (l->subject == subject)
	96	break;
	97	}
	98
	99	if (!l) {
	100	if (matters)
	101	*matters = false;
	102	return;
	103	}
	104
	105	if (matters)
	106	*matters = l->matters;
	107
	108	job_dependency_free(l);
	109	}
	110
1ffba6fe	111	const char* job_type_to_string(JobType t) {
a66d02c3 LP	112
a66d02c3 LP	113	static const char* const job_type_table[_JOB_TYPE_MAX] = {
42f4e3c4	114	[JOB_START] = "start",
5cb5a6ff	115	[JOB_VERIFY_ACTIVE] = "verify-active",
42f4e3c4	116	[JOB_STOP] = "stop",
42f4e3c4	117	[JOB_RELOAD] = "reload",
e5b5ae50	118	[JOB_RELOAD_OR_START] = "reload-or-start",
42f4e3c4 LP	119	[JOB_RESTART] = "restart",
42f4e3c4 LP	120	[JOB_TRY_RESTART] = "try-restart",
a66d02c3 LP	121	};
a66d02c3 LP	122
1ffba6fe LP	123	if (t < 0 \|\| t >= _JOB_TYPE_MAX)
	124	return "n/a";
	125
	126	return job_type_table[t];
	127	}
	128
	129	void job_dump(Job j, FILEf, const char *prefix) {
	130
a66d02c3	131	static const char* const job_state_table[_JOB_STATE_MAX] = {
42f4e3c4	132	[JOB_WAITING] = "waiting",
5cb5a6ff	133	[JOB_RUNNING] = "running"
a66d02c3 LP	134	};
	135
	136	assert(j);
	137	assert(f);
	138
ceed3570	139	fprintf(f,
44d8db9e	140	"%s→ Job %u:\n"
ceed3570	141	"%s\tAction: %s → %s\n"
5cb5a6ff LP	142	"%s\tState: %s\n"
5cb5a6ff LP	143	"%s\tForced: %s\n",
ceed3570	144	prefix, j->id,
1ffba6fe	145	prefix, name_id(j->name), job_type_to_string(j->type),
5cb5a6ff LP	146	prefix, job_state_table[j->state],
5cb5a6ff LP	147	prefix, yes_no(j->forced));
a66d02c3	148	}
e5b5ae50 LP	149
	150	bool job_is_anchor(Job *j) {
	151	JobDependency *l;
	152
	153	assert(j);
	154
44d8db9e	155	LIST_FOREACH(object, l, j->object_list)
e5b5ae50 LP	156	if (!l->subject)
	157	return true;
	158
	159	return false;
	160	}
1ffba6fe LP	161
	162	static bool types_match(JobType a, JobType b, JobType c, JobType d) {
	163	return
	164	(a == c && b == d) \|\|
	165	(a == d && b == c);
	166	}
	167
	168	int job_type_merge(JobType *a, JobType b) {
	169	if (*a == b)
	170	return 0;
	171
	172	/* Merging is associative! a merged with b merged with c is
	173	* the same as a merged with c merged with b. */
	174
	175	/* Mergeability is transitive! if a can be merged with b and b
	176	* with c then a also with c */
	177
	178	/* Also, if a merged with b cannot be merged with c, then
	179	* either a or b cannot be merged with c either */
	180
5cb5a6ff	181	if (types_match(*a, b, JOB_START, JOB_VERIFY_ACTIVE))
1ffba6fe LP	182	*a = JOB_START;
	183	else if (types_match(*a, b, JOB_START, JOB_RELOAD) \|\|
	184	types_match(*a, b, JOB_START, JOB_RELOAD_OR_START) \|\|
5cb5a6ff	185	types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD_OR_START) \|\|
1ffba6fe LP	186	types_match(*a, b, JOB_RELOAD, JOB_RELOAD_OR_START))
	187	*a = JOB_RELOAD_OR_START;
	188	else if (types_match(*a, b, JOB_START, JOB_RESTART) \|\|
	189	types_match(*a, b, JOB_START, JOB_TRY_RESTART) \|\|
5cb5a6ff	190	types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RESTART) \|\|
1ffba6fe LP	191	types_match(*a, b, JOB_RELOAD, JOB_RESTART) \|\|
	192	types_match(*a, b, JOB_RELOAD_OR_START, JOB_RESTART) \|\|
	193	types_match(*a, b, JOB_RELOAD_OR_START, JOB_TRY_RESTART) \|\|
	194	types_match(*a, b, JOB_RESTART, JOB_TRY_RESTART))
	195	*a = JOB_RESTART;
5cb5a6ff	196	else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_RELOAD))
1ffba6fe	197	*a = JOB_RELOAD;
5cb5a6ff	198	else if (types_match(*a, b, JOB_VERIFY_ACTIVE, JOB_TRY_RESTART) \|\|
1ffba6fe LP	199	types_match(*a, b, JOB_RELOAD, JOB_TRY_RESTART))
	200	*a = JOB_TRY_RESTART;
	201	else
	202	return -EEXIST;
	203
	204	return 0;
	205	}
	206
5cb5a6ff	207	bool job_type_is_mergeable(JobType a, JobType b) {
1ffba6fe LP	208	return job_type_merge(&a, b) >= 0;
	209	}
	210
	211	bool job_type_is_superset(JobType a, JobType b) {
	212
5cb5a6ff LP	213	/* Checks whether operation a is a "superset" of b in its
5cb5a6ff LP	214	* actions */
1ffba6fe LP	215
	216	if (a == b)
	217	return true;
	218
	219	switch (a) {
	220	case JOB_START:
5cb5a6ff	221	return b == JOB_VERIFY_ACTIVE;
1ffba6fe LP	222
1ffba6fe LP	223	case JOB_RELOAD:
5cb5a6ff LP	224	return
5cb5a6ff LP	225	b == JOB_VERIFY_ACTIVE;
1ffba6fe LP	226
	227	case JOB_RELOAD_OR_START:
	228	return
	229	b == JOB_RELOAD \|\|
5cb5a6ff LP	230	b == JOB_START \|\|
5cb5a6ff LP	231	b == JOB_VERIFY_ACTIVE;
1ffba6fe LP	232
	233	case JOB_RESTART:
	234	return
	235	b == JOB_START \|\|
5cb5a6ff	236	b == JOB_VERIFY_ACTIVE \|\|
1ffba6fe LP	237	b == JOB_RELOAD \|\|
	238	b == JOB_RELOAD_OR_START \|\|
	239	b == JOB_TRY_RESTART;
	240
	241	case JOB_TRY_RESTART:
	242	return
5cb5a6ff	243	b == JOB_VERIFY_ACTIVE \|\|
1ffba6fe LP	244	b == JOB_RELOAD;
	245	default:
	246	return false;
	247
	248	}
	249	}
e094e853 LP	250
e094e853 LP	251	bool job_type_is_conflicting(JobType a, JobType b) {
cd2dbd7d LP	252	assert(a >= 0 && a < _JOB_TYPE_MAX);
cd2dbd7d LP	253	assert(b >= 0 && b < _JOB_TYPE_MAX);
e094e853	254
5cb5a6ff	255	return (a == JOB_STOP) != (b == JOB_STOP);
e094e853	256	}
cd2dbd7d	257
5cb5a6ff	258	bool job_is_runnable(Job *j) {
034c6ed7	259	Iterator i;
5cb5a6ff LP	260	Name *other;
	261
	262	assert(j);
	263	assert(j->linked);
	264
	265	/* Checks whether there is any job running for the names this
	266	* job needs to be running after (in the case of a 'positive'
	267	* job type) or before (in the case of a 'negative' job type
	268	* . */
	269
	270	if (j->type == JOB_START \|\|
	271	j->type == JOB_VERIFY_ACTIVE \|\|
	272	j->type == JOB_RELOAD \|\|
	273	j->type == JOB_RELOAD_OR_START) {
	274
	275	/* Immediate result is that the job is or might be
	276	* started. In this case lets wait for the
	277	* dependencies, regardless whether they are
	278	* starting or stopping something. */
	279
034c6ed7	280	SET_FOREACH(other, j->name->meta.dependencies[NAME_AFTER], i)
5cb5a6ff LP	281	if (other->meta.job)
	282	return false;
	283	}
	284
	285	/* Also, if something else is being stopped and we should
	286	* change state after it, then lets wait. */
	287
034c6ed7	288	SET_FOREACH(other, j->name->meta.dependencies[NAME_BEFORE], i)
5cb5a6ff LP	289	if (other->meta.job &&
	290	(other->meta.job->type == JOB_STOP \|\|
	291	other->meta.job->type == JOB_RESTART \|\|
	292	other->meta.job->type == JOB_TRY_RESTART))
	293	return false;
	294
	295	/* This means that for a service a and a service b where b
	296	* shall be started after a:
	297	*
	298	* start a + start b → 1st step start a, 2nd step start b
	299	* start a + stop b → 1st step stop b, 2nd step start a
	300	* stop a + start b → 1st step stop a, 2nd step start b
	301	* stop a + stop b → 1st step stop b, 2nd step stop a
	302	*
	303	* This has the side effect that restarts are properly
	304	* synchronized too. */
	305
	306	return true;
	307	}
	308
	309	int job_run_and_invalidate(Job *j) {
	310	int r;
	311	assert(j);
	312
034c6ed7 LP	313	if (j->in_run_queue) {
	314	LIST_REMOVE(Job, run_queue, j->manager->run_queue, j);
	315	j->in_run_queue = false;
	316	}
5cb5a6ff LP	317
	318	if (j->state != JOB_WAITING)
	319	return 0;
	320
034c6ed7 LP	321	if (!job_is_runnable(j))
	322	return -EAGAIN;
	323
83c60c9f LP	324	j->state = JOB_RUNNING;
83c60c9f LP	325
5cb5a6ff LP	326	switch (j->type) {
	327
	328	case JOB_START:
	329	r = name_start(j->name);
	330	if (r == -EBADR)
	331	r = 0;
	332	break;
	333
	334	case JOB_VERIFY_ACTIVE: {
	335	NameActiveState t = name_active_state(j->name);
	336	if (NAME_IS_ACTIVE_OR_RELOADING(t))
	337	r = -EALREADY;
	338	else if (t == NAME_ACTIVATING)
	339	r = -EAGAIN;
	340	else
	341	r = -ENOEXEC;
	342	break;
	343	}
	344
	345	case JOB_STOP:
	346	r = name_stop(j->name);
	347	break;
	348
	349	case JOB_RELOAD:
	350	r = name_reload(j->name);
	351	break;
	352
	353	case JOB_RELOAD_OR_START:
	354	if (name_active_state(j->name) == NAME_ACTIVE)
	355	r = name_reload(j->name);
	356	else
	357	r = name_start(j->name);
	358	break;
	359
	360	case JOB_RESTART: {
	361	NameActiveState t = name_active_state(j->name);
	362	if (t == NAME_INACTIVE \|\| t == NAME_ACTIVATING) {
	363	j->type = JOB_START;
	364	r = name_start(j->name);
	365	} else
	366	r = name_stop(j->name);
	367	break;
	368	}
	369
	370	case JOB_TRY_RESTART: {
	371	NameActiveState t = name_active_state(j->name);
	372	if (t == NAME_INACTIVE \|\| t == NAME_DEACTIVATING)
	373	r = -ENOEXEC;
	374	else if (t == NAME_ACTIVATING) {
	375	j->type = JOB_START;
	376	r = name_start(j->name);
	377	} else
	378	r = name_stop(j->name);
	379	break;
	380	}
	381
	382	default:
44d8db9e	383	assert_not_reached("Unknown job type");
5cb5a6ff LP	384	}
5cb5a6ff LP	385
83c60c9f	386	if (r == -EALREADY)
5cb5a6ff	387	r = job_finish_and_invalidate(j, true);
83c60c9f LP	388	else if (r == -EAGAIN) {
	389	j->state = JOB_WAITING;
	390	return -EAGAIN;
	391	} else if (r < 0)
5cb5a6ff LP	392	r = job_finish_and_invalidate(j, false);
	393
	394	return r;
	395	}
	396
	397	int job_finish_and_invalidate(Job *j, bool success) {
	398	Name *n;
5cb5a6ff LP	399	Name *other;
5cb5a6ff LP	400	NameType t;
034c6ed7	401	Iterator i;
5cb5a6ff LP	402
	403	assert(j);
	404
034c6ed7	405	/* Patch restart jobs so that they become normal start jobs */
5cb5a6ff LP	406	if (success && (j->type == JOB_RESTART \|\| j->type == JOB_TRY_RESTART)) {
	407	j->state = JOB_RUNNING;
	408	j->type = JOB_START;
034c6ed7 LP	409	job_schedule_run(j);
034c6ed7 LP	410	return 0;
5cb5a6ff LP	411	}
	412
	413	n = j->name;
	414	t = j->type;
	415	job_free(j);
	416
	417	/* Fail depending jobs on failure */
	418	if (!success) {
	419
	420	if (t == JOB_START \|\|
	421	t == JOB_VERIFY_ACTIVE \|\|
	422	t == JOB_RELOAD_OR_START) {
	423
034c6ed7	424	SET_FOREACH(other, n->meta.dependencies[NAME_REQUIRED_BY], i)
5cb5a6ff LP	425	if (other->meta.job &&
	426	(other->meta.type == JOB_START \|\|
	427	other->meta.type == JOB_VERIFY_ACTIVE \|\|
	428	other->meta.type == JOB_RELOAD_OR_START))
	429	job_finish_and_invalidate(other->meta.job, false);
	430
034c6ed7	431	SET_FOREACH(other, n->meta.dependencies[NAME_SOFT_REQUIRED_BY], i)
5cb5a6ff LP	432	if (other->meta.job &&
	433	!other->meta.job->forced &&
	434	(other->meta.type == JOB_START \|\|
	435	other->meta.type == JOB_VERIFY_ACTIVE \|\|
	436	other->meta.type == JOB_RELOAD_OR_START))
	437	job_finish_and_invalidate(other->meta.job, false);
	438
	439	} else if (t == JOB_STOP) {
	440
034c6ed7	441	SET_FOREACH(other, n->meta.dependencies[NAME_CONFLICTS], i)
5cb5a6ff LP	442	if (other->meta.job &&
	443	(t == JOB_START \|\|
	444	t == JOB_VERIFY_ACTIVE \|\|
	445	t == JOB_RELOAD_OR_START))
	446	job_finish_and_invalidate(other->meta.job, false);
	447	}
	448	}
	449
	450	/* Try to start the next jobs that can be started */
034c6ed7	451	SET_FOREACH(other, n->meta.dependencies[NAME_AFTER], i)
5cb5a6ff	452	if (other->meta.job)
034c6ed7 LP	453	job_schedule_run(other->meta.job);
034c6ed7 LP	454	SET_FOREACH(other, n->meta.dependencies[NAME_BEFORE], i)
5cb5a6ff	455	if (other->meta.job)
034c6ed7	456	job_schedule_run(other->meta.job);
5cb5a6ff LP	457
	458	return 0;
	459	}
034c6ed7 LP	460
	461	void job_schedule_run(Job *j) {
	462	assert(j);
	463	assert(j->linked);
	464
	465	if (j->in_run_queue)
	466	return;
	467
	468	LIST_PREPEND(Job, run_queue, j->manager->run_queue, j);
	469	j->in_run_queue = true;
	470	}