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_node_seq.h>
43 #include <ecoli_node_many.h>
44 #include <ecoli_node_or.h>
45 #include <ecoli_node_weakref.h>
46 #include <ecoli_node_expr.h>
52 struct ec_node *child;
54 /* the configuration nodes */
55 struct ec_node *val_node;
56 struct ec_node **bin_ops;
57 unsigned int bin_ops_len;
58 struct ec_node **pre_ops;
59 unsigned int pre_ops_len;
60 struct ec_node **post_ops;
61 unsigned int post_ops_len;
62 struct ec_node **open_ops;
63 struct ec_node **close_ops;
64 unsigned int paren_len;
67 static struct ec_parsed *ec_node_expr_parse(const struct ec_node *gen_node,
68 const struct ec_strvec *strvec)
70 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
72 return ec_node_parse_strvec(node->child, strvec);
75 static struct ec_completed *ec_node_expr_complete(const struct ec_node *gen_node,
76 const struct ec_strvec *strvec)
78 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
80 return ec_node_complete_strvec(node->child, strvec);
83 static void ec_node_expr_free_priv(struct ec_node *gen_node)
85 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
88 ec_log(EC_LOG_DEBUG, "free %p %p %p\n", node, node->child, node->val_node);
89 ec_node_free(node->val_node);
91 for (i = 0; i < node->bin_ops_len; i++)
92 ec_node_free(node->bin_ops[i]);
93 ec_free(node->bin_ops);
94 for (i = 0; i < node->pre_ops_len; i++)
95 ec_node_free(node->pre_ops[i]);
96 ec_free(node->pre_ops);
97 for (i = 0; i < node->post_ops_len; i++)
98 ec_node_free(node->post_ops[i]);
99 ec_free(node->post_ops);
100 for (i = 0; i < node->paren_len; i++) {
101 ec_node_free(node->open_ops[i]);
102 ec_node_free(node->close_ops[i]);
104 ec_free(node->open_ops);
105 ec_free(node->close_ops);
107 ec_node_free(node->child);
110 static int ec_node_expr_build(struct ec_node *gen_node)
112 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
113 struct ec_node *term = NULL, *expr = NULL, *next = NULL,
114 *pre_op = NULL, *post_op = NULL,
115 *post = NULL, *weak = NULL;
119 if (node->val_node == NULL)
121 if (node->bin_ops_len == 0 && node->pre_ops_len == 0 &&
122 node->post_ops_len == 0)
125 /* create the object, we will initialize it later: this is
126 * needed because we have a circular dependency */
128 weak = ec_node("weakref", "weak");
132 /* prefix unary operators */
133 pre_op = ec_node("or", "pre-op");
136 for (i = 0; i < node->pre_ops_len; i++) {
137 if (ec_node_or_add(pre_op, ec_node_clone(node->pre_ops[i])) < 0)
141 /* suffix unary operators */
142 post_op = ec_node("or", "post-op");
145 for (i = 0; i < node->post_ops_len; i++) {
146 if (ec_node_or_add(post_op, ec_node_clone(node->post_ops[i])) < 0)
150 post = ec_node("or", "post");
153 if (ec_node_or_add(post, ec_node_clone(node->val_node)) < 0)
155 if (ec_node_or_add(post,
157 ec_node_clone(pre_op),
158 ec_node_clone(weak))) < 0)
160 for (i = 0; i < node->paren_len; i++) {
161 if (ec_node_or_add(post, EC_NODE_SEQ(NULL,
162 ec_node_clone(node->open_ops[i]),
164 ec_node_clone(node->close_ops[i]))) < 0)
167 term = EC_NODE_SEQ("term",
169 ec_node_many(NULL, ec_node_clone(post_op), 0, 0)
174 for (i = 0; i < node->bin_ops_len; i++) {
175 next = EC_NODE_SEQ("next",
179 ec_node_clone(node->bin_ops[i]),
193 /* free the initial references */
194 ec_node_free(pre_op);
196 ec_node_free(post_op);
201 /* no need to clone here, the node is not consumed */
202 if (ec_node_weakref_set(weak, expr) < 0)
214 ec_node_free(pre_op);
215 ec_node_free(post_op);
222 static struct ec_node_type ec_node_expr_type = {
224 .build = ec_node_expr_build,
225 .parse = ec_node_expr_parse,
226 .complete = ec_node_expr_complete,
227 .size = sizeof(struct ec_node_expr),
228 .free_priv = ec_node_expr_free_priv,
231 EC_NODE_TYPE_REGISTER(ec_node_expr_type);
233 int ec_node_expr_set_val_node(struct ec_node *gen_node, struct ec_node *val_node)
235 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
239 if (val_node == NULL)
242 if (gen_node->flags & EC_NODE_F_BUILT)
245 if (node->val_node != NULL)
248 node->val_node = val_node;
249 gen_node->flags &= ~EC_NODE_F_BUILT;
254 ec_node_free(val_node);
258 /* add a binary operator */
259 int ec_node_expr_add_bin_op(struct ec_node *gen_node, struct ec_node *op)
261 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
262 struct ec_node **bin_ops;
265 // XXX check node type
268 if (node == NULL || op == NULL)
271 if (gen_node->flags & EC_NODE_F_BUILT)
275 bin_ops = ec_realloc(node->bin_ops,
276 (node->bin_ops_len + 1) * sizeof(*node->bin_ops));
280 node->bin_ops = bin_ops;
281 bin_ops[node->bin_ops_len] = op;
283 gen_node->flags &= ~EC_NODE_F_BUILT;
292 /* add a unary pre-operator */
293 int ec_node_expr_add_pre_op(struct ec_node *gen_node, struct ec_node *op)
295 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
296 struct ec_node **pre_ops;
299 // XXX check node type
302 if (node == NULL || op == NULL)
305 if (gen_node->flags & EC_NODE_F_BUILT)
309 pre_ops = ec_realloc(node->pre_ops,
310 (node->pre_ops_len + 1) * sizeof(*node->pre_ops));
314 node->pre_ops = pre_ops;
315 pre_ops[node->pre_ops_len] = op;
317 gen_node->flags &= ~EC_NODE_F_BUILT;
326 /* add a unary post-operator */
327 int ec_node_expr_add_post_op(struct ec_node *gen_node, struct ec_node *op)
329 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
330 struct ec_node **post_ops;
333 // XXX check node type
336 if (node == NULL || op == NULL)
339 if (gen_node->flags & EC_NODE_F_BUILT)
343 post_ops = ec_realloc(node->post_ops,
344 (node->post_ops_len + 1) * sizeof(*node->post_ops));
345 if (post_ops == NULL)
348 node->post_ops = post_ops;
349 post_ops[node->post_ops_len] = op;
350 node->post_ops_len++;
351 gen_node->flags &= ~EC_NODE_F_BUILT;
360 /* add parenthesis symbols */
361 int ec_node_expr_add_parenthesis(struct ec_node *gen_node,
362 struct ec_node *open, struct ec_node *close)
364 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
365 struct ec_node **open_ops, **close_ops;
368 // XXX check node type
371 if (node == NULL || open == NULL || close == NULL)
374 if (gen_node->flags & EC_NODE_F_BUILT)
378 open_ops = ec_realloc(node->open_ops,
379 (node->paren_len + 1) * sizeof(*node->open_ops));
380 if (open_ops == NULL)
382 close_ops = ec_realloc(node->close_ops,
383 (node->paren_len + 1) * sizeof(*node->close_ops));
384 if (close_ops == NULL)
387 node->open_ops = open_ops;
388 node->close_ops = close_ops;
389 open_ops[node->paren_len] = open;
390 close_ops[node->paren_len] = close;
392 gen_node->flags &= ~EC_NODE_F_BUILT;
402 enum expr_node_type {
411 static enum expr_node_type get_node_type(const struct ec_node *expr_gen_node,
412 const struct ec_node *check)
414 struct ec_node_expr *expr_node = (struct ec_node_expr *)expr_gen_node;
417 if (check == expr_node->val_node)
420 for (i = 0; i < expr_node->bin_ops_len; i++) {
421 if (check == expr_node->bin_ops[i])
424 for (i = 0; i < expr_node->pre_ops_len; i++) {
425 if (check == expr_node->pre_ops[i])
428 for (i = 0; i < expr_node->post_ops_len; i++) {
429 if (check == expr_node->post_ops[i])
433 for (i = 0; i < expr_node->paren_len; i++) {
434 if (check == expr_node->open_ops[i])
437 for (i = 0; i < expr_node->paren_len; i++) {
438 if (check == expr_node->close_ops[i])
448 const struct ec_parsed *op;
449 enum expr_node_type op_type;
452 /* merge x and y results in x */
453 static int merge_results(void *userctx,
454 const struct ec_node_expr_eval_ops *ops,
455 struct result *x, const struct result *y)
459 if (y->has_val == 0 && y->op == NULL)
461 if (x->has_val == 0 && x->op == NULL) {
466 if (x->has_val && x->op == NULL && y->has_val && y->op != NULL) {
467 ret = ops->eval_bin_op(&x->val, userctx, x->val, y->op, y->val);
474 if (x->has_val == 0 && x->op != NULL && y->has_val && y->op == NULL) {
475 if (x->op_type == PRE_OP) {
476 ret = ops->eval_pre_op(&x->val, userctx, y->val, x->op);
483 } else if (x->op_type == BIN_OP) {
490 if (x->has_val && x->op == NULL && y->has_val == 0 && y->op != NULL) {
491 ret = ops->eval_post_op(&x->val, userctx, x->val, y->op);
498 assert(true); /* we should not get here */
502 static int eval_expression(struct result *result,
504 const struct ec_node_expr_eval_ops *ops,
505 const struct ec_node *expr_gen_node,
506 const struct ec_parsed *parsed)
509 struct ec_parsed *open = NULL, *close = NULL;
510 struct result child_result;
511 struct ec_parsed *child;
512 enum expr_node_type type;
515 memset(result, 0, sizeof(*result));
516 memset(&child_result, 0, sizeof(child_result));
518 type = get_node_type(expr_gen_node, parsed->node);
520 ret = ops->eval_var(&result->val, userctx, parsed);
524 } else if (type == PRE_OP || type == POST_OP || type == BIN_OP) {
526 result->op_type = type;
529 TAILQ_FOREACH(child, &parsed->children, next) {
531 type = get_node_type(expr_gen_node, child->node);
532 if (type == PAREN_OPEN) {
535 } else if (type == PAREN_CLOSE) {
540 ret = eval_expression(&child_result, userctx, ops,
541 expr_gen_node, child);
545 ret = merge_results(userctx, ops, result, &child_result);
549 memset(&child_result, 0, sizeof(child_result));
552 if (open != NULL && close != NULL) {
553 ret = ops->eval_parenthesis(&result->val, userctx, open, close,
563 ops->eval_free(result->val, userctx);
564 if (child_result.has_val)
565 ops->eval_free(child_result.val, userctx);
566 memset(result, 0, sizeof(*result));
571 int ec_node_expr_eval(void **user_result, const struct ec_node *node,
572 struct ec_parsed *parsed, const struct ec_node_expr_eval_ops *ops,
575 struct result result;
578 if (ops == NULL || ops->eval_var == NULL || ops->eval_pre_op == NULL ||
579 ops->eval_post_op == NULL || ops->eval_bin_op == NULL ||
580 ops->eval_parenthesis == NULL || ops->eval_free == NULL)
583 if (!ec_parsed_matches(parsed))
586 ec_parsed_dump(stdout, parsed); //XXX
587 ret = eval_expression(&result, userctx, ops, node, parsed);
591 assert(result.has_val);
592 assert(result.op == NULL);
593 *user_result = result.val;
598 /* the test case is in a separate file ecoli_node_expr_test.c */