1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
|
// -*- mode: C++; indent-tabs-mode: nil; c-basic-offset: 2; -*-
#ifdef HAVE_CONFIG_H
# include "../config.h"
#endif
#include "bindings.hh"
#include "otk/display.hh"
extern "C" {
#include <X11/Xlib.h>
}
namespace ob {
#include <stdio.h>
static void print_branch(BindingTree *first, std::string str)
{
BindingTree *p = first;
while (p) {
if (p->first_child)
print_branch(p->first_child, str + " " + p->text);
if (!p->chain)
printf("%d%s\n", p->id, (str + " " + p->text).c_str());
BindingTree *s = p->next_sibling;
delete p;
p = s;
}
}
void OBBindings::display()
{
if (_tree.first_child)
print_branch(_tree.first_child, "");
}
bool OBBindings::translate(const std::string &str, Binding &b)
{
unsigned int mods = 0;
std::string modstring;
// parse out the base key name
std::string::size_type keybegin = str.find_last_of('-');
keybegin = (keybegin == std::string::npos) ? 0 : keybegin + 1;
std::string key(str, keybegin);
// XXX: get some modifiers up in the hizzie
// parse out the requested modifier keys
std::string::size_type begin = 0, end;
while (begin != keybegin) {
end = str.find_first_of('-', begin);
std::string mod(str, begin, end-begin);
modstring += mod;
if (mod == "C") { // control
mods |= ControlMask;
} else if (mod == "S") { // shift
mods |= ShiftMask;
} else if (mod == "A" || // alt/mod1
mod == "M" ||
mod == "M1" ||
mod == "Mod1") {
mods |= Mod1Mask;
} else if (mod == "M2" || // mod2
mod == "Mod2") {
mods |= Mod2Mask;
} else if (mod == "M3" || // mod3
mod == "Mod3") {
mods |= Mod3Mask;
} else if (mod == "W" || // windows/mod4
mod == "M4" ||
mod == "Mod4") {
mods |= Mod4Mask;
} else if (mod == "M5" || // mod5
mod == "Mod5") {
mods |= Mod5Mask;
}
begin = end + 1;
}
printf("got modifier: %s\n", modstring.c_str());
KeySym sym = XStringToKeysym(const_cast<char *>(key.c_str()));
if (sym == NoSymbol) return false;
b.modifiers = mods;
b.key = XKeysymToKeycode(otk::OBDisplay::display, sym);
return b.key != 0;
}
BindingTree *OBBindings::buildtree(const StringVect &keylist, int id)
{
if (keylist.empty()) return 0; // nothing in the list.. return 0
BindingTree *ret = new BindingTree(id), *p = 0;
StringVect::const_iterator it, end = keylist.end();
for (it = keylist.begin(); it != end; ++it) {
if (p)
p = p->first_child = new BindingTree(id);
else
p = ret; // the first node
if (!translate(*it, p->binding))
break;
p->text = *it;
}
if (it != end) {
// build failed.. clean up and return 0
p = ret;
while (p->first_child) {
BindingTree *c = p->first_child;
delete p;
p = c;
}
delete p;
return 0;
} else {
// set the proper chain status on the last node
p->chain = false;
}
printf("BUILDING:\n");
print_branch(ret, "");
// successfully built a tree
return ret;
}
static void destroytree(BindingTree *tree)
{
while (tree) {
BindingTree *c = tree->first_child;
delete tree;
tree = c;
}
}
OBBindings::OBBindings()
{
}
OBBindings::~OBBindings()
{
remove_all();
}
void OBBindings::assimilate(BindingTree *node)
{
BindingTree *a, *b, *tmp, *last;
if (!_tree.first_child) {
// there are no nodes at this level yet
_tree.first_child = node;
return;
} else {
a = _tree.first_child;
last = a;
b = node;
while (a->first_child) {
last = a;
if (a->binding != b->binding) {
a = a->next_sibling;
} else {
tmp = b;
b = b->first_child;
delete tmp;
a = a->first_child;
}
}
last->first_child = b->first_child;
delete b;
}
}
int OBBindings::find(BindingTree *search) {
BindingTree *a, *b;
a = _tree.first_child;
b = search;
while (a && b) {
if (a->binding != b->binding) {
a = a->next_sibling;
} else {
if (a->chain == b->chain) {
if (!a->chain)
return a->id; // found it! (return the actual id, not the search's)
} else
return -2; // the chain status' don't match (conflict!)
b = b->first_child;
a = a->first_child;
}
}
return -1; // it just isn't in here
}
/*
static int find(BindingTree *parent, BindingTree *node) {
BindingTree *p, *lastsib, *nextparent, *nextnode = node->first_child;
if (!parent->first_child)
return -1;
p = parent->first_child;
while (p) {
if (node->binding == p->binding) {
if (node->chain == p->chain) {
if (!node->chain) {
return p->id; // found it! (return the actual id, not the search's)
} else {
break; // go on to the next child in the chain
}
} else {
return -2; // the chain status' don't match (conflict!)
}
}
p = p->next_sibling;
}
if (!p) return -1; // doesn't exist
if (node->chain) {
assert(node->first_child);
return find(p, node->first_child);
} else
return -1; // it just isnt in here
}
*/
bool OBBindings::add(const StringVect &keylist, int id)
{
BindingTree *tree;
if (!(tree = buildtree(keylist, id)))
return false; // invalid binding requested
if (find(tree) < -1) {
// conflicts with another binding
destroytree(tree);
return false;
}
// assimilate this built tree into the main tree
assimilate(tree); // assimilation destroys/uses the tree
return true;
}
int OBBindings::find(const StringVect &keylist)
{
BindingTree *tree;
bool ret;
if (!(tree = buildtree(keylist, 0)))
return false; // invalid binding requested
ret = find(tree) >= 0;
destroytree(tree);
return ret;
}
int OBBindings::remove(const StringVect &keylist)
{
(void)keylist;
assert(false); // XXX: function not implemented yet
}
static void remove_branch(BindingTree *first)
{
BindingTree *p = first;
while (p) {
if (p->first_child)
remove_branch(p->first_child);
BindingTree *s = p->next_sibling;
delete p;
p = s;
}
}
void OBBindings::remove_all()
{
if (_tree.first_child)
remove_branch(_tree.first_child);
}
}
|