aboutsummaryrefslogtreecommitdiff
path: root/common/layer_stack.c
diff options
context:
space:
mode:
authortmk <nobody@nowhere>2013-02-15 13:47:41 +0900
committertmk <nobody@nowhere>2013-02-15 13:47:41 +0900
commit768ea72f109fee2411c77bf2fabcbede5f98650d (patch)
tree59350a8538ef9a8380250771fb57490759041fec /common/layer_stack.c
parentc74ad260fb45b2deec0309d9a9cbac3c0434886b (diff)
downloadqmk_firmware-768ea72f109fee2411c77bf2fabcbede5f98650d.tar.gz
qmk_firmware-768ea72f109fee2411c77bf2fabcbede5f98650d.zip
Add layer_stack files taking apart from action.c
Diffstat (limited to 'common/layer_stack.c')
-rw-r--r--common/layer_stack.c100
1 files changed, 100 insertions, 0 deletions
diff --git a/common/layer_stack.c b/common/layer_stack.c
new file mode 100644
index 000000000..07c84870c
--- /dev/null
+++ b/common/layer_stack.c
@@ -0,0 +1,100 @@
1#include <stdint.h>
2#include "keyboard.h"
3#include "layer_stack.h"
4#include "debug.h"
5
6
7static uint8_t top_layer = 0;
8
9/* [0] always works as sentinel and not used for store.*/
10static layer_item_t layer_stack[LAYER_STACK_SIZE] = {};
11
12bool layer_stack_push(uint8_t layer)
13{
14 for (uint8_t i = 1; i < LAYER_STACK_SIZE; i++) {
15 if (!layer_stack[i].used) {
16 layer_stack[i] = (layer_item_t){ .layer = layer,
17 .next = top_layer,
18 .used = true };
19 top_layer = i;
20 return true;
21 }
22 }
23 return false;
24}
25
26bool layer_stack_pop(void)
27{
28 if (layer_stack[top_layer].used) {
29 uint8_t popped = top_layer;
30 top_layer = layer_stack[popped].next;
31 layer_stack[popped] = (layer_item_t){};
32 return true;
33 }
34 return false;
35}
36
37bool layer_stack_remove(uint8_t layer)
38{
39 if (layer_stack[top_layer].used && layer_stack[top_layer].layer == layer) {
40 layer_stack_pop();
41 debug("layer_stack_remove: top_layer\n");
42 return true;
43 }
44
45 for (uint8_t i = top_layer; layer_stack[i].used; i = layer_stack[i].next) {
46 debug("layer_stack_remove: ["); debug_dec(i); debug("]");
47 debug_dec(layer_stack[i].layer); debug("\n");
48 uint8_t removed = layer_stack[i].next;
49 if (layer_stack[removed].used && layer_stack[removed].layer == layer) {
50 layer_stack[i].next = layer_stack[removed].next;
51 layer_stack[removed] = (layer_item_t){};
52 debug("layer_stack_remove: removed.\n");
53 return true;
54 }
55 }
56 return false;
57}
58
59bool layer_stack_remove_then_push(uint8_t layer)
60{
61 layer_stack_remove(layer);
62 return layer_stack_push(layer);
63}
64
65bool layer_stack_remove_or_push(uint8_t layer)
66{
67 return (layer_stack_remove(layer)) || layer_stack_push(layer);
68}
69
70void layer_stack_debug(void)
71{
72 debug("layer_stack: ");
73 layer_item_t item = layer_stack[top_layer];
74 while (item.used) {
75 debug_dec(item.layer);
76 debug("["); debug_dec(item.next); debug("]");
77 item = layer_stack[item.next];
78 }
79 debug("\n");
80}
81
82
83
84action_t layer_stack_get_action(key_t key)
85{
86 action_t action;
87 action.code = ACTION_TRANSPARENT;
88
89 /* layer stack */
90 for (layer_item_t i = layer_stack[top_layer]; i.used; i = layer_stack[i.next]) {
91 action = action_for_key(i.layer, key);
92 if (action.code != ACTION_TRANSPARENT) {
93 layer_stack_debug();
94 debug("layer_stack: used. "); debug_dec(i.layer); debug("\n");
95 return action;
96 }
97 debug("layer_stack: through. "); debug_dec(i.layer); debug("\n");
98 }
99 return action;
100}