blob: 26da3a95ff02f1775be22f438a76355f277438e9 [file] [log] [blame]
Simon Glassec9fe922012-04-17 09:01:30 +00001/*
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 *
Wolfgang Denkd79de1d2013-07-08 09:37:19 +02007 * SPDX-License-Identifier: GPL-2.0+
Simon Glassec9fe922012-04-17 09:01:30 +00008 */
9
10#include <common.h>
Simon Glassa73bda42015-11-08 23:47:45 -070011#include <console.h>
Bin Meng7e29bb82015-11-12 05:33:02 -080012#include <dm.h>
Simon Glass5e628962015-10-18 21:17:12 -060013#include <errno.h>
Simon Glassec9fe922012-04-17 09:01:30 +000014#include <stdio_dev.h>
15#include <input.h>
Bin Meng7e29bb82015-11-12 05:33:02 -080016#ifdef CONFIG_DM_KEYBOARD
17#include <keyboard.h>
18#endif
Simon Glassec9fe922012-04-17 09:01:30 +000019#include <linux/input.h>
20
21enum {
22 /* These correspond to the lights on the keyboard */
Bin Meng07ab26e2015-11-12 05:33:03 -080023 FLAG_SCROLL_LOCK = 1 << 0,
24 FLAG_NUM_LOCK = 1 << 1,
25 FLAG_CAPS_LOCK = 1 << 2,
Simon Glassec9fe922012-04-17 09:01:30 +000026
27 /* Special flag ORed with key code to indicate release */
28 KEY_RELEASE = 1 << 15,
29 KEY_MASK = 0xfff,
30};
31
32/*
33 * These takes map key codes to ASCII. 0xff means no key, or special key.
34 * Three tables are provided - one for plain keys, one for when the shift
35 * 'modifier' key is pressed and one for when the ctrl modifier key is
36 * pressed.
37 */
38static const uchar kbd_plain_xlate[] = {
39 0xff, 0x1b, '1', '2', '3', '4', '5', '6',
40 '7', '8', '9', '0', '-', '=', '\b', '\t', /* 0x00 - 0x0f */
41 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i',
42 'o', 'p', '[', ']', '\r', 0xff, 'a', 's', /* 0x10 - 0x1f */
43 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';',
44 '\'', '`', 0xff, '\\', 'z', 'x', 'c', 'v', /* 0x20 - 0x2f */
45 'b', 'n', 'm', ',' , '.', '/', 0xff, 0xff, 0xff,
46 ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
47 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
48 '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
49 '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff,
50 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
Simon Glassaba1f9d2015-10-18 21:17:23 -060051 '\r', 0xff, '/', '*',
Simon Glassec9fe922012-04-17 09:01:30 +000052};
53
54static unsigned char kbd_shift_xlate[] = {
55 0xff, 0x1b, '!', '@', '#', '$', '%', '^',
56 '&', '*', '(', ')', '_', '+', '\b', '\t', /* 0x00 - 0x0f */
57 'Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I',
58 'O', 'P', '{', '}', '\r', 0xff, 'A', 'S', /* 0x10 - 0x1f */
59 'D', 'F', 'G', 'H', 'J', 'K', 'L', ':',
60 '"', '~', 0xff, '|', 'Z', 'X', 'C', 'V', /* 0x20 - 0x2f */
61 'B', 'N', 'M', '<', '>', '?', 0xff, 0xff, 0xff,
62 ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
63 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
64 '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
65 '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff, 0xff,
66 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
Simon Glassaba1f9d2015-10-18 21:17:23 -060067 '\r', 0xff, '/', '*',
Simon Glassec9fe922012-04-17 09:01:30 +000068};
69
70static unsigned char kbd_ctrl_xlate[] = {
71 0xff, 0x1b, '1', 0x00, '3', '4', '5', 0x1E,
72 '7', '8', '9', '0', 0x1F, '=', '\b', '\t', /* 0x00 - 0x0f */
Simon Glasse13d3fa2015-10-18 21:17:22 -060073 0x11, 0x17, 0x05, 0x12, 0x14, 0x19, 0x15, 0x09,
Simon Glassec9fe922012-04-17 09:01:30 +000074 0x0f, 0x10, 0x1b, 0x1d, '\n', 0xff, 0x01, 0x13, /* 0x10 - 0x1f */
75 0x04, 0x06, 0x08, 0x09, 0x0a, 0x0b, 0x0c, ';',
76 '\'', '~', 0x00, 0x1c, 0x1a, 0x18, 0x03, 0x16, /* 0x20 - 0x2f */
77 0x02, 0x0e, 0x0d, '<', '>', '?', 0xff, 0xff,
78 0xff, 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x30 - 0x3f */
79 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7',
80 '8', '9', '-', '4', '5', '6', '+', '1', /* 0x40 - 0x4f */
81 '2', '3', '0', '.', 0xff, 0xff, 0xff, 0xff,
82 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* 0x50 - 0x5F */
Simon Glassaba1f9d2015-10-18 21:17:23 -060083 '\r', 0xff, '/', '*',
Simon Glassec9fe922012-04-17 09:01:30 +000084};
85
Simon Glasse6fa4852015-11-11 10:05:37 -070086static const uchar kbd_plain_xlate_german[] = {
87 0xff, 0x1b, '1', '2', '3', '4', '5', '6', /* scan 00-07 */
88 '7', '8', '9', '0', 0xe1, '\'', 0x08, '\t', /* scan 08-0F */
89 'q', 'w', 'e', 'r', 't', 'z', 'u', 'i', /* scan 10-17 */
90 'o', 'p', 0x81, '+', '\r', 0xff, 'a', 's', /* scan 18-1F */
91 'd', 'f', 'g', 'h', 'j', 'k', 'l', 0x94, /* scan 20-27 */
92 0x84, '^', 0xff, '#', 'y', 'x', 'c', 'v', /* scan 28-2F */
93 'b', 'n', 'm', ',', '.', '-', 0xff, '*', /* scan 30-37 */
94 ' ', ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 38-3F */
95 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7', /* scan 40-47 */
96 '8', '9', '-', '4', '5', '6', '+', '1', /* scan 48-4F */
97 '2', '3', '0', ',', 0xff, 0xff, '<', 0xff, /* scan 50-57 */
98 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 58-5F */
99 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 60-67 */
100 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 68-6F */
101 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 70-77 */
102 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 78-7F */
103 '\r', 0xff, '/', '*',
104};
105
106static unsigned char kbd_shift_xlate_german[] = {
107 0xff, 0x1b, '!', '"', 0x15, '$', '%', '&', /* scan 00-07 */
108 '/', '(', ')', '=', '?', '`', 0x08, '\t', /* scan 08-0F */
109 'Q', 'W', 'E', 'R', 'T', 'Z', 'U', 'I', /* scan 10-17 */
110 'O', 'P', 0x9a, '*', '\r', 0xff, 'A', 'S', /* scan 18-1F */
111 'D', 'F', 'G', 'H', 'J', 'K', 'L', 0x99, /* scan 20-27 */
112 0x8e, 0xf8, 0xff, '\'', 'Y', 'X', 'C', 'V', /* scan 28-2F */
113 'B', 'N', 'M', ';', ':', '_', 0xff, '*', /* scan 30-37 */
114 ' ', ' ', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 38-3F */
115 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '7', /* scan 40-47 */
116 '8', '9', '-', '4', '5', '6', '+', '1', /* scan 48-4F */
117 '2', '3', '0', ',', 0xff, 0xff, '>', 0xff, /* scan 50-57 */
118 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 58-5F */
119 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 60-67 */
120 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 68-6F */
121 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 70-77 */
122 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 78-7F */
123 '\r', 0xff, '/', '*',
124};
125
126static unsigned char kbd_right_alt_xlate_german[] = {
127 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 00-07 */
128 '{', '[', ']', '}', '\\', 0xff, 0xff, 0xff, /* scan 08-0F */
129 '@', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 10-17 */
130 0xff, 0xff, 0xff, '~', 0xff, 0xff, 0xff, 0xff, /* scan 18-1F */
131 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 20-27 */
132 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 28-2F */
133 0xff, 0xff, 0xe6, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 30-37 */
134 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 38-3F */
135 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 40-47 */
136 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, /* scan 48-4F */
137 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, '|', 0xff, /* scan 50-57 */
138};
139
140enum kbd_mask {
141 KBD_ENGLISH = 1 << 0,
142 KBD_GERMAN = 1 << 1,
143};
144
145static struct kbd_entry {
146 int kbd_mask; /* Which languages this is for */
147 int left_keycode; /* Left keycode to select this map */
148 int right_keycode; /* Right keycode to select this map */
149 const uchar *xlate; /* Ascii code for each keycode */
150 int num_entries; /* Number of entries in xlate */
151} kbd_entry[] = {
152 { KBD_ENGLISH, -1, -1,
153 kbd_plain_xlate, ARRAY_SIZE(kbd_plain_xlate) },
154 { KBD_GERMAN, -1, -1,
155 kbd_plain_xlate_german, ARRAY_SIZE(kbd_plain_xlate_german) },
156 { KBD_ENGLISH, KEY_LEFTSHIFT, KEY_RIGHTSHIFT,
157 kbd_shift_xlate, ARRAY_SIZE(kbd_shift_xlate) },
158 { KBD_GERMAN, KEY_LEFTSHIFT, KEY_RIGHTSHIFT,
159 kbd_shift_xlate_german, ARRAY_SIZE(kbd_shift_xlate_german) },
160 { KBD_ENGLISH | KBD_GERMAN, KEY_LEFTCTRL, KEY_RIGHTCTRL,
161 kbd_ctrl_xlate, ARRAY_SIZE(kbd_ctrl_xlate) },
162 { KBD_GERMAN, -1, KEY_RIGHTALT,
163 kbd_right_alt_xlate_german,
164 ARRAY_SIZE(kbd_right_alt_xlate_german) },
165 {},
166};
167
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000168/*
169 * Scan key code to ANSI 3.64 escape sequence table. This table is
170 * incomplete in that it does not include all possible extra keys.
171 */
172static struct {
173 int kbd_scan_code;
174 char *escape;
175} kbd_to_ansi364[] = {
176 { KEY_UP, "\033[A"},
177 { KEY_DOWN, "\033[B"},
178 { KEY_RIGHT, "\033[C"},
179 { KEY_LEFT, "\033[D"},
180};
181
182/* Maximum number of output characters that an ANSI sequence expands to */
183#define ANSI_CHAR_MAX 3
Simon Glassec9fe922012-04-17 09:01:30 +0000184
Kim Phillipsaa1132a2012-10-29 13:34:42 +0000185static int input_queue_ascii(struct input_config *config, int ch)
Simon Glassec9fe922012-04-17 09:01:30 +0000186{
187 if (config->fifo_in + 1 == INPUT_BUFFER_LEN) {
188 if (!config->fifo_out)
189 return -1; /* buffer full */
190 else
191 config->fifo_in = 0;
192 } else {
193 if (config->fifo_in + 1 == config->fifo_out)
194 return -1; /* buffer full */
195 config->fifo_in++;
196 }
Simon Glass2fed04b2015-10-18 21:17:24 -0600197 debug(" {%02x} ", ch);
Simon Glassec9fe922012-04-17 09:01:30 +0000198 config->fifo[config->fifo_in] = (uchar)ch;
199
200 return 0;
201}
202
203int input_tstc(struct input_config *config)
204{
205 if (config->fifo_in == config->fifo_out && config->read_keys) {
206 if (!(*config->read_keys)(config))
207 return 0;
208 }
209 return config->fifo_in != config->fifo_out;
210}
211
212int input_getc(struct input_config *config)
213{
214 int err = 0;
215
216 while (config->fifo_in == config->fifo_out) {
217 if (config->read_keys)
218 err = (*config->read_keys)(config);
219 if (err)
220 return -1;
221 }
222
223 if (++config->fifo_out == INPUT_BUFFER_LEN)
224 config->fifo_out = 0;
225
226 return config->fifo[config->fifo_out];
227}
228
229/**
230 * Process a modifier/special key press or release and decide which key
231 * translation array should be used as a result.
232 *
233 * TODO: Should keep track of modifier press/release
234 *
235 * @param config Input state
236 * @param key Key code to process
237 * @param release 0 if a press, 1 if a release
238 * @return pointer to keycode->ascii translation table that should be used
239 */
240static struct input_key_xlate *process_modifier(struct input_config *config,
241 int key, int release)
242{
Bin Meng7e29bb82015-11-12 05:33:02 -0800243#ifdef CONFIG_DM_KEYBOARD
244 struct udevice *dev = config->dev;
245 struct keyboard_ops *ops = keyboard_get_ops(dev);
246#endif
Simon Glassec9fe922012-04-17 09:01:30 +0000247 struct input_key_xlate *table;
Simon Glassec9fe922012-04-17 09:01:30 +0000248 int i;
249
250 /* Start with the main table, and see what modifiers change it */
251 assert(config->num_tables > 0);
252 table = &config->table[0];
253 for (i = 1; i < config->num_tables; i++) {
254 struct input_key_xlate *tab = &config->table[i];
255
256 if (key == tab->left_keycode || key == tab->right_keycode)
257 table = tab;
258 }
259
260 /* Handle the lighted keys */
261 if (!release) {
Simon Glass210ac0d2015-11-11 10:05:38 -0700262 int flip = -1;
263
Simon Glassec9fe922012-04-17 09:01:30 +0000264 switch (key) {
265 case KEY_SCROLLLOCK:
266 flip = FLAG_SCROLL_LOCK;
267 break;
268 case KEY_NUMLOCK:
269 flip = FLAG_NUM_LOCK;
270 break;
271 case KEY_CAPSLOCK:
272 flip = FLAG_CAPS_LOCK;
273 break;
274 }
Simon Glassec9fe922012-04-17 09:01:30 +0000275
Simon Glass210ac0d2015-11-11 10:05:38 -0700276 if (flip != -1) {
277 int leds = 0;
Simon Glassec9fe922012-04-17 09:01:30 +0000278
Bin Meng229ef052015-11-12 05:33:01 -0800279 config->flags ^= flip;
Simon Glass210ac0d2015-11-11 10:05:38 -0700280 if (config->flags & FLAG_NUM_LOCK)
281 leds |= INPUT_LED_NUM;
282 if (config->flags & FLAG_CAPS_LOCK)
283 leds |= INPUT_LED_CAPS;
284 if (config->flags & FLAG_SCROLL_LOCK)
285 leds |= INPUT_LED_SCROLL;
286 config->leds = leds;
Simon Glass03fef7e2015-11-11 10:05:40 -0700287 config->leds_changed = flip;
Bin Meng7e29bb82015-11-12 05:33:02 -0800288
289#ifdef CONFIG_DM_KEYBOARD
290 if (ops->update_leds) {
291 if (ops->update_leds(dev, config->leds))
292 debug("Update keyboard's LED failed\n");
293 }
294#endif
Simon Glass210ac0d2015-11-11 10:05:38 -0700295 }
Simon Glassec9fe922012-04-17 09:01:30 +0000296 }
297
298 return table;
299}
300
301/**
302 * Search an int array for a key value
303 *
304 * @param array Array to search
305 * @param count Number of elements in array
306 * @param key Key value to find
307 * @return element where value was first found, -1 if none
308 */
309static int array_search(int *array, int count, int key)
310{
311 int i;
312
313 for (i = 0; i < count; i++) {
314 if (array[i] == key)
315 return i;
316 }
317
318 return -1;
319}
320
321/**
322 * Sort an array so that those elements that exist in the ordering are
323 * first in the array, and in the same order as the ordering. The algorithm
324 * is O(count * ocount) and designed for small arrays.
325 *
326 * TODO: Move this to common / lib?
327 *
328 * @param dest Array with elements to sort, also destination array
329 * @param count Number of elements to sort
330 * @param order Array containing ordering elements
331 * @param ocount Number of ordering elements
332 * @return number of elements in dest that are in order (these will be at the
333 * start of dest).
334 */
335static int sort_array_by_ordering(int *dest, int count, int *order,
336 int ocount)
337{
338 int temp[count];
339 int dest_count;
340 int same; /* number of elements which are the same */
341 int i;
342
343 /* setup output items, copy items to be sorted into our temp area */
344 memcpy(temp, dest, count * sizeof(*dest));
345 dest_count = 0;
346
347 /* work through the ordering, move over the elements we agree on */
348 for (i = 0; i < ocount; i++) {
349 if (array_search(temp, count, order[i]) != -1)
350 dest[dest_count++] = order[i];
351 }
352 same = dest_count;
353
354 /* now move over the elements that are not in the ordering */
355 for (i = 0; i < count; i++) {
356 if (array_search(order, ocount, temp[i]) == -1)
357 dest[dest_count++] = temp[i];
358 }
359 assert(dest_count == count);
360 return same;
361}
362
363/**
364 * Check a list of key codes against the previous key scan
365 *
366 * Given a list of new key codes, we check how many of these are the same
367 * as last time.
368 *
369 * @param config Input state
370 * @param keycode List of key codes to examine
371 * @param num_keycodes Number of key codes
372 * @param same Returns number of key codes which are the same
373 */
374static int input_check_keycodes(struct input_config *config,
375 int keycode[], int num_keycodes, int *same)
376{
377 /* Select the 'plain' xlate table to start with */
378 if (!config->num_tables) {
379 debug("%s: No xlate tables: cannot decode keys\n", __func__);
380 return -1;
381 }
382
383 /* sort the keycodes into the same order as the previous ones */
384 *same = sort_array_by_ordering(keycode, num_keycodes,
385 config->prev_keycodes, config->num_prev_keycodes);
386
387 memcpy(config->prev_keycodes, keycode, num_keycodes * sizeof(int));
388 config->num_prev_keycodes = num_keycodes;
389
390 return *same != num_keycodes;
391}
392
393/**
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000394 * Checks and converts a special key code into ANSI 3.64 escape sequence.
395 *
396 * @param config Input state
397 * @param keycode Key code to examine
398 * @param output_ch Buffer to place output characters into. It should
399 * be at least ANSI_CHAR_MAX bytes long, to allow for
400 * an ANSI sequence.
401 * @param max_chars Maximum number of characters to add to output_ch
402 * @return number of characters output, if the key was converted, otherwise 0.
403 * This may be larger than max_chars, in which case the overflow
404 * characters are not output.
405 */
406static int input_keycode_to_ansi364(struct input_config *config,
407 int keycode, char output_ch[], int max_chars)
408{
409 const char *escape;
410 int ch_count;
411 int i;
412
413 for (i = ch_count = 0; i < ARRAY_SIZE(kbd_to_ansi364); i++) {
414 if (keycode != kbd_to_ansi364[i].kbd_scan_code)
415 continue;
416 for (escape = kbd_to_ansi364[i].escape; *escape; escape++) {
417 if (ch_count < max_chars)
418 output_ch[ch_count] = *escape;
419 ch_count++;
420 }
421 return ch_count;
422 }
423
424 return 0;
425}
426
427/**
428 * Converts and queues a list of key codes in escaped ASCII string form
Simon Glassec9fe922012-04-17 09:01:30 +0000429 * Convert a list of key codes into ASCII
430 *
431 * You must call input_check_keycodes() before this. It turns the keycode
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000432 * list into a list of ASCII characters and sends them to the input layer.
Simon Glassec9fe922012-04-17 09:01:30 +0000433 *
434 * Characters which were seen last time do not generate fresh ASCII output.
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000435 * The output (calls to queue_ascii) may be longer than num_keycodes, if the
436 * keycode contains special keys that was encoded to longer escaped sequence.
Simon Glassec9fe922012-04-17 09:01:30 +0000437 *
438 * @param config Input state
439 * @param keycode List of key codes to examine
440 * @param num_keycodes Number of key codes
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000441 * @param output_ch Buffer to place output characters into. It should
442 * be at last ANSI_CHAR_MAX * num_keycodes, to allow for
443 * ANSI sequences.
444 * @param max_chars Maximum number of characters to add to output_ch
Simon Glassec9fe922012-04-17 09:01:30 +0000445 * @param same Number of key codes which are the same
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000446 * @return number of characters written into output_ch, or -1 if we would
447 * exceed max_chars chars.
Simon Glassec9fe922012-04-17 09:01:30 +0000448 */
449static int input_keycodes_to_ascii(struct input_config *config,
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000450 int keycode[], int num_keycodes, char output_ch[],
451 int max_chars, int same)
Simon Glassec9fe922012-04-17 09:01:30 +0000452{
453 struct input_key_xlate *table;
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000454 int ch_count = 0;
Simon Glassec9fe922012-04-17 09:01:30 +0000455 int i;
456
457 table = &config->table[0];
458
459 /* deal with modifiers first */
460 for (i = 0; i < num_keycodes; i++) {
461 int key = keycode[i] & KEY_MASK;
462
463 if (key >= table->num_entries || table->xlate[key] == 0xff) {
464 table = process_modifier(config, key,
465 keycode[i] & KEY_RELEASE);
466 }
467 }
468
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000469 /* Start conversion by looking for the first new keycode (by same). */
470 for (i = same; i < num_keycodes; i++) {
Simon Glassec9fe922012-04-17 09:01:30 +0000471 int key = keycode[i];
Simon Glassf9bd6eb2015-11-11 10:05:39 -0700472 int ch;
Simon Glassec9fe922012-04-17 09:01:30 +0000473
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000474 /*
475 * For a normal key (with an ASCII value), add it; otherwise
476 * translate special key to escape sequence if possible.
477 */
Simon Glassf9bd6eb2015-11-11 10:05:39 -0700478 if (key < table->num_entries) {
479 ch = table->xlate[key];
480 if ((config->flags & FLAG_CAPS_LOCK) &&
481 ch >= 'a' && ch <= 'z')
482 ch -= 'a' - 'A';
Bin Mengcb6a19f2015-11-12 05:33:04 -0800483 /* ban digit numbers if 'Num Lock' is not on */
484 if (!(config->flags & FLAG_NUM_LOCK)) {
485 if (key >= KEY_KP7 && key <= KEY_KPDOT &&
486 key != KEY_KPMINUS && key != KEY_KPPLUS)
487 ch = 0xff;
488 }
Simon Glassf9bd6eb2015-11-11 10:05:39 -0700489 if (ch_count < max_chars && ch != 0xff)
490 output_ch[ch_count++] = (uchar)ch;
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000491 } else {
492 ch_count += input_keycode_to_ansi364(config, key,
493 output_ch, max_chars);
Simon Glassec9fe922012-04-17 09:01:30 +0000494 }
495 }
496
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000497 if (ch_count > max_chars) {
498 debug("%s: Output char buffer overflow size=%d, need=%d\n",
499 __func__, max_chars, ch_count);
500 return -1;
501 }
502
Simon Glassec9fe922012-04-17 09:01:30 +0000503 /* ok, so return keys */
504 return ch_count;
505}
506
Simon Glass2fed04b2015-10-18 21:17:24 -0600507static int _input_send_keycodes(struct input_config *config, int keycode[],
508 int num_keycodes, bool do_send)
Simon Glassec9fe922012-04-17 09:01:30 +0000509{
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000510 char ch[num_keycodes * ANSI_CHAR_MAX];
Simon Glassec9fe922012-04-17 09:01:30 +0000511 int count, i, same = 0;
512 int is_repeat = 0;
513 unsigned delay_ms;
514
515 config->modifiers = 0;
516 if (!input_check_keycodes(config, keycode, num_keycodes, &same)) {
517 /*
518 * Same as last time - is it time for another repeat?
519 * TODO(sjg@chromium.org) We drop repeats here and since
520 * the caller may not call in again for a while, our
521 * auto-repeat speed is not quite correct. We should
522 * insert another character if we later realise that we
523 * have missed a repeat slot.
524 */
Simon Glassd64a8cb2015-10-18 21:17:25 -0600525 is_repeat = config->allow_repeats || (config->repeat_rate_ms &&
526 (int)get_timer(config->next_repeat_ms) >= 0);
Simon Glassec9fe922012-04-17 09:01:30 +0000527 if (!is_repeat)
528 return 0;
529 }
530
531 count = input_keycodes_to_ascii(config, keycode, num_keycodes,
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000532 ch, sizeof(ch), is_repeat ? 0 : same);
Simon Glass2fed04b2015-10-18 21:17:24 -0600533 if (do_send) {
534 for (i = 0; i < count; i++)
535 input_queue_ascii(config, ch[i]);
536 }
Simon Glassec9fe922012-04-17 09:01:30 +0000537 delay_ms = is_repeat ?
538 config->repeat_rate_ms :
539 config->repeat_delay_ms;
540
541 config->next_repeat_ms = get_timer(0) + delay_ms;
Hung-Te Lin47a65ad2012-10-11 15:15:53 +0000542
543 return count;
Simon Glassec9fe922012-04-17 09:01:30 +0000544}
545
Simon Glass2fed04b2015-10-18 21:17:24 -0600546int input_send_keycodes(struct input_config *config, int keycode[],
547 int num_keycodes)
548{
549 return _input_send_keycodes(config, keycode, num_keycodes, true);
550}
551
552int input_add_keycode(struct input_config *config, int new_keycode,
553 bool release)
554{
555 int keycode[INPUT_MAX_MODIFIERS + 1];
556 int count, i;
557
558 /* Add the old keycodes which are not removed by this new one */
559 for (i = 0, count = 0; i < config->num_prev_keycodes; i++) {
560 int code = config->prev_keycodes[i];
561
562 if (new_keycode == code) {
563 if (release)
564 continue;
565 new_keycode = -1;
566 }
567 keycode[count++] = code;
568 }
569
570 if (!release && new_keycode != -1)
571 keycode[count++] = new_keycode;
572 debug("\ncodes for %02x/%d: ", new_keycode, release);
573 for (i = 0; i < count; i++)
574 debug("%02x ", keycode[i]);
575 debug("\n");
576
577 /* Don't output any ASCII characters if this is a key release */
578 return _input_send_keycodes(config, keycode, count, !release);
579}
580
Simon Glassec9fe922012-04-17 09:01:30 +0000581int input_add_table(struct input_config *config, int left_keycode,
582 int right_keycode, const uchar *xlate, int num_entries)
583{
584 struct input_key_xlate *table;
585
586 if (config->num_tables == INPUT_MAX_MODIFIERS) {
587 debug("%s: Too many modifier tables\n", __func__);
588 return -1;
589 }
590
591 table = &config->table[config->num_tables++];
592 table->left_keycode = left_keycode;
593 table->right_keycode = right_keycode;
594 table->xlate = xlate;
595 table->num_entries = num_entries;
596
597 return 0;
598}
599
Simon Glass6bca4f42012-09-27 15:18:41 +0000600void input_set_delays(struct input_config *config, int repeat_delay_ms,
Simon Glassec9fe922012-04-17 09:01:30 +0000601 int repeat_rate_ms)
602{
Simon Glassec9fe922012-04-17 09:01:30 +0000603 config->repeat_delay_ms = repeat_delay_ms;
604 config->repeat_rate_ms = repeat_rate_ms;
Simon Glass6bca4f42012-09-27 15:18:41 +0000605}
606
Simon Glassd64a8cb2015-10-18 21:17:25 -0600607void input_allow_repeats(struct input_config *config, bool allow_repeats)
608{
609 config->allow_repeats = allow_repeats;
610}
611
Simon Glass03fef7e2015-11-11 10:05:40 -0700612int input_leds_changed(struct input_config *config)
613{
614 if (config->leds_changed)
615 return config->leds;
616
617 return -1;
618}
619
Simon Glasse6fa4852015-11-11 10:05:37 -0700620int input_add_tables(struct input_config *config, bool german)
Simon Glasse7817a92015-10-18 21:17:13 -0600621{
Simon Glasse6fa4852015-11-11 10:05:37 -0700622 struct kbd_entry *entry;
623 int mask;
Simon Glasse7817a92015-10-18 21:17:13 -0600624 int ret;
625
Simon Glasse6fa4852015-11-11 10:05:37 -0700626 mask = german ? KBD_GERMAN : KBD_ENGLISH;
627 for (entry = kbd_entry; entry->kbd_mask; entry++) {
628 if (!(mask & entry->kbd_mask))
629 continue;
630 ret = input_add_table(config, entry->left_keycode,
631 entry->right_keycode, entry->xlate,
632 entry->num_entries);
633 if (ret)
634 return ret;
635 }
Simon Glasse7817a92015-10-18 21:17:13 -0600636
Simon Glasse6fa4852015-11-11 10:05:37 -0700637 return 0;
Simon Glasse7817a92015-10-18 21:17:13 -0600638}
639
Simon Glass6bca4f42012-09-27 15:18:41 +0000640int input_init(struct input_config *config, int leds)
641{
642 memset(config, '\0', sizeof(*config));
643 config->leds = leds;
Simon Glassec9fe922012-04-17 09:01:30 +0000644
645 return 0;
646}
647
648int input_stdio_register(struct stdio_dev *dev)
649{
650 int error;
651
652 error = stdio_register(dev);
653
654 /* check if this is the standard input device */
Simon Glass64b723f2017-08-03 12:22:12 -0600655 if (!error && strcmp(env_get("stdin"), dev->name) == 0) {
Simon Glassec9fe922012-04-17 09:01:30 +0000656 /* reassign the console */
657 if (OVERWRITE_CONSOLE ||
658 console_assign(stdin, dev->name))
659 return -1;
660 }
661
662 return 0;
663}