filecomplete.c revision 1.46 1 1.46 abhinav /* $NetBSD: filecomplete.c,v 1.46 2017/09/16 20:40:34 abhinav Exp $ */
2 1.1 dsl
3 1.1 dsl /*-
4 1.1 dsl * Copyright (c) 1997 The NetBSD Foundation, Inc.
5 1.1 dsl * All rights reserved.
6 1.1 dsl *
7 1.1 dsl * This code is derived from software contributed to The NetBSD Foundation
8 1.1 dsl * by Jaromir Dolecek.
9 1.1 dsl *
10 1.1 dsl * Redistribution and use in source and binary forms, with or without
11 1.1 dsl * modification, are permitted provided that the following conditions
12 1.1 dsl * are met:
13 1.1 dsl * 1. Redistributions of source code must retain the above copyright
14 1.1 dsl * notice, this list of conditions and the following disclaimer.
15 1.1 dsl * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 dsl * notice, this list of conditions and the following disclaimer in the
17 1.1 dsl * documentation and/or other materials provided with the distribution.
18 1.1 dsl *
19 1.1 dsl * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1 dsl * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1 dsl * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1 dsl * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1 dsl * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1 dsl * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1 dsl * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1 dsl * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1 dsl * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1 dsl * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1 dsl * POSSIBILITY OF SUCH DAMAGE.
30 1.1 dsl */
31 1.1 dsl
32 1.1 dsl #include "config.h"
33 1.1 dsl #if !defined(lint) && !defined(SCCSID)
34 1.46 abhinav __RCSID("$NetBSD: filecomplete.c,v 1.46 2017/09/16 20:40:34 abhinav Exp $");
35 1.1 dsl #endif /* not lint && not SCCSID */
36 1.1 dsl
37 1.1 dsl #include <sys/types.h>
38 1.1 dsl #include <sys/stat.h>
39 1.1 dsl #include <dirent.h>
40 1.40 christos #include <errno.h>
41 1.40 christos #include <fcntl.h>
42 1.40 christos #include <limits.h>
43 1.1 dsl #include <pwd.h>
44 1.40 christos #include <stdio.h>
45 1.1 dsl #include <stdlib.h>
46 1.40 christos #include <string.h>
47 1.1 dsl #include <unistd.h>
48 1.28 christos
49 1.1 dsl #include "el.h"
50 1.1 dsl #include "filecomplete.h"
51 1.1 dsl
52 1.43 christos static const wchar_t break_chars[] = L" \t\n\"\\'`@$><=;|&{(";
53 1.1 dsl
54 1.1 dsl /********************************/
55 1.1 dsl /* completion functions */
56 1.1 dsl
57 1.1 dsl /*
58 1.1 dsl * does tilde expansion of strings of type ``~user/foo''
59 1.1 dsl * if ``user'' isn't valid user name or ``txt'' doesn't start
60 1.1 dsl * w/ '~', returns pointer to strdup()ed copy of ``txt''
61 1.1 dsl *
62 1.34 riz * it's the caller's responsibility to free() the returned string
63 1.1 dsl */
64 1.1 dsl char *
65 1.7 christos fn_tilde_expand(const char *txt)
66 1.1 dsl {
67 1.25 christos #if defined(HAVE_GETPW_R_POSIX) || defined(HAVE_GETPW_R_DRAFT)
68 1.25 christos struct passwd pwres;
69 1.25 christos char pwbuf[1024];
70 1.25 christos #endif
71 1.25 christos struct passwd *pass;
72 1.1 dsl char *temp;
73 1.1 dsl size_t len = 0;
74 1.1 dsl
75 1.1 dsl if (txt[0] != '~')
76 1.27 christos return strdup(txt);
77 1.1 dsl
78 1.1 dsl temp = strchr(txt + 1, '/');
79 1.1 dsl if (temp == NULL) {
80 1.1 dsl temp = strdup(txt + 1);
81 1.1 dsl if (temp == NULL)
82 1.1 dsl return NULL;
83 1.1 dsl } else {
84 1.30 christos /* text until string after slash */
85 1.30 christos len = (size_t)(temp - txt + 1);
86 1.26 christos temp = el_malloc(len * sizeof(*temp));
87 1.1 dsl if (temp == NULL)
88 1.1 dsl return NULL;
89 1.1 dsl (void)strncpy(temp, txt + 1, len - 2);
90 1.1 dsl temp[len - 2] = '\0';
91 1.1 dsl }
92 1.3 dsl if (temp[0] == 0) {
93 1.24 christos #ifdef HAVE_GETPW_R_POSIX
94 1.40 christos if (getpwuid_r(getuid(), &pwres, pwbuf, sizeof(pwbuf),
95 1.24 christos &pass) != 0)
96 1.40 christos pass = NULL;
97 1.24 christos #elif HAVE_GETPW_R_DRAFT
98 1.24 christos pass = getpwuid_r(getuid(), &pwres, pwbuf, sizeof(pwbuf));
99 1.24 christos #else
100 1.24 christos pass = getpwuid(getuid());
101 1.24 christos #endif
102 1.3 dsl } else {
103 1.24 christos #ifdef HAVE_GETPW_R_POSIX
104 1.3 dsl if (getpwnam_r(temp, &pwres, pwbuf, sizeof(pwbuf), &pass) != 0)
105 1.3 dsl pass = NULL;
106 1.24 christos #elif HAVE_GETPW_R_DRAFT
107 1.24 christos pass = getpwnam_r(temp, &pwres, pwbuf, sizeof(pwbuf));
108 1.24 christos #else
109 1.24 christos pass = getpwnam(temp);
110 1.24 christos #endif
111 1.3 dsl }
112 1.26 christos el_free(temp); /* value no more needed */
113 1.1 dsl if (pass == NULL)
114 1.27 christos return strdup(txt);
115 1.1 dsl
116 1.1 dsl /* update pointer txt to point at string immedially following */
117 1.1 dsl /* first slash */
118 1.1 dsl txt += len;
119 1.1 dsl
120 1.26 christos len = strlen(pass->pw_dir) + 1 + strlen(txt) + 1;
121 1.26 christos temp = el_malloc(len * sizeof(*temp));
122 1.1 dsl if (temp == NULL)
123 1.1 dsl return NULL;
124 1.26 christos (void)snprintf(temp, len, "%s/%s", pass->pw_dir, txt);
125 1.1 dsl
126 1.27 christos return temp;
127 1.1 dsl }
128 1.1 dsl
129 1.1 dsl
130 1.1 dsl /*
131 1.1 dsl * return first found file name starting by the ``text'' or NULL if no
132 1.1 dsl * such file can be found
133 1.1 dsl * value of ``state'' is ignored
134 1.1 dsl *
135 1.33 snj * it's the caller's responsibility to free the returned string
136 1.1 dsl */
137 1.2 dsl char *
138 1.7 christos fn_filename_completion_function(const char *text, int state)
139 1.1 dsl {
140 1.1 dsl static DIR *dir = NULL;
141 1.3 dsl static char *filename = NULL, *dirname = NULL, *dirpath = NULL;
142 1.1 dsl static size_t filename_len = 0;
143 1.1 dsl struct dirent *entry;
144 1.1 dsl char *temp;
145 1.1 dsl size_t len;
146 1.1 dsl
147 1.1 dsl if (state == 0 || dir == NULL) {
148 1.1 dsl temp = strrchr(text, '/');
149 1.1 dsl if (temp) {
150 1.1 dsl char *nptr;
151 1.1 dsl temp++;
152 1.26 christos nptr = el_realloc(filename, (strlen(temp) + 1) *
153 1.26 christos sizeof(*nptr));
154 1.1 dsl if (nptr == NULL) {
155 1.26 christos el_free(filename);
156 1.19 christos filename = NULL;
157 1.1 dsl return NULL;
158 1.1 dsl }
159 1.1 dsl filename = nptr;
160 1.1 dsl (void)strcpy(filename, temp);
161 1.30 christos len = (size_t)(temp - text); /* including last slash */
162 1.19 christos
163 1.26 christos nptr = el_realloc(dirname, (len + 1) *
164 1.26 christos sizeof(*nptr));
165 1.1 dsl if (nptr == NULL) {
166 1.26 christos el_free(dirname);
167 1.19 christos dirname = NULL;
168 1.1 dsl return NULL;
169 1.1 dsl }
170 1.1 dsl dirname = nptr;
171 1.1 dsl (void)strncpy(dirname, text, len);
172 1.1 dsl dirname[len] = '\0';
173 1.1 dsl } else {
174 1.26 christos el_free(filename);
175 1.1 dsl if (*text == 0)
176 1.1 dsl filename = NULL;
177 1.1 dsl else {
178 1.1 dsl filename = strdup(text);
179 1.1 dsl if (filename == NULL)
180 1.1 dsl return NULL;
181 1.1 dsl }
182 1.26 christos el_free(dirname);
183 1.1 dsl dirname = NULL;
184 1.1 dsl }
185 1.1 dsl
186 1.1 dsl if (dir != NULL) {
187 1.1 dsl (void)closedir(dir);
188 1.1 dsl dir = NULL;
189 1.1 dsl }
190 1.3 dsl
191 1.3 dsl /* support for ``~user'' syntax */
192 1.19 christos
193 1.26 christos el_free(dirpath);
194 1.19 christos dirpath = NULL;
195 1.19 christos if (dirname == NULL) {
196 1.19 christos if ((dirname = strdup("")) == NULL)
197 1.19 christos return NULL;
198 1.19 christos dirpath = strdup("./");
199 1.19 christos } else if (*dirname == '~')
200 1.7 christos dirpath = fn_tilde_expand(dirname);
201 1.4 christos else
202 1.4 christos dirpath = strdup(dirname);
203 1.4 christos
204 1.4 christos if (dirpath == NULL)
205 1.4 christos return NULL;
206 1.4 christos
207 1.3 dsl dir = opendir(dirpath);
208 1.1 dsl if (!dir)
209 1.27 christos return NULL; /* cannot open the directory */
210 1.3 dsl
211 1.3 dsl /* will be used in cycle */
212 1.3 dsl filename_len = filename ? strlen(filename) : 0;
213 1.1 dsl }
214 1.1 dsl
215 1.1 dsl /* find the match */
216 1.1 dsl while ((entry = readdir(dir)) != NULL) {
217 1.1 dsl /* skip . and .. */
218 1.1 dsl if (entry->d_name[0] == '.' && (!entry->d_name[1]
219 1.1 dsl || (entry->d_name[1] == '.' && !entry->d_name[2])))
220 1.1 dsl continue;
221 1.1 dsl if (filename_len == 0)
222 1.1 dsl break;
223 1.1 dsl /* otherwise, get first entry where first */
224 1.1 dsl /* filename_len characters are equal */
225 1.1 dsl if (entry->d_name[0] == filename[0]
226 1.13 apb #if HAVE_STRUCT_DIRENT_D_NAMLEN
227 1.13 apb && entry->d_namlen >= filename_len
228 1.13 apb #else
229 1.1 dsl && strlen(entry->d_name) >= filename_len
230 1.1 dsl #endif
231 1.1 dsl && strncmp(entry->d_name, filename,
232 1.1 dsl filename_len) == 0)
233 1.1 dsl break;
234 1.1 dsl }
235 1.1 dsl
236 1.1 dsl if (entry) { /* match found */
237 1.1 dsl
238 1.13 apb #if HAVE_STRUCT_DIRENT_D_NAMLEN
239 1.13 apb len = entry->d_namlen;
240 1.13 apb #else
241 1.3 dsl len = strlen(entry->d_name);
242 1.1 dsl #endif
243 1.1 dsl
244 1.26 christos len = strlen(dirname) + len + 1;
245 1.26 christos temp = el_malloc(len * sizeof(*temp));
246 1.3 dsl if (temp == NULL)
247 1.3 dsl return NULL;
248 1.26 christos (void)snprintf(temp, len, "%s%s", dirname, entry->d_name);
249 1.1 dsl } else {
250 1.1 dsl (void)closedir(dir);
251 1.1 dsl dir = NULL;
252 1.1 dsl temp = NULL;
253 1.1 dsl }
254 1.1 dsl
255 1.27 christos return temp;
256 1.1 dsl }
257 1.1 dsl
258 1.1 dsl
259 1.6 christos static const char *
260 1.6 christos append_char_function(const char *name)
261 1.6 christos {
262 1.6 christos struct stat stbuf;
263 1.7 christos char *expname = *name == '~' ? fn_tilde_expand(name) : NULL;
264 1.12 christos const char *rs = " ";
265 1.6 christos
266 1.6 christos if (stat(expname ? expname : name, &stbuf) == -1)
267 1.6 christos goto out;
268 1.6 christos if (S_ISDIR(stbuf.st_mode))
269 1.6 christos rs = "/";
270 1.6 christos out:
271 1.6 christos if (expname)
272 1.26 christos el_free(expname);
273 1.6 christos return rs;
274 1.6 christos }
275 1.1 dsl /*
276 1.1 dsl * returns list of completions for text given
277 1.5 christos * non-static for readline.
278 1.1 dsl */
279 1.5 christos char ** completion_matches(const char *, char *(*)(const char *, int));
280 1.5 christos char **
281 1.1 dsl completion_matches(const char *text, char *(*genfunc)(const char *, int))
282 1.1 dsl {
283 1.1 dsl char **match_list = NULL, *retstr, *prevstr;
284 1.1 dsl size_t match_list_len, max_equal, which, i;
285 1.1 dsl size_t matches;
286 1.1 dsl
287 1.1 dsl matches = 0;
288 1.1 dsl match_list_len = 1;
289 1.1 dsl while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
290 1.1 dsl /* allow for list terminator here */
291 1.1 dsl if (matches + 3 >= match_list_len) {
292 1.1 dsl char **nmatch_list;
293 1.1 dsl while (matches + 3 >= match_list_len)
294 1.1 dsl match_list_len <<= 1;
295 1.26 christos nmatch_list = el_realloc(match_list,
296 1.26 christos match_list_len * sizeof(*nmatch_list));
297 1.1 dsl if (nmatch_list == NULL) {
298 1.26 christos el_free(match_list);
299 1.1 dsl return NULL;
300 1.1 dsl }
301 1.1 dsl match_list = nmatch_list;
302 1.1 dsl
303 1.1 dsl }
304 1.1 dsl match_list[++matches] = retstr;
305 1.1 dsl }
306 1.1 dsl
307 1.1 dsl if (!match_list)
308 1.1 dsl return NULL; /* nothing found */
309 1.1 dsl
310 1.1 dsl /* find least denominator and insert it to match_list[0] */
311 1.1 dsl which = 2;
312 1.1 dsl prevstr = match_list[1];
313 1.1 dsl max_equal = strlen(prevstr);
314 1.1 dsl for (; which <= matches; which++) {
315 1.1 dsl for (i = 0; i < max_equal &&
316 1.1 dsl prevstr[i] == match_list[which][i]; i++)
317 1.1 dsl continue;
318 1.1 dsl max_equal = i;
319 1.1 dsl }
320 1.1 dsl
321 1.26 christos retstr = el_malloc((max_equal + 1) * sizeof(*retstr));
322 1.1 dsl if (retstr == NULL) {
323 1.26 christos el_free(match_list);
324 1.1 dsl return NULL;
325 1.1 dsl }
326 1.1 dsl (void)strncpy(retstr, match_list[1], max_equal);
327 1.1 dsl retstr[max_equal] = '\0';
328 1.1 dsl match_list[0] = retstr;
329 1.1 dsl
330 1.1 dsl /* add NULL as last pointer to the array */
331 1.31 plunky match_list[matches + 1] = NULL;
332 1.1 dsl
333 1.27 christos return match_list;
334 1.1 dsl }
335 1.1 dsl
336 1.1 dsl /*
337 1.1 dsl * Sort function for qsort(). Just wrapper around strcasecmp().
338 1.1 dsl */
339 1.1 dsl static int
340 1.1 dsl _fn_qsort_string_compare(const void *i1, const void *i2)
341 1.1 dsl {
342 1.1 dsl const char *s1 = ((const char * const *)i1)[0];
343 1.1 dsl const char *s2 = ((const char * const *)i2)[0];
344 1.1 dsl
345 1.1 dsl return strcasecmp(s1, s2);
346 1.1 dsl }
347 1.1 dsl
348 1.1 dsl /*
349 1.1 dsl * Display list of strings in columnar format on readline's output stream.
350 1.21 dholland * 'matches' is list of strings, 'num' is number of strings in 'matches',
351 1.21 dholland * 'width' is maximum length of string in 'matches'.
352 1.21 dholland *
353 1.23 dholland * matches[0] is not one of the match strings, but it is counted in
354 1.23 dholland * num, so the strings are matches[1] *through* matches[num-1].
355 1.1 dsl */
356 1.1 dsl void
357 1.45 abhinav fn_display_match_list(EditLine * el, char **matches, size_t num, size_t width,
358 1.45 abhinav const char *(*app_func) (const char *))
359 1.1 dsl {
360 1.21 dholland size_t line, lines, col, cols, thisguy;
361 1.24 christos int screenwidth = el->el_terminal.t_size.h;
362 1.45 abhinav if (app_func == NULL)
363 1.45 abhinav app_func = append_char_function;
364 1.1 dsl
365 1.21 dholland /* Ignore matches[0]. Avoid 1-based array logic below. */
366 1.21 dholland matches++;
367 1.23 dholland num--;
368 1.21 dholland
369 1.21 dholland /*
370 1.21 dholland * Find out how many entries can be put on one line; count
371 1.21 dholland * with one space between strings the same way it's printed.
372 1.21 dholland */
373 1.30 christos cols = (size_t)screenwidth / (width + 1);
374 1.21 dholland if (cols == 0)
375 1.21 dholland cols = 1;
376 1.21 dholland
377 1.21 dholland /* how many lines of output, rounded up */
378 1.21 dholland lines = (num + cols - 1) / cols;
379 1.21 dholland
380 1.21 dholland /* Sort the items. */
381 1.21 dholland qsort(matches, num, sizeof(char *), _fn_qsort_string_compare);
382 1.21 dholland
383 1.1 dsl /*
384 1.21 dholland * On the ith line print elements i, i+lines, i+lines*2, etc.
385 1.1 dsl */
386 1.21 dholland for (line = 0; line < lines; line++) {
387 1.21 dholland for (col = 0; col < cols; col++) {
388 1.21 dholland thisguy = line + col * lines;
389 1.21 dholland if (thisguy >= num)
390 1.21 dholland break;
391 1.45 abhinav (void)fprintf(el->el_outfile, "%s%s%s",
392 1.45 abhinav col == 0 ? "" : " ", matches[thisguy],
393 1.45 abhinav append_char_function(matches[thisguy]));
394 1.45 abhinav (void)fprintf(el->el_outfile, "%-*s",
395 1.45 abhinav (int) (width - strlen(matches[thisguy])), "");
396 1.16 christos }
397 1.1 dsl (void)fprintf(el->el_outfile, "\n");
398 1.1 dsl }
399 1.1 dsl }
400 1.1 dsl
401 1.1 dsl /*
402 1.1 dsl * Complete the word at or before point,
403 1.1 dsl * 'what_to_do' says what to do with the completion.
404 1.1 dsl * \t means do standard completion.
405 1.1 dsl * `?' means list the possible completions.
406 1.1 dsl * `*' means insert all of the possible completions.
407 1.1 dsl * `!' means to do standard completion, and list all possible completions if
408 1.1 dsl * there is more than one.
409 1.1 dsl *
410 1.1 dsl * Note: '*' support is not implemented
411 1.1 dsl * '!' could never be invoked
412 1.1 dsl */
413 1.1 dsl int
414 1.1 dsl fn_complete(EditLine *el,
415 1.1 dsl char *(*complet_func)(const char *, int),
416 1.1 dsl char **(*attempted_completion_function)(const char *, int, int),
417 1.43 christos const wchar_t *word_break, const wchar_t *special_prefixes,
418 1.15 christos const char *(*app_func)(const char *), size_t query_items,
419 1.1 dsl int *completion_type, int *over, int *point, int *end)
420 1.1 dsl {
421 1.42 christos const LineInfoW *li;
422 1.43 christos wchar_t *temp;
423 1.46 abhinav char **matches;
424 1.43 christos const wchar_t *ctemp;
425 1.1 dsl size_t len;
426 1.1 dsl int what_to_do = '\t';
427 1.10 christos int retval = CC_NORM;
428 1.1 dsl
429 1.1 dsl if (el->el_state.lastcmd == el->el_state.thiscmd)
430 1.1 dsl what_to_do = '?';
431 1.1 dsl
432 1.1 dsl /* readline's rl_complete() has to be told what we did... */
433 1.1 dsl if (completion_type != NULL)
434 1.1 dsl *completion_type = what_to_do;
435 1.1 dsl
436 1.1 dsl if (!complet_func)
437 1.7 christos complet_func = fn_filename_completion_function;
438 1.6 christos if (!app_func)
439 1.6 christos app_func = append_char_function;
440 1.1 dsl
441 1.1 dsl /* We now look backwards for the start of a filename/variable word */
442 1.42 christos li = el_wline(el);
443 1.17 christos ctemp = li->cursor;
444 1.1 dsl while (ctemp > li->buffer
445 1.42 christos && !wcschr(word_break, ctemp[-1])
446 1.42 christos && (!special_prefixes || !wcschr(special_prefixes, ctemp[-1]) ) )
447 1.1 dsl ctemp--;
448 1.1 dsl
449 1.30 christos len = (size_t)(li->cursor - ctemp);
450 1.26 christos temp = el_malloc((len + 1) * sizeof(*temp));
451 1.42 christos (void)wcsncpy(temp, ctemp, len);
452 1.1 dsl temp[len] = '\0';
453 1.1 dsl
454 1.1 dsl /* these can be used by function called in completion_matches() */
455 1.1 dsl /* or (*attempted_completion_function)() */
456 1.41 christos if (point != NULL)
457 1.14 christos *point = (int)(li->cursor - li->buffer);
458 1.1 dsl if (end != NULL)
459 1.14 christos *end = (int)(li->lastchar - li->buffer);
460 1.1 dsl
461 1.1 dsl if (attempted_completion_function) {
462 1.14 christos int cur_off = (int)(li->cursor - li->buffer);
463 1.30 christos matches = (*attempted_completion_function)(
464 1.30 christos ct_encode_string(temp, &el->el_scratch),
465 1.30 christos cur_off - (int)len, cur_off);
466 1.1 dsl } else
467 1.41 christos matches = NULL;
468 1.40 christos if (!attempted_completion_function ||
469 1.8 christos (over != NULL && !*over && !matches))
470 1.30 christos matches = completion_matches(
471 1.30 christos ct_encode_string(temp, &el->el_scratch), complet_func);
472 1.1 dsl
473 1.1 dsl if (over != NULL)
474 1.1 dsl *over = 0;
475 1.1 dsl
476 1.1 dsl if (matches) {
477 1.10 christos int i;
478 1.14 christos size_t matches_num, maxlen, match_len, match_display=1;
479 1.1 dsl
480 1.10 christos retval = CC_REFRESH;
481 1.1 dsl /*
482 1.1 dsl * Only replace the completed string with common part of
483 1.1 dsl * possible matches if there is possible completion.
484 1.1 dsl */
485 1.1 dsl if (matches[0][0] != '\0') {
486 1.1 dsl el_deletestr(el, (int) len);
487 1.42 christos el_winsertstr(el,
488 1.17 christos ct_decode_string(matches[0], &el->el_scratch));
489 1.1 dsl }
490 1.1 dsl
491 1.1 dsl
492 1.32 christos if (matches[2] == NULL &&
493 1.32 christos (matches[1] == NULL || strcmp(matches[0], matches[1]) == 0)) {
494 1.1 dsl /*
495 1.1 dsl * We found exact match. Add a space after
496 1.1 dsl * it, unless we do filename completion and the
497 1.1 dsl * object is a directory.
498 1.1 dsl */
499 1.42 christos el_winsertstr(el,
500 1.17 christos ct_decode_string((*app_func)(matches[0]),
501 1.17 christos &el->el_scratch));
502 1.44 abhinav } else if (what_to_do == '!' || what_to_do == '?') {
503 1.1 dsl /*
504 1.1 dsl * More than one match and requested to list possible
505 1.1 dsl * matches.
506 1.1 dsl */
507 1.1 dsl
508 1.17 christos for(i = 1, maxlen = 0; matches[i]; i++) {
509 1.1 dsl match_len = strlen(matches[i]);
510 1.1 dsl if (match_len > maxlen)
511 1.1 dsl maxlen = match_len;
512 1.1 dsl }
513 1.21 dholland /* matches[1] through matches[i-1] are available */
514 1.30 christos matches_num = (size_t)(i - 1);
515 1.40 christos
516 1.1 dsl /* newline to get on next line from command line */
517 1.1 dsl (void)fprintf(el->el_outfile, "\n");
518 1.1 dsl
519 1.1 dsl /*
520 1.1 dsl * If there are too many items, ask user for display
521 1.1 dsl * confirmation.
522 1.1 dsl */
523 1.1 dsl if (matches_num > query_items) {
524 1.1 dsl (void)fprintf(el->el_outfile,
525 1.14 christos "Display all %zu possibilities? (y or n) ",
526 1.1 dsl matches_num);
527 1.1 dsl (void)fflush(el->el_outfile);
528 1.1 dsl if (getc(stdin) != 'y')
529 1.1 dsl match_display = 0;
530 1.1 dsl (void)fprintf(el->el_outfile, "\n");
531 1.1 dsl }
532 1.1 dsl
533 1.23 dholland if (match_display) {
534 1.23 dholland /*
535 1.23 dholland * Interface of this function requires the
536 1.23 dholland * strings be matches[1..num-1] for compat.
537 1.23 dholland * We have matches_num strings not counting
538 1.23 dholland * the prefix in matches[0], so we need to
539 1.23 dholland * add 1 to matches_num for the call.
540 1.23 dholland */
541 1.23 dholland fn_display_match_list(el, matches,
542 1.45 abhinav matches_num+1, maxlen, app_func);
543 1.23 dholland }
544 1.1 dsl retval = CC_REDISPLAY;
545 1.1 dsl } else if (matches[0][0]) {
546 1.1 dsl /*
547 1.1 dsl * There was some common match, but the name was
548 1.1 dsl * not complete enough. Next tab will print possible
549 1.1 dsl * completions.
550 1.1 dsl */
551 1.1 dsl el_beep(el);
552 1.1 dsl } else {
553 1.1 dsl /* lcd is not a valid object - further specification */
554 1.1 dsl /* is needed */
555 1.1 dsl el_beep(el);
556 1.1 dsl retval = CC_NORM;
557 1.1 dsl }
558 1.1 dsl
559 1.1 dsl /* free elements of array and the array itself */
560 1.1 dsl for (i = 0; matches[i]; i++)
561 1.26 christos el_free(matches[i]);
562 1.26 christos el_free(matches);
563 1.10 christos matches = NULL;
564 1.1 dsl }
565 1.26 christos el_free(temp);
566 1.10 christos return retval;
567 1.1 dsl }
568 1.1 dsl
569 1.1 dsl /*
570 1.1 dsl * el-compatible wrapper around rl_complete; needed for key binding
571 1.1 dsl */
572 1.1 dsl /* ARGSUSED */
573 1.1 dsl unsigned char
574 1.1 dsl _el_fn_complete(EditLine *el, int ch __attribute__((__unused__)))
575 1.1 dsl {
576 1.1 dsl return (unsigned char)fn_complete(el, NULL, NULL,
577 1.29 christos break_chars, NULL, NULL, (size_t)100,
578 1.1 dsl NULL, NULL, NULL, NULL);
579 1.1 dsl }
580