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_parsed.h>
41 #include <ecoli_completed.h>
42 #include <ecoli_node_str.h>
43 #include <ecoli_node_option.h>
44 #include <ecoli_node_many.h>
46 EC_LOG_TYPE_REGISTER(node_many);
52 struct ec_node *child;
55 static int ec_node_many_parse(const struct ec_node *gen_node,
56 struct ec_parsed *state,
57 const struct ec_strvec *strvec)
59 struct ec_node_many *node = (struct ec_node_many *)gen_node;
60 struct ec_parsed *child_parsed;
61 struct ec_strvec *childvec = NULL;
62 size_t off = 0, count;
65 for (count = 0; node->max == 0 || count < node->max; count++) {
66 childvec = ec_strvec_ndup(strvec, off,
67 ec_strvec_len(strvec) - off);
68 if (childvec == NULL) {
73 ret = ec_node_parse_child(node->child, state, childvec);
74 ec_strvec_free(childvec);
77 if (ret == EC_PARSED_NOMATCH)
82 /* it matches an empty strvec, no need to continue */
84 child_parsed = ec_parsed_get_last_child(state);
85 ec_parsed_del_child(state, child_parsed);
86 ec_parsed_free(child_parsed);
93 if (count < node->min) {
94 ec_parsed_free_children(state);
95 return EC_PARSED_NOMATCH;
101 ec_strvec_free(childvec);
106 __ec_node_many_complete(struct ec_node_many *node, unsigned int max,
107 struct ec_completed *completed,
108 struct ec_parsed *parsed,
109 const struct ec_strvec *strvec)
111 struct ec_strvec *childvec = NULL;
115 /* first, try to complete with the child node */
116 ret = ec_node_complete_child(node->child, completed, parsed, strvec);
120 /* we're done, we reached the max number of nodes */
124 /* if there is a maximum, decrease it before recursion */
128 /* then, if the node matches the beginning of the strvec, try to
129 * complete the rest */
130 for (i = 0; i < ec_strvec_len(strvec); i++) {
131 childvec = ec_strvec_ndup(strvec, 0, i);
132 if (childvec == NULL)
135 ret = ec_node_parse_child(node->child, parsed, childvec);
136 if (ret < 0 && ret != EC_PARSED_NOMATCH)
139 ec_strvec_free(childvec);
142 if ((unsigned int)ret != i) {
143 if (ret != EC_PARSED_NOMATCH)
144 ec_parsed_del_last_child(parsed);
148 childvec = ec_strvec_ndup(strvec, i, ec_strvec_len(strvec) - i);
149 if (childvec == NULL) {
150 ec_parsed_del_last_child(parsed);
154 ret = __ec_node_many_complete(node, max, completed,
156 ec_parsed_del_last_child(parsed);
157 ec_strvec_free(childvec);
167 ec_strvec_free(childvec);
172 ec_node_many_complete(const struct ec_node *gen_node,
173 struct ec_completed *completed,
174 struct ec_parsed *parsed,
175 const struct ec_strvec *strvec)
177 struct ec_node_many *node = (struct ec_node_many *)gen_node;
179 return __ec_node_many_complete(node, node->max, completed,
183 static void ec_node_many_free_priv(struct ec_node *gen_node)
185 struct ec_node_many *node = (struct ec_node_many *)gen_node;
187 ec_node_free(node->child);
190 static struct ec_node_type ec_node_many_type = {
192 .parse = ec_node_many_parse,
193 .complete = ec_node_many_complete,
194 .size = sizeof(struct ec_node_many),
195 .free_priv = ec_node_many_free_priv,
198 EC_NODE_TYPE_REGISTER(ec_node_many_type);
200 struct ec_node *ec_node_many(const char *id, struct ec_node *child,
201 unsigned int min, unsigned int max)
203 struct ec_node_many *node = NULL;
208 node = (struct ec_node_many *)__ec_node(&ec_node_many_type, id);
221 /* LCOV_EXCL_START */
222 static int ec_node_many_testcase(void)
224 struct ec_node *node;
227 node = ec_node_many(NULL, ec_node_str(NULL, "foo"), 0, 0);
229 EC_LOG(EC_LOG_ERR, "cannot create node\n");
232 ret |= EC_TEST_CHECK_PARSE(node, 0);
233 ret |= EC_TEST_CHECK_PARSE(node, 0, "bar");
234 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
235 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "foo", "bar");
236 ret |= EC_TEST_CHECK_PARSE(node, 0);
239 node = ec_node_many(NULL, ec_node_str(NULL, "foo"), 1, 0);
241 EC_LOG(EC_LOG_ERR, "cannot create node\n");
244 ret |= EC_TEST_CHECK_PARSE(node, -1, "bar");
245 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
246 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "foo", "bar");
247 ret |= EC_TEST_CHECK_PARSE(node, -1);
250 node = ec_node_many(NULL, ec_node_str(NULL, "foo"), 1, 2);
252 EC_LOG(EC_LOG_ERR, "cannot create node\n");
255 ret |= EC_TEST_CHECK_PARSE(node, -1, "bar");
256 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
257 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "foo", "bar");
258 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "foo", "foo");
259 ret |= EC_TEST_CHECK_PARSE(node, -1);
262 /* test completion */
263 node = ec_node_many(NULL, ec_node_str(NULL, "foo"), 2, 4);
265 EC_LOG(EC_LOG_ERR, "cannot create node\n");
268 ret |= EC_TEST_CHECK_COMPLETE(node,
270 "foo", EC_NODE_ENDLIST);
271 ret |= EC_TEST_CHECK_COMPLETE(node,
272 "f", EC_NODE_ENDLIST,
273 "foo", EC_NODE_ENDLIST);
274 ret |= EC_TEST_CHECK_COMPLETE(node,
275 "foo", EC_NODE_ENDLIST,
276 "foo", EC_NODE_ENDLIST);
277 ret |= EC_TEST_CHECK_COMPLETE(node,
278 "foo", "", EC_NODE_ENDLIST,
279 "foo", EC_NODE_ENDLIST);
280 ret |= EC_TEST_CHECK_COMPLETE(node,
281 "foo", "foo", "", EC_NODE_ENDLIST,
282 "foo", EC_NODE_ENDLIST);
283 ret |= EC_TEST_CHECK_COMPLETE(node,
284 "foo", "foo", "foo", "", EC_NODE_ENDLIST,
285 "foo", EC_NODE_ENDLIST);
286 ret |= EC_TEST_CHECK_COMPLETE(node,
287 "foo", "foo", "foo", "foo", "", EC_NODE_ENDLIST,
295 static struct ec_test ec_node_many_test = {
297 .test = ec_node_many_testcase,
300 EC_TEST_REGISTER(ec_node_many_test);