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_node_str.h>
46 static struct ec_parsed *ec_node_str_parse(const struct ec_node *gen_node,
47 const struct ec_strvec *strvec)
49 struct ec_node_str *node = (struct ec_node_str *)gen_node;
50 struct ec_strvec *match_strvec;
51 struct ec_parsed *parsed = NULL;
54 parsed = ec_parsed_new();
58 if (ec_strvec_len(strvec) == 0)
61 str = ec_strvec_val(strvec, 0);
62 if (strcmp(str, node->string) != 0)
65 match_strvec = ec_strvec_ndup(strvec, 0, 1);
66 if (match_strvec == NULL)
69 ec_parsed_set_match(parsed, gen_node, match_strvec);
74 ec_parsed_free(parsed);
78 static struct ec_completed *ec_node_str_complete(const struct ec_node *gen_node,
79 const struct ec_strvec *strvec)
81 struct ec_node_str *node = (struct ec_node_str *)gen_node;
82 struct ec_completed *completed;
83 struct ec_completed_elt *completed_elt;
84 const char *str, *add;
87 completed = ec_completed_new();
88 if (completed == NULL)
91 if (ec_strvec_len(strvec) != 1)
94 str = ec_strvec_val(strvec, 0);
95 for (n = 0; n < node->len; n++) {
96 if (str[n] != node->string[n])
103 add = node->string + n;
105 completed_elt = ec_completed_elt_new(gen_node, add);
106 if (completed_elt == NULL) {
107 ec_completed_free(completed);
111 ec_completed_add_elt(completed, completed_elt);
116 static const char *ec_node_str_desc(const struct ec_node *gen_node)
118 struct ec_node_str *node = (struct ec_node_str *)gen_node;
123 static void ec_node_str_free_priv(struct ec_node *gen_node)
125 struct ec_node_str *node = (struct ec_node_str *)gen_node;
127 ec_free(node->string);
130 static struct ec_node_type ec_node_str_type = {
132 .parse = ec_node_str_parse,
133 .complete = ec_node_str_complete,
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_new(&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 static int ec_node_str_testcase(void)
179 struct ec_node *node;
182 /* XXX use EC_NO_ID instead of NULL */
183 node = ec_node_str(NULL, "foo");
185 ec_log(EC_LOG_ERR, "cannot create node\n");
188 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
189 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
190 ret |= EC_TEST_CHECK_PARSE(node, -1, "foobar");
191 ret |= EC_TEST_CHECK_PARSE(node, -1, " foo");
192 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
195 node = ec_node_str(NULL, "Здравствуйте");
197 ec_log(EC_LOG_ERR, "cannot create node\n");
200 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте");
201 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте",
203 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
204 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
207 /* an empty string node always matches */
208 node = ec_node_str(NULL, "");
210 ec_log(EC_LOG_ERR, "cannot create node\n");
213 ret |= EC_TEST_CHECK_PARSE(node, 1, "");
214 ret |= EC_TEST_CHECK_PARSE(node, 1, "", "foo");
215 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
218 /* test completion */
219 node = ec_node_str(NULL, "foo");
221 ec_log(EC_LOG_ERR, "cannot create node\n");
224 ret |= EC_TEST_CHECK_COMPLETE(node,
228 ret |= EC_TEST_CHECK_COMPLETE(node,
230 "foo", EC_NODE_ENDLIST,
232 ret |= EC_TEST_CHECK_COMPLETE(node,
233 "f", EC_NODE_ENDLIST,
234 "oo", EC_NODE_ENDLIST,
236 ret |= EC_TEST_CHECK_COMPLETE(node,
237 "foo", EC_NODE_ENDLIST,
240 ret |= EC_TEST_CHECK_COMPLETE(node,
241 "x", EC_NODE_ENDLIST,
249 static struct ec_test ec_node_str_test = {
251 .test = ec_node_str_testcase,
254 EC_TEST_REGISTER(ec_node_str_test);