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

Diff Legend

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