Lines Matching refs:words
84 * Otherwise, list choices. words is assumed to be filtered
89 * words stringlist containing possible matches
93 complete_ambiguous(char *word, int list, StringList *words)
101 if (words->sl_cur == 0)
104 if (words->sl_cur == 1) { /* only once choice available */
105 p = words->sl_str[0] + wordlen;
117 lastmatch = words->sl_str[0];
119 for (i = 1 ; i < words->sl_cur ; i++) {
120 for (j = wordlen ; j < strlen(words->sl_str[i]); j++)
121 if (lastmatch[j] != words->sl_str[i][j])
137 qsort(words->sl_str, words->sl_cur, sizeof(char *), comparstr);
138 list_vertical(words);
149 StringList *words;
153 words = ftp_sl_init();
160 ftp_sl_add(words, c->c_name);
163 rv = complete_ambiguous(word, list, words);
168 sl_free(words, 0);
178 StringList *words;
210 words = ftp_sl_init();
228 ftp_sl_add(words, tcp);
233 rv = complete_ambiguous(file, list, words);
240 (void)strlcat(path, words->sl_str[0], sizeof(path));
251 sl_free(words, 1);
261 StringList *words;
265 words = ftp_sl_init();
272 ftp_sl_add(words, o->name);
275 rv = complete_ambiguous(word, list, words);
280 sl_free(words, 0);
292 StringList *words;
347 words = ftp_sl_init();
353 ftp_sl_add(words, cp);
355 rv = complete_ambiguous(file, list, words);
356 sl_free(words, 0);