|
|
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 <pcg@goof.com> |
|
|
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 | |
1 | #include "../config.h" |
24 | #include "../config.h" |
2 | #include "rxvt.h" |
25 | #include "rxvt.h" |
3 | |
26 | |
4 | #ifdef KEYSYM_RESOURCE |
27 | #ifdef KEYSYM_RESOURCE |
5 | |
28 | |
6 | #include <cstring> |
29 | #include <cstring> |
7 | |
30 | |
|
|
31 | #include "rxvtperl.h" |
8 | #include "keyboard.h" |
32 | #include "keyboard.h" |
9 | #include "command.h" |
33 | #include "command.h" |
10 | |
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_budget_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 compution of hash[]) |
|
|
58 | * or we can say |
|
|
59 | * hash_budget_size[Ii] = Ni; hash_budget_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_budget_size[]; |
|
|
64 | * Ni(the size of group i) = hash_budget_size[Ii]. |
|
|
65 | */ |
|
|
66 | |
|
|
67 | #if STOCK_KEYMAP |
11 | //////////////////////////////////////////////////////////////////////////////// |
68 | //////////////////////////////////////////////////////////////////////////////// |
12 | // default keycode translation map and keyevent handlers |
69 | // default keycode translation map and keyevent handlers |
13 | |
70 | |
14 | keysym_t keyboard_manager::stock_keymap[] = { |
71 | keysym_t keyboard_manager::stock_keymap[] = { |
15 | /* examples */ |
72 | /* examples */ |
16 | /* keysym, state, range, handler, str */ |
73 | /* keysym, state, range, handler, str */ |
17 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"}, |
74 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
18 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
75 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
19 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
76 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
20 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
77 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
21 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
78 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
22 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
79 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
23 | //{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033<C-Tab>"}, |
80 | //{ XK_Tab, ControlMask, 1, keysym_t::STRING, "\033<C-Tab>"}, |
24 | //{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"}, |
81 | //{ XK_apostrophe, ControlMask, 1, keysym_t::STRING, "\033<C-'>"}, |
25 | //{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"}, |
82 | //{ XK_slash, ControlMask, 1, keysym_t::STRING, "\033<C-/>"}, |
26 | //{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"}, |
83 | //{ XK_semicolon, ControlMask, 1, keysym_t::STRING, "\033<C-;>"}, |
27 | //{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"}, |
84 | //{ XK_grave, ControlMask, 1, keysym_t::STRING, "\033<C-`>"}, |
28 | //{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"}, |
85 | //{ XK_comma, ControlMask, 1, keysym_t::STRING, "\033<C-\054>"}, |
29 | //{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"}, |
86 | //{ XK_Return, ControlMask, 1, keysym_t::STRING, "\033<C-Return>"}, |
30 | //{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"}, |
87 | //{ XK_Return, ShiftMask, 1, keysym_t::STRING, "\033<S-Return>"}, |
31 | //{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"}, |
88 | //{ ' ', ShiftMask, 1, keysym_t::STRING, "\033<S-Space>"}, |
32 | //{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, |
89 | //{ '.', ControlMask, 1, keysym_t::STRING, "\033<C-.>"}, |
33 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
90 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
34 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
91 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
35 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
92 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
36 | }; |
93 | }; |
|
|
94 | #endif |
37 | |
95 | |
38 | static void |
96 | static void |
39 | output_string (rxvt_term *rt, const char *str) |
97 | output_string (rxvt_term *rt, const char *str) |
40 | { |
98 | { |
41 | if (strncmp (str, "command:", 8) == 0) |
99 | if (strncmp (str, "command:", 8) == 0) |
42 | rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); |
100 | rt->cmd_write (str + 8, strlen (str) - 8); |
|
|
101 | else if (strncmp (str, "perl:", 5) == 0) |
|
|
102 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
43 | else |
103 | else |
44 | rt->tt_write ((unsigned char *)str, strlen (str)); |
104 | rt->tt_write (str, strlen (str)); |
45 | } |
105 | } |
46 | |
106 | |
47 | static void |
107 | static void |
48 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
108 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
49 | { |
109 | { |
… | |
… | |
56 | *ch |= 0x80; |
116 | *ch |= 0x80; |
57 | } |
117 | } |
58 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
118 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
59 | #endif |
119 | #endif |
60 | { |
120 | { |
61 | const unsigned char ch = C0_ESC; |
121 | const char ch = C0_ESC; |
62 | rt->tt_write (&ch, 1); |
122 | rt->tt_write (&ch, 1); |
63 | } |
123 | } |
64 | } |
124 | } |
65 | |
125 | |
66 | rt->tt_write ((unsigned char *) buf, buflen); |
126 | rt->tt_write (buf, buflen); |
67 | } |
127 | } |
68 | |
128 | |
69 | static int |
129 | static int |
70 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
130 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
71 | { |
131 | { |
… | |
… | |
81 | } |
141 | } |
82 | |
142 | |
83 | //////////////////////////////////////////////////////////////////////////////// |
143 | //////////////////////////////////////////////////////////////////////////////// |
84 | // return: #bits of '1' |
144 | // return: #bits of '1' |
85 | #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) |
145 | #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) |
86 | # define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n); })) |
146 | # define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n__); })) |
87 | #else |
147 | #else |
88 | static int |
148 | static int |
89 | bitcount (uint16_t n) |
149 | bitcount (uint16_t n) |
90 | { |
150 | { |
91 | int i; |
151 | int i; |
… | |
… | |
155 | void |
215 | void |
156 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
216 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
157 | { |
217 | { |
158 | keysym_t *key = new keysym_t; |
218 | keysym_t *key = new keysym_t; |
159 | wchar_t *wc = rxvt_mbstowcs (trans); |
219 | wchar_t *wc = rxvt_mbstowcs (trans); |
160 | const char *translation = rxvt_wcstoutf8 (wc); |
220 | char *translation = rxvt_wcstoutf8 (wc); |
161 | free (wc); |
221 | free (wc); |
162 | |
222 | |
163 | if (key && translation) |
223 | if (key && translation) |
164 | { |
224 | { |
165 | key->keysym = keysym; |
225 | key->keysym = keysym; |
166 | key->state = state; |
226 | key->state = state; |
167 | key->range = 1; |
227 | key->range = 1; |
168 | key->str = translation; |
228 | key->str = translation; |
169 | key->type = keysym_t::NORMAL; |
229 | key->type = keysym_t::STRING; |
170 | |
230 | |
171 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
231 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
172 | { |
232 | { |
173 | char *middle = strchr (translation + 5, translation [4]); |
233 | char *middle = strchr (translation + 5, translation [4]); |
174 | char *suffix = strrchr (translation + 5, translation [4]); |
234 | char *suffix = strrchr (translation + 5, translation [4]); |
… | |
… | |
176 | if (suffix && middle && suffix > middle + 1) |
236 | if (suffix && middle && suffix > middle + 1) |
177 | { |
237 | { |
178 | key->type = keysym_t::LIST; |
238 | key->type = keysym_t::LIST; |
179 | key->range = suffix - middle - 1; |
239 | key->range = suffix - middle - 1; |
180 | |
240 | |
181 | strcpy (translation, translation + 4); |
241 | memmove (translation, translation + 4, strlen (translation + 4) + 1); |
182 | } |
242 | } |
183 | else |
243 | else |
184 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
244 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
185 | } |
245 | } |
|
|
246 | else if (strncmp (translation, "builtin:", 8) == 0) |
|
|
247 | key->type = keysym_t::BUILTIN; |
186 | |
248 | |
187 | user_keymap.push_back (key); |
249 | user_keymap.push_back (key); |
188 | user_translations.push_back (translation); |
250 | user_translations.push_back (translation); |
189 | register_keymap (key); |
251 | register_keymap (key); |
190 | } |
252 | } |
… | |
… | |
207 | } |
269 | } |
208 | |
270 | |
209 | void |
271 | void |
210 | keyboard_manager::register_done () |
272 | keyboard_manager::register_done () |
211 | { |
273 | { |
|
|
274 | #if STOCK_KEYMAP |
212 | unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t); |
275 | int n = sizeof (stock_keymap) / sizeof (keysym_t); |
213 | |
276 | |
|
|
277 | //TODO: shield against repeated calls and empty keymap |
214 | if (keymap.back () != &stock_keymap[n - 1]) |
278 | //if (keymap.back () != &stock_keymap[n - 1]) |
215 | for (i = 0; i < n; ++i) |
279 | for (int i = 0; i < n; ++i) |
216 | register_keymap (&stock_keymap[i]); |
280 | register_keymap (&stock_keymap[i]); |
|
|
281 | #endif |
217 | |
282 | |
218 | purge_duplicate_keymap (); |
283 | purge_duplicate_keymap (); |
219 | |
284 | |
220 | setup_hash (); |
285 | setup_hash (); |
221 | } |
286 | } |
222 | |
287 | |
223 | bool |
288 | bool |
224 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
289 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
225 | { |
290 | { |
226 | assert (hash[0] == 0 && "register_done() need to be called"); |
291 | assert (hash[0] == 0 && "register_done() need to be called"); |
|
|
292 | |
|
|
293 | state &= OtherModMask; // mask out uninteresting modifiers |
227 | |
294 | |
228 | if (state & term->ModMetaMask) state |= MetaMask; |
295 | if (state & term->ModMetaMask) state |= MetaMask; |
229 | if (state & term->ModNumLockMask) state |= NumLockMask; |
296 | if (state & term->ModNumLockMask) state |= NumLockMask; |
230 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
297 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
231 | |
298 | |
… | |
… | |
236 | |
303 | |
237 | if (index >= 0) |
304 | if (index >= 0) |
238 | { |
305 | { |
239 | const keysym_t &key = *keymap [index]; |
306 | const keysym_t &key = *keymap [index]; |
240 | |
307 | |
|
|
308 | if (key.type != keysym_t::BUILTIN) |
|
|
309 | { |
241 | int keysym_offset = keysym - key.keysym; |
310 | int keysym_offset = keysym - key.keysym; |
242 | |
311 | |
243 | wchar_t *wc = rxvt_utf8towcs (key.str); |
312 | wchar_t *wc = rxvt_utf8towcs (key.str); |
244 | |
|
|
245 | char *str = rxvt_wcstombs (wc); |
313 | char *str = rxvt_wcstombs (wc); |
246 | // TODO: do translations, unescaping etc, here (allow \u escape etc.) |
314 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
247 | free (wc); |
315 | free (wc); |
248 | |
316 | |
249 | switch (key.type) |
317 | switch (key.type) |
250 | { |
|
|
251 | case keysym_t::NORMAL: |
|
|
252 | output_string (term, str); |
|
|
253 | break; |
|
|
254 | |
|
|
255 | case keysym_t::RANGE: |
|
|
256 | { |
318 | { |
|
|
319 | case keysym_t::STRING: |
|
|
320 | output_string (term, str); |
|
|
321 | break; |
|
|
322 | |
|
|
323 | case keysym_t::RANGE: |
|
|
324 | { |
257 | char buf[STRING_MAX]; |
325 | char buf[STRING_MAX]; |
258 | |
326 | |
259 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
327 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
|
|
328 | output_string (term, buf); |
|
|
329 | } |
|
|
330 | break; |
|
|
331 | |
|
|
332 | case keysym_t::RANGE_META8: |
|
|
333 | { |
|
|
334 | int len; |
|
|
335 | char buf[STRING_MAX]; |
|
|
336 | |
|
|
337 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
338 | if (len > 0) |
|
|
339 | output_string_meta8 (term, state, buf, len); |
|
|
340 | } |
|
|
341 | break; |
|
|
342 | |
|
|
343 | case keysym_t::LIST: |
|
|
344 | { |
|
|
345 | char buf[STRING_MAX]; |
|
|
346 | |
|
|
347 | char *prefix, *middle, *suffix; |
|
|
348 | |
|
|
349 | prefix = str; |
|
|
350 | middle = strchr (prefix + 1, *prefix); |
|
|
351 | suffix = strrchr (middle + 1, *prefix); |
|
|
352 | |
|
|
353 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
354 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
355 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
356 | |
260 | output_string (term, buf); |
357 | output_string (term, buf); |
|
|
358 | } |
|
|
359 | break; |
261 | } |
360 | } |
262 | break; |
|
|
263 | |
361 | |
264 | case keysym_t::RANGE_META8: |
|
|
265 | { |
|
|
266 | int len; |
|
|
267 | char buf[STRING_MAX]; |
|
|
268 | |
|
|
269 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
270 | if (len > 0) |
|
|
271 | output_string_meta8 (term, state, buf, len); |
|
|
272 | } |
|
|
273 | break; |
|
|
274 | |
|
|
275 | case keysym_t::LIST: |
|
|
276 | { |
|
|
277 | char buf[STRING_MAX]; |
|
|
278 | |
|
|
279 | char *prefix, *middle, *suffix; |
|
|
280 | |
|
|
281 | prefix = str; |
|
|
282 | middle = strchr (prefix + 1, *prefix); |
|
|
283 | suffix = strrchr (middle + 1, *prefix); |
|
|
284 | |
|
|
285 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
286 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
287 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
288 | |
|
|
289 | output_string (term, buf); |
|
|
290 | } |
|
|
291 | break; |
|
|
292 | } |
|
|
293 | |
|
|
294 | free (str); |
362 | free (str); |
295 | |
363 | |
296 | return true; |
364 | return true; |
297 | } |
365 | } |
298 | else |
|
|
299 | { |
366 | } |
300 | // fprintf(stderr,"[%x:%x]",state,keysym); |
367 | |
301 | return false; |
368 | return false; |
302 | } |
|
|
303 | } |
369 | } |
304 | |
370 | |
305 | // purge duplicate keymap entries |
371 | // purge duplicate keymap entries |
306 | void keyboard_manager::purge_duplicate_keymap () |
372 | void keyboard_manager::purge_duplicate_keymap () |
307 | { |
373 | { |
… | |
… | |
317 | if (i < keymap.size ()) |
383 | if (i < keymap.size ()) |
318 | { |
384 | { |
319 | keymap[i] = keymap.back (); |
385 | keymap[i] = keymap.back (); |
320 | keymap.pop_back (); |
386 | keymap.pop_back (); |
321 | } |
387 | } |
|
|
388 | |
322 | break; |
389 | break; |
323 | } |
390 | } |
324 | } |
391 | } |
325 | } |
392 | } |
326 | } |
393 | } |
… | |
… | |
334 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
401 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
335 | |
402 | |
336 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
403 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
337 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
404 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
338 | |
405 | |
339 | // count keysyms for corresponding hash budgets |
406 | // determine hash bucket size |
340 | for (i = 0; i < keymap.size (); ++i) |
407 | for (i = 0; i < keymap.size (); ++i) |
|
|
408 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
341 | { |
409 | { |
342 | hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
410 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
343 | ++hash_budget_size [hashkey]; |
411 | ++hash_budget_size [hashkey]; |
344 | } |
|
|
345 | |
|
|
346 | // a keysym_t with range>1 is counted one more time for every keysym that |
|
|
347 | // lies in its range |
|
|
348 | for (i = 0; i < keymap.size (); ++i) |
|
|
349 | { |
|
|
350 | if (keymap[i]->range > 1) |
|
|
351 | { |
|
|
352 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j > 0; --j) |
|
|
353 | { |
|
|
354 | hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); |
|
|
355 | if (hash_budget_size [hashkey]) |
|
|
356 | ++hash_budget_size [hashkey]; |
|
|
357 | } |
|
|
358 | } |
412 | } |
359 | } |
|
|
360 | |
413 | |
361 | // now we know the size of each budget |
414 | // now we know the size of each budget |
362 | // compute the index of each budget |
415 | // compute the index of each budget |
363 | hash [0] = 0; |
416 | hash [0] = 0; |
364 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
417 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
365 | { |
418 | { |
366 | index += hash_budget_size [i - 1]; |
419 | index += hash_budget_size [i - 1]; |
367 | hash[i] = (hash_budget_size [i] ? index : hash [i - 1]); |
420 | hash [i] = index; |
368 | } |
421 | } |
369 | |
422 | |
370 | // and allocate just enough space |
423 | // and allocate just enough space |
371 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
424 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
372 | |
425 | |
373 | // fill in sorted_keymap |
426 | // fill in sorted_keymap |
374 | // it is sorted in each budget |
427 | // it is sorted in each budget |
375 | for (i = 0; i < keymap.size (); ++i) |
428 | for (i = 0; i < keymap.size (); ++i) |
376 | { |
|
|
377 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
429 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
378 | { |
430 | { |
379 | hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); |
431 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
380 | |
432 | |
381 | if (hash_budget_size [hashkey]) |
|
|
382 | { |
|
|
383 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
433 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
384 | |
434 | |
385 | while (index > hash [hashkey] |
435 | while (index > hash [hashkey] |
386 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
436 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
387 | { |
437 | { |
388 | sorted_keymap [index] = sorted_keymap [index - 1]; |
438 | sorted_keymap [index] = sorted_keymap [index - 1]; |
389 | --index; |
439 | --index; |
390 | } |
440 | } |
391 | |
441 | |
392 | sorted_keymap [index] = keymap [i]; |
442 | sorted_keymap [index] = keymap [i]; |
393 | ++hash_budget_counter [hashkey]; |
443 | ++hash_budget_counter [hashkey]; |
394 | } |
|
|
395 | } |
444 | } |
396 | } |
|
|
397 | |
445 | |
398 | keymap.swap (sorted_keymap); |
446 | keymap.swap (sorted_keymap); |
399 | |
447 | |
400 | #if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) |
448 | #ifdef DEBUG_STRICT |
401 | // check for invariants |
449 | // check for invariants |
402 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
450 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
403 | { |
451 | { |
404 | index = hash[i]; |
452 | index = hash[i]; |
405 | for (int j = 0; j < hash_budget_size [i]; ++j) |
453 | for (int j = 0; j < hash_budget_size [i]; ++j) |
… | |
… | |
433 | int |
481 | int |
434 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
482 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
435 | { |
483 | { |
436 | int hashkey = keysym & KEYSYM_HASH_MASK; |
484 | int hashkey = keysym & KEYSYM_HASH_MASK; |
437 | unsigned int index = hash [hashkey]; |
485 | unsigned int index = hash [hashkey]; |
|
|
486 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
|
|
487 | ? hash [hashkey + 1] |
|
|
488 | : keymap.size (); |
438 | |
489 | |
439 | for (; index < keymap.size (); ++index) |
490 | for (; index < end; ++index) |
440 | { |
491 | { |
441 | keysym_t *key = keymap [index]; |
492 | keysym_t *key = keymap [index]; |
442 | |
493 | |
443 | if (key->keysym <= keysym && key->keysym + key->range > keysym |
494 | if (key->keysym <= keysym && keysym < key->keysym + key->range |
444 | // match only the specified bits in state and ignore others |
495 | // match only the specified bits in state and ignore others |
445 | && (key->state & state) == key->state) |
496 | && (key->state & state) == key->state) |
446 | return index; |
497 | return index; |
447 | else if ((key->keysym & KEYSYM_HASH_MASK) > hashkey && key->range == 1) |
|
|
448 | return -1; |
|
|
449 | } |
498 | } |
450 | |
499 | |
451 | return -1; |
500 | return -1; |
452 | } |
501 | } |
453 | |
502 | |