2 * Copyright (c) 2016, 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.
35 #include <ecoli_malloc.h>
36 #include <ecoli_log.h>
37 #include <ecoli_strvec.h>
38 #include <ecoli_node.h>
39 #include <ecoli_parsed.h>
40 #include <ecoli_completed.h>
41 #include <ecoli_node_or.h>
42 #include <ecoli_node_str.h>
43 #include <ecoli_test.h>
47 struct ec_node **table;
52 ec_node_or_parse(const struct ec_node *gen_node,
53 struct ec_parsed *state,
54 const struct ec_strvec *strvec)
56 struct ec_node_or *node = (struct ec_node_or *)gen_node;
60 for (i = 0; i < node->len; i++) {
61 ret = ec_node_parse_child(node->table[i], state, strvec);
62 if (ret == EC_PARSED_NOMATCH)
67 return EC_PARSED_NOMATCH;
70 static struct ec_completed *
71 ec_node_or_complete(const struct ec_node *gen_node,
72 struct ec_parsed *state,
73 const struct ec_strvec *strvec)
75 struct ec_node_or *node = (struct ec_node_or *)gen_node;
76 struct ec_completed *completed, *child_completed;
79 completed = ec_completed();
80 if (completed == NULL)
83 for (n = 0; n < node->len; n++) {
84 child_completed = ec_node_complete_child(node->table[n],
87 if (child_completed == NULL) // XXX fail instead?
90 ec_completed_merge(completed, child_completed);
96 static void ec_node_or_free_priv(struct ec_node *gen_node)
98 struct ec_node_or *node = (struct ec_node_or *)gen_node;
101 for (i = 0; i < node->len; i++)
102 ec_node_free(node->table[i]);
103 ec_free(node->table);
106 int ec_node_or_add(struct ec_node *gen_node, struct ec_node *child)
108 struct ec_node_or *node = (struct ec_node_or *)gen_node;
109 struct ec_node **table;
111 assert(node != NULL);
116 gen_node->flags &= ~EC_NODE_F_BUILT;
118 table = ec_realloc(node->table, (node->len + 1) * sizeof(*node->table));
125 table[node->len] = child;
128 child->parent = gen_node;
129 TAILQ_INSERT_TAIL(&gen_node->children, child, next);
134 static struct ec_node_type ec_node_or_type = {
136 .parse = ec_node_or_parse,
137 .complete = ec_node_or_complete,
138 .size = sizeof(struct ec_node_or),
139 .free_priv = ec_node_or_free_priv,
142 EC_NODE_TYPE_REGISTER(ec_node_or_type);
144 struct ec_node *__ec_node_or(const char *id, ...)
146 struct ec_node *gen_node = NULL;
147 struct ec_node_or *node = NULL;
148 struct ec_node *child;
154 gen_node = __ec_node(&ec_node_or_type, id);
155 node = (struct ec_node_or *)gen_node;
159 for (child = va_arg(ap, struct ec_node *);
160 child != EC_NODE_ENDLIST;
161 child = va_arg(ap, struct ec_node *)) {
163 /* on error, don't quit the loop to avoid leaks */
164 if (fail == 1 || child == NULL ||
165 ec_node_or_add(gen_node, child) < 0) {
178 ec_node_free(gen_node); /* will also free children */
183 /* LCOV_EXCL_START */
184 static int ec_node_or_testcase(void)
186 struct ec_node *node;
189 node = EC_NODE_OR(NULL,
190 ec_node_str(NULL, "foo"),
191 ec_node_str(NULL, "bar")
194 ec_log(EC_LOG_ERR, "cannot create node\n");
197 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
198 ret |= EC_TEST_CHECK_PARSE(node, 1, "bar");
199 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
200 ret |= EC_TEST_CHECK_PARSE(node, -1, " ");
201 ret |= EC_TEST_CHECK_PARSE(node, -1, "foox");
202 ret |= EC_TEST_CHECK_PARSE(node, -1, "toto");
203 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
206 /* test completion */
207 node = EC_NODE_OR(NULL,
208 ec_node_str(NULL, "foo"),
209 ec_node_str(NULL, "bar"),
210 ec_node_str(NULL, "bar2"),
211 ec_node_str(NULL, "toto"),
212 ec_node_str(NULL, "titi")
215 ec_log(EC_LOG_ERR, "cannot create node\n");
218 ret |= EC_TEST_CHECK_COMPLETE(node,
220 "foo", "bar", "bar2", "toto", "titi", EC_NODE_ENDLIST,
222 ret |= EC_TEST_CHECK_COMPLETE(node,
223 "f", EC_NODE_ENDLIST,
224 "oo", EC_NODE_ENDLIST,
226 ret |= EC_TEST_CHECK_COMPLETE(node,
227 "b", EC_NODE_ENDLIST,
228 "ar", "ar2", EC_NODE_ENDLIST,
230 ret |= EC_TEST_CHECK_COMPLETE(node,
231 "bar", EC_NODE_ENDLIST,
232 "", "2", EC_NODE_ENDLIST,
234 ret |= EC_TEST_CHECK_COMPLETE(node,
235 "t", EC_NODE_ENDLIST,
236 "oto", "iti", EC_NODE_ENDLIST,
238 ret |= EC_TEST_CHECK_COMPLETE(node,
239 "to", EC_NODE_ENDLIST,
240 "to", EC_NODE_ENDLIST,
242 ret |= EC_TEST_CHECK_COMPLETE(node,
243 "x", EC_NODE_ENDLIST,
252 static struct ec_test ec_node_or_test = {
254 .test = ec_node_or_testcase,
257 EC_TEST_REGISTER(ec_node_or_test);