]>
Commit | Line | Data |
---|---|---|
a7334b09 LP |
1 | /*** |
2 | This file is part of systemd. | |
3 | ||
4 | Copyright 2010 Lennart Poettering | |
5 | ||
6 | systemd is free software; you can redistribute it and/or modify it | |
5430f7f2 LP |
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 | |
a7334b09 LP |
9 | (at your option) any later version. |
10 | ||
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 | |
5430f7f2 | 14 | Lesser General Public License for more details. |
a7334b09 | 15 | |
5430f7f2 | 16 | You should have received a copy of the GNU Lesser General Public License |
a7334b09 LP |
17 | along with systemd; If not, see <http://www.gnu.org/licenses/>. |
18 | ***/ | |
19 | ||
1ffba6fe | 20 | #include <errno.h> |
60918275 | 21 | |
718db961 LP |
22 | #include "sd-id128.h" |
23 | #include "sd-messages.h" | |
4f5dd394 | 24 | |
b5efdb8a | 25 | #include "alloc-util.h" |
f485606b | 26 | #include "async.h" |
4f5dd394 | 27 | #include "dbus-job.h" |
8f8f05a9 | 28 | #include "dbus.h" |
4f5dd394 | 29 | #include "escape.h" |
6bedfcbb | 30 | #include "job.h" |
4f5dd394 LP |
31 | #include "log.h" |
32 | #include "macro.h" | |
6bedfcbb | 33 | #include "parse-util.h" |
4f5dd394 LP |
34 | #include "set.h" |
35 | #include "special.h" | |
d054f0a4 | 36 | #include "stdio-util.h" |
8b43440b | 37 | #include "string-table.h" |
07630cea | 38 | #include "string-util.h" |
4f5dd394 | 39 | #include "strv.h" |
288a74cc | 40 | #include "terminal-util.h" |
4f5dd394 LP |
41 | #include "unit.h" |
42 | #include "virt.h" | |
97e6a119 | 43 | |
39a18c60 | 44 | Job* job_new_raw(Unit *unit) { |
60918275 LP |
45 | Job *j; |
46 | ||
39a18c60 MS |
47 | /* used for deserialization */ |
48 | ||
87f0e418 | 49 | assert(unit); |
60918275 | 50 | |
39a18c60 MS |
51 | j = new0(Job, 1); |
52 | if (!j) | |
60918275 LP |
53 | return NULL; |
54 | ||
668ad332 | 55 | j->manager = unit->manager; |
87f0e418 | 56 | j->unit = unit; |
e0209d83 | 57 | j->type = _JOB_TYPE_INVALID; |
faf919f1 | 58 | |
39a18c60 MS |
59 | return j; |
60 | } | |
61 | ||
62 | Job* job_new(Unit *unit, JobType type) { | |
63 | Job *j; | |
64 | ||
65 | assert(type < _JOB_TYPE_MAX); | |
66 | ||
67 | j = job_new_raw(unit); | |
68 | if (!j) | |
69 | return NULL; | |
70 | ||
71 | j->id = j->manager->current_job_id++; | |
72 | j->type = type; | |
73 | ||
e5b5ae50 | 74 | /* We don't link it here, that's what job_dependency() is for */ |
60918275 LP |
75 | |
76 | return j; | |
77 | } | |
78 | ||
97e7d748 MS |
79 | void job_free(Job *j) { |
80 | assert(j); | |
81 | assert(!j->installed); | |
02a3bcc6 MS |
82 | assert(!j->transaction_prev); |
83 | assert(!j->transaction_next); | |
84 | assert(!j->subject_list); | |
85 | assert(!j->object_list); | |
60918275 | 86 | |
c1e1601e | 87 | if (j->in_run_queue) |
71fda00f | 88 | LIST_REMOVE(run_queue, j->manager->run_queue, j); |
c1e1601e LP |
89 | |
90 | if (j->in_dbus_queue) | |
71fda00f | 91 | LIST_REMOVE(dbus_queue, j->manager->dbus_job_queue, j); |
c1e1601e | 92 | |
c5a97ed1 LP |
93 | if (j->in_gc_queue) |
94 | LIST_REMOVE(gc_queue, j->manager->gc_job_queue, j); | |
95 | ||
718db961 | 96 | sd_event_source_unref(j->timer_event_source); |
faf919f1 | 97 | |
1a465207 | 98 | sd_bus_track_unref(j->bus_track); |
b39a2770 | 99 | strv_free(j->deserialized_clients); |
faf919f1 | 100 | |
60918275 LP |
101 | free(j); |
102 | } | |
a66d02c3 | 103 | |
9c3349e2 LP |
104 | static void job_set_state(Job *j, JobState state) { |
105 | assert(j); | |
106 | assert(state >= 0); | |
107 | assert(state < _JOB_STATE_MAX); | |
108 | ||
109 | if (j->state == state) | |
110 | return; | |
111 | ||
112 | j->state = state; | |
113 | ||
114 | if (!j->installed) | |
115 | return; | |
116 | ||
117 | if (j->state == JOB_RUNNING) | |
118 | j->unit->manager->n_running_jobs++; | |
119 | else { | |
120 | assert(j->state == JOB_WAITING); | |
121 | assert(j->unit->manager->n_running_jobs > 0); | |
122 | ||
123 | j->unit->manager->n_running_jobs--; | |
124 | ||
125 | if (j->unit->manager->n_running_jobs <= 0) | |
126 | j->unit->manager->jobs_in_progress_event_source = sd_event_source_unref(j->unit->manager->jobs_in_progress_event_source); | |
127 | } | |
128 | } | |
129 | ||
05d576f1 | 130 | void job_uninstall(Job *j) { |
e0209d83 MS |
131 | Job **pj; |
132 | ||
05d576f1 | 133 | assert(j->installed); |
e0209d83 | 134 | |
9c3349e2 LP |
135 | job_set_state(j, JOB_WAITING); |
136 | ||
e0209d83 MS |
137 | pj = (j->type == JOB_NOP) ? &j->unit->nop_job : &j->unit->job; |
138 | assert(*pj == j); | |
139 | ||
05d576f1 MS |
140 | /* Detach from next 'bigger' objects */ |
141 | ||
39a18c60 | 142 | /* daemon-reload should be transparent to job observers */ |
2c289ea8 | 143 | if (!MANAGER_IS_RELOADING(j->manager)) |
39a18c60 | 144 | bus_job_send_removed_signal(j); |
05d576f1 | 145 | |
e0209d83 MS |
146 | *pj = NULL; |
147 | ||
d6a093d0 | 148 | unit_add_to_gc_queue(j->unit); |
05d576f1 MS |
149 | |
150 | hashmap_remove(j->manager->jobs, UINT32_TO_PTR(j->id)); | |
151 | j->installed = false; | |
152 | } | |
153 | ||
656bbffc MS |
154 | static bool job_type_allows_late_merge(JobType t) { |
155 | /* Tells whether it is OK to merge a job of type 't' with an already | |
156 | * running job. | |
157 | * Reloads cannot be merged this way. Think of the sequence: | |
158 | * 1. Reload of a daemon is in progress; the daemon has already loaded | |
159 | * its config file, but hasn't completed the reload operation yet. | |
160 | * 2. Edit foo's config file. | |
161 | * 3. Trigger another reload to have the daemon use the new config. | |
162 | * Should the second reload job be merged into the first one, the daemon | |
163 | * would not know about the new config. | |
164 | * JOB_RESTART jobs on the other hand can be merged, because they get | |
165 | * patched into JOB_START after stopping the unit. So if we see a | |
166 | * JOB_RESTART running, it means the unit hasn't stopped yet and at | |
167 | * this time the merge is still allowed. */ | |
e0209d83 | 168 | return t != JOB_RELOAD; |
656bbffc MS |
169 | } |
170 | ||
171 | static void job_merge_into_installed(Job *j, Job *other) { | |
172 | assert(j->installed); | |
173 | assert(j->unit == other->unit); | |
174 | ||
e0209d83 MS |
175 | if (j->type != JOB_NOP) |
176 | job_type_merge_and_collapse(&j->type, other->type, j->unit); | |
177 | else | |
178 | assert(other->type == JOB_NOP); | |
656bbffc | 179 | |
23ade460 | 180 | j->irreversible = j->irreversible || other->irreversible; |
e45460d6 | 181 | j->ignore_order = j->ignore_order || other->ignore_order; |
656bbffc MS |
182 | } |
183 | ||
184 | Job* job_install(Job *j) { | |
e0209d83 MS |
185 | Job **pj; |
186 | Job *uj; | |
05d576f1 | 187 | |
656bbffc | 188 | assert(!j->installed); |
e0209d83 | 189 | assert(j->type < _JOB_TYPE_MAX_IN_TRANSACTION); |
9c3349e2 | 190 | assert(j->state == JOB_WAITING); |
e0209d83 MS |
191 | |
192 | pj = (j->type == JOB_NOP) ? &j->unit->nop_job : &j->unit->job; | |
193 | uj = *pj; | |
656bbffc | 194 | |
05d576f1 | 195 | if (uj) { |
61da906a | 196 | if (job_type_is_conflicting(uj->type, j->type)) |
833f92ad | 197 | job_finish_and_invalidate(uj, JOB_CANCELED, false, false); |
656bbffc MS |
198 | else { |
199 | /* not conflicting, i.e. mergeable */ | |
200 | ||
61da906a | 201 | if (uj->state == JOB_WAITING || |
656bbffc MS |
202 | (job_type_allows_late_merge(j->type) && job_type_is_superset(uj->type, j->type))) { |
203 | job_merge_into_installed(uj, j); | |
f2341e0a | 204 | log_unit_debug(uj->unit, |
66870f90 ZJS |
205 | "Merged into installed job %s/%s as %u", |
206 | uj->unit->id, job_type_to_string(uj->type), (unsigned) uj->id); | |
656bbffc MS |
207 | return uj; |
208 | } else { | |
209 | /* already running and not safe to merge into */ | |
210 | /* Patch uj to become a merged job and re-run it. */ | |
211 | /* XXX It should be safer to queue j to run after uj finishes, but it is | |
212 | * not currently possible to have more than one installed job per unit. */ | |
213 | job_merge_into_installed(uj, j); | |
f2341e0a | 214 | log_unit_debug(uj->unit, |
66870f90 ZJS |
215 | "Merged into running job, re-running: %s/%s as %u", |
216 | uj->unit->id, job_type_to_string(uj->type), (unsigned) uj->id); | |
9c3349e2 LP |
217 | |
218 | job_set_state(uj, JOB_WAITING); | |
656bbffc MS |
219 | return uj; |
220 | } | |
221 | } | |
05d576f1 MS |
222 | } |
223 | ||
656bbffc | 224 | /* Install the job */ |
e0209d83 | 225 | *pj = j; |
05d576f1 | 226 | j->installed = true; |
9c3349e2 | 227 | |
313cefa1 | 228 | j->manager->n_installed_jobs++; |
f2341e0a | 229 | log_unit_debug(j->unit, |
66870f90 ZJS |
230 | "Installed new job %s/%s as %u", |
231 | j->unit->id, job_type_to_string(j->type), (unsigned) j->id); | |
c5a97ed1 LP |
232 | |
233 | job_add_to_gc_queue(j); | |
234 | ||
656bbffc | 235 | return j; |
05d576f1 MS |
236 | } |
237 | ||
e0209d83 MS |
238 | int job_install_deserialized(Job *j) { |
239 | Job **pj; | |
240 | ||
39a18c60 MS |
241 | assert(!j->installed); |
242 | ||
e0209d83 MS |
243 | if (j->type < 0 || j->type >= _JOB_TYPE_MAX_IN_TRANSACTION) { |
244 | log_debug("Invalid job type %s in deserialization.", strna(job_type_to_string(j->type))); | |
245 | return -EINVAL; | |
246 | } | |
247 | ||
248 | pj = (j->type == JOB_NOP) ? &j->unit->nop_job : &j->unit->job; | |
e0209d83 | 249 | if (*pj) { |
f2341e0a | 250 | log_unit_debug(j->unit, "Unit already has a job installed. Not installing deserialized job."); |
e0209d83 | 251 | return -EEXIST; |
39a18c60 | 252 | } |
9c3349e2 | 253 | |
e0209d83 | 254 | *pj = j; |
39a18c60 | 255 | j->installed = true; |
9c3349e2 LP |
256 | |
257 | if (j->state == JOB_RUNNING) | |
258 | j->unit->manager->n_running_jobs++; | |
259 | ||
f2341e0a | 260 | log_unit_debug(j->unit, |
66870f90 ZJS |
261 | "Reinstalled deserialized job %s/%s as %u", |
262 | j->unit->id, job_type_to_string(j->type), (unsigned) j->id); | |
e0209d83 | 263 | return 0; |
39a18c60 MS |
264 | } |
265 | ||
1da4264f | 266 | JobDependency* job_dependency_new(Job *subject, Job *object, bool matters, bool conflicts) { |
e5b5ae50 LP |
267 | JobDependency *l; |
268 | ||
269 | assert(object); | |
270 | ||
271 | /* Adds a new job link, which encodes that the 'subject' job | |
272 | * needs the 'object' job in some way. If 'subject' is NULL | |
273 | * this means the 'anchor' job (i.e. the one the user | |
35b8ca3a | 274 | * explicitly asked for) is the requester. */ |
e5b5ae50 | 275 | |
0a23a627 LP |
276 | l = new0(JobDependency, 1); |
277 | if (!l) | |
e5b5ae50 LP |
278 | return NULL; |
279 | ||
280 | l->subject = subject; | |
281 | l->object = object; | |
282 | l->matters = matters; | |
69dd2852 | 283 | l->conflicts = conflicts; |
e5b5ae50 | 284 | |
44d8db9e | 285 | if (subject) |
71fda00f | 286 | LIST_PREPEND(subject, subject->subject_list, l); |
e5b5ae50 | 287 | |
71fda00f | 288 | LIST_PREPEND(object, object->object_list, l); |
e5b5ae50 LP |
289 | |
290 | return l; | |
291 | } | |
292 | ||
1da4264f | 293 | void job_dependency_free(JobDependency *l) { |
e5b5ae50 LP |
294 | assert(l); |
295 | ||
44d8db9e | 296 | if (l->subject) |
71fda00f | 297 | LIST_REMOVE(subject, l->subject->subject_list, l); |
e5b5ae50 | 298 | |
71fda00f | 299 | LIST_REMOVE(object, l->object->object_list, l); |
e5b5ae50 LP |
300 | |
301 | free(l); | |
302 | } | |
303 | ||
1ffba6fe | 304 | void job_dump(Job *j, FILE*f, const char *prefix) { |
a66d02c3 LP |
305 | assert(j); |
306 | assert(f); | |
307 | ||
9eb63b3c LP |
308 | if (!prefix) |
309 | prefix = ""; | |
310 | ||
ceed3570 | 311 | fprintf(f, |
40d50879 LP |
312 | "%s-> Job %u:\n" |
313 | "%s\tAction: %s -> %s\n" | |
5cb5a6ff | 314 | "%s\tState: %s\n" |
23ade460 | 315 | "%s\tIrreversible: %s\n", |
ceed3570 | 316 | prefix, j->id, |
ac155bb8 | 317 | prefix, j->unit->id, job_type_to_string(j->type), |
94f04347 | 318 | prefix, job_state_to_string(j->state), |
23ade460 | 319 | prefix, yes_no(j->irreversible)); |
a66d02c3 | 320 | } |
e5b5ae50 | 321 | |
348e27fe MS |
322 | /* |
323 | * Merging is commutative, so imagine the matrix as symmetric. We store only | |
324 | * its lower triangle to avoid duplication. We don't store the main diagonal, | |
325 | * because A merged with A is simply A. | |
326 | * | |
e0209d83 MS |
327 | * If the resulting type is collapsed immediately afterwards (to get rid of |
328 | * the JOB_RELOAD_OR_START, which lies outside the lookup function's domain), | |
329 | * the following properties hold: | |
330 | * | |
48b4eab4 | 331 | * Merging is associative! A merged with B, and then merged with C is the same |
103635db | 332 | * as A merged with the result of B merged with C. |
348e27fe MS |
333 | * |
334 | * Mergeability is transitive! If A can be merged with B and B with C then | |
335 | * A also with C. | |
336 | * | |
337 | * Also, if A merged with B cannot be merged with C, then either A or B cannot | |
338 | * be merged with C either. | |
339 | */ | |
340 | static const JobType job_merging_table[] = { | |
e0209d83 MS |
341 | /* What \ With * JOB_START JOB_VERIFY_ACTIVE JOB_STOP JOB_RELOAD */ |
342 | /*********************************************************************************/ | |
348e27fe MS |
343 | /*JOB_START */ |
344 | /*JOB_VERIFY_ACTIVE */ JOB_START, | |
345 | /*JOB_STOP */ -1, -1, | |
346 | /*JOB_RELOAD */ JOB_RELOAD_OR_START, JOB_RELOAD, -1, | |
e0209d83 | 347 | /*JOB_RESTART */ JOB_RESTART, JOB_RESTART, -1, JOB_RESTART, |
348e27fe MS |
348 | }; |
349 | ||
350 | JobType job_type_lookup_merge(JobType a, JobType b) { | |
e0209d83 MS |
351 | assert_cc(ELEMENTSOF(job_merging_table) == _JOB_TYPE_MAX_MERGING * (_JOB_TYPE_MAX_MERGING - 1) / 2); |
352 | assert(a >= 0 && a < _JOB_TYPE_MAX_MERGING); | |
353 | assert(b >= 0 && b < _JOB_TYPE_MAX_MERGING); | |
1ffba6fe LP |
354 | |
355 | if (a == b) | |
348e27fe | 356 | return a; |
1ffba6fe | 357 | |
348e27fe MS |
358 | if (a < b) { |
359 | JobType tmp = a; | |
360 | a = b; | |
361 | b = tmp; | |
1ffba6fe | 362 | } |
e094e853 | 363 | |
348e27fe | 364 | return job_merging_table[(a - 1) * a / 2 + b]; |
e094e853 | 365 | } |
cd2dbd7d | 366 | |
593fbdd2 LP |
367 | bool job_type_is_redundant(JobType a, UnitActiveState b) { |
368 | switch (a) { | |
369 | ||
370 | case JOB_START: | |
371 | return | |
372 | b == UNIT_ACTIVE || | |
032ff4af | 373 | b == UNIT_RELOADING; |
593fbdd2 LP |
374 | |
375 | case JOB_STOP: | |
376 | return | |
6124958c | 377 | b == UNIT_INACTIVE || |
fdf20a31 | 378 | b == UNIT_FAILED; |
593fbdd2 LP |
379 | |
380 | case JOB_VERIFY_ACTIVE: | |
381 | return | |
382 | b == UNIT_ACTIVE || | |
032ff4af | 383 | b == UNIT_RELOADING; |
593fbdd2 LP |
384 | |
385 | case JOB_RELOAD: | |
386 | return | |
032ff4af | 387 | b == UNIT_RELOADING; |
593fbdd2 | 388 | |
593fbdd2 LP |
389 | case JOB_RESTART: |
390 | return | |
391 | b == UNIT_ACTIVATING; | |
392 | ||
7e803f5e MS |
393 | case JOB_NOP: |
394 | return true; | |
395 | ||
e0209d83 MS |
396 | default: |
397 | assert_not_reached("Invalid job type"); | |
398 | } | |
399 | } | |
400 | ||
c6497ccb | 401 | JobType job_type_collapse(JobType t, Unit *u) { |
e0209d83 MS |
402 | UnitActiveState s; |
403 | ||
c6497ccb | 404 | switch (t) { |
e0209d83 | 405 | |
593fbdd2 | 406 | case JOB_TRY_RESTART: |
e0209d83 MS |
407 | s = unit_active_state(u); |
408 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(s)) | |
c6497ccb LP |
409 | return JOB_NOP; |
410 | ||
411 | return JOB_RESTART; | |
e0209d83 | 412 | |
3282591d LP |
413 | case JOB_TRY_RELOAD: |
414 | s = unit_active_state(u); | |
415 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(s)) | |
416 | return JOB_NOP; | |
417 | ||
418 | return JOB_RELOAD; | |
419 | ||
e0209d83 MS |
420 | case JOB_RELOAD_OR_START: |
421 | s = unit_active_state(u); | |
422 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(s)) | |
c6497ccb LP |
423 | return JOB_START; |
424 | ||
425 | return JOB_RELOAD; | |
593fbdd2 LP |
426 | |
427 | default: | |
c6497ccb | 428 | return t; |
593fbdd2 LP |
429 | } |
430 | } | |
431 | ||
e0209d83 | 432 | int job_type_merge_and_collapse(JobType *a, JobType b, Unit *u) { |
c6497ccb LP |
433 | JobType t; |
434 | ||
435 | t = job_type_lookup_merge(*a, b); | |
e0209d83 MS |
436 | if (t < 0) |
437 | return -EEXIST; | |
c6497ccb LP |
438 | |
439 | *a = job_type_collapse(t, u); | |
e0209d83 MS |
440 | return 0; |
441 | } | |
442 | ||
9588bc32 | 443 | static bool job_is_runnable(Job *j) { |
034c6ed7 | 444 | Iterator i; |
87f0e418 | 445 | Unit *other; |
5cb5a6ff LP |
446 | |
447 | assert(j); | |
ac1135be | 448 | assert(j->installed); |
5cb5a6ff | 449 | |
87f0e418 | 450 | /* Checks whether there is any job running for the units this |
5cb5a6ff | 451 | * job needs to be running after (in the case of a 'positive' |
e67c3609 LP |
452 | * job type) or before (in the case of a 'negative' job |
453 | * type. */ | |
454 | ||
66ca4ec4 LP |
455 | /* Note that unit types have a say in what is runnable, |
456 | * too. For example, if they return -EAGAIN from | |
457 | * unit_start() they can indicate they are not | |
458 | * runnable yet. */ | |
459 | ||
e67c3609 | 460 | /* First check if there is an override */ |
cebe0d41 | 461 | if (j->ignore_order) |
e67c3609 | 462 | return true; |
5cb5a6ff | 463 | |
e0209d83 MS |
464 | if (j->type == JOB_NOP) |
465 | return true; | |
466 | ||
0a23a627 | 467 | if (IN_SET(j->type, JOB_START, JOB_VERIFY_ACTIVE, JOB_RELOAD)) { |
5cb5a6ff LP |
468 | |
469 | /* Immediate result is that the job is or might be | |
fc08079e | 470 | * started. In this case let's wait for the |
5cb5a6ff LP |
471 | * dependencies, regardless whether they are |
472 | * starting or stopping something. */ | |
473 | ||
ac155bb8 MS |
474 | SET_FOREACH(other, j->unit->dependencies[UNIT_AFTER], i) |
475 | if (other->job) | |
5cb5a6ff LP |
476 | return false; |
477 | } | |
478 | ||
479 | /* Also, if something else is being stopped and we should | |
fc08079e | 480 | * change state after it, then let's wait. */ |
5cb5a6ff | 481 | |
ac155bb8 MS |
482 | SET_FOREACH(other, j->unit->dependencies[UNIT_BEFORE], i) |
483 | if (other->job && | |
0a23a627 | 484 | IN_SET(other->job->type, JOB_STOP, JOB_RESTART)) |
5cb5a6ff LP |
485 | return false; |
486 | ||
487 | /* This means that for a service a and a service b where b | |
488 | * shall be started after a: | |
489 | * | |
490 | * start a + start b → 1st step start a, 2nd step start b | |
491 | * start a + stop b → 1st step stop b, 2nd step start a | |
492 | * stop a + start b → 1st step stop a, 2nd step start b | |
493 | * stop a + stop b → 1st step stop b, 2nd step stop a | |
494 | * | |
495 | * This has the side effect that restarts are properly | |
496 | * synchronized too. */ | |
497 | ||
498 | return true; | |
499 | } | |
500 | ||
bbd1a837 | 501 | static void job_change_type(Job *j, JobType newtype) { |
f2341e0a LP |
502 | assert(j); |
503 | ||
504 | log_unit_debug(j->unit, | |
66870f90 ZJS |
505 | "Converting job %s/%s -> %s/%s", |
506 | j->unit->id, job_type_to_string(j->type), | |
507 | j->unit->id, job_type_to_string(newtype)); | |
bbd1a837 MS |
508 | |
509 | j->type = newtype; | |
510 | } | |
511 | ||
d1a34ae9 | 512 | static int job_perform_on_unit(Job **j) { |
df446f96 LP |
513 | uint32_t id; |
514 | Manager *m; | |
515 | JobType t; | |
516 | Unit *u; | |
d1a34ae9 MS |
517 | int r; |
518 | ||
df446f96 LP |
519 | /* While we execute this operation the job might go away (for |
520 | * example: because it finishes immediately or is replaced by | |
521 | * a new, conflicting job.) To make sure we don't access a | |
522 | * freed job later on we store the id here, so that we can | |
523 | * verify the job is still valid. */ | |
524 | ||
525 | assert(j); | |
526 | assert(*j); | |
527 | ||
528 | m = (*j)->manager; | |
529 | u = (*j)->unit; | |
530 | t = (*j)->type; | |
531 | id = (*j)->id; | |
532 | ||
d1a34ae9 MS |
533 | switch (t) { |
534 | case JOB_START: | |
535 | r = unit_start(u); | |
536 | break; | |
537 | ||
538 | case JOB_RESTART: | |
539 | t = JOB_STOP; | |
df446f96 | 540 | /* fall through */ |
d1a34ae9 MS |
541 | case JOB_STOP: |
542 | r = unit_stop(u); | |
543 | break; | |
544 | ||
545 | case JOB_RELOAD: | |
546 | r = unit_reload(u); | |
547 | break; | |
548 | ||
549 | default: | |
550 | assert_not_reached("Invalid job type"); | |
551 | } | |
552 | ||
553 | /* Log if the job still exists and the start/stop/reload function | |
554 | * actually did something. */ | |
555 | *j = manager_get_job(m, id); | |
556 | if (*j && r > 0) | |
557 | unit_status_emit_starting_stopping_reloading(u, t); | |
558 | ||
559 | return r; | |
560 | } | |
561 | ||
5cb5a6ff LP |
562 | int job_run_and_invalidate(Job *j) { |
563 | int r; | |
ac1135be | 564 | |
5cb5a6ff | 565 | assert(j); |
ac1135be | 566 | assert(j->installed); |
e0209d83 | 567 | assert(j->type < _JOB_TYPE_MAX_IN_TRANSACTION); |
66aa6f7f | 568 | assert(j->in_run_queue); |
5cb5a6ff | 569 | |
71fda00f | 570 | LIST_REMOVE(run_queue, j->manager->run_queue, j); |
66aa6f7f | 571 | j->in_run_queue = false; |
5cb5a6ff LP |
572 | |
573 | if (j->state != JOB_WAITING) | |
574 | return 0; | |
575 | ||
034c6ed7 LP |
576 | if (!job_is_runnable(j)) |
577 | return -EAGAIN; | |
578 | ||
a2df3ea4 | 579 | job_start_timer(j, true); |
9c3349e2 | 580 | job_set_state(j, JOB_RUNNING); |
c1e1601e | 581 | job_add_to_dbus_queue(j); |
83c60c9f | 582 | |
2cf19a7a | 583 | |
5cb5a6ff LP |
584 | switch (j->type) { |
585 | ||
5cb5a6ff | 586 | case JOB_VERIFY_ACTIVE: { |
87f0e418 LP |
587 | UnitActiveState t = unit_active_state(j->unit); |
588 | if (UNIT_IS_ACTIVE_OR_RELOADING(t)) | |
5cb5a6ff | 589 | r = -EALREADY; |
87f0e418 | 590 | else if (t == UNIT_ACTIVATING) |
5cb5a6ff LP |
591 | r = -EAGAIN; |
592 | else | |
6a371e23 | 593 | r = -EBADR; |
5cb5a6ff LP |
594 | break; |
595 | } | |
596 | ||
d1a34ae9 | 597 | case JOB_START: |
5cb5a6ff | 598 | case JOB_STOP: |
dd17d388 | 599 | case JOB_RESTART: |
d1a34ae9 | 600 | r = job_perform_on_unit(&j); |
57339f47 | 601 | |
d1a34ae9 MS |
602 | /* If the unit type does not support starting/stopping, |
603 | * then simply wait. */ | |
57339f47 LP |
604 | if (r == -EBADR) |
605 | r = 0; | |
5cb5a6ff LP |
606 | break; |
607 | ||
608 | case JOB_RELOAD: | |
d1a34ae9 | 609 | r = job_perform_on_unit(&j); |
5cb5a6ff LP |
610 | break; |
611 | ||
e0209d83 MS |
612 | case JOB_NOP: |
613 | r = -EALREADY; | |
614 | break; | |
615 | ||
5cb5a6ff | 616 | default: |
44d8db9e | 617 | assert_not_reached("Unknown job type"); |
5cb5a6ff LP |
618 | } |
619 | ||
e0209d83 | 620 | if (j) { |
2cf19a7a | 621 | if (r == -EALREADY) |
833f92ad | 622 | r = job_finish_and_invalidate(j, JOB_DONE, true, true); |
6a371e23 | 623 | else if (r == -EBADR) |
833f92ad | 624 | r = job_finish_and_invalidate(j, JOB_SKIPPED, true, false); |
6a371e23 | 625 | else if (r == -ENOEXEC) |
833f92ad | 626 | r = job_finish_and_invalidate(j, JOB_INVALID, true, false); |
59fccdc5 | 627 | else if (r == -EPROTO) |
833f92ad | 628 | r = job_finish_and_invalidate(j, JOB_ASSERT, true, false); |
15411c0c | 629 | else if (r == -EOPNOTSUPP) |
833f92ad | 630 | r = job_finish_and_invalidate(j, JOB_UNSUPPORTED, true, false); |
631b676b LP |
631 | else if (r == -ENOLINK) |
632 | r = job_finish_and_invalidate(j, JOB_DEPENDENCY, true, false); | |
9c3349e2 LP |
633 | else if (r == -EAGAIN) |
634 | job_set_state(j, JOB_WAITING); | |
635 | else if (r < 0) | |
833f92ad | 636 | r = job_finish_and_invalidate(j, JOB_FAILED, true, false); |
2cf19a7a | 637 | } |
5cb5a6ff LP |
638 | |
639 | return r; | |
640 | } | |
641 | ||
44a6b1b6 | 642 | _pure_ static const char *job_get_status_message_format(Unit *u, JobType t, JobResult result) { |
df446f96 | 643 | |
aa49ab5f MS |
644 | static const char *const generic_finished_start_job[_JOB_RESULT_MAX] = { |
645 | [JOB_DONE] = "Started %s.", | |
646 | [JOB_TIMEOUT] = "Timed out starting %s.", | |
647 | [JOB_FAILED] = "Failed to start %s.", | |
648 | [JOB_DEPENDENCY] = "Dependency failed for %s.", | |
649 | [JOB_ASSERT] = "Assertion failed for %s.", | |
650 | [JOB_UNSUPPORTED] = "Starting of %s not supported.", | |
4332edf6 | 651 | [JOB_COLLECTED] = "Unnecessary job for %s was removed.", |
aa49ab5f MS |
652 | }; |
653 | static const char *const generic_finished_stop_job[_JOB_RESULT_MAX] = { | |
654 | [JOB_DONE] = "Stopped %s.", | |
655 | [JOB_FAILED] = "Stopped (with error) %s.", | |
b59f0ecd | 656 | [JOB_TIMEOUT] = "Timed out stopping %s.", |
aa49ab5f MS |
657 | }; |
658 | static const char *const generic_finished_reload_job[_JOB_RESULT_MAX] = { | |
659 | [JOB_DONE] = "Reloaded %s.", | |
660 | [JOB_FAILED] = "Reload failed for %s.", | |
661 | [JOB_TIMEOUT] = "Timed out reloading %s.", | |
662 | }; | |
663 | /* When verify-active detects the unit is inactive, report it. | |
664 | * Most likely a DEPEND warning from a requisiting unit will | |
665 | * occur next and it's nice to see what was requisited. */ | |
666 | static const char *const generic_finished_verify_active_job[_JOB_RESULT_MAX] = { | |
667 | [JOB_SKIPPED] = "%s is not active.", | |
668 | }; | |
877d54e9 | 669 | |
df446f96 LP |
670 | const UnitStatusMessageFormats *format_table; |
671 | const char *format; | |
672 | ||
877d54e9 LP |
673 | assert(u); |
674 | assert(t >= 0); | |
675 | assert(t < _JOB_TYPE_MAX); | |
c6918296 | 676 | |
df446f96 | 677 | if (IN_SET(t, JOB_START, JOB_STOP, JOB_RESTART)) { |
aa49ab5f MS |
678 | format_table = &UNIT_VTABLE(u)->status_message_formats; |
679 | if (format_table) { | |
680 | format = t == JOB_START ? format_table->finished_start_job[result] : | |
681 | format_table->finished_stop_job[result]; | |
682 | if (format) | |
683 | return format; | |
684 | } | |
685 | } | |
877d54e9 | 686 | |
aa49ab5f | 687 | /* Return generic strings */ |
877d54e9 | 688 | if (t == JOB_START) |
aa49ab5f | 689 | return generic_finished_start_job[result]; |
877d54e9 | 690 | else if (t == JOB_STOP || t == JOB_RESTART) |
aa49ab5f MS |
691 | return generic_finished_stop_job[result]; |
692 | else if (t == JOB_RELOAD) | |
693 | return generic_finished_reload_job[result]; | |
694 | else if (t == JOB_VERIFY_ACTIVE) | |
695 | return generic_finished_verify_active_job[result]; | |
877d54e9 LP |
696 | |
697 | return NULL; | |
698 | } | |
699 | ||
047d7219 ZJS |
700 | static const struct { |
701 | const char *color, *word; | |
702 | } job_print_status_messages [_JOB_RESULT_MAX] = { | |
703 | [JOB_DONE] = { ANSI_GREEN, " OK " }, | |
704 | [JOB_TIMEOUT] = { ANSI_HIGHLIGHT_RED, " TIME " }, | |
705 | [JOB_FAILED] = { ANSI_HIGHLIGHT_RED, "FAILED" }, | |
706 | [JOB_DEPENDENCY] = { ANSI_HIGHLIGHT_YELLOW, "DEPEND" }, | |
707 | [JOB_SKIPPED] = { ANSI_HIGHLIGHT, " INFO " }, | |
708 | [JOB_ASSERT] = { ANSI_HIGHLIGHT_YELLOW, "ASSERT" }, | |
709 | [JOB_UNSUPPORTED] = { ANSI_HIGHLIGHT_YELLOW, "UNSUPP" }, | |
710 | /* JOB_COLLECTED */ | |
711 | }; | |
e02cd6f7 | 712 | |
047d7219 | 713 | static void job_print_status_message(Unit *u, JobType t, JobResult result) { |
df446f96 | 714 | const char *format; |
dc9b5816 | 715 | const char *status; |
df446f96 | 716 | |
877d54e9 LP |
717 | assert(u); |
718 | assert(t >= 0); | |
719 | assert(t < _JOB_TYPE_MAX); | |
720 | ||
df446f96 LP |
721 | /* Reload status messages have traditionally not been printed to console. */ |
722 | if (t == JOB_RELOAD) | |
723 | return; | |
724 | ||
047d7219 ZJS |
725 | if (!job_print_status_messages[result].word) |
726 | return; | |
727 | ||
aa49ab5f MS |
728 | format = job_get_status_message_format(u, t, result); |
729 | if (!format) | |
730 | return; | |
e02cd6f7 | 731 | |
dc9b5816 | 732 | if (log_get_show_color()) |
047d7219 ZJS |
733 | status = strjoina(job_print_status_messages[result].color, |
734 | job_print_status_messages[result].word, | |
735 | ANSI_NORMAL); | |
dc9b5816 | 736 | else |
047d7219 | 737 | status = job_print_status_messages[result].word; |
dc9b5816 | 738 | |
aa49ab5f MS |
739 | if (result != JOB_DONE) |
740 | manager_flip_auto_status(u->manager, true); | |
e02cd6f7 | 741 | |
aa49ab5f | 742 | DISABLE_WARNING_FORMAT_NONLITERAL; |
dc9b5816 | 743 | unit_status_printf(u, status, format); |
aa49ab5f | 744 | REENABLE_WARNING; |
7cf82e0b | 745 | |
aa49ab5f | 746 | if (t == JOB_START && result == JOB_FAILED) { |
df446f96 | 747 | _cleanup_free_ char *quoted; |
7cf82e0b | 748 | |
804ee07c | 749 | quoted = shell_maybe_quote(u->id, ESCAPE_BACKSLASH); |
df446f96 | 750 | manager_status_printf(u->manager, STATUS_TYPE_NORMAL, NULL, "See 'systemctl status %s' for details.", strna(quoted)); |
e02cd6f7 LP |
751 | } |
752 | } | |
753 | ||
877d54e9 | 754 | static void job_log_status_message(Unit *u, JobType t, JobResult result) { |
2b044526 | 755 | const char *format, *mid; |
877d54e9 | 756 | char buf[LINE_MAX]; |
64f575d2 MS |
757 | static const int job_result_log_level[_JOB_RESULT_MAX] = { |
758 | [JOB_DONE] = LOG_INFO, | |
759 | [JOB_CANCELED] = LOG_INFO, | |
760 | [JOB_TIMEOUT] = LOG_ERR, | |
761 | [JOB_FAILED] = LOG_ERR, | |
762 | [JOB_DEPENDENCY] = LOG_WARNING, | |
763 | [JOB_SKIPPED] = LOG_NOTICE, | |
764 | [JOB_INVALID] = LOG_INFO, | |
765 | [JOB_ASSERT] = LOG_WARNING, | |
766 | [JOB_UNSUPPORTED] = LOG_WARNING, | |
c5a97ed1 | 767 | [JOB_COLLECTED] = LOG_INFO, |
64f575d2 | 768 | }; |
877d54e9 LP |
769 | |
770 | assert(u); | |
771 | assert(t >= 0); | |
772 | assert(t < _JOB_TYPE_MAX); | |
773 | ||
047d7219 ZJS |
774 | /* Skip printing if output goes to the console, and job_print_status_message() |
775 | will actually print something to the console. */ | |
776 | if (log_on_console() && job_print_status_messages[result].word) | |
81270860 LP |
777 | return; |
778 | ||
aa49ab5f | 779 | format = job_get_status_message_format(u, t, result); |
877d54e9 LP |
780 | if (!format) |
781 | return; | |
782 | ||
07ecca0d | 783 | /* The description might be longer than the buffer, but that's OK, we'll just truncate it here */ |
bcfce235 | 784 | DISABLE_WARNING_FORMAT_NONLITERAL; |
07ecca0d | 785 | snprintf(buf, sizeof(buf), format, unit_description(u)); |
bcfce235 | 786 | REENABLE_WARNING; |
877d54e9 | 787 | |
df446f96 LP |
788 | switch (t) { |
789 | ||
790 | case JOB_START: | |
2b044526 ZJS |
791 | if (result == JOB_DONE) |
792 | mid = "MESSAGE_ID=" SD_MESSAGE_UNIT_STARTED_STR; | |
793 | else | |
794 | mid = "MESSAGE_ID=" SD_MESSAGE_UNIT_FAILED_STR; | |
df446f96 LP |
795 | break; |
796 | ||
797 | case JOB_RELOAD: | |
2b044526 | 798 | mid = "MESSAGE_ID=" SD_MESSAGE_UNIT_RELOADED_STR; |
df446f96 LP |
799 | break; |
800 | ||
801 | case JOB_STOP: | |
802 | case JOB_RESTART: | |
2b044526 | 803 | mid = "MESSAGE_ID=" SD_MESSAGE_UNIT_STOPPED_STR; |
df446f96 LP |
804 | break; |
805 | ||
806 | default: | |
64f575d2 | 807 | log_struct(job_result_log_level[result], |
4f29c6fe | 808 | LOG_MESSAGE("%s", buf), |
646cc98d LP |
809 | "JOB_TYPE=%s", job_type_to_string(t), |
810 | "JOB_RESULT=%s", job_result_to_string(result), | |
ba360bb0 | 811 | LOG_UNIT_ID(u), |
f1c50bec | 812 | LOG_UNIT_INVOCATION_ID(u), |
4f29c6fe | 813 | NULL); |
b81bbe53 MS |
814 | return; |
815 | } | |
816 | ||
64f575d2 | 817 | log_struct(job_result_log_level[result], |
b81bbe53 | 818 | LOG_MESSAGE("%s", buf), |
646cc98d LP |
819 | "JOB_TYPE=%s", job_type_to_string(t), |
820 | "JOB_RESULT=%s", job_result_to_string(result), | |
ba360bb0 | 821 | LOG_UNIT_ID(u), |
f1c50bec | 822 | LOG_UNIT_INVOCATION_ID(u), |
ba360bb0 | 823 | mid, |
b81bbe53 | 824 | NULL); |
877d54e9 | 825 | } |
877d54e9 | 826 | |
30961fa3 | 827 | static void job_emit_status_message(Unit *u, JobType t, JobResult result) { |
646cc98d | 828 | assert(u); |
30961fa3 MS |
829 | |
830 | /* No message if the job did not actually do anything due to failed condition. */ | |
831 | if (t == JOB_START && result == JOB_DONE && !u->condition_result) | |
832 | return; | |
833 | ||
834 | job_log_status_message(u, t, result); | |
df446f96 | 835 | job_print_status_message(u, t, result); |
30961fa3 MS |
836 | } |
837 | ||
be7d9ff7 LP |
838 | static void job_fail_dependencies(Unit *u, UnitDependency d) { |
839 | Unit *other; | |
840 | Iterator i; | |
841 | ||
842 | assert(u); | |
843 | ||
844 | SET_FOREACH(other, u->dependencies[d], i) { | |
845 | Job *j = other->job; | |
846 | ||
847 | if (!j) | |
848 | continue; | |
849 | if (!IN_SET(j->type, JOB_START, JOB_VERIFY_ACTIVE)) | |
850 | continue; | |
851 | ||
833f92ad | 852 | job_finish_and_invalidate(j, JOB_DEPENDENCY, true, false); |
be7d9ff7 LP |
853 | } |
854 | } | |
855 | ||
833f92ad | 856 | int job_finish_and_invalidate(Job *j, JobResult result, bool recursive, bool already) { |
87f0e418 LP |
857 | Unit *u; |
858 | Unit *other; | |
b866264a | 859 | JobType t; |
034c6ed7 | 860 | Iterator i; |
5cb5a6ff LP |
861 | |
862 | assert(j); | |
ac1135be | 863 | assert(j->installed); |
e0209d83 | 864 | assert(j->type < _JOB_TYPE_MAX_IN_TRANSACTION); |
5cb5a6ff | 865 | |
c6918296 MS |
866 | u = j->unit; |
867 | t = j->type; | |
868 | ||
869 | j->result = result; | |
870 | ||
f2341e0a | 871 | log_unit_debug(u, "Job %s/%s finished, result=%s", u->id, job_type_to_string(t), job_result_to_string(result)); |
c6918296 | 872 | |
833f92ad MS |
873 | /* If this job did nothing to respective unit we don't log the status message */ |
874 | if (!already) | |
875 | job_emit_status_message(u, t, result); | |
c6918296 | 876 | |
c1e1601e | 877 | job_add_to_dbus_queue(j); |
f50e0a01 | 878 | |
034c6ed7 | 879 | /* Patch restart jobs so that they become normal start jobs */ |
c6918296 | 880 | if (result == JOB_DONE && t == JOB_RESTART) { |
f50e0a01 | 881 | |
bbd1a837 | 882 | job_change_type(j, JOB_START); |
9c3349e2 | 883 | job_set_state(j, JOB_WAITING); |
cc42e081 LP |
884 | |
885 | job_add_to_run_queue(j); | |
c5a97ed1 | 886 | job_add_to_gc_queue(j); |
57981b98 | 887 | |
57981b98 | 888 | goto finish; |
5cb5a6ff LP |
889 | } |
890 | ||
6a371e23 | 891 | if (result == JOB_FAILED || result == JOB_INVALID) |
313cefa1 | 892 | j->manager->n_failed_jobs++; |
76bf48b7 | 893 | |
97e7d748 | 894 | job_uninstall(j); |
5cb5a6ff LP |
895 | job_free(j); |
896 | ||
897 | /* Fail depending jobs on failure */ | |
5273510e | 898 | if (result != JOB_DONE && recursive) { |
be7d9ff7 LP |
899 | if (IN_SET(t, JOB_START, JOB_VERIFY_ACTIVE)) { |
900 | job_fail_dependencies(u, UNIT_REQUIRED_BY); | |
901 | job_fail_dependencies(u, UNIT_REQUISITE_OF); | |
902 | job_fail_dependencies(u, UNIT_BOUND_BY); | |
be7d9ff7 LP |
903 | } else if (t == JOB_STOP) |
904 | job_fail_dependencies(u, UNIT_CONFLICTED_BY); | |
5cb5a6ff LP |
905 | } |
906 | ||
c0daa706 | 907 | /* Trigger OnFailure dependencies that are not generated by |
66870f90 | 908 | * the unit itself. We don't treat JOB_CANCELED as failure in |
c0daa706 LP |
909 | * this context. And JOB_FAILURE is already handled by the |
910 | * unit itself. */ | |
646cc98d | 911 | if (IN_SET(result, JOB_TIMEOUT, JOB_DEPENDENCY)) { |
f2341e0a LP |
912 | log_struct(LOG_NOTICE, |
913 | "JOB_TYPE=%s", job_type_to_string(t), | |
914 | "JOB_RESULT=%s", job_result_to_string(result), | |
915 | LOG_UNIT_ID(u), | |
916 | LOG_UNIT_MESSAGE(u, "Job %s/%s failed with result '%s'.", | |
e2cc6eca LP |
917 | u->id, |
918 | job_type_to_string(t), | |
919 | job_result_to_string(result)), | |
f2341e0a | 920 | NULL); |
222ae6a8 | 921 | |
3ecaa09b | 922 | unit_start_on_failure(u); |
222ae6a8 | 923 | } |
c0daa706 | 924 | |
3ecaa09b LP |
925 | unit_trigger_notify(u); |
926 | ||
57981b98 | 927 | finish: |
5cb5a6ff | 928 | /* Try to start the next jobs that can be started */ |
ac155bb8 | 929 | SET_FOREACH(other, u->dependencies[UNIT_AFTER], i) |
c5a97ed1 | 930 | if (other->job) { |
ac155bb8 | 931 | job_add_to_run_queue(other->job); |
c5a97ed1 LP |
932 | job_add_to_gc_queue(other->job); |
933 | } | |
ac155bb8 | 934 | SET_FOREACH(other, u->dependencies[UNIT_BEFORE], i) |
c5a97ed1 | 935 | if (other->job) { |
ac155bb8 | 936 | job_add_to_run_queue(other->job); |
c5a97ed1 LP |
937 | job_add_to_gc_queue(other->job); |
938 | } | |
5cb5a6ff | 939 | |
ac155bb8 | 940 | manager_check_finished(u->manager); |
b0c918b9 | 941 | |
5273510e | 942 | return 0; |
5cb5a6ff | 943 | } |
034c6ed7 | 944 | |
718db961 LP |
945 | static int job_dispatch_timer(sd_event_source *s, uint64_t monotonic, void *userdata) { |
946 | Job *j = userdata; | |
f189ab18 | 947 | Unit *u; |
faf919f1 | 948 | |
718db961 LP |
949 | assert(j); |
950 | assert(s == j->timer_event_source); | |
faf919f1 | 951 | |
f2341e0a | 952 | log_unit_warning(j->unit, "Job %s/%s timed out.", j->unit->id, job_type_to_string(j->type)); |
faf919f1 | 953 | |
f189ab18 | 954 | u = j->unit; |
833f92ad | 955 | job_finish_and_invalidate(j, JOB_TIMEOUT, true, false); |
f189ab18 | 956 | |
87a47f99 | 957 | emergency_action(u->manager, u->job_timeout_action, u->job_timeout_reboot_arg, "job timed out"); |
f189ab18 | 958 | |
718db961 LP |
959 | return 0; |
960 | } | |
faf919f1 | 961 | |
a2df3ea4 | 962 | int job_start_timer(Job *j, bool job_running) { |
718db961 | 963 | int r; |
171f12ce | 964 | usec_t timeout_time, old_timeout_time; |
faf919f1 | 965 | |
a2df3ea4 | 966 | if (job_running) { |
171f12ce MK |
967 | j->begin_running_usec = now(CLOCK_MONOTONIC); |
968 | ||
a2df3ea4 MK |
969 | if (j->unit->job_running_timeout == USEC_INFINITY) |
970 | return 0; | |
faf919f1 | 971 | |
171f12ce | 972 | timeout_time = usec_add(j->begin_running_usec, j->unit->job_running_timeout); |
faf919f1 | 973 | |
a2df3ea4 MK |
974 | if (j->timer_event_source) { |
975 | /* Update only if JobRunningTimeoutSec= results in earlier timeout */ | |
976 | r = sd_event_source_get_time(j->timer_event_source, &old_timeout_time); | |
977 | if (r < 0) | |
978 | return r; | |
979 | ||
980 | if (old_timeout_time <= timeout_time) | |
981 | return 0; | |
982 | ||
983 | return sd_event_source_set_time(j->timer_event_source, timeout_time); | |
984 | } | |
985 | } else { | |
986 | if (j->timer_event_source) | |
987 | return 0; | |
988 | ||
989 | j->begin_usec = now(CLOCK_MONOTONIC); | |
990 | ||
991 | if (j->unit->job_timeout == USEC_INFINITY) | |
992 | return 0; | |
993 | ||
994 | timeout_time = usec_add(j->begin_usec, j->unit->job_timeout); | |
995 | } | |
8bb310c3 | 996 | |
6a0f1f6d LP |
997 | r = sd_event_add_time( |
998 | j->manager->event, | |
999 | &j->timer_event_source, | |
1000 | CLOCK_MONOTONIC, | |
a2df3ea4 | 1001 | timeout_time, 0, |
6a0f1f6d | 1002 | job_dispatch_timer, j); |
718db961 LP |
1003 | if (r < 0) |
1004 | return r; | |
faf919f1 | 1005 | |
7dfbe2e3 TG |
1006 | (void) sd_event_source_set_description(j->timer_event_source, "job-start"); |
1007 | ||
718db961 | 1008 | return 0; |
faf919f1 LP |
1009 | } |
1010 | ||
c1e1601e | 1011 | void job_add_to_run_queue(Job *j) { |
034c6ed7 | 1012 | assert(j); |
ac1135be | 1013 | assert(j->installed); |
034c6ed7 LP |
1014 | |
1015 | if (j->in_run_queue) | |
1016 | return; | |
1017 | ||
752b5905 LP |
1018 | if (!j->manager->run_queue) |
1019 | sd_event_source_set_enabled(j->manager->run_queue_event_source, SD_EVENT_ONESHOT); | |
1020 | ||
71fda00f | 1021 | LIST_PREPEND(run_queue, j->manager->run_queue, j); |
034c6ed7 LP |
1022 | j->in_run_queue = true; |
1023 | } | |
94f04347 | 1024 | |
c1e1601e LP |
1025 | void job_add_to_dbus_queue(Job *j) { |
1026 | assert(j); | |
1027 | assert(j->installed); | |
1028 | ||
1029 | if (j->in_dbus_queue) | |
1030 | return; | |
1031 | ||
a567261a LP |
1032 | /* We don't check if anybody is subscribed here, since this |
1033 | * job might just have been created and not yet assigned to a | |
1034 | * connection/client. */ | |
94b6dfa2 | 1035 | |
71fda00f | 1036 | LIST_PREPEND(dbus_queue, j->manager->dbus_job_queue, j); |
c1e1601e LP |
1037 | j->in_dbus_queue = true; |
1038 | } | |
1039 | ||
ea430986 LP |
1040 | char *job_dbus_path(Job *j) { |
1041 | char *p; | |
1042 | ||
1043 | assert(j); | |
1044 | ||
ccd06097 | 1045 | if (asprintf(&p, "/org/freedesktop/systemd1/job/%"PRIu32, j->id) < 0) |
ea430986 LP |
1046 | return NULL; |
1047 | ||
1048 | return p; | |
1049 | } | |
1050 | ||
05a98afd LP |
1051 | int job_serialize(Job *j, FILE *f) { |
1052 | assert(j); | |
1053 | assert(f); | |
1054 | ||
39a18c60 MS |
1055 | fprintf(f, "job-id=%u\n", j->id); |
1056 | fprintf(f, "job-type=%s\n", job_type_to_string(j->type)); | |
1057 | fprintf(f, "job-state=%s\n", job_state_to_string(j->state)); | |
23ade460 | 1058 | fprintf(f, "job-irreversible=%s\n", yes_no(j->irreversible)); |
39a18c60 MS |
1059 | fprintf(f, "job-sent-dbus-new-signal=%s\n", yes_no(j->sent_dbus_new_signal)); |
1060 | fprintf(f, "job-ignore-order=%s\n", yes_no(j->ignore_order)); | |
718db961 LP |
1061 | |
1062 | if (j->begin_usec > 0) | |
ccd06097 | 1063 | fprintf(f, "job-begin="USEC_FMT"\n", j->begin_usec); |
171f12ce MK |
1064 | if (j->begin_running_usec > 0) |
1065 | fprintf(f, "job-begin-running="USEC_FMT"\n", j->begin_running_usec); | |
718db961 | 1066 | |
1a465207 | 1067 | bus_track_serialize(j->bus_track, f, "subscribed"); |
39a18c60 MS |
1068 | |
1069 | /* End marker */ | |
1070 | fputc('\n', f); | |
1071 | return 0; | |
1072 | } | |
1073 | ||
05a98afd | 1074 | int job_deserialize(Job *j, FILE *f) { |
718db961 | 1075 | assert(j); |
05a98afd | 1076 | assert(f); |
718db961 | 1077 | |
39a18c60 MS |
1078 | for (;;) { |
1079 | char line[LINE_MAX], *l, *v; | |
1080 | size_t k; | |
1081 | ||
1082 | if (!fgets(line, sizeof(line), f)) { | |
1083 | if (feof(f)) | |
1084 | return 0; | |
1085 | return -errno; | |
1086 | } | |
1087 | ||
1088 | char_array_0(line); | |
1089 | l = strstrip(line); | |
1090 | ||
1091 | /* End marker */ | |
1092 | if (l[0] == 0) | |
1093 | return 0; | |
1094 | ||
1095 | k = strcspn(l, "="); | |
1096 | ||
1097 | if (l[k] == '=') { | |
1098 | l[k] = 0; | |
1099 | v = l+k+1; | |
1100 | } else | |
1101 | v = l+k; | |
1102 | ||
1103 | if (streq(l, "job-id")) { | |
718db961 | 1104 | |
39a18c60 MS |
1105 | if (safe_atou32(v, &j->id) < 0) |
1106 | log_debug("Failed to parse job id value %s", v); | |
718db961 | 1107 | |
39a18c60 | 1108 | } else if (streq(l, "job-type")) { |
718db961 LP |
1109 | JobType t; |
1110 | ||
1111 | t = job_type_from_string(v); | |
39a18c60 MS |
1112 | if (t < 0) |
1113 | log_debug("Failed to parse job type %s", v); | |
e0209d83 MS |
1114 | else if (t >= _JOB_TYPE_MAX_IN_TRANSACTION) |
1115 | log_debug("Cannot deserialize job of type %s", v); | |
39a18c60 MS |
1116 | else |
1117 | j->type = t; | |
718db961 | 1118 | |
39a18c60 | 1119 | } else if (streq(l, "job-state")) { |
718db961 LP |
1120 | JobState s; |
1121 | ||
1122 | s = job_state_from_string(v); | |
39a18c60 MS |
1123 | if (s < 0) |
1124 | log_debug("Failed to parse job state %s", v); | |
1125 | else | |
9c3349e2 | 1126 | job_set_state(j, s); |
718db961 | 1127 | |
23ade460 | 1128 | } else if (streq(l, "job-irreversible")) { |
718db961 LP |
1129 | int b; |
1130 | ||
1131 | b = parse_boolean(v); | |
23ade460 MS |
1132 | if (b < 0) |
1133 | log_debug("Failed to parse job irreversible flag %s", v); | |
1134 | else | |
1135 | j->irreversible = j->irreversible || b; | |
718db961 | 1136 | |
39a18c60 | 1137 | } else if (streq(l, "job-sent-dbus-new-signal")) { |
718db961 LP |
1138 | int b; |
1139 | ||
1140 | b = parse_boolean(v); | |
39a18c60 MS |
1141 | if (b < 0) |
1142 | log_debug("Failed to parse job sent_dbus_new_signal flag %s", v); | |
1143 | else | |
1144 | j->sent_dbus_new_signal = j->sent_dbus_new_signal || b; | |
718db961 | 1145 | |
39a18c60 | 1146 | } else if (streq(l, "job-ignore-order")) { |
718db961 LP |
1147 | int b; |
1148 | ||
1149 | b = parse_boolean(v); | |
39a18c60 MS |
1150 | if (b < 0) |
1151 | log_debug("Failed to parse job ignore_order flag %s", v); | |
1152 | else | |
1153 | j->ignore_order = j->ignore_order || b; | |
718db961 LP |
1154 | |
1155 | } else if (streq(l, "job-begin")) { | |
1156 | unsigned long long ull; | |
1157 | ||
1158 | if (sscanf(v, "%llu", &ull) != 1) | |
1159 | log_debug("Failed to parse job-begin value %s", v); | |
39a18c60 | 1160 | else |
718db961 LP |
1161 | j->begin_usec = ull; |
1162 | ||
171f12ce MK |
1163 | } else if (streq(l, "job-begin-running")) { |
1164 | unsigned long long ull; | |
1165 | ||
1166 | if (sscanf(v, "%llu", &ull) != 1) | |
1167 | log_debug("Failed to parse job-begin-running value %s", v); | |
1168 | else | |
1169 | j->begin_running_usec = ull; | |
1170 | ||
8f8f05a9 | 1171 | } else if (streq(l, "subscribed")) { |
718db961 | 1172 | |
b39a2770 | 1173 | if (strv_extend(&j->deserialized_clients, v) < 0) |
05a98afd | 1174 | log_oom(); |
39a18c60 MS |
1175 | } |
1176 | } | |
1177 | } | |
1178 | ||
1179 | int job_coldplug(Job *j) { | |
718db961 | 1180 | int r; |
171f12ce | 1181 | usec_t timeout_time = USEC_INFINITY; |
718db961 LP |
1182 | |
1183 | assert(j); | |
39a18c60 | 1184 | |
8f8f05a9 LP |
1185 | /* After deserialization is complete and the bus connection |
1186 | * set up again, let's start watching our subscribers again */ | |
c5a97ed1 | 1187 | (void) bus_job_coldplug_bus_track(j); |
8f8f05a9 | 1188 | |
1727a595 MM |
1189 | if (j->state == JOB_WAITING) |
1190 | job_add_to_run_queue(j); | |
1191 | ||
c5a97ed1 LP |
1192 | /* Maybe due to new dependencies we don't actually need this job anymore? */ |
1193 | job_add_to_gc_queue(j); | |
1194 | ||
171f12ce MK |
1195 | /* Create timer only when job began or began running and the respective timeout is finite. |
1196 | * Follow logic of job_start_timer() if both timeouts are finite */ | |
1197 | if (j->begin_usec == 0) | |
1198 | return 0; | |
1199 | ||
1200 | if (j->unit->job_timeout != USEC_INFINITY) | |
1201 | timeout_time = usec_add(j->begin_usec, j->unit->job_timeout); | |
1202 | ||
1203 | if (j->begin_running_usec > 0 && j->unit->job_running_timeout != USEC_INFINITY) | |
1204 | timeout_time = MIN(timeout_time, usec_add(j->begin_running_usec, j->unit->job_running_timeout)); | |
1205 | ||
1206 | if (timeout_time == USEC_INFINITY) | |
39a18c60 MS |
1207 | return 0; |
1208 | ||
36c16a7c | 1209 | j->timer_event_source = sd_event_source_unref(j->timer_event_source); |
39a18c60 | 1210 | |
6a0f1f6d LP |
1211 | r = sd_event_add_time( |
1212 | j->manager->event, | |
1213 | &j->timer_event_source, | |
1214 | CLOCK_MONOTONIC, | |
171f12ce | 1215 | timeout_time, 0, |
6a0f1f6d | 1216 | job_dispatch_timer, j); |
718db961 | 1217 | if (r < 0) |
da927ba9 | 1218 | log_debug_errno(r, "Failed to restart timeout for job: %m"); |
718db961 | 1219 | |
7dfbe2e3 TG |
1220 | (void) sd_event_source_set_description(j->timer_event_source, "job-timeout"); |
1221 | ||
718db961 | 1222 | return r; |
39a18c60 MS |
1223 | } |
1224 | ||
c65eb836 LP |
1225 | void job_shutdown_magic(Job *j) { |
1226 | assert(j); | |
1227 | ||
1228 | /* The shutdown target gets some special treatment here: we | |
1229 | * tell the kernel to begin with flushing its disk caches, to | |
1230 | * optimize shutdown time a bit. Ideally we wouldn't hardcode | |
1231 | * this magic into PID 1. However all other processes aren't | |
1232 | * options either since they'd exit much sooner than PID 1 and | |
1233 | * asynchronous sync() would cause their exit to be | |
1234 | * delayed. */ | |
1235 | ||
c2756a68 | 1236 | if (j->type != JOB_START) |
c65eb836 LP |
1237 | return; |
1238 | ||
463d0d15 | 1239 | if (!MANAGER_IS_SYSTEM(j->unit->manager)) |
c2756a68 LP |
1240 | return; |
1241 | ||
1242 | if (!unit_has_name(j->unit, SPECIAL_SHUTDOWN_TARGET)) | |
c65eb836 LP |
1243 | return; |
1244 | ||
5b1869ea OB |
1245 | /* In case messages on console has been disabled on boot */ |
1246 | j->unit->manager->no_console_output = false; | |
1247 | ||
75f86906 | 1248 | if (detect_container() > 0) |
c65eb836 LP |
1249 | return; |
1250 | ||
1251 | asynchronous_sync(); | |
1252 | } | |
1253 | ||
7a7821c8 LP |
1254 | int job_get_timeout(Job *j, usec_t *timeout) { |
1255 | usec_t x = USEC_INFINITY, y = USEC_INFINITY; | |
68db7a3b | 1256 | Unit *u = j->unit; |
7a7821c8 | 1257 | int r; |
68db7a3b ZJS |
1258 | |
1259 | assert(u); | |
1260 | ||
1261 | if (j->timer_event_source) { | |
1262 | r = sd_event_source_get_time(j->timer_event_source, &x); | |
1263 | if (r < 0) | |
1264 | return r; | |
68db7a3b ZJS |
1265 | } |
1266 | ||
1267 | if (UNIT_VTABLE(u)->get_timeout) { | |
7a7821c8 LP |
1268 | r = UNIT_VTABLE(u)->get_timeout(u, &y); |
1269 | if (r < 0) | |
1270 | return r; | |
68db7a3b ZJS |
1271 | } |
1272 | ||
7a7821c8 | 1273 | if (x == USEC_INFINITY && y == USEC_INFINITY) |
68db7a3b ZJS |
1274 | return 0; |
1275 | ||
1276 | *timeout = MIN(x, y); | |
68db7a3b ZJS |
1277 | return 1; |
1278 | } | |
1279 | ||
c5a97ed1 LP |
1280 | bool job_check_gc(Job *j) { |
1281 | Unit *other; | |
1282 | Iterator i; | |
1283 | ||
1284 | assert(j); | |
1285 | ||
1286 | /* Checks whether this job should be GC'ed away. We only do this for jobs of units that have no effect on their | |
1287 | * own and just track external state. For now the only unit type that qualifies for this are .device units. */ | |
1288 | ||
1289 | if (!UNIT_VTABLE(j->unit)->gc_jobs) | |
1290 | return true; | |
1291 | ||
1292 | if (sd_bus_track_count(j->bus_track) > 0) | |
1293 | return true; | |
1294 | ||
1295 | /* FIXME: So this is a bit ugly: for now we don't properly track references made via private bus connections | |
1296 | * (because it's nasty, as sd_bus_track doesn't apply to it). We simply remember that the job was once | |
1297 | * referenced by one, and reset this whenever we notice that no private bus connections are around. This means | |
1298 | * the GC is a bit too conservative when it comes to jobs created by private bus connections. */ | |
1299 | if (j->ref_by_private_bus) { | |
1300 | if (set_isempty(j->unit->manager->private_buses)) | |
1301 | j->ref_by_private_bus = false; | |
1302 | else | |
1303 | return true; | |
1304 | } | |
1305 | ||
1306 | if (j->type == JOB_NOP) | |
1307 | return true; | |
1308 | ||
1309 | /* If a job is ordered after ours, and is to be started, then it needs to wait for us, regardless if we stop or | |
1310 | * start, hence let's not GC in that case. */ | |
1311 | SET_FOREACH(other, j->unit->dependencies[UNIT_BEFORE], i) { | |
1312 | if (!other->job) | |
1313 | continue; | |
1314 | ||
1315 | if (other->job->ignore_order) | |
1316 | continue; | |
1317 | ||
1318 | if (IN_SET(other->job->type, JOB_START, JOB_VERIFY_ACTIVE, JOB_RELOAD)) | |
1319 | return true; | |
1320 | } | |
1321 | ||
047d7219 ZJS |
1322 | /* If we are going down, but something else is ordered After= us, then it needs to wait for us */ |
1323 | if (IN_SET(j->type, JOB_STOP, JOB_RESTART)) | |
c5a97ed1 LP |
1324 | SET_FOREACH(other, j->unit->dependencies[UNIT_AFTER], i) { |
1325 | if (!other->job) | |
1326 | continue; | |
1327 | ||
1328 | if (other->job->ignore_order) | |
1329 | continue; | |
1330 | ||
1331 | return true; | |
1332 | } | |
c5a97ed1 LP |
1333 | |
1334 | /* The logic above is kinda the inverse of the job_is_runnable() logic. Specifically, if the job "we" is | |
1335 | * ordered before the job "other": | |
1336 | * | |
1337 | * we start + other start → stay | |
1338 | * we start + other stop → gc | |
1339 | * we stop + other start → stay | |
1340 | * we stop + other stop → gc | |
1341 | * | |
1342 | * "we" are ordered after "other": | |
1343 | * | |
1344 | * we start + other start → gc | |
1345 | * we start + other stop → gc | |
1346 | * we stop + other start → stay | |
1347 | * we stop + other stop → stay | |
1348 | * | |
1349 | */ | |
1350 | ||
1351 | return false; | |
1352 | } | |
1353 | ||
1354 | void job_add_to_gc_queue(Job *j) { | |
1355 | assert(j); | |
1356 | ||
1357 | if (j->in_gc_queue) | |
1358 | return; | |
1359 | ||
1360 | if (job_check_gc(j)) | |
1361 | return; | |
1362 | ||
1363 | LIST_PREPEND(gc_queue, j->unit->manager->gc_job_queue, j); | |
1364 | j->in_gc_queue = true; | |
1365 | } | |
1366 | ||
15ea79f8 LP |
1367 | static int job_compare(const void *a, const void *b) { |
1368 | Job *x = *(Job**) a, *y = *(Job**) b; | |
1369 | ||
1370 | if (x->id < y->id) | |
1371 | return -1; | |
1372 | if (x->id > y->id) | |
1373 | return 1; | |
1374 | ||
1375 | return 0; | |
1376 | } | |
1377 | ||
1378 | static size_t sort_job_list(Job **list, size_t n) { | |
1379 | Job *previous = NULL; | |
1380 | size_t a, b; | |
1381 | ||
1382 | /* Order by numeric IDs */ | |
1383 | qsort_safe(list, n, sizeof(Job*), job_compare); | |
1384 | ||
1385 | /* Filter out duplicates */ | |
1386 | for (a = 0, b = 0; a < n; a++) { | |
1387 | ||
1388 | if (previous == list[a]) | |
1389 | continue; | |
1390 | ||
1391 | previous = list[b++] = list[a]; | |
1392 | } | |
1393 | ||
1394 | return b; | |
1395 | } | |
1396 | ||
1397 | int job_get_before(Job *j, Job*** ret) { | |
1398 | _cleanup_free_ Job** list = NULL; | |
1399 | size_t n = 0, n_allocated = 0; | |
1400 | Unit *other = NULL; | |
1401 | Iterator i; | |
1402 | ||
1403 | /* Returns a list of all pending jobs that need to finish before this job may be started. */ | |
1404 | ||
1405 | assert(j); | |
1406 | assert(ret); | |
1407 | ||
1408 | if (j->ignore_order) { | |
1409 | *ret = NULL; | |
1410 | return 0; | |
1411 | } | |
1412 | ||
1413 | if (IN_SET(j->type, JOB_START, JOB_VERIFY_ACTIVE, JOB_RELOAD)) { | |
1414 | ||
1415 | SET_FOREACH(other, j->unit->dependencies[UNIT_AFTER], i) { | |
1416 | if (!other->job) | |
1417 | continue; | |
1418 | ||
1419 | if (!GREEDY_REALLOC(list, n_allocated, n+1)) | |
1420 | return -ENOMEM; | |
1421 | list[n++] = other->job; | |
1422 | } | |
1423 | } | |
1424 | ||
1425 | SET_FOREACH(other, j->unit->dependencies[UNIT_BEFORE], i) { | |
1426 | if (!other->job) | |
1427 | continue; | |
1428 | ||
1429 | if (!IN_SET(other->job->type, JOB_STOP, JOB_RESTART)) | |
1430 | continue; | |
1431 | ||
1432 | if (!GREEDY_REALLOC(list, n_allocated, n+1)) | |
1433 | return -ENOMEM; | |
1434 | list[n++] = other->job; | |
1435 | } | |
1436 | ||
1437 | n = sort_job_list(list, n); | |
1438 | ||
1439 | *ret = list; | |
1440 | list = NULL; | |
1441 | ||
1442 | return (int) n; | |
1443 | } | |
1444 | ||
1445 | int job_get_after(Job *j, Job*** ret) { | |
1446 | _cleanup_free_ Job** list = NULL; | |
1447 | size_t n = 0, n_allocated = 0; | |
1448 | Unit *other = NULL; | |
1449 | Iterator i; | |
1450 | ||
1451 | assert(j); | |
1452 | assert(ret); | |
1453 | ||
1454 | /* Returns a list of all pending jobs that are waiting for this job to finish. */ | |
1455 | ||
1456 | SET_FOREACH(other, j->unit->dependencies[UNIT_BEFORE], i) { | |
1457 | if (!other->job) | |
1458 | continue; | |
1459 | ||
1460 | if (other->job->ignore_order) | |
1461 | continue; | |
1462 | ||
1463 | if (!IN_SET(other->job->type, JOB_START, JOB_VERIFY_ACTIVE, JOB_RELOAD)) | |
1464 | continue; | |
1465 | ||
1466 | if (!GREEDY_REALLOC(list, n_allocated, n+1)) | |
1467 | return -ENOMEM; | |
1468 | list[n++] = other->job; | |
1469 | } | |
1470 | ||
1471 | if (IN_SET(j->type, JOB_STOP, JOB_RESTART)) { | |
1472 | ||
1473 | SET_FOREACH(other, j->unit->dependencies[UNIT_AFTER], i) { | |
1474 | if (!other->job) | |
1475 | continue; | |
1476 | ||
1477 | if (other->job->ignore_order) | |
1478 | continue; | |
1479 | ||
1480 | if (!GREEDY_REALLOC(list, n_allocated, n+1)) | |
1481 | return -ENOMEM; | |
1482 | list[n++] = other->job; | |
1483 | } | |
1484 | } | |
1485 | ||
1486 | n = sort_job_list(list, n); | |
1487 | ||
1488 | *ret = list; | |
1489 | list = NULL; | |
1490 | ||
1491 | return (int) n; | |
1492 | } | |
1493 | ||
94f04347 LP |
1494 | static const char* const job_state_table[_JOB_STATE_MAX] = { |
1495 | [JOB_WAITING] = "waiting", | |
0a23a627 | 1496 | [JOB_RUNNING] = "running", |
94f04347 LP |
1497 | }; |
1498 | ||
1499 | DEFINE_STRING_TABLE_LOOKUP(job_state, JobState); | |
1500 | ||
1501 | static const char* const job_type_table[_JOB_TYPE_MAX] = { | |
1502 | [JOB_START] = "start", | |
1503 | [JOB_VERIFY_ACTIVE] = "verify-active", | |
1504 | [JOB_STOP] = "stop", | |
1505 | [JOB_RELOAD] = "reload", | |
1506 | [JOB_RELOAD_OR_START] = "reload-or-start", | |
1507 | [JOB_RESTART] = "restart", | |
1508 | [JOB_TRY_RESTART] = "try-restart", | |
3282591d | 1509 | [JOB_TRY_RELOAD] = "try-reload", |
e0209d83 | 1510 | [JOB_NOP] = "nop", |
94f04347 LP |
1511 | }; |
1512 | ||
1513 | DEFINE_STRING_TABLE_LOOKUP(job_type, JobType); | |
b548631a LP |
1514 | |
1515 | static const char* const job_mode_table[_JOB_MODE_MAX] = { | |
1516 | [JOB_FAIL] = "fail", | |
c497c7a9 | 1517 | [JOB_REPLACE] = "replace", |
23ade460 | 1518 | [JOB_REPLACE_IRREVERSIBLY] = "replace-irreversibly", |
e67c3609 | 1519 | [JOB_ISOLATE] = "isolate", |
2c5859af | 1520 | [JOB_FLUSH] = "flush", |
cebe0d41 | 1521 | [JOB_IGNORE_DEPENDENCIES] = "ignore-dependencies", |
255baef6 | 1522 | [JOB_IGNORE_REQUIREMENTS] = "ignore-requirements", |
b548631a LP |
1523 | }; |
1524 | ||
1525 | DEFINE_STRING_TABLE_LOOKUP(job_mode, JobMode); | |
5d44db4a LP |
1526 | |
1527 | static const char* const job_result_table[_JOB_RESULT_MAX] = { | |
1528 | [JOB_DONE] = "done", | |
1529 | [JOB_CANCELED] = "canceled", | |
1530 | [JOB_TIMEOUT] = "timeout", | |
1531 | [JOB_FAILED] = "failed", | |
d68201e9 | 1532 | [JOB_DEPENDENCY] = "dependency", |
6a371e23 ZJS |
1533 | [JOB_SKIPPED] = "skipped", |
1534 | [JOB_INVALID] = "invalid", | |
59fccdc5 | 1535 | [JOB_ASSERT] = "assert", |
0faacd47 | 1536 | [JOB_UNSUPPORTED] = "unsupported", |
c5a97ed1 | 1537 | [JOB_COLLECTED] = "collected", |
5d44db4a LP |
1538 | }; |
1539 | ||
1540 | DEFINE_STRING_TABLE_LOOKUP(job_result, JobResult); | |
94bd7323 EV |
1541 | |
1542 | const char* job_type_to_access_method(JobType t) { | |
1543 | assert(t >= 0); | |
1544 | assert(t < _JOB_TYPE_MAX); | |
1545 | ||
1546 | if (IN_SET(t, JOB_START, JOB_RESTART, JOB_TRY_RESTART)) | |
1547 | return "start"; | |
1548 | else if (t == JOB_STOP) | |
1549 | return "stop"; | |
1550 | else | |
1551 | return "reload"; | |
1552 | } |