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.
36 #include <ecoli_malloc.h>
37 #include <ecoli_log.h>
38 #include <ecoli_test.h>
39 #include <ecoli_strvec.h>
40 #include <ecoli_node.h>
41 #include <ecoli_parsed.h>
42 #include <ecoli_completed.h>
43 #include <ecoli_node_seq.h>
44 #include <ecoli_node_str.h>
45 #include <ecoli_node_option.h>
46 #include <ecoli_node_sh_lex.h>
48 struct ec_node_sh_lex {
50 struct ec_node *child;
53 static size_t eat_spaces(const char *str)
58 while (isblank(str[i]))
65 * Allocate a new string which is a copy of the input string with quotes
66 * removed. If quotes are not closed properly, set missing_quote to the
69 static char *unquote_str(const char *str, size_t n, int allow_missing_quote,
72 unsigned s = 1, d = 0;
83 /* copy string and remove quotes */
84 while (s < n && d < n && str[s] != '\0') {
85 if (str[s] == '\\' && str[s+1] == quote) {
90 if (str[s] == '\\' && str[s+1] == '\\') {
95 if (str[s] == quote) {
103 /* not enough room in dst buffer (should not happen) */
110 /* quote not closed */
112 if (missing_quote != NULL)
113 *missing_quote = str[0];
114 if (allow_missing_quote == 0) {
125 static size_t eat_quoted_str(const char *str)
130 while (str[i] != '\0') {
131 if (str[i] != '\\' && str[i+1] == quote)
136 /* unclosed quote, will be detected later */
140 static size_t eat_str(const char *str)
145 while (!isblank(str[i]) && str[i] != '\0')
151 static struct ec_strvec *tokenize(const char *str, int completion,
152 int allow_missing_quote, char *missing_quote)
154 struct ec_strvec *strvec = NULL;
155 size_t off = 0, len, suboff, sublen;
156 char *word = NULL, *concat = NULL, *tmp;
157 int last_is_space = 1;
159 // printf("str=%s\n", str);
161 strvec = ec_strvec();
165 while (str[off] != '\0') {
166 len = eat_spaces(&str[off]);
169 // printf("space=%zd\n", len);
174 while (str[suboff] != '\0') {
176 if (str[suboff] == '"' || str[suboff] == '\'') {
177 sublen = eat_quoted_str(&str[suboff]);
178 // printf("sublen=%zd\n", sublen);
179 word = unquote_str(&str[suboff], sublen,
180 allow_missing_quote, missing_quote);
182 sublen = eat_str(&str[suboff]);
183 // printf("sublen=%zd\n", sublen);
186 word = ec_strndup(&str[suboff], sublen);
191 // printf("word=%s\n", word);
196 if (concat == NULL) {
200 tmp = ec_realloc(concat, len + 1);
204 strcat(concat, word);
210 if (concat != NULL) {
211 if (ec_strvec_add(strvec, concat) < 0)
217 /* XXX remove all printf comments */
218 // printf("str off=%zd len=%zd\n", off, len);
222 /* in completion mode, append an empty string in the vector if
223 * the input string ends with space */
224 if (completion && last_is_space) {
225 if (ec_strvec_add(strvec, "") < 0)
234 ec_strvec_free(strvec);
239 ec_node_sh_lex_parse(const struct ec_node *gen_node,
240 struct ec_parsed *state,
241 const struct ec_strvec *strvec)
243 struct ec_node_sh_lex *node = (struct ec_node_sh_lex *)gen_node;
244 struct ec_strvec *new_vec = NULL;
245 struct ec_parsed *child_parsed;
249 if (ec_strvec_len(strvec) == 0) {
250 new_vec = ec_strvec();
252 str = ec_strvec_val(strvec, 0);
253 new_vec = tokenize(str, 0, 0, NULL);
255 if (new_vec == NULL) {
260 ret = ec_node_parse_child(node->child, state, new_vec);
262 if ((unsigned)ret == ec_strvec_len(new_vec)) {
265 child_parsed = ec_parsed_get_last_child(state);
266 ec_parsed_del_child(state, child_parsed);
267 ec_parsed_free(child_parsed);
268 ret = EC_PARSED_NOMATCH;
272 ec_strvec_free(new_vec);
278 ec_strvec_free(new_vec);
283 ec_node_sh_lex_complete(const struct ec_node *gen_node,
284 struct ec_completed *completed,
285 struct ec_parsed *parsed,
286 const struct ec_strvec *strvec)
288 struct ec_node_sh_lex *node = (struct ec_node_sh_lex *)gen_node;
289 struct ec_strvec *new_vec = NULL;
294 if (ec_strvec_len(strvec) != 1)
297 str = ec_strvec_val(strvec, 0);
298 new_vec = tokenize(str, 1, 1, &missing_quote);
302 ret = ec_node_complete_child(node->child, completed, parsed, new_vec);
306 ec_strvec_free(new_vec);
311 ec_strvec_free(new_vec);
315 static void ec_node_sh_lex_free_priv(struct ec_node *gen_node)
317 struct ec_node_sh_lex *node = (struct ec_node_sh_lex *)gen_node;
319 ec_node_free(node->child);
322 static struct ec_node_type ec_node_sh_lex_type = {
324 .parse = ec_node_sh_lex_parse,
325 .complete = ec_node_sh_lex_complete,
326 .size = sizeof(struct ec_node_sh_lex),
327 .free_priv = ec_node_sh_lex_free_priv,
330 EC_NODE_TYPE_REGISTER(ec_node_sh_lex_type);
332 struct ec_node *ec_node_sh_lex(const char *id, struct ec_node *child)
334 struct ec_node_sh_lex *node = NULL;
339 node = (struct ec_node_sh_lex *)__ec_node(&ec_node_sh_lex_type, id);
350 /* LCOV_EXCL_START */
351 static int ec_node_sh_lex_testcase(void)
353 struct ec_node *node;
356 node = ec_node_sh_lex(NULL,
358 ec_node_str(NULL, "foo"),
360 ec_node_str(NULL, "toto")
362 ec_node_str(NULL, "bar")
366 ec_log(EC_LOG_ERR, "cannot create node\n");
369 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo bar");
370 ret |= EC_TEST_CHECK_PARSE(node, 1, " foo bar");
371 ret |= EC_TEST_CHECK_PARSE(node, 1, " 'foo' \"bar\"");
372 ret |= EC_TEST_CHECK_PARSE(node, 1, " 'f'oo 'toto' bar");
375 /* test completion */
376 node = ec_node_sh_lex(NULL,
378 ec_node_str(NULL, "foo"),
380 ec_node_str(NULL, "toto")
382 ec_node_str(NULL, "bar"),
383 ec_node_str(NULL, "titi")
387 ec_log(EC_LOG_ERR, "cannot create node\n");
390 ret |= EC_TEST_CHECK_COMPLETE(node,
392 "foo", EC_NODE_ENDLIST,
394 ret |= EC_TEST_CHECK_COMPLETE(node,
395 " ", EC_NODE_ENDLIST,
396 "foo", EC_NODE_ENDLIST,
398 ret |= EC_TEST_CHECK_COMPLETE(node,
399 "f", EC_NODE_ENDLIST,
400 "oo", EC_NODE_ENDLIST,
402 ret |= EC_TEST_CHECK_COMPLETE(node,
403 "foo", EC_NODE_ENDLIST,
406 ret |= EC_TEST_CHECK_COMPLETE(node,
407 "foo ", EC_NODE_ENDLIST,
408 "bar", "toto", EC_NODE_ENDLIST,
410 ret |= EC_TEST_CHECK_COMPLETE(node,
411 "foo t", EC_NODE_ENDLIST,
412 "oto", EC_NODE_ENDLIST,
414 ret |= EC_TEST_CHECK_COMPLETE(node,
415 "foo b", EC_NODE_ENDLIST,
416 "ar", EC_NODE_ENDLIST,
418 ret |= EC_TEST_CHECK_COMPLETE(node,
419 "foo bar", EC_NODE_ENDLIST,
422 ret |= EC_TEST_CHECK_COMPLETE(node,
423 "foo bar ", EC_NODE_ENDLIST,
424 "titi", EC_NODE_ENDLIST,
426 ret |= EC_TEST_CHECK_COMPLETE(node,
427 "foo toto bar ", EC_NODE_ENDLIST,
428 "titi", EC_NODE_ENDLIST,
430 ret |= EC_TEST_CHECK_COMPLETE(node,
431 "x", EC_NODE_ENDLIST,
434 ret |= EC_TEST_CHECK_COMPLETE(node,
435 "foo barx", EC_NODE_ENDLIST,
444 static struct ec_test ec_node_sh_lex_test = {
445 .name = "node_sh_lex",
446 .test = ec_node_sh_lex_testcase,
449 EC_TEST_REGISTER(ec_node_sh_lex_test);