1 /*-*- Mode: C; c-basic-offset: 8 -*-*/
12 NameType name_type_from_string(const char *n) {
14 static const char* suffixes[_NAME_TYPE_MAX] = {
15 [NAME_SERVICE] = ".service",
16 [NAME_TIMER] = ".timer",
17 [NAME_SOCKET] = ".socket",
18 [NAME_MILESTONE] = ".milestone",
19 [NAME_DEVICE] = ".device",
20 [NAME_MOUNT] = ".mount",
21 [NAME_AUTOMOUNT] = ".automount",
22 [NAME_SNAPSHOT] = ".snapshot",
27 for (t = 0; t < _NAME_TYPE_MAX; t++)
28 if (endswith(n, suffixes[t]))
31 return _NAME_TYPE_INVALID;
36 "abcdefghijklmnopqrstuvwxyz" \
37 "ABCDEFGHIJKLMNOPQRSTUVWXYZ" \
40 bool name_is_valid(const char *n) {
46 t = name_type_from_string(n);
47 if (t < 0 || t >= _NAME_TYPE_MAX)
50 if (!(e = strrchr(n, '.')))
53 for (i = n; i < e; i++)
54 if (!strchr(VALID_CHARS, *i))
60 Name *name_new(Manager *m) {
65 if (!(n = new0(Name, 1)))
68 if (!(n->meta.names = set_new(string_hash_func, string_compare_func))) {
73 /* Not much initialization happening here at this time */
75 n->meta.type = _NAME_TYPE_INVALID;
76 n->meta.state = NAME_STUB;
78 /* We don't link the name here, that is left for name_link() */
83 /* FIXME: Does not rollback on failure! */
84 int name_link_names(Name *n, bool replace) {
94 /* Link all names that aren't linked yet. */
96 SET_FOREACH(t, n->meta.names, state)
98 if ((r = hashmap_replace(n->meta.manager->names, t, n)) < 0)
101 if ((r = hashmap_put(n->meta.manager->names, t, n)) < 0)
108 int name_link(Name *n) {
112 assert(!set_isempty(n->meta.names));
113 assert(!n->meta.linked);
115 n->meta.linked = true;
117 if ((r = name_link_names(n, false) < 0)) {
121 /* Rollback the registered names */
122 SET_FOREACH(t, n->meta.names, state)
123 hashmap_remove_value(n->meta.manager->names, t, n);
125 n->meta.linked = false;
129 if (n->meta.state == NAME_STUB)
130 LIST_PREPEND(Meta, n->meta.manager->load_queue, &n->meta);
135 static void bidi_set_free(Name *name, Set *s) {
141 /* Frees the set and makes sure we are dropped from the
142 * inverse pointers */
144 SET_FOREACH(other, s, state) {
147 for (d = 0; d < _NAME_DEPENDENCY_MAX; d++)
148 set_remove(other->meta.dependencies[d], name);
154 void name_free(Name *name) {
160 /* Detach from next 'bigger' objects */
161 if (name->meta.linked) {
165 SET_FOREACH(t, name->meta.names, state)
166 hashmap_remove_value(name->meta.manager->names, t, name);
168 if (name->meta.state == NAME_STUB)
169 LIST_REMOVE(Meta, name->meta.manager->load_queue, &name->meta);
172 /* Free data and next 'smaller' objects */
174 job_free(name->meta.job);
176 for (d = 0; d < _NAME_DEPENDENCY_MAX; d++)
177 bidi_set_free(name, name->meta.dependencies[d]);
179 switch (name->meta.type) {
183 Socket *s = SOCKET(name);
185 for (i = 0; i < s->n_fds; i++)
186 close_nointr(s->fds[i]);
191 Device *d = DEVICE(name);
198 Mount *m = MOUNT(name);
204 case NAME_AUTOMOUNT: {
205 Automount *a = AUTOMOUNT(name);
215 free(name->meta.description);
217 while ((t = set_steal_first(name->meta.names)))
219 set_free(name->meta.names);
224 bool name_is_ready(Name *name) {
228 if (name->meta.state != NAME_LOADED)
231 assert(name->meta.type < _NAME_TYPE_MAX);
233 switch (name->meta.type) {
235 Service *s = SERVICE(name);
238 s->state == SERVICE_RUNNING ||
239 s->state == SERVICE_RELOAD_PRE ||
240 s->state == SERVICE_RELOAD ||
241 s->state == SERVICE_RELOAD_POST;
245 Timer *t = TIMER(name);
248 t->state == TIMER_WAITING ||
249 t->state == TIMER_RUNNING;
253 Socket *s = SOCKET(name);
256 s->state == SOCKET_LISTENING ||
257 s->state == SOCKET_RUNNING;
261 return MILESTONE(name)->state == MILESTONE_ACTIVE;
264 return DEVICE(name)->state == DEVICE_AVAILABLE;
267 return MOUNT(name)->state == MOUNT_MOUNTED;
269 case NAME_AUTOMOUNT: {
270 Automount *a = AUTOMOUNT(name);
273 a->state == AUTOMOUNT_WAITING ||
274 a->state == AUTOMOUNT_RUNNING;
278 return SNAPSHOT(name)->state == SNAPSHOT_ACTIVE;
282 case _NAME_TYPE_INVALID:
286 assert_not_reached("Unknown name type.");
290 static int ensure_in_set(Set **s, void *data) {
297 if (!(*s = set_new(trivial_hash_func, trivial_compare_func)))
300 if ((r = set_put(*s, data) < 0))
307 /* FIXME: Does not rollback on failure! */
308 int name_augment(Name *n) {
315 /* Adds in the missing links to make all dependencies
318 SET_FOREACH(other, n->meta.dependencies[NAME_BEFORE], state)
319 if ((r = ensure_in_set(&other->meta.dependencies[NAME_AFTER], n) < 0))
321 SET_FOREACH(other, n->meta.dependencies[NAME_AFTER], state)
322 if ((r = ensure_in_set(&other->meta.dependencies[NAME_BEFORE], n) < 0))
325 SET_FOREACH(other, n->meta.dependencies[NAME_CONFLICTS], state)
326 if ((r = ensure_in_set(&other->meta.dependencies[NAME_CONFLICTS], n) < 0))
329 SET_FOREACH(other, n->meta.dependencies[NAME_REQUIRES], state)
330 if ((r = ensure_in_set(&other->meta.dependencies[NAME_REQUIRED_BY], n) < 0))
332 SET_FOREACH(other, n->meta.dependencies[NAME_REQUISITE], state)
333 if ((r = ensure_in_set(&other->meta.dependencies[NAME_REQUIRED_BY], n) < 0))
336 SET_FOREACH(other, n->meta.dependencies[NAME_WANTS], state)
337 if ((r = ensure_in_set(&other->meta.dependencies[NAME_WANTED_BY], n) < 0))
339 SET_FOREACH(other, n->meta.dependencies[NAME_SOFT_REQUIRES], state)
340 if ((r = ensure_in_set(&other->meta.dependencies[NAME_WANTED_BY], n) < 0))
342 SET_FOREACH(other, n->meta.dependencies[NAME_SOFT_REQUISITE], state)
343 if ((r = ensure_in_set(&other->meta.dependencies[NAME_WANTED_BY], n) < 0))
349 static int ensure_merge(Set **s, Set *other) {
355 return set_merge(*s, other);
357 if (!(*s = set_copy(other)))
363 /* FIXME: Does not rollback on failure! */
364 int name_merge(Name *name, Name *other) {
370 assert(name->meta.manager == other->meta.manager);
372 /* This merges 'other' into 'name'. FIXME: This does not
373 * rollback on failure. */
375 if (name->meta.type != other->meta.type)
378 if (other->meta.state != NAME_STUB)
382 if ((r = ensure_merge(&name->meta.names, other->meta.names)) < 0)
385 /* Merge dependencies */
386 for (d = 0; d < _NAME_DEPENDENCY_MAX; d++)
387 if ((r = ensure_merge(&name->meta.dependencies[d], other->meta.dependencies[d])) < 0)
390 /* Hookup new deps and names */
391 if (name->meta.linked) {
392 if ((r = name_augment(name)) < 0)
395 if ((r = name_link_names(name, true)) < 0)
402 const char* name_id(Name *n) {
405 return set_first(n->meta.names);
408 void name_dump(Name *n, FILE *f) {
410 static const char* const state_table[_NAME_STATE_MAX] = {
411 [NAME_STUB] = "stub",
412 [NAME_LOADED] = "loaded",
413 [NAME_FAILED] = "failed"
416 static const char* const socket_state_table[_SOCKET_STATE_MAX] = {
417 [SOCKET_DEAD] = "dead",
418 [SOCKET_BEFORE] = "before",
419 [SOCKET_START_PRE] = "start-pre",
420 [SOCKET_START] = "start",
421 [SOCKET_START_POST] = "start-post",
422 [SOCKET_LISTENING] = "listening",
423 [SOCKET_RUNNING] = "running",
424 [SOCKET_STOP_PRE] = "stop-pre",
425 [SOCKET_STOP] = "stop",
426 [SOCKET_STOP_POST] = "stop-post",
427 [SOCKET_MAINTAINANCE] = "maintainance"
437 "\tDescription: %s\n"
438 "\tName State: %s\n",
440 n->meta.description ? n->meta.description : name_id(n),
441 state_table[n->meta.state]);
443 fprintf(f, "\tNames: ");
444 SET_FOREACH(t, n->meta.names, state)
445 fprintf(f, "%s ", t);
448 switch (n->meta.type) {
454 if ((r = address_print(&n->socket.address, &s)) < 0)
461 "\tSocket State: %s\n",
463 socket_state_table[n->socket.state]);
475 job_dump(n->meta.job, f);