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