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