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>
48 static struct ec_parsed *ec_node_str_parse(const struct ec_node *gen_node,
49 const struct ec_strvec *strvec)
51 struct ec_node_str *node = (struct ec_node_str *)gen_node;
52 struct ec_strvec *match_strvec;
53 struct ec_parsed *parsed = NULL;
60 if (ec_strvec_len(strvec) == 0)
63 str = ec_strvec_val(strvec, 0);
64 if (strcmp(str, node->string) != 0)
67 match_strvec = ec_strvec_ndup(strvec, 0, 1);
68 if (match_strvec == NULL)
71 ec_parsed_set_match(parsed, gen_node, match_strvec);
76 ec_parsed_free(parsed);
80 static struct ec_completed *ec_node_str_complete(const struct ec_node *gen_node,
81 const struct ec_strvec *strvec)
83 struct ec_node_str *node = (struct ec_node_str *)gen_node;
84 struct ec_completed *completed;
85 struct ec_completed_elt *completed_elt;
86 const char *str, *add;
89 completed = ec_completed();
90 if (completed == NULL)
93 if (ec_strvec_len(strvec) != 1)
96 str = ec_strvec_val(strvec, 0);
97 for (n = 0; n < node->len; n++) {
98 if (str[n] != node->string[n])
105 add = node->string + n;
107 completed_elt = ec_completed_elt(gen_node, add);
108 if (completed_elt == NULL) {
109 ec_completed_free(completed);
113 ec_completed_add_elt(completed, completed_elt);
118 static const char *ec_node_str_desc(const struct ec_node *gen_node)
120 struct ec_node_str *node = (struct ec_node_str *)gen_node;
125 static void ec_node_str_free_priv(struct ec_node *gen_node)
127 struct ec_node_str *node = (struct ec_node_str *)gen_node;
129 ec_free(node->string);
132 static struct ec_node_type ec_node_str_type = {
134 .parse = ec_node_str_parse,
135 .complete = ec_node_str_complete,
136 .desc = ec_node_str_desc,
137 .size = sizeof(struct ec_node_str),
138 .free_priv = ec_node_str_free_priv,
141 EC_NODE_TYPE_REGISTER(ec_node_str_type);
143 int ec_node_str_set_str(struct ec_node *gen_node, const char *str)
145 struct ec_node_str *node = (struct ec_node_str *)gen_node;
149 if (node->string != NULL)
150 return -EEXIST; // XXX allow to replace
152 node->string = ec_strdup(str);
153 if (node->string == NULL)
156 node->len = strlen(node->string);
161 struct ec_node *ec_node_str(const char *id, const char *str)
163 struct ec_node *gen_node = NULL;
165 gen_node = __ec_node(&ec_node_str_type, id);
166 if (gen_node == NULL)
169 if (ec_node_str_set_str(gen_node, str) < 0)
175 ec_node_free(gen_node);
179 static int ec_node_str_testcase(void)
181 struct ec_node *node;
184 /* XXX use EC_NO_ID instead of NULL */
185 node = ec_node_str(NULL, "foo");
187 ec_log(EC_LOG_ERR, "cannot create node\n");
190 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
191 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
192 ret |= EC_TEST_CHECK_PARSE(node, -1, "foobar");
193 ret |= EC_TEST_CHECK_PARSE(node, -1, " foo");
194 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
197 node = ec_node_str(NULL, "Здравствуйте");
199 ec_log(EC_LOG_ERR, "cannot create node\n");
202 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте");
203 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте",
205 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
206 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
209 /* an empty string node always matches */
210 node = ec_node_str(NULL, "");
212 ec_log(EC_LOG_ERR, "cannot create node\n");
215 ret |= EC_TEST_CHECK_PARSE(node, 1, "");
216 ret |= EC_TEST_CHECK_PARSE(node, 1, "", "foo");
217 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
220 /* test completion */
221 node = ec_node_str(NULL, "foo");
223 ec_log(EC_LOG_ERR, "cannot create node\n");
226 ret |= EC_TEST_CHECK_COMPLETE(node,
230 ret |= EC_TEST_CHECK_COMPLETE(node,
232 "foo", EC_NODE_ENDLIST,
234 ret |= EC_TEST_CHECK_COMPLETE(node,
235 "f", EC_NODE_ENDLIST,
236 "oo", EC_NODE_ENDLIST,
238 ret |= EC_TEST_CHECK_COMPLETE(node,
239 "foo", EC_NODE_ENDLIST,
242 ret |= EC_TEST_CHECK_COMPLETE(node,
243 "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);