]> Dogcows Code - chaz/openbox/blob - src/bindings.cc
b854ba2568668954db3863e3b97829616ab9f170
[chaz/openbox] / src / bindings.cc
1 // -*- mode: C++; indent-tabs-mode: nil; c-basic-offset: 2; -*-
2
3 #ifdef HAVE_CONFIG_H
4 # include "../config.h"
5 #endif
6
7 #include "bindings.hh"
8 #include "otk/display.hh"
9
10 extern "C" {
11 #include <X11/Xlib.h>
12
13 #include "gettext.h"
14 #define _(str) gettext(str)
15 }
16
17 namespace ob {
18
19 #include <stdio.h>
20 static void print_branch(BindingTree *first, std::string str)
21 {
22 BindingTree *p = first;
23
24 while (p) {
25 if (p->first_child)
26 print_branch(p->first_child, str + " " + p->text);
27 if (!p->chain)
28 printf("%d%s\n", p->id, (str + " " + p->text).c_str());
29 p = p->next_sibling;
30 }
31 }
32
33
34 void OBBindings::display()
35 {
36 if (_keytree.first_child) {
37 printf("Key Tree:\n");
38 print_branch(_keytree.first_child, "");
39 }
40 if (_mousetree) {
41 printf("Mouse Tree:\n");
42 BindingTree *p = _mousetree;
43 while (p) {
44 printf("%d %s\n", p->id, p->text.c_str());
45 p = p->next_sibling;
46 }
47 }
48 }
49
50
51 static bool buttonvalue(const std::string &button, unsigned int *val)
52 {
53 if (button == "1" || button == "Button1") {
54 *val |= Button1;
55 } else if (button == "2" || button == "Button2") {
56 *val |= Button2;
57 } else if (button == "3" || button == "Button3") {
58 *val |= Button3;
59 } else if (button == "4" || button == "Button4") {
60 *val |= Button4;
61 } else if (button == "5" || button == "Button5") {
62 *val |= Button5;
63 } else
64 return false;
65 return true;
66 }
67
68 static bool modvalue(const std::string &mod, unsigned int *val)
69 {
70 if (mod == "C") { // control
71 *val |= ControlMask;
72 } else if (mod == "S") { // shift
73 *val |= ShiftMask;
74 } else if (mod == "A" || // alt/mod1
75 mod == "M" ||
76 mod == "Mod1" ||
77 mod == "M1") {
78 *val |= Mod1Mask;
79 } else if (mod == "Mod2" || // mod2
80 mod == "M2") {
81 *val |= Mod2Mask;
82 } else if (mod == "Mod3" || // mod3
83 mod == "M3") {
84 *val |= Mod3Mask;
85 } else if (mod == "W" || // windows/mod4
86 mod == "Mod4" ||
87 mod == "M4") {
88 *val |= Mod4Mask;
89 } else if (mod == "Mod5" || // mod5
90 mod == "M5") {
91 *val |= Mod5Mask;
92 } else { // invalid
93 return false;
94 }
95 return true;
96 }
97
98 bool OBBindings::translate(const std::string &str, Binding &b, bool askey)
99 {
100 // parse out the base key name
101 std::string::size_type keybegin = str.find_last_of('-');
102 keybegin = (keybegin == std::string::npos) ? 0 : keybegin + 1;
103 std::string key(str, keybegin);
104
105 // parse out the requested modifier keys
106 unsigned int modval = 0;
107 std::string::size_type begin = 0, end;
108 while (begin != keybegin) {
109 end = str.find_first_of('-', begin);
110
111 std::string mod(str, begin, end-begin);
112 if (!modvalue(mod, &modval)) {
113 // printf(_("Invalid modifier element in key binding: %s\n"), mod.c_str());
114 return false;
115 }
116
117 begin = end + 1;
118 }
119
120 // set the binding
121 b.modifiers = modval;
122 if (askey) {
123 KeySym sym = XStringToKeysym(const_cast<char *>(key.c_str()));
124 if (sym == NoSymbol) return false;
125 b.key = XKeysymToKeycode(otk::OBDisplay::display, sym);
126 return b.key != 0;
127 } else {
128 return buttonvalue(key, &b.key);
129 }
130 }
131
132 static void destroytree(BindingTree *tree)
133 {
134 while (tree) {
135 BindingTree *c = tree->first_child;
136 delete tree;
137 tree = c;
138 }
139 }
140
141 BindingTree *OBBindings::buildtree(const StringVect &keylist, int id)
142 {
143 if (keylist.empty()) return 0; // nothing in the list.. return 0
144
145 BindingTree *ret = 0, *p;
146
147 StringVect::const_reverse_iterator it, end = keylist.rend();
148 for (it = keylist.rbegin(); it != end; ++it) {
149 p = ret;
150 ret = new BindingTree(id);
151 if (!p) ret->chain = false;
152 ret->first_child = p;
153 printf("adding child %lx\n", (long)p);
154 if (!translate(*it, ret->binding, true)) {
155 destroytree(ret);
156 ret = 0;
157 break;
158 }
159 ret->text = *it; // XXX: rm me
160 }
161 return ret;
162 }
163
164
165 OBBindings::OBBindings()
166 : _curpos(&_keytree), _mousetree(0)
167 {
168 }
169
170
171 OBBindings::~OBBindings()
172 {
173 remove_all();
174 }
175
176
177 bool OBBindings::add_mouse(const std::string &button, int id)
178 {
179 BindingTree n;
180
181 if (!translate(button, n.binding, false))
182 return false;
183
184 BindingTree *p = _mousetree, **newp = &_mousetree;
185 while (p) {
186 if (p->binding == n.binding)
187 return false; // conflict
188 p = p->next_sibling;
189 newp = &p->next_sibling;
190 }
191 display();
192 *newp = new BindingTree(id);
193 display();
194 (*newp)->text = button;
195 (*newp)->chain = false;
196 (*newp)->binding.key = n.binding.key;
197 (*newp)->binding.modifiers = n.binding.modifiers;
198
199 return true;
200 }
201
202
203 int OBBindings::remove_mouse(const std::string &button)
204 {
205 (void)button;
206 assert(false); // XXX: function not implemented yet
207 }
208
209
210 void OBBindings::assimilate(BindingTree *node)
211 {
212 BindingTree *a, *b, *tmp, *last;
213
214 if (!_keytree.first_child) {
215 // there are no nodes at this level yet
216 _keytree.first_child = node;
217 return;
218 } else {
219 a = _keytree.first_child;
220 last = a;
221 b = node;
222 while (a) {
223 last = a;
224 if (a->binding != b->binding) {
225 a = a->next_sibling;
226 } else {
227 tmp = b;
228 b = b->first_child;
229 delete tmp;
230 a = a->first_child;
231 }
232 }
233 if (last->binding != b->binding)
234 last->next_sibling = b;
235 else
236 last->first_child = b->first_child;
237 delete b;
238 }
239 }
240
241
242 int OBBindings::find_key(BindingTree *search) {
243 BindingTree *a, *b;
244 a = _keytree.first_child;
245 b = search;
246 while (a && b) {
247 if (a->binding != b->binding) {
248 a = a->next_sibling;
249 } else {
250 if (a->chain == b->chain) {
251 if (!a->chain)
252 return a->id; // found it! (return the actual id, not the search's)
253 } else
254 return -2; // the chain status' don't match (conflict!)
255 b = b->first_child;
256 a = a->first_child;
257 }
258 }
259 return -1; // it just isn't in here
260 }
261
262 bool OBBindings::add_key(const StringVect &keylist, int id)
263 {
264 BindingTree *tree;
265
266 if (!(tree = buildtree(keylist, id)))
267 return false; // invalid binding requested
268
269 if (find_key(tree) < -1) {
270 // conflicts with another binding
271 destroytree(tree);
272 return false;
273 }
274
275 // assimilate this built tree into the main tree
276 assimilate(tree); // assimilation destroys/uses the tree
277 return true;
278 }
279
280
281 int OBBindings::find_key(const StringVect &keylist)
282 {
283 BindingTree *tree;
284 bool ret;
285
286 if (!(tree = buildtree(keylist, 0)))
287 return false; // invalid binding requested
288
289 ret = find_key(tree) >= 0;
290
291 destroytree(tree);
292
293 return ret;
294 }
295
296
297 int OBBindings::remove_key(const StringVect &keylist)
298 {
299 (void)keylist;
300 assert(false); // XXX: function not implemented yet
301 }
302
303
304 static void remove_branch(BindingTree *first)
305 {
306 BindingTree *p = first;
307
308 while (p) {
309 if (p->first_child)
310 remove_branch(p->first_child);
311 BindingTree *s = p->next_sibling;
312 delete p;
313 p = s;
314 }
315 }
316
317
318 void OBBindings::remove_all()
319 {
320 if (_keytree.first_child) {
321 remove_branch(_keytree.first_child);
322 _keytree.first_child = 0;
323 }
324 BindingTree *p = _mousetree;
325 while (p) {
326 BindingTree *n = p->next_sibling;
327 delete p;
328 p = n;
329 }
330 _mousetree = 0;
331 }
332
333
334 void OBBindings::process(unsigned int modifiers, unsigned int key)
335 {
336 BindingTree *c = _curpos->first_child;
337
338 while (c) {
339 if (c->binding.key == key && c->binding.modifiers == modifiers) {
340 _curpos = c;
341 break;
342 }
343 }
344 if (c) {
345 if (!_curpos->chain) {
346 // XXX execute command for _curpos->id
347 _curpos = &_keytree; // back to the start
348 }
349 }
350 }
351
352 }
This page took 0.050787 seconds and 4 git commands to generate.