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.2 by root, Sun Jan 16 18:05:37 2005 UTC vs.
Revision 1.14 by root, Sat Mar 12 23:35:14 2005 UTC

1#include "../config.h" 1#include "../config.h"
2#include "rxvt.h" 2#include "rxvt.h"
3
4#ifdef KEYSYM_RESOURCE
5
6#include <cstring>
7
3#include "keyboard.h" 8#include "keyboard.h"
4#include "command.h" 9#include "command.h"
5#include <string.h>
6#include <X11/X.h>
7 10
8#ifdef KEYSYM_RESOURCE 11/* an intro to the data structure:
12 *
13 * vector keymap[] is grouped.
14 *
15 * inside each group, elements are sorted by the criteria given by compare_priority().
16 * the lookup of keysym is done in two steps:
17 * 1) locate the group corresponds to the keysym;
18 * 2) do a linear search inside the group.
19 *
20 * array hash[] effectively defines a map from a keysym to a group in keymap[].
21 *
22 * each group has its address(the index of first group element in keymap[]),
23 * which is computed and stored in hash[].
24 * hash[] stores the addresses in the form of:
25 * index: 0 I1 I2 I3 In
26 * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An
27 * where
28 * A1 = 0;
29 * Ai+1 = N1 + N2 + ... + Ni.
30 * it is computed from hash_budget_size[]:
31 * index: 0 I1 I2 I3 In
32 * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0
33 * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the compution of hash[])
34 * or we can say
35 * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0,
36 * where
37 * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym }
38 * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK
39 * n(the number of groups) = the number of non-zero member of hash_budget_size[];
40 * Ni(the size of group i) = hash_budget_size[Ii].
41 */
9 42
43#if STOCK_KEYMAP
10//////////////////////////////////////////////////////////////////////////////// 44////////////////////////////////////////////////////////////////////////////////
11// default keycode translation map and keyevent handlers 45// default keycode translation map and keyevent handlers
12 46
13keysym_t keyboard_manager::stock_keymap[] = { 47keysym_t keyboard_manager::stock_keymap[] = {
14 /* examples */ 48 /* examples */
15 /* keysym, state, range, handler, str */ 49 /* keysym, state, range, handler, str */
16//{XK_ISO_Left_Tab, 0, 1, NORMAL, "\033[Z"}, 50//{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"},
17//{ 'a', 0, 26, RANGE_META8, "a" "%c"}, 51//{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"},
18//{ 'a', ControlMask, 26, RANGE_META8, "" "%c"}, 52//{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"},
19//{ XK_Left, 0, 4, LIST, "DACBZ" "\033[Z"}, 53//{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."},
20//{ XK_Left, ShiftMask, 4, LIST, "dacbZ" "\033[Z"}, 54//{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."},
21//{ XK_Left, ControlMask, 4, LIST, "dacbZ" "\033OZ"}, 55//{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."},
22//{ XK_Tab, ControlMask, 1, NORMAL, "\033<C-Tab>"}, 56//{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033<C-Tab>"},
23//{ XK_apostrophe, ControlMask, 1, NORMAL, "\033<C-'>"}, 57//{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"},
24//{ XK_slash, ControlMask, 1, NORMAL, "\033<C-/>"}, 58//{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"},
25//{ XK_semicolon, ControlMask, 1, NORMAL, "\033<C-;>"}, 59//{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"},
26//{ XK_grave, ControlMask, 1, NORMAL, "\033<C-`>"}, 60//{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"},
27//{ XK_comma, ControlMask, 1, NORMAL, "\033<C-\054>"}, 61//{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"},
28//{ XK_Return, ControlMask, 1, NORMAL, "\033<C-Return>"}, 62//{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"},
29//{ XK_Return, ShiftMask, 1, NORMAL, "\033<S-Return>"}, 63//{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"},
30//{ ' ', ShiftMask, 1, NORMAL, "\033<S-Space>"}, 64//{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"},
31//{ '.', ControlMask, 1, NORMAL, "\033<C-.>"}, 65//{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"},
32//{ '0', ControlMask, 10, RANGE, "0" "\033<C-%c>"}, 66//{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"},
33//{ '0', MetaMask|ControlMask, 10, RANGE, "0" "\033<M-C-%c>"}, 67//{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"},
34//{ 'a', MetaMask|ControlMask, 26, RANGE, "a" "\033<M-C-%c>"}, 68//{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"},
35}; 69};
70#endif
36 71
37static void 72static void
38output_string (rxvt_term *rt, const char *str) 73output_string (rxvt_term *rt, const char *str)
39{ 74{
40 assert (rt && str);
41
42 if (strncmp (str, "proto:", 6) == 0) 75 if (strncmp (str, "command:", 8) == 0)
43 rt->cmd_write ((unsigned char *)str + 6, strlen (str) - 6); 76 rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8);
44 else 77 else
45 rt->tt_write ((unsigned char *)str, strlen (str)); 78 rt->tt_write ((unsigned char *)str, strlen (str));
46} 79}
47 80
48static void 81static void
… …
57 *ch |= 0x80; 90 *ch |= 0x80;
58 } 91 }
59 else if (rt->meta_char == C0_ESC) /* escape prefix */ 92 else if (rt->meta_char == C0_ESC) /* escape prefix */
60#endif 93#endif
61 { 94 {
62 const unsigned char 95 const unsigned char ch = C0_ESC;
63 ch = C0_ESC;
64 rt->tt_write (&ch, 1); 96 rt->tt_write (&ch, 1);
65 } 97 }
66 } 98 }
67 99
68 rt->tt_write ((unsigned char *) buf, buflen); 100 rt->tt_write ((unsigned char *) buf, buflen);
69} 101}
70 102
71static int 103static int
72format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) 104format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize)
73{ 105{
74 int len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); 106 size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]);
75 107
76 if (len >= bufsize) 108 if (len >= (size_t)bufsize)
77 {
78 fprintf (stderr, "buffer overflowed!\n");
79 buf[bufsize - 1] = '\0';
80 } 109 {
81 else if (len < 0) 110 rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n");
82 { 111 *buf = 0;
83 perror ("keyrange_translator()");
84 } 112 }
85 113
86 return len; 114 return len;
87} 115}
88 116
89//////////////////////////////////////////////////////////////////////////////// 117////////////////////////////////////////////////////////////////////////////////
90// return: #bits of '1' 118// return: #bits of '1'
119#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3)
120# define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n); }))
121#else
91static int 122static int
92bitcount (unsigned int n) 123bitcount (uint16_t n)
93{ 124{
94 int i; 125 int i;
95 126
96 for (i = 0; n; ++i, n &= (n - 1)) 127 for (i = 0; n; ++i, n &= n - 1)
97 ; 128 ;
98 129
99 return i; 130 return i;
100} 131}
132#endif
101 133
102// return: priority_of_a - priority_of_b 134// return: priority_of_a - priority_of_b
103static int 135static int
104compare_priority (keysym_t *a, keysym_t *b) 136compare_priority (keysym_t *a, keysym_t *b)
105{ 137{
106 assert (a && b);
107
108 // (the more '1's in state; the less range): the greater priority 138 // (the more '1's in state; the less range): the greater priority
109 int ca = bitcount (a->state /* & OtherModMask */); 139 int ca = bitcount (a->state /* & OtherModMask */);
110 int cb = bitcount (b->state /* & OtherModMask */); 140 int cb = bitcount (b->state /* & OtherModMask */);
111 141
112 if (ca != cb) 142 if (ca != cb)
… …
119 149
120//////////////////////////////////////////////////////////////////////////////// 150////////////////////////////////////////////////////////////////////////////////
121keyboard_manager::keyboard_manager () 151keyboard_manager::keyboard_manager ()
122{ 152{
123 keymap.reserve (256); 153 keymap.reserve (256);
124 hash[0] = 1; // hash[0] != 0 indicates uninitialized data 154 hash [0] = 1; // hash[0] != 0 indicates uninitialized data
125} 155}
126 156
127keyboard_manager::~keyboard_manager () 157keyboard_manager::~keyboard_manager ()
128{ 158{
129 clear (); 159 clear ();
… …
157// the string 'trans' is copied to an internal managed buffer, 187// the string 'trans' is copied to an internal managed buffer,
158// so the caller can free memory of 'trans' at any time. 188// so the caller can free memory of 'trans' at any time.
159void 189void
160keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 190keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans)
161{ 191{
162 assert (trans);
163
164 keysym_t *key = new keysym_t; 192 keysym_t *key = new keysym_t;
165 wchar_t *wc = rxvt_mbstowcs (trans); 193 wchar_t *wc = rxvt_mbstowcs (trans);
166 const char *translation = rxvt_wcstoutf8 (wc); 194 const char *translation = rxvt_wcstoutf8 (wc);
167 free (wc); 195 free (wc);
168 196
… …
185 key->range = suffix - middle - 1; 213 key->range = suffix - middle - 1;
186 214
187 strcpy (translation, translation + 4); 215 strcpy (translation, translation + 4);
188 } 216 }
189 else 217 else
190 {
191 key->range = 1;
192 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); 218 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation);
193 } 219 }
194 }
195 else
196 220
197 user_keymap.push_back (key); 221 user_keymap.push_back (key);
198 user_translations.push_back (translation); 222 user_translations.push_back (translation);
199 register_keymap (key); 223 register_keymap (key);
200 } 224 }
… …
207} 231}
208 232
209void 233void
210keyboard_manager::register_keymap (keysym_t *key) 234keyboard_manager::register_keymap (keysym_t *key)
211{ 235{
212 assert (key);
213 assert (key->range >= 1);
214
215 if (keymap.size () == keymap.capacity ()) 236 if (keymap.size () == keymap.capacity ())
216 keymap.reserve (keymap.size () * 2); 237 keymap.reserve (keymap.size () * 2);
217 238
218 keymap.push_back (key); 239 keymap.push_back (key);
219 hash[0] = 3; 240 hash[0] = 3;
220} 241}
221 242
222void 243void
223keyboard_manager::register_done () 244keyboard_manager::register_done ()
224{ 245{
246#if STOCK_KEYMAP
225 unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t); 247 int n = sizeof (stock_keymap) / sizeof (keysym_t);
226 248
249 //TODO: shield against repeated calls and empty keymap
227 if (keymap.back () != &stock_keymap[n - 1]) 250 //if (keymap.back () != &stock_keymap[n - 1])
228 for (i = 0; i < n; ++i) 251 for (int i = 0; i < n; ++i)
229 register_keymap (&stock_keymap[i]); 252 register_keymap (&stock_keymap[i]);
253#endif
230 254
231 purge_duplicate_keymap (); 255 purge_duplicate_keymap ();
232
233#if TO_BE_DONE_INSIDE_dispatch
234 for (i = 0; i < keymap.size (); ++i)
235 {
236 keysym_t *key = keymap[i];
237
238 assert (bitcount (term_->ModMetaMask) == 1 && "call me after ModMetaMask was set!");
239
240 if (key->state & MetaMask)
241 {
242 //key->state &= ~MetaMask;
243 key->state |= term_->ModMetaMask;
244 }
245
246 assert (bitcount (term_->ModNumLockMask) == 1 && "call me after ModNumLockMask was set!");
247
248 if (key->state & NumLockMask)
249 {
250 //key->state &= ~NumLockMask;
251 key->state |= term_->ModNumLockMask;
252 }
253 }
254#endif
255 256
256 setup_hash (); 257 setup_hash ();
257} 258}
258 259
259bool 260bool
260keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 261keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state)
261{ 262{
262 assert (hash[0] == 0 && "register_done() need to be called"); 263 assert (hash[0] == 0 && "register_done() need to be called");
263 264
265 state &= OtherModMask; // mask out uninteresting modifiers
266
267 if (state & term->ModMetaMask) state |= MetaMask;
268 if (state & term->ModNumLockMask) state |= NumLockMask;
269 if (state & term->ModLevel3Mask) state |= Level3Mask;
270
271 if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask))
272 state |= AppKeypadMask;
273
264 int index = find_keysym (keysym, state); 274 int index = find_keysym (keysym, state);
265 275
266 if (index >= 0) 276 if (index >= 0)
267 { 277 {
268 assert (term && keymap [index]);
269 const keysym_t &key = *keymap [index]; 278 const keysym_t &key = *keymap [index];
270 279
271 int keysym_offset = keysym - key.keysym; 280 int keysym_offset = keysym - key.keysym;
272 281
273 wchar_t *wc = rxvt_utf8towcs (key.str); 282 wchar_t *wc = rxvt_utf8towcs (key.str);
274 char *str = rxvt_wcstombs (wc); 283 char *str = rxvt_wcstombs (wc);
275 // TODO: do translations, unescaping etc, here (allow \u escape etc.) 284 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
276 free (wc); 285 free (wc);
277 286
278 switch (key.type) 287 switch (key.type)
279 { 288 {
280 case keysym_t::NORMAL: 289 case keysym_t::NORMAL:
… …
323 free (str); 332 free (str);
324 333
325 return true; 334 return true;
326 } 335 }
327 else 336 else
328 {
329 // fprintf(stderr,"[%x:%x]",state,keysym);
330 return false; 337 return false;
331 }
332} 338}
333 339
334// purge duplicate keymap entries 340// purge duplicate keymap entries
335void keyboard_manager::purge_duplicate_keymap () 341void keyboard_manager::purge_duplicate_keymap ()
336{ 342{
337 for (unsigned int i = 0; i < keymap.size (); ++i) 343 for (unsigned int i = 0; i < keymap.size (); ++i)
338 { 344 {
339 for (unsigned int j = 0; j < i; ++j) 345 for (unsigned int j = 0; j < i; ++j)
340 { 346 {
341 if (keymap[i] == keymap[j]) 347 if (keymap [i] == keymap [j])
342 { 348 {
343 while (keymap[i] == keymap.back ()) 349 while (keymap [i] == keymap.back ())
344 keymap.pop_back (); 350 keymap.pop_back ();
345 351
346 if (i < keymap.size ()) 352 if (i < keymap.size ())
347 { 353 {
348 keymap[i] = keymap.back (); 354 keymap[i] = keymap.back ();
349 keymap.pop_back (); 355 keymap.pop_back ();
350 } 356 }
357
351 break; 358 break;
352 } 359 }
353 } 360 }
354 } 361 }
355} 362}
… …
363 uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget 370 uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget
364 371
365 memset (hash_budget_size, 0, sizeof (hash_budget_size)); 372 memset (hash_budget_size, 0, sizeof (hash_budget_size));
366 memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); 373 memset (hash_budget_counter, 0, sizeof (hash_budget_counter));
367 374
368 // count keysyms for corresponding hash budgets 375 // determine hash bucket size
369 for (i = 0; i < keymap.size (); ++i) 376 for (i = 0; i < keymap.size (); ++i)
377 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
370 { 378 {
371 assert (keymap[i]);
372 hashkey = (keymap[i]->keysym & KEYSYM_HASH_MASK); 379 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK;
373 ++hash_budget_size[hashkey]; 380 ++hash_budget_size [hashkey];
374 }
375
376 // keysym A with range>1 is counted one more time for
377 // every keysym B lies in its range
378 for (i = 0; i < keymap.size (); ++i)
379 {
380 if (keymap[i]->range > 1)
381 {
382 for (int j = min (keymap[i]->range, KEYSYM_HASH_BUDGETS) - 1; j > 0; --j)
383 {
384 hashkey = ((keymap[i]->keysym + j) & KEYSYM_HASH_MASK);
385 if (hash_budget_size[hashkey])
386 ++hash_budget_size[hashkey];
387 }
388 } 381 }
389 }
390 382
391 // now we know the size of each budget 383 // now we know the size of each budget
392 // compute the index of each budget 384 // compute the index of each budget
393 hash[0] = 0; 385 hash [0] = 0;
394 for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) 386 for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i)
395 { 387 {
396 index += hash_budget_size[i - 1]; 388 index += hash_budget_size [i - 1];
397 hash[i] = (hash_budget_size[i] ? index : hash[i - 1]); 389 hash [i] = index;
398 } 390 }
399 391
400 // and allocate just enough space 392 // and allocate just enough space
401 //sorted_keymap.reserve (hash[i - 1] + hash_budget_size[i - 1]);
402 sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size[i - 1], 0); 393 sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0);
403 394
404 // fill in sorted_keymap 395 // fill in sorted_keymap
405 // it is sorted in each budget 396 // it is sorted in each budget
406 for (i = 0; i < keymap.size (); ++i) 397 for (i = 0; i < keymap.size (); ++i)
407 {
408 for (int j = min (keymap[i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) 398 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
409 { 399 {
410 hashkey = ((keymap[i]->keysym + j) & KEYSYM_HASH_MASK); 400 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK;
411 401
412 if (hash_budget_size[hashkey])
413 {
414 index = hash[hashkey] + hash_budget_counter[hashkey]; 402 index = hash [hashkey] + hash_budget_counter [hashkey];
415 403
416 while (index > hash[hashkey] 404 while (index > hash [hashkey]
417 && compare_priority (keymap[i], sorted_keymap[index - 1]) > 0) 405 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0)
418 { 406 {
419 sorted_keymap[index] = sorted_keymap[index - 1]; 407 sorted_keymap [index] = sorted_keymap [index - 1];
420 --index; 408 --index;
421 } 409 }
422 410
423 sorted_keymap[index] = keymap[i]; 411 sorted_keymap [index] = keymap [i];
424 ++hash_budget_counter[hashkey]; 412 ++hash_budget_counter [hashkey];
425 }
426 } 413 }
427 }
428 414
429 keymap.swap (sorted_keymap); 415 keymap.swap (sorted_keymap);
430 416
431#if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) 417#if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD)
432 // check for invariants 418 // check for invariants
433 for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) 419 for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i)
434 { 420 {
435 index = hash[i]; 421 index = hash[i];
436 for (int j = 0; j < hash_budget_size[i]; ++j) 422 for (int j = 0; j < hash_budget_size [i]; ++j)
437 { 423 {
438 if (keymap[index + j]->range == 1) 424 if (keymap [index + j]->range == 1)
439 assert (i == (keymap[index + j]->keysym & KEYSYM_HASH_MASK)); 425 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK));
440 426
441 if (j) 427 if (j)
442 assert (compare_priority (keymap[index + j - 1], 428 assert (compare_priority (keymap [index + j - 1],
443 keymap[index + j]) >= 0); 429 keymap [index + j]) >= 0);
444 } 430 }
445 } 431 }
446 432
447 // this should be able to detect most possible bugs 433 // this should be able to detect most possible bugs
448 for (i = 0; i < sorted_keymap.size (); ++i) 434 for (i = 0; i < sorted_keymap.size (); ++i)
449 { 435 {
450 keysym_t *a = sorted_keymap[i]; 436 keysym_t *a = sorted_keymap[i];
451 for (int j = 0; j < a->range; ++j) 437 for (int j = 0; j < a->range; ++j)
452 { 438 {
453 int index = find_keysym (a->keysym + j, a->state & OtherModMask); 439 int index = find_keysym (a->keysym + j, a->state);
440
454 assert (index >= 0); 441 assert (index >= 0);
455 keysym_t *b = keymap[index]; 442 keysym_t *b = keymap [index];
456 assert (i == (signed) index || // the normally expected result 443 assert (i == (signed) index || // the normally expected result
457 (a->keysym + j) >= b->keysym && (a->keysym + j) <= (b->keysym + b->range) && compare_priority (a, b) <= 0); // is effectively the same 444 (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
458 } 445 }
459 } 446 }
460#endif 447#endif
461} 448}
462 449
463int 450int
464keyboard_manager::find_keysym (KeySym keysym, unsigned int state) 451keyboard_manager::find_keysym (KeySym keysym, unsigned int state)
465{ 452{
466 int hashkey = keysym & KEYSYM_HASH_MASK; 453 int hashkey = keysym & KEYSYM_HASH_MASK;
467 unsigned int index = hash [hashkey]; 454 unsigned int index = hash [hashkey];
455 unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1
456 ? hash [hashkey + 1]
457 : keymap.size ();
468 458
469 for (; index < keymap.size (); ++index) 459 for (; index < end; ++index)
470 { 460 {
471 keysym_t *key = keymap[index]; 461 keysym_t *key = keymap [index];
472 assert (key);
473 462
474 if (key->keysym <= keysym && key->keysym + key->range > keysym 463 if (key->keysym <= keysym && keysym < key->keysym + key->range
475 // match only the specified bits in state and ignore others 464 // match only the specified bits in state and ignore others
476 && (key->state & OtherModMask) == (key->state & state)) 465 && (key->state & state) == key->state)
477 return index; 466 return index;
478 else if (key->keysym > keysym && key->range == 1)
479 return -1;
480 } 467 }
481 468
482 return -1; 469 return -1;
483} 470}
484 471

Diff Legend

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