Home | History | Annotate | Line # | Download | only in libedit
filecomplete.c revision 1.22
      1  1.22  dholland /*	$NetBSD: filecomplete.c,v 1.22 2010/12/02 04:42:46 dholland 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.22  dholland __RCSID("$NetBSD: filecomplete.c,v 1.22 2010/12/02 04:42:46 dholland 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 <stdio.h>
     40   1.1       dsl #include <dirent.h>
     41   1.1       dsl #include <string.h>
     42   1.1       dsl #include <pwd.h>
     43   1.1       dsl #include <ctype.h>
     44   1.1       dsl #include <stdlib.h>
     45   1.1       dsl #include <unistd.h>
     46   1.1       dsl #include <limits.h>
     47   1.1       dsl #include <errno.h>
     48   1.1       dsl #include <fcntl.h>
     49   1.1       dsl #ifdef HAVE_VIS_H
     50   1.1       dsl #include <vis.h>
     51   1.1       dsl #else
     52   1.1       dsl #include "np/vis.h"
     53   1.1       dsl #endif
     54   1.1       dsl #ifdef HAVE_ALLOCA_H
     55   1.1       dsl #include <alloca.h>
     56   1.1       dsl #endif
     57   1.1       dsl #include "el.h"
     58   1.1       dsl #include "fcns.h"		/* for EL_NUM_FCNS */
     59   1.1       dsl #include "histedit.h"
     60   1.1       dsl #include "filecomplete.h"
     61   1.1       dsl 
     62  1.22  dholland static const Char break_chars[] = { ' ', '\t', '\n', '"', '\\', '\'', '`', '@',
     63  1.17  christos     '$', '>', '<', '=', ';', '|', '&', '{', '(', '\0' };
     64   1.1       dsl 
     65   1.1       dsl 
     66   1.1       dsl /********************************/
     67   1.1       dsl /* completion functions */
     68   1.1       dsl 
     69   1.1       dsl /*
     70   1.1       dsl  * does tilde expansion of strings of type ``~user/foo''
     71   1.1       dsl  * if ``user'' isn't valid user name or ``txt'' doesn't start
     72   1.1       dsl  * w/ '~', returns pointer to strdup()ed copy of ``txt''
     73   1.1       dsl  *
     74   1.1       dsl  * it's callers's responsibility to free() returned string
     75   1.1       dsl  */
     76   1.1       dsl char *
     77   1.7  christos fn_tilde_expand(const char *txt)
     78   1.1       dsl {
     79   1.1       dsl 	struct passwd pwres, *pass;
     80   1.1       dsl 	char *temp;
     81   1.1       dsl 	size_t len = 0;
     82   1.1       dsl 	char pwbuf[1024];
     83   1.1       dsl 
     84   1.1       dsl 	if (txt[0] != '~')
     85   1.1       dsl 		return (strdup(txt));
     86   1.1       dsl 
     87   1.1       dsl 	temp = strchr(txt + 1, '/');
     88   1.1       dsl 	if (temp == NULL) {
     89   1.1       dsl 		temp = strdup(txt + 1);
     90   1.1       dsl 		if (temp == NULL)
     91   1.1       dsl 			return NULL;
     92   1.1       dsl 	} else {
     93   1.1       dsl 		len = temp - txt + 1;	/* text until string after slash */
     94   1.1       dsl 		temp = malloc(len);
     95   1.1       dsl 		if (temp == NULL)
     96   1.1       dsl 			return NULL;
     97   1.1       dsl 		(void)strncpy(temp, txt + 1, len - 2);
     98   1.1       dsl 		temp[len - 2] = '\0';
     99   1.1       dsl 	}
    100   1.3       dsl 	if (temp[0] == 0) {
    101   1.3       dsl 		if (getpwuid_r(getuid(), &pwres, pwbuf, sizeof(pwbuf), &pass) != 0)
    102   1.3       dsl 			pass = NULL;
    103   1.3       dsl 	} else {
    104   1.3       dsl 		if (getpwnam_r(temp, &pwres, pwbuf, sizeof(pwbuf), &pass) != 0)
    105   1.3       dsl 			pass = NULL;
    106   1.3       dsl 	}
    107   1.1       dsl 	free(temp);		/* value no more needed */
    108   1.1       dsl 	if (pass == NULL)
    109   1.1       dsl 		return (strdup(txt));
    110   1.1       dsl 
    111   1.1       dsl 	/* update pointer txt to point at string immedially following */
    112   1.1       dsl 	/* first slash */
    113   1.1       dsl 	txt += len;
    114   1.1       dsl 
    115   1.1       dsl 	temp = malloc(strlen(pass->pw_dir) + 1 + strlen(txt) + 1);
    116   1.1       dsl 	if (temp == NULL)
    117   1.1       dsl 		return NULL;
    118   1.1       dsl 	(void)sprintf(temp, "%s/%s", pass->pw_dir, txt);
    119   1.1       dsl 
    120   1.1       dsl 	return (temp);
    121   1.1       dsl }
    122   1.1       dsl 
    123   1.1       dsl 
    124   1.1       dsl /*
    125   1.1       dsl  * return first found file name starting by the ``text'' or NULL if no
    126   1.1       dsl  * such file can be found
    127   1.1       dsl  * value of ``state'' is ignored
    128   1.1       dsl  *
    129   1.1       dsl  * it's caller's responsibility to free returned string
    130   1.1       dsl  */
    131   1.2       dsl char *
    132   1.7  christos fn_filename_completion_function(const char *text, int state)
    133   1.1       dsl {
    134   1.1       dsl 	static DIR *dir = NULL;
    135   1.3       dsl 	static char *filename = NULL, *dirname = NULL, *dirpath = NULL;
    136   1.1       dsl 	static size_t filename_len = 0;
    137   1.1       dsl 	struct dirent *entry;
    138   1.1       dsl 	char *temp;
    139   1.1       dsl 	size_t len;
    140   1.1       dsl 
    141   1.1       dsl 	if (state == 0 || dir == NULL) {
    142   1.1       dsl 		temp = strrchr(text, '/');
    143   1.1       dsl 		if (temp) {
    144   1.1       dsl 			char *nptr;
    145   1.1       dsl 			temp++;
    146   1.1       dsl 			nptr = realloc(filename, strlen(temp) + 1);
    147   1.1       dsl 			if (nptr == NULL) {
    148   1.1       dsl 				free(filename);
    149  1.19  christos 				filename = NULL;
    150   1.1       dsl 				return NULL;
    151   1.1       dsl 			}
    152   1.1       dsl 			filename = nptr;
    153   1.1       dsl 			(void)strcpy(filename, temp);
    154   1.1       dsl 			len = temp - text;	/* including last slash */
    155  1.19  christos 
    156   1.1       dsl 			nptr = realloc(dirname, len + 1);
    157   1.1       dsl 			if (nptr == NULL) {
    158  1.19  christos 				free(dirname);
    159  1.19  christos 				dirname = NULL;
    160   1.1       dsl 				return NULL;
    161   1.1       dsl 			}
    162   1.1       dsl 			dirname = nptr;
    163   1.1       dsl 			(void)strncpy(dirname, text, len);
    164   1.1       dsl 			dirname[len] = '\0';
    165   1.1       dsl 		} else {
    166  1.19  christos 			free(filename);
    167   1.1       dsl 			if (*text == 0)
    168   1.1       dsl 				filename = NULL;
    169   1.1       dsl 			else {
    170   1.1       dsl 				filename = strdup(text);
    171   1.1       dsl 				if (filename == NULL)
    172   1.1       dsl 					return NULL;
    173   1.1       dsl 			}
    174  1.19  christos 			free(dirname);
    175   1.1       dsl 			dirname = NULL;
    176   1.1       dsl 		}
    177   1.1       dsl 
    178   1.1       dsl 		if (dir != NULL) {
    179   1.1       dsl 			(void)closedir(dir);
    180   1.1       dsl 			dir = NULL;
    181   1.1       dsl 		}
    182   1.3       dsl 
    183   1.3       dsl 		/* support for ``~user'' syntax */
    184  1.19  christos 
    185   1.3       dsl 		free(dirpath);
    186  1.19  christos 		dirpath = NULL;
    187  1.19  christos 		if (dirname == NULL) {
    188  1.19  christos 			if ((dirname = strdup("")) == NULL)
    189  1.19  christos 				return NULL;
    190  1.19  christos 			dirpath = strdup("./");
    191  1.19  christos 		} else if (*dirname == '~')
    192   1.7  christos 			dirpath = fn_tilde_expand(dirname);
    193   1.4  christos 		else
    194   1.4  christos 			dirpath = strdup(dirname);
    195   1.4  christos 
    196   1.4  christos 		if (dirpath == NULL)
    197   1.4  christos 			return NULL;
    198   1.4  christos 
    199   1.3       dsl 		dir = opendir(dirpath);
    200   1.1       dsl 		if (!dir)
    201   1.1       dsl 			return (NULL);	/* cannot open the directory */
    202   1.3       dsl 
    203   1.3       dsl 		/* will be used in cycle */
    204   1.3       dsl 		filename_len = filename ? strlen(filename) : 0;
    205   1.1       dsl 	}
    206   1.1       dsl 
    207   1.1       dsl 	/* find the match */
    208   1.1       dsl 	while ((entry = readdir(dir)) != NULL) {
    209   1.1       dsl 		/* skip . and .. */
    210   1.1       dsl 		if (entry->d_name[0] == '.' && (!entry->d_name[1]
    211   1.1       dsl 		    || (entry->d_name[1] == '.' && !entry->d_name[2])))
    212   1.1       dsl 			continue;
    213   1.1       dsl 		if (filename_len == 0)
    214   1.1       dsl 			break;
    215   1.1       dsl 		/* otherwise, get first entry where first */
    216   1.1       dsl 		/* filename_len characters are equal	  */
    217   1.1       dsl 		if (entry->d_name[0] == filename[0]
    218  1.13       apb #if HAVE_STRUCT_DIRENT_D_NAMLEN
    219  1.13       apb 		    && entry->d_namlen >= filename_len
    220  1.13       apb #else
    221   1.1       dsl 		    && strlen(entry->d_name) >= filename_len
    222   1.1       dsl #endif
    223   1.1       dsl 		    && strncmp(entry->d_name, filename,
    224   1.1       dsl 			filename_len) == 0)
    225   1.1       dsl 			break;
    226   1.1       dsl 	}
    227   1.1       dsl 
    228   1.1       dsl 	if (entry) {		/* match found */
    229   1.1       dsl 
    230  1.13       apb #if HAVE_STRUCT_DIRENT_D_NAMLEN
    231  1.13       apb 		len = entry->d_namlen;
    232  1.13       apb #else
    233   1.3       dsl 		len = strlen(entry->d_name);
    234   1.1       dsl #endif
    235   1.1       dsl 
    236   1.6  christos 		temp = malloc(strlen(dirname) + len + 1);
    237   1.3       dsl 		if (temp == NULL)
    238   1.3       dsl 			return NULL;
    239   1.6  christos 		(void)sprintf(temp, "%s%s", dirname, entry->d_name);
    240   1.1       dsl 	} else {
    241   1.1       dsl 		(void)closedir(dir);
    242   1.1       dsl 		dir = NULL;
    243   1.1       dsl 		temp = NULL;
    244   1.1       dsl 	}
    245   1.1       dsl 
    246   1.1       dsl 	return (temp);
    247   1.1       dsl }
    248   1.1       dsl 
    249   1.1       dsl 
    250   1.6  christos static const char *
    251   1.6  christos append_char_function(const char *name)
    252   1.6  christos {
    253   1.6  christos 	struct stat stbuf;
    254   1.7  christos 	char *expname = *name == '~' ? fn_tilde_expand(name) : NULL;
    255  1.12  christos 	const char *rs = " ";
    256   1.6  christos 
    257   1.6  christos 	if (stat(expname ? expname : name, &stbuf) == -1)
    258   1.6  christos 		goto out;
    259   1.6  christos 	if (S_ISDIR(stbuf.st_mode))
    260   1.6  christos 		rs = "/";
    261   1.6  christos out:
    262   1.6  christos 	if (expname)
    263   1.6  christos 		free(expname);
    264   1.6  christos 	return rs;
    265   1.6  christos }
    266   1.1       dsl /*
    267   1.1       dsl  * returns list of completions for text given
    268   1.5  christos  * non-static for readline.
    269   1.1       dsl  */
    270   1.5  christos char ** completion_matches(const char *, char *(*)(const char *, int));
    271   1.5  christos char **
    272   1.1       dsl completion_matches(const char *text, char *(*genfunc)(const char *, int))
    273   1.1       dsl {
    274   1.1       dsl 	char **match_list = NULL, *retstr, *prevstr;
    275   1.1       dsl 	size_t match_list_len, max_equal, which, i;
    276   1.1       dsl 	size_t matches;
    277   1.1       dsl 
    278   1.1       dsl 	matches = 0;
    279   1.1       dsl 	match_list_len = 1;
    280   1.1       dsl 	while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
    281   1.1       dsl 		/* allow for list terminator here */
    282   1.1       dsl 		if (matches + 3 >= match_list_len) {
    283   1.1       dsl 			char **nmatch_list;
    284   1.1       dsl 			while (matches + 3 >= match_list_len)
    285   1.1       dsl 				match_list_len <<= 1;
    286   1.1       dsl 			nmatch_list = realloc(match_list,
    287   1.1       dsl 			    match_list_len * sizeof(char *));
    288   1.1       dsl 			if (nmatch_list == NULL) {
    289   1.1       dsl 				free(match_list);
    290   1.1       dsl 				return NULL;
    291   1.1       dsl 			}
    292   1.1       dsl 			match_list = nmatch_list;
    293   1.1       dsl 
    294   1.1       dsl 		}
    295   1.1       dsl 		match_list[++matches] = retstr;
    296   1.1       dsl 	}
    297   1.1       dsl 
    298   1.1       dsl 	if (!match_list)
    299   1.1       dsl 		return NULL;	/* nothing found */
    300   1.1       dsl 
    301   1.1       dsl 	/* find least denominator and insert it to match_list[0] */
    302   1.1       dsl 	which = 2;
    303   1.1       dsl 	prevstr = match_list[1];
    304   1.1       dsl 	max_equal = strlen(prevstr);
    305   1.1       dsl 	for (; which <= matches; which++) {
    306   1.1       dsl 		for (i = 0; i < max_equal &&
    307   1.1       dsl 		    prevstr[i] == match_list[which][i]; i++)
    308   1.1       dsl 			continue;
    309   1.1       dsl 		max_equal = i;
    310   1.1       dsl 	}
    311   1.1       dsl 
    312   1.1       dsl 	retstr = malloc(max_equal + 1);
    313   1.1       dsl 	if (retstr == NULL) {
    314   1.1       dsl 		free(match_list);
    315   1.1       dsl 		return NULL;
    316   1.1       dsl 	}
    317   1.1       dsl 	(void)strncpy(retstr, match_list[1], max_equal);
    318   1.1       dsl 	retstr[max_equal] = '\0';
    319   1.1       dsl 	match_list[0] = retstr;
    320   1.1       dsl 
    321   1.1       dsl 	/* add NULL as last pointer to the array */
    322   1.1       dsl 	match_list[matches + 1] = (char *) NULL;
    323   1.1       dsl 
    324   1.1       dsl 	return (match_list);
    325   1.1       dsl }
    326   1.1       dsl 
    327   1.1       dsl /*
    328   1.1       dsl  * Sort function for qsort(). Just wrapper around strcasecmp().
    329   1.1       dsl  */
    330   1.1       dsl static int
    331   1.1       dsl _fn_qsort_string_compare(const void *i1, const void *i2)
    332   1.1       dsl {
    333   1.1       dsl 	const char *s1 = ((const char * const *)i1)[0];
    334   1.1       dsl 	const char *s2 = ((const char * const *)i2)[0];
    335   1.1       dsl 
    336   1.1       dsl 	return strcasecmp(s1, s2);
    337   1.1       dsl }
    338   1.1       dsl 
    339   1.1       dsl /*
    340   1.1       dsl  * Display list of strings in columnar format on readline's output stream.
    341  1.21  dholland  * 'matches' is list of strings, 'num' is number of strings in 'matches',
    342  1.21  dholland  * 'width' is maximum length of string in 'matches'.
    343  1.21  dholland  *
    344  1.21  dholland  * matches[0] is not one of the match strings, so the strings are
    345  1.21  dholland  * matches[1] *through* matches[num].
    346   1.1       dsl  */
    347   1.1       dsl void
    348  1.21  dholland fn_display_match_list (EditLine *el, char **matches, size_t num, size_t width)
    349   1.1       dsl {
    350  1.21  dholland 	size_t line, lines, col, cols, thisguy;
    351   1.1       dsl 	int screenwidth = el->el_term.t_size.h;
    352   1.1       dsl 
    353  1.21  dholland 	/* Ignore matches[0]. Avoid 1-based array logic below. */
    354  1.21  dholland 	matches++;
    355  1.21  dholland 
    356  1.21  dholland 	/*
    357  1.21  dholland 	 * Find out how many entries can be put on one line; count
    358  1.21  dholland 	 * with one space between strings the same way it's printed.
    359  1.21  dholland 	 */
    360  1.21  dholland 	cols = screenwidth / (width + 1);
    361  1.21  dholland 	if (cols == 0)
    362  1.21  dholland 		cols = 1;
    363  1.21  dholland 
    364  1.21  dholland 	/* how many lines of output, rounded up */
    365  1.21  dholland 	lines = (num + cols - 1) / cols;
    366  1.21  dholland 
    367  1.21  dholland 	/* Sort the items. */
    368  1.21  dholland 	qsort(matches, num, sizeof(char *), _fn_qsort_string_compare);
    369  1.21  dholland 
    370   1.1       dsl 	/*
    371  1.21  dholland 	 * On the ith line print elements i, i+lines, i+lines*2, etc.
    372   1.1       dsl 	 */
    373  1.21  dholland 	for (line = 0; line < lines; line++) {
    374  1.21  dholland 		for (col = 0; col < cols; col++) {
    375  1.21  dholland 			thisguy = line + col * lines;
    376  1.21  dholland 			if (thisguy >= num)
    377  1.21  dholland 				break;
    378  1.21  dholland 			(void)fprintf(el->el_outfile, "%s%-*s",
    379  1.21  dholland 			    col == 0 ? "" : " ", (int)width, matches[thisguy]);
    380  1.16  christos 		}
    381   1.1       dsl 		(void)fprintf(el->el_outfile, "\n");
    382   1.1       dsl 	}
    383   1.1       dsl }
    384   1.1       dsl 
    385   1.1       dsl /*
    386   1.1       dsl  * Complete the word at or before point,
    387   1.1       dsl  * 'what_to_do' says what to do with the completion.
    388   1.1       dsl  * \t   means do standard completion.
    389   1.1       dsl  * `?' means list the possible completions.
    390   1.1       dsl  * `*' means insert all of the possible completions.
    391   1.1       dsl  * `!' means to do standard completion, and list all possible completions if
    392   1.1       dsl  * there is more than one.
    393   1.1       dsl  *
    394   1.1       dsl  * Note: '*' support is not implemented
    395   1.1       dsl  *       '!' could never be invoked
    396   1.1       dsl  */
    397   1.1       dsl int
    398   1.1       dsl fn_complete(EditLine *el,
    399   1.1       dsl 	char *(*complet_func)(const char *, int),
    400   1.1       dsl 	char **(*attempted_completion_function)(const char *, int, int),
    401  1.17  christos 	const Char *word_break, const Char *special_prefixes,
    402  1.15  christos 	const char *(*app_func)(const char *), size_t query_items,
    403   1.1       dsl 	int *completion_type, int *over, int *point, int *end)
    404   1.1       dsl {
    405  1.17  christos 	const TYPE(LineInfo) *li;
    406  1.17  christos 	Char *temp;
    407  1.17  christos         char **matches;
    408  1.17  christos 	const Char *ctemp;
    409   1.1       dsl 	size_t len;
    410   1.1       dsl 	int what_to_do = '\t';
    411  1.10  christos 	int retval = CC_NORM;
    412   1.1       dsl 
    413   1.1       dsl 	if (el->el_state.lastcmd == el->el_state.thiscmd)
    414   1.1       dsl 		what_to_do = '?';
    415   1.1       dsl 
    416   1.1       dsl 	/* readline's rl_complete() has to be told what we did... */
    417   1.1       dsl 	if (completion_type != NULL)
    418   1.1       dsl 		*completion_type = what_to_do;
    419   1.1       dsl 
    420   1.1       dsl 	if (!complet_func)
    421   1.7  christos 		complet_func = fn_filename_completion_function;
    422   1.6  christos 	if (!app_func)
    423   1.6  christos 		app_func = append_char_function;
    424   1.1       dsl 
    425   1.1       dsl 	/* We now look backwards for the start of a filename/variable word */
    426  1.17  christos 	li = FUN(el,line)(el);
    427  1.17  christos 	ctemp = li->cursor;
    428   1.1       dsl 	while (ctemp > li->buffer
    429  1.17  christos 	    && !Strchr(word_break, ctemp[-1])
    430  1.17  christos 	    && (!special_prefixes || !Strchr(special_prefixes, ctemp[-1]) ) )
    431   1.1       dsl 		ctemp--;
    432   1.1       dsl 
    433   1.1       dsl 	len = li->cursor - ctemp;
    434  1.10  christos #if defined(__SSP__) || defined(__SSP_ALL__)
    435  1.18  christos 	temp = malloc(sizeof(*temp) * (len + 1));
    436  1.10  christos #else
    437  1.18  christos 	temp = alloca(sizeof(*temp) * (len + 1));
    438  1.10  christos #endif
    439  1.17  christos 	(void)Strncpy(temp, ctemp, len);
    440   1.1       dsl 	temp[len] = '\0';
    441   1.1       dsl 
    442   1.1       dsl 	/* these can be used by function called in completion_matches() */
    443   1.1       dsl 	/* or (*attempted_completion_function)() */
    444   1.1       dsl 	if (point != 0)
    445  1.14  christos 		*point = (int)(li->cursor - li->buffer);
    446   1.1       dsl 	if (end != NULL)
    447  1.14  christos 		*end = (int)(li->lastchar - li->buffer);
    448   1.1       dsl 
    449   1.1       dsl 	if (attempted_completion_function) {
    450  1.14  christos 		int cur_off = (int)(li->cursor - li->buffer);
    451  1.17  christos 		matches = (*attempted_completion_function) (ct_encode_string(temp, &el->el_scratch),
    452   1.1       dsl 		    (int)(cur_off - len), cur_off);
    453   1.1       dsl 	} else
    454   1.1       dsl 		matches = 0;
    455   1.1       dsl 	if (!attempted_completion_function ||
    456   1.8  christos 	    (over != NULL && !*over && !matches))
    457  1.17  christos 		matches = completion_matches(ct_encode_string(temp, &el->el_scratch), complet_func);
    458   1.1       dsl 
    459   1.1       dsl 	if (over != NULL)
    460   1.1       dsl 		*over = 0;
    461   1.1       dsl 
    462   1.1       dsl 	if (matches) {
    463  1.10  christos 		int i;
    464  1.14  christos 		size_t matches_num, maxlen, match_len, match_display=1;
    465   1.1       dsl 
    466  1.10  christos 		retval = CC_REFRESH;
    467   1.1       dsl 		/*
    468   1.1       dsl 		 * Only replace the completed string with common part of
    469   1.1       dsl 		 * possible matches if there is possible completion.
    470   1.1       dsl 		 */
    471   1.1       dsl 		if (matches[0][0] != '\0') {
    472   1.1       dsl 			el_deletestr(el, (int) len);
    473  1.17  christos 			FUN(el,insertstr)(el,
    474  1.17  christos 			    ct_decode_string(matches[0], &el->el_scratch));
    475   1.1       dsl 		}
    476   1.1       dsl 
    477   1.1       dsl 		if (what_to_do == '?')
    478   1.1       dsl 			goto display_matches;
    479   1.1       dsl 
    480   1.1       dsl 		if (matches[2] == NULL && strcmp(matches[0], matches[1]) == 0) {
    481   1.1       dsl 			/*
    482   1.1       dsl 			 * We found exact match. Add a space after
    483   1.1       dsl 			 * it, unless we do filename completion and the
    484   1.1       dsl 			 * object is a directory.
    485   1.1       dsl 			 */
    486  1.17  christos 			FUN(el,insertstr)(el,
    487  1.17  christos 			    ct_decode_string((*app_func)(matches[0]),
    488  1.17  christos 			    &el->el_scratch));
    489   1.1       dsl 		} else if (what_to_do == '!') {
    490   1.1       dsl     display_matches:
    491   1.1       dsl 			/*
    492   1.1       dsl 			 * More than one match and requested to list possible
    493   1.1       dsl 			 * matches.
    494   1.1       dsl 			 */
    495   1.1       dsl 
    496  1.17  christos 			for(i = 1, maxlen = 0; matches[i]; i++) {
    497   1.1       dsl 				match_len = strlen(matches[i]);
    498   1.1       dsl 				if (match_len > maxlen)
    499   1.1       dsl 					maxlen = match_len;
    500   1.1       dsl 			}
    501  1.21  dholland 			/* matches[1] through matches[i-1] are available */
    502   1.1       dsl 			matches_num = i - 1;
    503   1.1       dsl 
    504   1.1       dsl 			/* newline to get on next line from command line */
    505   1.1       dsl 			(void)fprintf(el->el_outfile, "\n");
    506   1.1       dsl 
    507   1.1       dsl 			/*
    508   1.1       dsl 			 * If there are too many items, ask user for display
    509   1.1       dsl 			 * confirmation.
    510   1.1       dsl 			 */
    511   1.1       dsl 			if (matches_num > query_items) {
    512   1.1       dsl 				(void)fprintf(el->el_outfile,
    513  1.14  christos 				    "Display all %zu possibilities? (y or n) ",
    514   1.1       dsl 				    matches_num);
    515   1.1       dsl 				(void)fflush(el->el_outfile);
    516   1.1       dsl 				if (getc(stdin) != 'y')
    517   1.1       dsl 					match_display = 0;
    518   1.1       dsl 				(void)fprintf(el->el_outfile, "\n");
    519   1.1       dsl 			}
    520   1.1       dsl 
    521   1.1       dsl 			if (match_display)
    522   1.1       dsl 				fn_display_match_list(el, matches, matches_num,
    523  1.14  christos 				    maxlen);
    524   1.1       dsl 			retval = CC_REDISPLAY;
    525   1.1       dsl 		} else if (matches[0][0]) {
    526   1.1       dsl 			/*
    527   1.1       dsl 			 * There was some common match, but the name was
    528   1.1       dsl 			 * not complete enough. Next tab will print possible
    529   1.1       dsl 			 * completions.
    530   1.1       dsl 			 */
    531   1.1       dsl 			el_beep(el);
    532   1.1       dsl 		} else {
    533   1.1       dsl 			/* lcd is not a valid object - further specification */
    534   1.1       dsl 			/* is needed */
    535   1.1       dsl 			el_beep(el);
    536   1.1       dsl 			retval = CC_NORM;
    537   1.1       dsl 		}
    538   1.1       dsl 
    539   1.1       dsl 		/* free elements of array and the array itself */
    540   1.1       dsl 		for (i = 0; matches[i]; i++)
    541   1.1       dsl 			free(matches[i]);
    542  1.10  christos 		free(matches);
    543  1.10  christos 		matches = NULL;
    544   1.1       dsl 	}
    545  1.10  christos #if defined(__SSP__) || defined(__SSP_ALL__)
    546  1.10  christos 	free(temp);
    547  1.10  christos #endif
    548  1.10  christos 	return retval;
    549   1.1       dsl }
    550   1.1       dsl 
    551   1.1       dsl /*
    552   1.1       dsl  * el-compatible wrapper around rl_complete; needed for key binding
    553   1.1       dsl  */
    554   1.1       dsl /* ARGSUSED */
    555   1.1       dsl unsigned char
    556   1.1       dsl _el_fn_complete(EditLine *el, int ch __attribute__((__unused__)))
    557   1.1       dsl {
    558   1.1       dsl 	return (unsigned char)fn_complete(el, NULL, NULL,
    559   1.6  christos 	    break_chars, NULL, NULL, 100,
    560   1.1       dsl 	    NULL, NULL, NULL, NULL);
    561   1.1       dsl }
    562