sym_eager_pr.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116
  1. /*
  2. Copyright 2019 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-row algorithm. Uses an 8-bit counter per row.
  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. #ifdef PROTOCOL_CHIBIOS
  24. # if CH_CFG_USE_MEMCORE == FALSE
  25. # 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.
  26. # endif
  27. #endif
  28. #ifndef DEBOUNCE
  29. # define DEBOUNCE 5
  30. #endif
  31. #define debounce_counter_t uint8_t
  32. static bool matrix_need_update;
  33. static debounce_counter_t *debounce_counters;
  34. static bool counters_need_update;
  35. #define DEBOUNCE_ELAPSED 251
  36. #define MAX_DEBOUNCE (DEBOUNCE_ELAPSED - 1)
  37. static uint8_t wrapping_timer_read(void) {
  38. static uint16_t time = 0;
  39. static uint8_t last_result = 0;
  40. uint16_t new_time = timer_read();
  41. uint16_t diff = new_time - time;
  42. time = new_time;
  43. last_result = (last_result + diff) % (MAX_DEBOUNCE + 1);
  44. return last_result;
  45. }
  46. void update_debounce_counters(uint8_t num_rows, uint8_t current_time);
  47. void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, uint8_t current_time);
  48. // we use num_rows rather than MATRIX_ROWS to support split keyboards
  49. void debounce_init(uint8_t num_rows) {
  50. debounce_counters = (debounce_counter_t *)malloc(num_rows * sizeof(debounce_counter_t));
  51. for (uint8_t r = 0; r < num_rows; r++) {
  52. debounce_counters[r] = DEBOUNCE_ELAPSED;
  53. }
  54. }
  55. void debounce(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, bool changed) {
  56. uint8_t current_time = wrapping_timer_read();
  57. bool needed_update = counters_need_update;
  58. if (counters_need_update) {
  59. update_debounce_counters(num_rows, current_time);
  60. }
  61. if (changed || (needed_update && !counters_need_update) || matrix_need_update) {
  62. transfer_matrix_values(raw, cooked, num_rows, current_time);
  63. }
  64. }
  65. // If the current time is > debounce counter, set the counter to enable input.
  66. void update_debounce_counters(uint8_t num_rows, uint8_t current_time) {
  67. counters_need_update = false;
  68. debounce_counter_t *debounce_pointer = debounce_counters;
  69. for (uint8_t row = 0; row < num_rows; row++) {
  70. if (*debounce_pointer != DEBOUNCE_ELAPSED) {
  71. if (TIMER_DIFF(current_time, *debounce_pointer, MAX_DEBOUNCE) >= DEBOUNCE) {
  72. *debounce_pointer = DEBOUNCE_ELAPSED;
  73. } else {
  74. counters_need_update = true;
  75. }
  76. }
  77. debounce_pointer++;
  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 existing_row = cooked[row];
  86. matrix_row_t raw_row = raw[row];
  87. // determine new value basd on debounce pointer + raw value
  88. if (existing_row != raw_row) {
  89. if (*debounce_pointer == DEBOUNCE_ELAPSED) {
  90. *debounce_pointer = current_time;
  91. cooked[row] = raw_row;
  92. counters_need_update = true;
  93. } else {
  94. matrix_need_update = true;
  95. }
  96. }
  97. debounce_pointer++;
  98. }
  99. }
  100. bool debounce_active(void) { return true; }