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>
42 EC_LOG_TYPE_REGISTER(node_str);
51 ec_node_str_parse(const struct ec_node *gen_node,
52 struct ec_parsed *state,
53 const struct ec_strvec *strvec)
55 struct ec_node_str *node = (struct ec_node_str *)gen_node;
60 if (ec_strvec_len(strvec) == 0)
61 return EC_PARSED_NOMATCH;
63 str = ec_strvec_val(strvec, 0);
64 if (strcmp(str, node->string) != 0)
65 return EC_PARSED_NOMATCH;
71 ec_node_str_complete(const struct ec_node *gen_node,
72 struct ec_completed *completed,
73 const struct ec_strvec *strvec)
75 struct ec_node_str *node = (struct ec_node_str *)gen_node;
79 if (ec_strvec_len(strvec) != 1)
82 str = ec_strvec_val(strvec, 0);
83 for (n = 0; n < node->len; n++) {
84 if (str[n] != node->string[n])
90 return EC_PARSED_NOMATCH;
92 if (ec_completed_add_item(completed, gen_node, NULL, EC_COMP_FULL,
93 str, node->string) < 0)
99 static const char *ec_node_str_desc(const struct ec_node *gen_node)
101 struct ec_node_str *node = (struct ec_node_str *)gen_node;
106 static void ec_node_str_free_priv(struct ec_node *gen_node)
108 struct ec_node_str *node = (struct ec_node_str *)gen_node;
110 ec_free(node->string);
113 static struct ec_node_type ec_node_str_type = {
115 .parse = ec_node_str_parse,
116 .complete = ec_node_str_complete,
117 .desc = ec_node_str_desc,
118 .size = sizeof(struct ec_node_str),
119 .free_priv = ec_node_str_free_priv,
122 EC_NODE_TYPE_REGISTER(ec_node_str_type);
124 int ec_node_str_set_str(struct ec_node *gen_node, const char *str)
126 struct ec_node_str *node = (struct ec_node_str *)gen_node;
129 ret = ec_node_check_type(gen_node, &ec_node_str_type);
135 ec_free(node->string);
136 node->string = ec_strdup(str);
137 if (node->string == NULL)
140 node->len = strlen(node->string);
145 struct ec_node *ec_node_str(const char *id, const char *str)
147 struct ec_node *gen_node = NULL;
149 gen_node = __ec_node(&ec_node_str_type, id);
150 if (gen_node == NULL)
153 if (ec_node_str_set_str(gen_node, str) < 0)
159 ec_node_free(gen_node);
163 /* LCOV_EXCL_START */
164 static int ec_node_str_testcase(void)
166 struct ec_node *node;
169 node = ec_node_str(EC_NO_ID, "foo");
171 EC_LOG(EC_LOG_ERR, "cannot create node\n");
174 EC_TEST_ASSERT(!strcmp(ec_node_desc(node), "foo"));
175 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
176 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo", "bar");
177 ret |= EC_TEST_CHECK_PARSE(node, -1, "foobar");
178 ret |= EC_TEST_CHECK_PARSE(node, -1, " foo");
179 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
182 node = ec_node_str(EC_NO_ID, "Здравствуйте");
184 EC_LOG(EC_LOG_ERR, "cannot create node\n");
187 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте");
188 ret |= EC_TEST_CHECK_PARSE(node, 1, "Здравствуйте",
190 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
191 ret |= EC_TEST_CHECK_PARSE(node, -1, "");
194 /* an empty string node always matches */
195 node = ec_node_str(EC_NO_ID, "");
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, "", "foo");
202 ret |= EC_TEST_CHECK_PARSE(node, -1, "foo");
205 /* test completion */
206 node = ec_node_str(EC_NO_ID, "foo");
208 EC_LOG(EC_LOG_ERR, "cannot create node\n");
211 ret |= EC_TEST_CHECK_COMPLETE(node,
214 ret |= EC_TEST_CHECK_COMPLETE(node,
216 "foo", EC_NODE_ENDLIST);
217 ret |= EC_TEST_CHECK_COMPLETE(node,
218 "f", EC_NODE_ENDLIST,
219 "foo", EC_NODE_ENDLIST);
220 ret |= EC_TEST_CHECK_COMPLETE(node,
221 "foo", EC_NODE_ENDLIST,
222 "foo", EC_NODE_ENDLIST);
223 ret |= EC_TEST_CHECK_COMPLETE(node,
224 "x", EC_NODE_ENDLIST,
232 static struct ec_test ec_node_str_test = {
234 .test = ec_node_str_testcase,
237 EC_TEST_REGISTER(ec_node_str_test);