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.
33 #include <ecoli_log.h>
34 #include <ecoli_malloc.h>
35 #include <ecoli_test.h>
36 #include <ecoli_strvec.h>
37 #include <ecoli_node.h>
38 #include <ecoli_parsed.h>
39 #include <ecoli_completed.h>
40 #include <ecoli_node_str.h>
49 ec_node_str_parse(const struct ec_node *gen_node,
50 struct ec_parsed *state,
51 const struct ec_strvec *strvec)
53 struct ec_node_str *node = (struct ec_node_str *)gen_node;
58 if (ec_strvec_len(strvec) == 0)
59 return EC_PARSED_NOMATCH;
61 str = ec_strvec_val(strvec, 0);
62 if (strcmp(str, node->string) != 0)
63 return EC_PARSED_NOMATCH;
68 static struct ec_completed *
69 ec_node_str_complete(const struct ec_node *gen_node,
70 struct ec_parsed *state,
71 const struct ec_strvec *strvec)
73 struct ec_node_str *node = (struct ec_node_str *)gen_node;
74 struct ec_completed *completed;
80 completed = ec_completed();
81 if (completed == NULL)
84 if (ec_strvec_len(strvec) != 1)
87 str = ec_strvec_val(strvec, 0);
88 for (n = 0; n < node->len; n++) {
89 if (str[n] != node->string[n])
94 if (ec_completed_add_no_match(completed, state, gen_node) < 0) {
95 ec_completed_free(completed);
99 if (ec_completed_add_match(completed, state, gen_node,
100 node->string + n) < 0) {
101 ec_completed_free(completed);
109 static const char *ec_node_str_desc(const struct ec_node *gen_node)
111 struct ec_node_str *node = (struct ec_node_str *)gen_node;
116 static void ec_node_str_free_priv(struct ec_node *gen_node)
118 struct ec_node_str *node = (struct ec_node_str *)gen_node;
120 ec_free(node->string);
123 static size_t ec_node_str_get_max_parse_len(const struct ec_node *gen_node)
129 static struct ec_node_type ec_node_str_type = {
131 .parse = ec_node_str_parse,
132 .complete = ec_node_str_complete,
133 .get_max_parse_len = ec_node_str_get_max_parse_len,
134 .desc = ec_node_str_desc,
135 .size = sizeof(struct ec_node_str),
136 .free_priv = ec_node_str_free_priv,
139 EC_NODE_TYPE_REGISTER(ec_node_str_type);
141 int ec_node_str_set_str(struct ec_node *gen_node, const char *str)
143 struct ec_node_str *node = (struct ec_node_str *)gen_node;
147 if (node->string != NULL)
148 return -EEXIST; // XXX allow to replace
150 node->string = ec_strdup(str);
151 if (node->string == NULL)
154 node->len = strlen(node->string);
159 struct ec_node *ec_node_str(const char *id, const char *str)
161 struct ec_node *gen_node = NULL;
163 gen_node = __ec_node(&ec_node_str_type, id);
164 if (gen_node == NULL)
167 if (ec_node_str_set_str(gen_node, str) < 0)
173 ec_node_free(gen_node);
177 /* LCOV_EXCL_START */
178 static int ec_node_str_testcase(void)
180 struct ec_node *node;
183 /* XXX use EC_NO_ID instead of NULL */
184 node = ec_node_str(NULL, "foo");
186 ec_log(EC_LOG_ERR, "cannot create node\n");
189 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
190 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
191 ret |= EC_TEST_CHECK_PARSE(node, -1, "foobar");
192 ret |= EC_TEST_CHECK_PARSE(node, -1, " foo");
193 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
196 node = ec_node_str(NULL, "Здравствуйте");
198 ec_log(EC_LOG_ERR, "cannot create node\n");
201 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте");
202 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте",
204 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
205 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
208 /* an empty string node always matches */
209 node = ec_node_str(NULL, "");
211 ec_log(EC_LOG_ERR, "cannot create node\n");
214 ret |= EC_TEST_CHECK_PARSE(node, 1, "");
215 ret |= EC_TEST_CHECK_PARSE(node, 1, "", "foo");
216 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
219 /* test completion */
220 node = ec_node_str(NULL, "foo");
222 ec_log(EC_LOG_ERR, "cannot create node\n");
225 ret |= EC_TEST_CHECK_COMPLETE(node,
229 ret |= EC_TEST_CHECK_COMPLETE(node,
231 "foo", EC_NODE_ENDLIST,
233 ret |= EC_TEST_CHECK_COMPLETE(node,
234 "f", EC_NODE_ENDLIST,
235 "oo", EC_NODE_ENDLIST,
237 ret |= EC_TEST_CHECK_COMPLETE(node,
238 "foo", EC_NODE_ENDLIST,
241 ret |= EC_TEST_CHECK_COMPLETE(node,
242 "x", EC_NODE_ENDLIST,
251 static struct ec_test ec_node_str_test = {
253 .test = ec_node_str_testcase,
256 EC_TEST_REGISTER(ec_node_str_test);