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.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.

matrix.c 4.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. /*
  2. Copyright 2014 Kai Ryu <[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 "debug.h"
  23. #include "util.h"
  24. #include "matrix.h"
  25. #ifndef DEBOUNCE
  26. # define DEBOUNCE 5
  27. #endif
  28. static uint8_t debouncing = DEBOUNCE;
  29. /* matrix state(1:on, 0:off) */
  30. static matrix_row_t matrix[MATRIX_ROWS];
  31. static matrix_row_t matrix_debouncing[MATRIX_ROWS];
  32. static matrix_row_t read_cols(void);
  33. static void init_cols(void);
  34. static void init_rows(void);
  35. static void select_row(uint8_t row);
  36. inline
  37. uint8_t matrix_rows(void)
  38. {
  39. return MATRIX_ROWS;
  40. }
  41. inline
  42. uint8_t matrix_cols(void)
  43. {
  44. return MATRIX_COLS;
  45. }
  46. void matrix_init(void)
  47. {
  48. // disable JTAG
  49. MCUCR = (1<<JTD);
  50. MCUCR = (1<<JTD);
  51. // initialize row and col
  52. init_rows();
  53. init_cols();
  54. // initialize matrix state: all keys off
  55. for (uint8_t i=0; i < MATRIX_ROWS; i++) {
  56. matrix[i] = 0;
  57. matrix_debouncing[i] = 0;
  58. }
  59. }
  60. uint8_t matrix_scan(void)
  61. {
  62. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  63. select_row(i);
  64. _delay_us(30); // without this wait read unstable value.
  65. matrix_row_t cols = read_cols();
  66. if (matrix_debouncing[i] != cols) {
  67. matrix_debouncing[i] = cols;
  68. if (debouncing) {
  69. debug("bounce!: "); debug_hex(debouncing); debug("\n");
  70. }
  71. debouncing = DEBOUNCE;
  72. }
  73. // select next row
  74. select_row((i + 1) % MATRIX_ROWS);
  75. }
  76. if (debouncing) {
  77. if (--debouncing) {
  78. _delay_ms(1);
  79. } else {
  80. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  81. matrix[i] = matrix_debouncing[i];
  82. }
  83. }
  84. }
  85. return 1;
  86. }
  87. bool matrix_is_modified(void)
  88. {
  89. if (debouncing) return false;
  90. return true;
  91. }
  92. inline
  93. bool matrix_is_on(uint8_t row, uint8_t col)
  94. {
  95. return (matrix[row] & ((matrix_row_t)1<<col));
  96. }
  97. inline
  98. matrix_row_t matrix_get_row(uint8_t row)
  99. {
  100. return matrix[row];
  101. }
  102. void matrix_print(void)
  103. {
  104. print("\nr/c 0123456789ABCDEF\n");
  105. for (uint8_t row = 0; row < MATRIX_ROWS; row++) {
  106. phex(row); print(": ");
  107. pbin_reverse16(matrix_get_row(row));
  108. print("\n");
  109. }
  110. }
  111. uint8_t matrix_key_count(void)
  112. {
  113. uint8_t count = 0;
  114. for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
  115. count += bitpop16(matrix[i]);
  116. }
  117. return count;
  118. }
  119. /* Column pin configuration
  120. * col: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
  121. * pin: F4 F1 F0 B3 D0 D1 D4 D5 D6 D7 F7 F6 D2 D3 B6 B5 B4 F5
  122. */
  123. static void init_cols(void)
  124. {
  125. // Input with pull-up(DDR:0, PORT:1)
  126. DDRF &= ~(1<<PF7 | 1<<PF6 | 1<<PF5 | 1<<PF4 | 1<<PF1 | 1<<PF0);
  127. PORTF |= (1<<PF7 | 1<<PF6 | 1<<PF5 | 1<<PF4 | 1<<PF1 | 1<<PF0);
  128. DDRD &= ~(1<<PD7 | 1<<PD6 | 1<<PD5 | 1<<PD4 | 1<<PD3 | 1<<PD2 | 1<<PD1 | 1<<PD0);
  129. PORTD |= (1<<PD7 | 1<<PD6 | 1<<PD5 | 1<<PD4 | 1<<PD3 | 1<<PD2 | 1<<PD1 | 1<<PD0);
  130. DDRB &= ~(1<<PB6 | 1<<PB5 | 1<<PB4 | 1<<PB3);
  131. PORTB |= (1<<PB6 | 1<<PB5 | 1<<PB4 | 1<<PB3);
  132. }
  133. static matrix_row_t read_cols(void)
  134. {
  135. return (PINF&(1<<PF4) ? 0 : (1<<0)) |
  136. (PINF&(1<<PF1) ? 0 : (1<<1)) |
  137. (PINF&(1<<PF0) ? 0 : (1<<2)) |
  138. (PINB&(1<<PB3) ? 0 : (1<<3)) |
  139. (PIND&(1<<PD0) ? 0 : (1<<4)) |
  140. (PIND&(1<<PD1) ? 0 : (1<<5)) |
  141. (PIND&(1<<PD4) ? 0 : (1<<6)) |
  142. (PIND&(1<<PD5) ? 0 : (1<<7)) |
  143. (PIND&(1<<PD6) ? 0 : (1<<8)) |
  144. (PIND&(1<<PD7) ? 0 : (1<<9)) |
  145. (PINF&(1<<PF7) ? 0 : (1<<10)) |
  146. (PINF&(1<<PF6) ? 0 : (1<<11)) |
  147. (PIND&(1<<PD2) ? 0 : (1<<12)) |
  148. (PIND&(1<<PD3) ? 0 : (1<<13)) |
  149. (PINB&(1<<PB6) ? 0 : (1<<14)) |
  150. (PINB&(1<<PB5) ? 0 : (1UL<<15)) |
  151. (PINB&(1<<PB4) ? 0 : (1UL<<16)) |
  152. (PINF&(1<<PF5) ? 0 : (1UL<<17));
  153. }
  154. /* Row pin configuration
  155. * row: 0 1 2 3 4 5 x
  156. * pin: B2 0 1 0 1 0 1 1
  157. * B1 0 0 1 1 0 0 1
  158. * B0 0 0 0 0 1 1 1
  159. */
  160. static void init_rows(void)
  161. {
  162. DDRB |= (1<<PB2 | 1<<PB1 | 1<<PB0);
  163. }
  164. static void select_row(uint8_t row)
  165. {
  166. (row & (1<<0)) ? (PORTB |= (1<<PB2)) : (PORTB &= ~(1<<PB2));
  167. (row & (1<<1)) ? (PORTB |= (1<<PB1)) : (PORTB &= ~(1<<PB1));
  168. (row & (1<<2)) ? (PORTB |= (1<<PB0)) : (PORTB &= ~(1<<PB0));
  169. }