1 /* -*- indent-tabs-mode: nil; tab-width: 4; c-basic-offset: 4; -*-
3 keytree.c for the Openbox window manager
4 Copyright (c) 2006 Mikael Magnusson
5 Copyright (c) 2003-2007 Dana Jansens
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 See the COPYING file for a copy of the GNU General Public License.
21 #include "translate.h"
23 #include "action_list.h"
26 void tree_destroy(KeyBindingTree *tree)
31 tree_destroy(tree->next_sibling);
32 c = tree->first_child;
35 for (it = tree->keylist; it != NULL; it = it->next)
37 g_list_free(tree->keylist);
38 action_list_unref(tree->actions);
40 g_slice_free(KeyBindingTree, tree);
45 KeyBindingTree *tree_build(GList *keylist)
48 KeyBindingTree *ret = NULL, *p;
50 if (g_list_length(keylist) <= 0)
51 return NULL; /* nothing in the list.. */
53 for (it = g_list_last(keylist); it; it = g_list_previous(it)) {
57 ret = g_slice_new0(KeyBindingTree);
59 for (kit = it; kit != NULL; kit = g_list_previous(kit))
60 ret->keylist = g_list_prepend(ret->keylist,
61 g_strdup(kit->data)); /* deep copy */
63 if (p != NULL) p->parent = ret;
64 translate_key(it->data, &ret->state, &ret->key);
69 void tree_assimilate(KeyBindingTree *node)
71 KeyBindingTree *a, *b, *tmp, *last;
73 if (keyboard_firstnode == NULL) {
74 /* there are no nodes at this level yet */
75 keyboard_firstnode = node;
77 a = keyboard_firstnode;
82 /* check b->key != 0 for key bindings that didn't get translated */
83 if (!(a->state == b->state && a->key == b->key && b->key != 0)) {
88 g_slice_free(KeyBindingTree, tmp);
92 /* check b->key != 0, and save key bindings that didn't get translated
94 if (!(last->state == b->state && last->key == b->key && b->key != 0)) {
95 last->next_sibling = b;
96 b->parent = last->parent;
98 last->first_child = b->first_child;
99 last->first_child->parent = last;
100 g_slice_free(KeyBindingTree, b);
105 KeyBindingTree *tree_find(KeyBindingTree *search, gboolean *conflict)
107 KeyBindingTree *a, *b;
111 a = keyboard_firstnode;
114 /* check b->key != 0 for key bindings that didn't get translated, and
115 don't make them conflict with anything else so that they can all
116 live together in peace and harmony */
117 if (!(a->state == b->state && a->key == b->key && b->key != 0)) {
120 if ((a->first_child == NULL) == (b->first_child == NULL)) {
121 if (a->first_child == NULL) {
122 /* found it! (return the actual node, not the search's) */
127 return NULL; /* the chain status' don't match (conflict!) */
133 return NULL; /* it just isn't in here */
136 gboolean tree_chroot(KeyBindingTree *tree, GList *keylist)
139 translate_key(keylist->data, &state, &key);
140 while (tree != NULL && !(tree->state == state && tree->key == key))
141 tree = tree->next_sibling;
143 if (keylist->next == NULL) {
147 return tree_chroot(tree->first_child, keylist->next);