|
|
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 | |
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 | |
… | |
… | |
26 | * index: 0 I1 I2 I3 In |
49 | * index: 0 I1 I2 I3 In |
27 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
50 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
28 | * where |
51 | * where |
29 | * A1 = 0; |
52 | * A1 = 0; |
30 | * Ai+1 = N1 + N2 + ... + Ni. |
53 | * Ai+1 = N1 + N2 + ... + Ni. |
31 | * it is computed from hash_budget_size[]: |
54 | * it is computed from hash_bucket_size[]: |
32 | * index: 0 I1 I2 I3 In |
55 | * index: 0 I1 I2 I3 In |
33 | * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
56 | * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
34 | * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the compution of hash[]) |
57 | * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[]) |
35 | * or we can say |
58 | * or we can say |
36 | * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0, |
59 | * hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, |
37 | * where |
60 | * where |
38 | * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
61 | * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
39 | * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK |
62 | * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK |
40 | * n(the number of groups) = the number of non-zero member of hash_budget_size[]; |
63 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
41 | * Ni(the size of group i) = hash_budget_size[Ii]. |
64 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
42 | */ |
65 | */ |
43 | |
|
|
44 | #if STOCK_KEYMAP |
|
|
45 | //////////////////////////////////////////////////////////////////////////////// |
|
|
46 | // default keycode translation map and keyevent handlers |
|
|
47 | |
|
|
48 | keysym_t keyboard_manager::stock_keymap[] = { |
|
|
49 | /* examples */ |
|
|
50 | /* keysym, state, range, handler, str */ |
|
|
51 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
|
|
52 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
|
|
53 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
|
|
54 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
|
|
55 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
|
|
56 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
|
|
57 | //{ XK_Tab, ControlMask, 1, keysym_t::STRING, "\033<C-Tab>"}, |
|
|
58 | //{ XK_apostrophe, ControlMask, 1, keysym_t::STRING, "\033<C-'>"}, |
|
|
59 | //{ XK_slash, ControlMask, 1, keysym_t::STRING, "\033<C-/>"}, |
|
|
60 | //{ XK_semicolon, ControlMask, 1, keysym_t::STRING, "\033<C-;>"}, |
|
|
61 | //{ XK_grave, ControlMask, 1, keysym_t::STRING, "\033<C-`>"}, |
|
|
62 | //{ XK_comma, ControlMask, 1, keysym_t::STRING, "\033<C-\054>"}, |
|
|
63 | //{ XK_Return, ControlMask, 1, keysym_t::STRING, "\033<C-Return>"}, |
|
|
64 | //{ XK_Return, ShiftMask, 1, keysym_t::STRING, "\033<S-Return>"}, |
|
|
65 | //{ ' ', ShiftMask, 1, keysym_t::STRING, "\033<S-Space>"}, |
|
|
66 | //{ '.', ControlMask, 1, keysym_t::STRING, "\033<C-.>"}, |
|
|
67 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
|
|
68 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
|
|
69 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
|
|
70 | }; |
|
|
71 | #endif |
|
|
72 | |
66 | |
73 | static void |
67 | static void |
74 | output_string (rxvt_term *rt, const char *str) |
68 | output_string (rxvt_term *rt, const char *str) |
75 | { |
69 | { |
76 | if (strncmp (str, "command:", 8) == 0) |
70 | if (strncmp (str, "command:", 8) == 0) |
… | |
… | |
79 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
73 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
80 | else |
74 | else |
81 | rt->tt_write (str, strlen (str)); |
75 | rt->tt_write (str, strlen (str)); |
82 | } |
76 | } |
83 | |
77 | |
84 | static void |
|
|
85 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
|
|
86 | { |
|
|
87 | if (state & rt->ModMetaMask) |
|
|
88 | { |
|
|
89 | #ifdef META8_OPTION |
|
|
90 | if (rt->meta_char == 0x80) /* set 8-bit on */ |
|
|
91 | { |
|
|
92 | for (char *ch = buf; ch < buf + buflen; ch++) |
|
|
93 | *ch |= 0x80; |
|
|
94 | } |
|
|
95 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
|
|
96 | #endif |
|
|
97 | { |
|
|
98 | const char ch = C0_ESC; |
|
|
99 | rt->tt_write (&ch, 1); |
|
|
100 | } |
|
|
101 | } |
|
|
102 | |
|
|
103 | rt->tt_write (buf, buflen); |
|
|
104 | } |
|
|
105 | |
|
|
106 | static int |
|
|
107 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
|
|
108 | { |
|
|
109 | size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); |
|
|
110 | |
|
|
111 | if (len >= (size_t)bufsize) |
|
|
112 | { |
|
|
113 | rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n"); |
|
|
114 | *buf = 0; |
|
|
115 | } |
|
|
116 | |
|
|
117 | return len; |
|
|
118 | } |
|
|
119 | |
|
|
120 | //////////////////////////////////////////////////////////////////////////////// |
|
|
121 | // return: #bits of '1' |
|
|
122 | #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) |
|
|
123 | # define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n__); })) |
|
|
124 | #else |
|
|
125 | static int |
|
|
126 | bitcount (uint16_t n) |
|
|
127 | { |
|
|
128 | int i; |
|
|
129 | |
|
|
130 | for (i = 0; n; ++i, n &= n - 1) |
|
|
131 | ; |
|
|
132 | |
|
|
133 | return i; |
|
|
134 | } |
|
|
135 | #endif |
|
|
136 | |
|
|
137 | // return: priority_of_a - priority_of_b |
78 | // return: priority_of_a - priority_of_b |
138 | static int |
79 | static int |
139 | compare_priority (keysym_t *a, keysym_t *b) |
80 | compare_priority (keysym_t *a, keysym_t *b) |
140 | { |
81 | { |
141 | // (the more '1's in state; the less range): the greater priority |
82 | // (the more '1's in state; the less range): the greater priority |
142 | int ca = bitcount (a->state /* & OtherModMask */); |
83 | int ca = rxvt_popcount (a->state /* & OtherModMask */); |
143 | int cb = bitcount (b->state /* & OtherModMask */); |
84 | int cb = rxvt_popcount (b->state /* & OtherModMask */); |
144 | |
85 | |
145 | if (ca != cb) |
86 | if (ca != cb) |
146 | return ca - cb; |
87 | return ca - cb; |
147 | //else if (a->state != b->state) // this behavior is to be disscussed |
88 | //else if (a->state != b->state) // this behavior is to be discussed |
148 | // return b->state - a->state; |
89 | // return b->state - a->state; |
149 | else |
90 | else |
150 | return b->range - a->range; |
91 | return b->range - a->range; |
151 | } |
92 | } |
152 | |
93 | |
… | |
… | |
163 | } |
104 | } |
164 | |
105 | |
165 | void |
106 | void |
166 | keyboard_manager::clear () |
107 | keyboard_manager::clear () |
167 | { |
108 | { |
|
|
109 | hash [0] = 2; |
|
|
110 | |
|
|
111 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
112 | { |
|
|
113 | free ((void *)keymap [i]->str); |
|
|
114 | delete keymap [i]; |
|
|
115 | keymap [i] = 0; |
|
|
116 | } |
|
|
117 | |
168 | keymap.clear (); |
118 | keymap.clear (); |
169 | hash [0] = 2; |
|
|
170 | |
|
|
171 | for (unsigned int i = 0; i < user_translations.size (); ++i) |
|
|
172 | { |
|
|
173 | free ((void *)user_translations [i]); |
|
|
174 | user_translations [i] = 0; |
|
|
175 | } |
|
|
176 | |
|
|
177 | for (unsigned int i = 0; i < user_keymap.size (); ++i) |
|
|
178 | { |
|
|
179 | delete user_keymap [i]; |
|
|
180 | user_keymap [i] = 0; |
|
|
181 | } |
|
|
182 | |
|
|
183 | user_keymap.clear (); |
|
|
184 | user_translations.clear (); |
|
|
185 | } |
119 | } |
186 | |
120 | |
187 | // a wrapper for register_keymap, |
121 | // a wrapper for register_keymap, |
188 | // so that outside codes don't have to know so much details. |
122 | // so that outside codes don't have to know so much details. |
189 | // |
123 | // |
… | |
… | |
207 | |
141 | |
208 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
142 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
209 | { |
143 | { |
210 | char *middle = strchr (translation + 5, translation [4]); |
144 | char *middle = strchr (translation + 5, translation [4]); |
211 | char *suffix = strrchr (translation + 5, translation [4]); |
145 | char *suffix = strrchr (translation + 5, translation [4]); |
212 | |
146 | |
213 | if (suffix && middle && suffix > middle + 1) |
147 | if (suffix && middle && suffix > middle + 1) |
214 | { |
148 | { |
215 | key->type = keysym_t::LIST; |
149 | key->type = keysym_t::LIST; |
216 | key->range = suffix - middle - 1; |
150 | key->range = suffix - middle - 1; |
217 | |
151 | |
218 | strcpy (translation, translation + 4); |
152 | memmove (translation, translation + 4, strlen (translation + 4) + 1); |
219 | } |
153 | } |
220 | else |
154 | else |
221 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
155 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
222 | } |
156 | } |
223 | else if (strncmp (translation, "builtin:", 8) == 0) |
157 | else if (strncmp (translation, "builtin:", 8) == 0) |
224 | key->type = keysym_t::BUILTIN; |
158 | key->type = keysym_t::BUILTIN; |
225 | |
159 | |
226 | user_keymap.push_back (key); |
|
|
227 | user_translations.push_back (translation); |
|
|
228 | register_keymap (key); |
160 | register_keymap (key); |
229 | } |
161 | } |
230 | else |
162 | else |
231 | { |
163 | { |
232 | delete key; |
164 | delete key; |
… | |
… | |
246 | } |
178 | } |
247 | |
179 | |
248 | void |
180 | void |
249 | keyboard_manager::register_done () |
181 | keyboard_manager::register_done () |
250 | { |
182 | { |
251 | #if STOCK_KEYMAP |
|
|
252 | int n = sizeof (stock_keymap) / sizeof (keysym_t); |
|
|
253 | |
|
|
254 | //TODO: shield against repeated calls and empty keymap |
|
|
255 | //if (keymap.back () != &stock_keymap[n - 1]) |
|
|
256 | for (int i = 0; i < n; ++i) |
|
|
257 | register_keymap (&stock_keymap[i]); |
|
|
258 | #endif |
|
|
259 | |
|
|
260 | purge_duplicate_keymap (); |
|
|
261 | |
|
|
262 | setup_hash (); |
183 | setup_hash (); |
263 | } |
184 | } |
264 | |
185 | |
265 | bool |
186 | bool |
266 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
187 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
… | |
… | |
295 | { |
216 | { |
296 | case keysym_t::STRING: |
217 | case keysym_t::STRING: |
297 | output_string (term, str); |
218 | output_string (term, str); |
298 | break; |
219 | break; |
299 | |
220 | |
300 | case keysym_t::RANGE: |
|
|
301 | { |
|
|
302 | char buf[STRING_MAX]; |
|
|
303 | |
|
|
304 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
|
|
305 | output_string (term, buf); |
|
|
306 | } |
|
|
307 | break; |
|
|
308 | |
|
|
309 | case keysym_t::RANGE_META8: |
|
|
310 | { |
|
|
311 | int len; |
|
|
312 | char buf[STRING_MAX]; |
|
|
313 | |
|
|
314 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
315 | if (len > 0) |
|
|
316 | output_string_meta8 (term, state, buf, len); |
|
|
317 | } |
|
|
318 | break; |
|
|
319 | |
|
|
320 | case keysym_t::LIST: |
221 | case keysym_t::LIST: |
321 | { |
222 | { |
322 | char buf[STRING_MAX]; |
223 | char buf[STRING_MAX]; |
323 | |
224 | |
324 | char *prefix, *middle, *suffix; |
225 | char *prefix, *middle, *suffix; |
… | |
… | |
343 | } |
244 | } |
344 | |
245 | |
345 | return false; |
246 | return false; |
346 | } |
247 | } |
347 | |
248 | |
348 | // purge duplicate keymap entries |
|
|
349 | void keyboard_manager::purge_duplicate_keymap () |
|
|
350 | { |
|
|
351 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
352 | { |
|
|
353 | for (unsigned int j = 0; j < i; ++j) |
|
|
354 | { |
|
|
355 | if (keymap [i] == keymap [j]) |
|
|
356 | { |
|
|
357 | while (keymap [i] == keymap.back ()) |
|
|
358 | keymap.pop_back (); |
|
|
359 | |
|
|
360 | if (i < keymap.size ()) |
|
|
361 | { |
|
|
362 | keymap[i] = keymap.back (); |
|
|
363 | keymap.pop_back (); |
|
|
364 | } |
|
|
365 | |
|
|
366 | break; |
|
|
367 | } |
|
|
368 | } |
|
|
369 | } |
|
|
370 | } |
|
|
371 | |
|
|
372 | void |
249 | void |
373 | keyboard_manager::setup_hash () |
250 | keyboard_manager::setup_hash () |
374 | { |
251 | { |
375 | unsigned int i, index, hashkey; |
252 | unsigned int i, index, hashkey; |
376 | vector <keysym_t *> sorted_keymap; |
253 | vector <keysym_t *> sorted_keymap; |
377 | uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget |
254 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
378 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
|
|
379 | |
255 | |
380 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
256 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
381 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
|
|
382 | |
257 | |
383 | // determine hash bucket size |
258 | // determine hash bucket size |
384 | for (i = 0; i < keymap.size (); ++i) |
259 | for (i = 0; i < keymap.size (); ++i) |
385 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
260 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
386 | { |
261 | { |
387 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
262 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
388 | ++hash_budget_size [hashkey]; |
263 | ++hash_bucket_size [hashkey]; |
389 | } |
264 | } |
390 | |
265 | |
391 | // now we know the size of each budget |
266 | // now we know the size of each bucket |
392 | // compute the index of each budget |
267 | // compute the index of each bucket |
393 | hash [0] = 0; |
268 | hash [0] = 0; |
394 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
269 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
395 | { |
270 | { |
396 | index += hash_budget_size [i - 1]; |
271 | index += hash_bucket_size [i - 1]; |
397 | hash [i] = index; |
272 | hash [i] = index; |
398 | } |
273 | } |
399 | |
274 | |
400 | // and allocate just enough space |
275 | // and allocate just enough space |
401 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
276 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
|
|
277 | |
|
|
278 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
402 | |
279 | |
403 | // fill in sorted_keymap |
280 | // fill in sorted_keymap |
404 | // it is sorted in each budget |
281 | // it is sorted in each bucket |
405 | for (i = 0; i < keymap.size (); ++i) |
282 | for (i = 0; i < keymap.size (); ++i) |
406 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
283 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
407 | { |
284 | { |
408 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
285 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
409 | |
286 | |
410 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
287 | index = hash [hashkey] + hash_bucket_size [hashkey]; |
411 | |
288 | |
412 | while (index > hash [hashkey] |
289 | while (index > hash [hashkey] |
413 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
290 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
414 | { |
291 | { |
415 | sorted_keymap [index] = sorted_keymap [index - 1]; |
292 | sorted_keymap [index] = sorted_keymap [index - 1]; |
416 | --index; |
293 | --index; |
417 | } |
294 | } |
418 | |
295 | |
419 | sorted_keymap [index] = keymap [i]; |
296 | sorted_keymap [index] = keymap [i]; |
420 | ++hash_budget_counter [hashkey]; |
297 | ++hash_bucket_size [hashkey]; |
421 | } |
298 | } |
422 | |
299 | |
423 | keymap.swap (sorted_keymap); |
300 | keymap.swap (sorted_keymap); |
424 | |
301 | |
425 | #ifdef DEBUG_STRICT |
302 | #ifndef NDEBUG |
426 | // check for invariants |
303 | // check for invariants |
427 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
304 | for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
428 | { |
305 | { |
429 | index = hash[i]; |
306 | index = hash[i]; |
430 | for (int j = 0; j < hash_budget_size [i]; ++j) |
307 | for (int j = 0; j < hash_bucket_size [i]; ++j) |
431 | { |
308 | { |
432 | if (keymap [index + j]->range == 1) |
309 | if (keymap [index + j]->range == 1) |
433 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
310 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
434 | |
311 | |
435 | if (j) |
312 | if (j) |
… | |
… | |
446 | { |
323 | { |
447 | int index = find_keysym (a->keysym + j, a->state); |
324 | int index = find_keysym (a->keysym + j, a->state); |
448 | |
325 | |
449 | assert (index >= 0); |
326 | assert (index >= 0); |
450 | keysym_t *b = keymap [index]; |
327 | keysym_t *b = keymap [index]; |
451 | assert (i == (signed) index || // the normally expected result |
328 | assert (i == index // the normally expected result |
452 | (a->keysym + j) >= b->keysym && (a->keysym + j) <= (b->keysym + b->range) && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
329 | || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range) |
|
|
330 | && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
453 | } |
331 | } |
454 | } |
332 | } |
455 | #endif |
333 | #endif |
456 | } |
334 | } |
457 | |
335 | |
458 | int |
336 | int |
459 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
337 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
460 | { |
338 | { |
461 | int hashkey = keysym & KEYSYM_HASH_MASK; |
339 | int hashkey = keysym & KEYSYM_HASH_MASK; |
462 | unsigned int index = hash [hashkey]; |
340 | unsigned int index = hash [hashkey]; |
463 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
341 | unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 |
464 | ? hash [hashkey + 1] |
342 | ? hash [hashkey + 1] |
465 | : keymap.size (); |
343 | : keymap.size (); |
466 | |
344 | |
467 | for (; index < end; ++index) |
345 | for (; index < end; ++index) |
468 | { |
346 | { |
469 | keysym_t *key = keymap [index]; |
347 | keysym_t *key = keymap [index]; |