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_assert.h>
36 #include <ecoli_malloc.h>
37 #include <ecoli_strvec.h>
38 #include <ecoli_keyval.h>
39 #include <ecoli_log.h>
40 #include <ecoli_node.h>
41 #include <ecoli_parsed.h>
43 TAILQ_HEAD(ec_parsed_list, ec_parsed);
46 TAILQ_ENTRY(ec_parsed) next;
47 struct ec_parsed_list children;
48 struct ec_parsed *parent;
49 const struct ec_node *node;
50 struct ec_strvec *strvec;
51 struct ec_keyval *attrs;
54 static int __ec_node_parse_child(struct ec_node *node, struct ec_parsed *state,
55 bool is_root, const struct ec_strvec *strvec)
57 struct ec_strvec *match_strvec;
58 struct ec_parsed *child;
61 /* build the node if required */
62 if (node->type->build != NULL) {
63 if ((node->flags & EC_NODE_F_BUILT) == 0) {
64 ret = node->type->build(node);
69 node->flags |= EC_NODE_F_BUILT;
71 if (node->type->parse == NULL)
79 ec_parsed_add_child(state, child);
83 ec_parsed_set_node(child, node);
84 ret = node->type->parse(node, child, strvec);
85 if (ret < 0) // XXX should we free state, child?
88 if (ret == EC_PARSED_NOMATCH) {
90 ec_parsed_del_child(state, child);
91 assert(TAILQ_EMPTY(&child->children));
92 ec_parsed_free(child);
97 match_strvec = ec_strvec_ndup(strvec, 0, ret);
98 if (match_strvec == NULL)
101 child->strvec = match_strvec;
106 int ec_node_parse_child(struct ec_node *node, struct ec_parsed *state,
107 const struct ec_strvec *strvec)
109 assert(state != NULL);
110 return __ec_node_parse_child(node, state, false, strvec);
113 struct ec_parsed *ec_node_parse_strvec(struct ec_node *node,
114 const struct ec_strvec *strvec)
116 struct ec_parsed *parsed = ec_parsed();
122 ret = __ec_node_parse_child(node, parsed, true, strvec);
124 ec_parsed_free(parsed);
131 struct ec_parsed *ec_node_parse(struct ec_node *node, const char *str)
133 struct ec_strvec *strvec = NULL;
134 struct ec_parsed *parsed = NULL;
137 strvec = ec_strvec();
141 if (ec_strvec_add(strvec, str) < 0)
144 parsed = ec_node_parse_strvec(node, strvec);
148 ec_strvec_free(strvec);
152 ec_strvec_free(strvec);
153 ec_parsed_free(parsed);
157 struct ec_parsed *ec_parsed(void)
159 struct ec_parsed *parsed = NULL;
161 parsed = ec_calloc(1, sizeof(*parsed));
165 TAILQ_INIT(&parsed->children);
167 parsed->attrs = ec_keyval();
168 if (parsed->attrs == NULL)
175 ec_keyval_free(parsed->attrs);
181 static struct ec_parsed *
182 __ec_parsed_dup(const struct ec_parsed *root, const struct ec_parsed *ref,
183 struct ec_parsed **new_ref)
185 struct ec_parsed *dup = NULL;
186 struct ec_parsed *child, *dup_child;
187 struct ec_keyval *attrs = NULL;
199 attrs = ec_keyval_dup(root->attrs);
202 ec_keyval_free(dup->attrs);
204 dup->node = root->node;
206 if (root->strvec != NULL) {
207 dup->strvec = ec_strvec_dup(root->strvec);
208 if (dup->strvec == NULL)
212 TAILQ_FOREACH(child, &root->children, next) {
213 dup_child = __ec_parsed_dup(child, ref, new_ref);
214 if (dup_child == NULL)
216 ec_parsed_add_child(dup, dup_child);
226 struct ec_parsed *ec_parsed_dup(struct ec_parsed *parsed) //XXX const
228 struct ec_parsed *root, *dup_root, *dup = NULL;
230 root = ec_parsed_get_root(parsed);
231 dup_root = __ec_parsed_dup(root, parsed, &dup);
232 if (dup_root == NULL)
239 void ec_parsed_free_children(struct ec_parsed *parsed)
241 struct ec_parsed *child;
246 while (!TAILQ_EMPTY(&parsed->children)) {
247 child = TAILQ_FIRST(&parsed->children);
248 TAILQ_REMOVE(&parsed->children, child, next);
249 ec_parsed_free(child);
253 void ec_parsed_free(struct ec_parsed *parsed)
258 // assert(parsed->parent == NULL); XXX
260 // parsed = ec_parsed_get_root(parsed);
262 ec_parsed_free_children(parsed);
263 ec_strvec_free(parsed->strvec);
264 ec_keyval_free(parsed->attrs);
268 static void __ec_parsed_dump(FILE *out,
269 const struct ec_parsed *parsed, size_t indent)
271 struct ec_parsed *child;
272 const struct ec_strvec *vec;
274 const char *id = "none", *typename = "none";
276 if (parsed->node != NULL) {
277 if (parsed->node->id != NULL)
278 id = parsed->node->id;
279 typename = parsed->node->type->name;
283 for (i = 0; i < indent; i++) {
290 fprintf(out, "node_type=%s id=%s vec=", typename, id);
291 vec = ec_parsed_strvec(parsed);
292 ec_strvec_dump(out, vec);
294 TAILQ_FOREACH(child, &parsed->children, next)
295 __ec_parsed_dump(out, child, indent + 2);
298 void ec_parsed_dump(FILE *out, const struct ec_parsed *parsed)
300 fprintf(out, "------------------- parsed dump:\n"); //XXX
302 if (parsed == NULL) {
303 fprintf(out, "parsed is NULL, error in parse\n");
307 /* only exist if it does not match (strvec == NULL) and if it
308 * does not have children: an incomplete parse, like those
309 * generated by complete() don't match but have children that
311 if (!ec_parsed_matches(parsed) && TAILQ_EMPTY(&parsed->children)) {
312 fprintf(out, "no match\n");
316 __ec_parsed_dump(out, parsed, 0);
319 void ec_parsed_add_child(struct ec_parsed *parsed,
320 struct ec_parsed *child)
322 TAILQ_INSERT_TAIL(&parsed->children, child, next);
323 child->parent = parsed;
326 // XXX we can remove the first arg ? parsed == child->parent ?
327 void ec_parsed_del_child(struct ec_parsed *parsed, // XXX rename del in unlink?
328 struct ec_parsed *child)
330 TAILQ_REMOVE(&parsed->children, child, next);
331 child->parent = NULL;
335 ec_parsed_get_first_child(const struct ec_parsed *parsed)
337 return TAILQ_FIRST(&parsed->children);
341 ec_parsed_get_last_child(const struct ec_parsed *parsed)
343 return TAILQ_LAST(&parsed->children, ec_parsed_list);
346 struct ec_parsed *ec_parsed_get_next(const struct ec_parsed *parsed)
348 return TAILQ_NEXT(parsed, next);
351 bool ec_parsed_has_child(const struct ec_parsed *parsed)
353 return !TAILQ_EMPTY(&parsed->children);
356 const struct ec_node *ec_parsed_get_node(const struct ec_parsed *parsed)
361 void ec_parsed_set_node(struct ec_parsed *parsed, const struct ec_node *node)
366 void ec_parsed_del_last_child(struct ec_parsed *parsed) // rename in free
368 struct ec_parsed *child;
370 child = ec_parsed_get_last_child(parsed);
371 ec_parsed_del_child(parsed, child);
372 ec_parsed_free(child);
375 struct ec_parsed *ec_parsed_get_root(struct ec_parsed *parsed)
380 while (parsed->parent != NULL)
381 parsed = parsed->parent;
386 struct ec_parsed *ec_parsed_get_parent(struct ec_parsed *parsed)
391 return parsed->parent;
394 struct ec_parsed *ec_parsed_find_first(struct ec_parsed *parsed,
397 struct ec_parsed *child, *ret;
402 if (parsed->node != NULL &&
403 parsed->node->id != NULL &&
404 !strcmp(parsed->node->id, id))
407 TAILQ_FOREACH(child, &parsed->children, next) {
408 ret = ec_parsed_find_first(child, id);
416 const struct ec_strvec *ec_parsed_strvec(const struct ec_parsed *parsed)
418 if (parsed == NULL || parsed->strvec == NULL)
421 return parsed->strvec;
424 /* number of strings in the parsed vector */
425 size_t ec_parsed_len(const struct ec_parsed *parsed)
427 if (parsed == NULL || parsed->strvec == NULL)
430 return ec_strvec_len(parsed->strvec);
433 size_t ec_parsed_matches(const struct ec_parsed *parsed)
438 if (parsed->strvec == NULL)