Procházet zdrojové kódy

Remove matrix_key_count() from matrix.h

led_matrix
tmk před 11 roky
rodič
revize
81d2753ab0
2 změnil soubory, kde provedl 0 přidání a 16 odebrání
  1. 0
    2
      common/matrix.h
  2. 0
    14
      keyboard/hbkb/matrix.c

+ 0
- 2
common/matrix.h Zobrazit soubor

bool matrix_is_on(uint8_t row, uint8_t col); bool matrix_is_on(uint8_t row, uint8_t col);
/* matrix state on row */ /* matrix state on row */
matrix_row_t matrix_get_row(uint8_t row); matrix_row_t matrix_get_row(uint8_t row);
/* count keys pressed */
uint8_t matrix_key_count(void);
/* print matrix for debug */ /* print matrix for debug */
void matrix_print(void); void matrix_print(void);



+ 0
- 14
keyboard/hbkb/matrix.c Zobrazit soubor

} }
} }


uint8_t matrix_key_count(void)
{
uint8_t count = 0;
for (uint8_t i = 0; i < MATRIX_ROWS; i++) {
#if (MATRIX_COLS <= 8)
count += bitpop(matrix[i]);
#else
count += bitpop16(matrix[i]);
#endif
}
return count;
}

#ifdef MATRIX_HAS_GHOST #ifdef MATRIX_HAS_GHOST
inline inline
static bool matrix_has_ghost_in_row(uint8_t row) static bool matrix_has_ghost_in_row(uint8_t row)


// ghost exists in case same state as other row // ghost exists in case same state as other row
for (uint8_t i=0; i < MATRIX_ROWS; i++) { for (uint8_t i=0; i < MATRIX_ROWS; i++) {
//if (i != row && (matrix[i] & matrix[row]) == matrix[row])
if (i != row && (matrix[i] & matrix[row])) if (i != row && (matrix[i] & matrix[row]))
return true; return true;
} }