1 | #include "../config.h" |
1 | #include "../config.h" |
2 | #include "rxvt.h" |
2 | #include "rxvt.h" |
|
|
3 | |
|
|
4 | #ifdef KEYSYM_RESOURCE |
|
|
5 | |
|
|
6 | #include <cstring> |
|
|
7 | |
3 | #include "keyboard.h" |
8 | #include "keyboard.h" |
4 | #include "command.h" |
9 | #include "command.h" |
5 | #include <string.h> |
|
|
6 | #include <X11/X.h> |
|
|
7 | |
10 | |
8 | #ifdef KEYSYM_RESOURCE |
11 | #if STOCK_KEYMAP |
9 | |
|
|
10 | //////////////////////////////////////////////////////////////////////////////// |
12 | //////////////////////////////////////////////////////////////////////////////// |
11 | // default keycode translation map and keyevent handlers |
13 | // default keycode translation map and keyevent handlers |
12 | |
14 | |
13 | keysym_t keyboard_manager::stock_keymap[] = { |
15 | keysym_t keyboard_manager::stock_keymap[] = { |
14 | /* examples */ |
16 | /* examples */ |
15 | /* keysym, state, range, handler, str */ |
17 | /* keysym, state, range, handler, str */ |
16 | //{XK_ISO_Left_Tab, 0, 1, NORMAL, "\033[Z"}, |
18 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"}, |
17 | //{ 'a', 0, 26, RANGE_META8, "a" "%c"}, |
19 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
18 | //{ 'a', ControlMask, 26, RANGE_META8, "" "%c"}, |
20 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
19 | //{ XK_Left, 0, 4, LIST, "DACBZ" "\033[Z"}, |
21 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
20 | //{ XK_Left, ShiftMask, 4, LIST, "dacbZ" "\033[Z"}, |
22 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
21 | //{ XK_Left, ControlMask, 4, LIST, "dacbZ" "\033OZ"}, |
23 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
22 | //{ XK_Tab, ControlMask, 1, NORMAL, "\033<C-Tab>"}, |
24 | //{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033<C-Tab>"}, |
23 | //{ XK_apostrophe, ControlMask, 1, NORMAL, "\033<C-'>"}, |
25 | //{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033<C-'>"}, |
24 | //{ XK_slash, ControlMask, 1, NORMAL, "\033<C-/>"}, |
26 | //{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033<C-/>"}, |
25 | //{ XK_semicolon, ControlMask, 1, NORMAL, "\033<C-;>"}, |
27 | //{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033<C-;>"}, |
26 | //{ XK_grave, ControlMask, 1, NORMAL, "\033<C-`>"}, |
28 | //{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033<C-`>"}, |
27 | //{ XK_comma, ControlMask, 1, NORMAL, "\033<C-\054>"}, |
29 | //{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033<C-\054>"}, |
28 | //{ XK_Return, ControlMask, 1, NORMAL, "\033<C-Return>"}, |
30 | //{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033<C-Return>"}, |
29 | //{ XK_Return, ShiftMask, 1, NORMAL, "\033<S-Return>"}, |
31 | //{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033<S-Return>"}, |
30 | //{ ' ', ShiftMask, 1, NORMAL, "\033<S-Space>"}, |
32 | //{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033<S-Space>"}, |
31 | //{ '.', ControlMask, 1, NORMAL, "\033<C-.>"}, |
33 | //{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, |
32 | //{ '0', ControlMask, 10, RANGE, "0" "\033<C-%c>"}, |
34 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
33 | //{ '0', MetaMask|ControlMask, 10, RANGE, "0" "\033<M-C-%c>"}, |
35 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
34 | //{ 'a', MetaMask|ControlMask, 26, RANGE, "a" "\033<M-C-%c>"}, |
36 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
35 | }; |
37 | }; |
|
|
38 | #endif |
36 | |
39 | |
37 | static void |
40 | static void |
38 | output_string (rxvt_term *rt, const char *str) |
41 | output_string (rxvt_term *rt, const char *str) |
39 | { |
42 | { |
40 | assert (rt && str); |
|
|
41 | |
|
|
42 | if (strncmp (str, "proto:", 6) == 0) |
43 | if (strncmp (str, "command:", 8) == 0) |
43 | rt->cmd_write ((unsigned char *)str + 6, strlen (str) - 6); |
44 | rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); |
44 | else |
45 | else |
45 | rt->tt_write ((unsigned char *)str, strlen (str)); |
46 | rt->tt_write ((unsigned char *)str, strlen (str)); |
46 | } |
47 | } |
47 | |
48 | |
48 | static void |
49 | static void |
… | |
… | |
68 | } |
69 | } |
69 | |
70 | |
70 | static int |
71 | static int |
71 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
72 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
72 | { |
73 | { |
73 | int len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); |
74 | size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); |
74 | |
75 | |
75 | if (len >= bufsize) |
76 | if (len >= (size_t)bufsize) |
76 | { |
|
|
77 | rxvt_warn ("buffer overflowed!\n"); |
|
|
78 | *buf = 0; |
|
|
79 | } |
77 | { |
80 | else if (len < 0) |
78 | rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n"); |
81 | { |
|
|
82 | rxvt_warn ("keyrange_translator(), snprintf error"); |
|
|
83 | *buf = 0; |
79 | *buf = 0; |
84 | } |
80 | } |
85 | |
81 | |
86 | return len; |
82 | return len; |
87 | } |
83 | } |
88 | |
84 | |
89 | //////////////////////////////////////////////////////////////////////////////// |
85 | //////////////////////////////////////////////////////////////////////////////// |
90 | // return: #bits of '1' |
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 |
91 | static int |
90 | static int |
92 | bitcount (unsigned int n) |
91 | bitcount (uint16_t n) |
93 | { |
92 | { |
94 | int i; |
93 | int i; |
95 | |
94 | |
96 | for (i = 0; n; ++i, n &= (n - 1)) |
95 | for (i = 0; n; ++i, n &= n - 1) |
97 | ; |
96 | ; |
98 | |
97 | |
99 | return i; |
98 | return i; |
100 | } |
99 | } |
|
|
100 | #endif |
101 | |
101 | |
102 | // return: priority_of_a - priority_of_b |
102 | // return: priority_of_a - priority_of_b |
103 | static int |
103 | static int |
104 | compare_priority (keysym_t *a, keysym_t *b) |
104 | compare_priority (keysym_t *a, keysym_t *b) |
105 | { |
105 | { |
106 | assert (a && b); |
|
|
107 | |
|
|
108 | // (the more '1's in state; the less range): the greater priority |
106 | // (the more '1's in state; the less range): the greater priority |
109 | int ca = bitcount (a->state /* & OtherModMask */); |
107 | int ca = bitcount (a->state /* & OtherModMask */); |
110 | int cb = bitcount (b->state /* & OtherModMask */); |
108 | int cb = bitcount (b->state /* & OtherModMask */); |
111 | |
109 | |
112 | if (ca != cb) |
110 | if (ca != cb) |
… | |
… | |
157 | // the string 'trans' is copied to an internal managed buffer, |
155 | // the string 'trans' is copied to an internal managed buffer, |
158 | // so the caller can free memory of 'trans' at any time. |
156 | // so the caller can free memory of 'trans' at any time. |
159 | void |
157 | void |
160 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
158 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
161 | { |
159 | { |
162 | assert (trans); |
|
|
163 | |
|
|
164 | keysym_t *key = new keysym_t; |
160 | keysym_t *key = new keysym_t; |
165 | wchar_t *wc = rxvt_mbstowcs (trans); |
161 | wchar_t *wc = rxvt_mbstowcs (trans); |
166 | const char *translation = rxvt_wcstoutf8 (wc); |
162 | const char *translation = rxvt_wcstoutf8 (wc); |
167 | free (wc); |
163 | free (wc); |
168 | |
164 | |
… | |
… | |
185 | key->range = suffix - middle - 1; |
181 | key->range = suffix - middle - 1; |
186 | |
182 | |
187 | strcpy (translation, translation + 4); |
183 | strcpy (translation, translation + 4); |
188 | } |
184 | } |
189 | else |
185 | else |
190 | { |
|
|
191 | key->range = 1; |
|
|
192 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
186 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
193 | } |
187 | } |
194 | } |
|
|
195 | else |
|
|
196 | |
188 | |
197 | user_keymap.push_back (key); |
189 | user_keymap.push_back (key); |
198 | user_translations.push_back (translation); |
190 | user_translations.push_back (translation); |
199 | register_keymap (key); |
191 | register_keymap (key); |
200 | } |
192 | } |
… | |
… | |
207 | } |
199 | } |
208 | |
200 | |
209 | void |
201 | void |
210 | keyboard_manager::register_keymap (keysym_t *key) |
202 | keyboard_manager::register_keymap (keysym_t *key) |
211 | { |
203 | { |
212 | assert (key); |
|
|
213 | assert (key->range >= 1); |
|
|
214 | |
|
|
215 | if (keymap.size () == keymap.capacity ()) |
204 | if (keymap.size () == keymap.capacity ()) |
216 | keymap.reserve (keymap.size () * 2); |
205 | keymap.reserve (keymap.size () * 2); |
217 | |
206 | |
218 | keymap.push_back (key); |
207 | keymap.push_back (key); |
219 | hash[0] = 3; |
208 | hash[0] = 3; |
220 | } |
209 | } |
221 | |
210 | |
222 | void |
211 | void |
223 | keyboard_manager::register_done () |
212 | keyboard_manager::register_done () |
224 | { |
213 | { |
|
|
214 | #if STOCK_KEYMAP |
225 | unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t); |
215 | int n = sizeof (stock_keymap) / sizeof (keysym_t); |
226 | |
216 | |
|
|
217 | //TODO: shield against repeated calls and empty keymap |
227 | if (keymap.back () != &stock_keymap[n - 1]) |
218 | //if (keymap.back () != &stock_keymap[n - 1]) |
228 | for (i = 0; i < n; ++i) |
219 | for (int i = 0; i < n; ++i) |
229 | register_keymap (&stock_keymap[i]); |
220 | register_keymap (&stock_keymap[i]); |
|
|
221 | #endif |
230 | |
222 | |
231 | purge_duplicate_keymap (); |
223 | purge_duplicate_keymap (); |
232 | |
224 | |
233 | setup_hash (); |
225 | setup_hash (); |
234 | } |
226 | } |
… | |
… | |
247 | |
239 | |
248 | int index = find_keysym (keysym, state); |
240 | int index = find_keysym (keysym, state); |
249 | |
241 | |
250 | if (index >= 0) |
242 | if (index >= 0) |
251 | { |
243 | { |
252 | assert (term && keymap [index]); |
|
|
253 | const keysym_t &key = *keymap [index]; |
244 | const keysym_t &key = *keymap [index]; |
254 | |
245 | |
255 | int keysym_offset = keysym - key.keysym; |
246 | int keysym_offset = keysym - key.keysym; |
256 | |
247 | |
257 | wchar_t *wc = rxvt_utf8towcs (key.str); |
248 | wchar_t *wc = rxvt_utf8towcs (key.str); |
258 | char *str = rxvt_wcstombs (wc); |
249 | char *str = rxvt_wcstombs (wc); |
259 | // TODO: do translations, unescaping etc, here (allow \u escape etc.) |
250 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
260 | free (wc); |
251 | free (wc); |
261 | |
252 | |
262 | switch (key.type) |
253 | switch (key.type) |
263 | { |
254 | { |
264 | case keysym_t::NORMAL: |
255 | case keysym_t::NORMAL: |
… | |
… | |
307 | free (str); |
298 | free (str); |
308 | |
299 | |
309 | return true; |
300 | return true; |
310 | } |
301 | } |
311 | else |
302 | else |
312 | { |
|
|
313 | // fprintf(stderr,"[%x:%x]",state,keysym); |
|
|
314 | return false; |
303 | return false; |
315 | } |
|
|
316 | } |
304 | } |
317 | |
305 | |
318 | // purge duplicate keymap entries |
306 | // purge duplicate keymap entries |
319 | void keyboard_manager::purge_duplicate_keymap () |
307 | void keyboard_manager::purge_duplicate_keymap () |
320 | { |
308 | { |
… | |
… | |
330 | if (i < keymap.size ()) |
318 | if (i < keymap.size ()) |
331 | { |
319 | { |
332 | keymap[i] = keymap.back (); |
320 | keymap[i] = keymap.back (); |
333 | keymap.pop_back (); |
321 | keymap.pop_back (); |
334 | } |
322 | } |
|
|
323 | |
335 | break; |
324 | break; |
336 | } |
325 | } |
337 | } |
326 | } |
338 | } |
327 | } |
339 | } |
328 | } |
… | |
… | |
347 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
336 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
348 | |
337 | |
349 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
338 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
350 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
339 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
351 | |
340 | |
352 | // count keysyms for corresponding hash budgets |
341 | // determine hash bucket size |
353 | for (i = 0; i < keymap.size (); ++i) |
342 | for (i = 0; i < keymap.size (); ++i) |
|
|
343 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
354 | { |
344 | { |
355 | assert (keymap [i]); |
|
|
356 | hashkey = (keymap [i]->keysym & KEYSYM_HASH_MASK); |
345 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
357 | ++hash_budget_size [hashkey]; |
346 | ++hash_budget_size [hashkey]; |
358 | } |
|
|
359 | |
|
|
360 | // keysym A with range>1 is counted one more time for |
|
|
361 | // every keysym B lies in its range |
|
|
362 | for (i = 0; i < keymap.size (); ++i) |
|
|
363 | { |
|
|
364 | if (keymap[i]->range > 1) |
|
|
365 | { |
|
|
366 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j > 0; --j) |
|
|
367 | { |
|
|
368 | hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); |
|
|
369 | if (hash_budget_size [hashkey]) |
|
|
370 | ++hash_budget_size [hashkey]; |
|
|
371 | } |
|
|
372 | } |
347 | } |
373 | } |
|
|
374 | |
348 | |
375 | // now we know the size of each budget |
349 | // now we know the size of each budget |
376 | // compute the index of each budget |
350 | // compute the index of each budget |
377 | hash [0] = 0; |
351 | hash [0] = 0; |
378 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
352 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
379 | { |
353 | { |
380 | index += hash_budget_size [i - 1]; |
354 | index += hash_budget_size [i - 1]; |
381 | hash[i] = (hash_budget_size [i] ? index : hash [i - 1]); |
355 | hash [i] = index; |
382 | } |
356 | } |
383 | |
357 | |
384 | // and allocate just enough space |
358 | // and allocate just enough space |
385 | //sorted_keymap.reserve (hash[i - 1] + hash_budget_size[i - 1]); |
|
|
386 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
359 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
387 | |
360 | |
388 | // fill in sorted_keymap |
361 | // fill in sorted_keymap |
389 | // it is sorted in each budget |
362 | // it is sorted in each budget |
390 | for (i = 0; i < keymap.size (); ++i) |
363 | for (i = 0; i < keymap.size (); ++i) |
391 | { |
|
|
392 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
364 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
393 | { |
365 | { |
394 | hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); |
366 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
395 | |
367 | |
396 | if (hash_budget_size [hashkey]) |
|
|
397 | { |
|
|
398 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
368 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
399 | |
369 | |
400 | while (index > hash [hashkey] |
370 | while (index > hash [hashkey] |
401 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
371 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
402 | { |
372 | { |
403 | sorted_keymap [index] = sorted_keymap [index - 1]; |
373 | sorted_keymap [index] = sorted_keymap [index - 1]; |
404 | --index; |
374 | --index; |
405 | } |
375 | } |
406 | |
376 | |
407 | sorted_keymap [index] = keymap [i]; |
377 | sorted_keymap [index] = keymap [i]; |
408 | ++hash_budget_counter [hashkey]; |
378 | ++hash_budget_counter [hashkey]; |
409 | } |
|
|
410 | } |
379 | } |
411 | } |
|
|
412 | |
380 | |
413 | keymap.swap (sorted_keymap); |
381 | keymap.swap (sorted_keymap); |
414 | |
382 | |
415 | #if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) |
383 | #if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) |
416 | // check for invariants |
384 | // check for invariants |
… | |
… | |
432 | for (i = 0; i < sorted_keymap.size (); ++i) |
400 | for (i = 0; i < sorted_keymap.size (); ++i) |
433 | { |
401 | { |
434 | keysym_t *a = sorted_keymap[i]; |
402 | keysym_t *a = sorted_keymap[i]; |
435 | for (int j = 0; j < a->range; ++j) |
403 | for (int j = 0; j < a->range; ++j) |
436 | { |
404 | { |
437 | int index = find_keysym (a->keysym + j, a->state & OtherModMask); |
405 | int index = find_keysym (a->keysym + j, a->state); |
438 | |
406 | |
439 | assert (index >= 0); |
407 | assert (index >= 0); |
440 | keysym_t *b = keymap [index]; |
408 | keysym_t *b = keymap [index]; |
441 | assert (i == (signed) index || // the normally expected result |
409 | assert (i == (signed) index || // the normally expected result |
442 | (a->keysym + j) >= b->keysym && (a->keysym + j) <= (b->keysym + b->range) && compare_priority (a, b) <= 0); // is effectively the same |
410 | (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 |
443 | } |
411 | } |
444 | } |
412 | } |
445 | #endif |
413 | #endif |
446 | } |
414 | } |
447 | |
415 | |
448 | int |
416 | int |
449 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
417 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
450 | { |
418 | { |
451 | int hashkey = keysym & KEYSYM_HASH_MASK; |
419 | int hashkey = keysym & KEYSYM_HASH_MASK; |
452 | unsigned int index = hash [hashkey]; |
420 | unsigned int index = hash [hashkey]; |
|
|
421 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
|
|
422 | ? hash [hashkey + 1] |
|
|
423 | : keymap.size (); |
453 | |
424 | |
454 | for (; index < keymap.size (); ++index) |
425 | for (; index < end; ++index) |
455 | { |
426 | { |
456 | keysym_t *key = keymap [index]; |
427 | keysym_t *key = keymap [index]; |
457 | assert (key); |
|
|
458 | |
428 | |
459 | if (key->keysym <= keysym && key->keysym + key->range > keysym |
429 | if (key->keysym <= keysym && keysym < key->keysym + key->range |
460 | // match only the specified bits in state and ignore others |
430 | // match only the specified bits in state and ignore others |
461 | && (key->state & OtherModMask) == (key->state & state)) |
431 | && (key->state & state) == key->state) |
462 | return index; |
432 | return index; |
463 | else if (key->keysym > keysym && key->range == 1) |
|
|
464 | return -1; |
|
|
465 | } |
433 | } |
466 | |
434 | |
467 | return -1; |
435 | return -1; |
468 | } |
436 | } |
469 | |
437 | |