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.
28 #define _GNU_SOURCE /* for asprintf */
29 #include <sys/types.h>
38 #include <ecoli_log.h>
39 #include <ecoli_malloc.h>
40 #include <ecoli_test.h>
41 #include <ecoli_strvec.h>
42 #include <ecoli_string.h>
43 #include <ecoli_node.h>
44 #include <ecoli_parsed.h>
45 #include <ecoli_completed.h>
46 #include <ecoli_node_file.h>
48 EC_LOG_TYPE_REGISTER(node_file);
55 ec_node_file_parse(const struct ec_node *gen_node,
56 struct ec_parsed *state,
57 const struct ec_strvec *strvec)
62 if (ec_strvec_len(strvec) == 0)
63 return EC_PARSED_NOMATCH;
69 * Almost the same than dirname (3) and basename (3) except that:
70 * - it always returns a substring of the given path, which can
72 * - the behavior is different when the path finishes with a '/'
73 * - the path argument is not modified
74 * - the outputs are allocated and must be freed with ec_free().
76 * path dirname basename split_path
77 * /usr/lib /usr lib /usr/ lib
84 static int split_path(const char *path, char **dname_p, char **bname_p)
93 last_slash = strrchr(path, '/');
94 if (last_slash == NULL)
97 dirlen = last_slash - path + 1;
99 dname = ec_strdup(path);
102 dname[dirlen] = '\0';
104 bname = ec_strdup(path + dirlen);
117 ec_node_file_complete(const struct ec_node *gen_node,
118 struct ec_completed *completed,
119 const struct ec_strvec *strvec)
121 struct ec_completed_item *item = NULL;
125 struct dirent *de = NULL;
127 char *dname = NULL, *bname = NULL, *effective_dir;
128 char *comp_str = NULL;
129 char *disp_str = NULL;
134 * Example with this file tree:
145 * Input Output completions
146 * / [dir1/, dir2/, file5]
149 * /dir1/ [file1, file2, subdir/]
155 if (ec_strvec_len(strvec) != 1)
158 input = ec_strvec_val(strvec, 0);
159 ret = split_path(input, &dname, &bname);
161 ec_completed_free(completed);
166 if (strcmp(dname, "") == 0)
169 effective_dir = dname;
171 ret = lstat(effective_dir, &st);
176 if (!S_ISDIR(st.st_mode))
179 dir = opendir(effective_dir);
183 bname_len = strlen(bname);
189 if (!ec_str_startswith(de->d_name, bname))
191 if (bname[0] != '.' && de->d_name[0] == '.')
194 /* add '/' if it's a dir */
195 if (de->d_type == DT_DIR) {
197 } else if (de->d_type == DT_UNKNOWN) { // XXX todo
202 item = ec_completed_item(gen_node);
209 if (asprintf(&comp_str, "%s%s/", input,
210 &de->d_name[bname_len]) < 0) {
214 if (asprintf(&disp_str, "%s/", de->d_name) < 0) {
218 ret = ec_completed_item_set(item, EC_PARTIAL_MATCH,
223 if (asprintf(&comp_str, "%s%s", input,
224 &de->d_name[bname_len]) < 0) {
228 if (asprintf(&disp_str, "%s", de->d_name) < 0) {
232 ret = ec_completed_item_set(item, EC_COMP_FULL,
237 ret = ec_completed_item_set_display(item, disp_str);
240 ret = ec_completed_item_add(completed, item);
253 ec_completed_item_free(item);
264 static struct ec_node_type ec_node_file_type = {
266 .parse = ec_node_file_parse,
267 .complete = ec_node_file_complete,
268 .size = sizeof(struct ec_node_file),
271 EC_NODE_TYPE_REGISTER(ec_node_file_type);
273 /* LCOV_EXCL_START */
274 static int ec_node_file_testcase(void)
276 struct ec_node *node;
279 node = ec_node("file", NULL);
281 EC_LOG(EC_LOG_ERR, "cannot create node\n");
284 /* any string matches */
285 ret |= EC_TEST_CHECK_PARSE(node, 1, "foo");
286 ret |= EC_TEST_CHECK_PARSE(node, 1, "/tmp/bar");
287 ret |= EC_TEST_CHECK_PARSE(node, -1);
289 /* test completion */
290 #if 0 // XXX how to properly test file completion?
291 ret |= EC_TEST_CHECK_COMPLETE(node,
294 ret |= EC_TEST_CHECK_COMPLETE(node,
297 ret |= EC_TEST_CHECK_COMPLETE(node,
298 "/", EC_NODE_ENDLIST,
300 ret |= EC_TEST_CHECK_COMPLETE(node,
301 "/tmp", EC_NODE_ENDLIST,
303 ret |= EC_TEST_CHECK_COMPLETE(node,
304 "/tmp/", EC_NODE_ENDLIST,
306 ret |= EC_TEST_CHECK_COMPLETE(node,
307 "/tmp/.", EC_NODE_ENDLIST,
316 static struct ec_test ec_node_file_test = {
318 .test = ec_node_file_testcase,
321 EC_TEST_REGISTER(ec_node_file_test);