sym_eager_pk.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146
  1. /*
  2. Copyright 2017 Alex Ong<the.onga@gmail.com>
  3. Copyright 2021 Simon Arlott
  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. /*
  16. Basic per-key algorithm. Uses an 8-bit counter per key.
  17. After pressing a key, it immediately changes state, and sets a counter.
  18. No further inputs are accepted until DEBOUNCE milliseconds have occurred.
  19. */
  20. #include "matrix.h"
  21. #include "timer.h"
  22. #include "quantum.h"
  23. #include <stdlib.h>
  24. #ifdef PROTOCOL_CHIBIOS
  25. # if CH_CFG_USE_MEMCORE == FALSE
  26. # error ChibiOS is configured without a memory allocator. Your keyboard may have set `#define CH_CFG_USE_MEMCORE FALSE`, which is incompatible with this debounce algorithm.
  27. # endif
  28. #endif
  29. #ifndef DEBOUNCE
  30. # define DEBOUNCE 5
  31. #endif
  32. // Maximum debounce: 255ms
  33. #if DEBOUNCE > UINT8_MAX
  34. # undef DEBOUNCE
  35. # define DEBOUNCE UINT8_MAX
  36. #endif
  37. #define ROW_SHIFTER ((matrix_row_t)1)
  38. typedef uint8_t debounce_counter_t;
  39. #if DEBOUNCE > 0
  40. static debounce_counter_t *debounce_counters;
  41. static fast_timer_t last_time;
  42. static bool counters_need_update;
  43. static bool matrix_need_update;
  44. #define DEBOUNCE_ELAPSED 0
  45. static void update_debounce_counters(uint8_t num_rows, uint8_t elapsed_time);
  46. static void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows);
  47. // we use num_rows rather than MATRIX_ROWS to support split keyboards
  48. void debounce_init(uint8_t num_rows) {
  49. debounce_counters = (debounce_counter_t *)malloc(num_rows * MATRIX_COLS * sizeof(debounce_counter_t));
  50. int i = 0;
  51. for (uint8_t r = 0; r < num_rows; r++) {
  52. for (uint8_t c = 0; c < MATRIX_COLS; c++) {
  53. debounce_counters[i++] = DEBOUNCE_ELAPSED;
  54. }
  55. }
  56. }
  57. void debounce_free(void) {
  58. free(debounce_counters);
  59. debounce_counters = NULL;
  60. }
  61. void debounce(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, bool changed) {
  62. bool updated_last = false;
  63. if (counters_need_update) {
  64. fast_timer_t now = timer_read_fast();
  65. fast_timer_t elapsed_time = TIMER_DIFF_FAST(now, last_time);
  66. last_time = now;
  67. updated_last = true;
  68. if (elapsed_time > UINT8_MAX) {
  69. elapsed_time = UINT8_MAX;
  70. }
  71. if (elapsed_time > 0) {
  72. update_debounce_counters(num_rows, elapsed_time);
  73. }
  74. }
  75. if (changed || matrix_need_update) {
  76. if (!updated_last) {
  77. last_time = timer_read_fast();
  78. }
  79. transfer_matrix_values(raw, cooked, num_rows);
  80. }
  81. }
  82. // If the current time is > debounce counter, set the counter to enable input.
  83. static void update_debounce_counters(uint8_t num_rows, uint8_t elapsed_time) {
  84. counters_need_update = false;
  85. matrix_need_update = false;
  86. debounce_counter_t *debounce_pointer = debounce_counters;
  87. for (uint8_t row = 0; row < num_rows; row++) {
  88. for (uint8_t col = 0; col < MATRIX_COLS; col++) {
  89. if (*debounce_pointer != DEBOUNCE_ELAPSED) {
  90. if (*debounce_pointer <= elapsed_time) {
  91. *debounce_pointer = DEBOUNCE_ELAPSED;
  92. matrix_need_update = true;
  93. } else {
  94. *debounce_pointer -= elapsed_time;
  95. counters_need_update = true;
  96. }
  97. }
  98. debounce_pointer++;
  99. }
  100. }
  101. }
  102. // upload from raw_matrix to final matrix;
  103. static void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows) {
  104. debounce_counter_t *debounce_pointer = debounce_counters;
  105. for (uint8_t row = 0; row < num_rows; row++) {
  106. matrix_row_t delta = raw[row] ^ cooked[row];
  107. matrix_row_t existing_row = cooked[row];
  108. for (uint8_t col = 0; col < MATRIX_COLS; col++) {
  109. matrix_row_t col_mask = (ROW_SHIFTER << col);
  110. if (delta & col_mask) {
  111. if (*debounce_pointer == DEBOUNCE_ELAPSED) {
  112. *debounce_pointer = DEBOUNCE;
  113. counters_need_update = true;
  114. existing_row ^= col_mask; // flip the bit.
  115. }
  116. }
  117. debounce_pointer++;
  118. }
  119. cooked[row] = existing_row;
  120. }
  121. }
  122. bool debounce_active(void) { return true; }
  123. #else
  124. # include "none.c"
  125. #endif