]>
Commit | Line | Data |
---|---|---|
d6c9574f | 1 | /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ |
60918275 | 2 | |
a7334b09 LP |
3 | /*** |
4 | This file is part of systemd. | |
5 | ||
6 | Copyright 2010 Lennart Poettering | |
7 | ||
8 | systemd is free software; you can redistribute it and/or modify it | |
9 | under the terms of the GNU General Public License as published by | |
10 | the Free Software Foundation; either version 2 of the License, or | |
11 | (at your option) any later version. | |
12 | ||
13 | systemd is distributed in the hope that it will be useful, but | |
14 | WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
16 | General Public License for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with systemd; If not, see <http://www.gnu.org/licenses/>. | |
20 | ***/ | |
21 | ||
60918275 LP |
22 | #include <assert.h> |
23 | #include <errno.h> | |
87d1515d | 24 | #include <string.h> |
9152c765 LP |
25 | #include <sys/epoll.h> |
26 | #include <signal.h> | |
27 | #include <sys/signalfd.h> | |
28 | #include <sys/wait.h> | |
29 | #include <unistd.h> | |
30 | #include <sys/poll.h> | |
e1414003 LP |
31 | #include <sys/reboot.h> |
32 | #include <sys/ioctl.h> | |
33 | #include <linux/kd.h> | |
80876c20 LP |
34 | #include <termios.h> |
35 | #include <fcntl.h> | |
a16e1123 LP |
36 | #include <sys/types.h> |
37 | #include <sys/stat.h> | |
fe51822e | 38 | #include <dirent.h> |
830f6caa LP |
39 | |
40 | #ifdef HAVE_AUDIT | |
4927fcae | 41 | #include <libaudit.h> |
830f6caa | 42 | #endif |
60918275 LP |
43 | |
44 | #include "manager.h" | |
45 | #include "hashmap.h" | |
46 | #include "macro.h" | |
47 | #include "strv.h" | |
16354eff | 48 | #include "log.h" |
2a987ee8 | 49 | #include "util.h" |
ea430986 | 50 | #include "ratelimit.h" |
8e274523 LP |
51 | #include "cgroup.h" |
52 | #include "mount-setup.h" | |
9e2f7c11 | 53 | #include "unit-name.h" |
4139c1b2 LP |
54 | #include "dbus-unit.h" |
55 | #include "dbus-job.h" | |
1137a57c | 56 | #include "missing.h" |
84e3543e | 57 | #include "path-lookup.h" |
514f4ef5 | 58 | #include "special.h" |
398ef8ba | 59 | #include "bus-errors.h" |
d06dacd0 | 60 | #include "exit-status.h" |
60918275 | 61 | |
701cc384 LP |
62 | /* As soon as 16 units are in our GC queue, make sure to run a gc sweep */ |
63 | #define GC_QUEUE_ENTRIES_MAX 16 | |
64 | ||
65 | /* As soon as 5s passed since a unit was added to our GC queue, make sure to run a gc sweep */ | |
94b6dfa2 | 66 | #define GC_QUEUE_USEC_MAX (10*USEC_PER_SEC) |
701cc384 | 67 | |
8c47c732 | 68 | /* Where clients shall send notification messages to */ |
2b583ce6 | 69 | #define NOTIFY_SOCKET_SYSTEM "/run/systemd/notify" |
91b22f21 | 70 | #define NOTIFY_SOCKET_USER "@/org/freedesktop/systemd1/notify" |
8c47c732 LP |
71 | |
72 | static int manager_setup_notify(Manager *m) { | |
73 | union { | |
74 | struct sockaddr sa; | |
75 | struct sockaddr_un un; | |
76 | } sa; | |
77 | struct epoll_event ev; | |
8c47c732 LP |
78 | int one = 1; |
79 | ||
80 | assert(m); | |
81 | ||
82 | m->notify_watch.type = WATCH_NOTIFY; | |
83 | if ((m->notify_watch.fd = socket(AF_UNIX, SOCK_DGRAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0)) < 0) { | |
84 | log_error("Failed to allocate notification socket: %m"); | |
85 | return -errno; | |
86 | } | |
87 | ||
88 | zero(sa); | |
89 | sa.sa.sa_family = AF_UNIX; | |
90 | ||
a821caaa | 91 | if (getpid() != 1) |
91b22f21 | 92 | snprintf(sa.un.sun_path, sizeof(sa.un.sun_path), NOTIFY_SOCKET_USER "/%llu", random_ull()); |
6f79c579 LP |
93 | else { |
94 | unlink(NOTIFY_SOCKET_SYSTEM); | |
91b22f21 | 95 | strncpy(sa.un.sun_path, NOTIFY_SOCKET_SYSTEM, sizeof(sa.un.sun_path)); |
6f79c579 | 96 | } |
91b22f21 LP |
97 | |
98 | if (sa.un.sun_path[0] == '@') | |
99 | sa.un.sun_path[0] = 0; | |
8c47c732 | 100 | |
0e098b15 | 101 | if (bind(m->notify_watch.fd, &sa.sa, offsetof(struct sockaddr_un, sun_path) + 1 + strlen(sa.un.sun_path+1)) < 0) { |
8c47c732 LP |
102 | log_error("bind() failed: %m"); |
103 | return -errno; | |
104 | } | |
105 | ||
106 | if (setsockopt(m->notify_watch.fd, SOL_SOCKET, SO_PASSCRED, &one, sizeof(one)) < 0) { | |
107 | log_error("SO_PASSCRED failed: %m"); | |
108 | return -errno; | |
109 | } | |
110 | ||
111 | zero(ev); | |
112 | ev.events = EPOLLIN; | |
113 | ev.data.ptr = &m->notify_watch; | |
114 | ||
115 | if (epoll_ctl(m->epoll_fd, EPOLL_CTL_ADD, m->notify_watch.fd, &ev) < 0) | |
116 | return -errno; | |
117 | ||
91b22f21 LP |
118 | if (sa.un.sun_path[0] == 0) |
119 | sa.un.sun_path[0] = '@'; | |
120 | ||
121 | if (!(m->notify_socket = strdup(sa.un.sun_path))) | |
8c47c732 LP |
122 | return -ENOMEM; |
123 | ||
b2bb3dbe LP |
124 | log_debug("Using notification socket %s", m->notify_socket); |
125 | ||
8c47c732 LP |
126 | return 0; |
127 | } | |
128 | ||
80876c20 LP |
129 | static int enable_special_signals(Manager *m) { |
130 | char fd; | |
131 | ||
132 | assert(m); | |
133 | ||
134 | /* Enable that we get SIGINT on control-alt-del */ | |
135 | if (reboot(RB_DISABLE_CAD) < 0) | |
136 | log_warning("Failed to enable ctrl-alt-del handling: %m"); | |
137 | ||
affda787 | 138 | if ((fd = open_terminal("/dev/tty0", O_RDWR|O_NOCTTY)) < 0) |
80876c20 LP |
139 | log_warning("Failed to open /dev/tty0: %m"); |
140 | else { | |
141 | /* Enable that we get SIGWINCH on kbrequest */ | |
142 | if (ioctl(fd, KDSIGACCEPT, SIGWINCH) < 0) | |
143 | log_warning("Failed to enable kbrequest handling: %s", strerror(errno)); | |
144 | ||
145 | close_nointr_nofail(fd); | |
146 | } | |
147 | ||
148 | return 0; | |
149 | } | |
150 | ||
ce578209 | 151 | static int manager_setup_signals(Manager *m) { |
9152c765 LP |
152 | sigset_t mask; |
153 | struct epoll_event ev; | |
57c0c30e | 154 | struct sigaction sa; |
60918275 | 155 | |
ce578209 LP |
156 | assert(m); |
157 | ||
57c0c30e LP |
158 | /* We are not interested in SIGSTOP and friends. */ |
159 | zero(sa); | |
160 | sa.sa_handler = SIG_DFL; | |
161 | sa.sa_flags = SA_NOCLDSTOP|SA_RESTART; | |
162 | assert_se(sigaction(SIGCHLD, &sa, NULL) == 0); | |
163 | ||
ce578209 | 164 | assert_se(sigemptyset(&mask) == 0); |
7d793605 LP |
165 | |
166 | sigset_add_many(&mask, | |
167 | SIGCHLD, /* Child died */ | |
168 | SIGTERM, /* Reexecute daemon */ | |
169 | SIGHUP, /* Reload configuration */ | |
170 | SIGUSR1, /* systemd/upstart: reconnect to D-Bus */ | |
171 | SIGUSR2, /* systemd: dump status */ | |
172 | SIGINT, /* Kernel sends us this on control-alt-del */ | |
173 | SIGWINCH, /* Kernel sends us this on kbrequest (alt-arrowup) */ | |
174 | SIGPWR, /* Some kernel drivers and upsd send us this on power failure */ | |
175 | SIGRTMIN+0, /* systemd: start default.target */ | |
0003d1ab | 176 | SIGRTMIN+1, /* systemd: isolate rescue.target */ |
7d793605 LP |
177 | SIGRTMIN+2, /* systemd: isolate emergency.target */ |
178 | SIGRTMIN+3, /* systemd: start halt.target */ | |
179 | SIGRTMIN+4, /* systemd: start poweroff.target */ | |
180 | SIGRTMIN+5, /* systemd: start reboot.target */ | |
0003d1ab LP |
181 | SIGRTMIN+6, /* systemd: start kexec.target */ |
182 | SIGRTMIN+13, /* systemd: Immediate halt */ | |
183 | SIGRTMIN+14, /* systemd: Immediate poweroff */ | |
184 | SIGRTMIN+15, /* systemd: Immediate reboot */ | |
185 | SIGRTMIN+16, /* systemd: Immediate kexec */ | |
0658666b LP |
186 | SIGRTMIN+20, /* systemd: enable status messages */ |
187 | SIGRTMIN+21, /* systemd: disable status messages */ | |
7d793605 | 188 | -1); |
ce578209 LP |
189 | assert_se(sigprocmask(SIG_SETMASK, &mask, NULL) == 0); |
190 | ||
ef734fd6 | 191 | m->signal_watch.type = WATCH_SIGNAL; |
ce578209 LP |
192 | if ((m->signal_watch.fd = signalfd(-1, &mask, SFD_NONBLOCK|SFD_CLOEXEC)) < 0) |
193 | return -errno; | |
194 | ||
195 | zero(ev); | |
196 | ev.events = EPOLLIN; | |
197 | ev.data.ptr = &m->signal_watch; | |
198 | ||
199 | if (epoll_ctl(m->epoll_fd, EPOLL_CTL_ADD, m->signal_watch.fd, &ev) < 0) | |
200 | return -errno; | |
201 | ||
a3d4e06d | 202 | if (m->running_as == MANAGER_SYSTEM) |
80876c20 | 203 | return enable_special_signals(m); |
e1414003 | 204 | |
ce578209 LP |
205 | return 0; |
206 | } | |
207 | ||
9e58ff9c | 208 | int manager_new(ManagerRunningAs running_as, Manager **_m) { |
ce578209 | 209 | Manager *m; |
8e274523 LP |
210 | int r = -ENOMEM; |
211 | ||
212 | assert(_m); | |
a5dab5ce LP |
213 | assert(running_as >= 0); |
214 | assert(running_as < _MANAGER_RUNNING_AS_MAX); | |
ce578209 | 215 | |
60918275 | 216 | if (!(m = new0(Manager, 1))) |
8e274523 | 217 | return -ENOMEM; |
60918275 | 218 | |
63983207 | 219 | dual_timestamp_get(&m->startup_timestamp); |
e537352b | 220 | |
a5dab5ce | 221 | m->running_as = running_as; |
a567261a | 222 | m->name_data_slot = m->subscribed_data_slot = -1; |
a16e1123 | 223 | m->exit_code = _MANAGER_EXIT_CODE_INVALID; |
33be102a | 224 | m->pin_cgroupfs_fd = -1; |
80876c20 | 225 | |
4927fcae LP |
226 | #ifdef HAVE_AUDIT |
227 | m->audit_fd = -1; | |
228 | #endif | |
229 | ||
4e434314 | 230 | m->signal_watch.fd = m->mount_watch.fd = m->udev_watch.fd = m->epoll_fd = m->dev_autofs_fd = m->swap_watch.fd = -1; |
ea430986 | 231 | m->current_job_id = 1; /* start as id #1, so that we can leave #0 around as "null-like" value */ |
9152c765 | 232 | |
1137a57c LP |
233 | if (!(m->environment = strv_copy(environ))) |
234 | goto fail; | |
235 | ||
06d4c99a LP |
236 | if (!(m->default_controllers = strv_new("cpu", NULL))) |
237 | goto fail; | |
238 | ||
87f0e418 | 239 | if (!(m->units = hashmap_new(string_hash_func, string_compare_func))) |
60918275 LP |
240 | goto fail; |
241 | ||
242 | if (!(m->jobs = hashmap_new(trivial_hash_func, trivial_compare_func))) | |
243 | goto fail; | |
244 | ||
e5b5ae50 | 245 | if (!(m->transaction_jobs = hashmap_new(trivial_hash_func, trivial_compare_func))) |
60918275 LP |
246 | goto fail; |
247 | ||
9152c765 LP |
248 | if (!(m->watch_pids = hashmap_new(trivial_hash_func, trivial_compare_func))) |
249 | goto fail; | |
250 | ||
8e274523 LP |
251 | if (!(m->cgroup_bondings = hashmap_new(string_hash_func, string_compare_func))) |
252 | goto fail; | |
253 | ||
05e343b7 LP |
254 | if (!(m->watch_bus = hashmap_new(string_hash_func, string_compare_func))) |
255 | goto fail; | |
256 | ||
9152c765 LP |
257 | if ((m->epoll_fd = epoll_create1(EPOLL_CLOEXEC)) < 0) |
258 | goto fail; | |
259 | ||
84e3543e | 260 | if ((r = lookup_paths_init(&m->lookup_paths, m->running_as)) < 0) |
e1414003 LP |
261 | goto fail; |
262 | ||
8e274523 LP |
263 | if ((r = manager_setup_signals(m)) < 0) |
264 | goto fail; | |
265 | ||
8e274523 | 266 | if ((r = manager_setup_cgroup(m)) < 0) |
9152c765 LP |
267 | goto fail; |
268 | ||
8c47c732 LP |
269 | if ((r = manager_setup_notify(m)) < 0) |
270 | goto fail; | |
271 | ||
f278026d | 272 | /* Try to connect to the busses, if possible. */ |
3996fbe2 | 273 | if ((r = bus_init(m, running_as != MANAGER_SYSTEM)) < 0) |
ea430986 LP |
274 | goto fail; |
275 | ||
e543deae | 276 | #ifdef HAVE_AUDIT |
4927fcae LP |
277 | if ((m->audit_fd = audit_open()) < 0) |
278 | log_error("Failed to connect to audit log: %m"); | |
e543deae | 279 | #endif |
4927fcae | 280 | |
72bc8d00 LP |
281 | m->taint_usr = dir_is_empty("/usr") > 0; |
282 | ||
8e274523 LP |
283 | *_m = m; |
284 | return 0; | |
60918275 LP |
285 | |
286 | fail: | |
287 | manager_free(m); | |
8e274523 | 288 | return r; |
60918275 LP |
289 | } |
290 | ||
23a177ef LP |
291 | static unsigned manager_dispatch_cleanup_queue(Manager *m) { |
292 | Meta *meta; | |
293 | unsigned n = 0; | |
294 | ||
295 | assert(m); | |
296 | ||
297 | while ((meta = m->cleanup_queue)) { | |
298 | assert(meta->in_cleanup_queue); | |
299 | ||
399ab2b1 | 300 | unit_free((Unit*) meta); |
23a177ef LP |
301 | n++; |
302 | } | |
303 | ||
304 | return n; | |
305 | } | |
306 | ||
eced69b3 | 307 | enum { |
35b8ca3a | 308 | GC_OFFSET_IN_PATH, /* This one is on the path we were traveling */ |
eced69b3 LP |
309 | GC_OFFSET_UNSURE, /* No clue */ |
310 | GC_OFFSET_GOOD, /* We still need this unit */ | |
311 | GC_OFFSET_BAD, /* We don't need this unit anymore */ | |
312 | _GC_OFFSET_MAX | |
313 | }; | |
314 | ||
315 | static void unit_gc_sweep(Unit *u, unsigned gc_marker) { | |
701cc384 LP |
316 | Iterator i; |
317 | Unit *other; | |
eced69b3 | 318 | bool is_bad; |
701cc384 LP |
319 | |
320 | assert(u); | |
321 | ||
eced69b3 LP |
322 | if (u->meta.gc_marker == gc_marker + GC_OFFSET_GOOD || |
323 | u->meta.gc_marker == gc_marker + GC_OFFSET_BAD || | |
324 | u->meta.gc_marker == gc_marker + GC_OFFSET_IN_PATH) | |
701cc384 LP |
325 | return; |
326 | ||
c9c0cadb | 327 | if (u->meta.in_cleanup_queue) |
701cc384 LP |
328 | goto bad; |
329 | ||
330 | if (unit_check_gc(u)) | |
331 | goto good; | |
332 | ||
eced69b3 LP |
333 | u->meta.gc_marker = gc_marker + GC_OFFSET_IN_PATH; |
334 | ||
335 | is_bad = true; | |
336 | ||
701cc384 LP |
337 | SET_FOREACH(other, u->meta.dependencies[UNIT_REFERENCED_BY], i) { |
338 | unit_gc_sweep(other, gc_marker); | |
339 | ||
eced69b3 | 340 | if (other->meta.gc_marker == gc_marker + GC_OFFSET_GOOD) |
701cc384 | 341 | goto good; |
eced69b3 LP |
342 | |
343 | if (other->meta.gc_marker != gc_marker + GC_OFFSET_BAD) | |
344 | is_bad = false; | |
701cc384 LP |
345 | } |
346 | ||
eced69b3 LP |
347 | if (is_bad) |
348 | goto bad; | |
349 | ||
350 | /* We were unable to find anything out about this entry, so | |
351 | * let's investigate it later */ | |
352 | u->meta.gc_marker = gc_marker + GC_OFFSET_UNSURE; | |
353 | unit_add_to_gc_queue(u); | |
354 | return; | |
355 | ||
701cc384 | 356 | bad: |
eced69b3 LP |
357 | /* We definitely know that this one is not useful anymore, so |
358 | * let's mark it for deletion */ | |
359 | u->meta.gc_marker = gc_marker + GC_OFFSET_BAD; | |
360 | unit_add_to_cleanup_queue(u); | |
701cc384 LP |
361 | return; |
362 | ||
363 | good: | |
eced69b3 | 364 | u->meta.gc_marker = gc_marker + GC_OFFSET_GOOD; |
701cc384 LP |
365 | } |
366 | ||
367 | static unsigned manager_dispatch_gc_queue(Manager *m) { | |
368 | Meta *meta; | |
369 | unsigned n = 0; | |
eced69b3 | 370 | unsigned gc_marker; |
701cc384 LP |
371 | |
372 | assert(m); | |
373 | ||
374 | if ((m->n_in_gc_queue < GC_QUEUE_ENTRIES_MAX) && | |
375 | (m->gc_queue_timestamp <= 0 || | |
376 | (m->gc_queue_timestamp + GC_QUEUE_USEC_MAX) > now(CLOCK_MONOTONIC))) | |
377 | return 0; | |
378 | ||
379 | log_debug("Running GC..."); | |
380 | ||
eced69b3 LP |
381 | m->gc_marker += _GC_OFFSET_MAX; |
382 | if (m->gc_marker + _GC_OFFSET_MAX <= _GC_OFFSET_MAX) | |
c9c0cadb | 383 | m->gc_marker = 1; |
701cc384 | 384 | |
eced69b3 LP |
385 | gc_marker = m->gc_marker; |
386 | ||
701cc384 LP |
387 | while ((meta = m->gc_queue)) { |
388 | assert(meta->in_gc_queue); | |
389 | ||
399ab2b1 | 390 | unit_gc_sweep((Unit*) meta, gc_marker); |
eced69b3 | 391 | |
701cc384 LP |
392 | LIST_REMOVE(Meta, gc_queue, m->gc_queue, meta); |
393 | meta->in_gc_queue = false; | |
394 | ||
395 | n++; | |
396 | ||
eced69b3 LP |
397 | if (meta->gc_marker == gc_marker + GC_OFFSET_BAD || |
398 | meta->gc_marker == gc_marker + GC_OFFSET_UNSURE) { | |
701cc384 | 399 | log_debug("Collecting %s", meta->id); |
eced69b3 | 400 | meta->gc_marker = gc_marker + GC_OFFSET_BAD; |
399ab2b1 | 401 | unit_add_to_cleanup_queue((Unit*) meta); |
701cc384 LP |
402 | } |
403 | } | |
404 | ||
405 | m->n_in_gc_queue = 0; | |
406 | m->gc_queue_timestamp = 0; | |
407 | ||
408 | return n; | |
409 | } | |
410 | ||
a16e1123 | 411 | static void manager_clear_jobs_and_units(Manager *m) { |
e5b5ae50 | 412 | Job *j; |
a16e1123 | 413 | Unit *u; |
60918275 LP |
414 | |
415 | assert(m); | |
416 | ||
87f0e418 | 417 | while ((j = hashmap_first(m->transaction_jobs))) |
e5b5ae50 LP |
418 | job_free(j); |
419 | ||
87f0e418 LP |
420 | while ((u = hashmap_first(m->units))) |
421 | unit_free(u); | |
964e0949 LP |
422 | |
423 | manager_dispatch_cleanup_queue(m); | |
424 | ||
425 | assert(!m->load_queue); | |
426 | assert(!m->run_queue); | |
427 | assert(!m->dbus_unit_queue); | |
428 | assert(!m->dbus_job_queue); | |
429 | assert(!m->cleanup_queue); | |
430 | assert(!m->gc_queue); | |
431 | ||
432 | assert(hashmap_isempty(m->transaction_jobs)); | |
433 | assert(hashmap_isempty(m->jobs)); | |
434 | assert(hashmap_isempty(m->units)); | |
a16e1123 LP |
435 | } |
436 | ||
437 | void manager_free(Manager *m) { | |
438 | UnitType c; | |
87f0e418 | 439 | |
a16e1123 LP |
440 | assert(m); |
441 | ||
442 | manager_clear_jobs_and_units(m); | |
23a177ef | 443 | |
7824bbeb LP |
444 | for (c = 0; c < _UNIT_TYPE_MAX; c++) |
445 | if (unit_vtable[c]->shutdown) | |
446 | unit_vtable[c]->shutdown(m); | |
447 | ||
a16e1123 LP |
448 | /* If we reexecute ourselves, we keep the root cgroup |
449 | * around */ | |
c6c18be3 | 450 | manager_shutdown_cgroup(m, m->exit_code != MANAGER_REEXECUTE); |
8e274523 | 451 | |
5a1e9937 LP |
452 | manager_undo_generators(m); |
453 | ||
5e8d1c9a | 454 | bus_done(m); |
ea430986 | 455 | |
87f0e418 | 456 | hashmap_free(m->units); |
60918275 | 457 | hashmap_free(m->jobs); |
e5b5ae50 | 458 | hashmap_free(m->transaction_jobs); |
9152c765 | 459 | hashmap_free(m->watch_pids); |
05e343b7 | 460 | hashmap_free(m->watch_bus); |
9152c765 LP |
461 | |
462 | if (m->epoll_fd >= 0) | |
a16e1123 | 463 | close_nointr_nofail(m->epoll_fd); |
acbb0225 | 464 | if (m->signal_watch.fd >= 0) |
a16e1123 | 465 | close_nointr_nofail(m->signal_watch.fd); |
8c47c732 LP |
466 | if (m->notify_watch.fd >= 0) |
467 | close_nointr_nofail(m->notify_watch.fd); | |
60918275 | 468 | |
4927fcae LP |
469 | #ifdef HAVE_AUDIT |
470 | if (m->audit_fd >= 0) | |
471 | audit_close(m->audit_fd); | |
472 | #endif | |
473 | ||
c952c6ec LP |
474 | free(m->notify_socket); |
475 | ||
84e3543e | 476 | lookup_paths_free(&m->lookup_paths); |
1137a57c | 477 | strv_free(m->environment); |
036643a2 | 478 | |
06d4c99a LP |
479 | strv_free(m->default_controllers); |
480 | ||
8e274523 | 481 | hashmap_free(m->cgroup_bondings); |
c6c18be3 | 482 | set_free_free(m->unit_path_cache); |
33be102a | 483 | |
60918275 LP |
484 | free(m); |
485 | } | |
486 | ||
a16e1123 LP |
487 | int manager_enumerate(Manager *m) { |
488 | int r = 0, q; | |
f50e0a01 | 489 | UnitType c; |
f50e0a01 LP |
490 | |
491 | assert(m); | |
492 | ||
a16e1123 LP |
493 | /* Let's ask every type to load all units from disk/kernel |
494 | * that it might know */ | |
f50e0a01 LP |
495 | for (c = 0; c < _UNIT_TYPE_MAX; c++) |
496 | if (unit_vtable[c]->enumerate) | |
a16e1123 LP |
497 | if ((q = unit_vtable[c]->enumerate(m)) < 0) |
498 | r = q; | |
f50e0a01 LP |
499 | |
500 | manager_dispatch_load_queue(m); | |
a16e1123 LP |
501 | return r; |
502 | } | |
503 | ||
504 | int manager_coldplug(Manager *m) { | |
505 | int r = 0, q; | |
506 | Iterator i; | |
507 | Unit *u; | |
508 | char *k; | |
509 | ||
510 | assert(m); | |
f50e0a01 LP |
511 | |
512 | /* Then, let's set up their initial state. */ | |
513 | HASHMAP_FOREACH_KEY(u, k, m->units, i) { | |
514 | ||
515 | /* ignore aliases */ | |
9e2f7c11 | 516 | if (u->meta.id != k) |
f50e0a01 LP |
517 | continue; |
518 | ||
cca098b0 LP |
519 | if ((q = unit_coldplug(u)) < 0) |
520 | r = q; | |
f50e0a01 LP |
521 | } |
522 | ||
a16e1123 LP |
523 | return r; |
524 | } | |
525 | ||
fe51822e LP |
526 | static void manager_build_unit_path_cache(Manager *m) { |
527 | char **i; | |
528 | DIR *d = NULL; | |
529 | int r; | |
530 | ||
531 | assert(m); | |
532 | ||
533 | set_free_free(m->unit_path_cache); | |
534 | ||
535 | if (!(m->unit_path_cache = set_new(string_hash_func, string_compare_func))) { | |
536 | log_error("Failed to allocate unit path cache."); | |
537 | return; | |
538 | } | |
539 | ||
540 | /* This simply builds a list of files we know exist, so that | |
541 | * we don't always have to go to disk */ | |
542 | ||
543 | STRV_FOREACH(i, m->lookup_paths.unit_path) { | |
544 | struct dirent *de; | |
545 | ||
546 | if (!(d = opendir(*i))) { | |
547 | log_error("Failed to open directory: %m"); | |
548 | continue; | |
549 | } | |
550 | ||
551 | while ((de = readdir(d))) { | |
552 | char *p; | |
553 | ||
554 | if (ignore_file(de->d_name)) | |
555 | continue; | |
556 | ||
557 | if (asprintf(&p, "%s/%s", streq(*i, "/") ? "" : *i, de->d_name) < 0) { | |
558 | r = -ENOMEM; | |
559 | goto fail; | |
560 | } | |
561 | ||
562 | if ((r = set_put(m->unit_path_cache, p)) < 0) { | |
563 | free(p); | |
564 | goto fail; | |
565 | } | |
566 | } | |
567 | ||
568 | closedir(d); | |
569 | d = NULL; | |
570 | } | |
571 | ||
572 | return; | |
573 | ||
574 | fail: | |
575 | log_error("Failed to build unit path cache: %s", strerror(-r)); | |
576 | ||
577 | set_free_free(m->unit_path_cache); | |
578 | m->unit_path_cache = NULL; | |
579 | ||
580 | if (d) | |
581 | closedir(d); | |
582 | } | |
583 | ||
a16e1123 LP |
584 | int manager_startup(Manager *m, FILE *serialization, FDSet *fds) { |
585 | int r, q; | |
586 | ||
587 | assert(m); | |
588 | ||
5a1e9937 LP |
589 | manager_run_generators(m); |
590 | ||
fe51822e LP |
591 | manager_build_unit_path_cache(m); |
592 | ||
9f611ad8 LP |
593 | /* If we will deserialize make sure that during enumeration |
594 | * this is already known, so we increase the counter here | |
595 | * already */ | |
596 | if (serialization) | |
597 | m->n_deserializing ++; | |
598 | ||
a16e1123 LP |
599 | /* First, enumerate what we can from all config files */ |
600 | r = manager_enumerate(m); | |
601 | ||
602 | /* Second, deserialize if there is something to deserialize */ | |
603 | if (serialization) | |
604 | if ((q = manager_deserialize(m, serialization, fds)) < 0) | |
605 | r = q; | |
606 | ||
607 | /* Third, fire things up! */ | |
608 | if ((q = manager_coldplug(m)) < 0) | |
609 | r = q; | |
610 | ||
9f611ad8 LP |
611 | if (serialization) { |
612 | assert(m->n_deserializing > 0); | |
613 | m->n_deserializing --; | |
614 | } | |
615 | ||
a16e1123 | 616 | return r; |
f50e0a01 LP |
617 | } |
618 | ||
23a177ef | 619 | static void transaction_delete_job(Manager *m, Job *j, bool delete_dependencies) { |
302d0040 LP |
620 | assert(m); |
621 | assert(j); | |
622 | ||
1ffba6fe LP |
623 | /* Deletes one job from the transaction */ |
624 | ||
23a177ef | 625 | manager_transaction_unlink_job(m, j, delete_dependencies); |
302d0040 | 626 | |
ac1135be | 627 | if (!j->installed) |
302d0040 LP |
628 | job_free(j); |
629 | } | |
630 | ||
87f0e418 | 631 | static void transaction_delete_unit(Manager *m, Unit *u) { |
1ffba6fe LP |
632 | Job *j; |
633 | ||
87f0e418 | 634 | /* Deletes all jobs associated with a certain unit from the |
1ffba6fe LP |
635 | * transaction */ |
636 | ||
87f0e418 | 637 | while ((j = hashmap_get(m->transaction_jobs, u))) |
23a177ef | 638 | transaction_delete_job(m, j, true); |
1ffba6fe LP |
639 | } |
640 | ||
f04fa1d5 LP |
641 | static void transaction_clean_dependencies(Manager *m) { |
642 | Iterator i; | |
643 | Job *j; | |
644 | ||
645 | assert(m); | |
646 | ||
647 | /* Drops all dependencies of all installed jobs */ | |
648 | ||
649 | HASHMAP_FOREACH(j, m->jobs, i) { | |
650 | while (j->subject_list) | |
651 | job_dependency_free(j->subject_list); | |
652 | while (j->object_list) | |
653 | job_dependency_free(j->object_list); | |
654 | } | |
655 | ||
656 | assert(!m->transaction_anchor); | |
657 | } | |
658 | ||
11dd41ce LP |
659 | static void transaction_abort(Manager *m) { |
660 | Job *j; | |
661 | ||
662 | assert(m); | |
11dd41ce | 663 | |
e5b5ae50 | 664 | while ((j = hashmap_first(m->transaction_jobs))) |
ac1135be | 665 | if (j->installed) |
23a177ef | 666 | transaction_delete_job(m, j, true); |
e5b5ae50 LP |
667 | else |
668 | job_free(j); | |
669 | ||
670 | assert(hashmap_isempty(m->transaction_jobs)); | |
f04fa1d5 LP |
671 | |
672 | transaction_clean_dependencies(m); | |
e5b5ae50 LP |
673 | } |
674 | ||
675 | static void transaction_find_jobs_that_matter_to_anchor(Manager *m, Job *j, unsigned generation) { | |
676 | JobDependency *l; | |
677 | ||
678 | assert(m); | |
679 | ||
87f0e418 | 680 | /* A recursive sweep through the graph that marks all units |
1ffba6fe LP |
681 | * that matter to the anchor job, i.e. are directly or |
682 | * indirectly a dependency of the anchor job via paths that | |
683 | * are fully marked as mattering. */ | |
684 | ||
44d8db9e LP |
685 | if (j) |
686 | l = j->subject_list; | |
687 | else | |
688 | l = m->transaction_anchor; | |
689 | ||
690 | LIST_FOREACH(subject, l, l) { | |
e5b5ae50 LP |
691 | |
692 | /* This link does not matter */ | |
693 | if (!l->matters) | |
694 | continue; | |
695 | ||
87f0e418 | 696 | /* This unit has already been marked */ |
e5b5ae50 LP |
697 | if (l->object->generation == generation) |
698 | continue; | |
699 | ||
700 | l->object->matters_to_anchor = true; | |
701 | l->object->generation = generation; | |
702 | ||
703 | transaction_find_jobs_that_matter_to_anchor(m, l->object, generation); | |
704 | } | |
705 | } | |
706 | ||
7fad411c | 707 | static void transaction_merge_and_delete_job(Manager *m, Job *j, Job *other, JobType t) { |
e5b5ae50 LP |
708 | JobDependency *l, *last; |
709 | ||
710 | assert(j); | |
711 | assert(other); | |
87f0e418 | 712 | assert(j->unit == other->unit); |
ac1135be | 713 | assert(!j->installed); |
e5b5ae50 | 714 | |
1ffba6fe LP |
715 | /* Merges 'other' into 'j' and then deletes j. */ |
716 | ||
e5b5ae50 LP |
717 | j->type = t; |
718 | j->state = JOB_WAITING; | |
9e2f7c11 | 719 | j->override = j->override || other->override; |
e5b5ae50 LP |
720 | |
721 | j->matters_to_anchor = j->matters_to_anchor || other->matters_to_anchor; | |
722 | ||
723 | /* Patch us in as new owner of the JobDependency objects */ | |
724 | last = NULL; | |
44d8db9e | 725 | LIST_FOREACH(subject, l, other->subject_list) { |
e5b5ae50 LP |
726 | assert(l->subject == other); |
727 | l->subject = j; | |
728 | last = l; | |
729 | } | |
730 | ||
731 | /* Merge both lists */ | |
732 | if (last) { | |
733 | last->subject_next = j->subject_list; | |
734 | if (j->subject_list) | |
735 | j->subject_list->subject_prev = last; | |
736 | j->subject_list = other->subject_list; | |
737 | } | |
738 | ||
739 | /* Patch us in as new owner of the JobDependency objects */ | |
740 | last = NULL; | |
44d8db9e | 741 | LIST_FOREACH(object, l, other->object_list) { |
e5b5ae50 LP |
742 | assert(l->object == other); |
743 | l->object = j; | |
744 | last = l; | |
745 | } | |
746 | ||
747 | /* Merge both lists */ | |
748 | if (last) { | |
749 | last->object_next = j->object_list; | |
750 | if (j->object_list) | |
751 | j->object_list->object_prev = last; | |
752 | j->object_list = other->object_list; | |
753 | } | |
754 | ||
e5b5ae50 LP |
755 | /* Kill the other job */ |
756 | other->subject_list = NULL; | |
757 | other->object_list = NULL; | |
23a177ef | 758 | transaction_delete_job(m, other, true); |
e5b5ae50 | 759 | } |
69dd2852 LP |
760 | static bool job_is_conflicted_by(Job *j) { |
761 | JobDependency *l; | |
762 | ||
763 | assert(j); | |
764 | ||
765 | /* Returns true if this job is pulled in by a least one | |
766 | * ConflictedBy dependency. */ | |
767 | ||
768 | LIST_FOREACH(object, l, j->object_list) | |
769 | if (l->conflicts) | |
770 | return true; | |
771 | ||
772 | return false; | |
773 | } | |
e5b5ae50 | 774 | |
5cb5a6ff | 775 | static int delete_one_unmergeable_job(Manager *m, Job *j) { |
1ffba6fe LP |
776 | Job *k; |
777 | ||
778 | assert(j); | |
779 | ||
780 | /* Tries to delete one item in the linked list | |
781 | * j->transaction_next->transaction_next->... that conflicts | |
35b8ca3a | 782 | * with another one, in an attempt to make an inconsistent |
1ffba6fe LP |
783 | * transaction work. */ |
784 | ||
785 | /* We rely here on the fact that if a merged with b does not | |
786 | * merge with c, either a or b merge with c neither */ | |
034c6ed7 LP |
787 | LIST_FOREACH(transaction, j, j) |
788 | LIST_FOREACH(transaction, k, j->transaction_next) { | |
1ffba6fe LP |
789 | Job *d; |
790 | ||
791 | /* Is this one mergeable? Then skip it */ | |
5cb5a6ff | 792 | if (job_type_is_mergeable(j->type, k->type)) |
1ffba6fe LP |
793 | continue; |
794 | ||
795 | /* Ok, we found two that conflict, let's see if we can | |
796 | * drop one of them */ | |
69dd2852 LP |
797 | if (!j->matters_to_anchor && !k->matters_to_anchor) { |
798 | ||
799 | /* Both jobs don't matter, so let's | |
800 | * find the one that is smarter to | |
801 | * remove. Let's think positive and | |
802 | * rather remove stops then starts -- | |
803 | * except if something is being | |
804 | * stopped because it is conflicted by | |
805 | * another unit in which case we | |
806 | * rather remove the start. */ | |
807 | ||
808 | log_debug("Looking at job %s/%s conflicted_by=%s", j->unit->meta.id, job_type_to_string(j->type), yes_no(j->type == JOB_STOP && job_is_conflicted_by(j))); | |
809 | log_debug("Looking at job %s/%s conflicted_by=%s", k->unit->meta.id, job_type_to_string(k->type), yes_no(k->type == JOB_STOP && job_is_conflicted_by(k))); | |
810 | ||
811 | if (j->type == JOB_STOP) { | |
812 | ||
813 | if (job_is_conflicted_by(j)) | |
814 | d = k; | |
815 | else | |
816 | d = j; | |
817 | ||
818 | } else if (k->type == JOB_STOP) { | |
819 | ||
820 | if (job_is_conflicted_by(k)) | |
821 | d = j; | |
822 | else | |
823 | d = k; | |
e364ad06 LP |
824 | } else |
825 | d = j; | |
69dd2852 LP |
826 | |
827 | } else if (!j->matters_to_anchor) | |
1ffba6fe LP |
828 | d = j; |
829 | else if (!k->matters_to_anchor) | |
830 | d = k; | |
831 | else | |
832 | return -ENOEXEC; | |
833 | ||
834 | /* Ok, we can drop one, so let's do so. */ | |
2e81c8a5 | 835 | log_debug("Fixing conflicting jobs by deleting job %s/%s", d->unit->meta.id, job_type_to_string(d->type)); |
23a177ef | 836 | transaction_delete_job(m, d, true); |
1ffba6fe LP |
837 | return 0; |
838 | } | |
839 | ||
840 | return -EINVAL; | |
841 | } | |
842 | ||
398ef8ba | 843 | static int transaction_merge_jobs(Manager *m, DBusError *e) { |
11dd41ce | 844 | Job *j; |
034c6ed7 | 845 | Iterator i; |
e5b5ae50 LP |
846 | int r; |
847 | ||
848 | assert(m); | |
849 | ||
1ffba6fe LP |
850 | /* First step, check whether any of the jobs for one specific |
851 | * task conflict. If so, try to drop one of them. */ | |
034c6ed7 | 852 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
1ffba6fe LP |
853 | JobType t; |
854 | Job *k; | |
855 | ||
856 | t = j->type; | |
034c6ed7 | 857 | LIST_FOREACH(transaction, k, j->transaction_next) { |
e364ad06 | 858 | if (job_type_merge(&t, k->type) >= 0) |
1ffba6fe LP |
859 | continue; |
860 | ||
861 | /* OK, we could not merge all jobs for this | |
862 | * action. Let's see if we can get rid of one | |
863 | * of them */ | |
864 | ||
5cb5a6ff | 865 | if ((r = delete_one_unmergeable_job(m, j)) >= 0) |
1ffba6fe LP |
866 | /* Ok, we managed to drop one, now |
867 | * let's ask our callers to call us | |
868 | * again after garbage collecting */ | |
869 | return -EAGAIN; | |
870 | ||
871 | /* We couldn't merge anything. Failure */ | |
398ef8ba LP |
872 | dbus_set_error(e, BUS_ERROR_TRANSACTION_JOBS_CONFLICTING, "Transaction contains conflicting jobs '%s' and '%s' for %s. Probably contradicting requirement dependencies configured.", |
873 | job_type_to_string(t), job_type_to_string(k->type), k->unit->meta.id); | |
1ffba6fe LP |
874 | return r; |
875 | } | |
876 | } | |
877 | ||
878 | /* Second step, merge the jobs. */ | |
034c6ed7 | 879 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e5b5ae50 LP |
880 | JobType t = j->type; |
881 | Job *k; | |
882 | ||
e094e853 | 883 | /* Merge all transactions */ |
034c6ed7 | 884 | LIST_FOREACH(transaction, k, j->transaction_next) |
1ffba6fe | 885 | assert_se(job_type_merge(&t, k->type) == 0); |
e5b5ae50 | 886 | |
5cb5a6ff | 887 | /* If an active job is mergeable, merge it too */ |
87f0e418 LP |
888 | if (j->unit->meta.job) |
889 | job_type_merge(&t, j->unit->meta.job->type); /* Might fail. Which is OK */ | |
e094e853 | 890 | |
e5b5ae50 | 891 | while ((k = j->transaction_next)) { |
ac1135be | 892 | if (j->installed) { |
7fad411c | 893 | transaction_merge_and_delete_job(m, k, j, t); |
e5b5ae50 LP |
894 | j = k; |
895 | } else | |
7fad411c | 896 | transaction_merge_and_delete_job(m, j, k, t); |
e5b5ae50 LP |
897 | } |
898 | ||
899 | assert(!j->transaction_next); | |
900 | assert(!j->transaction_prev); | |
901 | } | |
902 | ||
7fad411c | 903 | return 0; |
e5b5ae50 LP |
904 | } |
905 | ||
23a177ef LP |
906 | static void transaction_drop_redundant(Manager *m) { |
907 | bool again; | |
908 | ||
909 | assert(m); | |
910 | ||
911 | /* Goes through the transaction and removes all jobs that are | |
912 | * a noop */ | |
913 | ||
914 | do { | |
915 | Job *j; | |
916 | Iterator i; | |
917 | ||
918 | again = false; | |
919 | ||
920 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { | |
921 | bool changes_something = false; | |
922 | Job *k; | |
923 | ||
924 | LIST_FOREACH(transaction, k, j) { | |
925 | ||
926 | if (!job_is_anchor(k) && | |
3aea3b35 LP |
927 | (k->installed || job_type_is_redundant(k->type, unit_active_state(k->unit))) && |
928 | (!k->unit->meta.job || !job_type_is_conflicting(k->type, k->unit->meta.job->type))) | |
23a177ef LP |
929 | continue; |
930 | ||
931 | changes_something = true; | |
932 | break; | |
933 | } | |
934 | ||
935 | if (changes_something) | |
936 | continue; | |
937 | ||
9b3d9090 | 938 | /* log_debug("Found redundant job %s/%s, dropping.", j->unit->meta.id, job_type_to_string(j->type)); */ |
23a177ef LP |
939 | transaction_delete_job(m, j, false); |
940 | again = true; | |
941 | break; | |
942 | } | |
943 | ||
944 | } while (again); | |
945 | } | |
946 | ||
87f0e418 LP |
947 | static bool unit_matters_to_anchor(Unit *u, Job *j) { |
948 | assert(u); | |
1ffba6fe LP |
949 | assert(!j->transaction_prev); |
950 | ||
87f0e418 | 951 | /* Checks whether at least one of the jobs for this unit |
1ffba6fe LP |
952 | * matters to the anchor. */ |
953 | ||
034c6ed7 | 954 | LIST_FOREACH(transaction, j, j) |
1ffba6fe LP |
955 | if (j->matters_to_anchor) |
956 | return true; | |
957 | ||
958 | return false; | |
959 | } | |
960 | ||
398ef8ba | 961 | static int transaction_verify_order_one(Manager *m, Job *j, Job *from, unsigned generation, DBusError *e) { |
034c6ed7 | 962 | Iterator i; |
87f0e418 | 963 | Unit *u; |
11dd41ce | 964 | int r; |
e5b5ae50 LP |
965 | |
966 | assert(m); | |
967 | assert(j); | |
1ffba6fe LP |
968 | assert(!j->transaction_prev); |
969 | ||
970 | /* Does a recursive sweep through the ordering graph, looking | |
971 | * for a cycle. If we find cycle we try to break it. */ | |
e5b5ae50 | 972 | |
23e3c588 LP |
973 | /* Have we seen this before? */ |
974 | if (j->generation == generation) { | |
674a6e4d | 975 | Job *k, *delete; |
e5b5ae50 | 976 | |
23e3c588 LP |
977 | /* If the marker is NULL we have been here already and |
978 | * decided the job was loop-free from here. Hence | |
979 | * shortcut things and return right-away. */ | |
980 | if (!j->marker) | |
981 | return 0; | |
e5b5ae50 | 982 | |
23e3c588 LP |
983 | /* So, the marker is not NULL and we already have been |
984 | * here. We have a cycle. Let's try to break it. We go | |
985 | * backwards in our path and try to find a suitable | |
986 | * job to remove. We use the marker to find our way | |
987 | * back, since smart how we are we stored our way back | |
988 | * in there. */ | |
54165a39 | 989 | log_warning("Found ordering cycle on %s/%s", j->unit->meta.id, job_type_to_string(j->type)); |
9f04bd52 | 990 | |
674a6e4d | 991 | delete = NULL; |
23e3c588 | 992 | for (k = from; k; k = ((k->generation == generation && k->marker != k) ? k->marker : NULL)) { |
1ffba6fe | 993 | |
54165a39 | 994 | log_info("Walked on cycle path to %s/%s", k->unit->meta.id, job_type_to_string(k->type)); |
9f04bd52 | 995 | |
674a6e4d LP |
996 | if (!delete && |
997 | !k->installed && | |
87f0e418 | 998 | !unit_matters_to_anchor(k->unit, k)) { |
1ffba6fe LP |
999 | /* Ok, we can drop this one, so let's |
1000 | * do so. */ | |
674a6e4d | 1001 | delete = k; |
e5b5ae50 LP |
1002 | } |
1003 | ||
1004 | /* Check if this in fact was the beginning of | |
7fad411c | 1005 | * the cycle */ |
e5b5ae50 LP |
1006 | if (k == j) |
1007 | break; | |
1008 | } | |
1009 | ||
674a6e4d LP |
1010 | |
1011 | if (delete) { | |
54ec68b6 | 1012 | log_warning("Breaking ordering cycle by deleting job %s/%s", delete->unit->meta.id, job_type_to_string(delete->type)); |
674a6e4d LP |
1013 | transaction_delete_unit(m, delete->unit); |
1014 | return -EAGAIN; | |
1015 | } | |
1016 | ||
54165a39 | 1017 | log_error("Unable to break cycle"); |
9f04bd52 | 1018 | |
fe71c02c | 1019 | dbus_set_error(e, BUS_ERROR_TRANSACTION_ORDER_IS_CYCLIC, "Transaction order is cyclic. See system logs for details."); |
1ffba6fe | 1020 | return -ENOEXEC; |
e5b5ae50 LP |
1021 | } |
1022 | ||
1ffba6fe | 1023 | /* Make the marker point to where we come from, so that we can |
23e3c588 LP |
1024 | * find our way backwards if we want to break a cycle. We use |
1025 | * a special marker for the beginning: we point to | |
1026 | * ourselves. */ | |
1027 | j->marker = from ? from : j; | |
e5b5ae50 LP |
1028 | j->generation = generation; |
1029 | ||
1ffba6fe | 1030 | /* We assume that the the dependencies are bidirectional, and |
87f0e418 LP |
1031 | * hence can ignore UNIT_AFTER */ |
1032 | SET_FOREACH(u, j->unit->meta.dependencies[UNIT_BEFORE], i) { | |
e5b5ae50 LP |
1033 | Job *o; |
1034 | ||
87f0e418 LP |
1035 | /* Is there a job for this unit? */ |
1036 | if (!(o = hashmap_get(m->transaction_jobs, u))) | |
1ffba6fe LP |
1037 | |
1038 | /* Ok, there is no job for this in the | |
1039 | * transaction, but maybe there is already one | |
1040 | * running? */ | |
87f0e418 | 1041 | if (!(o = u->meta.job)) |
e5b5ae50 LP |
1042 | continue; |
1043 | ||
398ef8ba | 1044 | if ((r = transaction_verify_order_one(m, o, j, generation, e)) < 0) |
e5b5ae50 LP |
1045 | return r; |
1046 | } | |
1047 | ||
9f04bd52 LP |
1048 | /* Ok, let's backtrack, and remember that this entry is not on |
1049 | * our path anymore. */ | |
1050 | j->marker = NULL; | |
1051 | ||
e5b5ae50 LP |
1052 | return 0; |
1053 | } | |
1054 | ||
398ef8ba | 1055 | static int transaction_verify_order(Manager *m, unsigned *generation, DBusError *e) { |
1ffba6fe LP |
1056 | Job *j; |
1057 | int r; | |
034c6ed7 | 1058 | Iterator i; |
23e3c588 | 1059 | unsigned g; |
1ffba6fe | 1060 | |
e5b5ae50 LP |
1061 | assert(m); |
1062 | assert(generation); | |
1063 | ||
1ffba6fe LP |
1064 | /* Check if the ordering graph is cyclic. If it is, try to fix |
1065 | * that up by dropping one of the jobs. */ | |
e5b5ae50 | 1066 | |
23e3c588 LP |
1067 | g = (*generation)++; |
1068 | ||
034c6ed7 | 1069 | HASHMAP_FOREACH(j, m->transaction_jobs, i) |
398ef8ba | 1070 | if ((r = transaction_verify_order_one(m, j, NULL, g, e)) < 0) |
1ffba6fe | 1071 | return r; |
e5b5ae50 LP |
1072 | |
1073 | return 0; | |
1074 | } | |
1075 | ||
1076 | static void transaction_collect_garbage(Manager *m) { | |
1077 | bool again; | |
1078 | ||
1079 | assert(m); | |
1080 | ||
1ffba6fe LP |
1081 | /* Drop jobs that are not required by any other job */ |
1082 | ||
e5b5ae50 | 1083 | do { |
034c6ed7 | 1084 | Iterator i; |
e5b5ae50 LP |
1085 | Job *j; |
1086 | ||
1087 | again = false; | |
1088 | ||
034c6ed7 | 1089 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
9b3d9090 LP |
1090 | if (j->object_list) { |
1091 | /* log_debug("Keeping job %s/%s because of %s/%s", */ | |
1092 | /* j->unit->meta.id, job_type_to_string(j->type), */ | |
1093 | /* j->object_list->subject ? j->object_list->subject->unit->meta.id : "root", */ | |
1094 | /* j->object_list->subject ? job_type_to_string(j->object_list->subject->type) : "root"); */ | |
e5b5ae50 | 1095 | continue; |
9b3d9090 | 1096 | } |
e5b5ae50 | 1097 | |
9b3d9090 | 1098 | /* log_debug("Garbage collecting job %s/%s", j->unit->meta.id, job_type_to_string(j->type)); */ |
23a177ef | 1099 | transaction_delete_job(m, j, true); |
e5b5ae50 LP |
1100 | again = true; |
1101 | break; | |
1102 | } | |
1103 | ||
1104 | } while (again); | |
1105 | } | |
1106 | ||
398ef8ba | 1107 | static int transaction_is_destructive(Manager *m, DBusError *e) { |
034c6ed7 | 1108 | Iterator i; |
e5b5ae50 | 1109 | Job *j; |
11dd41ce LP |
1110 | |
1111 | assert(m); | |
11dd41ce | 1112 | |
e5b5ae50 LP |
1113 | /* Checks whether applying this transaction means that |
1114 | * existing jobs would be replaced */ | |
11dd41ce | 1115 | |
034c6ed7 | 1116 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e094e853 LP |
1117 | |
1118 | /* Assume merged */ | |
1119 | assert(!j->transaction_prev); | |
1120 | assert(!j->transaction_next); | |
1121 | ||
87f0e418 LP |
1122 | if (j->unit->meta.job && |
1123 | j->unit->meta.job != j && | |
398ef8ba LP |
1124 | !job_type_is_superset(j->type, j->unit->meta.job->type)) { |
1125 | ||
1126 | dbus_set_error(e, BUS_ERROR_TRANSACTION_IS_DESTRUCTIVE, "Transaction is destructive."); | |
e5b5ae50 | 1127 | return -EEXIST; |
398ef8ba | 1128 | } |
e094e853 | 1129 | } |
11dd41ce | 1130 | |
e5b5ae50 LP |
1131 | return 0; |
1132 | } | |
1133 | ||
e094e853 LP |
1134 | static void transaction_minimize_impact(Manager *m) { |
1135 | bool again; | |
1136 | assert(m); | |
1137 | ||
1138 | /* Drops all unnecessary jobs that reverse already active jobs | |
1139 | * or that stop a running service. */ | |
1140 | ||
1141 | do { | |
1142 | Job *j; | |
034c6ed7 | 1143 | Iterator i; |
e094e853 LP |
1144 | |
1145 | again = false; | |
1146 | ||
034c6ed7 LP |
1147 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
1148 | LIST_FOREACH(transaction, j, j) { | |
c20cae32 | 1149 | bool stops_running_service, changes_existing_job; |
e094e853 LP |
1150 | |
1151 | /* If it matters, we shouldn't drop it */ | |
1152 | if (j->matters_to_anchor) | |
1153 | continue; | |
1154 | ||
1155 | /* Would this stop a running service? | |
1156 | * Would this change an existing job? | |
1157 | * If so, let's drop this entry */ | |
c20cae32 LP |
1158 | |
1159 | stops_running_service = | |
1160 | j->type == JOB_STOP && UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(j->unit)); | |
1161 | ||
1162 | changes_existing_job = | |
143072ed LP |
1163 | j->unit->meta.job && |
1164 | job_type_is_conflicting(j->type, j->unit->meta.job->type); | |
c20cae32 LP |
1165 | |
1166 | if (!stops_running_service && !changes_existing_job) | |
e094e853 LP |
1167 | continue; |
1168 | ||
c20cae32 | 1169 | if (stops_running_service) |
54165a39 | 1170 | log_info("%s/%s would stop a running service.", j->unit->meta.id, job_type_to_string(j->type)); |
c20cae32 LP |
1171 | |
1172 | if (changes_existing_job) | |
54165a39 | 1173 | log_info("%s/%s would change existing job.", j->unit->meta.id, job_type_to_string(j->type)); |
c20cae32 | 1174 | |
e094e853 | 1175 | /* Ok, let's get rid of this */ |
54165a39 | 1176 | log_info("Deleting %s/%s to minimize impact.", j->unit->meta.id, job_type_to_string(j->type)); |
c20cae32 | 1177 | |
23a177ef | 1178 | transaction_delete_job(m, j, true); |
e094e853 LP |
1179 | again = true; |
1180 | break; | |
1181 | } | |
1182 | ||
1183 | if (again) | |
1184 | break; | |
1185 | } | |
1186 | ||
1187 | } while (again); | |
1188 | } | |
1189 | ||
c497c7a9 | 1190 | static int transaction_apply(Manager *m) { |
034c6ed7 | 1191 | Iterator i; |
e5b5ae50 LP |
1192 | Job *j; |
1193 | int r; | |
1194 | ||
1ffba6fe LP |
1195 | /* Moves the transaction jobs to the set of active jobs */ |
1196 | ||
034c6ed7 | 1197 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e094e853 LP |
1198 | /* Assume merged */ |
1199 | assert(!j->transaction_prev); | |
1200 | assert(!j->transaction_next); | |
1201 | ||
ac1135be | 1202 | if (j->installed) |
e5b5ae50 LP |
1203 | continue; |
1204 | ||
1205 | if ((r = hashmap_put(m->jobs, UINT32_TO_PTR(j->id), j)) < 0) | |
11dd41ce LP |
1206 | goto rollback; |
1207 | } | |
1208 | ||
e5b5ae50 | 1209 | while ((j = hashmap_steal_first(m->transaction_jobs))) { |
9b3d9090 LP |
1210 | if (j->installed) { |
1211 | /* log_debug("Skipping already installed job %s/%s as %u", j->unit->meta.id, job_type_to_string(j->type), (unsigned) j->id); */ | |
e5b5ae50 | 1212 | continue; |
9b3d9090 | 1213 | } |
e5b5ae50 | 1214 | |
87f0e418 LP |
1215 | if (j->unit->meta.job) |
1216 | job_free(j->unit->meta.job); | |
11dd41ce | 1217 | |
87f0e418 | 1218 | j->unit->meta.job = j; |
ac1135be | 1219 | j->installed = true; |
e409f875 | 1220 | m->n_installed_jobs ++; |
11dd41ce | 1221 | |
e5b5ae50 LP |
1222 | /* We're fully installed. Now let's free data we don't |
1223 | * need anymore. */ | |
1224 | ||
1225 | assert(!j->transaction_next); | |
1226 | assert(!j->transaction_prev); | |
1227 | ||
c1e1601e LP |
1228 | job_add_to_run_queue(j); |
1229 | job_add_to_dbus_queue(j); | |
312732cf | 1230 | job_start_timer(j); |
28c3247e LP |
1231 | |
1232 | log_debug("Installed new job %s/%s as %u", j->unit->meta.id, job_type_to_string(j->type), (unsigned) j->id); | |
01184e04 LP |
1233 | } |
1234 | ||
1235 | /* As last step, kill all remaining job dependencies. */ | |
f04fa1d5 | 1236 | transaction_clean_dependencies(m); |
1ffba6fe | 1237 | |
11dd41ce LP |
1238 | return 0; |
1239 | ||
1240 | rollback: | |
1241 | ||
034c6ed7 | 1242 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
ac1135be | 1243 | if (j->installed) |
e5b5ae50 LP |
1244 | continue; |
1245 | ||
1246 | hashmap_remove(m->jobs, UINT32_TO_PTR(j->id)); | |
1247 | } | |
1248 | ||
1249 | return r; | |
1250 | } | |
1251 | ||
398ef8ba | 1252 | static int transaction_activate(Manager *m, JobMode mode, DBusError *e) { |
e5b5ae50 LP |
1253 | int r; |
1254 | unsigned generation = 1; | |
1255 | ||
1256 | assert(m); | |
1257 | ||
1258 | /* This applies the changes recorded in transaction_jobs to | |
1259 | * the actual list of jobs, if possible. */ | |
1260 | ||
1261 | /* First step: figure out which jobs matter */ | |
1262 | transaction_find_jobs_that_matter_to_anchor(m, NULL, generation++); | |
1263 | ||
e094e853 LP |
1264 | /* Second step: Try not to stop any running services if |
1265 | * we don't have to. Don't try to reverse running | |
1266 | * jobs if we don't have to. */ | |
143072ed | 1267 | if (mode == JOB_FAIL) |
c88e7f4e | 1268 | transaction_minimize_impact(m); |
e094e853 | 1269 | |
23a177ef LP |
1270 | /* Third step: Drop redundant jobs */ |
1271 | transaction_drop_redundant(m); | |
1272 | ||
1ffba6fe | 1273 | for (;;) { |
23a177ef | 1274 | /* Fourth step: Let's remove unneeded jobs that might |
1ffba6fe LP |
1275 | * be lurking. */ |
1276 | transaction_collect_garbage(m); | |
e5b5ae50 | 1277 | |
23a177ef | 1278 | /* Fifth step: verify order makes sense and correct |
1ffba6fe | 1279 | * cycles if necessary and possible */ |
398ef8ba | 1280 | if ((r = transaction_verify_order(m, &generation, e)) >= 0) |
1ffba6fe | 1281 | break; |
e5b5ae50 | 1282 | |
9f04bd52 | 1283 | if (r != -EAGAIN) { |
398ef8ba | 1284 | log_warning("Requested transaction contains an unfixable cyclic ordering dependency: %s", bus_error(e, r)); |
1ffba6fe | 1285 | goto rollback; |
9f04bd52 | 1286 | } |
e5b5ae50 | 1287 | |
1ffba6fe LP |
1288 | /* Let's see if the resulting transaction ordering |
1289 | * graph is still cyclic... */ | |
1290 | } | |
1291 | ||
1292 | for (;;) { | |
23a177ef | 1293 | /* Sixth step: let's drop unmergeable entries if |
1ffba6fe LP |
1294 | * necessary and possible, merge entries we can |
1295 | * merge */ | |
398ef8ba | 1296 | if ((r = transaction_merge_jobs(m, e)) >= 0) |
1ffba6fe LP |
1297 | break; |
1298 | ||
9f04bd52 | 1299 | if (r != -EAGAIN) { |
35b8ca3a | 1300 | log_warning("Requested transaction contains unmergeable jobs: %s", bus_error(e, r)); |
1ffba6fe | 1301 | goto rollback; |
9f04bd52 | 1302 | } |
1ffba6fe | 1303 | |
23a177ef | 1304 | /* Seventh step: an entry got dropped, let's garbage |
1ffba6fe LP |
1305 | * collect its dependencies. */ |
1306 | transaction_collect_garbage(m); | |
1307 | ||
1308 | /* Let's see if the resulting transaction still has | |
5cb5a6ff | 1309 | * unmergeable entries ... */ |
1ffba6fe LP |
1310 | } |
1311 | ||
23a177ef LP |
1312 | /* Eights step: Drop redundant jobs again, if the merging now allows us to drop more. */ |
1313 | transaction_drop_redundant(m); | |
1314 | ||
1315 | /* Ninth step: check whether we can actually apply this */ | |
e5b5ae50 | 1316 | if (mode == JOB_FAIL) |
398ef8ba LP |
1317 | if ((r = transaction_is_destructive(m, e)) < 0) { |
1318 | log_notice("Requested transaction contradicts existing jobs: %s", bus_error(e, r)); | |
e5b5ae50 | 1319 | goto rollback; |
9f04bd52 | 1320 | } |
e5b5ae50 | 1321 | |
23a177ef | 1322 | /* Tenth step: apply changes */ |
c497c7a9 | 1323 | if ((r = transaction_apply(m)) < 0) { |
54165a39 | 1324 | log_warning("Failed to apply transaction: %s", strerror(-r)); |
e5b5ae50 | 1325 | goto rollback; |
9f04bd52 | 1326 | } |
e5b5ae50 LP |
1327 | |
1328 | assert(hashmap_isempty(m->transaction_jobs)); | |
1329 | assert(!m->transaction_anchor); | |
1330 | ||
1331 | return 0; | |
11dd41ce | 1332 | |
e5b5ae50 | 1333 | rollback: |
11dd41ce LP |
1334 | transaction_abort(m); |
1335 | return r; | |
1336 | } | |
1337 | ||
9e2f7c11 | 1338 | static Job* transaction_add_one_job(Manager *m, JobType type, Unit *unit, bool override, bool *is_new) { |
e5b5ae50 | 1339 | Job *j, *f; |
60918275 LP |
1340 | |
1341 | assert(m); | |
87f0e418 | 1342 | assert(unit); |
60918275 | 1343 | |
35b8ca3a | 1344 | /* Looks for an existing prospective job and returns that. If |
e5b5ae50 LP |
1345 | * it doesn't exist it is created and added to the prospective |
1346 | * jobs list. */ | |
60918275 | 1347 | |
87f0e418 | 1348 | f = hashmap_get(m->transaction_jobs, unit); |
60918275 | 1349 | |
034c6ed7 | 1350 | LIST_FOREACH(transaction, j, f) { |
87f0e418 | 1351 | assert(j->unit == unit); |
60918275 | 1352 | |
e5b5ae50 LP |
1353 | if (j->type == type) { |
1354 | if (is_new) | |
1355 | *is_new = false; | |
1356 | return j; | |
1357 | } | |
1358 | } | |
60918275 | 1359 | |
87f0e418 LP |
1360 | if (unit->meta.job && unit->meta.job->type == type) |
1361 | j = unit->meta.job; | |
1362 | else if (!(j = job_new(m, type, unit))) | |
e5b5ae50 | 1363 | return NULL; |
60918275 | 1364 | |
e5b5ae50 LP |
1365 | j->generation = 0; |
1366 | j->marker = NULL; | |
1367 | j->matters_to_anchor = false; | |
9e2f7c11 | 1368 | j->override = override; |
60918275 | 1369 | |
034c6ed7 LP |
1370 | LIST_PREPEND(Job, transaction, f, j); |
1371 | ||
e364ad06 | 1372 | if (hashmap_replace(m->transaction_jobs, unit, f) < 0) { |
034c6ed7 LP |
1373 | job_free(j); |
1374 | return NULL; | |
1375 | } | |
1376 | ||
e5b5ae50 LP |
1377 | if (is_new) |
1378 | *is_new = true; | |
60918275 | 1379 | |
9b3d9090 | 1380 | /* log_debug("Added job %s/%s to transaction.", unit->meta.id, job_type_to_string(type)); */ |
23a177ef | 1381 | |
e5b5ae50 LP |
1382 | return j; |
1383 | } | |
11dd41ce | 1384 | |
23a177ef | 1385 | void manager_transaction_unlink_job(Manager *m, Job *j, bool delete_dependencies) { |
e5b5ae50 LP |
1386 | assert(m); |
1387 | assert(j); | |
11dd41ce | 1388 | |
e5b5ae50 LP |
1389 | if (j->transaction_prev) |
1390 | j->transaction_prev->transaction_next = j->transaction_next; | |
1391 | else if (j->transaction_next) | |
87f0e418 | 1392 | hashmap_replace(m->transaction_jobs, j->unit, j->transaction_next); |
e5b5ae50 | 1393 | else |
87f0e418 | 1394 | hashmap_remove_value(m->transaction_jobs, j->unit, j); |
e5b5ae50 LP |
1395 | |
1396 | if (j->transaction_next) | |
1397 | j->transaction_next->transaction_prev = j->transaction_prev; | |
1398 | ||
1399 | j->transaction_prev = j->transaction_next = NULL; | |
1400 | ||
1401 | while (j->subject_list) | |
1402 | job_dependency_free(j->subject_list); | |
1e198baf LP |
1403 | |
1404 | while (j->object_list) { | |
1405 | Job *other = j->object_list->matters ? j->object_list->subject : NULL; | |
1406 | ||
e5b5ae50 | 1407 | job_dependency_free(j->object_list); |
1e198baf | 1408 | |
23a177ef | 1409 | if (other && delete_dependencies) { |
2e81c8a5 | 1410 | log_debug("Deleting job %s/%s as dependency of job %s/%s", |
9e2f7c11 LP |
1411 | other->unit->meta.id, job_type_to_string(other->type), |
1412 | j->unit->meta.id, job_type_to_string(j->type)); | |
23a177ef | 1413 | transaction_delete_job(m, other, delete_dependencies); |
1e198baf LP |
1414 | } |
1415 | } | |
e5b5ae50 LP |
1416 | } |
1417 | ||
9e2f7c11 LP |
1418 | static int transaction_add_job_and_dependencies( |
1419 | Manager *m, | |
1420 | JobType type, | |
1421 | Unit *unit, | |
1422 | Job *by, | |
1423 | bool matters, | |
1424 | bool override, | |
69dd2852 | 1425 | bool conflicts, |
e67c3609 | 1426 | bool ignore_deps, |
398ef8ba | 1427 | DBusError *e, |
9e2f7c11 | 1428 | Job **_ret) { |
e5b5ae50 | 1429 | Job *ret; |
034c6ed7 | 1430 | Iterator i; |
87f0e418 | 1431 | Unit *dep; |
e5b5ae50 LP |
1432 | int r; |
1433 | bool is_new; | |
1434 | ||
1435 | assert(m); | |
1436 | assert(type < _JOB_TYPE_MAX); | |
87f0e418 | 1437 | assert(unit); |
e5b5ae50 | 1438 | |
3aea3b35 LP |
1439 | /* log_debug("Pulling in %s/%s from %s/%s", */ |
1440 | /* unit->meta.id, job_type_to_string(type), */ | |
1441 | /* by ? by->unit->meta.id : "NA", */ | |
1442 | /* by ? job_type_to_string(by->type) : "NA"); */ | |
1443 | ||
00dc5d76 LP |
1444 | if (unit->meta.load_state != UNIT_LOADED && |
1445 | unit->meta.load_state != UNIT_ERROR && | |
6daf4f90 | 1446 | unit->meta.load_state != UNIT_MASKED) { |
8821a00f LP |
1447 | dbus_set_error(e, BUS_ERROR_LOAD_FAILED, "Unit %s is not loaded properly.", unit->meta.id); |
1448 | return -EINVAL; | |
1449 | } | |
1450 | ||
fdf20a31 | 1451 | if (type != JOB_STOP && unit->meta.load_state == UNIT_ERROR) { |
00dc5d76 LP |
1452 | dbus_set_error(e, BUS_ERROR_LOAD_FAILED, |
1453 | "Unit %s failed to load: %s. " | |
da8f9f8c | 1454 | "See system logs and 'systemctl status' for details.", |
8821a00f LP |
1455 | unit->meta.id, |
1456 | strerror(-unit->meta.load_error)); | |
21b293e8 | 1457 | return -EINVAL; |
398ef8ba | 1458 | } |
21b293e8 | 1459 | |
6daf4f90 LP |
1460 | if (type != JOB_STOP && unit->meta.load_state == UNIT_MASKED) { |
1461 | dbus_set_error(e, BUS_ERROR_MASKED, "Unit %s is masked.", unit->meta.id); | |
00dc5d76 LP |
1462 | return -EINVAL; |
1463 | } | |
1464 | ||
398ef8ba LP |
1465 | if (!unit_job_is_applicable(unit, type)) { |
1466 | dbus_set_error(e, BUS_ERROR_JOB_TYPE_NOT_APPLICABLE, "Job type %s is not applicable for unit %s.", job_type_to_string(type), unit->meta.id); | |
cd2dbd7d | 1467 | return -EBADR; |
398ef8ba | 1468 | } |
cd2dbd7d | 1469 | |
e5b5ae50 | 1470 | /* First add the job. */ |
9e2f7c11 | 1471 | if (!(ret = transaction_add_one_job(m, type, unit, override, &is_new))) |
e5b5ae50 LP |
1472 | return -ENOMEM; |
1473 | ||
e67c3609 LP |
1474 | ret->ignore_deps = ret->ignore_deps || ignore_deps; |
1475 | ||
e5b5ae50 | 1476 | /* Then, add a link to the job. */ |
69dd2852 | 1477 | if (!job_dependency_new(by, ret, matters, conflicts)) |
e5b5ae50 LP |
1478 | return -ENOMEM; |
1479 | ||
e67c3609 | 1480 | if (is_new && !ignore_deps) { |
6210e7fc LP |
1481 | Set *following; |
1482 | ||
1483 | /* If we are following some other unit, make sure we | |
1484 | * add all dependencies of everybody following. */ | |
1485 | if (unit_following_set(ret->unit, &following) > 0) { | |
1486 | SET_FOREACH(dep, following, i) | |
e67c3609 | 1487 | if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, false, override, false, false, e, NULL)) < 0) { |
6210e7fc LP |
1488 | log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r)); |
1489 | ||
1490 | if (e) | |
1491 | dbus_error_free(e); | |
1492 | } | |
1493 | ||
1494 | set_free(following); | |
1495 | } | |
1496 | ||
e5b5ae50 LP |
1497 | /* Finally, recursively add in all dependencies. */ |
1498 | if (type == JOB_START || type == JOB_RELOAD_OR_START) { | |
87f0e418 | 1499 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES], i) |
e67c3609 | 1500 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1501 | if (r != -EBADR) |
1502 | goto fail; | |
1503 | ||
1504 | if (e) | |
1505 | dbus_error_free(e); | |
1506 | } | |
9e2f7c11 | 1507 | |
b81884e7 | 1508 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_BIND_TO], i) |
e67c3609 | 1509 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1510 | |
1511 | if (r != -EBADR) | |
1512 | goto fail; | |
1513 | ||
1514 | if (e) | |
1515 | dbus_error_free(e); | |
1516 | } | |
b81884e7 | 1517 | |
9e2f7c11 | 1518 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i) |
e67c3609 | 1519 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, !override, override, false, false, e, NULL)) < 0) { |
65e92d67 | 1520 | log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r)); |
60dc72b5 LP |
1521 | |
1522 | if (e) | |
1523 | dbus_error_free(e); | |
65e92d67 | 1524 | } |
9e2f7c11 | 1525 | |
87f0e418 | 1526 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_WANTS], i) |
e67c3609 | 1527 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, false, false, false, false, e, NULL)) < 0) { |
65e92d67 | 1528 | log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r)); |
60dc72b5 LP |
1529 | |
1530 | if (e) | |
1531 | dbus_error_free(e); | |
65e92d67 | 1532 | } |
9e2f7c11 | 1533 | |
87f0e418 | 1534 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE], i) |
e67c3609 | 1535 | if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, true, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1536 | |
1537 | if (r != -EBADR) | |
1538 | goto fail; | |
1539 | ||
1540 | if (e) | |
1541 | dbus_error_free(e); | |
1542 | } | |
9e2f7c11 LP |
1543 | |
1544 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE_OVERRIDABLE], i) | |
e67c3609 | 1545 | if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, !override, override, false, false, e, NULL)) < 0) { |
65e92d67 | 1546 | log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r)); |
60dc72b5 LP |
1547 | |
1548 | if (e) | |
1549 | dbus_error_free(e); | |
65e92d67 | 1550 | } |
9e2f7c11 | 1551 | |
87f0e418 | 1552 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTS], i) |
e67c3609 | 1553 | if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, true, override, true, false, e, NULL)) < 0) { |
41242c42 LP |
1554 | |
1555 | if (r != -EBADR) | |
1556 | goto fail; | |
1557 | ||
1558 | if (e) | |
1559 | dbus_error_free(e); | |
1560 | } | |
69dd2852 LP |
1561 | |
1562 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTED_BY], i) | |
e67c3609 | 1563 | if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, false, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1564 | log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r)); |
1565 | ||
1566 | if (e) | |
1567 | dbus_error_free(e); | |
1568 | } | |
e5b5ae50 LP |
1569 | |
1570 | } else if (type == JOB_STOP || type == JOB_RESTART || type == JOB_TRY_RESTART) { | |
1571 | ||
87f0e418 | 1572 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRED_BY], i) |
e67c3609 | 1573 | if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1574 | |
1575 | if (r != -EBADR) | |
1576 | goto fail; | |
1577 | ||
1578 | if (e) | |
1579 | dbus_error_free(e); | |
1580 | } | |
b81884e7 LP |
1581 | |
1582 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_BOUND_BY], i) | |
e67c3609 | 1583 | if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, override, false, false, e, NULL)) < 0) { |
41242c42 LP |
1584 | |
1585 | if (r != -EBADR) | |
1586 | goto fail; | |
1587 | ||
1588 | if (e) | |
1589 | dbus_error_free(e); | |
1590 | } | |
e5b5ae50 LP |
1591 | } |
1592 | ||
1593 | /* JOB_VERIFY_STARTED, JOB_RELOAD require no dependency handling */ | |
1594 | } | |
60918275 | 1595 | |
c0dafa48 LP |
1596 | if (_ret) |
1597 | *_ret = ret; | |
1598 | ||
60918275 LP |
1599 | return 0; |
1600 | ||
1601 | fail: | |
e5b5ae50 LP |
1602 | return r; |
1603 | } | |
1604 | ||
c497c7a9 LP |
1605 | static int transaction_add_isolate_jobs(Manager *m) { |
1606 | Iterator i; | |
1607 | Unit *u; | |
1608 | char *k; | |
1609 | int r; | |
1610 | ||
1611 | assert(m); | |
1612 | ||
1613 | HASHMAP_FOREACH_KEY(u, k, m->units, i) { | |
1614 | ||
1615 | /* ignore aliases */ | |
1616 | if (u->meta.id != k) | |
1617 | continue; | |
1618 | ||
1619 | if (UNIT_VTABLE(u)->no_isolate) | |
1620 | continue; | |
1621 | ||
1622 | /* No need to stop inactive jobs */ | |
2ce5c8f9 | 1623 | if (UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u)) && !u->meta.job) |
c497c7a9 LP |
1624 | continue; |
1625 | ||
1626 | /* Is there already something listed for this? */ | |
1627 | if (hashmap_get(m->transaction_jobs, u)) | |
1628 | continue; | |
1629 | ||
e67c3609 | 1630 | if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, u, NULL, true, false, false, false, NULL, NULL)) < 0) |
c497c7a9 LP |
1631 | log_warning("Cannot add isolate job for unit %s, ignoring: %s", u->meta.id, strerror(-r)); |
1632 | } | |
1633 | ||
1634 | return 0; | |
1635 | } | |
1636 | ||
398ef8ba | 1637 | int manager_add_job(Manager *m, JobType type, Unit *unit, JobMode mode, bool override, DBusError *e, Job **_ret) { |
e5b5ae50 LP |
1638 | int r; |
1639 | Job *ret; | |
1640 | ||
1641 | assert(m); | |
1642 | assert(type < _JOB_TYPE_MAX); | |
87f0e418 | 1643 | assert(unit); |
e5b5ae50 | 1644 | assert(mode < _JOB_MODE_MAX); |
60918275 | 1645 | |
398ef8ba LP |
1646 | if (mode == JOB_ISOLATE && type != JOB_START) { |
1647 | dbus_set_error(e, BUS_ERROR_INVALID_JOB_MODE, "Isolate is only valid for start."); | |
c497c7a9 | 1648 | return -EINVAL; |
398ef8ba | 1649 | } |
c497c7a9 | 1650 | |
2528a7a6 LP |
1651 | if (mode == JOB_ISOLATE && !unit->meta.allow_isolate) { |
1652 | dbus_set_error(e, BUS_ERROR_NO_ISOLATION, "Operation refused, unit may not be isolated."); | |
1653 | return -EPERM; | |
1654 | } | |
1655 | ||
e43ac878 | 1656 | log_debug("Trying to enqueue job %s/%s/%s", unit->meta.id, job_type_to_string(type), job_mode_to_string(mode)); |
9f04bd52 | 1657 | |
e67c3609 | 1658 | if ((r = transaction_add_job_and_dependencies(m, type, unit, NULL, true, override, false, mode == JOB_IGNORE_DEPENDENCIES, e, &ret)) < 0) { |
11dd41ce | 1659 | transaction_abort(m); |
e5b5ae50 LP |
1660 | return r; |
1661 | } | |
11dd41ce | 1662 | |
c497c7a9 LP |
1663 | if (mode == JOB_ISOLATE) |
1664 | if ((r = transaction_add_isolate_jobs(m)) < 0) { | |
1665 | transaction_abort(m); | |
1666 | return r; | |
1667 | } | |
1668 | ||
398ef8ba | 1669 | if ((r = transaction_activate(m, mode, e)) < 0) |
e5b5ae50 LP |
1670 | return r; |
1671 | ||
9e2f7c11 | 1672 | log_debug("Enqueued job %s/%s as %u", unit->meta.id, job_type_to_string(type), (unsigned) ret->id); |
f50e0a01 | 1673 | |
e5b5ae50 LP |
1674 | if (_ret) |
1675 | *_ret = ret; | |
60918275 | 1676 | |
e5b5ae50 LP |
1677 | return 0; |
1678 | } | |
60918275 | 1679 | |
398ef8ba | 1680 | int manager_add_job_by_name(Manager *m, JobType type, const char *name, JobMode mode, bool override, DBusError *e, Job **_ret) { |
28247076 LP |
1681 | Unit *unit; |
1682 | int r; | |
1683 | ||
1684 | assert(m); | |
1685 | assert(type < _JOB_TYPE_MAX); | |
1686 | assert(name); | |
1687 | assert(mode < _JOB_MODE_MAX); | |
1688 | ||
398ef8ba | 1689 | if ((r = manager_load_unit(m, name, NULL, NULL, &unit)) < 0) |
28247076 LP |
1690 | return r; |
1691 | ||
398ef8ba | 1692 | return manager_add_job(m, type, unit, mode, override, e, _ret); |
28247076 LP |
1693 | } |
1694 | ||
60918275 LP |
1695 | Job *manager_get_job(Manager *m, uint32_t id) { |
1696 | assert(m); | |
1697 | ||
1698 | return hashmap_get(m->jobs, UINT32_TO_PTR(id)); | |
1699 | } | |
1700 | ||
87f0e418 | 1701 | Unit *manager_get_unit(Manager *m, const char *name) { |
60918275 LP |
1702 | assert(m); |
1703 | assert(name); | |
1704 | ||
87f0e418 | 1705 | return hashmap_get(m->units, name); |
60918275 LP |
1706 | } |
1707 | ||
c1e1601e | 1708 | unsigned manager_dispatch_load_queue(Manager *m) { |
60918275 | 1709 | Meta *meta; |
c1e1601e | 1710 | unsigned n = 0; |
60918275 LP |
1711 | |
1712 | assert(m); | |
1713 | ||
223dabab LP |
1714 | /* Make sure we are not run recursively */ |
1715 | if (m->dispatching_load_queue) | |
c1e1601e | 1716 | return 0; |
223dabab LP |
1717 | |
1718 | m->dispatching_load_queue = true; | |
1719 | ||
87f0e418 | 1720 | /* Dispatches the load queue. Takes a unit from the queue and |
60918275 LP |
1721 | * tries to load its data until the queue is empty */ |
1722 | ||
1723 | while ((meta = m->load_queue)) { | |
034c6ed7 LP |
1724 | assert(meta->in_load_queue); |
1725 | ||
399ab2b1 | 1726 | unit_load((Unit*) meta); |
c1e1601e | 1727 | n++; |
60918275 LP |
1728 | } |
1729 | ||
223dabab | 1730 | m->dispatching_load_queue = false; |
c1e1601e | 1731 | return n; |
60918275 LP |
1732 | } |
1733 | ||
398ef8ba | 1734 | int manager_load_unit_prepare(Manager *m, const char *name, const char *path, DBusError *e, Unit **_ret) { |
87f0e418 | 1735 | Unit *ret; |
60918275 LP |
1736 | int r; |
1737 | ||
1738 | assert(m); | |
9e2f7c11 | 1739 | assert(name || path); |
60918275 | 1740 | |
db06e3b6 LP |
1741 | /* This will prepare the unit for loading, but not actually |
1742 | * load anything from disk. */ | |
0301abf4 | 1743 | |
398ef8ba LP |
1744 | if (path && !is_path(path)) { |
1745 | dbus_set_error(e, BUS_ERROR_INVALID_PATH, "Path %s is not absolute.", path); | |
9e2f7c11 | 1746 | return -EINVAL; |
398ef8ba | 1747 | } |
9e2f7c11 LP |
1748 | |
1749 | if (!name) | |
1750 | name = file_name_from_path(path); | |
1751 | ||
b9c0d441 | 1752 | if (!unit_name_is_valid(name, false)) { |
398ef8ba | 1753 | dbus_set_error(e, BUS_ERROR_INVALID_NAME, "Unit name %s is not valid.", name); |
9e2f7c11 | 1754 | return -EINVAL; |
398ef8ba | 1755 | } |
60918275 | 1756 | |
87f0e418 | 1757 | if ((ret = manager_get_unit(m, name))) { |
034c6ed7 | 1758 | *_ret = ret; |
413d6313 | 1759 | return 1; |
034c6ed7 | 1760 | } |
60918275 | 1761 | |
87f0e418 | 1762 | if (!(ret = unit_new(m))) |
60918275 LP |
1763 | return -ENOMEM; |
1764 | ||
9e2f7c11 | 1765 | if (path) |
6be1e7d5 | 1766 | if (!(ret->meta.fragment_path = strdup(path))) { |
0301abf4 LP |
1767 | unit_free(ret); |
1768 | return -ENOMEM; | |
1769 | } | |
0301abf4 | 1770 | |
87f0e418 LP |
1771 | if ((r = unit_add_name(ret, name)) < 0) { |
1772 | unit_free(ret); | |
1ffba6fe | 1773 | return r; |
60918275 LP |
1774 | } |
1775 | ||
87f0e418 | 1776 | unit_add_to_load_queue(ret); |
c1e1601e | 1777 | unit_add_to_dbus_queue(ret); |
949061f0 | 1778 | unit_add_to_gc_queue(ret); |
c1e1601e | 1779 | |
db06e3b6 LP |
1780 | if (_ret) |
1781 | *_ret = ret; | |
1782 | ||
1783 | return 0; | |
1784 | } | |
1785 | ||
398ef8ba | 1786 | int manager_load_unit(Manager *m, const char *name, const char *path, DBusError *e, Unit **_ret) { |
db06e3b6 LP |
1787 | int r; |
1788 | ||
1789 | assert(m); | |
1790 | ||
1791 | /* This will load the service information files, but not actually | |
1792 | * start any services or anything. */ | |
1793 | ||
398ef8ba | 1794 | if ((r = manager_load_unit_prepare(m, name, path, e, _ret)) != 0) |
db06e3b6 LP |
1795 | return r; |
1796 | ||
f50e0a01 | 1797 | manager_dispatch_load_queue(m); |
60918275 | 1798 | |
9e2f7c11 | 1799 | if (_ret) |
413d6313 | 1800 | *_ret = unit_follow_merge(*_ret); |
9e2f7c11 | 1801 | |
60918275 LP |
1802 | return 0; |
1803 | } | |
a66d02c3 | 1804 | |
cea8e32e | 1805 | void manager_dump_jobs(Manager *s, FILE *f, const char *prefix) { |
034c6ed7 | 1806 | Iterator i; |
a66d02c3 LP |
1807 | Job *j; |
1808 | ||
1809 | assert(s); | |
1810 | assert(f); | |
1811 | ||
034c6ed7 | 1812 | HASHMAP_FOREACH(j, s->jobs, i) |
cea8e32e | 1813 | job_dump(j, f, prefix); |
a66d02c3 LP |
1814 | } |
1815 | ||
87f0e418 | 1816 | void manager_dump_units(Manager *s, FILE *f, const char *prefix) { |
034c6ed7 | 1817 | Iterator i; |
87f0e418 | 1818 | Unit *u; |
11dd41ce | 1819 | const char *t; |
a66d02c3 LP |
1820 | |
1821 | assert(s); | |
1822 | assert(f); | |
1823 | ||
87f0e418 | 1824 | HASHMAP_FOREACH_KEY(u, t, s->units, i) |
9e2f7c11 | 1825 | if (u->meta.id == t) |
87f0e418 | 1826 | unit_dump(u, f, prefix); |
a66d02c3 | 1827 | } |
7fad411c LP |
1828 | |
1829 | void manager_clear_jobs(Manager *m) { | |
1830 | Job *j; | |
1831 | ||
1832 | assert(m); | |
1833 | ||
1834 | transaction_abort(m); | |
1835 | ||
1836 | while ((j = hashmap_first(m->jobs))) | |
c77bc38d | 1837 | job_finish_and_invalidate(j, JOB_CANCELED); |
7fad411c | 1838 | } |
83c60c9f | 1839 | |
c1e1601e | 1840 | unsigned manager_dispatch_run_queue(Manager *m) { |
83c60c9f | 1841 | Job *j; |
c1e1601e | 1842 | unsigned n = 0; |
83c60c9f | 1843 | |
034c6ed7 | 1844 | if (m->dispatching_run_queue) |
c1e1601e | 1845 | return 0; |
034c6ed7 LP |
1846 | |
1847 | m->dispatching_run_queue = true; | |
9152c765 | 1848 | |
034c6ed7 | 1849 | while ((j = m->run_queue)) { |
ac1135be | 1850 | assert(j->installed); |
034c6ed7 LP |
1851 | assert(j->in_run_queue); |
1852 | ||
1853 | job_run_and_invalidate(j); | |
c1e1601e | 1854 | n++; |
9152c765 | 1855 | } |
034c6ed7 LP |
1856 | |
1857 | m->dispatching_run_queue = false; | |
c1e1601e LP |
1858 | return n; |
1859 | } | |
1860 | ||
1861 | unsigned manager_dispatch_dbus_queue(Manager *m) { | |
1862 | Job *j; | |
1863 | Meta *meta; | |
1864 | unsigned n = 0; | |
1865 | ||
1866 | assert(m); | |
1867 | ||
1868 | if (m->dispatching_dbus_queue) | |
1869 | return 0; | |
1870 | ||
1871 | m->dispatching_dbus_queue = true; | |
1872 | ||
1873 | while ((meta = m->dbus_unit_queue)) { | |
23a177ef | 1874 | assert(meta->in_dbus_queue); |
c1e1601e | 1875 | |
399ab2b1 | 1876 | bus_unit_send_change_signal((Unit*) meta); |
c1e1601e LP |
1877 | n++; |
1878 | } | |
1879 | ||
1880 | while ((j = m->dbus_job_queue)) { | |
1881 | assert(j->in_dbus_queue); | |
1882 | ||
1883 | bus_job_send_change_signal(j); | |
1884 | n++; | |
1885 | } | |
1886 | ||
1887 | m->dispatching_dbus_queue = false; | |
1888 | return n; | |
9152c765 LP |
1889 | } |
1890 | ||
8c47c732 LP |
1891 | static int manager_process_notify_fd(Manager *m) { |
1892 | ssize_t n; | |
1893 | ||
1894 | assert(m); | |
1895 | ||
1896 | for (;;) { | |
1897 | char buf[4096]; | |
1898 | struct msghdr msghdr; | |
1899 | struct iovec iovec; | |
1900 | struct ucred *ucred; | |
1901 | union { | |
1902 | struct cmsghdr cmsghdr; | |
1903 | uint8_t buf[CMSG_SPACE(sizeof(struct ucred))]; | |
1904 | } control; | |
1905 | Unit *u; | |
1906 | char **tags; | |
1907 | ||
1908 | zero(iovec); | |
1909 | iovec.iov_base = buf; | |
1910 | iovec.iov_len = sizeof(buf)-1; | |
1911 | ||
1912 | zero(control); | |
1913 | zero(msghdr); | |
1914 | msghdr.msg_iov = &iovec; | |
1915 | msghdr.msg_iovlen = 1; | |
1916 | msghdr.msg_control = &control; | |
1917 | msghdr.msg_controllen = sizeof(control); | |
1918 | ||
1919 | if ((n = recvmsg(m->notify_watch.fd, &msghdr, MSG_DONTWAIT)) <= 0) { | |
1920 | if (n >= 0) | |
1921 | return -EIO; | |
1922 | ||
f6144808 | 1923 | if (errno == EAGAIN || errno == EINTR) |
8c47c732 LP |
1924 | break; |
1925 | ||
1926 | return -errno; | |
1927 | } | |
1928 | ||
1929 | if (msghdr.msg_controllen < CMSG_LEN(sizeof(struct ucred)) || | |
1930 | control.cmsghdr.cmsg_level != SOL_SOCKET || | |
1931 | control.cmsghdr.cmsg_type != SCM_CREDENTIALS || | |
1932 | control.cmsghdr.cmsg_len != CMSG_LEN(sizeof(struct ucred))) { | |
1933 | log_warning("Received notify message without credentials. Ignoring."); | |
1934 | continue; | |
1935 | } | |
1936 | ||
1937 | ucred = (struct ucred*) CMSG_DATA(&control.cmsghdr); | |
1938 | ||
c6c18be3 | 1939 | if (!(u = hashmap_get(m->watch_pids, LONG_TO_PTR(ucred->pid)))) |
8c47c732 LP |
1940 | if (!(u = cgroup_unit_by_pid(m, ucred->pid))) { |
1941 | log_warning("Cannot find unit for notify message of PID %lu.", (unsigned long) ucred->pid); | |
1942 | continue; | |
1943 | } | |
1944 | ||
8c40acf7 LP |
1945 | assert((size_t) n < sizeof(buf)); |
1946 | buf[n] = 0; | |
8c47c732 LP |
1947 | if (!(tags = strv_split(buf, "\n\r"))) |
1948 | return -ENOMEM; | |
1949 | ||
1950 | log_debug("Got notification message for unit %s", u->meta.id); | |
1951 | ||
1952 | if (UNIT_VTABLE(u)->notify_message) | |
c952c6ec | 1953 | UNIT_VTABLE(u)->notify_message(u, ucred->pid, tags); |
8c47c732 LP |
1954 | |
1955 | strv_free(tags); | |
1956 | } | |
1957 | ||
1958 | return 0; | |
1959 | } | |
1960 | ||
034c6ed7 | 1961 | static int manager_dispatch_sigchld(Manager *m) { |
9152c765 LP |
1962 | assert(m); |
1963 | ||
1964 | for (;;) { | |
1965 | siginfo_t si; | |
87f0e418 | 1966 | Unit *u; |
8c47c732 | 1967 | int r; |
9152c765 LP |
1968 | |
1969 | zero(si); | |
4112df16 LP |
1970 | |
1971 | /* First we call waitd() for a PID and do not reap the | |
1972 | * zombie. That way we can still access /proc/$PID for | |
1973 | * it while it is a zombie. */ | |
1974 | if (waitid(P_ALL, 0, &si, WEXITED|WNOHANG|WNOWAIT) < 0) { | |
acbb0225 LP |
1975 | |
1976 | if (errno == ECHILD) | |
1977 | break; | |
1978 | ||
4112df16 LP |
1979 | if (errno == EINTR) |
1980 | continue; | |
1981 | ||
9152c765 | 1982 | return -errno; |
acbb0225 | 1983 | } |
9152c765 | 1984 | |
4112df16 | 1985 | if (si.si_pid <= 0) |
9152c765 LP |
1986 | break; |
1987 | ||
15d5d9d9 | 1988 | if (si.si_code == CLD_EXITED || si.si_code == CLD_KILLED || si.si_code == CLD_DUMPED) { |
4112df16 LP |
1989 | char *name = NULL; |
1990 | ||
1991 | get_process_name(si.si_pid, &name); | |
bb00e604 | 1992 | log_debug("Got SIGCHLD for process %lu (%s)", (unsigned long) si.si_pid, strna(name)); |
4112df16 LP |
1993 | free(name); |
1994 | } | |
1995 | ||
8c47c732 LP |
1996 | /* Let's flush any message the dying child might still |
1997 | * have queued for us. This ensures that the process | |
1998 | * still exists in /proc so that we can figure out | |
1999 | * which cgroup and hence unit it belongs to. */ | |
2000 | if ((r = manager_process_notify_fd(m)) < 0) | |
2001 | return r; | |
2002 | ||
2003 | /* And now figure out the unit this belongs to */ | |
c6c18be3 | 2004 | if (!(u = hashmap_get(m->watch_pids, LONG_TO_PTR(si.si_pid)))) |
8c47c732 LP |
2005 | u = cgroup_unit_by_pid(m, si.si_pid); |
2006 | ||
4112df16 LP |
2007 | /* And now, we actually reap the zombie. */ |
2008 | if (waitid(P_PID, si.si_pid, &si, WEXITED) < 0) { | |
2009 | if (errno == EINTR) | |
2010 | continue; | |
2011 | ||
2012 | return -errno; | |
2013 | } | |
2014 | ||
034c6ed7 LP |
2015 | if (si.si_code != CLD_EXITED && si.si_code != CLD_KILLED && si.si_code != CLD_DUMPED) |
2016 | continue; | |
2017 | ||
bb00e604 LP |
2018 | log_debug("Child %lu died (code=%s, status=%i/%s)", |
2019 | (long unsigned) si.si_pid, | |
4112df16 LP |
2020 | sigchld_code_to_string(si.si_code), |
2021 | si.si_status, | |
d06dacd0 LP |
2022 | strna(si.si_code == CLD_EXITED |
2023 | ? exit_status_to_string(si.si_status, EXIT_STATUS_FULL) | |
2024 | : signal_to_string(si.si_status))); | |
acbb0225 | 2025 | |
8c47c732 | 2026 | if (!u) |
9152c765 LP |
2027 | continue; |
2028 | ||
c6c18be3 | 2029 | log_debug("Child %lu belongs to %s", (long unsigned) si.si_pid, u->meta.id); |
6c1a0478 | 2030 | |
c6c18be3 | 2031 | hashmap_remove(m->watch_pids, LONG_TO_PTR(si.si_pid)); |
87f0e418 | 2032 | UNIT_VTABLE(u)->sigchld_event(u, si.si_pid, si.si_code, si.si_status); |
9152c765 LP |
2033 | } |
2034 | ||
2035 | return 0; | |
2036 | } | |
2037 | ||
7d793605 | 2038 | static int manager_start_target(Manager *m, const char *name, JobMode mode) { |
28247076 | 2039 | int r; |
398ef8ba LP |
2040 | DBusError error; |
2041 | ||
2042 | dbus_error_init(&error); | |
2043 | ||
af2d49f7 | 2044 | log_debug("Activating special unit %s", name); |
1e001f52 | 2045 | |
398ef8ba LP |
2046 | if ((r = manager_add_job_by_name(m, JOB_START, name, mode, true, &error, NULL)) < 0) |
2047 | log_error("Failed to enqueue %s job: %s", name, bus_error(&error, r)); | |
28247076 | 2048 | |
398ef8ba | 2049 | dbus_error_free(&error); |
a1b256b0 LP |
2050 | |
2051 | return r; | |
28247076 LP |
2052 | } |
2053 | ||
a16e1123 | 2054 | static int manager_process_signal_fd(Manager *m) { |
9152c765 LP |
2055 | ssize_t n; |
2056 | struct signalfd_siginfo sfsi; | |
2057 | bool sigchld = false; | |
2058 | ||
2059 | assert(m); | |
2060 | ||
2061 | for (;;) { | |
72fe22f9 LP |
2062 | char *p = NULL; |
2063 | ||
acbb0225 | 2064 | if ((n = read(m->signal_watch.fd, &sfsi, sizeof(sfsi))) != sizeof(sfsi)) { |
9152c765 LP |
2065 | |
2066 | if (n >= 0) | |
2067 | return -EIO; | |
2068 | ||
63090775 | 2069 | if (errno == EINTR || errno == EAGAIN) |
acbb0225 | 2070 | break; |
9152c765 LP |
2071 | |
2072 | return -errno; | |
2073 | } | |
2074 | ||
dfa7f7e1 LP |
2075 | if (sfsi.ssi_pid > 0) |
2076 | get_process_name(sfsi.ssi_pid, &p); | |
2077 | ||
72fe22f9 LP |
2078 | log_debug("Received SIG%s from PID %lu (%s)", |
2079 | strna(signal_to_string(sfsi.ssi_signo)), | |
2080 | (unsigned long) sfsi.ssi_pid, strna(p)); | |
2081 | free(p); | |
1e001f52 | 2082 | |
b9cd2ec1 LP |
2083 | switch (sfsi.ssi_signo) { |
2084 | ||
4112df16 | 2085 | case SIGCHLD: |
9152c765 | 2086 | sigchld = true; |
b9cd2ec1 LP |
2087 | break; |
2088 | ||
6632c602 | 2089 | case SIGTERM: |
a3d4e06d | 2090 | if (m->running_as == MANAGER_SYSTEM) { |
db06e3b6 LP |
2091 | /* This is for compatibility with the |
2092 | * original sysvinit */ | |
e11dc4a2 | 2093 | m->exit_code = MANAGER_REEXECUTE; |
a1b256b0 LP |
2094 | break; |
2095 | } | |
84e9af1e | 2096 | |
a1b256b0 | 2097 | /* Fall through */ |
e11dc4a2 LP |
2098 | |
2099 | case SIGINT: | |
a3d4e06d | 2100 | if (m->running_as == MANAGER_SYSTEM) { |
7d793605 | 2101 | manager_start_target(m, SPECIAL_CTRL_ALT_DEL_TARGET, JOB_REPLACE); |
84e9af1e LP |
2102 | break; |
2103 | } | |
2104 | ||
a1b256b0 | 2105 | /* Run the exit target if there is one, if not, just exit. */ |
0003d1ab | 2106 | if (manager_start_target(m, SPECIAL_EXIT_TARGET, JOB_REPLACE) < 0) { |
a1b256b0 LP |
2107 | m->exit_code = MANAGER_EXIT; |
2108 | return 0; | |
2109 | } | |
2110 | ||
2111 | break; | |
84e9af1e | 2112 | |
28247076 | 2113 | case SIGWINCH: |
a3d4e06d | 2114 | if (m->running_as == MANAGER_SYSTEM) |
7d793605 | 2115 | manager_start_target(m, SPECIAL_KBREQUEST_TARGET, JOB_REPLACE); |
84e9af1e | 2116 | |
28247076 LP |
2117 | /* This is a nop on non-init */ |
2118 | break; | |
84e9af1e | 2119 | |
28247076 | 2120 | case SIGPWR: |
a3d4e06d | 2121 | if (m->running_as == MANAGER_SYSTEM) |
7d793605 | 2122 | manager_start_target(m, SPECIAL_SIGPWR_TARGET, JOB_REPLACE); |
84e9af1e | 2123 | |
28247076 | 2124 | /* This is a nop on non-init */ |
84e9af1e | 2125 | break; |
6632c602 | 2126 | |
1005d14f | 2127 | case SIGUSR1: { |
57ee42ce LP |
2128 | Unit *u; |
2129 | ||
2130 | u = manager_get_unit(m, SPECIAL_DBUS_SERVICE); | |
2131 | ||
2132 | if (!u || UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u))) { | |
2133 | log_info("Trying to reconnect to bus..."); | |
3996fbe2 | 2134 | bus_init(m, true); |
57ee42ce LP |
2135 | } |
2136 | ||
2137 | if (!u || !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))) { | |
2138 | log_info("Loading D-Bus service..."); | |
7d793605 | 2139 | manager_start_target(m, SPECIAL_DBUS_SERVICE, JOB_REPLACE); |
57ee42ce LP |
2140 | } |
2141 | ||
2142 | break; | |
2143 | } | |
2144 | ||
2149e37c LP |
2145 | case SIGUSR2: { |
2146 | FILE *f; | |
2147 | char *dump = NULL; | |
2148 | size_t size; | |
2149 | ||
2150 | if (!(f = open_memstream(&dump, &size))) { | |
2151 | log_warning("Failed to allocate memory stream."); | |
2152 | break; | |
2153 | } | |
2154 | ||
2155 | manager_dump_units(m, f, "\t"); | |
2156 | manager_dump_jobs(m, f, "\t"); | |
2157 | ||
2158 | if (ferror(f)) { | |
2159 | fclose(f); | |
2160 | free(dump); | |
2161 | log_warning("Failed to write status stream"); | |
2162 | break; | |
2163 | } | |
2164 | ||
2165 | fclose(f); | |
2166 | log_dump(LOG_INFO, dump); | |
2167 | free(dump); | |
2168 | ||
1005d14f | 2169 | break; |
2149e37c | 2170 | } |
1005d14f | 2171 | |
a16e1123 LP |
2172 | case SIGHUP: |
2173 | m->exit_code = MANAGER_RELOAD; | |
2174 | break; | |
2175 | ||
7d793605 | 2176 | default: { |
0003d1ab LP |
2177 | /* Starting SIGRTMIN+0 */ |
2178 | static const char * const target_table[] = { | |
7d793605 LP |
2179 | [0] = SPECIAL_DEFAULT_TARGET, |
2180 | [1] = SPECIAL_RESCUE_TARGET, | |
f057408c | 2181 | [2] = SPECIAL_EMERGENCY_TARGET, |
7d793605 LP |
2182 | [3] = SPECIAL_HALT_TARGET, |
2183 | [4] = SPECIAL_POWEROFF_TARGET, | |
0003d1ab LP |
2184 | [5] = SPECIAL_REBOOT_TARGET, |
2185 | [6] = SPECIAL_KEXEC_TARGET | |
2186 | }; | |
2187 | ||
2188 | /* Starting SIGRTMIN+13, so that target halt and system halt are 10 apart */ | |
2189 | static const ManagerExitCode code_table[] = { | |
2190 | [0] = MANAGER_HALT, | |
2191 | [1] = MANAGER_POWEROFF, | |
2192 | [2] = MANAGER_REBOOT, | |
2193 | [3] = MANAGER_KEXEC | |
7d793605 LP |
2194 | }; |
2195 | ||
2196 | if ((int) sfsi.ssi_signo >= SIGRTMIN+0 && | |
0003d1ab LP |
2197 | (int) sfsi.ssi_signo < SIGRTMIN+(int) ELEMENTSOF(target_table)) { |
2198 | manager_start_target(m, target_table[sfsi.ssi_signo - SIGRTMIN], | |
e6b3f00f | 2199 | (sfsi.ssi_signo == 1 || sfsi.ssi_signo == 2) ? JOB_ISOLATE : JOB_REPLACE); |
7d793605 LP |
2200 | break; |
2201 | } | |
2202 | ||
0003d1ab LP |
2203 | if ((int) sfsi.ssi_signo >= SIGRTMIN+13 && |
2204 | (int) sfsi.ssi_signo < SIGRTMIN+13+(int) ELEMENTSOF(code_table)) { | |
2205 | m->exit_code = code_table[sfsi.ssi_signo - SIGRTMIN - 13]; | |
2206 | break; | |
2207 | } | |
2208 | ||
0658666b LP |
2209 | switch (sfsi.ssi_signo - SIGRTMIN) { |
2210 | ||
2211 | case 20: | |
2212 | log_debug("Enabling showing of status."); | |
2213 | m->show_status = true; | |
2214 | break; | |
2215 | ||
2216 | case 21: | |
2217 | log_debug("Disabling showing of status."); | |
2218 | m->show_status = false; | |
2219 | break; | |
2220 | ||
2221 | default: | |
2222 | log_warning("Got unhandled signal <%s>.", strna(signal_to_string(sfsi.ssi_signo))); | |
2223 | } | |
b9cd2ec1 | 2224 | } |
7d793605 | 2225 | } |
9152c765 LP |
2226 | } |
2227 | ||
2228 | if (sigchld) | |
034c6ed7 LP |
2229 | return manager_dispatch_sigchld(m); |
2230 | ||
2231 | return 0; | |
2232 | } | |
2233 | ||
a16e1123 | 2234 | static int process_event(Manager *m, struct epoll_event *ev) { |
034c6ed7 | 2235 | int r; |
acbb0225 | 2236 | Watch *w; |
034c6ed7 LP |
2237 | |
2238 | assert(m); | |
2239 | assert(ev); | |
2240 | ||
acbb0225 | 2241 | assert(w = ev->data.ptr); |
034c6ed7 | 2242 | |
40dde66f LP |
2243 | if (w->type == WATCH_INVALID) |
2244 | return 0; | |
2245 | ||
acbb0225 | 2246 | switch (w->type) { |
034c6ed7 | 2247 | |
ef734fd6 | 2248 | case WATCH_SIGNAL: |
034c6ed7 | 2249 | |
acbb0225 | 2250 | /* An incoming signal? */ |
f94ea366 | 2251 | if (ev->events != EPOLLIN) |
acbb0225 | 2252 | return -EINVAL; |
034c6ed7 | 2253 | |
a16e1123 | 2254 | if ((r = manager_process_signal_fd(m)) < 0) |
acbb0225 | 2255 | return r; |
034c6ed7 | 2256 | |
acbb0225 | 2257 | break; |
034c6ed7 | 2258 | |
8c47c732 LP |
2259 | case WATCH_NOTIFY: |
2260 | ||
2261 | /* An incoming daemon notification event? */ | |
2262 | if (ev->events != EPOLLIN) | |
2263 | return -EINVAL; | |
2264 | ||
2265 | if ((r = manager_process_notify_fd(m)) < 0) | |
2266 | return r; | |
2267 | ||
2268 | break; | |
2269 | ||
acbb0225 | 2270 | case WATCH_FD: |
034c6ed7 | 2271 | |
acbb0225 | 2272 | /* Some fd event, to be dispatched to the units */ |
ea430986 | 2273 | UNIT_VTABLE(w->data.unit)->fd_event(w->data.unit, w->fd, ev->events, w); |
acbb0225 | 2274 | break; |
034c6ed7 | 2275 | |
faf919f1 LP |
2276 | case WATCH_UNIT_TIMER: |
2277 | case WATCH_JOB_TIMER: { | |
acbb0225 LP |
2278 | uint64_t v; |
2279 | ssize_t k; | |
034c6ed7 | 2280 | |
acbb0225 | 2281 | /* Some timer event, to be dispatched to the units */ |
be888ebb | 2282 | if ((k = read(w->fd, &v, sizeof(v))) != sizeof(v)) { |
034c6ed7 | 2283 | |
acbb0225 LP |
2284 | if (k < 0 && (errno == EINTR || errno == EAGAIN)) |
2285 | break; | |
034c6ed7 | 2286 | |
acbb0225 | 2287 | return k < 0 ? -errno : -EIO; |
034c6ed7 LP |
2288 | } |
2289 | ||
faf919f1 LP |
2290 | if (w->type == WATCH_UNIT_TIMER) |
2291 | UNIT_VTABLE(w->data.unit)->timer_event(w->data.unit, v, w); | |
2292 | else | |
2293 | job_timer_event(w->data.job, v, w); | |
acbb0225 LP |
2294 | break; |
2295 | } | |
2296 | ||
ef734fd6 LP |
2297 | case WATCH_MOUNT: |
2298 | /* Some mount table change, intended for the mount subsystem */ | |
2299 | mount_fd_event(m, ev->events); | |
2300 | break; | |
2301 | ||
4e434314 LP |
2302 | case WATCH_SWAP: |
2303 | /* Some swap table change, intended for the swap subsystem */ | |
2304 | swap_fd_event(m, ev->events); | |
2305 | break; | |
2306 | ||
f94ea366 LP |
2307 | case WATCH_UDEV: |
2308 | /* Some notification from udev, intended for the device subsystem */ | |
2309 | device_fd_event(m, ev->events); | |
2310 | break; | |
2311 | ||
ea430986 LP |
2312 | case WATCH_DBUS_WATCH: |
2313 | bus_watch_event(m, w, ev->events); | |
2314 | break; | |
2315 | ||
2316 | case WATCH_DBUS_TIMEOUT: | |
2317 | bus_timeout_event(m, w, ev->events); | |
2318 | break; | |
2319 | ||
acbb0225 | 2320 | default: |
c5fd1e57 | 2321 | log_error("event type=%i", w->type); |
acbb0225 | 2322 | assert_not_reached("Unknown epoll event type."); |
034c6ed7 | 2323 | } |
9152c765 LP |
2324 | |
2325 | return 0; | |
2326 | } | |
2327 | ||
2328 | int manager_loop(Manager *m) { | |
2329 | int r; | |
9152c765 | 2330 | |
ea430986 LP |
2331 | RATELIMIT_DEFINE(rl, 1*USEC_PER_SEC, 1000); |
2332 | ||
9152c765 | 2333 | assert(m); |
a16e1123 | 2334 | m->exit_code = MANAGER_RUNNING; |
9152c765 | 2335 | |
fe51822e LP |
2336 | /* Release the path cache */ |
2337 | set_free_free(m->unit_path_cache); | |
2338 | m->unit_path_cache = NULL; | |
2339 | ||
b0c918b9 LP |
2340 | manager_check_finished(m); |
2341 | ||
a4312405 LP |
2342 | /* There might still be some zombies hanging around from |
2343 | * before we were exec()'ed. Leat's reap them */ | |
2344 | if ((r = manager_dispatch_sigchld(m)) < 0) | |
2345 | return r; | |
2346 | ||
a16e1123 | 2347 | while (m->exit_code == MANAGER_RUNNING) { |
957ca890 LP |
2348 | struct epoll_event event; |
2349 | int n; | |
9152c765 | 2350 | |
ea430986 LP |
2351 | if (!ratelimit_test(&rl)) { |
2352 | /* Yay, something is going seriously wrong, pause a little */ | |
2353 | log_warning("Looping too fast. Throttling execution a little."); | |
2354 | sleep(1); | |
2355 | } | |
2356 | ||
37a8e683 | 2357 | if (manager_dispatch_load_queue(m) > 0) |
23a177ef LP |
2358 | continue; |
2359 | ||
37a8e683 | 2360 | if (manager_dispatch_run_queue(m) > 0) |
701cc384 LP |
2361 | continue; |
2362 | ||
37a8e683 | 2363 | if (bus_dispatch(m) > 0) |
c1e1601e | 2364 | continue; |
034c6ed7 | 2365 | |
37a8e683 | 2366 | if (manager_dispatch_cleanup_queue(m) > 0) |
c1e1601e LP |
2367 | continue; |
2368 | ||
37a8e683 | 2369 | if (manager_dispatch_gc_queue(m) > 0) |
c1e1601e LP |
2370 | continue; |
2371 | ||
2372 | if (manager_dispatch_dbus_queue(m) > 0) | |
ea430986 | 2373 | continue; |
ea430986 | 2374 | |
e04aad61 LP |
2375 | if (swap_dispatch_reload(m) > 0) |
2376 | continue; | |
2377 | ||
957ca890 | 2378 | if ((n = epoll_wait(m->epoll_fd, &event, 1, -1)) < 0) { |
9152c765 | 2379 | |
6089f4a9 | 2380 | if (errno == EINTR) |
9152c765 LP |
2381 | continue; |
2382 | ||
2383 | return -errno; | |
2384 | } | |
2385 | ||
957ca890 | 2386 | assert(n == 1); |
b9cd2ec1 | 2387 | |
a16e1123 | 2388 | if ((r = process_event(m, &event)) < 0) |
957ca890 | 2389 | return r; |
a16e1123 | 2390 | } |
957ca890 | 2391 | |
a16e1123 | 2392 | return m->exit_code; |
83c60c9f | 2393 | } |
ea430986 LP |
2394 | |
2395 | int manager_get_unit_from_dbus_path(Manager *m, const char *s, Unit **_u) { | |
2396 | char *n; | |
2397 | Unit *u; | |
2398 | ||
2399 | assert(m); | |
2400 | assert(s); | |
2401 | assert(_u); | |
2402 | ||
2403 | if (!startswith(s, "/org/freedesktop/systemd1/unit/")) | |
2404 | return -EINVAL; | |
2405 | ||
2406 | if (!(n = bus_path_unescape(s+31))) | |
2407 | return -ENOMEM; | |
2408 | ||
2409 | u = manager_get_unit(m, n); | |
2410 | free(n); | |
2411 | ||
2412 | if (!u) | |
2413 | return -ENOENT; | |
2414 | ||
2415 | *_u = u; | |
2416 | ||
2417 | return 0; | |
2418 | } | |
86fbf370 LP |
2419 | |
2420 | int manager_get_job_from_dbus_path(Manager *m, const char *s, Job **_j) { | |
2421 | Job *j; | |
2422 | unsigned id; | |
2423 | int r; | |
2424 | ||
2425 | assert(m); | |
2426 | assert(s); | |
2427 | assert(_j); | |
2428 | ||
2429 | if (!startswith(s, "/org/freedesktop/systemd1/job/")) | |
2430 | return -EINVAL; | |
2431 | ||
2432 | if ((r = safe_atou(s + 30, &id)) < 0) | |
2433 | return r; | |
2434 | ||
2435 | if (!(j = manager_get_job(m, id))) | |
2436 | return -ENOENT; | |
2437 | ||
2438 | *_j = j; | |
2439 | ||
2440 | return 0; | |
2441 | } | |
dfcd764e | 2442 | |
4927fcae | 2443 | void manager_send_unit_audit(Manager *m, Unit *u, int type, bool success) { |
e537352b | 2444 | |
4927fcae LP |
2445 | #ifdef HAVE_AUDIT |
2446 | char *p; | |
e537352b | 2447 | |
4927fcae | 2448 | if (m->audit_fd < 0) |
e537352b LP |
2449 | return; |
2450 | ||
bbd3a7ba LP |
2451 | /* Don't generate audit events if the service was already |
2452 | * started and we're just deserializing */ | |
2453 | if (m->n_deserializing > 0) | |
2454 | return; | |
2455 | ||
f1dd0c3f LP |
2456 | if (m->running_as != MANAGER_SYSTEM) |
2457 | return; | |
2458 | ||
2459 | if (u->meta.type != UNIT_SERVICE) | |
2460 | return; | |
2461 | ||
4927fcae LP |
2462 | if (!(p = unit_name_to_prefix_and_instance(u->meta.id))) { |
2463 | log_error("Failed to allocate unit name for audit message: %s", strerror(ENOMEM)); | |
e537352b LP |
2464 | return; |
2465 | } | |
2466 | ||
391ade86 LP |
2467 | if (audit_log_user_comm_message(m->audit_fd, type, "", p, NULL, NULL, NULL, success) < 0) { |
2468 | log_warning("Failed to send audit message: %m"); | |
2469 | ||
2470 | if (errno == EPERM) { | |
2471 | /* We aren't allowed to send audit messages? | |
2472 | * Then let's not retry again, to avoid | |
2473 | * spamming the user with the same and same | |
2474 | * messages over and over. */ | |
2475 | ||
2476 | audit_close(m->audit_fd); | |
2477 | m->audit_fd = -1; | |
2478 | } | |
2479 | } | |
e537352b | 2480 | |
4927fcae LP |
2481 | free(p); |
2482 | #endif | |
e537352b | 2483 | |
e537352b LP |
2484 | } |
2485 | ||
e983b760 LP |
2486 | void manager_send_unit_plymouth(Manager *m, Unit *u) { |
2487 | int fd = -1; | |
2488 | union sockaddr_union sa; | |
2489 | int n = 0; | |
2490 | char *message = NULL; | |
e983b760 LP |
2491 | |
2492 | /* Don't generate plymouth events if the service was already | |
2493 | * started and we're just deserializing */ | |
2494 | if (m->n_deserializing > 0) | |
2495 | return; | |
2496 | ||
2497 | if (m->running_as != MANAGER_SYSTEM) | |
2498 | return; | |
2499 | ||
2500 | if (u->meta.type != UNIT_SERVICE && | |
2501 | u->meta.type != UNIT_MOUNT && | |
2502 | u->meta.type != UNIT_SWAP) | |
2503 | return; | |
2504 | ||
2505 | /* We set SOCK_NONBLOCK here so that we rather drop the | |
2506 | * message then wait for plymouth */ | |
2507 | if ((fd = socket(AF_UNIX, SOCK_STREAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0)) < 0) { | |
2508 | log_error("socket() failed: %m"); | |
2509 | return; | |
2510 | } | |
2511 | ||
2512 | zero(sa); | |
2513 | sa.sa.sa_family = AF_UNIX; | |
96707269 LP |
2514 | strncpy(sa.un.sun_path+1, "/org/freedesktop/plymouthd", sizeof(sa.un.sun_path)-1); |
2515 | if (connect(fd, &sa.sa, offsetof(struct sockaddr_un, sun_path) + 1 + strlen(sa.un.sun_path+1)) < 0) { | |
e983b760 LP |
2516 | |
2517 | if (errno != EPIPE && | |
2518 | errno != EAGAIN && | |
2519 | errno != ENOENT && | |
2520 | errno != ECONNREFUSED && | |
2521 | errno != ECONNRESET && | |
2522 | errno != ECONNABORTED) | |
2523 | log_error("connect() failed: %m"); | |
2524 | ||
2525 | goto finish; | |
2526 | } | |
2527 | ||
2528 | if (asprintf(&message, "U\002%c%s%n", (int) (strlen(u->meta.id) + 1), u->meta.id, &n) < 0) { | |
2529 | log_error("Out of memory"); | |
2530 | goto finish; | |
2531 | } | |
2532 | ||
2533 | errno = 0; | |
bd40a2d8 | 2534 | if (write(fd, message, n + 1) != n + 1) { |
e983b760 LP |
2535 | |
2536 | if (errno != EPIPE && | |
2537 | errno != EAGAIN && | |
2538 | errno != ENOENT && | |
2539 | errno != ECONNREFUSED && | |
2540 | errno != ECONNRESET && | |
2541 | errno != ECONNABORTED) | |
2542 | log_error("Failed to write Plymouth message: %m"); | |
2543 | ||
2544 | goto finish; | |
2545 | } | |
2546 | ||
2547 | finish: | |
2548 | if (fd >= 0) | |
2549 | close_nointr_nofail(fd); | |
2550 | ||
2551 | free(message); | |
2552 | } | |
2553 | ||
05e343b7 LP |
2554 | void manager_dispatch_bus_name_owner_changed( |
2555 | Manager *m, | |
2556 | const char *name, | |
2557 | const char* old_owner, | |
2558 | const char *new_owner) { | |
2559 | ||
2560 | Unit *u; | |
2561 | ||
2562 | assert(m); | |
2563 | assert(name); | |
2564 | ||
2565 | if (!(u = hashmap_get(m->watch_bus, name))) | |
2566 | return; | |
2567 | ||
2568 | UNIT_VTABLE(u)->bus_name_owner_change(u, name, old_owner, new_owner); | |
2569 | } | |
2570 | ||
2571 | void manager_dispatch_bus_query_pid_done( | |
2572 | Manager *m, | |
2573 | const char *name, | |
2574 | pid_t pid) { | |
2575 | ||
2576 | Unit *u; | |
2577 | ||
2578 | assert(m); | |
2579 | assert(name); | |
2580 | assert(pid >= 1); | |
2581 | ||
2582 | if (!(u = hashmap_get(m->watch_bus, name))) | |
2583 | return; | |
2584 | ||
2585 | UNIT_VTABLE(u)->bus_query_pid_done(u, name, pid); | |
2586 | } | |
2587 | ||
d8d5ab98 | 2588 | int manager_open_serialization(Manager *m, FILE **_f) { |
b925e726 | 2589 | char *path = NULL; |
a16e1123 LP |
2590 | mode_t saved_umask; |
2591 | int fd; | |
2592 | FILE *f; | |
2593 | ||
2594 | assert(_f); | |
2595 | ||
b925e726 | 2596 | if (m->running_as == MANAGER_SYSTEM) |
2b583ce6 | 2597 | asprintf(&path, "/run/systemd/dump-%lu-XXXXXX", (unsigned long) getpid()); |
b925e726 LP |
2598 | else |
2599 | asprintf(&path, "/tmp/systemd-dump-%lu-XXXXXX", (unsigned long) getpid()); | |
d8d5ab98 | 2600 | |
b925e726 LP |
2601 | if (!path) |
2602 | return -ENOMEM; | |
a16e1123 LP |
2603 | |
2604 | saved_umask = umask(0077); | |
2605 | fd = mkostemp(path, O_RDWR|O_CLOEXEC); | |
2606 | umask(saved_umask); | |
2607 | ||
2608 | if (fd < 0) { | |
2609 | free(path); | |
2610 | return -errno; | |
2611 | } | |
2612 | ||
2613 | unlink(path); | |
2614 | ||
2615 | log_debug("Serializing state to %s", path); | |
2616 | free(path); | |
2617 | ||
2618 | if (!(f = fdopen(fd, "w+")) < 0) | |
2619 | return -errno; | |
2620 | ||
2621 | *_f = f; | |
2622 | ||
2623 | return 0; | |
2624 | } | |
2625 | ||
2626 | int manager_serialize(Manager *m, FILE *f, FDSet *fds) { | |
2627 | Iterator i; | |
2628 | Unit *u; | |
2629 | const char *t; | |
2630 | int r; | |
2631 | ||
2632 | assert(m); | |
2633 | assert(f); | |
2634 | assert(fds); | |
2635 | ||
e9ddabc2 | 2636 | dual_timestamp_serialize(f, "initrd-timestamp", &m->initrd_timestamp); |
10717a1a LP |
2637 | dual_timestamp_serialize(f, "startup-timestamp", &m->startup_timestamp); |
2638 | dual_timestamp_serialize(f, "finish-timestamp", &m->finish_timestamp); | |
47a483a1 | 2639 | |
f2382a94 LP |
2640 | fputc('\n', f); |
2641 | ||
a16e1123 LP |
2642 | HASHMAP_FOREACH_KEY(u, t, m->units, i) { |
2643 | if (u->meta.id != t) | |
2644 | continue; | |
2645 | ||
2646 | if (!unit_can_serialize(u)) | |
2647 | continue; | |
2648 | ||
2649 | /* Start marker */ | |
2650 | fputs(u->meta.id, f); | |
2651 | fputc('\n', f); | |
2652 | ||
2653 | if ((r = unit_serialize(u, f, fds)) < 0) | |
2654 | return r; | |
2655 | } | |
2656 | ||
2657 | if (ferror(f)) | |
2658 | return -EIO; | |
2659 | ||
2660 | return 0; | |
2661 | } | |
2662 | ||
2663 | int manager_deserialize(Manager *m, FILE *f, FDSet *fds) { | |
2664 | int r = 0; | |
2665 | ||
2666 | assert(m); | |
2667 | assert(f); | |
2668 | ||
2669 | log_debug("Deserializing state..."); | |
2670 | ||
9f611ad8 | 2671 | m->n_deserializing ++; |
82c64bf5 | 2672 | |
10f8e83c LP |
2673 | for (;;) { |
2674 | char line[1024], *l; | |
2675 | ||
2676 | if (!fgets(line, sizeof(line), f)) { | |
2677 | if (feof(f)) | |
2678 | r = 0; | |
2679 | else | |
2680 | r = -errno; | |
2681 | ||
2682 | goto finish; | |
2683 | } | |
2684 | ||
2685 | char_array_0(line); | |
2686 | l = strstrip(line); | |
2687 | ||
2688 | if (l[0] == 0) | |
2689 | break; | |
2690 | ||
e9ddabc2 LP |
2691 | if (startswith(l, "initrd-timestamp=")) |
2692 | dual_timestamp_deserialize(l+17, &m->initrd_timestamp); | |
2693 | else if (startswith(l, "startup-timestamp=")) | |
799fd0fd | 2694 | dual_timestamp_deserialize(l+18, &m->startup_timestamp); |
10717a1a | 2695 | else if (startswith(l, "finish-timestamp=")) |
799fd0fd | 2696 | dual_timestamp_deserialize(l+17, &m->finish_timestamp); |
10717a1a | 2697 | else |
10f8e83c LP |
2698 | log_debug("Unknown serialization item '%s'", l); |
2699 | } | |
2700 | ||
a16e1123 LP |
2701 | for (;;) { |
2702 | Unit *u; | |
2703 | char name[UNIT_NAME_MAX+2]; | |
2704 | ||
2705 | /* Start marker */ | |
2706 | if (!fgets(name, sizeof(name), f)) { | |
2707 | if (feof(f)) | |
10f8e83c LP |
2708 | r = 0; |
2709 | else | |
2710 | r = -errno; | |
a16e1123 | 2711 | |
82c64bf5 | 2712 | goto finish; |
a16e1123 LP |
2713 | } |
2714 | ||
2715 | char_array_0(name); | |
2716 | ||
398ef8ba | 2717 | if ((r = manager_load_unit(m, strstrip(name), NULL, NULL, &u)) < 0) |
82c64bf5 | 2718 | goto finish; |
a16e1123 LP |
2719 | |
2720 | if ((r = unit_deserialize(u, f, fds)) < 0) | |
82c64bf5 | 2721 | goto finish; |
a16e1123 LP |
2722 | } |
2723 | ||
10f8e83c | 2724 | finish: |
82c64bf5 LP |
2725 | if (ferror(f)) { |
2726 | r = -EIO; | |
2727 | goto finish; | |
2728 | } | |
a16e1123 | 2729 | |
9f611ad8 LP |
2730 | assert(m->n_deserializing > 0); |
2731 | m->n_deserializing --; | |
82c64bf5 LP |
2732 | |
2733 | return r; | |
a16e1123 LP |
2734 | } |
2735 | ||
2736 | int manager_reload(Manager *m) { | |
2737 | int r, q; | |
2738 | FILE *f; | |
2739 | FDSet *fds; | |
2740 | ||
2741 | assert(m); | |
2742 | ||
d8d5ab98 | 2743 | if ((r = manager_open_serialization(m, &f)) < 0) |
a16e1123 LP |
2744 | return r; |
2745 | ||
2746 | if (!(fds = fdset_new())) { | |
2747 | r = -ENOMEM; | |
2748 | goto finish; | |
2749 | } | |
2750 | ||
2751 | if ((r = manager_serialize(m, f, fds)) < 0) | |
2752 | goto finish; | |
2753 | ||
2754 | if (fseeko(f, 0, SEEK_SET) < 0) { | |
2755 | r = -errno; | |
2756 | goto finish; | |
2757 | } | |
2758 | ||
2759 | /* From here on there is no way back. */ | |
2760 | manager_clear_jobs_and_units(m); | |
5a1e9937 | 2761 | manager_undo_generators(m); |
a16e1123 | 2762 | |
2ded0c04 | 2763 | /* Find new unit paths */ |
84e3543e LP |
2764 | lookup_paths_free(&m->lookup_paths); |
2765 | if ((q = lookup_paths_init(&m->lookup_paths, m->running_as)) < 0) | |
2ded0c04 LP |
2766 | r = q; |
2767 | ||
5a1e9937 LP |
2768 | manager_run_generators(m); |
2769 | ||
2770 | manager_build_unit_path_cache(m); | |
2771 | ||
9f611ad8 LP |
2772 | m->n_deserializing ++; |
2773 | ||
a16e1123 LP |
2774 | /* First, enumerate what we can from all config files */ |
2775 | if ((q = manager_enumerate(m)) < 0) | |
2776 | r = q; | |
2777 | ||
2778 | /* Second, deserialize our stored data */ | |
2779 | if ((q = manager_deserialize(m, f, fds)) < 0) | |
2780 | r = q; | |
2781 | ||
2782 | fclose(f); | |
2783 | f = NULL; | |
2784 | ||
2785 | /* Third, fire things up! */ | |
2786 | if ((q = manager_coldplug(m)) < 0) | |
2787 | r = q; | |
2788 | ||
9f611ad8 LP |
2789 | assert(m->n_deserializing > 0); |
2790 | m->n_deserializing ++; | |
2791 | ||
a16e1123 LP |
2792 | finish: |
2793 | if (f) | |
2794 | fclose(f); | |
2795 | ||
2796 | if (fds) | |
2797 | fdset_free(fds); | |
2798 | ||
2799 | return r; | |
2800 | } | |
2801 | ||
9e58ff9c LP |
2802 | bool manager_is_booting_or_shutting_down(Manager *m) { |
2803 | Unit *u; | |
2804 | ||
2805 | assert(m); | |
2806 | ||
2807 | /* Is the initial job still around? */ | |
2808 | if (manager_get_job(m, 1)) | |
2809 | return true; | |
2810 | ||
2811 | /* Is there a job for the shutdown target? */ | |
2812 | if (((u = manager_get_unit(m, SPECIAL_SHUTDOWN_TARGET)))) | |
2813 | return !!u->meta.job; | |
2814 | ||
2815 | return false; | |
2816 | } | |
2817 | ||
fdf20a31 | 2818 | void manager_reset_failed(Manager *m) { |
5632e374 LP |
2819 | Unit *u; |
2820 | Iterator i; | |
2821 | ||
2822 | assert(m); | |
2823 | ||
2824 | HASHMAP_FOREACH(u, m->units, i) | |
fdf20a31 | 2825 | unit_reset_failed(u); |
5632e374 LP |
2826 | } |
2827 | ||
8f6df3fa LP |
2828 | bool manager_unit_pending_inactive(Manager *m, const char *name) { |
2829 | Unit *u; | |
2830 | ||
2831 | assert(m); | |
2832 | assert(name); | |
2833 | ||
2834 | /* Returns true if the unit is inactive or going down */ | |
8f6df3fa LP |
2835 | if (!(u = manager_get_unit(m, name))) |
2836 | return true; | |
2837 | ||
18ffdfda | 2838 | return unit_pending_inactive(u); |
8f6df3fa LP |
2839 | } |
2840 | ||
b0c918b9 | 2841 | void manager_check_finished(Manager *m) { |
e9ddabc2 | 2842 | char userspace[FORMAT_TIMESPAN_MAX], initrd[FORMAT_TIMESPAN_MAX], kernel[FORMAT_TIMESPAN_MAX], sum[FORMAT_TIMESPAN_MAX]; |
b0c918b9 LP |
2843 | |
2844 | assert(m); | |
2845 | ||
2846 | if (dual_timestamp_is_set(&m->finish_timestamp)) | |
2847 | return; | |
2848 | ||
2849 | if (hashmap_size(m->jobs) > 0) | |
2850 | return; | |
2851 | ||
2852 | dual_timestamp_get(&m->finish_timestamp); | |
2853 | ||
e03ae661 LP |
2854 | if (m->running_as == MANAGER_SYSTEM && detect_container(NULL) <= 0) { |
2855 | ||
e9ddabc2 LP |
2856 | if (dual_timestamp_is_set(&m->initrd_timestamp)) { |
2857 | log_info("Startup finished in %s (kernel) + %s (initrd) + %s (userspace) = %s.", | |
2858 | format_timespan(kernel, sizeof(kernel), | |
2859 | m->initrd_timestamp.monotonic), | |
2860 | format_timespan(initrd, sizeof(initrd), | |
2861 | m->startup_timestamp.monotonic - m->initrd_timestamp.monotonic), | |
2862 | format_timespan(userspace, sizeof(userspace), | |
2863 | m->finish_timestamp.monotonic - m->startup_timestamp.monotonic), | |
2864 | format_timespan(sum, sizeof(sum), | |
2865 | m->finish_timestamp.monotonic)); | |
2866 | } else | |
2867 | log_info("Startup finished in %s (kernel) + %s (userspace) = %s.", | |
2868 | format_timespan(kernel, sizeof(kernel), | |
2869 | m->startup_timestamp.monotonic), | |
2870 | format_timespan(userspace, sizeof(userspace), | |
2871 | m->finish_timestamp.monotonic - m->startup_timestamp.monotonic), | |
2872 | format_timespan(sum, sizeof(sum), | |
2873 | m->finish_timestamp.monotonic)); | |
2874 | } else | |
b0c918b9 LP |
2875 | log_debug("Startup finished in %s.", |
2876 | format_timespan(userspace, sizeof(userspace), | |
2877 | m->finish_timestamp.monotonic - m->startup_timestamp.monotonic)); | |
2878 | ||
2879 | } | |
2880 | ||
5a1e9937 LP |
2881 | void manager_run_generators(Manager *m) { |
2882 | DIR *d = NULL; | |
5a1e9937 | 2883 | const char *generator_path; |
83cc030f | 2884 | const char *argv[3]; |
5a1e9937 LP |
2885 | |
2886 | assert(m); | |
2887 | ||
af2d49f7 | 2888 | generator_path = m->running_as == MANAGER_SYSTEM ? SYSTEM_GENERATOR_PATH : USER_GENERATOR_PATH; |
5a1e9937 LP |
2889 | if (!(d = opendir(generator_path))) { |
2890 | ||
2891 | if (errno == ENOENT) | |
2892 | return; | |
2893 | ||
2894 | log_error("Failed to enumerate generator directory: %m"); | |
2895 | return; | |
2896 | } | |
2897 | ||
2898 | if (!m->generator_unit_path) { | |
2899 | char *p; | |
2b583ce6 | 2900 | char system_path[] = "/run/systemd/generator-XXXXXX", |
af2d49f7 | 2901 | user_path[] = "/tmp/systemd-generator-XXXXXX"; |
5a1e9937 | 2902 | |
af2d49f7 | 2903 | if (!(p = mkdtemp(m->running_as == MANAGER_SYSTEM ? system_path : user_path))) { |
5a1e9937 LP |
2904 | log_error("Failed to generate generator directory: %m"); |
2905 | goto finish; | |
2906 | } | |
2907 | ||
2908 | if (!(m->generator_unit_path = strdup(p))) { | |
2909 | log_error("Failed to allocate generator unit path."); | |
2910 | goto finish; | |
2911 | } | |
2912 | } | |
2913 | ||
83cc030f LP |
2914 | argv[0] = NULL; /* Leave this empty, execute_directory() will fill something in */ |
2915 | argv[1] = m->generator_unit_path; | |
2916 | argv[2] = NULL; | |
5a1e9937 | 2917 | |
83cc030f | 2918 | execute_directory(generator_path, d, (char**) argv); |
5a1e9937 LP |
2919 | |
2920 | if (rmdir(m->generator_unit_path) >= 0) { | |
2921 | /* Uh? we were able to remove this dir? I guess that | |
2922 | * means the directory was empty, hence let's shortcut | |
2923 | * this */ | |
2924 | ||
2925 | free(m->generator_unit_path); | |
2926 | m->generator_unit_path = NULL; | |
2927 | goto finish; | |
2928 | } | |
2929 | ||
2930 | if (!strv_find(m->lookup_paths.unit_path, m->generator_unit_path)) { | |
2931 | char **l; | |
2932 | ||
2933 | if (!(l = strv_append(m->lookup_paths.unit_path, m->generator_unit_path))) { | |
2934 | log_error("Failed to add generator directory to unit search path: %m"); | |
2935 | goto finish; | |
2936 | } | |
2937 | ||
2938 | strv_free(m->lookup_paths.unit_path); | |
2939 | m->lookup_paths.unit_path = l; | |
7f4e0805 LP |
2940 | |
2941 | log_debug("Added generator unit path %s to search path.", m->generator_unit_path); | |
5a1e9937 LP |
2942 | } |
2943 | ||
2944 | finish: | |
2945 | if (d) | |
2946 | closedir(d); | |
5a1e9937 LP |
2947 | } |
2948 | ||
2949 | void manager_undo_generators(Manager *m) { | |
2950 | assert(m); | |
2951 | ||
2952 | if (!m->generator_unit_path) | |
2953 | return; | |
2954 | ||
2955 | strv_remove(m->lookup_paths.unit_path, m->generator_unit_path); | |
2956 | rm_rf(m->generator_unit_path, false, true); | |
2957 | ||
2958 | free(m->generator_unit_path); | |
2959 | m->generator_unit_path = NULL; | |
2960 | } | |
2961 | ||
06d4c99a LP |
2962 | int manager_set_default_controllers(Manager *m, char **controllers) { |
2963 | char **l; | |
2964 | ||
2965 | assert(m); | |
2966 | ||
2967 | if (!(l = strv_copy(controllers))) | |
2968 | return -ENOMEM; | |
2969 | ||
2970 | strv_free(m->default_controllers); | |
2971 | m->default_controllers = l; | |
2972 | ||
2973 | return 0; | |
2974 | } | |
2975 | ||
f1dd0c3f LP |
2976 | void manager_recheck_syslog(Manager *m) { |
2977 | Unit *u; | |
2978 | ||
2979 | assert(m); | |
2980 | ||
2981 | if (m->running_as != MANAGER_SYSTEM) | |
2982 | return; | |
2983 | ||
2984 | if ((u = manager_get_unit(m, SPECIAL_SYSLOG_SOCKET))) { | |
2985 | SocketState state; | |
2986 | ||
2987 | state = SOCKET(u)->state; | |
2988 | ||
2989 | if (state != SOCKET_DEAD && | |
2990 | state != SOCKET_FAILED && | |
2991 | state != SOCKET_RUNNING) { | |
2992 | ||
2993 | /* Hmm, the socket is not set up, or is still | |
2994 | * listening, let's better not try to use | |
2995 | * it. Note that we have no problem if the | |
2996 | * socket is completely down, since there | |
2997 | * might be a foreign /dev/log socket around | |
2998 | * and we want to make use of that. | |
2999 | */ | |
3000 | ||
3001 | log_close_syslog(); | |
3002 | return; | |
3003 | } | |
3004 | } | |
3005 | ||
3006 | if ((u = manager_get_unit(m, SPECIAL_SYSLOG_TARGET))) | |
3007 | if (TARGET(u)->state != TARGET_ACTIVE) { | |
3008 | log_close_syslog(); | |
3009 | return; | |
3010 | } | |
3011 | ||
3012 | /* Hmm, OK, so the socket is either fully up, or fully down, | |
3013 | * and the target is up, then let's make use of the socket */ | |
3014 | log_open(); | |
3015 | } | |
3016 | ||
dfcd764e | 3017 | static const char* const manager_running_as_table[_MANAGER_RUNNING_AS_MAX] = { |
dfcd764e | 3018 | [MANAGER_SYSTEM] = "system", |
af2d49f7 | 3019 | [MANAGER_USER] = "user" |
dfcd764e LP |
3020 | }; |
3021 | ||
3022 | DEFINE_STRING_TABLE_LOOKUP(manager_running_as, ManagerRunningAs); |