matrix.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. /*
  2. Note for ErgoDox EZ customizers: Here be dragons!
  3. This is not a file you want to be messing with.
  4. All of the interesting stuff for you is under keymaps/ :)
  5. Love, Erez
  6. Copyright 2013 Oleg Kostyuk <cub.uanic@gmail.com>
  7. This program is free software: you can redistribute it and/or modify
  8. it under the terms of the GNU General Public License as published by
  9. the Free Software Foundation, either version 2 of the License, or
  10. (at your option) any later version.
  11. This program is distributed in the hope that it will be useful,
  12. but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. GNU General Public License for more details.
  15. You should have received a copy of the GNU General Public License
  16. along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. /*
  19. * scan matrix
  20. */
  21. #include <stdint.h>
  22. #include <stdbool.h>
  23. #include <avr/io.h>
  24. #include "wait.h"
  25. #include "action_layer.h"
  26. #include "print.h"
  27. #include "debug.h"
  28. #include "util.h"
  29. #include "matrix.h"
  30. #include QMK_KEYBOARD_H
  31. #include "i2cmaster.h"
  32. #ifdef DEBUG_MATRIX_SCAN_RATE
  33. #include "timer.h"
  34. #endif
  35. /*
  36. * This constant define not debouncing time in msecs, but amount of matrix
  37. * scan loops which should be made to get stable debounced results.
  38. *
  39. * On Ergodox matrix scan rate is relatively low, because of slow I2C.
  40. * Now it's only 317 scans/second, or about 3.15 msec/scan.
  41. * According to Cherry specs, debouncing time is 5 msec.
  42. *
  43. * However, some switches seem to have higher debouncing requirements, or
  44. * something else might be wrong. (Also, the scan speed has improved since
  45. * that comment was written.)
  46. */
  47. #ifndef DEBOUNCE
  48. # define DEBOUNCE 5
  49. #endif
  50. /* matrix state(1:on, 0:off) */
  51. static matrix_row_t matrix[MATRIX_ROWS];
  52. // Debouncing: store for each key the number of scans until it's eligible to
  53. // change. When scanning the matrix, ignore any changes in keys that have
  54. // already changed in the last DEBOUNCE scans.
  55. static uint8_t debounce_matrix[MATRIX_ROWS * MATRIX_COLS];
  56. static matrix_row_t read_cols(uint8_t row);
  57. static void init_cols(void);
  58. static void unselect_rows(void);
  59. static void select_row(uint8_t row);
  60. static uint8_t mcp23018_reset_loop;
  61. #ifdef DEBUG_MATRIX_SCAN_RATE
  62. uint32_t matrix_timer;
  63. uint32_t matrix_scan_count;
  64. #endif
  65. __attribute__ ((weak))
  66. void matrix_init_user(void) {}
  67. __attribute__ ((weak))
  68. void matrix_scan_user(void) {}
  69. __attribute__ ((weak))
  70. void matrix_init_kb(void) {
  71. matrix_init_user();
  72. }
  73. __attribute__ ((weak))
  74. void matrix_scan_kb(void) {
  75. matrix_scan_user();
  76. }
  77. inline
  78. uint8_t matrix_rows(void)
  79. {
  80. return MATRIX_ROWS;
  81. }
  82. inline
  83. uint8_t matrix_cols(void)
  84. {
  85. return MATRIX_COLS;
  86. }
  87. void matrix_init(void)
  88. {
  89. // initialize row and col
  90. mcp23018_status = init_mcp23018();
  91. unselect_rows();
  92. init_cols();
  93. // initialize matrix state: all keys off
  94. for (uint8_t i=0; i < MATRIX_ROWS; i++) {
  95. matrix[i] = 0;
  96. for (uint8_t j=0; j < MATRIX_COLS; ++j) {
  97. debounce_matrix[i * MATRIX_COLS + j] = 0;
  98. }
  99. }
  100. #ifdef DEBUG_MATRIX_SCAN_RATE
  101. matrix_timer = timer_read32();
  102. matrix_scan_count = 0;
  103. #endif
  104. matrix_init_quantum();
  105. }
  106. void matrix_power_up(void) {
  107. mcp23018_status = init_mcp23018();
  108. unselect_rows();
  109. init_cols();
  110. // initialize matrix state: all keys off
  111. for (uint8_t i=0; i < MATRIX_ROWS; i++) {
  112. matrix[i] = 0;
  113. }
  114. #ifdef DEBUG_MATRIX_SCAN_RATE
  115. matrix_timer = timer_read32();
  116. matrix_scan_count = 0;
  117. #endif
  118. }
  119. // Returns a matrix_row_t whose bits are set if the corresponding key should be
  120. // eligible to change in this scan.
  121. matrix_row_t debounce_mask(uint8_t row) {
  122. matrix_row_t result = 0;
  123. for (uint8_t j=0; j < MATRIX_COLS; ++j) {
  124. if (debounce_matrix[row * MATRIX_COLS + j]) {
  125. --debounce_matrix[row * MATRIX_COLS + j];
  126. } else {
  127. result |= (1 << j);
  128. }
  129. }
  130. return result;
  131. }
  132. // Report changed keys in the given row. Resets the debounce countdowns
  133. // corresponding to each set bit in 'change' to DEBOUNCE.
  134. void debounce_report(matrix_row_t change, uint8_t row) {
  135. for (uint8_t i = 0; i < MATRIX_COLS; ++i) {
  136. if (change & (1 << i)) {
  137. debounce_matrix[row * MATRIX_COLS + i] = DEBOUNCE;
  138. }
  139. }
  140. }
  141. uint8_t matrix_scan(void)
  142. {
  143. if (mcp23018_status) { // if there was an error
  144. if (++mcp23018_reset_loop == 0) {
  145. // since mcp23018_reset_loop is 8 bit - we'll try to reset once in 255 matrix scans
  146. // this will be approx bit more frequent than once per second
  147. print("trying to reset mcp23018\n");
  148. mcp23018_status = init_mcp23018();
  149. if (mcp23018_status) {
  150. print("left side not responding\n");
  151. } else {
  152. print("left side attached\n");
  153. ergodox_blink_all_leds();
  154. }
  155. }
  156. }
  157. #ifdef DEBUG_MATRIX_SCAN_RATE
  158. matrix_scan_count++;
  159. uint32_t timer_now = timer_read32();
  160. if (TIMER_DIFF_32(timer_now, matrix_timer)>1000) {
  161. print("matrix scan frequency: ");
  162. pdec(matrix_scan_count);
  163. print("\n");
  164. matrix_timer = timer_now;
  165. matrix_scan_count = 0;
  166. }
  167. #endif
  168. #ifdef LEFT_LEDS
  169. mcp23018_status = ergodox_left_leds_update();
  170. #endif // LEFT_LEDS
  171. for (uint8_t i = 0; i < MATRIX_ROWS_PER_SIDE; i++) {
  172. select_row(i);
  173. // and select on left hand
  174. select_row(i + MATRIX_ROWS_PER_SIDE);
  175. // we don't need a 30us delay anymore, because selecting a
  176. // left-hand row requires more than 30us for i2c.
  177. matrix_row_t mask = debounce_mask(i);
  178. matrix_row_t cols = (read_cols(i) & mask) | (matrix[i] & ~mask);
  179. debounce_report(cols ^ matrix[i], i);
  180. matrix[i] = cols;
  181. // grab cols from right hand
  182. mask = debounce_mask(i + MATRIX_ROWS_PER_SIDE);
  183. cols = (read_cols(i + MATRIX_ROWS_PER_SIDE) & mask) | (matrix[i + MATRIX_ROWS_PER_SIDE] & ~mask);
  184. debounce_report(cols ^ matrix[i + MATRIX_ROWS_PER_SIDE], i + MATRIX_ROWS_PER_SIDE);
  185. matrix[i + MATRIX_ROWS_PER_SIDE] = cols;
  186. unselect_rows();
  187. }
  188. matrix_scan_quantum();
  189. return 1;
  190. }
  191. bool matrix_is_modified(void) // deprecated and evidently not called.
  192. {
  193. return true;
  194. }
  195. inline
  196. bool matrix_is_on(uint8_t row, uint8_t col)
  197. {
  198. return (matrix[row] & ((matrix_row_t)1<<col));
  199. }
  200. inline
  201. matrix_row_t matrix_get_row(uint8_t row)
  202. {
  203. return matrix[row];
  204. }
  205. void matrix_print(void)
  206. {
  207. print("\nr/c 0123456789ABCDEF\n");
  208. for (uint8_t row = 0; row < MATRIX_ROWS; row++) {
  209. phex(row); print(": ");
  210. pbin_reverse16(matrix_get_row(row));
  211. print("\n");
  212. }
  213. }
  214. uint8_t matrix_key_count(void)
  215. {
  216. uint8_t count = 0;
  217. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  218. count += bitpop16(matrix[i]);
  219. }
  220. return count;
  221. }
  222. /* Column pin configuration
  223. *
  224. * Teensy
  225. * col: 0 1 2 3 4 5
  226. * pin: F0 F1 F4 F5 F6 F7
  227. *
  228. * MCP23018
  229. * col: 0 1 2 3 4 5
  230. * pin: B5 B4 B3 B2 B1 B0
  231. */
  232. static void init_cols(void)
  233. {
  234. // init on mcp23018
  235. // not needed, already done as part of init_mcp23018()
  236. // init on teensy
  237. // Input with pull-up(DDR:0, PORT:1)
  238. DDRF &= ~(1<<7 | 1<<6 | 1<<5 | 1<<4 | 1<<1 | 1<<0);
  239. PORTF |= (1<<7 | 1<<6 | 1<<5 | 1<<4 | 1<<1 | 1<<0);
  240. }
  241. static matrix_row_t read_cols(uint8_t row)
  242. {
  243. if (row < 7) {
  244. if (mcp23018_status) { // if there was an error
  245. return 0;
  246. } else {
  247. uint8_t data = 0;
  248. mcp23018_status = i2c_start(I2C_ADDR_WRITE); if (mcp23018_status) goto out;
  249. mcp23018_status = i2c_write(GPIOB); if (mcp23018_status) goto out;
  250. mcp23018_status = i2c_start(I2C_ADDR_READ); if (mcp23018_status) goto out;
  251. data = i2c_readNak();
  252. data = ~data;
  253. out:
  254. i2c_stop();
  255. return data;
  256. }
  257. } else {
  258. /* read from teensy
  259. * bitmask is 0b11110011, but we want those all
  260. * in the lower six bits.
  261. * we'll return 1s for the top two, but that's harmless.
  262. */
  263. return ~((PINF & 0x03) | ((PINF & 0xF0) >> 2));
  264. }
  265. }
  266. /* Row pin configuration
  267. *
  268. * Teensy
  269. * row: 7 8 9 10 11 12 13
  270. * pin: B0 B1 B2 B3 D2 D3 C6
  271. *
  272. * MCP23018
  273. * row: 0 1 2 3 4 5 6
  274. * pin: A0 A1 A2 A3 A4 A5 A6
  275. */
  276. static void unselect_rows(void)
  277. {
  278. // no need to unselect on mcp23018, because the select step sets all
  279. // the other row bits high, and it's not changing to a different
  280. // direction
  281. // unselect on teensy
  282. // Hi-Z(DDR:0, PORT:0) to unselect
  283. DDRB &= ~(1<<0 | 1<<1 | 1<<2 | 1<<3);
  284. PORTB &= ~(1<<0 | 1<<1 | 1<<2 | 1<<3);
  285. DDRD &= ~(1<<2 | 1<<3);
  286. PORTD &= ~(1<<2 | 1<<3);
  287. DDRC &= ~(1<<6);
  288. PORTC &= ~(1<<6);
  289. }
  290. static void select_row(uint8_t row)
  291. {
  292. if (row < 7) {
  293. // select on mcp23018
  294. if (mcp23018_status) { // if there was an error
  295. // do nothing
  296. } else {
  297. // set active row low : 0
  298. // set other rows hi-Z : 1
  299. mcp23018_status = i2c_start(I2C_ADDR_WRITE); if (mcp23018_status) goto out;
  300. mcp23018_status = i2c_write(GPIOA); if (mcp23018_status) goto out;
  301. mcp23018_status = i2c_write(0xFF & ~(1<<row)); if (mcp23018_status) goto out;
  302. out:
  303. i2c_stop();
  304. }
  305. } else {
  306. // select on teensy
  307. // Output low(DDR:1, PORT:0) to select
  308. switch (row) {
  309. case 7:
  310. DDRB |= (1<<0);
  311. PORTB &= ~(1<<0);
  312. break;
  313. case 8:
  314. DDRB |= (1<<1);
  315. PORTB &= ~(1<<1);
  316. break;
  317. case 9:
  318. DDRB |= (1<<2);
  319. PORTB &= ~(1<<2);
  320. break;
  321. case 10:
  322. DDRB |= (1<<3);
  323. PORTB &= ~(1<<3);
  324. break;
  325. case 11:
  326. DDRD |= (1<<2);
  327. PORTD &= ~(1<<3);
  328. break;
  329. case 12:
  330. DDRD |= (1<<3);
  331. PORTD &= ~(1<<3);
  332. break;
  333. case 13:
  334. DDRC |= (1<<6);
  335. PORTC &= ~(1<<6);
  336. break;
  337. }
  338. }
  339. }