/* Copyright (c) 2008, Tim Post * All rights reserved. * Copyright (c) 2008, Jiri Svoboda - All Rights Reserved * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * Redistributions of source code must retain the above copyright notice, this * list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * Neither the name of the original program's authors nor the names of its * contributors may be used to endorse or promote products derived from this * software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ #include #include #include #include #include #include #include #include #include #include #include "config.h" #include "util.h" #include "scli.h" #include "input.h" #include "errors.h" #include "exec.h" #define HISTORY_LEN 10 typedef struct { wchar_t buffer[INPUT_MAX]; int col0, row0; int con_cols, con_rows; int nc; int pos; char *history[1 + HISTORY_LEN]; int hnum; int hpos; } tinput_t; typedef enum { seek_backward = -1, seek_forward = 1 } seek_dir_t; static tinput_t tinput; static char *tinput_read(tinput_t *ti); /* Tokenizes input from console, sees if the first word is a built-in, if so * invokes the built-in entry point (a[0]) passing all arguments in a[] to * the handler */ int tok_input(cliuser_t *usr) { char *cmd[WORD_MAX]; int n = 0, i = 0; int rc = 0; char *tmp; if (NULL == usr->line) return CL_EFAIL; tmp = str_dup(usr->line); cmd[n] = strtok(tmp, " "); while (cmd[n] && n < WORD_MAX) { cmd[++n] = strtok(NULL, " "); } /* We have rubbish */ if (NULL == cmd[0]) { rc = CL_ENOENT; goto finit; } /* Its a builtin command ? */ if ((i = (is_builtin(cmd[0]))) > -1) { rc = run_builtin(i, cmd, usr); goto finit; /* Its a module ? */ } else if ((i = (is_module(cmd[0]))) > -1) { rc = run_module(i, cmd); goto finit; } /* See what try_exec thinks of it */ rc = try_exec(cmd[0], cmd); finit: if (NULL != usr->line) { free(usr->line); usr->line = (char *) NULL; } if (NULL != tmp) free(tmp); return rc; } static void tinput_display_tail(tinput_t *ti, int start, int pad) { int i; console_goto(fphone(stdout), ti->col0 + start, ti->row0); printf("%ls", ti->buffer + start); for (i = 0; i < pad; ++i) putchar(' '); fflush(stdout); } static char *tinput_get_str(tinput_t *ti) { char *str; str = malloc(STR_BOUNDS(ti->nc) + 1); if (str == NULL) return NULL; wstr_nstr(str, ti->buffer, STR_BOUNDS(ti->nc) + 1); return str; } static void tinput_position_caret(tinput_t *ti) { console_goto(fphone(stdout), ti->col0 + ti->pos, ti->row0); } static void tinput_insert_char(tinput_t *ti, wchar_t c) { int i; if (ti->nc == INPUT_MAX) return; if (ti->col0 + ti->nc >= ti->con_cols - 1) return; for (i = ti->nc; i > ti->pos; --i) ti->buffer[i] = ti->buffer[i - 1]; ti->buffer[ti->pos] = c; ti->pos += 1; ti->nc += 1; ti->buffer[ti->nc] = '\0'; tinput_display_tail(ti, ti->pos - 1, 0); tinput_position_caret(ti); } static void tinput_backspace(tinput_t *ti) { int i; if (ti->pos == 0) return; for (i = ti->pos; i < ti->nc; ++i) ti->buffer[i - 1] = ti->buffer[i]; ti->pos -= 1; ti->nc -= 1; ti->buffer[ti->nc] = '\0'; tinput_display_tail(ti, ti->pos, 1); tinput_position_caret(ti); } static void tinput_delete(tinput_t *ti) { if (ti->pos == ti->nc) return; ti->pos += 1; tinput_backspace(ti); } static void tinput_seek_cell(tinput_t *ti, seek_dir_t dir) { if (dir == seek_forward) { if (ti->pos < ti->nc) ti->pos += 1; } else { if (ti->pos > 0) ti->pos -= 1; } tinput_position_caret(ti); } static void tinput_seek_word(tinput_t *ti, seek_dir_t dir) { if (dir == seek_forward) { if (ti->pos == ti->nc) return; while (1) { ti->pos += 1; if (ti->pos == ti->nc) break; if (ti->buffer[ti->pos - 1] == ' ' && ti->buffer[ti->pos] != ' ') break; } } else { if (ti->pos == 0) return; while (1) { ti->pos -= 1; if (ti->pos == 0) break; if (ti->buffer[ti->pos - 1] == ' ' && ti->buffer[ti->pos] != ' ') break; } } tinput_position_caret(ti); } static void tinput_seek_max(tinput_t *ti, seek_dir_t dir) { if (dir == seek_backward) ti->pos = 0; else ti->pos = ti->nc; tinput_position_caret(ti); } static void tinput_history_insert(tinput_t *ti, char *str) { int i; if (ti->hnum < HISTORY_LEN) { ti->hnum += 1; } else { if (ti->history[HISTORY_LEN] != NULL) free(ti->history[HISTORY_LEN]); } for (i = ti->hnum; i > 1; --i) ti->history[i] = ti->history[i - 1]; ti->history[1] = str_dup(str); if (ti->history[0] != NULL) { free(ti->history[0]); ti->history[0] = NULL; } } static void tinput_set_str(tinput_t *ti, char *str) { str_to_wstr(ti->buffer, INPUT_MAX, str); ti->nc = wstr_length(ti->buffer); ti->pos = ti->nc; } static void tinput_history_seek(tinput_t *ti, int offs) { int pad; if (ti->hpos + offs < 0 || ti->hpos + offs > ti->hnum) return; if (ti->history[ti->hpos] != NULL) { free(ti->history[ti->hpos]); ti->history[ti->hpos] = NULL; } ti->history[ti->hpos] = tinput_get_str(ti); ti->hpos += offs; pad = ti->nc - str_length(ti->history[ti->hpos]); if (pad < 0) pad = 0; tinput_set_str(ti, ti->history[ti->hpos]); tinput_display_tail(ti, 0, pad); tinput_position_caret(ti); } static void tinput_init(tinput_t *ti) { ti->hnum = 0; ti->hpos = 0; ti->history[0] = NULL; } static char *tinput_read(tinput_t *ti) { console_event_t ev; char *str; fflush(stdout); if (console_get_size(fphone(stdin), &ti->con_cols, &ti->con_rows) != EOK) return NULL; if (console_get_pos(fphone(stdin), &ti->col0, &ti->row0) != EOK) return NULL; ti->pos = 0; ti->nc = 0; while (true) { fflush(stdout); if (!console_get_event(fphone(stdin), &ev)) return NULL; if (ev.type != KEY_PRESS) continue; if ((ev.mods & KM_CTRL) != 0 && (ev.mods & (KM_ALT | KM_SHIFT)) == 0) { switch (ev.key) { case KC_LEFT: tinput_seek_word(ti, seek_backward); break; case KC_RIGHT: tinput_seek_word(ti, seek_forward); break; } } if ((ev.mods & (KM_CTRL | KM_ALT | KM_SHIFT)) == 0) { switch (ev.key) { case KC_ENTER: case KC_NENTER: goto done; case KC_BACKSPACE: tinput_backspace(ti); break; case KC_DELETE: tinput_delete(ti); break; case KC_LEFT: tinput_seek_cell(ti, seek_backward); break; case KC_RIGHT: tinput_seek_cell(ti, seek_forward); break; case KC_HOME: tinput_seek_max(ti, seek_backward); break; case KC_END: tinput_seek_max(ti, seek_forward); break; case KC_UP: tinput_history_seek(ti, +1); break; case KC_DOWN: tinput_history_seek(ti, -1); break; } } if (ev.c >= ' ') { tinput_insert_char(ti, ev.c); } } done: putchar('\n'); str = tinput_get_str(ti); if (str_cmp(str, "") != 0) tinput_history_insert(ti, str); ti->hpos = 0; return str; } void get_input(cliuser_t *usr) { char *str; fflush(stdout); console_set_style(fphone(stdout), STYLE_EMPHASIS); printf("%s", usr->prompt); fflush(stdout); console_set_style(fphone(stdout), STYLE_NORMAL); str = tinput_read(&tinput); /* Check for empty input. */ if (str_cmp(str, "") == 0) { free(str); return; } usr->line = str; return; } void input_init(void) { tinput_init(&tinput); }