readline.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479
  1. /*
  2. * QEMU readline utility
  3. *
  4. * Copyright (c) 2003-2004 Fabrice Bellard
  5. *
  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:
  12. *
  13. * The above copyright notice and this permission notice shall be included in
  14. * all copies or substantial portions of the Software.
  15. *
  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
  22. * THE SOFTWARE.
  23. */
  24. #include "monitor/readline.h"
  25. #include "monitor/monitor.h"
  26. #define IS_NORM 0
  27. #define IS_ESC 1
  28. #define IS_CSI 2
  29. #undef printf
  30. #define printf do_not_use_printf
  31. void readline_show_prompt(ReadLineState *rs)
  32. {
  33. monitor_printf(rs->mon, "%s", rs->prompt);
  34. monitor_flush(rs->mon);
  35. rs->last_cmd_buf_index = 0;
  36. rs->last_cmd_buf_size = 0;
  37. rs->esc_state = IS_NORM;
  38. }
  39. /* update the displayed command line */
  40. static void readline_update(ReadLineState *rs)
  41. {
  42. int i, delta, len;
  43. if (rs->cmd_buf_size != rs->last_cmd_buf_size ||
  44. memcmp(rs->cmd_buf, rs->last_cmd_buf, rs->cmd_buf_size) != 0) {
  45. for(i = 0; i < rs->last_cmd_buf_index; i++) {
  46. monitor_printf(rs->mon, "\033[D");
  47. }
  48. rs->cmd_buf[rs->cmd_buf_size] = '\0';
  49. if (rs->read_password) {
  50. len = strlen(rs->cmd_buf);
  51. for(i = 0; i < len; i++)
  52. monitor_printf(rs->mon, "*");
  53. } else {
  54. monitor_printf(rs->mon, "%s", rs->cmd_buf);
  55. }
  56. monitor_printf(rs->mon, "\033[K");
  57. memcpy(rs->last_cmd_buf, rs->cmd_buf, rs->cmd_buf_size);
  58. rs->last_cmd_buf_size = rs->cmd_buf_size;
  59. rs->last_cmd_buf_index = rs->cmd_buf_size;
  60. }
  61. if (rs->cmd_buf_index != rs->last_cmd_buf_index) {
  62. delta = rs->cmd_buf_index - rs->last_cmd_buf_index;
  63. if (delta > 0) {
  64. for(i = 0;i < delta; i++) {
  65. monitor_printf(rs->mon, "\033[C");
  66. }
  67. } else {
  68. delta = -delta;
  69. for(i = 0;i < delta; i++) {
  70. monitor_printf(rs->mon, "\033[D");
  71. }
  72. }
  73. rs->last_cmd_buf_index = rs->cmd_buf_index;
  74. }
  75. monitor_flush(rs->mon);
  76. }
  77. static void readline_insert_char(ReadLineState *rs, int ch)
  78. {
  79. if (rs->cmd_buf_index < READLINE_CMD_BUF_SIZE) {
  80. memmove(rs->cmd_buf + rs->cmd_buf_index + 1,
  81. rs->cmd_buf + rs->cmd_buf_index,
  82. rs->cmd_buf_size - rs->cmd_buf_index);
  83. rs->cmd_buf[rs->cmd_buf_index] = ch;
  84. rs->cmd_buf_size++;
  85. rs->cmd_buf_index++;
  86. }
  87. }
  88. static void readline_backward_char(ReadLineState *rs)
  89. {
  90. if (rs->cmd_buf_index > 0) {
  91. rs->cmd_buf_index--;
  92. }
  93. }
  94. static void readline_forward_char(ReadLineState *rs)
  95. {
  96. if (rs->cmd_buf_index < rs->cmd_buf_size) {
  97. rs->cmd_buf_index++;
  98. }
  99. }
  100. static void readline_delete_char(ReadLineState *rs)
  101. {
  102. if (rs->cmd_buf_index < rs->cmd_buf_size) {
  103. memmove(rs->cmd_buf + rs->cmd_buf_index,
  104. rs->cmd_buf + rs->cmd_buf_index + 1,
  105. rs->cmd_buf_size - rs->cmd_buf_index - 1);
  106. rs->cmd_buf_size--;
  107. }
  108. }
  109. static void readline_backspace(ReadLineState *rs)
  110. {
  111. if (rs->cmd_buf_index > 0) {
  112. readline_backward_char(rs);
  113. readline_delete_char(rs);
  114. }
  115. }
  116. static void readline_backword(ReadLineState *rs)
  117. {
  118. int start;
  119. if (rs->cmd_buf_index == 0 || rs->cmd_buf_index > rs->cmd_buf_size) {
  120. return;
  121. }
  122. start = rs->cmd_buf_index - 1;
  123. /* find first word (backwards) */
  124. while (start > 0) {
  125. if (!qemu_isspace(rs->cmd_buf[start])) {
  126. break;
  127. }
  128. --start;
  129. }
  130. /* find first space (backwards) */
  131. while (start > 0) {
  132. if (qemu_isspace(rs->cmd_buf[start])) {
  133. ++start;
  134. break;
  135. }
  136. --start;
  137. }
  138. /* remove word */
  139. if (start < rs->cmd_buf_index) {
  140. memmove(rs->cmd_buf + start,
  141. rs->cmd_buf + rs->cmd_buf_index,
  142. rs->cmd_buf_size - rs->cmd_buf_index);
  143. rs->cmd_buf_size -= rs->cmd_buf_index - start;
  144. rs->cmd_buf_index = start;
  145. }
  146. }
  147. static void readline_bol(ReadLineState *rs)
  148. {
  149. rs->cmd_buf_index = 0;
  150. }
  151. static void readline_eol(ReadLineState *rs)
  152. {
  153. rs->cmd_buf_index = rs->cmd_buf_size;
  154. }
  155. static void readline_up_char(ReadLineState *rs)
  156. {
  157. int idx;
  158. if (rs->hist_entry == 0)
  159. return;
  160. if (rs->hist_entry == -1) {
  161. /* Find latest entry */
  162. for (idx = 0; idx < READLINE_MAX_CMDS; idx++) {
  163. if (rs->history[idx] == NULL)
  164. break;
  165. }
  166. rs->hist_entry = idx;
  167. }
  168. rs->hist_entry--;
  169. if (rs->hist_entry >= 0) {
  170. pstrcpy(rs->cmd_buf, sizeof(rs->cmd_buf),
  171. rs->history[rs->hist_entry]);
  172. rs->cmd_buf_index = rs->cmd_buf_size = strlen(rs->cmd_buf);
  173. }
  174. }
  175. static void readline_down_char(ReadLineState *rs)
  176. {
  177. if (rs->hist_entry == -1)
  178. return;
  179. if (rs->hist_entry < READLINE_MAX_CMDS - 1 &&
  180. rs->history[++rs->hist_entry] != NULL) {
  181. pstrcpy(rs->cmd_buf, sizeof(rs->cmd_buf),
  182. rs->history[rs->hist_entry]);
  183. } else {
  184. rs->cmd_buf[0] = 0;
  185. rs->hist_entry = -1;
  186. }
  187. rs->cmd_buf_index = rs->cmd_buf_size = strlen(rs->cmd_buf);
  188. }
  189. static void readline_hist_add(ReadLineState *rs, const char *cmdline)
  190. {
  191. char *hist_entry, *new_entry;
  192. int idx;
  193. if (cmdline[0] == '\0')
  194. return;
  195. new_entry = NULL;
  196. if (rs->hist_entry != -1) {
  197. /* We were editing an existing history entry: replace it */
  198. hist_entry = rs->history[rs->hist_entry];
  199. idx = rs->hist_entry;
  200. if (strcmp(hist_entry, cmdline) == 0) {
  201. goto same_entry;
  202. }
  203. }
  204. /* Search cmdline in history buffers */
  205. for (idx = 0; idx < READLINE_MAX_CMDS; idx++) {
  206. hist_entry = rs->history[idx];
  207. if (hist_entry == NULL)
  208. break;
  209. if (strcmp(hist_entry, cmdline) == 0) {
  210. same_entry:
  211. new_entry = hist_entry;
  212. /* Put this entry at the end of history */
  213. memmove(&rs->history[idx], &rs->history[idx + 1],
  214. (READLINE_MAX_CMDS - (idx + 1)) * sizeof(char *));
  215. rs->history[READLINE_MAX_CMDS - 1] = NULL;
  216. for (; idx < READLINE_MAX_CMDS; idx++) {
  217. if (rs->history[idx] == NULL)
  218. break;
  219. }
  220. break;
  221. }
  222. }
  223. if (idx == READLINE_MAX_CMDS) {
  224. /* Need to get one free slot */
  225. g_free(rs->history[0]);
  226. memmove(rs->history, &rs->history[1],
  227. (READLINE_MAX_CMDS - 1) * sizeof(char *));
  228. rs->history[READLINE_MAX_CMDS - 1] = NULL;
  229. idx = READLINE_MAX_CMDS - 1;
  230. }
  231. if (new_entry == NULL)
  232. new_entry = g_strdup(cmdline);
  233. rs->history[idx] = new_entry;
  234. rs->hist_entry = -1;
  235. }
  236. /* completion support */
  237. void readline_add_completion(ReadLineState *rs, const char *str)
  238. {
  239. if (rs->nb_completions < READLINE_MAX_COMPLETIONS) {
  240. rs->completions[rs->nb_completions++] = g_strdup(str);
  241. }
  242. }
  243. void readline_set_completion_index(ReadLineState *rs, int index)
  244. {
  245. rs->completion_index = index;
  246. }
  247. static void readline_completion(ReadLineState *rs)
  248. {
  249. Monitor *mon = cur_mon;
  250. int len, i, j, max_width, nb_cols, max_prefix;
  251. char *cmdline;
  252. rs->nb_completions = 0;
  253. cmdline = g_malloc(rs->cmd_buf_index + 1);
  254. memcpy(cmdline, rs->cmd_buf, rs->cmd_buf_index);
  255. cmdline[rs->cmd_buf_index] = '\0';
  256. rs->completion_finder(cmdline);
  257. g_free(cmdline);
  258. /* no completion found */
  259. if (rs->nb_completions <= 0)
  260. return;
  261. if (rs->nb_completions == 1) {
  262. len = strlen(rs->completions[0]);
  263. for(i = rs->completion_index; i < len; i++) {
  264. readline_insert_char(rs, rs->completions[0][i]);
  265. }
  266. /* extra space for next argument. XXX: make it more generic */
  267. if (len > 0 && rs->completions[0][len - 1] != '/')
  268. readline_insert_char(rs, ' ');
  269. } else {
  270. monitor_printf(mon, "\n");
  271. max_width = 0;
  272. max_prefix = 0;
  273. for(i = 0; i < rs->nb_completions; i++) {
  274. len = strlen(rs->completions[i]);
  275. if (i==0) {
  276. max_prefix = len;
  277. } else {
  278. if (len < max_prefix)
  279. max_prefix = len;
  280. for(j=0; j<max_prefix; j++) {
  281. if (rs->completions[i][j] != rs->completions[0][j])
  282. max_prefix = j;
  283. }
  284. }
  285. if (len > max_width)
  286. max_width = len;
  287. }
  288. if (max_prefix > 0)
  289. for(i = rs->completion_index; i < max_prefix; i++) {
  290. readline_insert_char(rs, rs->completions[0][i]);
  291. }
  292. max_width += 2;
  293. if (max_width < 10)
  294. max_width = 10;
  295. else if (max_width > 80)
  296. max_width = 80;
  297. nb_cols = 80 / max_width;
  298. j = 0;
  299. for(i = 0; i < rs->nb_completions; i++) {
  300. monitor_printf(rs->mon, "%-*s", max_width, rs->completions[i]);
  301. if (++j == nb_cols || i == (rs->nb_completions - 1)) {
  302. monitor_printf(rs->mon, "\n");
  303. j = 0;
  304. }
  305. }
  306. readline_show_prompt(rs);
  307. }
  308. for (i = 0; i < rs->nb_completions; i++) {
  309. g_free(rs->completions[i]);
  310. }
  311. }
  312. /* return true if command handled */
  313. void readline_handle_byte(ReadLineState *rs, int ch)
  314. {
  315. switch(rs->esc_state) {
  316. case IS_NORM:
  317. switch(ch) {
  318. case 1:
  319. readline_bol(rs);
  320. break;
  321. case 4:
  322. readline_delete_char(rs);
  323. break;
  324. case 5:
  325. readline_eol(rs);
  326. break;
  327. case 9:
  328. readline_completion(rs);
  329. break;
  330. case 10:
  331. case 13:
  332. rs->cmd_buf[rs->cmd_buf_size] = '\0';
  333. if (!rs->read_password)
  334. readline_hist_add(rs, rs->cmd_buf);
  335. monitor_printf(rs->mon, "\n");
  336. rs->cmd_buf_index = 0;
  337. rs->cmd_buf_size = 0;
  338. rs->last_cmd_buf_index = 0;
  339. rs->last_cmd_buf_size = 0;
  340. rs->readline_func(rs->mon, rs->cmd_buf, rs->readline_opaque);
  341. break;
  342. case 23:
  343. /* ^W */
  344. readline_backword(rs);
  345. break;
  346. case 27:
  347. rs->esc_state = IS_ESC;
  348. break;
  349. case 127:
  350. case 8:
  351. readline_backspace(rs);
  352. break;
  353. case 155:
  354. rs->esc_state = IS_CSI;
  355. break;
  356. default:
  357. if (ch >= 32) {
  358. readline_insert_char(rs, ch);
  359. }
  360. break;
  361. }
  362. break;
  363. case IS_ESC:
  364. if (ch == '[') {
  365. rs->esc_state = IS_CSI;
  366. rs->esc_param = 0;
  367. } else {
  368. rs->esc_state = IS_NORM;
  369. }
  370. break;
  371. case IS_CSI:
  372. switch(ch) {
  373. case 'A':
  374. case 'F':
  375. readline_up_char(rs);
  376. break;
  377. case 'B':
  378. case 'E':
  379. readline_down_char(rs);
  380. break;
  381. case 'D':
  382. readline_backward_char(rs);
  383. break;
  384. case 'C':
  385. readline_forward_char(rs);
  386. break;
  387. case '0' ... '9':
  388. rs->esc_param = rs->esc_param * 10 + (ch - '0');
  389. goto the_end;
  390. case '~':
  391. switch(rs->esc_param) {
  392. case 1:
  393. readline_bol(rs);
  394. break;
  395. case 3:
  396. readline_delete_char(rs);
  397. break;
  398. case 4:
  399. readline_eol(rs);
  400. break;
  401. }
  402. break;
  403. default:
  404. break;
  405. }
  406. rs->esc_state = IS_NORM;
  407. the_end:
  408. break;
  409. }
  410. readline_update(rs);
  411. }
  412. void readline_start(ReadLineState *rs, const char *prompt, int read_password,
  413. ReadLineFunc *readline_func, void *opaque)
  414. {
  415. pstrcpy(rs->prompt, sizeof(rs->prompt), prompt);
  416. rs->readline_func = readline_func;
  417. rs->readline_opaque = opaque;
  418. rs->read_password = read_password;
  419. readline_restart(rs);
  420. }
  421. void readline_restart(ReadLineState *rs)
  422. {
  423. rs->cmd_buf_index = 0;
  424. rs->cmd_buf_size = 0;
  425. }
  426. const char *readline_get_history(ReadLineState *rs, unsigned int index)
  427. {
  428. if (index >= READLINE_MAX_CMDS)
  429. return NULL;
  430. return rs->history[index];
  431. }
  432. ReadLineState *readline_init(Monitor *mon,
  433. ReadLineCompletionFunc *completion_finder)
  434. {
  435. ReadLineState *rs = g_malloc0(sizeof(*rs));
  436. rs->hist_entry = -1;
  437. rs->mon = mon;
  438. rs->completion_finder = completion_finder;
  439. return rs;
  440. }