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