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 const struct ec_strvec *strvec)
81 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
83 return ec_node_complete_strvec(node->child, strvec);
86 static void ec_node_expr_free_priv(struct ec_node *gen_node)
88 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
91 ec_log(EC_LOG_DEBUG, "free %p %p %p\n", node, node->child, node->val_node);
92 ec_node_free(node->val_node);
94 for (i = 0; i < node->bin_ops_len; i++)
95 ec_node_free(node->bin_ops[i]);
96 ec_free(node->bin_ops);
97 for (i = 0; i < node->pre_ops_len; i++)
98 ec_node_free(node->pre_ops[i]);
99 ec_free(node->pre_ops);
100 for (i = 0; i < node->post_ops_len; i++)
101 ec_node_free(node->post_ops[i]);
102 ec_free(node->post_ops);
103 for (i = 0; i < node->paren_len; i++) {
104 ec_node_free(node->open_ops[i]);
105 ec_node_free(node->close_ops[i]);
107 ec_free(node->open_ops);
108 ec_free(node->close_ops);
110 ec_node_free(node->child);
113 static int ec_node_expr_build(struct ec_node *gen_node)
115 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
116 struct ec_node *term = NULL, *expr = NULL, *next = NULL,
117 *pre_op = NULL, *post_op = NULL,
118 *post = NULL, *weak = NULL;
122 if (node->val_node == NULL)
124 if (node->bin_ops_len == 0 && node->pre_ops_len == 0 &&
125 node->post_ops_len == 0)
128 /* create the object, we will initialize it later: this is
129 * needed because we have a circular dependency */
131 weak = ec_node("weakref", "weak");
135 /* prefix unary operators */
136 pre_op = ec_node("or", "pre-op");
139 for (i = 0; i < node->pre_ops_len; i++) {
140 if (ec_node_or_add(pre_op, ec_node_clone(node->pre_ops[i])) < 0)
144 /* suffix unary operators */
145 post_op = ec_node("or", "post-op");
148 for (i = 0; i < node->post_ops_len; i++) {
149 if (ec_node_or_add(post_op, ec_node_clone(node->post_ops[i])) < 0)
153 post = ec_node("or", "post");
156 if (ec_node_or_add(post, ec_node_clone(node->val_node)) < 0)
158 if (ec_node_or_add(post,
160 ec_node_clone(pre_op),
161 ec_node_clone(weak))) < 0)
163 for (i = 0; i < node->paren_len; i++) {
164 if (ec_node_or_add(post, EC_NODE_SEQ(NULL,
165 ec_node_clone(node->open_ops[i]),
167 ec_node_clone(node->close_ops[i]))) < 0)
170 term = EC_NODE_SEQ("term",
172 ec_node_many(NULL, ec_node_clone(post_op), 0, 0)
177 for (i = 0; i < node->bin_ops_len; i++) {
178 next = EC_NODE_SEQ("next",
182 ec_node_clone(node->bin_ops[i]),
196 /* free the initial references */
197 ec_node_free(pre_op);
199 ec_node_free(post_op);
204 /* no need to clone here, the node is not consumed */
205 if (ec_node_weakref_set(weak, expr) < 0)
217 ec_node_free(pre_op);
218 ec_node_free(post_op);
225 static struct ec_node_type ec_node_expr_type = {
227 .build = ec_node_expr_build,
228 .parse = ec_node_expr_parse,
229 .complete = ec_node_expr_complete,
230 .size = sizeof(struct ec_node_expr),
231 .free_priv = ec_node_expr_free_priv,
234 EC_NODE_TYPE_REGISTER(ec_node_expr_type);
236 int ec_node_expr_set_val_node(struct ec_node *gen_node, struct ec_node *val_node)
238 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
242 if (val_node == NULL)
245 if (gen_node->flags & EC_NODE_F_BUILT)
248 if (node->val_node != NULL)
251 node->val_node = val_node;
252 gen_node->flags &= ~EC_NODE_F_BUILT;
257 ec_node_free(val_node);
261 /* add a binary operator */
262 int ec_node_expr_add_bin_op(struct ec_node *gen_node, struct ec_node *op)
264 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
265 struct ec_node **bin_ops;
268 // XXX check node type
271 if (node == NULL || op == NULL)
274 if (gen_node->flags & EC_NODE_F_BUILT)
278 bin_ops = ec_realloc(node->bin_ops,
279 (node->bin_ops_len + 1) * sizeof(*node->bin_ops));
283 node->bin_ops = bin_ops;
284 bin_ops[node->bin_ops_len] = op;
286 gen_node->flags &= ~EC_NODE_F_BUILT;
295 /* add a unary pre-operator */
296 int ec_node_expr_add_pre_op(struct ec_node *gen_node, struct ec_node *op)
298 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
299 struct ec_node **pre_ops;
302 // XXX check node type
305 if (node == NULL || op == NULL)
308 if (gen_node->flags & EC_NODE_F_BUILT)
312 pre_ops = ec_realloc(node->pre_ops,
313 (node->pre_ops_len + 1) * sizeof(*node->pre_ops));
317 node->pre_ops = pre_ops;
318 pre_ops[node->pre_ops_len] = op;
320 gen_node->flags &= ~EC_NODE_F_BUILT;
329 /* add a unary post-operator */
330 int ec_node_expr_add_post_op(struct ec_node *gen_node, struct ec_node *op)
332 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
333 struct ec_node **post_ops;
336 // XXX check node type
339 if (node == NULL || op == NULL)
342 if (gen_node->flags & EC_NODE_F_BUILT)
346 post_ops = ec_realloc(node->post_ops,
347 (node->post_ops_len + 1) * sizeof(*node->post_ops));
348 if (post_ops == NULL)
351 node->post_ops = post_ops;
352 post_ops[node->post_ops_len] = op;
353 node->post_ops_len++;
354 gen_node->flags &= ~EC_NODE_F_BUILT;
363 /* add parenthesis symbols */
364 int ec_node_expr_add_parenthesis(struct ec_node *gen_node,
365 struct ec_node *open, struct ec_node *close)
367 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
368 struct ec_node **open_ops, **close_ops;
371 // XXX check node type
374 if (node == NULL || open == NULL || close == NULL)
377 if (gen_node->flags & EC_NODE_F_BUILT)
381 open_ops = ec_realloc(node->open_ops,
382 (node->paren_len + 1) * sizeof(*node->open_ops));
383 if (open_ops == NULL)
385 close_ops = ec_realloc(node->close_ops,
386 (node->paren_len + 1) * sizeof(*node->close_ops));
387 if (close_ops == NULL)
390 node->open_ops = open_ops;
391 node->close_ops = close_ops;
392 open_ops[node->paren_len] = open;
393 close_ops[node->paren_len] = close;
395 gen_node->flags &= ~EC_NODE_F_BUILT;
405 enum expr_node_type {
414 static enum expr_node_type get_node_type(const struct ec_node *expr_gen_node,
415 const struct ec_node *check)
417 struct ec_node_expr *expr_node = (struct ec_node_expr *)expr_gen_node;
420 if (check == expr_node->val_node)
423 for (i = 0; i < expr_node->bin_ops_len; i++) {
424 if (check == expr_node->bin_ops[i])
427 for (i = 0; i < expr_node->pre_ops_len; i++) {
428 if (check == expr_node->pre_ops[i])
431 for (i = 0; i < expr_node->post_ops_len; i++) {
432 if (check == expr_node->post_ops[i])
436 for (i = 0; i < expr_node->paren_len; i++) {
437 if (check == expr_node->open_ops[i])
440 for (i = 0; i < expr_node->paren_len; i++) {
441 if (check == expr_node->close_ops[i])
451 const struct ec_parsed *op;
452 enum expr_node_type op_type;
455 /* merge x and y results in x */
456 static int merge_results(void *userctx,
457 const struct ec_node_expr_eval_ops *ops,
458 struct result *x, const struct result *y)
462 if (y->has_val == 0 && y->op == NULL)
464 if (x->has_val == 0 && x->op == NULL) {
469 if (x->has_val && y->has_val && y->op != NULL) {
470 if (y->op_type == BIN_OP) {
471 ret = ops->eval_bin_op(&x->val, userctx, x->val,
480 if (x->has_val == 0 && x->op != NULL && y->has_val && y->op == NULL) {
481 if (x->op_type == PRE_OP) {
482 ret = ops->eval_pre_op(&x->val, userctx, y->val, x->op);
489 } else if (x->op_type == BIN_OP) {
496 if (x->has_val && x->op == NULL && y->has_val == 0 && y->op != NULL) {
497 ret = ops->eval_post_op(&x->val, userctx, x->val, y->op);
504 assert(false); /* we should not get here */
508 static int eval_expression(struct result *result,
510 const struct ec_node_expr_eval_ops *ops,
511 const struct ec_node *expr_gen_node,
512 const struct ec_parsed *parsed)
515 struct ec_parsed *open = NULL, *close = NULL;
516 struct result child_result;
517 struct ec_parsed *child;
518 enum expr_node_type type;
521 memset(result, 0, sizeof(*result));
522 memset(&child_result, 0, sizeof(child_result));
524 type = get_node_type(expr_gen_node, parsed->node);
526 ret = ops->eval_var(&result->val, userctx, parsed);
530 } else if (type == PRE_OP || type == POST_OP || type == BIN_OP) {
532 result->op_type = type;
535 TAILQ_FOREACH(child, &parsed->children, next) {
537 type = get_node_type(expr_gen_node, child->node);
538 if (type == PAREN_OPEN) {
541 } else if (type == PAREN_CLOSE) {
546 ret = eval_expression(&child_result, userctx, ops,
547 expr_gen_node, child);
551 ret = merge_results(userctx, ops, result, &child_result);
555 memset(&child_result, 0, sizeof(child_result));
558 if (open != NULL && close != NULL) {
559 ret = ops->eval_parenthesis(&result->val, userctx, open, close,
569 ops->eval_free(result->val, userctx);
570 if (child_result.has_val)
571 ops->eval_free(child_result.val, userctx);
572 memset(result, 0, sizeof(*result));
577 int ec_node_expr_eval(void **user_result, const struct ec_node *node,
578 struct ec_parsed *parsed, const struct ec_node_expr_eval_ops *ops,
581 struct result result;
584 if (ops == NULL || ops->eval_var == NULL || ops->eval_pre_op == NULL ||
585 ops->eval_post_op == NULL || ops->eval_bin_op == NULL ||
586 ops->eval_parenthesis == NULL || ops->eval_free == NULL)
589 if (!ec_parsed_matches(parsed))
592 ec_parsed_dump(stdout, parsed); //XXX
593 ret = eval_expression(&result, userctx, ops, node, parsed);
597 assert(result.has_val);
598 assert(result.op == NULL);
599 *user_result = result.val;
604 /* the test case is in a separate file ecoli_node_expr_test.c */