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