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.
28 #include <sys/queue.h>
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_expr.h>
45 #include <ecoli_node_str.h>
46 #include <ecoli_node_or.h>
47 #include <ecoli_node_subset.h>
48 #include <ecoli_node_int.h>
49 #include <ecoli_node_many.h>
50 #include <ecoli_node_seq.h>
51 #include <ecoli_node_option.h>
52 #include <ecoli_node_re.h>
53 #include <ecoli_node_re_lex.h>
54 #include <ecoli_node_cmd.h>
58 char *cmd_str; /* the command string. */
59 struct ec_node *cmd; /* the command node. */
60 struct ec_node *lex; /* the lexer node. */
61 struct ec_node *expr; /* the expression parser. */
62 struct ec_node **table; /* table of node referenced in command. */
63 unsigned int len; /* len of the table. */
67 ec_node_cmd_eval_var(void **result, void *userctx,
68 const struct ec_parsed *var)
70 const struct ec_strvec *vec;
71 struct ec_node_cmd *node = userctx;
72 struct ec_node *eval = NULL;
78 /* get parsed string vector, it should contain only one str */
79 vec = ec_parsed_strvec(var);
80 if (ec_strvec_len(vec) != 1)
82 str = ec_strvec_val(vec, 0);
84 for (i = 0; i < node->len; i++) {
85 id = ec_node_id(node->table[i]);
86 printf("i=%d id=%s\n", i, id);
91 /* if id matches, use a node provided by the user... */
92 eval = ec_node_clone(node->table[i]);
98 /* ...or create a string node */
100 eval = ec_node_str(NULL, str);
105 printf("eval var %s %p\n", str, eval);
112 ec_node_cmd_eval_pre_op(void **result, void *userctx, void *operand,
113 const struct ec_parsed *operator)
124 ec_node_cmd_eval_post_op(void **result, void *userctx, void *operand,
125 const struct ec_parsed *operator)
127 const struct ec_strvec *vec;
128 struct ec_node *eval = operand;;
132 /* get parsed string vector, it should contain only one str */
133 vec = ec_parsed_strvec(operator);
134 if (ec_strvec_len(vec) != 1)
137 if (!strcmp(ec_strvec_val(vec, 0), "*"))
142 printf("eval post_op %p\n", eval);
149 ec_node_cmd_eval_bin_op(void **result, void *userctx, void *operand1,
150 const struct ec_parsed *operator, void *operand2)
153 const struct ec_strvec *vec;
154 struct ec_node *out = NULL;
155 struct ec_node *in1 = operand1;
156 struct ec_node *in2 = operand2;
160 printf("eval bin_op %p %p\n", in1, in2);
162 /* get parsed string vector, it should contain only one str */
163 vec = ec_parsed_strvec(operator);
164 if (ec_strvec_len(vec) != 1)
167 if (!strcmp(ec_strvec_val(vec, 0), "|")) {
168 out = EC_NODE_OR(NULL, ec_node_clone(in1), ec_node_clone(in2));
174 } else if (!strcmp(ec_strvec_val(vec, 0), ",")) {
175 if (!strcmp(in2->type->name, "subset")) {
176 if (ec_node_subset_add(in2, ec_node_clone(in1)) < 0)
181 out = EC_NODE_SUBSET(NULL, ec_node_clone(in1),
193 printf("eval bin_op out %p\n", *result);
199 ec_node_cmd_eval_parenthesis(void **result, void *userctx,
200 const struct ec_parsed *open_paren,
201 const struct ec_parsed *close_paren,
204 const struct ec_strvec *vec;
205 struct ec_node *in = value;;
206 struct ec_node *out = NULL;;
211 /* get parsed string vector, it should contain only one str */
212 vec = ec_parsed_strvec(open_paren);
213 if (ec_strvec_len(vec) != 1)
216 if (!strcmp(ec_strvec_val(vec, 0), "[")) {
217 out = ec_node_option(NULL, ec_node_clone(in));
221 } else if (!strcmp(ec_strvec_val(vec, 0), "(")) {
227 printf("eval paren\n");
234 ec_node_cmd_eval_free(void *result, void *userctx)
240 static const struct ec_node_expr_eval_ops test_ops = {
241 .eval_var = ec_node_cmd_eval_var,
242 .eval_pre_op = ec_node_cmd_eval_pre_op,
243 .eval_post_op = ec_node_cmd_eval_post_op,
244 .eval_bin_op = ec_node_cmd_eval_bin_op,
245 .eval_parenthesis = ec_node_cmd_eval_parenthesis,
246 .eval_free = ec_node_cmd_eval_free,
250 ec_node_cmd_parse(const struct ec_node *gen_node, struct ec_parsed *state,
251 const struct ec_strvec *strvec)
253 struct ec_node_cmd *node = (struct ec_node_cmd *)gen_node;
255 return ec_node_parse_child(node->cmd, state, strvec);
259 ec_node_cmd_complete(const struct ec_node *gen_node,
260 struct ec_completed *completed,
261 struct ec_parsed *parsed,
262 const struct ec_strvec *strvec)
264 struct ec_node_cmd *node = (struct ec_node_cmd *)gen_node;
266 return ec_node_complete_child(node->cmd, completed, parsed, strvec);
269 static void ec_node_cmd_free_priv(struct ec_node *gen_node)
271 struct ec_node_cmd *node = (struct ec_node_cmd *)gen_node;
274 ec_free(node->cmd_str);
275 ec_node_free(node->cmd);
276 ec_node_free(node->expr);
277 ec_node_free(node->lex);
278 for (i = 0; i < node->len; i++)
279 ec_node_free(node->table[i]);
280 ec_free(node->table);
283 static int ec_node_cmd_build(struct ec_node *gen_node)
285 struct ec_node *expr = NULL, *lex = NULL, *cmd = NULL;
286 struct ec_parsed *p, *child;
287 struct ec_node_cmd *node = (struct ec_node_cmd *)gen_node;
291 /* XXX the expr parser can be moved in the node init */
293 /* build the expression parser */
295 expr = ec_node("expr", "expr");
298 ret = ec_node_expr_set_val_node(expr, ec_node_re(NULL, "[a-zA-Z0-9]+"));
301 ret = ec_node_expr_add_bin_op(expr, ec_node_str(NULL, ","));
304 ret = ec_node_expr_add_bin_op(expr, ec_node_str(NULL, "|"));
307 ret = ec_node_expr_add_post_op(expr, ec_node_str(NULL, "+"));
310 ret = ec_node_expr_add_post_op(expr, ec_node_str(NULL, "*"));
313 ret = ec_node_expr_add_parenthesis(expr, ec_node_str(NULL, "["),
314 ec_node_str(NULL, "]"));
317 ec_node_expr_add_parenthesis(expr, ec_node_str(NULL, "("),
318 ec_node_str(NULL, ")"));
322 /* prepend a lexer and a "many" to the expression node */
324 lex = ec_node_re_lex(NULL,
325 ec_node_many(NULL, ec_node_clone(expr), 1, 0));
329 ret = ec_node_re_lex_add(lex, "[a-zA-Z0-9]+", 1);
332 ret = ec_node_re_lex_add(lex, "[*|,()]", 1);
335 ret = ec_node_re_lex_add(lex, "\\[", 1);
338 ret = ec_node_re_lex_add(lex, "\\]", 1);
341 ret = ec_node_re_lex_add(lex, "[ ]+", 0);
345 /* parse the command expression */
347 p = ec_node_parse(lex, node->cmd_str);
352 if (!ec_parsed_matches(p))
354 if (TAILQ_EMPTY(&p->children))
356 if (TAILQ_EMPTY(&TAILQ_FIRST(&p->children)->children))
360 cmd = ec_node("seq", NULL);
364 TAILQ_FOREACH(child, &TAILQ_FIRST(&p->children)->children, next) {
365 ret = ec_node_expr_eval(&result, expr, child,
369 ret = ec_node_seq_add(cmd, result);
375 ec_node_dump(stdout, cmd);
377 ec_node_free(node->expr);
379 ec_node_free(node->lex);
381 ec_node_free(node->cmd);
394 static struct ec_node_type ec_node_cmd_type = {
396 .build = ec_node_cmd_build,
397 .parse = ec_node_cmd_parse,
398 .complete = ec_node_cmd_complete,
399 .size = sizeof(struct ec_node_cmd),
400 .free_priv = ec_node_cmd_free_priv,
403 EC_NODE_TYPE_REGISTER(ec_node_cmd_type);
405 int ec_node_cmd_add_child(struct ec_node *gen_node, struct ec_node *child)
407 struct ec_node_cmd *node = (struct ec_node_cmd *)gen_node;
408 struct ec_node **table;
410 // XXX check node type
412 assert(node != NULL);
414 printf("add child %s\n", child->id);
418 gen_node->flags &= ~EC_NODE_F_BUILT;
420 table = ec_realloc(node->table, (node->len + 1) * sizeof(*node->table));
427 table[node->len] = child;
430 child->parent = gen_node;
431 TAILQ_INSERT_TAIL(&gen_node->children, child, next); // XXX really needed?
436 struct ec_node *ec_node_cmd(const char *id, const char *cmd_str)
438 struct ec_node *gen_node = NULL;
439 struct ec_node_cmd *node = NULL;
441 gen_node = __ec_node(&ec_node_cmd_type, id);
442 if (gen_node == NULL)
445 node = (struct ec_node_cmd *)gen_node;
446 node->cmd_str = ec_strdup(cmd_str);
447 if (node->cmd_str == NULL)
453 ec_node_free(gen_node);
457 struct ec_node *__ec_node_cmd(const char *id, const char *cmd, ...)
459 struct ec_node *gen_node = NULL;
460 struct ec_node_cmd *node = NULL;
461 struct ec_node *child;
467 gen_node = ec_node_cmd(id, cmd);
468 node = (struct ec_node_cmd *)gen_node;
472 for (child = va_arg(ap, struct ec_node *);
473 child != EC_NODE_ENDLIST;
474 child = va_arg(ap, struct ec_node *)) {
476 /* on error, don't quit the loop to avoid leaks */
477 if (fail == 1 || child == NULL ||
478 ec_node_cmd_add_child(&node->gen, child) < 0) {
491 ec_node_free(gen_node); /* will also free children */
496 /* LCOV_EXCL_START */
497 static int ec_node_cmd_testcase(void)
499 struct ec_node *node;
502 node = EC_NODE_CMD(NULL,
503 "command [option] (subset1, subset2, subset3) x|y",
504 ec_node_int("x", 0, 10, 10),
505 ec_node_int("y", 20, 30, 10)
508 ec_log(EC_LOG_ERR, "cannot create node\n");
511 ret |= EC_TEST_CHECK_PARSE(node, 2, "command", "1");
512 ret |= EC_TEST_CHECK_PARSE(node, 2, "command", "23");
513 ret |= EC_TEST_CHECK_PARSE(node, 3, "command", "option", "23");
514 ret |= EC_TEST_CHECK_PARSE(node, -1, "command", "15");
515 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
518 node = EC_NODE_CMD(NULL, "good morning [count] bob|bobby|michael",
519 ec_node_int("count", 0, 10, 10));
521 ec_log(EC_LOG_ERR, "cannot create node\n");
524 ret |= EC_TEST_CHECK_PARSE(node, 4, "good", "morning", "1", "bob");
526 ret |= EC_TEST_CHECK_COMPLETE(node,
528 "good", EC_NODE_ENDLIST,
530 ret |= EC_TEST_CHECK_COMPLETE(node,
531 "g", EC_NODE_ENDLIST,
532 "ood", EC_NODE_ENDLIST,
534 ret |= EC_TEST_CHECK_COMPLETE(node,
535 "good", "morning", "", EC_NODE_ENDLIST,
536 "bob", "bobby", "michael", EC_NODE_ENDLIST,
545 static struct ec_test ec_node_cmd_test = {
547 .test = ec_node_cmd_testcase,
550 EC_TEST_REGISTER(ec_node_cmd_test);