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