|
|
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 <pcg@goof.com> |
|
|
8 | * |
|
|
9 | * This program is free software; you can redistribute it and/or modify |
|
|
10 | * it under the terms of the GNU General Public License as published by |
|
|
11 | * the Free Software Foundation; either version 2 of the License, or |
|
|
12 | * (at your option) any later version. |
|
|
13 | * |
|
|
14 | * This program is distributed in the hope that it will be useful, |
|
|
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
|
|
17 | * GNU General Public License for more details. |
|
|
18 | * |
|
|
19 | * You should have received a copy of the GNU General Public License |
|
|
20 | * along with this program; if not, write to the Free Software |
|
|
21 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
22 | *----------------------------------------------------------------------*/ |
|
|
23 | |
1 | #include "../config.h" |
24 | #include "../config.h" |
2 | #include "rxvt.h" |
25 | #include "rxvt.h" |
3 | |
26 | |
4 | #ifdef KEYSYM_RESOURCE |
27 | #ifdef KEYSYM_RESOURCE |
5 | |
28 | |
6 | #include <cstring> |
29 | #include <cstring> |
7 | |
30 | |
|
|
31 | #include "rxvtperl.h" |
8 | #include "keyboard.h" |
32 | #include "keyboard.h" |
9 | #include "command.h" |
33 | #include "command.h" |
|
|
34 | |
|
|
35 | /* an intro to the data structure: |
|
|
36 | * |
|
|
37 | * vector keymap[] is grouped. |
|
|
38 | * |
|
|
39 | * inside each group, elements are sorted by the criteria given by compare_priority(). |
|
|
40 | * the lookup of keysym is done in two steps: |
|
|
41 | * 1) locate the group corresponds to the keysym; |
|
|
42 | * 2) do a linear search inside the group. |
|
|
43 | * |
|
|
44 | * array hash[] effectively defines a map from a keysym to a group in keymap[]. |
|
|
45 | * |
|
|
46 | * each group has its address(the index of first group element in keymap[]), |
|
|
47 | * which is computed and stored in hash[]. |
|
|
48 | * hash[] stores the addresses in the form of: |
|
|
49 | * index: 0 I1 I2 I3 In |
|
|
50 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
|
|
51 | * where |
|
|
52 | * A1 = 0; |
|
|
53 | * Ai+1 = N1 + N2 + ... + Ni. |
|
|
54 | * it is computed from hash_budget_size[]: |
|
|
55 | * index: 0 I1 I2 I3 In |
|
|
56 | * 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[]) |
|
|
58 | * or we can say |
|
|
59 | * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0, |
|
|
60 | * where |
|
|
61 | * 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 |
|
|
63 | * n(the number of groups) = the number of non-zero member of hash_budget_size[]; |
|
|
64 | * Ni(the size of group i) = hash_budget_size[Ii]. |
|
|
65 | */ |
10 | |
66 | |
11 | #if STOCK_KEYMAP |
67 | #if STOCK_KEYMAP |
12 | //////////////////////////////////////////////////////////////////////////////// |
68 | //////////////////////////////////////////////////////////////////////////////// |
13 | // default keycode translation map and keyevent handlers |
69 | // default keycode translation map and keyevent handlers |
14 | |
70 | |
15 | keysym_t keyboard_manager::stock_keymap[] = { |
71 | keysym_t keyboard_manager::stock_keymap[] = { |
16 | /* examples */ |
72 | /* examples */ |
17 | /* keysym, state, range, handler, str */ |
73 | /* keysym, state, range, type, str */ |
18 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"}, |
74 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
19 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
75 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
20 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
76 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
21 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
77 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
22 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
78 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
23 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
79 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
24 | //{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033<C-Tab>"}, |
80 | //{ XK_Tab, ControlMask, 1, keysym_t::STRING, "\033<C-Tab>"}, |
25 | //{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"}, |
81 | //{ XK_apostrophe, ControlMask, 1, keysym_t::STRING, "\033<C-'>"}, |
26 | //{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"}, |
82 | //{ XK_slash, ControlMask, 1, keysym_t::STRING, "\033<C-/>"}, |
27 | //{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"}, |
83 | //{ XK_semicolon, ControlMask, 1, keysym_t::STRING, "\033<C-;>"}, |
28 | //{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"}, |
84 | //{ XK_grave, ControlMask, 1, keysym_t::STRING, "\033<C-`>"}, |
29 | //{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"}, |
85 | //{ XK_comma, ControlMask, 1, keysym_t::STRING, "\033<C-\054>"}, |
30 | //{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"}, |
86 | //{ XK_Return, ControlMask, 1, keysym_t::STRING, "\033<C-Return>"}, |
31 | //{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"}, |
87 | //{ XK_Return, ShiftMask, 1, keysym_t::STRING, "\033<S-Return>"}, |
32 | //{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"}, |
88 | //{ ' ', ShiftMask, 1, keysym_t::STRING, "\033<S-Space>"}, |
33 | //{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, |
89 | //{ '.', ControlMask, 1, keysym_t::STRING, "\033<C-.>"}, |
34 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
90 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
35 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
91 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
36 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
92 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
37 | }; |
93 | }; |
38 | #endif |
94 | #endif |
39 | |
95 | |
40 | static void |
96 | static void |
41 | output_string (rxvt_term *rt, const char *str) |
97 | output_string (rxvt_term *rt, const char *str) |
42 | { |
98 | { |
43 | if (strncmp (str, "command:", 8) == 0) |
99 | if (strncmp (str, "command:", 8) == 0) |
44 | rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); |
100 | rt->cmd_write (str + 8, strlen (str) - 8); |
|
|
101 | else if (strncmp (str, "perl:", 5) == 0) |
|
|
102 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
45 | else |
103 | else |
46 | rt->tt_write ((unsigned char *)str, strlen (str)); |
104 | rt->tt_write (str, strlen (str)); |
47 | } |
105 | } |
48 | |
106 | |
49 | static void |
107 | static void |
50 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
108 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
51 | { |
109 | { |
… | |
… | |
58 | *ch |= 0x80; |
116 | *ch |= 0x80; |
59 | } |
117 | } |
60 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
118 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
61 | #endif |
119 | #endif |
62 | { |
120 | { |
63 | const unsigned char ch = C0_ESC; |
121 | const char ch = C0_ESC; |
64 | rt->tt_write (&ch, 1); |
122 | rt->tt_write (&ch, 1); |
65 | } |
123 | } |
66 | } |
124 | } |
67 | |
125 | |
68 | rt->tt_write ((unsigned char *) buf, buflen); |
126 | rt->tt_write (buf, buflen); |
69 | } |
127 | } |
70 | |
128 | |
71 | static int |
129 | static int |
72 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
130 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
73 | { |
131 | { |
… | |
… | |
79 | *buf = 0; |
137 | *buf = 0; |
80 | } |
138 | } |
81 | |
139 | |
82 | return len; |
140 | return len; |
83 | } |
141 | } |
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 | |
142 | |
102 | // return: priority_of_a - priority_of_b |
143 | // return: priority_of_a - priority_of_b |
103 | static int |
144 | static int |
104 | compare_priority (keysym_t *a, keysym_t *b) |
145 | compare_priority (keysym_t *a, keysym_t *b) |
105 | { |
146 | { |
106 | // (the more '1's in state; the less range): the greater priority |
147 | // (the more '1's in state; the less range): the greater priority |
107 | int ca = bitcount (a->state /* & OtherModMask */); |
148 | int ca = popcount (a->state /* & OtherModMask */); |
108 | int cb = bitcount (b->state /* & OtherModMask */); |
149 | int cb = popcount (b->state /* & OtherModMask */); |
109 | |
150 | |
110 | if (ca != cb) |
151 | if (ca != cb) |
111 | return ca - cb; |
152 | return ca - cb; |
112 | //else if (a->state != b->state) // this behavior is to be disscussed |
153 | //else if (a->state != b->state) // this behavior is to be disscussed |
113 | // return b->state - a->state; |
154 | // return b->state - a->state; |
… | |
… | |
157 | void |
198 | void |
158 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
199 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
159 | { |
200 | { |
160 | keysym_t *key = new keysym_t; |
201 | keysym_t *key = new keysym_t; |
161 | wchar_t *wc = rxvt_mbstowcs (trans); |
202 | wchar_t *wc = rxvt_mbstowcs (trans); |
162 | const char *translation = rxvt_wcstoutf8 (wc); |
203 | char *translation = rxvt_wcstoutf8 (wc); |
163 | free (wc); |
204 | free (wc); |
164 | |
205 | |
165 | if (key && translation) |
206 | if (key && translation) |
166 | { |
207 | { |
167 | key->keysym = keysym; |
208 | key->keysym = keysym; |
168 | key->state = state; |
209 | key->state = state; |
169 | key->range = 1; |
210 | key->range = 1; |
170 | key->str = translation; |
211 | key->str = translation; |
171 | key->type = keysym_t::NORMAL; |
212 | key->type = keysym_t::STRING; |
172 | |
213 | |
173 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
214 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
174 | { |
215 | { |
175 | char *middle = strchr (translation + 5, translation [4]); |
216 | char *middle = strchr (translation + 5, translation [4]); |
176 | char *suffix = strrchr (translation + 5, translation [4]); |
217 | char *suffix = strrchr (translation + 5, translation [4]); |
177 | |
218 | |
178 | if (suffix && middle && suffix > middle + 1) |
219 | if (suffix && middle && suffix > middle + 1) |
179 | { |
220 | { |
180 | key->type = keysym_t::LIST; |
221 | key->type = keysym_t::LIST; |
181 | key->range = suffix - middle - 1; |
222 | key->range = suffix - middle - 1; |
182 | |
223 | |
183 | strcpy (translation, translation + 4); |
224 | memmove (translation, translation + 4, strlen (translation + 4) + 1); |
184 | } |
225 | } |
185 | else |
226 | else |
186 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
227 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
187 | } |
228 | } |
|
|
229 | else if (strncmp (translation, "builtin:", 8) == 0) |
|
|
230 | key->type = keysym_t::BUILTIN; |
188 | |
231 | |
189 | user_keymap.push_back (key); |
232 | user_keymap.push_back (key); |
190 | user_translations.push_back (translation); |
233 | user_translations.push_back (translation); |
191 | register_keymap (key); |
234 | register_keymap (key); |
192 | } |
235 | } |
… | |
… | |
228 | bool |
271 | bool |
229 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
272 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
230 | { |
273 | { |
231 | assert (hash[0] == 0 && "register_done() need to be called"); |
274 | assert (hash[0] == 0 && "register_done() need to be called"); |
232 | |
275 | |
|
|
276 | state &= OtherModMask; // mask out uninteresting modifiers |
|
|
277 | |
233 | if (state & term->ModMetaMask) state |= MetaMask; |
278 | if (state & term->ModMetaMask) state |= MetaMask; |
234 | if (state & term->ModNumLockMask) state |= NumLockMask; |
279 | if (state & term->ModNumLockMask) state |= NumLockMask; |
235 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
280 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
236 | |
281 | |
237 | if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
282 | if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
… | |
… | |
241 | |
286 | |
242 | if (index >= 0) |
287 | if (index >= 0) |
243 | { |
288 | { |
244 | const keysym_t &key = *keymap [index]; |
289 | const keysym_t &key = *keymap [index]; |
245 | |
290 | |
|
|
291 | if (key.type != keysym_t::BUILTIN) |
|
|
292 | { |
246 | int keysym_offset = keysym - key.keysym; |
293 | int keysym_offset = keysym - key.keysym; |
247 | |
294 | |
248 | wchar_t *wc = rxvt_utf8towcs (key.str); |
295 | wchar_t *wc = rxvt_utf8towcs (key.str); |
249 | char *str = rxvt_wcstombs (wc); |
296 | char *str = rxvt_wcstombs (wc); |
250 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
297 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
251 | free (wc); |
298 | free (wc); |
252 | |
299 | |
253 | switch (key.type) |
300 | switch (key.type) |
254 | { |
|
|
255 | case keysym_t::NORMAL: |
|
|
256 | output_string (term, str); |
|
|
257 | break; |
|
|
258 | |
|
|
259 | case keysym_t::RANGE: |
|
|
260 | { |
301 | { |
|
|
302 | case keysym_t::STRING: |
|
|
303 | output_string (term, str); |
|
|
304 | break; |
|
|
305 | |
|
|
306 | case keysym_t::RANGE: |
|
|
307 | { |
261 | char buf[STRING_MAX]; |
308 | char buf[STRING_MAX]; |
262 | |
309 | |
263 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
310 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
|
|
311 | output_string (term, buf); |
|
|
312 | } |
|
|
313 | break; |
|
|
314 | |
|
|
315 | case keysym_t::RANGE_META8: |
|
|
316 | { |
|
|
317 | int len; |
|
|
318 | char buf[STRING_MAX]; |
|
|
319 | |
|
|
320 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
321 | if (len > 0) |
|
|
322 | output_string_meta8 (term, state, buf, len); |
|
|
323 | } |
|
|
324 | break; |
|
|
325 | |
|
|
326 | case keysym_t::LIST: |
|
|
327 | { |
|
|
328 | char buf[STRING_MAX]; |
|
|
329 | |
|
|
330 | char *prefix, *middle, *suffix; |
|
|
331 | |
|
|
332 | prefix = str; |
|
|
333 | middle = strchr (prefix + 1, *prefix); |
|
|
334 | suffix = strrchr (middle + 1, *prefix); |
|
|
335 | |
|
|
336 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
337 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
338 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
339 | |
264 | output_string (term, buf); |
340 | output_string (term, buf); |
|
|
341 | } |
|
|
342 | break; |
265 | } |
343 | } |
266 | break; |
|
|
267 | |
344 | |
268 | case keysym_t::RANGE_META8: |
|
|
269 | { |
|
|
270 | int len; |
|
|
271 | char buf[STRING_MAX]; |
|
|
272 | |
|
|
273 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
274 | if (len > 0) |
|
|
275 | output_string_meta8 (term, state, buf, len); |
|
|
276 | } |
|
|
277 | break; |
|
|
278 | |
|
|
279 | case keysym_t::LIST: |
|
|
280 | { |
|
|
281 | char buf[STRING_MAX]; |
|
|
282 | |
|
|
283 | char *prefix, *middle, *suffix; |
|
|
284 | |
|
|
285 | prefix = str; |
|
|
286 | middle = strchr (prefix + 1, *prefix); |
|
|
287 | suffix = strrchr (middle + 1, *prefix); |
|
|
288 | |
|
|
289 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
290 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
291 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
292 | |
|
|
293 | output_string (term, buf); |
|
|
294 | } |
|
|
295 | break; |
|
|
296 | } |
|
|
297 | |
|
|
298 | free (str); |
345 | free (str); |
299 | |
346 | |
300 | return true; |
347 | return true; |
|
|
348 | } |
301 | } |
349 | } |
302 | else |
350 | |
303 | return false; |
351 | return false; |
304 | } |
352 | } |
305 | |
353 | |
306 | // purge duplicate keymap entries |
354 | // purge duplicate keymap entries |
307 | void keyboard_manager::purge_duplicate_keymap () |
355 | void keyboard_manager::purge_duplicate_keymap () |
308 | { |
356 | { |
… | |
… | |
378 | ++hash_budget_counter [hashkey]; |
426 | ++hash_budget_counter [hashkey]; |
379 | } |
427 | } |
380 | |
428 | |
381 | keymap.swap (sorted_keymap); |
429 | keymap.swap (sorted_keymap); |
382 | |
430 | |
383 | #if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) |
431 | #ifdef DEBUG_STRICT |
384 | // check for invariants |
432 | // check for invariants |
385 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
433 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
386 | { |
434 | { |
387 | index = hash[i]; |
435 | index = hash[i]; |
388 | for (int j = 0; j < hash_budget_size [i]; ++j) |
436 | for (int j = 0; j < hash_budget_size [i]; ++j) |
… | |
… | |
417 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
465 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
418 | { |
466 | { |
419 | int hashkey = keysym & KEYSYM_HASH_MASK; |
467 | int hashkey = keysym & KEYSYM_HASH_MASK; |
420 | unsigned int index = hash [hashkey]; |
468 | unsigned int index = hash [hashkey]; |
421 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
469 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
422 | ? hash [hashkey + 1] |
470 | ? hash [hashkey + 1] |
423 | : keymap.size (); |
471 | : keymap.size (); |
424 | |
472 | |
425 | for (; index < end; ++index) |
473 | for (; index < end; ++index) |
426 | { |
474 | { |
427 | keysym_t *key = keymap [index]; |
475 | keysym_t *key = keymap [index]; |