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(const struct ec_node *node,
55 struct ec_parsed *state,
56 bool is_root, const struct ec_strvec *strvec)
58 struct ec_strvec *match_strvec;
59 struct ec_parsed *child = NULL;
62 if (node->type->parse == NULL)
66 child = ec_parsed(node);
70 ec_parsed_add_child(state, child);
74 ret = node->type->parse(node, child, strvec);
75 if (ret < 0 || ret == EC_PARSED_NOMATCH)
78 match_strvec = ec_strvec_ndup(strvec, 0, ret);
79 if (match_strvec == NULL) {
84 child->strvec = match_strvec;
90 ec_parsed_del_child(state, child);
91 ec_parsed_free(child);
96 int ec_node_parse_child(const struct ec_node *node, struct ec_parsed *state,
97 const struct ec_strvec *strvec)
99 assert(state != NULL);
100 return __ec_node_parse_child(node, state, false, strvec);
103 struct ec_parsed *ec_node_parse_strvec(const struct ec_node *node,
104 const struct ec_strvec *strvec)
106 struct ec_parsed *parsed = ec_parsed(node);
112 ret = __ec_node_parse_child(node, parsed, true, strvec);
114 ec_parsed_free(parsed);
121 struct ec_parsed *ec_node_parse(const struct ec_node *node, const char *str)
123 struct ec_strvec *strvec = NULL;
124 struct ec_parsed *parsed = NULL;
127 strvec = ec_strvec();
131 if (ec_strvec_add(strvec, str) < 0)
134 parsed = ec_node_parse_strvec(node, strvec);
138 ec_strvec_free(strvec);
142 ec_strvec_free(strvec);
143 ec_parsed_free(parsed);
147 struct ec_parsed *ec_parsed(const struct ec_node *node)
149 struct ec_parsed *parsed = NULL;
151 parsed = ec_calloc(1, sizeof(*parsed));
155 TAILQ_INIT(&parsed->children);
158 parsed->attrs = ec_keyval();
159 if (parsed->attrs == NULL)
166 ec_keyval_free(parsed->attrs);
172 static struct ec_parsed *
173 __ec_parsed_dup(const struct ec_parsed *root, const struct ec_parsed *ref,
174 struct ec_parsed **new_ref)
176 struct ec_parsed *dup = NULL;
177 struct ec_parsed *child, *dup_child;
178 struct ec_keyval *attrs = NULL;
183 dup = ec_parsed(root->node);
190 attrs = ec_keyval_dup(root->attrs);
193 ec_keyval_free(dup->attrs);
196 if (root->strvec != NULL) {
197 dup->strvec = ec_strvec_dup(root->strvec);
198 if (dup->strvec == NULL)
202 TAILQ_FOREACH(child, &root->children, next) {
203 dup_child = __ec_parsed_dup(child, ref, new_ref);
204 if (dup_child == NULL)
206 ec_parsed_add_child(dup, dup_child);
216 struct ec_parsed *ec_parsed_dup(struct ec_parsed *parsed) //XXX const
218 struct ec_parsed *root, *dup_root, *dup = NULL;
220 root = ec_parsed_get_root(parsed);
221 dup_root = __ec_parsed_dup(root, parsed, &dup);
222 if (dup_root == NULL)
229 void ec_parsed_free_children(struct ec_parsed *parsed)
231 struct ec_parsed *child;
236 while (!TAILQ_EMPTY(&parsed->children)) {
237 child = TAILQ_FIRST(&parsed->children);
238 TAILQ_REMOVE(&parsed->children, child, next);
239 ec_parsed_free(child);
243 void ec_parsed_free(struct ec_parsed *parsed)
248 // assert(parsed->parent == NULL); XXX
250 // parsed = ec_parsed_get_root(parsed);
252 ec_parsed_free_children(parsed);
253 ec_strvec_free(parsed->strvec);
254 ec_keyval_free(parsed->attrs);
258 static void __ec_parsed_dump(FILE *out,
259 const struct ec_parsed *parsed, size_t indent)
261 struct ec_parsed *child;
262 const struct ec_strvec *vec;
264 const char *id = "none", *typename = "none";
266 if (parsed->node != NULL) {
267 if (parsed->node->id != NULL)
268 id = parsed->node->id;
269 typename = parsed->node->type->name;
273 for (i = 0; i < indent; i++) {
280 fprintf(out, "node_type=%s id=%s vec=", typename, id);
281 vec = ec_parsed_strvec(parsed);
282 ec_strvec_dump(out, vec);
284 TAILQ_FOREACH(child, &parsed->children, next)
285 __ec_parsed_dump(out, child, indent + 2);
288 void ec_parsed_dump(FILE *out, const struct ec_parsed *parsed)
290 fprintf(out, "------------------- parsed dump:\n"); //XXX
292 if (parsed == NULL) {
293 fprintf(out, "parsed is NULL, error in parse\n");
297 /* only exist if it does not match (strvec == NULL) and if it
298 * does not have children: an incomplete parse, like those
299 * generated by complete() don't match but have children that
301 if (!ec_parsed_matches(parsed) && TAILQ_EMPTY(&parsed->children)) {
302 fprintf(out, "no match\n");
306 __ec_parsed_dump(out, parsed, 0);
309 void ec_parsed_add_child(struct ec_parsed *parsed,
310 struct ec_parsed *child)
312 TAILQ_INSERT_TAIL(&parsed->children, child, next);
313 child->parent = parsed;
316 // XXX we can remove the first arg ? parsed == child->parent ?
317 void ec_parsed_del_child(struct ec_parsed *parsed, // XXX rename del in unlink?
318 struct ec_parsed *child)
320 TAILQ_REMOVE(&parsed->children, child, next);
321 child->parent = NULL;
325 ec_parsed_get_first_child(const struct ec_parsed *parsed)
327 return TAILQ_FIRST(&parsed->children);
331 ec_parsed_get_last_child(const struct ec_parsed *parsed)
333 return TAILQ_LAST(&parsed->children, ec_parsed_list);
336 struct ec_parsed *ec_parsed_get_next(const struct ec_parsed *parsed)
338 return TAILQ_NEXT(parsed, next);
341 bool ec_parsed_has_child(const struct ec_parsed *parsed)
343 return !TAILQ_EMPTY(&parsed->children);
346 const struct ec_node *ec_parsed_get_node(const struct ec_parsed *parsed)
351 void ec_parsed_del_last_child(struct ec_parsed *parsed) // rename in free
353 struct ec_parsed *child;
355 child = ec_parsed_get_last_child(parsed);
356 ec_parsed_del_child(parsed, child);
357 ec_parsed_free(child);
360 struct ec_parsed *ec_parsed_get_root(struct ec_parsed *parsed)
365 while (parsed->parent != NULL)
366 parsed = parsed->parent;
371 struct ec_parsed *ec_parsed_get_parent(struct ec_parsed *parsed)
376 return parsed->parent;
379 struct ec_parsed *ec_parsed_iter_next(struct ec_parsed *parsed)
381 struct ec_parsed *child, *parent, *next;
383 child = TAILQ_FIRST(&parsed->children);
386 parent = parsed->parent;
387 while (parent != NULL) {
388 next = TAILQ_NEXT(parsed, next);
392 parent = parsed->parent;
397 struct ec_parsed *ec_parsed_find_first(struct ec_parsed *parsed,
400 struct ec_parsed *child, *ret;
405 if (parsed->node != NULL &&
406 parsed->node->id != NULL &&
407 !strcmp(parsed->node->id, id))
410 TAILQ_FOREACH(child, &parsed->children, next) {
411 ret = ec_parsed_find_first(child, id);
420 ec_parsed_get_attrs(struct ec_parsed *parsed)
425 return parsed->attrs;
428 const struct ec_strvec *ec_parsed_strvec(const struct ec_parsed *parsed)
430 if (parsed == NULL || parsed->strvec == NULL)
433 return parsed->strvec;
436 /* number of strings in the parsed vector */
437 size_t ec_parsed_len(const struct ec_parsed *parsed)
439 if (parsed == NULL || parsed->strvec == NULL)
442 return ec_strvec_len(parsed->strvec);
445 size_t ec_parsed_matches(const struct ec_parsed *parsed)
450 if (parsed->strvec == NULL)