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_strvec.h>
37 #include <ecoli_keyval.h>
38 #include <ecoli_log.h>
39 #include <ecoli_node.h>
41 EC_LOG_TYPE_REGISTER(node);
43 static struct ec_node_type_list node_type_list =
44 TAILQ_HEAD_INITIALIZER(node_type_list);
46 struct ec_node_type *ec_node_type_lookup(const char *name)
48 struct ec_node_type *type;
50 TAILQ_FOREACH(type, &node_type_list, next) {
51 if (!strcmp(name, type->name))
58 int ec_node_type_register(struct ec_node_type *type)
60 if (ec_node_type_lookup(type->name) != NULL)
62 if (type->size < sizeof(struct ec_node))
65 TAILQ_INSERT_TAIL(&node_type_list, type, next);
70 void ec_node_type_dump(FILE *out)
72 struct ec_node_type *type;
74 TAILQ_FOREACH(type, &node_type_list, next)
75 fprintf(out, "%s\n", type->name);
78 struct ec_node *__ec_node(const struct ec_node_type *type, const char *id)
80 struct ec_node *node = NULL;
83 EC_LOG(EC_LOG_DEBUG, "create node type=%s id=%s\n",
86 node = ec_calloc(1, type->size);
90 TAILQ_INIT(&node->children);
95 node->id = ec_strdup(id);
100 snprintf(buf, sizeof(buf), "<%s>", type->name);
101 node->desc = ec_strdup(buf); // XXX ec_asprintf ?
102 if (node->desc == NULL)
105 node->attrs = ec_keyval();
106 if (node->attrs == NULL)
116 struct ec_node *ec_node(const char *typename, const char *id)
118 struct ec_node_type *type;
120 type = ec_node_type_lookup(typename);
122 EC_LOG(EC_LOG_ERR, "type=%s does not exist\n",
127 return __ec_node(type, id);
130 void ec_node_free(struct ec_node *node)
135 assert(node->refcnt > 0);
137 if (--node->refcnt > 0)
140 if (node->type != NULL && node->type->free_priv != NULL)
141 node->type->free_priv(node);
144 ec_free(node->attrs);
148 size_t ec_node_get_max_parse_len(const struct ec_node *node)
150 if (node->type->get_max_parse_len == NULL)
152 return node->type->get_max_parse_len(node);
155 struct ec_node *ec_node_clone(struct ec_node *node)
162 struct ec_node *ec_node_find(struct ec_node *node, const char *id)
164 struct ec_node *child, *ret;
165 const char *node_id = ec_node_id(node);
167 if (id != NULL && node_id != NULL && !strcmp(node_id, id))
170 TAILQ_FOREACH(child, &node->children, next) {
171 ret = ec_node_find(child, id);
179 struct ec_keyval *ec_node_attrs(const struct ec_node *node)
184 const char *ec_node_id(const struct ec_node *node)
186 if (node->id == NULL)
191 struct ec_node *ec_node_parent(const struct ec_node *node)
196 static void __ec_node_dump(FILE *out,
197 const struct ec_node *node, size_t indent)
199 const char *id, *typename, *desc;
200 struct ec_node *child;
204 maxlen = ec_node_get_max_parse_len(node);
205 id = ec_node_id(node);
206 typename = node->type->name;
207 desc = ec_node_desc(node);
210 for (i = 0; i < indent; i++) {
217 fprintf(out, "node %p type=%s id=%s desc=%s ",
218 node, typename, id, desc);
219 if (maxlen == SIZE_MAX)
220 fprintf(out, "maxlen=no\n");
222 fprintf(out, "maxlen=%zu\n", maxlen);
223 TAILQ_FOREACH(child, &node->children, next)
224 __ec_node_dump(out, child, indent + 2);
227 void ec_node_dump(FILE *out, const struct ec_node *node)
229 fprintf(out, "------------------- node dump:\n"); //XXX
232 fprintf(out, "node is NULL\n");
236 __ec_node_dump(out, node, 0);
239 const char *ec_node_desc(const struct ec_node *node)
241 if (node->type->desc != NULL)
242 return node->type->desc(node);
247 int ec_node_check_type(const struct ec_node *node,
248 const struct ec_node_type *type)
250 if (strcmp(node->type->name, type->name))