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