Keyboard firmwares for Atmel AVR and Cortex-M
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.

layer_stack.c 2.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. #include <stdint.h>
  2. #include "keyboard.h"
  3. #include "layer_stack.h"
  4. #include "debug.h"
  5. static uint8_t top_layer = 0;
  6. /* [0] always works as sentinel and not used for store.*/
  7. static layer_item_t layer_stack[LAYER_STACK_SIZE] = {};
  8. void layer_stack_clear(void)
  9. {
  10. for (uint8_t i = 0; i < LAYER_STACK_SIZE; i++) {
  11. layer_stack[i] = (layer_item_t){ .layer = 0,
  12. .next = 0,
  13. .used = false };
  14. }
  15. }
  16. bool layer_stack_push(uint8_t layer)
  17. {
  18. for (uint8_t i = 1; i < LAYER_STACK_SIZE; i++) {
  19. if (!layer_stack[i].used) {
  20. layer_stack[i] = (layer_item_t){ .layer = layer,
  21. .next = top_layer,
  22. .used = true };
  23. top_layer = i;
  24. return true;
  25. }
  26. }
  27. return false;
  28. }
  29. bool layer_stack_pop(void)
  30. {
  31. if (layer_stack[top_layer].used) {
  32. uint8_t popped = top_layer;
  33. top_layer = layer_stack[popped].next;
  34. layer_stack[popped] = (layer_item_t){};
  35. return true;
  36. }
  37. return false;
  38. }
  39. bool layer_stack_remove(uint8_t layer)
  40. {
  41. if (layer_stack[top_layer].used && layer_stack[top_layer].layer == layer) {
  42. layer_stack_pop();
  43. debug("layer_stack_remove: top_layer\n");
  44. return true;
  45. }
  46. for (uint8_t i = top_layer; layer_stack[i].used; i = layer_stack[i].next) {
  47. debug("layer_stack_remove: ["); debug_dec(i); debug("]");
  48. debug_dec(layer_stack[i].layer); debug("\n");
  49. uint8_t removed = layer_stack[i].next;
  50. if (layer_stack[removed].used && layer_stack[removed].layer == layer) {
  51. layer_stack[i].next = layer_stack[removed].next;
  52. layer_stack[removed] = (layer_item_t){};
  53. debug("layer_stack_remove: removed.\n");
  54. return true;
  55. }
  56. }
  57. return false;
  58. }
  59. bool layer_stack_remove_then_push(uint8_t layer)
  60. {
  61. layer_stack_remove(layer);
  62. return layer_stack_push(layer);
  63. }
  64. bool layer_stack_remove_or_push(uint8_t layer)
  65. {
  66. return (layer_stack_remove(layer)) || layer_stack_push(layer);
  67. }
  68. void layer_stack_debug(void)
  69. {
  70. debug("layer_stack: ");
  71. layer_item_t item = layer_stack[top_layer];
  72. while (item.used) {
  73. debug_dec(item.layer);
  74. debug("["); debug_dec(item.next); debug("] ");
  75. item = layer_stack[item.next];
  76. }
  77. debug("\n");
  78. }
  79. action_t layer_stack_get_action(key_t key)
  80. {
  81. action_t action;
  82. action.code = ACTION_TRANSPARENT;
  83. /* layer stack */
  84. for (layer_item_t i = layer_stack[top_layer]; i.used; i = layer_stack[i.next]) {
  85. action = action_for_key(i.layer, key);
  86. if (action.code != ACTION_TRANSPARENT) {
  87. layer_stack_debug();
  88. debug("layer_stack: used. "); debug_dec(i.layer); debug("\n");
  89. return action;
  90. }
  91. debug("layer_stack: through. "); debug_dec(i.layer); debug("\n");
  92. }
  93. return action;
  94. }