]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
a7334b09 LP |
2 | /*** |
3 | This file is part of systemd. | |
4 | ||
5 | Copyright 2010 Lennart Poettering | |
6 | ||
7 | systemd is free software; you can redistribute it and/or modify it | |
5430f7f2 LP |
8 | under the terms of the GNU Lesser General Public License as published by |
9 | the Free Software Foundation; either version 2.1 of the License, or | |
a7334b09 LP |
10 | (at your option) any later version. |
11 | ||
12 | systemd is distributed in the hope that it will be useful, but | |
13 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
5430f7f2 | 15 | Lesser General Public License for more details. |
a7334b09 | 16 | |
5430f7f2 | 17 | You should have received a copy of the GNU Lesser General Public License |
a7334b09 LP |
18 | along with systemd; If not, see <http://www.gnu.org/licenses/>. |
19 | ***/ | |
20 | ||
87f0e418 | 21 | #include <errno.h> |
0301abf4 | 22 | #include <stdlib.h> |
4f5dd394 | 23 | #include <string.h> |
4c253ed1 | 24 | #include <sys/prctl.h> |
45fb0699 | 25 | #include <sys/stat.h> |
4f5dd394 | 26 | #include <unistd.h> |
87f0e418 | 27 | |
718db961 LP |
28 | #include "sd-id128.h" |
29 | #include "sd-messages.h" | |
4f5dd394 | 30 | |
b5efdb8a | 31 | #include "alloc-util.h" |
4f5dd394 LP |
32 | #include "bus-common-errors.h" |
33 | #include "bus-util.h" | |
c6c18be3 | 34 | #include "cgroup-util.h" |
4f5dd394 LP |
35 | #include "dbus-unit.h" |
36 | #include "dbus.h" | |
37 | #include "dropin.h" | |
38 | #include "escape.h" | |
39 | #include "execute.h" | |
6a48d82f | 40 | #include "fd-util.h" |
a5c32cff | 41 | #include "fileio-label.h" |
f97b34a6 | 42 | #include "format-util.h" |
d3070fbd | 43 | #include "fs-util.h" |
4b58153d | 44 | #include "id128-util.h" |
915b1d01 | 45 | #include "io-util.h" |
4f5dd394 LP |
46 | #include "load-dropin.h" |
47 | #include "load-fragment.h" | |
48 | #include "log.h" | |
49 | #include "macro.h" | |
50 | #include "missing.h" | |
51 | #include "mkdir.h" | |
6bedfcbb | 52 | #include "parse-util.h" |
4f5dd394 | 53 | #include "path-util.h" |
0b452006 | 54 | #include "process-util.h" |
4f5dd394 | 55 | #include "set.h" |
6eb7c172 | 56 | #include "signal-util.h" |
d3070fbd | 57 | #include "sparse-endian.h" |
e9db43d5 | 58 | #include "special.h" |
2e59b241 | 59 | #include "specifier.h" |
8fcde012 | 60 | #include "stat-util.h" |
d054f0a4 | 61 | #include "stdio-util.h" |
5afe510c | 62 | #include "string-table.h" |
07630cea | 63 | #include "string-util.h" |
4f5dd394 | 64 | #include "strv.h" |
4f4afc88 | 65 | #include "umask-util.h" |
4f5dd394 | 66 | #include "unit-name.h" |
e9db43d5 | 67 | #include "unit.h" |
b1d4f8e1 LP |
68 | #include "user-util.h" |
69 | #include "virt.h" | |
87f0e418 LP |
70 | |
71 | const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = { | |
72 | [UNIT_SERVICE] = &service_vtable, | |
87f0e418 LP |
73 | [UNIT_SOCKET] = &socket_vtable, |
74 | [UNIT_TARGET] = &target_vtable, | |
75 | [UNIT_DEVICE] = &device_vtable, | |
76 | [UNIT_MOUNT] = &mount_vtable, | |
77 | [UNIT_AUTOMOUNT] = &automount_vtable, | |
01f78473 | 78 | [UNIT_SWAP] = &swap_vtable, |
e821075a | 79 | [UNIT_TIMER] = &timer_vtable, |
a016b922 | 80 | [UNIT_PATH] = &path_vtable, |
6c12b52e | 81 | [UNIT_SLICE] = &slice_vtable, |
5afe510c | 82 | [UNIT_SCOPE] = &scope_vtable, |
87f0e418 LP |
83 | }; |
84 | ||
f2341e0a | 85 | static void maybe_warn_about_dependency(Unit *u, const char *other, UnitDependency dependency); |
d1fab3fe | 86 | |
7d17cfbc | 87 | Unit *unit_new(Manager *m, size_t size) { |
87f0e418 LP |
88 | Unit *u; |
89 | ||
90 | assert(m); | |
ac155bb8 | 91 | assert(size >= sizeof(Unit)); |
87f0e418 | 92 | |
7d17cfbc MS |
93 | u = malloc0(size); |
94 | if (!u) | |
87f0e418 LP |
95 | return NULL; |
96 | ||
d5099efc | 97 | u->names = set_new(&string_hash_ops); |
6b430fdb ZJS |
98 | if (!u->names) |
99 | return mfree(u); | |
87f0e418 | 100 | |
ac155bb8 MS |
101 | u->manager = m; |
102 | u->type = _UNIT_TYPE_INVALID; | |
ac155bb8 MS |
103 | u->default_dependencies = true; |
104 | u->unit_file_state = _UNIT_FILE_STATE_INVALID; | |
d2dc52db | 105 | u->unit_file_preset = -1; |
d420282b | 106 | u->on_failure_job_mode = JOB_REPLACE; |
efdb0237 | 107 | u->cgroup_inotify_wd = -1; |
36c16a7c | 108 | u->job_timeout = USEC_INFINITY; |
a2df3ea4 | 109 | u->job_running_timeout = USEC_INFINITY; |
00d9ef85 LP |
110 | u->ref_uid = UID_INVALID; |
111 | u->ref_gid = GID_INVALID; | |
fe700f46 | 112 | u->cpu_usage_last = NSEC_INFINITY; |
60c728ad | 113 | u->cgroup_bpf_state = UNIT_CGROUP_BPF_INVALIDATED; |
87f0e418 | 114 | |
6a48d82f DM |
115 | u->ip_accounting_ingress_map_fd = -1; |
116 | u->ip_accounting_egress_map_fd = -1; | |
117 | u->ipv4_allow_map_fd = -1; | |
118 | u->ipv6_allow_map_fd = -1; | |
119 | u->ipv4_deny_map_fd = -1; | |
120 | u->ipv6_deny_map_fd = -1; | |
121 | ||
2e59b241 LP |
122 | u->last_section_private = -1; |
123 | ||
6bf0f408 | 124 | RATELIMIT_INIT(u->start_limit, m->default_start_limit_interval, m->default_start_limit_burst); |
67bfdc97 | 125 | RATELIMIT_INIT(u->auto_stop_ratelimit, 10 * USEC_PER_SEC, 16); |
bea355da | 126 | |
87f0e418 LP |
127 | return u; |
128 | } | |
129 | ||
a581e45a LP |
130 | int unit_new_for_name(Manager *m, size_t size, const char *name, Unit **ret) { |
131 | Unit *u; | |
132 | int r; | |
133 | ||
134 | u = unit_new(m, size); | |
135 | if (!u) | |
136 | return -ENOMEM; | |
137 | ||
138 | r = unit_add_name(u, name); | |
139 | if (r < 0) { | |
140 | unit_free(u); | |
141 | return r; | |
142 | } | |
143 | ||
144 | *ret = u; | |
145 | return r; | |
146 | } | |
147 | ||
f278026d LP |
148 | bool unit_has_name(Unit *u, const char *name) { |
149 | assert(u); | |
150 | assert(name); | |
151 | ||
390bc2b1 | 152 | return set_contains(u->names, (char*) name); |
f278026d LP |
153 | } |
154 | ||
598459ce LP |
155 | static void unit_init(Unit *u) { |
156 | CGroupContext *cc; | |
157 | ExecContext *ec; | |
158 | KillContext *kc; | |
159 | ||
160 | assert(u); | |
161 | assert(u->manager); | |
162 | assert(u->type >= 0); | |
163 | ||
164 | cc = unit_get_cgroup_context(u); | |
165 | if (cc) { | |
166 | cgroup_context_init(cc); | |
167 | ||
168 | /* Copy in the manager defaults into the cgroup | |
169 | * context, _before_ the rest of the settings have | |
170 | * been initialized */ | |
171 | ||
172 | cc->cpu_accounting = u->manager->default_cpu_accounting; | |
13c31542 | 173 | cc->io_accounting = u->manager->default_io_accounting; |
377bfd2d | 174 | cc->ip_accounting = u->manager->default_ip_accounting; |
598459ce LP |
175 | cc->blockio_accounting = u->manager->default_blockio_accounting; |
176 | cc->memory_accounting = u->manager->default_memory_accounting; | |
03a7b521 | 177 | cc->tasks_accounting = u->manager->default_tasks_accounting; |
6a48d82f | 178 | cc->ip_accounting = u->manager->default_ip_accounting; |
0af20ea2 LP |
179 | |
180 | if (u->type != UNIT_SLICE) | |
181 | cc->tasks_max = u->manager->default_tasks_max; | |
598459ce LP |
182 | } |
183 | ||
184 | ec = unit_get_exec_context(u); | |
b1edf445 | 185 | if (ec) { |
598459ce LP |
186 | exec_context_init(ec); |
187 | ||
b1edf445 LP |
188 | ec->keyring_mode = MANAGER_IS_SYSTEM(u->manager) ? |
189 | EXEC_KEYRING_PRIVATE : EXEC_KEYRING_INHERIT; | |
190 | } | |
191 | ||
598459ce LP |
192 | kc = unit_get_kill_context(u); |
193 | if (kc) | |
194 | kill_context_init(kc); | |
195 | ||
196 | if (UNIT_VTABLE(u)->init) | |
197 | UNIT_VTABLE(u)->init(u); | |
198 | } | |
199 | ||
87f0e418 | 200 | int unit_add_name(Unit *u, const char *text) { |
598459ce | 201 | _cleanup_free_ char *s = NULL, *i = NULL; |
87f0e418 | 202 | UnitType t; |
87f0e418 LP |
203 | int r; |
204 | ||
205 | assert(u); | |
206 | assert(text); | |
207 | ||
7410616c | 208 | if (unit_name_is_valid(text, UNIT_NAME_TEMPLATE)) { |
598459ce | 209 | |
ac155bb8 | 210 | if (!u->instance) |
9e2f7c11 | 211 | return -EINVAL; |
87f0e418 | 212 | |
7410616c LP |
213 | r = unit_name_replace_instance(text, u->instance, &s); |
214 | if (r < 0) | |
215 | return r; | |
216 | } else { | |
9e2f7c11 | 217 | s = strdup(text); |
7410616c LP |
218 | if (!s) |
219 | return -ENOMEM; | |
220 | } | |
87f0e418 | 221 | |
7410616c LP |
222 | if (set_contains(u->names, s)) |
223 | return 0; | |
224 | if (hashmap_contains(u->manager->units, s)) | |
225 | return -EEXIST; | |
226 | ||
227 | if (!unit_name_is_valid(s, UNIT_NAME_PLAIN|UNIT_NAME_INSTANCE)) | |
598459ce | 228 | return -EINVAL; |
e537352b | 229 | |
7410616c LP |
230 | t = unit_name_to_type(s); |
231 | if (t < 0) | |
232 | return -EINVAL; | |
87f0e418 | 233 | |
598459ce LP |
234 | if (u->type != _UNIT_TYPE_INVALID && t != u->type) |
235 | return -EINVAL; | |
87f0e418 | 236 | |
e48614c4 ZJS |
237 | r = unit_name_to_instance(s, &i); |
238 | if (r < 0) | |
598459ce | 239 | return r; |
87f0e418 | 240 | |
ce99c68a | 241 | if (i && !unit_type_may_template(t)) |
598459ce | 242 | return -EINVAL; |
9e2f7c11 | 243 | |
276c3e78 | 244 | /* Ensure that this unit is either instanced or not instanced, |
7410616c LP |
245 | * but not both. Note that we do allow names with different |
246 | * instance names however! */ | |
598459ce LP |
247 | if (u->type != _UNIT_TYPE_INVALID && !u->instance != !i) |
248 | return -EINVAL; | |
9e2f7c11 | 249 | |
8a993b61 | 250 | if (!unit_type_may_alias(t) && !set_isempty(u->names)) |
598459ce | 251 | return -EEXIST; |
9e2f7c11 | 252 | |
598459ce LP |
253 | if (hashmap_size(u->manager->units) >= MANAGER_MAX_NAMES) |
254 | return -E2BIG; | |
4f0f902f | 255 | |
e48614c4 | 256 | r = set_put(u->names, s); |
7410616c | 257 | if (r < 0) |
598459ce | 258 | return r; |
7410616c | 259 | assert(r > 0); |
87f0e418 | 260 | |
e48614c4 ZJS |
261 | r = hashmap_put(u->manager->units, s, u); |
262 | if (r < 0) { | |
7410616c | 263 | (void) set_remove(u->names, s); |
598459ce | 264 | return r; |
87f0e418 LP |
265 | } |
266 | ||
ac155bb8 | 267 | if (u->type == _UNIT_TYPE_INVALID) { |
ac155bb8 MS |
268 | u->type = t; |
269 | u->id = s; | |
270 | u->instance = i; | |
9e2f7c11 | 271 | |
71fda00f | 272 | LIST_PREPEND(units_by_type, u->manager->units_by_type[t], u); |
e537352b | 273 | |
598459ce | 274 | unit_init(u); |
87f0e418 | 275 | |
598459ce LP |
276 | i = NULL; |
277 | } | |
9e2f7c11 | 278 | |
598459ce | 279 | s = NULL; |
9e2f7c11 | 280 | |
598459ce LP |
281 | unit_add_to_dbus_queue(u); |
282 | return 0; | |
87f0e418 LP |
283 | } |
284 | ||
0ae97ec1 | 285 | int unit_choose_id(Unit *u, const char *name) { |
68eda4bd | 286 | _cleanup_free_ char *t = NULL; |
598459ce | 287 | char *s, *i; |
276c3e78 | 288 | int r; |
0ae97ec1 LP |
289 | |
290 | assert(u); | |
291 | assert(name); | |
292 | ||
7410616c | 293 | if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { |
9e2f7c11 | 294 | |
ac155bb8 | 295 | if (!u->instance) |
9e2f7c11 LP |
296 | return -EINVAL; |
297 | ||
7410616c LP |
298 | r = unit_name_replace_instance(name, u->instance, &t); |
299 | if (r < 0) | |
300 | return r; | |
9e2f7c11 LP |
301 | |
302 | name = t; | |
303 | } | |
304 | ||
0ae97ec1 | 305 | /* Selects one of the names of this unit as the id */ |
ac155bb8 | 306 | s = set_get(u->names, (char*) name); |
9e2f7c11 | 307 | if (!s) |
0ae97ec1 LP |
308 | return -ENOENT; |
309 | ||
7410616c | 310 | /* Determine the new instance from the new id */ |
e48614c4 ZJS |
311 | r = unit_name_to_instance(s, &i); |
312 | if (r < 0) | |
276c3e78 LP |
313 | return r; |
314 | ||
ac155bb8 | 315 | u->id = s; |
276c3e78 | 316 | |
ac155bb8 MS |
317 | free(u->instance); |
318 | u->instance = i; | |
276c3e78 | 319 | |
c1e1601e | 320 | unit_add_to_dbus_queue(u); |
9e2f7c11 | 321 | |
0ae97ec1 LP |
322 | return 0; |
323 | } | |
324 | ||
f50e0a01 | 325 | int unit_set_description(Unit *u, const char *description) { |
84b26d51 | 326 | int r; |
f50e0a01 LP |
327 | |
328 | assert(u); | |
329 | ||
84b26d51 LP |
330 | r = free_and_strdup(&u->description, empty_to_null(description)); |
331 | if (r < 0) | |
332 | return r; | |
333 | if (r > 0) | |
334 | unit_add_to_dbus_queue(u); | |
c1e1601e | 335 | |
f50e0a01 LP |
336 | return 0; |
337 | } | |
338 | ||
f2f725e5 | 339 | bool unit_may_gc(Unit *u) { |
a354329f | 340 | UnitActiveState state; |
e98b2fbb | 341 | int r; |
5afe510c | 342 | |
701cc384 LP |
343 | assert(u); |
344 | ||
f2f725e5 ZJS |
345 | /* Checks whether the unit is ready to be unloaded for garbage collection. |
346 | * Returns true when the unit may be collected, and false if there's some | |
347 | * reason to keep it loaded. */ | |
5afe510c | 348 | |
a354329f | 349 | if (u->job) |
f2f725e5 | 350 | return false; |
701cc384 | 351 | |
a354329f | 352 | if (u->nop_job) |
f2f725e5 | 353 | return false; |
6c073082 | 354 | |
a354329f LP |
355 | state = unit_active_state(u); |
356 | ||
7eb2a8a1 | 357 | /* If the unit is inactive and failed and no job is queued for it, then release its runtime resources */ |
a354329f LP |
358 | if (UNIT_IS_INACTIVE_OR_FAILED(state) && |
359 | UNIT_VTABLE(u)->release_resources) | |
7eb2a8a1 | 360 | UNIT_VTABLE(u)->release_resources(u); |
a354329f | 361 | |
f5869324 | 362 | if (u->perpetual) |
f2f725e5 | 363 | return false; |
701cc384 | 364 | |
7f7d01ed | 365 | if (u->refs_by_target) |
f2f725e5 | 366 | return false; |
9d576438 | 367 | |
05a98afd | 368 | if (sd_bus_track_count(u->bus_track) > 0) |
f2f725e5 | 369 | return false; |
05a98afd | 370 | |
5afe510c LP |
371 | /* But we keep the unit object around for longer when it is referenced or configured to not be gc'ed */ |
372 | switch (u->collect_mode) { | |
373 | ||
374 | case COLLECT_INACTIVE: | |
375 | if (state != UNIT_INACTIVE) | |
f2f725e5 | 376 | return false; |
5afe510c LP |
377 | |
378 | break; | |
379 | ||
380 | case COLLECT_INACTIVE_OR_FAILED: | |
381 | if (!IN_SET(state, UNIT_INACTIVE, UNIT_FAILED)) | |
f2f725e5 | 382 | return false; |
5afe510c LP |
383 | |
384 | break; | |
385 | ||
386 | default: | |
387 | assert_not_reached("Unknown garbage collection mode"); | |
388 | } | |
389 | ||
e98b2fbb LP |
390 | if (u->cgroup_path) { |
391 | /* If the unit has a cgroup, then check whether there's anything in it. If so, we should stay | |
392 | * around. Units with active processes should never be collected. */ | |
393 | ||
394 | r = cg_is_empty_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path); | |
395 | if (r < 0) | |
396 | log_unit_debug_errno(u, r, "Failed to determine whether cgroup %s is empty: %m", u->cgroup_path); | |
397 | if (r <= 0) | |
f2f725e5 | 398 | return false; |
e98b2fbb LP |
399 | } |
400 | ||
f2f725e5 ZJS |
401 | if (UNIT_VTABLE(u)->may_gc && !UNIT_VTABLE(u)->may_gc(u)) |
402 | return false; | |
701cc384 | 403 | |
f2f725e5 | 404 | return true; |
701cc384 LP |
405 | } |
406 | ||
87f0e418 LP |
407 | void unit_add_to_load_queue(Unit *u) { |
408 | assert(u); | |
ac155bb8 | 409 | assert(u->type != _UNIT_TYPE_INVALID); |
87f0e418 | 410 | |
ac155bb8 | 411 | if (u->load_state != UNIT_STUB || u->in_load_queue) |
87f0e418 LP |
412 | return; |
413 | ||
71fda00f | 414 | LIST_PREPEND(load_queue, u->manager->load_queue, u); |
ac155bb8 | 415 | u->in_load_queue = true; |
87f0e418 LP |
416 | } |
417 | ||
23a177ef LP |
418 | void unit_add_to_cleanup_queue(Unit *u) { |
419 | assert(u); | |
420 | ||
ac155bb8 | 421 | if (u->in_cleanup_queue) |
23a177ef LP |
422 | return; |
423 | ||
71fda00f | 424 | LIST_PREPEND(cleanup_queue, u->manager->cleanup_queue, u); |
ac155bb8 | 425 | u->in_cleanup_queue = true; |
23a177ef LP |
426 | } |
427 | ||
701cc384 LP |
428 | void unit_add_to_gc_queue(Unit *u) { |
429 | assert(u); | |
430 | ||
ac155bb8 | 431 | if (u->in_gc_queue || u->in_cleanup_queue) |
701cc384 LP |
432 | return; |
433 | ||
f2f725e5 | 434 | if (!unit_may_gc(u)) |
701cc384 LP |
435 | return; |
436 | ||
c5a97ed1 | 437 | LIST_PREPEND(gc_queue, u->manager->gc_unit_queue, u); |
ac155bb8 | 438 | u->in_gc_queue = true; |
701cc384 LP |
439 | } |
440 | ||
c1e1601e LP |
441 | void unit_add_to_dbus_queue(Unit *u) { |
442 | assert(u); | |
ac155bb8 | 443 | assert(u->type != _UNIT_TYPE_INVALID); |
c1e1601e | 444 | |
ac155bb8 | 445 | if (u->load_state == UNIT_STUB || u->in_dbus_queue) |
c1e1601e LP |
446 | return; |
447 | ||
a567261a | 448 | /* Shortcut things if nobody cares */ |
8f8f05a9 | 449 | if (sd_bus_track_count(u->manager->subscribed) <= 0 && |
ae572acd | 450 | sd_bus_track_count(u->bus_track) <= 0 && |
8f8f05a9 | 451 | set_isempty(u->manager->private_buses)) { |
ac155bb8 | 452 | u->sent_dbus_new_signal = true; |
94b6dfa2 LP |
453 | return; |
454 | } | |
455 | ||
71fda00f | 456 | LIST_PREPEND(dbus_queue, u->manager->dbus_unit_queue, u); |
ac155bb8 | 457 | u->in_dbus_queue = true; |
c1e1601e LP |
458 | } |
459 | ||
eef85c4a | 460 | static void bidi_set_free(Unit *u, Hashmap *h) { |
87f0e418 | 461 | Unit *other; |
eef85c4a LP |
462 | Iterator i; |
463 | void *v; | |
87f0e418 LP |
464 | |
465 | assert(u); | |
466 | ||
eef85c4a | 467 | /* Frees the hashmap and makes sure we are dropped from the inverse pointers */ |
87f0e418 | 468 | |
eef85c4a | 469 | HASHMAP_FOREACH_KEY(v, other, h, i) { |
87f0e418 LP |
470 | UnitDependency d; |
471 | ||
472 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) | |
eef85c4a | 473 | hashmap_remove(other->dependencies[d], u); |
701cc384 LP |
474 | |
475 | unit_add_to_gc_queue(other); | |
87f0e418 LP |
476 | } |
477 | ||
eef85c4a | 478 | hashmap_free(h); |
87f0e418 LP |
479 | } |
480 | ||
c2756a68 LP |
481 | static void unit_remove_transient(Unit *u) { |
482 | char **i; | |
483 | ||
484 | assert(u); | |
485 | ||
486 | if (!u->transient) | |
487 | return; | |
488 | ||
489 | if (u->fragment_path) | |
3f5e8115 | 490 | (void) unlink(u->fragment_path); |
c2756a68 LP |
491 | |
492 | STRV_FOREACH(i, u->dropin_paths) { | |
39591351 | 493 | _cleanup_free_ char *p = NULL, *pp = NULL; |
c2756a68 | 494 | |
39591351 LP |
495 | p = dirname_malloc(*i); /* Get the drop-in directory from the drop-in file */ |
496 | if (!p) | |
497 | continue; | |
498 | ||
499 | pp = dirname_malloc(p); /* Get the config directory from the drop-in directory */ | |
500 | if (!pp) | |
501 | continue; | |
502 | ||
503 | /* Only drop transient drop-ins */ | |
504 | if (!path_equal(u->manager->lookup_paths.transient, pp)) | |
505 | continue; | |
c2756a68 | 506 | |
39591351 LP |
507 | (void) unlink(*i); |
508 | (void) rmdir(p); | |
c2756a68 LP |
509 | } |
510 | } | |
511 | ||
a57f7e2c | 512 | static void unit_free_requires_mounts_for(Unit *u) { |
eef85c4a | 513 | assert(u); |
a57f7e2c | 514 | |
eef85c4a LP |
515 | for (;;) { |
516 | _cleanup_free_ char *path; | |
a57f7e2c | 517 | |
eef85c4a LP |
518 | path = hashmap_steal_first_key(u->requires_mounts_for); |
519 | if (!path) | |
520 | break; | |
521 | else { | |
522 | char s[strlen(path) + 1]; | |
a57f7e2c | 523 | |
eef85c4a LP |
524 | PATH_FOREACH_PREFIX_MORE(s, path) { |
525 | char *y; | |
526 | Set *x; | |
527 | ||
528 | x = hashmap_get2(u->manager->units_requiring_mounts_for, s, (void**) &y); | |
529 | if (!x) | |
530 | continue; | |
a57f7e2c | 531 | |
eef85c4a | 532 | (void) set_remove(x, u); |
a57f7e2c | 533 | |
eef85c4a LP |
534 | if (set_isempty(x)) { |
535 | (void) hashmap_remove(u->manager->units_requiring_mounts_for, y); | |
536 | free(y); | |
537 | set_free(x); | |
538 | } | |
a57f7e2c LP |
539 | } |
540 | } | |
541 | } | |
542 | ||
eef85c4a | 543 | u->requires_mounts_for = hashmap_free(u->requires_mounts_for); |
a57f7e2c LP |
544 | } |
545 | ||
598459ce LP |
546 | static void unit_done(Unit *u) { |
547 | ExecContext *ec; | |
548 | CGroupContext *cc; | |
549 | ||
550 | assert(u); | |
551 | ||
552 | if (u->type < 0) | |
553 | return; | |
554 | ||
555 | if (UNIT_VTABLE(u)->done) | |
556 | UNIT_VTABLE(u)->done(u); | |
557 | ||
558 | ec = unit_get_exec_context(u); | |
559 | if (ec) | |
560 | exec_context_done(ec); | |
561 | ||
562 | cc = unit_get_cgroup_context(u); | |
563 | if (cc) | |
564 | cgroup_context_done(cc); | |
565 | } | |
566 | ||
87f0e418 LP |
567 | void unit_free(Unit *u) { |
568 | UnitDependency d; | |
569 | Iterator i; | |
570 | char *t; | |
571 | ||
c9d5c9c0 LP |
572 | if (!u) |
573 | return; | |
87f0e418 | 574 | |
50fb00b7 | 575 | u->transient_file = safe_fclose(u->transient_file); |
4f4afc88 | 576 | |
2c289ea8 | 577 | if (!MANAGER_IS_RELOADING(u->manager)) |
c2756a68 LP |
578 | unit_remove_transient(u); |
579 | ||
c1e1601e LP |
580 | bus_unit_send_removed_signal(u); |
581 | ||
598459ce | 582 | unit_done(u); |
a013b84b | 583 | |
cf9fd508 DM |
584 | sd_bus_slot_unref(u->match_bus_slot); |
585 | ||
05a98afd LP |
586 | sd_bus_track_unref(u->bus_track); |
587 | u->deserialized_refs = strv_free(u->deserialized_refs); | |
588 | ||
a57f7e2c LP |
589 | unit_free_requires_mounts_for(u); |
590 | ||
ac155bb8 MS |
591 | SET_FOREACH(t, u->names, i) |
592 | hashmap_remove_value(u->manager->units, t, u); | |
87f0e418 | 593 | |
4b58153d LP |
594 | if (!sd_id128_is_null(u->invocation_id)) |
595 | hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
596 | ||
97e7d748 MS |
597 | if (u->job) { |
598 | Job *j = u->job; | |
599 | job_uninstall(j); | |
600 | job_free(j); | |
601 | } | |
964e0949 | 602 | |
e0209d83 MS |
603 | if (u->nop_job) { |
604 | Job *j = u->nop_job; | |
605 | job_uninstall(j); | |
606 | job_free(j); | |
607 | } | |
608 | ||
964e0949 | 609 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) |
ac155bb8 | 610 | bidi_set_free(u, u->dependencies[d]); |
964e0949 | 611 | |
ac155bb8 | 612 | if (u->type != _UNIT_TYPE_INVALID) |
71fda00f | 613 | LIST_REMOVE(units_by_type, u->manager->units_by_type[u->type], u); |
ef734fd6 | 614 | |
ac155bb8 | 615 | if (u->in_load_queue) |
71fda00f | 616 | LIST_REMOVE(load_queue, u->manager->load_queue, u); |
87f0e418 | 617 | |
ac155bb8 | 618 | if (u->in_dbus_queue) |
71fda00f | 619 | LIST_REMOVE(dbus_queue, u->manager->dbus_unit_queue, u); |
c1e1601e | 620 | |
ac155bb8 | 621 | if (u->in_cleanup_queue) |
71fda00f | 622 | LIST_REMOVE(cleanup_queue, u->manager->cleanup_queue, u); |
23a177ef | 623 | |
a2d72e26 | 624 | if (u->in_gc_queue) |
c5a97ed1 | 625 | LIST_REMOVE(gc_queue, u->manager->gc_unit_queue, u); |
701cc384 | 626 | |
91a6073e LP |
627 | if (u->in_cgroup_realize_queue) |
628 | LIST_REMOVE(cgroup_realize_queue, u->manager->cgroup_realize_queue, u); | |
87f0e418 | 629 | |
09e24654 LP |
630 | if (u->in_cgroup_empty_queue) |
631 | LIST_REMOVE(cgroup_empty_queue, u->manager->cgroup_empty_queue, u); | |
632 | ||
adefcf28 LP |
633 | if (u->on_console) |
634 | manager_unref_console(u->manager); | |
635 | ||
efdb0237 | 636 | unit_release_cgroup(u); |
72673e86 | 637 | |
d3070fbd LP |
638 | if (!MANAGER_IS_RELOADING(u->manager)) |
639 | unit_unlink_state_files(u); | |
640 | ||
00d9ef85 LP |
641 | unit_unref_uid_gid(u, false); |
642 | ||
5269eb6b | 643 | (void) manager_update_failed_units(u->manager, u, false); |
db785129 | 644 | set_remove(u->manager->startup_units, u); |
f755e3b7 | 645 | |
ac155bb8 | 646 | free(u->description); |
49dbfa7b | 647 | strv_free(u->documentation); |
ac155bb8 | 648 | free(u->fragment_path); |
1b64d026 | 649 | free(u->source_path); |
ae7a7182 | 650 | strv_free(u->dropin_paths); |
ac155bb8 | 651 | free(u->instance); |
87f0e418 | 652 | |
f189ab18 LP |
653 | free(u->job_timeout_reboot_arg); |
654 | ||
ac155bb8 | 655 | set_free_free(u->names); |
87f0e418 | 656 | |
a911bb9a LP |
657 | unit_unwatch_all_pids(u); |
658 | ||
ac155bb8 | 659 | condition_free_list(u->conditions); |
59fccdc5 | 660 | condition_free_list(u->asserts); |
52661efd | 661 | |
6bf0f408 LP |
662 | free(u->reboot_arg); |
663 | ||
702a2d8f | 664 | unit_ref_unset(&u->slice); |
7f7d01ed ZJS |
665 | while (u->refs_by_target) |
666 | unit_ref_unset(u->refs_by_target); | |
57020a3a | 667 | |
6a48d82f DM |
668 | safe_close(u->ip_accounting_ingress_map_fd); |
669 | safe_close(u->ip_accounting_egress_map_fd); | |
670 | ||
671 | safe_close(u->ipv4_allow_map_fd); | |
672 | safe_close(u->ipv6_allow_map_fd); | |
673 | safe_close(u->ipv4_deny_map_fd); | |
674 | safe_close(u->ipv6_deny_map_fd); | |
675 | ||
676 | bpf_program_unref(u->ip_bpf_ingress); | |
677 | bpf_program_unref(u->ip_bpf_egress); | |
678 | ||
87f0e418 LP |
679 | free(u); |
680 | } | |
681 | ||
682 | UnitActiveState unit_active_state(Unit *u) { | |
683 | assert(u); | |
684 | ||
ac155bb8 | 685 | if (u->load_state == UNIT_MERGED) |
6124958c LP |
686 | return unit_active_state(unit_follow_merge(u)); |
687 | ||
688 | /* After a reload it might happen that a unit is not correctly | |
689 | * loaded but still has a process around. That's why we won't | |
fdf20a31 | 690 | * shortcut failed loading to UNIT_INACTIVE_FAILED. */ |
87f0e418 LP |
691 | |
692 | return UNIT_VTABLE(u)->active_state(u); | |
693 | } | |
694 | ||
10a94420 LP |
695 | const char* unit_sub_state_to_string(Unit *u) { |
696 | assert(u); | |
697 | ||
698 | return UNIT_VTABLE(u)->sub_state_to_string(u); | |
699 | } | |
700 | ||
eef85c4a LP |
701 | static int set_complete_move(Set **s, Set **other) { |
702 | assert(s); | |
703 | assert(other); | |
704 | ||
705 | if (!other) | |
706 | return 0; | |
707 | ||
708 | if (*s) | |
709 | return set_move(*s, *other); | |
710 | else { | |
711 | *s = *other; | |
712 | *other = NULL; | |
713 | } | |
7c0b05e5 | 714 | |
eef85c4a LP |
715 | return 0; |
716 | } | |
717 | ||
718 | static int hashmap_complete_move(Hashmap **s, Hashmap **other) { | |
23a177ef LP |
719 | assert(s); |
720 | assert(other); | |
87f0e418 | 721 | |
23a177ef | 722 | if (!*other) |
7c0b05e5 | 723 | return 0; |
87f0e418 | 724 | |
eef85c4a LP |
725 | if (*s) |
726 | return hashmap_move(*s, *other); | |
727 | else { | |
23a177ef LP |
728 | *s = *other; |
729 | *other = NULL; | |
730 | } | |
7c0b05e5 MS |
731 | |
732 | return 0; | |
23a177ef | 733 | } |
87f0e418 | 734 | |
7c0b05e5 | 735 | static int merge_names(Unit *u, Unit *other) { |
23a177ef LP |
736 | char *t; |
737 | Iterator i; | |
7c0b05e5 | 738 | int r; |
87f0e418 | 739 | |
23a177ef LP |
740 | assert(u); |
741 | assert(other); | |
742 | ||
eef85c4a | 743 | r = set_complete_move(&u->names, &other->names); |
7c0b05e5 MS |
744 | if (r < 0) |
745 | return r; | |
23a177ef | 746 | |
ac155bb8 MS |
747 | set_free_free(other->names); |
748 | other->names = NULL; | |
749 | other->id = NULL; | |
23a177ef | 750 | |
ac155bb8 MS |
751 | SET_FOREACH(t, u->names, i) |
752 | assert_se(hashmap_replace(u->manager->units, t, u) == 0); | |
7c0b05e5 MS |
753 | |
754 | return 0; | |
87f0e418 LP |
755 | } |
756 | ||
09a65f92 MS |
757 | static int reserve_dependencies(Unit *u, Unit *other, UnitDependency d) { |
758 | unsigned n_reserve; | |
759 | ||
760 | assert(u); | |
761 | assert(other); | |
762 | assert(d < _UNIT_DEPENDENCY_MAX); | |
763 | ||
764 | /* | |
765 | * If u does not have this dependency set allocated, there is no need | |
f131770b | 766 | * to reserve anything. In that case other's set will be transferred |
09a65f92 MS |
767 | * as a whole to u by complete_move(). |
768 | */ | |
769 | if (!u->dependencies[d]) | |
770 | return 0; | |
771 | ||
772 | /* merge_dependencies() will skip a u-on-u dependency */ | |
eef85c4a | 773 | n_reserve = hashmap_size(other->dependencies[d]) - !!hashmap_get(other->dependencies[d], u); |
09a65f92 | 774 | |
eef85c4a | 775 | return hashmap_reserve(u->dependencies[d], n_reserve); |
09a65f92 MS |
776 | } |
777 | ||
d1fab3fe | 778 | static void merge_dependencies(Unit *u, Unit *other, const char *other_id, UnitDependency d) { |
23a177ef LP |
779 | Iterator i; |
780 | Unit *back; | |
eef85c4a | 781 | void *v; |
87f0e418 | 782 | int r; |
23a177ef | 783 | |
eef85c4a LP |
784 | /* Merges all dependencies of type 'd' of the unit 'other' into the deps of the unit 'u' */ |
785 | ||
23a177ef LP |
786 | assert(u); |
787 | assert(other); | |
788 | assert(d < _UNIT_DEPENDENCY_MAX); | |
789 | ||
eef85c4a LP |
790 | /* Fix backwards pointers. Let's iterate through all dependendent units of the other unit. */ |
791 | HASHMAP_FOREACH_KEY(v, back, other->dependencies[d], i) { | |
23a177ef LP |
792 | UnitDependency k; |
793 | ||
eef85c4a LP |
794 | /* Let's now iterate through the dependencies of that dependencies of the other units, looking for |
795 | * pointers back, and let's fix them up, to instead point to 'u'. */ | |
796 | ||
e48614c4 | 797 | for (k = 0; k < _UNIT_DEPENDENCY_MAX; k++) { |
e66047ff | 798 | if (back == u) { |
eef85c4a LP |
799 | /* Do not add dependencies between u and itself. */ |
800 | if (hashmap_remove(back->dependencies[k], other)) | |
f2341e0a | 801 | maybe_warn_about_dependency(u, other_id, k); |
e66047ff | 802 | } else { |
eef85c4a LP |
803 | UnitDependencyInfo di_u, di_other, di_merged; |
804 | ||
805 | /* Let's drop this dependency between "back" and "other", and let's create it between | |
806 | * "back" and "u" instead. Let's merge the bit masks of the dependency we are moving, | |
807 | * and any such dependency which might already exist */ | |
808 | ||
809 | di_other.data = hashmap_get(back->dependencies[k], other); | |
810 | if (!di_other.data) | |
811 | continue; /* dependency isn't set, let's try the next one */ | |
812 | ||
813 | di_u.data = hashmap_get(back->dependencies[k], u); | |
814 | ||
815 | di_merged = (UnitDependencyInfo) { | |
816 | .origin_mask = di_u.origin_mask | di_other.origin_mask, | |
817 | .destination_mask = di_u.destination_mask | di_other.destination_mask, | |
818 | }; | |
819 | ||
820 | r = hashmap_remove_and_replace(back->dependencies[k], other, u, di_merged.data); | |
821 | if (r < 0) | |
822 | log_warning_errno(r, "Failed to remove/replace: back=%s other=%s u=%s: %m", back->id, other_id, u->id); | |
823 | assert(r >= 0); | |
824 | ||
825 | /* assert_se(hashmap_remove_and_replace(back->dependencies[k], other, u, di_merged.data) >= 0); */ | |
e66047ff | 826 | } |
e48614c4 | 827 | } |
eef85c4a | 828 | |
23a177ef LP |
829 | } |
830 | ||
e66047ff | 831 | /* Also do not move dependencies on u to itself */ |
eef85c4a | 832 | back = hashmap_remove(other->dependencies[d], u); |
d1fab3fe | 833 | if (back) |
f2341e0a | 834 | maybe_warn_about_dependency(u, other_id, d); |
e66047ff | 835 | |
7c0b05e5 | 836 | /* The move cannot fail. The caller must have performed a reservation. */ |
eef85c4a | 837 | assert_se(hashmap_complete_move(&u->dependencies[d], &other->dependencies[d]) == 0); |
23a177ef | 838 | |
eef85c4a | 839 | other->dependencies[d] = hashmap_free(other->dependencies[d]); |
23a177ef LP |
840 | } |
841 | ||
842 | int unit_merge(Unit *u, Unit *other) { | |
87f0e418 | 843 | UnitDependency d; |
d1fab3fe | 844 | const char *other_id = NULL; |
09a65f92 | 845 | int r; |
87f0e418 LP |
846 | |
847 | assert(u); | |
848 | assert(other); | |
ac155bb8 MS |
849 | assert(u->manager == other->manager); |
850 | assert(u->type != _UNIT_TYPE_INVALID); | |
87f0e418 | 851 | |
cc916967 LP |
852 | other = unit_follow_merge(other); |
853 | ||
23a177ef LP |
854 | if (other == u) |
855 | return 0; | |
856 | ||
ac155bb8 | 857 | if (u->type != other->type) |
9e2f7c11 LP |
858 | return -EINVAL; |
859 | ||
ac155bb8 | 860 | if (!u->instance != !other->instance) |
87f0e418 LP |
861 | return -EINVAL; |
862 | ||
8a993b61 | 863 | if (!unit_type_may_alias(u->type)) /* Merging only applies to unit names that support aliases */ |
934e749e LP |
864 | return -EEXIST; |
865 | ||
ec2ce0c5 | 866 | if (!IN_SET(other->load_state, UNIT_STUB, UNIT_NOT_FOUND)) |
23a177ef | 867 | return -EEXIST; |
87f0e418 | 868 | |
ac155bb8 | 869 | if (other->job) |
819e213f LP |
870 | return -EEXIST; |
871 | ||
e0209d83 MS |
872 | if (other->nop_job) |
873 | return -EEXIST; | |
874 | ||
fdf20a31 | 875 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other))) |
819e213f LP |
876 | return -EEXIST; |
877 | ||
d1fab3fe ZJS |
878 | if (other->id) |
879 | other_id = strdupa(other->id); | |
880 | ||
09a65f92 MS |
881 | /* Make reservations to ensure merge_dependencies() won't fail */ |
882 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) { | |
883 | r = reserve_dependencies(u, other, d); | |
884 | /* | |
885 | * We don't rollback reservations if we fail. We don't have | |
886 | * a way to undo reservations. A reservation is not a leak. | |
887 | */ | |
888 | if (r < 0) | |
889 | return r; | |
890 | } | |
891 | ||
87f0e418 | 892 | /* Merge names */ |
7c0b05e5 MS |
893 | r = merge_names(u, other); |
894 | if (r < 0) | |
895 | return r; | |
87f0e418 | 896 | |
57020a3a | 897 | /* Redirect all references */ |
7f7d01ed ZJS |
898 | while (other->refs_by_target) |
899 | unit_ref_set(other->refs_by_target, other->refs_by_target->source, u); | |
57020a3a | 900 | |
87f0e418 LP |
901 | /* Merge dependencies */ |
902 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) | |
d1fab3fe | 903 | merge_dependencies(u, other, other_id, d); |
87f0e418 | 904 | |
ac155bb8 MS |
905 | other->load_state = UNIT_MERGED; |
906 | other->merged_into = u; | |
23a177ef | 907 | |
3616a49c LP |
908 | /* If there is still some data attached to the other node, we |
909 | * don't need it anymore, and can free it. */ | |
ac155bb8 | 910 | if (other->load_state != UNIT_STUB) |
3616a49c LP |
911 | if (UNIT_VTABLE(other)->done) |
912 | UNIT_VTABLE(other)->done(other); | |
913 | ||
914 | unit_add_to_dbus_queue(u); | |
23a177ef LP |
915 | unit_add_to_cleanup_queue(other); |
916 | ||
917 | return 0; | |
918 | } | |
919 | ||
920 | int unit_merge_by_name(Unit *u, const char *name) { | |
934e749e | 921 | _cleanup_free_ char *s = NULL; |
23a177ef | 922 | Unit *other; |
9e2f7c11 | 923 | int r; |
23a177ef LP |
924 | |
925 | assert(u); | |
926 | assert(name); | |
927 | ||
7410616c | 928 | if (unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { |
ac155bb8 | 929 | if (!u->instance) |
9e2f7c11 LP |
930 | return -EINVAL; |
931 | ||
7410616c LP |
932 | r = unit_name_replace_instance(name, u->instance, &s); |
933 | if (r < 0) | |
934 | return r; | |
9e2f7c11 LP |
935 | |
936 | name = s; | |
937 | } | |
938 | ||
c2756a68 | 939 | other = manager_get_unit(u->manager, name); |
7410616c LP |
940 | if (other) |
941 | return unit_merge(u, other); | |
23a177ef | 942 | |
7410616c | 943 | return unit_add_name(u, name); |
23a177ef LP |
944 | } |
945 | ||
946 | Unit* unit_follow_merge(Unit *u) { | |
947 | assert(u); | |
948 | ||
ac155bb8 MS |
949 | while (u->load_state == UNIT_MERGED) |
950 | assert_se(u = u->merged_into); | |
23a177ef LP |
951 | |
952 | return u; | |
953 | } | |
954 | ||
955 | int unit_add_exec_dependencies(Unit *u, ExecContext *c) { | |
ada5e276 YW |
956 | ExecDirectoryType dt; |
957 | char **dp; | |
23a177ef LP |
958 | int r; |
959 | ||
960 | assert(u); | |
961 | assert(c); | |
962 | ||
36be24c8 | 963 | if (c->working_directory) { |
eef85c4a | 964 | r = unit_require_mounts_for(u, c->working_directory, UNIT_DEPENDENCY_FILE); |
36be24c8 ZJS |
965 | if (r < 0) |
966 | return r; | |
967 | } | |
968 | ||
969 | if (c->root_directory) { | |
eef85c4a | 970 | r = unit_require_mounts_for(u, c->root_directory, UNIT_DEPENDENCY_FILE); |
36be24c8 ZJS |
971 | if (r < 0) |
972 | return r; | |
973 | } | |
974 | ||
915e6d16 | 975 | if (c->root_image) { |
eef85c4a | 976 | r = unit_require_mounts_for(u, c->root_image, UNIT_DEPENDENCY_FILE); |
915e6d16 LP |
977 | if (r < 0) |
978 | return r; | |
979 | } | |
980 | ||
72fd1768 | 981 | for (dt = 0; dt < _EXEC_DIRECTORY_TYPE_MAX; dt++) { |
ada5e276 YW |
982 | if (!u->manager->prefix[dt]) |
983 | continue; | |
984 | ||
985 | STRV_FOREACH(dp, c->directories[dt].paths) { | |
986 | _cleanup_free_ char *p; | |
987 | ||
988 | p = strjoin(u->manager->prefix[dt], "/", *dp); | |
989 | if (!p) | |
990 | return -ENOMEM; | |
991 | ||
eef85c4a | 992 | r = unit_require_mounts_for(u, p, UNIT_DEPENDENCY_FILE); |
ada5e276 YW |
993 | if (r < 0) |
994 | return r; | |
995 | } | |
996 | } | |
997 | ||
463d0d15 | 998 | if (!MANAGER_IS_SYSTEM(u->manager)) |
b46a529c LP |
999 | return 0; |
1000 | ||
1001 | if (c->private_tmp) { | |
d71f0505 LP |
1002 | const char *p; |
1003 | ||
1004 | FOREACH_STRING(p, "/tmp", "/var/tmp") { | |
eef85c4a | 1005 | r = unit_require_mounts_for(u, p, UNIT_DEPENDENCY_FILE); |
d71f0505 LP |
1006 | if (r < 0) |
1007 | return r; | |
1008 | } | |
b46a529c | 1009 | |
eef85c4a | 1010 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_TMPFILES_SETUP_SERVICE, NULL, true, UNIT_DEPENDENCY_FILE); |
b46a529c LP |
1011 | if (r < 0) |
1012 | return r; | |
1013 | } | |
1014 | ||
52c239d7 LB |
1015 | if (!IN_SET(c->std_output, |
1016 | EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE, | |
1017 | EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE, | |
1018 | EXEC_OUTPUT_SYSLOG, EXEC_OUTPUT_SYSLOG_AND_CONSOLE) && | |
1019 | !IN_SET(c->std_error, | |
1020 | EXEC_OUTPUT_JOURNAL, EXEC_OUTPUT_JOURNAL_AND_CONSOLE, | |
1021 | EXEC_OUTPUT_KMSG, EXEC_OUTPUT_KMSG_AND_CONSOLE, | |
1022 | EXEC_OUTPUT_SYSLOG, EXEC_OUTPUT_SYSLOG_AND_CONSOLE)) | |
23a177ef LP |
1023 | return 0; |
1024 | ||
1025 | /* If syslog or kernel logging is requested, make sure our own | |
1026 | * logging daemon is run first. */ | |
1027 | ||
eef85c4a | 1028 | r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_JOURNALD_SOCKET, NULL, true, UNIT_DEPENDENCY_FILE); |
b46a529c LP |
1029 | if (r < 0) |
1030 | return r; | |
23a177ef | 1031 | |
87f0e418 LP |
1032 | return 0; |
1033 | } | |
1034 | ||
87f0e418 LP |
1035 | const char *unit_description(Unit *u) { |
1036 | assert(u); | |
1037 | ||
ac155bb8 MS |
1038 | if (u->description) |
1039 | return u->description; | |
87f0e418 | 1040 | |
ac155bb8 | 1041 | return strna(u->id); |
87f0e418 LP |
1042 | } |
1043 | ||
eef85c4a LP |
1044 | static void print_unit_dependency_mask(FILE *f, const char *kind, UnitDependencyMask mask, bool *space) { |
1045 | const struct { | |
1046 | UnitDependencyMask mask; | |
1047 | const char *name; | |
1048 | } table[] = { | |
1049 | { UNIT_DEPENDENCY_FILE, "file" }, | |
1050 | { UNIT_DEPENDENCY_IMPLICIT, "implicit" }, | |
1051 | { UNIT_DEPENDENCY_DEFAULT, "default" }, | |
1052 | { UNIT_DEPENDENCY_UDEV, "udev" }, | |
1053 | { UNIT_DEPENDENCY_PATH, "path" }, | |
1054 | { UNIT_DEPENDENCY_MOUNTINFO_IMPLICIT, "mountinfo-implicit" }, | |
1055 | { UNIT_DEPENDENCY_MOUNTINFO_DEFAULT, "mountinfo-default" }, | |
1056 | { UNIT_DEPENDENCY_PROC_SWAP, "proc-swap" }, | |
1057 | }; | |
1058 | size_t i; | |
1059 | ||
1060 | assert(f); | |
1061 | assert(kind); | |
1062 | assert(space); | |
1063 | ||
1064 | for (i = 0; i < ELEMENTSOF(table); i++) { | |
1065 | ||
1066 | if (mask == 0) | |
1067 | break; | |
1068 | ||
1069 | if ((mask & table[i].mask) == table[i].mask) { | |
1070 | if (*space) | |
1071 | fputc(' ', f); | |
1072 | else | |
1073 | *space = true; | |
1074 | ||
1075 | fputs(kind, f); | |
1076 | fputs("-", f); | |
1077 | fputs(table[i].name, f); | |
1078 | ||
1079 | mask &= ~table[i].mask; | |
1080 | } | |
1081 | } | |
1082 | ||
1083 | assert(mask == 0); | |
1084 | } | |
1085 | ||
87f0e418 | 1086 | void unit_dump(Unit *u, FILE *f, const char *prefix) { |
49dbfa7b | 1087 | char *t, **j; |
87f0e418 LP |
1088 | UnitDependency d; |
1089 | Iterator i; | |
47be870b | 1090 | const char *prefix2; |
173e3821 | 1091 | char |
a483fb59 | 1092 | timestamp0[FORMAT_TIMESTAMP_MAX], |
173e3821 LP |
1093 | timestamp1[FORMAT_TIMESTAMP_MAX], |
1094 | timestamp2[FORMAT_TIMESTAMP_MAX], | |
1095 | timestamp3[FORMAT_TIMESTAMP_MAX], | |
faf919f1 LP |
1096 | timestamp4[FORMAT_TIMESTAMP_MAX], |
1097 | timespan[FORMAT_TIMESPAN_MAX]; | |
a7f241db | 1098 | Unit *following; |
eeaedb7c | 1099 | _cleanup_set_free_ Set *following_set = NULL; |
05a98afd | 1100 | const char *n; |
02638280 LP |
1101 | CGroupMask m; |
1102 | int r; | |
87f0e418 LP |
1103 | |
1104 | assert(u); | |
ac155bb8 | 1105 | assert(u->type >= 0); |
87f0e418 | 1106 | |
4c940960 | 1107 | prefix = strempty(prefix); |
63c372cb | 1108 | prefix2 = strjoina(prefix, "\t"); |
87f0e418 LP |
1109 | |
1110 | fprintf(f, | |
40d50879 | 1111 | "%s-> Unit %s:\n" |
87f0e418 | 1112 | "%s\tDescription: %s\n" |
9e2f7c11 | 1113 | "%s\tInstance: %s\n" |
87f0e418 | 1114 | "%s\tUnit Load State: %s\n" |
2fad8195 | 1115 | "%s\tUnit Active State: %s\n" |
b895d155 | 1116 | "%s\tState Change Timestamp: %s\n" |
173e3821 | 1117 | "%s\tInactive Exit Timestamp: %s\n" |
2fad8195 | 1118 | "%s\tActive Enter Timestamp: %s\n" |
701cc384 | 1119 | "%s\tActive Exit Timestamp: %s\n" |
173e3821 | 1120 | "%s\tInactive Enter Timestamp: %s\n" |
f2f725e5 | 1121 | "%s\tMay GC: %s\n" |
9444b1f2 | 1122 | "%s\tNeed Daemon Reload: %s\n" |
c2756a68 | 1123 | "%s\tTransient: %s\n" |
f5869324 | 1124 | "%s\tPerpetual: %s\n" |
5afe510c | 1125 | "%s\tGarbage Collection Mode: %s\n" |
4ad49000 LP |
1126 | "%s\tSlice: %s\n" |
1127 | "%s\tCGroup: %s\n" | |
aae7e17f | 1128 | "%s\tCGroup realized: %s\n", |
ac155bb8 | 1129 | prefix, u->id, |
87f0e418 | 1130 | prefix, unit_description(u), |
ac155bb8 MS |
1131 | prefix, strna(u->instance), |
1132 | prefix, unit_load_state_to_string(u->load_state), | |
2fad8195 | 1133 | prefix, unit_active_state_to_string(unit_active_state(u)), |
a483fb59 | 1134 | prefix, strna(format_timestamp(timestamp0, sizeof(timestamp0), u->state_change_timestamp.realtime)), |
ac155bb8 MS |
1135 | prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->inactive_exit_timestamp.realtime)), |
1136 | prefix, strna(format_timestamp(timestamp2, sizeof(timestamp2), u->active_enter_timestamp.realtime)), | |
1137 | prefix, strna(format_timestamp(timestamp3, sizeof(timestamp3), u->active_exit_timestamp.realtime)), | |
1138 | prefix, strna(format_timestamp(timestamp4, sizeof(timestamp4), u->inactive_enter_timestamp.realtime)), | |
f2f725e5 | 1139 | prefix, yes_no(unit_may_gc(u)), |
9444b1f2 | 1140 | prefix, yes_no(unit_need_daemon_reload(u)), |
c2756a68 | 1141 | prefix, yes_no(u->transient), |
f5869324 | 1142 | prefix, yes_no(u->perpetual), |
5afe510c | 1143 | prefix, collect_mode_to_string(u->collect_mode), |
4ad49000 LP |
1144 | prefix, strna(unit_slice_name(u)), |
1145 | prefix, strna(u->cgroup_path), | |
aae7e17f FB |
1146 | prefix, yes_no(u->cgroup_realized)); |
1147 | ||
1148 | if (u->cgroup_realized_mask != 0) { | |
1149 | _cleanup_free_ char *s = NULL; | |
1150 | (void) cg_mask_to_string(u->cgroup_realized_mask, &s); | |
02638280 LP |
1151 | fprintf(f, "%s\tCGroup realized mask: %s\n", prefix, strnull(s)); |
1152 | } | |
1153 | if (u->cgroup_enabled_mask != 0) { | |
1154 | _cleanup_free_ char *s = NULL; | |
1155 | (void) cg_mask_to_string(u->cgroup_enabled_mask, &s); | |
1156 | fprintf(f, "%s\tCGroup enabled mask: %s\n", prefix, strnull(s)); | |
1157 | } | |
1158 | m = unit_get_own_mask(u); | |
1159 | if (m != 0) { | |
1160 | _cleanup_free_ char *s = NULL; | |
1161 | (void) cg_mask_to_string(m, &s); | |
1162 | fprintf(f, "%s\tCGroup own mask: %s\n", prefix, strnull(s)); | |
aae7e17f | 1163 | } |
02638280 LP |
1164 | m = unit_get_members_mask(u); |
1165 | if (m != 0) { | |
aae7e17f | 1166 | _cleanup_free_ char *s = NULL; |
02638280 | 1167 | (void) cg_mask_to_string(m, &s); |
aae7e17f FB |
1168 | fprintf(f, "%s\tCGroup members mask: %s\n", prefix, strnull(s)); |
1169 | } | |
0301abf4 | 1170 | |
ac155bb8 | 1171 | SET_FOREACH(t, u->names, i) |
87f0e418 LP |
1172 | fprintf(f, "%s\tName: %s\n", prefix, t); |
1173 | ||
4b58153d LP |
1174 | if (!sd_id128_is_null(u->invocation_id)) |
1175 | fprintf(f, "%s\tInvocation ID: " SD_ID128_FORMAT_STR "\n", | |
1176 | prefix, SD_ID128_FORMAT_VAL(u->invocation_id)); | |
1177 | ||
49dbfa7b LP |
1178 | STRV_FOREACH(j, u->documentation) |
1179 | fprintf(f, "%s\tDocumentation: %s\n", prefix, *j); | |
1180 | ||
eeaedb7c LP |
1181 | following = unit_following(u); |
1182 | if (following) | |
ac155bb8 | 1183 | fprintf(f, "%s\tFollowing: %s\n", prefix, following->id); |
8fe914ec | 1184 | |
eeaedb7c LP |
1185 | r = unit_following_set(u, &following_set); |
1186 | if (r >= 0) { | |
1187 | Unit *other; | |
1188 | ||
1189 | SET_FOREACH(other, following_set, i) | |
1190 | fprintf(f, "%s\tFollowing Set Member: %s\n", prefix, other->id); | |
1191 | } | |
1192 | ||
ac155bb8 MS |
1193 | if (u->fragment_path) |
1194 | fprintf(f, "%s\tFragment Path: %s\n", prefix, u->fragment_path); | |
23a177ef | 1195 | |
1b64d026 LP |
1196 | if (u->source_path) |
1197 | fprintf(f, "%s\tSource Path: %s\n", prefix, u->source_path); | |
1198 | ||
ae7a7182 | 1199 | STRV_FOREACH(j, u->dropin_paths) |
2875e22b | 1200 | fprintf(f, "%s\tDropIn Path: %s\n", prefix, *j); |
ae7a7182 | 1201 | |
e7dfbb4e LP |
1202 | if (u->failure_action != EMERGENCY_ACTION_NONE) |
1203 | fprintf(f, "%s\tFailure Action: %s\n", prefix, emergency_action_to_string(u->failure_action)); | |
1204 | if (u->success_action != EMERGENCY_ACTION_NONE) | |
1205 | fprintf(f, "%s\tSuccess Action: %s\n", prefix, emergency_action_to_string(u->success_action)); | |
1206 | ||
36c16a7c | 1207 | if (u->job_timeout != USEC_INFINITY) |
2fa4092c | 1208 | fprintf(f, "%s\tJob Timeout: %s\n", prefix, format_timespan(timespan, sizeof(timespan), u->job_timeout, 0)); |
faf919f1 | 1209 | |
87a47f99 LN |
1210 | if (u->job_timeout_action != EMERGENCY_ACTION_NONE) |
1211 | fprintf(f, "%s\tJob Timeout Action: %s\n", prefix, emergency_action_to_string(u->job_timeout_action)); | |
f189ab18 LP |
1212 | |
1213 | if (u->job_timeout_reboot_arg) | |
1214 | fprintf(f, "%s\tJob Timeout Reboot Argument: %s\n", prefix, u->job_timeout_reboot_arg); | |
1215 | ||
59fccdc5 LP |
1216 | condition_dump_list(u->conditions, f, prefix, condition_type_to_string); |
1217 | condition_dump_list(u->asserts, f, prefix, assert_type_to_string); | |
52661efd | 1218 | |
ac155bb8 | 1219 | if (dual_timestamp_is_set(&u->condition_timestamp)) |
2791a8f8 LP |
1220 | fprintf(f, |
1221 | "%s\tCondition Timestamp: %s\n" | |
1222 | "%s\tCondition Result: %s\n", | |
ac155bb8 MS |
1223 | prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->condition_timestamp.realtime)), |
1224 | prefix, yes_no(u->condition_result)); | |
2791a8f8 | 1225 | |
59fccdc5 LP |
1226 | if (dual_timestamp_is_set(&u->assert_timestamp)) |
1227 | fprintf(f, | |
1228 | "%s\tAssert Timestamp: %s\n" | |
1229 | "%s\tAssert Result: %s\n", | |
1230 | prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->assert_timestamp.realtime)), | |
1231 | prefix, yes_no(u->assert_result)); | |
1232 | ||
87f0e418 | 1233 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) { |
eef85c4a | 1234 | UnitDependencyInfo di; |
87f0e418 LP |
1235 | Unit *other; |
1236 | ||
eef85c4a LP |
1237 | HASHMAP_FOREACH_KEY(di.data, other, u->dependencies[d], i) { |
1238 | bool space = false; | |
1239 | ||
1240 | fprintf(f, "%s\t%s: %s (", prefix, unit_dependency_to_string(d), other->id); | |
1241 | ||
1242 | print_unit_dependency_mask(f, "origin", di.origin_mask, &space); | |
1243 | print_unit_dependency_mask(f, "destination", di.destination_mask, &space); | |
1244 | ||
1245 | fputs(")\n", f); | |
1246 | } | |
87f0e418 LP |
1247 | } |
1248 | ||
eef85c4a LP |
1249 | if (!hashmap_isempty(u->requires_mounts_for)) { |
1250 | UnitDependencyInfo di; | |
1251 | const char *path; | |
1252 | ||
1253 | HASHMAP_FOREACH_KEY(di.data, path, u->requires_mounts_for, i) { | |
1254 | bool space = false; | |
7c8fa05c | 1255 | |
eef85c4a | 1256 | fprintf(f, "%s\tRequiresMountsFor: %s (", prefix, path); |
7c8fa05c | 1257 | |
eef85c4a LP |
1258 | print_unit_dependency_mask(f, "origin", di.origin_mask, &space); |
1259 | print_unit_dependency_mask(f, "destination", di.destination_mask, &space); | |
1260 | ||
1261 | fputs(")\n", f); | |
1262 | } | |
7c8fa05c LP |
1263 | } |
1264 | ||
ac155bb8 | 1265 | if (u->load_state == UNIT_LOADED) { |
ab1f0633 | 1266 | |
b0650475 | 1267 | fprintf(f, |
a40eb732 | 1268 | "%s\tStopWhenUnneeded: %s\n" |
b5e9dba8 LP |
1269 | "%s\tRefuseManualStart: %s\n" |
1270 | "%s\tRefuseManualStop: %s\n" | |
222ae6a8 | 1271 | "%s\tDefaultDependencies: %s\n" |
d420282b | 1272 | "%s\tOnFailureJobMode: %s\n" |
36b4a7ba | 1273 | "%s\tIgnoreOnIsolate: %s\n", |
ac155bb8 MS |
1274 | prefix, yes_no(u->stop_when_unneeded), |
1275 | prefix, yes_no(u->refuse_manual_start), | |
1276 | prefix, yes_no(u->refuse_manual_stop), | |
1277 | prefix, yes_no(u->default_dependencies), | |
d420282b | 1278 | prefix, job_mode_to_string(u->on_failure_job_mode), |
36b4a7ba | 1279 | prefix, yes_no(u->ignore_on_isolate)); |
ac155bb8 | 1280 | |
23a177ef LP |
1281 | if (UNIT_VTABLE(u)->dump) |
1282 | UNIT_VTABLE(u)->dump(u, f, prefix2); | |
b0650475 | 1283 | |
ac155bb8 | 1284 | } else if (u->load_state == UNIT_MERGED) |
b0650475 LP |
1285 | fprintf(f, |
1286 | "%s\tMerged into: %s\n", | |
ac155bb8 MS |
1287 | prefix, u->merged_into->id); |
1288 | else if (u->load_state == UNIT_ERROR) | |
1289 | fprintf(f, "%s\tLoad Error Code: %s\n", prefix, strerror(-u->load_error)); | |
8821a00f | 1290 | |
05a98afd LP |
1291 | for (n = sd_bus_track_first(u->bus_track); n; n = sd_bus_track_next(u->bus_track)) |
1292 | fprintf(f, "%s\tBus Ref: %s\n", prefix, n); | |
87f0e418 | 1293 | |
ac155bb8 MS |
1294 | if (u->job) |
1295 | job_dump(u->job, f, prefix2); | |
87f0e418 | 1296 | |
e0209d83 MS |
1297 | if (u->nop_job) |
1298 | job_dump(u->nop_job, f, prefix2); | |
87f0e418 LP |
1299 | } |
1300 | ||
1301 | /* Common implementation for multiple backends */ | |
e537352b | 1302 | int unit_load_fragment_and_dropin(Unit *u) { |
23a177ef LP |
1303 | int r; |
1304 | ||
1305 | assert(u); | |
23a177ef | 1306 | |
e48614c4 | 1307 | /* Load a .{service,socket,...} file */ |
4ad49000 LP |
1308 | r = unit_load_fragment(u); |
1309 | if (r < 0) | |
23a177ef LP |
1310 | return r; |
1311 | ||
ac155bb8 | 1312 | if (u->load_state == UNIT_STUB) |
23a177ef LP |
1313 | return -ENOENT; |
1314 | ||
9e4ea9cc ZJS |
1315 | /* Load drop-in directory data. If u is an alias, we might be reloading the |
1316 | * target unit needlessly. But we cannot be sure which drops-ins have already | |
1317 | * been loaded and which not, at least without doing complicated book-keeping, | |
1318 | * so let's always reread all drop-ins. */ | |
1319 | return unit_load_dropin(unit_follow_merge(u)); | |
23a177ef LP |
1320 | } |
1321 | ||
1322 | /* Common implementation for multiple backends */ | |
e537352b | 1323 | int unit_load_fragment_and_dropin_optional(Unit *u) { |
23a177ef | 1324 | int r; |
87f0e418 LP |
1325 | |
1326 | assert(u); | |
1327 | ||
23a177ef LP |
1328 | /* Same as unit_load_fragment_and_dropin(), but whether |
1329 | * something can be loaded or not doesn't matter. */ | |
1330 | ||
1331 | /* Load a .service file */ | |
4ad49000 LP |
1332 | r = unit_load_fragment(u); |
1333 | if (r < 0) | |
87f0e418 LP |
1334 | return r; |
1335 | ||
ac155bb8 MS |
1336 | if (u->load_state == UNIT_STUB) |
1337 | u->load_state = UNIT_LOADED; | |
d46de8a1 | 1338 | |
9e4ea9cc ZJS |
1339 | /* Load drop-in directory data */ |
1340 | return unit_load_dropin(unit_follow_merge(u)); | |
87f0e418 LP |
1341 | } |
1342 | ||
bba34eed | 1343 | int unit_add_default_target_dependency(Unit *u, Unit *target) { |
98bc2000 LP |
1344 | assert(u); |
1345 | assert(target); | |
1346 | ||
ac155bb8 | 1347 | if (target->type != UNIT_TARGET) |
98bc2000 LP |
1348 | return 0; |
1349 | ||
35b8ca3a | 1350 | /* Only add the dependency if both units are loaded, so that |
bba34eed | 1351 | * that loop check below is reliable */ |
ac155bb8 MS |
1352 | if (u->load_state != UNIT_LOADED || |
1353 | target->load_state != UNIT_LOADED) | |
bba34eed LP |
1354 | return 0; |
1355 | ||
21256a2b LP |
1356 | /* If either side wants no automatic dependencies, then let's |
1357 | * skip this */ | |
ac155bb8 MS |
1358 | if (!u->default_dependencies || |
1359 | !target->default_dependencies) | |
21256a2b LP |
1360 | return 0; |
1361 | ||
98bc2000 | 1362 | /* Don't create loops */ |
eef85c4a | 1363 | if (hashmap_get(target->dependencies[UNIT_BEFORE], u)) |
98bc2000 LP |
1364 | return 0; |
1365 | ||
eef85c4a | 1366 | return unit_add_dependency(target, UNIT_AFTER, u, true, UNIT_DEPENDENCY_DEFAULT); |
98bc2000 LP |
1367 | } |
1368 | ||
e954c9cf | 1369 | static int unit_add_target_dependencies(Unit *u) { |
a016b922 | 1370 | |
21256a2b LP |
1371 | static const UnitDependency deps[] = { |
1372 | UNIT_REQUIRED_BY, | |
be7d9ff7 | 1373 | UNIT_REQUISITE_OF, |
21256a2b LP |
1374 | UNIT_WANTED_BY, |
1375 | UNIT_BOUND_BY | |
1376 | }; | |
1377 | ||
21256a2b | 1378 | unsigned k; |
db57f3c6 | 1379 | int r = 0; |
98bc2000 LP |
1380 | |
1381 | assert(u); | |
1382 | ||
eef85c4a LP |
1383 | for (k = 0; k < ELEMENTSOF(deps); k++) { |
1384 | Unit *target; | |
1385 | Iterator i; | |
1386 | void *v; | |
1387 | ||
1388 | HASHMAP_FOREACH_KEY(v, target, u->dependencies[deps[k]], i) { | |
a016b922 LP |
1389 | r = unit_add_default_target_dependency(u, target); |
1390 | if (r < 0) | |
21256a2b | 1391 | return r; |
a016b922 | 1392 | } |
eef85c4a | 1393 | } |
a016b922 | 1394 | |
e954c9cf LP |
1395 | return r; |
1396 | } | |
4ad49000 | 1397 | |
e954c9cf | 1398 | static int unit_add_slice_dependencies(Unit *u) { |
eef85c4a | 1399 | UnitDependencyMask mask; |
e954c9cf | 1400 | assert(u); |
b81884e7 | 1401 | |
35b7ff80 | 1402 | if (!UNIT_HAS_CGROUP_CONTEXT(u)) |
e954c9cf LP |
1403 | return 0; |
1404 | ||
eef85c4a LP |
1405 | /* Slice units are implicitly ordered against their parent slices (as this relationship is encoded in the |
1406 | name), while all other units are ordered based on configuration (as in their case Slice= configures the | |
1407 | relationship). */ | |
1408 | mask = u->type == UNIT_SLICE ? UNIT_DEPENDENCY_IMPLICIT : UNIT_DEPENDENCY_FILE; | |
1409 | ||
e954c9cf | 1410 | if (UNIT_ISSET(u->slice)) |
eef85c4a | 1411 | return unit_add_two_dependencies(u, UNIT_AFTER, UNIT_REQUIRES, UNIT_DEREF(u->slice), true, mask); |
e954c9cf | 1412 | |
8c8da0e0 | 1413 | if (unit_has_name(u, SPECIAL_ROOT_SLICE)) |
d1fab3fe ZJS |
1414 | return 0; |
1415 | ||
eef85c4a | 1416 | return unit_add_two_dependencies_by_name(u, UNIT_AFTER, UNIT_REQUIRES, SPECIAL_ROOT_SLICE, NULL, true, mask); |
98bc2000 LP |
1417 | } |
1418 | ||
e954c9cf | 1419 | static int unit_add_mount_dependencies(Unit *u) { |
eef85c4a LP |
1420 | UnitDependencyInfo di; |
1421 | const char *path; | |
1422 | Iterator i; | |
9588bc32 LP |
1423 | int r; |
1424 | ||
1425 | assert(u); | |
1426 | ||
eef85c4a LP |
1427 | HASHMAP_FOREACH_KEY(di.data, path, u->requires_mounts_for, i) { |
1428 | char prefix[strlen(path) + 1]; | |
9588bc32 | 1429 | |
eef85c4a | 1430 | PATH_FOREACH_PREFIX_MORE(prefix, path) { |
c7c89abb | 1431 | _cleanup_free_ char *p = NULL; |
9588bc32 LP |
1432 | Unit *m; |
1433 | ||
c7c89abb | 1434 | r = unit_name_from_path(prefix, ".mount", &p); |
9588bc32 LP |
1435 | if (r < 0) |
1436 | return r; | |
c7c89abb FB |
1437 | |
1438 | m = manager_get_unit(u->manager, p); | |
1439 | if (!m) { | |
1440 | /* Make sure to load the mount unit if | |
1441 | * it exists. If so the dependencies | |
1442 | * on this unit will be added later | |
1443 | * during the loading of the mount | |
1444 | * unit. */ | |
1445 | (void) manager_load_unit_prepare(u->manager, p, NULL, NULL, &m); | |
9588bc32 | 1446 | continue; |
c7c89abb | 1447 | } |
9588bc32 LP |
1448 | if (m == u) |
1449 | continue; | |
1450 | ||
1451 | if (m->load_state != UNIT_LOADED) | |
1452 | continue; | |
1453 | ||
eef85c4a | 1454 | r = unit_add_dependency(u, UNIT_AFTER, m, true, di.origin_mask); |
9588bc32 LP |
1455 | if (r < 0) |
1456 | return r; | |
1457 | ||
1458 | if (m->fragment_path) { | |
eef85c4a | 1459 | r = unit_add_dependency(u, UNIT_REQUIRES, m, true, di.origin_mask); |
9588bc32 LP |
1460 | if (r < 0) |
1461 | return r; | |
1462 | } | |
1463 | } | |
1464 | } | |
1465 | ||
1466 | return 0; | |
1467 | } | |
1468 | ||
95ae05c0 WC |
1469 | static int unit_add_startup_units(Unit *u) { |
1470 | CGroupContext *c; | |
5269eb6b | 1471 | int r; |
95ae05c0 WC |
1472 | |
1473 | c = unit_get_cgroup_context(u); | |
db785129 LP |
1474 | if (!c) |
1475 | return 0; | |
1476 | ||
d53d9474 | 1477 | if (c->startup_cpu_shares == CGROUP_CPU_SHARES_INVALID && |
13c31542 | 1478 | c->startup_io_weight == CGROUP_WEIGHT_INVALID && |
d53d9474 | 1479 | c->startup_blockio_weight == CGROUP_BLKIO_WEIGHT_INVALID) |
db785129 LP |
1480 | return 0; |
1481 | ||
5269eb6b LP |
1482 | r = set_ensure_allocated(&u->manager->startup_units, NULL); |
1483 | if (r < 0) | |
1484 | return r; | |
1485 | ||
756c09e6 | 1486 | return set_put(u->manager->startup_units, u); |
95ae05c0 WC |
1487 | } |
1488 | ||
87f0e418 LP |
1489 | int unit_load(Unit *u) { |
1490 | int r; | |
1491 | ||
1492 | assert(u); | |
1493 | ||
ac155bb8 | 1494 | if (u->in_load_queue) { |
71fda00f | 1495 | LIST_REMOVE(load_queue, u->manager->load_queue, u); |
ac155bb8 | 1496 | u->in_load_queue = false; |
87f0e418 LP |
1497 | } |
1498 | ||
ac155bb8 | 1499 | if (u->type == _UNIT_TYPE_INVALID) |
e537352b LP |
1500 | return -EINVAL; |
1501 | ||
ac155bb8 | 1502 | if (u->load_state != UNIT_STUB) |
87f0e418 LP |
1503 | return 0; |
1504 | ||
4f4afc88 LP |
1505 | if (u->transient_file) { |
1506 | r = fflush_and_check(u->transient_file); | |
1507 | if (r < 0) | |
1508 | goto fail; | |
1509 | ||
50fb00b7 | 1510 | u->transient_file = safe_fclose(u->transient_file); |
f76707da | 1511 | u->fragment_mtime = now(CLOCK_REALTIME); |
4f4afc88 LP |
1512 | } |
1513 | ||
c2756a68 LP |
1514 | if (UNIT_VTABLE(u)->load) { |
1515 | r = UNIT_VTABLE(u)->load(u); | |
1516 | if (r < 0) | |
87f0e418 | 1517 | goto fail; |
c2756a68 | 1518 | } |
23a177ef | 1519 | |
ac155bb8 | 1520 | if (u->load_state == UNIT_STUB) { |
23a177ef LP |
1521 | r = -ENOENT; |
1522 | goto fail; | |
1523 | } | |
1524 | ||
7c8fa05c | 1525 | if (u->load_state == UNIT_LOADED) { |
c2756a68 | 1526 | |
e954c9cf LP |
1527 | r = unit_add_target_dependencies(u); |
1528 | if (r < 0) | |
1529 | goto fail; | |
1530 | ||
1531 | r = unit_add_slice_dependencies(u); | |
1532 | if (r < 0) | |
1533 | goto fail; | |
c2756a68 | 1534 | |
e954c9cf | 1535 | r = unit_add_mount_dependencies(u); |
7c8fa05c | 1536 | if (r < 0) |
c2756a68 | 1537 | goto fail; |
7c8fa05c | 1538 | |
95ae05c0 WC |
1539 | r = unit_add_startup_units(u); |
1540 | if (r < 0) | |
1541 | goto fail; | |
1542 | ||
eef85c4a | 1543 | if (u->on_failure_job_mode == JOB_ISOLATE && hashmap_size(u->dependencies[UNIT_ON_FAILURE]) > 1) { |
f2341e0a | 1544 | log_unit_error(u, "More than one OnFailure= dependencies specified but OnFailureJobMode=isolate set. Refusing."); |
c2756a68 LP |
1545 | r = -EINVAL; |
1546 | goto fail; | |
1547 | } | |
bc432dc7 | 1548 | |
a2df3ea4 MK |
1549 | if (u->job_running_timeout != USEC_INFINITY && u->job_running_timeout > u->job_timeout) |
1550 | log_unit_warning(u, "JobRunningTimeoutSec= is greater than JobTimeoutSec=, it has no effect."); | |
1551 | ||
bc432dc7 | 1552 | unit_update_cgroup_members_masks(u); |
f68319bb LP |
1553 | } |
1554 | ||
ac155bb8 | 1555 | assert((u->load_state != UNIT_MERGED) == !u->merged_into); |
23a177ef LP |
1556 | |
1557 | unit_add_to_dbus_queue(unit_follow_merge(u)); | |
701cc384 | 1558 | unit_add_to_gc_queue(u); |
87f0e418 | 1559 | |
87f0e418 LP |
1560 | return 0; |
1561 | ||
1562 | fail: | |
c2756a68 | 1563 | u->load_state = u->load_state == UNIT_STUB ? UNIT_NOT_FOUND : UNIT_ERROR; |
ac155bb8 | 1564 | u->load_error = r; |
c1e1601e | 1565 | unit_add_to_dbus_queue(u); |
9a46fc3b | 1566 | unit_add_to_gc_queue(u); |
23a177ef | 1567 | |
f2341e0a | 1568 | log_unit_debug_errno(u, r, "Failed to load configuration: %m"); |
23a177ef | 1569 | |
87f0e418 LP |
1570 | return r; |
1571 | } | |
1572 | ||
49365733 LP |
1573 | static bool unit_condition_test_list(Unit *u, Condition *first, const char *(*to_string)(ConditionType t)) { |
1574 | Condition *c; | |
1575 | int triggered = -1; | |
1576 | ||
1577 | assert(u); | |
1578 | assert(to_string); | |
1579 | ||
1580 | /* If the condition list is empty, then it is true */ | |
1581 | if (!first) | |
1582 | return true; | |
1583 | ||
1584 | /* Otherwise, if all of the non-trigger conditions apply and | |
1585 | * if any of the trigger conditions apply (unless there are | |
1586 | * none) we return true */ | |
1587 | LIST_FOREACH(conditions, c, first) { | |
1588 | int r; | |
1589 | ||
1590 | r = condition_test(c); | |
1591 | if (r < 0) | |
f2341e0a LP |
1592 | log_unit_warning(u, |
1593 | "Couldn't determine result for %s=%s%s%s, assuming failed: %m", | |
49365733 LP |
1594 | to_string(c->type), |
1595 | c->trigger ? "|" : "", | |
1596 | c->negate ? "!" : "", | |
f2341e0a | 1597 | c->parameter); |
49365733 | 1598 | else |
f2341e0a LP |
1599 | log_unit_debug(u, |
1600 | "%s=%s%s%s %s.", | |
49365733 LP |
1601 | to_string(c->type), |
1602 | c->trigger ? "|" : "", | |
1603 | c->negate ? "!" : "", | |
1604 | c->parameter, | |
f2341e0a | 1605 | condition_result_to_string(c->result)); |
49365733 LP |
1606 | |
1607 | if (!c->trigger && r <= 0) | |
1608 | return false; | |
1609 | ||
1610 | if (c->trigger && triggered <= 0) | |
1611 | triggered = r > 0; | |
1612 | } | |
1613 | ||
1614 | return triggered != 0; | |
1615 | } | |
1616 | ||
9588bc32 | 1617 | static bool unit_condition_test(Unit *u) { |
90bbc946 LP |
1618 | assert(u); |
1619 | ||
ac155bb8 | 1620 | dual_timestamp_get(&u->condition_timestamp); |
49365733 | 1621 | u->condition_result = unit_condition_test_list(u, u->conditions, condition_type_to_string); |
90bbc946 | 1622 | |
ac155bb8 | 1623 | return u->condition_result; |
90bbc946 LP |
1624 | } |
1625 | ||
59fccdc5 LP |
1626 | static bool unit_assert_test(Unit *u) { |
1627 | assert(u); | |
1628 | ||
1629 | dual_timestamp_get(&u->assert_timestamp); | |
49365733 | 1630 | u->assert_result = unit_condition_test_list(u, u->asserts, assert_type_to_string); |
59fccdc5 LP |
1631 | |
1632 | return u->assert_result; | |
1633 | } | |
1634 | ||
df446f96 LP |
1635 | void unit_status_printf(Unit *u, const char *status, const char *unit_status_msg_format) { |
1636 | DISABLE_WARNING_FORMAT_NONLITERAL; | |
1637 | manager_status_printf(u->manager, STATUS_TYPE_NORMAL, status, unit_status_msg_format, unit_description(u)); | |
1638 | REENABLE_WARNING; | |
1639 | } | |
1640 | ||
44a6b1b6 | 1641 | _pure_ static const char* unit_get_status_message_format(Unit *u, JobType t) { |
877d54e9 | 1642 | const char *format; |
a85ca902 | 1643 | const UnitStatusMessageFormats *format_table; |
877d54e9 LP |
1644 | |
1645 | assert(u); | |
df446f96 | 1646 | assert(IN_SET(t, JOB_START, JOB_STOP, JOB_RELOAD)); |
877d54e9 | 1647 | |
b5bf308b | 1648 | if (t != JOB_RELOAD) { |
a85ca902 MS |
1649 | format_table = &UNIT_VTABLE(u)->status_message_formats; |
1650 | if (format_table) { | |
1651 | format = format_table->starting_stopping[t == JOB_STOP]; | |
1652 | if (format) | |
1653 | return format; | |
1654 | } | |
1655 | } | |
877d54e9 LP |
1656 | |
1657 | /* Return generic strings */ | |
1658 | if (t == JOB_START) | |
1659 | return "Starting %s."; | |
1660 | else if (t == JOB_STOP) | |
1661 | return "Stopping %s."; | |
b5bf308b | 1662 | else |
877d54e9 | 1663 | return "Reloading %s."; |
877d54e9 LP |
1664 | } |
1665 | ||
1666 | static void unit_status_print_starting_stopping(Unit *u, JobType t) { | |
1667 | const char *format; | |
1668 | ||
1669 | assert(u); | |
1670 | ||
df446f96 LP |
1671 | /* Reload status messages have traditionally not been printed to console. */ |
1672 | if (!IN_SET(t, JOB_START, JOB_STOP)) | |
1673 | return; | |
1674 | ||
877d54e9 | 1675 | format = unit_get_status_message_format(u, t); |
c6918296 | 1676 | |
bcfce235 | 1677 | DISABLE_WARNING_FORMAT_NONLITERAL; |
49b1d377 | 1678 | unit_status_printf(u, "", format); |
bcfce235 | 1679 | REENABLE_WARNING; |
c6918296 MS |
1680 | } |
1681 | ||
877d54e9 | 1682 | static void unit_status_log_starting_stopping_reloading(Unit *u, JobType t) { |
2b044526 | 1683 | const char *format, *mid; |
877d54e9 | 1684 | char buf[LINE_MAX]; |
877d54e9 LP |
1685 | |
1686 | assert(u); | |
1687 | ||
df446f96 | 1688 | if (!IN_SET(t, JOB_START, JOB_STOP, JOB_RELOAD)) |
877d54e9 LP |
1689 | return; |
1690 | ||
81270860 LP |
1691 | if (log_on_console()) |
1692 | return; | |
1693 | ||
877d54e9 LP |
1694 | /* We log status messages for all units and all operations. */ |
1695 | ||
a85ca902 | 1696 | format = unit_get_status_message_format(u, t); |
877d54e9 | 1697 | |
bcfce235 | 1698 | DISABLE_WARNING_FORMAT_NONLITERAL; |
a7419dbc | 1699 | xsprintf(buf, format, unit_description(u)); |
bcfce235 | 1700 | REENABLE_WARNING; |
877d54e9 | 1701 | |
2b044526 ZJS |
1702 | mid = t == JOB_START ? "MESSAGE_ID=" SD_MESSAGE_UNIT_STARTING_STR : |
1703 | t == JOB_STOP ? "MESSAGE_ID=" SD_MESSAGE_UNIT_STOPPING_STR : | |
1704 | "MESSAGE_ID=" SD_MESSAGE_UNIT_RELOADING_STR; | |
877d54e9 | 1705 | |
f2341e0a LP |
1706 | /* Note that we deliberately use LOG_MESSAGE() instead of |
1707 | * LOG_UNIT_MESSAGE() here, since this is supposed to mimic | |
1708 | * closely what is written to screen using the status output, | |
1709 | * which is supposed the highest level, friendliest output | |
1710 | * possible, which means we should avoid the low-level unit | |
1711 | * name. */ | |
1712 | log_struct(LOG_INFO, | |
f2341e0a | 1713 | LOG_MESSAGE("%s", buf), |
ba360bb0 | 1714 | LOG_UNIT_ID(u), |
f1c50bec | 1715 | LOG_UNIT_INVOCATION_ID(u), |
ba360bb0 | 1716 | mid, |
f2341e0a | 1717 | NULL); |
877d54e9 | 1718 | } |
877d54e9 | 1719 | |
d1a34ae9 | 1720 | void unit_status_emit_starting_stopping_reloading(Unit *u, JobType t) { |
df446f96 LP |
1721 | assert(u); |
1722 | assert(t >= 0); | |
1723 | assert(t < _JOB_TYPE_MAX); | |
d1a34ae9 MS |
1724 | |
1725 | unit_status_log_starting_stopping_reloading(u, t); | |
df446f96 | 1726 | unit_status_print_starting_stopping(u, t); |
d1a34ae9 MS |
1727 | } |
1728 | ||
07299350 | 1729 | int unit_start_limit_test(Unit *u) { |
6bf0f408 LP |
1730 | assert(u); |
1731 | ||
1732 | if (ratelimit_test(&u->start_limit)) { | |
1733 | u->start_limit_hit = false; | |
1734 | return 0; | |
1735 | } | |
1736 | ||
1737 | log_unit_warning(u, "Start request repeated too quickly."); | |
1738 | u->start_limit_hit = true; | |
1739 | ||
87a47f99 | 1740 | return emergency_action(u->manager, u->start_limit_action, u->reboot_arg, "unit failed"); |
6bf0f408 LP |
1741 | } |
1742 | ||
c891efaf | 1743 | bool unit_shall_confirm_spawn(Unit *u) { |
631b676b | 1744 | assert(u); |
c891efaf FB |
1745 | |
1746 | if (manager_is_confirm_spawn_disabled(u->manager)) | |
1747 | return false; | |
1748 | ||
1749 | /* For some reasons units remaining in the same process group | |
1750 | * as PID 1 fail to acquire the console even if it's not used | |
1751 | * by any process. So skip the confirmation question for them. */ | |
1752 | return !unit_get_exec_context(u)->same_pgrp; | |
1753 | } | |
1754 | ||
631b676b LP |
1755 | static bool unit_verify_deps(Unit *u) { |
1756 | Unit *other; | |
1757 | Iterator j; | |
eef85c4a | 1758 | void *v; |
631b676b LP |
1759 | |
1760 | assert(u); | |
1761 | ||
1762 | /* Checks whether all BindsTo= dependencies of this unit are fulfilled — if they are also combined with | |
1763 | * After=. We do not check Requires= or Requisite= here as they only should have an effect on the job | |
1764 | * processing, but do not have any effect afterwards. We don't check BindsTo= dependencies that are not used in | |
1765 | * conjunction with After= as for them any such check would make things entirely racy. */ | |
1766 | ||
eef85c4a | 1767 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], j) { |
631b676b | 1768 | |
eef85c4a | 1769 | if (!hashmap_contains(u->dependencies[UNIT_AFTER], other)) |
631b676b LP |
1770 | continue; |
1771 | ||
1772 | if (!UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(other))) { | |
1773 | log_unit_notice(u, "Bound to unit %s, but unit isn't active.", other->id); | |
1774 | return false; | |
1775 | } | |
1776 | } | |
1777 | ||
1778 | return true; | |
1779 | } | |
1780 | ||
87f0e418 | 1781 | /* Errors: |
6bf0f408 LP |
1782 | * -EBADR: This unit type does not support starting. |
1783 | * -EALREADY: Unit is already started. | |
1784 | * -EAGAIN: An operation is already in progress. Retry later. | |
1785 | * -ECANCELED: Too many requests for now. | |
1786 | * -EPROTO: Assert failed | |
1787 | * -EINVAL: Unit not loaded | |
1788 | * -EOPNOTSUPP: Unit type not supported | |
631b676b | 1789 | * -ENOLINK: The necessary dependencies are not fulfilled. |
87f0e418 LP |
1790 | */ |
1791 | int unit_start(Unit *u) { | |
1792 | UnitActiveState state; | |
92ab323c | 1793 | Unit *following; |
87f0e418 LP |
1794 | |
1795 | assert(u); | |
1796 | ||
a82e5507 LP |
1797 | /* If this is already started, then this will succeed. Note |
1798 | * that this will even succeed if this unit is not startable | |
1799 | * by the user. This is relied on to detect when we need to | |
1800 | * wait for units and when waiting is finished. */ | |
87f0e418 LP |
1801 | state = unit_active_state(u); |
1802 | if (UNIT_IS_ACTIVE_OR_RELOADING(state)) | |
1803 | return -EALREADY; | |
1804 | ||
6bf0f408 LP |
1805 | /* Units that aren't loaded cannot be started */ |
1806 | if (u->load_state != UNIT_LOADED) | |
1807 | return -EINVAL; | |
1808 | ||
a82e5507 LP |
1809 | /* If the conditions failed, don't do anything at all. If we |
1810 | * already are activating this call might still be useful to | |
1811 | * speed up activation in case there is some hold-off time, | |
1812 | * but we don't want to recheck the condition in that case. */ | |
1813 | if (state != UNIT_ACTIVATING && | |
1814 | !unit_condition_test(u)) { | |
f2341e0a | 1815 | log_unit_debug(u, "Starting requested but condition failed. Not starting unit."); |
52661efd LP |
1816 | return -EALREADY; |
1817 | } | |
1818 | ||
59fccdc5 LP |
1819 | /* If the asserts failed, fail the entire job */ |
1820 | if (state != UNIT_ACTIVATING && | |
1821 | !unit_assert_test(u)) { | |
f2341e0a | 1822 | log_unit_notice(u, "Starting requested but asserts failed."); |
59fccdc5 LP |
1823 | return -EPROTO; |
1824 | } | |
1825 | ||
d11a7645 LP |
1826 | /* Units of types that aren't supported cannot be |
1827 | * started. Note that we do this test only after the condition | |
1828 | * checks, so that we rather return condition check errors | |
1829 | * (which are usually not considered a true failure) than "not | |
1830 | * supported" errors (which are considered a failure). | |
1831 | */ | |
1832 | if (!unit_supported(u)) | |
1833 | return -EOPNOTSUPP; | |
1834 | ||
631b676b LP |
1835 | /* Let's make sure that the deps really are in order before we start this. Normally the job engine should have |
1836 | * taken care of this already, but let's check this here again. After all, our dependencies might not be in | |
1837 | * effect anymore, due to a reload or due to a failed condition. */ | |
1838 | if (!unit_verify_deps(u)) | |
1839 | return -ENOLINK; | |
1840 | ||
92ab323c | 1841 | /* Forward to the main object, if we aren't it. */ |
52990c2e ZJS |
1842 | following = unit_following(u); |
1843 | if (following) { | |
f2341e0a | 1844 | log_unit_debug(u, "Redirecting start request from %s to %s.", u->id, following->id); |
92ab323c LP |
1845 | return unit_start(following); |
1846 | } | |
1847 | ||
1848 | /* If it is stopped, but we cannot start it, then fail */ | |
1849 | if (!UNIT_VTABLE(u)->start) | |
1850 | return -EBADR; | |
1851 | ||
87f0e418 LP |
1852 | /* We don't suppress calls to ->start() here when we are |
1853 | * already starting, to allow this request to be used as a | |
1854 | * "hurry up" call, for example when the unit is in some "auto | |
1855 | * restart" state where it waits for a holdoff timer to elapse | |
1856 | * before it will start again. */ | |
1857 | ||
c1e1601e | 1858 | unit_add_to_dbus_queue(u); |
9e58ff9c | 1859 | |
d1a34ae9 | 1860 | return UNIT_VTABLE(u)->start(u); |
87f0e418 LP |
1861 | } |
1862 | ||
1863 | bool unit_can_start(Unit *u) { | |
1864 | assert(u); | |
1865 | ||
8ff4d2ab LP |
1866 | if (u->load_state != UNIT_LOADED) |
1867 | return false; | |
1868 | ||
1869 | if (!unit_supported(u)) | |
1870 | return false; | |
1871 | ||
87f0e418 LP |
1872 | return !!UNIT_VTABLE(u)->start; |
1873 | } | |
1874 | ||
2528a7a6 LP |
1875 | bool unit_can_isolate(Unit *u) { |
1876 | assert(u); | |
1877 | ||
1878 | return unit_can_start(u) && | |
ac155bb8 | 1879 | u->allow_isolate; |
2528a7a6 LP |
1880 | } |
1881 | ||
87f0e418 LP |
1882 | /* Errors: |
1883 | * -EBADR: This unit type does not support stopping. | |
1884 | * -EALREADY: Unit is already stopped. | |
1885 | * -EAGAIN: An operation is already in progress. Retry later. | |
1886 | */ | |
1887 | int unit_stop(Unit *u) { | |
1888 | UnitActiveState state; | |
92ab323c | 1889 | Unit *following; |
87f0e418 LP |
1890 | |
1891 | assert(u); | |
1892 | ||
87f0e418 | 1893 | state = unit_active_state(u); |
fdf20a31 | 1894 | if (UNIT_IS_INACTIVE_OR_FAILED(state)) |
87f0e418 LP |
1895 | return -EALREADY; |
1896 | ||
0faacd47 LP |
1897 | following = unit_following(u); |
1898 | if (following) { | |
f2341e0a | 1899 | log_unit_debug(u, "Redirecting stop request from %s to %s.", u->id, following->id); |
92ab323c LP |
1900 | return unit_stop(following); |
1901 | } | |
1902 | ||
7898b0cf LP |
1903 | if (!UNIT_VTABLE(u)->stop) |
1904 | return -EBADR; | |
1905 | ||
c1e1601e | 1906 | unit_add_to_dbus_queue(u); |
9e58ff9c | 1907 | |
d1a34ae9 | 1908 | return UNIT_VTABLE(u)->stop(u); |
87f0e418 LP |
1909 | } |
1910 | ||
f5869324 LP |
1911 | bool unit_can_stop(Unit *u) { |
1912 | assert(u); | |
1913 | ||
1914 | if (!unit_supported(u)) | |
1915 | return false; | |
1916 | ||
1917 | if (u->perpetual) | |
1918 | return false; | |
1919 | ||
1920 | return !!UNIT_VTABLE(u)->stop; | |
1921 | } | |
1922 | ||
87f0e418 LP |
1923 | /* Errors: |
1924 | * -EBADR: This unit type does not support reloading. | |
1925 | * -ENOEXEC: Unit is not started. | |
1926 | * -EAGAIN: An operation is already in progress. Retry later. | |
1927 | */ | |
1928 | int unit_reload(Unit *u) { | |
1929 | UnitActiveState state; | |
92ab323c | 1930 | Unit *following; |
87f0e418 LP |
1931 | |
1932 | assert(u); | |
1933 | ||
ac155bb8 | 1934 | if (u->load_state != UNIT_LOADED) |
6124958c LP |
1935 | return -EINVAL; |
1936 | ||
87f0e418 LP |
1937 | if (!unit_can_reload(u)) |
1938 | return -EBADR; | |
1939 | ||
1940 | state = unit_active_state(u); | |
e364ad06 | 1941 | if (state == UNIT_RELOADING) |
87f0e418 LP |
1942 | return -EALREADY; |
1943 | ||
6a371e23 | 1944 | if (state != UNIT_ACTIVE) { |
f2341e0a | 1945 | log_unit_warning(u, "Unit cannot be reloaded because it is inactive."); |
87f0e418 | 1946 | return -ENOEXEC; |
6a371e23 | 1947 | } |
87f0e418 | 1948 | |
e48614c4 ZJS |
1949 | following = unit_following(u); |
1950 | if (following) { | |
f2341e0a | 1951 | log_unit_debug(u, "Redirecting reload request from %s to %s.", u->id, following->id); |
92ab323c LP |
1952 | return unit_reload(following); |
1953 | } | |
1954 | ||
c1e1601e | 1955 | unit_add_to_dbus_queue(u); |
82a2b6bb | 1956 | |
f54bcca5 JR |
1957 | if (!UNIT_VTABLE(u)->reload) { |
1958 | /* Unit doesn't have a reload function, but we need to propagate the reload anyway */ | |
1959 | unit_notify(u, unit_active_state(u), unit_active_state(u), true); | |
1960 | return 0; | |
1961 | } | |
1962 | ||
d1a34ae9 | 1963 | return UNIT_VTABLE(u)->reload(u); |
87f0e418 LP |
1964 | } |
1965 | ||
1966 | bool unit_can_reload(Unit *u) { | |
1967 | assert(u); | |
1968 | ||
f54bcca5 JR |
1969 | if (UNIT_VTABLE(u)->can_reload) |
1970 | return UNIT_VTABLE(u)->can_reload(u); | |
87f0e418 | 1971 | |
eef85c4a | 1972 | if (!hashmap_isempty(u->dependencies[UNIT_PROPAGATES_RELOAD_TO])) |
87f0e418 LP |
1973 | return true; |
1974 | ||
f54bcca5 | 1975 | return UNIT_VTABLE(u)->reload; |
87f0e418 LP |
1976 | } |
1977 | ||
b4a16b7b | 1978 | static void unit_check_unneeded(Unit *u) { |
be7d9ff7 | 1979 | |
4afd3348 | 1980 | _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL; |
4bd29fe5 | 1981 | |
be7d9ff7 LP |
1982 | static const UnitDependency needed_dependencies[] = { |
1983 | UNIT_REQUIRED_BY, | |
084918ba | 1984 | UNIT_REQUISITE_OF, |
be7d9ff7 LP |
1985 | UNIT_WANTED_BY, |
1986 | UNIT_BOUND_BY, | |
1987 | }; | |
1988 | ||
be7d9ff7 LP |
1989 | unsigned j; |
1990 | int r; | |
f3bff0eb LP |
1991 | |
1992 | assert(u); | |
1993 | ||
1994 | /* If this service shall be shut down when unneeded then do | |
1995 | * so. */ | |
1996 | ||
ac155bb8 | 1997 | if (!u->stop_when_unneeded) |
f3bff0eb LP |
1998 | return; |
1999 | ||
2000 | if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))) | |
2001 | return; | |
2002 | ||
eef85c4a LP |
2003 | for (j = 0; j < ELEMENTSOF(needed_dependencies); j++) { |
2004 | Unit *other; | |
2005 | Iterator i; | |
2006 | void *v; | |
2007 | ||
2008 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[needed_dependencies[j]], i) | |
deb4e708 | 2009 | if (unit_active_or_pending(other) || unit_will_restart(other)) |
be7d9ff7 | 2010 | return; |
eef85c4a | 2011 | } |
b81884e7 | 2012 | |
595bfe7d | 2013 | /* If stopping a unit fails continuously we might enter a stop |
bea355da LP |
2014 | * loop here, hence stop acting on the service being |
2015 | * unnecessary after a while. */ | |
67bfdc97 | 2016 | if (!ratelimit_test(&u->auto_stop_ratelimit)) { |
bea355da LP |
2017 | log_unit_warning(u, "Unit not needed anymore, but not stopping since we tried this too often recently."); |
2018 | return; | |
2019 | } | |
2020 | ||
f2341e0a | 2021 | log_unit_info(u, "Unit not needed anymore. Stopping."); |
f3bff0eb LP |
2022 | |
2023 | /* Ok, nobody needs us anymore. Sniff. Then let's commit suicide */ | |
4bd29fe5 | 2024 | r = manager_add_job(u->manager, JOB_STOP, u, JOB_FAIL, &error, NULL); |
be7d9ff7 | 2025 | if (r < 0) |
4bd29fe5 | 2026 | log_unit_warning_errno(u, r, "Failed to enqueue stop job, ignoring: %s", bus_error_message(&error, r)); |
f3bff0eb LP |
2027 | } |
2028 | ||
ff502445 | 2029 | static void unit_check_binds_to(Unit *u) { |
4afd3348 | 2030 | _cleanup_(sd_bus_error_free) sd_bus_error error = SD_BUS_ERROR_NULL; |
ff502445 LP |
2031 | bool stop = false; |
2032 | Unit *other; | |
2033 | Iterator i; | |
eef85c4a | 2034 | void *v; |
67bfdc97 | 2035 | int r; |
ff502445 LP |
2036 | |
2037 | assert(u); | |
2038 | ||
2039 | if (u->job) | |
2040 | return; | |
2041 | ||
2042 | if (unit_active_state(u) != UNIT_ACTIVE) | |
2043 | return; | |
2044 | ||
eef85c4a | 2045 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i) { |
ff502445 LP |
2046 | if (other->job) |
2047 | continue; | |
13ddc3fc ZJS |
2048 | |
2049 | if (!other->coldplugged) | |
2050 | /* We might yet create a job for the other unit… */ | |
2051 | continue; | |
ff502445 LP |
2052 | |
2053 | if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other))) | |
2054 | continue; | |
2055 | ||
2056 | stop = true; | |
98f738b6 | 2057 | break; |
ff502445 LP |
2058 | } |
2059 | ||
2060 | if (!stop) | |
2061 | return; | |
2062 | ||
595bfe7d | 2063 | /* If stopping a unit fails continuously we might enter a stop |
67bfdc97 LP |
2064 | * loop here, hence stop acting on the service being |
2065 | * unnecessary after a while. */ | |
2066 | if (!ratelimit_test(&u->auto_stop_ratelimit)) { | |
2067 | log_unit_warning(u, "Unit is bound to inactive unit %s, but not stopping since we tried this too often recently.", other->id); | |
2068 | return; | |
2069 | } | |
2070 | ||
98f738b6 | 2071 | assert(other); |
f2341e0a | 2072 | log_unit_info(u, "Unit is bound to inactive unit %s. Stopping, too.", other->id); |
ff502445 LP |
2073 | |
2074 | /* A unit we need to run is gone. Sniff. Let's stop this. */ | |
4bd29fe5 | 2075 | r = manager_add_job(u->manager, JOB_STOP, u, JOB_FAIL, &error, NULL); |
67bfdc97 | 2076 | if (r < 0) |
4bd29fe5 | 2077 | log_unit_warning_errno(u, r, "Failed to enqueue stop job, ignoring: %s", bus_error_message(&error, r)); |
ff502445 LP |
2078 | } |
2079 | ||
87f0e418 LP |
2080 | static void retroactively_start_dependencies(Unit *u) { |
2081 | Iterator i; | |
2082 | Unit *other; | |
eef85c4a | 2083 | void *v; |
87f0e418 LP |
2084 | |
2085 | assert(u); | |
2086 | assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))); | |
2087 | ||
eef85c4a LP |
2088 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_REQUIRES], i) |
2089 | if (!hashmap_get(u->dependencies[UNIT_AFTER], other) && | |
b81884e7 | 2090 | !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2091 | manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL); |
b81884e7 | 2092 | |
eef85c4a LP |
2093 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i) |
2094 | if (!hashmap_get(u->dependencies[UNIT_AFTER], other) && | |
b81884e7 | 2095 | !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2096 | manager_add_job(u->manager, JOB_START, other, JOB_REPLACE, NULL, NULL); |
87f0e418 | 2097 | |
eef85c4a LP |
2098 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_WANTS], i) |
2099 | if (!hashmap_get(u->dependencies[UNIT_AFTER], other) && | |
b81884e7 | 2100 | !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2101 | manager_add_job(u->manager, JOB_START, other, JOB_FAIL, NULL, NULL); |
87f0e418 | 2102 | |
eef85c4a | 2103 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTS], i) |
b81884e7 | 2104 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2105 | manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL); |
69dd2852 | 2106 | |
eef85c4a | 2107 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_CONFLICTED_BY], i) |
b81884e7 | 2108 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2109 | manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL); |
87f0e418 LP |
2110 | } |
2111 | ||
2112 | static void retroactively_stop_dependencies(Unit *u) { | |
87f0e418 | 2113 | Unit *other; |
eef85c4a LP |
2114 | Iterator i; |
2115 | void *v; | |
87f0e418 LP |
2116 | |
2117 | assert(u); | |
2118 | assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u))); | |
2119 | ||
b81884e7 | 2120 | /* Pull down units which are bound to us recursively if enabled */ |
eef85c4a | 2121 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BOUND_BY], i) |
b81884e7 | 2122 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
4bd29fe5 | 2123 | manager_add_job(u->manager, JOB_STOP, other, JOB_REPLACE, NULL, NULL); |
cd0504d0 MS |
2124 | } |
2125 | ||
2126 | static void check_unneeded_dependencies(Unit *u) { | |
cd0504d0 | 2127 | Unit *other; |
eef85c4a LP |
2128 | Iterator i; |
2129 | void *v; | |
cd0504d0 MS |
2130 | |
2131 | assert(u); | |
2132 | assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u))); | |
f3bff0eb LP |
2133 | |
2134 | /* Garbage collect services that might not be needed anymore, if enabled */ | |
eef85c4a | 2135 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_REQUIRES], i) |
87f0e418 | 2136 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
b4a16b7b | 2137 | unit_check_unneeded(other); |
eef85c4a | 2138 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_WANTS], i) |
f3bff0eb | 2139 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
b4a16b7b | 2140 | unit_check_unneeded(other); |
eef85c4a | 2141 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_REQUISITE], i) |
f3bff0eb | 2142 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
b4a16b7b | 2143 | unit_check_unneeded(other); |
eef85c4a | 2144 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_BINDS_TO], i) |
b81884e7 LP |
2145 | if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other))) |
2146 | unit_check_unneeded(other); | |
87f0e418 LP |
2147 | } |
2148 | ||
3ecaa09b | 2149 | void unit_start_on_failure(Unit *u) { |
c0daa706 LP |
2150 | Unit *other; |
2151 | Iterator i; | |
eef85c4a | 2152 | void *v; |
c0daa706 LP |
2153 | |
2154 | assert(u); | |
2155 | ||
eef85c4a | 2156 | if (hashmap_size(u->dependencies[UNIT_ON_FAILURE]) <= 0) |
222ae6a8 LP |
2157 | return; |
2158 | ||
f2341e0a | 2159 | log_unit_info(u, "Triggering OnFailure= dependencies."); |
222ae6a8 | 2160 | |
eef85c4a | 2161 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_ON_FAILURE], i) { |
222ae6a8 LP |
2162 | int r; |
2163 | ||
4bd29fe5 | 2164 | r = manager_add_job(u->manager, JOB_START, other, u->on_failure_job_mode, NULL, NULL); |
c1b6628d | 2165 | if (r < 0) |
f2341e0a | 2166 | log_unit_error_errno(u, r, "Failed to enqueue OnFailure= job: %m"); |
222ae6a8 | 2167 | } |
c0daa706 LP |
2168 | } |
2169 | ||
3ecaa09b LP |
2170 | void unit_trigger_notify(Unit *u) { |
2171 | Unit *other; | |
2172 | Iterator i; | |
eef85c4a | 2173 | void *v; |
3ecaa09b LP |
2174 | |
2175 | assert(u); | |
2176 | ||
eef85c4a | 2177 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_TRIGGERED_BY], i) |
3ecaa09b LP |
2178 | if (UNIT_VTABLE(other)->trigger_notify) |
2179 | UNIT_VTABLE(other)->trigger_notify(other, u); | |
2180 | } | |
2181 | ||
915b1d01 LP |
2182 | static int unit_log_resources(Unit *u) { |
2183 | ||
2184 | struct iovec iovec[1 + _CGROUP_IP_ACCOUNTING_METRIC_MAX + 4]; | |
2185 | size_t n_message_parts = 0, n_iovec = 0; | |
2186 | char* message_parts[3 + 1], *t; | |
2187 | nsec_t nsec = NSEC_INFINITY; | |
2188 | CGroupIPAccountingMetric m; | |
2189 | size_t i; | |
2190 | int r; | |
2191 | const char* const ip_fields[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = { | |
2192 | [CGROUP_IP_INGRESS_BYTES] = "IP_METRIC_INGRESS_BYTES", | |
2193 | [CGROUP_IP_INGRESS_PACKETS] = "IP_METRIC_INGRESS_PACKETS", | |
2194 | [CGROUP_IP_EGRESS_BYTES] = "IP_METRIC_EGRESS_BYTES", | |
2195 | [CGROUP_IP_EGRESS_PACKETS] = "IP_METRIC_EGRESS_PACKETS", | |
2196 | }; | |
2197 | ||
2198 | assert(u); | |
2199 | ||
2200 | /* Invoked whenever a unit enters failed or dead state. Logs information about consumed resources if resource | |
2201 | * accounting was enabled for a unit. It does this in two ways: a friendly human readable string with reduced | |
2202 | * information and the complete data in structured fields. */ | |
2203 | ||
2204 | (void) unit_get_cpu_usage(u, &nsec); | |
2205 | if (nsec != NSEC_INFINITY) { | |
2206 | char buf[FORMAT_TIMESPAN_MAX] = ""; | |
2207 | ||
2208 | /* Format the CPU time for inclusion in the structured log message */ | |
2209 | if (asprintf(&t, "CPU_USAGE_NSEC=%" PRIu64, nsec) < 0) { | |
2210 | r = log_oom(); | |
2211 | goto finish; | |
2212 | } | |
2213 | iovec[n_iovec++] = IOVEC_MAKE_STRING(t); | |
2214 | ||
2215 | /* Format the CPU time for inclusion in the human language message string */ | |
2216 | format_timespan(buf, sizeof(buf), nsec / NSEC_PER_USEC, USEC_PER_MSEC); | |
2217 | t = strjoin(n_message_parts > 0 ? "consumed " : "Consumed ", buf, " CPU time"); | |
2218 | if (!t) { | |
2219 | r = log_oom(); | |
2220 | goto finish; | |
2221 | } | |
2222 | ||
2223 | message_parts[n_message_parts++] = t; | |
2224 | } | |
2225 | ||
2226 | for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) { | |
2227 | char buf[FORMAT_BYTES_MAX] = ""; | |
2228 | uint64_t value = UINT64_MAX; | |
2229 | ||
2230 | assert(ip_fields[m]); | |
2231 | ||
2232 | (void) unit_get_ip_accounting(u, m, &value); | |
2233 | if (value == UINT64_MAX) | |
2234 | continue; | |
2235 | ||
2236 | /* Format IP accounting data for inclusion in the structured log message */ | |
2237 | if (asprintf(&t, "%s=%" PRIu64, ip_fields[m], value) < 0) { | |
2238 | r = log_oom(); | |
2239 | goto finish; | |
2240 | } | |
2241 | iovec[n_iovec++] = IOVEC_MAKE_STRING(t); | |
2242 | ||
2243 | /* Format the IP accounting data for inclusion in the human language message string, but only for the | |
2244 | * bytes counters (and not for the packets counters) */ | |
2245 | if (m == CGROUP_IP_INGRESS_BYTES) | |
2246 | t = strjoin(n_message_parts > 0 ? "received " : "Received ", | |
2247 | format_bytes(buf, sizeof(buf), value), | |
2248 | " IP traffic"); | |
2249 | else if (m == CGROUP_IP_EGRESS_BYTES) | |
2250 | t = strjoin(n_message_parts > 0 ? "sent " : "Sent ", | |
2251 | format_bytes(buf, sizeof(buf), value), | |
2252 | " IP traffic"); | |
2253 | else | |
2254 | continue; | |
2255 | if (!t) { | |
2256 | r = log_oom(); | |
2257 | goto finish; | |
2258 | } | |
2259 | ||
2260 | message_parts[n_message_parts++] = t; | |
2261 | } | |
2262 | ||
2263 | /* Is there any accounting data available at all? */ | |
2264 | if (n_iovec == 0) { | |
2265 | r = 0; | |
2266 | goto finish; | |
2267 | } | |
2268 | ||
2269 | if (n_message_parts == 0) | |
2270 | t = strjoina("MESSAGE=", u->id, ": Completed"); | |
2271 | else { | |
2272 | _cleanup_free_ char *joined; | |
2273 | ||
2274 | message_parts[n_message_parts] = NULL; | |
2275 | ||
2276 | joined = strv_join(message_parts, ", "); | |
2277 | if (!joined) { | |
2278 | r = log_oom(); | |
2279 | goto finish; | |
2280 | } | |
2281 | ||
2282 | t = strjoina("MESSAGE=", u->id, ": ", joined); | |
2283 | } | |
2284 | ||
2285 | /* The following four fields we allocate on the stack or are static strings, we hence don't want to free them, | |
2286 | * and hence don't increase n_iovec for them */ | |
2287 | iovec[n_iovec] = IOVEC_MAKE_STRING(t); | |
2288 | iovec[n_iovec + 1] = IOVEC_MAKE_STRING("MESSAGE_ID=" SD_MESSAGE_UNIT_RESOURCES_STR); | |
2289 | ||
2290 | t = strjoina(u->manager->unit_log_field, u->id); | |
2291 | iovec[n_iovec + 2] = IOVEC_MAKE_STRING(t); | |
2292 | ||
2293 | t = strjoina(u->manager->invocation_log_field, u->invocation_id_string); | |
2294 | iovec[n_iovec + 3] = IOVEC_MAKE_STRING(t); | |
2295 | ||
2296 | log_struct_iovec(LOG_INFO, iovec, n_iovec + 4); | |
2297 | r = 0; | |
2298 | ||
2299 | finish: | |
2300 | for (i = 0; i < n_message_parts; i++) | |
2301 | free(message_parts[i]); | |
2302 | ||
2303 | for (i = 0; i < n_iovec; i++) | |
2304 | free(iovec[i].iov_base); | |
2305 | ||
2306 | return r; | |
2307 | ||
2308 | } | |
2309 | ||
adefcf28 LP |
2310 | static void unit_update_on_console(Unit *u) { |
2311 | bool b; | |
2312 | ||
2313 | assert(u); | |
2314 | ||
2315 | b = unit_needs_console(u); | |
2316 | if (u->on_console == b) | |
2317 | return; | |
2318 | ||
2319 | u->on_console = b; | |
2320 | if (b) | |
2321 | manager_ref_console(u->manager); | |
2322 | else | |
2323 | manager_unref_console(u->manager); | |
2324 | ||
2325 | } | |
2326 | ||
e2f3b44c | 2327 | void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns, bool reload_success) { |
546ac4f0 | 2328 | Manager *m; |
7e6e7b06 | 2329 | bool unexpected; |
a096ed36 | 2330 | |
87f0e418 LP |
2331 | assert(u); |
2332 | assert(os < _UNIT_ACTIVE_STATE_MAX); | |
2333 | assert(ns < _UNIT_ACTIVE_STATE_MAX); | |
87f0e418 | 2334 | |
8e471ccd LP |
2335 | /* Note that this is called for all low-level state changes, |
2336 | * even if they might map to the same high-level | |
865cc19a | 2337 | * UnitActiveState! That means that ns == os is an expected |
c5315881 | 2338 | * behavior here. For example: if a mount point is remounted |
cd6d0a45 | 2339 | * this function will be called too! */ |
87f0e418 | 2340 | |
546ac4f0 MS |
2341 | m = u->manager; |
2342 | ||
f755e3b7 | 2343 | /* Update timestamps for state changes */ |
2c289ea8 | 2344 | if (!MANAGER_IS_RELOADING(m)) { |
a483fb59 | 2345 | dual_timestamp_get(&u->state_change_timestamp); |
173e3821 | 2346 | |
bdbf9951 | 2347 | if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns)) |
a483fb59 | 2348 | u->inactive_exit_timestamp = u->state_change_timestamp; |
bdbf9951 | 2349 | else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns)) |
a483fb59 | 2350 | u->inactive_enter_timestamp = u->state_change_timestamp; |
bdbf9951 LP |
2351 | |
2352 | if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns)) | |
a483fb59 | 2353 | u->active_enter_timestamp = u->state_change_timestamp; |
bdbf9951 | 2354 | else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns)) |
a483fb59 | 2355 | u->active_exit_timestamp = u->state_change_timestamp; |
bdbf9951 | 2356 | } |
87f0e418 | 2357 | |
865cc19a | 2358 | /* Keep track of failed units */ |
5269eb6b | 2359 | (void) manager_update_failed_units(u->manager, u, ns == UNIT_FAILED); |
f755e3b7 | 2360 | |
d3070fbd LP |
2361 | /* Make sure the cgroup and state files are always removed when we become inactive */ |
2362 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) { | |
efdb0237 | 2363 | unit_prune_cgroup(u); |
d3070fbd LP |
2364 | unit_unlink_state_files(u); |
2365 | } | |
fb385181 | 2366 | |
adefcf28 | 2367 | unit_update_on_console(u); |
7ed9f6cd | 2368 | |
ac155bb8 | 2369 | if (u->job) { |
7e6e7b06 | 2370 | unexpected = false; |
87f0e418 | 2371 | |
ac155bb8 | 2372 | if (u->job->state == JOB_WAITING) |
87f0e418 LP |
2373 | |
2374 | /* So we reached a different state for this | |
2375 | * job. Let's see if we can run it now if it | |
2376 | * failed previously due to EAGAIN. */ | |
ac155bb8 | 2377 | job_add_to_run_queue(u->job); |
87f0e418 | 2378 | |
b410e6b9 | 2379 | /* Let's check whether this state change constitutes a |
35b8ca3a | 2380 | * finished job, or maybe contradicts a running job and |
b410e6b9 | 2381 | * hence needs to invalidate jobs. */ |
87f0e418 | 2382 | |
ac155bb8 | 2383 | switch (u->job->type) { |
87f0e418 | 2384 | |
b410e6b9 LP |
2385 | case JOB_START: |
2386 | case JOB_VERIFY_ACTIVE: | |
87f0e418 | 2387 | |
b410e6b9 | 2388 | if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) |
833f92ad | 2389 | job_finish_and_invalidate(u->job, JOB_DONE, true, false); |
ac155bb8 | 2390 | else if (u->job->state == JOB_RUNNING && ns != UNIT_ACTIVATING) { |
b410e6b9 | 2391 | unexpected = true; |
41b02ec7 | 2392 | |
fdf20a31 | 2393 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) |
833f92ad | 2394 | job_finish_and_invalidate(u->job, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false); |
b410e6b9 | 2395 | } |
87f0e418 | 2396 | |
b410e6b9 | 2397 | break; |
87f0e418 | 2398 | |
b410e6b9 LP |
2399 | case JOB_RELOAD: |
2400 | case JOB_RELOAD_OR_START: | |
3282591d | 2401 | case JOB_TRY_RELOAD: |
87f0e418 | 2402 | |
ac155bb8 | 2403 | if (u->job->state == JOB_RUNNING) { |
a096ed36 | 2404 | if (ns == UNIT_ACTIVE) |
833f92ad | 2405 | job_finish_and_invalidate(u->job, reload_success ? JOB_DONE : JOB_FAILED, true, false); |
ec2ce0c5 | 2406 | else if (!IN_SET(ns, UNIT_ACTIVATING, UNIT_RELOADING)) { |
a096ed36 | 2407 | unexpected = true; |
41b02ec7 | 2408 | |
fdf20a31 | 2409 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) |
833f92ad | 2410 | job_finish_and_invalidate(u->job, ns == UNIT_FAILED ? JOB_FAILED : JOB_DONE, true, false); |
a096ed36 | 2411 | } |
b410e6b9 | 2412 | } |
87f0e418 | 2413 | |
b410e6b9 | 2414 | break; |
87f0e418 | 2415 | |
b410e6b9 LP |
2416 | case JOB_STOP: |
2417 | case JOB_RESTART: | |
2418 | case JOB_TRY_RESTART: | |
87f0e418 | 2419 | |
fdf20a31 | 2420 | if (UNIT_IS_INACTIVE_OR_FAILED(ns)) |
833f92ad | 2421 | job_finish_and_invalidate(u->job, JOB_DONE, true, false); |
ac155bb8 | 2422 | else if (u->job->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) { |
b410e6b9 | 2423 | unexpected = true; |
833f92ad | 2424 | job_finish_and_invalidate(u->job, JOB_FAILED, true, false); |
b410e6b9 | 2425 | } |
87f0e418 | 2426 | |
b410e6b9 | 2427 | break; |
87f0e418 | 2428 | |
b410e6b9 LP |
2429 | default: |
2430 | assert_not_reached("Job type unknown"); | |
87f0e418 | 2431 | } |
87f0e418 | 2432 | |
7e6e7b06 LP |
2433 | } else |
2434 | unexpected = true; | |
2435 | ||
2c289ea8 | 2436 | if (!MANAGER_IS_RELOADING(m)) { |
f3bff0eb | 2437 | |
bdbf9951 LP |
2438 | /* If this state change happened without being |
2439 | * requested by a job, then let's retroactively start | |
2440 | * or stop dependencies. We skip that step when | |
2441 | * deserializing, since we don't want to create any | |
2442 | * additional jobs just because something is already | |
2443 | * activated. */ | |
2444 | ||
2445 | if (unexpected) { | |
2446 | if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns)) | |
2447 | retroactively_start_dependencies(u); | |
2448 | else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns)) | |
2449 | retroactively_stop_dependencies(u); | |
2450 | } | |
5de9682c | 2451 | |
cd0504d0 | 2452 | /* stop unneeded units regardless if going down was expected or not */ |
b33918c2 | 2453 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(ns)) |
cd0504d0 MS |
2454 | check_unneeded_dependencies(u); |
2455 | ||
bdbf9951 | 2456 | if (ns != os && ns == UNIT_FAILED) { |
ed77d407 | 2457 | log_unit_debug(u, "Unit entered failed state."); |
3ecaa09b | 2458 | unit_start_on_failure(u); |
cd6d0a45 | 2459 | } |
3b2775c5 | 2460 | } |
e537352b | 2461 | |
3b2775c5 LP |
2462 | /* Some names are special */ |
2463 | if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) { | |
2464 | ||
2465 | if (unit_has_name(u, SPECIAL_DBUS_SERVICE)) | |
865cc19a | 2466 | /* The bus might have just become available, |
3b2775c5 LP |
2467 | * hence try to connect to it, if we aren't |
2468 | * yet connected. */ | |
546ac4f0 | 2469 | bus_init(m, true); |
3b2775c5 | 2470 | |
ac155bb8 | 2471 | if (u->type == UNIT_SERVICE && |
3b2775c5 | 2472 | !UNIT_IS_ACTIVE_OR_RELOADING(os) && |
2c289ea8 | 2473 | !MANAGER_IS_RELOADING(m)) { |
3b2775c5 | 2474 | /* Write audit record if we have just finished starting up */ |
546ac4f0 | 2475 | manager_send_unit_audit(m, u, AUDIT_SERVICE_START, true); |
ac155bb8 | 2476 | u->in_audit = true; |
3b2775c5 | 2477 | } |
e983b760 | 2478 | |
3b2775c5 | 2479 | if (!UNIT_IS_ACTIVE_OR_RELOADING(os)) |
546ac4f0 | 2480 | manager_send_unit_plymouth(m, u); |
bdbf9951 | 2481 | |
3b2775c5 | 2482 | } else { |
915b1d01 LP |
2483 | /* We don't care about D-Bus going down here, since we'll get an asynchronous notification for it |
2484 | * anyway. */ | |
bdbf9951 | 2485 | |
915b1d01 LP |
2486 | if (UNIT_IS_INACTIVE_OR_FAILED(ns) && |
2487 | !UNIT_IS_INACTIVE_OR_FAILED(os) | |
2488 | && !MANAGER_IS_RELOADING(m)) { | |
cd6d0a45 | 2489 | |
915b1d01 LP |
2490 | /* This unit just stopped/failed. */ |
2491 | if (u->type == UNIT_SERVICE) { | |
4927fcae | 2492 | |
915b1d01 LP |
2493 | /* Hmm, if there was no start record written |
2494 | * write it now, so that we always have a nice | |
2495 | * pair */ | |
2496 | if (!u->in_audit) { | |
2497 | manager_send_unit_audit(m, u, AUDIT_SERVICE_START, ns == UNIT_INACTIVE); | |
cd6d0a45 | 2498 | |
915b1d01 LP |
2499 | if (ns == UNIT_INACTIVE) |
2500 | manager_send_unit_audit(m, u, AUDIT_SERVICE_STOP, true); | |
2501 | } else | |
2502 | /* Write audit record if we have just finished shutting down */ | |
2503 | manager_send_unit_audit(m, u, AUDIT_SERVICE_STOP, ns == UNIT_INACTIVE); | |
2504 | ||
2505 | u->in_audit = false; | |
2506 | } | |
bdbf9951 | 2507 | |
915b1d01 LP |
2508 | /* Write a log message about consumed resources */ |
2509 | unit_log_resources(u); | |
cd6d0a45 | 2510 | } |
f278026d LP |
2511 | } |
2512 | ||
546ac4f0 | 2513 | manager_recheck_journal(m); |
3ecaa09b | 2514 | unit_trigger_notify(u); |
3b2775c5 | 2515 | |
2c289ea8 | 2516 | if (!MANAGER_IS_RELOADING(u->manager)) { |
ff502445 LP |
2517 | /* Maybe we finished startup and are now ready for |
2518 | * being stopped because unneeded? */ | |
bf6dcfa6 | 2519 | unit_check_unneeded(u); |
c1e1601e | 2520 | |
ff502445 LP |
2521 | /* Maybe we finished startup, but something we needed |
2522 | * has vanished? Let's die then. (This happens when | |
2523 | * something BindsTo= to a Type=oneshot unit, as these | |
2524 | * units go directly from starting to inactive, | |
2525 | * without ever entering started.) */ | |
2526 | unit_check_binds_to(u); | |
53c35a76 LP |
2527 | |
2528 | if (os != UNIT_FAILED && ns == UNIT_FAILED) | |
2529 | (void) emergency_action(u->manager, u->failure_action, u->reboot_arg, "unit failed"); | |
e7dfbb4e LP |
2530 | else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && ns == UNIT_INACTIVE) |
2531 | (void) emergency_action(u->manager, u->success_action, u->reboot_arg, "unit succeeded"); | |
ff502445 LP |
2532 | } |
2533 | ||
c1e1601e | 2534 | unit_add_to_dbus_queue(u); |
701cc384 | 2535 | unit_add_to_gc_queue(u); |
87f0e418 LP |
2536 | } |
2537 | ||
87f0e418 | 2538 | int unit_watch_pid(Unit *u, pid_t pid) { |
62a76913 | 2539 | int r; |
a911bb9a | 2540 | |
87f0e418 | 2541 | assert(u); |
62a76913 | 2542 | assert(pid_is_valid(pid)); |
87f0e418 | 2543 | |
62a76913 | 2544 | /* Watch a specific PID */ |
5ba6985b | 2545 | |
d5099efc | 2546 | r = set_ensure_allocated(&u->pids, NULL); |
5ba6985b LP |
2547 | if (r < 0) |
2548 | return r; | |
2549 | ||
62a76913 | 2550 | r = hashmap_ensure_allocated(&u->manager->watch_pids, NULL); |
a911bb9a LP |
2551 | if (r < 0) |
2552 | return r; | |
2553 | ||
62a76913 LP |
2554 | /* First try, let's add the unit keyed by "pid". */ |
2555 | r = hashmap_put(u->manager->watch_pids, PID_TO_PTR(pid), u); | |
2556 | if (r == -EEXIST) { | |
2557 | Unit **array; | |
2558 | bool found = false; | |
2559 | size_t n = 0; | |
05e343b7 | 2560 | |
62a76913 LP |
2561 | /* OK, the "pid" key is already assigned to a different unit. Let's see if the "-pid" key (which points |
2562 | * to an array of Units rather than just a Unit), lists us already. */ | |
a911bb9a | 2563 | |
62a76913 LP |
2564 | array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid)); |
2565 | if (array) | |
2566 | for (; array[n]; n++) | |
2567 | if (array[n] == u) | |
2568 | found = true; | |
a911bb9a | 2569 | |
62a76913 LP |
2570 | if (found) /* Found it already? if so, do nothing */ |
2571 | r = 0; | |
2572 | else { | |
2573 | Unit **new_array; | |
2574 | ||
2575 | /* Allocate a new array */ | |
2576 | new_array = new(Unit*, n + 2); | |
2577 | if (!new_array) | |
2578 | return -ENOMEM; | |
2579 | ||
2580 | memcpy_safe(new_array, array, sizeof(Unit*) * n); | |
2581 | new_array[n] = u; | |
2582 | new_array[n+1] = NULL; | |
2583 | ||
2584 | /* Add or replace the old array */ | |
2585 | r = hashmap_replace(u->manager->watch_pids, PID_TO_PTR(-pid), new_array); | |
2586 | if (r < 0) { | |
2587 | free(new_array); | |
2588 | return r; | |
2589 | } | |
2590 | ||
2591 | free(array); | |
2592 | } | |
2593 | } else if (r < 0) | |
2594 | return r; | |
2595 | ||
2596 | r = set_put(u->pids, PID_TO_PTR(pid)); | |
2597 | if (r < 0) | |
2598 | return r; | |
2599 | ||
2600 | return 0; | |
87f0e418 LP |
2601 | } |
2602 | ||
2603 | void unit_unwatch_pid(Unit *u, pid_t pid) { | |
62a76913 LP |
2604 | Unit **array; |
2605 | ||
87f0e418 | 2606 | assert(u); |
62a76913 LP |
2607 | assert(pid_is_valid(pid)); |
2608 | ||
2609 | /* First let's drop the unit in case it's keyed as "pid". */ | |
2610 | (void) hashmap_remove_value(u->manager->watch_pids, PID_TO_PTR(pid), u); | |
2611 | ||
2612 | /* Then, let's also drop the unit, in case it's in the array keyed by -pid */ | |
2613 | array = hashmap_get(u->manager->watch_pids, PID_TO_PTR(-pid)); | |
2614 | if (array) { | |
2615 | size_t n, m = 0; | |
2616 | ||
2617 | /* Let's iterate through the array, dropping our own entry */ | |
2618 | for (n = 0; array[n]; n++) | |
2619 | if (array[n] != u) | |
2620 | array[m++] = array[n]; | |
2621 | array[m] = NULL; | |
2622 | ||
2623 | if (m == 0) { | |
2624 | /* The array is now empty, remove the entire entry */ | |
2625 | assert(hashmap_remove(u->manager->watch_pids, PID_TO_PTR(-pid)) == array); | |
2626 | free(array); | |
2627 | } | |
2628 | } | |
87f0e418 | 2629 | |
fea72cc0 | 2630 | (void) set_remove(u->pids, PID_TO_PTR(pid)); |
a911bb9a LP |
2631 | } |
2632 | ||
bd44e61b LP |
2633 | void unit_unwatch_all_pids(Unit *u) { |
2634 | assert(u); | |
2635 | ||
2636 | while (!set_isempty(u->pids)) | |
fea72cc0 | 2637 | unit_unwatch_pid(u, PTR_TO_PID(set_first(u->pids))); |
bd44e61b | 2638 | |
efdb0237 | 2639 | u->pids = set_free(u->pids); |
a911bb9a LP |
2640 | } |
2641 | ||
2642 | void unit_tidy_watch_pids(Unit *u, pid_t except1, pid_t except2) { | |
2643 | Iterator i; | |
2644 | void *e; | |
2645 | ||
2646 | assert(u); | |
2647 | ||
2648 | /* Cleans dead PIDs from our list */ | |
2649 | ||
2650 | SET_FOREACH(e, u->pids, i) { | |
fea72cc0 | 2651 | pid_t pid = PTR_TO_PID(e); |
a911bb9a LP |
2652 | |
2653 | if (pid == except1 || pid == except2) | |
2654 | continue; | |
2655 | ||
9f5650ae | 2656 | if (!pid_is_unwaited(pid)) |
bd44e61b | 2657 | unit_unwatch_pid(u, pid); |
a911bb9a | 2658 | } |
87f0e418 LP |
2659 | } |
2660 | ||
87f0e418 LP |
2661 | bool unit_job_is_applicable(Unit *u, JobType j) { |
2662 | assert(u); | |
2663 | assert(j >= 0 && j < _JOB_TYPE_MAX); | |
2664 | ||
2665 | switch (j) { | |
2666 | ||
2667 | case JOB_VERIFY_ACTIVE: | |
2668 | case JOB_START: | |
e0209d83 | 2669 | case JOB_NOP: |
f5869324 LP |
2670 | /* Note that we don't check unit_can_start() here. That's because .device units and suchlike are not |
2671 | * startable by us but may appear due to external events, and it thus makes sense to permit enqueing | |
2672 | * jobs for it. */ | |
87f0e418 LP |
2673 | return true; |
2674 | ||
f5869324 LP |
2675 | case JOB_STOP: |
2676 | /* Similar as above. However, perpetual units can never be stopped (neither explicitly nor due to | |
2677 | * external events), hence it makes no sense to permit enqueing such a request either. */ | |
2678 | return !u->perpetual; | |
2679 | ||
87f0e418 LP |
2680 | case JOB_RESTART: |
2681 | case JOB_TRY_RESTART: | |
f5869324 | 2682 | return unit_can_stop(u) && unit_can_start(u); |
87f0e418 LP |
2683 | |
2684 | case JOB_RELOAD: | |
3282591d | 2685 | case JOB_TRY_RELOAD: |
87f0e418 LP |
2686 | return unit_can_reload(u); |
2687 | ||
2688 | case JOB_RELOAD_OR_START: | |
2689 | return unit_can_reload(u) && unit_can_start(u); | |
2690 | ||
2691 | default: | |
2692 | assert_not_reached("Invalid job type"); | |
2693 | } | |
2694 | } | |
2695 | ||
f2341e0a LP |
2696 | static void maybe_warn_about_dependency(Unit *u, const char *other, UnitDependency dependency) { |
2697 | assert(u); | |
d1fab3fe | 2698 | |
f2341e0a LP |
2699 | /* Only warn about some unit types */ |
2700 | if (!IN_SET(dependency, UNIT_CONFLICTS, UNIT_CONFLICTED_BY, UNIT_BEFORE, UNIT_AFTER, UNIT_ON_FAILURE, UNIT_TRIGGERS, UNIT_TRIGGERED_BY)) | |
2701 | return; | |
3f3cc397 | 2702 | |
f2341e0a LP |
2703 | if (streq_ptr(u->id, other)) |
2704 | log_unit_warning(u, "Dependency %s=%s dropped", unit_dependency_to_string(dependency), u->id); | |
2705 | else | |
2706 | log_unit_warning(u, "Dependency %s=%s dropped, merged into %s", unit_dependency_to_string(dependency), strna(other), u->id); | |
d1fab3fe ZJS |
2707 | } |
2708 | ||
eef85c4a LP |
2709 | static int unit_add_dependency_hashmap( |
2710 | Hashmap **h, | |
2711 | Unit *other, | |
2712 | UnitDependencyMask origin_mask, | |
2713 | UnitDependencyMask destination_mask) { | |
2714 | ||
2715 | UnitDependencyInfo info; | |
2716 | int r; | |
2717 | ||
2718 | assert(h); | |
2719 | assert(other); | |
2720 | assert(origin_mask < _UNIT_DEPENDENCY_MASK_FULL); | |
2721 | assert(destination_mask < _UNIT_DEPENDENCY_MASK_FULL); | |
2722 | assert(origin_mask > 0 || destination_mask > 0); | |
2723 | ||
2724 | r = hashmap_ensure_allocated(h, NULL); | |
2725 | if (r < 0) | |
2726 | return r; | |
2727 | ||
2728 | assert_cc(sizeof(void*) == sizeof(info)); | |
2729 | ||
2730 | info.data = hashmap_get(*h, other); | |
2731 | if (info.data) { | |
2732 | /* Entry already exists. Add in our mask. */ | |
2733 | ||
2734 | if ((info.origin_mask & origin_mask) == info.origin_mask && | |
2735 | (info.destination_mask & destination_mask) == info.destination_mask) | |
2736 | return 0; /* NOP */ | |
2737 | ||
2738 | info.origin_mask |= origin_mask; | |
2739 | info.destination_mask |= destination_mask; | |
2740 | ||
2741 | r = hashmap_update(*h, other, info.data); | |
2742 | } else { | |
2743 | info = (UnitDependencyInfo) { | |
2744 | .origin_mask = origin_mask, | |
2745 | .destination_mask = destination_mask, | |
2746 | }; | |
2747 | ||
2748 | r = hashmap_put(*h, other, info.data); | |
2749 | } | |
2750 | if (r < 0) | |
2751 | return r; | |
2752 | ||
2753 | return 1; | |
2754 | } | |
2755 | ||
2756 | int unit_add_dependency( | |
2757 | Unit *u, | |
2758 | UnitDependency d, | |
2759 | Unit *other, | |
2760 | bool add_reference, | |
2761 | UnitDependencyMask mask) { | |
87f0e418 LP |
2762 | |
2763 | static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = { | |
2764 | [UNIT_REQUIRES] = UNIT_REQUIRED_BY, | |
87f0e418 | 2765 | [UNIT_WANTS] = UNIT_WANTED_BY, |
be7d9ff7 | 2766 | [UNIT_REQUISITE] = UNIT_REQUISITE_OF, |
7f2cddae | 2767 | [UNIT_BINDS_TO] = UNIT_BOUND_BY, |
60649f17 | 2768 | [UNIT_PART_OF] = UNIT_CONSISTS_OF, |
be7d9ff7 | 2769 | [UNIT_REQUIRED_BY] = UNIT_REQUIRES, |
be7d9ff7 | 2770 | [UNIT_REQUISITE_OF] = UNIT_REQUISITE, |
be7d9ff7 | 2771 | [UNIT_WANTED_BY] = UNIT_WANTS, |
7f2cddae | 2772 | [UNIT_BOUND_BY] = UNIT_BINDS_TO, |
60649f17 | 2773 | [UNIT_CONSISTS_OF] = UNIT_PART_OF, |
69dd2852 LP |
2774 | [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY, |
2775 | [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS, | |
87f0e418 | 2776 | [UNIT_BEFORE] = UNIT_AFTER, |
701cc384 | 2777 | [UNIT_AFTER] = UNIT_BEFORE, |
5de9682c | 2778 | [UNIT_ON_FAILURE] = _UNIT_DEPENDENCY_INVALID, |
701cc384 | 2779 | [UNIT_REFERENCES] = UNIT_REFERENCED_BY, |
57020a3a LP |
2780 | [UNIT_REFERENCED_BY] = UNIT_REFERENCES, |
2781 | [UNIT_TRIGGERS] = UNIT_TRIGGERED_BY, | |
4dcc1cb4 | 2782 | [UNIT_TRIGGERED_BY] = UNIT_TRIGGERS, |
7f2cddae | 2783 | [UNIT_PROPAGATES_RELOAD_TO] = UNIT_RELOAD_PROPAGATED_FROM, |
85e9a101 | 2784 | [UNIT_RELOAD_PROPAGATED_FROM] = UNIT_PROPAGATES_RELOAD_TO, |
613b411c | 2785 | [UNIT_JOINS_NAMESPACE_OF] = UNIT_JOINS_NAMESPACE_OF, |
87f0e418 | 2786 | }; |
eef85c4a LP |
2787 | Unit *original_u = u, *original_other = other; |
2788 | int r; | |
87f0e418 LP |
2789 | |
2790 | assert(u); | |
2791 | assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX); | |
87f0e418 LP |
2792 | assert(other); |
2793 | ||
9f151f29 LP |
2794 | u = unit_follow_merge(u); |
2795 | other = unit_follow_merge(other); | |
2796 | ||
87f0e418 LP |
2797 | /* We won't allow dependencies on ourselves. We will not |
2798 | * consider them an error however. */ | |
d1fab3fe | 2799 | if (u == other) { |
eef85c4a | 2800 | maybe_warn_about_dependency(original_u, original_other->id, d); |
87f0e418 | 2801 | return 0; |
d1fab3fe | 2802 | } |
87f0e418 | 2803 | |
eef85c4a LP |
2804 | if ((d == UNIT_BEFORE && other->type == UNIT_DEVICE) || |
2805 | (d == UNIT_AFTER && u->type == UNIT_DEVICE)) { | |
dd5e7000 ZJS |
2806 | log_unit_warning(u, "Dependency Before=%s ignored (.device units cannot be delayed)", other->id); |
2807 | return 0; | |
2808 | } | |
2809 | ||
eef85c4a | 2810 | r = unit_add_dependency_hashmap(u->dependencies + d, other, mask, 0); |
613b411c | 2811 | if (r < 0) |
87f0e418 LP |
2812 | return r; |
2813 | ||
eef85c4a LP |
2814 | if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID && inverse_table[d] != d) { |
2815 | r = unit_add_dependency_hashmap(other->dependencies + inverse_table[d], u, 0, mask); | |
613b411c LP |
2816 | if (r < 0) |
2817 | return r; | |
2818 | } | |
2819 | ||
2820 | if (add_reference) { | |
eef85c4a | 2821 | r = unit_add_dependency_hashmap(u->dependencies + UNIT_REFERENCES, other, mask, 0); |
613b411c | 2822 | if (r < 0) |
5de9682c LP |
2823 | return r; |
2824 | ||
eef85c4a | 2825 | r = unit_add_dependency_hashmap(other->dependencies + UNIT_REFERENCED_BY, u, 0, mask); |
613b411c | 2826 | if (r < 0) |
701cc384 | 2827 | return r; |
613b411c | 2828 | } |
87f0e418 | 2829 | |
c1e1601e | 2830 | unit_add_to_dbus_queue(u); |
87f0e418 LP |
2831 | return 0; |
2832 | } | |
0301abf4 | 2833 | |
eef85c4a | 2834 | int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference, UnitDependencyMask mask) { |
2c966c03 LP |
2835 | int r; |
2836 | ||
2837 | assert(u); | |
2838 | ||
eef85c4a | 2839 | r = unit_add_dependency(u, d, other, add_reference, mask); |
3f3cc397 | 2840 | if (r < 0) |
2c966c03 LP |
2841 | return r; |
2842 | ||
eef85c4a | 2843 | return unit_add_dependency(u, e, other, add_reference, mask); |
2c966c03 LP |
2844 | } |
2845 | ||
7410616c LP |
2846 | static int resolve_template(Unit *u, const char *name, const char*path, char **buf, const char **ret) { |
2847 | int r; | |
9e2f7c11 LP |
2848 | |
2849 | assert(u); | |
2850 | assert(name || path); | |
7410616c LP |
2851 | assert(buf); |
2852 | assert(ret); | |
9e2f7c11 LP |
2853 | |
2854 | if (!name) | |
2b6bf07d | 2855 | name = basename(path); |
9e2f7c11 | 2856 | |
7410616c LP |
2857 | if (!unit_name_is_valid(name, UNIT_NAME_TEMPLATE)) { |
2858 | *buf = NULL; | |
2859 | *ret = name; | |
2860 | return 0; | |
9e2f7c11 LP |
2861 | } |
2862 | ||
ac155bb8 | 2863 | if (u->instance) |
7410616c | 2864 | r = unit_name_replace_instance(name, u->instance, buf); |
9e2f7c11 | 2865 | else { |
ae018d9b | 2866 | _cleanup_free_ char *i = NULL; |
9e2f7c11 | 2867 | |
7410616c LP |
2868 | r = unit_name_to_prefix(u->id, &i); |
2869 | if (r < 0) | |
2870 | return r; | |
9e2f7c11 | 2871 | |
7410616c | 2872 | r = unit_name_replace_instance(name, i, buf); |
9e2f7c11 | 2873 | } |
7410616c LP |
2874 | if (r < 0) |
2875 | return r; | |
9e2f7c11 | 2876 | |
7410616c LP |
2877 | *ret = *buf; |
2878 | return 0; | |
9e2f7c11 LP |
2879 | } |
2880 | ||
eef85c4a | 2881 | int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference, UnitDependencyMask mask) { |
7410616c | 2882 | _cleanup_free_ char *buf = NULL; |
09b6b09f LP |
2883 | Unit *other; |
2884 | int r; | |
2885 | ||
9e2f7c11 LP |
2886 | assert(u); |
2887 | assert(name || path); | |
09b6b09f | 2888 | |
7410616c LP |
2889 | r = resolve_template(u, name, path, &buf, &name); |
2890 | if (r < 0) | |
2891 | return r; | |
09b6b09f | 2892 | |
8afbb8e1 LP |
2893 | r = manager_load_unit(u->manager, name, path, NULL, &other); |
2894 | if (r < 0) | |
2895 | return r; | |
9e2f7c11 | 2896 | |
eef85c4a | 2897 | return unit_add_dependency(u, d, other, add_reference, mask); |
09b6b09f LP |
2898 | } |
2899 | ||
eef85c4a | 2900 | int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, const char *path, bool add_reference, UnitDependencyMask mask) { |
7410616c | 2901 | _cleanup_free_ char *buf = NULL; |
2c966c03 LP |
2902 | Unit *other; |
2903 | int r; | |
2c966c03 LP |
2904 | |
2905 | assert(u); | |
2906 | assert(name || path); | |
2907 | ||
7410616c LP |
2908 | r = resolve_template(u, name, path, &buf, &name); |
2909 | if (r < 0) | |
2910 | return r; | |
2c966c03 | 2911 | |
3f3cc397 LP |
2912 | r = manager_load_unit(u->manager, name, path, NULL, &other); |
2913 | if (r < 0) | |
68eda4bd | 2914 | return r; |
2c966c03 | 2915 | |
eef85c4a | 2916 | return unit_add_two_dependencies(u, d, e, other, add_reference, mask); |
2c966c03 LP |
2917 | } |
2918 | ||
0301abf4 | 2919 | int set_unit_path(const char *p) { |
0301abf4 | 2920 | /* This is mostly for debug purposes */ |
cbe46ead | 2921 | if (setenv("SYSTEMD_UNIT_PATH", p, 1) < 0) |
26d04f86 | 2922 | return -errno; |
0301abf4 LP |
2923 | |
2924 | return 0; | |
2925 | } | |
88066b3a | 2926 | |
ea430986 | 2927 | char *unit_dbus_path(Unit *u) { |
ea430986 LP |
2928 | assert(u); |
2929 | ||
ac155bb8 | 2930 | if (!u->id) |
04ade7d2 LP |
2931 | return NULL; |
2932 | ||
48899192 | 2933 | return unit_dbus_path_from_name(u->id); |
ea430986 LP |
2934 | } |
2935 | ||
4b58153d LP |
2936 | char *unit_dbus_path_invocation_id(Unit *u) { |
2937 | assert(u); | |
2938 | ||
2939 | if (sd_id128_is_null(u->invocation_id)) | |
2940 | return NULL; | |
2941 | ||
2942 | return unit_dbus_path_from_name(u->invocation_id_string); | |
2943 | } | |
2944 | ||
d79200e2 LP |
2945 | int unit_set_slice(Unit *u, Unit *slice) { |
2946 | assert(u); | |
2947 | assert(slice); | |
2948 | ||
2949 | /* Sets the unit slice if it has not been set before. Is extra | |
2950 | * careful, to only allow this for units that actually have a | |
2951 | * cgroup context. Also, we don't allow to set this for slices | |
2952 | * (since the parent slice is derived from the name). Make | |
2953 | * sure the unit we set is actually a slice. */ | |
2954 | ||
2955 | if (!UNIT_HAS_CGROUP_CONTEXT(u)) | |
2956 | return -EOPNOTSUPP; | |
2957 | ||
2958 | if (u->type == UNIT_SLICE) | |
2959 | return -EINVAL; | |
2960 | ||
102ef982 LP |
2961 | if (unit_active_state(u) != UNIT_INACTIVE) |
2962 | return -EBUSY; | |
2963 | ||
d79200e2 LP |
2964 | if (slice->type != UNIT_SLICE) |
2965 | return -EINVAL; | |
2966 | ||
efdb0237 LP |
2967 | if (unit_has_name(u, SPECIAL_INIT_SCOPE) && |
2968 | !unit_has_name(slice, SPECIAL_ROOT_SLICE)) | |
2969 | return -EPERM; | |
2970 | ||
d79200e2 LP |
2971 | if (UNIT_DEREF(u->slice) == slice) |
2972 | return 0; | |
2973 | ||
99e66921 TH |
2974 | /* Disallow slice changes if @u is already bound to cgroups */ |
2975 | if (UNIT_ISSET(u->slice) && u->cgroup_realized) | |
d79200e2 LP |
2976 | return -EBUSY; |
2977 | ||
7f7d01ed | 2978 | unit_ref_set(&u->slice, u, slice); |
d79200e2 LP |
2979 | return 1; |
2980 | } | |
2981 | ||
2982 | int unit_set_default_slice(Unit *u) { | |
a8833944 LP |
2983 | _cleanup_free_ char *b = NULL; |
2984 | const char *slice_name; | |
a016b922 LP |
2985 | Unit *slice; |
2986 | int r; | |
2987 | ||
2988 | assert(u); | |
2989 | ||
9444b1f2 | 2990 | if (UNIT_ISSET(u->slice)) |
a016b922 LP |
2991 | return 0; |
2992 | ||
a8833944 LP |
2993 | if (u->instance) { |
2994 | _cleanup_free_ char *prefix = NULL, *escaped = NULL; | |
68eda4bd | 2995 | |
a8833944 LP |
2996 | /* Implicitly place all instantiated units in their |
2997 | * own per-template slice */ | |
2998 | ||
7410616c LP |
2999 | r = unit_name_to_prefix(u->id, &prefix); |
3000 | if (r < 0) | |
3001 | return r; | |
a8833944 LP |
3002 | |
3003 | /* The prefix is already escaped, but it might include | |
3004 | * "-" which has a special meaning for slice units, | |
3005 | * hence escape it here extra. */ | |
7410616c | 3006 | escaped = unit_name_escape(prefix); |
a8833944 LP |
3007 | if (!escaped) |
3008 | return -ENOMEM; | |
3009 | ||
463d0d15 | 3010 | if (MANAGER_IS_SYSTEM(u->manager)) |
605405c6 | 3011 | b = strjoin("system-", escaped, ".slice"); |
a8833944 LP |
3012 | else |
3013 | b = strappend(escaped, ".slice"); | |
3014 | if (!b) | |
3015 | return -ENOMEM; | |
3016 | ||
3017 | slice_name = b; | |
3018 | } else | |
3019 | slice_name = | |
463d0d15 | 3020 | MANAGER_IS_SYSTEM(u->manager) && !unit_has_name(u, SPECIAL_INIT_SCOPE) |
a8833944 LP |
3021 | ? SPECIAL_SYSTEM_SLICE |
3022 | : SPECIAL_ROOT_SLICE; | |
3023 | ||
3024 | r = manager_load_unit(u->manager, slice_name, NULL, NULL, &slice); | |
a016b922 LP |
3025 | if (r < 0) |
3026 | return r; | |
3027 | ||
d79200e2 | 3028 | return unit_set_slice(u, slice); |
a016b922 LP |
3029 | } |
3030 | ||
9444b1f2 LP |
3031 | const char *unit_slice_name(Unit *u) { |
3032 | assert(u); | |
3033 | ||
3034 | if (!UNIT_ISSET(u->slice)) | |
3035 | return NULL; | |
3036 | ||
3037 | return UNIT_DEREF(u->slice)->id; | |
3038 | } | |
3039 | ||
f6ff8c29 | 3040 | int unit_load_related_unit(Unit *u, const char *type, Unit **_found) { |
78edb35a | 3041 | _cleanup_free_ char *t = NULL; |
f6ff8c29 LP |
3042 | int r; |
3043 | ||
3044 | assert(u); | |
3045 | assert(type); | |
3046 | assert(_found); | |
3047 | ||
7410616c LP |
3048 | r = unit_name_change_suffix(u->id, type, &t); |
3049 | if (r < 0) | |
3050 | return r; | |
3051 | if (unit_has_name(u, t)) | |
3052 | return -EINVAL; | |
f6ff8c29 | 3053 | |
ac155bb8 | 3054 | r = manager_load_unit(u->manager, t, NULL, NULL, _found); |
9e2f7c11 | 3055 | assert(r < 0 || *_found != u); |
f6ff8c29 LP |
3056 | return r; |
3057 | } | |
3058 | ||
bbc29086 DM |
3059 | static int signal_name_owner_changed(sd_bus_message *message, void *userdata, sd_bus_error *error) { |
3060 | const char *name, *old_owner, *new_owner; | |
3061 | Unit *u = userdata; | |
3062 | int r; | |
3063 | ||
3064 | assert(message); | |
3065 | assert(u); | |
3066 | ||
3067 | r = sd_bus_message_read(message, "sss", &name, &old_owner, &new_owner); | |
3068 | if (r < 0) { | |
3069 | bus_log_parse_error(r); | |
3070 | return 0; | |
3071 | } | |
3072 | ||
a8ea93a5 LP |
3073 | old_owner = empty_to_null(old_owner); |
3074 | new_owner = empty_to_null(new_owner); | |
b0076268 | 3075 | |
bbc29086 DM |
3076 | if (UNIT_VTABLE(u)->bus_name_owner_change) |
3077 | UNIT_VTABLE(u)->bus_name_owner_change(u, name, old_owner, new_owner); | |
3078 | ||
3079 | return 0; | |
3080 | } | |
3081 | ||
9806e87d LP |
3082 | int unit_install_bus_match(Unit *u, sd_bus *bus, const char *name) { |
3083 | const char *match; | |
bbc29086 | 3084 | |
9806e87d LP |
3085 | assert(u); |
3086 | assert(bus); | |
3087 | assert(name); | |
bbc29086 DM |
3088 | |
3089 | if (u->match_bus_slot) | |
3090 | return -EBUSY; | |
3091 | ||
9806e87d | 3092 | match = strjoina("type='signal'," |
81d62103 ZJS |
3093 | "sender='org.freedesktop.DBus'," |
3094 | "path='/org/freedesktop/DBus'," | |
3095 | "interface='org.freedesktop.DBus'," | |
3096 | "member='NameOwnerChanged'," | |
3097 | "arg0='", name, "'"); | |
bbc29086 | 3098 | |
75152a4d | 3099 | return sd_bus_add_match_async(bus, &u->match_bus_slot, match, signal_name_owner_changed, NULL, u); |
bbc29086 DM |
3100 | } |
3101 | ||
05e343b7 | 3102 | int unit_watch_bus_name(Unit *u, const char *name) { |
bbc29086 DM |
3103 | int r; |
3104 | ||
05e343b7 LP |
3105 | assert(u); |
3106 | assert(name); | |
3107 | ||
3108 | /* Watch a specific name on the bus. We only support one unit | |
3109 | * watching each name for now. */ | |
3110 | ||
bbc29086 DM |
3111 | if (u->manager->api_bus) { |
3112 | /* If the bus is already available, install the match directly. | |
3113 | * Otherwise, just put the name in the list. bus_setup_api() will take care later. */ | |
9806e87d | 3114 | r = unit_install_bus_match(u, u->manager->api_bus, name); |
bbc29086 | 3115 | if (r < 0) |
8ea823b6 | 3116 | return log_warning_errno(r, "Failed to subscribe to NameOwnerChanged signal for '%s': %m", name); |
bbc29086 DM |
3117 | } |
3118 | ||
3119 | r = hashmap_put(u->manager->watch_bus, name, u); | |
3120 | if (r < 0) { | |
3121 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); | |
3122 | return log_warning_errno(r, "Failed to put bus name to hashmap: %m"); | |
3123 | } | |
3124 | ||
3125 | return 0; | |
05e343b7 LP |
3126 | } |
3127 | ||
3128 | void unit_unwatch_bus_name(Unit *u, const char *name) { | |
3129 | assert(u); | |
3130 | assert(name); | |
3131 | ||
8367fea5 | 3132 | (void) hashmap_remove_value(u->manager->watch_bus, name, u); |
bbc29086 | 3133 | u->match_bus_slot = sd_bus_slot_unref(u->match_bus_slot); |
05e343b7 LP |
3134 | } |
3135 | ||
a16e1123 LP |
3136 | bool unit_can_serialize(Unit *u) { |
3137 | assert(u); | |
3138 | ||
3139 | return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item; | |
3140 | } | |
3141 | ||
8b108bd0 FB |
3142 | static int unit_serialize_cgroup_mask(FILE *f, const char *key, CGroupMask mask) { |
3143 | _cleanup_free_ char *s = NULL; | |
3144 | int r = 0; | |
3145 | ||
3146 | assert(f); | |
3147 | assert(key); | |
3148 | ||
3149 | if (mask != 0) { | |
3150 | r = cg_mask_to_string(mask, &s); | |
3151 | if (r >= 0) { | |
3152 | fputs(key, f); | |
3153 | fputc('=', f); | |
3154 | fputs(s, f); | |
3155 | fputc('\n', f); | |
3156 | } | |
3157 | } | |
3158 | return r; | |
3159 | } | |
3160 | ||
6b659ed8 LP |
3161 | static const char *ip_accounting_metric_field[_CGROUP_IP_ACCOUNTING_METRIC_MAX] = { |
3162 | [CGROUP_IP_INGRESS_BYTES] = "ip-accounting-ingress-bytes", | |
3163 | [CGROUP_IP_INGRESS_PACKETS] = "ip-accounting-ingress-packets", | |
3164 | [CGROUP_IP_EGRESS_BYTES] = "ip-accounting-egress-bytes", | |
3165 | [CGROUP_IP_EGRESS_PACKETS] = "ip-accounting-egress-packets", | |
3166 | }; | |
3167 | ||
6b78f9b4 | 3168 | int unit_serialize(Unit *u, FILE *f, FDSet *fds, bool serialize_jobs) { |
6b659ed8 | 3169 | CGroupIPAccountingMetric m; |
a16e1123 LP |
3170 | int r; |
3171 | ||
3172 | assert(u); | |
3173 | assert(f); | |
3174 | assert(fds); | |
3175 | ||
9bdb98c5 | 3176 | if (unit_can_serialize(u)) { |
9bdb98c5 | 3177 | r = UNIT_VTABLE(u)->serialize(u, f, fds); |
613b411c LP |
3178 | if (r < 0) |
3179 | return r; | |
e0209d83 MS |
3180 | } |
3181 | ||
a483fb59 LP |
3182 | dual_timestamp_serialize(f, "state-change-timestamp", &u->state_change_timestamp); |
3183 | ||
ac155bb8 MS |
3184 | dual_timestamp_serialize(f, "inactive-exit-timestamp", &u->inactive_exit_timestamp); |
3185 | dual_timestamp_serialize(f, "active-enter-timestamp", &u->active_enter_timestamp); | |
3186 | dual_timestamp_serialize(f, "active-exit-timestamp", &u->active_exit_timestamp); | |
3187 | dual_timestamp_serialize(f, "inactive-enter-timestamp", &u->inactive_enter_timestamp); | |
a483fb59 | 3188 | |
ac155bb8 | 3189 | dual_timestamp_serialize(f, "condition-timestamp", &u->condition_timestamp); |
59fccdc5 | 3190 | dual_timestamp_serialize(f, "assert-timestamp", &u->assert_timestamp); |
2791a8f8 | 3191 | |
ac155bb8 MS |
3192 | if (dual_timestamp_is_set(&u->condition_timestamp)) |
3193 | unit_serialize_item(u, f, "condition-result", yes_no(u->condition_result)); | |
10717a1a | 3194 | |
59fccdc5 LP |
3195 | if (dual_timestamp_is_set(&u->assert_timestamp)) |
3196 | unit_serialize_item(u, f, "assert-result", yes_no(u->assert_result)); | |
3197 | ||
c2756a68 | 3198 | unit_serialize_item(u, f, "transient", yes_no(u->transient)); |
fe700f46 | 3199 | |
d3070fbd LP |
3200 | unit_serialize_item(u, f, "exported-invocation-id", yes_no(u->exported_invocation_id)); |
3201 | unit_serialize_item(u, f, "exported-log-level-max", yes_no(u->exported_log_level_max)); | |
3202 | unit_serialize_item(u, f, "exported-log-extra-fields", yes_no(u->exported_log_extra_fields)); | |
3203 | ||
66ebf6c0 | 3204 | unit_serialize_item_format(u, f, "cpu-usage-base", "%" PRIu64, u->cpu_usage_base); |
fe700f46 LP |
3205 | if (u->cpu_usage_last != NSEC_INFINITY) |
3206 | unit_serialize_item_format(u, f, "cpu-usage-last", "%" PRIu64, u->cpu_usage_last); | |
c2756a68 LP |
3207 | |
3208 | if (u->cgroup_path) | |
3209 | unit_serialize_item(u, f, "cgroup", u->cgroup_path); | |
de1d4f9b | 3210 | unit_serialize_item(u, f, "cgroup-realized", yes_no(u->cgroup_realized)); |
8b108bd0 FB |
3211 | (void) unit_serialize_cgroup_mask(f, "cgroup-realized-mask", u->cgroup_realized_mask); |
3212 | (void) unit_serialize_cgroup_mask(f, "cgroup-enabled-mask", u->cgroup_enabled_mask); | |
906c06f6 | 3213 | unit_serialize_item_format(u, f, "cgroup-bpf-realized", "%i", u->cgroup_bpf_state); |
c2756a68 | 3214 | |
00d9ef85 LP |
3215 | if (uid_is_valid(u->ref_uid)) |
3216 | unit_serialize_item_format(u, f, "ref-uid", UID_FMT, u->ref_uid); | |
3217 | if (gid_is_valid(u->ref_gid)) | |
3218 | unit_serialize_item_format(u, f, "ref-gid", GID_FMT, u->ref_gid); | |
3219 | ||
4b58153d LP |
3220 | if (!sd_id128_is_null(u->invocation_id)) |
3221 | unit_serialize_item_format(u, f, "invocation-id", SD_ID128_FORMAT_STR, SD_ID128_FORMAT_VAL(u->invocation_id)); | |
3222 | ||
05a98afd LP |
3223 | bus_track_serialize(u->bus_track, f, "ref"); |
3224 | ||
6b659ed8 LP |
3225 | for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) { |
3226 | uint64_t v; | |
3227 | ||
3228 | r = unit_get_ip_accounting(u, m, &v); | |
3229 | if (r >= 0) | |
3230 | unit_serialize_item_format(u, f, ip_accounting_metric_field[m], "%" PRIu64, v); | |
3231 | } | |
3232 | ||
613b411c LP |
3233 | if (serialize_jobs) { |
3234 | if (u->job) { | |
3235 | fprintf(f, "job\n"); | |
05a98afd | 3236 | job_serialize(u->job, f); |
613b411c LP |
3237 | } |
3238 | ||
3239 | if (u->nop_job) { | |
3240 | fprintf(f, "job\n"); | |
05a98afd | 3241 | job_serialize(u->nop_job, f); |
613b411c LP |
3242 | } |
3243 | } | |
3244 | ||
a16e1123 LP |
3245 | /* End marker */ |
3246 | fputc('\n', f); | |
3247 | return 0; | |
3248 | } | |
3249 | ||
a34ceba6 LP |
3250 | int unit_serialize_item(Unit *u, FILE *f, const char *key, const char *value) { |
3251 | assert(u); | |
3252 | assert(f); | |
3253 | assert(key); | |
3254 | ||
3255 | if (!value) | |
3256 | return 0; | |
3257 | ||
3258 | fputs(key, f); | |
3259 | fputc('=', f); | |
3260 | fputs(value, f); | |
3261 | fputc('\n', f); | |
3262 | ||
3263 | return 1; | |
3264 | } | |
3265 | ||
3266 | int unit_serialize_item_escaped(Unit *u, FILE *f, const char *key, const char *value) { | |
3267 | _cleanup_free_ char *c = NULL; | |
3268 | ||
3269 | assert(u); | |
3270 | assert(f); | |
3271 | assert(key); | |
3272 | ||
3273 | if (!value) | |
3274 | return 0; | |
3275 | ||
3276 | c = cescape(value); | |
3277 | if (!c) | |
3278 | return -ENOMEM; | |
3279 | ||
3280 | fputs(key, f); | |
3281 | fputc('=', f); | |
3282 | fputs(c, f); | |
3283 | fputc('\n', f); | |
3284 | ||
3285 | return 1; | |
3286 | } | |
3287 | ||
3288 | int unit_serialize_item_fd(Unit *u, FILE *f, FDSet *fds, const char *key, int fd) { | |
3289 | int copy; | |
3290 | ||
3291 | assert(u); | |
3292 | assert(f); | |
3293 | assert(key); | |
3294 | ||
3295 | if (fd < 0) | |
3296 | return 0; | |
3297 | ||
3298 | copy = fdset_put_dup(fds, fd); | |
3299 | if (copy < 0) | |
3300 | return copy; | |
3301 | ||
3302 | fprintf(f, "%s=%i\n", key, copy); | |
3303 | return 1; | |
3304 | } | |
3305 | ||
a16e1123 LP |
3306 | void unit_serialize_item_format(Unit *u, FILE *f, const char *key, const char *format, ...) { |
3307 | va_list ap; | |
3308 | ||
3309 | assert(u); | |
3310 | assert(f); | |
3311 | assert(key); | |
3312 | assert(format); | |
3313 | ||
3314 | fputs(key, f); | |
3315 | fputc('=', f); | |
3316 | ||
3317 | va_start(ap, format); | |
3318 | vfprintf(f, format, ap); | |
3319 | va_end(ap); | |
3320 | ||
3321 | fputc('\n', f); | |
3322 | } | |
3323 | ||
a16e1123 LP |
3324 | int unit_deserialize(Unit *u, FILE *f, FDSet *fds) { |
3325 | int r; | |
3326 | ||
3327 | assert(u); | |
3328 | assert(f); | |
3329 | assert(fds); | |
3330 | ||
a16e1123 | 3331 | for (;;) { |
20c03b7b | 3332 | char line[LINE_MAX], *l, *v; |
6b659ed8 | 3333 | CGroupIPAccountingMetric m; |
a16e1123 LP |
3334 | size_t k; |
3335 | ||
3336 | if (!fgets(line, sizeof(line), f)) { | |
3337 | if (feof(f)) | |
3338 | return 0; | |
3339 | return -errno; | |
3340 | } | |
3341 | ||
10f8e83c | 3342 | char_array_0(line); |
a16e1123 LP |
3343 | l = strstrip(line); |
3344 | ||
3345 | /* End marker */ | |
e911de99 | 3346 | if (isempty(l)) |
a483fb59 | 3347 | break; |
a16e1123 LP |
3348 | |
3349 | k = strcspn(l, "="); | |
3350 | ||
3351 | if (l[k] == '=') { | |
3352 | l[k] = 0; | |
3353 | v = l+k+1; | |
3354 | } else | |
3355 | v = l+k; | |
3356 | ||
cca098b0 | 3357 | if (streq(l, "job")) { |
39a18c60 MS |
3358 | if (v[0] == '\0') { |
3359 | /* new-style serialized job */ | |
9c3349e2 LP |
3360 | Job *j; |
3361 | ||
3362 | j = job_new_raw(u); | |
39a18c60 | 3363 | if (!j) |
e911de99 | 3364 | return log_oom(); |
39a18c60 | 3365 | |
05a98afd | 3366 | r = job_deserialize(j, f); |
39a18c60 MS |
3367 | if (r < 0) { |
3368 | job_free(j); | |
3369 | return r; | |
3370 | } | |
cca098b0 | 3371 | |
39a18c60 MS |
3372 | r = hashmap_put(u->manager->jobs, UINT32_TO_PTR(j->id), j); |
3373 | if (r < 0) { | |
3374 | job_free(j); | |
3375 | return r; | |
3376 | } | |
e0209d83 MS |
3377 | |
3378 | r = job_install_deserialized(j); | |
3379 | if (r < 0) { | |
3380 | hashmap_remove(u->manager->jobs, UINT32_TO_PTR(j->id)); | |
3381 | job_free(j); | |
3382 | return r; | |
3383 | } | |
ed10fa8c LP |
3384 | } else /* legacy for pre-44 */ |
3385 | log_unit_warning(u, "Update from too old systemd versions are unsupported, cannot deserialize job: %s", v); | |
cca098b0 | 3386 | continue; |
a483fb59 LP |
3387 | } else if (streq(l, "state-change-timestamp")) { |
3388 | dual_timestamp_deserialize(v, &u->state_change_timestamp); | |
3389 | continue; | |
8aaf019b | 3390 | } else if (streq(l, "inactive-exit-timestamp")) { |
ac155bb8 | 3391 | dual_timestamp_deserialize(v, &u->inactive_exit_timestamp); |
8aaf019b LP |
3392 | continue; |
3393 | } else if (streq(l, "active-enter-timestamp")) { | |
ac155bb8 | 3394 | dual_timestamp_deserialize(v, &u->active_enter_timestamp); |
8aaf019b LP |
3395 | continue; |
3396 | } else if (streq(l, "active-exit-timestamp")) { | |
ac155bb8 | 3397 | dual_timestamp_deserialize(v, &u->active_exit_timestamp); |
8aaf019b LP |
3398 | continue; |
3399 | } else if (streq(l, "inactive-enter-timestamp")) { | |
ac155bb8 | 3400 | dual_timestamp_deserialize(v, &u->inactive_enter_timestamp); |
8aaf019b | 3401 | continue; |
2791a8f8 | 3402 | } else if (streq(l, "condition-timestamp")) { |
ac155bb8 | 3403 | dual_timestamp_deserialize(v, &u->condition_timestamp); |
2791a8f8 | 3404 | continue; |
59fccdc5 LP |
3405 | } else if (streq(l, "assert-timestamp")) { |
3406 | dual_timestamp_deserialize(v, &u->assert_timestamp); | |
3407 | continue; | |
2791a8f8 | 3408 | } else if (streq(l, "condition-result")) { |
2791a8f8 | 3409 | |
e911de99 LP |
3410 | r = parse_boolean(v); |
3411 | if (r < 0) | |
f2341e0a | 3412 | log_unit_debug(u, "Failed to parse condition result value %s, ignoring.", v); |
2791a8f8 | 3413 | else |
e911de99 | 3414 | u->condition_result = r; |
efbac6d2 LP |
3415 | |
3416 | continue; | |
c2756a68 | 3417 | |
59fccdc5 | 3418 | } else if (streq(l, "assert-result")) { |
59fccdc5 | 3419 | |
e911de99 LP |
3420 | r = parse_boolean(v); |
3421 | if (r < 0) | |
f2341e0a | 3422 | log_unit_debug(u, "Failed to parse assert result value %s, ignoring.", v); |
59fccdc5 | 3423 | else |
e911de99 | 3424 | u->assert_result = r; |
59fccdc5 LP |
3425 | |
3426 | continue; | |
3427 | ||
c2756a68 | 3428 | } else if (streq(l, "transient")) { |
c2756a68 | 3429 | |
e911de99 LP |
3430 | r = parse_boolean(v); |
3431 | if (r < 0) | |
f2341e0a | 3432 | log_unit_debug(u, "Failed to parse transient bool %s, ignoring.", v); |
c2756a68 | 3433 | else |
e911de99 | 3434 | u->transient = r; |
c2756a68 LP |
3435 | |
3436 | continue; | |
e911de99 | 3437 | |
d3070fbd LP |
3438 | } else if (streq(l, "exported-invocation-id")) { |
3439 | ||
3440 | r = parse_boolean(v); | |
3441 | if (r < 0) | |
3442 | log_unit_debug(u, "Failed to parse exported invocation ID bool %s, ignoring.", v); | |
3443 | else | |
3444 | u->exported_invocation_id = r; | |
3445 | ||
3446 | continue; | |
3447 | ||
3448 | } else if (streq(l, "exported-log-level-max")) { | |
3449 | ||
3450 | r = parse_boolean(v); | |
3451 | if (r < 0) | |
3452 | log_unit_debug(u, "Failed to parse exported log level max bool %s, ignoring.", v); | |
3453 | else | |
3454 | u->exported_log_level_max = r; | |
3455 | ||
3456 | continue; | |
3457 | ||
3458 | } else if (streq(l, "exported-log-extra-fields")) { | |
3459 | ||
3460 | r = parse_boolean(v); | |
3461 | if (r < 0) | |
3462 | log_unit_debug(u, "Failed to parse exported log extra fields bool %s, ignoring.", v); | |
3463 | else | |
3464 | u->exported_log_extra_fields = r; | |
3465 | ||
3466 | continue; | |
3467 | ||
fe700f46 | 3468 | } else if (STR_IN_SET(l, "cpu-usage-base", "cpuacct-usage-base")) { |
5ad096b3 | 3469 | |
66ebf6c0 | 3470 | r = safe_atou64(v, &u->cpu_usage_base); |
5ad096b3 | 3471 | if (r < 0) |
fe700f46 LP |
3472 | log_unit_debug(u, "Failed to parse CPU usage base %s, ignoring.", v); |
3473 | ||
3474 | continue; | |
3475 | ||
3476 | } else if (streq(l, "cpu-usage-last")) { | |
3477 | ||
3478 | r = safe_atou64(v, &u->cpu_usage_last); | |
3479 | if (r < 0) | |
3480 | log_unit_debug(u, "Failed to read CPU usage last %s, ignoring.", v); | |
5ad096b3 | 3481 | |
0f908397 | 3482 | continue; |
4e595329 | 3483 | |
e911de99 | 3484 | } else if (streq(l, "cgroup")) { |
72673e86 | 3485 | |
e911de99 LP |
3486 | r = unit_set_cgroup_path(u, v); |
3487 | if (r < 0) | |
f2341e0a | 3488 | log_unit_debug_errno(u, r, "Failed to set cgroup path %s, ignoring: %m", v); |
4e595329 | 3489 | |
efdb0237 LP |
3490 | (void) unit_watch_cgroup(u); |
3491 | ||
de1d4f9b WF |
3492 | continue; |
3493 | } else if (streq(l, "cgroup-realized")) { | |
3494 | int b; | |
3495 | ||
3496 | b = parse_boolean(v); | |
3497 | if (b < 0) | |
3498 | log_unit_debug(u, "Failed to parse cgroup-realized bool %s, ignoring.", v); | |
3499 | else | |
3500 | u->cgroup_realized = b; | |
3501 | ||
c2756a68 | 3502 | continue; |
00d9ef85 | 3503 | |
8b108bd0 FB |
3504 | } else if (streq(l, "cgroup-realized-mask")) { |
3505 | ||
3506 | r = cg_mask_from_string(v, &u->cgroup_realized_mask); | |
3507 | if (r < 0) | |
3508 | log_unit_debug(u, "Failed to parse cgroup-realized-mask %s, ignoring.", v); | |
3509 | continue; | |
3510 | ||
3511 | } else if (streq(l, "cgroup-enabled-mask")) { | |
3512 | ||
3513 | r = cg_mask_from_string(v, &u->cgroup_enabled_mask); | |
3514 | if (r < 0) | |
3515 | log_unit_debug(u, "Failed to parse cgroup-enabled-mask %s, ignoring.", v); | |
3516 | continue; | |
3517 | ||
906c06f6 DM |
3518 | } else if (streq(l, "cgroup-bpf-realized")) { |
3519 | int i; | |
3520 | ||
3521 | r = safe_atoi(v, &i); | |
3522 | if (r < 0) | |
3523 | log_unit_debug(u, "Failed to parse cgroup BPF state %s, ignoring.", v); | |
3524 | else | |
3525 | u->cgroup_bpf_state = | |
3526 | i < 0 ? UNIT_CGROUP_BPF_INVALIDATED : | |
3527 | i > 0 ? UNIT_CGROUP_BPF_ON : | |
3528 | UNIT_CGROUP_BPF_OFF; | |
3529 | ||
3530 | continue; | |
3531 | ||
00d9ef85 LP |
3532 | } else if (streq(l, "ref-uid")) { |
3533 | uid_t uid; | |
3534 | ||
3535 | r = parse_uid(v, &uid); | |
3536 | if (r < 0) | |
3537 | log_unit_debug(u, "Failed to parse referenced UID %s, ignoring.", v); | |
3538 | else | |
3539 | unit_ref_uid_gid(u, uid, GID_INVALID); | |
3540 | ||
3541 | continue; | |
3542 | ||
3543 | } else if (streq(l, "ref-gid")) { | |
3544 | gid_t gid; | |
3545 | ||
3546 | r = parse_gid(v, &gid); | |
3547 | if (r < 0) | |
3548 | log_unit_debug(u, "Failed to parse referenced GID %s, ignoring.", v); | |
3549 | else | |
3550 | unit_ref_uid_gid(u, UID_INVALID, gid); | |
3551 | ||
05a98afd LP |
3552 | } else if (streq(l, "ref")) { |
3553 | ||
3554 | r = strv_extend(&u->deserialized_refs, v); | |
3555 | if (r < 0) | |
3556 | log_oom(); | |
3557 | ||
4b58153d LP |
3558 | continue; |
3559 | } else if (streq(l, "invocation-id")) { | |
3560 | sd_id128_t id; | |
3561 | ||
3562 | r = sd_id128_from_string(v, &id); | |
3563 | if (r < 0) | |
3564 | log_unit_debug(u, "Failed to parse invocation id %s, ignoring.", v); | |
3565 | else { | |
3566 | r = unit_set_invocation_id(u, id); | |
3567 | if (r < 0) | |
3568 | log_unit_warning_errno(u, r, "Failed to set invocation ID for unit: %m"); | |
3569 | } | |
3570 | ||
00d9ef85 | 3571 | continue; |
8aaf019b | 3572 | } |
cca098b0 | 3573 | |
6b659ed8 LP |
3574 | /* Check if this is an IP accounting metric serialization field */ |
3575 | for (m = 0; m < _CGROUP_IP_ACCOUNTING_METRIC_MAX; m++) | |
3576 | if (streq(l, ip_accounting_metric_field[m])) | |
3577 | break; | |
3578 | if (m < _CGROUP_IP_ACCOUNTING_METRIC_MAX) { | |
3579 | uint64_t c; | |
3580 | ||
3581 | r = safe_atou64(v, &c); | |
3582 | if (r < 0) | |
3583 | log_unit_debug(u, "Failed to parse IP accounting value %s, ignoring.", v); | |
3584 | else | |
3585 | u->ip_accounting_extra[m] = c; | |
3586 | continue; | |
3587 | } | |
3588 | ||
9bdb98c5 | 3589 | if (unit_can_serialize(u)) { |
e8a565cb YW |
3590 | r = exec_runtime_deserialize_compat(u, l, v, fds); |
3591 | if (r < 0) { | |
3592 | log_unit_warning(u, "Failed to deserialize runtime parameter '%s', ignoring.", l); | |
3593 | continue; | |
9bdb98c5 LP |
3594 | } |
3595 | ||
e8a565cb YW |
3596 | /* Returns positive if key was handled by the call */ |
3597 | if (r > 0) | |
3598 | continue; | |
3599 | ||
9bdb98c5 | 3600 | r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds); |
613b411c | 3601 | if (r < 0) |
f2341e0a | 3602 | log_unit_warning(u, "Failed to deserialize unit parameter '%s', ignoring.", l); |
613b411c | 3603 | } |
a16e1123 | 3604 | } |
a483fb59 LP |
3605 | |
3606 | /* Versions before 228 did not carry a state change timestamp. In this case, take the current time. This is | |
3607 | * useful, so that timeouts based on this timestamp don't trigger too early, and is in-line with the logic from | |
1f133e0d | 3608 | * before 228 where the base for timeouts was not persistent across reboots. */ |
a483fb59 LP |
3609 | |
3610 | if (!dual_timestamp_is_set(&u->state_change_timestamp)) | |
3611 | dual_timestamp_get(&u->state_change_timestamp); | |
3612 | ||
58d83430 LP |
3613 | /* Let's make sure that everything that is deserialized also gets any potential new cgroup settings applied |
3614 | * after we are done. For that we invalidate anything already realized, so that we can realize it again. */ | |
3615 | unit_invalidate_cgroup(u, _CGROUP_MASK_ALL); | |
3616 | unit_invalidate_cgroup_bpf(u); | |
3617 | ||
a483fb59 | 3618 | return 0; |
a16e1123 LP |
3619 | } |
3620 | ||
07429866 ZJS |
3621 | void unit_deserialize_skip(FILE *f) { |
3622 | assert(f); | |
3623 | ||
3624 | /* Skip serialized data for this unit. We don't know what it is. */ | |
3625 | ||
3626 | for (;;) { | |
3627 | char line[LINE_MAX], *l; | |
3628 | ||
3629 | if (!fgets(line, sizeof line, f)) | |
3630 | return; | |
3631 | ||
3632 | char_array_0(line); | |
3633 | l = strstrip(line); | |
3634 | ||
3635 | /* End marker */ | |
3636 | if (isempty(l)) | |
3637 | return; | |
3638 | } | |
3639 | } | |
3640 | ||
3641 | ||
eef85c4a | 3642 | int unit_add_node_dependency(Unit *u, const char *what, bool wants, UnitDependency dep, UnitDependencyMask mask) { |
6e2ef85b | 3643 | Unit *device; |
68eda4bd | 3644 | _cleanup_free_ char *e = NULL; |
6e2ef85b LP |
3645 | int r; |
3646 | ||
3647 | assert(u); | |
3648 | ||
6e2ef85b | 3649 | /* Adds in links to the device node that this unit is based on */ |
47bc12e1 LP |
3650 | if (isempty(what)) |
3651 | return 0; | |
6e2ef85b | 3652 | |
8407a5d0 | 3653 | if (!is_device_path(what)) |
6e2ef85b LP |
3654 | return 0; |
3655 | ||
47bc12e1 LP |
3656 | /* When device units aren't supported (such as in a |
3657 | * container), don't create dependencies on them. */ | |
1c2e9646 | 3658 | if (!unit_type_supported(UNIT_DEVICE)) |
47bc12e1 LP |
3659 | return 0; |
3660 | ||
7410616c LP |
3661 | r = unit_name_from_path(what, ".device", &e); |
3662 | if (r < 0) | |
3663 | return r; | |
6e2ef85b | 3664 | |
ac155bb8 | 3665 | r = manager_load_unit(u->manager, e, NULL, NULL, &device); |
6e2ef85b LP |
3666 | if (r < 0) |
3667 | return r; | |
3668 | ||
ebc8968b FB |
3669 | if (dep == UNIT_REQUIRES && device_shall_be_bound_by(device, u)) |
3670 | dep = UNIT_BINDS_TO; | |
3671 | ||
9d06297e | 3672 | r = unit_add_two_dependencies(u, UNIT_AFTER, |
463d0d15 | 3673 | MANAGER_IS_SYSTEM(u->manager) ? dep : UNIT_WANTS, |
eef85c4a | 3674 | device, true, mask); |
faa368e3 | 3675 | if (r < 0) |
6e2ef85b LP |
3676 | return r; |
3677 | ||
faa368e3 | 3678 | if (wants) { |
eef85c4a | 3679 | r = unit_add_dependency(device, UNIT_WANTS, u, false, mask); |
faa368e3 | 3680 | if (r < 0) |
6e2ef85b | 3681 | return r; |
faa368e3 | 3682 | } |
6e2ef85b LP |
3683 | |
3684 | return 0; | |
3685 | } | |
a16e1123 | 3686 | |
be847e82 | 3687 | int unit_coldplug(Unit *u) { |
05a98afd LP |
3688 | int r = 0, q; |
3689 | char **i; | |
cca098b0 LP |
3690 | |
3691 | assert(u); | |
3692 | ||
f78f265f LP |
3693 | /* Make sure we don't enter a loop, when coldplugging |
3694 | * recursively. */ | |
3695 | if (u->coldplugged) | |
3696 | return 0; | |
3697 | ||
3698 | u->coldplugged = true; | |
3699 | ||
05a98afd LP |
3700 | STRV_FOREACH(i, u->deserialized_refs) { |
3701 | q = bus_unit_track_add_name(u, *i); | |
3702 | if (q < 0 && r >= 0) | |
3703 | r = q; | |
3704 | } | |
3705 | u->deserialized_refs = strv_free(u->deserialized_refs); | |
cca098b0 | 3706 | |
05a98afd LP |
3707 | if (UNIT_VTABLE(u)->coldplug) { |
3708 | q = UNIT_VTABLE(u)->coldplug(u); | |
3709 | if (q < 0 && r >= 0) | |
3710 | r = q; | |
3711 | } | |
5a6158b6 | 3712 | |
05a98afd LP |
3713 | if (u->job) { |
3714 | q = job_coldplug(u->job); | |
3715 | if (q < 0 && r >= 0) | |
3716 | r = q; | |
3717 | } | |
cca098b0 | 3718 | |
05a98afd | 3719 | return r; |
cca098b0 LP |
3720 | } |
3721 | ||
ba25d39e | 3722 | static bool fragment_mtime_newer(const char *path, usec_t mtime, bool path_masked) { |
21b95806 ZJS |
3723 | struct stat st; |
3724 | ||
3725 | if (!path) | |
3726 | return false; | |
3727 | ||
77969722 LP |
3728 | /* If the source is some virtual kernel file system, then we assume we watch it anyway, and hence pretend we |
3729 | * are never out-of-date. */ | |
3730 | if (PATH_STARTSWITH_SET(path, "/proc", "/sys")) | |
3731 | return false; | |
3732 | ||
21b95806 ZJS |
3733 | if (stat(path, &st) < 0) |
3734 | /* What, cannot access this anymore? */ | |
3735 | return true; | |
3736 | ||
ba25d39e ZJS |
3737 | if (path_masked) |
3738 | /* For masked files check if they are still so */ | |
3739 | return !null_or_empty(&st); | |
3740 | else | |
3a8db9fe | 3741 | /* For non-empty files check the mtime */ |
87ec20ef | 3742 | return timespec_load(&st.st_mtim) > mtime; |
21b95806 ZJS |
3743 | |
3744 | return false; | |
3745 | } | |
3746 | ||
45fb0699 | 3747 | bool unit_need_daemon_reload(Unit *u) { |
ae7a7182 OS |
3748 | _cleanup_strv_free_ char **t = NULL; |
3749 | char **path; | |
1b64d026 | 3750 | |
45fb0699 LP |
3751 | assert(u); |
3752 | ||
ba25d39e ZJS |
3753 | /* For unit files, we allow masking… */ |
3754 | if (fragment_mtime_newer(u->fragment_path, u->fragment_mtime, | |
3755 | u->load_state == UNIT_MASKED)) | |
21b95806 | 3756 | return true; |
5f4b19f4 | 3757 | |
ba25d39e ZJS |
3758 | /* Source paths should not be masked… */ |
3759 | if (fragment_mtime_newer(u->source_path, u->source_mtime, false)) | |
ab932a62 | 3760 | return true; |
ae7a7182 | 3761 | |
19a44dfe LR |
3762 | if (u->load_state == UNIT_LOADED) |
3763 | (void) unit_find_dropin_paths(u, &t); | |
ab932a62 LP |
3764 | if (!strv_equal(u->dropin_paths, t)) |
3765 | return true; | |
6d10d308 | 3766 | |
ba25d39e | 3767 | /* … any drop-ins that are masked are simply omitted from the list. */ |
ab932a62 | 3768 | STRV_FOREACH(path, u->dropin_paths) |
ba25d39e | 3769 | if (fragment_mtime_newer(*path, u->dropin_mtime, false)) |
ab932a62 | 3770 | return true; |
21b95806 | 3771 | |
ab932a62 | 3772 | return false; |
45fb0699 LP |
3773 | } |
3774 | ||
fdf20a31 | 3775 | void unit_reset_failed(Unit *u) { |
5632e374 LP |
3776 | assert(u); |
3777 | ||
fdf20a31 MM |
3778 | if (UNIT_VTABLE(u)->reset_failed) |
3779 | UNIT_VTABLE(u)->reset_failed(u); | |
6bf0f408 LP |
3780 | |
3781 | RATELIMIT_RESET(u->start_limit); | |
3782 | u->start_limit_hit = false; | |
5632e374 LP |
3783 | } |
3784 | ||
a7f241db LP |
3785 | Unit *unit_following(Unit *u) { |
3786 | assert(u); | |
3787 | ||
3788 | if (UNIT_VTABLE(u)->following) | |
3789 | return UNIT_VTABLE(u)->following(u); | |
3790 | ||
3791 | return NULL; | |
3792 | } | |
3793 | ||
31afa0a4 | 3794 | bool unit_stop_pending(Unit *u) { |
18ffdfda LP |
3795 | assert(u); |
3796 | ||
31afa0a4 LP |
3797 | /* This call does check the current state of the unit. It's |
3798 | * hence useful to be called from state change calls of the | |
3799 | * unit itself, where the state isn't updated yet. This is | |
3800 | * different from unit_inactive_or_pending() which checks both | |
3801 | * the current state and for a queued job. */ | |
18ffdfda | 3802 | |
31afa0a4 LP |
3803 | return u->job && u->job->type == JOB_STOP; |
3804 | } | |
3805 | ||
3806 | bool unit_inactive_or_pending(Unit *u) { | |
3807 | assert(u); | |
3808 | ||
3809 | /* Returns true if the unit is inactive or going down */ | |
18ffdfda | 3810 | |
d956ac29 LP |
3811 | if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u))) |
3812 | return true; | |
3813 | ||
31afa0a4 | 3814 | if (unit_stop_pending(u)) |
18ffdfda LP |
3815 | return true; |
3816 | ||
3817 | return false; | |
3818 | } | |
3819 | ||
31afa0a4 | 3820 | bool unit_active_or_pending(Unit *u) { |
f976f3f6 LP |
3821 | assert(u); |
3822 | ||
f60c2665 | 3823 | /* Returns true if the unit is active or going up */ |
f976f3f6 LP |
3824 | |
3825 | if (UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))) | |
3826 | return true; | |
3827 | ||
ac155bb8 | 3828 | if (u->job && |
3742095b | 3829 | IN_SET(u->job->type, JOB_START, JOB_RELOAD_OR_START, JOB_RESTART)) |
f976f3f6 LP |
3830 | return true; |
3831 | ||
3832 | return false; | |
3833 | } | |
3834 | ||
deb4e708 MK |
3835 | bool unit_will_restart(Unit *u) { |
3836 | assert(u); | |
3837 | ||
3838 | if (!UNIT_VTABLE(u)->will_restart) | |
3839 | return false; | |
3840 | ||
3841 | return UNIT_VTABLE(u)->will_restart(u); | |
3842 | } | |
3843 | ||
718db961 | 3844 | int unit_kill(Unit *u, KillWho w, int signo, sd_bus_error *error) { |
8a0867d6 LP |
3845 | assert(u); |
3846 | assert(w >= 0 && w < _KILL_WHO_MAX); | |
6eb7c172 | 3847 | assert(SIGNAL_VALID(signo)); |
8a0867d6 | 3848 | |
8a0867d6 | 3849 | if (!UNIT_VTABLE(u)->kill) |
15411c0c | 3850 | return -EOPNOTSUPP; |
8a0867d6 | 3851 | |
c74f17d9 | 3852 | return UNIT_VTABLE(u)->kill(u, w, signo, error); |
8a0867d6 LP |
3853 | } |
3854 | ||
82659fd7 LP |
3855 | static Set *unit_pid_set(pid_t main_pid, pid_t control_pid) { |
3856 | Set *pid_set; | |
3857 | int r; | |
3858 | ||
d5099efc | 3859 | pid_set = set_new(NULL); |
82659fd7 LP |
3860 | if (!pid_set) |
3861 | return NULL; | |
3862 | ||
3863 | /* Exclude the main/control pids from being killed via the cgroup */ | |
3864 | if (main_pid > 0) { | |
fea72cc0 | 3865 | r = set_put(pid_set, PID_TO_PTR(main_pid)); |
82659fd7 LP |
3866 | if (r < 0) |
3867 | goto fail; | |
3868 | } | |
3869 | ||
3870 | if (control_pid > 0) { | |
fea72cc0 | 3871 | r = set_put(pid_set, PID_TO_PTR(control_pid)); |
82659fd7 LP |
3872 | if (r < 0) |
3873 | goto fail; | |
3874 | } | |
3875 | ||
3876 | return pid_set; | |
3877 | ||
3878 | fail: | |
3879 | set_free(pid_set); | |
3880 | return NULL; | |
3881 | } | |
3882 | ||
d91c34f2 LP |
3883 | int unit_kill_common( |
3884 | Unit *u, | |
3885 | KillWho who, | |
3886 | int signo, | |
3887 | pid_t main_pid, | |
3888 | pid_t control_pid, | |
718db961 | 3889 | sd_bus_error *error) { |
d91c34f2 | 3890 | |
814cc562 | 3891 | int r = 0; |
ac5e3a50 | 3892 | bool killed = false; |
814cc562 | 3893 | |
ac5e3a50 | 3894 | if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL)) { |
814cc562 | 3895 | if (main_pid < 0) |
7358dc02 | 3896 | return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no main processes", unit_type_to_string(u->type)); |
52f448c3 | 3897 | else if (main_pid == 0) |
7358dc02 | 3898 | return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No main process to kill"); |
814cc562 MS |
3899 | } |
3900 | ||
ac5e3a50 | 3901 | if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL)) { |
814cc562 | 3902 | if (control_pid < 0) |
7358dc02 | 3903 | return sd_bus_error_setf(error, BUS_ERROR_NO_SUCH_PROCESS, "%s units have no control processes", unit_type_to_string(u->type)); |
52f448c3 | 3904 | else if (control_pid == 0) |
7358dc02 | 3905 | return sd_bus_error_set_const(error, BUS_ERROR_NO_SUCH_PROCESS, "No control process to kill"); |
814cc562 MS |
3906 | } |
3907 | ||
ac5e3a50 JS |
3908 | if (IN_SET(who, KILL_CONTROL, KILL_CONTROL_FAIL, KILL_ALL, KILL_ALL_FAIL)) |
3909 | if (control_pid > 0) { | |
814cc562 MS |
3910 | if (kill(control_pid, signo) < 0) |
3911 | r = -errno; | |
ac5e3a50 JS |
3912 | else |
3913 | killed = true; | |
3914 | } | |
814cc562 | 3915 | |
ac5e3a50 JS |
3916 | if (IN_SET(who, KILL_MAIN, KILL_MAIN_FAIL, KILL_ALL, KILL_ALL_FAIL)) |
3917 | if (main_pid > 0) { | |
814cc562 MS |
3918 | if (kill(main_pid, signo) < 0) |
3919 | r = -errno; | |
ac5e3a50 JS |
3920 | else |
3921 | killed = true; | |
3922 | } | |
814cc562 | 3923 | |
ac5e3a50 | 3924 | if (IN_SET(who, KILL_ALL, KILL_ALL_FAIL) && u->cgroup_path) { |
814cc562 MS |
3925 | _cleanup_set_free_ Set *pid_set = NULL; |
3926 | int q; | |
3927 | ||
82659fd7 LP |
3928 | /* Exclude the main/control pids from being killed via the cgroup */ |
3929 | pid_set = unit_pid_set(main_pid, control_pid); | |
814cc562 MS |
3930 | if (!pid_set) |
3931 | return -ENOMEM; | |
3932 | ||
1d98fef1 | 3933 | q = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, signo, 0, pid_set, NULL, NULL); |
4c701096 | 3934 | if (q < 0 && !IN_SET(q, -EAGAIN, -ESRCH, -ENOENT)) |
814cc562 | 3935 | r = q; |
ac5e3a50 JS |
3936 | else |
3937 | killed = true; | |
814cc562 MS |
3938 | } |
3939 | ||
201f0c91 | 3940 | if (r == 0 && !killed && IN_SET(who, KILL_ALL_FAIL, KILL_CONTROL_FAIL)) |
ac5e3a50 JS |
3941 | return -ESRCH; |
3942 | ||
814cc562 MS |
3943 | return r; |
3944 | } | |
3945 | ||
6210e7fc LP |
3946 | int unit_following_set(Unit *u, Set **s) { |
3947 | assert(u); | |
3948 | assert(s); | |
3949 | ||
3950 | if (UNIT_VTABLE(u)->following_set) | |
3951 | return UNIT_VTABLE(u)->following_set(u, s); | |
3952 | ||
3953 | *s = NULL; | |
3954 | return 0; | |
3955 | } | |
3956 | ||
a4375746 | 3957 | UnitFileState unit_get_unit_file_state(Unit *u) { |
0ec0deaa LP |
3958 | int r; |
3959 | ||
a4375746 LP |
3960 | assert(u); |
3961 | ||
0ec0deaa LP |
3962 | if (u->unit_file_state < 0 && u->fragment_path) { |
3963 | r = unit_file_get_state( | |
463d0d15 | 3964 | u->manager->unit_file_scope, |
0ec0deaa | 3965 | NULL, |
9ea3a0e7 | 3966 | u->id, |
0ec0deaa LP |
3967 | &u->unit_file_state); |
3968 | if (r < 0) | |
3969 | u->unit_file_state = UNIT_FILE_BAD; | |
3970 | } | |
a4375746 | 3971 | |
ac155bb8 | 3972 | return u->unit_file_state; |
a4375746 LP |
3973 | } |
3974 | ||
d2dc52db LP |
3975 | int unit_get_unit_file_preset(Unit *u) { |
3976 | assert(u); | |
3977 | ||
3978 | if (u->unit_file_preset < 0 && u->fragment_path) | |
3979 | u->unit_file_preset = unit_file_query_preset( | |
463d0d15 | 3980 | u->manager->unit_file_scope, |
0ec0deaa LP |
3981 | NULL, |
3982 | basename(u->fragment_path)); | |
d2dc52db LP |
3983 | |
3984 | return u->unit_file_preset; | |
3985 | } | |
3986 | ||
7f7d01ed | 3987 | Unit* unit_ref_set(UnitRef *ref, Unit *source, Unit *target) { |
57020a3a | 3988 | assert(ref); |
7f7d01ed ZJS |
3989 | assert(source); |
3990 | assert(target); | |
57020a3a | 3991 | |
7f7d01ed | 3992 | if (ref->target) |
57020a3a LP |
3993 | unit_ref_unset(ref); |
3994 | ||
7f7d01ed ZJS |
3995 | ref->source = source; |
3996 | ref->target = target; | |
3997 | LIST_PREPEND(refs_by_target, target->refs_by_target, ref); | |
3998 | return target; | |
57020a3a LP |
3999 | } |
4000 | ||
4001 | void unit_ref_unset(UnitRef *ref) { | |
4002 | assert(ref); | |
4003 | ||
7f7d01ed | 4004 | if (!ref->target) |
57020a3a LP |
4005 | return; |
4006 | ||
b75102e5 LP |
4007 | /* We are about to drop a reference to the unit, make sure the garbage collection has a look at it as it might |
4008 | * be unreferenced now. */ | |
7f7d01ed | 4009 | unit_add_to_gc_queue(ref->target); |
b75102e5 | 4010 | |
7f7d01ed ZJS |
4011 | LIST_REMOVE(refs_by_target, ref->target->refs_by_target, ref); |
4012 | ref->source = ref->target = NULL; | |
57020a3a LP |
4013 | } |
4014 | ||
29206d46 LP |
4015 | static int user_from_unit_name(Unit *u, char **ret) { |
4016 | ||
4017 | static const uint8_t hash_key[] = { | |
4018 | 0x58, 0x1a, 0xaf, 0xe6, 0x28, 0x58, 0x4e, 0x96, | |
4019 | 0xb4, 0x4e, 0xf5, 0x3b, 0x8c, 0x92, 0x07, 0xec | |
4020 | }; | |
4021 | ||
4022 | _cleanup_free_ char *n = NULL; | |
4023 | int r; | |
4024 | ||
4025 | r = unit_name_to_prefix(u->id, &n); | |
4026 | if (r < 0) | |
4027 | return r; | |
4028 | ||
4029 | if (valid_user_group_name(n)) { | |
4030 | *ret = n; | |
4031 | n = NULL; | |
4032 | return 0; | |
4033 | } | |
4034 | ||
4035 | /* If we can't use the unit name as a user name, then let's hash it and use that */ | |
4036 | if (asprintf(ret, "_du%016" PRIx64, siphash24(n, strlen(n), hash_key)) < 0) | |
4037 | return -ENOMEM; | |
4038 | ||
4039 | return 0; | |
4040 | } | |
4041 | ||
598459ce LP |
4042 | int unit_patch_contexts(Unit *u) { |
4043 | CGroupContext *cc; | |
4044 | ExecContext *ec; | |
cba6e062 LP |
4045 | unsigned i; |
4046 | int r; | |
4047 | ||
e06c73cc | 4048 | assert(u); |
e06c73cc | 4049 | |
598459ce LP |
4050 | /* Patch in the manager defaults into the exec and cgroup |
4051 | * contexts, _after_ the rest of the settings have been | |
4052 | * initialized */ | |
085afe36 | 4053 | |
598459ce LP |
4054 | ec = unit_get_exec_context(u); |
4055 | if (ec) { | |
4056 | /* This only copies in the ones that need memory */ | |
4057 | for (i = 0; i < _RLIMIT_MAX; i++) | |
4058 | if (u->manager->rlimit[i] && !ec->rlimit[i]) { | |
4059 | ec->rlimit[i] = newdup(struct rlimit, u->manager->rlimit[i], 1); | |
4060 | if (!ec->rlimit[i]) | |
4061 | return -ENOMEM; | |
4062 | } | |
4063 | ||
463d0d15 | 4064 | if (MANAGER_IS_USER(u->manager) && |
598459ce LP |
4065 | !ec->working_directory) { |
4066 | ||
4067 | r = get_home_dir(&ec->working_directory); | |
4068 | if (r < 0) | |
4069 | return r; | |
4c08c824 LP |
4070 | |
4071 | /* Allow user services to run, even if the | |
4072 | * home directory is missing */ | |
4073 | ec->working_directory_missing_ok = true; | |
cba6e062 LP |
4074 | } |
4075 | ||
598459ce | 4076 | if (ec->private_devices) |
2cd0a735 | 4077 | ec->capability_bounding_set &= ~((UINT64_C(1) << CAP_MKNOD) | (UINT64_C(1) << CAP_SYS_RAWIO)); |
502d704e DH |
4078 | |
4079 | if (ec->protect_kernel_modules) | |
4080 | ec->capability_bounding_set &= ~(UINT64_C(1) << CAP_SYS_MODULE); | |
29206d46 LP |
4081 | |
4082 | if (ec->dynamic_user) { | |
4083 | if (!ec->user) { | |
4084 | r = user_from_unit_name(u, &ec->user); | |
4085 | if (r < 0) | |
4086 | return r; | |
4087 | } | |
4088 | ||
4089 | if (!ec->group) { | |
4090 | ec->group = strdup(ec->user); | |
4091 | if (!ec->group) | |
4092 | return -ENOMEM; | |
4093 | } | |
4094 | ||
63bb64a0 LP |
4095 | /* If the dynamic user option is on, let's make sure that the unit can't leave its UID/GID |
4096 | * around in the file system or on IPC objects. Hence enforce a strict sandbox. */ | |
4097 | ||
29206d46 | 4098 | ec->private_tmp = true; |
00d9ef85 | 4099 | ec->remove_ipc = true; |
63bb64a0 LP |
4100 | ec->protect_system = PROTECT_SYSTEM_STRICT; |
4101 | if (ec->protect_home == PROTECT_HOME_NO) | |
4102 | ec->protect_home = PROTECT_HOME_READ_ONLY; | |
29206d46 | 4103 | } |
cba6e062 LP |
4104 | } |
4105 | ||
598459ce LP |
4106 | cc = unit_get_cgroup_context(u); |
4107 | if (cc) { | |
f513e420 | 4108 | |
598459ce LP |
4109 | if (ec && |
4110 | ec->private_devices && | |
4111 | cc->device_policy == CGROUP_AUTO) | |
4112 | cc->device_policy = CGROUP_CLOSED; | |
4113 | } | |
f1660f96 | 4114 | |
cba6e062 | 4115 | return 0; |
e06c73cc LP |
4116 | } |
4117 | ||
3ef63c31 LP |
4118 | ExecContext *unit_get_exec_context(Unit *u) { |
4119 | size_t offset; | |
4120 | assert(u); | |
4121 | ||
598459ce LP |
4122 | if (u->type < 0) |
4123 | return NULL; | |
4124 | ||
3ef63c31 LP |
4125 | offset = UNIT_VTABLE(u)->exec_context_offset; |
4126 | if (offset <= 0) | |
4127 | return NULL; | |
4128 | ||
4129 | return (ExecContext*) ((uint8_t*) u + offset); | |
4130 | } | |
4131 | ||
718db961 LP |
4132 | KillContext *unit_get_kill_context(Unit *u) { |
4133 | size_t offset; | |
4134 | assert(u); | |
4135 | ||
598459ce LP |
4136 | if (u->type < 0) |
4137 | return NULL; | |
4138 | ||
718db961 LP |
4139 | offset = UNIT_VTABLE(u)->kill_context_offset; |
4140 | if (offset <= 0) | |
4141 | return NULL; | |
4142 | ||
4143 | return (KillContext*) ((uint8_t*) u + offset); | |
4144 | } | |
4145 | ||
4ad49000 LP |
4146 | CGroupContext *unit_get_cgroup_context(Unit *u) { |
4147 | size_t offset; | |
4148 | ||
598459ce LP |
4149 | if (u->type < 0) |
4150 | return NULL; | |
4151 | ||
4ad49000 LP |
4152 | offset = UNIT_VTABLE(u)->cgroup_context_offset; |
4153 | if (offset <= 0) | |
4154 | return NULL; | |
4155 | ||
4156 | return (CGroupContext*) ((uint8_t*) u + offset); | |
4157 | } | |
4158 | ||
613b411c LP |
4159 | ExecRuntime *unit_get_exec_runtime(Unit *u) { |
4160 | size_t offset; | |
4161 | ||
598459ce LP |
4162 | if (u->type < 0) |
4163 | return NULL; | |
4164 | ||
613b411c LP |
4165 | offset = UNIT_VTABLE(u)->exec_runtime_offset; |
4166 | if (offset <= 0) | |
4167 | return NULL; | |
4168 | ||
4169 | return *(ExecRuntime**) ((uint8_t*) u + offset); | |
4170 | } | |
4171 | ||
2e59b241 | 4172 | static const char* unit_drop_in_dir(Unit *u, UnitWriteFlags flags) { |
3f5e8115 LP |
4173 | assert(u); |
4174 | ||
2e59b241 | 4175 | if (UNIT_WRITE_FLAGS_NOOP(flags)) |
4f4afc88 LP |
4176 | return NULL; |
4177 | ||
39591351 LP |
4178 | if (u->transient) /* Redirect drop-ins for transient units always into the transient directory. */ |
4179 | return u->manager->lookup_paths.transient; | |
26d04f86 | 4180 | |
2e59b241 | 4181 | if (flags & UNIT_PERSISTENT) |
4f4afc88 | 4182 | return u->manager->lookup_paths.persistent_control; |
26d04f86 | 4183 | |
2e59b241 LP |
4184 | if (flags & UNIT_RUNTIME) |
4185 | return u->manager->lookup_paths.runtime_control; | |
4186 | ||
39591351 | 4187 | return NULL; |
71645aca LP |
4188 | } |
4189 | ||
2e59b241 LP |
4190 | char* unit_escape_setting(const char *s, UnitWriteFlags flags, char **buf) { |
4191 | char *ret = NULL; | |
4192 | ||
4193 | if (!s) | |
4194 | return NULL; | |
4195 | ||
4196 | /* Escapes the input string as requested. Returns the escaped string. If 'buf' is specified then the allocated | |
4197 | * return buffer pointer is also written to *buf, except if no escaping was necessary, in which case *buf is | |
4198 | * set to NULL, and the input pointer is returned as-is. This means the return value always contains a properly | |
4199 | * escaped version, but *buf when passed only contains a pointer if an allocation was necessary. If *buf is | |
4200 | * not specified, then the return value always needs to be freed. Callers can use this to optimize memory | |
4201 | * allocations. */ | |
4202 | ||
4203 | if (flags & UNIT_ESCAPE_SPECIFIERS) { | |
4204 | ret = specifier_escape(s); | |
4205 | if (!ret) | |
4206 | return NULL; | |
4207 | ||
4208 | s = ret; | |
4209 | } | |
4210 | ||
4211 | if (flags & UNIT_ESCAPE_C) { | |
4212 | char *a; | |
4213 | ||
4214 | a = cescape(s); | |
4215 | free(ret); | |
4216 | if (!a) | |
4217 | return NULL; | |
4218 | ||
4219 | ret = a; | |
4220 | } | |
4221 | ||
4222 | if (buf) { | |
4223 | *buf = ret; | |
4224 | return ret ?: (char*) s; | |
4225 | } | |
4226 | ||
4227 | return ret ?: strdup(s); | |
4228 | } | |
4229 | ||
4230 | char* unit_concat_strv(char **l, UnitWriteFlags flags) { | |
4231 | _cleanup_free_ char *result = NULL; | |
4232 | size_t n = 0, allocated = 0; | |
4233 | char **i, *ret; | |
4234 | ||
4235 | /* Takes a list of strings, escapes them, and concatenates them. This may be used to format command lines in a | |
4236 | * way suitable for ExecStart= stanzas */ | |
4237 | ||
4238 | STRV_FOREACH(i, l) { | |
4239 | _cleanup_free_ char *buf = NULL; | |
4240 | const char *p; | |
4241 | size_t a; | |
4242 | char *q; | |
4243 | ||
4244 | p = unit_escape_setting(*i, flags, &buf); | |
4245 | if (!p) | |
4246 | return NULL; | |
4247 | ||
4248 | a = (n > 0) + 1 + strlen(p) + 1; /* separating space + " + entry + " */ | |
4249 | if (!GREEDY_REALLOC(result, allocated, n + a + 1)) | |
4250 | return NULL; | |
4251 | ||
4252 | q = result + n; | |
4253 | if (n > 0) | |
4254 | *(q++) = ' '; | |
4255 | ||
4256 | *(q++) = '"'; | |
4257 | q = stpcpy(q, p); | |
4258 | *(q++) = '"'; | |
4259 | ||
4260 | n += a; | |
4261 | } | |
4262 | ||
4263 | if (!GREEDY_REALLOC(result, allocated, n + 1)) | |
4264 | return NULL; | |
4265 | ||
4266 | result[n] = 0; | |
4267 | ||
4268 | ret = result; | |
4269 | result = NULL; | |
4270 | ||
4271 | return ret; | |
4272 | } | |
4273 | ||
4274 | int unit_write_setting(Unit *u, UnitWriteFlags flags, const char *name, const char *data) { | |
4275 | _cleanup_free_ char *p = NULL, *q = NULL, *escaped = NULL; | |
2a9a6f8a | 4276 | const char *dir, *wrapped; |
26d04f86 | 4277 | int r; |
71645aca LP |
4278 | |
4279 | assert(u); | |
2e59b241 LP |
4280 | assert(name); |
4281 | assert(data); | |
4282 | ||
4283 | if (UNIT_WRITE_FLAGS_NOOP(flags)) | |
4284 | return 0; | |
4285 | ||
4286 | data = unit_escape_setting(data, flags, &escaped); | |
4287 | if (!data) | |
4288 | return -ENOMEM; | |
4289 | ||
4290 | /* Prefix the section header. If we are writing this out as transient file, then let's suppress this if the | |
4291 | * previous section header is the same */ | |
4292 | ||
4293 | if (flags & UNIT_PRIVATE) { | |
4294 | if (!UNIT_VTABLE(u)->private_section) | |
4295 | return -EINVAL; | |
4296 | ||
4297 | if (!u->transient_file || u->last_section_private < 0) | |
4298 | data = strjoina("[", UNIT_VTABLE(u)->private_section, "]\n", data); | |
4299 | else if (u->last_section_private == 0) | |
4300 | data = strjoina("\n[", UNIT_VTABLE(u)->private_section, "]\n", data); | |
4301 | } else { | |
4302 | if (!u->transient_file || u->last_section_private < 0) | |
4303 | data = strjoina("[Unit]\n", data); | |
4304 | else if (u->last_section_private > 0) | |
4305 | data = strjoina("\n[Unit]\n", data); | |
4306 | } | |
71645aca | 4307 | |
4f4afc88 LP |
4308 | if (u->transient_file) { |
4309 | /* When this is a transient unit file in creation, then let's not create a new drop-in but instead | |
4310 | * write to the transient unit file. */ | |
4311 | fputs(data, u->transient_file); | |
4f4afc88 | 4312 | |
2e59b241 LP |
4313 | if (!endswith(data, "\n")) |
4314 | fputc('\n', u->transient_file); | |
4315 | ||
4316 | /* Remember which section we wrote this entry to */ | |
4317 | u->last_section_private = !!(flags & UNIT_PRIVATE); | |
8e2af478 | 4318 | return 0; |
2e59b241 | 4319 | } |
8e2af478 | 4320 | |
2e59b241 | 4321 | dir = unit_drop_in_dir(u, flags); |
39591351 LP |
4322 | if (!dir) |
4323 | return -EINVAL; | |
71645aca | 4324 | |
2a9a6f8a | 4325 | wrapped = strjoina("# This is a drop-in unit file extension, created via \"systemctl set-property\"\n" |
3f71dec5 | 4326 | "# or an equivalent operation. Do not edit.\n", |
2a9a6f8a ZJS |
4327 | data, |
4328 | "\n"); | |
e20b2a86 | 4329 | |
815b09d3 | 4330 | r = drop_in_file(dir, u->id, 50, name, &p, &q); |
adb76a70 WC |
4331 | if (r < 0) |
4332 | return r; | |
4333 | ||
45639f1b | 4334 | (void) mkdir_p_label(p, 0755); |
2a9a6f8a | 4335 | r = write_string_file_atomic_label(q, wrapped); |
adb76a70 WC |
4336 | if (r < 0) |
4337 | return r; | |
4338 | ||
815b09d3 | 4339 | r = strv_push(&u->dropin_paths, q); |
adb76a70 WC |
4340 | if (r < 0) |
4341 | return r; | |
815b09d3 | 4342 | q = NULL; |
adb76a70 | 4343 | |
adb76a70 WC |
4344 | strv_uniq(u->dropin_paths); |
4345 | ||
4346 | u->dropin_mtime = now(CLOCK_REALTIME); | |
4347 | ||
4348 | return 0; | |
26d04f86 | 4349 | } |
71645aca | 4350 | |
2e59b241 | 4351 | int unit_write_settingf(Unit *u, UnitWriteFlags flags, const char *name, const char *format, ...) { |
b9ec9359 LP |
4352 | _cleanup_free_ char *p = NULL; |
4353 | va_list ap; | |
4354 | int r; | |
4355 | ||
4356 | assert(u); | |
4357 | assert(name); | |
4358 | assert(format); | |
4359 | ||
2e59b241 | 4360 | if (UNIT_WRITE_FLAGS_NOOP(flags)) |
b9ec9359 LP |
4361 | return 0; |
4362 | ||
4363 | va_start(ap, format); | |
4364 | r = vasprintf(&p, format, ap); | |
4365 | va_end(ap); | |
4366 | ||
4367 | if (r < 0) | |
4368 | return -ENOMEM; | |
4369 | ||
2e59b241 | 4370 | return unit_write_setting(u, flags, name, p); |
b9ec9359 | 4371 | } |
71645aca | 4372 | |
c2756a68 | 4373 | int unit_make_transient(Unit *u) { |
0126c8f3 | 4374 | _cleanup_free_ char *path = NULL; |
4f4afc88 | 4375 | FILE *f; |
4f4afc88 | 4376 | |
c2756a68 LP |
4377 | assert(u); |
4378 | ||
3f5e8115 LP |
4379 | if (!UNIT_VTABLE(u)->can_transient) |
4380 | return -EOPNOTSUPP; | |
4381 | ||
45639f1b LP |
4382 | (void) mkdir_p_label(u->manager->lookup_paths.transient, 0755); |
4383 | ||
605405c6 | 4384 | path = strjoin(u->manager->lookup_paths.transient, "/", u->id); |
4f4afc88 LP |
4385 | if (!path) |
4386 | return -ENOMEM; | |
4387 | ||
4388 | /* Let's open the file we'll write the transient settings into. This file is kept open as long as we are | |
4389 | * creating the transient, and is closed in unit_load(), as soon as we start loading the file. */ | |
4390 | ||
78e334b5 | 4391 | RUN_WITH_UMASK(0022) { |
4f4afc88 | 4392 | f = fopen(path, "we"); |
0126c8f3 | 4393 | if (!f) |
78e334b5 | 4394 | return -errno; |
4f4afc88 LP |
4395 | } |
4396 | ||
0126c8f3 | 4397 | safe_fclose(u->transient_file); |
4f4afc88 LP |
4398 | u->transient_file = f; |
4399 | ||
0126c8f3 | 4400 | free_and_replace(u->fragment_path, path); |
7c65093a | 4401 | |
7c65093a LP |
4402 | u->source_path = mfree(u->source_path); |
4403 | u->dropin_paths = strv_free(u->dropin_paths); | |
4404 | u->fragment_mtime = u->source_mtime = u->dropin_mtime = 0; | |
4405 | ||
4f4afc88 LP |
4406 | u->load_state = UNIT_STUB; |
4407 | u->load_error = 0; | |
4408 | u->transient = true; | |
4409 | ||
7c65093a LP |
4410 | unit_add_to_dbus_queue(u); |
4411 | unit_add_to_gc_queue(u); | |
c2756a68 | 4412 | |
4f4afc88 LP |
4413 | fputs("# This is a transient unit file, created programmatically via the systemd API. Do not edit.\n", |
4414 | u->transient_file); | |
4415 | ||
3f5e8115 | 4416 | return 0; |
c2756a68 LP |
4417 | } |
4418 | ||
1d98fef1 LP |
4419 | static void log_kill(pid_t pid, int sig, void *userdata) { |
4420 | _cleanup_free_ char *comm = NULL; | |
4421 | ||
4422 | (void) get_process_comm(pid, &comm); | |
4423 | ||
4424 | /* Don't log about processes marked with brackets, under the assumption that these are temporary processes | |
4425 | only, like for example systemd's own PAM stub process. */ | |
4426 | if (comm && comm[0] == '(') | |
4427 | return; | |
4428 | ||
4429 | log_unit_notice(userdata, | |
4430 | "Killing process " PID_FMT " (%s) with signal SIG%s.", | |
4431 | pid, | |
4432 | strna(comm), | |
4433 | signal_to_string(sig)); | |
4434 | } | |
4435 | ||
4436 | static int operation_to_signal(KillContext *c, KillOperation k) { | |
4437 | assert(c); | |
4438 | ||
4439 | switch (k) { | |
4440 | ||
4441 | case KILL_TERMINATE: | |
4442 | case KILL_TERMINATE_AND_LOG: | |
4443 | return c->kill_signal; | |
4444 | ||
4445 | case KILL_KILL: | |
4446 | return SIGKILL; | |
4447 | ||
4448 | case KILL_ABORT: | |
4449 | return SIGABRT; | |
4450 | ||
4451 | default: | |
4452 | assert_not_reached("KillOperation unknown"); | |
4453 | } | |
4454 | } | |
4455 | ||
cd2086fe LP |
4456 | int unit_kill_context( |
4457 | Unit *u, | |
4458 | KillContext *c, | |
db2cb23b | 4459 | KillOperation k, |
cd2086fe LP |
4460 | pid_t main_pid, |
4461 | pid_t control_pid, | |
4462 | bool main_pid_alien) { | |
4463 | ||
1d98fef1 | 4464 | bool wait_for_exit = false, send_sighup; |
59ec09a8 | 4465 | cg_kill_log_func_t log_func = NULL; |
b821a397 | 4466 | int sig, r; |
cd2086fe LP |
4467 | |
4468 | assert(u); | |
4469 | assert(c); | |
4470 | ||
59ec09a8 ZJS |
4471 | /* Kill the processes belonging to this unit, in preparation for shutting the unit down. |
4472 | * Returns > 0 if we killed something worth waiting for, 0 otherwise. */ | |
1d98fef1 | 4473 | |
cd2086fe LP |
4474 | if (c->kill_mode == KILL_NONE) |
4475 | return 0; | |
4476 | ||
1d98fef1 LP |
4477 | sig = operation_to_signal(c, k); |
4478 | ||
4479 | send_sighup = | |
4480 | c->send_sighup && | |
4481 | IN_SET(k, KILL_TERMINATE, KILL_TERMINATE_AND_LOG) && | |
4482 | sig != SIGHUP; | |
4483 | ||
59ec09a8 ZJS |
4484 | if (k != KILL_TERMINATE || IN_SET(sig, SIGKILL, SIGABRT)) |
4485 | log_func = log_kill; | |
cd2086fe LP |
4486 | |
4487 | if (main_pid > 0) { | |
1d98fef1 LP |
4488 | if (log_func) |
4489 | log_func(main_pid, sig, u); | |
cd2086fe | 4490 | |
1d98fef1 | 4491 | r = kill_and_sigcont(main_pid, sig); |
cd2086fe LP |
4492 | if (r < 0 && r != -ESRCH) { |
4493 | _cleanup_free_ char *comm = NULL; | |
1d98fef1 | 4494 | (void) get_process_comm(main_pid, &comm); |
cd2086fe | 4495 | |
b821a397 | 4496 | log_unit_warning_errno(u, r, "Failed to kill main process " PID_FMT " (%s), ignoring: %m", main_pid, strna(comm)); |
82659fd7 | 4497 | } else { |
bc6aed7b LP |
4498 | if (!main_pid_alien) |
4499 | wait_for_exit = true; | |
82659fd7 | 4500 | |
1d98fef1 | 4501 | if (r != -ESRCH && send_sighup) |
d0667321 | 4502 | (void) kill(main_pid, SIGHUP); |
82659fd7 | 4503 | } |
cd2086fe LP |
4504 | } |
4505 | ||
4506 | if (control_pid > 0) { | |
1d98fef1 LP |
4507 | if (log_func) |
4508 | log_func(control_pid, sig, u); | |
cd2086fe | 4509 | |
1d98fef1 | 4510 | r = kill_and_sigcont(control_pid, sig); |
cd2086fe LP |
4511 | if (r < 0 && r != -ESRCH) { |
4512 | _cleanup_free_ char *comm = NULL; | |
1d98fef1 | 4513 | (void) get_process_comm(control_pid, &comm); |
cd2086fe | 4514 | |
b821a397 | 4515 | log_unit_warning_errno(u, r, "Failed to kill control process " PID_FMT " (%s), ignoring: %m", control_pid, strna(comm)); |
82659fd7 | 4516 | } else { |
cd2086fe | 4517 | wait_for_exit = true; |
82659fd7 | 4518 | |
1d98fef1 | 4519 | if (r != -ESRCH && send_sighup) |
d0667321 | 4520 | (void) kill(control_pid, SIGHUP); |
82659fd7 | 4521 | } |
cd2086fe LP |
4522 | } |
4523 | ||
b821a397 LP |
4524 | if (u->cgroup_path && |
4525 | (c->kill_mode == KILL_CONTROL_GROUP || (c->kill_mode == KILL_MIXED && k == KILL_KILL))) { | |
cd2086fe LP |
4526 | _cleanup_set_free_ Set *pid_set = NULL; |
4527 | ||
82659fd7 LP |
4528 | /* Exclude the main/control pids from being killed via the cgroup */ |
4529 | pid_set = unit_pid_set(main_pid, control_pid); | |
cd2086fe LP |
4530 | if (!pid_set) |
4531 | return -ENOMEM; | |
4532 | ||
1d98fef1 LP |
4533 | r = cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, |
4534 | sig, | |
4535 | CGROUP_SIGCONT|CGROUP_IGNORE_SELF, | |
4536 | pid_set, | |
4537 | log_func, u); | |
cd2086fe | 4538 | if (r < 0) { |
4c701096 | 4539 | if (!IN_SET(r, -EAGAIN, -ESRCH, -ENOENT)) |
b821a397 LP |
4540 | log_unit_warning_errno(u, r, "Failed to kill control group %s, ignoring: %m", u->cgroup_path); |
4541 | ||
82659fd7 | 4542 | } else if (r > 0) { |
bc6aed7b | 4543 | |
efdb0237 LP |
4544 | /* FIXME: For now, on the legacy hierarchy, we |
4545 | * will not wait for the cgroup members to die | |
4546 | * if we are running in a container or if this | |
4547 | * is a delegation unit, simply because cgroup | |
4548 | * notification is unreliable in these | |
4549 | * cases. It doesn't work at all in | |
4550 | * containers, and outside of containers it | |
4551 | * can be confused easily by left-over | |
ccddd104 | 4552 | * directories in the cgroup — which however |
efdb0237 LP |
4553 | * should not exist in non-delegated units. On |
4554 | * the unified hierarchy that's different, | |
4555 | * there we get proper events. Hence rely on | |
13e785f7 | 4556 | * them. */ |
efdb0237 | 4557 | |
c22800e4 | 4558 | if (cg_unified_controller(SYSTEMD_CGROUP_CONTROLLER) > 0 || |
2e4025c0 | 4559 | (detect_container() == 0 && !UNIT_CGROUP_BOOL(u, delegate))) |
e9db43d5 | 4560 | wait_for_exit = true; |
58ea275a | 4561 | |
1d98fef1 | 4562 | if (send_sighup) { |
82659fd7 LP |
4563 | set_free(pid_set); |
4564 | ||
4565 | pid_set = unit_pid_set(main_pid, control_pid); | |
4566 | if (!pid_set) | |
4567 | return -ENOMEM; | |
4568 | ||
1d98fef1 LP |
4569 | cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, |
4570 | SIGHUP, | |
4571 | CGROUP_IGNORE_SELF, | |
4572 | pid_set, | |
4573 | NULL, NULL); | |
82659fd7 LP |
4574 | } |
4575 | } | |
cd2086fe LP |
4576 | } |
4577 | ||
4578 | return wait_for_exit; | |
4579 | } | |
4580 | ||
eef85c4a | 4581 | int unit_require_mounts_for(Unit *u, const char *path, UnitDependencyMask mask) { |
a57f7e2c | 4582 | char prefix[strlen(path) + 1], *p; |
eef85c4a | 4583 | UnitDependencyInfo di; |
a57f7e2c LP |
4584 | int r; |
4585 | ||
4586 | assert(u); | |
4587 | assert(path); | |
4588 | ||
eef85c4a LP |
4589 | /* Registers a unit for requiring a certain path and all its prefixes. We keep a hashtable of these paths in |
4590 | * the unit (from the path to the UnitDependencyInfo structure indicating how to the dependency came to | |
4591 | * be). However, we build a prefix table for all possible prefixes so that new appearing mount units can easily | |
4592 | * determine which units to make themselves a dependency of. */ | |
a57f7e2c | 4593 | |
70b64bd3 ZJS |
4594 | if (!path_is_absolute(path)) |
4595 | return -EINVAL; | |
4596 | ||
eef85c4a LP |
4597 | r = hashmap_ensure_allocated(&u->requires_mounts_for, &string_hash_ops); |
4598 | if (r < 0) | |
4599 | return r; | |
4600 | ||
a57f7e2c LP |
4601 | p = strdup(path); |
4602 | if (!p) | |
4603 | return -ENOMEM; | |
4604 | ||
4605 | path_kill_slashes(p); | |
4606 | ||
99be45a4 | 4607 | if (!path_is_normalized(p)) { |
a57f7e2c LP |
4608 | free(p); |
4609 | return -EPERM; | |
4610 | } | |
4611 | ||
eef85c4a | 4612 | if (hashmap_contains(u->requires_mounts_for, p)) { |
a57f7e2c LP |
4613 | free(p); |
4614 | return 0; | |
4615 | } | |
4616 | ||
eef85c4a LP |
4617 | di = (UnitDependencyInfo) { |
4618 | .origin_mask = mask | |
4619 | }; | |
4620 | ||
4621 | r = hashmap_put(u->requires_mounts_for, p, di.data); | |
4622 | if (r < 0) { | |
4623 | free(p); | |
a57f7e2c | 4624 | return r; |
eef85c4a | 4625 | } |
a57f7e2c LP |
4626 | |
4627 | PATH_FOREACH_PREFIX_MORE(prefix, p) { | |
4628 | Set *x; | |
4629 | ||
4630 | x = hashmap_get(u->manager->units_requiring_mounts_for, prefix); | |
4631 | if (!x) { | |
4632 | char *q; | |
4633 | ||
742f41ad LP |
4634 | r = hashmap_ensure_allocated(&u->manager->units_requiring_mounts_for, &string_hash_ops); |
4635 | if (r < 0) | |
4636 | return r; | |
a57f7e2c LP |
4637 | |
4638 | q = strdup(prefix); | |
4639 | if (!q) | |
4640 | return -ENOMEM; | |
4641 | ||
d5099efc | 4642 | x = set_new(NULL); |
a57f7e2c LP |
4643 | if (!x) { |
4644 | free(q); | |
4645 | return -ENOMEM; | |
4646 | } | |
4647 | ||
4648 | r = hashmap_put(u->manager->units_requiring_mounts_for, q, x); | |
4649 | if (r < 0) { | |
4650 | free(q); | |
4651 | set_free(x); | |
4652 | return r; | |
4653 | } | |
4654 | } | |
4655 | ||
4656 | r = set_put(x, u); | |
4657 | if (r < 0) | |
4658 | return r; | |
4659 | } | |
4660 | ||
4661 | return 0; | |
4662 | } | |
4663 | ||
613b411c LP |
4664 | int unit_setup_exec_runtime(Unit *u) { |
4665 | ExecRuntime **rt; | |
4666 | size_t offset; | |
613b411c | 4667 | Unit *other; |
eef85c4a LP |
4668 | Iterator i; |
4669 | void *v; | |
e8a565cb | 4670 | int r; |
613b411c LP |
4671 | |
4672 | offset = UNIT_VTABLE(u)->exec_runtime_offset; | |
4673 | assert(offset > 0); | |
4674 | ||
06b643e7 | 4675 | /* Check if there already is an ExecRuntime for this unit? */ |
613b411c LP |
4676 | rt = (ExecRuntime**) ((uint8_t*) u + offset); |
4677 | if (*rt) | |
4678 | return 0; | |
4679 | ||
4680 | /* Try to get it from somebody else */ | |
eef85c4a | 4681 | HASHMAP_FOREACH_KEY(v, other, u->dependencies[UNIT_JOINS_NAMESPACE_OF], i) { |
e8a565cb YW |
4682 | r = exec_runtime_acquire(u->manager, NULL, other->id, false, rt); |
4683 | if (r == 1) | |
4684 | return 1; | |
613b411c LP |
4685 | } |
4686 | ||
e8a565cb | 4687 | return exec_runtime_acquire(u->manager, unit_get_exec_context(u), u->id, true, rt); |
613b411c LP |
4688 | } |
4689 | ||
29206d46 LP |
4690 | int unit_setup_dynamic_creds(Unit *u) { |
4691 | ExecContext *ec; | |
4692 | DynamicCreds *dcreds; | |
4693 | size_t offset; | |
4694 | ||
4695 | assert(u); | |
4696 | ||
4697 | offset = UNIT_VTABLE(u)->dynamic_creds_offset; | |
4698 | assert(offset > 0); | |
4699 | dcreds = (DynamicCreds*) ((uint8_t*) u + offset); | |
4700 | ||
4701 | ec = unit_get_exec_context(u); | |
4702 | assert(ec); | |
4703 | ||
4704 | if (!ec->dynamic_user) | |
4705 | return 0; | |
4706 | ||
4707 | return dynamic_creds_acquire(dcreds, u->manager, ec->user, ec->group); | |
4708 | } | |
4709 | ||
1c2e9646 LP |
4710 | bool unit_type_supported(UnitType t) { |
4711 | if (_unlikely_(t < 0)) | |
4712 | return false; | |
4713 | if (_unlikely_(t >= _UNIT_TYPE_MAX)) | |
4714 | return false; | |
4715 | ||
4716 | if (!unit_vtable[t]->supported) | |
4717 | return true; | |
4718 | ||
4719 | return unit_vtable[t]->supported(); | |
4720 | } | |
4721 | ||
8b4305c7 LP |
4722 | void unit_warn_if_dir_nonempty(Unit *u, const char* where) { |
4723 | int r; | |
4724 | ||
4725 | assert(u); | |
4726 | assert(where); | |
4727 | ||
4728 | r = dir_is_empty(where); | |
3f602115 | 4729 | if (r > 0 || r == -ENOTDIR) |
8b4305c7 LP |
4730 | return; |
4731 | if (r < 0) { | |
4732 | log_unit_warning_errno(u, r, "Failed to check directory %s: %m", where); | |
4733 | return; | |
4734 | } | |
4735 | ||
4736 | log_struct(LOG_NOTICE, | |
2b044526 | 4737 | "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR, |
8b4305c7 | 4738 | LOG_UNIT_ID(u), |
f1c50bec | 4739 | LOG_UNIT_INVOCATION_ID(u), |
8b4305c7 LP |
4740 | LOG_UNIT_MESSAGE(u, "Directory %s to mount over is not empty, mounting anyway.", where), |
4741 | "WHERE=%s", where, | |
4742 | NULL); | |
4743 | } | |
4744 | ||
25cd4964 AJ |
4745 | int unit_fail_if_noncanonical(Unit *u, const char* where) { |
4746 | _cleanup_free_ char *canonical_where; | |
8b4305c7 LP |
4747 | int r; |
4748 | ||
4749 | assert(u); | |
4750 | assert(where); | |
4751 | ||
25cd4964 | 4752 | r = chase_symlinks(where, NULL, CHASE_NONEXISTENT, &canonical_where); |
8b4305c7 | 4753 | if (r < 0) { |
25cd4964 | 4754 | log_unit_debug_errno(u, r, "Failed to check %s for symlinks, ignoring: %m", where); |
8b4305c7 LP |
4755 | return 0; |
4756 | } | |
25cd4964 AJ |
4757 | |
4758 | /* We will happily ignore a trailing slash (or any redundant slashes) */ | |
4759 | if (path_equal(where, canonical_where)) | |
8b4305c7 LP |
4760 | return 0; |
4761 | ||
25cd4964 | 4762 | /* No need to mention "." or "..", they would already have been rejected by unit_name_from_path() */ |
8b4305c7 | 4763 | log_struct(LOG_ERR, |
2b044526 | 4764 | "MESSAGE_ID=" SD_MESSAGE_OVERMOUNTING_STR, |
8b4305c7 | 4765 | LOG_UNIT_ID(u), |
f1c50bec | 4766 | LOG_UNIT_INVOCATION_ID(u), |
25cd4964 | 4767 | LOG_UNIT_MESSAGE(u, "Mount path %s is not canonical (contains a symlink).", where), |
8b4305c7 LP |
4768 | "WHERE=%s", where, |
4769 | NULL); | |
4770 | ||
4771 | return -ELOOP; | |
4772 | } | |
0f13f3bd LP |
4773 | |
4774 | bool unit_is_pristine(Unit *u) { | |
4775 | assert(u); | |
4776 | ||
7c65093a | 4777 | /* Check if the unit already exists or is already around, |
0f13f3bd LP |
4778 | * in a number of different ways. Note that to cater for unit |
4779 | * types such as slice, we are generally fine with units that | |
61233823 | 4780 | * are marked UNIT_LOADED even though nothing was |
0f13f3bd LP |
4781 | * actually loaded, as those unit types don't require a file |
4782 | * on disk to validly load. */ | |
4783 | ||
4784 | return !(!IN_SET(u->load_state, UNIT_NOT_FOUND, UNIT_LOADED) || | |
4785 | u->fragment_path || | |
4786 | u->source_path || | |
4787 | !strv_isempty(u->dropin_paths) || | |
0f13f3bd LP |
4788 | u->job || |
4789 | u->merged_into); | |
4790 | } | |
291d565a LP |
4791 | |
4792 | pid_t unit_control_pid(Unit *u) { | |
4793 | assert(u); | |
4794 | ||
4795 | if (UNIT_VTABLE(u)->control_pid) | |
4796 | return UNIT_VTABLE(u)->control_pid(u); | |
4797 | ||
4798 | return 0; | |
4799 | } | |
4800 | ||
4801 | pid_t unit_main_pid(Unit *u) { | |
4802 | assert(u); | |
4803 | ||
4804 | if (UNIT_VTABLE(u)->main_pid) | |
4805 | return UNIT_VTABLE(u)->main_pid(u); | |
4806 | ||
4807 | return 0; | |
4808 | } | |
00d9ef85 LP |
4809 | |
4810 | static void unit_unref_uid_internal( | |
4811 | Unit *u, | |
4812 | uid_t *ref_uid, | |
4813 | bool destroy_now, | |
4814 | void (*_manager_unref_uid)(Manager *m, uid_t uid, bool destroy_now)) { | |
4815 | ||
4816 | assert(u); | |
4817 | assert(ref_uid); | |
4818 | assert(_manager_unref_uid); | |
4819 | ||
4820 | /* Generic implementation of both unit_unref_uid() and unit_unref_gid(), under the assumption that uid_t and | |
4821 | * gid_t are actually the same time, with the same validity rules. | |
4822 | * | |
4823 | * Drops a reference to UID/GID from a unit. */ | |
4824 | ||
4825 | assert_cc(sizeof(uid_t) == sizeof(gid_t)); | |
4826 | assert_cc(UID_INVALID == (uid_t) GID_INVALID); | |
4827 | ||
4828 | if (!uid_is_valid(*ref_uid)) | |
4829 | return; | |
4830 | ||
4831 | _manager_unref_uid(u->manager, *ref_uid, destroy_now); | |
4832 | *ref_uid = UID_INVALID; | |
4833 | } | |
4834 | ||
4835 | void unit_unref_uid(Unit *u, bool destroy_now) { | |
4836 | unit_unref_uid_internal(u, &u->ref_uid, destroy_now, manager_unref_uid); | |
4837 | } | |
4838 | ||
4839 | void unit_unref_gid(Unit *u, bool destroy_now) { | |
4840 | unit_unref_uid_internal(u, (uid_t*) &u->ref_gid, destroy_now, manager_unref_gid); | |
4841 | } | |
4842 | ||
4843 | static int unit_ref_uid_internal( | |
4844 | Unit *u, | |
4845 | uid_t *ref_uid, | |
4846 | uid_t uid, | |
4847 | bool clean_ipc, | |
4848 | int (*_manager_ref_uid)(Manager *m, uid_t uid, bool clean_ipc)) { | |
4849 | ||
4850 | int r; | |
4851 | ||
4852 | assert(u); | |
4853 | assert(ref_uid); | |
4854 | assert(uid_is_valid(uid)); | |
4855 | assert(_manager_ref_uid); | |
4856 | ||
4857 | /* Generic implementation of both unit_ref_uid() and unit_ref_guid(), under the assumption that uid_t and gid_t | |
4858 | * are actually the same type, and have the same validity rules. | |
4859 | * | |
4860 | * Adds a reference on a specific UID/GID to this unit. Each unit referencing the same UID/GID maintains a | |
4861 | * reference so that we can destroy the UID/GID's IPC resources as soon as this is requested and the counter | |
4862 | * drops to zero. */ | |
4863 | ||
4864 | assert_cc(sizeof(uid_t) == sizeof(gid_t)); | |
4865 | assert_cc(UID_INVALID == (uid_t) GID_INVALID); | |
4866 | ||
4867 | if (*ref_uid == uid) | |
4868 | return 0; | |
4869 | ||
4870 | if (uid_is_valid(*ref_uid)) /* Already set? */ | |
4871 | return -EBUSY; | |
4872 | ||
4873 | r = _manager_ref_uid(u->manager, uid, clean_ipc); | |
4874 | if (r < 0) | |
4875 | return r; | |
4876 | ||
4877 | *ref_uid = uid; | |
4878 | return 1; | |
4879 | } | |
4880 | ||
4881 | int unit_ref_uid(Unit *u, uid_t uid, bool clean_ipc) { | |
4882 | return unit_ref_uid_internal(u, &u->ref_uid, uid, clean_ipc, manager_ref_uid); | |
4883 | } | |
4884 | ||
4885 | int unit_ref_gid(Unit *u, gid_t gid, bool clean_ipc) { | |
4886 | return unit_ref_uid_internal(u, (uid_t*) &u->ref_gid, (uid_t) gid, clean_ipc, manager_ref_gid); | |
4887 | } | |
4888 | ||
4889 | static int unit_ref_uid_gid_internal(Unit *u, uid_t uid, gid_t gid, bool clean_ipc) { | |
4890 | int r = 0, q = 0; | |
4891 | ||
4892 | assert(u); | |
4893 | ||
4894 | /* Reference both a UID and a GID in one go. Either references both, or neither. */ | |
4895 | ||
4896 | if (uid_is_valid(uid)) { | |
4897 | r = unit_ref_uid(u, uid, clean_ipc); | |
4898 | if (r < 0) | |
4899 | return r; | |
4900 | } | |
4901 | ||
4902 | if (gid_is_valid(gid)) { | |
4903 | q = unit_ref_gid(u, gid, clean_ipc); | |
4904 | if (q < 0) { | |
4905 | if (r > 0) | |
4906 | unit_unref_uid(u, false); | |
4907 | ||
4908 | return q; | |
4909 | } | |
4910 | } | |
4911 | ||
4912 | return r > 0 || q > 0; | |
4913 | } | |
4914 | ||
4915 | int unit_ref_uid_gid(Unit *u, uid_t uid, gid_t gid) { | |
4916 | ExecContext *c; | |
4917 | int r; | |
4918 | ||
4919 | assert(u); | |
4920 | ||
4921 | c = unit_get_exec_context(u); | |
4922 | ||
4923 | r = unit_ref_uid_gid_internal(u, uid, gid, c ? c->remove_ipc : false); | |
4924 | if (r < 0) | |
4925 | return log_unit_warning_errno(u, r, "Couldn't add UID/GID reference to unit, proceeding without: %m"); | |
4926 | ||
4927 | return r; | |
4928 | } | |
4929 | ||
4930 | void unit_unref_uid_gid(Unit *u, bool destroy_now) { | |
4931 | assert(u); | |
4932 | ||
4933 | unit_unref_uid(u, destroy_now); | |
4934 | unit_unref_gid(u, destroy_now); | |
4935 | } | |
4936 | ||
4937 | void unit_notify_user_lookup(Unit *u, uid_t uid, gid_t gid) { | |
4938 | int r; | |
4939 | ||
4940 | assert(u); | |
4941 | ||
4942 | /* This is invoked whenever one of the forked off processes let's us know the UID/GID its user name/group names | |
4943 | * resolved to. We keep track of which UID/GID is currently assigned in order to be able to destroy its IPC | |
4944 | * objects when no service references the UID/GID anymore. */ | |
4945 | ||
4946 | r = unit_ref_uid_gid(u, uid, gid); | |
4947 | if (r > 0) | |
4948 | bus_unit_send_change_signal(u); | |
4949 | } | |
4b58153d LP |
4950 | |
4951 | int unit_set_invocation_id(Unit *u, sd_id128_t id) { | |
4952 | int r; | |
4953 | ||
4954 | assert(u); | |
4955 | ||
4956 | /* Set the invocation ID for this unit. If we cannot, this will not roll back, but reset the whole thing. */ | |
4957 | ||
4958 | if (sd_id128_equal(u->invocation_id, id)) | |
4959 | return 0; | |
4960 | ||
4961 | if (!sd_id128_is_null(u->invocation_id)) | |
4962 | (void) hashmap_remove_value(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
4963 | ||
4964 | if (sd_id128_is_null(id)) { | |
4965 | r = 0; | |
4966 | goto reset; | |
4967 | } | |
4968 | ||
4969 | r = hashmap_ensure_allocated(&u->manager->units_by_invocation_id, &id128_hash_ops); | |
4970 | if (r < 0) | |
4971 | goto reset; | |
4972 | ||
4973 | u->invocation_id = id; | |
4974 | sd_id128_to_string(id, u->invocation_id_string); | |
4975 | ||
4976 | r = hashmap_put(u->manager->units_by_invocation_id, &u->invocation_id, u); | |
4977 | if (r < 0) | |
4978 | goto reset; | |
4979 | ||
4980 | return 0; | |
4981 | ||
4982 | reset: | |
4983 | u->invocation_id = SD_ID128_NULL; | |
4984 | u->invocation_id_string[0] = 0; | |
4985 | return r; | |
4986 | } | |
4987 | ||
4988 | int unit_acquire_invocation_id(Unit *u) { | |
4989 | sd_id128_t id; | |
4990 | int r; | |
4991 | ||
4992 | assert(u); | |
4993 | ||
4994 | r = sd_id128_randomize(&id); | |
4995 | if (r < 0) | |
4996 | return log_unit_error_errno(u, r, "Failed to generate invocation ID for unit: %m"); | |
4997 | ||
4998 | r = unit_set_invocation_id(u, id); | |
4999 | if (r < 0) | |
5000 | return log_unit_error_errno(u, r, "Failed to set invocation ID for unit: %m"); | |
5001 | ||
5002 | return 0; | |
5003 | } | |
f0d47797 | 5004 | |
7960b0c7 LP |
5005 | void unit_set_exec_params(Unit *u, ExecParameters *p) { |
5006 | assert(u); | |
5007 | assert(p); | |
f0d47797 | 5008 | |
7960b0c7 | 5009 | p->cgroup_path = u->cgroup_path; |
2e4025c0 | 5010 | SET_FLAG(p->flags, EXEC_CGROUP_DELEGATE, UNIT_CGROUP_BOOL(u, delegate)); |
f0d47797 | 5011 | } |
a79279c7 | 5012 | |
4c253ed1 | 5013 | int unit_fork_helper_process(Unit *u, const char *name, pid_t *ret) { |
a79279c7 LP |
5014 | int r; |
5015 | ||
5016 | assert(u); | |
5017 | assert(ret); | |
5018 | ||
5019 | /* Forks off a helper process and makes sure it is a member of the unit's cgroup. Returns == 0 in the child, | |
5020 | * and > 0 in the parent. The pid parameter is always filled in with the child's PID. */ | |
5021 | ||
5022 | (void) unit_realize_cgroup(u); | |
5023 | ||
4c253ed1 LP |
5024 | r = safe_fork(name, FORK_REOPEN_LOG, ret); |
5025 | if (r != 0) | |
5026 | return r; | |
a79279c7 | 5027 | |
4c253ed1 LP |
5028 | (void) default_signals(SIGNALS_CRASH_HANDLER, SIGNALS_IGNORE, -1); |
5029 | (void) ignore_signals(SIGPIPE, -1); | |
a79279c7 | 5030 | |
4c253ed1 | 5031 | (void) prctl(PR_SET_PDEATHSIG, SIGTERM); |
a79279c7 | 5032 | |
4c253ed1 LP |
5033 | if (u->cgroup_path) { |
5034 | r = cg_attach_everywhere(u->manager->cgroup_supported, u->cgroup_path, 0, NULL, NULL); | |
5035 | if (r < 0) { | |
5036 | log_unit_error_errno(u, r, "Failed to join unit cgroup %s: %m", u->cgroup_path); | |
5037 | _exit(EXIT_CGROUP); | |
a79279c7 | 5038 | } |
a79279c7 LP |
5039 | } |
5040 | ||
4c253ed1 | 5041 | return 0; |
a79279c7 | 5042 | } |
c999cf38 LP |
5043 | |
5044 | static void unit_update_dependency_mask(Unit *u, UnitDependency d, Unit *other, UnitDependencyInfo di) { | |
5045 | assert(u); | |
5046 | assert(d >= 0); | |
5047 | assert(d < _UNIT_DEPENDENCY_MAX); | |
5048 | assert(other); | |
5049 | ||
5050 | if (di.origin_mask == 0 && di.destination_mask == 0) { | |
5051 | /* No bit set anymore, let's drop the whole entry */ | |
5052 | assert_se(hashmap_remove(u->dependencies[d], other)); | |
5053 | log_unit_debug(u, "%s lost dependency %s=%s", u->id, unit_dependency_to_string(d), other->id); | |
5054 | } else | |
5055 | /* Mask was reduced, let's update the entry */ | |
5056 | assert_se(hashmap_update(u->dependencies[d], other, di.data) == 0); | |
5057 | } | |
5058 | ||
5059 | void unit_remove_dependencies(Unit *u, UnitDependencyMask mask) { | |
5060 | UnitDependency d; | |
5061 | ||
5062 | assert(u); | |
5063 | ||
5064 | /* Removes all dependencies u has on other units marked for ownership by 'mask'. */ | |
5065 | ||
5066 | if (mask == 0) | |
5067 | return; | |
5068 | ||
5069 | for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) { | |
5070 | bool done; | |
5071 | ||
5072 | do { | |
5073 | UnitDependencyInfo di; | |
5074 | Unit *other; | |
5075 | Iterator i; | |
5076 | ||
5077 | done = true; | |
5078 | ||
5079 | HASHMAP_FOREACH_KEY(di.data, other, u->dependencies[d], i) { | |
5080 | UnitDependency q; | |
5081 | ||
5082 | if ((di.origin_mask & ~mask) == di.origin_mask) | |
5083 | continue; | |
5084 | di.origin_mask &= ~mask; | |
5085 | unit_update_dependency_mask(u, d, other, di); | |
5086 | ||
5087 | /* We updated the dependency from our unit to the other unit now. But most dependencies | |
5088 | * imply a reverse dependency. Hence, let's delete that one too. For that we go through | |
5089 | * all dependency types on the other unit and delete all those which point to us and | |
5090 | * have the right mask set. */ | |
5091 | ||
5092 | for (q = 0; q < _UNIT_DEPENDENCY_MAX; q++) { | |
5093 | UnitDependencyInfo dj; | |
5094 | ||
5095 | dj.data = hashmap_get(other->dependencies[q], u); | |
5096 | if ((dj.destination_mask & ~mask) == dj.destination_mask) | |
5097 | continue; | |
5098 | dj.destination_mask &= ~mask; | |
5099 | ||
5100 | unit_update_dependency_mask(other, q, u, dj); | |
5101 | } | |
5102 | ||
5103 | unit_add_to_gc_queue(other); | |
5104 | ||
5105 | done = false; | |
5106 | break; | |
5107 | } | |
5108 | ||
5109 | } while (!done); | |
5110 | } | |
5111 | } | |
d3070fbd LP |
5112 | |
5113 | static int unit_export_invocation_id(Unit *u) { | |
5114 | const char *p; | |
5115 | int r; | |
5116 | ||
5117 | assert(u); | |
5118 | ||
5119 | if (u->exported_invocation_id) | |
5120 | return 0; | |
5121 | ||
5122 | if (sd_id128_is_null(u->invocation_id)) | |
5123 | return 0; | |
5124 | ||
5125 | p = strjoina("/run/systemd/units/invocation:", u->id); | |
5126 | r = symlink_atomic(u->invocation_id_string, p); | |
5127 | if (r < 0) | |
5128 | return log_unit_debug_errno(u, r, "Failed to create invocation ID symlink %s: %m", p); | |
5129 | ||
5130 | u->exported_invocation_id = true; | |
5131 | return 0; | |
5132 | } | |
5133 | ||
5134 | static int unit_export_log_level_max(Unit *u, const ExecContext *c) { | |
5135 | const char *p; | |
5136 | char buf[2]; | |
5137 | int r; | |
5138 | ||
5139 | assert(u); | |
5140 | assert(c); | |
5141 | ||
5142 | if (u->exported_log_level_max) | |
5143 | return 0; | |
5144 | ||
5145 | if (c->log_level_max < 0) | |
5146 | return 0; | |
5147 | ||
5148 | assert(c->log_level_max <= 7); | |
5149 | ||
5150 | buf[0] = '0' + c->log_level_max; | |
5151 | buf[1] = 0; | |
5152 | ||
5153 | p = strjoina("/run/systemd/units/log-level-max:", u->id); | |
5154 | r = symlink_atomic(buf, p); | |
5155 | if (r < 0) | |
5156 | return log_unit_debug_errno(u, r, "Failed to create maximum log level symlink %s: %m", p); | |
5157 | ||
5158 | u->exported_log_level_max = true; | |
5159 | return 0; | |
5160 | } | |
5161 | ||
5162 | static int unit_export_log_extra_fields(Unit *u, const ExecContext *c) { | |
5163 | _cleanup_close_ int fd = -1; | |
5164 | struct iovec *iovec; | |
5165 | const char *p; | |
5166 | char *pattern; | |
5167 | le64_t *sizes; | |
5168 | ssize_t n; | |
5169 | size_t i; | |
5170 | int r; | |
5171 | ||
5172 | if (u->exported_log_extra_fields) | |
5173 | return 0; | |
5174 | ||
5175 | if (c->n_log_extra_fields <= 0) | |
5176 | return 0; | |
5177 | ||
5178 | sizes = newa(le64_t, c->n_log_extra_fields); | |
5179 | iovec = newa(struct iovec, c->n_log_extra_fields * 2); | |
5180 | ||
5181 | for (i = 0; i < c->n_log_extra_fields; i++) { | |
5182 | sizes[i] = htole64(c->log_extra_fields[i].iov_len); | |
5183 | ||
5184 | iovec[i*2] = IOVEC_MAKE(sizes + i, sizeof(le64_t)); | |
5185 | iovec[i*2+1] = c->log_extra_fields[i]; | |
5186 | } | |
5187 | ||
5188 | p = strjoina("/run/systemd/units/log-extra-fields:", u->id); | |
5189 | pattern = strjoina(p, ".XXXXXX"); | |
5190 | ||
5191 | fd = mkostemp_safe(pattern); | |
5192 | if (fd < 0) | |
5193 | return log_unit_debug_errno(u, fd, "Failed to create extra fields file %s: %m", p); | |
5194 | ||
5195 | n = writev(fd, iovec, c->n_log_extra_fields*2); | |
5196 | if (n < 0) { | |
5197 | r = log_unit_debug_errno(u, errno, "Failed to write extra fields: %m"); | |
5198 | goto fail; | |
5199 | } | |
5200 | ||
5201 | (void) fchmod(fd, 0644); | |
5202 | ||
5203 | if (rename(pattern, p) < 0) { | |
5204 | r = log_unit_debug_errno(u, errno, "Failed to rename extra fields file: %m"); | |
5205 | goto fail; | |
5206 | } | |
5207 | ||
5208 | u->exported_log_extra_fields = true; | |
5209 | return 0; | |
5210 | ||
5211 | fail: | |
5212 | (void) unlink(pattern); | |
5213 | return r; | |
5214 | } | |
5215 | ||
5216 | void unit_export_state_files(Unit *u) { | |
5217 | const ExecContext *c; | |
5218 | ||
5219 | assert(u); | |
5220 | ||
5221 | if (!u->id) | |
5222 | return; | |
5223 | ||
5224 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
5225 | return; | |
5226 | ||
5227 | /* Exports a couple of unit properties to /run/systemd/units/, so that journald can quickly query this data | |
5228 | * from there. Ideally, journald would use IPC to query this, like everybody else, but that's hard, as long as | |
5229 | * the IPC system itself and PID 1 also log to the journal. | |
5230 | * | |
5231 | * Note that these files really shouldn't be considered API for anyone else, as use a runtime file system as | |
5232 | * IPC replacement is not compatible with today's world of file system namespaces. However, this doesn't really | |
5233 | * apply to communication between the journal and systemd, as we assume that these two daemons live in the same | |
5234 | * namespace at least. | |
5235 | * | |
5236 | * Note that some of the "files" exported here are actually symlinks and not regular files. Symlinks work | |
5237 | * better for storing small bits of data, in particular as we can write them with two system calls, and read | |
5238 | * them with one. */ | |
5239 | ||
5240 | (void) unit_export_invocation_id(u); | |
5241 | ||
5242 | c = unit_get_exec_context(u); | |
5243 | if (c) { | |
5244 | (void) unit_export_log_level_max(u, c); | |
5245 | (void) unit_export_log_extra_fields(u, c); | |
5246 | } | |
5247 | } | |
5248 | ||
5249 | void unit_unlink_state_files(Unit *u) { | |
5250 | const char *p; | |
5251 | ||
5252 | assert(u); | |
5253 | ||
5254 | if (!u->id) | |
5255 | return; | |
5256 | ||
5257 | if (!MANAGER_IS_SYSTEM(u->manager)) | |
5258 | return; | |
5259 | ||
5260 | /* Undoes the effect of unit_export_state() */ | |
5261 | ||
5262 | if (u->exported_invocation_id) { | |
5263 | p = strjoina("/run/systemd/units/invocation:", u->id); | |
5264 | (void) unlink(p); | |
5265 | ||
5266 | u->exported_invocation_id = false; | |
5267 | } | |
5268 | ||
5269 | if (u->exported_log_level_max) { | |
5270 | p = strjoina("/run/systemd/units/log-level-max:", u->id); | |
5271 | (void) unlink(p); | |
5272 | ||
5273 | u->exported_log_level_max = false; | |
5274 | } | |
5275 | ||
5276 | if (u->exported_log_extra_fields) { | |
5277 | p = strjoina("/run/systemd/units/extra-fields:", u->id); | |
5278 | (void) unlink(p); | |
5279 | ||
5280 | u->exported_log_extra_fields = false; | |
5281 | } | |
5282 | } | |
5afe510c | 5283 | |
3c7416b6 LP |
5284 | int unit_prepare_exec(Unit *u) { |
5285 | int r; | |
5286 | ||
5287 | assert(u); | |
5288 | ||
5289 | /* Prepares everything so that we can fork of a process for this unit */ | |
5290 | ||
5291 | (void) unit_realize_cgroup(u); | |
5292 | ||
5293 | if (u->reset_accounting) { | |
5294 | (void) unit_reset_cpu_accounting(u); | |
5295 | (void) unit_reset_ip_accounting(u); | |
5296 | u->reset_accounting = false; | |
5297 | } | |
5298 | ||
5299 | unit_export_state_files(u); | |
5300 | ||
5301 | r = unit_setup_exec_runtime(u); | |
5302 | if (r < 0) | |
5303 | return r; | |
5304 | ||
5305 | r = unit_setup_dynamic_creds(u); | |
5306 | if (r < 0) | |
5307 | return r; | |
5308 | ||
5309 | return 0; | |
5310 | } | |
5311 | ||
a4634b21 LP |
5312 | static void log_leftover(pid_t pid, int sig, void *userdata) { |
5313 | _cleanup_free_ char *comm = NULL; | |
5314 | ||
5315 | (void) get_process_comm(pid, &comm); | |
5316 | ||
5317 | if (comm && comm[0] == '(') /* Most likely our own helper process (PAM?), ignore */ | |
5318 | return; | |
5319 | ||
5320 | log_unit_warning(userdata, | |
5321 | "Found left-over process " PID_FMT " (%s) in control group while starting unit. Ignoring.\n" | |
5322 | "This usually indicates unclean termination of a previous run, or service implementation deficiencies.", | |
5323 | pid, strna(comm)); | |
5324 | } | |
5325 | ||
5326 | void unit_warn_leftover_processes(Unit *u) { | |
5327 | assert(u); | |
5328 | ||
5329 | (void) unit_pick_cgroup_path(u); | |
5330 | ||
5331 | if (!u->cgroup_path) | |
5332 | return; | |
5333 | ||
5334 | (void) cg_kill_recursive(SYSTEMD_CGROUP_CONTROLLER, u->cgroup_path, 0, 0, NULL, log_leftover, u); | |
5335 | } | |
5336 | ||
bb2c7685 LP |
5337 | bool unit_needs_console(Unit *u) { |
5338 | ExecContext *ec; | |
5339 | UnitActiveState state; | |
5340 | ||
5341 | assert(u); | |
5342 | ||
5343 | state = unit_active_state(u); | |
5344 | ||
5345 | if (UNIT_IS_INACTIVE_OR_FAILED(state)) | |
5346 | return false; | |
5347 | ||
5348 | if (UNIT_VTABLE(u)->needs_console) | |
5349 | return UNIT_VTABLE(u)->needs_console(u); | |
5350 | ||
5351 | /* If this unit type doesn't implement this call, let's use a generic fallback implementation: */ | |
5352 | ec = unit_get_exec_context(u); | |
5353 | if (!ec) | |
5354 | return false; | |
5355 | ||
5356 | return exec_context_may_touch_console(ec); | |
5357 | } | |
5358 | ||
81e9871e LP |
5359 | const char *unit_label_path(Unit *u) { |
5360 | const char *p; | |
5361 | ||
5362 | /* Returns the file system path to use for MAC access decisions, i.e. the file to read the SELinux label off | |
5363 | * when validating access checks. */ | |
5364 | ||
5365 | p = u->source_path ?: u->fragment_path; | |
5366 | if (!p) | |
5367 | return NULL; | |
5368 | ||
5369 | /* If a unit is masked, then don't read the SELinux label of /dev/null, as that really makes no sense */ | |
5370 | if (path_equal(p, "/dev/null")) | |
5371 | return NULL; | |
5372 | ||
5373 | return p; | |
5374 | } | |
5375 | ||
5afe510c LP |
5376 | static const char* const collect_mode_table[_COLLECT_MODE_MAX] = { |
5377 | [COLLECT_INACTIVE] = "inactive", | |
5378 | [COLLECT_INACTIVE_OR_FAILED] = "inactive-or-failed", | |
5379 | }; | |
5380 | ||
5381 | DEFINE_STRING_TABLE_LOOKUP(collect_mode, CollectMode); |