9632360caa
* Add ARRAY_SIZE and CEILING utility macros * Apply a coccinelle patch to use ARRAY_SIZE * fix up some straggling items * Fix 'make test:secure' * Enhance ARRAY_SIZE macro to reject acting on pointers The previous definition would not produce a diagnostic for ``` int *p; size_t num_elem = ARRAY_SIZE(p) ``` but the new one will. * explicitly get definition of ARRAY_SIZE * Convert to ARRAY_SIZE when const is involved The following spatch finds additional instances where the array is const and the division is by the size of the type, not the size of the first element: ``` @ rule5a using "empty.iso" @ type T; const T[] E; @@ - (sizeof(E)/sizeof(T)) + ARRAY_SIZE(E) @ rule6a using "empty.iso" @ type T; const T[] E; @@ - sizeof(E)/sizeof(T) + ARRAY_SIZE(E) ``` * New instances of ARRAY_SIZE added since initial spatch run * Use `ARRAY_SIZE` in docs (found by grep) * Manually use ARRAY_SIZE hs_set is expected to be the same size as uint16_t, though it's made of two 8-bit integers * Just like char, sizeof(uint8_t) is guaranteed to be 1 This is at least true on any plausible system where qmk is actually used. Per my understanding it's universally true, assuming that uint8_t exists: https://stackoverflow.com/questions/48655310/can-i-assume-that-sizeofuint8-t-1 * Run qmk-format on core C files touched in this branch Co-authored-by: Stefan Kerkmann <karlk90@pm.me>
126 lines
3.9 KiB
C
126 lines
3.9 KiB
C
/*
|
|
* Copyright 2018 Jack Humbert <jack.humb@gmail.com>
|
|
* Copyright 2019 Drashna Jaelre (Christopher Courtney) <drashna@live.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/>.
|
|
*/
|
|
|
|
#include "dip_switch.h"
|
|
#ifdef SPLIT_KEYBOARD
|
|
# include "split_common/split_util.h"
|
|
#endif
|
|
|
|
// for memcpy
|
|
#include <string.h>
|
|
|
|
#if !defined(DIP_SWITCH_PINS) && !defined(DIP_SWITCH_MATRIX_GRID)
|
|
# error "Either DIP_SWITCH_PINS or DIP_SWITCH_MATRIX_GRID must be defined."
|
|
#endif
|
|
|
|
#if defined(DIP_SWITCH_PINS) && defined(DIP_SWITCH_MATRIX_GRID)
|
|
# error "Both DIP_SWITCH_PINS and DIP_SWITCH_MATRIX_GRID are defined."
|
|
#endif
|
|
|
|
#ifdef DIP_SWITCH_PINS
|
|
# define NUMBER_OF_DIP_SWITCHES (ARRAY_SIZE(dip_switch_pad))
|
|
static pin_t dip_switch_pad[] = DIP_SWITCH_PINS;
|
|
#endif
|
|
|
|
#ifdef DIP_SWITCH_MATRIX_GRID
|
|
typedef struct matrix_index_t {
|
|
uint8_t row;
|
|
uint8_t col;
|
|
} matrix_index_t;
|
|
|
|
# define NUMBER_OF_DIP_SWITCHES (ARRAY_SIZE(dip_switch_pad))
|
|
static matrix_index_t dip_switch_pad[] = DIP_SWITCH_MATRIX_GRID;
|
|
extern bool peek_matrix(uint8_t row_index, uint8_t col_index, bool read_raw);
|
|
static uint16_t scan_count;
|
|
#endif /* DIP_SWITCH_MATRIX_GRID */
|
|
|
|
static bool dip_switch_state[NUMBER_OF_DIP_SWITCHES] = {0};
|
|
static bool last_dip_switch_state[NUMBER_OF_DIP_SWITCHES] = {0};
|
|
|
|
__attribute__((weak)) bool dip_switch_update_user(uint8_t index, bool active) {
|
|
return true;
|
|
}
|
|
|
|
__attribute__((weak)) bool dip_switch_update_kb(uint8_t index, bool active) {
|
|
return dip_switch_update_user(index, active);
|
|
}
|
|
|
|
__attribute__((weak)) bool dip_switch_update_mask_user(uint32_t state) {
|
|
return true;
|
|
}
|
|
|
|
__attribute__((weak)) bool dip_switch_update_mask_kb(uint32_t state) {
|
|
return dip_switch_update_mask_user(state);
|
|
}
|
|
|
|
void dip_switch_init(void) {
|
|
#ifdef DIP_SWITCH_PINS
|
|
# if defined(SPLIT_KEYBOARD) && defined(DIP_SWITCH_PINS_RIGHT)
|
|
if (!isLeftHand) {
|
|
const pin_t dip_switch_pad_right[] = DIP_SWITCH_PINS_RIGHT;
|
|
for (uint8_t i = 0; i < NUMBER_OF_DIP_SWITCHES; i++) {
|
|
dip_switch_pad[i] = dip_switch_pad_right[i];
|
|
}
|
|
}
|
|
# endif
|
|
for (uint8_t i = 0; i < NUMBER_OF_DIP_SWITCHES; i++) {
|
|
setPinInputHigh(dip_switch_pad[i]);
|
|
}
|
|
dip_switch_read(true);
|
|
#endif
|
|
#ifdef DIP_SWITCH_MATRIX_GRID
|
|
scan_count = 0;
|
|
#endif
|
|
}
|
|
|
|
void dip_switch_read(bool forced) {
|
|
bool has_dip_state_changed = false;
|
|
uint32_t dip_switch_mask = 0;
|
|
|
|
#ifdef DIP_SWITCH_MATRIX_GRID
|
|
bool read_raw = false;
|
|
|
|
if (scan_count < 500) {
|
|
scan_count++;
|
|
if (scan_count == 10) {
|
|
read_raw = true;
|
|
forced = true; /* First reading of the dip switch */
|
|
} else {
|
|
return;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
for (uint8_t i = 0; i < NUMBER_OF_DIP_SWITCHES; i++) {
|
|
#ifdef DIP_SWITCH_PINS
|
|
dip_switch_state[i] = !readPin(dip_switch_pad[i]);
|
|
#endif
|
|
#ifdef DIP_SWITCH_MATRIX_GRID
|
|
dip_switch_state[i] = peek_matrix(dip_switch_pad[i].row, dip_switch_pad[i].col, read_raw);
|
|
#endif
|
|
dip_switch_mask |= dip_switch_state[i] << i;
|
|
if (last_dip_switch_state[i] != dip_switch_state[i] || forced) {
|
|
has_dip_state_changed = true;
|
|
dip_switch_update_kb(i, dip_switch_state[i]);
|
|
}
|
|
}
|
|
if (has_dip_state_changed) {
|
|
dip_switch_update_mask_kb(dip_switch_mask);
|
|
memcpy(last_dip_switch_state, dip_switch_state, sizeof(dip_switch_state));
|
|
}
|
|
}
|