|
|
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 | |
… | |
… | |
26 | * index: 0 I1 I2 I3 In |
49 | * index: 0 I1 I2 I3 In |
27 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
50 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
28 | * where |
51 | * where |
29 | * A1 = 0; |
52 | * A1 = 0; |
30 | * Ai+1 = N1 + N2 + ... + Ni. |
53 | * Ai+1 = N1 + N2 + ... + Ni. |
31 | * it is computed from hash_budget_size[]: |
54 | * it is computed from hash_bucket_size[]: |
32 | * index: 0 I1 I2 I3 In |
55 | * index: 0 I1 I2 I3 In |
33 | * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
56 | * 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[]) |
57 | * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[]) |
35 | * or we can say |
58 | * or we can say |
36 | * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0, |
59 | * hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, |
37 | * where |
60 | * where |
38 | * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
61 | * 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 |
62 | * 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[]; |
63 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
41 | * Ni(the size of group i) = hash_budget_size[Ii]. |
64 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
42 | */ |
65 | */ |
43 | |
66 | |
44 | #if STOCK_KEYMAP |
67 | #if STOCK_KEYMAP |
45 | //////////////////////////////////////////////////////////////////////////////// |
68 | //////////////////////////////////////////////////////////////////////////////// |
46 | // default keycode translation map and keyevent handlers |
69 | // default keycode translation map and keyevent handlers |
47 | |
70 | |
48 | keysym_t keyboard_manager::stock_keymap[] = { |
71 | keysym_t keyboard_manager::stock_keymap[] = { |
49 | /* examples */ |
72 | /* examples */ |
50 | /* keysym, state, range, handler, str */ |
73 | /* keysym, state, range, type, str */ |
51 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
74 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
52 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
75 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
53 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
76 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
54 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
77 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
55 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
78 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
… | |
… | |
74 | output_string (rxvt_term *rt, const char *str) |
97 | output_string (rxvt_term *rt, const char *str) |
75 | { |
98 | { |
76 | if (strncmp (str, "command:", 8) == 0) |
99 | if (strncmp (str, "command:", 8) == 0) |
77 | rt->cmd_write (str + 8, strlen (str) - 8); |
100 | rt->cmd_write (str + 8, strlen (str) - 8); |
78 | else if (strncmp (str, "perl:", 5) == 0) |
101 | else if (strncmp (str, "perl:", 5) == 0) |
79 | HOOK_INVOKE((rt, HOOK_KEYBOARD_COMMAND, DT_STR, str + 5, DT_END)); |
102 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
80 | else |
103 | else |
81 | rt->tt_write (str, strlen (str)); |
104 | rt->tt_write (str, strlen (str)); |
82 | } |
105 | } |
83 | |
106 | |
84 | static void |
107 | static void |
… | |
… | |
114 | *buf = 0; |
137 | *buf = 0; |
115 | } |
138 | } |
116 | |
139 | |
117 | return len; |
140 | return len; |
118 | } |
141 | } |
119 | |
|
|
120 | //////////////////////////////////////////////////////////////////////////////// |
|
|
121 | // return: #bits of '1' |
|
|
122 | #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) |
|
|
123 | # define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n__); })) |
|
|
124 | #else |
|
|
125 | static int |
|
|
126 | bitcount (uint16_t n) |
|
|
127 | { |
|
|
128 | int i; |
|
|
129 | |
|
|
130 | for (i = 0; n; ++i, n &= n - 1) |
|
|
131 | ; |
|
|
132 | |
|
|
133 | return i; |
|
|
134 | } |
|
|
135 | #endif |
|
|
136 | |
142 | |
137 | // return: priority_of_a - priority_of_b |
143 | // return: priority_of_a - priority_of_b |
138 | static int |
144 | static int |
139 | compare_priority (keysym_t *a, keysym_t *b) |
145 | compare_priority (keysym_t *a, keysym_t *b) |
140 | { |
146 | { |
141 | // (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 |
142 | int ca = bitcount (a->state /* & OtherModMask */); |
148 | int ca = rxvt_popcount (a->state /* & OtherModMask */); |
143 | int cb = bitcount (b->state /* & OtherModMask */); |
149 | int cb = rxvt_popcount (b->state /* & OtherModMask */); |
144 | |
150 | |
145 | if (ca != cb) |
151 | if (ca != cb) |
146 | return ca - cb; |
152 | return ca - cb; |
147 | //else if (a->state != b->state) // this behavior is to be disscussed |
153 | //else if (a->state != b->state) // this behavior is to be discussed |
148 | // return b->state - a->state; |
154 | // return b->state - a->state; |
149 | else |
155 | else |
150 | return b->range - a->range; |
156 | return b->range - a->range; |
151 | } |
157 | } |
152 | |
158 | |
… | |
… | |
207 | |
213 | |
208 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
214 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
209 | { |
215 | { |
210 | char *middle = strchr (translation + 5, translation [4]); |
216 | char *middle = strchr (translation + 5, translation [4]); |
211 | char *suffix = strrchr (translation + 5, translation [4]); |
217 | char *suffix = strrchr (translation + 5, translation [4]); |
212 | |
218 | |
213 | if (suffix && middle && suffix > middle + 1) |
219 | if (suffix && middle && suffix > middle + 1) |
214 | { |
220 | { |
215 | key->type = keysym_t::LIST; |
221 | key->type = keysym_t::LIST; |
216 | key->range = suffix - middle - 1; |
222 | key->range = suffix - middle - 1; |
217 | |
223 | |
218 | strcpy (translation, translation + 4); |
224 | memmove (translation, translation + 4, strlen (translation + 4) + 1); |
219 | } |
225 | } |
220 | else |
226 | else |
221 | 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); |
222 | } |
228 | } |
223 | else if (strncmp (translation, "builtin:", 8) == 0) |
229 | else if (strncmp (translation, "builtin:", 8) == 0) |
… | |
… | |
372 | void |
378 | void |
373 | keyboard_manager::setup_hash () |
379 | keyboard_manager::setup_hash () |
374 | { |
380 | { |
375 | unsigned int i, index, hashkey; |
381 | unsigned int i, index, hashkey; |
376 | vector <keysym_t *> sorted_keymap; |
382 | vector <keysym_t *> sorted_keymap; |
377 | uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget |
383 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
378 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
384 | uint16_t hash_bucket_counter[KEYSYM_HASH_BUCKETS]; // #elements in each bucket |
379 | |
385 | |
380 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
386 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
381 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
387 | memset (hash_bucket_counter, 0, sizeof (hash_bucket_counter)); |
382 | |
388 | |
383 | // determine hash bucket size |
389 | // determine hash bucket size |
384 | for (i = 0; i < keymap.size (); ++i) |
390 | for (i = 0; i < keymap.size (); ++i) |
385 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
391 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
386 | { |
392 | { |
387 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
393 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
388 | ++hash_budget_size [hashkey]; |
394 | ++hash_bucket_size [hashkey]; |
389 | } |
395 | } |
390 | |
396 | |
391 | // now we know the size of each budget |
397 | // now we know the size of each bucket |
392 | // compute the index of each budget |
398 | // compute the index of each bucket |
393 | hash [0] = 0; |
399 | hash [0] = 0; |
394 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
400 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
395 | { |
401 | { |
396 | index += hash_budget_size [i - 1]; |
402 | index += hash_bucket_size [i - 1]; |
397 | hash [i] = index; |
403 | hash [i] = index; |
398 | } |
404 | } |
399 | |
405 | |
400 | // and allocate just enough space |
406 | // and allocate just enough space |
401 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
407 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
402 | |
408 | |
403 | // fill in sorted_keymap |
409 | // fill in sorted_keymap |
404 | // it is sorted in each budget |
410 | // it is sorted in each bucket |
405 | for (i = 0; i < keymap.size (); ++i) |
411 | for (i = 0; i < keymap.size (); ++i) |
406 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
412 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
407 | { |
413 | { |
408 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
414 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
409 | |
415 | |
410 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
416 | index = hash [hashkey] + hash_bucket_counter [hashkey]; |
411 | |
417 | |
412 | while (index > hash [hashkey] |
418 | while (index > hash [hashkey] |
413 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
419 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
414 | { |
420 | { |
415 | sorted_keymap [index] = sorted_keymap [index - 1]; |
421 | sorted_keymap [index] = sorted_keymap [index - 1]; |
416 | --index; |
422 | --index; |
417 | } |
423 | } |
418 | |
424 | |
419 | sorted_keymap [index] = keymap [i]; |
425 | sorted_keymap [index] = keymap [i]; |
420 | ++hash_budget_counter [hashkey]; |
426 | ++hash_bucket_counter [hashkey]; |
421 | } |
427 | } |
422 | |
428 | |
423 | keymap.swap (sorted_keymap); |
429 | keymap.swap (sorted_keymap); |
424 | |
430 | |
425 | #if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) |
431 | #ifndef NDEBUG |
426 | // check for invariants |
432 | // check for invariants |
427 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
433 | for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
428 | { |
434 | { |
429 | index = hash[i]; |
435 | index = hash[i]; |
430 | for (int j = 0; j < hash_budget_size [i]; ++j) |
436 | for (int j = 0; j < hash_bucket_size [i]; ++j) |
431 | { |
437 | { |
432 | if (keymap [index + j]->range == 1) |
438 | if (keymap [index + j]->range == 1) |
433 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
439 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
434 | |
440 | |
435 | if (j) |
441 | if (j) |
… | |
… | |
446 | { |
452 | { |
447 | int index = find_keysym (a->keysym + j, a->state); |
453 | int index = find_keysym (a->keysym + j, a->state); |
448 | |
454 | |
449 | assert (index >= 0); |
455 | assert (index >= 0); |
450 | keysym_t *b = keymap [index]; |
456 | keysym_t *b = keymap [index]; |
451 | assert (i == (signed) index || // the normally expected result |
457 | assert (i == index // the normally expected result |
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 |
458 | || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range) |
|
|
459 | && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
453 | } |
460 | } |
454 | } |
461 | } |
455 | #endif |
462 | #endif |
456 | } |
463 | } |
457 | |
464 | |
458 | int |
465 | int |
459 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
466 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
460 | { |
467 | { |
461 | int hashkey = keysym & KEYSYM_HASH_MASK; |
468 | int hashkey = keysym & KEYSYM_HASH_MASK; |
462 | unsigned int index = hash [hashkey]; |
469 | unsigned int index = hash [hashkey]; |
463 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
470 | unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 |
464 | ? hash [hashkey + 1] |
471 | ? hash [hashkey + 1] |
465 | : keymap.size (); |
472 | : keymap.size (); |
466 | |
473 | |
467 | for (; index < end; ++index) |
474 | for (; index < end; ++index) |
468 | { |
475 | { |
469 | keysym_t *key = keymap [index]; |
476 | keysym_t *key = keymap [index]; |