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