Archived
1
0
This repo is archived. You can view files and clone it, but cannot push or open issues or pull requests.
keybrd/examples/debounce_unit_test.cpp

123 lines
4.0 KiB
C++
Raw Normal View History

2016-06-01 14:33:28 +00:00
/* test debounce() function. 16/6/1 Passed test for SAMPLE_COUNT 1, 2, and 4.
copied from keybrd/src/Row::debounce()
to run test:
$ g++ debounce_unit_test.cpp
$ ./a.out
*/
#include <inttypes.h>
#include <iostream>
#define SAMPLE_COUNT 4 //number of consecutive equal bits needed to change a debounced bit
uint8_t samples[SAMPLE_COUNT]; //bitwise, one bit per key, most recent readings
uint8_t samplesIndex = 0; //samples[] current write index
uint8_t previousDebounced = 0; //bitwise, one bit per key
2016-06-01 14:33:28 +00:00
uint8_t isFallingEdge; //1 means falling edge
uint8_t isRisingEdge; //1 means rising edge
uint8_t debounce(const uint8_t rowState, uint8_t& debounced)
2016-06-01 14:33:28 +00:00
{
uint8_t debouncedChanged; //bitwise
2016-06-01 14:33:28 +00:00
uint8_t all_1 = ~0; //bitwise
uint8_t all_0 = 0; //bitwise
//delayMicroseconds(DELAY_MICROSECONDS); //delay between Row scans to debounce key
2016-06-01 14:33:28 +00:00
samples[samplesIndex] = rowState; //insert rowState into samples[] ring buffer
if (++samplesIndex >= SAMPLE_COUNT) //if end of ring buffer
{
samplesIndex = 0; //wrap samplesIndex to beginning of ring buffer
}
for (uint8_t j = 0; j < SAMPLE_COUNT; j++) //traverse the sample[] ring buffer
{
all_1 &= samples[j]; //1 if all samples are 1
all_0 |= samples[j]; //0 if all samples are 0
}
// update newDebounce if all the samples agree with one another
// if all samples=1 then debounced=1
// elseif all samples=0 then debounced=0
// else debounced=previousDebounced i.e. no change
debounced = all_1 | (all_0 & previousDebounced);
debouncedChanged = debounced xor previousDebounced;
previousDebounced = debounced;
return debouncedChanged;
}
void pressRelease(const uint8_t debouncedChanged)
{
//bit=1 if last debounced changed from 1 to 0, else bit=0
isFallingEdge = debouncedChanged & ~previousDebounced;
//bit=1 if last debounced changed from 0 to 1, else bit=0
isRisingEdge = debouncedChanged & previousDebounced;
2016-06-01 14:33:28 +00:00
}
int main()
{
//Test input and output only shows first bit of each byte.
const uint8_t pressed[] = {1,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0};
const uint8_t bouncy[] = {1,0,0,0,0,1,0,0,1,1,1,1,0,1,1,1,1,0,0,0,0};
const uint8_t expectDebounced[]= {0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0};
2016-06-01 14:33:28 +00:00
const uint8_t SCAN_COUNT = sizeof(bouncy)/sizeof(*bouncy);
uint8_t i;
uint8_t debounced; //1 means pressed, 0 means released
uint8_t debouncedChanged; //1 means debounced changed
2016-06-01 14:33:28 +00:00
std::cout << "button pressed: ";
2016-06-01 14:33:28 +00:00
for (i=0; i<SCAN_COUNT; i++)
{
std::cout << (int)pressed[i];
}
std::cout << std::endl;
std::cout << "bouncy signal: ";
2016-06-01 14:33:28 +00:00
for (i=0; i<SCAN_COUNT; i++)
{
std::cout << (int)bouncy[i];
}
std::cout << std::endl;
std::cout << "debounced signal: ";
for (i=0; i<SCAN_COUNT; i++)
{
debouncedChanged = debounce(bouncy[i], debounced);
//pressRelease(debouncedChanged);
std::cout << (int)debounced;
}
std::cout << std::endl;
std::cout << "expected debounced signal: ";
for (i=0; i<SCAN_COUNT; i++)
{
std::cout << (int)expectDebounced[i];
}
std::cout << std::endl;
std::cout << "isFallingEdge: ";
for (i=0; i<SCAN_COUNT; i++)
{
debouncedChanged = debounce(bouncy[i], debounced);
pressRelease(debouncedChanged);
std::cout << (int)isFallingEdge;
}
std::cout << std::endl;
std::cout << "isRisingEdge: ";
2016-06-01 14:33:28 +00:00
for (i=0; i<SCAN_COUNT; i++)
{
debouncedChanged = debounce(bouncy[i], debounced);
pressRelease(debouncedChanged);
std::cout << (int)isRisingEdge;
2016-06-01 14:33:28 +00:00
}
std::cout << std::endl;
}
void loop() { }