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.
34 #include <ecoli_malloc.h>
35 #include <ecoli_log.h>
36 #include <ecoli_test.h>
37 #include <ecoli_strvec.h>
39 #include <ecoli_tk_str.h>
40 #include <ecoli_tk_option.h>
41 #include <ecoli_tk_many.h>
50 static struct ec_parsed_tk *ec_tk_many_parse(const struct ec_tk *gen_tk,
51 const struct ec_strvec *strvec)
53 struct ec_tk_many *tk = (struct ec_tk_many *)gen_tk;
54 struct ec_parsed_tk *parsed_tk, *child_parsed_tk;
55 struct ec_strvec *match_strvec;
56 struct ec_strvec *childvec = NULL;
57 size_t off = 0, len, count;
59 parsed_tk = ec_parsed_tk_new();
60 if (parsed_tk == NULL)
63 for (count = 0; tk->max == 0 || count < tk->max; count++) {
64 childvec = ec_strvec_ndup(strvec, off,
65 ec_strvec_len(strvec) - off);
69 child_parsed_tk = ec_tk_parse_tokens(tk->child, childvec);
70 if (child_parsed_tk == NULL)
73 ec_strvec_free(childvec);
76 if (!ec_parsed_tk_matches(child_parsed_tk)) {
77 ec_parsed_tk_free(child_parsed_tk);
81 ec_parsed_tk_add_child(parsed_tk, child_parsed_tk);
83 /* it matches "no token", no need to continue */
84 len = ec_parsed_tk_len(child_parsed_tk);
86 ec_parsed_tk_free(child_parsed_tk);
93 if (count < tk->min) {
94 ec_parsed_tk_free_children(parsed_tk);
98 match_strvec = ec_strvec_ndup(strvec, 0, off);
99 if (match_strvec == NULL)
102 ec_parsed_tk_set_match(parsed_tk, gen_tk, match_strvec);
107 ec_strvec_free(childvec);
108 ec_parsed_tk_free(parsed_tk);
113 static struct ec_completed_tk *ec_tk_many_complete(const struct ec_tk *gen_tk,
114 const struct ec_strvec *strvec)
116 struct ec_tk_many *tk = (struct ec_tk_many *)gen_tk;
117 struct ec_completed_tk *completed_tk, *child_completed_tk;
118 struct ec_strvec *childvec;
119 struct ec_parsed_tk *parsed_tk;
123 completed_tk = ec_completed_tk_new();
124 if (completed_tk == NULL)
130 for (i = 0; i < tk->len; i++) {
131 childvec = ec_strvec_ndup(strvec, len,
132 ec_strvec_len(strvec) - len);
133 if (childvec == NULL)
134 goto fail; // XXX fail ?
136 child_completed_tk = ec_tk_complete_tokens(tk->table[i],
138 if (child_completed_tk == NULL)
141 ec_completed_tk_merge(completed_tk, child_completed_tk);
143 parsed_tk = ec_tk_parse_tokens(tk->table[i], childvec);
144 if (parsed_tk == NULL)
147 ec_strvec_free(childvec);
150 if (!ec_parsed_tk_matches(parsed_tk)) {
151 ec_parsed_tk_free(parsed_tk);
155 len += ec_strvec_len(parsed_tk->strvec);
156 ec_parsed_tk_free(parsed_tk);
162 ec_strvec_free(childvec);
163 ec_completed_tk_free(completed_tk);
168 static void ec_tk_many_free_priv(struct ec_tk *gen_tk)
170 struct ec_tk_many *tk = (struct ec_tk_many *)gen_tk;
172 ec_tk_free(tk->child);
175 static struct ec_tk_ops ec_tk_many_ops = {
177 .parse = ec_tk_many_parse,
178 .complete = ec_tk_default_complete,
179 //XXX .complete = ec_tk_many_complete,
180 .free_priv = ec_tk_many_free_priv,
183 struct ec_tk *ec_tk_many_new(const char *id, struct ec_tk *child,
184 unsigned int min, unsigned int max)
186 struct ec_tk_many *tk = NULL;
191 tk = (struct ec_tk_many *)ec_tk_new(id, &ec_tk_many_ops,
205 static int ec_tk_many_testcase(void)
210 tk = ec_tk_many_new(NULL, ec_tk_str(NULL, "foo"), 0, 0);
212 ec_log(EC_LOG_ERR, "cannot create tk\n");
215 ret |= EC_TEST_CHECK_TK_PARSE(tk, 0, "bar", EC_TK_ENDLIST);
216 ret |= EC_TEST_CHECK_TK_PARSE(tk, 1, "foo", "bar", EC_TK_ENDLIST);
217 ret |= EC_TEST_CHECK_TK_PARSE(tk, 2, "foo", "foo", "bar",
219 ret |= EC_TEST_CHECK_TK_PARSE(tk, 0, EC_TK_ENDLIST);
222 tk = ec_tk_many_new(NULL, ec_tk_str(NULL, "foo"), 1, 0);
224 ec_log(EC_LOG_ERR, "cannot create tk\n");
227 ret |= EC_TEST_CHECK_TK_PARSE(tk, -1, "bar", EC_TK_ENDLIST);
228 ret |= EC_TEST_CHECK_TK_PARSE(tk, 1, "foo", "bar", EC_TK_ENDLIST);
229 ret |= EC_TEST_CHECK_TK_PARSE(tk, 2, "foo", "foo", "bar",
231 ret |= EC_TEST_CHECK_TK_PARSE(tk, -1, EC_TK_ENDLIST);
234 tk = ec_tk_many_new(NULL, ec_tk_str(NULL, "foo"), 1, 2);
236 ec_log(EC_LOG_ERR, "cannot create tk\n");
239 ret |= EC_TEST_CHECK_TK_PARSE(tk, -1, "bar", EC_TK_ENDLIST);
240 ret |= EC_TEST_CHECK_TK_PARSE(tk, 1, "foo", "bar", EC_TK_ENDLIST);
241 ret |= EC_TEST_CHECK_TK_PARSE(tk, 2, "foo", "foo", "bar",
243 ret |= EC_TEST_CHECK_TK_PARSE(tk, 2, "foo", "foo", "foo",
245 ret |= EC_TEST_CHECK_TK_PARSE(tk, -1, EC_TK_ENDLIST);
248 /* test completion */
254 static struct ec_test ec_tk_many_test = {
256 .test = ec_tk_many_testcase,
259 EC_REGISTER_TEST(ec_tk_many_test);