2 * Copyright (c) 2016-2017, 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.
37 #include <ecoli_malloc.h>
38 #include <ecoli_log.h>
39 #include <ecoli_test.h>
40 #include <ecoli_strvec.h>
41 #include <ecoli_node.h>
42 #include <ecoli_parsed.h>
43 #include <ecoli_completed.h>
44 #include <ecoli_node_seq.h>
45 #include <ecoli_node_many.h>
46 #include <ecoli_node_or.h>
47 #include <ecoli_node_weakref.h>
48 #include <ecoli_node_expr.h>
54 struct ec_node *child;
56 /* the configuration nodes */
57 struct ec_node *val_node;
58 struct ec_node **bin_ops;
59 unsigned int bin_ops_len;
60 struct ec_node **pre_ops;
61 unsigned int pre_ops_len;
62 struct ec_node **post_ops;
63 unsigned int post_ops_len;
64 struct ec_node **open_ops;
65 struct ec_node **close_ops;
66 unsigned int paren_len;
69 static int ec_node_expr_parse(const struct ec_node *gen_node,
70 struct ec_parsed *state,
71 const struct ec_strvec *strvec)
73 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
75 return ec_node_parse_child(node->child, state, strvec);
78 static struct ec_completed *ec_node_expr_complete(const struct ec_node *gen_node,
79 struct ec_parsed *state,
80 const struct ec_strvec *strvec)
82 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
84 return ec_node_complete_child(node->child, state, strvec);
87 static void ec_node_expr_free_priv(struct ec_node *gen_node)
89 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
92 ec_log(EC_LOG_DEBUG, "free %p %p %p\n", node, node->child, node->val_node);
93 ec_node_free(node->val_node);
95 for (i = 0; i < node->bin_ops_len; i++)
96 ec_node_free(node->bin_ops[i]);
97 ec_free(node->bin_ops);
98 for (i = 0; i < node->pre_ops_len; i++)
99 ec_node_free(node->pre_ops[i]);
100 ec_free(node->pre_ops);
101 for (i = 0; i < node->post_ops_len; i++)
102 ec_node_free(node->post_ops[i]);
103 ec_free(node->post_ops);
104 for (i = 0; i < node->paren_len; i++) {
105 ec_node_free(node->open_ops[i]);
106 ec_node_free(node->close_ops[i]);
108 ec_free(node->open_ops);
109 ec_free(node->close_ops);
111 ec_node_free(node->child);
114 static int ec_node_expr_build(struct ec_node *gen_node)
116 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
117 struct ec_node *term = NULL, *expr = NULL, *next = NULL,
118 *pre_op = NULL, *post_op = NULL,
119 *post = NULL, *weak = NULL;
123 if (node->val_node == NULL)
125 if (node->bin_ops_len == 0 && node->pre_ops_len == 0 &&
126 node->post_ops_len == 0)
129 /* create the object, we will initialize it later: this is
130 * needed because we have a circular dependency */
132 weak = ec_node("weakref", "weak");
136 /* prefix unary operators */
137 pre_op = ec_node("or", "pre-op");
140 for (i = 0; i < node->pre_ops_len; i++) {
141 if (ec_node_or_add(pre_op, ec_node_clone(node->pre_ops[i])) < 0)
145 /* suffix unary operators */
146 post_op = ec_node("or", "post-op");
149 for (i = 0; i < node->post_ops_len; i++) {
150 if (ec_node_or_add(post_op, ec_node_clone(node->post_ops[i])) < 0)
154 post = ec_node("or", "post");
157 if (ec_node_or_add(post, ec_node_clone(node->val_node)) < 0)
159 if (ec_node_or_add(post,
161 ec_node_clone(pre_op),
162 ec_node_clone(weak))) < 0)
164 for (i = 0; i < node->paren_len; i++) {
165 if (ec_node_or_add(post, EC_NODE_SEQ(NULL,
166 ec_node_clone(node->open_ops[i]),
168 ec_node_clone(node->close_ops[i]))) < 0)
171 term = EC_NODE_SEQ("term",
173 ec_node_many(NULL, ec_node_clone(post_op), 0, 0)
178 for (i = 0; i < node->bin_ops_len; i++) {
179 next = EC_NODE_SEQ("next",
183 ec_node_clone(node->bin_ops[i]),
197 /* free the initial references */
198 ec_node_free(pre_op);
200 ec_node_free(post_op);
205 /* no need to clone here, the node is not consumed */
206 if (ec_node_weakref_set(weak, expr) < 0)
212 ec_node_dump(stdout, node->child); //XXX
219 ec_node_free(pre_op);
220 ec_node_free(post_op);
227 static struct ec_node_type ec_node_expr_type = {
229 .build = ec_node_expr_build,
230 .parse = ec_node_expr_parse,
231 .complete = ec_node_expr_complete,
232 .size = sizeof(struct ec_node_expr),
233 .free_priv = ec_node_expr_free_priv,
236 EC_NODE_TYPE_REGISTER(ec_node_expr_type);
238 int ec_node_expr_set_val_node(struct ec_node *gen_node, struct ec_node *val_node)
240 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
244 if (val_node == NULL)
247 if (gen_node->flags & EC_NODE_F_BUILT)
250 if (node->val_node != NULL)
253 node->val_node = val_node;
254 gen_node->flags &= ~EC_NODE_F_BUILT;
259 ec_node_free(val_node);
263 /* add a binary operator */
264 int ec_node_expr_add_bin_op(struct ec_node *gen_node, struct ec_node *op)
266 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
267 struct ec_node **bin_ops;
270 // XXX check node type
273 if (node == NULL || op == NULL)
276 if (gen_node->flags & EC_NODE_F_BUILT)
280 bin_ops = ec_realloc(node->bin_ops,
281 (node->bin_ops_len + 1) * sizeof(*node->bin_ops));
285 node->bin_ops = bin_ops;
286 bin_ops[node->bin_ops_len] = op;
288 gen_node->flags &= ~EC_NODE_F_BUILT;
297 /* add a unary pre-operator */
298 int ec_node_expr_add_pre_op(struct ec_node *gen_node, struct ec_node *op)
300 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
301 struct ec_node **pre_ops;
304 // XXX check node type
307 if (node == NULL || op == NULL)
310 if (gen_node->flags & EC_NODE_F_BUILT)
314 pre_ops = ec_realloc(node->pre_ops,
315 (node->pre_ops_len + 1) * sizeof(*node->pre_ops));
319 node->pre_ops = pre_ops;
320 pre_ops[node->pre_ops_len] = op;
322 gen_node->flags &= ~EC_NODE_F_BUILT;
331 /* add a unary post-operator */
332 int ec_node_expr_add_post_op(struct ec_node *gen_node, struct ec_node *op)
334 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
335 struct ec_node **post_ops;
338 // XXX check node type
341 if (node == NULL || op == NULL)
344 if (gen_node->flags & EC_NODE_F_BUILT)
348 post_ops = ec_realloc(node->post_ops,
349 (node->post_ops_len + 1) * sizeof(*node->post_ops));
350 if (post_ops == NULL)
353 node->post_ops = post_ops;
354 post_ops[node->post_ops_len] = op;
355 node->post_ops_len++;
356 gen_node->flags &= ~EC_NODE_F_BUILT;
365 /* add parenthesis symbols */
366 int ec_node_expr_add_parenthesis(struct ec_node *gen_node,
367 struct ec_node *open, struct ec_node *close)
369 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
370 struct ec_node **open_ops, **close_ops;
373 // XXX check node type
376 if (node == NULL || open == NULL || close == NULL)
379 if (gen_node->flags & EC_NODE_F_BUILT)
383 open_ops = ec_realloc(node->open_ops,
384 (node->paren_len + 1) * sizeof(*node->open_ops));
385 if (open_ops == NULL)
387 close_ops = ec_realloc(node->close_ops,
388 (node->paren_len + 1) * sizeof(*node->close_ops));
389 if (close_ops == NULL)
392 node->open_ops = open_ops;
393 node->close_ops = close_ops;
394 open_ops[node->paren_len] = open;
395 close_ops[node->paren_len] = close;
397 gen_node->flags &= ~EC_NODE_F_BUILT;
407 enum expr_node_type {
416 static enum expr_node_type get_node_type(const struct ec_node *expr_gen_node,
417 const struct ec_node *check)
419 struct ec_node_expr *expr_node = (struct ec_node_expr *)expr_gen_node;
422 if (check == expr_node->val_node)
425 for (i = 0; i < expr_node->bin_ops_len; i++) {
426 if (check == expr_node->bin_ops[i])
429 for (i = 0; i < expr_node->pre_ops_len; i++) {
430 if (check == expr_node->pre_ops[i])
433 for (i = 0; i < expr_node->post_ops_len; i++) {
434 if (check == expr_node->post_ops[i])
438 for (i = 0; i < expr_node->paren_len; i++) {
439 if (check == expr_node->open_ops[i])
442 for (i = 0; i < expr_node->paren_len; i++) {
443 if (check == expr_node->close_ops[i])
453 const struct ec_parsed *op;
454 enum expr_node_type op_type;
457 /* merge x and y results in x */
458 static int merge_results(void *userctx,
459 const struct ec_node_expr_eval_ops *ops,
460 struct result *x, const struct result *y)
464 if (y->has_val == 0 && y->op == NULL)
466 if (x->has_val == 0 && x->op == NULL) {
471 if (x->has_val && y->has_val && y->op != NULL) {
472 if (y->op_type == BIN_OP) {
473 ret = ops->eval_bin_op(&x->val, userctx, x->val,
482 if (x->has_val == 0 && x->op != NULL && y->has_val && y->op == NULL) {
483 if (x->op_type == PRE_OP) {
484 ret = ops->eval_pre_op(&x->val, userctx, y->val, x->op);
491 } else if (x->op_type == BIN_OP) {
498 if (x->has_val && x->op == NULL && y->has_val == 0 && y->op != NULL) {
499 ret = ops->eval_post_op(&x->val, userctx, x->val, y->op);
506 assert(false); /* we should not get here */
510 static int eval_expression(struct result *result,
512 const struct ec_node_expr_eval_ops *ops,
513 const struct ec_node *expr_gen_node,
514 const struct ec_parsed *parsed)
517 struct ec_parsed *open = NULL, *close = NULL;
518 struct result child_result;
519 struct ec_parsed *child;
520 enum expr_node_type type;
523 memset(result, 0, sizeof(*result));
524 memset(&child_result, 0, sizeof(child_result));
526 type = get_node_type(expr_gen_node, parsed->node);
528 ret = ops->eval_var(&result->val, userctx, parsed);
532 } else if (type == PRE_OP || type == POST_OP || type == BIN_OP) {
534 result->op_type = type;
537 TAILQ_FOREACH(child, &parsed->children, next) {
539 type = get_node_type(expr_gen_node, child->node);
540 if (type == PAREN_OPEN) {
543 } else if (type == PAREN_CLOSE) {
548 ret = eval_expression(&child_result, userctx, ops,
549 expr_gen_node, child);
553 ret = merge_results(userctx, ops, result, &child_result);
557 memset(&child_result, 0, sizeof(child_result));
560 if (open != NULL && close != NULL) {
561 ret = ops->eval_parenthesis(&result->val, userctx, open, close,
571 ops->eval_free(result->val, userctx);
572 if (child_result.has_val)
573 ops->eval_free(child_result.val, userctx);
574 memset(result, 0, sizeof(*result));
579 int ec_node_expr_eval(void **user_result, const struct ec_node *node,
580 struct ec_parsed *parsed, const struct ec_node_expr_eval_ops *ops,
583 struct result result;
586 if (ops == NULL || ops->eval_var == NULL || ops->eval_pre_op == NULL ||
587 ops->eval_post_op == NULL || ops->eval_bin_op == NULL ||
588 ops->eval_parenthesis == NULL || ops->eval_free == NULL)
591 if (!ec_parsed_matches(parsed))
594 ec_parsed_dump(stdout, parsed); //XXX
595 ret = eval_expression(&result, userctx, ops, node, parsed);
599 assert(result.has_val);
600 assert(result.op == NULL);
601 *user_result = result.val;
606 /* the test case is in a separate file ecoli_node_expr_test.c */