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>
40 #include <ecoli_parsed.h>
42 TAILQ_HEAD(ec_parsed_list, ec_parsed);
45 TAILQ_ENTRY(ec_parsed) next;
46 struct ec_parsed_list children;
47 struct ec_parsed *parent;
48 const struct ec_node *node;
49 struct ec_strvec *strvec;
50 struct ec_keyval *attrs;
53 int ec_node_parse_child(struct ec_node *node, struct ec_parsed *state,
54 const struct ec_strvec *strvec)
56 struct ec_strvec *match_strvec;
57 struct ec_parsed *child;
60 assert(state != NULL);
62 /* build the node if required */
63 if (node->type->build != NULL) {
64 if ((node->flags & EC_NODE_F_BUILT) == 0) {
65 ret = node->type->build(node);
70 node->flags |= EC_NODE_F_BUILT;
72 if (node->type->parse == NULL)
79 ec_parsed_set_node(child, node);
80 ec_parsed_add_child(state, child);
81 ret = node->type->parse(node, child, strvec);
85 if (ret == EC_PARSED_NOMATCH) {
86 ec_parsed_del_child(state, child);
87 assert(TAILQ_EMPTY(&child->children));
88 ec_parsed_free(child);
92 match_strvec = ec_strvec_ndup(strvec, 0, ret);
93 if (match_strvec == NULL)
96 child->strvec = match_strvec;
101 struct ec_parsed *ec_node_parse_strvec(struct ec_node *node,
102 const struct ec_strvec *strvec)
104 struct ec_parsed *parsed = ec_parsed();
105 struct ec_parsed *child_parsed;
111 ret = ec_node_parse_child(node, parsed, strvec);
113 ec_parsed_free(parsed);
117 if (ret != EC_PARSED_NOMATCH) {
118 /* remove dummy root node */
119 child_parsed = ec_parsed_get_last_child(parsed);
120 ec_parsed_del_child(parsed, child_parsed);
121 ec_parsed_free(parsed);
122 parsed = child_parsed;
128 struct ec_parsed *ec_node_parse(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(void)
156 struct ec_parsed *parsed = NULL;
158 parsed = ec_calloc(1, sizeof(*parsed));
162 TAILQ_INIT(&parsed->children);
164 parsed->attrs = ec_keyval();
165 if (parsed->attrs == NULL)
172 ec_keyval_free(parsed->attrs);
178 struct ec_parsed *ec_parsed_dup(const struct ec_parsed *parsed)
180 struct ec_parsed *dup = NULL;
181 struct ec_parsed *child, *dup_child;
182 struct ec_keyval *attrs = NULL;
191 attrs = ec_keyval_dup(parsed->attrs);
194 ec_keyval_free(dup->attrs);
197 if (parsed->strvec != NULL) {
198 dup->strvec = ec_strvec_dup(parsed->strvec);
199 if (dup->strvec == NULL)
203 TAILQ_FOREACH(child, &parsed->children, next) {
204 dup_child = ec_parsed_dup(child);
205 if (dup_child == NULL)
207 ec_parsed_add_child(dup, dup_child);
217 void ec_parsed_free_children(struct ec_parsed *parsed)
219 struct ec_parsed *child;
224 while (!TAILQ_EMPTY(&parsed->children)) {
225 child = TAILQ_FIRST(&parsed->children);
226 TAILQ_REMOVE(&parsed->children, child, next);
227 ec_parsed_free(child);
231 void ec_parsed_free(struct ec_parsed *parsed)
236 ec_parsed_free_children(parsed);
237 ec_strvec_free(parsed->strvec);
238 ec_keyval_free(parsed->attrs);
242 static void __ec_parsed_dump(FILE *out,
243 const struct ec_parsed *parsed, size_t indent)
245 struct ec_parsed *child;
246 const struct ec_strvec *vec;
248 const char *id = "none", *typename = "none";
250 if (parsed->node != NULL) {
251 if (parsed->node->id != NULL)
252 id = parsed->node->id;
253 typename = parsed->node->type->name;
257 for (i = 0; i < indent; i++) {
264 fprintf(out, "node_type=%s id=%s vec=", typename, id);
265 vec = ec_parsed_strvec(parsed);
266 ec_strvec_dump(out, vec);
268 TAILQ_FOREACH(child, &parsed->children, next)
269 __ec_parsed_dump(out, child, indent + 2);
272 void ec_parsed_dump(FILE *out, const struct ec_parsed *parsed)
274 fprintf(out, "------------------- parsed dump:\n"); //XXX
276 if (parsed == NULL) {
277 fprintf(out, "parsed is NULL, error in parse\n");
280 if (!ec_parsed_matches(parsed)) {
281 fprintf(out, "no match\n");
285 __ec_parsed_dump(out, parsed, 0);
288 void ec_parsed_add_child(struct ec_parsed *parsed,
289 struct ec_parsed *child)
291 TAILQ_INSERT_TAIL(&parsed->children, child, next);
292 child->parent = parsed;
295 void ec_parsed_del_child(struct ec_parsed *parsed, // XXX rename del in unlink?
296 struct ec_parsed *child)
298 TAILQ_REMOVE(&parsed->children, child, next);
299 child->parent = NULL;
303 ec_parsed_get_first_child(const struct ec_parsed *parsed)
305 return TAILQ_FIRST(&parsed->children);
309 ec_parsed_get_last_child(const struct ec_parsed *parsed)
311 return TAILQ_LAST(&parsed->children, ec_parsed_list);
314 struct ec_parsed *ec_parsed_get_next(const struct ec_parsed *parsed)
316 return TAILQ_NEXT(parsed, next);
319 bool ec_parsed_has_child(const struct ec_parsed *parsed)
321 return !TAILQ_EMPTY(&parsed->children);
324 const struct ec_node *ec_parsed_get_node(const struct ec_parsed *parsed)
329 void ec_parsed_set_node(struct ec_parsed *parsed, const struct ec_node *node)
334 void ec_parsed_del_last_child(struct ec_parsed *parsed) // rename in free
336 struct ec_parsed *child;
338 child = ec_parsed_get_last_child(parsed);
339 ec_parsed_del_child(parsed, child);
340 ec_parsed_free(child);
343 struct ec_parsed *ec_parsed_get_root(struct ec_parsed *parsed)
348 while (parsed->parent != NULL)
349 parsed = parsed->parent;
354 struct ec_parsed *ec_parsed_get_parent(struct ec_parsed *parsed)
359 return parsed->parent;
362 struct ec_parsed *ec_parsed_find_first(struct ec_parsed *parsed,
365 struct ec_parsed *child, *ret;
370 if (parsed->node != NULL &&
371 parsed->node->id != NULL &&
372 !strcmp(parsed->node->id, id))
375 TAILQ_FOREACH(child, &parsed->children, next) {
376 ret = ec_parsed_find_first(child, id);
384 const struct ec_strvec *ec_parsed_strvec(const struct ec_parsed *parsed)
386 if (parsed == NULL || parsed->strvec == NULL)
389 return parsed->strvec;
392 /* number of strings in the parsed vector */
393 size_t ec_parsed_len(const struct ec_parsed *parsed)
395 if (parsed == NULL || parsed->strvec == NULL)
398 return ec_strvec_len(parsed->strvec);
401 size_t ec_parsed_matches(const struct ec_parsed *parsed)
406 if (parsed->node == NULL && TAILQ_EMPTY(&parsed->children)) // XXX both needed?