eager_pk.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. /*
  2. Copyright 2017 Alex Ong<the.onga@gmail.com>
  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. Basic per-key algorithm. Uses an 8-bit counter per key.
  16. After pressing a key, it immediately changes state, and sets a counter.
  17. No further inputs are accepted until DEBOUNCE milliseconds have occurred.
  18. */
  19. #include "matrix.h"
  20. #include "timer.h"
  21. #include "quantum.h"
  22. #include <stdlib.h>
  23. #ifndef DEBOUNCE
  24. # define DEBOUNCE 5
  25. #endif
  26. #define ROW_SHIFTER ((matrix_row_t)1)
  27. #define debounce_counter_t uint8_t
  28. static debounce_counter_t *debounce_counters;
  29. static bool counters_need_update;
  30. static bool matrix_need_update;
  31. #define DEBOUNCE_ELAPSED 251
  32. #define MAX_DEBOUNCE (DEBOUNCE_ELAPSED - 1)
  33. static uint8_t wrapping_timer_read(void) {
  34. static uint16_t time = 0;
  35. static uint8_t last_result = 0;
  36. uint16_t new_time = timer_read();
  37. uint16_t diff = new_time - time;
  38. time = new_time;
  39. last_result = (last_result + diff) % (MAX_DEBOUNCE + 1);
  40. return last_result;
  41. }
  42. void update_debounce_counters(uint8_t num_rows, uint8_t current_time);
  43. void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, uint8_t current_time);
  44. // we use num_rows rather than MATRIX_ROWS to support split keyboards
  45. void debounce_init(uint8_t num_rows) {
  46. debounce_counters = (debounce_counter_t *)malloc(num_rows * MATRIX_COLS * sizeof(debounce_counter_t));
  47. int i = 0;
  48. for (uint8_t r = 0; r < num_rows; r++) {
  49. for (uint8_t c = 0; c < MATRIX_COLS; c++) {
  50. debounce_counters[i++] = DEBOUNCE_ELAPSED;
  51. }
  52. }
  53. }
  54. void debounce(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, bool changed) {
  55. uint8_t current_time = wrapping_timer_read();
  56. if (counters_need_update) {
  57. update_debounce_counters(num_rows, current_time);
  58. }
  59. if (changed || matrix_need_update) {
  60. transfer_matrix_values(raw, cooked, num_rows, current_time);
  61. }
  62. }
  63. // If the current time is > debounce counter, set the counter to enable input.
  64. void update_debounce_counters(uint8_t num_rows, uint8_t current_time) {
  65. counters_need_update = false;
  66. debounce_counter_t *debounce_pointer = debounce_counters;
  67. for (uint8_t row = 0; row < num_rows; row++) {
  68. for (uint8_t col = 0; col < MATRIX_COLS; col++) {
  69. if (*debounce_pointer != DEBOUNCE_ELAPSED) {
  70. if (TIMER_DIFF(current_time, *debounce_pointer, MAX_DEBOUNCE) >= DEBOUNCE) {
  71. *debounce_pointer = DEBOUNCE_ELAPSED;
  72. } else {
  73. counters_need_update = true;
  74. }
  75. }
  76. debounce_pointer++;
  77. }
  78. }
  79. }
  80. // upload from raw_matrix to final matrix;
  81. void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, uint8_t current_time) {
  82. matrix_need_update = false;
  83. debounce_counter_t *debounce_pointer = debounce_counters;
  84. for (uint8_t row = 0; row < num_rows; row++) {
  85. matrix_row_t delta = raw[row] ^ cooked[row];
  86. matrix_row_t existing_row = cooked[row];
  87. for (uint8_t col = 0; col < MATRIX_COLS; col++) {
  88. matrix_row_t col_mask = (ROW_SHIFTER << col);
  89. if (delta & col_mask) {
  90. if (*debounce_pointer == DEBOUNCE_ELAPSED) {
  91. *debounce_pointer = current_time;
  92. counters_need_update = true;
  93. existing_row ^= col_mask; // flip the bit.
  94. } else {
  95. matrix_need_update = true;
  96. }
  97. }
  98. debounce_pointer++;
  99. }
  100. cooked[row] = existing_row;
  101. }
  102. }
  103. bool debounce_active(void) { return true; }