chiark / gitweb /
manager: don't consider transaction jobs conflicting with queued jobs redundant
[elogind.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 travelling */
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          * whith 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 unmergable 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 axisting 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                 DBusError *e,
1416                 Job **_ret) {
1417         Job *ret;
1418         Iterator i;
1419         Unit *dep;
1420         int r;
1421         bool is_new;
1422
1423         assert(m);
1424         assert(type < _JOB_TYPE_MAX);
1425         assert(unit);
1426
1427         /* log_debug("Pulling in %s/%s from %s/%s", */
1428         /*           unit->meta.id, job_type_to_string(type), */
1429         /*           by ? by->unit->meta.id : "NA", */
1430         /*           by ? job_type_to_string(by->type) : "NA"); */
1431
1432         if (unit->meta.load_state != UNIT_LOADED &&
1433             unit->meta.load_state != UNIT_ERROR &&
1434             unit->meta.load_state != UNIT_MASKED) {
1435                 dbus_set_error(e, BUS_ERROR_LOAD_FAILED, "Unit %s is not loaded properly.", unit->meta.id);
1436                 return -EINVAL;
1437         }
1438
1439         if (type != JOB_STOP && unit->meta.load_state == UNIT_ERROR) {
1440                 dbus_set_error(e, BUS_ERROR_LOAD_FAILED,
1441                                "Unit %s failed to load: %s. "
1442                                "See system logs and 'systemctl status' for details.",
1443                                unit->meta.id,
1444                                strerror(-unit->meta.load_error));
1445                 return -EINVAL;
1446         }
1447
1448         if (type != JOB_STOP && unit->meta.load_state == UNIT_MASKED) {
1449                 dbus_set_error(e, BUS_ERROR_MASKED, "Unit %s is masked.", unit->meta.id);
1450                 return -EINVAL;
1451         }
1452
1453         if (!unit_job_is_applicable(unit, type)) {
1454                 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);
1455                 return -EBADR;
1456         }
1457
1458         /* First add the job. */
1459         if (!(ret = transaction_add_one_job(m, type, unit, override, &is_new)))
1460                 return -ENOMEM;
1461
1462         /* Then, add a link to the job. */
1463         if (!job_dependency_new(by, ret, matters, conflicts))
1464                 return -ENOMEM;
1465
1466         if (is_new) {
1467                 Set *following;
1468
1469                 /* If we are following some other unit, make sure we
1470                  * add all dependencies of everybody following. */
1471                 if (unit_following_set(ret->unit, &following) > 0) {
1472                         SET_FOREACH(dep, following, i)
1473                                 if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, false, override, false, e, NULL)) < 0) {
1474                                         log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r));
1475
1476                                         if (e)
1477                                                 dbus_error_free(e);
1478                                 }
1479
1480                         set_free(following);
1481                 }
1482
1483                 /* Finally, recursively add in all dependencies. */
1484                 if (type == JOB_START || type == JOB_RELOAD_OR_START) {
1485                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES], i)
1486                                 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, override, false, e, NULL)) < 0) {
1487                                         if (r != -EBADR)
1488                                                 goto fail;
1489
1490                                         if (e)
1491                                                 dbus_error_free(e);
1492                                 }
1493
1494                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_BIND_TO], i)
1495                                 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, override, false, e, NULL)) < 0) {
1496
1497                                         if (r != -EBADR)
1498                                                 goto fail;
1499
1500                                         if (e)
1501                                                 dbus_error_free(e);
1502                                 }
1503
1504                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
1505                                 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, !override, override, false, e, NULL)) < 0) {
1506                                         log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r));
1507
1508                                         if (e)
1509                                                 dbus_error_free(e);
1510                                 }
1511
1512                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_WANTS], i)
1513                                 if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, false, false, false, e, NULL)) < 0) {
1514                                         log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r));
1515
1516                                         if (e)
1517                                                 dbus_error_free(e);
1518                                 }
1519
1520                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE], i)
1521                                 if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, true, override, false, e, NULL)) < 0) {
1522
1523                                         if (r != -EBADR)
1524                                                 goto fail;
1525
1526                                         if (e)
1527                                                 dbus_error_free(e);
1528                                 }
1529
1530                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE_OVERRIDABLE], i)
1531                                 if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, !override, override, false, e, NULL)) < 0) {
1532                                         log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r));
1533
1534                                         if (e)
1535                                                 dbus_error_free(e);
1536                                 }
1537
1538                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTS], i)
1539                                 if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, true, override, true, e, NULL)) < 0) {
1540
1541                                         if (r != -EBADR)
1542                                                 goto fail;
1543
1544                                         if (e)
1545                                                 dbus_error_free(e);
1546                                 }
1547
1548                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTED_BY], i)
1549                                 if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, false, override, false, e, NULL)) < 0) {
1550                                         log_warning("Cannot add dependency job for unit %s, ignoring: %s", dep->meta.id, bus_error(e, r));
1551
1552                                         if (e)
1553                                                 dbus_error_free(e);
1554                                 }
1555
1556                 } else if (type == JOB_STOP || type == JOB_RESTART || type == JOB_TRY_RESTART) {
1557
1558                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRED_BY], i)
1559                                 if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, override, false, e, NULL)) < 0) {
1560
1561                                         if (r != -EBADR)
1562                                                 goto fail;
1563
1564                                         if (e)
1565                                                 dbus_error_free(e);
1566                                 }
1567
1568                         SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_BOUND_BY], i)
1569                                 if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, override, false, e, NULL)) < 0) {
1570
1571                                         if (r != -EBADR)
1572                                                 goto fail;
1573
1574                                         if (e)
1575                                                 dbus_error_free(e);
1576                                 }
1577                 }
1578
1579                 /* JOB_VERIFY_STARTED, JOB_RELOAD require no dependency handling */
1580         }
1581
1582         if (_ret)
1583                 *_ret = ret;
1584
1585         return 0;
1586
1587 fail:
1588         return r;
1589 }
1590
1591 static int transaction_add_isolate_jobs(Manager *m) {
1592         Iterator i;
1593         Unit *u;
1594         char *k;
1595         int r;
1596
1597         assert(m);
1598
1599         HASHMAP_FOREACH_KEY(u, k, m->units, i) {
1600
1601                 /* ignore aliases */
1602                 if (u->meta.id != k)
1603                         continue;
1604
1605                 if (UNIT_VTABLE(u)->no_isolate)
1606                         continue;
1607
1608                 /* No need to stop inactive jobs */
1609                 if (UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(u)) && !u->meta.job)
1610                         continue;
1611
1612                 /* Is there already something listed for this? */
1613                 if (hashmap_get(m->transaction_jobs, u))
1614                         continue;
1615
1616                 if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, u, NULL, true, false, false, NULL, NULL)) < 0)
1617                         log_warning("Cannot add isolate job for unit %s, ignoring: %s", u->meta.id, strerror(-r));
1618         }
1619
1620         return 0;
1621 }
1622
1623 int manager_add_job(Manager *m, JobType type, Unit *unit, JobMode mode, bool override, DBusError *e, Job **_ret) {
1624         int r;
1625         Job *ret;
1626
1627         assert(m);
1628         assert(type < _JOB_TYPE_MAX);
1629         assert(unit);
1630         assert(mode < _JOB_MODE_MAX);
1631
1632         if (mode == JOB_ISOLATE && type != JOB_START) {
1633                 dbus_set_error(e, BUS_ERROR_INVALID_JOB_MODE, "Isolate is only valid for start.");
1634                 return -EINVAL;
1635         }
1636
1637         if (mode == JOB_ISOLATE && !unit->meta.allow_isolate) {
1638                 dbus_set_error(e, BUS_ERROR_NO_ISOLATION, "Operation refused, unit may not be isolated.");
1639                 return -EPERM;
1640         }
1641
1642         log_debug("Trying to enqueue job %s/%s/%s", unit->meta.id, job_type_to_string(type), job_mode_to_string(mode));
1643
1644         if ((r = transaction_add_job_and_dependencies(m, type, unit, NULL, true, override, false, e, &ret)) < 0) {
1645                 transaction_abort(m);
1646                 return r;
1647         }
1648
1649         if (mode == JOB_ISOLATE)
1650                 if ((r = transaction_add_isolate_jobs(m)) < 0) {
1651                         transaction_abort(m);
1652                         return r;
1653                 }
1654
1655         if ((r = transaction_activate(m, mode, e)) < 0)
1656                 return r;
1657
1658         log_debug("Enqueued job %s/%s as %u", unit->meta.id, job_type_to_string(type), (unsigned) ret->id);
1659
1660         if (_ret)
1661                 *_ret = ret;
1662
1663         return 0;
1664 }
1665
1666 int manager_add_job_by_name(Manager *m, JobType type, const char *name, JobMode mode, bool override, DBusError *e, Job **_ret) {
1667         Unit *unit;
1668         int r;
1669
1670         assert(m);
1671         assert(type < _JOB_TYPE_MAX);
1672         assert(name);
1673         assert(mode < _JOB_MODE_MAX);
1674
1675         if ((r = manager_load_unit(m, name, NULL, NULL, &unit)) < 0)
1676                 return r;
1677
1678         return manager_add_job(m, type, unit, mode, override, e, _ret);
1679 }
1680
1681 Job *manager_get_job(Manager *m, uint32_t id) {
1682         assert(m);
1683
1684         return hashmap_get(m->jobs, UINT32_TO_PTR(id));
1685 }
1686
1687 Unit *manager_get_unit(Manager *m, const char *name) {
1688         assert(m);
1689         assert(name);
1690
1691         return hashmap_get(m->units, name);
1692 }
1693
1694 unsigned manager_dispatch_load_queue(Manager *m) {
1695         Meta *meta;
1696         unsigned n = 0;
1697
1698         assert(m);
1699
1700         /* Make sure we are not run recursively */
1701         if (m->dispatching_load_queue)
1702                 return 0;
1703
1704         m->dispatching_load_queue = true;
1705
1706         /* Dispatches the load queue. Takes a unit from the queue and
1707          * tries to load its data until the queue is empty */
1708
1709         while ((meta = m->load_queue)) {
1710                 assert(meta->in_load_queue);
1711
1712                 unit_load((Unit*) meta);
1713                 n++;
1714         }
1715
1716         m->dispatching_load_queue = false;
1717         return n;
1718 }
1719
1720 int manager_load_unit_prepare(Manager *m, const char *name, const char *path, DBusError *e, Unit **_ret) {
1721         Unit *ret;
1722         int r;
1723
1724         assert(m);
1725         assert(name || path);
1726
1727         /* This will prepare the unit for loading, but not actually
1728          * load anything from disk. */
1729
1730         if (path && !is_path(path)) {
1731                 dbus_set_error(e, BUS_ERROR_INVALID_PATH, "Path %s is not absolute.", path);
1732                 return -EINVAL;
1733         }
1734
1735         if (!name)
1736                 name = file_name_from_path(path);
1737
1738         if (!unit_name_is_valid(name, false)) {
1739                 dbus_set_error(e, BUS_ERROR_INVALID_NAME, "Unit name %s is not valid.", name);
1740                 return -EINVAL;
1741         }
1742
1743         if ((ret = manager_get_unit(m, name))) {
1744                 *_ret = ret;
1745                 return 1;
1746         }
1747
1748         if (!(ret = unit_new(m)))
1749                 return -ENOMEM;
1750
1751         if (path)
1752                 if (!(ret->meta.fragment_path = strdup(path))) {
1753                         unit_free(ret);
1754                         return -ENOMEM;
1755                 }
1756
1757         if ((r = unit_add_name(ret, name)) < 0) {
1758                 unit_free(ret);
1759                 return r;
1760         }
1761
1762         unit_add_to_load_queue(ret);
1763         unit_add_to_dbus_queue(ret);
1764         unit_add_to_gc_queue(ret);
1765
1766         if (_ret)
1767                 *_ret = ret;
1768
1769         return 0;
1770 }
1771
1772 int manager_load_unit(Manager *m, const char *name, const char *path, DBusError *e, Unit **_ret) {
1773         int r;
1774
1775         assert(m);
1776
1777         /* This will load the service information files, but not actually
1778          * start any services or anything. */
1779
1780         if ((r = manager_load_unit_prepare(m, name, path, e, _ret)) != 0)
1781                 return r;
1782
1783         manager_dispatch_load_queue(m);
1784
1785         if (_ret)
1786                 *_ret = unit_follow_merge(*_ret);
1787
1788         return 0;
1789 }
1790
1791 void manager_dump_jobs(Manager *s, FILE *f, const char *prefix) {
1792         Iterator i;
1793         Job *j;
1794
1795         assert(s);
1796         assert(f);
1797
1798         HASHMAP_FOREACH(j, s->jobs, i)
1799                 job_dump(j, f, prefix);
1800 }
1801
1802 void manager_dump_units(Manager *s, FILE *f, const char *prefix) {
1803         Iterator i;
1804         Unit *u;
1805         const char *t;
1806
1807         assert(s);
1808         assert(f);
1809
1810         HASHMAP_FOREACH_KEY(u, t, s->units, i)
1811                 if (u->meta.id == t)
1812                         unit_dump(u, f, prefix);
1813 }
1814
1815 void manager_clear_jobs(Manager *m) {
1816         Job *j;
1817
1818         assert(m);
1819
1820         transaction_abort(m);
1821
1822         while ((j = hashmap_first(m->jobs)))
1823                 job_free(j);
1824 }
1825
1826 unsigned manager_dispatch_run_queue(Manager *m) {
1827         Job *j;
1828         unsigned n = 0;
1829
1830         if (m->dispatching_run_queue)
1831                 return 0;
1832
1833         m->dispatching_run_queue = true;
1834
1835         while ((j = m->run_queue)) {
1836                 assert(j->installed);
1837                 assert(j->in_run_queue);
1838
1839                 job_run_and_invalidate(j);
1840                 n++;
1841         }
1842
1843         m->dispatching_run_queue = false;
1844         return n;
1845 }
1846
1847 unsigned manager_dispatch_dbus_queue(Manager *m) {
1848         Job *j;
1849         Meta *meta;
1850         unsigned n = 0;
1851
1852         assert(m);
1853
1854         if (m->dispatching_dbus_queue)
1855                 return 0;
1856
1857         m->dispatching_dbus_queue = true;
1858
1859         while ((meta = m->dbus_unit_queue)) {
1860                 assert(meta->in_dbus_queue);
1861
1862                 bus_unit_send_change_signal((Unit*) meta);
1863                 n++;
1864         }
1865
1866         while ((j = m->dbus_job_queue)) {
1867                 assert(j->in_dbus_queue);
1868
1869                 bus_job_send_change_signal(j);
1870                 n++;
1871         }
1872
1873         m->dispatching_dbus_queue = false;
1874         return n;
1875 }
1876
1877 static int manager_process_notify_fd(Manager *m) {
1878         ssize_t n;
1879
1880         assert(m);
1881
1882         for (;;) {
1883                 char buf[4096];
1884                 struct msghdr msghdr;
1885                 struct iovec iovec;
1886                 struct ucred *ucred;
1887                 union {
1888                         struct cmsghdr cmsghdr;
1889                         uint8_t buf[CMSG_SPACE(sizeof(struct ucred))];
1890                 } control;
1891                 Unit *u;
1892                 char **tags;
1893
1894                 zero(iovec);
1895                 iovec.iov_base = buf;
1896                 iovec.iov_len = sizeof(buf)-1;
1897
1898                 zero(control);
1899                 zero(msghdr);
1900                 msghdr.msg_iov = &iovec;
1901                 msghdr.msg_iovlen = 1;
1902                 msghdr.msg_control = &control;
1903                 msghdr.msg_controllen = sizeof(control);
1904
1905                 if ((n = recvmsg(m->notify_watch.fd, &msghdr, MSG_DONTWAIT)) <= 0) {
1906                         if (n >= 0)
1907                                 return -EIO;
1908
1909                         if (errno == EAGAIN || errno == EINTR)
1910                                 break;
1911
1912                         return -errno;
1913                 }
1914
1915                 if (msghdr.msg_controllen < CMSG_LEN(sizeof(struct ucred)) ||
1916                     control.cmsghdr.cmsg_level != SOL_SOCKET ||
1917                     control.cmsghdr.cmsg_type != SCM_CREDENTIALS ||
1918                     control.cmsghdr.cmsg_len != CMSG_LEN(sizeof(struct ucred))) {
1919                         log_warning("Received notify message without credentials. Ignoring.");
1920                         continue;
1921                 }
1922
1923                 ucred = (struct ucred*) CMSG_DATA(&control.cmsghdr);
1924
1925                 if (!(u = hashmap_get(m->watch_pids, LONG_TO_PTR(ucred->pid))))
1926                         if (!(u = cgroup_unit_by_pid(m, ucred->pid))) {
1927                                 log_warning("Cannot find unit for notify message of PID %lu.", (unsigned long) ucred->pid);
1928                                 continue;
1929                         }
1930
1931                 assert((size_t) n < sizeof(buf));
1932                 buf[n] = 0;
1933                 if (!(tags = strv_split(buf, "\n\r")))
1934                         return -ENOMEM;
1935
1936                 log_debug("Got notification message for unit %s", u->meta.id);
1937
1938                 if (UNIT_VTABLE(u)->notify_message)
1939                         UNIT_VTABLE(u)->notify_message(u, ucred->pid, tags);
1940
1941                 strv_free(tags);
1942         }
1943
1944         return 0;
1945 }
1946
1947 static int manager_dispatch_sigchld(Manager *m) {
1948         assert(m);
1949
1950         for (;;) {
1951                 siginfo_t si;
1952                 Unit *u;
1953                 int r;
1954
1955                 zero(si);
1956
1957                 /* First we call waitd() for a PID and do not reap the
1958                  * zombie. That way we can still access /proc/$PID for
1959                  * it while it is a zombie. */
1960                 if (waitid(P_ALL, 0, &si, WEXITED|WNOHANG|WNOWAIT) < 0) {
1961
1962                         if (errno == ECHILD)
1963                                 break;
1964
1965                         if (errno == EINTR)
1966                                 continue;
1967
1968                         return -errno;
1969                 }
1970
1971                 if (si.si_pid <= 0)
1972                         break;
1973
1974                 if (si.si_code == CLD_EXITED || si.si_code == CLD_KILLED || si.si_code == CLD_DUMPED) {
1975                         char *name = NULL;
1976
1977                         get_process_name(si.si_pid, &name);
1978                         log_debug("Got SIGCHLD for process %lu (%s)", (unsigned long) si.si_pid, strna(name));
1979                         free(name);
1980                 }
1981
1982                 /* Let's flush any message the dying child might still
1983                  * have queued for us. This ensures that the process
1984                  * still exists in /proc so that we can figure out
1985                  * which cgroup and hence unit it belongs to. */
1986                 if ((r = manager_process_notify_fd(m)) < 0)
1987                         return r;
1988
1989                 /* And now figure out the unit this belongs to */
1990                 if (!(u = hashmap_get(m->watch_pids, LONG_TO_PTR(si.si_pid))))
1991                         u = cgroup_unit_by_pid(m, si.si_pid);
1992
1993                 /* And now, we actually reap the zombie. */
1994                 if (waitid(P_PID, si.si_pid, &si, WEXITED) < 0) {
1995                         if (errno == EINTR)
1996                                 continue;
1997
1998                         return -errno;
1999                 }
2000
2001                 if (si.si_code != CLD_EXITED && si.si_code != CLD_KILLED && si.si_code != CLD_DUMPED)
2002                         continue;
2003
2004                 log_debug("Child %lu died (code=%s, status=%i/%s)",
2005                           (long unsigned) si.si_pid,
2006                           sigchld_code_to_string(si.si_code),
2007                           si.si_status,
2008                           strna(si.si_code == CLD_EXITED
2009                                 ? exit_status_to_string(si.si_status, EXIT_STATUS_FULL)
2010                                 : signal_to_string(si.si_status)));
2011
2012                 if (!u)
2013                         continue;
2014
2015                 log_debug("Child %lu belongs to %s", (long unsigned) si.si_pid, u->meta.id);
2016
2017                 hashmap_remove(m->watch_pids, LONG_TO_PTR(si.si_pid));
2018                 UNIT_VTABLE(u)->sigchld_event(u, si.si_pid, si.si_code, si.si_status);
2019         }
2020
2021         return 0;
2022 }
2023
2024 static int manager_start_target(Manager *m, const char *name, JobMode mode) {
2025         int r;
2026         DBusError error;
2027
2028         dbus_error_init(&error);
2029
2030         log_debug("Activating special unit %s", name);
2031
2032         if ((r = manager_add_job_by_name(m, JOB_START, name, mode, true, &error, NULL)) < 0)
2033                 log_error("Failed to enqueue %s job: %s", name, bus_error(&error, r));
2034
2035         dbus_error_free(&error);
2036
2037         return r;
2038 }
2039
2040 static int manager_process_signal_fd(Manager *m) {
2041         ssize_t n;
2042         struct signalfd_siginfo sfsi;
2043         bool sigchld = false;
2044
2045         assert(m);
2046
2047         for (;;) {
2048                 if ((n = read(m->signal_watch.fd, &sfsi, sizeof(sfsi))) != sizeof(sfsi)) {
2049
2050                         if (n >= 0)
2051                                 return -EIO;
2052
2053                         if (errno == EINTR || errno == EAGAIN)
2054                                 break;
2055
2056                         return -errno;
2057                 }
2058
2059                 log_debug("Received SIG%s", strna(signal_to_string(sfsi.ssi_signo)));
2060
2061                 switch (sfsi.ssi_signo) {
2062
2063                 case SIGCHLD:
2064                         sigchld = true;
2065                         break;
2066
2067                 case SIGTERM:
2068                         if (m->running_as == MANAGER_SYSTEM) {
2069                                 /* This is for compatibility with the
2070                                  * original sysvinit */
2071                                 m->exit_code = MANAGER_REEXECUTE;
2072                                 break;
2073                         }
2074
2075                         /* Fall through */
2076
2077                 case SIGINT:
2078                         if (m->running_as == MANAGER_SYSTEM) {
2079                                 manager_start_target(m, SPECIAL_CTRL_ALT_DEL_TARGET, JOB_REPLACE);
2080                                 break;
2081                         }
2082
2083                         /* Run the exit target if there is one, if not, just exit. */
2084                         if (manager_start_target(m, SPECIAL_EXIT_TARGET, JOB_REPLACE) < 0) {
2085                                 m->exit_code = MANAGER_EXIT;
2086                                 return 0;
2087                         }
2088
2089                         break;
2090
2091                 case SIGWINCH:
2092                         if (m->running_as == MANAGER_SYSTEM)
2093                                 manager_start_target(m, SPECIAL_KBREQUEST_TARGET, JOB_REPLACE);
2094
2095                         /* This is a nop on non-init */
2096                         break;
2097
2098                 case SIGPWR:
2099                         if (m->running_as == MANAGER_SYSTEM)
2100                                 manager_start_target(m, SPECIAL_SIGPWR_TARGET, JOB_REPLACE);
2101
2102                         /* This is a nop on non-init */
2103                         break;
2104
2105                 case SIGUSR1: {
2106                         Unit *u;
2107
2108                         u = manager_get_unit(m, SPECIAL_DBUS_SERVICE);
2109
2110                         if (!u || UNIT_IS_ACTIVE_OR_RELOADING(unit_active_state(u))) {
2111                                 log_info("Trying to reconnect to bus...");
2112                                 bus_init(m, true);
2113                         }
2114
2115                         if (!u || !UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u))) {
2116                                 log_info("Loading D-Bus service...");
2117                                 manager_start_target(m, SPECIAL_DBUS_SERVICE, JOB_REPLACE);
2118                         }
2119
2120                         break;
2121                 }
2122
2123                 case SIGUSR2: {
2124                         FILE *f;
2125                         char *dump = NULL;
2126                         size_t size;
2127
2128                         if (!(f = open_memstream(&dump, &size))) {
2129                                 log_warning("Failed to allocate memory stream.");
2130                                 break;
2131                         }
2132
2133                         manager_dump_units(m, f, "\t");
2134                         manager_dump_jobs(m, f, "\t");
2135
2136                         if (ferror(f)) {
2137                                 fclose(f);
2138                                 free(dump);
2139                                 log_warning("Failed to write status stream");
2140                                 break;
2141                         }
2142
2143                         fclose(f);
2144                         log_dump(LOG_INFO, dump);
2145                         free(dump);
2146
2147                         break;
2148                 }
2149
2150                 case SIGHUP:
2151                         m->exit_code = MANAGER_RELOAD;
2152                         break;
2153
2154                 default: {
2155                         /* Starting SIGRTMIN+0 */
2156                         static const char * const target_table[] = {
2157                                 [0] = SPECIAL_DEFAULT_TARGET,
2158                                 [1] = SPECIAL_RESCUE_TARGET,
2159                                 [2] = SPECIAL_EMERGENCY_TARGET,
2160                                 [3] = SPECIAL_HALT_TARGET,
2161                                 [4] = SPECIAL_POWEROFF_TARGET,
2162                                 [5] = SPECIAL_REBOOT_TARGET,
2163                                 [6] = SPECIAL_KEXEC_TARGET
2164                         };
2165
2166                         /* Starting SIGRTMIN+13, so that target halt and system halt are 10 apart */
2167                         static const ManagerExitCode code_table[] = {
2168                                 [0] = MANAGER_HALT,
2169                                 [1] = MANAGER_POWEROFF,
2170                                 [2] = MANAGER_REBOOT,
2171                                 [3] = MANAGER_KEXEC
2172                         };
2173
2174                         if ((int) sfsi.ssi_signo >= SIGRTMIN+0 &&
2175                             (int) sfsi.ssi_signo < SIGRTMIN+(int) ELEMENTSOF(target_table)) {
2176                                 manager_start_target(m, target_table[sfsi.ssi_signo - SIGRTMIN],
2177                                                      (sfsi.ssi_signo == 1 || sfsi.ssi_signo == 2) ? JOB_ISOLATE : JOB_REPLACE);
2178                                 break;
2179                         }
2180
2181                         if ((int) sfsi.ssi_signo >= SIGRTMIN+13 &&
2182                             (int) sfsi.ssi_signo < SIGRTMIN+13+(int) ELEMENTSOF(code_table)) {
2183                                 m->exit_code = code_table[sfsi.ssi_signo - SIGRTMIN - 13];
2184                                 break;
2185                         }
2186
2187                         switch (sfsi.ssi_signo - SIGRTMIN) {
2188
2189                         case 20:
2190                                 log_debug("Enabling showing of status.");
2191                                 m->show_status = true;
2192                                 break;
2193
2194                         case 21:
2195                                 log_debug("Disabling showing of status.");
2196                                 m->show_status = false;
2197                                 break;
2198
2199                         default:
2200                                 log_warning("Got unhandled signal <%s>.", strna(signal_to_string(sfsi.ssi_signo)));
2201                         }
2202                 }
2203                 }
2204         }
2205
2206         if (sigchld)
2207                 return manager_dispatch_sigchld(m);
2208
2209         return 0;
2210 }
2211
2212 static int process_event(Manager *m, struct epoll_event *ev) {
2213         int r;
2214         Watch *w;
2215
2216         assert(m);
2217         assert(ev);
2218
2219         assert(w = ev->data.ptr);
2220
2221         if (w->type == WATCH_INVALID)
2222                 return 0;
2223
2224         switch (w->type) {
2225
2226         case WATCH_SIGNAL:
2227
2228                 /* An incoming signal? */
2229                 if (ev->events != EPOLLIN)
2230                         return -EINVAL;
2231
2232                 if ((r = manager_process_signal_fd(m)) < 0)
2233                         return r;
2234
2235                 break;
2236
2237         case WATCH_NOTIFY:
2238
2239                 /* An incoming daemon notification event? */
2240                 if (ev->events != EPOLLIN)
2241                         return -EINVAL;
2242
2243                 if ((r = manager_process_notify_fd(m)) < 0)
2244                         return r;
2245
2246                 break;
2247
2248         case WATCH_FD:
2249
2250                 /* Some fd event, to be dispatched to the units */
2251                 UNIT_VTABLE(w->data.unit)->fd_event(w->data.unit, w->fd, ev->events, w);
2252                 break;
2253
2254         case WATCH_UNIT_TIMER:
2255         case WATCH_JOB_TIMER: {
2256                 uint64_t v;
2257                 ssize_t k;
2258
2259                 /* Some timer event, to be dispatched to the units */
2260                 if ((k = read(w->fd, &v, sizeof(v))) != sizeof(v)) {
2261
2262                         if (k < 0 && (errno == EINTR || errno == EAGAIN))
2263                                 break;
2264
2265                         return k < 0 ? -errno : -EIO;
2266                 }
2267
2268                 if (w->type == WATCH_UNIT_TIMER)
2269                         UNIT_VTABLE(w->data.unit)->timer_event(w->data.unit, v, w);
2270                 else
2271                         job_timer_event(w->data.job, v, w);
2272                 break;
2273         }
2274
2275         case WATCH_MOUNT:
2276                 /* Some mount table change, intended for the mount subsystem */
2277                 mount_fd_event(m, ev->events);
2278                 break;
2279
2280         case WATCH_SWAP:
2281                 /* Some swap table change, intended for the swap subsystem */
2282                 swap_fd_event(m, ev->events);
2283                 break;
2284
2285         case WATCH_UDEV:
2286                 /* Some notification from udev, intended for the device subsystem */
2287                 device_fd_event(m, ev->events);
2288                 break;
2289
2290         case WATCH_DBUS_WATCH:
2291                 bus_watch_event(m, w, ev->events);
2292                 break;
2293
2294         case WATCH_DBUS_TIMEOUT:
2295                 bus_timeout_event(m, w, ev->events);
2296                 break;
2297
2298         default:
2299                 log_error("event type=%i", w->type);
2300                 assert_not_reached("Unknown epoll event type.");
2301         }
2302
2303         return 0;
2304 }
2305
2306 int manager_loop(Manager *m) {
2307         int r;
2308
2309         RATELIMIT_DEFINE(rl, 1*USEC_PER_SEC, 1000);
2310
2311         assert(m);
2312         m->exit_code = MANAGER_RUNNING;
2313
2314         /* Release the path cache */
2315         set_free_free(m->unit_path_cache);
2316         m->unit_path_cache = NULL;
2317
2318         manager_check_finished(m);
2319
2320         /* There might still be some zombies hanging around from
2321          * before we were exec()'ed. Leat's reap them */
2322         if ((r = manager_dispatch_sigchld(m)) < 0)
2323                 return r;
2324
2325         while (m->exit_code == MANAGER_RUNNING) {
2326                 struct epoll_event event;
2327                 int n;
2328
2329                 if (!ratelimit_test(&rl)) {
2330                         /* Yay, something is going seriously wrong, pause a little */
2331                         log_warning("Looping too fast. Throttling execution a little.");
2332                         sleep(1);
2333                 }
2334
2335                 if (manager_dispatch_load_queue(m) > 0)
2336                         continue;
2337
2338                 if (manager_dispatch_run_queue(m) > 0)
2339                         continue;
2340
2341                 if (bus_dispatch(m) > 0)
2342                         continue;
2343
2344                 if (manager_dispatch_cleanup_queue(m) > 0)
2345                         continue;
2346
2347                 if (manager_dispatch_gc_queue(m) > 0)
2348                         continue;
2349
2350                 if (manager_dispatch_dbus_queue(m) > 0)
2351                         continue;
2352
2353                 if (swap_dispatch_reload(m) > 0)
2354                         continue;
2355
2356                 if ((n = epoll_wait(m->epoll_fd, &event, 1, -1)) < 0) {
2357
2358                         if (errno == EINTR)
2359                                 continue;
2360
2361                         return -errno;
2362                 }
2363
2364                 assert(n == 1);
2365
2366                 if ((r = process_event(m, &event)) < 0)
2367                         return r;
2368         }
2369
2370         return m->exit_code;
2371 }
2372
2373 int manager_get_unit_from_dbus_path(Manager *m, const char *s, Unit **_u) {
2374         char *n;
2375         Unit *u;
2376
2377         assert(m);
2378         assert(s);
2379         assert(_u);
2380
2381         if (!startswith(s, "/org/freedesktop/systemd1/unit/"))
2382                 return -EINVAL;
2383
2384         if (!(n = bus_path_unescape(s+31)))
2385                 return -ENOMEM;
2386
2387         u = manager_get_unit(m, n);
2388         free(n);
2389
2390         if (!u)
2391                 return -ENOENT;
2392
2393         *_u = u;
2394
2395         return 0;
2396 }
2397
2398 int manager_get_job_from_dbus_path(Manager *m, const char *s, Job **_j) {
2399         Job *j;
2400         unsigned id;
2401         int r;
2402
2403         assert(m);
2404         assert(s);
2405         assert(_j);
2406
2407         if (!startswith(s, "/org/freedesktop/systemd1/job/"))
2408                 return -EINVAL;
2409
2410         if ((r = safe_atou(s + 30, &id)) < 0)
2411                 return r;
2412
2413         if (!(j = manager_get_job(m, id)))
2414                 return -ENOENT;
2415
2416         *_j = j;
2417
2418         return 0;
2419 }
2420
2421 void manager_send_unit_audit(Manager *m, Unit *u, int type, bool success) {
2422
2423 #ifdef HAVE_AUDIT
2424         char *p;
2425
2426         if (m->audit_fd < 0)
2427                 return;
2428
2429         /* Don't generate audit events if the service was already
2430          * started and we're just deserializing */
2431         if (m->n_deserializing > 0)
2432                 return;
2433
2434         if (!(p = unit_name_to_prefix_and_instance(u->meta.id))) {
2435                 log_error("Failed to allocate unit name for audit message: %s", strerror(ENOMEM));
2436                 return;
2437         }
2438
2439         if (audit_log_user_comm_message(m->audit_fd, type, "", p, NULL, NULL, NULL, success) < 0)
2440                 log_error("Failed to send audit message: %m");
2441
2442         free(p);
2443 #endif
2444
2445 }
2446
2447 void manager_send_unit_plymouth(Manager *m, Unit *u) {
2448         int fd = -1;
2449         union sockaddr_union sa;
2450         int n = 0;
2451         char *message = NULL;
2452
2453         /* Don't generate plymouth events if the service was already
2454          * started and we're just deserializing */
2455         if (m->n_deserializing > 0)
2456                 return;
2457
2458         if (m->running_as != MANAGER_SYSTEM)
2459                 return;
2460
2461         if (u->meta.type != UNIT_SERVICE &&
2462             u->meta.type != UNIT_MOUNT &&
2463             u->meta.type != UNIT_SWAP)
2464                 return;
2465
2466         /* We set SOCK_NONBLOCK here so that we rather drop the
2467          * message then wait for plymouth */
2468         if ((fd = socket(AF_UNIX, SOCK_STREAM|SOCK_CLOEXEC|SOCK_NONBLOCK, 0)) < 0) {
2469                 log_error("socket() failed: %m");
2470                 return;
2471         }
2472
2473         zero(sa);
2474         sa.sa.sa_family = AF_UNIX;
2475         strncpy(sa.un.sun_path+1, "/org/freedesktop/plymouthd", sizeof(sa.un.sun_path)-1);
2476         if (connect(fd, &sa.sa, offsetof(struct sockaddr_un, sun_path) + 1 + strlen(sa.un.sun_path+1)) < 0) {
2477
2478                 if (errno != EPIPE &&
2479                     errno != EAGAIN &&
2480                     errno != ENOENT &&
2481                     errno != ECONNREFUSED &&
2482                     errno != ECONNRESET &&
2483                     errno != ECONNABORTED)
2484                         log_error("connect() failed: %m");
2485
2486                 goto finish;
2487         }
2488
2489         if (asprintf(&message, "U\002%c%s%n", (int) (strlen(u->meta.id) + 1), u->meta.id, &n) < 0) {
2490                 log_error("Out of memory");
2491                 goto finish;
2492         }
2493
2494         errno = 0;
2495         if (write(fd, message, n + 1) != n + 1) {
2496
2497                 if (errno != EPIPE &&
2498                     errno != EAGAIN &&
2499                     errno != ENOENT &&
2500                     errno != ECONNREFUSED &&
2501                     errno != ECONNRESET &&
2502                     errno != ECONNABORTED)
2503                         log_error("Failed to write Plymouth message: %m");
2504
2505                 goto finish;
2506         }
2507
2508 finish:
2509         if (fd >= 0)
2510                 close_nointr_nofail(fd);
2511
2512         free(message);
2513 }
2514
2515 void manager_dispatch_bus_name_owner_changed(
2516                 Manager *m,
2517                 const char *name,
2518                 const char* old_owner,
2519                 const char *new_owner) {
2520
2521         Unit *u;
2522
2523         assert(m);
2524         assert(name);
2525
2526         if (!(u = hashmap_get(m->watch_bus, name)))
2527                 return;
2528
2529         UNIT_VTABLE(u)->bus_name_owner_change(u, name, old_owner, new_owner);
2530 }
2531
2532 void manager_dispatch_bus_query_pid_done(
2533                 Manager *m,
2534                 const char *name,
2535                 pid_t pid) {
2536
2537         Unit *u;
2538
2539         assert(m);
2540         assert(name);
2541         assert(pid >= 1);
2542
2543         if (!(u = hashmap_get(m->watch_bus, name)))
2544                 return;
2545
2546         UNIT_VTABLE(u)->bus_query_pid_done(u, name, pid);
2547 }
2548
2549 int manager_open_serialization(Manager *m, FILE **_f) {
2550         char *path;
2551         mode_t saved_umask;
2552         int fd;
2553         FILE *f;
2554
2555         assert(_f);
2556
2557         if (m->running_as == MANAGER_SYSTEM) {
2558                 mkdir_p("/dev/.systemd", 0755);
2559
2560                 if (asprintf(&path, "/dev/.systemd/dump-%lu-XXXXXX", (unsigned long) getpid()) < 0)
2561                         return -ENOMEM;
2562         } else {
2563                 if (asprintf(&path, "/tmp/systemd-dump-%lu-XXXXXX", (unsigned long) getpid()) < 0)
2564                         return -ENOMEM;
2565         }
2566
2567         saved_umask = umask(0077);
2568         fd = mkostemp(path, O_RDWR|O_CLOEXEC);
2569         umask(saved_umask);
2570
2571         if (fd < 0) {
2572                 free(path);
2573                 return -errno;
2574         }
2575
2576         unlink(path);
2577
2578         log_debug("Serializing state to %s", path);
2579         free(path);
2580
2581         if (!(f = fdopen(fd, "w+")) < 0)
2582                 return -errno;
2583
2584         *_f = f;
2585
2586         return 0;
2587 }
2588
2589 int manager_serialize(Manager *m, FILE *f, FDSet *fds) {
2590         Iterator i;
2591         Unit *u;
2592         const char *t;
2593         int r;
2594
2595         assert(m);
2596         assert(f);
2597         assert(fds);
2598
2599         dual_timestamp_serialize(f, "initrd-timestamp", &m->initrd_timestamp);
2600         dual_timestamp_serialize(f, "startup-timestamp", &m->startup_timestamp);
2601         dual_timestamp_serialize(f, "finish-timestamp", &m->finish_timestamp);
2602
2603         fputc('\n', f);
2604
2605         HASHMAP_FOREACH_KEY(u, t, m->units, i) {
2606                 if (u->meta.id != t)
2607                         continue;
2608
2609                 if (!unit_can_serialize(u))
2610                         continue;
2611
2612                 /* Start marker */
2613                 fputs(u->meta.id, f);
2614                 fputc('\n', f);
2615
2616                 if ((r = unit_serialize(u, f, fds)) < 0)
2617                         return r;
2618         }
2619
2620         if (ferror(f))
2621                 return -EIO;
2622
2623         return 0;
2624 }
2625
2626 int manager_deserialize(Manager *m, FILE *f, FDSet *fds) {
2627         int r = 0;
2628
2629         assert(m);
2630         assert(f);
2631
2632         log_debug("Deserializing state...");
2633
2634         m->n_deserializing ++;
2635
2636         for (;;) {
2637                 char line[1024], *l;
2638
2639                 if (!fgets(line, sizeof(line), f)) {
2640                         if (feof(f))
2641                                 r = 0;
2642                         else
2643                                 r = -errno;
2644
2645                         goto finish;
2646                 }
2647
2648                 char_array_0(line);
2649                 l = strstrip(line);
2650
2651                 if (l[0] == 0)
2652                         break;
2653
2654                 if (startswith(l, "initrd-timestamp="))
2655                         dual_timestamp_deserialize(l+17, &m->initrd_timestamp);
2656                 else if (startswith(l, "startup-timestamp="))
2657                         dual_timestamp_deserialize(l+18, &m->startup_timestamp);
2658                 else if (startswith(l, "finish-timestamp="))
2659                         dual_timestamp_deserialize(l+17, &m->finish_timestamp);
2660                 else
2661                         log_debug("Unknown serialization item '%s'", l);
2662         }
2663
2664         for (;;) {
2665                 Unit *u;
2666                 char name[UNIT_NAME_MAX+2];
2667
2668                 /* Start marker */
2669                 if (!fgets(name, sizeof(name), f)) {
2670                         if (feof(f))
2671                                 r = 0;
2672                         else
2673                                 r = -errno;
2674
2675                         goto finish;
2676                 }
2677
2678                 char_array_0(name);
2679
2680                 if ((r = manager_load_unit(m, strstrip(name), NULL, NULL, &u)) < 0)
2681                         goto finish;
2682
2683                 if ((r = unit_deserialize(u, f, fds)) < 0)
2684                         goto finish;
2685         }
2686
2687 finish:
2688         if (ferror(f)) {
2689                 r = -EIO;
2690                 goto finish;
2691         }
2692
2693         assert(m->n_deserializing > 0);
2694         m->n_deserializing --;
2695
2696         return r;
2697 }
2698
2699 int manager_reload(Manager *m) {
2700         int r, q;
2701         FILE *f;
2702         FDSet *fds;
2703
2704         assert(m);
2705
2706         if ((r = manager_open_serialization(m, &f)) < 0)
2707                 return r;
2708
2709         if (!(fds = fdset_new())) {
2710                 r = -ENOMEM;
2711                 goto finish;
2712         }
2713
2714         if ((r = manager_serialize(m, f, fds)) < 0)
2715                 goto finish;
2716
2717         if (fseeko(f, 0, SEEK_SET) < 0) {
2718                 r = -errno;
2719                 goto finish;
2720         }
2721
2722         /* From here on there is no way back. */
2723         manager_clear_jobs_and_units(m);
2724         manager_undo_generators(m);
2725
2726         /* Find new unit paths */
2727         lookup_paths_free(&m->lookup_paths);
2728         if ((q = lookup_paths_init(&m->lookup_paths, m->running_as)) < 0)
2729                 r = q;
2730
2731         manager_run_generators(m);
2732
2733         manager_build_unit_path_cache(m);
2734
2735         m->n_deserializing ++;
2736
2737         /* First, enumerate what we can from all config files */
2738         if ((q = manager_enumerate(m)) < 0)
2739                 r = q;
2740
2741         /* Second, deserialize our stored data */
2742         if ((q = manager_deserialize(m, f, fds)) < 0)
2743                 r = q;
2744
2745         fclose(f);
2746         f = NULL;
2747
2748         /* Third, fire things up! */
2749         if ((q = manager_coldplug(m)) < 0)
2750                 r = q;
2751
2752         assert(m->n_deserializing > 0);
2753         m->n_deserializing ++;
2754
2755 finish:
2756         if (f)
2757                 fclose(f);
2758
2759         if (fds)
2760                 fdset_free(fds);
2761
2762         return r;
2763 }
2764
2765 bool manager_is_booting_or_shutting_down(Manager *m) {
2766         Unit *u;
2767
2768         assert(m);
2769
2770         /* Is the initial job still around? */
2771         if (manager_get_job(m, 1))
2772                 return true;
2773
2774         /* Is there a job for the shutdown target? */
2775         if (((u = manager_get_unit(m, SPECIAL_SHUTDOWN_TARGET))))
2776                 return !!u->meta.job;
2777
2778         return false;
2779 }
2780
2781 void manager_reset_failed(Manager *m) {
2782         Unit *u;
2783         Iterator i;
2784
2785         assert(m);
2786
2787         HASHMAP_FOREACH(u, m->units, i)
2788                 unit_reset_failed(u);
2789 }
2790
2791 bool manager_unit_pending_inactive(Manager *m, const char *name) {
2792         Unit *u;
2793
2794         assert(m);
2795         assert(name);
2796
2797         /* Returns true if the unit is inactive or going down */
2798         if (!(u = manager_get_unit(m, name)))
2799                 return true;
2800
2801         return unit_pending_inactive(u);
2802 }
2803
2804 void manager_check_finished(Manager *m) {
2805         char userspace[FORMAT_TIMESPAN_MAX], initrd[FORMAT_TIMESPAN_MAX], kernel[FORMAT_TIMESPAN_MAX], sum[FORMAT_TIMESPAN_MAX];
2806
2807         assert(m);
2808
2809         if (dual_timestamp_is_set(&m->finish_timestamp))
2810                 return;
2811
2812         if (hashmap_size(m->jobs) > 0)
2813                 return;
2814
2815         dual_timestamp_get(&m->finish_timestamp);
2816
2817         if (m->running_as == MANAGER_SYSTEM) {
2818                 if (dual_timestamp_is_set(&m->initrd_timestamp)) {
2819                         log_info("Startup finished in %s (kernel) + %s (initrd) + %s (userspace) = %s.",
2820                                  format_timespan(kernel, sizeof(kernel),
2821                                                  m->initrd_timestamp.monotonic),
2822                                  format_timespan(initrd, sizeof(initrd),
2823                                                  m->startup_timestamp.monotonic - m->initrd_timestamp.monotonic),
2824                                  format_timespan(userspace, sizeof(userspace),
2825                                                  m->finish_timestamp.monotonic - m->startup_timestamp.monotonic),
2826                                  format_timespan(sum, sizeof(sum),
2827                                                  m->finish_timestamp.monotonic));
2828                 } else
2829                         log_info("Startup finished in %s (kernel) + %s (userspace) = %s.",
2830                                  format_timespan(kernel, sizeof(kernel),
2831                                                  m->startup_timestamp.monotonic),
2832                                  format_timespan(userspace, sizeof(userspace),
2833                                                  m->finish_timestamp.monotonic - m->startup_timestamp.monotonic),
2834                                  format_timespan(sum, sizeof(sum),
2835                                                  m->finish_timestamp.monotonic));
2836         } else
2837                 log_debug("Startup finished in %s.",
2838                           format_timespan(userspace, sizeof(userspace),
2839                                           m->finish_timestamp.monotonic - m->startup_timestamp.monotonic));
2840
2841 }
2842
2843 void manager_run_generators(Manager *m) {
2844         DIR *d = NULL;
2845         const char *generator_path;
2846         const char *argv[3];
2847
2848         assert(m);
2849
2850         generator_path = m->running_as == MANAGER_SYSTEM ? SYSTEM_GENERATOR_PATH : USER_GENERATOR_PATH;
2851         if (!(d = opendir(generator_path))) {
2852
2853                 if (errno == ENOENT)
2854                         return;
2855
2856                 log_error("Failed to enumerate generator directory: %m");
2857                 return;
2858         }
2859
2860         if (!m->generator_unit_path) {
2861                 char *p;
2862                 char system_path[] = "/dev/.systemd/generator-XXXXXX",
2863                         user_path[] = "/tmp/systemd-generator-XXXXXX";
2864
2865                 if (!(p = mkdtemp(m->running_as == MANAGER_SYSTEM ? system_path : user_path))) {
2866                         log_error("Failed to generate generator directory: %m");
2867                         goto finish;
2868                 }
2869
2870                 if (!(m->generator_unit_path = strdup(p))) {
2871                         log_error("Failed to allocate generator unit path.");
2872                         goto finish;
2873                 }
2874         }
2875
2876         argv[0] = NULL; /* Leave this empty, execute_directory() will fill something in */
2877         argv[1] = m->generator_unit_path;
2878         argv[2] = NULL;
2879
2880         execute_directory(generator_path, d, (char**) argv);
2881
2882         if (rmdir(m->generator_unit_path) >= 0) {
2883                 /* Uh? we were able to remove this dir? I guess that
2884                  * means the directory was empty, hence let's shortcut
2885                  * this */
2886
2887                 free(m->generator_unit_path);
2888                 m->generator_unit_path = NULL;
2889                 goto finish;
2890         }
2891
2892         if (!strv_find(m->lookup_paths.unit_path, m->generator_unit_path)) {
2893                 char **l;
2894
2895                 if (!(l = strv_append(m->lookup_paths.unit_path, m->generator_unit_path))) {
2896                         log_error("Failed to add generator directory to unit search path: %m");
2897                         goto finish;
2898                 }
2899
2900                 strv_free(m->lookup_paths.unit_path);
2901                 m->lookup_paths.unit_path = l;
2902
2903                 log_debug("Added generator unit path %s to search path.", m->generator_unit_path);
2904         }
2905
2906 finish:
2907         if (d)
2908                 closedir(d);
2909 }
2910
2911 void manager_undo_generators(Manager *m) {
2912         assert(m);
2913
2914         if (!m->generator_unit_path)
2915                 return;
2916
2917         strv_remove(m->lookup_paths.unit_path, m->generator_unit_path);
2918         rm_rf(m->generator_unit_path, false, true);
2919
2920         free(m->generator_unit_path);
2921         m->generator_unit_path = NULL;
2922 }
2923
2924 int manager_set_default_controllers(Manager *m, char **controllers) {
2925         char **l;
2926
2927         assert(m);
2928
2929         if (!(l = strv_copy(controllers)))
2930                 return -ENOMEM;
2931
2932         strv_free(m->default_controllers);
2933         m->default_controllers = l;
2934
2935         return 0;
2936 }
2937
2938 static const char* const manager_running_as_table[_MANAGER_RUNNING_AS_MAX] = {
2939         [MANAGER_SYSTEM] = "system",
2940         [MANAGER_USER] = "user"
2941 };
2942
2943 DEFINE_STRING_TABLE_LOOKUP(manager_running_as, ManagerRunningAs);