2 * QEMU readline utility
4 * Copyright (c) 2003-2004 Fabrice Bellard
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
25 #include "qemu-common.h"
26 #include "qemu/readline.h"
33 void readline_show_prompt(ReadLineState
*rs
)
35 rs
->printf_func(rs
->opaque
, "%s", rs
->prompt
);
36 rs
->flush_func(rs
->opaque
);
37 rs
->last_cmd_buf_index
= 0;
38 rs
->last_cmd_buf_size
= 0;
39 rs
->esc_state
= IS_NORM
;
42 /* update the displayed command line */
43 static void readline_update(ReadLineState
*rs
)
47 if (rs
->cmd_buf_size
!= rs
->last_cmd_buf_size
||
48 memcmp(rs
->cmd_buf
, rs
->last_cmd_buf
, rs
->cmd_buf_size
) != 0) {
49 for(i
= 0; i
< rs
->last_cmd_buf_index
; i
++) {
50 rs
->printf_func(rs
->opaque
, "\033[D");
52 rs
->cmd_buf
[rs
->cmd_buf_size
] = '\0';
53 if (rs
->read_password
) {
54 len
= strlen(rs
->cmd_buf
);
55 for(i
= 0; i
< len
; i
++)
56 rs
->printf_func(rs
->opaque
, "*");
58 rs
->printf_func(rs
->opaque
, "%s", rs
->cmd_buf
);
60 rs
->printf_func(rs
->opaque
, "\033[K");
61 memcpy(rs
->last_cmd_buf
, rs
->cmd_buf
, rs
->cmd_buf_size
);
62 rs
->last_cmd_buf_size
= rs
->cmd_buf_size
;
63 rs
->last_cmd_buf_index
= rs
->cmd_buf_size
;
65 if (rs
->cmd_buf_index
!= rs
->last_cmd_buf_index
) {
66 delta
= rs
->cmd_buf_index
- rs
->last_cmd_buf_index
;
68 for(i
= 0;i
< delta
; i
++) {
69 rs
->printf_func(rs
->opaque
, "\033[C");
73 for(i
= 0;i
< delta
; i
++) {
74 rs
->printf_func(rs
->opaque
, "\033[D");
77 rs
->last_cmd_buf_index
= rs
->cmd_buf_index
;
79 rs
->flush_func(rs
->opaque
);
82 static void readline_insert_char(ReadLineState
*rs
, int ch
)
84 if (rs
->cmd_buf_index
< READLINE_CMD_BUF_SIZE
) {
85 memmove(rs
->cmd_buf
+ rs
->cmd_buf_index
+ 1,
86 rs
->cmd_buf
+ rs
->cmd_buf_index
,
87 rs
->cmd_buf_size
- rs
->cmd_buf_index
);
88 rs
->cmd_buf
[rs
->cmd_buf_index
] = ch
;
94 static void readline_backward_char(ReadLineState
*rs
)
96 if (rs
->cmd_buf_index
> 0) {
101 static void readline_forward_char(ReadLineState
*rs
)
103 if (rs
->cmd_buf_index
< rs
->cmd_buf_size
) {
108 static void readline_delete_char(ReadLineState
*rs
)
110 if (rs
->cmd_buf_index
< rs
->cmd_buf_size
) {
111 memmove(rs
->cmd_buf
+ rs
->cmd_buf_index
,
112 rs
->cmd_buf
+ rs
->cmd_buf_index
+ 1,
113 rs
->cmd_buf_size
- rs
->cmd_buf_index
- 1);
118 static void readline_backspace(ReadLineState
*rs
)
120 if (rs
->cmd_buf_index
> 0) {
121 readline_backward_char(rs
);
122 readline_delete_char(rs
);
126 static void readline_backword(ReadLineState
*rs
)
130 if (rs
->cmd_buf_index
== 0 || rs
->cmd_buf_index
> rs
->cmd_buf_size
) {
134 start
= rs
->cmd_buf_index
- 1;
136 /* find first word (backwards) */
138 if (!qemu_isspace(rs
->cmd_buf
[start
])) {
145 /* find first space (backwards) */
147 if (qemu_isspace(rs
->cmd_buf
[start
])) {
156 if (start
< rs
->cmd_buf_index
) {
157 memmove(rs
->cmd_buf
+ start
,
158 rs
->cmd_buf
+ rs
->cmd_buf_index
,
159 rs
->cmd_buf_size
- rs
->cmd_buf_index
);
160 rs
->cmd_buf_size
-= rs
->cmd_buf_index
- start
;
161 rs
->cmd_buf_index
= start
;
165 static void readline_bol(ReadLineState
*rs
)
167 rs
->cmd_buf_index
= 0;
170 static void readline_eol(ReadLineState
*rs
)
172 rs
->cmd_buf_index
= rs
->cmd_buf_size
;
175 static void readline_up_char(ReadLineState
*rs
)
179 if (rs
->hist_entry
== 0)
181 if (rs
->hist_entry
== -1) {
182 /* Find latest entry */
183 for (idx
= 0; idx
< READLINE_MAX_CMDS
; idx
++) {
184 if (rs
->history
[idx
] == NULL
)
187 rs
->hist_entry
= idx
;
190 if (rs
->hist_entry
>= 0) {
191 pstrcpy(rs
->cmd_buf
, sizeof(rs
->cmd_buf
),
192 rs
->history
[rs
->hist_entry
]);
193 rs
->cmd_buf_index
= rs
->cmd_buf_size
= strlen(rs
->cmd_buf
);
197 static void readline_down_char(ReadLineState
*rs
)
199 if (rs
->hist_entry
== -1)
201 if (rs
->hist_entry
< READLINE_MAX_CMDS
- 1 &&
202 rs
->history
[++rs
->hist_entry
] != NULL
) {
203 pstrcpy(rs
->cmd_buf
, sizeof(rs
->cmd_buf
),
204 rs
->history
[rs
->hist_entry
]);
209 rs
->cmd_buf_index
= rs
->cmd_buf_size
= strlen(rs
->cmd_buf
);
212 static void readline_hist_add(ReadLineState
*rs
, const char *cmdline
)
214 char *hist_entry
, *new_entry
;
217 if (cmdline
[0] == '\0')
220 if (rs
->hist_entry
!= -1) {
221 /* We were editing an existing history entry: replace it */
222 hist_entry
= rs
->history
[rs
->hist_entry
];
223 idx
= rs
->hist_entry
;
224 if (strcmp(hist_entry
, cmdline
) == 0) {
228 /* Search cmdline in history buffers */
229 for (idx
= 0; idx
< READLINE_MAX_CMDS
; idx
++) {
230 hist_entry
= rs
->history
[idx
];
231 if (hist_entry
== NULL
)
233 if (strcmp(hist_entry
, cmdline
) == 0) {
235 new_entry
= hist_entry
;
236 /* Put this entry at the end of history */
237 memmove(&rs
->history
[idx
], &rs
->history
[idx
+ 1],
238 (READLINE_MAX_CMDS
- (idx
+ 1)) * sizeof(char *));
239 rs
->history
[READLINE_MAX_CMDS
- 1] = NULL
;
240 for (; idx
< READLINE_MAX_CMDS
; idx
++) {
241 if (rs
->history
[idx
] == NULL
)
247 if (idx
== READLINE_MAX_CMDS
) {
248 /* Need to get one free slot */
249 g_free(rs
->history
[0]);
250 memmove(rs
->history
, &rs
->history
[1],
251 (READLINE_MAX_CMDS
- 1) * sizeof(char *));
252 rs
->history
[READLINE_MAX_CMDS
- 1] = NULL
;
253 idx
= READLINE_MAX_CMDS
- 1;
255 if (new_entry
== NULL
)
256 new_entry
= g_strdup(cmdline
);
257 rs
->history
[idx
] = new_entry
;
261 /* completion support */
263 void readline_add_completion(ReadLineState
*rs
, const char *str
)
265 if (rs
->nb_completions
< READLINE_MAX_COMPLETIONS
) {
266 rs
->completions
[rs
->nb_completions
++] = g_strdup(str
);
270 void readline_set_completion_index(ReadLineState
*rs
, int index
)
272 rs
->completion_index
= index
;
275 static int completion_comp(const void *a
, const void *b
)
277 return strcmp(*(const char **) a
, *(const char **) b
);
280 static void readline_completion(ReadLineState
*rs
)
282 int len
, i
, j
, max_width
, nb_cols
, max_prefix
;
285 rs
->nb_completions
= 0;
287 cmdline
= g_strndup(rs
->cmd_buf
, rs
->cmd_buf_index
);
288 rs
->completion_finder(rs
->opaque
, cmdline
);
291 /* no completion found */
292 if (rs
->nb_completions
<= 0)
294 if (rs
->nb_completions
== 1) {
295 len
= strlen(rs
->completions
[0]);
296 for(i
= rs
->completion_index
; i
< len
; i
++) {
297 readline_insert_char(rs
, rs
->completions
[0][i
]);
299 /* extra space for next argument. XXX: make it more generic */
300 if (len
> 0 && rs
->completions
[0][len
- 1] != '/')
301 readline_insert_char(rs
, ' ');
303 qsort(rs
->completions
, rs
->nb_completions
, sizeof(char *),
305 rs
->printf_func(rs
->opaque
, "\n");
308 for(i
= 0; i
< rs
->nb_completions
; i
++) {
309 len
= strlen(rs
->completions
[i
]);
313 if (len
< max_prefix
)
315 for(j
=0; j
<max_prefix
; j
++) {
316 if (rs
->completions
[i
][j
] != rs
->completions
[0][j
])
324 for(i
= rs
->completion_index
; i
< max_prefix
; i
++) {
325 readline_insert_char(rs
, rs
->completions
[0][i
]);
330 else if (max_width
> 80)
332 nb_cols
= 80 / max_width
;
334 for(i
= 0; i
< rs
->nb_completions
; i
++) {
335 rs
->printf_func(rs
->opaque
, "%-*s", max_width
, rs
->completions
[i
]);
336 if (++j
== nb_cols
|| i
== (rs
->nb_completions
- 1)) {
337 rs
->printf_func(rs
->opaque
, "\n");
341 readline_show_prompt(rs
);
343 for (i
= 0; i
< rs
->nb_completions
; i
++) {
344 g_free(rs
->completions
[i
]);
348 /* return true if command handled */
349 void readline_handle_byte(ReadLineState
*rs
, int ch
)
351 switch(rs
->esc_state
) {
358 readline_delete_char(rs
);
364 readline_completion(rs
);
368 rs
->cmd_buf
[rs
->cmd_buf_size
] = '\0';
369 if (!rs
->read_password
)
370 readline_hist_add(rs
, rs
->cmd_buf
);
371 rs
->printf_func(rs
->opaque
, "\n");
372 rs
->cmd_buf_index
= 0;
373 rs
->cmd_buf_size
= 0;
374 rs
->last_cmd_buf_index
= 0;
375 rs
->last_cmd_buf_size
= 0;
376 rs
->readline_func(rs
->opaque
, rs
->cmd_buf
, rs
->readline_opaque
);
380 readline_backword(rs
);
383 rs
->esc_state
= IS_ESC
;
387 readline_backspace(rs
);
390 rs
->esc_state
= IS_CSI
;
394 readline_insert_char(rs
, ch
);
401 rs
->esc_state
= IS_CSI
;
403 } else if (ch
== 'O') {
404 rs
->esc_state
= IS_SS3
;
407 rs
->esc_state
= IS_NORM
;
414 readline_up_char(rs
);
418 readline_down_char(rs
);
421 readline_backward_char(rs
);
424 readline_forward_char(rs
);
427 rs
->esc_param
= rs
->esc_param
* 10 + (ch
- '0');
430 switch(rs
->esc_param
) {
435 readline_delete_char(rs
);
445 rs
->esc_state
= IS_NORM
;
457 rs
->esc_state
= IS_NORM
;
463 void readline_start(ReadLineState
*rs
, const char *prompt
, int read_password
,
464 ReadLineFunc
*readline_func
, void *opaque
)
466 pstrcpy(rs
->prompt
, sizeof(rs
->prompt
), prompt
);
467 rs
->readline_func
= readline_func
;
468 rs
->readline_opaque
= opaque
;
469 rs
->read_password
= read_password
;
470 readline_restart(rs
);
473 void readline_restart(ReadLineState
*rs
)
475 rs
->cmd_buf_index
= 0;
476 rs
->cmd_buf_size
= 0;
479 const char *readline_get_history(ReadLineState
*rs
, unsigned int index
)
481 if (index
>= READLINE_MAX_CMDS
)
483 return rs
->history
[index
];
486 ReadLineState
*readline_init(ReadLinePrintfFunc
*printf_func
,
487 ReadLineFlushFunc
*flush_func
,
489 ReadLineCompletionFunc
*completion_finder
)
491 ReadLineState
*rs
= g_malloc0(sizeof(*rs
));
495 rs
->printf_func
= printf_func
;
496 rs
->flush_func
= flush_func
;
497 rs
->completion_finder
= completion_finder
;