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