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);
79 ec_node_expr_complete(const struct ec_node *gen_node,
80 struct ec_completed *completed,
81 struct ec_parsed *parsed,
82 const struct ec_strvec *strvec)
84 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
86 return ec_node_complete_child(node->child, completed, parsed, strvec);
89 static void ec_node_expr_free_priv(struct ec_node *gen_node)
91 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
94 ec_log(EC_LOG_DEBUG, "free %p %p %p\n", node, node->child, node->val_node);
95 ec_node_free(node->val_node);
97 for (i = 0; i < node->bin_ops_len; i++)
98 ec_node_free(node->bin_ops[i]);
99 ec_free(node->bin_ops);
100 for (i = 0; i < node->pre_ops_len; i++)
101 ec_node_free(node->pre_ops[i]);
102 ec_free(node->pre_ops);
103 for (i = 0; i < node->post_ops_len; i++)
104 ec_node_free(node->post_ops[i]);
105 ec_free(node->post_ops);
106 for (i = 0; i < node->paren_len; i++) {
107 ec_node_free(node->open_ops[i]);
108 ec_node_free(node->close_ops[i]);
110 ec_free(node->open_ops);
111 ec_free(node->close_ops);
113 ec_node_free(node->child);
116 static int ec_node_expr_build(struct ec_node *gen_node)
118 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
119 struct ec_node *term = NULL, *expr = NULL, *next = NULL,
120 *pre_op = NULL, *post_op = NULL,
121 *post = NULL, *weak = NULL;
125 if (node->val_node == NULL)
127 if (node->bin_ops_len == 0 && node->pre_ops_len == 0 &&
128 node->post_ops_len == 0)
131 /* create the object, we will initialize it later: this is
132 * needed because we have a circular dependency */
134 weak = ec_node("weakref", "weak");
138 /* prefix unary operators */
139 pre_op = ec_node("or", "pre-op");
142 for (i = 0; i < node->pre_ops_len; i++) {
143 if (ec_node_or_add(pre_op, ec_node_clone(node->pre_ops[i])) < 0)
147 /* suffix unary operators */
148 post_op = ec_node("or", "post-op");
151 for (i = 0; i < node->post_ops_len; i++) {
152 if (ec_node_or_add(post_op, ec_node_clone(node->post_ops[i])) < 0)
156 post = ec_node("or", "post");
159 if (ec_node_or_add(post, ec_node_clone(node->val_node)) < 0)
161 if (ec_node_or_add(post,
163 ec_node_clone(pre_op),
164 ec_node_clone(weak))) < 0)
166 for (i = 0; i < node->paren_len; i++) {
167 if (ec_node_or_add(post, EC_NODE_SEQ(NULL,
168 ec_node_clone(node->open_ops[i]),
170 ec_node_clone(node->close_ops[i]))) < 0)
173 term = EC_NODE_SEQ("term",
175 ec_node_many(NULL, ec_node_clone(post_op), 0, 0)
180 for (i = 0; i < node->bin_ops_len; i++) {
181 next = EC_NODE_SEQ("next",
185 ec_node_clone(node->bin_ops[i]),
199 /* free the initial references */
200 ec_node_free(pre_op);
202 ec_node_free(post_op);
207 /* no need to clone here, the node is not consumed */
208 if (ec_node_weakref_set(weak, expr) < 0)
214 ec_node_dump(stdout, node->child); //XXX
221 ec_node_free(pre_op);
222 ec_node_free(post_op);
229 static struct ec_node_type ec_node_expr_type = {
231 .build = ec_node_expr_build,
232 .parse = ec_node_expr_parse,
233 .complete = ec_node_expr_complete,
234 .size = sizeof(struct ec_node_expr),
235 .free_priv = ec_node_expr_free_priv,
238 EC_NODE_TYPE_REGISTER(ec_node_expr_type);
240 int ec_node_expr_set_val_node(struct ec_node *gen_node, struct ec_node *val_node)
242 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
246 if (val_node == NULL)
249 if (gen_node->flags & EC_NODE_F_BUILT)
252 if (node->val_node != NULL)
255 node->val_node = val_node;
256 gen_node->flags &= ~EC_NODE_F_BUILT;
261 ec_node_free(val_node);
265 /* add a binary operator */
266 int ec_node_expr_add_bin_op(struct ec_node *gen_node, struct ec_node *op)
268 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
269 struct ec_node **bin_ops;
272 // XXX check node type
275 if (node == NULL || op == NULL)
278 if (gen_node->flags & EC_NODE_F_BUILT)
282 bin_ops = ec_realloc(node->bin_ops,
283 (node->bin_ops_len + 1) * sizeof(*node->bin_ops));
287 node->bin_ops = bin_ops;
288 bin_ops[node->bin_ops_len] = op;
290 gen_node->flags &= ~EC_NODE_F_BUILT;
299 /* add a unary pre-operator */
300 int ec_node_expr_add_pre_op(struct ec_node *gen_node, struct ec_node *op)
302 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
303 struct ec_node **pre_ops;
306 // XXX check node type
309 if (node == NULL || op == NULL)
312 if (gen_node->flags & EC_NODE_F_BUILT)
316 pre_ops = ec_realloc(node->pre_ops,
317 (node->pre_ops_len + 1) * sizeof(*node->pre_ops));
321 node->pre_ops = pre_ops;
322 pre_ops[node->pre_ops_len] = op;
324 gen_node->flags &= ~EC_NODE_F_BUILT;
333 /* add a unary post-operator */
334 int ec_node_expr_add_post_op(struct ec_node *gen_node, struct ec_node *op)
336 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
337 struct ec_node **post_ops;
340 // XXX check node type
343 if (node == NULL || op == NULL)
346 if (gen_node->flags & EC_NODE_F_BUILT)
350 post_ops = ec_realloc(node->post_ops,
351 (node->post_ops_len + 1) * sizeof(*node->post_ops));
352 if (post_ops == NULL)
355 node->post_ops = post_ops;
356 post_ops[node->post_ops_len] = op;
357 node->post_ops_len++;
358 gen_node->flags &= ~EC_NODE_F_BUILT;
367 /* add parenthesis symbols */
368 int ec_node_expr_add_parenthesis(struct ec_node *gen_node,
369 struct ec_node *open, struct ec_node *close)
371 struct ec_node_expr *node = (struct ec_node_expr *)gen_node;
372 struct ec_node **open_ops, **close_ops;
375 // XXX check node type
378 if (node == NULL || open == NULL || close == NULL)
381 if (gen_node->flags & EC_NODE_F_BUILT)
385 open_ops = ec_realloc(node->open_ops,
386 (node->paren_len + 1) * sizeof(*node->open_ops));
387 if (open_ops == NULL)
389 close_ops = ec_realloc(node->close_ops,
390 (node->paren_len + 1) * sizeof(*node->close_ops));
391 if (close_ops == NULL)
394 node->open_ops = open_ops;
395 node->close_ops = close_ops;
396 open_ops[node->paren_len] = open;
397 close_ops[node->paren_len] = close;
399 gen_node->flags &= ~EC_NODE_F_BUILT;
409 enum expr_node_type {
418 static enum expr_node_type get_node_type(const struct ec_node *expr_gen_node,
419 const struct ec_node *check)
421 struct ec_node_expr *expr_node = (struct ec_node_expr *)expr_gen_node;
424 if (check == expr_node->val_node)
427 for (i = 0; i < expr_node->bin_ops_len; i++) {
428 if (check == expr_node->bin_ops[i])
431 for (i = 0; i < expr_node->pre_ops_len; i++) {
432 if (check == expr_node->pre_ops[i])
435 for (i = 0; i < expr_node->post_ops_len; i++) {
436 if (check == expr_node->post_ops[i])
440 for (i = 0; i < expr_node->paren_len; i++) {
441 if (check == expr_node->open_ops[i])
444 for (i = 0; i < expr_node->paren_len; i++) {
445 if (check == expr_node->close_ops[i])
455 const struct ec_parsed *op;
456 enum expr_node_type op_type;
459 /* merge x and y results in x */
460 static int merge_results(void *userctx,
461 const struct ec_node_expr_eval_ops *ops,
462 struct result *x, const struct result *y)
466 if (y->has_val == 0 && y->op == NULL)
468 if (x->has_val == 0 && x->op == NULL) {
473 if (x->has_val && y->has_val && y->op != NULL) {
474 if (y->op_type == BIN_OP) {
475 ret = ops->eval_bin_op(&x->val, userctx, x->val,
484 if (x->has_val == 0 && x->op != NULL && y->has_val && y->op == NULL) {
485 if (x->op_type == PRE_OP) {
486 ret = ops->eval_pre_op(&x->val, userctx, y->val, x->op);
493 } else if (x->op_type == BIN_OP) {
500 if (x->has_val && x->op == NULL && y->has_val == 0 && y->op != NULL) {
501 ret = ops->eval_post_op(&x->val, userctx, x->val, y->op);
508 assert(false); /* we should not get here */
512 static int eval_expression(struct result *result,
514 const struct ec_node_expr_eval_ops *ops,
515 const struct ec_node *expr_gen_node,
516 const struct ec_parsed *parsed)
519 struct ec_parsed *open = NULL, *close = NULL;
520 struct result child_result;
521 struct ec_parsed *child;
522 enum expr_node_type type;
525 memset(result, 0, sizeof(*result));
526 memset(&child_result, 0, sizeof(child_result));
528 type = get_node_type(expr_gen_node, parsed->node);
530 ret = ops->eval_var(&result->val, userctx, parsed);
534 } else if (type == PRE_OP || type == POST_OP || type == BIN_OP) {
536 result->op_type = type;
539 TAILQ_FOREACH(child, &parsed->children, next) {
541 type = get_node_type(expr_gen_node, child->node);
542 if (type == PAREN_OPEN) {
545 } else if (type == PAREN_CLOSE) {
550 ret = eval_expression(&child_result, userctx, ops,
551 expr_gen_node, child);
555 ret = merge_results(userctx, ops, result, &child_result);
559 memset(&child_result, 0, sizeof(child_result));
562 if (open != NULL && close != NULL) {
563 ret = ops->eval_parenthesis(&result->val, userctx, open, close,
573 ops->eval_free(result->val, userctx);
574 if (child_result.has_val)
575 ops->eval_free(child_result.val, userctx);
576 memset(result, 0, sizeof(*result));
581 int ec_node_expr_eval(void **user_result, const struct ec_node *node,
582 struct ec_parsed *parsed, const struct ec_node_expr_eval_ops *ops,
585 struct result result;
588 if (ops == NULL || ops->eval_var == NULL || ops->eval_pre_op == NULL ||
589 ops->eval_post_op == NULL || ops->eval_bin_op == NULL ||
590 ops->eval_parenthesis == NULL || ops->eval_free == NULL)
593 if (!ec_parsed_matches(parsed))
596 ec_parsed_dump(stdout, parsed); //XXX
597 ret = eval_expression(&result, userctx, ops, node, parsed);
601 assert(result.has_val);
602 assert(result.op == NULL);
603 *user_result = result.val;
608 /* the test case is in a separate file ecoli_node_expr_test.c */