lib/libedit/filecomplete.c

262 	size_t matches;
264 	matches = 0;
266 	while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
268 		if (matches + 3 >= match_list_len) {
270 			while (matches + 3 >= match_list_len)
281 		match_list[++matches] = retstr;
291 	for (; which <= matches; which++) {
308 	match_list[matches + 1] = (char *) NULL;
329  * 'matches' is list of strings, 'len' is number of strings in 'matches',
330  * 'max' is maximum length of string in 'matches'.
333 fn_display_match_list(EditLine *el, char **matches, size_t len, size_t max)
352 	qsort(&matches[1], len, sizeof(char *), _fn_qsort_string_compare);
356 		int more = limit > 0 && matches[0];
358 			more = ++i < limit && matches[idx + 1];
360 			    matches[idx], more ? " " : "");
393 	char **matches;
450 		matches = (*attempted_completion_function) (dequoted_temp ? dequoted_temp : temp,
453 		matches = 0;
455 	    (over != NULL && !*over && !matches))
456 		matches = completion_matches(dequoted_temp ? dequoted_temp : temp, complet_func);
461 	if (matches) {
468 		 * possible matches if there is possible completion.
470 		if (matches[0][0] != '\0') {
473 				quoted_match = quoting_func(matches[0]);
480 			el_insertstr(el, quoted_match ? quoted_match : matches[0]);
488 		if (matches[2] == NULL && strcmp(matches[0], matches[1]) == 0) {
494 			el_insertstr(el, (*app_func)(matches[0]));
499 			 * matches.
502 			for(i = 1, maxlen = 0; matches[i]; i++) {
503 				match_len = strlen(matches[i]);
527 				fn_display_match_list(el, matches, matches_num,
530 		} else if (matches[0][0]) {
546 		for (i = 0; matches[i]; i++)
547 			free(matches[i]);
548 		free(matches);
549 		matches = NULL;