eager_pr.c 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
  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. #ifndef DEBOUNCE
  24. #define DEBOUNCE 5
  25. #endif
  26. #define debounce_counter_t uint8_t
  27. static debounce_counter_t *debounce_counters;
  28. #define DEBOUNCE_ELAPSED 251
  29. #define MAX_DEBOUNCE (DEBOUNCE_ELAPSED - 1)
  30. void update_debounce_counters(uint8_t num_rows, uint8_t current_time);
  31. void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, uint8_t current_time);
  32. //we use num_rows rather than MATRIX_ROWS to support split keyboards
  33. void debounce_init(uint8_t num_rows)
  34. {
  35. debounce_counters = (debounce_counter_t*)malloc(num_rows*sizeof(debounce_counter_t));
  36. for (uint8_t r = 0; r < num_rows; r++)
  37. {
  38. debounce_counters[r] = DEBOUNCE_ELAPSED;
  39. }
  40. }
  41. void debounce(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, bool changed)
  42. {
  43. uint8_t current_time = timer_read() % MAX_DEBOUNCE;
  44. update_debounce_counters(num_rows, current_time);
  45. transfer_matrix_values(raw, cooked, num_rows, current_time);
  46. }
  47. //If the current time is > debounce counter, set the counter to enable input.
  48. void update_debounce_counters(uint8_t num_rows, uint8_t current_time)
  49. {
  50. debounce_counter_t *debounce_pointer = debounce_counters;
  51. for (uint8_t row = 0; row < num_rows; row++)
  52. {
  53. if (*debounce_pointer != DEBOUNCE_ELAPSED)
  54. {
  55. if (TIMER_DIFF(current_time, *debounce_pointer, MAX_DEBOUNCE) >= DEBOUNCE) {
  56. *debounce_pointer = DEBOUNCE_ELAPSED;
  57. }
  58. }
  59. debounce_pointer++;
  60. }
  61. }
  62. // upload from raw_matrix to final matrix;
  63. void transfer_matrix_values(matrix_row_t raw[], matrix_row_t cooked[], uint8_t num_rows, uint8_t current_time)
  64. {
  65. debounce_counter_t *debounce_pointer = debounce_counters;
  66. for (uint8_t row = 0; row < num_rows; row++)
  67. {
  68. matrix_row_t existing_row = cooked[row];
  69. matrix_row_t raw_row = raw[row];
  70. //determine new value basd on debounce pointer + raw value
  71. if (*debounce_pointer == DEBOUNCE_ELAPSED &&
  72. (existing_row != raw_row))
  73. {
  74. *debounce_pointer = current_time;
  75. existing_row = raw_row;
  76. }
  77. cooked[row] = existing_row;
  78. debounce_pointer++;
  79. }
  80. }
  81. bool debounce_active(void)
  82. {
  83. return true;
  84. }