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