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);
45 /* XXX idea for parse: maintain a "cursor" ?
47 struct ec_parsed_tree *root;
48 stuct ec_parsed_tree *cursor;
53 TAILQ_ENTRY(ec_parsed) next;
54 struct ec_parsed_list children;
55 struct ec_parsed *parent;
56 const struct ec_node *node;
57 struct ec_strvec *strvec;
58 struct ec_keyval *attrs;
61 static int __ec_node_parse_child(struct ec_node *node, struct ec_parsed *state,
62 bool is_root, const struct ec_strvec *strvec)
64 struct ec_strvec *match_strvec;
65 struct ec_parsed *child;
68 /* build the node if required */
69 if (node->type->build != NULL) {
70 if ((node->flags & EC_NODE_F_BUILT) == 0) {
71 ret = node->type->build(node);
76 node->flags |= EC_NODE_F_BUILT;
78 if (node->type->parse == NULL)
86 ec_parsed_add_child(state, child);
90 ec_parsed_set_node(child, node);
91 ret = node->type->parse(node, child, strvec);
92 if (ret < 0) // XXX should we free state, child?
95 if (ret == EC_PARSED_NOMATCH) {
97 ec_parsed_del_child(state, child);
98 assert(TAILQ_EMPTY(&child->children));
99 ec_parsed_free(child);
104 match_strvec = ec_strvec_ndup(strvec, 0, ret);
105 if (match_strvec == NULL)
108 child->strvec = match_strvec;
113 int ec_node_parse_child(struct ec_node *node, struct ec_parsed *state,
114 const struct ec_strvec *strvec)
116 assert(state != NULL);
117 return __ec_node_parse_child(node, state, false, strvec);
120 struct ec_parsed *ec_node_parse_strvec(struct ec_node *node,
121 const struct ec_strvec *strvec)
123 struct ec_parsed *parsed = ec_parsed();
129 ret = __ec_node_parse_child(node, parsed, true, strvec);
131 ec_parsed_free(parsed);
138 struct ec_parsed *ec_node_parse(struct ec_node *node, const char *str)
140 struct ec_strvec *strvec = NULL;
141 struct ec_parsed *parsed = NULL;
144 strvec = ec_strvec();
148 if (ec_strvec_add(strvec, str) < 0)
151 parsed = ec_node_parse_strvec(node, strvec);
155 ec_strvec_free(strvec);
159 ec_strvec_free(strvec);
160 ec_parsed_free(parsed);
164 struct ec_parsed *ec_parsed(void)
166 struct ec_parsed *parsed = NULL;
168 parsed = ec_calloc(1, sizeof(*parsed));
172 TAILQ_INIT(&parsed->children);
174 parsed->attrs = ec_keyval();
175 if (parsed->attrs == NULL)
182 ec_keyval_free(parsed->attrs);
188 static struct ec_parsed *
189 __ec_parsed_dup(const struct ec_parsed *root, const struct ec_parsed *ref,
190 struct ec_parsed **new_ref)
192 struct ec_parsed *dup = NULL;
193 struct ec_parsed *child, *dup_child;
194 struct ec_keyval *attrs = NULL;
206 attrs = ec_keyval_dup(root->attrs);
209 ec_keyval_free(dup->attrs);
211 dup->node = root->node;
213 if (root->strvec != NULL) {
214 dup->strvec = ec_strvec_dup(root->strvec);
215 if (dup->strvec == NULL)
219 TAILQ_FOREACH(child, &root->children, next) {
220 dup_child = __ec_parsed_dup(child, ref, new_ref);
221 if (dup_child == NULL)
223 ec_parsed_add_child(dup, dup_child);
233 struct ec_parsed *ec_parsed_dup(struct ec_parsed *parsed) //XXX const
235 struct ec_parsed *root, *dup_root, *dup = NULL;
237 root = ec_parsed_get_root(parsed);
238 dup_root = __ec_parsed_dup(root, parsed, &dup);
239 if (dup_root == NULL)
246 void ec_parsed_free_children(struct ec_parsed *parsed)
248 struct ec_parsed *child;
253 while (!TAILQ_EMPTY(&parsed->children)) {
254 child = TAILQ_FIRST(&parsed->children);
255 TAILQ_REMOVE(&parsed->children, child, next);
256 ec_parsed_free(child);
260 void ec_parsed_free(struct ec_parsed *parsed)
265 // assert(parsed->parent == NULL); XXX
267 // parsed = ec_parsed_get_root(parsed);
269 ec_parsed_free_children(parsed);
270 ec_strvec_free(parsed->strvec);
271 ec_keyval_free(parsed->attrs);
275 static void __ec_parsed_dump(FILE *out,
276 const struct ec_parsed *parsed, size_t indent)
278 struct ec_parsed *child;
279 const struct ec_strvec *vec;
281 const char *id = "none", *typename = "none";
283 if (parsed->node != NULL) {
284 if (parsed->node->id != NULL)
285 id = parsed->node->id;
286 typename = parsed->node->type->name;
290 for (i = 0; i < indent; i++) {
297 fprintf(out, "node_type=%s id=%s vec=", typename, id);
298 vec = ec_parsed_strvec(parsed);
299 ec_strvec_dump(out, vec);
301 TAILQ_FOREACH(child, &parsed->children, next)
302 __ec_parsed_dump(out, child, indent + 2);
305 void ec_parsed_dump(FILE *out, const struct ec_parsed *parsed)
307 fprintf(out, "------------------- parsed dump:\n"); //XXX
309 if (parsed == NULL) {
310 fprintf(out, "parsed is NULL, error in parse\n");
314 /* only exist if it does not match (strvec == NULL) and if it
315 * does not have children: an incomplete parse, like those
316 * generated by complete() don't match but have children that
318 if (!ec_parsed_matches(parsed) && TAILQ_EMPTY(&parsed->children)) {
319 fprintf(out, "no match\n");
323 __ec_parsed_dump(out, parsed, 0);
326 void ec_parsed_add_child(struct ec_parsed *parsed,
327 struct ec_parsed *child)
329 TAILQ_INSERT_TAIL(&parsed->children, child, next);
330 child->parent = parsed;
333 // XXX we can remove the first arg ? parsed == child->parent ?
334 void ec_parsed_del_child(struct ec_parsed *parsed, // XXX rename del in unlink?
335 struct ec_parsed *child)
337 TAILQ_REMOVE(&parsed->children, child, next);
338 child->parent = NULL;
342 ec_parsed_get_first_child(const struct ec_parsed *parsed)
344 return TAILQ_FIRST(&parsed->children);
348 ec_parsed_get_last_child(const struct ec_parsed *parsed)
350 return TAILQ_LAST(&parsed->children, ec_parsed_list);
353 struct ec_parsed *ec_parsed_get_next(const struct ec_parsed *parsed)
355 return TAILQ_NEXT(parsed, next);
358 bool ec_parsed_has_child(const struct ec_parsed *parsed)
360 return !TAILQ_EMPTY(&parsed->children);
363 const struct ec_node *ec_parsed_get_node(const struct ec_parsed *parsed)
368 void ec_parsed_set_node(struct ec_parsed *parsed, const struct ec_node *node)
373 void ec_parsed_del_last_child(struct ec_parsed *parsed) // rename in free
375 struct ec_parsed *child;
377 child = ec_parsed_get_last_child(parsed);
378 ec_parsed_del_child(parsed, child);
379 ec_parsed_free(child);
382 struct ec_parsed *ec_parsed_get_root(struct ec_parsed *parsed)
387 while (parsed->parent != NULL)
388 parsed = parsed->parent;
393 struct ec_parsed *ec_parsed_get_parent(struct ec_parsed *parsed)
398 return parsed->parent;
401 struct ec_parsed *ec_parsed_find_first(struct ec_parsed *parsed,
404 struct ec_parsed *child, *ret;
409 if (parsed->node != NULL &&
410 parsed->node->id != NULL &&
411 !strcmp(parsed->node->id, id))
414 TAILQ_FOREACH(child, &parsed->children, next) {
415 ret = ec_parsed_find_first(child, id);
423 const struct ec_strvec *ec_parsed_strvec(const struct ec_parsed *parsed)
425 if (parsed == NULL || parsed->strvec == NULL)
428 return parsed->strvec;
431 /* number of strings in the parsed vector */
432 size_t ec_parsed_len(const struct ec_parsed *parsed)
434 if (parsed == NULL || parsed->strvec == NULL)
437 return ec_strvec_len(parsed->strvec);
440 size_t ec_parsed_matches(const struct ec_parsed *parsed)
445 if (parsed->strvec == NULL)