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.

136 lines
3.8 KiB

  1. /* Copyright 2021 Balz Guenat
  2. *
  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. *
  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. *
  13. * You should have received a copy of the GNU General Public License
  14. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  15. */
  16. #include "gtest/gtest.h"
  17. #include "gmock/gmock.h"
  18. #include <vector>
  19. #include <algorithm>
  20. #include <stdio.h>
  21. extern "C" {
  22. #include "encoder.h"
  23. #include "encoder/tests/mock_split.h"
  24. }
  25. struct update {
  26. int8_t index;
  27. bool clockwise;
  28. };
  29. uint8_t updates_array_idx = 0;
  30. update updates[32];
  31. bool isMaster;
  32. bool isLeftHand;
  33. extern "C" {
  34. bool is_keyboard_master(void) {
  35. return isMaster;
  36. }
  37. bool encoder_update_kb(uint8_t index, bool clockwise) {
  38. if (!is_keyboard_master()) {
  39. // this method has no effect on slave half
  40. printf("ignoring update on slave (%d,%s)\n", index, clockwise ? "CW" : "CC");
  41. return true;
  42. }
  43. updates[updates_array_idx % 32] = {index, clockwise};
  44. updates_array_idx++;
  45. return true;
  46. }
  47. };
  48. bool setAndRead(pin_t pin, bool val) {
  49. setPin(pin, val);
  50. return encoder_task();
  51. }
  52. class EncoderSplitTestNoRight : public ::testing::Test {
  53. protected:
  54. void SetUp() override {
  55. updates_array_idx = 0;
  56. for (int i = 0; i < 32; i++) {
  57. pinIsInputHigh[i] = 0;
  58. pins[i] = 0;
  59. }
  60. }
  61. };
  62. TEST_F(EncoderSplitTestNoRight, TestInitLeft) {
  63. isLeftHand = true;
  64. encoder_init();
  65. EXPECT_EQ(pinIsInputHigh[0], true);
  66. EXPECT_EQ(pinIsInputHigh[1], true);
  67. EXPECT_EQ(pinIsInputHigh[2], true);
  68. EXPECT_EQ(pinIsInputHigh[3], true);
  69. EXPECT_EQ(updates_array_idx, 0); // no updates received
  70. }
  71. TEST_F(EncoderSplitTestNoRight, TestInitRight) {
  72. isLeftHand = false;
  73. encoder_init();
  74. EXPECT_EQ(pinIsInputHigh[0], false);
  75. EXPECT_EQ(pinIsInputHigh[1], false);
  76. EXPECT_EQ(pinIsInputHigh[2], false);
  77. EXPECT_EQ(pinIsInputHigh[3], false);
  78. EXPECT_EQ(updates_array_idx, 0); // no updates received
  79. }
  80. TEST_F(EncoderSplitTestNoRight, TestOneClockwiseLeftMaster) {
  81. isMaster = true;
  82. isLeftHand = true;
  83. encoder_init();
  84. // send 4 pulses. with resolution 4, that's one step and we should get 1 update.
  85. setAndRead(2, false);
  86. setAndRead(3, false);
  87. setAndRead(2, true);
  88. setAndRead(3, true);
  89. EXPECT_EQ(updates_array_idx, 1); // one update received
  90. EXPECT_EQ(updates[0].index, 1);
  91. EXPECT_EQ(updates[0].clockwise, true);
  92. int events_queued = 0;
  93. encoder_events_t events;
  94. encoder_retrieve_events(&events);
  95. while (events.tail != events.head) {
  96. events.tail = (events.tail + 1) % MAX_QUEUED_ENCODER_EVENTS;
  97. ++events_queued;
  98. }
  99. EXPECT_EQ(events_queued, 0); // No events should be queued on master
  100. }
  101. TEST_F(EncoderSplitTestNoRight, TestOneClockwiseRightSlave) {
  102. isMaster = false;
  103. isLeftHand = true;
  104. encoder_init();
  105. // send 4 pulses. with resolution 4, that's one step and we should get 1 update.
  106. setAndRead(2, false);
  107. setAndRead(3, false);
  108. setAndRead(2, true);
  109. setAndRead(3, true);
  110. EXPECT_EQ(updates_array_idx, 0); // no updates received
  111. int events_queued = 0;
  112. encoder_events_t events;
  113. encoder_retrieve_events(&events);
  114. while (events.tail != events.head) {
  115. events.tail = (events.tail + 1) % MAX_QUEUED_ENCODER_EVENTS;
  116. ++events_queued;
  117. }
  118. EXPECT_EQ(events_queued, 1); // One event should be queued on slave
  119. }