2015-10-27 02:32:37 +06:00
|
|
|
/*
|
2015-10-27 04:54:46 +06:00
|
|
|
|
|
|
|
|
2015-10-27 02:32:37 +06:00
|
|
|
Copyright 2013 Oleg Kostyuk <cub.uanic@gmail.com>
|
|
|
|
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* scan matrix
|
|
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdbool.h>
|
|
|
|
#include <avr/io.h>
|
2016-07-04 22:13:41 +06:00
|
|
|
#include "wait.h"
|
2015-10-27 02:32:37 +06:00
|
|
|
#include "action_layer.h"
|
|
|
|
#include "print.h"
|
|
|
|
#include "debug.h"
|
|
|
|
#include "util.h"
|
|
|
|
#include "matrix.h"
|
2019-04-04 03:45:55 +06:00
|
|
|
#include "debounce.h"
|
2017-08-24 08:29:07 +06:00
|
|
|
#include QMK_KEYBOARD_H
|
2019-10-10 04:23:57 +06:00
|
|
|
|
2016-07-06 10:24:31 +06:00
|
|
|
/*
|
2019-04-04 03:45:55 +06:00
|
|
|
* This constant define not debouncing time in msecs, assuming eager_pr.
|
2016-07-06 10:24:31 +06:00
|
|
|
*
|
|
|
|
* On Ergodox matrix scan rate is relatively low, because of slow I2C.
|
|
|
|
* Now it's only 317 scans/second, or about 3.15 msec/scan.
|
|
|
|
* According to Cherry specs, debouncing time is 5 msec.
|
|
|
|
*
|
improve ergodox ez performance
With these changes, the ergodox ez goes from 315 scans per second
when no keys are pressed (~3.17ms/scan) to 447 (~2.24ms/scan).
The changes to the pin read are just condensing the logic, and
replacing a lot of conditional operations with a single bitwise
inversion.
The change to row scanning is more significant, and merits
explanation. In general, you can only scan one row of a keyboard
at a time, because if you scan two rows, you no longer know
which row is pulling a given column down. But in the Ergodox
design, this isn't the case; the left hand is controlled by an
I2C-based GPIO expander, and the columns and rows are *completely
separate* electrically from the columns and rows on the right-hand
side.
So simply reading rows in parallel offers two significant
improvements. One is that we no longer need the 30us delay after
each right-hand row, because we're spending more than 30us
communicating with the left hand over i2c. Another is that we're
no longer wastefully sending i2c messages to the left hand
to unselect rows when no rows had actually been selected in the
first place. These delays were, between them, coming out to
nearly 30% of the time spent in each scan.
Signed-off-by: seebs <seebs@seebs.net>
2017-11-19 04:11:26 +06:00
|
|
|
* However, some switches seem to have higher debouncing requirements, or
|
|
|
|
* something else might be wrong. (Also, the scan speed has improved since
|
|
|
|
* that comment was written.)
|
2016-07-06 10:24:31 +06:00
|
|
|
*/
|
|
|
|
|
2015-10-27 02:32:37 +06:00
|
|
|
/* matrix state(1:on, 0:off) */
|
2019-04-04 03:45:55 +06:00
|
|
|
static matrix_row_t raw_matrix[MATRIX_ROWS]; // raw values
|
|
|
|
static matrix_row_t matrix[MATRIX_ROWS]; // debounced values
|
2015-10-27 02:32:37 +06:00
|
|
|
|
|
|
|
static matrix_row_t read_cols(uint8_t row);
|
2019-04-04 03:45:55 +06:00
|
|
|
static void init_cols(void);
|
|
|
|
static void unselect_rows(void);
|
|
|
|
static void select_row(uint8_t row);
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2018-06-13 00:27:22 +06:00
|
|
|
static uint8_t mcp23018_reset_loop;
|
|
|
|
// static uint16_t mcp23018_reset_loop;
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
__attribute__((weak)) void matrix_init_user(void) {}
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
__attribute__((weak)) void matrix_scan_user(void) {}
|
2016-06-24 09:14:21 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
__attribute__((weak)) void matrix_init_kb(void) { matrix_init_user(); }
|
2016-06-24 09:14:21 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
__attribute__((weak)) void matrix_scan_kb(void) { matrix_scan_user(); }
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
inline uint8_t matrix_rows(void) { return MATRIX_ROWS; }
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
inline uint8_t matrix_cols(void) { return MATRIX_COLS; }
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
void matrix_init(void) {
|
|
|
|
// initialize row and col
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
mcp23018_status = init_mcp23018();
|
2015-10-27 04:54:46 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
unselect_rows();
|
|
|
|
init_cols();
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
// initialize matrix state: all keys off
|
|
|
|
for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
|
|
|
|
matrix[i] = 0;
|
2019-05-16 05:53:45 +06:00
|
|
|
raw_matrix[i] = 0;
|
2019-04-04 03:45:55 +06:00
|
|
|
}
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
debounce_init(MATRIX_ROWS);
|
|
|
|
matrix_init_quantum();
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2016-06-18 08:06:58 +06:00
|
|
|
void matrix_power_up(void) {
|
2019-04-04 03:45:55 +06:00
|
|
|
mcp23018_status = init_mcp23018();
|
2016-06-18 08:06:58 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
unselect_rows();
|
|
|
|
init_cols();
|
2016-06-18 08:06:58 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
// initialize matrix state: all keys off
|
|
|
|
for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
|
|
|
|
matrix[i] = 0;
|
|
|
|
}
|
Change to per-key eager debouncing for ErgoDox EZ.
Empirically, waiting for N consecutive identical scans as a debouncing
strategy doesn't work very well for the ErgoDox EZ where scans are very
slow compared to most keyboards. Instead, debounce the signals by
eagerly reporting a change as soon as one scan observes it, but then
ignoring further changes from that key for the next N scans.
This is implemented by keeping an extra matrix of uint8 countdowns, such
that only keys whose countdown is currently zero are eligible to change.
When we do observe a change, we bump that key's countdown to DEBOUNCE.
During each scan, every nonzero countdown is decremented.
With this approach to debouncing, much higher debounce constants are
tolerable, because latency does not increase with the constant, and
debounce countdowns on one key do not interfere with events on other
keys. The only negative effect of increasing the constant is that the
minimum duration of a keypress increases. Perhaps I'm just extremely
unlucky w.r.t. key switch quality, but I saw occasional bounces even
with DEBOUNCE=10; with 15, I've seen none so far. That's around 47ms,
which seems like an absolutely insane amount of time for a key to be
bouncy, but at least it works.
2017-04-27 04:29:39 +06:00
|
|
|
}
|
2016-06-18 08:06:58 +06:00
|
|
|
|
2019-04-09 10:52:38 +06:00
|
|
|
// Reads and stores a row, returning
|
|
|
|
// whether a change occurred.
|
|
|
|
static inline bool store_raw_matrix_row(uint8_t index) {
|
|
|
|
matrix_row_t temp = read_cols(index);
|
|
|
|
if (raw_matrix[index] != temp) {
|
|
|
|
raw_matrix[index] = temp;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
uint8_t matrix_scan(void) {
|
|
|
|
if (mcp23018_status) { // if there was an error
|
|
|
|
if (++mcp23018_reset_loop == 0) {
|
|
|
|
// if (++mcp23018_reset_loop >= 1300) {
|
|
|
|
// since mcp23018_reset_loop is 8 bit - we'll try to reset once in 255 matrix scans
|
|
|
|
// this will be approx bit more frequent than once per second
|
|
|
|
print("trying to reset mcp23018\n");
|
|
|
|
mcp23018_status = init_mcp23018();
|
|
|
|
if (mcp23018_status) {
|
|
|
|
print("left side not responding\n");
|
|
|
|
} else {
|
|
|
|
print("left side attached\n");
|
|
|
|
ergodox_blink_all_leds();
|
2020-01-02 12:42:04 +06:00
|
|
|
#ifdef RGB_MATRIX_ENABLE
|
|
|
|
rgb_matrix_init(); // re-init driver on reconnect
|
|
|
|
#endif
|
2019-04-04 03:45:55 +06:00
|
|
|
}
|
Change to per-key eager debouncing for ErgoDox EZ.
Empirically, waiting for N consecutive identical scans as a debouncing
strategy doesn't work very well for the ErgoDox EZ where scans are very
slow compared to most keyboards. Instead, debounce the signals by
eagerly reporting a change as soon as one scan observes it, but then
ignoring further changes from that key for the next N scans.
This is implemented by keeping an extra matrix of uint8 countdowns, such
that only keys whose countdown is currently zero are eligible to change.
When we do observe a change, we bump that key's countdown to DEBOUNCE.
During each scan, every nonzero countdown is decremented.
With this approach to debouncing, much higher debounce constants are
tolerable, because latency does not increase with the constant, and
debounce countdowns on one key do not interfere with events on other
keys. The only negative effect of increasing the constant is that the
minimum duration of a keypress increases. Perhaps I'm just extremely
unlucky w.r.t. key switch quality, but I saw occasional bounces even
with DEBOUNCE=10; with 15, I've seen none so far. That's around 47ms,
which seems like an absolutely insane amount of time for a key to be
bouncy, but at least it works.
2017-04-27 04:29:39 +06:00
|
|
|
}
|
|
|
|
}
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2017-10-21 05:53:59 +06:00
|
|
|
#ifdef LEFT_LEDS
|
2019-04-04 03:45:55 +06:00
|
|
|
mcp23018_status = ergodox_left_leds_update();
|
|
|
|
#endif // LEFT_LEDS
|
2019-05-16 05:53:45 +06:00
|
|
|
bool changed = false;
|
2019-04-04 03:45:55 +06:00
|
|
|
for (uint8_t i = 0; i < MATRIX_ROWS_PER_SIDE; i++) {
|
|
|
|
// select rows from left and right hands
|
2019-04-09 10:52:38 +06:00
|
|
|
uint8_t left_index = i;
|
|
|
|
uint8_t right_index = i + MATRIX_ROWS_PER_SIDE;
|
|
|
|
select_row(left_index);
|
|
|
|
select_row(right_index);
|
2019-04-04 03:45:55 +06:00
|
|
|
|
|
|
|
// we don't need a 30us delay anymore, because selecting a
|
|
|
|
// left-hand row requires more than 30us for i2c.
|
2019-05-16 05:53:45 +06:00
|
|
|
|
2019-04-09 10:52:38 +06:00
|
|
|
changed |= store_raw_matrix_row(left_index);
|
|
|
|
changed |= store_raw_matrix_row(right_index);
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
unselect_rows();
|
|
|
|
}
|
2019-05-16 05:53:45 +06:00
|
|
|
|
2019-04-09 10:52:38 +06:00
|
|
|
debounce(raw_matrix, matrix, MATRIX_ROWS, changed);
|
2019-04-04 03:45:55 +06:00
|
|
|
matrix_scan_quantum();
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
return 1;
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
bool matrix_is_modified(void) // deprecated and evidently not called.
|
2015-10-27 02:32:37 +06:00
|
|
|
{
|
2019-04-04 03:45:55 +06:00
|
|
|
return true;
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
inline bool matrix_is_on(uint8_t row, uint8_t col) { return (matrix[row] & ((matrix_row_t)1 << col)); }
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
inline matrix_row_t matrix_get_row(uint8_t row) { return matrix[row]; }
|
2015-10-27 02:32:37 +06:00
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
void matrix_print(void) {
|
|
|
|
print("\nr/c 0123456789ABCDEF\n");
|
|
|
|
for (uint8_t row = 0; row < MATRIX_ROWS; row++) {
|
|
|
|
phex(row);
|
|
|
|
print(": ");
|
|
|
|
pbin_reverse16(matrix_get_row(row));
|
|
|
|
print("\n");
|
|
|
|
}
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
uint8_t matrix_key_count(void) {
|
|
|
|
uint8_t count = 0;
|
|
|
|
for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
|
|
|
|
count += bitpop16(matrix[i]);
|
|
|
|
}
|
|
|
|
return count;
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Column pin configuration
|
|
|
|
*
|
|
|
|
* Teensy
|
|
|
|
* col: 0 1 2 3 4 5
|
2015-10-27 04:54:46 +06:00
|
|
|
* pin: F0 F1 F4 F5 F6 F7
|
2015-10-27 02:32:37 +06:00
|
|
|
*
|
|
|
|
* MCP23018
|
|
|
|
* col: 0 1 2 3 4 5
|
2015-10-27 04:54:46 +06:00
|
|
|
* pin: B5 B4 B3 B2 B1 B0
|
2015-10-27 02:32:37 +06:00
|
|
|
*/
|
2019-04-04 03:45:55 +06:00
|
|
|
static void init_cols(void) {
|
|
|
|
// init on mcp23018
|
|
|
|
// not needed, already done as part of init_mcp23018()
|
|
|
|
|
|
|
|
// init on teensy
|
|
|
|
// Input with pull-up(DDR:0, PORT:1)
|
|
|
|
DDRF &= ~(1 << 7 | 1 << 6 | 1 << 5 | 1 << 4 | 1 << 1 | 1 << 0);
|
|
|
|
PORTF |= (1 << 7 | 1 << 6 | 1 << 5 | 1 << 4 | 1 << 1 | 1 << 0);
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
static matrix_row_t read_cols(uint8_t row) {
|
|
|
|
if (row < 7) {
|
|
|
|
if (mcp23018_status) { // if there was an error
|
|
|
|
return 0;
|
2015-10-27 02:32:37 +06:00
|
|
|
} else {
|
2019-04-04 03:45:55 +06:00
|
|
|
uint8_t data = 0;
|
|
|
|
mcp23018_status = i2c_start(I2C_ADDR_WRITE, ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
mcp23018_status = i2c_write(GPIOB, ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
mcp23018_status = i2c_start(I2C_ADDR_READ, ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
mcp23018_status = i2c_read_nack(ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status < 0) goto out;
|
|
|
|
data = ~((uint8_t)mcp23018_status);
|
|
|
|
mcp23018_status = I2C_STATUS_SUCCESS;
|
|
|
|
out:
|
|
|
|
i2c_stop();
|
|
|
|
return data;
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
2019-04-04 03:45:55 +06:00
|
|
|
} else {
|
|
|
|
/* read from teensy
|
|
|
|
* bitmask is 0b11110011, but we want those all
|
|
|
|
* in the lower six bits.
|
|
|
|
* we'll return 1s for the top two, but that's harmless.
|
|
|
|
*/
|
|
|
|
|
|
|
|
return ~((PINF & 0x03) | ((PINF & 0xF0) >> 2));
|
|
|
|
}
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Row pin configuration
|
|
|
|
*
|
|
|
|
* Teensy
|
|
|
|
* row: 7 8 9 10 11 12 13
|
|
|
|
* pin: B0 B1 B2 B3 D2 D3 C6
|
|
|
|
*
|
|
|
|
* MCP23018
|
|
|
|
* row: 0 1 2 3 4 5 6
|
|
|
|
* pin: A0 A1 A2 A3 A4 A5 A6
|
|
|
|
*/
|
2019-04-04 03:45:55 +06:00
|
|
|
static void unselect_rows(void) {
|
|
|
|
// no need to unselect on mcp23018, because the select step sets all
|
|
|
|
// the other row bits high, and it's not changing to a different
|
|
|
|
// direction
|
|
|
|
|
|
|
|
// unselect on teensy
|
|
|
|
// Hi-Z(DDR:0, PORT:0) to unselect
|
|
|
|
DDRB &= ~(1 << 0 | 1 << 1 | 1 << 2 | 1 << 3);
|
|
|
|
PORTB &= ~(1 << 0 | 1 << 1 | 1 << 2 | 1 << 3);
|
|
|
|
DDRD &= ~(1 << 2 | 1 << 3);
|
|
|
|
PORTD &= ~(1 << 2 | 1 << 3);
|
|
|
|
DDRC &= ~(1 << 6);
|
|
|
|
PORTC &= ~(1 << 6);
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
|
|
|
|
2019-04-04 03:45:55 +06:00
|
|
|
static void select_row(uint8_t row) {
|
|
|
|
if (row < 7) {
|
|
|
|
// select on mcp23018
|
|
|
|
if (mcp23018_status) { // if there was an error
|
|
|
|
// do nothing
|
2015-10-27 02:32:37 +06:00
|
|
|
} else {
|
2019-04-04 03:45:55 +06:00
|
|
|
// set active row low : 0
|
|
|
|
// set other rows hi-Z : 1
|
|
|
|
mcp23018_status = i2c_start(I2C_ADDR_WRITE, ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
mcp23018_status = i2c_write(GPIOA, ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
mcp23018_status = i2c_write(0xFF & ~(1 << row), ERGODOX_EZ_I2C_TIMEOUT);
|
|
|
|
if (mcp23018_status) goto out;
|
|
|
|
out:
|
|
|
|
i2c_stop();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// select on teensy
|
|
|
|
// Output low(DDR:1, PORT:0) to select
|
|
|
|
switch (row) {
|
|
|
|
case 7:
|
|
|
|
DDRB |= (1 << 0);
|
|
|
|
PORTB &= ~(1 << 0);
|
|
|
|
break;
|
|
|
|
case 8:
|
|
|
|
DDRB |= (1 << 1);
|
|
|
|
PORTB &= ~(1 << 1);
|
|
|
|
break;
|
|
|
|
case 9:
|
|
|
|
DDRB |= (1 << 2);
|
|
|
|
PORTB &= ~(1 << 2);
|
|
|
|
break;
|
|
|
|
case 10:
|
|
|
|
DDRB |= (1 << 3);
|
|
|
|
PORTB &= ~(1 << 3);
|
|
|
|
break;
|
|
|
|
case 11:
|
|
|
|
DDRD |= (1 << 2);
|
|
|
|
PORTD &= ~(1 << 2);
|
|
|
|
break;
|
|
|
|
case 12:
|
|
|
|
DDRD |= (1 << 3);
|
|
|
|
PORTD &= ~(1 << 3);
|
|
|
|
break;
|
|
|
|
case 13:
|
|
|
|
DDRC |= (1 << 6);
|
|
|
|
PORTC &= ~(1 << 6);
|
|
|
|
break;
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|
2019-04-04 03:45:55 +06:00
|
|
|
}
|
2015-10-27 02:32:37 +06:00
|
|
|
}
|