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_or.h>
44 #include <ecoli_node_many.h>
45 #include <ecoli_node_once.h>
47 EC_LOG_TYPE_REGISTER(node_once);
51 struct ec_node *child;
55 count_node(struct ec_parsed *parsed, const struct ec_node *node)
57 struct ec_parsed *child;
58 unsigned int count = 0;
63 if (ec_parsed_get_node(parsed) == node)
66 EC_PARSED_FOREACH_CHILD(child, parsed)
67 count += count_node(child, node);
73 ec_node_once_parse(const struct ec_node *gen_node,
74 struct ec_parsed *state,
75 const struct ec_strvec *strvec)
77 struct ec_node_once *node = (struct ec_node_once *)gen_node;
80 /* count the number of occurences of the node: if already parsed,
83 count = count_node(ec_parsed_get_root(state), node->child);
85 return EC_PARSED_NOMATCH;
87 return ec_node_parse_child(node->child, state, strvec);
91 ec_node_once_complete(const struct ec_node *gen_node,
92 struct ec_completed *completed,
93 const struct ec_strvec *strvec)
95 struct ec_node_once *node = (struct ec_node_once *)gen_node;
96 struct ec_parsed *parsed = ec_completed_get_state(completed);
100 /* count the number of occurences of the node: if already parsed,
103 count = count_node(ec_parsed_get_root(parsed), node->child);
107 ret = ec_node_complete_child(node->child, completed, strvec);
114 static void ec_node_once_free_priv(struct ec_node *gen_node)
116 struct ec_node_once *node = (struct ec_node_once *)gen_node;
118 ec_node_free(node->child);
121 static struct ec_node_type ec_node_once_type = {
123 .parse = ec_node_once_parse,
124 .complete = ec_node_once_complete,
125 .size = sizeof(struct ec_node_once),
126 .free_priv = ec_node_once_free_priv,
129 EC_NODE_TYPE_REGISTER(ec_node_once_type);
131 int ec_node_once_set(struct ec_node *gen_node, struct ec_node *child)
133 struct ec_node_once *node = (struct ec_node_once *)gen_node;
135 if (gen_node == NULL || child == NULL) {
140 if (ec_node_check_type(gen_node, &ec_node_once_type) < 0)
143 if (ec_node_add_child(gen_node, child) < 0)
155 struct ec_node *ec_node_once(const char *id, struct ec_node *child)
157 struct ec_node *gen_node = NULL;
162 gen_node = __ec_node(&ec_node_once_type, id);
163 if (gen_node == NULL)
166 ec_node_once_set(gen_node, child);
176 /* LCOV_EXCL_START */
177 static int ec_node_once_testcase(void)
179 struct ec_node *node;
182 node = ec_node_many(EC_NO_ID,
184 ec_node_once(EC_NO_ID, ec_node_str(EC_NO_ID, "foo")),
185 ec_node_str(EC_NO_ID, "bar")
189 EC_LOG(EC_LOG_ERR, "cannot create node\n");
192 ret |= EC_TEST_CHECK_PARSE(node, 0);
193 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
194 ret |= EC_TEST_CHECK_PARSE(node, 1, "bar");
195 ret |= EC_TEST_CHECK_PARSE(node, 2, "foo", "bar");
196 ret |= EC_TEST_CHECK_PARSE(node, 3, "foo", "bar", "bar");
197 ret |= EC_TEST_CHECK_PARSE(node, 3, "bar", "foo", "bar");
198 ret |= EC_TEST_CHECK_PARSE(node, 2, "bar", "foo", "foo");
199 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "foo");
200 ret |= EC_TEST_CHECK_PARSE(node, 0, "foox");
204 #if 0 //XXX no completion test for node_once
205 /* test completion */
206 node = EC_NODE_OR(EC_NO_ID,
207 ec_node_str(EC_NO_ID, "foo"),
208 ec_node_str(EC_NO_ID, "bar"),
209 ec_node_str(EC_NO_ID, "bar2"),
210 ec_node_str(EC_NO_ID, "toto"),
211 ec_node_str(EC_NO_ID, "titi")
214 EC_LOG(EC_LOG_ERR, "cannot create node\n");
217 ret |= EC_TEST_CHECK_COMPLETE(node,
219 "foo", "bar", "bar2", "toto", "titi", EC_NODE_ENDLIST);
220 ret |= EC_TEST_CHECK_COMPLETE(node,
221 "f", EC_NODE_ENDLIST,
222 "foo", EC_NODE_ENDLIST);
229 static struct ec_test ec_node_once_test = {
231 .test = ec_node_once_testcase,
234 EC_TEST_REGISTER(ec_node_once_test);