lib/libedit/filecomplete.c

291 	size_t matches;
293 	matches = 0;
295 	while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
297 		if (matches + 3 >= match_list_len) {
299 			while (matches + 3 >= match_list_len)
310 		match_list[++matches] = retstr;
320 	for (; which <= matches; which++) {
337 	match_list[matches + 1] = NULL;
356  * 'matches' is list of strings, 'num' is number of strings in 'matches',
357  * 'width' is maximum length of string in 'matches'.
359  * matches[0] is not one of the match strings, but it is counted in
360  * num, so the strings are matches[1] *through* matches[num-1].
363 fn_display_match_list (EditLine *el, char **matches, size_t num, size_t width)
368 	/* Ignore matches[0]. Avoid 1-based array logic below. */
369 	matches++;
384 	qsort(matches, num, sizeof(char *), _fn_qsort_string_compare);
395 			    col == 0 ? "" : " ", (int)width, matches[thisguy]);
427         char **matches;
478 		matches = (*attempted_completion_function)(
483 		matches = NULL;
485 	    (over != NULL && !*over && !matches))
486 		matches = completion_matches(
493 	if (matches) {
500 		 * possible matches if there is possible completion.
502 		if (matches[0][0] != '\0') {
505 				quoted_match = quoting_func(matches[0]);
513 			        matches[0] , &el->el_scratch));
519 		if (matches[2] == NULL &&
520 		    (matches[1] == NULL || strcmp(matches[0], matches[1]) == 0)) {
527 			    ct_decode_string((*app_func)(matches[0]),
533 			 * matches.
536 			for(i = 1, maxlen = 0; matches[i]; i++) {
537 				match_len = strlen(matches[i]);
541 			/* matches[1] through matches[i-1] are available */
564 				 * strings be matches[1..num-1] for compat.
566 				 * the prefix in matches[0], so we need to
569 				fn_display_match_list(el, matches,
573 		} else if (matches[0][0]) {
589 		for (i = 0; matches[i]; i++)
590 			el_free(matches[i]);
591 		el_free(matches);
592 		matches = NULL;