ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/keyboard.C
(Generate patch)

Comparing rxvt-unicode/src/keyboard.C (file contents):
Revision 1.18 by root, Mon Jan 2 21:17:01 2006 UTC vs.
Revision 1.51 by sf-exg, Thu Dec 1 11:27:34 2011 UTC

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 66
44#if STOCK_KEYMAP
45////////////////////////////////////////////////////////////////////////////////
46// default keycode translation map and keyevent handlers
47
48keysym_t keyboard_manager::stock_keymap[] = {
49 /* examples */
50 /* keysym, state, range, handler, str */
51//{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\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::NORMAL, "\033<C-Tab>"},
58//{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"},
59//{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"},
60//{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"},
61//{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"},
62//{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"},
63//{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"},
64//{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"},
65//{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"},
66//{ '.', ControlMask, 1, keysym_t::NORMAL, "\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
73static void 67static void
74output_string (rxvt_term *rt, const char *str) 68output_string (rxvt_term *term, const char *str)
75{ 69{
76 if (strncmp (str, "command:", 8) == 0) 70 if (strncmp (str, "command:", 8) == 0)
77 rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); 71 term->cmdbuf_append (str + 8, strlen (str) - 8);
78 else if (strncmp (str, "perl:", 5) == 0) 72 else if (strncmp (str, "perl:", 5) == 0)
79 PERL_INVOKE((rt, HOOK_KEYBOARD_COMMAND, DT_STRING, str + 5, DT_END)); 73 HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END));
80 else 74 else
81 rt->tt_write ((unsigned char *)str, strlen (str)); 75 term->tt_write (str, strlen (str));
82} 76}
83
84static void
85output_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 unsigned char ch = C0_ESC;
99 rt->tt_write (&ch, 1);
100 }
101 }
102
103 rt->tt_write ((unsigned char *) buf, buflen);
104}
105
106static int
107format_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
125static int
126bitcount (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 77
137// return: priority_of_a - priority_of_b 78// return: priority_of_a - priority_of_b
138static int 79static int
139compare_priority (keysym_t *a, keysym_t *b) 80compare_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 = ecb_popcount32 (a->state /* & OtherModMask */);
143 int cb = bitcount (b->state /* & OtherModMask */); 84 int cb = ecb_popcount32 (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 0;
151} 92}
152 93
153//////////////////////////////////////////////////////////////////////////////// 94////////////////////////////////////////////////////////////////////////////////
154keyboard_manager::keyboard_manager () 95keyboard_manager::keyboard_manager ()
155{ 96{
… …
157 hash [0] = 1; // hash[0] != 0 indicates uninitialized data 98 hash [0] = 1; // hash[0] != 0 indicates uninitialized data
158} 99}
159 100
160keyboard_manager::~keyboard_manager () 101keyboard_manager::~keyboard_manager ()
161{ 102{
162 clear ();
163}
164
165void
166keyboard_manager::clear ()
167{
168 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) 103 for (unsigned int i = 0; i < keymap.size (); ++i)
178 { 104 {
105 free (keymap [i]->str);
179 delete user_keymap [i]; 106 delete keymap [i];
180 user_keymap [i] = 0;
181 } 107 }
182
183 user_keymap.clear ();
184 user_translations.clear ();
185} 108}
186 109
187// a wrapper for register_keymap, 110// a wrapper for register_translation that converts the input string
188// so that outside codes don't have to know so much details. 111// to utf-8 and expands 'list' syntax.
189//
190// the string 'trans' is copied to an internal managed buffer,
191// so the caller can free memory of 'trans' at any time.
192void 112void
193keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 113keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans)
194{ 114{
115 wchar_t *ws = rxvt_mbstowcs (trans);
116 char *translation = rxvt_wcstoutf8 (ws);
117 free (ws);
118
119 if (strncmp (translation, "list", 4) == 0 && translation [4]
120 && strlen (translation) < STRING_MAX)
121 {
122 char *prefix = translation + 4;
123 char *middle = strchr (prefix + 1, translation [4]);
124 char *suffix = strrchr (prefix + 1, translation [4]);
125
126 if (suffix && middle && suffix > middle + 1)
127 {
128 int range = suffix - middle - 1;
129 int prefix_len = middle - prefix - 1;
130 char buf[STRING_MAX];
131
132 memcpy (buf, prefix + 1, prefix_len);
133 strcpy (buf + prefix_len + 1, suffix + 1);
134
135 for (int i = 0; i < range; i++)
136 {
137 buf [prefix_len] = middle [i + 1];
138 register_translation (keysym + i, state, strdup (buf));
139 }
140
141 free (translation);
142 return;
143 }
144 else
145 rxvt_warn ("unable to parse list-type keysym '%s', processing as normal keysym.\n", translation);
146 }
147
148 register_translation (keysym, state, translation);
149}
150
151void
152keyboard_manager::register_translation (KeySym keysym, unsigned int state, char *translation)
153{
195 keysym_t *key = new keysym_t; 154 keysym_t *key = new keysym_t;
196 wchar_t *wc = rxvt_mbstowcs (trans);
197 const char *translation = rxvt_wcstoutf8 (wc);
198 free (wc);
199 155
200 if (key && translation) 156 if (key && translation)
201 { 157 {
202 key->keysym = keysym; 158 key->keysym = keysym;
203 key->state = state; 159 key->state = state;
204 key->range = 1;
205 key->str = translation; 160 key->str = translation;
206 key->type = keysym_t::NORMAL; 161 key->type = keysym_t::STRING;
207 162
208 if (strncmp (translation, "list", 4) == 0 && translation [4])
209 {
210 char *middle = strchr (translation + 5, translation [4]);
211 char *suffix = strrchr (translation + 5, translation [4]);
212
213 if (suffix && middle && suffix > middle + 1)
214 {
215 key->type = keysym_t::LIST;
216 key->range = suffix - middle - 1;
217
218 strcpy (translation, translation + 4);
219 }
220 else
221 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation);
222 }
223 else if (strncmp (translation, "builtin:", 8) == 0) 163 if (strncmp (translation, "builtin:", 8) == 0)
224 key->type = keysym_t::BUILTIN; 164 key->type = keysym_t::BUILTIN;
225 165
166 if (keymap.size () == keymap.capacity ())
167 keymap.reserve (keymap.size () * 2);
168
226 user_keymap.push_back (key); 169 keymap.push_back (key);
227 user_translations.push_back (translation); 170 hash[0] = 3;
228 register_keymap (key);
229 } 171 }
230 else 172 else
231 { 173 {
232 delete key; 174 delete key;
233 free ((void *)translation); 175 free (translation);
234 rxvt_fatal ("out of memory, aborting.\n"); 176 rxvt_fatal ("memory allocation failure. aborting.\n");
235 } 177 }
236}
237
238void
239keyboard_manager::register_keymap (keysym_t *key)
240{
241 if (keymap.size () == keymap.capacity ())
242 keymap.reserve (keymap.size () * 2);
243
244 keymap.push_back (key);
245 hash[0] = 3;
246}
247
248void
249keyboard_manager::register_done ()
250{
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 ();
263} 178}
264 179
265bool 180bool
266keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 181keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state)
267{ 182{
268 assert (hash[0] == 0 && "register_done() need to be called"); 183 assert (("register_done() need to be called", hash[0] == 0));
269 184
270 state &= OtherModMask; // mask out uninteresting modifiers 185 state &= OtherModMask; // mask out uninteresting modifiers
271 186
272 if (state & term->ModMetaMask) state |= MetaMask; 187 if (state & term->ModMetaMask) state |= MetaMask;
273 if (state & term->ModNumLockMask) state |= NumLockMask; 188 if (state & term->ModNumLockMask) state |= NumLockMask;
… …
278 193
279 int index = find_keysym (keysym, state); 194 int index = find_keysym (keysym, state);
280 195
281 if (index >= 0) 196 if (index >= 0)
282 { 197 {
283 const keysym_t &key = *keymap [index]; 198 keysym_t *key = keymap [index];
284 199
285 if (key.type != keysym_t::BUILTIN) 200 if (key->type != keysym_t::BUILTIN)
286 { 201 {
287 int keysym_offset = keysym - key.keysym;
288
289 wchar_t *wc = rxvt_utf8towcs (key.str); 202 wchar_t *ws = rxvt_utf8towcs (key->str);
290 char *str = rxvt_wcstombs (wc); 203 char *str = rxvt_wcstombs (ws);
291 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) 204 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
292 free (wc); 205 free (ws);
293 206
294 switch (key.type)
295 {
296 case keysym_t::NORMAL:
297 output_string (term, str); 207 output_string (term, str);
298 break;
299
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:
321 {
322 char buf[STRING_MAX];
323
324 char *prefix, *middle, *suffix;
325
326 prefix = str;
327 middle = strchr (prefix + 1, *prefix);
328 suffix = strrchr (middle + 1, *prefix);
329
330 memcpy (buf, prefix + 1, middle - prefix - 1);
331 buf [middle - prefix - 1] = middle [keysym_offset + 1];
332 strcpy (buf + (middle - prefix), suffix + 1);
333
334 output_string (term, buf);
335 }
336 break;
337 }
338 208
339 free (str); 209 free (str);
340 210
341 return true; 211 return true;
342 } 212 }
343 } 213 }
344 214
345 return false; 215 return false;
346} 216}
347 217
348// purge duplicate keymap entries
349void 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
372void 218void
373keyboard_manager::setup_hash () 219keyboard_manager::register_done ()
374{ 220{
375 unsigned int i, index, hashkey; 221 unsigned int i, index, hashkey;
376 vector <keysym_t *> sorted_keymap; 222 vector <keysym_t *> sorted_keymap;
377 uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget 223 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 224
380 memset (hash_budget_size, 0, sizeof (hash_budget_size)); 225 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
381 memset (hash_budget_counter, 0, sizeof (hash_budget_counter));
382 226
383 // determine hash bucket size 227 // determine hash bucket size
384 for (i = 0; i < keymap.size (); ++i) 228 for (i = 0; i < keymap.size (); ++i)
385 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
386 { 229 {
387 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 230 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
388 ++hash_budget_size [hashkey]; 231 ++hash_bucket_size [hashkey];
389 } 232 }
390 233
391 // now we know the size of each budget 234 // now we know the size of each bucket
392 // compute the index of each budget 235 // compute the index of each bucket
393 hash [0] = 0; 236 hash [0] = 0;
394 for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) 237 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i)
395 { 238 {
396 index += hash_budget_size [i - 1]; 239 index += hash_bucket_size [i - 1];
397 hash [i] = index; 240 hash [i] = index;
398 } 241 }
399 242
400 // and allocate just enough space 243 // and allocate just enough space
401 sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); 244 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0);
245
246 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
402 247
403 // fill in sorted_keymap 248 // fill in sorted_keymap
404 // it is sorted in each budget 249 // it is sorted in each bucket
405 for (i = 0; i < keymap.size (); ++i) 250 for (i = 0; i < keymap.size (); ++i)
406 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
407 { 251 {
408 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 252 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
409 253
410 index = hash [hashkey] + hash_budget_counter [hashkey]; 254 index = hash [hashkey] + hash_bucket_size [hashkey];
411 255
412 while (index > hash [hashkey] 256 while (index > hash [hashkey]
413 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) 257 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0)
414 { 258 {
415 sorted_keymap [index] = sorted_keymap [index - 1]; 259 sorted_keymap [index] = sorted_keymap [index - 1];
416 --index; 260 --index;
417 } 261 }
418 262
419 sorted_keymap [index] = keymap [i]; 263 sorted_keymap [index] = keymap [i];
420 ++hash_budget_counter [hashkey]; 264 ++hash_bucket_size [hashkey];
421 } 265 }
422 266
423 keymap.swap (sorted_keymap); 267 keymap.swap (sorted_keymap);
424 268
425#if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) 269#ifndef NDEBUG
426 // check for invariants 270 // check for invariants
427 for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) 271 for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
428 { 272 {
429 index = hash[i]; 273 index = hash[i];
430 for (int j = 0; j < hash_budget_size [i]; ++j) 274 for (int j = 0; j < hash_bucket_size [i]; ++j)
431 { 275 {
432 if (keymap [index + j]->range == 1)
433 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); 276 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK));
434 277
435 if (j) 278 if (j)
436 assert (compare_priority (keymap [index + j - 1], 279 assert (compare_priority (keymap [index + j - 1],
437 keymap [index + j]) >= 0); 280 keymap [index + j]) >= 0);
438 } 281 }
… …
440 283
441 // this should be able to detect most possible bugs 284 // this should be able to detect most possible bugs
442 for (i = 0; i < sorted_keymap.size (); ++i) 285 for (i = 0; i < sorted_keymap.size (); ++i)
443 { 286 {
444 keysym_t *a = sorted_keymap[i]; 287 keysym_t *a = sorted_keymap[i];
445 for (int j = 0; j < a->range; ++j)
446 {
447 int index = find_keysym (a->keysym + j, a->state); 288 int index = find_keysym (a->keysym, a->state);
448 289
449 assert (index >= 0); 290 assert (index >= 0);
450 keysym_t *b = keymap [index]; 291 keysym_t *b = keymap [index];
451 assert (i == (signed) index || // the normally expected result 292 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 293 || a->keysym == b->keysym
453 } 294 && compare_priority (a, b) <= 0); // is effectively the same or a closer match
454 } 295 }
455#endif 296#endif
456} 297}
457 298
458int 299int
459keyboard_manager::find_keysym (KeySym keysym, unsigned int state) 300keyboard_manager::find_keysym (KeySym keysym, unsigned int state)
460{ 301{
461 int hashkey = keysym & KEYSYM_HASH_MASK; 302 int hashkey = keysym & KEYSYM_HASH_MASK;
462 unsigned int index = hash [hashkey]; 303 unsigned int index = hash [hashkey];
463 unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 304 unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1
464 ? hash [hashkey + 1] 305 ? hash [hashkey + 1]
465 : keymap.size (); 306 : keymap.size ();
466 307
467 for (; index < end; ++index) 308 for (; index < end; ++index)
468 { 309 {
469 keysym_t *key = keymap [index]; 310 keysym_t *key = keymap [index];
470 311
471 if (key->keysym <= keysym && keysym < key->keysym + key->range 312 if (key->keysym == keysym
472 // match only the specified bits in state and ignore others 313 // match only the specified bits in state and ignore others
473 && (key->state & state) == key->state) 314 && (key->state & state) == key->state)
474 return index; 315 return index;
475 } 316 }
476 317

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines