]>
Commit | Line | Data |
---|---|---|
60918275 LP |
1 | /*-*- Mode: C; c-basic-offset: 8 -*-*/ |
2 | ||
3 | #include <assert.h> | |
4 | #include <errno.h> | |
87d1515d | 5 | #include <string.h> |
9152c765 LP |
6 | #include <sys/epoll.h> |
7 | #include <signal.h> | |
8 | #include <sys/signalfd.h> | |
9 | #include <sys/wait.h> | |
10 | #include <unistd.h> | |
11 | #include <sys/poll.h> | |
60918275 LP |
12 | |
13 | #include "manager.h" | |
14 | #include "hashmap.h" | |
15 | #include "macro.h" | |
16 | #include "strv.h" | |
16354eff | 17 | #include "log.h" |
2a987ee8 | 18 | #include "util.h" |
60918275 | 19 | |
ce578209 | 20 | static int manager_setup_signals(Manager *m) { |
9152c765 LP |
21 | sigset_t mask; |
22 | struct epoll_event ev; | |
60918275 | 23 | |
ce578209 LP |
24 | assert(m); |
25 | ||
26 | assert_se(reset_all_signal_handlers() == 0); | |
27 | ||
28 | assert_se(sigemptyset(&mask) == 0); | |
29 | assert_se(sigaddset(&mask, SIGCHLD) == 0); | |
30 | assert_se(sigaddset(&mask, SIGINT) == 0); /* Kernel sends us this on control-alt-del */ | |
31 | assert_se(sigaddset(&mask, SIGWINCH) == 0); /* Kernel sends us this on kbrequest (alt-arrowup) */ | |
32 | assert_se(sigaddset(&mask, SIGTERM) == 0); | |
33 | assert_se(sigaddset(&mask, SIGHUP) == 0); | |
34 | assert_se(sigaddset(&mask, SIGUSR1) == 0); | |
35 | assert_se(sigaddset(&mask, SIGUSR2) == 0); | |
36 | assert_se(sigaddset(&mask, SIGPIPE) == 0); | |
37 | assert_se(sigprocmask(SIG_SETMASK, &mask, NULL) == 0); | |
38 | ||
39 | m->signal_watch.type = WATCH_SIGNAL_FD; | |
40 | if ((m->signal_watch.fd = signalfd(-1, &mask, SFD_NONBLOCK|SFD_CLOEXEC)) < 0) | |
41 | return -errno; | |
42 | ||
43 | zero(ev); | |
44 | ev.events = EPOLLIN; | |
45 | ev.data.ptr = &m->signal_watch; | |
46 | ||
47 | if (epoll_ctl(m->epoll_fd, EPOLL_CTL_ADD, m->signal_watch.fd, &ev) < 0) | |
48 | return -errno; | |
49 | ||
50 | return 0; | |
51 | } | |
52 | ||
ce578209 LP |
53 | Manager* manager_new(void) { |
54 | Manager *m; | |
55 | ||
60918275 LP |
56 | if (!(m = new0(Manager, 1))) |
57 | return NULL; | |
58 | ||
acbb0225 | 59 | m->signal_watch.fd = m->epoll_fd = -1; |
9152c765 | 60 | |
87f0e418 | 61 | if (!(m->units = hashmap_new(string_hash_func, string_compare_func))) |
60918275 LP |
62 | goto fail; |
63 | ||
64 | if (!(m->jobs = hashmap_new(trivial_hash_func, trivial_compare_func))) | |
65 | goto fail; | |
66 | ||
e5b5ae50 | 67 | if (!(m->transaction_jobs = hashmap_new(trivial_hash_func, trivial_compare_func))) |
60918275 LP |
68 | goto fail; |
69 | ||
9152c765 LP |
70 | if (!(m->watch_pids = hashmap_new(trivial_hash_func, trivial_compare_func))) |
71 | goto fail; | |
72 | ||
73 | if ((m->epoll_fd = epoll_create1(EPOLL_CLOEXEC)) < 0) | |
74 | goto fail; | |
75 | ||
ce578209 | 76 | if (manager_setup_signals(m) < 0) |
9152c765 LP |
77 | goto fail; |
78 | ||
60918275 LP |
79 | return m; |
80 | ||
81 | fail: | |
82 | manager_free(m); | |
83 | return NULL; | |
84 | } | |
85 | ||
86 | void manager_free(Manager *m) { | |
7824bbeb | 87 | UnitType c; |
87f0e418 | 88 | Unit *u; |
e5b5ae50 | 89 | Job *j; |
60918275 LP |
90 | |
91 | assert(m); | |
92 | ||
87f0e418 | 93 | while ((j = hashmap_first(m->transaction_jobs))) |
e5b5ae50 LP |
94 | job_free(j); |
95 | ||
87f0e418 LP |
96 | while ((u = hashmap_first(m->units))) |
97 | unit_free(u); | |
98 | ||
7824bbeb LP |
99 | for (c = 0; c < _UNIT_TYPE_MAX; c++) |
100 | if (unit_vtable[c]->shutdown) | |
101 | unit_vtable[c]->shutdown(m); | |
102 | ||
87f0e418 | 103 | hashmap_free(m->units); |
60918275 | 104 | hashmap_free(m->jobs); |
e5b5ae50 | 105 | hashmap_free(m->transaction_jobs); |
9152c765 LP |
106 | hashmap_free(m->watch_pids); |
107 | ||
108 | if (m->epoll_fd >= 0) | |
109 | close_nointr(m->epoll_fd); | |
acbb0225 LP |
110 | if (m->signal_watch.fd >= 0) |
111 | close_nointr(m->signal_watch.fd); | |
60918275 LP |
112 | |
113 | free(m); | |
114 | } | |
115 | ||
f50e0a01 LP |
116 | int manager_coldplug(Manager *m) { |
117 | int r; | |
118 | UnitType c; | |
119 | Iterator i; | |
120 | Unit *u; | |
121 | char *k; | |
122 | ||
123 | assert(m); | |
124 | ||
125 | /* First, let's ask every type to load all units from | |
126 | * disk/kernel that it might know */ | |
127 | for (c = 0; c < _UNIT_TYPE_MAX; c++) | |
128 | if (unit_vtable[c]->enumerate) | |
129 | if ((r = unit_vtable[c]->enumerate(m)) < 0) | |
130 | return r; | |
131 | ||
132 | manager_dispatch_load_queue(m); | |
133 | ||
134 | /* Then, let's set up their initial state. */ | |
135 | HASHMAP_FOREACH_KEY(u, k, m->units, i) { | |
136 | ||
137 | /* ignore aliases */ | |
138 | if (unit_id(u) != k) | |
139 | continue; | |
140 | ||
141 | if (UNIT_VTABLE(u)->coldplug) | |
142 | if ((r = UNIT_VTABLE(u)->coldplug(u)) < 0) | |
143 | return r; | |
144 | } | |
145 | ||
146 | return 0; | |
147 | } | |
148 | ||
302d0040 LP |
149 | static void transaction_delete_job(Manager *m, Job *j) { |
150 | assert(m); | |
151 | assert(j); | |
152 | ||
1ffba6fe LP |
153 | /* Deletes one job from the transaction */ |
154 | ||
302d0040 LP |
155 | manager_transaction_unlink_job(m, j); |
156 | ||
ac1135be | 157 | if (!j->installed) |
302d0040 LP |
158 | job_free(j); |
159 | } | |
160 | ||
87f0e418 | 161 | static void transaction_delete_unit(Manager *m, Unit *u) { |
1ffba6fe LP |
162 | Job *j; |
163 | ||
87f0e418 | 164 | /* Deletes all jobs associated with a certain unit from the |
1ffba6fe LP |
165 | * transaction */ |
166 | ||
87f0e418 | 167 | while ((j = hashmap_get(m->transaction_jobs, u))) |
1ffba6fe LP |
168 | transaction_delete_job(m, j); |
169 | } | |
170 | ||
f04fa1d5 LP |
171 | static void transaction_clean_dependencies(Manager *m) { |
172 | Iterator i; | |
173 | Job *j; | |
174 | ||
175 | assert(m); | |
176 | ||
177 | /* Drops all dependencies of all installed jobs */ | |
178 | ||
179 | HASHMAP_FOREACH(j, m->jobs, i) { | |
180 | while (j->subject_list) | |
181 | job_dependency_free(j->subject_list); | |
182 | while (j->object_list) | |
183 | job_dependency_free(j->object_list); | |
184 | } | |
185 | ||
186 | assert(!m->transaction_anchor); | |
187 | } | |
188 | ||
11dd41ce LP |
189 | static void transaction_abort(Manager *m) { |
190 | Job *j; | |
191 | ||
192 | assert(m); | |
11dd41ce | 193 | |
e5b5ae50 | 194 | while ((j = hashmap_first(m->transaction_jobs))) |
ac1135be | 195 | if (j->installed) |
302d0040 | 196 | transaction_delete_job(m, j); |
e5b5ae50 LP |
197 | else |
198 | job_free(j); | |
199 | ||
200 | assert(hashmap_isempty(m->transaction_jobs)); | |
f04fa1d5 LP |
201 | |
202 | transaction_clean_dependencies(m); | |
e5b5ae50 LP |
203 | } |
204 | ||
205 | static void transaction_find_jobs_that_matter_to_anchor(Manager *m, Job *j, unsigned generation) { | |
206 | JobDependency *l; | |
207 | ||
208 | assert(m); | |
209 | ||
87f0e418 | 210 | /* A recursive sweep through the graph that marks all units |
1ffba6fe LP |
211 | * that matter to the anchor job, i.e. are directly or |
212 | * indirectly a dependency of the anchor job via paths that | |
213 | * are fully marked as mattering. */ | |
214 | ||
44d8db9e LP |
215 | if (j) |
216 | l = j->subject_list; | |
217 | else | |
218 | l = m->transaction_anchor; | |
219 | ||
220 | LIST_FOREACH(subject, l, l) { | |
e5b5ae50 LP |
221 | |
222 | /* This link does not matter */ | |
223 | if (!l->matters) | |
224 | continue; | |
225 | ||
87f0e418 | 226 | /* This unit has already been marked */ |
e5b5ae50 LP |
227 | if (l->object->generation == generation) |
228 | continue; | |
229 | ||
230 | l->object->matters_to_anchor = true; | |
231 | l->object->generation = generation; | |
232 | ||
233 | transaction_find_jobs_that_matter_to_anchor(m, l->object, generation); | |
234 | } | |
235 | } | |
236 | ||
7fad411c | 237 | static void transaction_merge_and_delete_job(Manager *m, Job *j, Job *other, JobType t) { |
e5b5ae50 LP |
238 | JobDependency *l, *last; |
239 | ||
240 | assert(j); | |
241 | assert(other); | |
87f0e418 | 242 | assert(j->unit == other->unit); |
ac1135be | 243 | assert(!j->installed); |
e5b5ae50 | 244 | |
1ffba6fe LP |
245 | /* Merges 'other' into 'j' and then deletes j. */ |
246 | ||
e5b5ae50 LP |
247 | j->type = t; |
248 | j->state = JOB_WAITING; | |
5cb5a6ff | 249 | j->forced = j->forced || other->forced; |
e5b5ae50 LP |
250 | |
251 | j->matters_to_anchor = j->matters_to_anchor || other->matters_to_anchor; | |
252 | ||
253 | /* Patch us in as new owner of the JobDependency objects */ | |
254 | last = NULL; | |
44d8db9e | 255 | LIST_FOREACH(subject, l, other->subject_list) { |
e5b5ae50 LP |
256 | assert(l->subject == other); |
257 | l->subject = j; | |
258 | last = l; | |
259 | } | |
260 | ||
261 | /* Merge both lists */ | |
262 | if (last) { | |
263 | last->subject_next = j->subject_list; | |
264 | if (j->subject_list) | |
265 | j->subject_list->subject_prev = last; | |
266 | j->subject_list = other->subject_list; | |
267 | } | |
268 | ||
269 | /* Patch us in as new owner of the JobDependency objects */ | |
270 | last = NULL; | |
44d8db9e | 271 | LIST_FOREACH(object, l, other->object_list) { |
e5b5ae50 LP |
272 | assert(l->object == other); |
273 | l->object = j; | |
274 | last = l; | |
275 | } | |
276 | ||
277 | /* Merge both lists */ | |
278 | if (last) { | |
279 | last->object_next = j->object_list; | |
280 | if (j->object_list) | |
281 | j->object_list->object_prev = last; | |
282 | j->object_list = other->object_list; | |
283 | } | |
284 | ||
e5b5ae50 LP |
285 | /* Kill the other job */ |
286 | other->subject_list = NULL; | |
287 | other->object_list = NULL; | |
302d0040 | 288 | transaction_delete_job(m, other); |
e5b5ae50 LP |
289 | } |
290 | ||
5cb5a6ff | 291 | static int delete_one_unmergeable_job(Manager *m, Job *j) { |
1ffba6fe LP |
292 | Job *k; |
293 | ||
294 | assert(j); | |
295 | ||
296 | /* Tries to delete one item in the linked list | |
297 | * j->transaction_next->transaction_next->... that conflicts | |
298 | * whith another one, in an attempt to make an inconsistent | |
299 | * transaction work. */ | |
300 | ||
301 | /* We rely here on the fact that if a merged with b does not | |
302 | * merge with c, either a or b merge with c neither */ | |
034c6ed7 LP |
303 | LIST_FOREACH(transaction, j, j) |
304 | LIST_FOREACH(transaction, k, j->transaction_next) { | |
1ffba6fe LP |
305 | Job *d; |
306 | ||
307 | /* Is this one mergeable? Then skip it */ | |
5cb5a6ff | 308 | if (job_type_is_mergeable(j->type, k->type)) |
1ffba6fe LP |
309 | continue; |
310 | ||
311 | /* Ok, we found two that conflict, let's see if we can | |
312 | * drop one of them */ | |
313 | if (!j->matters_to_anchor) | |
314 | d = j; | |
315 | else if (!k->matters_to_anchor) | |
316 | d = k; | |
317 | else | |
318 | return -ENOEXEC; | |
319 | ||
320 | /* Ok, we can drop one, so let's do so. */ | |
87f0e418 | 321 | log_debug("Try to fix job merging by deleting job %s/%s", unit_id(d->unit), job_type_to_string(d->type)); |
1ffba6fe LP |
322 | transaction_delete_job(m, d); |
323 | return 0; | |
324 | } | |
325 | ||
326 | return -EINVAL; | |
327 | } | |
328 | ||
e5b5ae50 | 329 | static int transaction_merge_jobs(Manager *m) { |
11dd41ce | 330 | Job *j; |
034c6ed7 | 331 | Iterator i; |
e5b5ae50 LP |
332 | int r; |
333 | ||
334 | assert(m); | |
335 | ||
1ffba6fe LP |
336 | /* First step, check whether any of the jobs for one specific |
337 | * task conflict. If so, try to drop one of them. */ | |
034c6ed7 | 338 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
1ffba6fe LP |
339 | JobType t; |
340 | Job *k; | |
341 | ||
342 | t = j->type; | |
034c6ed7 | 343 | LIST_FOREACH(transaction, k, j->transaction_next) { |
1ffba6fe LP |
344 | if ((r = job_type_merge(&t, k->type)) >= 0) |
345 | continue; | |
346 | ||
347 | /* OK, we could not merge all jobs for this | |
348 | * action. Let's see if we can get rid of one | |
349 | * of them */ | |
350 | ||
5cb5a6ff | 351 | if ((r = delete_one_unmergeable_job(m, j)) >= 0) |
1ffba6fe LP |
352 | /* Ok, we managed to drop one, now |
353 | * let's ask our callers to call us | |
354 | * again after garbage collecting */ | |
355 | return -EAGAIN; | |
356 | ||
357 | /* We couldn't merge anything. Failure */ | |
358 | return r; | |
359 | } | |
360 | } | |
361 | ||
362 | /* Second step, merge the jobs. */ | |
034c6ed7 | 363 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e5b5ae50 LP |
364 | JobType t = j->type; |
365 | Job *k; | |
366 | ||
e094e853 | 367 | /* Merge all transactions */ |
034c6ed7 | 368 | LIST_FOREACH(transaction, k, j->transaction_next) |
1ffba6fe | 369 | assert_se(job_type_merge(&t, k->type) == 0); |
e5b5ae50 | 370 | |
5cb5a6ff | 371 | /* If an active job is mergeable, merge it too */ |
87f0e418 LP |
372 | if (j->unit->meta.job) |
373 | job_type_merge(&t, j->unit->meta.job->type); /* Might fail. Which is OK */ | |
e094e853 | 374 | |
e5b5ae50 | 375 | while ((k = j->transaction_next)) { |
ac1135be | 376 | if (j->installed) { |
7fad411c | 377 | transaction_merge_and_delete_job(m, k, j, t); |
e5b5ae50 LP |
378 | j = k; |
379 | } else | |
7fad411c | 380 | transaction_merge_and_delete_job(m, j, k, t); |
e5b5ae50 LP |
381 | } |
382 | ||
383 | assert(!j->transaction_next); | |
384 | assert(!j->transaction_prev); | |
385 | } | |
386 | ||
7fad411c | 387 | return 0; |
e5b5ae50 LP |
388 | } |
389 | ||
87f0e418 LP |
390 | static bool unit_matters_to_anchor(Unit *u, Job *j) { |
391 | assert(u); | |
1ffba6fe LP |
392 | assert(!j->transaction_prev); |
393 | ||
87f0e418 | 394 | /* Checks whether at least one of the jobs for this unit |
1ffba6fe LP |
395 | * matters to the anchor. */ |
396 | ||
034c6ed7 | 397 | LIST_FOREACH(transaction, j, j) |
1ffba6fe LP |
398 | if (j->matters_to_anchor) |
399 | return true; | |
400 | ||
401 | return false; | |
402 | } | |
403 | ||
e5b5ae50 | 404 | static int transaction_verify_order_one(Manager *m, Job *j, Job *from, unsigned generation) { |
034c6ed7 | 405 | Iterator i; |
87f0e418 | 406 | Unit *u; |
11dd41ce | 407 | int r; |
e5b5ae50 LP |
408 | |
409 | assert(m); | |
410 | assert(j); | |
1ffba6fe LP |
411 | assert(!j->transaction_prev); |
412 | ||
413 | /* Does a recursive sweep through the ordering graph, looking | |
414 | * for a cycle. If we find cycle we try to break it. */ | |
e5b5ae50 | 415 | |
7fad411c | 416 | /* Did we find a cycle? */ |
e5b5ae50 LP |
417 | if (j->marker && j->generation == generation) { |
418 | Job *k; | |
419 | ||
420 | /* So, we already have been here. We have a | |
1ffba6fe LP |
421 | * cycle. Let's try to break it. We go backwards in |
422 | * our path and try to find a suitable job to | |
423 | * remove. We use the marker to find our way back, | |
424 | * since smart how we are we stored our way back in | |
425 | * there. */ | |
e5b5ae50 | 426 | |
9f04bd52 LP |
427 | log_debug("Found cycle on %s/%s", unit_id(j->unit), job_type_to_string(j->type)); |
428 | ||
e5b5ae50 | 429 | for (k = from; k; k = (k->generation == generation ? k->marker : NULL)) { |
1ffba6fe | 430 | |
9f04bd52 LP |
431 | log_debug("Walked on cycle path to %s/%s", unit_id(j->unit), job_type_to_string(j->type)); |
432 | ||
ac1135be | 433 | if (!k->installed && |
87f0e418 | 434 | !unit_matters_to_anchor(k->unit, k)) { |
1ffba6fe LP |
435 | /* Ok, we can drop this one, so let's |
436 | * do so. */ | |
87f0e418 LP |
437 | log_debug("Breaking order cycle by deleting job %s/%s", unit_id(k->unit), job_type_to_string(k->type)); |
438 | transaction_delete_unit(m, k->unit); | |
e5b5ae50 LP |
439 | return -EAGAIN; |
440 | } | |
441 | ||
442 | /* Check if this in fact was the beginning of | |
7fad411c | 443 | * the cycle */ |
e5b5ae50 LP |
444 | if (k == j) |
445 | break; | |
446 | } | |
447 | ||
9f04bd52 LP |
448 | log_debug("Unable to break cycle"); |
449 | ||
1ffba6fe | 450 | return -ENOEXEC; |
e5b5ae50 LP |
451 | } |
452 | ||
1ffba6fe LP |
453 | /* Make the marker point to where we come from, so that we can |
454 | * find our way backwards if we want to break a cycle */ | |
e5b5ae50 LP |
455 | j->marker = from; |
456 | j->generation = generation; | |
457 | ||
1ffba6fe | 458 | /* We assume that the the dependencies are bidirectional, and |
87f0e418 LP |
459 | * hence can ignore UNIT_AFTER */ |
460 | SET_FOREACH(u, j->unit->meta.dependencies[UNIT_BEFORE], i) { | |
e5b5ae50 LP |
461 | Job *o; |
462 | ||
87f0e418 LP |
463 | /* Is there a job for this unit? */ |
464 | if (!(o = hashmap_get(m->transaction_jobs, u))) | |
1ffba6fe LP |
465 | |
466 | /* Ok, there is no job for this in the | |
467 | * transaction, but maybe there is already one | |
468 | * running? */ | |
87f0e418 | 469 | if (!(o = u->meta.job)) |
e5b5ae50 LP |
470 | continue; |
471 | ||
472 | if ((r = transaction_verify_order_one(m, o, j, generation)) < 0) | |
473 | return r; | |
474 | } | |
475 | ||
9f04bd52 LP |
476 | /* Ok, let's backtrack, and remember that this entry is not on |
477 | * our path anymore. */ | |
478 | j->marker = NULL; | |
479 | ||
e5b5ae50 LP |
480 | return 0; |
481 | } | |
482 | ||
483 | static int transaction_verify_order(Manager *m, unsigned *generation) { | |
1ffba6fe LP |
484 | Job *j; |
485 | int r; | |
034c6ed7 | 486 | Iterator i; |
1ffba6fe | 487 | |
e5b5ae50 LP |
488 | assert(m); |
489 | assert(generation); | |
490 | ||
1ffba6fe LP |
491 | /* Check if the ordering graph is cyclic. If it is, try to fix |
492 | * that up by dropping one of the jobs. */ | |
e5b5ae50 | 493 | |
034c6ed7 | 494 | HASHMAP_FOREACH(j, m->transaction_jobs, i) |
1ffba6fe LP |
495 | if ((r = transaction_verify_order_one(m, j, NULL, (*generation)++)) < 0) |
496 | return r; | |
e5b5ae50 LP |
497 | |
498 | return 0; | |
499 | } | |
500 | ||
501 | static void transaction_collect_garbage(Manager *m) { | |
502 | bool again; | |
503 | ||
504 | assert(m); | |
505 | ||
1ffba6fe LP |
506 | /* Drop jobs that are not required by any other job */ |
507 | ||
e5b5ae50 | 508 | do { |
034c6ed7 | 509 | Iterator i; |
e5b5ae50 LP |
510 | Job *j; |
511 | ||
512 | again = false; | |
513 | ||
034c6ed7 | 514 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e5b5ae50 LP |
515 | if (j->object_list) |
516 | continue; | |
517 | ||
87f0e418 | 518 | log_debug("Garbage collecting job %s/%s", unit_id(j->unit), job_type_to_string(j->type)); |
302d0040 | 519 | transaction_delete_job(m, j); |
e5b5ae50 LP |
520 | again = true; |
521 | break; | |
522 | } | |
523 | ||
524 | } while (again); | |
525 | } | |
526 | ||
527 | static int transaction_is_destructive(Manager *m, JobMode mode) { | |
034c6ed7 | 528 | Iterator i; |
e5b5ae50 | 529 | Job *j; |
11dd41ce LP |
530 | |
531 | assert(m); | |
11dd41ce | 532 | |
e5b5ae50 LP |
533 | /* Checks whether applying this transaction means that |
534 | * existing jobs would be replaced */ | |
11dd41ce | 535 | |
034c6ed7 | 536 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e094e853 LP |
537 | |
538 | /* Assume merged */ | |
539 | assert(!j->transaction_prev); | |
540 | assert(!j->transaction_next); | |
541 | ||
87f0e418 LP |
542 | if (j->unit->meta.job && |
543 | j->unit->meta.job != j && | |
544 | !job_type_is_superset(j->type, j->unit->meta.job->type)) | |
e5b5ae50 | 545 | return -EEXIST; |
e094e853 | 546 | } |
11dd41ce | 547 | |
e5b5ae50 LP |
548 | return 0; |
549 | } | |
550 | ||
e094e853 LP |
551 | static void transaction_minimize_impact(Manager *m) { |
552 | bool again; | |
553 | assert(m); | |
554 | ||
555 | /* Drops all unnecessary jobs that reverse already active jobs | |
556 | * or that stop a running service. */ | |
557 | ||
558 | do { | |
559 | Job *j; | |
034c6ed7 | 560 | Iterator i; |
e094e853 LP |
561 | |
562 | again = false; | |
563 | ||
034c6ed7 LP |
564 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
565 | LIST_FOREACH(transaction, j, j) { | |
e094e853 LP |
566 | |
567 | /* If it matters, we shouldn't drop it */ | |
568 | if (j->matters_to_anchor) | |
569 | continue; | |
570 | ||
571 | /* Would this stop a running service? | |
572 | * Would this change an existing job? | |
573 | * If so, let's drop this entry */ | |
87f0e418 LP |
574 | if ((j->type != JOB_STOP || UNIT_IS_INACTIVE_OR_DEACTIVATING(unit_active_state(j->unit))) && |
575 | (!j->unit->meta.job || job_type_is_conflicting(j->type, j->unit->meta.job->state))) | |
e094e853 LP |
576 | continue; |
577 | ||
578 | /* Ok, let's get rid of this */ | |
87f0e418 | 579 | log_debug("Deleting %s/%s to minimize impact", unit_id(j->unit), job_type_to_string(j->type)); |
e094e853 LP |
580 | transaction_delete_job(m, j); |
581 | again = true; | |
582 | break; | |
583 | } | |
584 | ||
585 | if (again) | |
586 | break; | |
587 | } | |
588 | ||
589 | } while (again); | |
590 | } | |
591 | ||
e5b5ae50 | 592 | static int transaction_apply(Manager *m, JobMode mode) { |
034c6ed7 | 593 | Iterator i; |
e5b5ae50 LP |
594 | Job *j; |
595 | int r; | |
596 | ||
1ffba6fe LP |
597 | /* Moves the transaction jobs to the set of active jobs */ |
598 | ||
034c6ed7 | 599 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
e094e853 LP |
600 | /* Assume merged */ |
601 | assert(!j->transaction_prev); | |
602 | assert(!j->transaction_next); | |
603 | ||
ac1135be | 604 | if (j->installed) |
e5b5ae50 LP |
605 | continue; |
606 | ||
607 | if ((r = hashmap_put(m->jobs, UINT32_TO_PTR(j->id), j)) < 0) | |
11dd41ce LP |
608 | goto rollback; |
609 | } | |
610 | ||
e5b5ae50 | 611 | while ((j = hashmap_steal_first(m->transaction_jobs))) { |
ac1135be | 612 | if (j->installed) |
e5b5ae50 LP |
613 | continue; |
614 | ||
87f0e418 LP |
615 | if (j->unit->meta.job) |
616 | job_free(j->unit->meta.job); | |
11dd41ce | 617 | |
87f0e418 | 618 | j->unit->meta.job = j; |
ac1135be | 619 | j->installed = true; |
11dd41ce | 620 | |
e5b5ae50 LP |
621 | /* We're fully installed. Now let's free data we don't |
622 | * need anymore. */ | |
623 | ||
624 | assert(!j->transaction_next); | |
625 | assert(!j->transaction_prev); | |
626 | ||
acbb0225 | 627 | job_schedule_run(j); |
01184e04 LP |
628 | } |
629 | ||
630 | /* As last step, kill all remaining job dependencies. */ | |
f04fa1d5 | 631 | transaction_clean_dependencies(m); |
1ffba6fe | 632 | |
11dd41ce LP |
633 | return 0; |
634 | ||
635 | rollback: | |
636 | ||
034c6ed7 | 637 | HASHMAP_FOREACH(j, m->transaction_jobs, i) { |
ac1135be | 638 | if (j->installed) |
e5b5ae50 LP |
639 | continue; |
640 | ||
641 | hashmap_remove(m->jobs, UINT32_TO_PTR(j->id)); | |
642 | } | |
643 | ||
644 | return r; | |
645 | } | |
646 | ||
e5b5ae50 LP |
647 | static int transaction_activate(Manager *m, JobMode mode) { |
648 | int r; | |
649 | unsigned generation = 1; | |
650 | ||
651 | assert(m); | |
652 | ||
653 | /* This applies the changes recorded in transaction_jobs to | |
654 | * the actual list of jobs, if possible. */ | |
655 | ||
656 | /* First step: figure out which jobs matter */ | |
657 | transaction_find_jobs_that_matter_to_anchor(m, NULL, generation++); | |
658 | ||
e094e853 LP |
659 | /* Second step: Try not to stop any running services if |
660 | * we don't have to. Don't try to reverse running | |
661 | * jobs if we don't have to. */ | |
662 | transaction_minimize_impact(m); | |
663 | ||
1ffba6fe | 664 | for (;;) { |
e094e853 | 665 | /* Third step: Let's remove unneeded jobs that might |
1ffba6fe LP |
666 | * be lurking. */ |
667 | transaction_collect_garbage(m); | |
e5b5ae50 | 668 | |
e094e853 | 669 | /* Fourth step: verify order makes sense and correct |
1ffba6fe LP |
670 | * cycles if necessary and possible */ |
671 | if ((r = transaction_verify_order(m, &generation)) >= 0) | |
672 | break; | |
e5b5ae50 | 673 | |
9f04bd52 LP |
674 | if (r != -EAGAIN) { |
675 | log_debug("Requested transaction contains an unfixable cyclic ordering dependency: %s", strerror(-r)); | |
1ffba6fe | 676 | goto rollback; |
9f04bd52 | 677 | } |
e5b5ae50 | 678 | |
1ffba6fe LP |
679 | /* Let's see if the resulting transaction ordering |
680 | * graph is still cyclic... */ | |
681 | } | |
682 | ||
683 | for (;;) { | |
5cb5a6ff | 684 | /* Fifth step: let's drop unmergeable entries if |
1ffba6fe LP |
685 | * necessary and possible, merge entries we can |
686 | * merge */ | |
687 | if ((r = transaction_merge_jobs(m)) >= 0) | |
688 | break; | |
689 | ||
9f04bd52 LP |
690 | if (r != -EAGAIN) { |
691 | log_debug("Requested transaction contains unmergable jobs: %s", strerror(-r)); | |
1ffba6fe | 692 | goto rollback; |
9f04bd52 | 693 | } |
1ffba6fe | 694 | |
e094e853 | 695 | /* Sixth step: an entry got dropped, let's garbage |
1ffba6fe LP |
696 | * collect its dependencies. */ |
697 | transaction_collect_garbage(m); | |
698 | ||
699 | /* Let's see if the resulting transaction still has | |
5cb5a6ff | 700 | * unmergeable entries ... */ |
1ffba6fe LP |
701 | } |
702 | ||
e094e853 | 703 | /* Seventh step: check whether we can actually apply this */ |
e5b5ae50 | 704 | if (mode == JOB_FAIL) |
9f04bd52 LP |
705 | if ((r = transaction_is_destructive(m, mode)) < 0) { |
706 | log_debug("Requested transaction contradicts existing jobs: %s", strerror(-r)); | |
e5b5ae50 | 707 | goto rollback; |
9f04bd52 | 708 | } |
e5b5ae50 | 709 | |
e094e853 | 710 | /* Eights step: apply changes */ |
9f04bd52 LP |
711 | if ((r = transaction_apply(m, mode)) < 0) { |
712 | log_debug("Failed to apply transaction: %s", strerror(-r)); | |
e5b5ae50 | 713 | goto rollback; |
9f04bd52 | 714 | } |
e5b5ae50 LP |
715 | |
716 | assert(hashmap_isempty(m->transaction_jobs)); | |
717 | assert(!m->transaction_anchor); | |
718 | ||
719 | return 0; | |
11dd41ce | 720 | |
e5b5ae50 | 721 | rollback: |
11dd41ce LP |
722 | transaction_abort(m); |
723 | return r; | |
724 | } | |
725 | ||
87f0e418 | 726 | static Job* transaction_add_one_job(Manager *m, JobType type, Unit *unit, bool force, bool *is_new) { |
e5b5ae50 | 727 | Job *j, *f; |
60918275 LP |
728 | int r; |
729 | ||
730 | assert(m); | |
87f0e418 | 731 | assert(unit); |
60918275 | 732 | |
e5b5ae50 LP |
733 | /* Looks for an axisting prospective job and returns that. If |
734 | * it doesn't exist it is created and added to the prospective | |
735 | * jobs list. */ | |
60918275 | 736 | |
87f0e418 | 737 | f = hashmap_get(m->transaction_jobs, unit); |
60918275 | 738 | |
034c6ed7 | 739 | LIST_FOREACH(transaction, j, f) { |
87f0e418 | 740 | assert(j->unit == unit); |
60918275 | 741 | |
e5b5ae50 LP |
742 | if (j->type == type) { |
743 | if (is_new) | |
744 | *is_new = false; | |
745 | return j; | |
746 | } | |
747 | } | |
60918275 | 748 | |
87f0e418 LP |
749 | if (unit->meta.job && unit->meta.job->type == type) |
750 | j = unit->meta.job; | |
751 | else if (!(j = job_new(m, type, unit))) | |
e5b5ae50 | 752 | return NULL; |
60918275 | 753 | |
e5b5ae50 LP |
754 | j->generation = 0; |
755 | j->marker = NULL; | |
756 | j->matters_to_anchor = false; | |
5cb5a6ff | 757 | j->forced = force; |
60918275 | 758 | |
034c6ed7 LP |
759 | LIST_PREPEND(Job, transaction, f, j); |
760 | ||
87f0e418 | 761 | if ((r = hashmap_replace(m->transaction_jobs, unit, f)) < 0) { |
034c6ed7 LP |
762 | job_free(j); |
763 | return NULL; | |
764 | } | |
765 | ||
e5b5ae50 LP |
766 | if (is_new) |
767 | *is_new = true; | |
60918275 | 768 | |
e5b5ae50 LP |
769 | return j; |
770 | } | |
11dd41ce | 771 | |
302d0040 | 772 | void manager_transaction_unlink_job(Manager *m, Job *j) { |
e5b5ae50 LP |
773 | assert(m); |
774 | assert(j); | |
11dd41ce | 775 | |
e5b5ae50 LP |
776 | if (j->transaction_prev) |
777 | j->transaction_prev->transaction_next = j->transaction_next; | |
778 | else if (j->transaction_next) | |
87f0e418 | 779 | hashmap_replace(m->transaction_jobs, j->unit, j->transaction_next); |
e5b5ae50 | 780 | else |
87f0e418 | 781 | hashmap_remove_value(m->transaction_jobs, j->unit, j); |
e5b5ae50 LP |
782 | |
783 | if (j->transaction_next) | |
784 | j->transaction_next->transaction_prev = j->transaction_prev; | |
785 | ||
786 | j->transaction_prev = j->transaction_next = NULL; | |
787 | ||
788 | while (j->subject_list) | |
789 | job_dependency_free(j->subject_list); | |
1e198baf LP |
790 | |
791 | while (j->object_list) { | |
792 | Job *other = j->object_list->matters ? j->object_list->subject : NULL; | |
793 | ||
e5b5ae50 | 794 | job_dependency_free(j->object_list); |
1e198baf LP |
795 | |
796 | if (other) { | |
5cb5a6ff | 797 | log_debug("Deleting job %s/%s as dependency of job %s/%s", |
87f0e418 LP |
798 | unit_id(other->unit), job_type_to_string(other->type), |
799 | unit_id(j->unit), job_type_to_string(j->type)); | |
302d0040 | 800 | transaction_delete_job(m, other); |
1e198baf LP |
801 | } |
802 | } | |
e5b5ae50 LP |
803 | } |
804 | ||
87f0e418 | 805 | static int transaction_add_job_and_dependencies(Manager *m, JobType type, Unit *unit, Job *by, bool matters, bool force, Job **_ret) { |
e5b5ae50 | 806 | Job *ret; |
034c6ed7 | 807 | Iterator i; |
87f0e418 | 808 | Unit *dep; |
e5b5ae50 LP |
809 | int r; |
810 | bool is_new; | |
811 | ||
812 | assert(m); | |
813 | assert(type < _JOB_TYPE_MAX); | |
87f0e418 | 814 | assert(unit); |
e5b5ae50 | 815 | |
87f0e418 | 816 | if (unit->meta.load_state != UNIT_LOADED) |
21b293e8 LP |
817 | return -EINVAL; |
818 | ||
87f0e418 | 819 | if (!unit_job_is_applicable(unit, type)) |
cd2dbd7d LP |
820 | return -EBADR; |
821 | ||
e5b5ae50 | 822 | /* First add the job. */ |
87f0e418 | 823 | if (!(ret = transaction_add_one_job(m, type, unit, force, &is_new))) |
e5b5ae50 LP |
824 | return -ENOMEM; |
825 | ||
826 | /* Then, add a link to the job. */ | |
827 | if (!job_dependency_new(by, ret, matters)) | |
828 | return -ENOMEM; | |
829 | ||
830 | if (is_new) { | |
831 | /* Finally, recursively add in all dependencies. */ | |
832 | if (type == JOB_START || type == JOB_RELOAD_OR_START) { | |
87f0e418 | 833 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRES], i) |
542563ba | 834 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, true, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 | 835 | goto fail; |
87f0e418 | 836 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_SOFT_REQUIRES], i) |
542563ba | 837 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, !force, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 | 838 | goto fail; |
87f0e418 | 839 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_WANTS], i) |
542563ba | 840 | if ((r = transaction_add_job_and_dependencies(m, JOB_START, dep, ret, false, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 | 841 | goto fail; |
87f0e418 | 842 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUISITE], i) |
542563ba | 843 | if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, true, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 | 844 | goto fail; |
87f0e418 | 845 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_SOFT_REQUISITE], i) |
542563ba | 846 | if ((r = transaction_add_job_and_dependencies(m, JOB_VERIFY_ACTIVE, dep, ret, !force, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 | 847 | goto fail; |
87f0e418 | 848 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_CONFLICTS], i) |
542563ba | 849 | if ((r = transaction_add_job_and_dependencies(m, JOB_STOP, dep, ret, true, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 LP |
850 | goto fail; |
851 | ||
852 | } else if (type == JOB_STOP || type == JOB_RESTART || type == JOB_TRY_RESTART) { | |
853 | ||
87f0e418 | 854 | SET_FOREACH(dep, ret->unit->meta.dependencies[UNIT_REQUIRED_BY], i) |
542563ba | 855 | if ((r = transaction_add_job_and_dependencies(m, type, dep, ret, true, force, NULL)) < 0 && r != -EBADR) |
e5b5ae50 LP |
856 | goto fail; |
857 | } | |
858 | ||
859 | /* JOB_VERIFY_STARTED, JOB_RELOAD require no dependency handling */ | |
860 | } | |
60918275 LP |
861 | |
862 | return 0; | |
863 | ||
864 | fail: | |
e5b5ae50 LP |
865 | return r; |
866 | } | |
867 | ||
87f0e418 | 868 | int manager_add_job(Manager *m, JobType type, Unit *unit, JobMode mode, bool force, Job **_ret) { |
e5b5ae50 LP |
869 | int r; |
870 | Job *ret; | |
871 | ||
872 | assert(m); | |
873 | assert(type < _JOB_TYPE_MAX); | |
87f0e418 | 874 | assert(unit); |
e5b5ae50 | 875 | assert(mode < _JOB_MODE_MAX); |
60918275 | 876 | |
9f04bd52 LP |
877 | log_debug("Trying to enqueue job %s/%s", unit_id(unit), job_type_to_string(type)); |
878 | ||
87f0e418 | 879 | if ((r = transaction_add_job_and_dependencies(m, type, unit, NULL, true, force, &ret))) { |
11dd41ce | 880 | transaction_abort(m); |
e5b5ae50 LP |
881 | return r; |
882 | } | |
11dd41ce | 883 | |
e5b5ae50 LP |
884 | if ((r = transaction_activate(m, mode)) < 0) |
885 | return r; | |
886 | ||
f50e0a01 LP |
887 | log_debug("Enqueued job %s/%s", unit_id(unit), job_type_to_string(type)); |
888 | ||
e5b5ae50 LP |
889 | if (_ret) |
890 | *_ret = ret; | |
60918275 | 891 | |
e5b5ae50 LP |
892 | return 0; |
893 | } | |
60918275 LP |
894 | |
895 | Job *manager_get_job(Manager *m, uint32_t id) { | |
896 | assert(m); | |
897 | ||
898 | return hashmap_get(m->jobs, UINT32_TO_PTR(id)); | |
899 | } | |
900 | ||
87f0e418 | 901 | Unit *manager_get_unit(Manager *m, const char *name) { |
60918275 LP |
902 | assert(m); |
903 | assert(name); | |
904 | ||
87f0e418 | 905 | return hashmap_get(m->units, name); |
60918275 LP |
906 | } |
907 | ||
f50e0a01 | 908 | void manager_dispatch_load_queue(Manager *m) { |
60918275 LP |
909 | Meta *meta; |
910 | ||
911 | assert(m); | |
912 | ||
223dabab LP |
913 | /* Make sure we are not run recursively */ |
914 | if (m->dispatching_load_queue) | |
034c6ed7 | 915 | return; |
223dabab LP |
916 | |
917 | m->dispatching_load_queue = true; | |
918 | ||
87f0e418 | 919 | /* Dispatches the load queue. Takes a unit from the queue and |
60918275 LP |
920 | * tries to load its data until the queue is empty */ |
921 | ||
922 | while ((meta = m->load_queue)) { | |
034c6ed7 LP |
923 | assert(meta->in_load_queue); |
924 | ||
87f0e418 | 925 | unit_load(UNIT(meta)); |
60918275 LP |
926 | } |
927 | ||
223dabab | 928 | m->dispatching_load_queue = false; |
60918275 LP |
929 | } |
930 | ||
0301abf4 | 931 | int manager_load_unit(Manager *m, const char *path, Unit **_ret) { |
87f0e418 | 932 | Unit *ret; |
60918275 | 933 | int r; |
0301abf4 | 934 | const char *name; |
60918275 LP |
935 | |
936 | assert(m); | |
0301abf4 | 937 | assert(path); |
60918275 | 938 | assert(_ret); |
60918275 | 939 | |
223dabab | 940 | /* This will load the service information files, but not actually |
0301abf4 LP |
941 | * start any services or anything. */ |
942 | ||
943 | name = file_name_from_path(path); | |
60918275 | 944 | |
87f0e418 | 945 | if ((ret = manager_get_unit(m, name))) { |
034c6ed7 LP |
946 | *_ret = ret; |
947 | return 0; | |
948 | } | |
60918275 | 949 | |
87f0e418 | 950 | if (!(ret = unit_new(m))) |
60918275 LP |
951 | return -ENOMEM; |
952 | ||
0301abf4 LP |
953 | if (is_path(path)) { |
954 | if (!(ret->meta.load_path = strdup(path))) { | |
955 | unit_free(ret); | |
956 | return -ENOMEM; | |
957 | } | |
958 | } | |
959 | ||
87f0e418 LP |
960 | if ((r = unit_add_name(ret, name)) < 0) { |
961 | unit_free(ret); | |
1ffba6fe | 962 | return r; |
60918275 LP |
963 | } |
964 | ||
87f0e418 | 965 | unit_add_to_load_queue(ret); |
f50e0a01 | 966 | manager_dispatch_load_queue(m); |
60918275 | 967 | |
60918275 LP |
968 | *_ret = ret; |
969 | return 0; | |
970 | } | |
a66d02c3 | 971 | |
cea8e32e | 972 | void manager_dump_jobs(Manager *s, FILE *f, const char *prefix) { |
034c6ed7 | 973 | Iterator i; |
a66d02c3 LP |
974 | Job *j; |
975 | ||
976 | assert(s); | |
977 | assert(f); | |
978 | ||
034c6ed7 | 979 | HASHMAP_FOREACH(j, s->jobs, i) |
cea8e32e | 980 | job_dump(j, f, prefix); |
a66d02c3 LP |
981 | } |
982 | ||
87f0e418 | 983 | void manager_dump_units(Manager *s, FILE *f, const char *prefix) { |
034c6ed7 | 984 | Iterator i; |
87f0e418 | 985 | Unit *u; |
11dd41ce | 986 | const char *t; |
a66d02c3 LP |
987 | |
988 | assert(s); | |
989 | assert(f); | |
990 | ||
87f0e418 LP |
991 | HASHMAP_FOREACH_KEY(u, t, s->units, i) |
992 | if (unit_id(u) == t) | |
993 | unit_dump(u, f, prefix); | |
a66d02c3 | 994 | } |
7fad411c LP |
995 | |
996 | void manager_clear_jobs(Manager *m) { | |
997 | Job *j; | |
998 | ||
999 | assert(m); | |
1000 | ||
1001 | transaction_abort(m); | |
1002 | ||
1003 | while ((j = hashmap_first(m->jobs))) | |
1004 | job_free(j); | |
1005 | } | |
83c60c9f | 1006 | |
034c6ed7 | 1007 | void manager_dispatch_run_queue(Manager *m) { |
83c60c9f | 1008 | Job *j; |
83c60c9f | 1009 | |
034c6ed7 LP |
1010 | if (m->dispatching_run_queue) |
1011 | return; | |
1012 | ||
1013 | m->dispatching_run_queue = true; | |
9152c765 | 1014 | |
034c6ed7 | 1015 | while ((j = m->run_queue)) { |
ac1135be | 1016 | assert(j->installed); |
034c6ed7 LP |
1017 | assert(j->in_run_queue); |
1018 | ||
1019 | job_run_and_invalidate(j); | |
9152c765 | 1020 | } |
034c6ed7 LP |
1021 | |
1022 | m->dispatching_run_queue = false; | |
9152c765 LP |
1023 | } |
1024 | ||
034c6ed7 | 1025 | static int manager_dispatch_sigchld(Manager *m) { |
9152c765 LP |
1026 | assert(m); |
1027 | ||
acbb0225 LP |
1028 | log_debug("dispatching SIGCHLD"); |
1029 | ||
9152c765 LP |
1030 | for (;;) { |
1031 | siginfo_t si; | |
87f0e418 | 1032 | Unit *u; |
9152c765 LP |
1033 | |
1034 | zero(si); | |
acbb0225 LP |
1035 | if (waitid(P_ALL, 0, &si, WEXITED|WNOHANG) < 0) { |
1036 | ||
1037 | if (errno == ECHILD) | |
1038 | break; | |
1039 | ||
9152c765 | 1040 | return -errno; |
acbb0225 | 1041 | } |
9152c765 LP |
1042 | |
1043 | if (si.si_pid == 0) | |
1044 | break; | |
1045 | ||
034c6ed7 LP |
1046 | if (si.si_code != CLD_EXITED && si.si_code != CLD_KILLED && si.si_code != CLD_DUMPED) |
1047 | continue; | |
1048 | ||
acbb0225 LP |
1049 | log_debug("child %llu died (code=%s, status=%i)", (long long unsigned) si.si_pid, sigchld_code(si.si_code), si.si_status); |
1050 | ||
87f0e418 | 1051 | if (!(u = hashmap_remove(m->watch_pids, UINT32_TO_PTR(si.si_pid)))) |
9152c765 LP |
1052 | continue; |
1053 | ||
87f0e418 | 1054 | UNIT_VTABLE(u)->sigchld_event(u, si.si_pid, si.si_code, si.si_status); |
9152c765 LP |
1055 | } |
1056 | ||
1057 | return 0; | |
1058 | } | |
1059 | ||
b9cd2ec1 | 1060 | static int manager_process_signal_fd(Manager *m, bool *quit) { |
9152c765 LP |
1061 | ssize_t n; |
1062 | struct signalfd_siginfo sfsi; | |
1063 | bool sigchld = false; | |
1064 | ||
1065 | assert(m); | |
1066 | ||
1067 | for (;;) { | |
acbb0225 | 1068 | if ((n = read(m->signal_watch.fd, &sfsi, sizeof(sfsi))) != sizeof(sfsi)) { |
9152c765 LP |
1069 | |
1070 | if (n >= 0) | |
1071 | return -EIO; | |
1072 | ||
1073 | if (errno == EAGAIN) | |
acbb0225 | 1074 | break; |
9152c765 LP |
1075 | |
1076 | return -errno; | |
1077 | } | |
1078 | ||
b9cd2ec1 LP |
1079 | switch (sfsi.ssi_signo) { |
1080 | ||
1081 | case SIGCHLD: | |
9152c765 | 1082 | sigchld = true; |
b9cd2ec1 LP |
1083 | break; |
1084 | ||
1085 | case SIGINT: | |
6632c602 | 1086 | case SIGTERM: |
b9cd2ec1 LP |
1087 | *quit = true; |
1088 | return 0; | |
6632c602 LP |
1089 | |
1090 | default: | |
1091 | log_info("Got unhandled signal <%s>.", strsignal(sfsi.ssi_signo)); | |
b9cd2ec1 | 1092 | } |
9152c765 LP |
1093 | } |
1094 | ||
1095 | if (sigchld) | |
034c6ed7 LP |
1096 | return manager_dispatch_sigchld(m); |
1097 | ||
1098 | return 0; | |
1099 | } | |
1100 | ||
b9cd2ec1 | 1101 | static int process_event(Manager *m, struct epoll_event *ev, bool *quit) { |
034c6ed7 | 1102 | int r; |
acbb0225 | 1103 | Watch *w; |
034c6ed7 LP |
1104 | |
1105 | assert(m); | |
1106 | assert(ev); | |
1107 | ||
acbb0225 | 1108 | assert(w = ev->data.ptr); |
034c6ed7 | 1109 | |
acbb0225 | 1110 | switch (w->type) { |
034c6ed7 | 1111 | |
acbb0225 | 1112 | case WATCH_SIGNAL_FD: |
034c6ed7 | 1113 | |
acbb0225 LP |
1114 | /* An incoming signal? */ |
1115 | if (ev->events != POLLIN) | |
1116 | return -EINVAL; | |
034c6ed7 | 1117 | |
b9cd2ec1 | 1118 | if ((r = manager_process_signal_fd(m, quit)) < 0) |
acbb0225 | 1119 | return r; |
034c6ed7 | 1120 | |
acbb0225 | 1121 | break; |
034c6ed7 | 1122 | |
acbb0225 | 1123 | case WATCH_FD: |
034c6ed7 | 1124 | |
acbb0225 LP |
1125 | /* Some fd event, to be dispatched to the units */ |
1126 | UNIT_VTABLE(w->unit)->fd_event(w->unit, w->fd, ev->events, w); | |
1127 | break; | |
034c6ed7 | 1128 | |
acbb0225 LP |
1129 | case WATCH_TIMER: { |
1130 | uint64_t v; | |
1131 | ssize_t k; | |
034c6ed7 | 1132 | |
acbb0225 LP |
1133 | /* Some timer event, to be dispatched to the units */ |
1134 | if ((k = read(ev->data.fd, &v, sizeof(v))) != sizeof(v)) { | |
034c6ed7 | 1135 | |
acbb0225 LP |
1136 | if (k < 0 && (errno == EINTR || errno == EAGAIN)) |
1137 | break; | |
034c6ed7 | 1138 | |
acbb0225 | 1139 | return k < 0 ? -errno : -EIO; |
034c6ed7 LP |
1140 | } |
1141 | ||
acbb0225 LP |
1142 | UNIT_VTABLE(w->unit)->timer_event(w->unit, v, w); |
1143 | break; | |
1144 | } | |
1145 | ||
1146 | default: | |
1147 | assert_not_reached("Unknown epoll event type."); | |
034c6ed7 | 1148 | } |
9152c765 LP |
1149 | |
1150 | return 0; | |
1151 | } | |
1152 | ||
1153 | int manager_loop(Manager *m) { | |
1154 | int r; | |
b9cd2ec1 | 1155 | bool quit = false; |
9152c765 LP |
1156 | |
1157 | assert(m); | |
1158 | ||
1159 | for (;;) { | |
957ca890 LP |
1160 | struct epoll_event event; |
1161 | int n; | |
9152c765 | 1162 | |
034c6ed7 LP |
1163 | manager_dispatch_run_queue(m); |
1164 | ||
957ca890 | 1165 | if ((n = epoll_wait(m->epoll_fd, &event, 1, -1)) < 0) { |
9152c765 LP |
1166 | |
1167 | if (errno == -EINTR) | |
1168 | continue; | |
1169 | ||
1170 | return -errno; | |
1171 | } | |
1172 | ||
957ca890 | 1173 | assert(n == 1); |
b9cd2ec1 | 1174 | |
957ca890 LP |
1175 | if ((r = process_event(m, &event, &quit)) < 0) |
1176 | return r; | |
1177 | ||
1178 | if (quit) | |
1179 | return 0; | |
83c60c9f LP |
1180 | } |
1181 | } |