matrix.c 7.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225
  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 "dichotomy.h"
  27. #include "pointing_device.h"
  28. #include "report.h"
  29. #if (MATRIX_COLS <= 8)
  30. # define print_matrix_header() print("\nr/c 01234567\n")
  31. # define print_matrix_row(row) print_bin_reverse8(matrix_get_row(row))
  32. # define matrix_bitpop(i) bitpop(matrix[i])
  33. # define ROW_SHIFTER ((uint8_t)1)
  34. #elif (MATRIX_COLS <= 16)
  35. # define print_matrix_header() print("\nr/c 0123456789ABCDEF\n")
  36. # define print_matrix_row(row) print_bin_reverse16(matrix_get_row(row))
  37. # define matrix_bitpop(i) bitpop16(matrix[i])
  38. # define ROW_SHIFTER ((uint16_t)1)
  39. #elif (MATRIX_COLS <= 32)
  40. # define print_matrix_header() print("\nr/c 0123456789ABCDEF0123456789ABCDEF\n")
  41. # define print_matrix_row(row) print_bin_reverse32(matrix_get_row(row))
  42. # define matrix_bitpop(i) bitpop32(matrix[i])
  43. # define ROW_SHIFTER ((uint32_t)1)
  44. #endif
  45. #define MAIN_ROWMASK 0xFFF0;
  46. #define LOWER_ROWMASK 0x3FC0;
  47. /* matrix state(1:on, 0:off) */
  48. static matrix_row_t matrix[MATRIX_ROWS];
  49. __attribute__ ((weak))
  50. void matrix_init_quantum(void) {
  51. matrix_init_kb();
  52. }
  53. __attribute__ ((weak))
  54. void matrix_scan_quantum(void) {
  55. matrix_scan_kb();
  56. }
  57. __attribute__ ((weak))
  58. void matrix_init_kb(void) {
  59. matrix_init_user();
  60. }
  61. __attribute__ ((weak))
  62. void matrix_scan_kb(void) {
  63. matrix_scan_user();
  64. }
  65. __attribute__ ((weak))
  66. void matrix_init_user(void) {
  67. }
  68. __attribute__ ((weak))
  69. void matrix_scan_user(void) {
  70. }
  71. inline
  72. uint8_t matrix_rows(void) {
  73. return MATRIX_ROWS;
  74. }
  75. inline
  76. uint8_t matrix_cols(void) {
  77. return MATRIX_COLS;
  78. }
  79. void matrix_init(void) {
  80. matrix_init_quantum();
  81. }
  82. uint8_t matrix_scan(void)
  83. {
  84. SERIAL_UART_INIT();
  85. //xprintf("\r\nTRYING TO SCAN");
  86. uint32_t timeout = 0;
  87. //the s character requests the RF slave to send the matrix
  88. SERIAL_UART_DATA = 's';
  89. //trust the external keystates entirely, erase the last data
  90. uint8_t uart_data[11] = {0};
  91. //there are 10 bytes corresponding to 10 columns, and an end byte
  92. for (uint8_t i = 0; i < 11; i++) {
  93. //wait for the serial data, timeout if it's been too long
  94. //this only happened in testing with a loose wire, but does no
  95. //harm to leave it in here
  96. while(!SERIAL_UART_RXD_PRESENT){
  97. timeout++;
  98. if (timeout > 10000){
  99. xprintf("\r\nTime out in keyboard.");
  100. break;
  101. }
  102. }
  103. uart_data[i] = SERIAL_UART_DATA;
  104. }
  105. //check for the end packet, the key state bytes use the LSBs, so 0xE0
  106. //will only show up here if the correct bytes were recieved
  107. uint8_t checksum = 0x00;
  108. for (uint8_t z=0; z<10; z++){
  109. checksum = checksum^uart_data[z];
  110. }
  111. checksum = checksum ^ (uart_data[10] & 0xF0);
  112. // Smash the checksum from 1 byte into 4 bits
  113. checksum = (checksum ^ ((checksum & 0xF0)>>4)) & 0x0F;
  114. //xprintf("\r\nGOT RAW PACKET: \r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d",uart_data[0],uart_data[1],uart_data[2],uart_data[3],uart_data[4],uart_data[5],uart_data[6],uart_data[7],uart_data[8],uart_data[9],uart_data[10],checksum);
  115. if ((uart_data[10] & 0x0F) == checksum) { //this is an arbitrary binary checksum (1001) (that would be 0x9.)
  116. //xprintf("\r\nGOT PACKET: \r\n%d\r\n%d\r\n%d\r\n%d\r\n%d\r\n%d",uart_data[0],uart_data[1],uart_data[2],uart_data[3],uart_data[4],uart_data[5]);
  117. //shifting and transferring the keystates to the QMK matrix variable
  118. //bits 1-12 are row 1, 13-24 are row 2, 25-36 are row 3,
  119. //bits 37-42 are row 4 (only 6 wide, 1-3 are 0, and 10-12 are 0)
  120. //bits 43-48 are row 5 (same as row 4)
  121. /* ASSUMING MSB FIRST */
  122. matrix[0] = (((uint16_t) uart_data[0] << 8) | ((uint16_t) uart_data[1])) & MAIN_ROWMASK;
  123. matrix[1] = ((uint16_t) uart_data[1] << 12) | ((uint16_t) uart_data[2] << 4);
  124. matrix[2] = (((uint16_t) uart_data[3] << 8) | ((uint16_t) uart_data[4])) & MAIN_ROWMASK;
  125. matrix[3] = (((uint16_t) uart_data[4] << 9) | ((uint16_t) uart_data[5] << 1)) & LOWER_ROWMASK;
  126. matrix[4] = (((uint16_t) uart_data[5] << 7) | ((uart_data[10] & 1<<7) ? 1:0) << 13 | ((uart_data[10] & 1<<6) ? 1:0) << 6) & LOWER_ROWMASK;
  127. /* OK, TURNS OUT THAT WAS A BAD ASSUMPTION */
  128. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  129. //I've unpacked these into the mirror image of what QMK expects them to be, so...
  130. /*uint8_t halfOne = (matrix[i]>>8);
  131. uint8_t halfTwo = (matrix[i] & 0xFF);
  132. halfOne = ((halfOne * 0x0802LU & 0x22110LU) | (halfOne * 0x8020LU & 0x88440LU)) * 0x10101LU >> 16;
  133. halfTwo = ((halfTwo * 0x0802LU & 0x22110LU) | (halfTwo * 0x8020LU & 0x88440LU)) * 0x10101LU >> 16;
  134. matrix[i] = ((halfTwo<<8) & halfOne);*/
  135. //matrix[i] = ((matrix[i] * 0x0802LU & 0x22110LU) | (matrix[i] * 0x8020LU & 0x88440LU)) * 0x10101LU >> 16;
  136. matrix[i] = bitrev16(matrix[i]);
  137. //bithack mirror! Doesn't make any sense, but works - and efficiently.
  138. }
  139. //if (uart_data[6]!=0 || uart_data[7]!=0){
  140. //if (maxCount<101){
  141. // xprintf("\r\nMouse data: x=%d, y=%d",(int8_t)uart_data[6],(int8_t)uart_data[7]);
  142. //}
  143. report_mouse_t currentReport = {};
  144. //check for the end packet, bytes 1-4 are movement and scroll
  145. //but byte 5 has bits 0-3 for the scroll button state
  146. //(1000 if pressed, 0000 if not) and bits 4-7 are always 1
  147. //We can use this to verify the report sent properly.
  148. currentReport = pointing_device_get_report();
  149. //shifting and transferring the info to the mouse report varaible
  150. //mouseReport.x = 127 max -127 min
  151. currentReport.x = (int8_t) uart_data[6];
  152. //mouseReport.y = 127 max -127 min
  153. currentReport.y = (int8_t) uart_data[7];
  154. //mouseReport.v = 127 max -127 min (scroll vertical)
  155. currentReport.v = (int8_t) uart_data[8];
  156. //mouseReport.h = 127 max -127 min (scroll horizontal)
  157. currentReport.h = (int8_t) uart_data[9];
  158. /*
  159. currentReport.x = 0;
  160. currentReport.y = 0;
  161. currentReport.v = 0;
  162. currentReport.h = 0;*/
  163. pointing_device_set_report(currentReport);
  164. } else {
  165. //xprintf("\r\nRequested packet, data 10 was %d but checksum was %d",(uart_data[10] & 0x0F), (checksum & 0x0F));
  166. }
  167. //matrix_print();
  168. matrix_scan_quantum();
  169. return 1;
  170. }
  171. inline
  172. bool matrix_is_on(uint8_t row, uint8_t col)
  173. {
  174. return (matrix[row] & ((matrix_row_t)1<<col));
  175. }
  176. inline
  177. matrix_row_t matrix_get_row(uint8_t row)
  178. {
  179. return matrix[row];
  180. }
  181. void matrix_print(void)
  182. {
  183. print_matrix_header();
  184. for (uint8_t row = 0; row < MATRIX_ROWS; row++) {
  185. phex(row); print(": ");
  186. print_matrix_row(row);
  187. print("\n");
  188. }
  189. }
  190. uint8_t matrix_key_count(void)
  191. {
  192. uint8_t count = 0;
  193. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  194. count += matrix_bitpop(i);
  195. }
  196. return count;
  197. }