alsa: Remove pointless initialization.
[paraslash.git] / interactive.c
1 /*
2 * Copyright (C) 2011-2013 Andre Noll <maan@systemlinux.org>
3 *
4 * Licensed under the GPL v2. For licencing details see COPYING.
5 */
6
7 /** \file interactive.c Readline abstraction for interactive sessions. */
8
9 #include <regex.h>
10 #include <stdbool.h>
11 #include <curses.h>
12 #include <readline/readline.h>
13 #include <readline/history.h>
14 #include <sys/ioctl.h>
15 #include <assert.h>
16 #include <signal.h>
17
18 #include "para.h"
19 #include "fd.h"
20 #include "buffer_tree.h"
21 #include "list.h"
22 #include "sched.h"
23 #include "interactive.h"
24 #include "string.h"
25 #include "error.h"
26
27 struct i9e_private {
28 struct i9e_client_info *ici;
29 FILE *stderr_stream;
30 int num_columns;
31 char empty_line[1000];
32 struct task task;
33 struct btr_node *stdout_btrn;
34 bool last_write_was_status;
35 bool line_handler_running;
36 bool input_eof;
37 bool caught_sigint;
38 bool caught_sigterm;
39 Keymap standard_km;
40 Keymap bare_km;
41 };
42 static struct i9e_private i9e_private, *i9ep = &i9e_private;
43
44 /**
45 * Return the error state of the i9e task.
46 *
47 * This is mainly useful for other tasks to tell whether the i9e task is still
48 * running.
49 *
50 * \return A negative return value of zero means the i9e task terminated. Only
51 * in this case it is safe to call ie9_close().
52 */
53 int i9e_get_error(void)
54 {
55 return i9ep->task.error;
56 }
57
58 static bool is_prefix(const char *partial, const char *full, size_t len)
59 {
60 if (len == 0)
61 len = strlen(partial);
62 return !strncmp(partial, full, len);
63 }
64
65 /*
66 * Generator function for command completion. STATE lets us know whether
67 * to start from scratch; without any state (i.e. STATE == 0), then we
68 * start at the top of the list.
69 */
70 static char *command_generator(const char *text, int state)
71 {
72 static int list_index, len;
73 const char *name;
74 struct i9e_client_info *ici = i9ep->ici;
75
76 rl_attempted_completion_over = 1; /* disable filename completion */
77 /*
78 * If this is a new word to complete, initialize now. This includes
79 * saving the length of TEXT for efficiency, and initializing the index
80 * variable to 0.
81 */
82 if (state == 0) {
83 list_index = 0;
84 len = strlen(text);
85 }
86 /* Return the next name which partially matches from the command list. */
87 while ((name = ici->completers[list_index].name)) {
88 list_index++;
89 if (is_prefix(text, name, len))
90 return para_strdup(name);
91 }
92 return NULL; /* no names matched */
93 }
94
95 static void reset_completion_result(struct i9e_completion_result *cr)
96 {
97 cr->dont_append_space = false;
98 cr->filename_completion_desired = false;
99 cr->matches = NULL;
100 }
101
102 static void create_matches(struct i9e_completion_info *ci,
103 struct i9e_completer *completers,
104 struct i9e_completion_result *cr)
105 {
106 int i, ret;
107
108 reset_completion_result(cr);
109
110 ret = create_argv(ci->buffer, " ", &ci->argv);
111 if (ret < 0 || !ci->argv[0])
112 return;
113
114 ci->argc = ret;
115 ci->word_num = compute_word_num(ci->buffer, " ", ci->point);
116 for (i = 0; completers[i].name; i++) {
117 if (strcmp(completers[i].name, ci->argv[0]) != 0)
118 continue;
119 completers[i].completer(ci, cr);
120 break;
121 }
122 PARA_DEBUG_LOG("current word: %d (%s)\n", ci->word_num,
123 ci->argv[ci->word_num]);
124 if (cr->matches)
125 for (i = 0; cr->matches[i]; i++)
126 PARA_DEBUG_LOG("match %d: %s\n", i, cr->matches[i]);
127 }
128
129 static char *completion_generator(const char *word, int state)
130 {
131 static int list_index;
132 static char **argv, **matches;
133 struct i9e_completer *completers = i9ep->ici->completers;
134 struct i9e_completion_info ci = {
135 .word = (char *)word,
136 .point = rl_point,
137 .buffer = rl_line_buffer,
138 };
139 struct i9e_completion_result cr = {.matches = NULL};
140
141 if (state != 0)
142 goto out;
143 /* clean up previous matches and set defaults */
144 free(matches);
145 matches = NULL;
146 free_argv(argv);
147 argv = NULL;
148 list_index = 0;
149 rl_completion_append_character = ' ';
150 rl_completion_suppress_append = false;
151 rl_attempted_completion_over = true;
152
153 create_matches(&ci, completers, &cr);
154
155 matches = cr.matches;
156 argv = ci.argv;
157 rl_completion_suppress_append = cr.dont_append_space;
158 rl_attempted_completion_over = !cr.filename_completion_desired;
159 out:
160 if (!matches)
161 return NULL;
162 return matches[list_index++];
163 }
164
165 /*
166 * Attempt to complete on the contents of TEXT. START and END bound the
167 * region of rl_line_buffer that contains the word to complete. TEXT is
168 * the word to complete. We can use the entire contents of rl_line_buffer
169 * in case we want to do some simple parsing. Return the array of matches,
170 * or NULL if there aren't any.
171 */
172 static char **i9e_completer(const char *text, int start, __a_unused int end)
173 {
174 struct i9e_client_info *ici = i9ep->ici;
175
176 if (!ici->completers)
177 return NULL;
178 /* Complete on command names if this is the first word in the line. */
179 if (start == 0)
180 return rl_completion_matches(text, command_generator);
181 return rl_completion_matches(text, completion_generator);
182 }
183
184 /**
185 * Prepare writing to stdout.
186 *
187 * \param producer The buffer tree node which produces output.
188 *
189 * The i9e subsystem maintains a buffer tree node which may be attached to
190 * another node which generates output (a "producer"). When attached, the i9e
191 * buffer tree node copies the buffers generated by the producer to stdout.
192 *
193 * This function attaches the i9e input queue to an output queue of \a
194 * producer.
195 *
196 * \return Standard.
197 */
198 void i9e_attach_to_stdout(struct btr_node *producer)
199 {
200 btr_remove_node(&i9ep->stdout_btrn);
201 i9ep->stdout_btrn = btr_new_node(&(struct btr_node_description)
202 EMBRACE(.name = "interactive_stdout", .parent = producer));
203 rl_set_keymap(i9ep->bare_km);
204 }
205
206 static void wipe_bottom_line(void)
207 {
208 char x[] = " ";
209 int n = i9ep->num_columns;
210
211 /*
212 * For reasons beyond my understanding, writing more than 68 characters
213 * here causes MacOS to mess up the terminal. Writing a line of spaces
214 * in smaller chunks works fine though. Weird.
215 */
216 fprintf(i9ep->stderr_stream, "\r");
217 while (n > 0) {
218 if (n >= sizeof(x)) {
219 fprintf(i9ep->stderr_stream, "%s", x);
220 n -= sizeof(x);
221 continue;
222 }
223 x[n] = '\0';
224 fprintf(i9ep->stderr_stream, "%s", x);
225 break;
226 }
227 fprintf(i9ep->stderr_stream, "\r");
228 }
229
230 /**
231 * Free all storage associated with a keymap.
232 *
233 * This function is not declared in the readline headers although the symbol is
234 * exported and the function is documented in the readline info file. So we
235 * have to declare it here.
236 *
237 * \param keymap The keymap to deallocate.
238 */
239 void rl_free_keymap(Keymap keymap);
240
241 /**
242 * Reset the terminal and save the in-memory command line history.
243 *
244 * This should be called before the caller exits.
245 */
246 void i9e_close(void)
247 {
248 char *hf = i9ep->ici->history_file;
249
250 rl_free_keymap(i9ep->bare_km);
251 rl_callback_handler_remove();
252 if (hf)
253 write_history(hf);
254 wipe_bottom_line();
255 }
256
257 static void clear_bottom_line(void)
258 {
259 int point;
260 char *text;
261
262 if (rl_point == 0 && rl_end == 0)
263 return wipe_bottom_line();
264 /*
265 * We might have a multi-line input that needs to be wiped here, so the
266 * simple printf("\r<space>\r") is insufficient. To workaround this, we
267 * remove the whole line, redisplay and restore the killed text.
268 */
269 point = rl_point;
270 text = rl_copy_text(0, rl_end);
271 rl_kill_full_line(0, 0);
272 rl_redisplay();
273 wipe_bottom_line(); /* wipe out the prompt */
274 rl_insert_text(text);
275 free(text);
276 rl_point = point;
277 }
278
279 static bool input_available(void)
280 {
281 fd_set rfds;
282 struct timeval tv = {0, 0};
283 int ret;
284
285 FD_ZERO(&rfds);
286 FD_SET(i9ep->ici->fds[0], &rfds);
287 ret = para_select(1, &rfds, NULL, &tv);
288 return ret > 0;
289 }
290
291 static void i9e_line_handler(char *line)
292 {
293 int ret;
294 struct btr_node *dummy;
295
296 if (!line) {
297 i9ep->input_eof = true;
298 return;
299 }
300 if (!*line)
301 goto free_line;
302 rl_set_prompt("");
303 dummy = btr_new_node(&(struct btr_node_description)
304 EMBRACE(.name = "dummy line handler"));
305 i9e_attach_to_stdout(dummy);
306 ret = i9ep->ici->line_handler(line);
307 if (ret < 0)
308 PARA_WARNING_LOG("%s\n", para_strerror(-ret));
309 add_history(line);
310 btr_remove_node(&dummy);
311 free_line:
312 free(line);
313 }
314
315 static int i9e_post_select(__a_unused struct sched *s, __a_unused struct task *t)
316 {
317 int ret;
318 struct i9e_client_info *ici = i9ep->ici;
319 char *buf;
320 size_t sz, consumed = 0;
321
322 ret = -E_I9E_EOF;
323 if (i9ep->input_eof)
324 goto rm_btrn;
325 ret = -E_I9E_TERM_RQ;
326 if (i9ep->caught_sigterm)
327 goto rm_btrn;
328 ret = 0;
329 if (i9ep->caught_sigint)
330 goto rm_btrn;
331 while (input_available())
332 rl_callback_read_char();
333 if (!i9ep->stdout_btrn)
334 goto out;
335 ret = btr_node_status(i9ep->stdout_btrn, 0, BTR_NT_LEAF);
336 if (ret < 0) {
337 ret = 0;
338 goto rm_btrn;
339 }
340 if (ret == 0)
341 goto out;
342 again:
343 sz = btr_next_buffer(i9ep->stdout_btrn, &buf);
344 if (sz == 0)
345 goto out;
346 if (i9ep->last_write_was_status)
347 fprintf(i9ep->stderr_stream, "\n");
348 i9ep->last_write_was_status = false;
349 ret = xwrite(ici->fds[1], buf, sz);
350 if (ret < 0)
351 goto rm_btrn;
352 btr_consume(i9ep->stdout_btrn, ret);
353 consumed += ret;
354 if (ret == sz && consumed < 10000)
355 goto again;
356 goto out;
357 rm_btrn:
358 if (i9ep->stdout_btrn) {
359 wipe_bottom_line();
360 btr_remove_node(&i9ep->stdout_btrn);
361 rl_set_keymap(i9ep->standard_km);
362 rl_set_prompt(i9ep->ici->prompt);
363 rl_redisplay();
364 }
365 if (ret < 0)
366 wipe_bottom_line();
367 out:
368 i9ep->caught_sigint = false;
369 return ret;
370 }
371
372 static void i9e_pre_select(struct sched *s, __a_unused struct task *t)
373 {
374 int ret;
375
376 if (i9ep->input_eof || i9ep->caught_sigint || i9ep->caught_sigterm) {
377 sched_min_delay(s);
378 return;
379 }
380 if (i9ep->stdout_btrn) {
381 ret = btr_node_status(i9ep->stdout_btrn, 0, BTR_NT_LEAF);
382 if (ret < 0) {
383 sched_min_delay(s);
384 return;
385 }
386 if (ret > 0)
387 para_fd_set(i9ep->ici->fds[1], &s->wfds, &s->max_fileno);
388 }
389 /*
390 * fd[0] might have been reset to blocking mode if our job was moved to
391 * the background due to CTRL-Z or SIGSTOP, so set the fd back to
392 * nonblocking mode.
393 */
394 ret = mark_fd_nonblocking(i9ep->ici->fds[0]);
395 if (ret < 0)
396 PARA_WARNING_LOG("set to nonblock failed: (fd0 %d, %s)\n",
397 i9ep->ici->fds[0], para_strerror(-ret));
398 para_fd_set(i9ep->ici->fds[0], &s->rfds, &s->max_fileno);
399 }
400
401 static void update_winsize(void)
402 {
403 struct winsize w;
404 int ret = ioctl(i9ep->ici->fds[2], TIOCGWINSZ, (char *)&w);
405
406 if (ret >= 0) {
407 assert(w.ws_col < sizeof(i9ep->empty_line));
408 i9ep->num_columns = w.ws_col;
409 } else
410 i9ep->num_columns = 80;
411
412 memset(i9ep->empty_line, ' ', i9ep->num_columns);
413 i9ep->empty_line[i9ep->num_columns] = '\0';
414 }
415
416 /**
417 * Defined key sequences are mapped to keys starting with this offset. I.e.
418 * pressing the first defined key sequence yields the key number \p KEY_OFFSET.
419 */
420 #define KEY_OFFSET 64
421
422 static int dispatch_key(__a_unused int count, int key)
423 {
424 int ret;
425
426 assert(key >= KEY_OFFSET);
427 ret = i9ep->ici->key_handler(key - KEY_OFFSET);
428 return ret < 0? ret : 0;
429 }
430
431 /**
432 * Register the i9e task and initialize readline.
433 *
434 * \param ici The i9e configuration parameters set by the caller.
435 * \param s The scheduler instance to add the i9e task to.
436 *
437 * The caller must allocate and initialize the structure \a ici points to.
438 *
439 * \return Standard.
440 * \sa \ref register_task().
441 */
442 int i9e_open(struct i9e_client_info *ici, struct sched *s)
443 {
444 int ret;
445
446 if (!isatty(ici->fds[0]))
447 return -E_I9E_SETUPTERM;
448 ret = mark_fd_nonblocking(ici->fds[0]);
449 if (ret < 0)
450 return ret;
451 ret = mark_fd_nonblocking(ici->fds[1]);
452 if (ret < 0)
453 return ret;
454 i9ep->task.pre_select = i9e_pre_select;
455 i9ep->task.post_select = i9e_post_select;
456 sprintf(i9ep->task.status, "i9e");
457 register_task(s, &i9ep->task);
458 rl_readline_name = "para_i9e";
459 rl_basic_word_break_characters = " ";
460 rl_attempted_completion_function = i9e_completer;
461 i9ep->ici = ici;
462 i9ep->stderr_stream = fdopen(ici->fds[2], "w");
463 setvbuf(i9ep->stderr_stream, NULL, _IONBF, 0);
464
465 i9ep->standard_km = rl_get_keymap();
466 i9ep->bare_km = rl_make_bare_keymap();
467 if (ici->bound_keyseqs) {
468 char *seq;
469 int i;
470 /* FIXME: This is an arbitrary constant. */
471 for (i = 0; i < 32 && (seq = ici->bound_keyseqs[i]); i++) {
472 char buf[2] = {KEY_OFFSET + i, '\0'};
473 /* readline needs an allocated buffer for the macro */
474 rl_generic_bind(ISMACR, seq, para_strdup(buf), i9ep->bare_km);
475 rl_bind_key_in_map(KEY_OFFSET + i, dispatch_key, i9ep->bare_km);
476 }
477 }
478 if (ici->history_file)
479 read_history(ici->history_file);
480 update_winsize();
481 if (ici->producer) {
482 rl_callback_handler_install("", i9e_line_handler);
483 i9e_attach_to_stdout(ici->producer);
484 rl_set_keymap(i9ep->bare_km);
485 } else
486 rl_callback_handler_install(i9ep->ici->prompt, i9e_line_handler);
487 return 1;
488 }
489
490 static void reset_line_state(void)
491 {
492 if (i9ep->stdout_btrn)
493 return;
494 rl_on_new_line();
495 rl_reset_line_state();
496 rl_forced_update_display();
497 }
498
499 /**
500 * The log function of the i9e subsystem.
501 *
502 * \param ll Severity log level.
503 * \param fmt Printf-like format string.
504 *
505 * This clears the bottom line of the terminal if necessary and writes the
506 * string given by \a fmt to fd[2], where fd[] is the array provided earlier in
507 * \ref i9e_open().
508 */
509 __printf_2_3 void i9e_log(int ll, const char* fmt,...)
510 {
511 va_list argp;
512
513 if (ll < i9ep->ici->loglevel)
514 return;
515 clear_bottom_line();
516 va_start(argp, fmt);
517 vfprintf(i9ep->stderr_stream, fmt, argp);
518 va_end(argp);
519 reset_line_state();
520 i9ep->last_write_was_status = false;
521 }
522
523 /**
524 * Print the current status to stderr.
525 *
526 * \param buf The text to print.
527 * \param len The number of bytes in \a buf.
528 *
529 * This clears the bottom line, moves to the beginning of the line and prints
530 * the given text. If the length of this text exceeds the width of the
531 * terminal, the text is shortened by leaving out a part in the middle.
532 */
533 void ie9_print_status_bar(char *buf, unsigned len)
534 {
535 size_t x = i9ep->num_columns, y = (x - 4) / 2;
536
537 assert(x >= 6);
538 if (len > x) {
539 buf[y] = '\0';
540 fprintf(i9ep->stderr_stream, "\r%s", buf);
541 fprintf(i9ep->stderr_stream, " .. ");
542 fprintf(i9ep->stderr_stream, "%s", buf + len - y);
543 } else {
544 char scratch[1000];
545
546 y = x - len;
547 scratch[0] = '\r';
548 strcpy(scratch + 1, buf);
549 memset(scratch + 1 + len, ' ', y);
550 scratch[1 + len + y] = '\r';
551 scratch[2 + len + y] = '\0';
552 fprintf(i9ep->stderr_stream, "\r%s", scratch);
553 }
554 i9ep->last_write_was_status = true;
555 }
556
557 /**
558 * Tell i9e that the caller received a signal.
559 *
560 * \param sig_num The number of the signal received.
561 *
562 * Currently the function only cares about \p SIGINT, but this may change.
563 */
564 void i9e_signal_dispatch(int sig_num)
565 {
566 if (sig_num == SIGWINCH)
567 return update_winsize();
568 if (sig_num == SIGINT) {
569 fprintf(i9ep->stderr_stream, "\n");
570 rl_replace_line ("", false /* clear_undo */);
571 reset_line_state();
572 i9ep->caught_sigint = true;
573 }
574 if (sig_num == SIGTERM)
575 i9ep->caught_sigterm = true;
576 }
577
578 /**
579 * Wrapper for select(2) which does not restart on interrupts.
580 *
581 * \param n \sa \ref para_select().
582 * \param readfds \sa \ref para_select().
583 * \param writefds \sa \ref para_select().
584 * \param timeout_tv \sa \ref para_select().
585 *
586 * \return \sa \ref para_select().
587 *
588 * The only difference between this function and \ref para_select() is that
589 * \ref i9e_select() returns zero if the select call returned \p EINTR.
590 */
591 int i9e_select(int n, fd_set *readfds, fd_set *writefds,
592 struct timeval *timeout_tv)
593 {
594 int ret = select(n, readfds, writefds, NULL, timeout_tv);
595
596 if (ret < 0) {
597 if (errno == EINTR)
598 ret = 0;
599 else
600 ret = -ERRNO_TO_PARA_ERROR(errno);
601 }
602 return ret;
603 }
604
605 /**
606 * Return the possible completions for a given word.
607 *
608 * \param word The word to complete.
609 * \param string_list All possible words in this context.
610 * \param result String list is returned here.
611 *
612 * This function never fails. If no completion was found, a string list of
613 * length zero is returned. In any case, the result must be freed by the caller
614 * using \ref free_argv().
615 *
616 * This function is independent of readline and may be called before
617 * i9e_open().
618 *
619 * \return The number of possible completions.
620 */
621 int i9e_extract_completions(const char *word, char **string_list,
622 char ***result)
623 {
624 char **matches = para_malloc(sizeof(char *));
625 int match_count = 0, matches_len = 1;
626 char **p;
627 int len = strlen(word);
628
629 for (p = string_list; *p; p++) {
630 if (!is_prefix(word, *p, len))
631 continue;
632 match_count++;
633 if (match_count >= matches_len) {
634 matches_len *= 2;
635 matches = para_realloc(matches,
636 matches_len * sizeof(char *));
637 }
638 matches[match_count - 1] = para_strdup(*p);
639 }
640 matches[match_count] = NULL;
641 *result = matches;
642 return match_count;
643 }
644
645 /**
646 * Return the list of partially matching words.
647 *
648 * \param word The command to complete.
649 * \param completers The array containing all command names.
650 *
651 * This is similar to \ref i9e_extract_completions(), but completes on the
652 * command names in \a completers.
653 *
654 * \return See \ref i9e_extract_completions().
655 */
656 char **i9e_complete_commands(const char *word, struct i9e_completer *completers)
657 {
658 char **matches;
659 const char *cmd;
660 int i, match_count, len = strlen(word);
661
662 /*
663 * In contrast to completing against an arbitrary string list, here we
664 * know all possible completions and expect that there will not be many
665 * of them. So it should be OK to iterate twice over all commands which
666 * simplifies the code a bit.
667 */
668 for (i = 0, match_count = 0; (cmd = completers[i].name); i++) {
669 if (is_prefix(word, cmd, len))
670 match_count++;
671 }
672 matches = para_malloc((match_count + 1) * sizeof(*matches));
673 for (i = 0, match_count = 0; (cmd = completers[i].name); i++)
674 if (is_prefix(word, cmd, len))
675 matches[match_count++] = para_strdup(cmd);
676 matches[match_count] = NULL;
677 return matches;
678 }
679
680 /**
681 * Complete according to the given options.
682 *
683 * \param opts All available options.
684 * \param ci Information which was passed to the completer.
685 * \param cr Result pointer.
686 *
687 * This convenience helper can be used to complete an option. The array of all
688 * possible options is passed as the first argument. Flags, i.e. options
689 * without an argument, are expected to be listed as strings of type "-X" in \a
690 * opts while options which require an argument should be passed with a
691 * trailing "=" character like "-X=".
692 *
693 * If the word can be uniquely completed to a flag option, an additional space
694 * character is appended to the output. For non-flag options no space character
695 * is appended.
696 */
697 void i9e_complete_option(char **opts, struct i9e_completion_info *ci,
698 struct i9e_completion_result *cr)
699 {
700 int num_matches;
701
702 num_matches = i9e_extract_completions(ci->word, opts, &cr->matches);
703 if (num_matches == 1) {
704 char *opt = cr->matches[0];
705 char c = opt[strlen(opt) - 1];
706 if (c == '=')
707 cr->dont_append_space = true;
708 }
709 }
710
711 /**
712 * Print possible completions to stdout.
713 *
714 * \param completers The array of completion functions.
715 *
716 * At the end of the output a line starting with "-o=", followed by the
717 * (possibly empty) list of completion options is printed. Currently, the only
718 * two completion options are "nospace" and "filenames". The former indicates
719 * that no space should be appended even for a unique match while the latter
720 * indicates that usual filename completion should be performed in addition to
721 * the previously printed options.
722 *
723 * \return Standard.
724 */
725 int i9e_print_completions(struct i9e_completer *completers)
726 {
727 struct i9e_completion_result cr;
728 struct i9e_completion_info ci;
729 char *buf;
730 const char *end, *p;
731 int i, n, ret;
732
733 reset_completion_result(&cr);
734 buf = getenv("COMP_POINT");
735 ci.point = buf? atoi(buf) : 0;
736 ci.buffer = para_strdup(getenv("COMP_LINE"));
737
738 ci.argc = create_argv(ci.buffer, " ", &ci.argv);
739 ci.word_num = compute_word_num(ci.buffer, " ", ci.point);
740
741 end = ci.buffer + ci.point;
742 for (p = end; p > ci.buffer && *p != ' '; p--)
743 ; /* nothing */
744 if (*p == ' ')
745 p++;
746
747 n = end - p + 1;
748 ci.word = para_malloc(n + 1);
749 strncpy(ci.word, p, n);
750 ci.word[n] = '\0';
751
752 PARA_DEBUG_LOG("line: %s, point: %d (%c), wordnum: %d, word: %s\n",
753 ci.buffer, ci.point, ci.buffer[ci.point], ci.word_num, ci.word);
754 if (ci.word_num == 0)
755 cr.matches = i9e_complete_commands(ci.word, completers);
756 else
757 create_matches(&ci, completers, &cr);
758 ret = 0;
759 if (cr.matches && cr.matches[0]) {
760 for (i = 0; cr.matches[i]; i++)
761 printf("%s\n", cr.matches[i]);
762 ret = 1;
763 }
764 printf("-o=");
765 if (cr.dont_append_space)
766 printf("nospace");
767 if (cr.filename_completion_desired)
768 printf(",filenames");
769 printf("\n");
770 free_argv(cr.matches);
771 free_argv(ci.argv);
772 free(ci.buffer);
773 free(ci.word);
774 return ret;
775 }