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