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.
36 #include <ecoli_malloc.h>
37 #include <ecoli_log.h>
38 #include <ecoli_test.h>
39 #include <ecoli_strvec.h>
40 #include <ecoli_node.h>
41 #include <ecoli_parsed.h>
42 #include <ecoli_completed.h>
43 #include <ecoli_node_str.h>
44 #include <ecoli_node_option.h>
45 #include <ecoli_node_or.h>
46 #include <ecoli_node_many.h>
47 #include <ecoli_node_seq.h>
49 EC_LOG_TYPE_REGISTER(node_seq);
53 struct ec_node **table;
58 ec_node_seq_parse(const struct ec_node *gen_node,
59 struct ec_parsed *state,
60 const struct ec_strvec *strvec)
62 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
63 struct ec_strvec *childvec = NULL;
68 for (i = 0; i < node->len; i++) {
69 childvec = ec_strvec_ndup(strvec, len,
70 ec_strvec_len(strvec) - len);
71 if (childvec == NULL) {
76 ret = ec_node_parse_child(node->table[i], state, childvec);
80 ec_strvec_free(childvec);
83 if (ret == EC_PARSED_NOMATCH) {
84 ec_parsed_free_children(state);
85 return EC_PARSED_NOMATCH;
94 ec_strvec_free(childvec);
99 __ec_node_seq_complete(struct ec_node **table, size_t table_len,
100 struct ec_completed *completed,
101 const struct ec_strvec *strvec)
103 struct ec_parsed *parsed = ec_completed_get_state(completed);
104 struct ec_strvec *childvec = NULL;
112 * Example of completion for a sequence node = [n1,n2] and an
115 * result = complete(n1, [a,b,c,d]) +
116 * complete(n2, [b,c,d]) if n1 matches [a] +
117 * complete(n2, [c,d]) if n1 matches [a,b] +
118 * complete(n2, [d]) if n1 matches [a,b,c] +
119 * complete(n2, []) if n1 matches [a,b,c,d]
122 /* first, try to complete with the first node of the table */
123 ret = ec_node_complete_child(table[0], completed, strvec);
127 /* then, if the first node of the table matches the beginning of the
128 * strvec, try to complete the rest */
129 for (i = 0; i < ec_strvec_len(strvec); i++) {
130 childvec = ec_strvec_ndup(strvec, 0, i);
131 if (childvec == NULL)
134 ret = ec_node_parse_child(table[0], parsed, childvec);
138 ec_strvec_free(childvec);
141 if ((unsigned int)ret != i) {
142 if (ret != EC_PARSED_NOMATCH)
143 ec_parsed_del_last_child(parsed);
147 childvec = ec_strvec_ndup(strvec, i, ec_strvec_len(strvec) - i);
148 if (childvec == NULL) {
149 ec_parsed_del_last_child(parsed);
153 ret = __ec_node_seq_complete(&table[1],
155 completed, childvec);
156 ec_parsed_del_last_child(parsed);
157 ec_strvec_free(childvec);
167 ec_strvec_free(childvec);
172 ec_node_seq_complete(const struct ec_node *gen_node,
173 struct ec_completed *completed,
174 const struct ec_strvec *strvec)
176 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
178 return __ec_node_seq_complete(node->table, node->len, completed,
182 static size_t ec_node_seq_get_max_parse_len(const struct ec_node *gen_node)
184 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
185 size_t i, len, ret = 0;
187 for (i = 0; i < node->len; i++) {
188 len = ec_node_get_max_parse_len(node->table[i]);
189 if (len <= SIZE_MAX - ret)
198 static void ec_node_seq_free_priv(struct ec_node *gen_node)
200 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
203 for (i = 0; i < node->len; i++)
204 ec_node_free(node->table[i]);
205 ec_free(node->table);
208 static struct ec_node_type ec_node_seq_type = {
210 .parse = ec_node_seq_parse,
211 .complete = ec_node_seq_complete,
212 .get_max_parse_len = ec_node_seq_get_max_parse_len,
213 .size = sizeof(struct ec_node_seq),
214 .free_priv = ec_node_seq_free_priv,
217 EC_NODE_TYPE_REGISTER(ec_node_seq_type);
219 int ec_node_seq_add(struct ec_node *gen_node, struct ec_node *child)
221 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
222 struct ec_node **table;
224 // XXX check node type
226 assert(node != NULL);
231 gen_node->flags &= ~EC_NODE_F_BUILT;
233 table = ec_realloc(node->table, (node->len + 1) * sizeof(*node->table));
240 table[node->len] = child;
243 child->parent = gen_node;
244 TAILQ_INSERT_TAIL(&gen_node->children, child, next); // XXX really needed?
249 struct ec_node *__ec_node_seq(const char *id, ...)
251 struct ec_node *gen_node = NULL;
252 struct ec_node_seq *node = NULL;
253 struct ec_node *child;
259 gen_node = __ec_node(&ec_node_seq_type, id);
260 node = (struct ec_node_seq *)gen_node;
264 for (child = va_arg(ap, struct ec_node *);
265 child != EC_NODE_ENDLIST;
266 child = va_arg(ap, struct ec_node *)) {
268 /* on error, don't quit the loop to avoid leaks */
269 if (fail == 1 || child == NULL ||
270 ec_node_seq_add(&node->gen, child) < 0) {
283 ec_node_free(gen_node); /* will also free children */
288 /* LCOV_EXCL_START */
289 static int ec_node_seq_testcase(void)
291 struct ec_node *node;
294 node = EC_NODE_SEQ(NULL,
295 ec_node_str(NULL, "foo"),
296 ec_node_str(NULL, "bar")
299 EC_LOG(EC_LOG_ERR, "cannot create node\n");
302 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar");
303 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar", "toto");
304 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
305 ret |= EC_TEST_CHECK_PARSE(node, -1, "foox", "bar");
306 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo", "barx");
307 ret |= EC_TEST_CHECK_PARSE(node, -1, "bar", "foo");
308 ret |= EC_TEST_CHECK_PARSE(node, -1, "", "foo");
311 /* test completion */
312 node = EC_NODE_SEQ(NULL,
313 ec_node_str(NULL, "foo"),
314 ec_node_option(NULL, ec_node_str(NULL, "toto")),
315 ec_node_str(NULL, "bar")
318 EC_LOG(EC_LOG_ERR, "cannot create node\n");
321 ret |= EC_TEST_CHECK_COMPLETE(node,
323 "foo", EC_NODE_ENDLIST);
326 ret |= EC_TEST_CHECK_COMPLETE(node,
327 "f", EC_NODE_ENDLIST,
328 "foo", EC_NODE_ENDLIST);
329 ret |= EC_TEST_CHECK_COMPLETE(node,
330 "foo", EC_NODE_ENDLIST,
331 "foo", EC_NODE_ENDLIST);
332 ret |= EC_TEST_CHECK_COMPLETE(node,
333 "foo", "", EC_NODE_ENDLIST,
334 "bar", "toto", EC_NODE_ENDLIST);
335 ret |= EC_TEST_CHECK_COMPLETE(node,
336 "foo", "t", EC_NODE_ENDLIST,
337 "toto", EC_NODE_ENDLIST);
338 ret |= EC_TEST_CHECK_COMPLETE(node,
339 "foo", "b", EC_NODE_ENDLIST,
340 "bar", EC_NODE_ENDLIST);
341 ret |= EC_TEST_CHECK_COMPLETE(node,
342 "foo", "bar", EC_NODE_ENDLIST,
343 "bar", EC_NODE_ENDLIST);
344 ret |= EC_TEST_CHECK_COMPLETE(node,
345 "x", EC_NODE_ENDLIST,
347 ret |= EC_TEST_CHECK_COMPLETE(node,
348 "foobarx", EC_NODE_ENDLIST,
356 static struct ec_test ec_node_seq_test = {
358 .test = ec_node_seq_testcase,
361 EC_TEST_REGISTER(ec_node_seq_test);