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