1*5b133f3fSguenther /* $OpenBSD: filecomplete.c,v 1.13 2023/03/08 04:43:05 guenther Exp $ */
25f805b19Sokan /* $NetBSD: filecomplete.c,v 1.22 2010/12/02 04:42:46 dholland Exp $ */
3aed0ee81Snicm
4aed0ee81Snicm /*-
5aed0ee81Snicm * Copyright (c) 1997 The NetBSD Foundation, Inc.
6aed0ee81Snicm * All rights reserved.
7aed0ee81Snicm *
8aed0ee81Snicm * This code is derived from software contributed to The NetBSD Foundation
9aed0ee81Snicm * by Jaromir Dolecek.
10aed0ee81Snicm *
11aed0ee81Snicm * Redistribution and use in source and binary forms, with or without
12aed0ee81Snicm * modification, are permitted provided that the following conditions
13aed0ee81Snicm * are met:
14aed0ee81Snicm * 1. Redistributions of source code must retain the above copyright
15aed0ee81Snicm * notice, this list of conditions and the following disclaimer.
16aed0ee81Snicm * 2. Redistributions in binary form must reproduce the above copyright
17aed0ee81Snicm * notice, this list of conditions and the following disclaimer in the
18aed0ee81Snicm * documentation and/or other materials provided with the distribution.
19aed0ee81Snicm *
20aed0ee81Snicm * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21aed0ee81Snicm * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22aed0ee81Snicm * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23aed0ee81Snicm * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24aed0ee81Snicm * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25aed0ee81Snicm * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26aed0ee81Snicm * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27aed0ee81Snicm * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28aed0ee81Snicm * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29aed0ee81Snicm * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30aed0ee81Snicm * POSSIBILITY OF SUCH DAMAGE.
31aed0ee81Snicm */
32aed0ee81Snicm
33aed0ee81Snicm #include "config.h"
34aed0ee81Snicm
35aed0ee81Snicm #include <sys/types.h>
36aed0ee81Snicm #include <sys/stat.h>
37aed0ee81Snicm #include <dirent.h>
38aed0ee81Snicm #include <errno.h>
39aed0ee81Snicm #include <fcntl.h>
407ccfa089Sschwarze #include <limits.h>
417ccfa089Sschwarze #include <pwd.h>
427ccfa089Sschwarze #include <stdio.h>
437ccfa089Sschwarze #include <stdlib.h>
447ccfa089Sschwarze #include <string.h>
457ccfa089Sschwarze #include <unistd.h>
46c8f9980cSschwarze
47aed0ee81Snicm #include "el.h"
48aed0ee81Snicm #include "filecomplete.h"
49aed0ee81Snicm
50e3191321Sschwarze static const wchar_t break_chars[] = L" \t\n\"\\'`@$><=;|&{(";
51aed0ee81Snicm
52aed0ee81Snicm /********************************/
53aed0ee81Snicm /* completion functions */
54aed0ee81Snicm
55aed0ee81Snicm /*
56aed0ee81Snicm * does tilde expansion of strings of type ``~user/foo''
57aed0ee81Snicm * if ``user'' isn't valid user name or ``txt'' doesn't start
58aed0ee81Snicm * w/ '~', returns pointer to strdup()ed copy of ``txt''
59aed0ee81Snicm *
6028d54ee8Sschwarze * it's the caller's responsibility to free() the returned string
61aed0ee81Snicm */
62aed0ee81Snicm char *
fn_tilde_expand(const char * txt)63aed0ee81Snicm fn_tilde_expand(const char *txt)
64aed0ee81Snicm {
65aed0ee81Snicm struct passwd pwres, *pass;
66aed0ee81Snicm char *temp;
67aed0ee81Snicm size_t tempsz, len = 0;
68aed0ee81Snicm char pwbuf[1024];
69aed0ee81Snicm
70aed0ee81Snicm if (txt[0] != '~')
7128d54ee8Sschwarze return strdup(txt);
72aed0ee81Snicm
73aed0ee81Snicm temp = strchr(txt + 1, '/');
74aed0ee81Snicm if (temp == NULL) {
75aed0ee81Snicm temp = strdup(txt + 1);
76aed0ee81Snicm if (temp == NULL)
77aed0ee81Snicm return NULL;
78aed0ee81Snicm } else {
79aed0ee81Snicm len = temp - txt + 1; /* text until string after slash */
80aed0ee81Snicm temp = malloc(len);
81aed0ee81Snicm if (temp == NULL)
82aed0ee81Snicm return NULL;
83aed0ee81Snicm (void)strncpy(temp, txt + 1, len - 2);
84aed0ee81Snicm temp[len - 2] = '\0';
85aed0ee81Snicm }
86aed0ee81Snicm if (temp[0] == 0) {
87aed0ee81Snicm if (getpwuid_r(getuid(), &pwres, pwbuf, sizeof(pwbuf), &pass) != 0)
88aed0ee81Snicm pass = NULL;
89aed0ee81Snicm } else {
90aed0ee81Snicm if (getpwnam_r(temp, &pwres, pwbuf, sizeof(pwbuf), &pass) != 0)
91aed0ee81Snicm pass = NULL;
92aed0ee81Snicm }
93aed0ee81Snicm free(temp); /* value no more needed */
94aed0ee81Snicm if (pass == NULL)
9528d54ee8Sschwarze return strdup(txt);
96aed0ee81Snicm
97aed0ee81Snicm /* update pointer txt to point at string immedially following */
98aed0ee81Snicm /* first slash */
99aed0ee81Snicm txt += len;
100aed0ee81Snicm
101aed0ee81Snicm tempsz = strlen(pass->pw_dir) + 1 + strlen(txt) + 1;
102aed0ee81Snicm temp = malloc(tempsz);
103aed0ee81Snicm if (temp == NULL)
104aed0ee81Snicm return NULL;
105aed0ee81Snicm (void)snprintf(temp, tempsz, "%s/%s", pass->pw_dir, txt);
106aed0ee81Snicm
10728d54ee8Sschwarze return temp;
108aed0ee81Snicm }
109aed0ee81Snicm
110aed0ee81Snicm
111aed0ee81Snicm /*
112aed0ee81Snicm * return first found file name starting by the ``text'' or NULL if no
113aed0ee81Snicm * such file can be found
114aed0ee81Snicm * value of ``state'' is ignored
115aed0ee81Snicm *
11628d54ee8Sschwarze * it's the caller's responsibility to free the returned string
117aed0ee81Snicm */
118aed0ee81Snicm char *
fn_filename_completion_function(const char * text,int state)119aed0ee81Snicm fn_filename_completion_function(const char *text, int state)
120aed0ee81Snicm {
121aed0ee81Snicm static DIR *dir = NULL;
122aed0ee81Snicm static char *filename = NULL, *dirname = NULL, *dirpath = NULL;
123aed0ee81Snicm static size_t filename_len = 0;
124aed0ee81Snicm struct dirent *entry;
125aed0ee81Snicm char *temp;
126aed0ee81Snicm size_t tempsz, len;
127aed0ee81Snicm
128aed0ee81Snicm if (state == 0 || dir == NULL) {
129aed0ee81Snicm temp = strrchr(text, '/');
130aed0ee81Snicm if (temp) {
131aed0ee81Snicm size_t sz = strlen(temp + 1) + 1;
132aed0ee81Snicm char *nptr;
133aed0ee81Snicm temp++;
134aed0ee81Snicm nptr = realloc(filename, sz);
135aed0ee81Snicm if (nptr == NULL) {
136aed0ee81Snicm free(filename);
1375f805b19Sokan filename = NULL;
138aed0ee81Snicm return NULL;
139aed0ee81Snicm }
140aed0ee81Snicm filename = nptr;
141aed0ee81Snicm (void)strlcpy(filename, temp, sz);
142aed0ee81Snicm len = temp - text; /* including last slash */
1435f805b19Sokan
144aed0ee81Snicm nptr = realloc(dirname, len + 1);
145aed0ee81Snicm if (nptr == NULL) {
1465f805b19Sokan free(dirname);
1475f805b19Sokan dirname = NULL;
148aed0ee81Snicm return NULL;
149aed0ee81Snicm }
150aed0ee81Snicm dirname = nptr;
151aed0ee81Snicm (void)strncpy(dirname, text, len);
152aed0ee81Snicm dirname[len] = '\0';
153aed0ee81Snicm } else {
1545f805b19Sokan free(filename);
155aed0ee81Snicm if (*text == 0)
156aed0ee81Snicm filename = NULL;
157aed0ee81Snicm else {
158aed0ee81Snicm filename = strdup(text);
159aed0ee81Snicm if (filename == NULL)
160aed0ee81Snicm return NULL;
161aed0ee81Snicm }
1625f805b19Sokan free(dirname);
163aed0ee81Snicm dirname = NULL;
164aed0ee81Snicm }
165aed0ee81Snicm
166aed0ee81Snicm if (dir != NULL) {
167aed0ee81Snicm (void)closedir(dir);
168aed0ee81Snicm dir = NULL;
169aed0ee81Snicm }
170aed0ee81Snicm
171aed0ee81Snicm /* support for ``~user'' syntax */
1725f805b19Sokan
173aed0ee81Snicm free(dirpath);
1745f805b19Sokan dirpath = NULL;
1755f805b19Sokan if (dirname == NULL) {
1765f805b19Sokan if ((dirname = strdup("")) == NULL)
177aed0ee81Snicm return NULL;
1785f805b19Sokan dirpath = strdup("./");
1795f805b19Sokan } else if (*dirname == '~')
180aed0ee81Snicm dirpath = fn_tilde_expand(dirname);
181aed0ee81Snicm else
182aed0ee81Snicm dirpath = strdup(dirname);
183aed0ee81Snicm
184aed0ee81Snicm if (dirpath == NULL)
185aed0ee81Snicm return NULL;
186aed0ee81Snicm
187aed0ee81Snicm dir = opendir(dirpath);
188aed0ee81Snicm if (!dir)
18928d54ee8Sschwarze return NULL; /* cannot open the directory */
190aed0ee81Snicm
191aed0ee81Snicm /* will be used in cycle */
192aed0ee81Snicm filename_len = filename ? strlen(filename) : 0;
193aed0ee81Snicm }
194aed0ee81Snicm
195aed0ee81Snicm /* find the match */
196aed0ee81Snicm while ((entry = readdir(dir)) != NULL) {
197aed0ee81Snicm /* skip . and .. */
198aed0ee81Snicm if (entry->d_name[0] == '.' && (!entry->d_name[1]
199aed0ee81Snicm || (entry->d_name[1] == '.' && !entry->d_name[2])))
200aed0ee81Snicm continue;
201aed0ee81Snicm if (filename_len == 0)
202aed0ee81Snicm break;
203aed0ee81Snicm /* otherwise, get first entry where first */
204aed0ee81Snicm /* filename_len characters are equal */
205aed0ee81Snicm if (entry->d_name[0] == filename[0]
206aed0ee81Snicm #if HAVE_STRUCT_DIRENT_D_NAMLEN
207aed0ee81Snicm && entry->d_namlen >= filename_len
208aed0ee81Snicm #else
209aed0ee81Snicm && strlen(entry->d_name) >= filename_len
210aed0ee81Snicm #endif
211aed0ee81Snicm && strncmp(entry->d_name, filename,
212aed0ee81Snicm filename_len) == 0)
213aed0ee81Snicm break;
214aed0ee81Snicm }
215aed0ee81Snicm
216aed0ee81Snicm if (entry) { /* match found */
217aed0ee81Snicm
218aed0ee81Snicm #if HAVE_STRUCT_DIRENT_D_NAMLEN
219aed0ee81Snicm len = entry->d_namlen;
220aed0ee81Snicm #else
221aed0ee81Snicm len = strlen(entry->d_name);
222aed0ee81Snicm #endif
223aed0ee81Snicm
224aed0ee81Snicm tempsz = strlen(dirname) + len + 1;
225aed0ee81Snicm temp = malloc(tempsz);
226aed0ee81Snicm if (temp == NULL)
227aed0ee81Snicm return NULL;
228aed0ee81Snicm (void)snprintf(temp, tempsz, "%s%s", dirname, entry->d_name);
229aed0ee81Snicm } else {
230aed0ee81Snicm (void)closedir(dir);
231aed0ee81Snicm dir = NULL;
232aed0ee81Snicm temp = NULL;
233aed0ee81Snicm }
234aed0ee81Snicm
23528d54ee8Sschwarze return temp;
236aed0ee81Snicm }
237aed0ee81Snicm
238aed0ee81Snicm
239aed0ee81Snicm static const char *
append_char_function(const char * name)240aed0ee81Snicm append_char_function(const char *name)
241aed0ee81Snicm {
242aed0ee81Snicm struct stat stbuf;
243aed0ee81Snicm char *expname = *name == '~' ? fn_tilde_expand(name) : NULL;
244aed0ee81Snicm const char *rs = " ";
245aed0ee81Snicm
246aed0ee81Snicm if (stat(expname ? expname : name, &stbuf) == -1)
247aed0ee81Snicm goto out;
248aed0ee81Snicm if (S_ISDIR(stbuf.st_mode))
249aed0ee81Snicm rs = "/";
250aed0ee81Snicm out:
251aed0ee81Snicm if (expname)
252aed0ee81Snicm free(expname);
253aed0ee81Snicm return rs;
254aed0ee81Snicm }
255aed0ee81Snicm /*
256aed0ee81Snicm * returns list of completions for text given
257aed0ee81Snicm * non-static for readline.
258aed0ee81Snicm */
259aed0ee81Snicm char ** completion_matches(const char *, char *(*)(const char *, int));
260aed0ee81Snicm char **
completion_matches(const char * text,char * (* genfunc)(const char *,int))261aed0ee81Snicm completion_matches(const char *text, char *(*genfunc)(const char *, int))
262aed0ee81Snicm {
263aed0ee81Snicm char **match_list = NULL, *retstr, *prevstr;
264aed0ee81Snicm size_t match_list_len, max_equal, which, i;
265aed0ee81Snicm size_t matches;
266aed0ee81Snicm
267aed0ee81Snicm matches = 0;
268aed0ee81Snicm match_list_len = 1;
269aed0ee81Snicm while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
270aed0ee81Snicm /* allow for list terminator here */
271aed0ee81Snicm if (matches + 3 >= match_list_len) {
272aed0ee81Snicm char **nmatch_list;
273aed0ee81Snicm while (matches + 3 >= match_list_len)
274aed0ee81Snicm match_list_len <<= 1;
275240788ddSdoug nmatch_list = reallocarray(match_list,
276240788ddSdoug match_list_len, sizeof(char *));
277aed0ee81Snicm if (nmatch_list == NULL) {
278aed0ee81Snicm free(match_list);
279aed0ee81Snicm return NULL;
280aed0ee81Snicm }
281aed0ee81Snicm match_list = nmatch_list;
282aed0ee81Snicm
283aed0ee81Snicm }
284aed0ee81Snicm match_list[++matches] = retstr;
285aed0ee81Snicm }
286aed0ee81Snicm
287aed0ee81Snicm if (!match_list)
288aed0ee81Snicm return NULL; /* nothing found */
289aed0ee81Snicm
290aed0ee81Snicm /* find least denominator and insert it to match_list[0] */
291aed0ee81Snicm which = 2;
292aed0ee81Snicm prevstr = match_list[1];
293aed0ee81Snicm max_equal = strlen(prevstr);
294aed0ee81Snicm for (; which <= matches; which++) {
295aed0ee81Snicm for (i = 0; i < max_equal &&
296aed0ee81Snicm prevstr[i] == match_list[which][i]; i++)
297aed0ee81Snicm continue;
298aed0ee81Snicm max_equal = i;
299aed0ee81Snicm }
300aed0ee81Snicm
301aed0ee81Snicm retstr = malloc(max_equal + 1);
302aed0ee81Snicm if (retstr == NULL) {
303aed0ee81Snicm free(match_list);
304aed0ee81Snicm return NULL;
305aed0ee81Snicm }
306aed0ee81Snicm (void)strncpy(retstr, match_list[1], max_equal);
307aed0ee81Snicm retstr[max_equal] = '\0';
308aed0ee81Snicm match_list[0] = retstr;
309aed0ee81Snicm
310aed0ee81Snicm /* add NULL as last pointer to the array */
311c8f9980cSschwarze match_list[matches + 1] = NULL;
312aed0ee81Snicm
31328d54ee8Sschwarze return match_list;
314aed0ee81Snicm }
315aed0ee81Snicm
316aed0ee81Snicm /*
317aed0ee81Snicm * Sort function for qsort(). Just wrapper around strcasecmp().
318aed0ee81Snicm */
319aed0ee81Snicm static int
_fn_qsort_string_compare(const void * i1,const void * i2)320aed0ee81Snicm _fn_qsort_string_compare(const void *i1, const void *i2)
321aed0ee81Snicm {
322aed0ee81Snicm const char *s1 = ((const char * const *)i1)[0];
323aed0ee81Snicm const char *s2 = ((const char * const *)i2)[0];
324aed0ee81Snicm
325aed0ee81Snicm return strcasecmp(s1, s2);
326aed0ee81Snicm }
327aed0ee81Snicm
328aed0ee81Snicm /*
329aed0ee81Snicm * Display list of strings in columnar format on readline's output stream.
3305f805b19Sokan * 'matches' is list of strings, 'num' is number of strings in 'matches',
3315f805b19Sokan * 'width' is maximum length of string in 'matches'.
3325f805b19Sokan *
3335f805b19Sokan * matches[0] is not one of the match strings, but it is counted in
3345f805b19Sokan * num, so the strings are matches[1] *through* matches[num-1].
335aed0ee81Snicm */
336aed0ee81Snicm void
fn_display_match_list(EditLine * el,char ** matches,size_t num,size_t width)3375f805b19Sokan fn_display_match_list (EditLine *el, char **matches, size_t num, size_t width)
338aed0ee81Snicm {
3395f805b19Sokan size_t line, lines, col, cols, thisguy;
340fd40972aSschwarze int screenwidth = el->el_terminal.t_size.h;
341aed0ee81Snicm
3425f805b19Sokan /* Ignore matches[0]. Avoid 1-based array logic below. */
3435f805b19Sokan matches++;
3445f805b19Sokan num--;
3455f805b19Sokan
346aed0ee81Snicm /*
3475f805b19Sokan * Find out how many entries can be put on one line; count
3485f805b19Sokan * with one space between strings the same way it's printed.
349aed0ee81Snicm */
3505f805b19Sokan cols = screenwidth / (width + 1);
3515f805b19Sokan if (cols == 0)
3525f805b19Sokan cols = 1;
353aed0ee81Snicm
3545f805b19Sokan /* how many lines of output, rounded up */
3555f805b19Sokan lines = (num + cols - 1) / cols;
356aed0ee81Snicm
3575f805b19Sokan /* Sort the items. */
3585f805b19Sokan qsort(matches, num, sizeof(char *), _fn_qsort_string_compare);
359aed0ee81Snicm
3605f805b19Sokan /*
3615f805b19Sokan * On the ith line print elements i, i+lines, i+lines*2, etc.
3625f805b19Sokan */
3635f805b19Sokan for (line = 0; line < lines; line++) {
3645f805b19Sokan for (col = 0; col < cols; col++) {
3655f805b19Sokan thisguy = line + col * lines;
3665f805b19Sokan if (thisguy >= num)
3675f805b19Sokan break;
3685f805b19Sokan (void)fprintf(el->el_outfile, "%s%-*s",
3695f805b19Sokan col == 0 ? "" : " ", (int)width, matches[thisguy]);
370aed0ee81Snicm }
371aed0ee81Snicm (void)fprintf(el->el_outfile, "\n");
372aed0ee81Snicm }
373aed0ee81Snicm }
374aed0ee81Snicm
375aed0ee81Snicm /*
376aed0ee81Snicm * Complete the word at or before point,
377aed0ee81Snicm * 'what_to_do' says what to do with the completion.
378aed0ee81Snicm * \t means do standard completion.
379aed0ee81Snicm * `?' means list the possible completions.
380aed0ee81Snicm * `*' means insert all of the possible completions.
381aed0ee81Snicm * `!' means to do standard completion, and list all possible completions if
382aed0ee81Snicm * there is more than one.
383aed0ee81Snicm *
384aed0ee81Snicm * Note: '*' support is not implemented
385aed0ee81Snicm * '!' could never be invoked
386aed0ee81Snicm */
387aed0ee81Snicm int
fn_complete(EditLine * el,char * (* complet_func)(const char *,int),char ** (* attempted_completion_function)(const char *,int,int),const wchar_t * word_break,const wchar_t * special_prefixes,const char * (* app_func)(const char *),size_t query_items,int * completion_type,int * over,int * point,int * end)388aed0ee81Snicm fn_complete(EditLine *el,
389aed0ee81Snicm char *(*complet_func)(const char *, int),
390aed0ee81Snicm char **(*attempted_completion_function)(const char *, int, int),
391e3191321Sschwarze const wchar_t *word_break, const wchar_t *special_prefixes,
392aed0ee81Snicm const char *(*app_func)(const char *), size_t query_items,
393aed0ee81Snicm int *completion_type, int *over, int *point, int *end)
394aed0ee81Snicm {
3955c93237dSschwarze const LineInfoW *li;
396e3191321Sschwarze wchar_t *temp;
397aed0ee81Snicm char **matches;
398e3191321Sschwarze const wchar_t *ctemp;
399aed0ee81Snicm size_t len;
400aed0ee81Snicm int what_to_do = '\t';
401aed0ee81Snicm int retval = CC_NORM;
402aed0ee81Snicm
403aed0ee81Snicm if (el->el_state.lastcmd == el->el_state.thiscmd)
404aed0ee81Snicm what_to_do = '?';
405aed0ee81Snicm
406aed0ee81Snicm /* readline's rl_complete() has to be told what we did... */
407aed0ee81Snicm if (completion_type != NULL)
408aed0ee81Snicm *completion_type = what_to_do;
409aed0ee81Snicm
410aed0ee81Snicm if (!complet_func)
411aed0ee81Snicm complet_func = fn_filename_completion_function;
412aed0ee81Snicm if (!app_func)
413aed0ee81Snicm app_func = append_char_function;
414aed0ee81Snicm
415aed0ee81Snicm /* We now look backwards for the start of a filename/variable word */
4165c93237dSschwarze li = el_wline(el);
417aed0ee81Snicm ctemp = li->cursor;
418aed0ee81Snicm while (ctemp > li->buffer
4195c93237dSschwarze && !wcschr(word_break, ctemp[-1])
4205c93237dSschwarze && (!special_prefixes || !wcschr(special_prefixes, ctemp[-1]) ) )
421aed0ee81Snicm ctemp--;
422aed0ee81Snicm
423aed0ee81Snicm len = li->cursor - ctemp;
424014b1be8Sderaadt temp = reallocarray(NULL, len + 1, sizeof(*temp));
4255c93237dSschwarze (void)wcsncpy(temp, ctemp, len);
426aed0ee81Snicm temp[len] = '\0';
427aed0ee81Snicm
428aed0ee81Snicm /* these can be used by function called in completion_matches() */
429aed0ee81Snicm /* or (*attempted_completion_function)() */
4309e107a6eSschwarze if (point != NULL)
431aed0ee81Snicm *point = (int)(li->cursor - li->buffer);
432aed0ee81Snicm if (end != NULL)
433aed0ee81Snicm *end = (int)(li->lastchar - li->buffer);
434aed0ee81Snicm
435aed0ee81Snicm if (attempted_completion_function) {
436aed0ee81Snicm int cur_off = (int)(li->cursor - li->buffer);
437c8f9980cSschwarze matches = (*attempted_completion_function) (
438c8f9980cSschwarze ct_encode_string(temp, &el->el_scratch),
439aed0ee81Snicm (int)(cur_off - len), cur_off);
440aed0ee81Snicm } else
4419e107a6eSschwarze matches = NULL;
442aed0ee81Snicm if (!attempted_completion_function ||
443aed0ee81Snicm (over != NULL && !*over && !matches))
444c8f9980cSschwarze matches = completion_matches(
445c8f9980cSschwarze ct_encode_string(temp, &el->el_scratch), complet_func);
446aed0ee81Snicm
447aed0ee81Snicm if (over != NULL)
448aed0ee81Snicm *over = 0;
449aed0ee81Snicm
450aed0ee81Snicm if (matches) {
451aed0ee81Snicm int i;
452aed0ee81Snicm size_t matches_num, maxlen, match_len, match_display=1;
453aed0ee81Snicm
454aed0ee81Snicm retval = CC_REFRESH;
455aed0ee81Snicm /*
456aed0ee81Snicm * Only replace the completed string with common part of
457aed0ee81Snicm * possible matches if there is possible completion.
458aed0ee81Snicm */
459aed0ee81Snicm if (matches[0][0] != '\0') {
460aed0ee81Snicm el_deletestr(el, (int) len);
4615c93237dSschwarze el_winsertstr(el,
462aed0ee81Snicm ct_decode_string(matches[0], &el->el_scratch));
463aed0ee81Snicm }
464aed0ee81Snicm
465aed0ee81Snicm if (what_to_do == '?')
466aed0ee81Snicm goto display_matches;
467aed0ee81Snicm
468aed0ee81Snicm if (matches[2] == NULL && strcmp(matches[0], matches[1]) == 0) {
469aed0ee81Snicm /*
470aed0ee81Snicm * We found exact match. Add a space after
471aed0ee81Snicm * it, unless we do filename completion and the
472aed0ee81Snicm * object is a directory.
473aed0ee81Snicm */
4745c93237dSschwarze el_winsertstr(el,
475aed0ee81Snicm ct_decode_string((*app_func)(matches[0]),
476aed0ee81Snicm &el->el_scratch));
477aed0ee81Snicm } else if (what_to_do == '!') {
478aed0ee81Snicm display_matches:
479aed0ee81Snicm /*
480aed0ee81Snicm * More than one match and requested to list possible
481aed0ee81Snicm * matches.
482aed0ee81Snicm */
483aed0ee81Snicm
484aed0ee81Snicm for(i = 1, maxlen = 0; matches[i]; i++) {
485aed0ee81Snicm match_len = strlen(matches[i]);
486aed0ee81Snicm if (match_len > maxlen)
487aed0ee81Snicm maxlen = match_len;
488aed0ee81Snicm }
4895f805b19Sokan /* matches[1] through matches[i-1] are available */
490aed0ee81Snicm matches_num = i - 1;
491aed0ee81Snicm
492aed0ee81Snicm /* newline to get on next line from command line */
493aed0ee81Snicm (void)fprintf(el->el_outfile, "\n");
494aed0ee81Snicm
495aed0ee81Snicm /*
496aed0ee81Snicm * If there are too many items, ask user for display
497aed0ee81Snicm * confirmation.
498aed0ee81Snicm */
499aed0ee81Snicm if (matches_num > query_items) {
500aed0ee81Snicm (void)fprintf(el->el_outfile,
501aed0ee81Snicm "Display all %zu possibilities? (y or n) ",
502aed0ee81Snicm matches_num);
503aed0ee81Snicm (void)fflush(el->el_outfile);
504aed0ee81Snicm if (getc(stdin) != 'y')
505aed0ee81Snicm match_display = 0;
506aed0ee81Snicm (void)fprintf(el->el_outfile, "\n");
507aed0ee81Snicm }
508aed0ee81Snicm
5095f805b19Sokan if (match_display) {
5105f805b19Sokan /*
5115f805b19Sokan * Interface of this function requires the
5125f805b19Sokan * strings be matches[1..num-1] for compat.
5135f805b19Sokan * We have matches_num strings not counting
5145f805b19Sokan * the prefix in matches[0], so we need to
5155f805b19Sokan * add 1 to matches_num for the call.
5165f805b19Sokan */
5175f805b19Sokan fn_display_match_list(el, matches,
5185f805b19Sokan matches_num+1, maxlen);
5195f805b19Sokan }
520aed0ee81Snicm retval = CC_REDISPLAY;
521aed0ee81Snicm } else if (matches[0][0]) {
522aed0ee81Snicm /*
523aed0ee81Snicm * There was some common match, but the name was
524aed0ee81Snicm * not complete enough. Next tab will print possible
525aed0ee81Snicm * completions.
526aed0ee81Snicm */
527aed0ee81Snicm el_beep(el);
528aed0ee81Snicm } else {
529aed0ee81Snicm /* lcd is not a valid object - further specification */
530aed0ee81Snicm /* is needed */
531aed0ee81Snicm el_beep(el);
532aed0ee81Snicm retval = CC_NORM;
533aed0ee81Snicm }
534aed0ee81Snicm
535aed0ee81Snicm /* free elements of array and the array itself */
536aed0ee81Snicm for (i = 0; matches[i]; i++)
537aed0ee81Snicm free(matches[i]);
538aed0ee81Snicm free(matches);
539aed0ee81Snicm matches = NULL;
540aed0ee81Snicm }
541aed0ee81Snicm free(temp);
542aed0ee81Snicm return retval;
543aed0ee81Snicm }
544aed0ee81Snicm
545aed0ee81Snicm /*
546aed0ee81Snicm * el-compatible wrapper around rl_complete; needed for key binding
547aed0ee81Snicm */
548aed0ee81Snicm unsigned char
_el_fn_complete(EditLine * el,int ch)549aed0ee81Snicm _el_fn_complete(EditLine *el, int ch __attribute__((__unused__)))
550aed0ee81Snicm {
551aed0ee81Snicm return (unsigned char)fn_complete(el, NULL, NULL,
552aed0ee81Snicm break_chars, NULL, NULL, 100,
553aed0ee81Snicm NULL, NULL, NULL, NULL);
554aed0ee81Snicm }
555