You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

164 lines
4.0 KiB

  1. /*
  2. Copyright 2012 Jun Wako
  3. Copyright 2014 Jack Humbert
  4. This program is free software: you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation, either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program. If not, see <http://www.gnu.org/licenses/>.
  14. */
  15. #include <stdint.h>
  16. #include <stdbool.h>
  17. #if defined(__AVR__)
  18. #include <avr/io.h>
  19. #endif
  20. #include "wait.h"
  21. #include "print.h"
  22. #include "debug.h"
  23. #include "util.h"
  24. #include "matrix.h"
  25. #include "timer.h"
  26. #include "protocol/serial.h"
  27. #if (MATRIX_COLS <= 8)
  28. # define print_matrix_header() print("\nr/c 01234567\n")
  29. # define print_matrix_row(row) print_bin_reverse8(matrix_get_row(row))
  30. # define matrix_bitpop(i) bitpop(matrix[i])
  31. # define ROW_SHIFTER ((uint8_t)1)
  32. #elif (MATRIX_COLS <= 16)
  33. # define print_matrix_header() print("\nr/c 0123456789ABCDEF\n")
  34. # define print_matrix_row(row) print_bin_reverse16(matrix_get_row(row))
  35. # define matrix_bitpop(i) bitpop16(matrix[i])
  36. # define ROW_SHIFTER ((uint16_t)1)
  37. #elif (MATRIX_COLS <= 32)
  38. # define print_matrix_header() print("\nr/c 0123456789ABCDEF0123456789ABCDEF\n")
  39. # define print_matrix_row(row) print_bin_reverse32(matrix_get_row(row))
  40. # define matrix_bitpop(i) bitpop32(matrix[i])
  41. # define ROW_SHIFTER ((uint32_t)1)
  42. #endif
  43. /* matrix state(1:on, 0:off) */
  44. static matrix_row_t matrix[MATRIX_ROWS];
  45. __attribute__ ((weak))
  46. void matrix_init_quantum(void) {
  47. matrix_init_kb();
  48. }
  49. __attribute__ ((weak))
  50. void matrix_scan_quantum(void) {
  51. matrix_scan_kb();
  52. }
  53. __attribute__ ((weak))
  54. void matrix_init_kb(void) {
  55. matrix_init_user();
  56. }
  57. __attribute__ ((weak))
  58. void matrix_scan_kb(void) {
  59. matrix_scan_user();
  60. }
  61. __attribute__ ((weak))
  62. void matrix_init_user(void) {
  63. }
  64. __attribute__ ((weak))
  65. void matrix_scan_user(void) {
  66. }
  67. inline
  68. uint8_t matrix_rows(void) {
  69. return MATRIX_ROWS;
  70. }
  71. inline
  72. uint8_t matrix_cols(void) {
  73. return MATRIX_COLS;
  74. }
  75. void matrix_init(void) {
  76. matrix_init_quantum();
  77. serial_init();
  78. }
  79. uint8_t matrix_scan(void)
  80. {
  81. uint32_t timeout = 0;
  82. //the s character requests the RF slave to send the matrix
  83. SERIAL_UART_DATA = 's';
  84. //trust the external keystates entirely, erase the last data
  85. uint8_t uart_data[14] = {0};
  86. //there are 10 bytes corresponding to 10 columns, and an end byte
  87. for (uint8_t i = 0; i < 14; i++) {
  88. //wait for the serial data, timeout if it's been too long
  89. //this only happened in testing with a loose wire, but does no
  90. //harm to leave it in here
  91. while(!SERIAL_UART_RXD_PRESENT){
  92. timeout++;
  93. if (timeout > 10000){
  94. break;
  95. }
  96. }
  97. uart_data[i] = SERIAL_UART_DATA;
  98. }
  99. //check for the end packet, the key state bytes use the LSBs, so 0xE0
  100. //will only show up here if the correct bytes were recieved
  101. if (uart_data[10] == 0xE0)
  102. {
  103. //shifting and transferring the keystates to the QMK matrix variable
  104. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  105. matrix[i] = (uint16_t) uart_data[i*2] | (uint16_t) uart_data[i*2+1] << 6;
  106. }
  107. }
  108. matrix_scan_quantum();
  109. return 1;
  110. }
  111. inline
  112. bool matrix_is_on(uint8_t row, uint8_t col)
  113. {
  114. return (matrix[row] & ((matrix_row_t)1<<col));
  115. }
  116. inline
  117. matrix_row_t matrix_get_row(uint8_t row)
  118. {
  119. return matrix[row];
  120. }
  121. void matrix_print(void)
  122. {
  123. print_matrix_header();
  124. for (uint8_t row = 0; row < MATRIX_ROWS; row++) {
  125. print_hex8(row); print(": ");
  126. print_matrix_row(row);
  127. print("\n");
  128. }
  129. }
  130. uint8_t matrix_key_count(void)
  131. {
  132. uint8_t count = 0;
  133. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  134. count += matrix_bitpop(i);
  135. }
  136. return count;
  137. }