input.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435
  1. /*
  2. * Translate key codes into ASCII
  3. *
  4. * Copyright (c) 2011 The Chromium OS Authors.
  5. * (C) Copyright 2004 DENX Software Engineering, Wolfgang Denk, wd@denx.de
  6. *
  7. * See file CREDITS for list of people who contributed to this
  8. * project.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License as
  12. * published by the Free Software Foundation; either version 2 of
  13. * the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
  23. * MA 02111-1307 USA
  24. */
  25. #include <common.h>
  26. #include <stdio_dev.h>
  27. #include <input.h>
  28. #include <linux/input.h>
  29. enum {
  30. /* These correspond to the lights on the keyboard */
  31. FLAG_NUM_LOCK = 1 << 0,
  32. FLAG_CAPS_LOCK = 1 << 1,
  33. FLAG_SCROLL_LOCK = 1 << 2,
  34. /* Special flag ORed with key code to indicate release */
  35. KEY_RELEASE = 1 << 15,
  36. KEY_MASK = 0xfff,
  37. };
  38. /*
  39. * These takes map key codes to ASCII. 0xff means no key, or special key.
  40. * Three tables are provided - one for plain keys, one for when the shift
  41. * 'modifier' key is pressed and one for when the ctrl modifier key is
  42. * pressed.
  43. */
  44. static const uchar kbd_plain_xlate[] = {
  45. 0xff, 0x1b, '1', '2', '3', '4', '5', '6',
  46. '7', '8', '9', '0', '-', '=', '\b', '\t', /* 0x00 - 0x0f */
  47. 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i',
  48. 'o', 'p', '[', ']', '\r', 0xff, 'a', 's', /* 0x10 - 0x1f */
  49. 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';',
  50. '\'', '`', 0xff, '\\', 'z', 'x', 'c', 'v', /* 0x20 - 0x2f */
  51. 'b', 'n', 'm', ',' , '.', '/', 0xff, 0xff, 0xff,
  52. ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
  53. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
  54. '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
  55. '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff,
  56. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
  57. '\r', 0xff, 0xff
  58. };
  59. static unsigned char kbd_shift_xlate[] = {
  60. 0xff, 0x1b, '!', '@', '#', '$', '%', '^',
  61. '&', '*', '(', ')', '_', '+', '\b', '\t', /* 0x00 - 0x0f */
  62. 'Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I',
  63. 'O', 'P', '{', '}', '\r', 0xff, 'A', 'S', /* 0x10 - 0x1f */
  64. 'D', 'F', 'G', 'H', 'J', 'K', 'L', ':',
  65. '"', '~', 0xff, '|', 'Z', 'X', 'C', 'V', /* 0x20 - 0x2f */
  66. 'B', 'N', 'M', '<', '>', '?', 0xff, 0xff, 0xff,
  67. ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
  68. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
  69. '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
  70. '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff, 0xff,
  71. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
  72. '\r', 0xff, 0xff
  73. };
  74. static unsigned char kbd_ctrl_xlate[] = {
  75. 0xff, 0x1b, '1', 0x00, '3', '4', '5', 0x1E,
  76. '7', '8', '9', '0', 0x1F, '=', '\b', '\t', /* 0x00 - 0x0f */
  77. 0x11, 0x17, 0x05, 0x12, 0x14, 0x18, 0x15, 0x09,
  78. 0x0f, 0x10, 0x1b, 0x1d, '\n', 0xff, 0x01, 0x13, /* 0x10 - 0x1f */
  79. 0x04, 0x06, 0x08, 0x09, 0x0a, 0x0b, 0x0c, ';',
  80. '\'', '~', 0x00, 0x1c, 0x1a, 0x18, 0x03, 0x16, /* 0x20 - 0x2f */
  81. 0x02, 0x0e, 0x0d, '<', '>', '?', 0xff, 0xff,
  82. 0xff, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
  83. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
  84. '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
  85. '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff,
  86. 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
  87. '\r', 0xff, 0xff
  88. };
  89. int input_queue_ascii(struct input_config *config, int ch)
  90. {
  91. if (config->fifo_in + 1 == INPUT_BUFFER_LEN) {
  92. if (!config->fifo_out)
  93. return -1; /* buffer full */
  94. else
  95. config->fifo_in = 0;
  96. } else {
  97. if (config->fifo_in + 1 == config->fifo_out)
  98. return -1; /* buffer full */
  99. config->fifo_in++;
  100. }
  101. config->fifo[config->fifo_in] = (uchar)ch;
  102. return 0;
  103. }
  104. int input_tstc(struct input_config *config)
  105. {
  106. if (config->fifo_in == config->fifo_out && config->read_keys) {
  107. if (!(*config->read_keys)(config))
  108. return 0;
  109. }
  110. return config->fifo_in != config->fifo_out;
  111. }
  112. int input_getc(struct input_config *config)
  113. {
  114. int err = 0;
  115. while (config->fifo_in == config->fifo_out) {
  116. if (config->read_keys)
  117. err = (*config->read_keys)(config);
  118. if (err)
  119. return -1;
  120. }
  121. if (++config->fifo_out == INPUT_BUFFER_LEN)
  122. config->fifo_out = 0;
  123. return config->fifo[config->fifo_out];
  124. }
  125. /**
  126. * Process a modifier/special key press or release and decide which key
  127. * translation array should be used as a result.
  128. *
  129. * TODO: Should keep track of modifier press/release
  130. *
  131. * @param config Input state
  132. * @param key Key code to process
  133. * @param release 0 if a press, 1 if a release
  134. * @return pointer to keycode->ascii translation table that should be used
  135. */
  136. static struct input_key_xlate *process_modifier(struct input_config *config,
  137. int key, int release)
  138. {
  139. struct input_key_xlate *table;
  140. int flip = -1;
  141. int i;
  142. /* Start with the main table, and see what modifiers change it */
  143. assert(config->num_tables > 0);
  144. table = &config->table[0];
  145. for (i = 1; i < config->num_tables; i++) {
  146. struct input_key_xlate *tab = &config->table[i];
  147. if (key == tab->left_keycode || key == tab->right_keycode)
  148. table = tab;
  149. }
  150. /* Handle the lighted keys */
  151. if (!release) {
  152. switch (key) {
  153. case KEY_SCROLLLOCK:
  154. flip = FLAG_SCROLL_LOCK;
  155. break;
  156. case KEY_NUMLOCK:
  157. flip = FLAG_NUM_LOCK;
  158. break;
  159. case KEY_CAPSLOCK:
  160. flip = FLAG_CAPS_LOCK;
  161. break;
  162. }
  163. }
  164. if (flip != -1) {
  165. int leds = 0;
  166. config->leds ^= flip;
  167. if (config->flags & FLAG_NUM_LOCK)
  168. leds |= INPUT_LED_NUM;
  169. if (config->flags & FLAG_CAPS_LOCK)
  170. leds |= INPUT_LED_CAPS;
  171. if (config->flags & FLAG_SCROLL_LOCK)
  172. leds |= INPUT_LED_SCROLL;
  173. config->leds = leds;
  174. }
  175. return table;
  176. }
  177. /**
  178. * Search an int array for a key value
  179. *
  180. * @param array Array to search
  181. * @param count Number of elements in array
  182. * @param key Key value to find
  183. * @return element where value was first found, -1 if none
  184. */
  185. static int array_search(int *array, int count, int key)
  186. {
  187. int i;
  188. for (i = 0; i < count; i++) {
  189. if (array[i] == key)
  190. return i;
  191. }
  192. return -1;
  193. }
  194. /**
  195. * Sort an array so that those elements that exist in the ordering are
  196. * first in the array, and in the same order as the ordering. The algorithm
  197. * is O(count * ocount) and designed for small arrays.
  198. *
  199. * TODO: Move this to common / lib?
  200. *
  201. * @param dest Array with elements to sort, also destination array
  202. * @param count Number of elements to sort
  203. * @param order Array containing ordering elements
  204. * @param ocount Number of ordering elements
  205. * @return number of elements in dest that are in order (these will be at the
  206. * start of dest).
  207. */
  208. static int sort_array_by_ordering(int *dest, int count, int *order,
  209. int ocount)
  210. {
  211. int temp[count];
  212. int dest_count;
  213. int same; /* number of elements which are the same */
  214. int i;
  215. /* setup output items, copy items to be sorted into our temp area */
  216. memcpy(temp, dest, count * sizeof(*dest));
  217. dest_count = 0;
  218. /* work through the ordering, move over the elements we agree on */
  219. for (i = 0; i < ocount; i++) {
  220. if (array_search(temp, count, order[i]) != -1)
  221. dest[dest_count++] = order[i];
  222. }
  223. same = dest_count;
  224. /* now move over the elements that are not in the ordering */
  225. for (i = 0; i < count; i++) {
  226. if (array_search(order, ocount, temp[i]) == -1)
  227. dest[dest_count++] = temp[i];
  228. }
  229. assert(dest_count == count);
  230. return same;
  231. }
  232. /**
  233. * Check a list of key codes against the previous key scan
  234. *
  235. * Given a list of new key codes, we check how many of these are the same
  236. * as last time.
  237. *
  238. * @param config Input state
  239. * @param keycode List of key codes to examine
  240. * @param num_keycodes Number of key codes
  241. * @param same Returns number of key codes which are the same
  242. */
  243. static int input_check_keycodes(struct input_config *config,
  244. int keycode[], int num_keycodes, int *same)
  245. {
  246. /* Select the 'plain' xlate table to start with */
  247. if (!config->num_tables) {
  248. debug("%s: No xlate tables: cannot decode keys\n", __func__);
  249. return -1;
  250. }
  251. /* sort the keycodes into the same order as the previous ones */
  252. *same = sort_array_by_ordering(keycode, num_keycodes,
  253. config->prev_keycodes, config->num_prev_keycodes);
  254. memcpy(config->prev_keycodes, keycode, num_keycodes * sizeof(int));
  255. config->num_prev_keycodes = num_keycodes;
  256. return *same != num_keycodes;
  257. }
  258. /**
  259. * Convert a list of key codes into ASCII
  260. *
  261. * You must call input_check_keycodes() before this. It turns the keycode
  262. * list into a list of ASCII characters which are ready to send to the
  263. * input layer.
  264. *
  265. * Characters which were seen last time do not generate fresh ASCII output.
  266. *
  267. * @param config Input state
  268. * @param keycode List of key codes to examine
  269. * @param num_keycodes Number of key codes
  270. * @param same Number of key codes which are the same
  271. */
  272. static int input_keycodes_to_ascii(struct input_config *config,
  273. int keycode[], int num_keycodes, char output_ch[], int same)
  274. {
  275. struct input_key_xlate *table;
  276. int ch_count;
  277. int i;
  278. table = &config->table[0];
  279. /* deal with modifiers first */
  280. for (i = 0; i < num_keycodes; i++) {
  281. int key = keycode[i] & KEY_MASK;
  282. if (key >= table->num_entries || table->xlate[key] == 0xff) {
  283. table = process_modifier(config, key,
  284. keycode[i] & KEY_RELEASE);
  285. }
  286. }
  287. /* now find normal keys */
  288. for (i = ch_count = 0; i < num_keycodes; i++) {
  289. int key = keycode[i];
  290. if (key < table->num_entries && i >= same) {
  291. int ch = table->xlate[key];
  292. /* If a normal key with an ASCII value, add it! */
  293. if (ch != 0xff)
  294. output_ch[ch_count++] = (uchar)ch;
  295. }
  296. }
  297. /* ok, so return keys */
  298. return ch_count;
  299. }
  300. int input_send_keycodes(struct input_config *config,
  301. int keycode[], int num_keycodes)
  302. {
  303. char ch[num_keycodes];
  304. int count, i, same = 0;
  305. int is_repeat = 0;
  306. unsigned delay_ms;
  307. config->modifiers = 0;
  308. if (!input_check_keycodes(config, keycode, num_keycodes, &same)) {
  309. /*
  310. * Same as last time - is it time for another repeat?
  311. * TODO(sjg@chromium.org) We drop repeats here and since
  312. * the caller may not call in again for a while, our
  313. * auto-repeat speed is not quite correct. We should
  314. * insert another character if we later realise that we
  315. * have missed a repeat slot.
  316. */
  317. is_repeat = config->repeat_rate_ms &&
  318. (int)get_timer(config->next_repeat_ms) >= 0;
  319. if (!is_repeat)
  320. return 0;
  321. }
  322. count = input_keycodes_to_ascii(config, keycode, num_keycodes,
  323. ch, is_repeat ? 0 : same);
  324. for (i = 0; i < count; i++)
  325. input_queue_ascii(config, ch[i]);
  326. delay_ms = is_repeat ?
  327. config->repeat_rate_ms :
  328. config->repeat_delay_ms;
  329. config->next_repeat_ms = get_timer(0) + delay_ms;
  330. return 0;
  331. }
  332. int input_add_table(struct input_config *config, int left_keycode,
  333. int right_keycode, const uchar *xlate, int num_entries)
  334. {
  335. struct input_key_xlate *table;
  336. if (config->num_tables == INPUT_MAX_MODIFIERS) {
  337. debug("%s: Too many modifier tables\n", __func__);
  338. return -1;
  339. }
  340. table = &config->table[config->num_tables++];
  341. table->left_keycode = left_keycode;
  342. table->right_keycode = right_keycode;
  343. table->xlate = xlate;
  344. table->num_entries = num_entries;
  345. return 0;
  346. }
  347. void input_set_delays(struct input_config *config, int repeat_delay_ms,
  348. int repeat_rate_ms)
  349. {
  350. config->repeat_delay_ms = repeat_delay_ms;
  351. config->repeat_rate_ms = repeat_rate_ms;
  352. }
  353. int input_init(struct input_config *config, int leds)
  354. {
  355. memset(config, '\0', sizeof(*config));
  356. config->leds = leds;
  357. if (input_add_table(config, -1, -1,
  358. kbd_plain_xlate, ARRAY_SIZE(kbd_plain_xlate)) ||
  359. input_add_table(config, KEY_LEFTSHIFT, KEY_RIGHTSHIFT,
  360. kbd_shift_xlate, ARRAY_SIZE(kbd_shift_xlate)) ||
  361. input_add_table(config, KEY_LEFTCTRL, KEY_RIGHTCTRL,
  362. kbd_ctrl_xlate, ARRAY_SIZE(kbd_ctrl_xlate))) {
  363. debug("%s: Could not add modifier tables\n", __func__);
  364. return -1;
  365. }
  366. return 0;
  367. }
  368. int input_stdio_register(struct stdio_dev *dev)
  369. {
  370. int error;
  371. error = stdio_register(dev);
  372. /* check if this is the standard input device */
  373. if (!error && strcmp(getenv("stdin"), dev->name) == 0) {
  374. /* reassign the console */
  375. if (OVERWRITE_CONSOLE ||
  376. console_assign(stdin, dev->name))
  377. return -1;
  378. }
  379. return 0;
  380. }