Ви не можете вибрати більше 25 тем Теми мають розпочинатися з літери або цифри, можуть містити дефіси (-) і не повинні перевищувати 35 символів.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.

13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
13 роки тому
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213
  1. /*
  2. Copyright 2011 Jun Wako <[email protected]>
  3. This program is free software: you can redistribute it and/or modify
  4. it under the terms of the GNU General Public License as published by
  5. the Free Software Foundation, either version 2 of the License, or
  6. (at your option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License
  12. along with this program. If not, see <http://www.gnu.org/licenses/>.
  13. */
  14. /*
  15. * scan matrix
  16. */
  17. #include <stdint.h>
  18. #include <stdbool.h>
  19. #include <avr/io.h>
  20. #include <util/delay.h>
  21. #include "print.h"
  22. #include "util.h"
  23. #include "debug.h"
  24. #include "adb.h"
  25. #include "matrix.h"
  26. #if (MATRIX_COLS > 16)
  27. # error "MATRIX_COLS must not exceed 16"
  28. #endif
  29. #if (MATRIX_ROWS > 255)
  30. # error "MATRIX_ROWS must not exceed 255"
  31. #endif
  32. static bool is_modified = false;
  33. // matrix state buffer(1:on, 0:off)
  34. #if (MATRIX_COLS <= 8)
  35. static uint8_t matrix[MATRIX_ROWS];
  36. #else
  37. static uint16_t matrix[MATRIX_ROWS];
  38. #endif
  39. #ifdef MATRIX_HAS_GHOST
  40. static bool matrix_has_ghost_in_row(uint8_t row);
  41. #endif
  42. static void register_key(uint8_t key);
  43. inline
  44. uint8_t matrix_rows(void)
  45. {
  46. return MATRIX_ROWS;
  47. }
  48. inline
  49. uint8_t matrix_cols(void)
  50. {
  51. return MATRIX_COLS;
  52. }
  53. void matrix_init(void)
  54. {
  55. adb_host_init();
  56. // initialize matrix state: all keys off
  57. for (uint8_t i=0; i < MATRIX_ROWS; i++) matrix[i] = 0x00;
  58. debug_enable = true;
  59. debug_matrix = true;
  60. debug_keyboard = true;
  61. debug_mouse = true;
  62. print("debug enabled.\n");
  63. return;
  64. }
  65. uint8_t matrix_scan(void)
  66. {
  67. uint16_t codes;
  68. uint8_t key0, key1;
  69. is_modified = false;
  70. codes = adb_host_kbd_recv();
  71. key0 = codes>>8;
  72. key1 = codes&0xFF;
  73. if (debug_matrix && codes) {
  74. print("adb_host_kbd_recv: "); phex16(codes); print("\n");
  75. }
  76. if (codes == 0) { // no keys
  77. return 0;
  78. } else if (codes == 0x7F7F) { // power key press
  79. register_key(0x7F);
  80. } else if (codes == 0xFFFF) { // power key release
  81. register_key(0xFF);
  82. } else if (key0 == 0xFF) { // error
  83. xprintf("adb_host_kbd_recv: ERROR(%02X)\n", codes);
  84. return key1;
  85. } else {
  86. register_key(key0);
  87. if (key1 != 0xFF) // key1 is 0xFF when no second key.
  88. register_key(key1);
  89. }
  90. return 1;
  91. }
  92. bool matrix_is_modified(void)
  93. {
  94. return is_modified;
  95. }
  96. inline
  97. bool matrix_has_ghost(void)
  98. {
  99. #ifdef MATRIX_HAS_GHOST
  100. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  101. if (matrix_has_ghost_in_row(i))
  102. return true;
  103. }
  104. #endif
  105. return false;
  106. }
  107. inline
  108. bool matrix_is_on(uint8_t row, uint8_t col)
  109. {
  110. return (matrix[row] & (1<<col));
  111. }
  112. inline
  113. #if (MATRIX_COLS <= 8)
  114. uint8_t matrix_get_row(uint8_t row)
  115. #else
  116. uint16_t matrix_get_row(uint8_t row)
  117. #endif
  118. {
  119. return matrix[row];
  120. }
  121. void matrix_print(void)
  122. {
  123. if (!debug_matrix) return;
  124. #if (MATRIX_COLS <= 8)
  125. print("r/c 01234567\n");
  126. #else
  127. print("r/c 0123456789ABCDEF\n");
  128. #endif
  129. for (uint8_t row = 0; row < matrix_rows(); row++) {
  130. phex(row); print(": ");
  131. #if (MATRIX_COLS <= 8)
  132. pbin_reverse(matrix_get_row(row));
  133. #else
  134. pbin_reverse16(matrix_get_row(row));
  135. #endif
  136. #ifdef MATRIX_HAS_GHOST
  137. if (matrix_has_ghost_in_row(row)) {
  138. print(" <ghost");
  139. }
  140. #endif
  141. print("\n");
  142. }
  143. }
  144. uint8_t matrix_key_count(void)
  145. {
  146. uint8_t count = 0;
  147. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  148. #if (MATRIX_COLS <= 8)
  149. count += bitpop(matrix[i]);
  150. #else
  151. count += bitpop16(matrix[i]);
  152. #endif
  153. }
  154. return count;
  155. }
  156. #ifdef MATRIX_HAS_GHOST
  157. inline
  158. static bool matrix_has_ghost_in_row(uint8_t row)
  159. {
  160. // no ghost exists in case less than 2 keys on
  161. if (((matrix[row] - 1) & matrix[row]) == 0)
  162. return false;
  163. // ghost exists in case same state as other row
  164. for (uint8_t i=0; i < MATRIX_ROWS; i++) {
  165. if (i != row && (matrix[i] & matrix[row]) == matrix[row])
  166. return true;
  167. }
  168. return false;
  169. }
  170. #endif
  171. inline
  172. static void register_key(uint8_t key)
  173. {
  174. uint8_t col, row;
  175. col = key&0x07;
  176. row = (key>>3)&0x0F;
  177. if (key&0x80) {
  178. matrix[row] &= ~(1<<col);
  179. } else {
  180. matrix[row] |= (1<<col);
  181. }
  182. is_modified = true;
  183. }