2 * Copyright (c) 2016, Olivier MATZ <zer0@droids-corp.org>
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * * Neither the name of the University of California, Berkeley nor the
13 * names of its contributors may be used to endorse or promote products
14 * derived from this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
20 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 #include <ecoli_malloc.h>
36 #include <ecoli_string.h>
37 #include <ecoli_strvec.h>
38 #include <ecoli_keyval.h>
39 #include <ecoli_log.h>
40 #include <ecoli_node.h>
42 EC_LOG_TYPE_REGISTER(node);
44 static struct ec_node_type_list node_type_list =
45 TAILQ_HEAD_INITIALIZER(node_type_list);
47 struct ec_node_type *ec_node_type_lookup(const char *name)
49 struct ec_node_type *type;
51 TAILQ_FOREACH(type, &node_type_list, next) {
52 if (!strcmp(name, type->name))
59 int ec_node_type_register(struct ec_node_type *type)
61 if (ec_node_type_lookup(type->name) != NULL)
63 if (type->size < sizeof(struct ec_node))
66 TAILQ_INSERT_TAIL(&node_type_list, type, next);
71 void ec_node_type_dump(FILE *out)
73 struct ec_node_type *type;
75 TAILQ_FOREACH(type, &node_type_list, next)
76 fprintf(out, "%s\n", type->name);
79 struct ec_node *__ec_node(const struct ec_node_type *type, const char *id)
81 struct ec_node *node = NULL;
83 EC_LOG(EC_LOG_DEBUG, "create node type=%s id=%s\n",
90 node = ec_calloc(1, type->size);
97 node->id = ec_strdup(id);
101 if (ec_asprintf(&node->desc, "<%s>", type->name) < 0)
104 node->attrs = ec_keyval();
105 if (node->attrs == NULL)
108 if (type->init_priv != NULL) {
109 if (type->init_priv(node) < 0)
117 ec_keyval_free(node->attrs);
126 struct ec_node *ec_node(const char *typename, const char *id)
128 struct ec_node_type *type;
130 type = ec_node_type_lookup(typename);
132 EC_LOG(EC_LOG_ERR, "type=%s does not exist\n",
137 return __ec_node(type, id);
140 void ec_node_free(struct ec_node *node)
145 assert(node->refcnt > 0);
147 if (--node->refcnt > 0)
150 if (node->type != NULL && node->type->free_priv != NULL)
151 node->type->free_priv(node);
152 ec_free(node->children);
155 ec_free(node->attrs);
159 size_t ec_node_get_max_parse_len(const struct ec_node *node)
161 if (node->type->get_max_parse_len == NULL)
163 return node->type->get_max_parse_len(node);
166 struct ec_node *ec_node_clone(struct ec_node *node)
173 size_t ec_node_get_children_count(const struct ec_node *node)
175 return node->n_children;
179 ec_node_get_child(const struct ec_node *node, size_t i)
181 if (i >= ec_node_get_children_count(node))
183 return node->children[i];
186 int ec_node_add_child(struct ec_node *node, struct ec_node *child)
188 struct ec_node **children = NULL;
191 if (node == NULL || child == NULL) {
196 n = node->n_children;
197 children = ec_realloc(node->children,
198 (n + 1) * sizeof(child));
199 if (children == NULL)
203 node->children = children;
204 node->n_children = n + 1;
213 int ec_node_del_child(struct ec_node *node, struct ec_node *child)
217 if (node == NULL || child == NULL)
220 n = node->n_children;
221 for (i = 0; i < n; i++) {
222 if (node->children[i] != child)
224 memcpy(&node->children[i], &node->children[i+1],
225 (n - i - 1) * sizeof(child));
234 struct ec_node *ec_node_find(struct ec_node *node, const char *id)
236 struct ec_node *child, *ret;
237 const char *node_id = ec_node_id(node);
240 if (id != NULL && node_id != NULL && !strcmp(node_id, id))
243 n = node->n_children;
244 for (i = 0; i < n; i++) {
245 child = node->children[i];
246 ret = ec_node_find(child, id);
254 struct ec_keyval *ec_node_attrs(const struct ec_node *node)
259 const char *ec_node_id(const struct ec_node *node)
261 if (node->id == NULL)
266 static void __ec_node_dump(FILE *out,
267 const struct ec_node *node, size_t indent)
269 const char *id, *typename, *desc;
270 struct ec_node *child;
274 maxlen = ec_node_get_max_parse_len(node);
275 id = ec_node_id(node);
276 typename = node->type->name;
277 desc = ec_node_desc(node);
280 for (i = 0; i < indent; i++) {
287 fprintf(out, "node %p type=%s id=%s desc=%s ",
288 node, typename, id, desc);
289 if (maxlen == SIZE_MAX)
290 fprintf(out, "maxlen=no\n");
292 fprintf(out, "maxlen=%zu\n", maxlen);
293 n = node->n_children;
294 for (i = 0; i < n; i++) {
295 child = node->children[i];
296 __ec_node_dump(out, child, indent + 2);
300 void ec_node_dump(FILE *out, const struct ec_node *node)
302 fprintf(out, "------------------- node dump:\n"); //XXX
305 fprintf(out, "node is NULL\n");
309 __ec_node_dump(out, node, 0);
312 const char *ec_node_desc(const struct ec_node *node)
314 if (node->type->desc != NULL)
315 return node->type->desc(node);
320 int ec_node_check_type(const struct ec_node *node,
321 const struct ec_node_type *type)
323 if (strcmp(node->type->name, type->name)) {