1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2016, Olivier MATZ <zer0@droids-corp.org>
12 #include <ecoli_malloc.h>
13 #include <ecoli_string.h>
14 #include <ecoli_strvec.h>
15 #include <ecoli_keyval.h>
16 #include <ecoli_log.h>
17 #include <ecoli_node.h>
19 EC_LOG_TYPE_REGISTER(node);
21 static struct ec_node_type_list node_type_list =
22 TAILQ_HEAD_INITIALIZER(node_type_list);
24 struct ec_node_type *ec_node_type_lookup(const char *name)
26 struct ec_node_type *type;
28 TAILQ_FOREACH(type, &node_type_list, next) {
29 if (!strcmp(name, type->name))
36 int ec_node_type_register(struct ec_node_type *type)
38 if (ec_node_type_lookup(type->name) != NULL)
40 if (type->size < sizeof(struct ec_node))
43 TAILQ_INSERT_TAIL(&node_type_list, type, next);
48 void ec_node_type_dump(FILE *out)
50 struct ec_node_type *type;
52 TAILQ_FOREACH(type, &node_type_list, next)
53 fprintf(out, "%s\n", type->name);
56 struct ec_node *__ec_node(const struct ec_node_type *type, const char *id)
58 struct ec_node *node = NULL;
60 EC_LOG(EC_LOG_DEBUG, "create node type=%s id=%s\n",
67 node = ec_calloc(1, type->size);
74 node->id = ec_strdup(id);
78 if (ec_asprintf(&node->desc, "<%s>", type->name) < 0)
81 node->attrs = ec_keyval();
82 if (node->attrs == NULL)
85 if (type->init_priv != NULL) {
86 if (type->init_priv(node) < 0)
94 ec_keyval_free(node->attrs);
103 struct ec_node *ec_node(const char *typename, const char *id)
105 struct ec_node_type *type;
107 type = ec_node_type_lookup(typename);
109 EC_LOG(EC_LOG_ERR, "type=%s does not exist\n",
114 return __ec_node(type, id);
117 void ec_node_free(struct ec_node *node)
122 assert(node->refcnt > 0);
124 if (--node->refcnt > 0)
127 if (node->type != NULL && node->type->free_priv != NULL)
128 node->type->free_priv(node);
129 ec_free(node->children);
132 ec_free(node->attrs);
136 struct ec_node *ec_node_clone(struct ec_node *node)
143 size_t ec_node_get_children_count(const struct ec_node *node)
145 return node->n_children;
149 ec_node_get_child(const struct ec_node *node, size_t i)
151 if (i >= ec_node_get_children_count(node))
153 return node->children[i];
156 int ec_node_add_child(struct ec_node *node, struct ec_node *child)
158 struct ec_node **children = NULL;
161 if (node == NULL || child == NULL) {
166 n = node->n_children;
167 children = ec_realloc(node->children,
168 (n + 1) * sizeof(child));
169 if (children == NULL)
173 node->children = children;
174 node->n_children = n + 1;
183 int ec_node_del_child(struct ec_node *node, struct ec_node *child)
187 if (node == NULL || child == NULL)
190 n = node->n_children;
191 for (i = 0; i < n; i++) {
192 if (node->children[i] != child)
194 memcpy(&node->children[i], &node->children[i+1],
195 (n - i - 1) * sizeof(child));
204 struct ec_node *ec_node_find(struct ec_node *node, const char *id)
206 struct ec_node *child, *ret;
207 const char *node_id = ec_node_id(node);
210 if (id != NULL && node_id != NULL && !strcmp(node_id, id))
213 n = node->n_children;
214 for (i = 0; i < n; i++) {
215 child = node->children[i];
216 ret = ec_node_find(child, id);
224 struct ec_keyval *ec_node_attrs(const struct ec_node *node)
229 const char *ec_node_id(const struct ec_node *node)
231 if (node->id == NULL)
236 static void __ec_node_dump(FILE *out,
237 const struct ec_node *node, size_t indent)
239 const char *id, *typename;
240 struct ec_node *child;
243 id = ec_node_id(node);
244 typename = node->type->name;
246 fprintf(out, "%*s" "type=%s id=%s %p\n",
247 (int)indent * 4, "", typename, id, node);
248 n = node->n_children;
249 for (i = 0; i < n; i++) {
250 child = node->children[i];
251 __ec_node_dump(out, child, indent + 1);
255 void ec_node_dump(FILE *out, const struct ec_node *node)
257 fprintf(out, "------------------- node dump:\n");
260 fprintf(out, "node is NULL\n");
264 __ec_node_dump(out, node, 0);
267 const char *ec_node_desc(const struct ec_node *node)
269 if (node->type->desc != NULL)
270 return node->type->desc(node);
275 int ec_node_check_type(const struct ec_node *node,
276 const struct ec_node_type *type)
278 if (strcmp(node->type->name, type->name)) {