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>
50 EC_LOG_TYPE_REGISTER(node_expr);
56 struct ec_node *child;
58 /* the configuration nodes */
59 struct ec_node *val_node;
60 struct ec_node **bin_ops;
61 unsigned int bin_ops_len;
62 struct ec_node **pre_ops;
63 unsigned int pre_ops_len;
64 struct ec_node **post_ops;
65 unsigned int post_ops_len;
66 struct ec_node **open_ops;
67 struct ec_node **close_ops;
68 unsigned int paren_len;
71 static int ec_node_expr_parse(const struct ec_node *gen_node,
72 struct ec_parsed *state,
73 const struct ec_strvec *strvec)
75 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
77 return ec_node_parse_child(node->child, state, strvec);
81 ec_node_expr_complete(const struct ec_node *gen_node,
82 struct ec_completed *completed,
83 struct ec_parsed *parsed,
84 const struct ec_strvec *strvec)
86 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
88 return ec_node_complete_child(node->child, completed, parsed, strvec);
91 static void ec_node_expr_free_priv(struct ec_node *gen_node)
93 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
96 EC_LOG(EC_LOG_DEBUG, "free %p %p %p\n", node, node->child, node->val_node);
97 ec_node_free(node->val_node);
99 for (i = 0; i < node->bin_ops_len; i++)
100 ec_node_free(node->bin_ops[i]);
101 ec_free(node->bin_ops);
102 for (i = 0; i < node->pre_ops_len; i++)
103 ec_node_free(node->pre_ops[i]);
104 ec_free(node->pre_ops);
105 for (i = 0; i < node->post_ops_len; i++)
106 ec_node_free(node->post_ops[i]);
107 ec_free(node->post_ops);
108 for (i = 0; i < node->paren_len; i++) {
109 ec_node_free(node->open_ops[i]);
110 ec_node_free(node->close_ops[i]);
112 ec_free(node->open_ops);
113 ec_free(node->close_ops);
115 ec_node_free(node->child);
118 static int ec_node_expr_build(struct ec_node *gen_node)
120 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
121 struct ec_node *term = NULL, *expr = NULL, *next = NULL,
122 *pre_op = NULL, *post_op = NULL,
123 *post = NULL, *weak = NULL;
127 if (node->val_node == NULL)
129 if (node->bin_ops_len == 0 && node->pre_ops_len == 0 &&
130 node->post_ops_len == 0)
133 /* create the object, we will initialize it later: this is
134 * needed because we have a circular dependency */
136 weak = ec_node("weakref", "weak");
140 /* prefix unary operators */
141 pre_op = ec_node("or", "pre-op");
144 for (i = 0; i < node->pre_ops_len; i++) {
145 if (ec_node_or_add(pre_op, ec_node_clone(node->pre_ops[i])) < 0)
149 /* suffix unary operators */
150 post_op = ec_node("or", "post-op");
153 for (i = 0; i < node->post_ops_len; i++) {
154 if (ec_node_or_add(post_op, ec_node_clone(node->post_ops[i])) < 0)
158 post = ec_node("or", "post");
161 if (ec_node_or_add(post, ec_node_clone(node->val_node)) < 0)
163 if (ec_node_or_add(post,
165 ec_node_clone(pre_op),
166 ec_node_clone(weak))) < 0)
168 for (i = 0; i < node->paren_len; i++) {
169 if (ec_node_or_add(post, EC_NODE_SEQ(NULL,
170 ec_node_clone(node->open_ops[i]),
172 ec_node_clone(node->close_ops[i]))) < 0)
175 term = EC_NODE_SEQ("term",
177 ec_node_many(NULL, ec_node_clone(post_op), 0, 0)
182 for (i = 0; i < node->bin_ops_len; i++) {
183 next = EC_NODE_SEQ("next",
187 ec_node_clone(node->bin_ops[i]),
201 /* free the initial references */
202 ec_node_free(pre_op);
204 ec_node_free(post_op);
209 /* no need to clone here, the node is not consumed */
210 if (ec_node_weakref_set(weak, expr) < 0)
216 ec_node_dump(stdout, node->child); //XXX
223 ec_node_free(pre_op);
224 ec_node_free(post_op);
231 static struct ec_node_type ec_node_expr_type = {
233 .build = ec_node_expr_build,
234 .parse = ec_node_expr_parse,
235 .complete = ec_node_expr_complete,
236 .size = sizeof(struct ec_node_expr),
237 .free_priv = ec_node_expr_free_priv,
240 EC_NODE_TYPE_REGISTER(ec_node_expr_type);
242 int ec_node_expr_set_val_node(struct ec_node *gen_node, struct ec_node *val_node)
244 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
248 if (val_node == NULL)
251 if (gen_node->flags & EC_NODE_F_BUILT)
254 if (node->val_node != NULL)
257 node->val_node = val_node;
258 gen_node->flags &= ~EC_NODE_F_BUILT;
263 ec_node_free(val_node);
267 /* add a binary operator */
268 int ec_node_expr_add_bin_op(struct ec_node *gen_node, struct ec_node *op)
270 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
271 struct ec_node **bin_ops;
274 // XXX check node type
277 if (node == NULL || op == NULL)
280 if (gen_node->flags & EC_NODE_F_BUILT)
284 bin_ops = ec_realloc(node->bin_ops,
285 (node->bin_ops_len + 1) * sizeof(*node->bin_ops));
289 node->bin_ops = bin_ops;
290 bin_ops[node->bin_ops_len] = op;
292 gen_node->flags &= ~EC_NODE_F_BUILT;
301 /* add a unary pre-operator */
302 int ec_node_expr_add_pre_op(struct ec_node *gen_node, struct ec_node *op)
304 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
305 struct ec_node **pre_ops;
308 // XXX check node type
311 if (node == NULL || op == NULL)
314 if (gen_node->flags & EC_NODE_F_BUILT)
318 pre_ops = ec_realloc(node->pre_ops,
319 (node->pre_ops_len + 1) * sizeof(*node->pre_ops));
323 node->pre_ops = pre_ops;
324 pre_ops[node->pre_ops_len] = op;
326 gen_node->flags &= ~EC_NODE_F_BUILT;
335 /* add a unary post-operator */
336 int ec_node_expr_add_post_op(struct ec_node *gen_node, struct ec_node *op)
338 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
339 struct ec_node **post_ops;
342 // XXX check node type
345 if (node == NULL || op == NULL)
348 if (gen_node->flags & EC_NODE_F_BUILT)
352 post_ops = ec_realloc(node->post_ops,
353 (node->post_ops_len + 1) * sizeof(*node->post_ops));
354 if (post_ops == NULL)
357 node->post_ops = post_ops;
358 post_ops[node->post_ops_len] = op;
359 node->post_ops_len++;
360 gen_node->flags &= ~EC_NODE_F_BUILT;
369 /* add parenthesis symbols */
370 int ec_node_expr_add_parenthesis(struct ec_node *gen_node,
371 struct ec_node *open, struct ec_node *close)
373 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
374 struct ec_node **open_ops, **close_ops;
377 // XXX check node type
380 if (node == NULL || open == NULL || close == NULL)
383 if (gen_node->flags & EC_NODE_F_BUILT)
387 open_ops = ec_realloc(node->open_ops,
388 (node->paren_len + 1) * sizeof(*node->open_ops));
389 if (open_ops == NULL)
391 close_ops = ec_realloc(node->close_ops,
392 (node->paren_len + 1) * sizeof(*node->close_ops));
393 if (close_ops == NULL)
396 node->open_ops = open_ops;
397 node->close_ops = close_ops;
398 open_ops[node->paren_len] = open;
399 close_ops[node->paren_len] = close;
401 gen_node->flags &= ~EC_NODE_F_BUILT;
411 enum expr_node_type {
420 static enum expr_node_type get_node_type(const struct ec_node *expr_gen_node,
421 const struct ec_node *check)
423 struct ec_node_expr *expr_node = (struct ec_node_expr *)expr_gen_node;
426 if (check == expr_node->val_node)
429 for (i = 0; i < expr_node->bin_ops_len; i++) {
430 if (check == expr_node->bin_ops[i])
433 for (i = 0; i < expr_node->pre_ops_len; i++) {
434 if (check == expr_node->pre_ops[i])
437 for (i = 0; i < expr_node->post_ops_len; i++) {
438 if (check == expr_node->post_ops[i])
442 for (i = 0; i < expr_node->paren_len; i++) {
443 if (check == expr_node->open_ops[i])
446 for (i = 0; i < expr_node->paren_len; i++) {
447 if (check == expr_node->close_ops[i])
457 const struct ec_parsed *op;
458 enum expr_node_type op_type;
461 /* merge x and y results in x */
462 static int merge_results(void *userctx,
463 const struct ec_node_expr_eval_ops *ops,
464 struct result *x, const struct result *y)
468 if (y->has_val == 0 && y->op == NULL)
470 if (x->has_val == 0 && x->op == NULL) {
475 if (x->has_val && y->has_val && y->op != NULL) {
476 if (y->op_type == BIN_OP) {
477 ret = ops->eval_bin_op(&x->val, userctx, x->val,
486 if (x->has_val == 0 && x->op != NULL && y->has_val && y->op == NULL) {
487 if (x->op_type == PRE_OP) {
488 ret = ops->eval_pre_op(&x->val, userctx, y->val, x->op);
495 } else if (x->op_type == BIN_OP) {
502 if (x->has_val && x->op == NULL && y->has_val == 0 && y->op != NULL) {
503 ret = ops->eval_post_op(&x->val, userctx, x->val, y->op);
510 assert(false); /* we should not get here */
514 static int eval_expression(struct result *result,
516 const struct ec_node_expr_eval_ops *ops,
517 const struct ec_node *expr_gen_node,
518 const struct ec_parsed *parsed)
521 struct ec_parsed *open = NULL, *close = NULL;
522 struct result child_result;
523 struct ec_parsed *child;
524 enum expr_node_type type;
527 memset(result, 0, sizeof(*result));
528 memset(&child_result, 0, sizeof(child_result));
530 type = get_node_type(expr_gen_node, parsed->node);
532 ret = ops->eval_var(&result->val, userctx, parsed);
536 } else if (type == PRE_OP || type == POST_OP || type == BIN_OP) {
538 result->op_type = type;
541 TAILQ_FOREACH(child, &parsed->children, next) {
543 type = get_node_type(expr_gen_node, child->node);
544 if (type == PAREN_OPEN) {
547 } else if (type == PAREN_CLOSE) {
552 ret = eval_expression(&child_result, userctx, ops,
553 expr_gen_node, child);
557 ret = merge_results(userctx, ops, result, &child_result);
561 memset(&child_result, 0, sizeof(child_result));
564 if (open != NULL && close != NULL) {
565 ret = ops->eval_parenthesis(&result->val, userctx, open, close,
575 ops->eval_free(result->val, userctx);
576 if (child_result.has_val)
577 ops->eval_free(child_result.val, userctx);
578 memset(result, 0, sizeof(*result));
583 int ec_node_expr_eval(void **user_result, const struct ec_node *node,
584 struct ec_parsed *parsed, const struct ec_node_expr_eval_ops *ops,
587 struct result result;
590 if (ops == NULL || ops->eval_var == NULL || ops->eval_pre_op == NULL ||
591 ops->eval_post_op == NULL || ops->eval_bin_op == NULL ||
592 ops->eval_parenthesis == NULL || ops->eval_free == NULL)
595 if (!ec_parsed_matches(parsed))
598 ec_parsed_dump(stdout, parsed); //XXX
599 ret = eval_expression(&result, userctx, ops, node, parsed);
603 assert(result.has_val);
604 assert(result.op == NULL);
605 *user_result = result.val;
610 /* the test case is in a separate file ecoli_node_expr_test.c */