]>
Commit | Line | Data |
---|---|---|
1 | /* SPDX-License-Identifier: LGPL-2.1-or-later */ | |
2 | ||
3 | #include <errno.h> | |
4 | #include <stdlib.h> | |
5 | #include <sys/prctl.h> | |
6 | #include <unistd.h> | |
7 | ||
8 | #include "sd-id128.h" | |
9 | #include "sd-messages.h" | |
10 | ||
11 | #include "all-units.h" | |
12 | #include "alloc-util.h" | |
13 | #include "bpf-firewall.h" | |
14 | #include "bpf-foreign.h" | |
15 | #include "bpf-socket-bind.h" | |
16 | #include "bus-common-errors.h" | |
17 | #include "bus-internal.h" | |
18 | #include "bus-util.h" | |
19 | #include "cgroup-setup.h" | |
20 | #include "cgroup-util.h" | |
21 | #include "chase.h" | |
22 | #include "core-varlink.h" | |
23 | #include "dbus-unit.h" | |
24 | #include "dbus.h" | |
25 | #include "dropin.h" | |
26 | #include "env-util.h" | |
27 | #include "escape.h" | |
28 | #include "exec-credential.h" | |
29 | #include "execute.h" | |
30 | #include "fd-util.h" | |
31 | #include "fileio-label.h" | |
32 | #include "fileio.h" | |
33 | #include "format-util.h" | |
34 | #include "id128-util.h" | |
35 | #include "install.h" | |
36 | #include "iovec-util.h" | |
37 | #include "label-util.h" | |
38 | #include "load-dropin.h" | |
39 | #include "load-fragment.h" | |
40 | #include "log.h" | |
41 | #include "logarithm.h" | |
42 | #include "macro.h" | |
43 | #include "mkdir-label.h" | |
44 | #include "path-util.h" | |
45 | #include "process-util.h" | |
46 | #include "rm-rf.h" | |
47 | #include "serialize.h" | |
48 | #include "set.h" | |
49 | #include "signal-util.h" | |
50 | #include "sparse-endian.h" | |
51 | #include "special.h" | |
52 | #include "specifier.h" | |
53 | #include "stat-util.h" | |
54 | #include "stdio-util.h" | |
55 | #include "string-table.h" | |
56 | #include "string-util.h" | |
57 | #include "strv.h" | |
58 | #include "terminal-util.h" | |
59 | #include "tmpfile-util.h" | |
60 | #include "umask-util.h" | |
61 | #include "unit-name.h" | |
62 | #include "unit.h" | |
63 | #include "user-util.h" | |
64 | #include "virt.h" | |
65 | #if BPF_FRAMEWORK | |
66 | #include "bpf-link.h" | |
67 | #endif | |
68 | ||
69 | /* Thresholds for logging at INFO level about resource consumption */ | |
70 | #define MENTIONWORTHY_CPU_NSEC (1 * NSEC_PER_SEC) | |
71 | #define MENTIONWORTHY_MEMORY_BYTES (64 * U64_MB) | |
72 | #define MENTIONWORTHY_IO_BYTES (1 * U64_MB) | |
73 | #define MENTIONWORTHY_IP_BYTES UINT64_C(0) | |
74 | ||
75 | /* Thresholds for logging at NOTICE level about resource consumption */ | |
76 | #define NOTICEWORTHY_CPU_NSEC (10 * NSEC_PER_MINUTE) | |
77 | #define NOTICEWORTHY_MEMORY_BYTES (512 * U64_MB) | |
78 | #define NOTICEWORTHY_IO_BYTES (10 * U64_MB) | |
79 | #define NOTICEWORTHY_IP_BYTES (128 * U64_MB) | |
80 | ||
81 | const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = { | |
82 | [UNIT_SERVICE] = &service_vtable, | |
83 | [UNIT_SOCKET] = &socket_vtable, | |
84 | [UNIT_TARGET] = &target_vtable, | |
85 | [UNIT_DEVICE] = &device_vtable, | |
86 | [UNIT_MOUNT] = &mount_vtable, | |
87 | [UNIT_AUTOMOUNT] = &automount_vtable, | |
88 | [UNIT_SWAP] = &swap_vtable, | |
89 | [UNIT_TIMER] = &timer_vtable, | |
90 | [UNIT_PATH] = &path_vtable, | |
91 | [UNIT_SLICE] = &slice_vtable, | |
92 | [UNIT_SCOPE] = &scope_vtable, | |
93 | }; | |
94 | ||
95 | Unit* unit_new(Manager *m, size_t size) { | |
96 | Unit *u; | |
97 | ||
98 | assert(m); | |
99 | assert(size >= sizeof(Unit)); | |
100 | ||
101 | u = malloc0(size); | |
102 | if (!u) | |
103 | return NULL; | |
104 | ||
105 | u->manager = m; | |
106 | u->type = _UNIT_TYPE_INVALID; | |
107 | u->default_dependencies = true; | |
108 | u->unit_file_state = _UNIT_FILE_STATE_INVALID; | |
109 | u->unit_file_preset = -1; | |
110 | u->on_failure_job_mode = JOB_REPLACE; | |
111 | u->on_success_job_mode = JOB_FAIL; | |
112 | u->cgroup_control_inotify_wd = -1; | |
113 | u->cgroup_memory_inotify_wd = -1; | |
114 | u->job_timeout = USEC_INFINITY; | |
115 | u->job_running_timeout = USEC_INFINITY; | |
116 | u->ref_uid = UID_INVALID; | |
117 | u->ref_gid = GID_INVALID; | |
118 | u->cpu_usage_last = NSEC_INFINITY; | |
119 | ||
120 | unit_reset_memory_accounting_last(u); | |
121 | ||
122 | unit_reset_io_accounting_last(u); | |
123 | ||
124 | u->cgroup_invalidated_mask |= CGROUP_MASK_BPF_FIREWALL; | |
125 | u->failure_action_exit_status = u->success_action_exit_status = -1; | |
126 | ||
127 | u->ip_accounting_ingress_map_fd = -EBADF; | |
128 | u->ip_accounting_egress_map_fd = -EBADF; | |
129 | ||
130 | u->ipv4_allow_map_fd = -EBADF; | |
131 | u->ipv6_allow_map_fd = -EBADF; | |
132 | u->ipv4_deny_map_fd = -EBADF; | |
133 | u->ipv6_deny_map_fd = -EBADF; | |
134 | ||
135 | u->last_section_private = -1; | |
136 | ||
137 | u->start_ratelimit = (const RateLimit) { | |
138 | m->defaults.start_limit_interval, | |
139 | m->defaults.start_limit_burst, | |
140 | }; | |
141 | ||
142 | u->auto_start_stop_ratelimit = (const RateLimit) { .interval = 10 * USEC_PER_SEC, .burst = 16 }; | |
143 | ||
144 | return u; | |
145 | } | |
146 | ||
147 | int unit_new_for_name(Manager *m, size_t size, const char *name, Unit **ret) { | |
148 | _cleanup_(unit_freep) Unit *u = NULL; | |
149 | int r; | |
150 | ||
151 | u = unit_new(m, size); | |
152 | if (!u) | |
153 | return -ENOMEM; | |
154 | ||
155 | r = unit_add_name(u, name); | |
156 | if (r < 0) | |
157 | return r; | |
158 | ||
159 | *ret = TAKE_PTR(u); | |
160 | ||
161 | return r; | |
162 | } | |
163 | ||
164 | bool unit_has_name(const Unit *u, const char *name) { | |
165 | assert(u); | |
166 | assert(name); | |
167 | ||
168 | return streq_ptr(name, u->id) || | |
169 | set_contains(u->aliases, name); | |
170 | } | |
171 | ||
172 | static void unit_init(Unit *u) { | |
173 | CGroupContext *cc; | |
174 | ExecContext *ec; | |
175 | KillContext *kc; | |
176 | ||
177 | assert(u); | |
178 | assert(u->manager); | |
179 | assert(u->type >= 0); | |
180 | ||
181 | cc = unit_get_cgroup_context(u); | |
182 | if (cc) { | |
183 | cgroup_context_init(cc); | |
184 | ||
185 | /* Copy in the manager defaults into the cgroup | |
186 | * context, _before_ the rest of the settings have | |
187 | * been initialized */ | |
188 | ||
189 | cc->cpu_accounting = u->manager->defaults.cpu_accounting; | |
190 | cc->io_accounting = u->manager->defaults.io_accounting; | |
191 | cc->blockio_accounting = u->manager->defaults.blockio_accounting; | |
192 | cc->memory_accounting = u->manager->defaults.memory_accounting; | |
193 | cc->tasks_accounting = u->manager->defaults.tasks_accounting; | |
194 | cc->ip_accounting = u->manager->defaults.ip_accounting; | |
195 | ||
196 | if (u->type != UNIT_SLICE) | |
197 | cc->tasks_max = u->manager->defaults.tasks_max; | |
198 | ||
199 | cc->memory_pressure_watch = u->manager->defaults.memory_pressure_watch; | |
200 | cc->memory_pressure_threshold_usec = u->manager->defaults.memory_pressure_threshold_usec; | |
201 | } | |
202 | ||
203 | ec = unit_get_exec_context(u); | |
204 | if (ec) { | |
205 | exec_context_init(ec); | |
206 | ||
207 | if (u->manager->defaults.oom_score_adjust_set) { | |
208 | ec->oom_score_adjust = u->manager->defaults.oom_score_adjust; | |
209 | ec->oom_score_adjust_set = true; | |
210 | } | |
211 | ||
212 | if (MANAGER_IS_SYSTEM(u->manager)) | |
213 | ec->keyring_mode = EXEC_KEYRING_SHARED; | |
214 | else { | |
215 | ec->keyring_mode = EXEC_KEYRING_INHERIT; | |
216 | ||
217 | /* User manager might have its umask redefined by PAM or UMask=. In this | |
218 | * case let the units it manages inherit this value by default. They can | |
219 | * still tune this value through their own unit file */ | |
220 | (void) get_process_umask(0, &ec->umask); | |
221 | } | |
222 | } | |
223 | ||
224 | kc = unit_get_kill_context(u); | |
225 | if (kc) | |
226 | kill_context_init(kc); | |
227 | ||
228 | if (UNIT_VTABLE(u)->init) | |
229 | UNIT_VTABLE(u)->init(u); | |
230 | } | |
231 | ||
232 | static int unit_add_alias(Unit *u, char *donated_name) { | |
233 | int r; | |
234 | ||
235 | /* Make sure that u->names is allocated. We may leave u->names | |
236 | * empty if we fail later, but this is not a problem. */ | |
237 | r = set_ensure_put(&u->aliases, &string_hash_ops, donated_name); | |
238 | if (r < 0) | |
239 | return r; | |
240 | assert(r > 0); | |
241 | ||
242 | return 0; | |
243 | } | |
244 | ||
245 | int unit_add_name(Unit *u, const char *text) { | |
246 | _cleanup_free_ char *name = NULL, *instance = NULL; | |
247 | UnitType t; | |
248 | int r; | |
249 | ||
250 | assert(u); | |
251 | assert(text); | |
252 | ||
253 | if (unit_name_is_valid(text, UNIT_NAME_TEMPLATE)) { | |
254 | if (!u->instance) | |
255 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
256 | "instance is not set when adding name '%s': %m", text); | |
257 | ||
258 | r = unit_name_replace_instance(text, u->instance, &name); | |
259 | if (r < 0) | |
260 | return log_unit_debug_errno(u, r, | |
261 | "failed to build instance name from '%s': %m", text); | |
262 | } else { | |
263 | name = strdup(text); | |
264 | if (!name) | |
265 | return -ENOMEM; | |
266 | } | |
267 | ||
268 | if (unit_has_name(u, name)) | |
269 | return 0; | |
270 | ||
271 | if (hashmap_contains(u->manager->units, name)) | |
272 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EEXIST), | |
273 | "unit already exist when adding name '%s': %m", name); | |
274 | ||
275 | if (!unit_name_is_valid(name, UNIT_NAME_PLAIN|UNIT_NAME_INSTANCE)) | |
276 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
277 | "name '%s' is invalid: %m", name); | |
278 | ||
279 | t = unit_name_to_type(name); | |
280 | if (t < 0) | |
281 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
282 | "failed to derive unit type from name '%s': %m", name); | |
283 | ||
284 | if (u->type != _UNIT_TYPE_INVALID && t != u->type) | |
285 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
286 | "unit type is illegal: u->type(%d) and t(%d) for name '%s': %m", | |
287 | u->type, t, name); | |
288 | ||
289 | r = unit_name_to_instance(name, &instance); | |
290 | if (r < 0) | |
291 | return log_unit_debug_errno(u, r, "failed to extract instance from name '%s': %m", name); | |
292 | ||
293 | if (instance && !unit_type_may_template(t)) | |
294 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), "templates are not allowed for name '%s': %m", name); | |
295 | ||
296 | /* Ensure that this unit either has no instance, or that the instance matches. */ | |
297 | if (u->type != _UNIT_TYPE_INVALID && !streq_ptr(u->instance, instance)) | |
298 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
299 | "cannot add name %s, the instances don't match (\"%s\" != \"%s\").", | |
300 | name, instance, u->instance); | |
301 | ||
302 | if (u->id && !unit_type_may_alias(t)) | |
303 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(EEXIST), | |
304 | "cannot add name %s, aliases are not allowed for %s units.", | |
305 | name, unit_type_to_string(t)); | |
306 | ||
307 | if (hashmap_size(u->manager->units) >= MANAGER_MAX_NAMES) | |
308 | return log_unit_warning_errno(u, SYNTHETIC_ERRNO(E2BIG), "cannot add name, manager has too many units: %m"); | |
309 | ||
310 | /* Add name to the global hashmap first, because that's easier to undo */ | |
311 | r = hashmap_put(u->manager->units, name, u); | |
312 | if (r < 0) | |
313 | return log_unit_debug_errno(u, r, "add unit to hashmap failed for name '%s': %m", text); | |
314 | ||
315 | if (u->id) { | |
316 | r = unit_add_alias(u, name); /* unit_add_alias() takes ownership of the name on success */ | |
317 | if (r < 0) { | |
318 | hashmap_remove(u->manager->units, name); | |
319 | return r; | |
320 | } | |
321 | TAKE_PTR(name); | |
322 | ||
323 | } else { | |
324 | /* A new name, we don't need the set yet. */ | |
325 | assert(u->type == _UNIT_TYPE_INVALID); | |
326 | assert(!u->instance); | |
327 | ||
328 | u->type = t; | |
329 | u->id = TAKE_PTR(name); | |
330 | u->instance = TAKE_PTR(instance); | |
331 | ||
332 | LIST_PREPEND(units_by_type, u->manager->units_by_type[t], u); | |
333 | unit_init(u); | |
334 | } | |
335 | ||
336 | unit_add_to_dbus_queue(u); | |
337 | return 0; | |
338 | } | |
339 | ||
340 | int unit_choose_id(Unit *u, const char *name) { | |
341 | _cleanup_free_ char *t = NULL; | |
342 | char *s; | |
343 | int r; | |
344 | ||
345 | assert(u); | |
346 | assert(name); | |
347 | ||
348 | if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { | |
349 | if (!u->instance) | |
350 | return -EINVAL; | |
351 | ||
352 | r = unit_name_replace_instance(name, u->instance, &t); | |
353 | if (r < 0) | |
354 | return r; | |
355 | ||
356 | name = t; | |
357 | } | |
358 | ||
359 | if (streq_ptr(u->id, name)) | |
360 | return 0; /* Nothing to do. */ | |
361 | ||
362 | /* Selects one of the aliases of this unit as the id */ | |
363 | s = set_get(u->aliases, (char*) name); | |
364 | if (!s) | |
365 | return -ENOENT; | |
366 | ||
367 | if (u->id) { | |
368 | r = set_remove_and_put(u->aliases, name, u->id); | |
369 | if (r < 0) | |
370 | return r; | |
371 | } else | |
372 | assert_se(set_remove(u->aliases, name)); /* see set_get() above… */ | |
373 | ||
374 | u->id = s; /* Old u->id is now stored in the set, and s is not stored anywhere */ | |
375 | unit_add_to_dbus_queue(u); | |
376 | ||
377 | return 0; | |
378 | } | |
379 | ||
380 | int unit_set_description(Unit *u, const char *description) { | |
381 | int r; | |
382 | ||
383 | assert(u); | |
384 | ||
385 | r = free_and_strdup(&u->description, empty_to_null(description)); | |
386 | if (r < 0) | |
387 | return r; | |
388 | if (r > 0) | |
389 | unit_add_to_dbus_queue(u); | |
390 | ||
391 | return 0; | |
392 | } | |
393 | ||
394 | static bool unit_success_failure_handler_has_jobs(Unit *unit) { | |
395 | Unit *other; | |
396 | ||
397 | UNIT_FOREACH_DEPENDENCY(other, unit, UNIT_ATOM_ON_SUCCESS) | |
398 | if (other->job || other->nop_job) | |
399 | return true; | |
400 | ||
401 | UNIT_FOREACH_DEPENDENCY(other, unit, UNIT_ATOM_ON_FAILURE) | |
402 | if (other->job || other->nop_job) | |
403 | return true; | |
404 | ||
405 | return false; | |
406 | } | |
407 | ||
408 | void unit_release_resources(Unit *u) { | |
409 | UnitActiveState state; | |
410 | ExecContext *ec; | |
411 | ||
412 | assert(u); | |
413 | ||
414 | if (u->job || u->nop_job) | |
415 | return; | |
416 | ||
417 | if (u->perpetual) | |
418 | return; | |
419 | ||
420 | state = unit_active_state(u); | |
421 | if (!IN_SET(state, UNIT_INACTIVE, UNIT_FAILED)) | |
422 | return; | |
423 | ||
424 | if (unit_will_restart(u)) | |
425 | return; | |
426 | ||
427 | ec = unit_get_exec_context(u); | |
428 | if (ec && ec->runtime_directory_preserve_mode == EXEC_PRESERVE_RESTART) | |
429 | exec_context_destroy_runtime_directory(ec, u->manager->prefix[EXEC_DIRECTORY_RUNTIME]); | |
430 | ||
431 | if (UNIT_VTABLE(u)->release_resources) | |
432 | UNIT_VTABLE(u)->release_resources(u); | |
433 | } | |
434 | ||
435 | bool unit_may_gc(Unit *u) { | |
436 | UnitActiveState state; | |
437 | int r; | |
438 | ||
439 | assert(u); | |
440 | ||
441 | /* Checks whether the unit is ready to be unloaded for garbage collection. Returns true when the | |
442 | * unit may be collected, and false if there's some reason to keep it loaded. | |
443 | * | |
444 | * References from other units are *not* checked here. Instead, this is done in unit_gc_sweep(), but | |
445 | * using markers to properly collect dependency loops. | |
446 | */ | |
447 | ||
448 | if (u->job || u->nop_job) | |
449 | return false; | |
450 | ||
451 | if (u->perpetual) | |
452 | return false; | |
453 | ||
454 | /* if we saw a cgroup empty event for this unit, stay around until we processed it so that we remove | |
455 | * the empty cgroup if possible. Similar, process any pending OOM events if they are already queued | |
456 | * before we release the unit. */ | |
457 | if (u->in_cgroup_empty_queue || u->in_cgroup_oom_queue) | |
458 | return false; | |
459 | ||
460 | /* Make sure to send out D-Bus events before we unload the unit */ | |
461 | if (u->in_dbus_queue) | |
462 | return false; | |
463 | ||
464 | if (sd_bus_track_count(u->bus_track) > 0) | |
465 | return false; | |
466 | ||
467 | state = unit_active_state(u); | |
468 | ||
469 | /* But we keep the unit object around for longer when it is referenced or configured to not be | |
470 | * gc'ed */ | |
471 | switch (u->collect_mode) { | |
472 | ||
473 | case COLLECT_INACTIVE: | |
474 | if (state != UNIT_INACTIVE) | |
475 | return false; | |
476 | ||
477 | break; | |
478 | ||
479 | case COLLECT_INACTIVE_OR_FAILED: | |
480 | if (!IN_SET(state, UNIT_INACTIVE, UNIT_FAILED)) | |
481 | return false; | |
482 | ||
483 | break; | |
484 | ||
485 | default: | |
486 | assert_not_reached(); | |
487 | } | |
488 | ||
489 | /* Check if any OnFailure= or on Success= jobs may be pending */ | |
490 | if (unit_success_failure_handler_has_jobs(u)) | |
491 | return false; | |
492 | ||
493 | if (u->cgroup_path) { | |
494 | /* If the unit has a cgroup, then check whether there's anything in it. If so, we should stay | |
495 | * around. Units with active processes should never be collected. */ | |
496 | ||
497 | r = cg_is_empty_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path); | |
498 | if (r < 0) | |
499 | log_unit_debug_errno(u, r, "Failed to determine whether cgroup %s is empty: %m", empty_to_root(u->cgroup_path)); | |
500 | if (r <= 0) | |
501 | return false; | |
502 | } | |
503 | ||
504 | if (!UNIT_VTABLE(u)->may_gc) | |
505 | return true; | |
506 | ||
507 | return UNIT_VTABLE(u)->may_gc(u); | |
508 | } | |
509 | ||
510 | void unit_add_to_load_queue(Unit *u) { | |
511 | assert(u); | |
512 | assert(u->type != _UNIT_TYPE_INVALID); | |
513 | ||
514 | if (u->load_state != UNIT_STUB || u->in_load_queue) | |
515 | return; | |
516 | ||
517 | LIST_PREPEND(load_queue, u->manager->load_queue, u); | |
518 | u->in_load_queue = true; | |
519 | } | |
520 | ||
521 | void unit_add_to_cleanup_queue(Unit *u) { | |
522 | assert(u); | |
523 | ||
524 | if (u->in_cleanup_queue) | |
525 | return; | |
526 | ||
527 | LIST_PREPEND(cleanup_queue, u->manager->cleanup_queue, u); | |
528 | u->in_cleanup_queue = true; | |
529 | } | |
530 | ||
531 | void unit_add_to_gc_queue(Unit *u) { | |
532 | assert(u); | |
533 | ||
534 | if (u->in_gc_queue || u->in_cleanup_queue) | |
535 | return; | |
536 | ||
537 | if (!unit_may_gc(u)) | |
538 | return; | |
539 | ||
540 | LIST_PREPEND(gc_queue, u->manager->gc_unit_queue, u); | |
541 | u->in_gc_queue = true; | |
542 | } | |
543 | ||
544 | void unit_add_to_dbus_queue(Unit *u) { | |
545 | assert(u); | |
546 | assert(u->type != _UNIT_TYPE_INVALID); | |
547 | ||
548 | if (u->load_state == UNIT_STUB || u->in_dbus_queue) | |
549 | return; | |
550 | ||
551 | /* Shortcut things if nobody cares */ | |
552 | if (sd_bus_track_count(u->manager->subscribed) <= 0 && | |
553 | sd_bus_track_count(u->bus_track) <= 0 && | |
554 | set_isempty(u->manager->private_buses)) { | |
555 | u->sent_dbus_new_signal = true; | |
556 | return; | |
557 | } | |
558 | ||
559 | LIST_PREPEND(dbus_queue, u->manager->dbus_unit_queue, u); | |
560 | u->in_dbus_queue = true; | |
561 | } | |
562 | ||
563 | void unit_submit_to_stop_when_unneeded_queue(Unit *u) { | |
564 | assert(u); | |
565 | ||
566 | if (u->in_stop_when_unneeded_queue) | |
567 | return; | |
568 | ||
569 | if (!u->stop_when_unneeded) | |
570 | return; | |
571 | ||
572 | if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u))) | |
573 | return; | |
574 | ||
575 | LIST_PREPEND(stop_when_unneeded_queue, u->manager->stop_when_unneeded_queue, u); | |
576 | u->in_stop_when_unneeded_queue = true; | |
577 | } | |
578 | ||
579 | void unit_submit_to_start_when_upheld_queue(Unit *u) { | |
580 | assert(u); | |
581 | ||
582 | if (u->in_start_when_upheld_queue) | |
583 | return; | |
584 | ||
585 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u))) | |
586 | return; | |
587 | ||
588 | if (!unit_has_dependency(u, UNIT_ATOM_START_STEADILY, NULL)) | |
589 | return; | |
590 | ||
591 | LIST_PREPEND(start_when_upheld_queue, u->manager->start_when_upheld_queue, u); | |
592 | u->in_start_when_upheld_queue = true; | |
593 | } | |
594 | ||
595 | void unit_submit_to_stop_when_bound_queue(Unit *u) { | |
596 | assert(u); | |
597 | ||
598 | if (u->in_stop_when_bound_queue) | |
599 | return; | |
600 | ||
601 | if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u))) | |
602 | return; | |
603 | ||
604 | if (!unit_has_dependency(u, UNIT_ATOM_CANNOT_BE_ACTIVE_WITHOUT, NULL)) | |
605 | return; | |
606 | ||
607 | LIST_PREPEND(stop_when_bound_queue, u->manager->stop_when_bound_queue, u); | |
608 | u->in_stop_when_bound_queue = true; | |
609 | } | |
610 | ||
611 | static bool unit_can_release_resources(Unit *u) { | |
612 | ExecContext *ec; | |
613 | ||
614 | assert(u); | |
615 | ||
616 | if (UNIT_VTABLE(u)->release_resources) | |
617 | return true; | |
618 | ||
619 | ec = unit_get_exec_context(u); | |
620 | if (ec && ec->runtime_directory_preserve_mode == EXEC_PRESERVE_RESTART) | |
621 | return true; | |
622 | ||
623 | return false; | |
624 | } | |
625 | ||
626 | void unit_submit_to_release_resources_queue(Unit *u) { | |
627 | assert(u); | |
628 | ||
629 | if (u->in_release_resources_queue) | |
630 | return; | |
631 | ||
632 | if (u->job || u->nop_job) | |
633 | return; | |
634 | ||
635 | if (u->perpetual) | |
636 | return; | |
637 | ||
638 | if (!unit_can_release_resources(u)) | |
639 | return; | |
640 | ||
641 | LIST_PREPEND(release_resources_queue, u->manager->release_resources_queue, u); | |
642 | u->in_release_resources_queue = true; | |
643 | } | |
644 | ||
645 | static void unit_clear_dependencies(Unit *u) { | |
646 | assert(u); | |
647 | ||
648 | /* Removes all dependencies configured on u and their reverse dependencies. */ | |
649 | ||
650 | for (Hashmap *deps; (deps = hashmap_steal_first(u->dependencies));) { | |
651 | ||
652 | for (Unit *other; (other = hashmap_steal_first_key(deps));) { | |
653 | Hashmap *other_deps; | |
654 | ||
655 | HASHMAP_FOREACH(other_deps, other->dependencies) | |
656 | hashmap_remove(other_deps, u); | |
657 | ||
658 | unit_add_to_gc_queue(other); | |
659 | } | |
660 | ||
661 | hashmap_free(deps); | |
662 | } | |
663 | ||
664 | u->dependencies = hashmap_free(u->dependencies); | |
665 | } | |
666 | ||
667 | static void unit_remove_transient(Unit *u) { | |
668 | assert(u); | |
669 | ||
670 | if (!u->transient) | |
671 | return; | |
672 | ||
673 | if (u->fragment_path) | |
674 | (void) unlink(u->fragment_path); | |
675 | ||
676 | STRV_FOREACH(i, u->dropin_paths) { | |
677 | _cleanup_free_ char *p = NULL, *pp = NULL; | |
678 | ||
679 | if (path_extract_directory(*i, &p) < 0) /* Get the drop-in directory from the drop-in file */ | |
680 | continue; | |
681 | ||
682 | if (path_extract_directory(p, &pp) < 0) /* Get the config directory from the drop-in directory */ | |
683 | continue; | |
684 | ||
685 | /* Only drop transient drop-ins */ | |
686 | if (!path_equal(u->manager->lookup_paths.transient, pp)) | |
687 | continue; | |
688 | ||
689 | (void) unlink(*i); | |
690 | (void) rmdir(p); | |
691 | } | |
692 | } | |
693 | ||
694 | static void unit_free_mounts_for(Unit *u) { | |
695 | assert(u); | |
696 | ||
697 | for (UnitMountDependencyType t = 0; t < _UNIT_MOUNT_DEPENDENCY_TYPE_MAX; ++t) { | |
698 | for (;;) { | |
699 | _cleanup_free_ char *path = NULL; | |
700 | ||
701 | path = hashmap_steal_first_key(u->mounts_for[t]); | |
702 | if (!path) | |
703 | break; | |
704 | ||
705 | char s[strlen(path) + 1]; | |
706 | ||
707 | PATH_FOREACH_PREFIX_MORE(s, path) { | |
708 | char *y; | |
709 | Set *x; | |
710 | ||
711 | x = hashmap_get2(u->manager->units_needing_mounts_for[t], s, (void**) &y); | |
712 | if (!x) | |
713 | continue; | |
714 | ||
715 | (void) set_remove(x, u); | |
716 | ||
717 | if (set_isempty(x)) { | |
718 | assert_se(hashmap_remove(u->manager->units_needing_mounts_for[t], y)); | |
719 | free(y); | |
720 | set_free(x); | |
721 | } | |
722 | } | |
723 | } | |
724 | ||
725 | u->mounts_for[t] = hashmap_free(u->mounts_for[t]); | |
726 | } | |
727 | } | |
728 | ||
729 | static void unit_done(Unit *u) { | |
730 | ExecContext *ec; | |
731 | CGroupContext *cc; | |
732 | ||
733 | assert(u); | |
734 | ||
735 | if (u->type < 0) | |
736 | return; | |
737 | ||
738 | if (UNIT_VTABLE(u)->done) | |
739 | UNIT_VTABLE(u)->done(u); | |
740 | ||
741 | ec = unit_get_exec_context(u); | |
742 | if (ec) | |
743 | exec_context_done(ec); | |
744 | ||
745 | cc = unit_get_cgroup_context(u); | |
746 | if (cc) | |
747 | cgroup_context_done(cc); | |
748 | } | |
749 | ||
750 | Unit* unit_free(Unit *u) { | |
751 | Unit *slice; | |
752 | char *t; | |
753 | ||
754 | if (!u) | |
755 | return NULL; | |
756 | ||
757 | sd_event_source_disable_unref(u->auto_start_stop_event_source); | |
758 | ||
759 | u->transient_file = safe_fclose(u->transient_file); | |
760 | ||
761 | if (!MANAGER_IS_RELOADING(u->manager)) | |
762 | unit_remove_transient(u); | |
763 | ||
764 | bus_unit_send_removed_signal(u); | |
765 | ||
766 | unit_done(u); | |
767 | ||
768 | unit_dequeue_rewatch_pids(u); | |
769 | ||
770 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); | |
771 | u->bus_track = sd_bus_track_unref(u->bus_track); | |
772 | u->deserialized_refs = strv_free(u->deserialized_refs); | |
773 | u->pending_freezer_invocation = sd_bus_message_unref(u->pending_freezer_invocation); | |
774 | ||
775 | unit_free_mounts_for(u); | |
776 | ||
777 | SET_FOREACH(t, u->aliases) | |
778 | hashmap_remove_value(u->manager->units, t, u); | |
779 | if (u->id) | |
780 | hashmap_remove_value(u->manager->units, u->id, u); | |
781 | ||
782 | if (!sd_id128_is_null(u->invocation_id)) | |
783 | hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
784 | ||
785 | if (u->job) { | |
786 | Job *j = u->job; | |
787 | job_uninstall(j); | |
788 | job_free(j); | |
789 | } | |
790 | ||
791 | if (u->nop_job) { | |
792 | Job *j = u->nop_job; | |
793 | job_uninstall(j); | |
794 | job_free(j); | |
795 | } | |
796 | ||
797 | /* A unit is being dropped from the tree, make sure our family is realized properly. Do this after we | |
798 | * detach the unit from slice tree in order to eliminate its effect on controller masks. */ | |
799 | slice = UNIT_GET_SLICE(u); | |
800 | unit_clear_dependencies(u); | |
801 | if (slice) | |
802 | unit_add_family_to_cgroup_realize_queue(slice); | |
803 | ||
804 | if (u->on_console) | |
805 | manager_unref_console(u->manager); | |
806 | ||
807 | fdset_free(u->initial_socket_bind_link_fds); | |
808 | #if BPF_FRAMEWORK | |
809 | bpf_link_free(u->ipv4_socket_bind_link); | |
810 | bpf_link_free(u->ipv6_socket_bind_link); | |
811 | #endif | |
812 | ||
813 | unit_release_cgroup(u); | |
814 | ||
815 | if (!MANAGER_IS_RELOADING(u->manager)) | |
816 | unit_unlink_state_files(u); | |
817 | ||
818 | unit_unref_uid_gid(u, false); | |
819 | ||
820 | (void) manager_update_failed_units(u->manager, u, false); | |
821 | set_remove(u->manager->startup_units, u); | |
822 | ||
823 | unit_unwatch_all_pids(u); | |
824 | ||
825 | while (u->refs_by_target) | |
826 | unit_ref_unset(u->refs_by_target); | |
827 | ||
828 | if (u->type != _UNIT_TYPE_INVALID) | |
829 | LIST_REMOVE(units_by_type, u->manager->units_by_type[u->type], u); | |
830 | ||
831 | if (u->in_load_queue) | |
832 | LIST_REMOVE(load_queue, u->manager->load_queue, u); | |
833 | ||
834 | if (u->in_dbus_queue) | |
835 | LIST_REMOVE(dbus_queue, u->manager->dbus_unit_queue, u); | |
836 | ||
837 | if (u->in_cleanup_queue) | |
838 | LIST_REMOVE(cleanup_queue, u->manager->cleanup_queue, u); | |
839 | ||
840 | if (u->in_gc_queue) | |
841 | LIST_REMOVE(gc_queue, u->manager->gc_unit_queue, u); | |
842 | ||
843 | if (u->in_cgroup_realize_queue) | |
844 | LIST_REMOVE(cgroup_realize_queue, u->manager->cgroup_realize_queue, u); | |
845 | ||
846 | if (u->in_cgroup_empty_queue) | |
847 | LIST_REMOVE(cgroup_empty_queue, u->manager->cgroup_empty_queue, u); | |
848 | ||
849 | if (u->in_cgroup_oom_queue) | |
850 | LIST_REMOVE(cgroup_oom_queue, u->manager->cgroup_oom_queue, u); | |
851 | ||
852 | if (u->in_target_deps_queue) | |
853 | LIST_REMOVE(target_deps_queue, u->manager->target_deps_queue, u); | |
854 | ||
855 | if (u->in_stop_when_unneeded_queue) | |
856 | LIST_REMOVE(stop_when_unneeded_queue, u->manager->stop_when_unneeded_queue, u); | |
857 | ||
858 | if (u->in_start_when_upheld_queue) | |
859 | LIST_REMOVE(start_when_upheld_queue, u->manager->start_when_upheld_queue, u); | |
860 | ||
861 | if (u->in_stop_when_bound_queue) | |
862 | LIST_REMOVE(stop_when_bound_queue, u->manager->stop_when_bound_queue, u); | |
863 | ||
864 | if (u->in_release_resources_queue) | |
865 | LIST_REMOVE(release_resources_queue, u->manager->release_resources_queue, u); | |
866 | ||
867 | bpf_firewall_close(u); | |
868 | ||
869 | hashmap_free(u->bpf_foreign_by_key); | |
870 | ||
871 | bpf_program_free(u->bpf_device_control_installed); | |
872 | ||
873 | #if BPF_FRAMEWORK | |
874 | bpf_link_free(u->restrict_ifaces_ingress_bpf_link); | |
875 | bpf_link_free(u->restrict_ifaces_egress_bpf_link); | |
876 | #endif | |
877 | fdset_free(u->initial_restric_ifaces_link_fds); | |
878 | ||
879 | condition_free_list(u->conditions); | |
880 | condition_free_list(u->asserts); | |
881 | ||
882 | free(u->description); | |
883 | strv_free(u->documentation); | |
884 | free(u->fragment_path); | |
885 | free(u->source_path); | |
886 | strv_free(u->dropin_paths); | |
887 | free(u->instance); | |
888 | ||
889 | free(u->job_timeout_reboot_arg); | |
890 | free(u->reboot_arg); | |
891 | ||
892 | free(u->access_selinux_context); | |
893 | ||
894 | set_free_free(u->aliases); | |
895 | free(u->id); | |
896 | ||
897 | activation_details_unref(u->activation_details); | |
898 | ||
899 | return mfree(u); | |
900 | } | |
901 | ||
902 | FreezerState unit_freezer_state(Unit *u) { | |
903 | assert(u); | |
904 | ||
905 | return u->freezer_state; | |
906 | } | |
907 | ||
908 | int unit_freezer_state_kernel(Unit *u, FreezerState *ret) { | |
909 | char *values[1] = {}; | |
910 | int r; | |
911 | ||
912 | assert(u); | |
913 | ||
914 | r = cg_get_keyed_attribute(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, "cgroup.events", | |
915 | STRV_MAKE("frozen"), values); | |
916 | if (r < 0) | |
917 | return r; | |
918 | ||
919 | r = _FREEZER_STATE_INVALID; | |
920 | ||
921 | if (values[0]) { | |
922 | if (streq(values[0], "0")) | |
923 | r = FREEZER_RUNNING; | |
924 | else if (streq(values[0], "1")) | |
925 | r = FREEZER_FROZEN; | |
926 | } | |
927 | ||
928 | free(values[0]); | |
929 | *ret = r; | |
930 | ||
931 | return 0; | |
932 | } | |
933 | ||
934 | UnitActiveState unit_active_state(Unit *u) { | |
935 | assert(u); | |
936 | ||
937 | if (u->load_state == UNIT_MERGED) | |
938 | return unit_active_state(unit_follow_merge(u)); | |
939 | ||
940 | /* After a reload it might happen that a unit is not correctly | |
941 | * loaded but still has a process around. That's why we won't | |
942 | * shortcut failed loading to UNIT_INACTIVE_FAILED. */ | |
943 | ||
944 | return UNIT_VTABLE(u)->active_state(u); | |
945 | } | |
946 | ||
947 | const char* unit_sub_state_to_string(Unit *u) { | |
948 | assert(u); | |
949 | ||
950 | return UNIT_VTABLE(u)->sub_state_to_string(u); | |
951 | } | |
952 | ||
953 | static int unit_merge_names(Unit *u, Unit *other) { | |
954 | char *name; | |
955 | int r; | |
956 | ||
957 | assert(u); | |
958 | assert(other); | |
959 | ||
960 | r = unit_add_alias(u, other->id); | |
961 | if (r < 0) | |
962 | return r; | |
963 | ||
964 | r = set_move(u->aliases, other->aliases); | |
965 | if (r < 0) { | |
966 | set_remove(u->aliases, other->id); | |
967 | return r; | |
968 | } | |
969 | ||
970 | TAKE_PTR(other->id); | |
971 | other->aliases = set_free_free(other->aliases); | |
972 | ||
973 | SET_FOREACH(name, u->aliases) | |
974 | assert_se(hashmap_replace(u->manager->units, name, u) == 0); | |
975 | ||
976 | return 0; | |
977 | } | |
978 | ||
979 | static int unit_reserve_dependencies(Unit *u, Unit *other) { | |
980 | size_t n_reserve; | |
981 | Hashmap* deps; | |
982 | void *d; | |
983 | int r; | |
984 | ||
985 | assert(u); | |
986 | assert(other); | |
987 | ||
988 | /* Let's reserve some space in the dependency hashmaps so that later on merging the units cannot | |
989 | * fail. | |
990 | * | |
991 | * First make some room in the per dependency type hashmaps. Using the summed size of both units' | |
992 | * hashmaps is an estimate that is likely too high since they probably use some of the same | |
993 | * types. But it's never too low, and that's all we need. */ | |
994 | ||
995 | n_reserve = MIN(hashmap_size(other->dependencies), LESS_BY((size_t) _UNIT_DEPENDENCY_MAX, hashmap_size(u->dependencies))); | |
996 | if (n_reserve > 0) { | |
997 | r = hashmap_ensure_allocated(&u->dependencies, NULL); | |
998 | if (r < 0) | |
999 | return r; | |
1000 | ||
1001 | r = hashmap_reserve(u->dependencies, n_reserve); | |
1002 | if (r < 0) | |
1003 | return r; | |
1004 | } | |
1005 | ||
1006 | /* Now, enlarge our per dependency type hashmaps by the number of entries in the same hashmap of the | |
1007 | * other unit's dependencies. | |
1008 | * | |
1009 | * NB: If u does not have a dependency set allocated for some dependency type, there is no need to | |
1010 | * reserve anything for. In that case other's set will be transferred as a whole to u by | |
1011 | * complete_move(). */ | |
1012 | ||
1013 | HASHMAP_FOREACH_KEY(deps, d, u->dependencies) { | |
1014 | Hashmap *other_deps; | |
1015 | ||
1016 | other_deps = hashmap_get(other->dependencies, d); | |
1017 | ||
1018 | r = hashmap_reserve(deps, hashmap_size(other_deps)); | |
1019 | if (r < 0) | |
1020 | return r; | |
1021 | } | |
1022 | ||
1023 | return 0; | |
1024 | } | |
1025 | ||
1026 | static bool unit_should_warn_about_dependency(UnitDependency dependency) { | |
1027 | /* Only warn about some unit types */ | |
1028 | return IN_SET(dependency, | |
1029 | UNIT_CONFLICTS, | |
1030 | UNIT_CONFLICTED_BY, | |
1031 | UNIT_BEFORE, | |
1032 | UNIT_AFTER, | |
1033 | UNIT_ON_SUCCESS, | |
1034 | UNIT_ON_FAILURE, | |
1035 | UNIT_TRIGGERS, | |
1036 | UNIT_TRIGGERED_BY); | |
1037 | } | |
1038 | ||
1039 | static int unit_per_dependency_type_hashmap_update( | |
1040 | Hashmap *per_type, | |
1041 | Unit *other, | |
1042 | UnitDependencyMask origin_mask, | |
1043 | UnitDependencyMask destination_mask) { | |
1044 | ||
1045 | UnitDependencyInfo info; | |
1046 | int r; | |
1047 | ||
1048 | assert(other); | |
1049 | assert_cc(sizeof(void*) == sizeof(info)); | |
1050 | ||
1051 | /* Acquire the UnitDependencyInfo entry for the Unit* we are interested in, and update it if it | |
1052 | * exists, or insert it anew if not. */ | |
1053 | ||
1054 | info.data = hashmap_get(per_type, other); | |
1055 | if (info.data) { | |
1056 | /* Entry already exists. Add in our mask. */ | |
1057 | ||
1058 | if (FLAGS_SET(origin_mask, info.origin_mask) && | |
1059 | FLAGS_SET(destination_mask, info.destination_mask)) | |
1060 | return 0; /* NOP */ | |
1061 | ||
1062 | info.origin_mask |= origin_mask; | |
1063 | info.destination_mask |= destination_mask; | |
1064 | ||
1065 | r = hashmap_update(per_type, other, info.data); | |
1066 | } else { | |
1067 | info = (UnitDependencyInfo) { | |
1068 | .origin_mask = origin_mask, | |
1069 | .destination_mask = destination_mask, | |
1070 | }; | |
1071 | ||
1072 | r = hashmap_put(per_type, other, info.data); | |
1073 | } | |
1074 | if (r < 0) | |
1075 | return r; | |
1076 | ||
1077 | return 1; | |
1078 | } | |
1079 | ||
1080 | static void unit_merge_dependencies(Unit *u, Unit *other) { | |
1081 | Hashmap *deps; | |
1082 | void *dt; /* Actually of type UnitDependency, except that we don't bother casting it here, | |
1083 | * since the hashmaps all want it as void pointer. */ | |
1084 | ||
1085 | assert(u); | |
1086 | assert(other); | |
1087 | ||
1088 | if (u == other) | |
1089 | return; | |
1090 | ||
1091 | /* First, remove dependency to other. */ | |
1092 | HASHMAP_FOREACH_KEY(deps, dt, u->dependencies) { | |
1093 | if (hashmap_remove(deps, other) && unit_should_warn_about_dependency(UNIT_DEPENDENCY_FROM_PTR(dt))) | |
1094 | log_unit_warning(u, "Dependency %s=%s is dropped, as %s is merged into %s.", | |
1095 | unit_dependency_to_string(UNIT_DEPENDENCY_FROM_PTR(dt)), | |
1096 | other->id, other->id, u->id); | |
1097 | ||
1098 | if (hashmap_isempty(deps)) | |
1099 | hashmap_free(hashmap_remove(u->dependencies, dt)); | |
1100 | } | |
1101 | ||
1102 | for (;;) { | |
1103 | _cleanup_hashmap_free_ Hashmap *other_deps = NULL; | |
1104 | UnitDependencyInfo di_back; | |
1105 | Unit *back; | |
1106 | ||
1107 | /* Let's focus on one dependency type at a time, that 'other' has defined. */ | |
1108 | other_deps = hashmap_steal_first_key_and_value(other->dependencies, &dt); | |
1109 | if (!other_deps) | |
1110 | break; /* done! */ | |
1111 | ||
1112 | deps = hashmap_get(u->dependencies, dt); | |
1113 | ||
1114 | /* Now iterate through all dependencies of this dependency type, of 'other'. We refer to the | |
1115 | * referenced units as 'back'. */ | |
1116 | HASHMAP_FOREACH_KEY(di_back.data, back, other_deps) { | |
1117 | Hashmap *back_deps; | |
1118 | void *back_dt; | |
1119 | ||
1120 | if (back == u) { | |
1121 | /* This is a dependency pointing back to the unit we want to merge with? | |
1122 | * Suppress it (but warn) */ | |
1123 | if (unit_should_warn_about_dependency(UNIT_DEPENDENCY_FROM_PTR(dt))) | |
1124 | log_unit_warning(u, "Dependency %s=%s in %s is dropped, as %s is merged into %s.", | |
1125 | unit_dependency_to_string(UNIT_DEPENDENCY_FROM_PTR(dt)), | |
1126 | u->id, other->id, other->id, u->id); | |
1127 | ||
1128 | hashmap_remove(other_deps, back); | |
1129 | continue; | |
1130 | } | |
1131 | ||
1132 | /* Now iterate through all deps of 'back', and fix the ones pointing to 'other' to | |
1133 | * point to 'u' instead. */ | |
1134 | HASHMAP_FOREACH_KEY(back_deps, back_dt, back->dependencies) { | |
1135 | UnitDependencyInfo di_move; | |
1136 | ||
1137 | di_move.data = hashmap_remove(back_deps, other); | |
1138 | if (!di_move.data) | |
1139 | continue; | |
1140 | ||
1141 | assert_se(unit_per_dependency_type_hashmap_update( | |
1142 | back_deps, | |
1143 | u, | |
1144 | di_move.origin_mask, | |
1145 | di_move.destination_mask) >= 0); | |
1146 | } | |
1147 | ||
1148 | /* The target unit already has dependencies of this type, let's then merge this individually. */ | |
1149 | if (deps) | |
1150 | assert_se(unit_per_dependency_type_hashmap_update( | |
1151 | deps, | |
1152 | back, | |
1153 | di_back.origin_mask, | |
1154 | di_back.destination_mask) >= 0); | |
1155 | } | |
1156 | ||
1157 | /* Now all references towards 'other' of the current type 'dt' are corrected to point to 'u'. | |
1158 | * Lets's now move the deps of type 'dt' from 'other' to 'u'. If the unit does not have | |
1159 | * dependencies of this type, let's move them per type wholesale. */ | |
1160 | if (!deps) | |
1161 | assert_se(hashmap_put(u->dependencies, dt, TAKE_PTR(other_deps)) >= 0); | |
1162 | } | |
1163 | ||
1164 | other->dependencies = hashmap_free(other->dependencies); | |
1165 | } | |
1166 | ||
1167 | int unit_merge(Unit *u, Unit *other) { | |
1168 | int r; | |
1169 | ||
1170 | assert(u); | |
1171 | assert(other); | |
1172 | assert(u->manager == other->manager); | |
1173 | assert(u->type != _UNIT_TYPE_INVALID); | |
1174 | ||
1175 | other = unit_follow_merge(other); | |
1176 | ||
1177 | if (other == u) | |
1178 | return 0; | |
1179 | ||
1180 | if (u->type != other->type) | |
1181 | return -EINVAL; | |
1182 | ||
1183 | if (!unit_type_may_alias(u->type)) /* Merging only applies to unit names that support aliases */ | |
1184 | return -EEXIST; | |
1185 | ||
1186 | if (!IN_SET(other->load_state, UNIT_STUB, UNIT_NOT_FOUND)) | |
1187 | return -EEXIST; | |
1188 | ||
1189 | if (!streq_ptr(u->instance, other->instance)) | |
1190 | return -EINVAL; | |
1191 | ||
1192 | if (other->job) | |
1193 | return -EEXIST; | |
1194 | ||
1195 | if (other->nop_job) | |
1196 | return -EEXIST; | |
1197 | ||
1198 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other))) | |
1199 | return -EEXIST; | |
1200 | ||
1201 | /* Make reservations to ensure merge_dependencies() won't fail. We don't rollback reservations if we | |
1202 | * fail. We don't have a way to undo reservations. A reservation is not a leak. */ | |
1203 | r = unit_reserve_dependencies(u, other); | |
1204 | if (r < 0) | |
1205 | return r; | |
1206 | ||
1207 | /* Redirect all references */ | |
1208 | while (other->refs_by_target) | |
1209 | unit_ref_set(other->refs_by_target, other->refs_by_target->source, u); | |
1210 | ||
1211 | /* Merge dependencies */ | |
1212 | unit_merge_dependencies(u, other); | |
1213 | ||
1214 | /* Merge names. It is better to do that after merging deps, otherwise the log message contains n/a. */ | |
1215 | r = unit_merge_names(u, other); | |
1216 | if (r < 0) | |
1217 | return r; | |
1218 | ||
1219 | other->load_state = UNIT_MERGED; | |
1220 | other->merged_into = u; | |
1221 | ||
1222 | if (!u->activation_details) | |
1223 | u->activation_details = activation_details_ref(other->activation_details); | |
1224 | ||
1225 | /* If there is still some data attached to the other node, we | |
1226 | * don't need it anymore, and can free it. */ | |
1227 | if (other->load_state != UNIT_STUB) | |
1228 | if (UNIT_VTABLE(other)->done) | |
1229 | UNIT_VTABLE(other)->done(other); | |
1230 | ||
1231 | unit_add_to_dbus_queue(u); | |
1232 | unit_add_to_cleanup_queue(other); | |
1233 | ||
1234 | return 0; | |
1235 | } | |
1236 | ||
1237 | int unit_merge_by_name(Unit *u, const char *name) { | |
1238 | _cleanup_free_ char *s = NULL; | |
1239 | Unit *other; | |
1240 | int r; | |
1241 | ||
1242 | /* Either add name to u, or if a unit with name already exists, merge it with u. | |
1243 | * If name is a template, do the same for name@instance, where instance is u's instance. */ | |
1244 | ||
1245 | assert(u); | |
1246 | assert(name); | |
1247 | ||
1248 | if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { | |
1249 | if (!u->instance) | |
1250 | return -EINVAL; | |
1251 | ||
1252 | r = unit_name_replace_instance(name, u->instance, &s); | |
1253 | if (r < 0) | |
1254 | return r; | |
1255 | ||
1256 | name = s; | |
1257 | } | |
1258 | ||
1259 | other = manager_get_unit(u->manager, name); | |
1260 | if (other) | |
1261 | return unit_merge(u, other); | |
1262 | ||
1263 | return unit_add_name(u, name); | |
1264 | } | |
1265 | ||
1266 | Unit* unit_follow_merge(Unit *u) { | |
1267 | assert(u); | |
1268 | ||
1269 | while (u->load_state == UNIT_MERGED) | |
1270 | assert_se(u = u->merged_into); | |
1271 | ||
1272 | return u; | |
1273 | } | |
1274 | ||
1275 | int unit_add_exec_dependencies(Unit *u, ExecContext *c) { | |
1276 | int r; | |
1277 | ||
1278 | assert(u); | |
1279 | assert(c); | |
1280 | ||
1281 | /* Unlike unit_add_dependency() or friends, this always returns 0 on success. */ | |
1282 | ||
1283 | if (c->working_directory) { | |
1284 | r = unit_add_mounts_for( | |
1285 | u, | |
1286 | c->working_directory, | |
1287 | UNIT_DEPENDENCY_FILE, | |
1288 | c->working_directory_missing_ok ? UNIT_MOUNT_WANTS : UNIT_MOUNT_REQUIRES); | |
1289 | if (r < 0) | |
1290 | return r; | |
1291 | } | |
1292 | ||
1293 | if (c->root_directory) { | |
1294 | r = unit_add_mounts_for(u, c->root_directory, UNIT_DEPENDENCY_FILE, UNIT_MOUNT_WANTS); | |
1295 | if (r < 0) | |
1296 | return r; | |
1297 | } | |
1298 | ||
1299 | if (c->root_image) { | |
1300 | r = unit_add_mounts_for(u, c->root_image, UNIT_DEPENDENCY_FILE, UNIT_MOUNT_WANTS); | |
1301 | if (r < 0) | |
1302 | return r; | |
1303 | } | |
1304 | ||
1305 | for (ExecDirectoryType dt = 0; dt < _EXEC_DIRECTORY_TYPE_MAX; dt++) { | |
1306 | if (!u->manager->prefix[dt]) | |
1307 | continue; | |
1308 | ||
1309 | for (size_t i = 0; i < c->directories[dt].n_items; i++) { | |
1310 | _cleanup_free_ char *p = NULL; | |
1311 | ||
1312 | p = path_join(u->manager->prefix[dt], c->directories[dt].items[i].path); | |
1313 | if (!p) | |
1314 | return -ENOMEM; | |
1315 | ||
1316 | r = unit_add_mounts_for(u, p, UNIT_DEPENDENCY_FILE, UNIT_MOUNT_REQUIRES); | |
1317 | if (r < 0) | |
1318 | return r; | |
1319 | } | |
1320 | } | |
1321 | ||
1322 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
1323 | return 0; | |
1324 | ||
1325 | /* For the following three directory types we need write access, and /var/ is possibly on the root | |
1326 | * fs. Hence order after systemd-remount-fs.service, to ensure things are writable. */ | |
1327 | if (c->directories[EXEC_DIRECTORY_STATE].n_items > 0 || | |
1328 | c->directories[EXEC_DIRECTORY_CACHE].n_items > 0 || | |
1329 | c->directories[EXEC_DIRECTORY_LOGS].n_items > 0) { | |
1330 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_REMOUNT_FS_SERVICE, true, UNIT_DEPENDENCY_FILE); | |
1331 | if (r < 0) | |
1332 | return r; | |
1333 | } | |
1334 | ||
1335 | if (c->private_tmp) { | |
1336 | r = unit_add_mounts_for(u, "/tmp", UNIT_DEPENDENCY_FILE, UNIT_MOUNT_WANTS); | |
1337 | if (r < 0) | |
1338 | return r; | |
1339 | ||
1340 | r = unit_add_mounts_for(u, "/var/tmp", UNIT_DEPENDENCY_FILE, UNIT_MOUNT_WANTS); | |
1341 | if (r < 0) | |
1342 | return r; | |
1343 | ||
1344 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_TMPFILES_SETUP_SERVICE, true, UNIT_DEPENDENCY_FILE); | |
1345 | if (r < 0) | |
1346 | return r; | |
1347 | } | |
1348 | ||
1349 | if (c->root_image) { | |
1350 | /* We need to wait for /dev/loopX to appear when doing RootImage=, hence let's add an | |
1351 | * implicit dependency on udev */ | |
1352 | ||
1353 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_UDEVD_SERVICE, true, UNIT_DEPENDENCY_FILE); | |
1354 | if (r < 0) | |
1355 | return r; | |
1356 | } | |
1357 | ||
1358 | if (!IN_SET(c->std_output, | |
1359 | EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE, | |
1360 | EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE) && | |
1361 | !IN_SET(c->std_error, | |
1362 | EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE, | |
1363 | EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE) && | |
1364 | !c->log_namespace) | |
1365 | return 0; | |
1366 | ||
1367 | /* If syslog or kernel logging is requested (or log namespacing is), make sure our own logging daemon | |
1368 | * is run first. */ | |
1369 | ||
1370 | if (c->log_namespace) { | |
1371 | _cleanup_free_ char *socket_unit = NULL, *varlink_socket_unit = NULL; | |
1372 | ||
1373 | r = unit_name_build_from_type("systemd-journald", c->log_namespace, UNIT_SOCKET, &socket_unit); | |
1374 | if (r < 0) | |
1375 | return r; | |
1376 | ||
1377 | r = unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_REQUIRES, socket_unit, true, UNIT_DEPENDENCY_FILE); | |
1378 | if (r < 0) | |
1379 | return r; | |
1380 | ||
1381 | r = unit_name_build_from_type("systemd-journald-varlink", c->log_namespace, UNIT_SOCKET, &varlink_socket_unit); | |
1382 | if (r < 0) | |
1383 | return r; | |
1384 | ||
1385 | r = unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_REQUIRES, varlink_socket_unit, true, UNIT_DEPENDENCY_FILE); | |
1386 | if (r < 0) | |
1387 | return r; | |
1388 | } else { | |
1389 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_JOURNALD_SOCKET, true, UNIT_DEPENDENCY_FILE); | |
1390 | if (r < 0) | |
1391 | return r; | |
1392 | } | |
1393 | ||
1394 | r = unit_add_default_credential_dependencies(u, c); | |
1395 | if (r < 0) | |
1396 | return r; | |
1397 | ||
1398 | return 0; | |
1399 | } | |
1400 | ||
1401 | const char* unit_description(Unit *u) { | |
1402 | assert(u); | |
1403 | ||
1404 | if (u->description) | |
1405 | return u->description; | |
1406 | ||
1407 | return strna(u->id); | |
1408 | } | |
1409 | ||
1410 | const char* unit_status_string(Unit *u, char **ret_combined_buffer) { | |
1411 | assert(u); | |
1412 | assert(u->id); | |
1413 | ||
1414 | /* Return u->id, u->description, or "{u->id} - {u->description}". | |
1415 | * Versions with u->description are only used if it is set. | |
1416 | * The last option is used if configured and the caller provided the 'ret_combined_buffer' | |
1417 | * pointer. | |
1418 | * | |
1419 | * Note that *ret_combined_buffer may be set to NULL. */ | |
1420 | ||
1421 | if (!u->description || | |
1422 | u->manager->status_unit_format == STATUS_UNIT_FORMAT_NAME || | |
1423 | (u->manager->status_unit_format == STATUS_UNIT_FORMAT_COMBINED && !ret_combined_buffer) || | |
1424 | streq(u->description, u->id)) { | |
1425 | ||
1426 | if (ret_combined_buffer) | |
1427 | *ret_combined_buffer = NULL; | |
1428 | return u->id; | |
1429 | } | |
1430 | ||
1431 | if (ret_combined_buffer) { | |
1432 | if (u->manager->status_unit_format == STATUS_UNIT_FORMAT_COMBINED) { | |
1433 | *ret_combined_buffer = strjoin(u->id, " - ", u->description); | |
1434 | if (*ret_combined_buffer) | |
1435 | return *ret_combined_buffer; | |
1436 | log_oom(); /* Fall back to ->description */ | |
1437 | } else | |
1438 | *ret_combined_buffer = NULL; | |
1439 | } | |
1440 | ||
1441 | return u->description; | |
1442 | } | |
1443 | ||
1444 | /* Common implementation for multiple backends */ | |
1445 | int unit_load_fragment_and_dropin(Unit *u, bool fragment_required) { | |
1446 | int r; | |
1447 | ||
1448 | assert(u); | |
1449 | ||
1450 | /* Load a .{service,socket,...} file */ | |
1451 | r = unit_load_fragment(u); | |
1452 | if (r < 0) | |
1453 | return r; | |
1454 | ||
1455 | if (u->load_state == UNIT_STUB) { | |
1456 | if (fragment_required) | |
1457 | return -ENOENT; | |
1458 | ||
1459 | u->load_state = UNIT_LOADED; | |
1460 | } | |
1461 | ||
1462 | /* Load drop-in directory data. If u is an alias, we might be reloading the | |
1463 | * target unit needlessly. But we cannot be sure which drops-ins have already | |
1464 | * been loaded and which not, at least without doing complicated book-keeping, | |
1465 | * so let's always reread all drop-ins. */ | |
1466 | r = unit_load_dropin(unit_follow_merge(u)); | |
1467 | if (r < 0) | |
1468 | return r; | |
1469 | ||
1470 | if (u->source_path) { | |
1471 | struct stat st; | |
1472 | ||
1473 | if (stat(u->source_path, &st) >= 0) | |
1474 | u->source_mtime = timespec_load(&st.st_mtim); | |
1475 | else | |
1476 | u->source_mtime = 0; | |
1477 | } | |
1478 | ||
1479 | return 0; | |
1480 | } | |
1481 | ||
1482 | void unit_add_to_target_deps_queue(Unit *u) { | |
1483 | Manager *m = ASSERT_PTR(ASSERT_PTR(u)->manager); | |
1484 | ||
1485 | if (u->in_target_deps_queue) | |
1486 | return; | |
1487 | ||
1488 | LIST_PREPEND(target_deps_queue, m->target_deps_queue, u); | |
1489 | u->in_target_deps_queue = true; | |
1490 | } | |
1491 | ||
1492 | int unit_add_default_target_dependency(Unit *u, Unit *target) { | |
1493 | assert(u); | |
1494 | assert(target); | |
1495 | ||
1496 | if (target->type != UNIT_TARGET) | |
1497 | return 0; | |
1498 | ||
1499 | /* Only add the dependency if both units are loaded, so that | |
1500 | * that loop check below is reliable */ | |
1501 | if (u->load_state != UNIT_LOADED || | |
1502 | target->load_state != UNIT_LOADED) | |
1503 | return 0; | |
1504 | ||
1505 | /* If either side wants no automatic dependencies, then let's | |
1506 | * skip this */ | |
1507 | if (!u->default_dependencies || | |
1508 | !target->default_dependencies) | |
1509 | return 0; | |
1510 | ||
1511 | /* Don't create loops */ | |
1512 | if (unit_has_dependency(target, UNIT_ATOM_BEFORE, u)) | |
1513 | return 0; | |
1514 | ||
1515 | return unit_add_dependency(target, UNIT_AFTER, u, true, UNIT_DEPENDENCY_DEFAULT); | |
1516 | } | |
1517 | ||
1518 | static int unit_add_slice_dependencies(Unit *u) { | |
1519 | Unit *slice; | |
1520 | assert(u); | |
1521 | ||
1522 | if (!UNIT_HAS_CGROUP_CONTEXT(u)) | |
1523 | return 0; | |
1524 | ||
1525 | /* Slice units are implicitly ordered against their parent slices (as this relationship is encoded in the | |
1526 | name), while all other units are ordered based on configuration (as in their case Slice= configures the | |
1527 | relationship). */ | |
1528 | UnitDependencyMask mask = u->type == UNIT_SLICE ? UNIT_DEPENDENCY_IMPLICIT : UNIT_DEPENDENCY_FILE; | |
1529 | ||
1530 | slice = UNIT_GET_SLICE(u); | |
1531 | if (slice) | |
1532 | return unit_add_two_dependencies(u, UNIT_AFTER, UNIT_REQUIRES, slice, true, mask); | |
1533 | ||
1534 | if (unit_has_name(u, SPECIAL_ROOT_SLICE)) | |
1535 | return 0; | |
1536 | ||
1537 | return unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_REQUIRES, SPECIAL_ROOT_SLICE, true, mask); | |
1538 | } | |
1539 | ||
1540 | static int unit_add_mount_dependencies(Unit *u) { | |
1541 | bool changed = false; | |
1542 | int r; | |
1543 | ||
1544 | assert(u); | |
1545 | ||
1546 | for (UnitMountDependencyType t = 0; t < _UNIT_MOUNT_DEPENDENCY_TYPE_MAX; ++t) { | |
1547 | UnitDependencyInfo di; | |
1548 | const char *path; | |
1549 | ||
1550 | HASHMAP_FOREACH_KEY(di.data, path, u->mounts_for[t]) { | |
1551 | ||
1552 | char prefix[strlen(ASSERT_PTR(path)) + 1]; | |
1553 | ||
1554 | PATH_FOREACH_PREFIX_MORE(prefix, path) { | |
1555 | _cleanup_free_ char *p = NULL; | |
1556 | Unit *m; | |
1557 | ||
1558 | r = unit_name_from_path(prefix, ".mount", &p); | |
1559 | if (r == -EINVAL) | |
1560 | continue; /* If the path cannot be converted to a mount unit name, | |
1561 | * then it's not manageable as a unit by systemd, and | |
1562 | * hence we don't need a dependency on it. Let's thus | |
1563 | * silently ignore the issue. */ | |
1564 | if (r < 0) | |
1565 | return r; | |
1566 | ||
1567 | m = manager_get_unit(u->manager, p); | |
1568 | if (!m) { | |
1569 | /* Make sure to load the mount unit if it exists. If so the | |
1570 | * dependencies on this unit will be added later during the loading | |
1571 | * of the mount unit. */ | |
1572 | (void) manager_load_unit_prepare( | |
1573 | u->manager, | |
1574 | p, | |
1575 | /* path= */NULL, | |
1576 | /* e= */NULL, | |
1577 | &m); | |
1578 | continue; | |
1579 | } | |
1580 | if (m == u) | |
1581 | continue; | |
1582 | ||
1583 | if (m->load_state != UNIT_LOADED) | |
1584 | continue; | |
1585 | ||
1586 | r = unit_add_dependency( | |
1587 | u, | |
1588 | UNIT_AFTER, | |
1589 | m, | |
1590 | /* add_reference= */ true, | |
1591 | di.origin_mask); | |
1592 | if (r < 0) | |
1593 | return r; | |
1594 | changed = changed || r > 0; | |
1595 | ||
1596 | if (m->fragment_path) { | |
1597 | r = unit_add_dependency( | |
1598 | u, | |
1599 | unit_mount_dependency_type_to_dependency_type(t), | |
1600 | m, | |
1601 | /* add_reference= */ true, | |
1602 | di.origin_mask); | |
1603 | if (r < 0) | |
1604 | return r; | |
1605 | changed = changed || r > 0; | |
1606 | } | |
1607 | } | |
1608 | } | |
1609 | } | |
1610 | ||
1611 | return changed; | |
1612 | } | |
1613 | ||
1614 | static int unit_add_oomd_dependencies(Unit *u) { | |
1615 | CGroupContext *c; | |
1616 | CGroupMask mask; | |
1617 | int r; | |
1618 | ||
1619 | assert(u); | |
1620 | ||
1621 | if (!u->default_dependencies) | |
1622 | return 0; | |
1623 | ||
1624 | c = unit_get_cgroup_context(u); | |
1625 | if (!c) | |
1626 | return 0; | |
1627 | ||
1628 | bool wants_oomd = c->moom_swap == MANAGED_OOM_KILL || c->moom_mem_pressure == MANAGED_OOM_KILL; | |
1629 | if (!wants_oomd) | |
1630 | return 0; | |
1631 | ||
1632 | if (!cg_all_unified()) | |
1633 | return 0; | |
1634 | ||
1635 | r = cg_mask_supported(&mask); | |
1636 | if (r < 0) | |
1637 | return log_debug_errno(r, "Failed to determine supported controllers: %m"); | |
1638 | ||
1639 | if (!FLAGS_SET(mask, CGROUP_MASK_MEMORY)) | |
1640 | return 0; | |
1641 | ||
1642 | return unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_WANTS, "systemd-oomd.service", true, UNIT_DEPENDENCY_FILE); | |
1643 | } | |
1644 | ||
1645 | static int unit_add_startup_units(Unit *u) { | |
1646 | if (!unit_has_startup_cgroup_constraints(u)) | |
1647 | return 0; | |
1648 | ||
1649 | return set_ensure_put(&u->manager->startup_units, NULL, u); | |
1650 | } | |
1651 | ||
1652 | static int unit_validate_on_failure_job_mode( | |
1653 | Unit *u, | |
1654 | const char *job_mode_setting, | |
1655 | JobMode job_mode, | |
1656 | const char *dependency_name, | |
1657 | UnitDependencyAtom atom) { | |
1658 | ||
1659 | Unit *other, *found = NULL; | |
1660 | ||
1661 | if (job_mode != JOB_ISOLATE) | |
1662 | return 0; | |
1663 | ||
1664 | UNIT_FOREACH_DEPENDENCY(other, u, atom) { | |
1665 | if (!found) | |
1666 | found = other; | |
1667 | else if (found != other) | |
1668 | return log_unit_error_errno( | |
1669 | u, SYNTHETIC_ERRNO(ENOEXEC), | |
1670 | "More than one %s dependencies specified but %sisolate set. Refusing.", | |
1671 | dependency_name, job_mode_setting); | |
1672 | } | |
1673 | ||
1674 | return 0; | |
1675 | } | |
1676 | ||
1677 | int unit_load(Unit *u) { | |
1678 | int r; | |
1679 | ||
1680 | assert(u); | |
1681 | ||
1682 | if (u->in_load_queue) { | |
1683 | LIST_REMOVE(load_queue, u->manager->load_queue, u); | |
1684 | u->in_load_queue = false; | |
1685 | } | |
1686 | ||
1687 | if (u->type == _UNIT_TYPE_INVALID) | |
1688 | return -EINVAL; | |
1689 | ||
1690 | if (u->load_state != UNIT_STUB) | |
1691 | return 0; | |
1692 | ||
1693 | if (u->transient_file) { | |
1694 | /* Finalize transient file: if this is a transient unit file, as soon as we reach unit_load() the setup | |
1695 | * is complete, hence let's synchronize the unit file we just wrote to disk. */ | |
1696 | ||
1697 | r = fflush_and_check(u->transient_file); | |
1698 | if (r < 0) | |
1699 | goto fail; | |
1700 | ||
1701 | u->transient_file = safe_fclose(u->transient_file); | |
1702 | u->fragment_mtime = now(CLOCK_REALTIME); | |
1703 | } | |
1704 | ||
1705 | r = UNIT_VTABLE(u)->load(u); | |
1706 | if (r < 0) | |
1707 | goto fail; | |
1708 | ||
1709 | assert(u->load_state != UNIT_STUB); | |
1710 | ||
1711 | if (u->load_state == UNIT_LOADED) { | |
1712 | unit_add_to_target_deps_queue(u); | |
1713 | ||
1714 | r = unit_add_slice_dependencies(u); | |
1715 | if (r < 0) | |
1716 | goto fail; | |
1717 | ||
1718 | r = unit_add_mount_dependencies(u); | |
1719 | if (r < 0) | |
1720 | goto fail; | |
1721 | ||
1722 | r = unit_add_oomd_dependencies(u); | |
1723 | if (r < 0) | |
1724 | goto fail; | |
1725 | ||
1726 | r = unit_add_startup_units(u); | |
1727 | if (r < 0) | |
1728 | goto fail; | |
1729 | ||
1730 | r = unit_validate_on_failure_job_mode(u, "OnSuccessJobMode=", u->on_success_job_mode, "OnSuccess=", UNIT_ATOM_ON_SUCCESS); | |
1731 | if (r < 0) | |
1732 | goto fail; | |
1733 | ||
1734 | r = unit_validate_on_failure_job_mode(u, "OnFailureJobMode=", u->on_failure_job_mode, "OnFailure=", UNIT_ATOM_ON_FAILURE); | |
1735 | if (r < 0) | |
1736 | goto fail; | |
1737 | ||
1738 | if (u->job_running_timeout != USEC_INFINITY && u->job_running_timeout > u->job_timeout) | |
1739 | log_unit_warning(u, "JobRunningTimeoutSec= is greater than JobTimeoutSec=, it has no effect."); | |
1740 | ||
1741 | /* We finished loading, let's ensure our parents recalculate the members mask */ | |
1742 | unit_invalidate_cgroup_members_masks(u); | |
1743 | } | |
1744 | ||
1745 | assert((u->load_state != UNIT_MERGED) == !u->merged_into); | |
1746 | ||
1747 | unit_add_to_dbus_queue(unit_follow_merge(u)); | |
1748 | unit_add_to_gc_queue(u); | |
1749 | (void) manager_varlink_send_managed_oom_update(u); | |
1750 | ||
1751 | return 0; | |
1752 | ||
1753 | fail: | |
1754 | /* We convert ENOEXEC errors to the UNIT_BAD_SETTING load state here. Configuration parsing code | |
1755 | * should hence return ENOEXEC to ensure units are placed in this state after loading. */ | |
1756 | ||
1757 | u->load_state = u->load_state == UNIT_STUB ? UNIT_NOT_FOUND : | |
1758 | r == -ENOEXEC ? UNIT_BAD_SETTING : | |
1759 | UNIT_ERROR; | |
1760 | u->load_error = r; | |
1761 | ||
1762 | /* Record the timestamp on the cache, so that if the cache gets updated between now and the next time | |
1763 | * an attempt is made to load this unit, we know we need to check again. */ | |
1764 | if (u->load_state == UNIT_NOT_FOUND) | |
1765 | u->fragment_not_found_timestamp_hash = u->manager->unit_cache_timestamp_hash; | |
1766 | ||
1767 | unit_add_to_dbus_queue(u); | |
1768 | unit_add_to_gc_queue(u); | |
1769 | ||
1770 | return log_unit_debug_errno(u, r, "Failed to load configuration: %m"); | |
1771 | } | |
1772 | ||
1773 | _printf_(7, 8) | |
1774 | static int log_unit_internal(void *userdata, int level, int error, const char *file, int line, const char *func, const char *format, ...) { | |
1775 | Unit *u = userdata; | |
1776 | va_list ap; | |
1777 | int r; | |
1778 | ||
1779 | if (u && !unit_log_level_test(u, level)) | |
1780 | return -ERRNO_VALUE(error); | |
1781 | ||
1782 | va_start(ap, format); | |
1783 | if (u) | |
1784 | r = log_object_internalv(level, error, file, line, func, | |
1785 | u->manager->unit_log_field, | |
1786 | u->id, | |
1787 | u->manager->invocation_log_field, | |
1788 | u->invocation_id_string, | |
1789 | format, ap); | |
1790 | else | |
1791 | r = log_internalv(level, error, file, line, func, format, ap); | |
1792 | va_end(ap); | |
1793 | ||
1794 | return r; | |
1795 | } | |
1796 | ||
1797 | static bool unit_test_condition(Unit *u) { | |
1798 | _cleanup_strv_free_ char **env = NULL; | |
1799 | int r; | |
1800 | ||
1801 | assert(u); | |
1802 | ||
1803 | dual_timestamp_now(&u->condition_timestamp); | |
1804 | ||
1805 | r = manager_get_effective_environment(u->manager, &env); | |
1806 | if (r < 0) { | |
1807 | log_unit_error_errno(u, r, "Failed to determine effective environment: %m"); | |
1808 | u->condition_result = true; | |
1809 | } else | |
1810 | u->condition_result = condition_test_list( | |
1811 | u->conditions, | |
1812 | env, | |
1813 | condition_type_to_string, | |
1814 | log_unit_internal, | |
1815 | u); | |
1816 | ||
1817 | unit_add_to_dbus_queue(u); | |
1818 | return u->condition_result; | |
1819 | } | |
1820 | ||
1821 | static bool unit_test_assert(Unit *u) { | |
1822 | _cleanup_strv_free_ char **env = NULL; | |
1823 | int r; | |
1824 | ||
1825 | assert(u); | |
1826 | ||
1827 | dual_timestamp_now(&u->assert_timestamp); | |
1828 | ||
1829 | r = manager_get_effective_environment(u->manager, &env); | |
1830 | if (r < 0) { | |
1831 | log_unit_error_errno(u, r, "Failed to determine effective environment: %m"); | |
1832 | u->assert_result = CONDITION_ERROR; | |
1833 | } else | |
1834 | u->assert_result = condition_test_list( | |
1835 | u->asserts, | |
1836 | env, | |
1837 | assert_type_to_string, | |
1838 | log_unit_internal, | |
1839 | u); | |
1840 | ||
1841 | unit_add_to_dbus_queue(u); | |
1842 | return u->assert_result; | |
1843 | } | |
1844 | ||
1845 | void unit_status_printf(Unit *u, StatusType status_type, const char *status, const char *format, const char *ident) { | |
1846 | if (log_get_show_color()) { | |
1847 | if (u->manager->status_unit_format == STATUS_UNIT_FORMAT_COMBINED && strchr(ident, ' ')) | |
1848 | ident = strjoina(ANSI_HIGHLIGHT, u->id, ANSI_NORMAL, " - ", u->description); | |
1849 | else | |
1850 | ident = strjoina(ANSI_HIGHLIGHT, ident, ANSI_NORMAL); | |
1851 | } | |
1852 | ||
1853 | DISABLE_WARNING_FORMAT_NONLITERAL; | |
1854 | manager_status_printf(u->manager, status_type, status, format, ident); | |
1855 | REENABLE_WARNING; | |
1856 | } | |
1857 | ||
1858 | int unit_test_start_limit(Unit *u) { | |
1859 | const char *reason; | |
1860 | ||
1861 | assert(u); | |
1862 | ||
1863 | if (ratelimit_below(&u->start_ratelimit)) { | |
1864 | u->start_limit_hit = false; | |
1865 | return 0; | |
1866 | } | |
1867 | ||
1868 | log_unit_warning(u, "Start request repeated too quickly."); | |
1869 | u->start_limit_hit = true; | |
1870 | ||
1871 | reason = strjoina("unit ", u->id, " failed"); | |
1872 | ||
1873 | emergency_action(u->manager, u->start_limit_action, | |
1874 | EMERGENCY_ACTION_IS_WATCHDOG|EMERGENCY_ACTION_WARN, | |
1875 | u->reboot_arg, -1, reason); | |
1876 | ||
1877 | return -ECANCELED; | |
1878 | } | |
1879 | ||
1880 | static bool unit_verify_deps(Unit *u) { | |
1881 | Unit *other; | |
1882 | ||
1883 | assert(u); | |
1884 | ||
1885 | /* Checks whether all BindsTo= dependencies of this unit are fulfilled — if they are also combined | |
1886 | * with After=. We do not check Requires= or Requisite= here as they only should have an effect on | |
1887 | * the job processing, but do not have any effect afterwards. We don't check BindsTo= dependencies | |
1888 | * that are not used in conjunction with After= as for them any such check would make things entirely | |
1889 | * racy. */ | |
1890 | ||
1891 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_CANNOT_BE_ACTIVE_WITHOUT) { | |
1892 | ||
1893 | if (!unit_has_dependency(u, UNIT_ATOM_AFTER, other)) | |
1894 | continue; | |
1895 | ||
1896 | if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(other))) { | |
1897 | log_unit_notice(u, "Bound to unit %s, but unit isn't active.", other->id); | |
1898 | return false; | |
1899 | } | |
1900 | } | |
1901 | ||
1902 | return true; | |
1903 | } | |
1904 | ||
1905 | /* Errors that aren't really errors: | |
1906 | * -EALREADY: Unit is already started. | |
1907 | * -ECOMM: Condition failed | |
1908 | * -EAGAIN: An operation is already in progress. Retry later. | |
1909 | * | |
1910 | * Errors that are real errors: | |
1911 | * -EBADR: This unit type does not support starting. | |
1912 | * -ECANCELED: Start limit hit, too many requests for now | |
1913 | * -EPROTO: Assert failed | |
1914 | * -EINVAL: Unit not loaded | |
1915 | * -EOPNOTSUPP: Unit type not supported | |
1916 | * -ENOLINK: The necessary dependencies are not fulfilled. | |
1917 | * -ESTALE: This unit has been started before and can't be started a second time | |
1918 | * -ENOENT: This is a triggering unit and unit to trigger is not loaded | |
1919 | */ | |
1920 | int unit_start(Unit *u, ActivationDetails *details) { | |
1921 | UnitActiveState state; | |
1922 | Unit *following; | |
1923 | int r; | |
1924 | ||
1925 | assert(u); | |
1926 | ||
1927 | /* Let's hold off running start jobs for mount units when /proc/self/mountinfo monitor is ratelimited. */ | |
1928 | if (UNIT_VTABLE(u)->subsystem_ratelimited) { | |
1929 | r = UNIT_VTABLE(u)->subsystem_ratelimited(u->manager); | |
1930 | if (r < 0) | |
1931 | return r; | |
1932 | if (r > 0) | |
1933 | return -EAGAIN; | |
1934 | } | |
1935 | ||
1936 | /* If this is already started, then this will succeed. Note that this will even succeed if this unit | |
1937 | * is not startable by the user. This is relied on to detect when we need to wait for units and when | |
1938 | * waiting is finished. */ | |
1939 | state = unit_active_state(u); | |
1940 | if (UNIT_IS_ACTIVE_OR_RELOADING(state)) | |
1941 | return -EALREADY; | |
1942 | if (state == UNIT_MAINTENANCE) | |
1943 | return -EAGAIN; | |
1944 | ||
1945 | /* Units that aren't loaded cannot be started */ | |
1946 | if (u->load_state != UNIT_LOADED) | |
1947 | return -EINVAL; | |
1948 | ||
1949 | /* Refuse starting scope units more than once */ | |
1950 | if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_enter_timestamp)) | |
1951 | return -ESTALE; | |
1952 | ||
1953 | /* If the conditions were unmet, don't do anything at all. If we already are activating this call might | |
1954 | * still be useful to speed up activation in case there is some hold-off time, but we don't want to | |
1955 | * recheck the condition in that case. */ | |
1956 | if (state != UNIT_ACTIVATING && | |
1957 | !unit_test_condition(u)) | |
1958 | return log_unit_debug_errno(u, SYNTHETIC_ERRNO(ECOMM), "Starting requested but condition not met. Not starting unit."); | |
1959 | ||
1960 | /* If the asserts failed, fail the entire job */ | |
1961 | if (state != UNIT_ACTIVATING && | |
1962 | !unit_test_assert(u)) | |
1963 | return log_unit_notice_errno(u, SYNTHETIC_ERRNO(EPROTO), "Starting requested but asserts failed."); | |
1964 | ||
1965 | /* Units of types that aren't supported cannot be started. Note that we do this test only after the | |
1966 | * condition checks, so that we rather return condition check errors (which are usually not | |
1967 | * considered a true failure) than "not supported" errors (which are considered a failure). | |
1968 | */ | |
1969 | if (!unit_type_supported(u->type)) | |
1970 | return -EOPNOTSUPP; | |
1971 | ||
1972 | /* Let's make sure that the deps really are in order before we start this. Normally the job engine | |
1973 | * should have taken care of this already, but let's check this here again. After all, our | |
1974 | * dependencies might not be in effect anymore, due to a reload or due to an unmet condition. */ | |
1975 | if (!unit_verify_deps(u)) | |
1976 | return -ENOLINK; | |
1977 | ||
1978 | /* Forward to the main object, if we aren't it. */ | |
1979 | following = unit_following(u); | |
1980 | if (following) { | |
1981 | log_unit_debug(u, "Redirecting start request from %s to %s.", u->id, following->id); | |
1982 | return unit_start(following, details); | |
1983 | } | |
1984 | ||
1985 | /* Check our ability to start early so that failure conditions don't cause us to enter a busy loop. */ | |
1986 | if (UNIT_VTABLE(u)->can_start) { | |
1987 | r = UNIT_VTABLE(u)->can_start(u); | |
1988 | if (r < 0) | |
1989 | return r; | |
1990 | } | |
1991 | ||
1992 | /* If it is stopped, but we cannot start it, then fail */ | |
1993 | if (!UNIT_VTABLE(u)->start) | |
1994 | return -EBADR; | |
1995 | ||
1996 | /* We don't suppress calls to ->start() here when we are already starting, to allow this request to | |
1997 | * be used as a "hurry up" call, for example when the unit is in some "auto restart" state where it | |
1998 | * waits for a holdoff timer to elapse before it will start again. */ | |
1999 | ||
2000 | unit_add_to_dbus_queue(u); | |
2001 | unit_cgroup_freezer_action(u, FREEZER_THAW); | |
2002 | ||
2003 | if (!u->activation_details) /* Older details object wins */ | |
2004 | u->activation_details = activation_details_ref(details); | |
2005 | ||
2006 | return UNIT_VTABLE(u)->start(u); | |
2007 | } | |
2008 | ||
2009 | bool unit_can_start(Unit *u) { | |
2010 | assert(u); | |
2011 | ||
2012 | if (u->load_state != UNIT_LOADED) | |
2013 | return false; | |
2014 | ||
2015 | if (!unit_type_supported(u->type)) | |
2016 | return false; | |
2017 | ||
2018 | /* Scope units may be started only once */ | |
2019 | if (UNIT_VTABLE(u)->once_only && dual_timestamp_is_set(&u->inactive_exit_timestamp)) | |
2020 | return false; | |
2021 | ||
2022 | return !!UNIT_VTABLE(u)->start; | |
2023 | } | |
2024 | ||
2025 | bool unit_can_isolate(Unit *u) { | |
2026 | assert(u); | |
2027 | ||
2028 | return unit_can_start(u) && | |
2029 | u->allow_isolate; | |
2030 | } | |
2031 | ||
2032 | /* Errors: | |
2033 | * -EBADR: This unit type does not support stopping. | |
2034 | * -EALREADY: Unit is already stopped. | |
2035 | * -EAGAIN: An operation is already in progress. Retry later. | |
2036 | */ | |
2037 | int unit_stop(Unit *u) { | |
2038 | UnitActiveState state; | |
2039 | Unit *following; | |
2040 | ||
2041 | assert(u); | |
2042 | ||
2043 | state = unit_active_state(u); | |
2044 | if (UNIT_IS_INACTIVE_OR_FAILED(state)) | |
2045 | return -EALREADY; | |
2046 | ||
2047 | following = unit_following(u); | |
2048 | if (following) { | |
2049 | log_unit_debug(u, "Redirecting stop request from %s to %s.", u->id, following->id); | |
2050 | return unit_stop(following); | |
2051 | } | |
2052 | ||
2053 | if (!UNIT_VTABLE(u)->stop) | |
2054 | return -EBADR; | |
2055 | ||
2056 | unit_add_to_dbus_queue(u); | |
2057 | unit_cgroup_freezer_action(u, FREEZER_THAW); | |
2058 | ||
2059 | return UNIT_VTABLE(u)->stop(u); | |
2060 | } | |
2061 | ||
2062 | bool unit_can_stop(Unit *u) { | |
2063 | assert(u); | |
2064 | ||
2065 | /* Note: if we return true here, it does not mean that the unit may be successfully stopped. | |
2066 | * Extrinsic units follow external state and they may stop following external state changes | |
2067 | * (hence we return true here), but an attempt to do this through the manager will fail. */ | |
2068 | ||
2069 | if (!unit_type_supported(u->type)) | |
2070 | return false; | |
2071 | ||
2072 | if (u->perpetual) | |
2073 | return false; | |
2074 | ||
2075 | return !!UNIT_VTABLE(u)->stop; | |
2076 | } | |
2077 | ||
2078 | /* Errors: | |
2079 | * -EBADR: This unit type does not support reloading. | |
2080 | * -ENOEXEC: Unit is not started. | |
2081 | * -EAGAIN: An operation is already in progress. Retry later. | |
2082 | */ | |
2083 | int unit_reload(Unit *u) { | |
2084 | UnitActiveState state; | |
2085 | Unit *following; | |
2086 | ||
2087 | assert(u); | |
2088 | ||
2089 | if (u->load_state != UNIT_LOADED) | |
2090 | return -EINVAL; | |
2091 | ||
2092 | if (!unit_can_reload(u)) | |
2093 | return -EBADR; | |
2094 | ||
2095 | state = unit_active_state(u); | |
2096 | if (state == UNIT_RELOADING) | |
2097 | return -EAGAIN; | |
2098 | ||
2099 | if (state != UNIT_ACTIVE) | |
2100 | return log_unit_warning_errno(u, SYNTHETIC_ERRNO(ENOEXEC), "Unit cannot be reloaded because it is inactive."); | |
2101 | ||
2102 | following = unit_following(u); | |
2103 | if (following) { | |
2104 | log_unit_debug(u, "Redirecting reload request from %s to %s.", u->id, following->id); | |
2105 | return unit_reload(following); | |
2106 | } | |
2107 | ||
2108 | unit_add_to_dbus_queue(u); | |
2109 | ||
2110 | if (!UNIT_VTABLE(u)->reload) { | |
2111 | /* Unit doesn't have a reload function, but we need to propagate the reload anyway */ | |
2112 | unit_notify(u, unit_active_state(u), unit_active_state(u), /* reload_success = */ true); | |
2113 | return 0; | |
2114 | } | |
2115 | ||
2116 | unit_cgroup_freezer_action(u, FREEZER_THAW); | |
2117 | ||
2118 | return UNIT_VTABLE(u)->reload(u); | |
2119 | } | |
2120 | ||
2121 | bool unit_can_reload(Unit *u) { | |
2122 | assert(u); | |
2123 | ||
2124 | if (UNIT_VTABLE(u)->can_reload) | |
2125 | return UNIT_VTABLE(u)->can_reload(u); | |
2126 | ||
2127 | if (unit_has_dependency(u, UNIT_ATOM_PROPAGATES_RELOAD_TO, NULL)) | |
2128 | return true; | |
2129 | ||
2130 | return UNIT_VTABLE(u)->reload; | |
2131 | } | |
2132 | ||
2133 | bool unit_is_unneeded(Unit *u) { | |
2134 | Unit *other; | |
2135 | assert(u); | |
2136 | ||
2137 | if (!u->stop_when_unneeded) | |
2138 | return false; | |
2139 | ||
2140 | /* Don't clean up while the unit is transitioning or is even inactive. */ | |
2141 | if (unit_active_state(u) != UNIT_ACTIVE) | |
2142 | return false; | |
2143 | if (u->job) | |
2144 | return false; | |
2145 | ||
2146 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_PINS_STOP_WHEN_UNNEEDED) { | |
2147 | /* If a dependent unit has a job queued, is active or transitioning, or is marked for | |
2148 | * restart, then don't clean this one up. */ | |
2149 | ||
2150 | if (other->job) | |
2151 | return false; | |
2152 | ||
2153 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other))) | |
2154 | return false; | |
2155 | ||
2156 | if (unit_will_restart(other)) | |
2157 | return false; | |
2158 | } | |
2159 | ||
2160 | return true; | |
2161 | } | |
2162 | ||
2163 | bool unit_is_upheld_by_active(Unit *u, Unit **ret_culprit) { | |
2164 | Unit *other; | |
2165 | ||
2166 | assert(u); | |
2167 | ||
2168 | /* Checks if the unit needs to be started because it currently is not running, but some other unit | |
2169 | * that is active declared an Uphold= dependencies on it */ | |
2170 | ||
2171 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u)) || u->job) { | |
2172 | if (ret_culprit) | |
2173 | *ret_culprit = NULL; | |
2174 | return false; | |
2175 | } | |
2176 | ||
2177 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_START_STEADILY) { | |
2178 | if (other->job) | |
2179 | continue; | |
2180 | ||
2181 | if (UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(other))) { | |
2182 | if (ret_culprit) | |
2183 | *ret_culprit = other; | |
2184 | return true; | |
2185 | } | |
2186 | } | |
2187 | ||
2188 | if (ret_culprit) | |
2189 | *ret_culprit = NULL; | |
2190 | return false; | |
2191 | } | |
2192 | ||
2193 | bool unit_is_bound_by_inactive(Unit *u, Unit **ret_culprit) { | |
2194 | Unit *other; | |
2195 | ||
2196 | assert(u); | |
2197 | ||
2198 | /* Checks whether this unit is bound to another unit that is inactive, i.e. whether we should stop | |
2199 | * because the other unit is down. */ | |
2200 | ||
2201 | if (unit_active_state(u) != UNIT_ACTIVE || u->job) { | |
2202 | /* Don't clean up while the unit is transitioning or is even inactive. */ | |
2203 | if (ret_culprit) | |
2204 | *ret_culprit = NULL; | |
2205 | return false; | |
2206 | } | |
2207 | ||
2208 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_CANNOT_BE_ACTIVE_WITHOUT) { | |
2209 | if (other->job) | |
2210 | continue; | |
2211 | ||
2212 | if (UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other))) { | |
2213 | if (ret_culprit) | |
2214 | *ret_culprit = other; | |
2215 | ||
2216 | return true; | |
2217 | } | |
2218 | } | |
2219 | ||
2220 | if (ret_culprit) | |
2221 | *ret_culprit = NULL; | |
2222 | return false; | |
2223 | } | |
2224 | ||
2225 | static void check_unneeded_dependencies(Unit *u) { | |
2226 | Unit *other; | |
2227 | assert(u); | |
2228 | ||
2229 | /* Add all units this unit depends on to the queue that processes StopWhenUnneeded= behaviour. */ | |
2230 | ||
2231 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_ADD_STOP_WHEN_UNNEEDED_QUEUE) | |
2232 | unit_submit_to_stop_when_unneeded_queue(other); | |
2233 | } | |
2234 | ||
2235 | static void check_uphold_dependencies(Unit *u) { | |
2236 | Unit *other; | |
2237 | assert(u); | |
2238 | ||
2239 | /* Add all units this unit depends on to the queue that processes Uphold= behaviour. */ | |
2240 | ||
2241 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_ADD_START_WHEN_UPHELD_QUEUE) | |
2242 | unit_submit_to_start_when_upheld_queue(other); | |
2243 | } | |
2244 | ||
2245 | static void check_bound_by_dependencies(Unit *u) { | |
2246 | Unit *other; | |
2247 | assert(u); | |
2248 | ||
2249 | /* Add all units this unit depends on to the queue that processes BindsTo= stop behaviour. */ | |
2250 | ||
2251 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_ADD_CANNOT_BE_ACTIVE_WITHOUT_QUEUE) | |
2252 | unit_submit_to_stop_when_bound_queue(other); | |
2253 | } | |
2254 | ||
2255 | static void retroactively_start_dependencies(Unit *u) { | |
2256 | Unit *other; | |
2257 | ||
2258 | assert(u); | |
2259 | assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))); | |
2260 | ||
2261 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_RETROACTIVE_START_REPLACE) /* Requires= + BindsTo= */ | |
2262 | if (!unit_has_dependency(u, UNIT_ATOM_AFTER, other) && | |
2263 | !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other))) | |
2264 | manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL, NULL); | |
2265 | ||
2266 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_RETROACTIVE_START_FAIL) /* Wants= */ | |
2267 | if (!unit_has_dependency(u, UNIT_ATOM_AFTER, other) && | |
2268 | !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other))) | |
2269 | manager_add_job(u->manager, JOB_START, other, JOB_FAIL, NULL, NULL, NULL); | |
2270 | ||
2271 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_RETROACTIVE_STOP_ON_START) /* Conflicts= (and inverse) */ | |
2272 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) | |
2273 | manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL, NULL); | |
2274 | } | |
2275 | ||
2276 | static void retroactively_stop_dependencies(Unit *u) { | |
2277 | Unit *other; | |
2278 | ||
2279 | assert(u); | |
2280 | assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u))); | |
2281 | ||
2282 | /* Pull down units which are bound to us recursively if enabled */ | |
2283 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_RETROACTIVE_STOP_ON_STOP) /* BoundBy= */ | |
2284 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) | |
2285 | manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL, NULL); | |
2286 | } | |
2287 | ||
2288 | void unit_start_on_failure( | |
2289 | Unit *u, | |
2290 | const char *dependency_name, | |
2291 | UnitDependencyAtom atom, | |
2292 | JobMode job_mode) { | |
2293 | ||
2294 | int n_jobs = -1; | |
2295 | Unit *other; | |
2296 | int r; | |
2297 | ||
2298 | assert(u); | |
2299 | assert(dependency_name); | |
2300 | assert(IN_SET(atom, UNIT_ATOM_ON_SUCCESS, UNIT_ATOM_ON_FAILURE)); | |
2301 | ||
2302 | /* Act on OnFailure= and OnSuccess= dependencies */ | |
2303 | ||
2304 | UNIT_FOREACH_DEPENDENCY(other, u, atom) { | |
2305 | _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL; | |
2306 | ||
2307 | if (n_jobs < 0) { | |
2308 | log_unit_info(u, "Triggering %s dependencies.", dependency_name); | |
2309 | n_jobs = 0; | |
2310 | } | |
2311 | ||
2312 | r = manager_add_job(u->manager, JOB_START, other, job_mode, NULL, &error, NULL); | |
2313 | if (r < 0) | |
2314 | log_unit_warning_errno( | |
2315 | u, r, "Failed to enqueue %s job, ignoring: %s", | |
2316 | dependency_name, bus_error_message(&error, r)); | |
2317 | n_jobs++; | |
2318 | } | |
2319 | ||
2320 | if (n_jobs >= 0) | |
2321 | log_unit_debug(u, "Triggering %s dependencies done (%i %s).", | |
2322 | dependency_name, n_jobs, n_jobs == 1 ? "job" : "jobs"); | |
2323 | } | |
2324 | ||
2325 | void unit_trigger_notify(Unit *u) { | |
2326 | Unit *other; | |
2327 | ||
2328 | assert(u); | |
2329 | ||
2330 | UNIT_FOREACH_DEPENDENCY(other, u, UNIT_ATOM_TRIGGERED_BY) | |
2331 | if (UNIT_VTABLE(other)->trigger_notify) | |
2332 | UNIT_VTABLE(other)->trigger_notify(other, u); | |
2333 | } | |
2334 | ||
2335 | static int raise_level(int log_level, bool condition_info, bool condition_notice) { | |
2336 | if (condition_notice && log_level > LOG_NOTICE) | |
2337 | return LOG_NOTICE; | |
2338 | if (condition_info && log_level > LOG_INFO) | |
2339 | return LOG_INFO; | |
2340 | return log_level; | |
2341 | } | |
2342 | ||
2343 | static int unit_log_resources(Unit *u) { | |
2344 | ||
2345 | static const struct { | |
2346 | const char *journal_field; | |
2347 | const char *message_suffix; | |
2348 | } memory_fields[_CGROUP_MEMORY_ACCOUNTING_METRIC_CACHED_LAST + 1] = { | |
2349 | [CGROUP_MEMORY_PEAK] = { "MEMORY_PEAK", "memory peak" }, | |
2350 | [CGROUP_MEMORY_SWAP_PEAK] = { "MEMORY_SWAP_PEAK", "memory swap peak" }, | |
2351 | }, ip_fields[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = { | |
2352 | [CGROUP_IP_INGRESS_BYTES] = { "IP_METRIC_INGRESS_BYTES", "incoming IP traffic" }, | |
2353 | [CGROUP_IP_EGRESS_BYTES] = { "IP_METRIC_EGRESS_BYTES", "outgoing IP traffic" }, | |
2354 | [CGROUP_IP_INGRESS_PACKETS] = { "IP_METRIC_INGRESS_PACKETS", NULL }, | |
2355 | [CGROUP_IP_EGRESS_PACKETS] = { "IP_METRIC_EGRESS_PACKETS", NULL }, | |
2356 | }, io_fields[_CGROUP_IO_ACCOUNTING_METRIC_MAX] = { | |
2357 | [CGROUP_IO_READ_BYTES] = { "IO_METRIC_READ_BYTES", "read from disk" }, | |
2358 | [CGROUP_IO_WRITE_BYTES] = { "IO_METRIC_WRITE_BYTES", "written to disk" }, | |
2359 | [CGROUP_IO_READ_OPERATIONS] = { "IO_METRIC_READ_OPERATIONS", NULL }, | |
2360 | [CGROUP_IO_WRITE_OPERATIONS] = { "IO_METRIC_WRITE_OPERATIONS", NULL }, | |
2361 | }; | |
2362 | ||
2363 | struct iovec *iovec = NULL; | |
2364 | size_t n_iovec = 0; | |
2365 | _cleanup_free_ char *message = NULL, *t = NULL; | |
2366 | nsec_t cpu_nsec = NSEC_INFINITY; | |
2367 | int log_level = LOG_DEBUG; /* May be raised if resources consumed over a threshold */ | |
2368 | ||
2369 | assert(u); | |
2370 | ||
2371 | CLEANUP_ARRAY(iovec, n_iovec, iovec_array_free); | |
2372 | ||
2373 | iovec = new(struct iovec, 1 + (_CGROUP_MEMORY_ACCOUNTING_METRIC_CACHED_LAST + 1) + | |
2374 | _CGROUP_IP_ACCOUNTING_METRIC_MAX + _CGROUP_IO_ACCOUNTING_METRIC_MAX + 4); | |
2375 | if (!iovec) | |
2376 | return log_oom(); | |
2377 | ||
2378 | /* Invoked whenever a unit enters failed or dead state. Logs information about consumed resources if resource | |
2379 | * accounting was enabled for a unit. It does this in two ways: a friendly human readable string with reduced | |
2380 | * information and the complete data in structured fields. */ | |
2381 | ||
2382 | (void) unit_get_cpu_usage(u, &cpu_nsec); | |
2383 | if (cpu_nsec != NSEC_INFINITY) { | |
2384 | /* Format the CPU time for inclusion in the structured log message */ | |
2385 | if (asprintf(&t, "CPU_USAGE_NSEC=%" PRIu64, cpu_nsec) < 0) | |
2386 | return log_oom(); | |
2387 | iovec[n_iovec++] = IOVEC_MAKE_STRING(TAKE_PTR(t)); | |
2388 | ||
2389 | /* Format the CPU time for inclusion in the human language message string */ | |
2390 | if (strextendf_with_separator(&message, ", ", | |
2391 | "Consumed %s CPU time", | |
2392 | FORMAT_TIMESPAN(cpu_nsec / NSEC_PER_USEC, USEC_PER_MSEC)) < 0) | |
2393 | return log_oom(); | |
2394 | ||
2395 | log_level = raise_level(log_level, | |
2396 | cpu_nsec > MENTIONWORTHY_CPU_NSEC, | |
2397 | cpu_nsec > NOTICEWORTHY_CPU_NSEC); | |
2398 | } | |
2399 | ||
2400 | for (CGroupMemoryAccountingMetric metric = 0; metric <= _CGROUP_MEMORY_ACCOUNTING_METRIC_CACHED_LAST; metric++) { | |
2401 | uint64_t value = UINT64_MAX; | |
2402 | ||
2403 | assert(memory_fields[metric].journal_field); | |
2404 | assert(memory_fields[metric].message_suffix); | |
2405 | ||
2406 | (void) unit_get_memory_accounting(u, metric, &value); | |
2407 | if (value == UINT64_MAX) | |
2408 | continue; | |
2409 | ||
2410 | if (asprintf(&t, "%s=%" PRIu64, memory_fields[metric].journal_field, value) < 0) | |
2411 | return log_oom(); | |
2412 | iovec[n_iovec++] = IOVEC_MAKE_STRING(TAKE_PTR(t)); | |
2413 | ||
2414 | /* If value is 0, we don't log it in the MESSAGE= field. */ | |
2415 | if (value == 0) | |
2416 | continue; | |
2417 | ||
2418 | if (strextendf_with_separator(&message, ", ", "%s %s", | |
2419 | FORMAT_BYTES(value), memory_fields[metric].message_suffix) < 0) | |
2420 | return log_oom(); | |
2421 | ||
2422 | log_level = raise_level(log_level, | |
2423 | value > MENTIONWORTHY_MEMORY_BYTES, | |
2424 | value > NOTICEWORTHY_MEMORY_BYTES); | |
2425 | } | |
2426 | ||
2427 | for (CGroupIOAccountingMetric k = 0; k < _CGROUP_IO_ACCOUNTING_METRIC_MAX; k++) { | |
2428 | uint64_t value = UINT64_MAX; | |
2429 | ||
2430 | assert(io_fields[k].journal_field); | |
2431 | ||
2432 | (void) unit_get_io_accounting(u, k, k > 0, &value); | |
2433 | if (value == UINT64_MAX) | |
2434 | continue; | |
2435 | ||
2436 | /* Format IO accounting data for inclusion in the structured log message */ | |
2437 | if (asprintf(&t, "%s=%" PRIu64, io_fields[k].journal_field, value) < 0) | |
2438 | return log_oom(); | |
2439 | iovec[n_iovec++] = IOVEC_MAKE_STRING(TAKE_PTR(t)); | |
2440 | ||
2441 | /* If value is 0, we don't log it in the MESSAGE= field. */ | |
2442 | if (value == 0) | |
2443 | continue; | |
2444 | ||
2445 | /* Format the IO accounting data for inclusion in the human language message string, but only | |
2446 | * for the bytes counters (and not for the operations counters) */ | |
2447 | if (io_fields[k].message_suffix) { | |
2448 | if (strextendf_with_separator(&message, ", ", "%s %s", | |
2449 | FORMAT_BYTES(value), io_fields[k].message_suffix) < 0) | |
2450 | return log_oom(); | |
2451 | ||
2452 | log_level = raise_level(log_level, | |
2453 | value > MENTIONWORTHY_IO_BYTES, | |
2454 | value > NOTICEWORTHY_IO_BYTES); | |
2455 | } | |
2456 | } | |
2457 | ||
2458 | for (CGroupIPAccountingMetric m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) { | |
2459 | uint64_t value = UINT64_MAX; | |
2460 | ||
2461 | assert(ip_fields[m].journal_field); | |
2462 | ||
2463 | (void) unit_get_ip_accounting(u, m, &value); | |
2464 | if (value == UINT64_MAX) | |
2465 | continue; | |
2466 | ||
2467 | /* Format IP accounting data for inclusion in the structured log message */ | |
2468 | if (asprintf(&t, "%s=%" PRIu64, ip_fields[m].journal_field, value) < 0) | |
2469 | return log_oom(); | |
2470 | iovec[n_iovec++] = IOVEC_MAKE_STRING(TAKE_PTR(t)); | |
2471 | ||
2472 | /* If value is 0, we don't log it in the MESSAGE= field. */ | |
2473 | if (value == 0) | |
2474 | continue; | |
2475 | ||
2476 | /* Format the IP accounting data for inclusion in the human language message string, but only | |
2477 | * for the bytes counters (and not for the packets counters) */ | |
2478 | if (ip_fields[m].message_suffix) { | |
2479 | if (strextendf_with_separator(&message, ", ", "%s %s", | |
2480 | FORMAT_BYTES(value), ip_fields[m].message_suffix) < 0) | |
2481 | return log_oom(); | |
2482 | ||
2483 | log_level = raise_level(log_level, | |
2484 | value > MENTIONWORTHY_IP_BYTES, | |
2485 | value > NOTICEWORTHY_IP_BYTES); | |
2486 | } | |
2487 | } | |
2488 | ||
2489 | /* This check is here because it is the earliest point following all possible log_level assignments. | |
2490 | * (If log_level is assigned anywhere after this point, move this check.) */ | |
2491 | if (!unit_log_level_test(u, log_level)) | |
2492 | return 0; | |
2493 | ||
2494 | /* Is there any accounting data available at all? */ | |
2495 | if (n_iovec == 0) { | |
2496 | assert(!message); | |
2497 | return 0; | |
2498 | } | |
2499 | ||
2500 | t = strjoin("MESSAGE=", u->id, ": ", message ?: "Completed", "."); | |
2501 | if (!t) | |
2502 | return log_oom(); | |
2503 | iovec[n_iovec++] = IOVEC_MAKE_STRING(TAKE_PTR(t)); | |
2504 | ||
2505 | if (!set_iovec_string_field(iovec, &n_iovec, "MESSAGE_ID=", SD_MESSAGE_UNIT_RESOURCES_STR)) | |
2506 | return log_oom(); | |
2507 | ||
2508 | if (!set_iovec_string_field(iovec, &n_iovec, u->manager->unit_log_field, u->id)) | |
2509 | return log_oom(); | |
2510 | ||
2511 | if (!set_iovec_string_field(iovec, &n_iovec, u->manager->invocation_log_field, u->invocation_id_string)) | |
2512 | return log_oom(); | |
2513 | ||
2514 | log_unit_struct_iovec(u, log_level, iovec, n_iovec); | |
2515 | ||
2516 | return 0; | |
2517 | } | |
2518 | ||
2519 | static void unit_update_on_console(Unit *u) { | |
2520 | bool b; | |
2521 | ||
2522 | assert(u); | |
2523 | ||
2524 | b = unit_needs_console(u); | |
2525 | if (u->on_console == b) | |
2526 | return; | |
2527 | ||
2528 | u->on_console = b; | |
2529 | if (b) | |
2530 | manager_ref_console(u->manager); | |
2531 | else | |
2532 | manager_unref_console(u->manager); | |
2533 | } | |
2534 | ||
2535 | static void unit_emit_audit_start(Unit *u) { | |
2536 | assert(u); | |
2537 | ||
2538 | if (UNIT_VTABLE(u)->audit_start_message_type <= 0) | |
2539 | return; | |
2540 | ||
2541 | /* Write audit record if we have just finished starting up */ | |
2542 | manager_send_unit_audit(u->manager, u, UNIT_VTABLE(u)->audit_start_message_type, /* success= */ true); | |
2543 | u->in_audit = true; | |
2544 | } | |
2545 | ||
2546 | static void unit_emit_audit_stop(Unit *u, UnitActiveState state) { | |
2547 | assert(u); | |
2548 | ||
2549 | if (UNIT_VTABLE(u)->audit_start_message_type <= 0) | |
2550 | return; | |
2551 | ||
2552 | if (u->in_audit) { | |
2553 | /* Write audit record if we have just finished shutting down */ | |
2554 | manager_send_unit_audit(u->manager, u, UNIT_VTABLE(u)->audit_stop_message_type, /* success= */ state == UNIT_INACTIVE); | |
2555 | u->in_audit = false; | |
2556 | } else { | |
2557 | /* Hmm, if there was no start record written write it now, so that we always have a nice pair */ | |
2558 | manager_send_unit_audit(u->manager, u, UNIT_VTABLE(u)->audit_start_message_type, /* success= */ state == UNIT_INACTIVE); | |
2559 | ||
2560 | if (state == UNIT_INACTIVE) | |
2561 | manager_send_unit_audit(u->manager, u, UNIT_VTABLE(u)->audit_stop_message_type, /* success= */ true); | |
2562 | } | |
2563 | } | |
2564 | ||
2565 | static bool unit_process_job(Job *j, UnitActiveState ns, bool reload_success) { | |
2566 | bool unexpected = false; | |
2567 | JobResult result; | |
2568 | ||
2569 | assert(j); | |
2570 | ||
2571 | if (j->state == JOB_WAITING) | |
2572 | /* So we reached a different state for this job. Let's see if we can run it now if it failed previously | |
2573 | * due to EAGAIN. */ | |
2574 | job_add_to_run_queue(j); | |
2575 | ||
2576 | /* Let's check whether the unit's new state constitutes a finished job, or maybe contradicts a running job and | |
2577 | * hence needs to invalidate jobs. */ | |
2578 | ||
2579 | switch (j->type) { | |
2580 | ||
2581 | case JOB_START: | |
2582 | case JOB_VERIFY_ACTIVE: | |
2583 | ||
2584 | if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) | |
2585 | job_finish_and_invalidate(j, JOB_DONE, true, false); | |
2586 | else if (j->state == JOB_RUNNING && ns != UNIT_ACTIVATING) { | |
2587 | unexpected = true; | |
2588 | ||
2589 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) { | |
2590 | if (ns == UNIT_FAILED) | |
2591 | result = JOB_FAILED; | |
2592 | else | |
2593 | result = JOB_DONE; | |
2594 | ||
2595 | job_finish_and_invalidate(j, result, true, false); | |
2596 | } | |
2597 | } | |
2598 | ||
2599 | break; | |
2600 | ||
2601 | case JOB_RELOAD: | |
2602 | case JOB_RELOAD_OR_START: | |
2603 | case JOB_TRY_RELOAD: | |
2604 | ||
2605 | if (j->state == JOB_RUNNING) { | |
2606 | if (ns == UNIT_ACTIVE) | |
2607 | job_finish_and_invalidate(j, reload_success ? JOB_DONE : JOB_FAILED, true, false); | |
2608 | else if (!IN_SET(ns, UNIT_ACTIVATING, UNIT_RELOADING)) { | |
2609 | unexpected = true; | |
2610 | ||
2611 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) | |
2612 | job_finish_and_invalidate(j, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false); | |
2613 | } | |
2614 | } | |
2615 | ||
2616 | break; | |
2617 | ||
2618 | case JOB_STOP: | |
2619 | case JOB_RESTART: | |
2620 | case JOB_TRY_RESTART: | |
2621 | ||
2622 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) | |
2623 | job_finish_and_invalidate(j, JOB_DONE, true, false); | |
2624 | else if (j->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) { | |
2625 | unexpected = true; | |
2626 | job_finish_and_invalidate(j, JOB_FAILED, true, false); | |
2627 | } | |
2628 | ||
2629 | break; | |
2630 | ||
2631 | default: | |
2632 | assert_not_reached(); | |
2633 | } | |
2634 | ||
2635 | return unexpected; | |
2636 | } | |
2637 | ||
2638 | void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns, bool reload_success) { | |
2639 | const char *reason; | |
2640 | Manager *m; | |
2641 | ||
2642 | assert(u); | |
2643 | assert(os < _UNIT_ACTIVE_STATE_MAX); | |
2644 | assert(ns < _UNIT_ACTIVE_STATE_MAX); | |
2645 | ||
2646 | /* Note that this is called for all low-level state changes, even if they might map to the same high-level | |
2647 | * UnitActiveState! That means that ns == os is an expected behavior here. For example: if a mount point is | |
2648 | * remounted this function will be called too! */ | |
2649 | ||
2650 | m = u->manager; | |
2651 | ||
2652 | /* Let's enqueue the change signal early. In case this unit has a job associated we want that this unit is in | |
2653 | * the bus queue, so that any job change signal queued will force out the unit change signal first. */ | |
2654 | unit_add_to_dbus_queue(u); | |
2655 | ||
2656 | /* Update systemd-oomd on the property/state change */ | |
2657 | if (os != ns) { | |
2658 | /* Always send an update if the unit is going into an inactive state so systemd-oomd knows to stop | |
2659 | * monitoring. | |
2660 | * Also send an update whenever the unit goes active; this is to handle a case where an override file | |
2661 | * sets one of the ManagedOOM*= properties to "kill", then later removes it. systemd-oomd needs to | |
2662 | * know to stop monitoring when the unit changes from "kill" -> "auto" on daemon-reload, but we don't | |
2663 | * have the information on the property. Thus, indiscriminately send an update. */ | |
2664 | if (UNIT_IS_INACTIVE_OR_FAILED(ns) || UNIT_IS_ACTIVE_OR_RELOADING(ns)) | |
2665 | (void) manager_varlink_send_managed_oom_update(u); | |
2666 | } | |
2667 | ||
2668 | /* Update timestamps for state changes */ | |
2669 | if (!MANAGER_IS_RELOADING(m)) { | |
2670 | dual_timestamp_now(&u->state_change_timestamp); | |
2671 | ||
2672 | if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns)) | |
2673 | u->inactive_exit_timestamp = u->state_change_timestamp; | |
2674 | else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns)) | |
2675 | u->inactive_enter_timestamp = u->state_change_timestamp; | |
2676 | ||
2677 | if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns)) | |
2678 | u->active_enter_timestamp = u->state_change_timestamp; | |
2679 | else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns)) | |
2680 | u->active_exit_timestamp = u->state_change_timestamp; | |
2681 | } | |
2682 | ||
2683 | /* Keep track of failed units */ | |
2684 | (void) manager_update_failed_units(m, u, ns == UNIT_FAILED); | |
2685 | ||
2686 | /* Make sure the cgroup and state files are always removed when we become inactive */ | |
2687 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) { | |
2688 | SET_FLAG(u->markers, | |
2689 | (1u << UNIT_MARKER_NEEDS_RELOAD)|(1u << UNIT_MARKER_NEEDS_RESTART), | |
2690 | false); | |
2691 | unit_prune_cgroup(u); | |
2692 | unit_unlink_state_files(u); | |
2693 | } else if (ns != os && ns == UNIT_RELOADING) | |
2694 | SET_FLAG(u->markers, 1u << UNIT_MARKER_NEEDS_RELOAD, false); | |
2695 | ||
2696 | unit_update_on_console(u); | |
2697 | ||
2698 | if (!MANAGER_IS_RELOADING(m)) { | |
2699 | bool unexpected; | |
2700 | ||
2701 | /* Let's propagate state changes to the job */ | |
2702 | if (u->job) | |
2703 | unexpected = unit_process_job(u->job, ns, reload_success); | |
2704 | else | |
2705 | unexpected = true; | |
2706 | ||
2707 | /* If this state change happened without being requested by a job, then let's retroactively start or | |
2708 | * stop dependencies. We skip that step when deserializing, since we don't want to create any | |
2709 | * additional jobs just because something is already activated. */ | |
2710 | ||
2711 | if (unexpected) { | |
2712 | if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns)) | |
2713 | retroactively_start_dependencies(u); | |
2714 | else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns)) | |
2715 | retroactively_stop_dependencies(u); | |
2716 | } | |
2717 | ||
2718 | if (ns != os && ns == UNIT_FAILED) { | |
2719 | log_unit_debug(u, "Unit entered failed state."); | |
2720 | unit_start_on_failure(u, "OnFailure=", UNIT_ATOM_ON_FAILURE, u->on_failure_job_mode); | |
2721 | } | |
2722 | ||
2723 | if (UNIT_IS_ACTIVE_OR_RELOADING(ns) && !UNIT_IS_ACTIVE_OR_RELOADING(os)) { | |
2724 | /* This unit just finished starting up */ | |
2725 | ||
2726 | unit_emit_audit_start(u); | |
2727 | manager_send_unit_plymouth(m, u); | |
2728 | } | |
2729 | ||
2730 | if (UNIT_IS_INACTIVE_OR_FAILED(ns) && !UNIT_IS_INACTIVE_OR_FAILED(os)) { | |
2731 | /* This unit just stopped/failed. */ | |
2732 | ||
2733 | unit_emit_audit_stop(u, ns); | |
2734 | unit_log_resources(u); | |
2735 | } | |
2736 | ||
2737 | if (ns == UNIT_INACTIVE && !IN_SET(os, UNIT_FAILED, UNIT_INACTIVE, UNIT_MAINTENANCE)) | |
2738 | unit_start_on_failure(u, "OnSuccess=", UNIT_ATOM_ON_SUCCESS, u->on_success_job_mode); | |
2739 | } | |
2740 | ||
2741 | manager_recheck_journal(m); | |
2742 | manager_recheck_dbus(m); | |
2743 | ||
2744 | unit_trigger_notify(u); | |
2745 | ||
2746 | if (!MANAGER_IS_RELOADING(m)) { | |
2747 | if (os != UNIT_FAILED && ns == UNIT_FAILED) { | |
2748 | reason = strjoina("unit ", u->id, " failed"); | |
2749 | emergency_action(m, u->failure_action, 0, u->reboot_arg, unit_failure_action_exit_status(u), reason); | |
2750 | } else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && ns == UNIT_INACTIVE) { | |
2751 | reason = strjoina("unit ", u->id, " succeeded"); | |
2752 | emergency_action(m, u->success_action, 0, u->reboot_arg, unit_success_action_exit_status(u), reason); | |
2753 | } | |
2754 | } | |
2755 | ||
2756 | /* And now, add the unit or depending units to various queues that will act on the new situation if | |
2757 | * needed. These queues generally check for continuous state changes rather than events (like most of | |
2758 | * the state propagation above), and do work deferred instead of instantly, since they typically | |
2759 | * don't want to run during reloading, and usually involve checking combined state of multiple units | |
2760 | * at once. */ | |
2761 | ||
2762 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) { | |
2763 | /* Stop unneeded units and bound-by units regardless if going down was expected or not */ | |
2764 | check_unneeded_dependencies(u); | |
2765 | check_bound_by_dependencies(u); | |
2766 | ||
2767 | /* Maybe someone wants us to remain up? */ | |
2768 | unit_submit_to_start_when_upheld_queue(u); | |
2769 | ||
2770 | /* Maybe the unit should be GC'ed now? */ | |
2771 | unit_add_to_gc_queue(u); | |
2772 | ||
2773 | /* Maybe we can release some resources now? */ | |
2774 | unit_submit_to_release_resources_queue(u); | |
2775 | } | |
2776 | ||
2777 | if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) { | |
2778 | /* Start uphold units regardless if going up was expected or not */ | |
2779 | check_uphold_dependencies(u); | |
2780 | ||
2781 | /* Maybe we finished startup and are now ready for being stopped because unneeded? */ | |
2782 | unit_submit_to_stop_when_unneeded_queue(u); | |
2783 | ||
2784 | /* Maybe we finished startup, but something we needed has vanished? Let's die then. (This happens | |
2785 | * when something BindsTo= to a Type=oneshot unit, as these units go directly from starting to | |
2786 | * inactive, without ever entering started.) */ | |
2787 | unit_submit_to_stop_when_bound_queue(u); | |
2788 | } | |
2789 | } | |
2790 | ||
2791 | int unit_watch_pidref(Unit *u, const PidRef *pid, bool exclusive) { | |
2792 | _cleanup_(pidref_freep) PidRef *pid_dup = NULL; | |
2793 | int r; | |
2794 | ||
2795 | /* Adds a specific PID to the set of PIDs this unit watches. */ | |
2796 | ||
2797 | assert(u); | |
2798 | assert(pidref_is_set(pid)); | |
2799 | ||
2800 | /* Caller might be sure that this PID belongs to this unit only. Let's take this | |
2801 | * opportunity to remove any stalled references to this PID as they can be created | |
2802 | * easily (when watching a process which is not our direct child). */ | |
2803 | if (exclusive) | |
2804 | manager_unwatch_pidref(u->manager, pid); | |
2805 | ||
2806 | if (set_contains(u->pids, pid)) /* early exit if already being watched */ | |
2807 | return 0; | |
2808 | ||
2809 | r = pidref_dup(pid, &pid_dup); | |
2810 | if (r < 0) | |
2811 | return r; | |
2812 | ||
2813 | /* First, insert into the set of PIDs maintained by the unit */ | |
2814 | r = set_ensure_put(&u->pids, &pidref_hash_ops_free, pid_dup); | |
2815 | if (r < 0) | |
2816 | return r; | |
2817 | ||
2818 | pid = TAKE_PTR(pid_dup); /* continue with our copy now that we have installed it properly in our set */ | |
2819 | ||
2820 | /* Second, insert it into the simple global table, see if that works */ | |
2821 | r = hashmap_ensure_put(&u->manager->watch_pids, &pidref_hash_ops_free, pid, u); | |
2822 | if (r != -EEXIST) | |
2823 | return r; | |
2824 | ||
2825 | /* OK, the key is already assigned to a different unit. That's fine, then add us via the second | |
2826 | * hashmap that points to an array. */ | |
2827 | ||
2828 | PidRef *old_pid = NULL; | |
2829 | Unit **array = hashmap_get2(u->manager->watch_pids_more, pid, (void**) &old_pid); | |
2830 | ||
2831 | /* Count entries in array */ | |
2832 | size_t n = 0; | |
2833 | for (; array && array[n]; n++) | |
2834 | ; | |
2835 | ||
2836 | /* Allocate a new array */ | |
2837 | _cleanup_free_ Unit **new_array = new(Unit*, n + 2); | |
2838 | if (!new_array) | |
2839 | return -ENOMEM; | |
2840 | ||
2841 | /* Append us to the end */ | |
2842 | memcpy_safe(new_array, array, sizeof(Unit*) * n); | |
2843 | new_array[n] = u; | |
2844 | new_array[n+1] = NULL; | |
2845 | ||
2846 | /* Make sure the hashmap is allocated */ | |
2847 | r = hashmap_ensure_allocated(&u->manager->watch_pids_more, &pidref_hash_ops_free); | |
2848 | if (r < 0) | |
2849 | return r; | |
2850 | ||
2851 | /* Add or replace the old array */ | |
2852 | r = hashmap_replace(u->manager->watch_pids_more, old_pid ?: pid, new_array); | |
2853 | if (r < 0) | |
2854 | return r; | |
2855 | ||
2856 | TAKE_PTR(new_array); /* Now part of the hash table */ | |
2857 | free(array); /* Which means we can now delete the old version */ | |
2858 | return 0; | |
2859 | } | |
2860 | ||
2861 | int unit_watch_pid(Unit *u, pid_t pid, bool exclusive) { | |
2862 | _cleanup_(pidref_done) PidRef pidref = PIDREF_NULL; | |
2863 | int r; | |
2864 | ||
2865 | assert(u); | |
2866 | assert(pid_is_valid(pid)); | |
2867 | ||
2868 | r = pidref_set_pid(&pidref, pid); | |
2869 | if (r < 0) | |
2870 | return r; | |
2871 | ||
2872 | return unit_watch_pidref(u, &pidref, exclusive); | |
2873 | } | |
2874 | ||
2875 | void unit_unwatch_pidref(Unit *u, const PidRef *pid) { | |
2876 | assert(u); | |
2877 | assert(pidref_is_set(pid)); | |
2878 | ||
2879 | /* Remove from the set we maintain for this unit. (And destroy the returned pid eventually) */ | |
2880 | _cleanup_(pidref_freep) PidRef *pid1 = set_remove(u->pids, pid); | |
2881 | if (!pid1) | |
2882 | return; /* Early exit if this PID was never watched by us */ | |
2883 | ||
2884 | /* First let's drop the unit from the simple hash table, if it is included there */ | |
2885 | PidRef *pid2 = NULL; | |
2886 | Unit *uu = hashmap_get2(u->manager->watch_pids, pid, (void**) &pid2); | |
2887 | ||
2888 | /* Quick validation: iff we are in the watch_pids table then the PidRef object must be the same as in our local pids set */ | |
2889 | assert((uu == u) == (pid1 == pid2)); | |
2890 | ||
2891 | if (uu == u) | |
2892 | /* OK, we are in the first table. Let's remove it there then, and we are done already. */ | |
2893 | assert_se(hashmap_remove_value(u->manager->watch_pids, pid2, uu)); | |
2894 | else { | |
2895 | /* We weren't in the first table, then let's consult the 2nd table that points to an array */ | |
2896 | PidRef *pid3 = NULL; | |
2897 | Unit **array = hashmap_get2(u->manager->watch_pids_more, pid, (void**) &pid3); | |
2898 | ||
2899 | /* Let's iterate through the array, dropping our own entry */ | |
2900 | size_t m = 0, n = 0; | |
2901 | for (; array && array[n]; n++) | |
2902 | if (array[n] != u) | |
2903 | array[m++] = array[n]; | |
2904 | if (n == m) | |
2905 | return; /* Not there */ | |
2906 | ||
2907 | array[m] = NULL; /* set trailing NULL marker on the new end */ | |
2908 | ||
2909 | if (m == 0) { | |
2910 | /* The array is now empty, remove the entire entry */ | |
2911 | assert_se(hashmap_remove_value(u->manager->watch_pids_more, pid3, array)); | |
2912 | free(array); | |
2913 | } else { | |
2914 | /* The array is not empty, but let's make sure the entry is not keyed by the PidRef | |
2915 | * we will delete, but by the PidRef object of the Unit that is now first in the | |
2916 | * array. */ | |
2917 | ||
2918 | PidRef *new_pid3 = ASSERT_PTR(set_get(array[0]->pids, pid)); | |
2919 | assert_se(hashmap_replace(u->manager->watch_pids_more, new_pid3, array) >= 0); | |
2920 | } | |
2921 | } | |
2922 | } | |
2923 | ||
2924 | void unit_unwatch_pid(Unit *u, pid_t pid) { | |
2925 | return unit_unwatch_pidref(u, &PIDREF_MAKE_FROM_PID(pid)); | |
2926 | } | |
2927 | ||
2928 | void unit_unwatch_all_pids(Unit *u) { | |
2929 | assert(u); | |
2930 | ||
2931 | while (!set_isempty(u->pids)) | |
2932 | unit_unwatch_pidref(u, set_first(u->pids)); | |
2933 | ||
2934 | u->pids = set_free(u->pids); | |
2935 | } | |
2936 | ||
2937 | static void unit_tidy_watch_pids(Unit *u) { | |
2938 | PidRef *except1, *except2, *e; | |
2939 | ||
2940 | assert(u); | |
2941 | ||
2942 | /* Cleans dead PIDs from our list */ | |
2943 | ||
2944 | except1 = unit_main_pid(u); | |
2945 | except2 = unit_control_pid(u); | |
2946 | ||
2947 | SET_FOREACH(e, u->pids) { | |
2948 | if (pidref_equal(except1, e) || pidref_equal(except2, e)) | |
2949 | continue; | |
2950 | ||
2951 | if (pidref_is_unwaited(e) <= 0) | |
2952 | unit_unwatch_pidref(u, e); | |
2953 | } | |
2954 | } | |
2955 | ||
2956 | static int on_rewatch_pids_event(sd_event_source *s, void *userdata) { | |
2957 | Unit *u = ASSERT_PTR(userdata); | |
2958 | ||
2959 | assert(s); | |
2960 | ||
2961 | unit_tidy_watch_pids(u); | |
2962 | unit_watch_all_pids(u); | |
2963 | ||
2964 | /* If the PID set is empty now, then let's finish this off. */ | |
2965 | unit_synthesize_cgroup_empty_event(u); | |
2966 | ||
2967 | return 0; | |
2968 | } | |
2969 | ||
2970 | int unit_enqueue_rewatch_pids(Unit *u) { | |
2971 | int r; | |
2972 | ||
2973 | assert(u); | |
2974 | ||
2975 | if (!u->cgroup_path) | |
2976 | return -ENOENT; | |
2977 | ||
2978 | r = cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER); | |
2979 | if (r < 0) | |
2980 | return r; | |
2981 | if (r > 0) /* On unified we can use proper notifications */ | |
2982 | return 0; | |
2983 | ||
2984 | /* Enqueues a low-priority job that will clean up dead PIDs from our list of PIDs to watch and subscribe to new | |
2985 | * PIDs that might have appeared. We do this in a delayed job because the work might be quite slow, as it | |
2986 | * involves issuing kill(pid, 0) on all processes we watch. */ | |
2987 | ||
2988 | if (!u->rewatch_pids_event_source) { | |
2989 | _cleanup_(sd_event_source_unrefp) sd_event_source *s = NULL; | |
2990 | ||
2991 | r = sd_event_add_defer(u->manager->event, &s, on_rewatch_pids_event, u); | |
2992 | if (r < 0) | |
2993 | return log_error_errno(r, "Failed to allocate event source for tidying watched PIDs: %m"); | |
2994 | ||
2995 | r = sd_event_source_set_priority(s, EVENT_PRIORITY_REWATCH_PIDS); | |
2996 | if (r < 0) | |
2997 | return log_error_errno(r, "Failed to adjust priority of event source for tidying watched PIDs: %m"); | |
2998 | ||
2999 | (void) sd_event_source_set_description(s, "tidy-watch-pids"); | |
3000 | ||
3001 | u->rewatch_pids_event_source = TAKE_PTR(s); | |
3002 | } | |
3003 | ||
3004 | r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_ONESHOT); | |
3005 | if (r < 0) | |
3006 | return log_error_errno(r, "Failed to enable event source for tidying watched PIDs: %m"); | |
3007 | ||
3008 | return 0; | |
3009 | } | |
3010 | ||
3011 | void unit_dequeue_rewatch_pids(Unit *u) { | |
3012 | int r; | |
3013 | assert(u); | |
3014 | ||
3015 | if (!u->rewatch_pids_event_source) | |
3016 | return; | |
3017 | ||
3018 | r = sd_event_source_set_enabled(u->rewatch_pids_event_source, SD_EVENT_OFF); | |
3019 | if (r < 0) | |
3020 | log_warning_errno(r, "Failed to disable event source for tidying watched PIDs, ignoring: %m"); | |
3021 | ||
3022 | u->rewatch_pids_event_source = sd_event_source_disable_unref(u->rewatch_pids_event_source); | |
3023 | } | |
3024 | ||
3025 | bool unit_job_is_applicable(Unit *u, JobType j) { | |
3026 | assert(u); | |
3027 | assert(j >= 0 && j < _JOB_TYPE_MAX); | |
3028 | ||
3029 | switch (j) { | |
3030 | ||
3031 | case JOB_VERIFY_ACTIVE: | |
3032 | case JOB_START: | |
3033 | case JOB_NOP: | |
3034 | /* Note that we don't check unit_can_start() here. That's because .device units and suchlike are not | |
3035 | * startable by us but may appear due to external events, and it thus makes sense to permit enqueuing | |
3036 | * jobs for it. */ | |
3037 | return true; | |
3038 | ||
3039 | case JOB_STOP: | |
3040 | /* Similar as above. However, perpetual units can never be stopped (neither explicitly nor due to | |
3041 | * external events), hence it makes no sense to permit enqueuing such a request either. */ | |
3042 | return !u->perpetual; | |
3043 | ||
3044 | case JOB_RESTART: | |
3045 | case JOB_TRY_RESTART: | |
3046 | return unit_can_stop(u) && unit_can_start(u); | |
3047 | ||
3048 | case JOB_RELOAD: | |
3049 | case JOB_TRY_RELOAD: | |
3050 | return unit_can_reload(u); | |
3051 | ||
3052 | case JOB_RELOAD_OR_START: | |
3053 | return unit_can_reload(u) && unit_can_start(u); | |
3054 | ||
3055 | default: | |
3056 | assert_not_reached(); | |
3057 | } | |
3058 | } | |
3059 | ||
3060 | static Hashmap *unit_get_dependency_hashmap_per_type(Unit *u, UnitDependency d) { | |
3061 | Hashmap *deps; | |
3062 | ||
3063 | assert(u); | |
3064 | assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX); | |
3065 | ||
3066 | deps = hashmap_get(u->dependencies, UNIT_DEPENDENCY_TO_PTR(d)); | |
3067 | if (!deps) { | |
3068 | _cleanup_hashmap_free_ Hashmap *h = NULL; | |
3069 | ||
3070 | h = hashmap_new(NULL); | |
3071 | if (!h) | |
3072 | return NULL; | |
3073 | ||
3074 | if (hashmap_ensure_put(&u->dependencies, NULL, UNIT_DEPENDENCY_TO_PTR(d), h) < 0) | |
3075 | return NULL; | |
3076 | ||
3077 | deps = TAKE_PTR(h); | |
3078 | } | |
3079 | ||
3080 | return deps; | |
3081 | } | |
3082 | ||
3083 | typedef enum NotifyDependencyFlags { | |
3084 | NOTIFY_DEPENDENCY_UPDATE_FROM = 1 << 0, | |
3085 | NOTIFY_DEPENDENCY_UPDATE_TO = 1 << 1, | |
3086 | } NotifyDependencyFlags; | |
3087 | ||
3088 | static int unit_add_dependency_impl( | |
3089 | Unit *u, | |
3090 | UnitDependency d, | |
3091 | Unit *other, | |
3092 | UnitDependencyMask mask) { | |
3093 | ||
3094 | static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = { | |
3095 | [UNIT_REQUIRES] = UNIT_REQUIRED_BY, | |
3096 | [UNIT_REQUISITE] = UNIT_REQUISITE_OF, | |
3097 | [UNIT_WANTS] = UNIT_WANTED_BY, | |
3098 | [UNIT_BINDS_TO] = UNIT_BOUND_BY, | |
3099 | [UNIT_PART_OF] = UNIT_CONSISTS_OF, | |
3100 | [UNIT_UPHOLDS] = UNIT_UPHELD_BY, | |
3101 | [UNIT_REQUIRED_BY] = UNIT_REQUIRES, | |
3102 | [UNIT_REQUISITE_OF] = UNIT_REQUISITE, | |
3103 | [UNIT_WANTED_BY] = UNIT_WANTS, | |
3104 | [UNIT_BOUND_BY] = UNIT_BINDS_TO, | |
3105 | [UNIT_CONSISTS_OF] = UNIT_PART_OF, | |
3106 | [UNIT_UPHELD_BY] = UNIT_UPHOLDS, | |
3107 | [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY, | |
3108 | [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS, | |
3109 | [UNIT_BEFORE] = UNIT_AFTER, | |
3110 | [UNIT_AFTER] = UNIT_BEFORE, | |
3111 | [UNIT_ON_SUCCESS] = UNIT_ON_SUCCESS_OF, | |
3112 | [UNIT_ON_SUCCESS_OF] = UNIT_ON_SUCCESS, | |
3113 | [UNIT_ON_FAILURE] = UNIT_ON_FAILURE_OF, | |
3114 | [UNIT_ON_FAILURE_OF] = UNIT_ON_FAILURE, | |
3115 | [UNIT_TRIGGERS] = UNIT_TRIGGERED_BY, | |
3116 | [UNIT_TRIGGERED_BY] = UNIT_TRIGGERS, | |
3117 | [UNIT_PROPAGATES_RELOAD_TO] = UNIT_RELOAD_PROPAGATED_FROM, | |
3118 | [UNIT_RELOAD_PROPAGATED_FROM] = UNIT_PROPAGATES_RELOAD_TO, | |
3119 | [UNIT_PROPAGATES_STOP_TO] = UNIT_STOP_PROPAGATED_FROM, | |
3120 | [UNIT_STOP_PROPAGATED_FROM] = UNIT_PROPAGATES_STOP_TO, | |
3121 | [UNIT_JOINS_NAMESPACE_OF] = UNIT_JOINS_NAMESPACE_OF, /* symmetric! 👓 */ | |
3122 | [UNIT_REFERENCES] = UNIT_REFERENCED_BY, | |
3123 | [UNIT_REFERENCED_BY] = UNIT_REFERENCES, | |
3124 | [UNIT_IN_SLICE] = UNIT_SLICE_OF, | |
3125 | [UNIT_SLICE_OF] = UNIT_IN_SLICE, | |
3126 | }; | |
3127 | ||
3128 | Hashmap *u_deps, *other_deps; | |
3129 | UnitDependencyInfo u_info, u_info_old, other_info, other_info_old; | |
3130 | NotifyDependencyFlags flags = 0; | |
3131 | int r; | |
3132 | ||
3133 | assert(u); | |
3134 | assert(other); | |
3135 | assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX); | |
3136 | assert(inverse_table[d] >= 0 && inverse_table[d] < _UNIT_DEPENDENCY_MAX); | |
3137 | assert(mask > 0 && mask < _UNIT_DEPENDENCY_MASK_FULL); | |
3138 | ||
3139 | /* Ensure the following two hashmaps for each unit exist: | |
3140 | * - the top-level dependency hashmap that maps UnitDependency → Hashmap(Unit* → UnitDependencyInfo), | |
3141 | * - the inner hashmap, that maps Unit* → UnitDependencyInfo, for the specified dependency type. */ | |
3142 | u_deps = unit_get_dependency_hashmap_per_type(u, d); | |
3143 | if (!u_deps) | |
3144 | return -ENOMEM; | |
3145 | ||
3146 | other_deps = unit_get_dependency_hashmap_per_type(other, inverse_table[d]); | |
3147 | if (!other_deps) | |
3148 | return -ENOMEM; | |
3149 | ||
3150 | /* Save the original dependency info. */ | |
3151 | u_info.data = u_info_old.data = hashmap_get(u_deps, other); | |
3152 | other_info.data = other_info_old.data = hashmap_get(other_deps, u); | |
3153 | ||
3154 | /* Update dependency info. */ | |
3155 | u_info.origin_mask |= mask; | |
3156 | other_info.destination_mask |= mask; | |
3157 | ||
3158 | /* Save updated dependency info. */ | |
3159 | if (u_info.data != u_info_old.data) { | |
3160 | r = hashmap_replace(u_deps, other, u_info.data); | |
3161 | if (r < 0) | |
3162 | return r; | |
3163 | ||
3164 | flags = NOTIFY_DEPENDENCY_UPDATE_FROM; | |
3165 | } | |
3166 | ||
3167 | if (other_info.data != other_info_old.data) { | |
3168 | r = hashmap_replace(other_deps, u, other_info.data); | |
3169 | if (r < 0) { | |
3170 | if (u_info.data != u_info_old.data) { | |
3171 | /* Restore the old dependency. */ | |
3172 | if (u_info_old.data) | |
3173 | (void) hashmap_update(u_deps, other, u_info_old.data); | |
3174 | else | |
3175 | hashmap_remove(u_deps, other); | |
3176 | } | |
3177 | return r; | |
3178 | } | |
3179 | ||
3180 | flags |= NOTIFY_DEPENDENCY_UPDATE_TO; | |
3181 | } | |
3182 | ||
3183 | return flags; | |
3184 | } | |
3185 | ||
3186 | int unit_add_dependency( | |
3187 | Unit *u, | |
3188 | UnitDependency d, | |
3189 | Unit *other, | |
3190 | bool add_reference, | |
3191 | UnitDependencyMask mask) { | |
3192 | ||
3193 | UnitDependencyAtom a; | |
3194 | int r; | |
3195 | ||
3196 | /* Helper to know whether sending a notification is necessary or not: if the dependency is already | |
3197 | * there, no need to notify! */ | |
3198 | NotifyDependencyFlags notify_flags; | |
3199 | ||
3200 | assert(u); | |
3201 | assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX); | |
3202 | assert(other); | |
3203 | ||
3204 | u = unit_follow_merge(u); | |
3205 | other = unit_follow_merge(other); | |
3206 | a = unit_dependency_to_atom(d); | |
3207 | assert(a >= 0); | |
3208 | ||
3209 | /* We won't allow dependencies on ourselves. We will not consider them an error however. */ | |
3210 | if (u == other) { | |
3211 | if (unit_should_warn_about_dependency(d)) | |
3212 | log_unit_warning(u, "Dependency %s=%s is dropped.", | |
3213 | unit_dependency_to_string(d), u->id); | |
3214 | return 0; | |
3215 | } | |
3216 | ||
3217 | if (u->manager && FLAGS_SET(u->manager->test_run_flags, MANAGER_TEST_RUN_IGNORE_DEPENDENCIES)) | |
3218 | return 0; | |
3219 | ||
3220 | /* Note that ordering a device unit after a unit is permitted since it allows to start its job | |
3221 | * running timeout at a specific time. */ | |
3222 | if (FLAGS_SET(a, UNIT_ATOM_BEFORE) && other->type == UNIT_DEVICE) { | |
3223 | log_unit_warning(u, "Dependency Before=%s ignored (.device units cannot be delayed)", other->id); | |
3224 | return 0; | |
3225 | } | |
3226 | ||
3227 | if (FLAGS_SET(a, UNIT_ATOM_ON_FAILURE) && !UNIT_VTABLE(u)->can_fail) { | |
3228 | log_unit_warning(u, "Requested dependency OnFailure=%s ignored (%s units cannot fail).", other->id, unit_type_to_string(u->type)); | |
3229 | return 0; | |
3230 | } | |
3231 | ||
3232 | if (FLAGS_SET(a, UNIT_ATOM_TRIGGERS) && !UNIT_VTABLE(u)->can_trigger) | |
3233 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3234 | "Requested dependency Triggers=%s refused (%s units cannot trigger other units).", other->id, unit_type_to_string(u->type)); | |
3235 | if (FLAGS_SET(a, UNIT_ATOM_TRIGGERED_BY) && !UNIT_VTABLE(other)->can_trigger) | |
3236 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3237 | "Requested dependency TriggeredBy=%s refused (%s units cannot trigger other units).", other->id, unit_type_to_string(other->type)); | |
3238 | ||
3239 | if (FLAGS_SET(a, UNIT_ATOM_IN_SLICE) && other->type != UNIT_SLICE) | |
3240 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3241 | "Requested dependency Slice=%s refused (%s is not a slice unit).", other->id, other->id); | |
3242 | if (FLAGS_SET(a, UNIT_ATOM_SLICE_OF) && u->type != UNIT_SLICE) | |
3243 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3244 | "Requested dependency SliceOf=%s refused (%s is not a slice unit).", other->id, u->id); | |
3245 | ||
3246 | if (FLAGS_SET(a, UNIT_ATOM_IN_SLICE) && !UNIT_HAS_CGROUP_CONTEXT(u)) | |
3247 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3248 | "Requested dependency Slice=%s refused (%s is not a cgroup unit).", other->id, u->id); | |
3249 | ||
3250 | if (FLAGS_SET(a, UNIT_ATOM_SLICE_OF) && !UNIT_HAS_CGROUP_CONTEXT(other)) | |
3251 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(EINVAL), | |
3252 | "Requested dependency SliceOf=%s refused (%s is not a cgroup unit).", other->id, other->id); | |
3253 | ||
3254 | r = unit_add_dependency_impl(u, d, other, mask); | |
3255 | if (r < 0) | |
3256 | return r; | |
3257 | notify_flags = r; | |
3258 | ||
3259 | if (add_reference) { | |
3260 | r = unit_add_dependency_impl(u, UNIT_REFERENCES, other, mask); | |
3261 | if (r < 0) | |
3262 | return r; | |
3263 | notify_flags |= r; | |
3264 | } | |
3265 | ||
3266 | if (FLAGS_SET(notify_flags, NOTIFY_DEPENDENCY_UPDATE_FROM)) | |
3267 | unit_add_to_dbus_queue(u); | |
3268 | if (FLAGS_SET(notify_flags, NOTIFY_DEPENDENCY_UPDATE_TO)) | |
3269 | unit_add_to_dbus_queue(other); | |
3270 | ||
3271 | return notify_flags != 0; | |
3272 | } | |
3273 | ||
3274 | int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference, UnitDependencyMask mask) { | |
3275 | int r = 0, s = 0; | |
3276 | ||
3277 | assert(u); | |
3278 | assert(d >= 0 || e >= 0); | |
3279 | ||
3280 | if (d >= 0) { | |
3281 | r = unit_add_dependency(u, d, other, add_reference, mask); | |
3282 | if (r < 0) | |
3283 | return r; | |
3284 | } | |
3285 | ||
3286 | if (e >= 0) { | |
3287 | s = unit_add_dependency(u, e, other, add_reference, mask); | |
3288 | if (s < 0) | |
3289 | return s; | |
3290 | } | |
3291 | ||
3292 | return r > 0 || s > 0; | |
3293 | } | |
3294 | ||
3295 | static int resolve_template(Unit *u, const char *name, char **buf, const char **ret) { | |
3296 | int r; | |
3297 | ||
3298 | assert(u); | |
3299 | assert(name); | |
3300 | assert(buf); | |
3301 | assert(ret); | |
3302 | ||
3303 | if (!unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { | |
3304 | *buf = NULL; | |
3305 | *ret = name; | |
3306 | return 0; | |
3307 | } | |
3308 | ||
3309 | if (u->instance) | |
3310 | r = unit_name_replace_instance(name, u->instance, buf); | |
3311 | else { | |
3312 | _cleanup_free_ char *i = NULL; | |
3313 | ||
3314 | r = unit_name_to_prefix(u->id, &i); | |
3315 | if (r < 0) | |
3316 | return r; | |
3317 | ||
3318 | r = unit_name_replace_instance(name, i, buf); | |
3319 | } | |
3320 | if (r < 0) | |
3321 | return r; | |
3322 | ||
3323 | *ret = *buf; | |
3324 | return 0; | |
3325 | } | |
3326 | ||
3327 | int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, bool add_reference, UnitDependencyMask mask) { | |
3328 | _cleanup_free_ char *buf = NULL; | |
3329 | Unit *other; | |
3330 | int r; | |
3331 | ||
3332 | assert(u); | |
3333 | assert(name); | |
3334 | ||
3335 | r = resolve_template(u, name, &buf, &name); | |
3336 | if (r < 0) | |
3337 | return r; | |
3338 | ||
3339 | if (u->manager && FLAGS_SET(u->manager->test_run_flags, MANAGER_TEST_RUN_IGNORE_DEPENDENCIES)) | |
3340 | return 0; | |
3341 | ||
3342 | r = manager_load_unit(u->manager, name, NULL, NULL, &other); | |
3343 | if (r < 0) | |
3344 | return r; | |
3345 | ||
3346 | return unit_add_dependency(u, d, other, add_reference, mask); | |
3347 | } | |
3348 | ||
3349 | int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, bool add_reference, UnitDependencyMask mask) { | |
3350 | _cleanup_free_ char *buf = NULL; | |
3351 | Unit *other; | |
3352 | int r; | |
3353 | ||
3354 | assert(u); | |
3355 | assert(name); | |
3356 | ||
3357 | r = resolve_template(u, name, &buf, &name); | |
3358 | if (r < 0) | |
3359 | return r; | |
3360 | ||
3361 | if (u->manager && FLAGS_SET(u->manager->test_run_flags, MANAGER_TEST_RUN_IGNORE_DEPENDENCIES)) | |
3362 | return 0; | |
3363 | ||
3364 | r = manager_load_unit(u->manager, name, NULL, NULL, &other); | |
3365 | if (r < 0) | |
3366 | return r; | |
3367 | ||
3368 | return unit_add_two_dependencies(u, d, e, other, add_reference, mask); | |
3369 | } | |
3370 | ||
3371 | int set_unit_path(const char *p) { | |
3372 | /* This is mostly for debug purposes */ | |
3373 | return RET_NERRNO(setenv("SYSTEMD_UNIT_PATH", p, 1)); | |
3374 | } | |
3375 | ||
3376 | char *unit_dbus_path(Unit *u) { | |
3377 | assert(u); | |
3378 | ||
3379 | if (!u->id) | |
3380 | return NULL; | |
3381 | ||
3382 | return unit_dbus_path_from_name(u->id); | |
3383 | } | |
3384 | ||
3385 | char *unit_dbus_path_invocation_id(Unit *u) { | |
3386 | assert(u); | |
3387 | ||
3388 | if (sd_id128_is_null(u->invocation_id)) | |
3389 | return NULL; | |
3390 | ||
3391 | return unit_dbus_path_from_name(u->invocation_id_string); | |
3392 | } | |
3393 | ||
3394 | int unit_set_invocation_id(Unit *u, sd_id128_t id) { | |
3395 | int r; | |
3396 | ||
3397 | assert(u); | |
3398 | ||
3399 | /* Set the invocation ID for this unit. If we cannot, this will not roll back, but reset the whole thing. */ | |
3400 | ||
3401 | if (sd_id128_equal(u->invocation_id, id)) | |
3402 | return 0; | |
3403 | ||
3404 | if (!sd_id128_is_null(u->invocation_id)) | |
3405 | (void) hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
3406 | ||
3407 | if (sd_id128_is_null(id)) { | |
3408 | r = 0; | |
3409 | goto reset; | |
3410 | } | |
3411 | ||
3412 | r = hashmap_ensure_allocated(&u->manager->units_by_invocation_id, &id128_hash_ops); | |
3413 | if (r < 0) | |
3414 | goto reset; | |
3415 | ||
3416 | u->invocation_id = id; | |
3417 | sd_id128_to_string(id, u->invocation_id_string); | |
3418 | ||
3419 | r = hashmap_put(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
3420 | if (r < 0) | |
3421 | goto reset; | |
3422 | ||
3423 | return 0; | |
3424 | ||
3425 | reset: | |
3426 | u->invocation_id = SD_ID128_NULL; | |
3427 | u->invocation_id_string[0] = 0; | |
3428 | return r; | |
3429 | } | |
3430 | ||
3431 | int unit_set_slice(Unit *u, Unit *slice) { | |
3432 | int r; | |
3433 | ||
3434 | assert(u); | |
3435 | assert(slice); | |
3436 | ||
3437 | /* Sets the unit slice if it has not been set before. Is extra careful, to only allow this for units | |
3438 | * that actually have a cgroup context. Also, we don't allow to set this for slices (since the parent | |
3439 | * slice is derived from the name). Make sure the unit we set is actually a slice. */ | |
3440 | ||
3441 | if (!UNIT_HAS_CGROUP_CONTEXT(u)) | |
3442 | return -EOPNOTSUPP; | |
3443 | ||
3444 | if (u->type == UNIT_SLICE) | |
3445 | return -EINVAL; | |
3446 | ||
3447 | if (unit_active_state(u) != UNIT_INACTIVE) | |
3448 | return -EBUSY; | |
3449 | ||
3450 | if (slice->type != UNIT_SLICE) | |
3451 | return -EINVAL; | |
3452 | ||
3453 | if (unit_has_name(u, SPECIAL_INIT_SCOPE) && | |
3454 | !unit_has_name(slice, SPECIAL_ROOT_SLICE)) | |
3455 | return -EPERM; | |
3456 | ||
3457 | if (UNIT_GET_SLICE(u) == slice) | |
3458 | return 0; | |
3459 | ||
3460 | /* Disallow slice changes if @u is already bound to cgroups */ | |
3461 | if (UNIT_GET_SLICE(u) && u->cgroup_realized) | |
3462 | return -EBUSY; | |
3463 | ||
3464 | /* Remove any slices assigned prior; we should only have one UNIT_IN_SLICE dependency */ | |
3465 | if (UNIT_GET_SLICE(u)) | |
3466 | unit_remove_dependencies(u, UNIT_DEPENDENCY_SLICE_PROPERTY); | |
3467 | ||
3468 | r = unit_add_dependency(u, UNIT_IN_SLICE, slice, true, UNIT_DEPENDENCY_SLICE_PROPERTY); | |
3469 | if (r < 0) | |
3470 | return r; | |
3471 | ||
3472 | return 1; | |
3473 | } | |
3474 | ||
3475 | int unit_set_default_slice(Unit *u) { | |
3476 | const char *slice_name; | |
3477 | Unit *slice; | |
3478 | int r; | |
3479 | ||
3480 | assert(u); | |
3481 | ||
3482 | if (u->manager && FLAGS_SET(u->manager->test_run_flags, MANAGER_TEST_RUN_IGNORE_DEPENDENCIES)) | |
3483 | return 0; | |
3484 | ||
3485 | if (UNIT_GET_SLICE(u)) | |
3486 | return 0; | |
3487 | ||
3488 | if (u->instance) { | |
3489 | _cleanup_free_ char *prefix = NULL, *escaped = NULL; | |
3490 | ||
3491 | /* Implicitly place all instantiated units in their | |
3492 | * own per-template slice */ | |
3493 | ||
3494 | r = unit_name_to_prefix(u->id, &prefix); | |
3495 | if (r < 0) | |
3496 | return r; | |
3497 | ||
3498 | /* The prefix is already escaped, but it might include | |
3499 | * "-" which has a special meaning for slice units, | |
3500 | * hence escape it here extra. */ | |
3501 | escaped = unit_name_escape(prefix); | |
3502 | if (!escaped) | |
3503 | return -ENOMEM; | |
3504 | ||
3505 | if (MANAGER_IS_SYSTEM(u->manager)) | |
3506 | slice_name = strjoina("system-", escaped, ".slice"); | |
3507 | else | |
3508 | slice_name = strjoina("app-", escaped, ".slice"); | |
3509 | ||
3510 | } else if (unit_is_extrinsic(u)) | |
3511 | /* Keep all extrinsic units (e.g. perpetual units and swap and mount units in user mode) in | |
3512 | * the root slice. They don't really belong in one of the subslices. */ | |
3513 | slice_name = SPECIAL_ROOT_SLICE; | |
3514 | ||
3515 | else if (MANAGER_IS_SYSTEM(u->manager)) | |
3516 | slice_name = SPECIAL_SYSTEM_SLICE; | |
3517 | else | |
3518 | slice_name = SPECIAL_APP_SLICE; | |
3519 | ||
3520 | r = manager_load_unit(u->manager, slice_name, NULL, NULL, &slice); | |
3521 | if (r < 0) | |
3522 | return r; | |
3523 | ||
3524 | return unit_set_slice(u, slice); | |
3525 | } | |
3526 | ||
3527 | const char *unit_slice_name(Unit *u) { | |
3528 | Unit *slice; | |
3529 | assert(u); | |
3530 | ||
3531 | slice = UNIT_GET_SLICE(u); | |
3532 | if (!slice) | |
3533 | return NULL; | |
3534 | ||
3535 | return slice->id; | |
3536 | } | |
3537 | ||
3538 | int unit_load_related_unit(Unit *u, const char *type, Unit **_found) { | |
3539 | _cleanup_free_ char *t = NULL; | |
3540 | int r; | |
3541 | ||
3542 | assert(u); | |
3543 | assert(type); | |
3544 | assert(_found); | |
3545 | ||
3546 | r = unit_name_change_suffix(u->id, type, &t); | |
3547 | if (r < 0) | |
3548 | return r; | |
3549 | if (unit_has_name(u, t)) | |
3550 | return -EINVAL; | |
3551 | ||
3552 | r = manager_load_unit(u->manager, t, NULL, NULL, _found); | |
3553 | assert(r < 0 || *_found != u); | |
3554 | return r; | |
3555 | } | |
3556 | ||
3557 | static int signal_name_owner_changed(sd_bus_message *message, void *userdata, sd_bus_error *error) { | |
3558 | const char *new_owner; | |
3559 | Unit *u = ASSERT_PTR(userdata); | |
3560 | int r; | |
3561 | ||
3562 | assert(message); | |
3563 | ||
3564 | r = sd_bus_message_read(message, "sss", NULL, NULL, &new_owner); | |
3565 | if (r < 0) { | |
3566 | bus_log_parse_error(r); | |
3567 | return 0; | |
3568 | } | |
3569 | ||
3570 | if (UNIT_VTABLE(u)->bus_name_owner_change) | |
3571 | UNIT_VTABLE(u)->bus_name_owner_change(u, empty_to_null(new_owner)); | |
3572 | ||
3573 | return 0; | |
3574 | } | |
3575 | ||
3576 | static int get_name_owner_handler(sd_bus_message *message, void *userdata, sd_bus_error *error) { | |
3577 | const sd_bus_error *e; | |
3578 | const char *new_owner; | |
3579 | Unit *u = ASSERT_PTR(userdata); | |
3580 | int r; | |
3581 | ||
3582 | assert(message); | |
3583 | ||
3584 | u->get_name_owner_slot = sd_bus_slot_unref(u->get_name_owner_slot); | |
3585 | ||
3586 | e = sd_bus_message_get_error(message); | |
3587 | if (e) { | |
3588 | if (!sd_bus_error_has_name(e, SD_BUS_ERROR_NAME_HAS_NO_OWNER)) { | |
3589 | r = sd_bus_error_get_errno(e); | |
3590 | log_unit_error_errno(u, r, | |
3591 | "Unexpected error response from GetNameOwner(): %s", | |
3592 | bus_error_message(e, r)); | |
3593 | } | |
3594 | ||
3595 | new_owner = NULL; | |
3596 | } else { | |
3597 | r = sd_bus_message_read(message, "s", &new_owner); | |
3598 | if (r < 0) | |
3599 | return bus_log_parse_error(r); | |
3600 | ||
3601 | assert(!isempty(new_owner)); | |
3602 | } | |
3603 | ||
3604 | if (UNIT_VTABLE(u)->bus_name_owner_change) | |
3605 | UNIT_VTABLE(u)->bus_name_owner_change(u, new_owner); | |
3606 | ||
3607 | return 0; | |
3608 | } | |
3609 | ||
3610 | int unit_install_bus_match(Unit *u, sd_bus *bus, const char *name) { | |
3611 | _cleanup_(sd_bus_message_unrefp) sd_bus_message *m = NULL; | |
3612 | const char *match; | |
3613 | usec_t timeout_usec = 0; | |
3614 | int r; | |
3615 | ||
3616 | assert(u); | |
3617 | assert(bus); | |
3618 | assert(name); | |
3619 | ||
3620 | if (u->match_bus_slot || u->get_name_owner_slot) | |
3621 | return -EBUSY; | |
3622 | ||
3623 | /* NameOwnerChanged and GetNameOwner is used to detect when a service finished starting up. The dbus | |
3624 | * call timeout shouldn't be earlier than that. If we couldn't get the start timeout, use the default | |
3625 | * value defined above. */ | |
3626 | if (UNIT_VTABLE(u)->get_timeout_start_usec) | |
3627 | timeout_usec = UNIT_VTABLE(u)->get_timeout_start_usec(u); | |
3628 | ||
3629 | match = strjoina("type='signal'," | |
3630 | "sender='org.freedesktop.DBus'," | |
3631 | "path='/org/freedesktop/DBus'," | |
3632 | "interface='org.freedesktop.DBus'," | |
3633 | "member='NameOwnerChanged'," | |
3634 | "arg0='", name, "'"); | |
3635 | ||
3636 | r = bus_add_match_full( | |
3637 | bus, | |
3638 | &u->match_bus_slot, | |
3639 | true, | |
3640 | match, | |
3641 | signal_name_owner_changed, | |
3642 | NULL, | |
3643 | u, | |
3644 | timeout_usec); | |
3645 | if (r < 0) | |
3646 | return r; | |
3647 | ||
3648 | r = sd_bus_message_new_method_call( | |
3649 | bus, | |
3650 | &m, | |
3651 | "org.freedesktop.DBus", | |
3652 | "/org/freedesktop/DBus", | |
3653 | "org.freedesktop.DBus", | |
3654 | "GetNameOwner"); | |
3655 | if (r < 0) | |
3656 | return r; | |
3657 | ||
3658 | r = sd_bus_message_append(m, "s", name); | |
3659 | if (r < 0) | |
3660 | return r; | |
3661 | ||
3662 | r = sd_bus_call_async( | |
3663 | bus, | |
3664 | &u->get_name_owner_slot, | |
3665 | m, | |
3666 | get_name_owner_handler, | |
3667 | u, | |
3668 | timeout_usec); | |
3669 | ||
3670 | if (r < 0) { | |
3671 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); | |
3672 | return r; | |
3673 | } | |
3674 | ||
3675 | log_unit_debug(u, "Watching D-Bus name '%s'.", name); | |
3676 | return 0; | |
3677 | } | |
3678 | ||
3679 | int unit_watch_bus_name(Unit *u, const char *name) { | |
3680 | int r; | |
3681 | ||
3682 | assert(u); | |
3683 | assert(name); | |
3684 | ||
3685 | /* Watch a specific name on the bus. We only support one unit | |
3686 | * watching each name for now. */ | |
3687 | ||
3688 | if (u->manager->api_bus) { | |
3689 | /* If the bus is already available, install the match directly. | |
3690 | * Otherwise, just put the name in the list. bus_setup_api() will take care later. */ | |
3691 | r = unit_install_bus_match(u, u->manager->api_bus, name); | |
3692 | if (r < 0) | |
3693 | return log_warning_errno(r, "Failed to subscribe to NameOwnerChanged signal for '%s': %m", name); | |
3694 | } | |
3695 | ||
3696 | r = hashmap_put(u->manager->watch_bus, name, u); | |
3697 | if (r < 0) { | |
3698 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); | |
3699 | u->get_name_owner_slot = sd_bus_slot_unref(u->get_name_owner_slot); | |
3700 | return log_warning_errno(r, "Failed to put bus name to hashmap: %m"); | |
3701 | } | |
3702 | ||
3703 | return 0; | |
3704 | } | |
3705 | ||
3706 | void unit_unwatch_bus_name(Unit *u, const char *name) { | |
3707 | assert(u); | |
3708 | assert(name); | |
3709 | ||
3710 | (void) hashmap_remove_value(u->manager->watch_bus, name, u); | |
3711 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); | |
3712 | u->get_name_owner_slot = sd_bus_slot_unref(u->get_name_owner_slot); | |
3713 | } | |
3714 | ||
3715 | int unit_add_node_dependency(Unit *u, const char *what, UnitDependency dep, UnitDependencyMask mask) { | |
3716 | _cleanup_free_ char *e = NULL; | |
3717 | Unit *device; | |
3718 | int r; | |
3719 | ||
3720 | assert(u); | |
3721 | ||
3722 | /* Adds in links to the device node that this unit is based on */ | |
3723 | if (isempty(what)) | |
3724 | return 0; | |
3725 | ||
3726 | if (!is_device_path(what)) | |
3727 | return 0; | |
3728 | ||
3729 | /* When device units aren't supported (such as in a container), don't create dependencies on them. */ | |
3730 | if (!unit_type_supported(UNIT_DEVICE)) | |
3731 | return 0; | |
3732 | ||
3733 | r = unit_name_from_path(what, ".device", &e); | |
3734 | if (r < 0) | |
3735 | return r; | |
3736 | ||
3737 | r = manager_load_unit(u->manager, e, NULL, NULL, &device); | |
3738 | if (r < 0) | |
3739 | return r; | |
3740 | ||
3741 | if (dep == UNIT_REQUIRES && device_shall_be_bound_by(device, u)) | |
3742 | dep = UNIT_BINDS_TO; | |
3743 | ||
3744 | return unit_add_two_dependencies(u, UNIT_AFTER, | |
3745 | MANAGER_IS_SYSTEM(u->manager) ? dep : UNIT_WANTS, | |
3746 | device, true, mask); | |
3747 | } | |
3748 | ||
3749 | int unit_add_blockdev_dependency(Unit *u, const char *what, UnitDependencyMask mask) { | |
3750 | _cleanup_free_ char *escaped = NULL, *target = NULL; | |
3751 | int r; | |
3752 | ||
3753 | assert(u); | |
3754 | ||
3755 | if (isempty(what)) | |
3756 | return 0; | |
3757 | ||
3758 | if (!path_startswith(what, "/dev/")) | |
3759 | return 0; | |
3760 | ||
3761 | /* If we don't support devices, then also don't bother with blockdev@.target */ | |
3762 | if (!unit_type_supported(UNIT_DEVICE)) | |
3763 | return 0; | |
3764 | ||
3765 | r = unit_name_path_escape(what, &escaped); | |
3766 | if (r < 0) | |
3767 | return r; | |
3768 | ||
3769 | r = unit_name_build("blockdev", escaped, ".target", &target); | |
3770 | if (r < 0) | |
3771 | return r; | |
3772 | ||
3773 | return unit_add_dependency_by_name(u, UNIT_AFTER, target, true, mask); | |
3774 | } | |
3775 | ||
3776 | int unit_coldplug(Unit *u) { | |
3777 | int r = 0; | |
3778 | ||
3779 | assert(u); | |
3780 | ||
3781 | /* Make sure we don't enter a loop, when coldplugging recursively. */ | |
3782 | if (u->coldplugged) | |
3783 | return 0; | |
3784 | ||
3785 | u->coldplugged = true; | |
3786 | ||
3787 | STRV_FOREACH(i, u->deserialized_refs) | |
3788 | RET_GATHER(r, bus_unit_track_add_name(u, *i)); | |
3789 | ||
3790 | u->deserialized_refs = strv_free(u->deserialized_refs); | |
3791 | ||
3792 | if (UNIT_VTABLE(u)->coldplug) | |
3793 | RET_GATHER(r, UNIT_VTABLE(u)->coldplug(u)); | |
3794 | ||
3795 | if (u->job) | |
3796 | RET_GATHER(r, job_coldplug(u->job)); | |
3797 | if (u->nop_job) | |
3798 | RET_GATHER(r, job_coldplug(u->nop_job)); | |
3799 | ||
3800 | unit_modify_nft_set(u, /* add = */ true); | |
3801 | return r; | |
3802 | } | |
3803 | ||
3804 | void unit_catchup(Unit *u) { | |
3805 | assert(u); | |
3806 | ||
3807 | if (UNIT_VTABLE(u)->catchup) | |
3808 | UNIT_VTABLE(u)->catchup(u); | |
3809 | ||
3810 | unit_cgroup_catchup(u); | |
3811 | } | |
3812 | ||
3813 | static bool fragment_mtime_newer(const char *path, usec_t mtime, bool path_masked) { | |
3814 | struct stat st; | |
3815 | ||
3816 | if (!path) | |
3817 | return false; | |
3818 | ||
3819 | /* If the source is some virtual kernel file system, then we assume we watch it anyway, and hence pretend we | |
3820 | * are never out-of-date. */ | |
3821 | if (PATH_STARTSWITH_SET(path, "/proc", "/sys")) | |
3822 | return false; | |
3823 | ||
3824 | if (stat(path, &st) < 0) | |
3825 | /* What, cannot access this anymore? */ | |
3826 | return true; | |
3827 | ||
3828 | if (path_masked) | |
3829 | /* For masked files check if they are still so */ | |
3830 | return !null_or_empty(&st); | |
3831 | else | |
3832 | /* For non-empty files check the mtime */ | |
3833 | return timespec_load(&st.st_mtim) > mtime; | |
3834 | ||
3835 | return false; | |
3836 | } | |
3837 | ||
3838 | bool unit_need_daemon_reload(Unit *u) { | |
3839 | _cleanup_strv_free_ char **dropins = NULL; | |
3840 | ||
3841 | assert(u); | |
3842 | assert(u->manager); | |
3843 | ||
3844 | if (u->manager->unit_file_state_outdated) | |
3845 | return true; | |
3846 | ||
3847 | /* For unit files, we allow masking… */ | |
3848 | if (fragment_mtime_newer(u->fragment_path, u->fragment_mtime, | |
3849 | u->load_state == UNIT_MASKED)) | |
3850 | return true; | |
3851 | ||
3852 | /* Source paths should not be masked… */ | |
3853 | if (fragment_mtime_newer(u->source_path, u->source_mtime, false)) | |
3854 | return true; | |
3855 | ||
3856 | if (u->load_state == UNIT_LOADED) | |
3857 | (void) unit_find_dropin_paths(u, &dropins); | |
3858 | if (!strv_equal(u->dropin_paths, dropins)) | |
3859 | return true; | |
3860 | ||
3861 | /* … any drop-ins that are masked are simply omitted from the list. */ | |
3862 | STRV_FOREACH(path, u->dropin_paths) | |
3863 | if (fragment_mtime_newer(*path, u->dropin_mtime, false)) | |
3864 | return true; | |
3865 | ||
3866 | return false; | |
3867 | } | |
3868 | ||
3869 | void unit_reset_failed(Unit *u) { | |
3870 | assert(u); | |
3871 | ||
3872 | if (UNIT_VTABLE(u)->reset_failed) | |
3873 | UNIT_VTABLE(u)->reset_failed(u); | |
3874 | ||
3875 | ratelimit_reset(&u->start_ratelimit); | |
3876 | u->start_limit_hit = false; | |
3877 | } | |
3878 | ||
3879 | Unit *unit_following(Unit *u) { | |
3880 | assert(u); | |
3881 | ||
3882 | if (UNIT_VTABLE(u)->following) | |
3883 | return UNIT_VTABLE(u)->following(u); | |
3884 | ||
3885 | return NULL; | |
3886 | } | |
3887 | ||
3888 | bool unit_stop_pending(Unit *u) { | |
3889 | assert(u); | |
3890 | ||
3891 | /* This call does check the current state of the unit. It's | |
3892 | * hence useful to be called from state change calls of the | |
3893 | * unit itself, where the state isn't updated yet. This is | |
3894 | * different from unit_inactive_or_pending() which checks both | |
3895 | * the current state and for a queued job. */ | |
3896 | ||
3897 | return unit_has_job_type(u, JOB_STOP); | |
3898 | } | |
3899 | ||
3900 | bool unit_inactive_or_pending(Unit *u) { | |
3901 | assert(u); | |
3902 | ||
3903 | /* Returns true if the unit is inactive or going down */ | |
3904 | ||
3905 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u))) | |
3906 | return true; | |
3907 | ||
3908 | if (unit_stop_pending(u)) | |
3909 | return true; | |
3910 | ||
3911 | return false; | |
3912 | } | |
3913 | ||
3914 | bool unit_active_or_pending(Unit *u) { | |
3915 | assert(u); | |
3916 | ||
3917 | /* Returns true if the unit is active or going up */ | |
3918 | ||
3919 | if (UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))) | |
3920 | return true; | |
3921 | ||
3922 | if (u->job && | |
3923 | IN_SET(u->job->type, JOB_START, JOB_RELOAD_OR_START, JOB_RESTART)) | |
3924 | return true; | |
3925 | ||
3926 | return false; | |
3927 | } | |
3928 | ||
3929 | bool unit_will_restart_default(Unit *u) { | |
3930 | assert(u); | |
3931 | ||
3932 | return unit_has_job_type(u, JOB_START); | |
3933 | } | |
3934 | ||
3935 | bool unit_will_restart(Unit *u) { | |
3936 | assert(u); | |
3937 | ||
3938 | if (!UNIT_VTABLE(u)->will_restart) | |
3939 | return false; | |
3940 | ||
3941 | return UNIT_VTABLE(u)->will_restart(u); | |
3942 | } | |
3943 | ||
3944 | void unit_notify_cgroup_oom(Unit *u, bool managed_oom) { | |
3945 | assert(u); | |
3946 | ||
3947 | if (UNIT_VTABLE(u)->notify_cgroup_oom) | |
3948 | UNIT_VTABLE(u)->notify_cgroup_oom(u, managed_oom); | |
3949 | } | |
3950 | ||
3951 | static int unit_pid_set(Unit *u, Set **pid_set) { | |
3952 | int r; | |
3953 | ||
3954 | assert(u); | |
3955 | assert(pid_set); | |
3956 | ||
3957 | set_clear(*pid_set); /* This updates input. */ | |
3958 | ||
3959 | /* Exclude the main/control pids from being killed via the cgroup */ | |
3960 | ||
3961 | PidRef *pid; | |
3962 | FOREACH_ARGUMENT(pid, unit_main_pid(u), unit_control_pid(u)) | |
3963 | if (pidref_is_set(pid)) { | |
3964 | r = set_ensure_put(pid_set, NULL, PID_TO_PTR(pid->pid)); | |
3965 | if (r < 0) | |
3966 | return r; | |
3967 | } | |
3968 | ||
3969 | return 0; | |
3970 | } | |
3971 | ||
3972 | static int kill_common_log(const PidRef *pid, int signo, void *userdata) { | |
3973 | _cleanup_free_ char *comm = NULL; | |
3974 | Unit *u = ASSERT_PTR(userdata); | |
3975 | ||
3976 | (void) pidref_get_comm(pid, &comm); | |
3977 | ||
3978 | log_unit_info(u, "Sending signal SIG%s to process " PID_FMT " (%s) on client request.", | |
3979 | signal_to_string(signo), pid->pid, strna(comm)); | |
3980 | ||
3981 | return 1; | |
3982 | } | |
3983 | ||
3984 | static int kill_or_sigqueue(PidRef* pidref, int signo, int code, int value) { | |
3985 | assert(pidref_is_set(pidref)); | |
3986 | assert(SIGNAL_VALID(signo)); | |
3987 | ||
3988 | switch (code) { | |
3989 | ||
3990 | case SI_USER: | |
3991 | log_debug("Killing " PID_FMT " with signal SIG%s.", pidref->pid, signal_to_string(signo)); | |
3992 | return pidref_kill(pidref, signo); | |
3993 | ||
3994 | case SI_QUEUE: | |
3995 | log_debug("Enqueuing value %i to " PID_FMT " on signal SIG%s.", value, pidref->pid, signal_to_string(signo)); | |
3996 | return pidref_sigqueue(pidref, signo, value); | |
3997 | ||
3998 | default: | |
3999 | assert_not_reached(); | |
4000 | } | |
4001 | } | |
4002 | ||
4003 | static int unit_kill_one( | |
4004 | Unit *u, | |
4005 | PidRef *pidref, | |
4006 | const char *type, | |
4007 | int signo, | |
4008 | int code, | |
4009 | int value, | |
4010 | sd_bus_error *ret_error) { | |
4011 | ||
4012 | int r; | |
4013 | ||
4014 | assert(u); | |
4015 | assert(type); | |
4016 | ||
4017 | if (!pidref_is_set(pidref)) | |
4018 | return 0; | |
4019 | ||
4020 | _cleanup_free_ char *comm = NULL; | |
4021 | (void) pidref_get_comm(pidref, &comm); | |
4022 | ||
4023 | r = kill_or_sigqueue(pidref, signo, code, value); | |
4024 | if (r == -ESRCH) | |
4025 | return 0; | |
4026 | if (r < 0) { | |
4027 | /* Report this failure both to the logs and to the client */ | |
4028 | if (ret_error) | |
4029 | sd_bus_error_set_errnof( | |
4030 | ret_error, r, | |
4031 | "Failed to send signal SIG%s to %s process " PID_FMT " (%s): %m", | |
4032 | signal_to_string(signo), type, pidref->pid, strna(comm)); | |
4033 | ||
4034 | return log_unit_warning_errno( | |
4035 | u, r, | |
4036 | "Failed to send signal SIG%s to %s process " PID_FMT " (%s) on client request: %m", | |
4037 | signal_to_string(signo), type, pidref->pid, strna(comm)); | |
4038 | } | |
4039 | ||
4040 | log_unit_info(u, "Sent signal SIG%s to %s process " PID_FMT " (%s) on client request.", | |
4041 | signal_to_string(signo), type, pidref->pid, strna(comm)); | |
4042 | return 1; /* killed */ | |
4043 | } | |
4044 | ||
4045 | int unit_kill( | |
4046 | Unit *u, | |
4047 | KillWho who, | |
4048 | int signo, | |
4049 | int code, | |
4050 | int value, | |
4051 | sd_bus_error *ret_error) { | |
4052 | ||
4053 | PidRef *main_pid, *control_pid; | |
4054 | bool killed = false; | |
4055 | int ret = 0, r; | |
4056 | ||
4057 | /* This is the common implementation for explicit user-requested killing of unit processes, shared by | |
4058 | * various unit types. Do not confuse with unit_kill_context(), which is what we use when we want to | |
4059 | * stop a service ourselves. */ | |
4060 | ||
4061 | assert(u); | |
4062 | assert(who >= 0); | |
4063 | assert(who < _KILL_WHO_MAX); | |
4064 | assert(SIGNAL_VALID(signo)); | |
4065 | assert(IN_SET(code, SI_USER, SI_QUEUE)); | |
4066 | ||
4067 | main_pid = unit_main_pid(u); | |
4068 | control_pid = unit_control_pid(u); | |
4069 | ||
4070 | if (!UNIT_HAS_CGROUP_CONTEXT(u) && !main_pid && !control_pid) | |
4071 | return sd_bus_error_setf(ret_error, SD_BUS_ERROR_NOT_SUPPORTED, "Unit type does not support process killing."); | |
4072 | ||
4073 | if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL)) { | |
4074 | if (!main_pid) | |
4075 | return sd_bus_error_setf(ret_error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no main processes", unit_type_to_string(u->type)); | |
4076 | if (!pidref_is_set(main_pid)) | |
4077 | return sd_bus_error_set_const(ret_error, BUS_ERROR_NO_SUCH_PROCESS, "No main process to kill"); | |
4078 | } | |
4079 | ||
4080 | if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL)) { | |
4081 | if (!control_pid) | |
4082 | return sd_bus_error_setf(ret_error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no control processes", unit_type_to_string(u->type)); | |
4083 | if (!pidref_is_set(control_pid)) | |
4084 | return sd_bus_error_set_const(ret_error, BUS_ERROR_NO_SUCH_PROCESS, "No control process to kill"); | |
4085 | } | |
4086 | ||
4087 | if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL, KILL_ALL, KILL_ALL_FAIL)) { | |
4088 | r = unit_kill_one(u, control_pid, "control", signo, code, value, ret_error); | |
4089 | RET_GATHER(ret, r); | |
4090 | killed = killed || r > 0; | |
4091 | } | |
4092 | ||
4093 | if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL, KILL_ALL, KILL_ALL_FAIL)) { | |
4094 | r = unit_kill_one(u, main_pid, "main", signo, code, value, ret >= 0 ? ret_error : NULL); | |
4095 | RET_GATHER(ret, r); | |
4096 | killed = killed || r > 0; | |
4097 | } | |
4098 | ||
4099 | /* Note: if we shall enqueue rather than kill we won't do this via the cgroup mechanism, since it | |
4100 | * doesn't really make much sense (and given that enqueued values are a relatively expensive | |
4101 | * resource, and we shouldn't allow us to be subjects for such allocation sprees) */ | |
4102 | if (IN_SET(who, KILL_ALL, KILL_ALL_FAIL) && u->cgroup_path && code == SI_USER) { | |
4103 | _cleanup_set_free_ Set *pid_set = NULL; | |
4104 | ||
4105 | /* Exclude the main/control pids from being killed via the cgroup */ | |
4106 | r = unit_pid_set(u, &pid_set); | |
4107 | if (r < 0) | |
4108 | return log_oom(); | |
4109 | ||
4110 | r = cg_kill_recursive(u->cgroup_path, signo, 0, pid_set, kill_common_log, u); | |
4111 | if (r < 0 && !IN_SET(r, -ESRCH, -ENOENT)) { | |
4112 | if (ret >= 0) | |
4113 | sd_bus_error_set_errnof( | |
4114 | ret_error, r, | |
4115 | "Failed to send signal SIG%s to auxiliary processes: %m", | |
4116 | signal_to_string(signo)); | |
4117 | ||
4118 | log_unit_warning_errno( | |
4119 | u, r, | |
4120 | "Failed to send signal SIG%s to auxiliary processes on client request: %m", | |
4121 | signal_to_string(signo)); | |
4122 | ||
4123 | RET_GATHER(ret, r); | |
4124 | } | |
4125 | ||
4126 | killed = killed || r >= 0; | |
4127 | } | |
4128 | ||
4129 | /* If the "fail" versions of the operation are requested, then complain if the set of processes we killed is empty */ | |
4130 | if (ret >= 0 && !killed && IN_SET(who, KILL_ALL_FAIL, KILL_CONTROL_FAIL, KILL_MAIN_FAIL)) | |
4131 | return sd_bus_error_set_const(ret_error, BUS_ERROR_NO_SUCH_PROCESS, "No matching processes to kill"); | |
4132 | ||
4133 | return ret; | |
4134 | } | |
4135 | ||
4136 | int unit_following_set(Unit *u, Set **s) { | |
4137 | assert(u); | |
4138 | assert(s); | |
4139 | ||
4140 | if (UNIT_VTABLE(u)->following_set) | |
4141 | return UNIT_VTABLE(u)->following_set(u, s); | |
4142 | ||
4143 | *s = NULL; | |
4144 | return 0; | |
4145 | } | |
4146 | ||
4147 | UnitFileState unit_get_unit_file_state(Unit *u) { | |
4148 | int r; | |
4149 | ||
4150 | assert(u); | |
4151 | ||
4152 | if (u->unit_file_state < 0 && u->fragment_path) { | |
4153 | r = unit_file_get_state( | |
4154 | u->manager->runtime_scope, | |
4155 | NULL, | |
4156 | u->id, | |
4157 | &u->unit_file_state); | |
4158 | if (r < 0) | |
4159 | u->unit_file_state = UNIT_FILE_BAD; | |
4160 | } | |
4161 | ||
4162 | return u->unit_file_state; | |
4163 | } | |
4164 | ||
4165 | PresetAction unit_get_unit_file_preset(Unit *u) { | |
4166 | int r; | |
4167 | ||
4168 | assert(u); | |
4169 | ||
4170 | if (u->unit_file_preset < 0 && u->fragment_path) { | |
4171 | _cleanup_free_ char *bn = NULL; | |
4172 | ||
4173 | r = path_extract_filename(u->fragment_path, &bn); | |
4174 | if (r < 0) | |
4175 | return (u->unit_file_preset = r); | |
4176 | ||
4177 | if (r == O_DIRECTORY) | |
4178 | return (u->unit_file_preset = -EISDIR); | |
4179 | ||
4180 | u->unit_file_preset = unit_file_query_preset( | |
4181 | u->manager->runtime_scope, | |
4182 | NULL, | |
4183 | bn, | |
4184 | NULL); | |
4185 | } | |
4186 | ||
4187 | return u->unit_file_preset; | |
4188 | } | |
4189 | ||
4190 | Unit* unit_ref_set(UnitRef *ref, Unit *source, Unit *target) { | |
4191 | assert(ref); | |
4192 | assert(source); | |
4193 | assert(target); | |
4194 | ||
4195 | if (ref->target) | |
4196 | unit_ref_unset(ref); | |
4197 | ||
4198 | ref->source = source; | |
4199 | ref->target = target; | |
4200 | LIST_PREPEND(refs_by_target, target->refs_by_target, ref); | |
4201 | return target; | |
4202 | } | |
4203 | ||
4204 | void unit_ref_unset(UnitRef *ref) { | |
4205 | assert(ref); | |
4206 | ||
4207 | if (!ref->target) | |
4208 | return; | |
4209 | ||
4210 | /* We are about to drop a reference to the unit, make sure the garbage collection has a look at it as it might | |
4211 | * be unreferenced now. */ | |
4212 | unit_add_to_gc_queue(ref->target); | |
4213 | ||
4214 | LIST_REMOVE(refs_by_target, ref->target->refs_by_target, ref); | |
4215 | ref->source = ref->target = NULL; | |
4216 | } | |
4217 | ||
4218 | static int user_from_unit_name(Unit *u, char **ret) { | |
4219 | ||
4220 | static const uint8_t hash_key[] = { | |
4221 | 0x58, 0x1a, 0xaf, 0xe6, 0x28, 0x58, 0x4e, 0x96, | |
4222 | 0xb4, 0x4e, 0xf5, 0x3b, 0x8c, 0x92, 0x07, 0xec | |
4223 | }; | |
4224 | ||
4225 | _cleanup_free_ char *n = NULL; | |
4226 | int r; | |
4227 | ||
4228 | r = unit_name_to_prefix(u->id, &n); | |
4229 | if (r < 0) | |
4230 | return r; | |
4231 | ||
4232 | if (valid_user_group_name(n, 0)) { | |
4233 | *ret = TAKE_PTR(n); | |
4234 | return 0; | |
4235 | } | |
4236 | ||
4237 | /* If we can't use the unit name as a user name, then let's hash it and use that */ | |
4238 | if (asprintf(ret, "_du%016" PRIx64, siphash24(n, strlen(n), hash_key)) < 0) | |
4239 | return -ENOMEM; | |
4240 | ||
4241 | return 0; | |
4242 | } | |
4243 | ||
4244 | int unit_patch_contexts(Unit *u) { | |
4245 | CGroupContext *cc; | |
4246 | ExecContext *ec; | |
4247 | int r; | |
4248 | ||
4249 | assert(u); | |
4250 | ||
4251 | /* Patch in the manager defaults into the exec and cgroup | |
4252 | * contexts, _after_ the rest of the settings have been | |
4253 | * initialized */ | |
4254 | ||
4255 | ec = unit_get_exec_context(u); | |
4256 | if (ec) { | |
4257 | /* This only copies in the ones that need memory */ | |
4258 | for (unsigned i = 0; i < _RLIMIT_MAX; i++) | |
4259 | if (u->manager->defaults.rlimit[i] && !ec->rlimit[i]) { | |
4260 | ec->rlimit[i] = newdup(struct rlimit, u->manager->defaults.rlimit[i], 1); | |
4261 | if (!ec->rlimit[i]) | |
4262 | return -ENOMEM; | |
4263 | } | |
4264 | ||
4265 | if (MANAGER_IS_USER(u->manager) && | |
4266 | !ec->working_directory) { | |
4267 | ||
4268 | r = get_home_dir(&ec->working_directory); | |
4269 | if (r < 0) | |
4270 | return r; | |
4271 | ||
4272 | /* Allow user services to run, even if the | |
4273 | * home directory is missing */ | |
4274 | ec->working_directory_missing_ok = true; | |
4275 | } | |
4276 | ||
4277 | if (ec->private_devices) | |
4278 | ec->capability_bounding_set &= ~((UINT64_C(1) << CAP_MKNOD) | (UINT64_C(1) << CAP_SYS_RAWIO)); | |
4279 | ||
4280 | if (ec->protect_kernel_modules) | |
4281 | ec->capability_bounding_set &= ~(UINT64_C(1) << CAP_SYS_MODULE); | |
4282 | ||
4283 | if (ec->protect_kernel_logs) | |
4284 | ec->capability_bounding_set &= ~(UINT64_C(1) << CAP_SYSLOG); | |
4285 | ||
4286 | if (ec->protect_clock) | |
4287 | ec->capability_bounding_set &= ~((UINT64_C(1) << CAP_SYS_TIME) | (UINT64_C(1) << CAP_WAKE_ALARM)); | |
4288 | ||
4289 | if (ec->dynamic_user) { | |
4290 | if (!ec->user) { | |
4291 | r = user_from_unit_name(u, &ec->user); | |
4292 | if (r < 0) | |
4293 | return r; | |
4294 | } | |
4295 | ||
4296 | if (!ec->group) { | |
4297 | ec->group = strdup(ec->user); | |
4298 | if (!ec->group) | |
4299 | return -ENOMEM; | |
4300 | } | |
4301 | ||
4302 | /* If the dynamic user option is on, let's make sure that the unit can't leave its | |
4303 | * UID/GID around in the file system or on IPC objects. Hence enforce a strict | |
4304 | * sandbox. */ | |
4305 | ||
4306 | ec->private_tmp = true; | |
4307 | ec->remove_ipc = true; | |
4308 | ec->protect_system = PROTECT_SYSTEM_STRICT; | |
4309 | if (ec->protect_home == PROTECT_HOME_NO) | |
4310 | ec->protect_home = PROTECT_HOME_READ_ONLY; | |
4311 | ||
4312 | /* Make sure this service can neither benefit from SUID/SGID binaries nor create | |
4313 | * them. */ | |
4314 | ec->no_new_privileges = true; | |
4315 | ec->restrict_suid_sgid = true; | |
4316 | } | |
4317 | ||
4318 | for (ExecDirectoryType dt = 0; dt < _EXEC_DIRECTORY_TYPE_MAX; dt++) | |
4319 | exec_directory_sort(ec->directories + dt); | |
4320 | } | |
4321 | ||
4322 | cc = unit_get_cgroup_context(u); | |
4323 | if (cc && ec) { | |
4324 | ||
4325 | if (ec->private_devices && | |
4326 | cc->device_policy == CGROUP_DEVICE_POLICY_AUTO) | |
4327 | cc->device_policy = CGROUP_DEVICE_POLICY_CLOSED; | |
4328 | ||
4329 | /* Only add these if needed, as they imply that everything else is blocked. */ | |
4330 | if (cc->device_policy != CGROUP_DEVICE_POLICY_AUTO || cc->device_allow) { | |
4331 | if (ec->root_image || ec->mount_images) { | |
4332 | ||
4333 | /* When RootImage= or MountImages= is specified, the following devices are touched. */ | |
4334 | FOREACH_STRING(p, "/dev/loop-control", "/dev/mapper/control") { | |
4335 | r = cgroup_context_add_device_allow(cc, p, CGROUP_DEVICE_READ|CGROUP_DEVICE_WRITE); | |
4336 | if (r < 0) | |
4337 | return r; | |
4338 | } | |
4339 | FOREACH_STRING(p, "block-loop", "block-blkext", "block-device-mapper") { | |
4340 | r = cgroup_context_add_device_allow(cc, p, CGROUP_DEVICE_READ|CGROUP_DEVICE_WRITE|CGROUP_DEVICE_MKNOD); | |
4341 | if (r < 0) | |
4342 | return r; | |
4343 | } | |
4344 | ||
4345 | /* Make sure "block-loop" can be resolved, i.e. make sure "loop" shows up in /proc/devices. | |
4346 | * Same for mapper and verity. */ | |
4347 | FOREACH_STRING(p, "modprobe@loop.service", "modprobe@dm_mod.service", "modprobe@dm_verity.service") { | |
4348 | r = unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_WANTS, p, true, UNIT_DEPENDENCY_FILE); | |
4349 | if (r < 0) | |
4350 | return r; | |
4351 | } | |
4352 | } | |
4353 | ||
4354 | if (ec->protect_clock) { | |
4355 | r = cgroup_context_add_device_allow(cc, "char-rtc", CGROUP_DEVICE_READ); | |
4356 | if (r < 0) | |
4357 | return r; | |
4358 | } | |
4359 | ||
4360 | /* If there are encrypted credentials we might need to access the TPM. */ | |
4361 | if (exec_context_has_encrypted_credentials(ec)) { | |
4362 | r = cgroup_context_add_device_allow(cc, "char-tpm", CGROUP_DEVICE_READ|CGROUP_DEVICE_WRITE); | |
4363 | if (r < 0) | |
4364 | return r; | |
4365 | } | |
4366 | } | |
4367 | } | |
4368 | ||
4369 | return 0; | |
4370 | } | |
4371 | ||
4372 | ExecContext *unit_get_exec_context(const Unit *u) { | |
4373 | size_t offset; | |
4374 | assert(u); | |
4375 | ||
4376 | if (u->type < 0) | |
4377 | return NULL; | |
4378 | ||
4379 | offset = UNIT_VTABLE(u)->exec_context_offset; | |
4380 | if (offset <= 0) | |
4381 | return NULL; | |
4382 | ||
4383 | return (ExecContext*) ((uint8_t*) u + offset); | |
4384 | } | |
4385 | ||
4386 | KillContext *unit_get_kill_context(Unit *u) { | |
4387 | size_t offset; | |
4388 | assert(u); | |
4389 | ||
4390 | if (u->type < 0) | |
4391 | return NULL; | |
4392 | ||
4393 | offset = UNIT_VTABLE(u)->kill_context_offset; | |
4394 | if (offset <= 0) | |
4395 | return NULL; | |
4396 | ||
4397 | return (KillContext*) ((uint8_t*) u + offset); | |
4398 | } | |
4399 | ||
4400 | CGroupContext *unit_get_cgroup_context(Unit *u) { | |
4401 | size_t offset; | |
4402 | ||
4403 | if (u->type < 0) | |
4404 | return NULL; | |
4405 | ||
4406 | offset = UNIT_VTABLE(u)->cgroup_context_offset; | |
4407 | if (offset <= 0) | |
4408 | return NULL; | |
4409 | ||
4410 | return (CGroupContext*) ((uint8_t*) u + offset); | |
4411 | } | |
4412 | ||
4413 | ExecRuntime *unit_get_exec_runtime(Unit *u) { | |
4414 | size_t offset; | |
4415 | ||
4416 | if (u->type < 0) | |
4417 | return NULL; | |
4418 | ||
4419 | offset = UNIT_VTABLE(u)->exec_runtime_offset; | |
4420 | if (offset <= 0) | |
4421 | return NULL; | |
4422 | ||
4423 | return *(ExecRuntime**) ((uint8_t*) u + offset); | |
4424 | } | |
4425 | ||
4426 | static const char* unit_drop_in_dir(Unit *u, UnitWriteFlags flags) { | |
4427 | assert(u); | |
4428 | ||
4429 | if (UNIT_WRITE_FLAGS_NOOP(flags)) | |
4430 | return NULL; | |
4431 | ||
4432 | if (u->transient) /* Redirect drop-ins for transient units always into the transient directory. */ | |
4433 | return u->manager->lookup_paths.transient; | |
4434 | ||
4435 | if (flags & UNIT_PERSISTENT) | |
4436 | return u->manager->lookup_paths.persistent_control; | |
4437 | ||
4438 | if (flags & UNIT_RUNTIME) | |
4439 | return u->manager->lookup_paths.runtime_control; | |
4440 | ||
4441 | return NULL; | |
4442 | } | |
4443 | ||
4444 | const char* unit_escape_setting(const char *s, UnitWriteFlags flags, char **buf) { | |
4445 | assert(s); | |
4446 | assert(popcount(flags & (UNIT_ESCAPE_EXEC_SYNTAX_ENV | UNIT_ESCAPE_EXEC_SYNTAX | UNIT_ESCAPE_C)) <= 1); | |
4447 | assert(buf); | |
4448 | ||
4449 | _cleanup_free_ char *t = NULL; | |
4450 | ||
4451 | /* Returns a string with any escaping done. If no escaping was necessary, *buf is set to NULL, and | |
4452 | * the input pointer is returned as-is. If an allocation was needed, the return buffer pointer is | |
4453 | * written to *buf. This means the return value always contains a properly escaped version, but *buf | |
4454 | * only contains a pointer if an allocation was made. Callers can use this to optimize memory | |
4455 | * allocations. */ | |
4456 | ||
4457 | if (flags & UNIT_ESCAPE_SPECIFIERS) { | |
4458 | t = specifier_escape(s); | |
4459 | if (!t) | |
4460 | return NULL; | |
4461 | ||
4462 | s = t; | |
4463 | } | |
4464 | ||
4465 | /* We either do C-escaping or shell-escaping, to additionally escape characters that we parse for | |
4466 | * ExecStart= and friends, i.e. '$' and quotes. */ | |
4467 | ||
4468 | if (flags & (UNIT_ESCAPE_EXEC_SYNTAX_ENV | UNIT_ESCAPE_EXEC_SYNTAX)) { | |
4469 | char *t2; | |
4470 | ||
4471 | if (flags & UNIT_ESCAPE_EXEC_SYNTAX_ENV) { | |
4472 | t2 = strreplace(s, "$", "$$"); | |
4473 | if (!t2) | |
4474 | return NULL; | |
4475 | free_and_replace(t, t2); | |
4476 | } | |
4477 | ||
4478 | t2 = shell_escape(t ?: s, "\""); | |
4479 | if (!t2) | |
4480 | return NULL; | |
4481 | free_and_replace(t, t2); | |
4482 | ||
4483 | s = t; | |
4484 | ||
4485 | } else if (flags & UNIT_ESCAPE_C) { | |
4486 | char *t2; | |
4487 | ||
4488 | t2 = cescape(s); | |
4489 | if (!t2) | |
4490 | return NULL; | |
4491 | free_and_replace(t, t2); | |
4492 | ||
4493 | s = t; | |
4494 | } | |
4495 | ||
4496 | *buf = TAKE_PTR(t); | |
4497 | return s; | |
4498 | } | |
4499 | ||
4500 | char* unit_concat_strv(char **l, UnitWriteFlags flags) { | |
4501 | _cleanup_free_ char *result = NULL; | |
4502 | size_t n = 0; | |
4503 | ||
4504 | /* Takes a list of strings, escapes them, and concatenates them. This may be used to format command | |
4505 | * lines in a way suitable for ExecStart= stanzas. */ | |
4506 | ||
4507 | STRV_FOREACH(i, l) { | |
4508 | _cleanup_free_ char *buf = NULL; | |
4509 | const char *p; | |
4510 | size_t a; | |
4511 | char *q; | |
4512 | ||
4513 | p = unit_escape_setting(*i, flags, &buf); | |
4514 | if (!p) | |
4515 | return NULL; | |
4516 | ||
4517 | a = (n > 0) + 1 + strlen(p) + 1; /* separating space + " + entry + " */ | |
4518 | if (!GREEDY_REALLOC(result, n + a + 1)) | |
4519 | return NULL; | |
4520 | ||
4521 | q = result + n; | |
4522 | if (n > 0) | |
4523 | *(q++) = ' '; | |
4524 | ||
4525 | *(q++) = '"'; | |
4526 | q = stpcpy(q, p); | |
4527 | *(q++) = '"'; | |
4528 | ||
4529 | n += a; | |
4530 | } | |
4531 | ||
4532 | if (!GREEDY_REALLOC(result, n + 1)) | |
4533 | return NULL; | |
4534 | ||
4535 | result[n] = 0; | |
4536 | ||
4537 | return TAKE_PTR(result); | |
4538 | } | |
4539 | ||
4540 | int unit_write_setting(Unit *u, UnitWriteFlags flags, const char *name, const char *data) { | |
4541 | _cleanup_free_ char *p = NULL, *q = NULL, *escaped = NULL; | |
4542 | const char *dir, *wrapped; | |
4543 | int r; | |
4544 | ||
4545 | assert(u); | |
4546 | assert(name); | |
4547 | assert(data); | |
4548 | ||
4549 | if (UNIT_WRITE_FLAGS_NOOP(flags)) | |
4550 | return 0; | |
4551 | ||
4552 | data = unit_escape_setting(data, flags, &escaped); | |
4553 | if (!data) | |
4554 | return -ENOMEM; | |
4555 | ||
4556 | /* Prefix the section header. If we are writing this out as transient file, then let's suppress this if the | |
4557 | * previous section header is the same */ | |
4558 | ||
4559 | if (flags & UNIT_PRIVATE) { | |
4560 | if (!UNIT_VTABLE(u)->private_section) | |
4561 | return -EINVAL; | |
4562 | ||
4563 | if (!u->transient_file || u->last_section_private < 0) | |
4564 | data = strjoina("[", UNIT_VTABLE(u)->private_section, "]\n", data); | |
4565 | else if (u->last_section_private == 0) | |
4566 | data = strjoina("\n[", UNIT_VTABLE(u)->private_section, "]\n", data); | |
4567 | } else { | |
4568 | if (!u->transient_file || u->last_section_private < 0) | |
4569 | data = strjoina("[Unit]\n", data); | |
4570 | else if (u->last_section_private > 0) | |
4571 | data = strjoina("\n[Unit]\n", data); | |
4572 | } | |
4573 | ||
4574 | if (u->transient_file) { | |
4575 | /* When this is a transient unit file in creation, then let's not create a new drop-in but instead | |
4576 | * write to the transient unit file. */ | |
4577 | fputs(data, u->transient_file); | |
4578 | ||
4579 | if (!endswith(data, "\n")) | |
4580 | fputc('\n', u->transient_file); | |
4581 | ||
4582 | /* Remember which section we wrote this entry to */ | |
4583 | u->last_section_private = !!(flags & UNIT_PRIVATE); | |
4584 | return 0; | |
4585 | } | |
4586 | ||
4587 | dir = unit_drop_in_dir(u, flags); | |
4588 | if (!dir) | |
4589 | return -EINVAL; | |
4590 | ||
4591 | wrapped = strjoina("# This is a drop-in unit file extension, created via \"systemctl set-property\"\n" | |
4592 | "# or an equivalent operation. Do not edit.\n", | |
4593 | data, | |
4594 | "\n"); | |
4595 | ||
4596 | r = drop_in_file(dir, u->id, 50, name, &p, &q); | |
4597 | if (r < 0) | |
4598 | return r; | |
4599 | ||
4600 | (void) mkdir_p_label(p, 0755); | |
4601 | ||
4602 | /* Make sure the drop-in dir is registered in our path cache. This way we don't need to stupidly | |
4603 | * recreate the cache after every drop-in we write. */ | |
4604 | if (u->manager->unit_path_cache) { | |
4605 | r = set_put_strdup(&u->manager->unit_path_cache, p); | |
4606 | if (r < 0) | |
4607 | return r; | |
4608 | } | |
4609 | ||
4610 | r = write_string_file_atomic_label(q, wrapped); | |
4611 | if (r < 0) | |
4612 | return r; | |
4613 | ||
4614 | r = strv_push(&u->dropin_paths, q); | |
4615 | if (r < 0) | |
4616 | return r; | |
4617 | q = NULL; | |
4618 | ||
4619 | strv_uniq(u->dropin_paths); | |
4620 | ||
4621 | u->dropin_mtime = now(CLOCK_REALTIME); | |
4622 | ||
4623 | return 0; | |
4624 | } | |
4625 | ||
4626 | int unit_write_settingf(Unit *u, UnitWriteFlags flags, const char *name, const char *format, ...) { | |
4627 | _cleanup_free_ char *p = NULL; | |
4628 | va_list ap; | |
4629 | int r; | |
4630 | ||
4631 | assert(u); | |
4632 | assert(name); | |
4633 | assert(format); | |
4634 | ||
4635 | if (UNIT_WRITE_FLAGS_NOOP(flags)) | |
4636 | return 0; | |
4637 | ||
4638 | va_start(ap, format); | |
4639 | r = vasprintf(&p, format, ap); | |
4640 | va_end(ap); | |
4641 | ||
4642 | if (r < 0) | |
4643 | return -ENOMEM; | |
4644 | ||
4645 | return unit_write_setting(u, flags, name, p); | |
4646 | } | |
4647 | ||
4648 | int unit_make_transient(Unit *u) { | |
4649 | _cleanup_free_ char *path = NULL; | |
4650 | FILE *f; | |
4651 | ||
4652 | assert(u); | |
4653 | ||
4654 | if (!UNIT_VTABLE(u)->can_transient) | |
4655 | return -EOPNOTSUPP; | |
4656 | ||
4657 | (void) mkdir_p_label(u->manager->lookup_paths.transient, 0755); | |
4658 | ||
4659 | path = path_join(u->manager->lookup_paths.transient, u->id); | |
4660 | if (!path) | |
4661 | return -ENOMEM; | |
4662 | ||
4663 | /* Let's open the file we'll write the transient settings into. This file is kept open as long as we are | |
4664 | * creating the transient, and is closed in unit_load(), as soon as we start loading the file. */ | |
4665 | ||
4666 | WITH_UMASK(0022) { | |
4667 | f = fopen(path, "we"); | |
4668 | if (!f) | |
4669 | return -errno; | |
4670 | } | |
4671 | ||
4672 | safe_fclose(u->transient_file); | |
4673 | u->transient_file = f; | |
4674 | ||
4675 | free_and_replace(u->fragment_path, path); | |
4676 | ||
4677 | u->source_path = mfree(u->source_path); | |
4678 | u->dropin_paths = strv_free(u->dropin_paths); | |
4679 | u->fragment_mtime = u->source_mtime = u->dropin_mtime = 0; | |
4680 | ||
4681 | u->load_state = UNIT_STUB; | |
4682 | u->load_error = 0; | |
4683 | u->transient = true; | |
4684 | ||
4685 | unit_add_to_dbus_queue(u); | |
4686 | unit_add_to_gc_queue(u); | |
4687 | ||
4688 | fputs("# This is a transient unit file, created programmatically via the systemd API. Do not edit.\n", | |
4689 | u->transient_file); | |
4690 | ||
4691 | return 0; | |
4692 | } | |
4693 | ||
4694 | static int log_kill(const PidRef *pid, int sig, void *userdata) { | |
4695 | _cleanup_free_ char *comm = NULL; | |
4696 | ||
4697 | assert(pidref_is_set(pid)); | |
4698 | ||
4699 | (void) pidref_get_comm(pid, &comm); | |
4700 | ||
4701 | /* Don't log about processes marked with brackets, under the assumption that these are temporary processes | |
4702 | only, like for example systemd's own PAM stub process. */ | |
4703 | if (comm && comm[0] == '(') | |
4704 | /* Although we didn't log anything, as this callback is used in unit_kill_context we must return 1 | |
4705 | * here to let the manager know that a process was killed. */ | |
4706 | return 1; | |
4707 | ||
4708 | log_unit_notice(userdata, | |
4709 | "Killing process " PID_FMT " (%s) with signal SIG%s.", | |
4710 | pid->pid, | |
4711 | strna(comm), | |
4712 | signal_to_string(sig)); | |
4713 | ||
4714 | return 1; | |
4715 | } | |
4716 | ||
4717 | static int operation_to_signal( | |
4718 | const KillContext *c, | |
4719 | KillOperation k, | |
4720 | bool *ret_noteworthy) { | |
4721 | ||
4722 | assert(c); | |
4723 | ||
4724 | switch (k) { | |
4725 | ||
4726 | case KILL_TERMINATE: | |
4727 | case KILL_TERMINATE_AND_LOG: | |
4728 | *ret_noteworthy = false; | |
4729 | return c->kill_signal; | |
4730 | ||
4731 | case KILL_RESTART: | |
4732 | *ret_noteworthy = false; | |
4733 | return restart_kill_signal(c); | |
4734 | ||
4735 | case KILL_KILL: | |
4736 | *ret_noteworthy = true; | |
4737 | return c->final_kill_signal; | |
4738 | ||
4739 | case KILL_WATCHDOG: | |
4740 | *ret_noteworthy = true; | |
4741 | return c->watchdog_signal; | |
4742 | ||
4743 | default: | |
4744 | assert_not_reached(); | |
4745 | } | |
4746 | } | |
4747 | ||
4748 | static int unit_kill_context_one( | |
4749 | Unit *u, | |
4750 | const PidRef *pidref, | |
4751 | const char *type, | |
4752 | bool is_alien, | |
4753 | int sig, | |
4754 | bool send_sighup, | |
4755 | cg_kill_log_func_t log_func) { | |
4756 | ||
4757 | int r; | |
4758 | ||
4759 | assert(u); | |
4760 | assert(type); | |
4761 | ||
4762 | /* This returns > 0 if it makes sense to wait for SIGCHLD for the process, == 0 if not. */ | |
4763 | ||
4764 | if (!pidref_is_set(pidref)) | |
4765 | return 0; | |
4766 | ||
4767 | if (log_func) | |
4768 | log_func(pidref, sig, u); | |
4769 | ||
4770 | r = pidref_kill_and_sigcont(pidref, sig); | |
4771 | if (r == -ESRCH) | |
4772 | return !is_alien; | |
4773 | if (r < 0) { | |
4774 | _cleanup_free_ char *comm = NULL; | |
4775 | ||
4776 | (void) pidref_get_comm(pidref, &comm); | |
4777 | return log_unit_warning_errno(u, r, "Failed to kill %s process " PID_FMT " (%s), ignoring: %m", type, pidref->pid, strna(comm)); | |
4778 | } | |
4779 | ||
4780 | if (send_sighup) | |
4781 | (void) pidref_kill(pidref, SIGHUP); | |
4782 | ||
4783 | return !is_alien; | |
4784 | } | |
4785 | ||
4786 | int unit_kill_context(Unit *u, KillOperation k) { | |
4787 | bool wait_for_exit = false, send_sighup; | |
4788 | cg_kill_log_func_t log_func = NULL; | |
4789 | int sig, r; | |
4790 | ||
4791 | assert(u); | |
4792 | ||
4793 | /* Kill the processes belonging to this unit, in preparation for shutting the unit down. Returns > 0 | |
4794 | * if we killed something worth waiting for, 0 otherwise. Do not confuse with unit_kill_common() | |
4795 | * which is used for user-requested killing of unit processes. */ | |
4796 | ||
4797 | KillContext *c = unit_get_kill_context(u); | |
4798 | if (!c || c->kill_mode == KILL_NONE) | |
4799 | return 0; | |
4800 | ||
4801 | bool noteworthy; | |
4802 | sig = operation_to_signal(c, k, ¬eworthy); | |
4803 | if (noteworthy) | |
4804 | log_func = log_kill; | |
4805 | ||
4806 | send_sighup = | |
4807 | c->send_sighup && | |
4808 | IN_SET(k, KILL_TERMINATE, KILL_TERMINATE_AND_LOG) && | |
4809 | sig != SIGHUP; | |
4810 | ||
4811 | bool is_alien; | |
4812 | PidRef *main_pid = unit_main_pid_full(u, &is_alien); | |
4813 | r = unit_kill_context_one(u, main_pid, "main", is_alien, sig, send_sighup, log_func); | |
4814 | wait_for_exit = wait_for_exit || r > 0; | |
4815 | ||
4816 | r = unit_kill_context_one(u, unit_control_pid(u), "control", /* is_alien = */ false, sig, send_sighup, log_func); | |
4817 | wait_for_exit = wait_for_exit || r > 0; | |
4818 | ||
4819 | if (u->cgroup_path && | |
4820 | (c->kill_mode == KILL_CONTROL_GROUP || (c->kill_mode == KILL_MIXED && k == KILL_KILL))) { | |
4821 | _cleanup_set_free_ Set *pid_set = NULL; | |
4822 | ||
4823 | /* Exclude the main/control pids from being killed via the cgroup */ | |
4824 | r = unit_pid_set(u, &pid_set); | |
4825 | if (r < 0) | |
4826 | return r; | |
4827 | ||
4828 | r = cg_kill_recursive( | |
4829 | u->cgroup_path, | |
4830 | sig, | |
4831 | CGROUP_SIGCONT|CGROUP_IGNORE_SELF, | |
4832 | pid_set, | |
4833 | log_func, u); | |
4834 | if (r < 0) { | |
4835 | if (!IN_SET(r, -EAGAIN, -ESRCH, -ENOENT)) | |
4836 | log_unit_warning_errno(u, r, "Failed to kill control group %s, ignoring: %m", empty_to_root(u->cgroup_path)); | |
4837 | ||
4838 | } else if (r > 0) { | |
4839 | ||
4840 | /* FIXME: For now, on the legacy hierarchy, we will not wait for the cgroup members to die if | |
4841 | * we are running in a container or if this is a delegation unit, simply because cgroup | |
4842 | * notification is unreliable in these cases. It doesn't work at all in containers, and outside | |
4843 | * of containers it can be confused easily by left-over directories in the cgroup — which | |
4844 | * however should not exist in non-delegated units. On the unified hierarchy that's different, | |
4845 | * there we get proper events. Hence rely on them. */ | |
4846 | ||
4847 | if (cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER) > 0 || | |
4848 | (detect_container() == 0 && !unit_cgroup_delegate(u))) | |
4849 | wait_for_exit = true; | |
4850 | ||
4851 | if (send_sighup) { | |
4852 | r = unit_pid_set(u, &pid_set); | |
4853 | if (r < 0) | |
4854 | return r; | |
4855 | ||
4856 | (void) cg_kill_recursive( | |
4857 | u->cgroup_path, | |
4858 | SIGHUP, | |
4859 | CGROUP_IGNORE_SELF, | |
4860 | pid_set, | |
4861 | /* kill_log= */ NULL, | |
4862 | /* userdata= */ NULL); | |
4863 | } | |
4864 | } | |
4865 | } | |
4866 | ||
4867 | return wait_for_exit; | |
4868 | } | |
4869 | ||
4870 | int unit_add_mounts_for(Unit *u, const char *path, UnitDependencyMask mask, UnitMountDependencyType type) { | |
4871 | Hashmap **unit_map, **manager_map; | |
4872 | int r; | |
4873 | ||
4874 | assert(u); | |
4875 | assert(path); | |
4876 | assert(type >= 0 && type < _UNIT_MOUNT_DEPENDENCY_TYPE_MAX); | |
4877 | ||
4878 | unit_map = &u->mounts_for[type]; | |
4879 | manager_map = &u->manager->units_needing_mounts_for[type]; | |
4880 | ||
4881 | /* Registers a unit for requiring a certain path and all its prefixes. We keep a hashtable of these | |
4882 | * paths in the unit (from the path to the UnitDependencyInfo structure indicating how to the | |
4883 | * dependency came to be). However, we build a prefix table for all possible prefixes so that new | |
4884 | * appearing mount units can easily determine which units to make themselves a dependency of. */ | |
4885 | ||
4886 | if (!path_is_absolute(path)) | |
4887 | return -EINVAL; | |
4888 | ||
4889 | if (hashmap_contains(*unit_map, path)) /* Exit quickly if the path is already covered. */ | |
4890 | return 0; | |
4891 | ||
4892 | /* Use the canonical form of the path as the stored key. We call path_is_normalized() | |
4893 | * only after simplification, since path_is_normalized() rejects paths with '.'. | |
4894 | * path_is_normalized() also verifies that the path fits in PATH_MAX. */ | |
4895 | _cleanup_free_ char *p = NULL; | |
4896 | r = path_simplify_alloc(path, &p); | |
4897 | if (r < 0) | |
4898 | return r; | |
4899 | path = p; | |
4900 | ||
4901 | if (!path_is_normalized(path)) | |
4902 | return -EPERM; | |
4903 | ||
4904 | UnitDependencyInfo di = { | |
4905 | .origin_mask = mask | |
4906 | }; | |
4907 | ||
4908 | r = hashmap_ensure_put(unit_map, &path_hash_ops, p, di.data); | |
4909 | if (r < 0) | |
4910 | return r; | |
4911 | assert(r > 0); | |
4912 | TAKE_PTR(p); /* path remains a valid pointer to the string stored in the hashmap */ | |
4913 | ||
4914 | char prefix[strlen(path) + 1]; | |
4915 | PATH_FOREACH_PREFIX_MORE(prefix, path) { | |
4916 | Set *x; | |
4917 | ||
4918 | x = hashmap_get(*manager_map, prefix); | |
4919 | if (!x) { | |
4920 | _cleanup_free_ char *q = NULL; | |
4921 | ||
4922 | r = hashmap_ensure_allocated(manager_map, &path_hash_ops); | |
4923 | if (r < 0) | |
4924 | return r; | |
4925 | ||
4926 | q = strdup(prefix); | |
4927 | if (!q) | |
4928 | return -ENOMEM; | |
4929 | ||
4930 | x = set_new(NULL); | |
4931 | if (!x) | |
4932 | return -ENOMEM; | |
4933 | ||
4934 | r = hashmap_put(*manager_map, q, x); | |
4935 | if (r < 0) { | |
4936 | set_free(x); | |
4937 | return r; | |
4938 | } | |
4939 | q = NULL; | |
4940 | } | |
4941 | ||
4942 | r = set_put(x, u); | |
4943 | if (r < 0) | |
4944 | return r; | |
4945 | } | |
4946 | ||
4947 | return 0; | |
4948 | } | |
4949 | ||
4950 | int unit_setup_exec_runtime(Unit *u) { | |
4951 | _cleanup_(exec_shared_runtime_unrefp) ExecSharedRuntime *esr = NULL; | |
4952 | _cleanup_(dynamic_creds_unrefp) DynamicCreds *dcreds = NULL; | |
4953 | _cleanup_set_free_ Set *units = NULL; | |
4954 | ExecRuntime **rt; | |
4955 | ExecContext *ec; | |
4956 | size_t offset; | |
4957 | Unit *other; | |
4958 | int r; | |
4959 | ||
4960 | offset = UNIT_VTABLE(u)->exec_runtime_offset; | |
4961 | assert(offset > 0); | |
4962 | ||
4963 | /* Check if there already is an ExecRuntime for this unit? */ | |
4964 | rt = (ExecRuntime**) ((uint8_t*) u + offset); | |
4965 | if (*rt) | |
4966 | return 0; | |
4967 | ||
4968 | ec = unit_get_exec_context(u); | |
4969 | assert(ec); | |
4970 | ||
4971 | r = unit_get_transitive_dependency_set(u, UNIT_ATOM_JOINS_NAMESPACE_OF, &units); | |
4972 | if (r < 0) | |
4973 | return r; | |
4974 | ||
4975 | /* Try to get it from somebody else */ | |
4976 | SET_FOREACH(other, units) { | |
4977 | r = exec_shared_runtime_acquire(u->manager, NULL, other->id, false, &esr); | |
4978 | if (r < 0) | |
4979 | return r; | |
4980 | if (r > 0) | |
4981 | break; | |
4982 | } | |
4983 | ||
4984 | if (!esr) { | |
4985 | r = exec_shared_runtime_acquire(u->manager, ec, u->id, true, &esr); | |
4986 | if (r < 0) | |
4987 | return r; | |
4988 | } | |
4989 | ||
4990 | if (ec->dynamic_user) { | |
4991 | r = dynamic_creds_make(u->manager, ec->user, ec->group, &dcreds); | |
4992 | if (r < 0) | |
4993 | return r; | |
4994 | } | |
4995 | ||
4996 | r = exec_runtime_make(u, ec, esr, dcreds, rt); | |
4997 | if (r < 0) | |
4998 | return r; | |
4999 | ||
5000 | TAKE_PTR(esr); | |
5001 | TAKE_PTR(dcreds); | |
5002 | ||
5003 | return r; | |
5004 | } | |
5005 | ||
5006 | bool unit_type_supported(UnitType t) { | |
5007 | static int8_t cache[_UNIT_TYPE_MAX] = {}; /* -1: disabled, 1: enabled: 0: don't know */ | |
5008 | int r; | |
5009 | ||
5010 | assert(t >= 0 && t < _UNIT_TYPE_MAX); | |
5011 | ||
5012 | if (cache[t] == 0) { | |
5013 | char *e; | |
5014 | ||
5015 | e = strjoina("SYSTEMD_SUPPORT_", unit_type_to_string(t)); | |
5016 | ||
5017 | r = getenv_bool(ascii_strupper(e)); | |
5018 | if (r < 0 && r != -ENXIO) | |
5019 | log_debug_errno(r, "Failed to parse $%s, ignoring: %m", e); | |
5020 | ||
5021 | cache[t] = r == 0 ? -1 : 1; | |
5022 | } | |
5023 | if (cache[t] < 0) | |
5024 | return false; | |
5025 | ||
5026 | if (!unit_vtable[t]->supported) | |
5027 | return true; | |
5028 | ||
5029 | return unit_vtable[t]->supported(); | |
5030 | } | |
5031 | ||
5032 | void unit_warn_if_dir_nonempty(Unit *u, const char* where) { | |
5033 | int r; | |
5034 | ||
5035 | assert(u); | |
5036 | assert(where); | |
5037 | ||
5038 | if (!unit_log_level_test(u, LOG_NOTICE)) | |
5039 | return; | |
5040 | ||
5041 | r = dir_is_empty(where, /* ignore_hidden_or_backup= */ false); | |
5042 | if (r > 0 || r == -ENOTDIR) | |
5043 | return; | |
5044 | if (r < 0) { | |
5045 | log_unit_warning_errno(u, r, "Failed to check directory %s: %m", where); | |
5046 | return; | |
5047 | } | |
5048 | ||
5049 | log_unit_struct(u, LOG_NOTICE, | |
5050 | "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR, | |
5051 | LOG_UNIT_INVOCATION_ID(u), | |
5052 | LOG_UNIT_MESSAGE(u, "Directory %s to mount over is not empty, mounting anyway.", where), | |
5053 | "WHERE=%s", where); | |
5054 | } | |
5055 | ||
5056 | int unit_fail_if_noncanonical(Unit *u, const char* where) { | |
5057 | _cleanup_free_ char *canonical_where = NULL; | |
5058 | int r; | |
5059 | ||
5060 | assert(u); | |
5061 | assert(where); | |
5062 | ||
5063 | r = chase(where, NULL, CHASE_NONEXISTENT, &canonical_where, NULL); | |
5064 | if (r < 0) { | |
5065 | log_unit_debug_errno(u, r, "Failed to check %s for symlinks, ignoring: %m", where); | |
5066 | return 0; | |
5067 | } | |
5068 | ||
5069 | /* We will happily ignore a trailing slash (or any redundant slashes) */ | |
5070 | if (path_equal(where, canonical_where)) | |
5071 | return 0; | |
5072 | ||
5073 | /* No need to mention "." or "..", they would already have been rejected by unit_name_from_path() */ | |
5074 | log_unit_struct(u, LOG_ERR, | |
5075 | "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR, | |
5076 | LOG_UNIT_INVOCATION_ID(u), | |
5077 | LOG_UNIT_MESSAGE(u, "Mount path %s is not canonical (contains a symlink).", where), | |
5078 | "WHERE=%s", where); | |
5079 | ||
5080 | return -ELOOP; | |
5081 | } | |
5082 | ||
5083 | bool unit_is_pristine(Unit *u) { | |
5084 | assert(u); | |
5085 | ||
5086 | /* Check if the unit already exists or is already around, in a number of different ways. Note that to | |
5087 | * cater for unit types such as slice, we are generally fine with units that are marked UNIT_LOADED | |
5088 | * even though nothing was actually loaded, as those unit types don't require a file on disk. | |
5089 | * | |
5090 | * Note that we don't check for drop-ins here, because we allow drop-ins for transient units | |
5091 | * identically to non-transient units, both unit-specific and hierarchical. E.g. for a-b-c.service: | |
5092 | * service.d/….conf, a-.service.d/….conf, a-b-.service.d/….conf, a-b-c.service.d/….conf. | |
5093 | */ | |
5094 | ||
5095 | return IN_SET(u->load_state, UNIT_NOT_FOUND, UNIT_LOADED) && | |
5096 | !u->fragment_path && | |
5097 | !u->source_path && | |
5098 | !u->job && | |
5099 | !u->merged_into; | |
5100 | } | |
5101 | ||
5102 | PidRef* unit_control_pid(Unit *u) { | |
5103 | assert(u); | |
5104 | ||
5105 | if (UNIT_VTABLE(u)->control_pid) | |
5106 | return UNIT_VTABLE(u)->control_pid(u); | |
5107 | ||
5108 | return NULL; | |
5109 | } | |
5110 | ||
5111 | PidRef* unit_main_pid_full(Unit *u, bool *ret_is_alien) { | |
5112 | assert(u); | |
5113 | ||
5114 | if (UNIT_VTABLE(u)->main_pid) | |
5115 | return UNIT_VTABLE(u)->main_pid(u, ret_is_alien); | |
5116 | ||
5117 | if (ret_is_alien) | |
5118 | *ret_is_alien = false; | |
5119 | return NULL; | |
5120 | } | |
5121 | ||
5122 | static void unit_modify_user_nft_set(Unit *u, bool add, NFTSetSource source, uint32_t element) { | |
5123 | int r; | |
5124 | ||
5125 | assert(u); | |
5126 | ||
5127 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
5128 | return; | |
5129 | ||
5130 | CGroupContext *c; | |
5131 | c = unit_get_cgroup_context(u); | |
5132 | if (!c) | |
5133 | return; | |
5134 | ||
5135 | if (!u->manager->fw_ctx) { | |
5136 | r = fw_ctx_new_full(&u->manager->fw_ctx, /* init_tables= */ false); | |
5137 | if (r < 0) | |
5138 | return; | |
5139 | ||
5140 | assert(u->manager->fw_ctx); | |
5141 | } | |
5142 | ||
5143 | FOREACH_ARRAY(nft_set, c->nft_set_context.sets, c->nft_set_context.n_sets) { | |
5144 | if (nft_set->source != source) | |
5145 | continue; | |
5146 | ||
5147 | r = nft_set_element_modify_any(u->manager->fw_ctx, add, nft_set->nfproto, nft_set->table, nft_set->set, &element, sizeof(element)); | |
5148 | if (r < 0) | |
5149 | log_warning_errno(r, "Failed to %s NFT set: family %s, table %s, set %s, ID %u, ignoring: %m", | |
5150 | add? "add" : "delete", nfproto_to_string(nft_set->nfproto), nft_set->table, nft_set->set, element); | |
5151 | else | |
5152 | log_debug("%s NFT set: family %s, table %s, set %s, ID %u", | |
5153 | add? "Added" : "Deleted", nfproto_to_string(nft_set->nfproto), nft_set->table, nft_set->set, element); | |
5154 | } | |
5155 | } | |
5156 | ||
5157 | static void unit_unref_uid_internal( | |
5158 | Unit *u, | |
5159 | uid_t *ref_uid, | |
5160 | bool destroy_now, | |
5161 | void (*_manager_unref_uid)(Manager *m, uid_t uid, bool destroy_now)) { | |
5162 | ||
5163 | assert(u); | |
5164 | assert(ref_uid); | |
5165 | assert(_manager_unref_uid); | |
5166 | ||
5167 | /* Generic implementation of both unit_unref_uid() and unit_unref_gid(), under the assumption that uid_t and | |
5168 | * gid_t are actually the same time, with the same validity rules. | |
5169 | * | |
5170 | * Drops a reference to UID/GID from a unit. */ | |
5171 | ||
5172 | assert_cc(sizeof(uid_t) == sizeof(gid_t)); | |
5173 | assert_cc(UID_INVALID == (uid_t) GID_INVALID); | |
5174 | ||
5175 | if (!uid_is_valid(*ref_uid)) | |
5176 | return; | |
5177 | ||
5178 | _manager_unref_uid(u->manager, *ref_uid, destroy_now); | |
5179 | *ref_uid = UID_INVALID; | |
5180 | } | |
5181 | ||
5182 | static void unit_unref_uid(Unit *u, bool destroy_now) { | |
5183 | assert(u); | |
5184 | ||
5185 | unit_modify_user_nft_set(u, /* add = */ false, NFT_SET_SOURCE_USER, u->ref_uid); | |
5186 | ||
5187 | unit_unref_uid_internal(u, &u->ref_uid, destroy_now, manager_unref_uid); | |
5188 | } | |
5189 | ||
5190 | static void unit_unref_gid(Unit *u, bool destroy_now) { | |
5191 | assert(u); | |
5192 | ||
5193 | unit_modify_user_nft_set(u, /* add = */ false, NFT_SET_SOURCE_GROUP, u->ref_gid); | |
5194 | ||
5195 | unit_unref_uid_internal(u, (uid_t*) &u->ref_gid, destroy_now, manager_unref_gid); | |
5196 | } | |
5197 | ||
5198 | void unit_unref_uid_gid(Unit *u, bool destroy_now) { | |
5199 | assert(u); | |
5200 | ||
5201 | unit_unref_uid(u, destroy_now); | |
5202 | unit_unref_gid(u, destroy_now); | |
5203 | } | |
5204 | ||
5205 | static int unit_ref_uid_internal( | |
5206 | Unit *u, | |
5207 | uid_t *ref_uid, | |
5208 | uid_t uid, | |
5209 | bool clean_ipc, | |
5210 | int (*_manager_ref_uid)(Manager *m, uid_t uid, bool clean_ipc)) { | |
5211 | ||
5212 | int r; | |
5213 | ||
5214 | assert(u); | |
5215 | assert(ref_uid); | |
5216 | assert(uid_is_valid(uid)); | |
5217 | assert(_manager_ref_uid); | |
5218 | ||
5219 | /* Generic implementation of both unit_ref_uid() and unit_ref_guid(), under the assumption that uid_t and gid_t | |
5220 | * are actually the same type, and have the same validity rules. | |
5221 | * | |
5222 | * Adds a reference on a specific UID/GID to this unit. Each unit referencing the same UID/GID maintains a | |
5223 | * reference so that we can destroy the UID/GID's IPC resources as soon as this is requested and the counter | |
5224 | * drops to zero. */ | |
5225 | ||
5226 | assert_cc(sizeof(uid_t) == sizeof(gid_t)); | |
5227 | assert_cc(UID_INVALID == (uid_t) GID_INVALID); | |
5228 | ||
5229 | if (*ref_uid == uid) | |
5230 | return 0; | |
5231 | ||
5232 | if (uid_is_valid(*ref_uid)) /* Already set? */ | |
5233 | return -EBUSY; | |
5234 | ||
5235 | r = _manager_ref_uid(u->manager, uid, clean_ipc); | |
5236 | if (r < 0) | |
5237 | return r; | |
5238 | ||
5239 | *ref_uid = uid; | |
5240 | return 1; | |
5241 | } | |
5242 | ||
5243 | static int unit_ref_uid(Unit *u, uid_t uid, bool clean_ipc) { | |
5244 | return unit_ref_uid_internal(u, &u->ref_uid, uid, clean_ipc, manager_ref_uid); | |
5245 | } | |
5246 | ||
5247 | static int unit_ref_gid(Unit *u, gid_t gid, bool clean_ipc) { | |
5248 | return unit_ref_uid_internal(u, (uid_t*) &u->ref_gid, (uid_t) gid, clean_ipc, manager_ref_gid); | |
5249 | } | |
5250 | ||
5251 | static int unit_ref_uid_gid_internal(Unit *u, uid_t uid, gid_t gid, bool clean_ipc) { | |
5252 | int r = 0, q = 0; | |
5253 | ||
5254 | assert(u); | |
5255 | ||
5256 | /* Reference both a UID and a GID in one go. Either references both, or neither. */ | |
5257 | ||
5258 | if (uid_is_valid(uid)) { | |
5259 | r = unit_ref_uid(u, uid, clean_ipc); | |
5260 | if (r < 0) | |
5261 | return r; | |
5262 | } | |
5263 | ||
5264 | if (gid_is_valid(gid)) { | |
5265 | q = unit_ref_gid(u, gid, clean_ipc); | |
5266 | if (q < 0) { | |
5267 | if (r > 0) | |
5268 | unit_unref_uid(u, false); | |
5269 | ||
5270 | return q; | |
5271 | } | |
5272 | } | |
5273 | ||
5274 | return r > 0 || q > 0; | |
5275 | } | |
5276 | ||
5277 | int unit_ref_uid_gid(Unit *u, uid_t uid, gid_t gid) { | |
5278 | ExecContext *c; | |
5279 | int r; | |
5280 | ||
5281 | assert(u); | |
5282 | ||
5283 | c = unit_get_exec_context(u); | |
5284 | ||
5285 | r = unit_ref_uid_gid_internal(u, uid, gid, c ? c->remove_ipc : false); | |
5286 | if (r < 0) | |
5287 | return log_unit_warning_errno(u, r, "Couldn't add UID/GID reference to unit, proceeding without: %m"); | |
5288 | ||
5289 | unit_modify_user_nft_set(u, /* add = */ true, NFT_SET_SOURCE_USER, uid); | |
5290 | unit_modify_user_nft_set(u, /* add = */ true, NFT_SET_SOURCE_GROUP, gid); | |
5291 | ||
5292 | return r; | |
5293 | } | |
5294 | ||
5295 | void unit_notify_user_lookup(Unit *u, uid_t uid, gid_t gid) { | |
5296 | int r; | |
5297 | ||
5298 | assert(u); | |
5299 | ||
5300 | /* This is invoked whenever one of the forked off processes let's us know the UID/GID its user name/group names | |
5301 | * resolved to. We keep track of which UID/GID is currently assigned in order to be able to destroy its IPC | |
5302 | * objects when no service references the UID/GID anymore. */ | |
5303 | ||
5304 | r = unit_ref_uid_gid(u, uid, gid); | |
5305 | if (r > 0) | |
5306 | unit_add_to_dbus_queue(u); | |
5307 | } | |
5308 | ||
5309 | int unit_acquire_invocation_id(Unit *u) { | |
5310 | sd_id128_t id; | |
5311 | int r; | |
5312 | ||
5313 | assert(u); | |
5314 | ||
5315 | r = sd_id128_randomize(&id); | |
5316 | if (r < 0) | |
5317 | return log_unit_error_errno(u, r, "Failed to generate invocation ID for unit: %m"); | |
5318 | ||
5319 | r = unit_set_invocation_id(u, id); | |
5320 | if (r < 0) | |
5321 | return log_unit_error_errno(u, r, "Failed to set invocation ID for unit: %m"); | |
5322 | ||
5323 | unit_add_to_dbus_queue(u); | |
5324 | return 0; | |
5325 | } | |
5326 | ||
5327 | int unit_set_exec_params(Unit *u, ExecParameters *p) { | |
5328 | const char *confirm_spawn; | |
5329 | int r; | |
5330 | ||
5331 | assert(u); | |
5332 | assert(p); | |
5333 | ||
5334 | /* Copy parameters from manager */ | |
5335 | r = manager_get_effective_environment(u->manager, &p->environment); | |
5336 | if (r < 0) | |
5337 | return r; | |
5338 | ||
5339 | p->runtime_scope = u->manager->runtime_scope; | |
5340 | ||
5341 | confirm_spawn = manager_get_confirm_spawn(u->manager); | |
5342 | if (confirm_spawn) { | |
5343 | p->confirm_spawn = strdup(confirm_spawn); | |
5344 | if (!p->confirm_spawn) | |
5345 | return -ENOMEM; | |
5346 | } | |
5347 | ||
5348 | p->cgroup_supported = u->manager->cgroup_supported; | |
5349 | p->prefix = u->manager->prefix; | |
5350 | SET_FLAG(p->flags, EXEC_PASS_LOG_UNIT|EXEC_CHOWN_DIRECTORIES, MANAGER_IS_SYSTEM(u->manager)); | |
5351 | ||
5352 | /* Copy parameters from unit */ | |
5353 | p->cgroup_path = u->cgroup_path; | |
5354 | SET_FLAG(p->flags, EXEC_CGROUP_DELEGATE, unit_cgroup_delegate(u)); | |
5355 | ||
5356 | p->received_credentials_directory = u->manager->received_credentials_directory; | |
5357 | p->received_encrypted_credentials_directory = u->manager->received_encrypted_credentials_directory; | |
5358 | ||
5359 | p->shall_confirm_spawn = u->manager->confirm_spawn; | |
5360 | ||
5361 | p->fallback_smack_process_label = u->manager->defaults.smack_process_label; | |
5362 | ||
5363 | if (u->manager->restrict_fs && p->bpf_outer_map_fd < 0) { | |
5364 | int fd = lsm_bpf_map_restrict_fs_fd(u); | |
5365 | if (fd < 0) | |
5366 | return fd; | |
5367 | ||
5368 | p->bpf_outer_map_fd = fd; | |
5369 | } | |
5370 | ||
5371 | p->user_lookup_fd = u->manager->user_lookup_fds[1]; | |
5372 | ||
5373 | p->cgroup_id = u->cgroup_id; | |
5374 | p->invocation_id = u->invocation_id; | |
5375 | sd_id128_to_string(p->invocation_id, p->invocation_id_string); | |
5376 | p->unit_id = strdup(u->id); | |
5377 | if (!p->unit_id) | |
5378 | return -ENOMEM; | |
5379 | ||
5380 | return 0; | |
5381 | } | |
5382 | ||
5383 | int unit_fork_helper_process(Unit *u, const char *name, PidRef *ret) { | |
5384 | pid_t pid; | |
5385 | int r; | |
5386 | ||
5387 | assert(u); | |
5388 | assert(ret); | |
5389 | ||
5390 | /* Forks off a helper process and makes sure it is a member of the unit's cgroup. Returns == 0 in the child, | |
5391 | * and > 0 in the parent. The pid parameter is always filled in with the child's PID. */ | |
5392 | ||
5393 | (void) unit_realize_cgroup(u); | |
5394 | ||
5395 | r = safe_fork(name, FORK_REOPEN_LOG|FORK_DEATHSIG_SIGTERM, &pid); | |
5396 | if (r < 0) | |
5397 | return r; | |
5398 | if (r > 0) { | |
5399 | _cleanup_(pidref_done) PidRef pidref = PIDREF_NULL; | |
5400 | int q; | |
5401 | ||
5402 | /* Parent */ | |
5403 | ||
5404 | q = pidref_set_pid(&pidref, pid); | |
5405 | if (q < 0) | |
5406 | return q; | |
5407 | ||
5408 | *ret = TAKE_PIDREF(pidref); | |
5409 | return r; | |
5410 | } | |
5411 | ||
5412 | /* Child */ | |
5413 | ||
5414 | (void) default_signals(SIGNALS_CRASH_HANDLER, SIGNALS_IGNORE); | |
5415 | (void) ignore_signals(SIGPIPE); | |
5416 | ||
5417 | if (u->cgroup_path) { | |
5418 | r = cg_attach_everywhere(u->manager->cgroup_supported, u->cgroup_path, 0, NULL, NULL); | |
5419 | if (r < 0) { | |
5420 | log_unit_error_errno(u, r, "Failed to join unit cgroup %s: %m", empty_to_root(u->cgroup_path)); | |
5421 | _exit(EXIT_CGROUP); | |
5422 | } | |
5423 | } | |
5424 | ||
5425 | return 0; | |
5426 | } | |
5427 | ||
5428 | int unit_fork_and_watch_rm_rf(Unit *u, char **paths, PidRef *ret_pid) { | |
5429 | _cleanup_(pidref_done) PidRef pid = PIDREF_NULL; | |
5430 | int r; | |
5431 | ||
5432 | assert(u); | |
5433 | assert(ret_pid); | |
5434 | ||
5435 | r = unit_fork_helper_process(u, "(sd-rmrf)", &pid); | |
5436 | if (r < 0) | |
5437 | return r; | |
5438 | if (r == 0) { | |
5439 | int ret = EXIT_SUCCESS; | |
5440 | ||
5441 | STRV_FOREACH(i, paths) { | |
5442 | r = rm_rf(*i, REMOVE_ROOT|REMOVE_PHYSICAL|REMOVE_MISSING_OK); | |
5443 | if (r < 0) { | |
5444 | log_error_errno(r, "Failed to remove '%s': %m", *i); | |
5445 | ret = EXIT_FAILURE; | |
5446 | } | |
5447 | } | |
5448 | ||
5449 | _exit(ret); | |
5450 | } | |
5451 | ||
5452 | r = unit_watch_pidref(u, &pid, /* exclusive= */ true); | |
5453 | if (r < 0) | |
5454 | return r; | |
5455 | ||
5456 | *ret_pid = TAKE_PIDREF(pid); | |
5457 | return 0; | |
5458 | } | |
5459 | ||
5460 | static void unit_update_dependency_mask(Hashmap *deps, Unit *other, UnitDependencyInfo di) { | |
5461 | assert(deps); | |
5462 | assert(other); | |
5463 | ||
5464 | if (di.origin_mask == 0 && di.destination_mask == 0) | |
5465 | /* No bit set anymore, let's drop the whole entry */ | |
5466 | assert_se(hashmap_remove(deps, other)); | |
5467 | else | |
5468 | /* Mask was reduced, let's update the entry */ | |
5469 | assert_se(hashmap_update(deps, other, di.data) == 0); | |
5470 | } | |
5471 | ||
5472 | void unit_remove_dependencies(Unit *u, UnitDependencyMask mask) { | |
5473 | Hashmap *deps; | |
5474 | assert(u); | |
5475 | ||
5476 | /* Removes all dependencies u has on other units marked for ownership by 'mask'. */ | |
5477 | ||
5478 | if (mask == 0) | |
5479 | return; | |
5480 | ||
5481 | HASHMAP_FOREACH(deps, u->dependencies) { | |
5482 | bool done; | |
5483 | ||
5484 | do { | |
5485 | UnitDependencyInfo di; | |
5486 | Unit *other; | |
5487 | ||
5488 | done = true; | |
5489 | ||
5490 | HASHMAP_FOREACH_KEY(di.data, other, deps) { | |
5491 | Hashmap *other_deps; | |
5492 | ||
5493 | if (FLAGS_SET(~mask, di.origin_mask)) | |
5494 | continue; | |
5495 | ||
5496 | di.origin_mask &= ~mask; | |
5497 | unit_update_dependency_mask(deps, other, di); | |
5498 | ||
5499 | /* We updated the dependency from our unit to the other unit now. But most | |
5500 | * dependencies imply a reverse dependency. Hence, let's delete that one | |
5501 | * too. For that we go through all dependency types on the other unit and | |
5502 | * delete all those which point to us and have the right mask set. */ | |
5503 | ||
5504 | HASHMAP_FOREACH(other_deps, other->dependencies) { | |
5505 | UnitDependencyInfo dj; | |
5506 | ||
5507 | dj.data = hashmap_get(other_deps, u); | |
5508 | if (FLAGS_SET(~mask, dj.destination_mask)) | |
5509 | continue; | |
5510 | ||
5511 | dj.destination_mask &= ~mask; | |
5512 | unit_update_dependency_mask(other_deps, u, dj); | |
5513 | } | |
5514 | ||
5515 | unit_add_to_gc_queue(other); | |
5516 | ||
5517 | /* The unit 'other' may not be wanted by the unit 'u'. */ | |
5518 | unit_submit_to_stop_when_unneeded_queue(other); | |
5519 | ||
5520 | done = false; | |
5521 | break; | |
5522 | } | |
5523 | ||
5524 | } while (!done); | |
5525 | } | |
5526 | } | |
5527 | ||
5528 | static int unit_get_invocation_path(Unit *u, char **ret) { | |
5529 | char *p; | |
5530 | int r; | |
5531 | ||
5532 | assert(u); | |
5533 | assert(ret); | |
5534 | ||
5535 | if (MANAGER_IS_SYSTEM(u->manager)) | |
5536 | p = strjoin("/run/systemd/units/invocation:", u->id); | |
5537 | else { | |
5538 | _cleanup_free_ char *user_path = NULL; | |
5539 | r = xdg_user_runtime_dir(&user_path, "/systemd/units/invocation:"); | |
5540 | if (r < 0) | |
5541 | return r; | |
5542 | p = strjoin(user_path, u->id); | |
5543 | } | |
5544 | ||
5545 | if (!p) | |
5546 | return -ENOMEM; | |
5547 | ||
5548 | *ret = p; | |
5549 | return 0; | |
5550 | } | |
5551 | ||
5552 | static int unit_export_invocation_id(Unit *u) { | |
5553 | _cleanup_free_ char *p = NULL; | |
5554 | int r; | |
5555 | ||
5556 | assert(u); | |
5557 | ||
5558 | if (u->exported_invocation_id) | |
5559 | return 0; | |
5560 | ||
5561 | if (sd_id128_is_null(u->invocation_id)) | |
5562 | return 0; | |
5563 | ||
5564 | r = unit_get_invocation_path(u, &p); | |
5565 | if (r < 0) | |
5566 | return log_unit_debug_errno(u, r, "Failed to get invocation path: %m"); | |
5567 | ||
5568 | r = symlink_atomic_label(u->invocation_id_string, p); | |
5569 | if (r < 0) | |
5570 | return log_unit_debug_errno(u, r, "Failed to create invocation ID symlink %s: %m", p); | |
5571 | ||
5572 | u->exported_invocation_id = true; | |
5573 | return 0; | |
5574 | } | |
5575 | ||
5576 | static int unit_export_log_level_max(Unit *u, const ExecContext *c) { | |
5577 | const char *p; | |
5578 | char buf[2]; | |
5579 | int r; | |
5580 | ||
5581 | assert(u); | |
5582 | assert(c); | |
5583 | ||
5584 | if (u->exported_log_level_max) | |
5585 | return 0; | |
5586 | ||
5587 | if (c->log_level_max < 0) | |
5588 | return 0; | |
5589 | ||
5590 | assert(c->log_level_max <= 7); | |
5591 | ||
5592 | buf[0] = '0' + c->log_level_max; | |
5593 | buf[1] = 0; | |
5594 | ||
5595 | p = strjoina("/run/systemd/units/log-level-max:", u->id); | |
5596 | r = symlink_atomic(buf, p); | |
5597 | if (r < 0) | |
5598 | return log_unit_debug_errno(u, r, "Failed to create maximum log level symlink %s: %m", p); | |
5599 | ||
5600 | u->exported_log_level_max = true; | |
5601 | return 0; | |
5602 | } | |
5603 | ||
5604 | static int unit_export_log_extra_fields(Unit *u, const ExecContext *c) { | |
5605 | _cleanup_close_ int fd = -EBADF; | |
5606 | struct iovec *iovec; | |
5607 | const char *p; | |
5608 | char *pattern; | |
5609 | le64_t *sizes; | |
5610 | ssize_t n; | |
5611 | int r; | |
5612 | ||
5613 | if (u->exported_log_extra_fields) | |
5614 | return 0; | |
5615 | ||
5616 | if (c->n_log_extra_fields <= 0) | |
5617 | return 0; | |
5618 | ||
5619 | sizes = newa(le64_t, c->n_log_extra_fields); | |
5620 | iovec = newa(struct iovec, c->n_log_extra_fields * 2); | |
5621 | ||
5622 | for (size_t i = 0; i < c->n_log_extra_fields; i++) { | |
5623 | sizes[i] = htole64(c->log_extra_fields[i].iov_len); | |
5624 | ||
5625 | iovec[i*2] = IOVEC_MAKE(sizes + i, sizeof(le64_t)); | |
5626 | iovec[i*2+1] = c->log_extra_fields[i]; | |
5627 | } | |
5628 | ||
5629 | p = strjoina("/run/systemd/units/log-extra-fields:", u->id); | |
5630 | pattern = strjoina(p, ".XXXXXX"); | |
5631 | ||
5632 | fd = mkostemp_safe(pattern); | |
5633 | if (fd < 0) | |
5634 | return log_unit_debug_errno(u, fd, "Failed to create extra fields file %s: %m", p); | |
5635 | ||
5636 | n = writev(fd, iovec, c->n_log_extra_fields*2); | |
5637 | if (n < 0) { | |
5638 | r = log_unit_debug_errno(u, errno, "Failed to write extra fields: %m"); | |
5639 | goto fail; | |
5640 | } | |
5641 | ||
5642 | (void) fchmod(fd, 0644); | |
5643 | ||
5644 | if (rename(pattern, p) < 0) { | |
5645 | r = log_unit_debug_errno(u, errno, "Failed to rename extra fields file: %m"); | |
5646 | goto fail; | |
5647 | } | |
5648 | ||
5649 | u->exported_log_extra_fields = true; | |
5650 | return 0; | |
5651 | ||
5652 | fail: | |
5653 | (void) unlink(pattern); | |
5654 | return r; | |
5655 | } | |
5656 | ||
5657 | static int unit_export_log_ratelimit_interval(Unit *u, const ExecContext *c) { | |
5658 | _cleanup_free_ char *buf = NULL; | |
5659 | const char *p; | |
5660 | int r; | |
5661 | ||
5662 | assert(u); | |
5663 | assert(c); | |
5664 | ||
5665 | if (u->exported_log_ratelimit_interval) | |
5666 | return 0; | |
5667 | ||
5668 | if (c->log_ratelimit_interval_usec == 0) | |
5669 | return 0; | |
5670 | ||
5671 | p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id); | |
5672 | ||
5673 | if (asprintf(&buf, "%" PRIu64, c->log_ratelimit_interval_usec) < 0) | |
5674 | return log_oom(); | |
5675 | ||
5676 | r = symlink_atomic(buf, p); | |
5677 | if (r < 0) | |
5678 | return log_unit_debug_errno(u, r, "Failed to create log rate limit interval symlink %s: %m", p); | |
5679 | ||
5680 | u->exported_log_ratelimit_interval = true; | |
5681 | return 0; | |
5682 | } | |
5683 | ||
5684 | static int unit_export_log_ratelimit_burst(Unit *u, const ExecContext *c) { | |
5685 | _cleanup_free_ char *buf = NULL; | |
5686 | const char *p; | |
5687 | int r; | |
5688 | ||
5689 | assert(u); | |
5690 | assert(c); | |
5691 | ||
5692 | if (u->exported_log_ratelimit_burst) | |
5693 | return 0; | |
5694 | ||
5695 | if (c->log_ratelimit_burst == 0) | |
5696 | return 0; | |
5697 | ||
5698 | p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id); | |
5699 | ||
5700 | if (asprintf(&buf, "%u", c->log_ratelimit_burst) < 0) | |
5701 | return log_oom(); | |
5702 | ||
5703 | r = symlink_atomic(buf, p); | |
5704 | if (r < 0) | |
5705 | return log_unit_debug_errno(u, r, "Failed to create log rate limit burst symlink %s: %m", p); | |
5706 | ||
5707 | u->exported_log_ratelimit_burst = true; | |
5708 | return 0; | |
5709 | } | |
5710 | ||
5711 | void unit_export_state_files(Unit *u) { | |
5712 | const ExecContext *c; | |
5713 | ||
5714 | assert(u); | |
5715 | ||
5716 | if (!u->id) | |
5717 | return; | |
5718 | ||
5719 | if (MANAGER_IS_TEST_RUN(u->manager)) | |
5720 | return; | |
5721 | ||
5722 | /* Exports a couple of unit properties to /run/systemd/units/, so that journald can quickly query this data | |
5723 | * from there. Ideally, journald would use IPC to query this, like everybody else, but that's hard, as long as | |
5724 | * the IPC system itself and PID 1 also log to the journal. | |
5725 | * | |
5726 | * Note that these files really shouldn't be considered API for anyone else, as use a runtime file system as | |
5727 | * IPC replacement is not compatible with today's world of file system namespaces. However, this doesn't really | |
5728 | * apply to communication between the journal and systemd, as we assume that these two daemons live in the same | |
5729 | * namespace at least. | |
5730 | * | |
5731 | * Note that some of the "files" exported here are actually symlinks and not regular files. Symlinks work | |
5732 | * better for storing small bits of data, in particular as we can write them with two system calls, and read | |
5733 | * them with one. */ | |
5734 | ||
5735 | (void) unit_export_invocation_id(u); | |
5736 | ||
5737 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
5738 | return; | |
5739 | ||
5740 | c = unit_get_exec_context(u); | |
5741 | if (c) { | |
5742 | (void) unit_export_log_level_max(u, c); | |
5743 | (void) unit_export_log_extra_fields(u, c); | |
5744 | (void) unit_export_log_ratelimit_interval(u, c); | |
5745 | (void) unit_export_log_ratelimit_burst(u, c); | |
5746 | } | |
5747 | } | |
5748 | ||
5749 | void unit_unlink_state_files(Unit *u) { | |
5750 | const char *p; | |
5751 | ||
5752 | assert(u); | |
5753 | ||
5754 | if (!u->id) | |
5755 | return; | |
5756 | ||
5757 | /* Undoes the effect of unit_export_state() */ | |
5758 | ||
5759 | if (u->exported_invocation_id) { | |
5760 | _cleanup_free_ char *invocation_path = NULL; | |
5761 | int r = unit_get_invocation_path(u, &invocation_path); | |
5762 | if (r >= 0) { | |
5763 | (void) unlink(invocation_path); | |
5764 | u->exported_invocation_id = false; | |
5765 | } | |
5766 | } | |
5767 | ||
5768 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
5769 | return; | |
5770 | ||
5771 | if (u->exported_log_level_max) { | |
5772 | p = strjoina("/run/systemd/units/log-level-max:", u->id); | |
5773 | (void) unlink(p); | |
5774 | ||
5775 | u->exported_log_level_max = false; | |
5776 | } | |
5777 | ||
5778 | if (u->exported_log_extra_fields) { | |
5779 | p = strjoina("/run/systemd/units/extra-fields:", u->id); | |
5780 | (void) unlink(p); | |
5781 | ||
5782 | u->exported_log_extra_fields = false; | |
5783 | } | |
5784 | ||
5785 | if (u->exported_log_ratelimit_interval) { | |
5786 | p = strjoina("/run/systemd/units/log-rate-limit-interval:", u->id); | |
5787 | (void) unlink(p); | |
5788 | ||
5789 | u->exported_log_ratelimit_interval = false; | |
5790 | } | |
5791 | ||
5792 | if (u->exported_log_ratelimit_burst) { | |
5793 | p = strjoina("/run/systemd/units/log-rate-limit-burst:", u->id); | |
5794 | (void) unlink(p); | |
5795 | ||
5796 | u->exported_log_ratelimit_burst = false; | |
5797 | } | |
5798 | } | |
5799 | ||
5800 | int unit_prepare_exec(Unit *u) { | |
5801 | int r; | |
5802 | ||
5803 | assert(u); | |
5804 | ||
5805 | /* Load any custom firewall BPF programs here once to test if they are existing and actually loadable. | |
5806 | * Fail here early since later errors in the call chain unit_realize_cgroup to cgroup_context_apply are ignored. */ | |
5807 | r = bpf_firewall_load_custom(u); | |
5808 | if (r < 0) | |
5809 | return r; | |
5810 | ||
5811 | /* Prepares everything so that we can fork of a process for this unit */ | |
5812 | ||
5813 | (void) unit_realize_cgroup(u); | |
5814 | ||
5815 | if (u->reset_accounting) { | |
5816 | (void) unit_reset_accounting(u); | |
5817 | u->reset_accounting = false; | |
5818 | } | |
5819 | ||
5820 | unit_export_state_files(u); | |
5821 | ||
5822 | r = unit_setup_exec_runtime(u); | |
5823 | if (r < 0) | |
5824 | return r; | |
5825 | ||
5826 | return 0; | |
5827 | } | |
5828 | ||
5829 | static bool ignore_leftover_process(const char *comm) { | |
5830 | return comm && comm[0] == '('; /* Most likely our own helper process (PAM?), ignore */ | |
5831 | } | |
5832 | ||
5833 | int unit_log_leftover_process_start(const PidRef *pid, int sig, void *userdata) { | |
5834 | _cleanup_free_ char *comm = NULL; | |
5835 | ||
5836 | assert(pidref_is_set(pid)); | |
5837 | ||
5838 | (void) pidref_get_comm(pid, &comm); | |
5839 | ||
5840 | if (ignore_leftover_process(comm)) | |
5841 | return 0; | |
5842 | ||
5843 | /* During start we print a warning */ | |
5844 | ||
5845 | log_unit_warning(userdata, | |
5846 | "Found left-over process " PID_FMT " (%s) in control group while starting unit. Ignoring.\n" | |
5847 | "This usually indicates unclean termination of a previous run, or service implementation deficiencies.", | |
5848 | pid->pid, strna(comm)); | |
5849 | ||
5850 | return 1; | |
5851 | } | |
5852 | ||
5853 | int unit_log_leftover_process_stop(const PidRef *pid, int sig, void *userdata) { | |
5854 | _cleanup_free_ char *comm = NULL; | |
5855 | ||
5856 | assert(pidref_is_set(pid)); | |
5857 | ||
5858 | (void) pidref_get_comm(pid, &comm); | |
5859 | ||
5860 | if (ignore_leftover_process(comm)) | |
5861 | return 0; | |
5862 | ||
5863 | /* During stop we only print an informational message */ | |
5864 | ||
5865 | log_unit_info(userdata, | |
5866 | "Unit process " PID_FMT " (%s) remains running after unit stopped.", | |
5867 | pid->pid, strna(comm)); | |
5868 | ||
5869 | return 1; | |
5870 | } | |
5871 | ||
5872 | int unit_warn_leftover_processes(Unit *u, cg_kill_log_func_t log_func) { | |
5873 | assert(u); | |
5874 | ||
5875 | (void) unit_pick_cgroup_path(u); | |
5876 | ||
5877 | if (!u->cgroup_path) | |
5878 | return 0; | |
5879 | ||
5880 | return cg_kill_recursive( | |
5881 | u->cgroup_path, | |
5882 | /* sig= */ 0, | |
5883 | /* flags= */ 0, | |
5884 | /* set= */ NULL, | |
5885 | log_func, | |
5886 | u); | |
5887 | } | |
5888 | ||
5889 | bool unit_needs_console(Unit *u) { | |
5890 | ExecContext *ec; | |
5891 | UnitActiveState state; | |
5892 | ||
5893 | assert(u); | |
5894 | ||
5895 | state = unit_active_state(u); | |
5896 | ||
5897 | if (UNIT_IS_INACTIVE_OR_FAILED(state)) | |
5898 | return false; | |
5899 | ||
5900 | if (UNIT_VTABLE(u)->needs_console) | |
5901 | return UNIT_VTABLE(u)->needs_console(u); | |
5902 | ||
5903 | /* If this unit type doesn't implement this call, let's use a generic fallback implementation: */ | |
5904 | ec = unit_get_exec_context(u); | |
5905 | if (!ec) | |
5906 | return false; | |
5907 | ||
5908 | return exec_context_may_touch_console(ec); | |
5909 | } | |
5910 | ||
5911 | int unit_pid_attachable(Unit *u, const PidRef *pid, sd_bus_error *error) { | |
5912 | int r; | |
5913 | ||
5914 | assert(u); | |
5915 | ||
5916 | /* Checks whether the specified PID is generally good for attaching, i.e. a valid PID, not our manager itself, | |
5917 | * and not a kernel thread either */ | |
5918 | ||
5919 | /* First, a simple range check */ | |
5920 | if (!pidref_is_set(pid)) | |
5921 | return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process identifier is not valid."); | |
5922 | ||
5923 | /* Some extra safety check */ | |
5924 | if (pid->pid == 1 || pidref_is_self(pid)) | |
5925 | return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a manager process, refusing.", pid->pid); | |
5926 | ||
5927 | /* Don't even begin to bother with kernel threads */ | |
5928 | r = pidref_is_kernel_thread(pid); | |
5929 | if (r == -ESRCH) | |
5930 | return sd_bus_error_setf(error, SD_BUS_ERROR_UNIX_PROCESS_ID_UNKNOWN, "Process with ID " PID_FMT " does not exist.", pid->pid); | |
5931 | if (r < 0) | |
5932 | return sd_bus_error_set_errnof(error, r, "Failed to determine whether process " PID_FMT " is a kernel thread: %m", pid->pid); | |
5933 | if (r > 0) | |
5934 | return sd_bus_error_setf(error, SD_BUS_ERROR_INVALID_ARGS, "Process " PID_FMT " is a kernel thread, refusing.", pid->pid); | |
5935 | ||
5936 | return 0; | |
5937 | } | |
5938 | ||
5939 | void unit_log_success(Unit *u) { | |
5940 | assert(u); | |
5941 | ||
5942 | /* Let's show message "Deactivated successfully" in debug mode (when manager is user) rather than in info mode. | |
5943 | * This message has low information value for regular users and it might be a bit overwhelming on a system with | |
5944 | * a lot of devices. */ | |
5945 | log_unit_struct(u, | |
5946 | MANAGER_IS_USER(u->manager) ? LOG_DEBUG : LOG_INFO, | |
5947 | "MESSAGE_ID=" SD_MESSAGE_UNIT_SUCCESS_STR, | |
5948 | LOG_UNIT_INVOCATION_ID(u), | |
5949 | LOG_UNIT_MESSAGE(u, "Deactivated successfully.")); | |
5950 | } | |
5951 | ||
5952 | void unit_log_failure(Unit *u, const char *result) { | |
5953 | assert(u); | |
5954 | assert(result); | |
5955 | ||
5956 | log_unit_struct(u, LOG_WARNING, | |
5957 | "MESSAGE_ID=" SD_MESSAGE_UNIT_FAILURE_RESULT_STR, | |
5958 | LOG_UNIT_INVOCATION_ID(u), | |
5959 | LOG_UNIT_MESSAGE(u, "Failed with result '%s'.", result), | |
5960 | "UNIT_RESULT=%s", result); | |
5961 | } | |
5962 | ||
5963 | void unit_log_skip(Unit *u, const char *result) { | |
5964 | assert(u); | |
5965 | assert(result); | |
5966 | ||
5967 | log_unit_struct(u, LOG_INFO, | |
5968 | "MESSAGE_ID=" SD_MESSAGE_UNIT_SKIPPED_STR, | |
5969 | LOG_UNIT_INVOCATION_ID(u), | |
5970 | LOG_UNIT_MESSAGE(u, "Skipped due to '%s'.", result), | |
5971 | "UNIT_RESULT=%s", result); | |
5972 | } | |
5973 | ||
5974 | void unit_log_process_exit( | |
5975 | Unit *u, | |
5976 | const char *kind, | |
5977 | const char *command, | |
5978 | bool success, | |
5979 | int code, | |
5980 | int status) { | |
5981 | ||
5982 | int level; | |
5983 | ||
5984 | assert(u); | |
5985 | assert(kind); | |
5986 | ||
5987 | /* If this is a successful exit, let's log about the exit code on DEBUG level. If this is a failure | |
5988 | * and the process exited on its own via exit(), then let's make this a NOTICE, under the assumption | |
5989 | * that the service already logged the reason at a higher log level on its own. Otherwise, make it a | |
5990 | * WARNING. */ | |
5991 | if (success) | |
5992 | level = LOG_DEBUG; | |
5993 | else if (code == CLD_EXITED) | |
5994 | level = LOG_NOTICE; | |
5995 | else | |
5996 | level = LOG_WARNING; | |
5997 | ||
5998 | log_unit_struct(u, level, | |
5999 | "MESSAGE_ID=" SD_MESSAGE_UNIT_PROCESS_EXIT_STR, | |
6000 | LOG_UNIT_MESSAGE(u, "%s exited, code=%s, status=%i/%s%s", | |
6001 | kind, | |
6002 | sigchld_code_to_string(code), status, | |
6003 | strna(code == CLD_EXITED | |
6004 | ? exit_status_to_string(status, EXIT_STATUS_FULL) | |
6005 | : signal_to_string(status)), | |
6006 | success ? " (success)" : ""), | |
6007 | "EXIT_CODE=%s", sigchld_code_to_string(code), | |
6008 | "EXIT_STATUS=%i", status, | |
6009 | "COMMAND=%s", strna(command), | |
6010 | LOG_UNIT_INVOCATION_ID(u)); | |
6011 | } | |
6012 | ||
6013 | int unit_exit_status(Unit *u) { | |
6014 | assert(u); | |
6015 | ||
6016 | /* Returns the exit status to propagate for the most recent cycle of this unit. Returns a value in the range | |
6017 | * 0…255 if there's something to propagate. EOPNOTSUPP if the concept does not apply to this unit type, ENODATA | |
6018 | * if no data is currently known (for example because the unit hasn't deactivated yet) and EBADE if the main | |
6019 | * service process has exited abnormally (signal/coredump). */ | |
6020 | ||
6021 | if (!UNIT_VTABLE(u)->exit_status) | |
6022 | return -EOPNOTSUPP; | |
6023 | ||
6024 | return UNIT_VTABLE(u)->exit_status(u); | |
6025 | } | |
6026 | ||
6027 | int unit_failure_action_exit_status(Unit *u) { | |
6028 | int r; | |
6029 | ||
6030 | assert(u); | |
6031 | ||
6032 | /* Returns the exit status to propagate on failure, or an error if there's nothing to propagate */ | |
6033 | ||
6034 | if (u->failure_action_exit_status >= 0) | |
6035 | return u->failure_action_exit_status; | |
6036 | ||
6037 | r = unit_exit_status(u); | |
6038 | if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */ | |
6039 | return 255; | |
6040 | ||
6041 | return r; | |
6042 | } | |
6043 | ||
6044 | int unit_success_action_exit_status(Unit *u) { | |
6045 | int r; | |
6046 | ||
6047 | assert(u); | |
6048 | ||
6049 | /* Returns the exit status to propagate on success, or an error if there's nothing to propagate */ | |
6050 | ||
6051 | if (u->success_action_exit_status >= 0) | |
6052 | return u->success_action_exit_status; | |
6053 | ||
6054 | r = unit_exit_status(u); | |
6055 | if (r == -EBADE) /* Exited, but not cleanly (i.e. by signal or such) */ | |
6056 | return 255; | |
6057 | ||
6058 | return r; | |
6059 | } | |
6060 | ||
6061 | int unit_test_trigger_loaded(Unit *u) { | |
6062 | Unit *trigger; | |
6063 | ||
6064 | /* Tests whether the unit to trigger is loaded */ | |
6065 | ||
6066 | trigger = UNIT_TRIGGER(u); | |
6067 | if (!trigger) | |
6068 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(ENOENT), | |
6069 | "Refusing to start, no unit to trigger."); | |
6070 | if (trigger->load_state != UNIT_LOADED) | |
6071 | return log_unit_error_errno(u, SYNTHETIC_ERRNO(ENOENT), | |
6072 | "Refusing to start, unit %s to trigger not loaded.", trigger->id); | |
6073 | ||
6074 | return 0; | |
6075 | } | |
6076 | ||
6077 | void unit_destroy_runtime_data(Unit *u, const ExecContext *context) { | |
6078 | assert(u); | |
6079 | assert(context); | |
6080 | ||
6081 | /* EXEC_PRESERVE_RESTART is handled via unit_release_resources()! */ | |
6082 | if (context->runtime_directory_preserve_mode == EXEC_PRESERVE_NO) | |
6083 | exec_context_destroy_runtime_directory(context, u->manager->prefix[EXEC_DIRECTORY_RUNTIME]); | |
6084 | ||
6085 | exec_context_destroy_credentials(u); | |
6086 | exec_context_destroy_mount_ns_dir(u); | |
6087 | } | |
6088 | ||
6089 | int unit_clean(Unit *u, ExecCleanMask mask) { | |
6090 | UnitActiveState state; | |
6091 | ||
6092 | assert(u); | |
6093 | ||
6094 | /* Special return values: | |
6095 | * | |
6096 | * -EOPNOTSUPP → cleaning not supported for this unit type | |
6097 | * -EUNATCH → cleaning not defined for this resource type | |
6098 | * -EBUSY → unit currently can't be cleaned since it's running or not properly loaded, or has | |
6099 | * a job queued or similar | |
6100 | */ | |
6101 | ||
6102 | if (!UNIT_VTABLE(u)->clean) | |
6103 | return -EOPNOTSUPP; | |
6104 | ||
6105 | if (mask == 0) | |
6106 | return -EUNATCH; | |
6107 | ||
6108 | if (u->load_state != UNIT_LOADED) | |
6109 | return -EBUSY; | |
6110 | ||
6111 | if (u->job) | |
6112 | return -EBUSY; | |
6113 | ||
6114 | state = unit_active_state(u); | |
6115 | if (state != UNIT_INACTIVE) | |
6116 | return -EBUSY; | |
6117 | ||
6118 | return UNIT_VTABLE(u)->clean(u, mask); | |
6119 | } | |
6120 | ||
6121 | int unit_can_clean(Unit *u, ExecCleanMask *ret) { | |
6122 | assert(u); | |
6123 | ||
6124 | if (!UNIT_VTABLE(u)->clean || | |
6125 | u->load_state != UNIT_LOADED) { | |
6126 | *ret = 0; | |
6127 | return 0; | |
6128 | } | |
6129 | ||
6130 | /* When the clean() method is set, can_clean() really should be set too */ | |
6131 | assert(UNIT_VTABLE(u)->can_clean); | |
6132 | ||
6133 | return UNIT_VTABLE(u)->can_clean(u, ret); | |
6134 | } | |
6135 | ||
6136 | bool unit_can_start_refuse_manual(Unit *u) { | |
6137 | return unit_can_start(u) && !u->refuse_manual_start; | |
6138 | } | |
6139 | ||
6140 | bool unit_can_stop_refuse_manual(Unit *u) { | |
6141 | return unit_can_stop(u) && !u->refuse_manual_stop; | |
6142 | } | |
6143 | ||
6144 | bool unit_can_isolate_refuse_manual(Unit *u) { | |
6145 | return unit_can_isolate(u) && !u->refuse_manual_start; | |
6146 | } | |
6147 | ||
6148 | bool unit_can_freeze(Unit *u) { | |
6149 | assert(u); | |
6150 | ||
6151 | if (UNIT_VTABLE(u)->can_freeze) | |
6152 | return UNIT_VTABLE(u)->can_freeze(u); | |
6153 | ||
6154 | return UNIT_VTABLE(u)->freeze; | |
6155 | } | |
6156 | ||
6157 | void unit_frozen(Unit *u) { | |
6158 | assert(u); | |
6159 | ||
6160 | u->freezer_state = FREEZER_FROZEN; | |
6161 | ||
6162 | bus_unit_send_pending_freezer_message(u, false); | |
6163 | } | |
6164 | ||
6165 | void unit_thawed(Unit *u) { | |
6166 | assert(u); | |
6167 | ||
6168 | u->freezer_state = FREEZER_RUNNING; | |
6169 | ||
6170 | bus_unit_send_pending_freezer_message(u, false); | |
6171 | } | |
6172 | ||
6173 | static int unit_freezer_action(Unit *u, FreezerAction action) { | |
6174 | UnitActiveState s; | |
6175 | int (*method)(Unit*); | |
6176 | int r; | |
6177 | ||
6178 | assert(u); | |
6179 | assert(IN_SET(action, FREEZER_FREEZE, FREEZER_THAW)); | |
6180 | ||
6181 | method = action == FREEZER_FREEZE ? UNIT_VTABLE(u)->freeze : UNIT_VTABLE(u)->thaw; | |
6182 | if (!method || !cg_freezer_supported()) | |
6183 | return -EOPNOTSUPP; | |
6184 | ||
6185 | if (u->job) | |
6186 | return -EBUSY; | |
6187 | ||
6188 | if (u->load_state != UNIT_LOADED) | |
6189 | return -EHOSTDOWN; | |
6190 | ||
6191 | s = unit_active_state(u); | |
6192 | if (s != UNIT_ACTIVE) | |
6193 | return -EHOSTDOWN; | |
6194 | ||
6195 | if ((IN_SET(u->freezer_state, FREEZER_FREEZING, FREEZER_THAWING) && action == FREEZER_FREEZE) || | |
6196 | (u->freezer_state == FREEZER_THAWING && action == FREEZER_THAW)) | |
6197 | return -EALREADY; | |
6198 | ||
6199 | r = method(u); | |
6200 | if (r <= 0) | |
6201 | return r; | |
6202 | ||
6203 | assert(IN_SET(u->freezer_state, FREEZER_FREEZING, FREEZER_THAWING)); | |
6204 | ||
6205 | return 1; | |
6206 | } | |
6207 | ||
6208 | int unit_freeze(Unit *u) { | |
6209 | return unit_freezer_action(u, FREEZER_FREEZE); | |
6210 | } | |
6211 | ||
6212 | int unit_thaw(Unit *u) { | |
6213 | return unit_freezer_action(u, FREEZER_THAW); | |
6214 | } | |
6215 | ||
6216 | /* Wrappers around low-level cgroup freezer operations common for service and scope units */ | |
6217 | int unit_freeze_vtable_common(Unit *u) { | |
6218 | return unit_cgroup_freezer_action(u, FREEZER_FREEZE); | |
6219 | } | |
6220 | ||
6221 | int unit_thaw_vtable_common(Unit *u) { | |
6222 | return unit_cgroup_freezer_action(u, FREEZER_THAW); | |
6223 | } | |
6224 | ||
6225 | Condition *unit_find_failed_condition(Unit *u) { | |
6226 | Condition *failed_trigger = NULL; | |
6227 | bool has_succeeded_trigger = false; | |
6228 | ||
6229 | if (u->condition_result) | |
6230 | return NULL; | |
6231 | ||
6232 | LIST_FOREACH(conditions, c, u->conditions) | |
6233 | if (c->trigger) { | |
6234 | if (c->result == CONDITION_SUCCEEDED) | |
6235 | has_succeeded_trigger = true; | |
6236 | else if (!failed_trigger) | |
6237 | failed_trigger = c; | |
6238 | } else if (c->result != CONDITION_SUCCEEDED) | |
6239 | return c; | |
6240 | ||
6241 | return failed_trigger && !has_succeeded_trigger ? failed_trigger : NULL; | |
6242 | } | |
6243 | ||
6244 | static const char* const collect_mode_table[_COLLECT_MODE_MAX] = { | |
6245 | [COLLECT_INACTIVE] = "inactive", | |
6246 | [COLLECT_INACTIVE_OR_FAILED] = "inactive-or-failed", | |
6247 | }; | |
6248 | ||
6249 | DEFINE_STRING_TABLE_LOOKUP(collect_mode, CollectMode); | |
6250 | ||
6251 | Unit* unit_has_dependency(const Unit *u, UnitDependencyAtom atom, Unit *other) { | |
6252 | Unit *i; | |
6253 | ||
6254 | assert(u); | |
6255 | ||
6256 | /* Checks if the unit has a dependency on 'other' with the specified dependency atom. If 'other' is | |
6257 | * NULL checks if the unit has *any* dependency of that atom. Returns 'other' if found (or if 'other' | |
6258 | * is NULL the first entry found), or NULL if not found. */ | |
6259 | ||
6260 | UNIT_FOREACH_DEPENDENCY(i, u, atom) | |
6261 | if (!other || other == i) | |
6262 | return i; | |
6263 | ||
6264 | return NULL; | |
6265 | } | |
6266 | ||
6267 | int unit_get_dependency_array(const Unit *u, UnitDependencyAtom atom, Unit ***ret_array) { | |
6268 | _cleanup_free_ Unit **array = NULL; | |
6269 | size_t n = 0; | |
6270 | Unit *other; | |
6271 | ||
6272 | assert(u); | |
6273 | assert(ret_array); | |
6274 | ||
6275 | /* Gets a list of units matching a specific atom as array. This is useful when iterating through | |
6276 | * dependencies while modifying them: the array is an "atomic snapshot" of sorts, that can be read | |
6277 | * while the dependency table is continuously updated. */ | |
6278 | ||
6279 | UNIT_FOREACH_DEPENDENCY(other, u, atom) { | |
6280 | if (!GREEDY_REALLOC(array, n + 1)) | |
6281 | return -ENOMEM; | |
6282 | ||
6283 | array[n++] = other; | |
6284 | } | |
6285 | ||
6286 | *ret_array = TAKE_PTR(array); | |
6287 | ||
6288 | assert(n <= INT_MAX); | |
6289 | return (int) n; | |
6290 | } | |
6291 | ||
6292 | int unit_get_transitive_dependency_set(Unit *u, UnitDependencyAtom atom, Set **ret) { | |
6293 | _cleanup_set_free_ Set *units = NULL, *queue = NULL; | |
6294 | Unit *other; | |
6295 | int r; | |
6296 | ||
6297 | assert(u); | |
6298 | assert(ret); | |
6299 | ||
6300 | /* Similar to unit_get_dependency_array(), but also search the same dependency in other units. */ | |
6301 | ||
6302 | do { | |
6303 | UNIT_FOREACH_DEPENDENCY(other, u, atom) { | |
6304 | r = set_ensure_put(&units, NULL, other); | |
6305 | if (r < 0) | |
6306 | return r; | |
6307 | if (r == 0) | |
6308 | continue; | |
6309 | r = set_ensure_put(&queue, NULL, other); | |
6310 | if (r < 0) | |
6311 | return r; | |
6312 | } | |
6313 | } while ((u = set_steal_first(queue))); | |
6314 | ||
6315 | *ret = TAKE_PTR(units); | |
6316 | return 0; | |
6317 | } | |
6318 | ||
6319 | int unit_arm_timer( | |
6320 | Unit *u, | |
6321 | sd_event_source **source, | |
6322 | bool relative, | |
6323 | usec_t usec, | |
6324 | sd_event_time_handler_t handler) { | |
6325 | ||
6326 | int r; | |
6327 | ||
6328 | assert(u); | |
6329 | assert(source); | |
6330 | assert(handler); | |
6331 | ||
6332 | if (*source) { | |
6333 | if (usec == USEC_INFINITY) | |
6334 | return sd_event_source_set_enabled(*source, SD_EVENT_OFF); | |
6335 | ||
6336 | r = (relative ? sd_event_source_set_time_relative : sd_event_source_set_time)(*source, usec); | |
6337 | if (r < 0) | |
6338 | return r; | |
6339 | ||
6340 | return sd_event_source_set_enabled(*source, SD_EVENT_ONESHOT); | |
6341 | } | |
6342 | ||
6343 | if (usec == USEC_INFINITY) | |
6344 | return 0; | |
6345 | ||
6346 | r = (relative ? sd_event_add_time_relative : sd_event_add_time)( | |
6347 | u->manager->event, | |
6348 | source, | |
6349 | CLOCK_MONOTONIC, | |
6350 | usec, 0, | |
6351 | handler, | |
6352 | u); | |
6353 | if (r < 0) | |
6354 | return r; | |
6355 | ||
6356 | const char *d = strjoina(unit_type_to_string(u->type), "-timer"); | |
6357 | (void) sd_event_source_set_description(*source, d); | |
6358 | ||
6359 | return 0; | |
6360 | } | |
6361 | ||
6362 | static int unit_get_nice(Unit *u) { | |
6363 | ExecContext *ec; | |
6364 | ||
6365 | ec = unit_get_exec_context(u); | |
6366 | return ec ? ec->nice : 0; | |
6367 | } | |
6368 | ||
6369 | static uint64_t unit_get_cpu_weight(Unit *u) { | |
6370 | CGroupContext *cc; | |
6371 | ||
6372 | cc = unit_get_cgroup_context(u); | |
6373 | return cc ? cgroup_context_cpu_weight(cc, manager_state(u->manager)) : CGROUP_WEIGHT_DEFAULT; | |
6374 | } | |
6375 | ||
6376 | int unit_compare_priority(Unit *a, Unit *b) { | |
6377 | int ret; | |
6378 | ||
6379 | ret = CMP(a->type, b->type); | |
6380 | if (ret != 0) | |
6381 | return -ret; | |
6382 | ||
6383 | ret = CMP(unit_get_cpu_weight(a), unit_get_cpu_weight(b)); | |
6384 | if (ret != 0) | |
6385 | return -ret; | |
6386 | ||
6387 | ret = CMP(unit_get_nice(a), unit_get_nice(b)); | |
6388 | if (ret != 0) | |
6389 | return ret; | |
6390 | ||
6391 | return strcmp(a->id, b->id); | |
6392 | } | |
6393 | ||
6394 | const ActivationDetailsVTable * const activation_details_vtable[_UNIT_TYPE_MAX] = { | |
6395 | [UNIT_PATH] = &activation_details_path_vtable, | |
6396 | [UNIT_TIMER] = &activation_details_timer_vtable, | |
6397 | }; | |
6398 | ||
6399 | ActivationDetails *activation_details_new(Unit *trigger_unit) { | |
6400 | _cleanup_free_ ActivationDetails *details = NULL; | |
6401 | ||
6402 | assert(trigger_unit); | |
6403 | assert(trigger_unit->type != _UNIT_TYPE_INVALID); | |
6404 | assert(trigger_unit->id); | |
6405 | ||
6406 | details = malloc0(activation_details_vtable[trigger_unit->type]->object_size); | |
6407 | if (!details) | |
6408 | return NULL; | |
6409 | ||
6410 | *details = (ActivationDetails) { | |
6411 | .n_ref = 1, | |
6412 | .trigger_unit_type = trigger_unit->type, | |
6413 | }; | |
6414 | ||
6415 | details->trigger_unit_name = strdup(trigger_unit->id); | |
6416 | if (!details->trigger_unit_name) | |
6417 | return NULL; | |
6418 | ||
6419 | if (ACTIVATION_DETAILS_VTABLE(details)->init) | |
6420 | ACTIVATION_DETAILS_VTABLE(details)->init(details, trigger_unit); | |
6421 | ||
6422 | return TAKE_PTR(details); | |
6423 | } | |
6424 | ||
6425 | static ActivationDetails *activation_details_free(ActivationDetails *details) { | |
6426 | if (!details) | |
6427 | return NULL; | |
6428 | ||
6429 | if (ACTIVATION_DETAILS_VTABLE(details)->done) | |
6430 | ACTIVATION_DETAILS_VTABLE(details)->done(details); | |
6431 | ||
6432 | free(details->trigger_unit_name); | |
6433 | ||
6434 | return mfree(details); | |
6435 | } | |
6436 | ||
6437 | void activation_details_serialize(ActivationDetails *details, FILE *f) { | |
6438 | if (!details || details->trigger_unit_type == _UNIT_TYPE_INVALID) | |
6439 | return; | |
6440 | ||
6441 | (void) serialize_item(f, "activation-details-unit-type", unit_type_to_string(details->trigger_unit_type)); | |
6442 | if (details->trigger_unit_name) | |
6443 | (void) serialize_item(f, "activation-details-unit-name", details->trigger_unit_name); | |
6444 | if (ACTIVATION_DETAILS_VTABLE(details)->serialize) | |
6445 | ACTIVATION_DETAILS_VTABLE(details)->serialize(details, f); | |
6446 | } | |
6447 | ||
6448 | int activation_details_deserialize(const char *key, const char *value, ActivationDetails **details) { | |
6449 | int r; | |
6450 | ||
6451 | assert(key); | |
6452 | assert(value); | |
6453 | assert(details); | |
6454 | ||
6455 | if (!*details) { | |
6456 | UnitType t; | |
6457 | ||
6458 | if (!streq(key, "activation-details-unit-type")) | |
6459 | return -EINVAL; | |
6460 | ||
6461 | t = unit_type_from_string(value); | |
6462 | if (t < 0) | |
6463 | return t; | |
6464 | ||
6465 | /* The activation details vtable has defined ops only for path and timer units */ | |
6466 | if (!activation_details_vtable[t]) | |
6467 | return -EINVAL; | |
6468 | ||
6469 | *details = malloc0(activation_details_vtable[t]->object_size); | |
6470 | if (!*details) | |
6471 | return -ENOMEM; | |
6472 | ||
6473 | **details = (ActivationDetails) { | |
6474 | .n_ref = 1, | |
6475 | .trigger_unit_type = t, | |
6476 | }; | |
6477 | ||
6478 | return 0; | |
6479 | } | |
6480 | ||
6481 | if (streq(key, "activation-details-unit-name")) { | |
6482 | r = free_and_strdup(&(*details)->trigger_unit_name, value); | |
6483 | if (r < 0) | |
6484 | return r; | |
6485 | ||
6486 | return 0; | |
6487 | } | |
6488 | ||
6489 | if (ACTIVATION_DETAILS_VTABLE(*details)->deserialize) | |
6490 | return ACTIVATION_DETAILS_VTABLE(*details)->deserialize(key, value, details); | |
6491 | ||
6492 | return -EINVAL; | |
6493 | } | |
6494 | ||
6495 | int activation_details_append_env(ActivationDetails *details, char ***strv) { | |
6496 | int r = 0; | |
6497 | ||
6498 | assert(strv); | |
6499 | ||
6500 | if (!details) | |
6501 | return 0; | |
6502 | ||
6503 | if (!isempty(details->trigger_unit_name)) { | |
6504 | char *s = strjoin("TRIGGER_UNIT=", details->trigger_unit_name); | |
6505 | if (!s) | |
6506 | return -ENOMEM; | |
6507 | ||
6508 | r = strv_consume(strv, TAKE_PTR(s)); | |
6509 | if (r < 0) | |
6510 | return r; | |
6511 | } | |
6512 | ||
6513 | if (ACTIVATION_DETAILS_VTABLE(details)->append_env) { | |
6514 | r = ACTIVATION_DETAILS_VTABLE(details)->append_env(details, strv); | |
6515 | if (r < 0) | |
6516 | return r; | |
6517 | } | |
6518 | ||
6519 | return r + !isempty(details->trigger_unit_name); /* Return the number of variables added to the env block */ | |
6520 | } | |
6521 | ||
6522 | int activation_details_append_pair(ActivationDetails *details, char ***strv) { | |
6523 | int r = 0; | |
6524 | ||
6525 | assert(strv); | |
6526 | ||
6527 | if (!details) | |
6528 | return 0; | |
6529 | ||
6530 | if (!isempty(details->trigger_unit_name)) { | |
6531 | r = strv_extend_many(strv, "trigger_unit", details->trigger_unit_name); | |
6532 | if (r < 0) | |
6533 | return r; | |
6534 | } | |
6535 | ||
6536 | if (ACTIVATION_DETAILS_VTABLE(details)->append_pair) { | |
6537 | r = ACTIVATION_DETAILS_VTABLE(details)->append_pair(details, strv); | |
6538 | if (r < 0) | |
6539 | return r; | |
6540 | } | |
6541 | ||
6542 | return r + !isempty(details->trigger_unit_name); /* Return the number of pairs added to the strv */ | |
6543 | } | |
6544 | ||
6545 | DEFINE_TRIVIAL_REF_UNREF_FUNC(ActivationDetails, activation_details, activation_details_free); | |
6546 | ||
6547 | static const char* const unit_mount_dependency_type_table[_UNIT_MOUNT_DEPENDENCY_TYPE_MAX] = { | |
6548 | [UNIT_MOUNT_WANTS] = "WantsMountsFor", | |
6549 | [UNIT_MOUNT_REQUIRES] = "RequiresMountsFor", | |
6550 | }; | |
6551 | ||
6552 | DEFINE_STRING_TABLE_LOOKUP(unit_mount_dependency_type, UnitMountDependencyType); | |
6553 | ||
6554 | UnitDependency unit_mount_dependency_type_to_dependency_type(UnitMountDependencyType t) { | |
6555 | switch (t) { | |
6556 | ||
6557 | case UNIT_MOUNT_WANTS: | |
6558 | return UNIT_WANTS; | |
6559 | ||
6560 | case UNIT_MOUNT_REQUIRES: | |
6561 | return UNIT_REQUIRES; | |
6562 | ||
6563 | default: | |
6564 | assert_not_reached(); | |
6565 | } | |
6566 | } |