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