]> git.ipfire.org Git - thirdparty/systemd.git/blame_incremental - src/unit.c
projects / thirdparty / systemd.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
units: make sure the file system is writable before we write utmp data
[thirdparty/systemd.git] / src / unit.c
... / ...
CommitLineData
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 <sys/timerfd.h>
27#include <sys/poll.h>
28#include <stdlib.h>
29#include <unistd.h>
30#include <sys/stat.h>
31
32#include "set.h"
33#include "unit.h"
34#include "macro.h"
35#include "strv.h"
36#include "load-fragment.h"
37#include "load-dropin.h"
38#include "log.h"
39#include "unit-name.h"
40#include "specifier.h"
41#include "dbus-unit.h"
42#include "special.h"
43#include "cgroup-util.h"
44#include "missing.h"
45
46const UnitVTable * const unit_vtable[_UNIT_TYPE_MAX] = {
47 [UNIT_SERVICE] = &service_vtable,
48 [UNIT_TIMER] = &timer_vtable,
49 [UNIT_SOCKET] = &socket_vtable,
50 [UNIT_TARGET] = &target_vtable,
51 [UNIT_DEVICE] = &device_vtable,
52 [UNIT_MOUNT] = &mount_vtable,
53 [UNIT_AUTOMOUNT] = &automount_vtable,
54 [UNIT_SNAPSHOT] = &snapshot_vtable,
55 [UNIT_SWAP] = &swap_vtable,
56 [UNIT_PATH] = &path_vtable
57};
58
59Unit *unit_new(Manager *m) {
60 Unit *u;
61
62 assert(m);
63
64 if (!(u = new0(Unit, 1)))
65 return NULL;
66
67 if (!(u->meta.names = set_new(string_hash_func, string_compare_func))) {
68 free(u);
69 return NULL;
70 }
71
72 u->meta.manager = m;
73 u->meta.type = _UNIT_TYPE_INVALID;
74 u->meta.deserialized_job = _JOB_TYPE_INVALID;
75 u->meta.default_dependencies = true;
76
77 return u;
78}
79
80bool unit_has_name(Unit *u, const char *name) {
81 assert(u);
82 assert(name);
83
84 return !!set_get(u->meta.names, (char*) name);
85}
86
87int unit_add_name(Unit *u, const char *text) {
88 UnitType t;
89 char *s, *i = NULL;
90 int r;
91
92 assert(u);
93 assert(text);
94
95 if (unit_name_is_template(text)) {
96 if (!u->meta.instance)
97 return -EINVAL;
98
99 s = unit_name_replace_instance(text, u->meta.instance);
100 } else
101 s = strdup(text);
102
103 if (!s)
104 return -ENOMEM;
105
106 if (!unit_name_is_valid(s)) {
107 r = -EINVAL;
108 goto fail;
109 }
110
111 assert_se((t = unit_name_to_type(s)) >= 0);
112
113 if (u->meta.type != _UNIT_TYPE_INVALID && t != u->meta.type) {
114 r = -EINVAL;
115 goto fail;
116 }
117
118 if ((r = unit_name_to_instance(s, &i)) < 0)
119 goto fail;
120
121 if (i && unit_vtable[t]->no_instances)
122 goto fail;
123
124 /* Ensure that this unit is either instanced or not instanced,
125 * but not both. */
126 if (u->meta.type != _UNIT_TYPE_INVALID && !u->meta.instance != !i) {
127 r = -EINVAL;
128 goto fail;
129 }
130
131 if (unit_vtable[t]->no_alias &&
132 !set_isempty(u->meta.names) &&
133 !set_get(u->meta.names, s)) {
134 r = -EEXIST;
135 goto fail;
136 }
137
138 if (hashmap_size(u->meta.manager->units) >= MANAGER_MAX_NAMES) {
139 r = -E2BIG;
140 goto fail;
141 }
142
143 if ((r = set_put(u->meta.names, s)) < 0) {
144 if (r == -EEXIST)
145 r = 0;
146 goto fail;
147 }
148
149 if ((r = hashmap_put(u->meta.manager->units, s, u)) < 0) {
150 set_remove(u->meta.names, s);
151 goto fail;
152 }
153
154 if (u->meta.type == _UNIT_TYPE_INVALID) {
155
156 u->meta.type = t;
157 u->meta.id = s;
158 u->meta.instance = i;
159
160 LIST_PREPEND(Meta, units_per_type, u->meta.manager->units_per_type[t], &u->meta);
161
162 if (UNIT_VTABLE(u)->init)
163 UNIT_VTABLE(u)->init(u);
164 } else
165 free(i);
166
167 unit_add_to_dbus_queue(u);
168 return 0;
169
170fail:
171 free(s);
172 free(i);
173
174 return r;
175}
176
177int unit_choose_id(Unit *u, const char *name) {
178 char *s, *t = NULL, *i;
179 int r;
180
181 assert(u);
182 assert(name);
183
184 if (unit_name_is_template(name)) {
185
186 if (!u->meta.instance)
187 return -EINVAL;
188
189 if (!(t = unit_name_replace_instance(name, u->meta.instance)))
190 return -ENOMEM;
191
192 name = t;
193 }
194
195 /* Selects one of the names of this unit as the id */
196 s = set_get(u->meta.names, (char*) name);
197 free(t);
198
199 if (!s)
200 return -ENOENT;
201
202 if ((r = unit_name_to_instance(s, &i)) < 0)
203 return r;
204
205 u->meta.id = s;
206
207 free(u->meta.instance);
208 u->meta.instance = i;
209
210 unit_add_to_dbus_queue(u);
211
212 return 0;
213}
214
215int unit_set_description(Unit *u, const char *description) {
216 char *s;
217
218 assert(u);
219
220 if (!(s = strdup(description)))
221 return -ENOMEM;
222
223 free(u->meta.description);
224 u->meta.description = s;
225
226 unit_add_to_dbus_queue(u);
227 return 0;
228}
229
230bool unit_check_gc(Unit *u) {
231 assert(u);
232
233 if (u->meta.load_state == UNIT_STUB)
234 return true;
235
236 if (UNIT_VTABLE(u)->no_gc)
237 return true;
238
239 if (u->meta.no_gc)
240 return true;
241
242 if (u->meta.job)
243 return true;
244
245 if (unit_active_state(u) != UNIT_INACTIVE)
246 return true;
247
248 if (UNIT_VTABLE(u)->check_gc)
249 if (UNIT_VTABLE(u)->check_gc(u))
250 return true;
251
252 return false;
253}
254
255void unit_add_to_load_queue(Unit *u) {
256 assert(u);
257 assert(u->meta.type != _UNIT_TYPE_INVALID);
258
259 if (u->meta.load_state != UNIT_STUB || u->meta.in_load_queue)
260 return;
261
262 LIST_PREPEND(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
263 u->meta.in_load_queue = true;
264}
265
266void unit_add_to_cleanup_queue(Unit *u) {
267 assert(u);
268
269 if (u->meta.in_cleanup_queue)
270 return;
271
272 LIST_PREPEND(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
273 u->meta.in_cleanup_queue = true;
274}
275
276void unit_add_to_gc_queue(Unit *u) {
277 assert(u);
278
279 if (u->meta.in_gc_queue || u->meta.in_cleanup_queue)
280 return;
281
282 if (unit_check_gc(u))
283 return;
284
285 LIST_PREPEND(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
286 u->meta.in_gc_queue = true;
287
288 u->meta.manager->n_in_gc_queue ++;
289
290 if (u->meta.manager->gc_queue_timestamp <= 0)
291 u->meta.manager->gc_queue_timestamp = now(CLOCK_MONOTONIC);
292}
293
294void unit_add_to_dbus_queue(Unit *u) {
295 assert(u);
296 assert(u->meta.type != _UNIT_TYPE_INVALID);
297
298 if (u->meta.load_state == UNIT_STUB || u->meta.in_dbus_queue)
299 return;
300
301 /* Shortcut things if nobody cares */
302 if (!bus_has_subscriber(u->meta.manager)) {
303 u->meta.sent_dbus_new_signal = true;
304 return;
305 }
306
307 LIST_PREPEND(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
308 u->meta.in_dbus_queue = true;
309}
310
311static void bidi_set_free(Unit *u, Set *s) {
312 Iterator i;
313 Unit *other;
314
315 assert(u);
316
317 /* Frees the set and makes sure we are dropped from the
318 * inverse pointers */
319
320 SET_FOREACH(other, s, i) {
321 UnitDependency d;
322
323 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
324 set_remove(other->meta.dependencies[d], u);
325
326 unit_add_to_gc_queue(other);
327 }
328
329 set_free(s);
330}
331
332void unit_free(Unit *u) {
333 UnitDependency d;
334 Iterator i;
335 char *t;
336
337 assert(u);
338
339 bus_unit_send_removed_signal(u);
340
341 if (u->meta.load_state != UNIT_STUB)
342 if (UNIT_VTABLE(u)->done)
343 UNIT_VTABLE(u)->done(u);
344
345 SET_FOREACH(t, u->meta.names, i)
346 hashmap_remove_value(u->meta.manager->units, t, u);
347
348 if (u->meta.job)
349 job_free(u->meta.job);
350
351 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
352 bidi_set_free(u, u->meta.dependencies[d]);
353
354 if (u->meta.type != _UNIT_TYPE_INVALID)
355 LIST_REMOVE(Meta, units_per_type, u->meta.manager->units_per_type[u->meta.type], &u->meta);
356
357 if (u->meta.in_load_queue)
358 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
359
360 if (u->meta.in_dbus_queue)
361 LIST_REMOVE(Meta, dbus_queue, u->meta.manager->dbus_unit_queue, &u->meta);
362
363 if (u->meta.in_cleanup_queue)
364 LIST_REMOVE(Meta, cleanup_queue, u->meta.manager->cleanup_queue, &u->meta);
365
366 if (u->meta.in_gc_queue) {
367 LIST_REMOVE(Meta, gc_queue, u->meta.manager->gc_queue, &u->meta);
368 u->meta.manager->n_in_gc_queue--;
369 }
370
371 cgroup_bonding_free_list(u->meta.cgroup_bondings);
372
373 free(u->meta.description);
374 free(u->meta.fragment_path);
375
376 set_free_free(u->meta.names);
377
378 free(u->meta.instance);
379
380 free(u);
381}
382
383UnitActiveState unit_active_state(Unit *u) {
384 assert(u);
385
386 if (u->meta.load_state == UNIT_MERGED)
387 return unit_active_state(unit_follow_merge(u));
388
389 /* After a reload it might happen that a unit is not correctly
390 * loaded but still has a process around. That's why we won't
391 * shortcut failed loading to UNIT_INACTIVE_FAILED. */
392
393 return UNIT_VTABLE(u)->active_state(u);
394}
395
396const char* unit_sub_state_to_string(Unit *u) {
397 assert(u);
398
399 return UNIT_VTABLE(u)->sub_state_to_string(u);
400}
401
402static void complete_move(Set **s, Set **other) {
403 assert(s);
404 assert(other);
405
406 if (!*other)
407 return;
408
409 if (*s)
410 set_move(*s, *other);
411 else {
412 *s = *other;
413 *other = NULL;
414 }
415}
416
417static void merge_names(Unit *u, Unit *other) {
418 char *t;
419 Iterator i;
420
421 assert(u);
422 assert(other);
423
424 complete_move(&u->meta.names, &other->meta.names);
425
426 set_free_free(other->meta.names);
427 other->meta.names = NULL;
428 other->meta.id = NULL;
429
430 SET_FOREACH(t, u->meta.names, i)
431 assert_se(hashmap_replace(u->meta.manager->units, t, u) == 0);
432}
433
434static void merge_dependencies(Unit *u, Unit *other, UnitDependency d) {
435 Iterator i;
436 Unit *back;
437 int r;
438
439 assert(u);
440 assert(other);
441 assert(d < _UNIT_DEPENDENCY_MAX);
442
443 SET_FOREACH(back, other->meta.dependencies[d], i) {
444 UnitDependency k;
445
446 for (k = 0; k < _UNIT_DEPENDENCY_MAX; k++)
447 if ((r = set_remove_and_put(back->meta.dependencies[k], other, u)) < 0) {
448
449 if (r == -EEXIST)
450 set_remove(back->meta.dependencies[k], other);
451 else
452 assert(r == -ENOENT);
453 }
454 }
455
456 complete_move(&u->meta.dependencies[d], &other->meta.dependencies[d]);
457
458 set_free(other->meta.dependencies[d]);
459 other->meta.dependencies[d] = NULL;
460}
461
462int unit_merge(Unit *u, Unit *other) {
463 UnitDependency d;
464
465 assert(u);
466 assert(other);
467 assert(u->meta.manager == other->meta.manager);
468 assert(u->meta.type != _UNIT_TYPE_INVALID);
469
470 other = unit_follow_merge(other);
471
472 if (other == u)
473 return 0;
474
475 if (u->meta.type != other->meta.type)
476 return -EINVAL;
477
478 if (!u->meta.instance != !other->meta.instance)
479 return -EINVAL;
480
481 if (other->meta.load_state != UNIT_STUB &&
482 other->meta.load_state != UNIT_ERROR)
483 return -EEXIST;
484
485 if (other->meta.job)
486 return -EEXIST;
487
488 if (!UNIT_IS_INACTIVE_OR_FAILED(unit_active_state(other)))
489 return -EEXIST;
490
491 /* Merge names */
492 merge_names(u, other);
493
494 /* Merge dependencies */
495 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++)
496 merge_dependencies(u, other, d);
497
498 other->meta.load_state = UNIT_MERGED;
499 other->meta.merged_into = u;
500
501 /* If there is still some data attached to the other node, we
502 * don't need it anymore, and can free it. */
503 if (other->meta.load_state != UNIT_STUB)
504 if (UNIT_VTABLE(other)->done)
505 UNIT_VTABLE(other)->done(other);
506
507 unit_add_to_dbus_queue(u);
508 unit_add_to_cleanup_queue(other);
509
510 return 0;
511}
512
513int unit_merge_by_name(Unit *u, const char *name) {
514 Unit *other;
515 int r;
516 char *s = NULL;
517
518 assert(u);
519 assert(name);
520
521 if (unit_name_is_template(name)) {
522 if (!u->meta.instance)
523 return -EINVAL;
524
525 if (!(s = unit_name_replace_instance(name, u->meta.instance)))
526 return -ENOMEM;
527
528 name = s;
529 }
530
531 if (!(other = manager_get_unit(u->meta.manager, name)))
532 r = unit_add_name(u, name);
533 else
534 r = unit_merge(u, other);
535
536 free(s);
537 return r;
538}
539
540Unit* unit_follow_merge(Unit *u) {
541 assert(u);
542
543 while (u->meta.load_state == UNIT_MERGED)
544 assert_se(u = u->meta.merged_into);
545
546 return u;
547}
548
549int unit_add_exec_dependencies(Unit *u, ExecContext *c) {
550 int r;
551
552 assert(u);
553 assert(c);
554
555 if (c->std_output != EXEC_OUTPUT_KMSG &&
556 c->std_output != EXEC_OUTPUT_SYSLOG &&
557 c->std_error != EXEC_OUTPUT_KMSG &&
558 c->std_error != EXEC_OUTPUT_SYSLOG)
559 return 0;
560
561 /* If syslog or kernel logging is requested, make sure our own
562 * logging daemon is run first. */
563
564 if ((r = unit_add_dependency_by_name(u, UNIT_AFTER, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
565 return r;
566
567 if (u->meta.manager->running_as == MANAGER_SYSTEM)
568 if ((r = unit_add_dependency_by_name(u, UNIT_REQUIRES, SPECIAL_LOGGER_SOCKET, NULL, true)) < 0)
569 return r;
570
571 return 0;
572}
573
574const char *unit_description(Unit *u) {
575 assert(u);
576
577 if (u->meta.description)
578 return u->meta.description;
579
580 return u->meta.id;
581}
582
583void unit_dump(Unit *u, FILE *f, const char *prefix) {
584 char *t;
585 UnitDependency d;
586 Iterator i;
587 char *p2;
588 const char *prefix2;
589 CGroupBonding *b;
590 char
591 timestamp1[FORMAT_TIMESTAMP_MAX],
592 timestamp2[FORMAT_TIMESTAMP_MAX],
593 timestamp3[FORMAT_TIMESTAMP_MAX],
594 timestamp4[FORMAT_TIMESTAMP_MAX],
595 timespan[FORMAT_TIMESPAN_MAX];
596 Unit *following;
597
598 assert(u);
599 assert(u->meta.type >= 0);
600
601 if (!prefix)
602 prefix = "";
603 p2 = strappend(prefix, "\t");
604 prefix2 = p2 ? p2 : prefix;
605
606 fprintf(f,
607 "%s-> Unit %s:\n"
608 "%s\tDescription: %s\n"
609 "%s\tInstance: %s\n"
610 "%s\tUnit Load State: %s\n"
611 "%s\tUnit Active State: %s\n"
612 "%s\tInactive Exit Timestamp: %s\n"
613 "%s\tActive Enter Timestamp: %s\n"
614 "%s\tActive Exit Timestamp: %s\n"
615 "%s\tInactive Enter Timestamp: %s\n"
616 "%s\tGC Check Good: %s\n"
617 "%s\tNeed Daemon Reload: %s\n",
618 prefix, u->meta.id,
619 prefix, unit_description(u),
620 prefix, strna(u->meta.instance),
621 prefix, unit_load_state_to_string(u->meta.load_state),
622 prefix, unit_active_state_to_string(unit_active_state(u)),
623 prefix, strna(format_timestamp(timestamp1, sizeof(timestamp1), u->meta.inactive_exit_timestamp.realtime)),
624 prefix, strna(format_timestamp(timestamp2, sizeof(timestamp2), u->meta.active_enter_timestamp.realtime)),
625 prefix, strna(format_timestamp(timestamp3, sizeof(timestamp3), u->meta.active_exit_timestamp.realtime)),
626 prefix, strna(format_timestamp(timestamp4, sizeof(timestamp4), u->meta.inactive_enter_timestamp.realtime)),
627 prefix, yes_no(unit_check_gc(u)),
628 prefix, yes_no(unit_need_daemon_reload(u)));
629
630 SET_FOREACH(t, u->meta.names, i)
631 fprintf(f, "%s\tName: %s\n", prefix, t);
632
633 if ((following = unit_following(u)))
634 fprintf(f, "%s\tFollowing: %s\n", prefix, following->meta.id);
635
636 if (u->meta.fragment_path)
637 fprintf(f, "%s\tFragment Path: %s\n", prefix, u->meta.fragment_path);
638
639 if (u->meta.job_timeout > 0)
640 fprintf(f, "%s\tJob Timeout: %s\n", prefix, format_timespan(timespan, sizeof(timespan), u->meta.job_timeout));
641
642 for (d = 0; d < _UNIT_DEPENDENCY_MAX; d++) {
643 Unit *other;
644
645 SET_FOREACH(other, u->meta.dependencies[d], i)
646 fprintf(f, "%s\t%s: %s\n", prefix, unit_dependency_to_string(d), other->meta.id);
647 }
648
649 if (u->meta.load_state == UNIT_LOADED) {
650 fprintf(f,
651 "%s\tRecursive Stop: %s\n"
652 "%s\tStopWhenUnneeded: %s\n"
653 "%s\tRefuseManualStart: %s\n"
654 "%s\tRefuseManualStop: %s\n"
655 "%s\tDefaultDependencies: %s\n"
656 "%s\tIgnoreDependencyFailure: %s\n",
657 prefix, yes_no(u->meta.recursive_stop),
658 prefix, yes_no(u->meta.stop_when_unneeded),
659 prefix, yes_no(u->meta.refuse_manual_start),
660 prefix, yes_no(u->meta.refuse_manual_stop),
661 prefix, yes_no(u->meta.default_dependencies),
662 prefix, yes_no(u->meta.ignore_dependency_failure));
663
664 LIST_FOREACH(by_unit, b, u->meta.cgroup_bondings)
665 fprintf(f, "%s\tControlGroup: %s:%s\n",
666 prefix, b->controller, b->path);
667
668 if (UNIT_VTABLE(u)->dump)
669 UNIT_VTABLE(u)->dump(u, f, prefix2);
670
671 } else if (u->meta.load_state == UNIT_MERGED)
672 fprintf(f,
673 "%s\tMerged into: %s\n",
674 prefix, u->meta.merged_into->meta.id);
675 else if (u->meta.load_state == UNIT_ERROR)
676 fprintf(f, "%s\tLoad Error Code: %s\n", prefix, strerror(-u->meta.load_error));
677
678
679 if (u->meta.job)
680 job_dump(u->meta.job, f, prefix2);
681
682 free(p2);
683}
684
685/* Common implementation for multiple backends */
686int unit_load_fragment_and_dropin(Unit *u) {
687 int r;
688
689 assert(u);
690
691 /* Load a .service file */
692 if ((r = unit_load_fragment(u)) < 0)
693 return r;
694
695 if (u->meta.load_state == UNIT_STUB)
696 return -ENOENT;
697
698 /* Load drop-in directory data */
699 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
700 return r;
701
702 return 0;
703}
704
705/* Common implementation for multiple backends */
706int unit_load_fragment_and_dropin_optional(Unit *u) {
707 int r;
708
709 assert(u);
710
711 /* Same as unit_load_fragment_and_dropin(), but whether
712 * something can be loaded or not doesn't matter. */
713
714 /* Load a .service file */
715 if ((r = unit_load_fragment(u)) < 0)
716 return r;
717
718 if (u->meta.load_state == UNIT_STUB)
719 u->meta.load_state = UNIT_LOADED;
720
721 /* Load drop-in directory data */
722 if ((r = unit_load_dropin(unit_follow_merge(u))) < 0)
723 return r;
724
725 return 0;
726}
727
728static int unit_add_one_default_dependency(Unit *u, Unit *target) {
729 assert(u);
730 assert(target);
731
732 if (target->meta.type != UNIT_TARGET)
733 return 0;
734
735 /* Don't create loops */
736 if (set_get(target->meta.dependencies[UNIT_BEFORE], u))
737 return 0;
738
739 return unit_add_dependency(target, UNIT_AFTER, u, true);
740}
741
742static int unit_add_default_dependencies(Unit *u) {
743 Unit *other;
744 Iterator i;
745 int r;
746
747 assert(u);
748
749 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
750 if ((r = unit_add_one_default_dependency(u, other)) < 0)
751 return r;
752
753 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
754 if ((r = unit_add_one_default_dependency(u, other)) < 0)
755 return r;
756
757 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTED_BY], i)
758 if ((r = unit_add_one_default_dependency(u, other)) < 0)
759 return r;
760
761 return 0;
762}
763
764int unit_load(Unit *u) {
765 int r;
766
767 assert(u);
768
769 if (u->meta.in_load_queue) {
770 LIST_REMOVE(Meta, load_queue, u->meta.manager->load_queue, &u->meta);
771 u->meta.in_load_queue = false;
772 }
773
774 if (u->meta.type == _UNIT_TYPE_INVALID)
775 return -EINVAL;
776
777 if (u->meta.load_state != UNIT_STUB)
778 return 0;
779
780 if (UNIT_VTABLE(u)->load)
781 if ((r = UNIT_VTABLE(u)->load(u)) < 0)
782 goto fail;
783
784 if (u->meta.load_state == UNIT_STUB) {
785 r = -ENOENT;
786 goto fail;
787 }
788
789 if (u->meta.load_state == UNIT_LOADED &&
790 u->meta.default_dependencies)
791 if ((r = unit_add_default_dependencies(u)) < 0)
792 goto fail;
793
794 assert((u->meta.load_state != UNIT_MERGED) == !u->meta.merged_into);
795
796 unit_add_to_dbus_queue(unit_follow_merge(u));
797 unit_add_to_gc_queue(u);
798
799 return 0;
800
801fail:
802 u->meta.load_state = UNIT_ERROR;
803 u->meta.load_error = r;
804 unit_add_to_dbus_queue(u);
805
806 log_debug("Failed to load configuration for %s: %s", u->meta.id, strerror(-r));
807
808 return r;
809}
810
811/* Errors:
812 * -EBADR: This unit type does not support starting.
813 * -EALREADY: Unit is already started.
814 * -EAGAIN: An operation is already in progress. Retry later.
815 * -ECANCELED: Too many requests for now.
816 */
817int unit_start(Unit *u) {
818 UnitActiveState state;
819
820 assert(u);
821
822 if (u->meta.load_state != UNIT_LOADED)
823 return -EINVAL;
824
825 /* If this is already (being) started, then this will
826 * succeed. Note that this will even succeed if this unit is
827 * not startable by the user. This is relied on to detect when
828 * we need to wait for units and when waiting is finished. */
829 state = unit_active_state(u);
830 if (UNIT_IS_ACTIVE_OR_RELOADING(state))
831 return -EALREADY;
832
833 /* If it is stopped, but we cannot start it, then fail */
834 if (!UNIT_VTABLE(u)->start)
835 return -EBADR;
836
837 /* We don't suppress calls to ->start() here when we are
838 * already starting, to allow this request to be used as a
839 * "hurry up" call, for example when the unit is in some "auto
840 * restart" state where it waits for a holdoff timer to elapse
841 * before it will start again. */
842
843 unit_add_to_dbus_queue(u);
844
845 unit_status_printf(u, "Starting %s...\n", unit_description(u));
846
847 return UNIT_VTABLE(u)->start(u);
848}
849
850bool unit_can_start(Unit *u) {
851 assert(u);
852
853 return !!UNIT_VTABLE(u)->start;
854}
855
856bool unit_can_isolate(Unit *u) {
857 assert(u);
858
859 return unit_can_start(u) &&
860 u->meta.allow_isolate;
861}
862
863/* Errors:
864 * -EBADR: This unit type does not support stopping.
865 * -EALREADY: Unit is already stopped.
866 * -EAGAIN: An operation is already in progress. Retry later.
867 */
868int unit_stop(Unit *u) {
869 UnitActiveState state;
870
871 assert(u);
872
873 state = unit_active_state(u);
874 if (UNIT_IS_INACTIVE_OR_FAILED(state))
875 return -EALREADY;
876
877 if (!UNIT_VTABLE(u)->stop)
878 return -EBADR;
879
880 unit_add_to_dbus_queue(u);
881
882 unit_status_printf(u, "Stopping %s...\n", unit_description(u));
883
884 return UNIT_VTABLE(u)->stop(u);
885}
886
887/* Errors:
888 * -EBADR: This unit type does not support reloading.
889 * -ENOEXEC: Unit is not started.
890 * -EAGAIN: An operation is already in progress. Retry later.
891 */
892int unit_reload(Unit *u) {
893 UnitActiveState state;
894
895 assert(u);
896
897 if (u->meta.load_state != UNIT_LOADED)
898 return -EINVAL;
899
900 if (!unit_can_reload(u))
901 return -EBADR;
902
903 state = unit_active_state(u);
904 if (state == UNIT_RELOADING)
905 return -EALREADY;
906
907 if (state != UNIT_ACTIVE)
908 return -ENOEXEC;
909
910 unit_add_to_dbus_queue(u);
911 return UNIT_VTABLE(u)->reload(u);
912}
913
914bool unit_can_reload(Unit *u) {
915 assert(u);
916
917 if (!UNIT_VTABLE(u)->reload)
918 return false;
919
920 if (!UNIT_VTABLE(u)->can_reload)
921 return true;
922
923 return UNIT_VTABLE(u)->can_reload(u);
924}
925
926static void unit_check_uneeded(Unit *u) {
927 Iterator i;
928 Unit *other;
929
930 assert(u);
931
932 /* If this service shall be shut down when unneeded then do
933 * so. */
934
935 if (!u->meta.stop_when_unneeded)
936 return;
937
938 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)))
939 return;
940
941 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
942 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
943 return;
944
945 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY_OVERRIDABLE], i)
946 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
947 return;
948
949 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTED_BY], i)
950 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
951 return;
952
953 log_info("Service %s is not needed anymore. Stopping.", u->meta.id);
954
955 /* Ok, nobody needs us anymore. Sniff. Then let's commit suicide */
956 manager_add_job(u->meta.manager, JOB_STOP, u, JOB_FAIL, true, NULL, NULL);
957}
958
959static void retroactively_start_dependencies(Unit *u) {
960 Iterator i;
961 Unit *other;
962
963 assert(u);
964 assert(UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(u)));
965
966 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
967 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
968 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
969
970 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
971 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
972 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL, NULL);
973
974 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
975 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
976 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
977
978 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
979 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
980 manager_add_job(u->meta.manager, JOB_START, other, JOB_FAIL, false, NULL, NULL);
981
982 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTS], i)
983 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
984 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
985
986 SET_FOREACH(other, u->meta.dependencies[UNIT_CONFLICTED_BY], i)
987 if (!UNIT_IS_ACTIVE_OR_ACTIVATING(unit_active_state(other)))
988 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
989}
990
991static void retroactively_stop_dependencies(Unit *u) {
992 Iterator i;
993 Unit *other;
994
995 assert(u);
996 assert(UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)));
997
998 if (u->meta.recursive_stop) {
999 /* Pull down units need us recursively if enabled */
1000 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRED_BY], i)
1001 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1002 manager_add_job(u->meta.manager, JOB_STOP, other, JOB_REPLACE, true, NULL, NULL);
1003 }
1004
1005 /* Garbage collect services that might not be needed anymore, if enabled */
1006 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES], i)
1007 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1008 unit_check_uneeded(other);
1009 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUIRES_OVERRIDABLE], i)
1010 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1011 unit_check_uneeded(other);
1012 SET_FOREACH(other, u->meta.dependencies[UNIT_WANTS], i)
1013 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1014 unit_check_uneeded(other);
1015 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE], i)
1016 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1017 unit_check_uneeded(other);
1018 SET_FOREACH(other, u->meta.dependencies[UNIT_REQUISITE_OVERRIDABLE], i)
1019 if (!UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(other)))
1020 unit_check_uneeded(other);
1021}
1022
1023void unit_notify(Unit *u, UnitActiveState os, UnitActiveState ns) {
1024 dual_timestamp ts;
1025 bool unexpected;
1026
1027 assert(u);
1028 assert(os < _UNIT_ACTIVE_STATE_MAX);
1029 assert(ns < _UNIT_ACTIVE_STATE_MAX);
1030
1031 /* Note that this is called for all low-level state changes,
1032 * even if they might map to the same high-level
1033 * UnitActiveState! That means that ns == os is OK an expected
1034 * behaviour here. For example: if a mount point is remounted
1035 * this function will be called too! */
1036
1037 dual_timestamp_get(&ts);
1038
1039 if (UNIT_IS_INACTIVE_OR_FAILED(os) && !UNIT_IS_INACTIVE_OR_FAILED(ns))
1040 u->meta.inactive_exit_timestamp = ts;
1041 else if (!UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_INACTIVE_OR_FAILED(ns))
1042 u->meta.inactive_enter_timestamp = ts;
1043
1044 if (!UNIT_IS_ACTIVE_OR_RELOADING(os) && UNIT_IS_ACTIVE_OR_RELOADING(ns))
1045 u->meta.active_enter_timestamp = ts;
1046 else if (UNIT_IS_ACTIVE_OR_RELOADING(os) && !UNIT_IS_ACTIVE_OR_RELOADING(ns))
1047 u->meta.active_exit_timestamp = ts;
1048
1049 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1050 cgroup_bonding_trim_list(u->meta.cgroup_bondings, true);
1051
1052 timer_unit_notify(u, ns);
1053 path_unit_notify(u, ns);
1054
1055 if (u->meta.job) {
1056 unexpected = false;
1057
1058 if (u->meta.job->state == JOB_WAITING)
1059
1060 /* So we reached a different state for this
1061 * job. Let's see if we can run it now if it
1062 * failed previously due to EAGAIN. */
1063 job_add_to_run_queue(u->meta.job);
1064
1065 /* Let's check whether this state change constitutes a
1066 * finished job, or maybe cotradicts a running job and
1067 * hence needs to invalidate jobs. */
1068
1069 switch (u->meta.job->type) {
1070
1071 case JOB_START:
1072 case JOB_VERIFY_ACTIVE:
1073
1074 if (UNIT_IS_ACTIVE_OR_RELOADING(ns))
1075 job_finish_and_invalidate(u->meta.job, true);
1076 else if (u->meta.job->state == JOB_RUNNING && ns != UNIT_ACTIVATING) {
1077 unexpected = true;
1078
1079 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1080 job_finish_and_invalidate(u->meta.job, ns != UNIT_FAILED);
1081 }
1082
1083 break;
1084
1085 case JOB_RELOAD:
1086 case JOB_RELOAD_OR_START:
1087
1088 if (u->meta.job->state == JOB_RUNNING) {
1089 if (ns == UNIT_ACTIVE)
1090 job_finish_and_invalidate(u->meta.job, true);
1091 else if (ns != UNIT_ACTIVATING && ns != UNIT_RELOADING) {
1092 unexpected = true;
1093
1094 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1095 job_finish_and_invalidate(u->meta.job, ns != UNIT_FAILED);
1096 }
1097 }
1098
1099 break;
1100
1101 case JOB_STOP:
1102 case JOB_RESTART:
1103 case JOB_TRY_RESTART:
1104
1105 if (UNIT_IS_INACTIVE_OR_FAILED(ns))
1106 job_finish_and_invalidate(u->meta.job, true);
1107 else if (u->meta.job->state == JOB_RUNNING && ns != UNIT_DEACTIVATING) {
1108 unexpected = true;
1109 job_finish_and_invalidate(u->meta.job, false);
1110 }
1111
1112 break;
1113
1114 default:
1115 assert_not_reached("Job type unknown");
1116 }
1117
1118 } else
1119 unexpected = true;
1120
1121 /* If this state change happened without being requested by a
1122 * job, then let's retroactively start or stop
1123 * dependencies. We skip that step when deserializing, since
1124 * we don't want to create any additional jobs just because
1125 * something is already activated. */
1126
1127 if (unexpected && u->meta.manager->n_deserializing <= 0) {
1128 if (UNIT_IS_INACTIVE_OR_FAILED(os) && UNIT_IS_ACTIVE_OR_ACTIVATING(ns))
1129 retroactively_start_dependencies(u);
1130 else if (UNIT_IS_ACTIVE_OR_ACTIVATING(os) && UNIT_IS_INACTIVE_OR_DEACTIVATING(ns))
1131 retroactively_stop_dependencies(u);
1132 }
1133
1134 if (ns != os && ns == UNIT_FAILED) {
1135 Iterator i;
1136 Unit *other;
1137
1138 SET_FOREACH(other, u->meta.dependencies[UNIT_ON_FAILURE], i)
1139 manager_add_job(u->meta.manager, JOB_START, other, JOB_REPLACE, true, NULL, NULL);
1140
1141 log_notice("Unit %s entered failed state.", u->meta.id);
1142 }
1143
1144 /* Some names are special */
1145 if (UNIT_IS_ACTIVE_OR_RELOADING(ns)) {
1146 if (unit_has_name(u, SPECIAL_DBUS_SERVICE))
1147 /* The bus just might have become available,
1148 * hence try to connect to it, if we aren't
1149 * yet connected. */
1150 bus_init(u->meta.manager);
1151
1152 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1153 /* The syslog daemon just might have become
1154 * available, hence try to connect to it, if
1155 * we aren't yet connected. */
1156 log_open();
1157
1158 if (u->meta.type == UNIT_SERVICE &&
1159 !UNIT_IS_ACTIVE_OR_RELOADING(os)) {
1160 /* Write audit record if we have just finished starting up */
1161 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_START, 1);
1162 u->meta.in_audit = true;
1163 }
1164
1165 } else {
1166
1167 if (unit_has_name(u, SPECIAL_SYSLOG_SERVICE))
1168 /* The syslog daemon might just have
1169 * terminated, hence try to disconnect from
1170 * it. */
1171 log_close_syslog();
1172
1173 /* We don't care about D-Bus here, since we'll get an
1174 * asynchronous notification for it anyway. */
1175
1176 if (u->meta.type == UNIT_SERVICE &&
1177 UNIT_IS_INACTIVE_OR_FAILED(ns) &&
1178 !UNIT_IS_INACTIVE_OR_FAILED(os)) {
1179
1180 /* Hmm, if there was no start record written
1181 * write it now, so that we always have a nice
1182 * pair */
1183 if (!u->meta.in_audit) {
1184 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_START, ns == UNIT_INACTIVE);
1185
1186 if (ns == UNIT_INACTIVE)
1187 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_STOP, true);
1188 } else
1189 /* Write audit record if we have just finished shutting down */
1190 manager_send_unit_audit(u->meta.manager, u, AUDIT_SERVICE_STOP, ns == UNIT_INACTIVE);
1191
1192 u->meta.in_audit = false;
1193 }
1194 }
1195
1196 /* Maybe we finished startup and are now ready for being
1197 * stopped because unneeded? */
1198 unit_check_uneeded(u);
1199
1200 unit_add_to_dbus_queue(u);
1201 unit_add_to_gc_queue(u);
1202}
1203
1204int unit_watch_fd(Unit *u, int fd, uint32_t events, Watch *w) {
1205 struct epoll_event ev;
1206
1207 assert(u);
1208 assert(fd >= 0);
1209 assert(w);
1210 assert(w->type == WATCH_INVALID || (w->type == WATCH_FD && w->fd == fd && w->data.unit == u));
1211
1212 zero(ev);
1213 ev.data.ptr = w;
1214 ev.events = events;
1215
1216 if (epoll_ctl(u->meta.manager->epoll_fd,
1217 w->type == WATCH_INVALID ? EPOLL_CTL_ADD : EPOLL_CTL_MOD,
1218 fd,
1219 &ev) < 0)
1220 return -errno;
1221
1222 w->fd = fd;
1223 w->type = WATCH_FD;
1224 w->data.unit = u;
1225
1226 return 0;
1227}
1228
1229void unit_unwatch_fd(Unit *u, Watch *w) {
1230 assert(u);
1231 assert(w);
1232
1233 if (w->type == WATCH_INVALID)
1234 return;
1235
1236 assert(w->type == WATCH_FD);
1237 assert(w->data.unit == u);
1238 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1239
1240 w->fd = -1;
1241 w->type = WATCH_INVALID;
1242 w->data.unit = NULL;
1243}
1244
1245int unit_watch_pid(Unit *u, pid_t pid) {
1246 assert(u);
1247 assert(pid >= 1);
1248
1249 /* Watch a specific PID. We only support one unit watching
1250 * each PID for now. */
1251
1252 return hashmap_put(u->meta.manager->watch_pids, LONG_TO_PTR(pid), u);
1253}
1254
1255void unit_unwatch_pid(Unit *u, pid_t pid) {
1256 assert(u);
1257 assert(pid >= 1);
1258
1259 hashmap_remove_value(u->meta.manager->watch_pids, LONG_TO_PTR(pid), u);
1260}
1261
1262int unit_watch_timer(Unit *u, usec_t delay, Watch *w) {
1263 struct itimerspec its;
1264 int flags, fd;
1265 bool ours;
1266
1267 assert(u);
1268 assert(w);
1269 assert(w->type == WATCH_INVALID || (w->type == WATCH_UNIT_TIMER && w->data.unit == u));
1270
1271 /* This will try to reuse the old timer if there is one */
1272
1273 if (w->type == WATCH_UNIT_TIMER) {
1274 assert(w->data.unit == u);
1275 assert(w->fd >= 0);
1276
1277 ours = false;
1278 fd = w->fd;
1279 } else if (w->type == WATCH_INVALID) {
1280
1281 ours = true;
1282 if ((fd = timerfd_create(CLOCK_MONOTONIC, TFD_NONBLOCK|TFD_CLOEXEC)) < 0)
1283 return -errno;
1284 } else
1285 assert_not_reached("Invalid watch type");
1286
1287 zero(its);
1288
1289 if (delay <= 0) {
1290 /* Set absolute time in the past, but not 0, since we
1291 * don't want to disarm the timer */
1292 its.it_value.tv_sec = 0;
1293 its.it_value.tv_nsec = 1;
1294
1295 flags = TFD_TIMER_ABSTIME;
1296 } else {
1297 timespec_store(&its.it_value, delay);
1298 flags = 0;
1299 }
1300
1301 /* This will also flush the elapse counter */
1302 if (timerfd_settime(fd, flags, &its, NULL) < 0)
1303 goto fail;
1304
1305 if (w->type == WATCH_INVALID) {
1306 struct epoll_event ev;
1307
1308 zero(ev);
1309 ev.data.ptr = w;
1310 ev.events = EPOLLIN;
1311
1312 if (epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_ADD, fd, &ev) < 0)
1313 goto fail;
1314 }
1315
1316 w->type = WATCH_UNIT_TIMER;
1317 w->fd = fd;
1318 w->data.unit = u;
1319
1320 return 0;
1321
1322fail:
1323 if (ours)
1324 close_nointr_nofail(fd);
1325
1326 return -errno;
1327}
1328
1329void unit_unwatch_timer(Unit *u, Watch *w) {
1330 assert(u);
1331 assert(w);
1332
1333 if (w->type == WATCH_INVALID)
1334 return;
1335
1336 assert(w->type == WATCH_UNIT_TIMER);
1337 assert(w->data.unit == u);
1338 assert(w->fd >= 0);
1339
1340 assert_se(epoll_ctl(u->meta.manager->epoll_fd, EPOLL_CTL_DEL, w->fd, NULL) >= 0);
1341 close_nointr_nofail(w->fd);
1342
1343 w->fd = -1;
1344 w->type = WATCH_INVALID;
1345 w->data.unit = NULL;
1346}
1347
1348bool unit_job_is_applicable(Unit *u, JobType j) {
1349 assert(u);
1350 assert(j >= 0 && j < _JOB_TYPE_MAX);
1351
1352 switch (j) {
1353
1354 case JOB_VERIFY_ACTIVE:
1355 case JOB_START:
1356 return true;
1357
1358 case JOB_STOP:
1359 case JOB_RESTART:
1360 case JOB_TRY_RESTART:
1361 return unit_can_start(u);
1362
1363 case JOB_RELOAD:
1364 return unit_can_reload(u);
1365
1366 case JOB_RELOAD_OR_START:
1367 return unit_can_reload(u) && unit_can_start(u);
1368
1369 default:
1370 assert_not_reached("Invalid job type");
1371 }
1372}
1373
1374int unit_add_dependency(Unit *u, UnitDependency d, Unit *other, bool add_reference) {
1375
1376 static const UnitDependency inverse_table[_UNIT_DEPENDENCY_MAX] = {
1377 [UNIT_REQUIRES] = UNIT_REQUIRED_BY,
1378 [UNIT_REQUIRES_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1379 [UNIT_WANTS] = UNIT_WANTED_BY,
1380 [UNIT_REQUISITE] = UNIT_REQUIRED_BY,
1381 [UNIT_REQUISITE_OVERRIDABLE] = UNIT_REQUIRED_BY_OVERRIDABLE,
1382 [UNIT_REQUIRED_BY] = _UNIT_DEPENDENCY_INVALID,
1383 [UNIT_REQUIRED_BY_OVERRIDABLE] = _UNIT_DEPENDENCY_INVALID,
1384 [UNIT_WANTED_BY] = _UNIT_DEPENDENCY_INVALID,
1385 [UNIT_CONFLICTS] = UNIT_CONFLICTED_BY,
1386 [UNIT_CONFLICTED_BY] = UNIT_CONFLICTS,
1387 [UNIT_BEFORE] = UNIT_AFTER,
1388 [UNIT_AFTER] = UNIT_BEFORE,
1389 [UNIT_ON_FAILURE] = _UNIT_DEPENDENCY_INVALID,
1390 [UNIT_REFERENCES] = UNIT_REFERENCED_BY,
1391 [UNIT_REFERENCED_BY] = UNIT_REFERENCES
1392 };
1393 int r, q = 0, v = 0, w = 0;
1394
1395 assert(u);
1396 assert(d >= 0 && d < _UNIT_DEPENDENCY_MAX);
1397 assert(other);
1398
1399 /* We won't allow dependencies on ourselves. We will not
1400 * consider them an error however. */
1401 if (u == other)
1402 return 0;
1403
1404 if (UNIT_VTABLE(u)->no_requires &&
1405 (d == UNIT_REQUIRES ||
1406 d == UNIT_REQUIRES_OVERRIDABLE ||
1407 d == UNIT_REQUISITE ||
1408 d == UNIT_REQUISITE_OVERRIDABLE)) {
1409 return -EINVAL;
1410 }
1411
1412 if ((r = set_ensure_allocated(&u->meta.dependencies[d], trivial_hash_func, trivial_compare_func)) < 0)
1413 return r;
1414
1415 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID)
1416 if ((r = set_ensure_allocated(&other->meta.dependencies[inverse_table[d]], trivial_hash_func, trivial_compare_func)) < 0)
1417 return r;
1418
1419 if (add_reference)
1420 if ((r = set_ensure_allocated(&u->meta.dependencies[UNIT_REFERENCES], trivial_hash_func, trivial_compare_func)) < 0 ||
1421 (r = set_ensure_allocated(&other->meta.dependencies[UNIT_REFERENCED_BY], trivial_hash_func, trivial_compare_func)) < 0)
1422 return r;
1423
1424 if ((q = set_put(u->meta.dependencies[d], other)) < 0)
1425 return q;
1426
1427 if (inverse_table[d] != _UNIT_DEPENDENCY_INVALID)
1428 if ((v = set_put(other->meta.dependencies[inverse_table[d]], u)) < 0) {
1429 r = v;
1430 goto fail;
1431 }
1432
1433 if (add_reference) {
1434 if ((w = set_put(u->meta.dependencies[UNIT_REFERENCES], other)) < 0) {
1435 r = w;
1436 goto fail;
1437 }
1438
1439 if ((r = set_put(other->meta.dependencies[UNIT_REFERENCED_BY], u)) < 0)
1440 goto fail;
1441 }
1442
1443 unit_add_to_dbus_queue(u);
1444 return 0;
1445
1446fail:
1447 if (q > 0)
1448 set_remove(u->meta.dependencies[d], other);
1449
1450 if (v > 0)
1451 set_remove(other->meta.dependencies[inverse_table[d]], u);
1452
1453 if (w > 0)
1454 set_remove(u->meta.dependencies[UNIT_REFERENCES], other);
1455
1456 return r;
1457}
1458
1459int unit_add_two_dependencies(Unit *u, UnitDependency d, UnitDependency e, Unit *other, bool add_reference) {
1460 int r;
1461
1462 assert(u);
1463
1464 if ((r = unit_add_dependency(u, d, other, add_reference)) < 0)
1465 return r;
1466
1467 if ((r = unit_add_dependency(u, e, other, add_reference)) < 0)
1468 return r;
1469
1470 return 0;
1471}
1472
1473static const char *resolve_template(Unit *u, const char *name, const char*path, char **p) {
1474 char *s;
1475
1476 assert(u);
1477 assert(name || path);
1478
1479 if (!name)
1480 name = file_name_from_path(path);
1481
1482 if (!unit_name_is_template(name)) {
1483 *p = NULL;
1484 return name;
1485 }
1486
1487 if (u->meta.instance)
1488 s = unit_name_replace_instance(name, u->meta.instance);
1489 else {
1490 char *i;
1491
1492 if (!(i = unit_name_to_prefix(u->meta.id)))
1493 return NULL;
1494
1495 s = unit_name_replace_instance(name, i);
1496 free(i);
1497 }
1498
1499 if (!s)
1500 return NULL;
1501
1502 *p = s;
1503 return s;
1504}
1505
1506int unit_add_dependency_by_name(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1507 Unit *other;
1508 int r;
1509 char *s;
1510
1511 assert(u);
1512 assert(name || path);
1513
1514 if (!(name = resolve_template(u, name, path, &s)))
1515 return -ENOMEM;
1516
1517 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1518 goto finish;
1519
1520 r = unit_add_dependency(u, d, other, add_reference);
1521
1522finish:
1523 free(s);
1524 return r;
1525}
1526
1527int unit_add_two_dependencies_by_name(Unit *u, UnitDependency d, UnitDependency e, const char *name, const char *path, bool add_reference) {
1528 Unit *other;
1529 int r;
1530 char *s;
1531
1532 assert(u);
1533 assert(name || path);
1534
1535 if (!(name = resolve_template(u, name, path, &s)))
1536 return -ENOMEM;
1537
1538 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1539 goto finish;
1540
1541 r = unit_add_two_dependencies(u, d, e, other, add_reference);
1542
1543finish:
1544 free(s);
1545 return r;
1546}
1547
1548int unit_add_dependency_by_name_inverse(Unit *u, UnitDependency d, const char *name, const char *path, bool add_reference) {
1549 Unit *other;
1550 int r;
1551 char *s;
1552
1553 assert(u);
1554 assert(name || path);
1555
1556 if (!(name = resolve_template(u, name, path, &s)))
1557 return -ENOMEM;
1558
1559 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1560 goto finish;
1561
1562 r = unit_add_dependency(other, d, u, add_reference);
1563
1564finish:
1565 free(s);
1566 return r;
1567}
1568
1569int unit_add_two_dependencies_by_name_inverse(Unit *u, UnitDependency d, UnitDependency e, const char *name, const char *path, bool add_reference) {
1570 Unit *other;
1571 int r;
1572 char *s;
1573
1574 assert(u);
1575 assert(name || path);
1576
1577 if (!(name = resolve_template(u, name, path, &s)))
1578 return -ENOMEM;
1579
1580 if ((r = manager_load_unit(u->meta.manager, name, path, NULL, &other)) < 0)
1581 goto finish;
1582
1583 if ((r = unit_add_two_dependencies(other, d, e, u, add_reference)) < 0)
1584 goto finish;
1585
1586finish:
1587 free(s);
1588 return r;
1589}
1590
1591int set_unit_path(const char *p) {
1592 char *cwd, *c;
1593 int r;
1594
1595 /* This is mostly for debug purposes */
1596
1597 if (path_is_absolute(p)) {
1598 if (!(c = strdup(p)))
1599 return -ENOMEM;
1600 } else {
1601 if (!(cwd = get_current_dir_name()))
1602 return -errno;
1603
1604 r = asprintf(&c, "%s/%s", cwd, p);
1605 free(cwd);
1606
1607 if (r < 0)
1608 return -ENOMEM;
1609 }
1610
1611 if (setenv("SYSTEMD_UNIT_PATH", c, 0) < 0) {
1612 r = -errno;
1613 free(c);
1614 return r;
1615 }
1616
1617 return 0;
1618}
1619
1620char *unit_dbus_path(Unit *u) {
1621 char *p, *e;
1622
1623 assert(u);
1624
1625 if (!u->meta.id)
1626 return NULL;
1627
1628 if (!(e = bus_path_escape(u->meta.id)))
1629 return NULL;
1630
1631 p = strappend("/org/freedesktop/systemd1/unit/", e);
1632 free(e);
1633
1634 return p;
1635}
1636
1637int unit_add_cgroup(Unit *u, CGroupBonding *b) {
1638 CGroupBonding *l;
1639 int r;
1640
1641 assert(u);
1642 assert(b);
1643
1644 assert(b->path);
1645
1646 if (!b->controller)
1647 if (!(b->controller = strdup(SYSTEMD_CGROUP_CONTROLLER)))
1648 return -ENOMEM;
1649
1650 /* Ensure this hasn't been added yet */
1651 assert(!b->unit);
1652
1653 l = hashmap_get(u->meta.manager->cgroup_bondings, b->path);
1654 LIST_PREPEND(CGroupBonding, by_path, l, b);
1655
1656 if ((r = hashmap_replace(u->meta.manager->cgroup_bondings, b->path, l)) < 0) {
1657 LIST_REMOVE(CGroupBonding, by_path, l, b);
1658 return r;
1659 }
1660
1661 LIST_PREPEND(CGroupBonding, by_unit, u->meta.cgroup_bondings, b);
1662 b->unit = u;
1663
1664 return 0;
1665}
1666
1667static char *default_cgroup_path(Unit *u) {
1668 char *p;
1669 int r;
1670
1671 assert(u);
1672
1673 if (u->meta.instance) {
1674 char *t;
1675
1676 if (!(t = unit_name_template(u->meta.id)))
1677 return NULL;
1678
1679 r = asprintf(&p, "%s/%s/%s", u->meta.manager->cgroup_hierarchy, t, u->meta.instance);
1680 free(t);
1681 } else
1682 r = asprintf(&p, "%s/%s", u->meta.manager->cgroup_hierarchy, u->meta.id);
1683
1684 return r < 0 ? NULL : p;
1685}
1686
1687int unit_add_cgroup_from_text(Unit *u, const char *name) {
1688 char *controller = NULL, *path = NULL;
1689 CGroupBonding *b = NULL;
1690 int r;
1691
1692 assert(u);
1693 assert(name);
1694
1695 if ((r = cg_split_spec(name, &controller, &path)) < 0)
1696 return r;
1697
1698 if (!path)
1699 path = default_cgroup_path(u);
1700
1701 if (!controller)
1702 controller = strdup(SYSTEMD_CGROUP_CONTROLLER);
1703
1704 if (!path || !controller) {
1705 free(path);
1706 free(controller);
1707
1708 return -ENOMEM;
1709 }
1710
1711 if (cgroup_bonding_find_list(u->meta.cgroup_bondings, controller)) {
1712 r = -EEXIST;
1713 goto fail;
1714 }
1715
1716 if (!(b = new0(CGroupBonding, 1))) {
1717 r = -ENOMEM;
1718 goto fail;
1719 }
1720
1721 b->controller = controller;
1722 b->path = path;
1723 b->only_us = false;
1724 b->clean_up = false;
1725
1726 if ((r = unit_add_cgroup(u, b)) < 0)
1727 goto fail;
1728
1729 return 0;
1730
1731fail:
1732 free(path);
1733 free(controller);
1734 free(b);
1735
1736 return r;
1737}
1738
1739int unit_add_default_cgroup(Unit *u) {
1740 CGroupBonding *b;
1741 int r = -ENOMEM;
1742
1743 assert(u);
1744
1745 /* Adds in the default cgroup data, if it wasn't specified yet */
1746
1747 if (unit_get_default_cgroup(u))
1748 return 0;
1749
1750 if (!(b = new0(CGroupBonding, 1)))
1751 return -ENOMEM;
1752
1753 if (!(b->path = default_cgroup_path(u)))
1754 goto fail;
1755
1756 b->clean_up = true;
1757 b->only_us = true;
1758
1759 if ((r = unit_add_cgroup(u, b)) < 0)
1760 goto fail;
1761
1762 return 0;
1763
1764fail:
1765 free(b->path);
1766 free(b->controller);
1767 free(b);
1768
1769 return r;
1770}
1771
1772CGroupBonding* unit_get_default_cgroup(Unit *u) {
1773 assert(u);
1774
1775 return cgroup_bonding_find_list(u->meta.cgroup_bondings, SYSTEMD_CGROUP_CONTROLLER);
1776}
1777
1778int unit_load_related_unit(Unit *u, const char *type, Unit **_found) {
1779 char *t;
1780 int r;
1781
1782 assert(u);
1783 assert(type);
1784 assert(_found);
1785
1786 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1787 return -ENOMEM;
1788
1789 assert(!unit_has_name(u, t));
1790
1791 r = manager_load_unit(u->meta.manager, t, NULL, NULL, _found);
1792 free(t);
1793
1794 assert(r < 0 || *_found != u);
1795
1796 return r;
1797}
1798
1799int unit_get_related_unit(Unit *u, const char *type, Unit **_found) {
1800 Unit *found;
1801 char *t;
1802
1803 assert(u);
1804 assert(type);
1805 assert(_found);
1806
1807 if (!(t = unit_name_change_suffix(u->meta.id, type)))
1808 return -ENOMEM;
1809
1810 assert(!unit_has_name(u, t));
1811
1812 found = manager_get_unit(u->meta.manager, t);
1813 free(t);
1814
1815 if (!found)
1816 return -ENOENT;
1817
1818 *_found = found;
1819 return 0;
1820}
1821
1822static char *specifier_prefix_and_instance(char specifier, void *data, void *userdata) {
1823 Unit *u = userdata;
1824 assert(u);
1825
1826 return unit_name_to_prefix_and_instance(u->meta.id);
1827}
1828
1829static char *specifier_prefix(char specifier, void *data, void *userdata) {
1830 Unit *u = userdata;
1831 assert(u);
1832
1833 return unit_name_to_prefix(u->meta.id);
1834}
1835
1836static char *specifier_prefix_unescaped(char specifier, void *data, void *userdata) {
1837 Unit *u = userdata;
1838 char *p, *r;
1839
1840 assert(u);
1841
1842 if (!(p = unit_name_to_prefix(u->meta.id)))
1843 return NULL;
1844
1845 r = unit_name_unescape(p);
1846 free(p);
1847
1848 return r;
1849}
1850
1851static char *specifier_instance_unescaped(char specifier, void *data, void *userdata) {
1852 Unit *u = userdata;
1853 assert(u);
1854
1855 if (u->meta.instance)
1856 return unit_name_unescape(u->meta.instance);
1857
1858 return strdup("");
1859}
1860
1861char *unit_name_printf(Unit *u, const char* format) {
1862
1863 /*
1864 * This will use the passed string as format string and
1865 * replace the following specifiers:
1866 *
1867 * %n: the full id of the unit (foo@bar.waldo)
1868 * %N: the id of the unit without the suffix (foo@bar)
1869 * %p: the prefix (foo)
1870 * %i: the instance (bar)
1871 */
1872
1873 const Specifier table[] = {
1874 { 'n', specifier_string, u->meta.id },
1875 { 'N', specifier_prefix_and_instance, NULL },
1876 { 'p', specifier_prefix, NULL },
1877 { 'i', specifier_string, u->meta.instance },
1878 { 0, NULL, NULL }
1879 };
1880
1881 assert(u);
1882 assert(format);
1883
1884 return specifier_printf(format, table, u);
1885}
1886
1887char *unit_full_printf(Unit *u, const char *format) {
1888
1889 /* This is similar to unit_name_printf() but also supports
1890 * unescaping */
1891
1892 const Specifier table[] = {
1893 { 'n', specifier_string, u->meta.id },
1894 { 'N', specifier_prefix_and_instance, NULL },
1895 { 'p', specifier_prefix, NULL },
1896 { 'P', specifier_prefix_unescaped, NULL },
1897 { 'i', specifier_string, u->meta.instance },
1898 { 'I', specifier_instance_unescaped, NULL },
1899 { 0, NULL, NULL }
1900 };
1901
1902 assert(u);
1903 assert(format);
1904
1905 return specifier_printf(format, table, u);
1906}
1907
1908char **unit_full_printf_strv(Unit *u, char **l) {
1909 size_t n;
1910 char **r, **i, **j;
1911
1912 /* Applies unit_full_printf to every entry in l */
1913
1914 assert(u);
1915
1916 n = strv_length(l);
1917 if (!(r = new(char*, n+1)))
1918 return NULL;
1919
1920 for (i = l, j = r; *i; i++, j++)
1921 if (!(*j = unit_full_printf(u, *i)))
1922 goto fail;
1923
1924 *j = NULL;
1925 return r;
1926
1927fail:
1928 j--;
1929 while (j >= r)
1930 free(*j);
1931
1932 free(r);
1933
1934 return NULL;
1935}
1936
1937int unit_watch_bus_name(Unit *u, const char *name) {
1938 assert(u);
1939 assert(name);
1940
1941 /* Watch a specific name on the bus. We only support one unit
1942 * watching each name for now. */
1943
1944 return hashmap_put(u->meta.manager->watch_bus, name, u);
1945}
1946
1947void unit_unwatch_bus_name(Unit *u, const char *name) {
1948 assert(u);
1949 assert(name);
1950
1951 hashmap_remove_value(u->meta.manager->watch_bus, name, u);
1952}
1953
1954bool unit_can_serialize(Unit *u) {
1955 assert(u);
1956
1957 return UNIT_VTABLE(u)->serialize && UNIT_VTABLE(u)->deserialize_item;
1958}
1959
1960int unit_serialize(Unit *u, FILE *f, FDSet *fds) {
1961 int r;
1962
1963 assert(u);
1964 assert(f);
1965 assert(fds);
1966
1967 if (!unit_can_serialize(u))
1968 return 0;
1969
1970 if ((r = UNIT_VTABLE(u)->serialize(u, f, fds)) < 0)
1971 return r;
1972
1973 if (u->meta.job)
1974 unit_serialize_item(u, f, "job", job_type_to_string(u->meta.job->type));
1975
1976 /* End marker */
1977 fputc('\n', f);
1978 return 0;
1979}
1980
1981void unit_serialize_item_format(Unit *u, FILE *f, const char *key, const char *format, ...) {
1982 va_list ap;
1983
1984 assert(u);
1985 assert(f);
1986 assert(key);
1987 assert(format);
1988
1989 fputs(key, f);
1990 fputc('=', f);
1991
1992 va_start(ap, format);
1993 vfprintf(f, format, ap);
1994 va_end(ap);
1995
1996 fputc('\n', f);
1997}
1998
1999void unit_serialize_item(Unit *u, FILE *f, const char *key, const char *value) {
2000 assert(u);
2001 assert(f);
2002 assert(key);
2003 assert(value);
2004
2005 fprintf(f, "%s=%s\n", key, value);
2006}
2007
2008int unit_deserialize(Unit *u, FILE *f, FDSet *fds) {
2009 int r;
2010
2011 assert(u);
2012 assert(f);
2013 assert(fds);
2014
2015 if (!unit_can_serialize(u))
2016 return 0;
2017
2018 for (;;) {
2019 char line[1024], *l, *v;
2020 size_t k;
2021
2022 if (!fgets(line, sizeof(line), f)) {
2023 if (feof(f))
2024 return 0;
2025 return -errno;
2026 }
2027
2028 char_array_0(line);
2029 l = strstrip(line);
2030
2031 /* End marker */
2032 if (l[0] == 0)
2033 return 0;
2034
2035 k = strcspn(l, "=");
2036
2037 if (l[k] == '=') {
2038 l[k] = 0;
2039 v = l+k+1;
2040 } else
2041 v = l+k;
2042
2043 if (streq(l, "job")) {
2044 JobType type;
2045
2046 if ((type = job_type_from_string(v)) < 0)
2047 log_debug("Failed to parse job type value %s", v);
2048 else
2049 u->meta.deserialized_job = type;
2050
2051 continue;
2052 }
2053
2054 if ((r = UNIT_VTABLE(u)->deserialize_item(u, l, v, fds)) < 0)
2055 return r;
2056 }
2057}
2058
2059int unit_add_node_link(Unit *u, const char *what, bool wants) {
2060 Unit *device;
2061 char *e;
2062 int r;
2063
2064 assert(u);
2065
2066 if (!what)
2067 return 0;
2068
2069 /* Adds in links to the device node that this unit is based on */
2070
2071 if (!is_device_path(what))
2072 return 0;
2073
2074 if (!(e = unit_name_build_escape(what+1, NULL, ".device")))
2075 return -ENOMEM;
2076
2077 r = manager_load_unit(u->meta.manager, e, NULL, NULL, &device);
2078 free(e);
2079
2080 if (r < 0)
2081 return r;
2082
2083 if ((r = unit_add_two_dependencies(u, UNIT_AFTER, UNIT_REQUIRES, device, true)) < 0)
2084 return r;
2085
2086 if (wants)
2087 if ((r = unit_add_dependency(device, UNIT_WANTS, u, false)) < 0)
2088 return r;
2089
2090 return 0;
2091}
2092
2093int unit_coldplug(Unit *u) {
2094 int r;
2095
2096 assert(u);
2097
2098 if (UNIT_VTABLE(u)->coldplug)
2099 if ((r = UNIT_VTABLE(u)->coldplug(u)) < 0)
2100 return r;
2101
2102 if (u->meta.deserialized_job >= 0) {
2103 if ((r = manager_add_job(u->meta.manager, u->meta.deserialized_job, u, JOB_FAIL, false, NULL, NULL)) < 0)
2104 return r;
2105
2106 u->meta.deserialized_job = _JOB_TYPE_INVALID;
2107 }
2108
2109 return 0;
2110}
2111
2112void unit_status_printf(Unit *u, const char *format, ...) {
2113 va_list ap;
2114
2115 assert(u);
2116 assert(format);
2117
2118 if (!UNIT_VTABLE(u)->show_status)
2119 return;
2120
2121 if (u->meta.manager->running_as != MANAGER_SYSTEM)
2122 return;
2123
2124 if (!u->meta.manager->show_status)
2125 return;
2126
2127 if (!manager_is_booting_or_shutting_down(u->meta.manager))
2128 return;
2129
2130 va_start(ap, format);
2131 status_vprintf(format, ap);
2132 va_end(ap);
2133}
2134
2135bool unit_need_daemon_reload(Unit *u) {
2136 struct stat st;
2137
2138 assert(u);
2139
2140 if (!u->meta.fragment_path)
2141 return false;
2142
2143 zero(st);
2144 if (stat(u->meta.fragment_path, &st) < 0)
2145 /* What, cannot access this anymore? */
2146 return true;
2147
2148 return
2149 u->meta.fragment_mtime &&
2150 timespec_load(&st.st_mtim) != u->meta.fragment_mtime;
2151}
2152
2153void unit_reset_failed(Unit *u) {
2154 assert(u);
2155
2156 if (UNIT_VTABLE(u)->reset_failed)
2157 UNIT_VTABLE(u)->reset_failed(u);
2158}
2159
2160Unit *unit_following(Unit *u) {
2161 assert(u);
2162
2163 if (UNIT_VTABLE(u)->following)
2164 return UNIT_VTABLE(u)->following(u);
2165
2166 return NULL;
2167}
2168
2169bool unit_pending_inactive(Unit *u) {
2170 assert(u);
2171
2172 /* Returns true if the unit is inactive or going down */
2173
2174 if (UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(u)))
2175 return true;
2176
2177 if (u->meta.job && u->meta.job->type == JOB_STOP)
2178 return true;
2179
2180 return false;
2181}
2182
2183static const char* const unit_load_state_table[_UNIT_LOAD_STATE_MAX] = {
2184 [UNIT_STUB] = "stub",
2185 [UNIT_LOADED] = "loaded",
2186 [UNIT_ERROR] = "error",
2187 [UNIT_MERGED] = "merged"
2188};
2189
2190DEFINE_STRING_TABLE_LOOKUP(unit_load_state, UnitLoadState);
2191
2192static const char* const unit_active_state_table[_UNIT_ACTIVE_STATE_MAX] = {
2193 [UNIT_ACTIVE] = "active",
2194 [UNIT_RELOADING] = "reloading",
2195 [UNIT_INACTIVE] = "inactive",
2196 [UNIT_FAILED] = "failed",
2197 [UNIT_ACTIVATING] = "activating",
2198 [UNIT_DEACTIVATING] = "deactivating"
2199};
2200
2201DEFINE_STRING_TABLE_LOOKUP(unit_active_state, UnitActiveState);
2202
2203static const char* const unit_dependency_table[_UNIT_DEPENDENCY_MAX] = {
2204 [UNIT_REQUIRES] = "Requires",
2205 [UNIT_REQUIRES_OVERRIDABLE] = "RequiresOverridable",
2206 [UNIT_WANTS] = "Wants",
2207 [UNIT_REQUISITE] = "Requisite",
2208 [UNIT_REQUISITE_OVERRIDABLE] = "RequisiteOverridable",
2209 [UNIT_REQUIRED_BY] = "RequiredBy",
2210 [UNIT_REQUIRED_BY_OVERRIDABLE] = "RequiredByOverridable",
2211 [UNIT_WANTED_BY] = "WantedBy",
2212 [UNIT_CONFLICTS] = "Conflicts",
2213 [UNIT_CONFLICTED_BY] = "ConflictedBy",
2214 [UNIT_BEFORE] = "Before",
2215 [UNIT_AFTER] = "After",
2216 [UNIT_REFERENCES] = "References",
2217 [UNIT_REFERENCED_BY] = "ReferencedBy",
2218 [UNIT_ON_FAILURE] = "OnFailure"
2219};
2220
2221DEFINE_STRING_TABLE_LOOKUP(unit_dependency, UnitDependency);
2222
2223static const char* const kill_mode_table[_KILL_MODE_MAX] = {
2224 [KILL_CONTROL_GROUP] = "control-group",
2225 [KILL_PROCESS_GROUP] = "process-group",
2226 [KILL_PROCESS] = "process",
2227 [KILL_NONE] = "none"
2228};
2229
2230DEFINE_STRING_TABLE_LOOKUP(kill_mode, KillMode);
Unnamed repository; edit this file 'description' to name the repository.