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