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_test.h>
38 #include <ecoli_strvec.h>
39 #include <ecoli_node.h>
40 #include <ecoli_node_str.h>
41 #include <ecoli_node_option.h>
42 #include <ecoli_node_seq.h>
46 struct ec_node **table;
50 static struct ec_parsed *ec_node_seq_parse(const struct ec_node *gen_node,
51 const struct ec_strvec *strvec)
53 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
54 struct ec_parsed *parsed, *child_parsed;
55 struct ec_strvec *match_strvec;
56 struct ec_strvec *childvec = NULL;
64 for (i = 0; i < node->len; i++) {
65 childvec = ec_strvec_ndup(strvec, len,
66 ec_strvec_len(strvec) - len);
70 child_parsed = ec_node_parse_strvec(node->table[i], childvec);
71 if (child_parsed == NULL)
74 ec_strvec_free(childvec);
77 if (!ec_parsed_matches(child_parsed)) {
78 ec_parsed_free(child_parsed);
79 // XXX ec_parsed_free_children needed? see subset.c
80 ec_parsed_free_children(parsed);
84 ec_parsed_add_child(parsed, child_parsed);
85 len += ec_parsed_len(child_parsed);
88 match_strvec = ec_strvec_ndup(strvec, 0, len);
89 if (match_strvec == NULL)
92 ec_parsed_set_match(parsed, gen_node, match_strvec);
97 ec_strvec_free(childvec);
98 ec_parsed_free(parsed);
102 static struct ec_completed *ec_node_seq_complete(const struct ec_node *gen_node,
103 const struct ec_strvec *strvec)
105 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
106 struct ec_completed *completed, *child_completed;
107 struct ec_strvec *childvec = NULL;
108 struct ec_parsed *parsed;
112 completed = ec_completed();
113 if (completed == NULL)
119 for (i = 0; i < node->len && len < ec_strvec_len(strvec); i++) {
120 childvec = ec_strvec_ndup(strvec, len,
121 ec_strvec_len(strvec) - len);
122 if (childvec == NULL)
125 child_completed = ec_node_complete_strvec(node->table[i],
127 if (child_completed == NULL)
130 ec_completed_merge(completed, child_completed);
132 parsed = ec_node_parse_strvec(node->table[i], childvec);
136 ec_strvec_free(childvec);
139 if (!ec_parsed_matches(parsed)) {
140 ec_parsed_free(parsed);
144 len += ec_strvec_len(parsed->strvec);
145 ec_parsed_free(parsed);
151 ec_strvec_free(childvec);
152 ec_completed_free(completed);
156 static void ec_node_seq_free_priv(struct ec_node *gen_node)
158 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
161 for (i = 0; i < node->len; i++)
162 ec_node_free(node->table[i]);
163 ec_free(node->table);
166 static struct ec_node_type ec_node_seq_type = {
168 .parse = ec_node_seq_parse,
169 .complete = ec_node_seq_complete,
170 .size = sizeof(struct ec_node_seq),
171 .free_priv = ec_node_seq_free_priv,
174 EC_NODE_TYPE_REGISTER(ec_node_seq_type);
176 int ec_node_seq_add(struct ec_node *gen_node, struct ec_node *child)
178 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
179 struct ec_node **table;
181 // XXX check node type
183 assert(node != NULL);
188 gen_node->flags &= ~EC_NODE_F_BUILT;
190 table = ec_realloc(node->table, (node->len + 1) * sizeof(*node->table));
197 table[node->len] = child;
200 child->parent = gen_node;
201 TAILQ_INSERT_TAIL(&gen_node->children, child, next); // XXX really needed?
206 struct ec_node *__ec_node_seq(const char *id, ...)
208 struct ec_node *gen_node = NULL;
209 struct ec_node_seq *node = NULL;
210 struct ec_node *child;
216 gen_node = __ec_node(&ec_node_seq_type, id);
217 node = (struct ec_node_seq *)gen_node;
221 for (child = va_arg(ap, struct ec_node *);
222 child != EC_NODE_ENDLIST;
223 child = va_arg(ap, struct ec_node *)) {
225 /* on error, don't quit the loop to avoid leaks */
226 if (fail == 1 || child == NULL ||
227 ec_node_seq_add(&node->gen, child) < 0) {
240 ec_node_free(gen_node); /* will also free children */
245 static int ec_node_seq_testcase(void)
247 struct ec_node *node;
250 node = EC_NODE_SEQ(NULL,
251 ec_node_str(NULL, "foo"),
252 ec_node_str(NULL, "bar")
255 ec_log(EC_LOG_ERR, "cannot create node\n");
258 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar");
259 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar", "toto");
260 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
261 ret |= EC_TEST_CHECK_PARSE(node, -1, "foox", "bar");
262 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo", "barx");
263 ret |= EC_TEST_CHECK_PARSE(node, -1, "bar", "foo");
264 ret |= EC_TEST_CHECK_PARSE(node, -1, "", "foo");
267 /* test completion */
268 node = EC_NODE_SEQ(NULL,
269 ec_node_str(NULL, "foo"),
270 ec_node_option(NULL, ec_node_str(NULL, "toto")),
271 ec_node_str(NULL, "bar")
274 ec_log(EC_LOG_ERR, "cannot create node\n");
277 ret |= EC_TEST_CHECK_COMPLETE(node,
279 "foo", EC_NODE_ENDLIST,
281 ret |= EC_TEST_CHECK_COMPLETE(node,
282 "f", EC_NODE_ENDLIST,
283 "oo", EC_NODE_ENDLIST,
285 ret |= EC_TEST_CHECK_COMPLETE(node,
286 "foo", EC_NODE_ENDLIST,
289 ret |= EC_TEST_CHECK_COMPLETE(node,
290 "foo", "", EC_NODE_ENDLIST,
291 "bar", "toto", EC_NODE_ENDLIST,
293 ret |= EC_TEST_CHECK_COMPLETE(node,
294 "foo", "t", EC_NODE_ENDLIST,
295 "oto", EC_NODE_ENDLIST,
297 ret |= EC_TEST_CHECK_COMPLETE(node,
298 "foo", "b", EC_NODE_ENDLIST,
299 "ar", EC_NODE_ENDLIST,
301 ret |= EC_TEST_CHECK_COMPLETE(node,
302 "foo", "bar", EC_NODE_ENDLIST,
305 ret |= EC_TEST_CHECK_COMPLETE(node,
306 "x", EC_NODE_ENDLIST,
309 ret |= EC_TEST_CHECK_COMPLETE(node,
310 "foobarx", EC_NODE_ENDLIST,
318 static struct ec_test ec_node_seq_test = {
320 .test = ec_node_seq_testcase,
323 EC_TEST_REGISTER(ec_node_seq_test);