1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright 2016, Olivier MATZ <zer0@droids-corp.org>
13 #include <ecoli_malloc.h>
14 #include <ecoli_log.h>
15 #include <ecoli_test.h>
16 #include <ecoli_strvec.h>
17 #include <ecoli_node.h>
18 #include <ecoli_parse.h>
19 #include <ecoli_complete.h>
20 #include <ecoli_node_str.h>
21 #include <ecoli_node_option.h>
22 #include <ecoli_node_or.h>
23 #include <ecoli_node_many.h>
24 #include <ecoli_node_seq.h>
26 EC_LOG_TYPE_REGISTER(node_seq);
30 struct ec_node **table;
35 ec_node_seq_parse(const struct ec_node *gen_node,
36 struct ec_parse *state,
37 const struct ec_strvec *strvec)
39 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
40 struct ec_strvec *childvec = NULL;
45 for (i = 0; i < node->len; i++) {
46 childvec = ec_strvec_ndup(strvec, len,
47 ec_strvec_len(strvec) - len);
51 ret = ec_node_parse_child(node->table[i], state, childvec);
55 ec_strvec_free(childvec);
58 if (ret == EC_PARSE_NOMATCH) {
59 ec_parse_free_children(state);
60 return EC_PARSE_NOMATCH;
69 ec_strvec_free(childvec);
74 __ec_node_seq_complete(struct ec_node **table, size_t table_len,
76 const struct ec_strvec *strvec)
78 struct ec_parse *parse = ec_comp_get_state(comp);
79 struct ec_strvec *childvec = NULL;
87 * Example of completion for a sequence node = [n1,n2] and an
90 * result = complete(n1, [a,b,c,d]) +
91 * complete(n2, [b,c,d]) if n1 matches [a] +
92 * complete(n2, [c,d]) if n1 matches [a,b] +
93 * complete(n2, [d]) if n1 matches [a,b,c] +
94 * complete(n2, []) if n1 matches [a,b,c,d]
97 /* first, try to complete with the first node of the table */
98 ret = ec_node_complete_child(table[0], comp, strvec);
102 /* then, if the first node of the table matches the beginning of the
103 * strvec, try to complete the rest */
104 for (i = 0; i < ec_strvec_len(strvec); i++) {
105 childvec = ec_strvec_ndup(strvec, 0, i);
106 if (childvec == NULL)
109 ret = ec_node_parse_child(table[0], parse, childvec);
113 ec_strvec_free(childvec);
116 if ((unsigned int)ret != i) {
117 if (ret != EC_PARSE_NOMATCH)
118 ec_parse_del_last_child(parse);
122 childvec = ec_strvec_ndup(strvec, i, ec_strvec_len(strvec) - i);
123 if (childvec == NULL) {
124 ec_parse_del_last_child(parse);
128 ret = __ec_node_seq_complete(&table[1],
131 ec_parse_del_last_child(parse);
132 ec_strvec_free(childvec);
142 ec_strvec_free(childvec);
147 ec_node_seq_complete(const struct ec_node *gen_node,
148 struct ec_comp *comp,
149 const struct ec_strvec *strvec)
151 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
153 return __ec_node_seq_complete(node->table, node->len, comp,
157 static void ec_node_seq_free_priv(struct ec_node *gen_node)
159 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
162 for (i = 0; i < node->len; i++)
163 ec_node_free(node->table[i]);
164 ec_free(node->table);
167 static struct ec_node_type ec_node_seq_type = {
169 .parse = ec_node_seq_parse,
170 .complete = ec_node_seq_complete,
171 .size = sizeof(struct ec_node_seq),
172 .free_priv = ec_node_seq_free_priv,
175 EC_NODE_TYPE_REGISTER(ec_node_seq_type);
177 int ec_node_seq_add(struct ec_node *gen_node, struct ec_node *child)
179 struct ec_node_seq *node = (struct ec_node_seq *)gen_node;
180 struct ec_node **table;
182 assert(node != NULL);
189 if (ec_node_check_type(gen_node, &ec_node_seq_type) < 0)
192 table = ec_realloc(node->table, (node->len + 1) * sizeof(*node->table));
198 if (ec_node_add_child(gen_node, child) < 0)
201 table[node->len] = child;
211 struct ec_node *__ec_node_seq(const char *id, ...)
213 struct ec_node *gen_node = NULL;
214 struct ec_node_seq *node = NULL;
215 struct ec_node *child;
221 gen_node = __ec_node(&ec_node_seq_type, id);
222 node = (struct ec_node_seq *)gen_node;
226 for (child = va_arg(ap, struct ec_node *);
227 child != EC_NODE_ENDLIST;
228 child = va_arg(ap, struct ec_node *)) {
230 /* on error, don't quit the loop to avoid leaks */
231 if (fail == 1 || child == NULL ||
232 ec_node_seq_add(&node->gen, child) < 0) {
245 ec_node_free(gen_node); /* will also free children */
250 /* LCOV_EXCL_START */
251 static int ec_node_seq_testcase(void)
253 struct ec_node *node;
256 node = EC_NODE_SEQ(EC_NO_ID,
257 ec_node_str(EC_NO_ID, "foo"),
258 ec_node_str(EC_NO_ID, "bar")
261 EC_LOG(EC_LOG_ERR, "cannot create node\n");
264 testres |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar");
265 testres |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar", "toto");
266 testres |= EC_TEST_CHECK_PARSE(node, -1, "foo");
267 testres |= EC_TEST_CHECK_PARSE(node, -1, "foox", "bar");
268 testres |= EC_TEST_CHECK_PARSE(node, -1, "foo", "barx");
269 testres |= EC_TEST_CHECK_PARSE(node, -1, "bar", "foo");
270 testres |= EC_TEST_CHECK_PARSE(node, -1, "", "foo");
273 /* test completion */
274 node = EC_NODE_SEQ(EC_NO_ID,
275 ec_node_str(EC_NO_ID, "foo"),
276 ec_node_option(EC_NO_ID, ec_node_str(EC_NO_ID, "toto")),
277 ec_node_str(EC_NO_ID, "bar")
280 EC_LOG(EC_LOG_ERR, "cannot create node\n");
283 testres |= EC_TEST_CHECK_COMPLETE(node,
285 "foo", EC_NODE_ENDLIST);
286 testres |= EC_TEST_CHECK_COMPLETE(node,
287 "f", EC_NODE_ENDLIST,
288 "foo", EC_NODE_ENDLIST);
289 testres |= EC_TEST_CHECK_COMPLETE(node,
290 "foo", EC_NODE_ENDLIST,
291 "foo", EC_NODE_ENDLIST);
292 testres |= EC_TEST_CHECK_COMPLETE(node,
293 "foo", "", EC_NODE_ENDLIST,
294 "bar", "toto", EC_NODE_ENDLIST);
295 testres |= EC_TEST_CHECK_COMPLETE(node,
296 "foo", "t", EC_NODE_ENDLIST,
297 "toto", EC_NODE_ENDLIST);
298 testres |= EC_TEST_CHECK_COMPLETE(node,
299 "foo", "b", EC_NODE_ENDLIST,
300 "bar", EC_NODE_ENDLIST);
301 testres |= EC_TEST_CHECK_COMPLETE(node,
302 "foo", "bar", EC_NODE_ENDLIST,
303 "bar", EC_NODE_ENDLIST);
304 testres |= EC_TEST_CHECK_COMPLETE(node,
305 "x", EC_NODE_ENDLIST,
307 testres |= EC_TEST_CHECK_COMPLETE(node,
308 "foobarx", EC_NODE_ENDLIST,
316 static struct ec_test ec_node_seq_test = {
318 .test = ec_node_seq_testcase,
321 EC_TEST_REGISTER(ec_node_seq_test);