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