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;
69 ec_node_str_complete(const struct ec_node *gen_node,
70 struct ec_completed *completed,
71 struct ec_parsed *parsed,
72 const struct ec_strvec *strvec)
74 struct ec_node_str *node = (struct ec_node_str *)gen_node;
80 if (ec_strvec_len(strvec) != 1)
83 str = ec_strvec_val(strvec, 0);
84 for (n = 0; n < node->len; n++) {
85 if (str[n] != node->string[n])
90 if (ec_completed_add_match(completed, parsed, gen_node,
91 node->string + n) < 0)
98 static const char *ec_node_str_desc(const struct ec_node *gen_node)
100 struct ec_node_str *node = (struct ec_node_str *)gen_node;
105 static void ec_node_str_free_priv(struct ec_node *gen_node)
107 struct ec_node_str *node = (struct ec_node_str *)gen_node;
109 ec_free(node->string);
112 static size_t ec_node_str_get_max_parse_len(const struct ec_node *gen_node)
118 static struct ec_node_type ec_node_str_type = {
120 .parse = ec_node_str_parse,
121 .complete = ec_node_str_complete,
122 .get_max_parse_len = ec_node_str_get_max_parse_len,
123 .desc = ec_node_str_desc,
124 .size = sizeof(struct ec_node_str),
125 .free_priv = ec_node_str_free_priv,
128 EC_NODE_TYPE_REGISTER(ec_node_str_type);
130 int ec_node_str_set_str(struct ec_node *gen_node, const char *str)
132 struct ec_node_str *node = (struct ec_node_str *)gen_node;
136 if (node->string != NULL)
137 return -EEXIST; // XXX allow to replace
139 node->string = ec_strdup(str);
140 if (node->string == NULL)
143 node->len = strlen(node->string);
148 struct ec_node *ec_node_str(const char *id, const char *str)
150 struct ec_node *gen_node = NULL;
152 gen_node = __ec_node(&ec_node_str_type, id);
153 if (gen_node == NULL)
156 if (ec_node_str_set_str(gen_node, str) < 0)
162 ec_node_free(gen_node);
166 /* LCOV_EXCL_START */
167 static int ec_node_str_testcase(void)
169 struct ec_node *node;
172 /* XXX use EC_NO_ID instead of NULL */
173 node = ec_node_str(NULL, "foo");
175 ec_log(EC_LOG_ERR, "cannot create node\n");
178 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
179 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
180 ret |= EC_TEST_CHECK_PARSE(node, -1, "foobar");
181 ret |= EC_TEST_CHECK_PARSE(node, -1, " foo");
182 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
185 node = ec_node_str(NULL, "Здравствуйте");
187 ec_log(EC_LOG_ERR, "cannot create node\n");
190 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте");
191 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте",
193 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
194 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
197 /* an empty string node always matches */
198 node = ec_node_str(NULL, "");
200 ec_log(EC_LOG_ERR, "cannot create node\n");
203 ret |= EC_TEST_CHECK_PARSE(node, 1, "");
204 ret |= EC_TEST_CHECK_PARSE(node, 1, "", "foo");
205 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
208 /* test completion */
209 node = ec_node_str(NULL, "foo");
211 ec_log(EC_LOG_ERR, "cannot create node\n");
214 ret |= EC_TEST_CHECK_COMPLETE(node,
218 ret |= EC_TEST_CHECK_COMPLETE(node,
220 "foo", EC_NODE_ENDLIST,
222 ret |= EC_TEST_CHECK_COMPLETE(node,
223 "f", EC_NODE_ENDLIST,
224 "oo", EC_NODE_ENDLIST,
226 ret |= EC_TEST_CHECK_COMPLETE(node,
227 "foo", EC_NODE_ENDLIST,
230 ret |= EC_TEST_CHECK_COMPLETE(node,
231 "x", EC_NODE_ENDLIST,
240 static struct ec_test ec_node_str_test = {
242 .test = ec_node_str_testcase,
245 EC_TEST_REGISTER(ec_node_str_test);