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(const struct ec_node *node,
62 struct ec_parsed *state,
63 bool is_root, const struct ec_strvec *strvec)
65 struct ec_strvec *match_strvec;
66 struct ec_parsed *child = NULL;
69 if (node->type->parse == NULL)
73 child = ec_parsed(node);
77 ec_parsed_add_child(state, child);
81 ret = node->type->parse(node, child, strvec);
82 if (ret < 0 || ret == EC_PARSED_NOMATCH)
85 match_strvec = ec_strvec_ndup(strvec, 0, ret);
86 if (match_strvec == NULL) {
91 child->strvec = match_strvec;
97 ec_parsed_del_child(state, child);
98 ec_parsed_free(child);
103 int ec_node_parse_child(const struct ec_node *node, struct ec_parsed *state,
104 const struct ec_strvec *strvec)
106 assert(state != NULL);
107 return __ec_node_parse_child(node, state, false, strvec);
110 struct ec_parsed *ec_node_parse_strvec(const struct ec_node *node,
111 const struct ec_strvec *strvec)
113 struct ec_parsed *parsed = ec_parsed(node);
119 ret = __ec_node_parse_child(node, parsed, true, strvec);
121 ec_parsed_free(parsed);
128 struct ec_parsed *ec_node_parse(const struct ec_node *node, const char *str)
130 struct ec_strvec *strvec = NULL;
131 struct ec_parsed *parsed = NULL;
134 strvec = ec_strvec();
138 if (ec_strvec_add(strvec, str) < 0)
141 parsed = ec_node_parse_strvec(node, strvec);
145 ec_strvec_free(strvec);
149 ec_strvec_free(strvec);
150 ec_parsed_free(parsed);
154 struct ec_parsed *ec_parsed(const struct ec_node *node)
156 struct ec_parsed *parsed = NULL;
158 parsed = ec_calloc(1, sizeof(*parsed));
162 TAILQ_INIT(&parsed->children);
165 parsed->attrs = ec_keyval();
166 if (parsed->attrs == NULL)
173 ec_keyval_free(parsed->attrs);
179 static struct ec_parsed *
180 __ec_parsed_dup(const struct ec_parsed *root, const struct ec_parsed *ref,
181 struct ec_parsed **new_ref)
183 struct ec_parsed *dup = NULL;
184 struct ec_parsed *child, *dup_child;
185 struct ec_keyval *attrs = NULL;
190 dup = ec_parsed(root->node);
197 attrs = ec_keyval_dup(root->attrs);
200 ec_keyval_free(dup->attrs);
203 if (root->strvec != NULL) {
204 dup->strvec = ec_strvec_dup(root->strvec);
205 if (dup->strvec == NULL)
209 TAILQ_FOREACH(child, &root->children, next) {
210 dup_child = __ec_parsed_dup(child, ref, new_ref);
211 if (dup_child == NULL)
213 ec_parsed_add_child(dup, dup_child);
223 struct ec_parsed *ec_parsed_dup(struct ec_parsed *parsed) //XXX const
225 struct ec_parsed *root, *dup_root, *dup = NULL;
227 root = ec_parsed_get_root(parsed);
228 dup_root = __ec_parsed_dup(root, parsed, &dup);
229 if (dup_root == NULL)
236 void ec_parsed_free_children(struct ec_parsed *parsed)
238 struct ec_parsed *child;
243 while (!TAILQ_EMPTY(&parsed->children)) {
244 child = TAILQ_FIRST(&parsed->children);
245 TAILQ_REMOVE(&parsed->children, child, next);
246 ec_parsed_free(child);
250 void ec_parsed_free(struct ec_parsed *parsed)
255 // assert(parsed->parent == NULL); XXX
257 // parsed = ec_parsed_get_root(parsed);
259 ec_parsed_free_children(parsed);
260 ec_strvec_free(parsed->strvec);
261 ec_keyval_free(parsed->attrs);
265 static void __ec_parsed_dump(FILE *out,
266 const struct ec_parsed *parsed, size_t indent)
268 struct ec_parsed *child;
269 const struct ec_strvec *vec;
271 const char *id = "none", *typename = "none";
273 if (parsed->node != NULL) {
274 if (parsed->node->id != NULL)
275 id = parsed->node->id;
276 typename = parsed->node->type->name;
280 for (i = 0; i < indent; i++) {
287 fprintf(out, "node_type=%s id=%s vec=", typename, id);
288 vec = ec_parsed_strvec(parsed);
289 ec_strvec_dump(out, vec);
291 TAILQ_FOREACH(child, &parsed->children, next)
292 __ec_parsed_dump(out, child, indent + 2);
295 void ec_parsed_dump(FILE *out, const struct ec_parsed *parsed)
297 fprintf(out, "------------------- parsed dump:\n"); //XXX
299 if (parsed == NULL) {
300 fprintf(out, "parsed is NULL, error in parse\n");
304 /* only exist if it does not match (strvec == NULL) and if it
305 * does not have children: an incomplete parse, like those
306 * generated by complete() don't match but have children that
308 if (!ec_parsed_matches(parsed) && TAILQ_EMPTY(&parsed->children)) {
309 fprintf(out, "no match\n");
313 __ec_parsed_dump(out, parsed, 0);
316 void ec_parsed_add_child(struct ec_parsed *parsed,
317 struct ec_parsed *child)
319 TAILQ_INSERT_TAIL(&parsed->children, child, next);
320 child->parent = parsed;
323 // XXX we can remove the first arg ? parsed == child->parent ?
324 void ec_parsed_del_child(struct ec_parsed *parsed, // XXX rename del in unlink?
325 struct ec_parsed *child)
327 TAILQ_REMOVE(&parsed->children, child, next);
328 child->parent = NULL;
332 ec_parsed_get_first_child(const struct ec_parsed *parsed)
334 return TAILQ_FIRST(&parsed->children);
338 ec_parsed_get_last_child(const struct ec_parsed *parsed)
340 return TAILQ_LAST(&parsed->children, ec_parsed_list);
343 struct ec_parsed *ec_parsed_get_next(const struct ec_parsed *parsed)
345 return TAILQ_NEXT(parsed, next);
348 bool ec_parsed_has_child(const struct ec_parsed *parsed)
350 return !TAILQ_EMPTY(&parsed->children);
353 const struct ec_node *ec_parsed_get_node(const struct ec_parsed *parsed)
358 void ec_parsed_del_last_child(struct ec_parsed *parsed) // rename in free
360 struct ec_parsed *child;
362 child = ec_parsed_get_last_child(parsed);
363 ec_parsed_del_child(parsed, child);
364 ec_parsed_free(child);
367 struct ec_parsed *ec_parsed_get_root(struct ec_parsed *parsed)
372 while (parsed->parent != NULL)
373 parsed = parsed->parent;
378 struct ec_parsed *ec_parsed_get_parent(struct ec_parsed *parsed)
383 return parsed->parent;
386 struct ec_parsed *ec_parsed_iter_next(struct ec_parsed *parsed)
388 struct ec_parsed *child, *parent, *next;
390 child = TAILQ_FIRST(&parsed->children);
393 parent = parsed->parent;
394 while (parent != NULL) {
395 next = TAILQ_NEXT(parsed, next);
399 parent = parsed->parent;
404 struct ec_parsed *ec_parsed_find_first(struct ec_parsed *parsed,
407 struct ec_parsed *child, *ret;
412 if (parsed->node != NULL &&
413 parsed->node->id != NULL &&
414 !strcmp(parsed->node->id, id))
417 TAILQ_FOREACH(child, &parsed->children, next) {
418 ret = ec_parsed_find_first(child, id);
427 ec_parsed_get_attrs(struct ec_parsed *parsed)
432 return parsed->attrs;
435 const struct ec_strvec *ec_parsed_strvec(const struct ec_parsed *parsed)
437 if (parsed == NULL || parsed->strvec == NULL)
440 return parsed->strvec;
443 /* number of strings in the parsed vector */
444 size_t ec_parsed_len(const struct ec_parsed *parsed)
446 if (parsed == NULL || parsed->strvec == NULL)
449 return ec_strvec_len(parsed->strvec);
452 size_t ec_parsed_matches(const struct ec_parsed *parsed)
457 if (parsed->strvec == NULL)