1 |
/*----------------------------------------------------------------------* |
2 |
* File: keyboard.C |
3 |
*----------------------------------------------------------------------* |
4 |
* |
5 |
* All portions of code are copyright by their respective author/s. |
6 |
* Copyright (c) 2005 WU Fengguang |
7 |
* Copyright (c) 2005-2006 Marc Lehmann <schmorp@schmorp.de> |
8 |
* |
9 |
* This program is free software; you can redistribute it and/or modify |
10 |
* it under the terms of the GNU General Public License as published by |
11 |
* the Free Software Foundation; either version 2 of the License, or |
12 |
* (at your option) any later version. |
13 |
* |
14 |
* This program is distributed in the hope that it will be useful, |
15 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
17 |
* GNU General Public License for more details. |
18 |
* |
19 |
* You should have received a copy of the GNU General Public License |
20 |
* along with this program; if not, write to the Free Software |
21 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
22 |
*----------------------------------------------------------------------*/ |
23 |
|
24 |
#include "../config.h" |
25 |
#include "rxvt.h" |
26 |
|
27 |
#ifdef KEYSYM_RESOURCE |
28 |
|
29 |
#include <cstring> |
30 |
|
31 |
#include "rxvtperl.h" |
32 |
#include "keyboard.h" |
33 |
#include "command.h" |
34 |
|
35 |
/* an intro to the data structure: |
36 |
* |
37 |
* vector keymap[] is grouped. |
38 |
* |
39 |
* inside each group, elements are sorted by the criteria given by compare_priority(). |
40 |
* the lookup of keysym is done in two steps: |
41 |
* 1) locate the group corresponds to the keysym; |
42 |
* 2) do a linear search inside the group. |
43 |
* |
44 |
* array hash[] effectively defines a map from a keysym to a group in keymap[]. |
45 |
* |
46 |
* each group has its address(the index of first group element in keymap[]), |
47 |
* which is computed and stored in hash[]. |
48 |
* hash[] stores the addresses in the form of: |
49 |
* index: 0 I1 I2 I3 In |
50 |
* value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
51 |
* where |
52 |
* A1 = 0; |
53 |
* Ai+1 = N1 + N2 + ... + Ni. |
54 |
* it is computed from hash_bucket_size[]: |
55 |
* index: 0 I1 I2 I3 In |
56 |
* value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
57 |
* 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[]) |
58 |
* or we can say |
59 |
* hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, |
60 |
* where |
61 |
* set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
62 |
* where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK |
63 |
* n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
64 |
* Ni(the size of group i) = hash_bucket_size[Ii]. |
65 |
*/ |
66 |
|
67 |
static void |
68 |
output_string (rxvt_term *term, const char *str) |
69 |
{ |
70 |
if (strncmp (str, "command:", 8) == 0) |
71 |
term->cmdbuf_append (str + 8, strlen (str) - 8); |
72 |
else if (strncmp (str, "perl:", 5) == 0) |
73 |
HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
74 |
else |
75 |
term->tt_write (str, strlen (str)); |
76 |
} |
77 |
|
78 |
// return: priority_of_a - priority_of_b |
79 |
static int |
80 |
compare_priority (keysym_t *a, keysym_t *b) |
81 |
{ |
82 |
// (the more '1's in state; the less range): the greater priority |
83 |
int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
84 |
int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
85 |
|
86 |
if (ca != cb) |
87 |
return ca - cb; |
88 |
//else if (a->state != b->state) // this behavior is to be discussed |
89 |
// return b->state - a->state; |
90 |
else |
91 |
return 0; |
92 |
} |
93 |
|
94 |
//////////////////////////////////////////////////////////////////////////////// |
95 |
keyboard_manager::keyboard_manager () |
96 |
{ |
97 |
keymap.reserve (256); |
98 |
hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
99 |
} |
100 |
|
101 |
keyboard_manager::~keyboard_manager () |
102 |
{ |
103 |
for (unsigned int i = 0; i < keymap.size (); ++i) |
104 |
{ |
105 |
free (keymap [i]->str); |
106 |
delete keymap [i]; |
107 |
} |
108 |
} |
109 |
|
110 |
void |
111 |
keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) |
112 |
{ |
113 |
char *translation = rxvt_wcstoutf8 (ws); |
114 |
|
115 |
keysym_t *key = new keysym_t; |
116 |
|
117 |
key->keysym = keysym; |
118 |
key->state = state; |
119 |
key->str = translation; |
120 |
key->type = keysym_t::STRING; |
121 |
|
122 |
if (strncmp (translation, "builtin:", 8) == 0) |
123 |
key->type = keysym_t::BUILTIN; |
124 |
|
125 |
if (keymap.size () == keymap.capacity ()) |
126 |
keymap.reserve (keymap.size () * 2); |
127 |
|
128 |
keymap.push_back (key); |
129 |
hash[0] = 3; |
130 |
} |
131 |
|
132 |
bool |
133 |
keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
134 |
{ |
135 |
assert (("register_done() need to be called", hash[0] == 0)); |
136 |
|
137 |
state &= OtherModMask; // mask out uninteresting modifiers |
138 |
|
139 |
if (state & term->ModMetaMask) state |= MetaMask; |
140 |
if (state & term->ModNumLockMask) state |= NumLockMask; |
141 |
if (state & term->ModLevel3Mask) state |= Level3Mask; |
142 |
|
143 |
if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
144 |
state |= AppKeypadMask; |
145 |
|
146 |
int index = find_keysym (keysym, state); |
147 |
|
148 |
if (index >= 0) |
149 |
{ |
150 |
keysym_t *key = keymap [index]; |
151 |
|
152 |
if (key->type != keysym_t::BUILTIN) |
153 |
{ |
154 |
wchar_t *ws = rxvt_utf8towcs (key->str); |
155 |
char *str = rxvt_wcstombs (ws); |
156 |
// TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
157 |
free (ws); |
158 |
|
159 |
output_string (term, str); |
160 |
|
161 |
free (str); |
162 |
|
163 |
return true; |
164 |
} |
165 |
} |
166 |
|
167 |
return false; |
168 |
} |
169 |
|
170 |
void |
171 |
keyboard_manager::register_done () |
172 |
{ |
173 |
unsigned int i, index, hashkey; |
174 |
vector <keysym_t *> sorted_keymap; |
175 |
uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
176 |
|
177 |
memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
178 |
|
179 |
// determine hash bucket size |
180 |
for (i = 0; i < keymap.size (); ++i) |
181 |
{ |
182 |
hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
183 |
++hash_bucket_size [hashkey]; |
184 |
} |
185 |
|
186 |
// now we know the size of each bucket |
187 |
// compute the index of each bucket |
188 |
hash [0] = 0; |
189 |
for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
190 |
{ |
191 |
index += hash_bucket_size [i - 1]; |
192 |
hash [i] = index; |
193 |
} |
194 |
|
195 |
// and allocate just enough space |
196 |
sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
197 |
|
198 |
memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
199 |
|
200 |
// fill in sorted_keymap |
201 |
// it is sorted in each bucket |
202 |
for (i = 0; i < keymap.size (); ++i) |
203 |
{ |
204 |
hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
205 |
|
206 |
index = hash [hashkey] + hash_bucket_size [hashkey]; |
207 |
|
208 |
while (index > hash [hashkey] |
209 |
&& compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
210 |
{ |
211 |
sorted_keymap [index] = sorted_keymap [index - 1]; |
212 |
--index; |
213 |
} |
214 |
|
215 |
sorted_keymap [index] = keymap [i]; |
216 |
++hash_bucket_size [hashkey]; |
217 |
} |
218 |
|
219 |
keymap.swap (sorted_keymap); |
220 |
|
221 |
#ifndef NDEBUG |
222 |
// check for invariants |
223 |
for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
224 |
{ |
225 |
index = hash[i]; |
226 |
for (int j = 0; j < hash_bucket_size [i]; ++j) |
227 |
{ |
228 |
assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
229 |
|
230 |
if (j) |
231 |
assert (compare_priority (keymap [index + j - 1], |
232 |
keymap [index + j]) >= 0); |
233 |
} |
234 |
} |
235 |
|
236 |
// this should be able to detect most possible bugs |
237 |
for (i = 0; i < sorted_keymap.size (); ++i) |
238 |
{ |
239 |
keysym_t *a = sorted_keymap[i]; |
240 |
int index = find_keysym (a->keysym, a->state); |
241 |
|
242 |
assert (index >= 0); |
243 |
keysym_t *b = keymap [index]; |
244 |
assert (i == index // the normally expected result |
245 |
|| a->keysym == b->keysym |
246 |
&& compare_priority (a, b) <= 0); // is effectively the same or a closer match |
247 |
} |
248 |
#endif |
249 |
} |
250 |
|
251 |
int |
252 |
keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
253 |
{ |
254 |
int hashkey = keysym & KEYSYM_HASH_MASK; |
255 |
unsigned int index = hash [hashkey]; |
256 |
unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 |
257 |
? hash [hashkey + 1] |
258 |
: keymap.size (); |
259 |
|
260 |
for (; index < end; ++index) |
261 |
{ |
262 |
keysym_t *key = keymap [index]; |
263 |
|
264 |
if (key->keysym == keysym |
265 |
// match only the specified bits in state and ignore others |
266 |
&& (key->state & state) == key->state) |
267 |
return index; |
268 |
} |
269 |
|
270 |
return -1; |
271 |
} |
272 |
|
273 |
#endif /* KEYSYM_RESOURCE */ |
274 |
// vim:et:ts=2:sw=2 |