… | |
… | |
6 | * Copyright (c) 2005 WU Fengguang |
6 | * Copyright (c) 2005 WU Fengguang |
7 | * Copyright (c) 2005-2006 Marc Lehmann <schmorp@schmorp.de> |
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 3 of the License, or |
12 | * (at your option) any later version. |
12 | * (at your option) any later version. |
13 | * |
13 | * |
14 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
… | |
… | |
61 | * 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 |
62 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
62 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
63 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
63 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
64 | */ |
64 | */ |
65 | |
65 | |
66 | static void |
|
|
67 | output_string (rxvt_term *term, const char *str) |
|
|
68 | { |
|
|
69 | if (strncmp (str, "command:", 8) == 0) |
|
|
70 | term->cmdbuf_append (str + 8, strlen (str) - 8); |
|
|
71 | else if (strncmp (str, "perl:", 5) == 0) |
|
|
72 | HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
|
|
73 | else |
|
|
74 | term->tt_write (str, strlen (str)); |
|
|
75 | } |
|
|
76 | |
|
|
77 | // return: priority_of_a - priority_of_b |
66 | // return: priority_of_a - priority_of_b |
78 | static int |
67 | static int |
79 | compare_priority (keysym_t *a, keysym_t *b) |
68 | compare_priority (keysym_t *a, keysym_t *b) |
80 | { |
69 | { |
81 | // (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 |
82 | int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
71 | int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
83 | int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
72 | int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
84 | |
73 | |
85 | if (ca != cb) |
|
|
86 | return ca - cb; |
74 | return ca - cb; |
87 | //else if (a->state != b->state) // this behavior is to be discussed |
|
|
88 | // return b->state - a->state; |
|
|
89 | else |
|
|
90 | return 0; |
|
|
91 | } |
75 | } |
92 | |
76 | |
93 | //////////////////////////////////////////////////////////////////////////////// |
77 | //////////////////////////////////////////////////////////////////////////////// |
94 | keyboard_manager::keyboard_manager () |
78 | keyboard_manager::keyboard_manager () |
95 | { |
79 | { |
… | |
… | |
105 | delete keymap [i]; |
89 | delete keymap [i]; |
106 | } |
90 | } |
107 | } |
91 | } |
108 | |
92 | |
109 | void |
93 | void |
|
|
94 | keyboard_manager::unregister_action (KeySym keysym, unsigned int state) |
|
|
95 | { |
|
|
96 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
97 | if (keymap [i]->keysym == keysym |
|
|
98 | && keymap [i]->state == state) |
|
|
99 | { |
|
|
100 | free (keymap [i]->str); |
|
|
101 | delete keymap [i]; |
|
|
102 | |
|
|
103 | if (i < keymap.size () - 1) |
|
|
104 | keymap [i] = keymap [keymap.size () - 1]; |
|
|
105 | keymap.pop_back (); |
|
|
106 | |
|
|
107 | break; |
|
|
108 | } |
|
|
109 | } |
|
|
110 | |
|
|
111 | void |
110 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) |
112 | keyboard_manager::register_action (KeySym keysym, unsigned int state, const wchar_t *ws) |
111 | { |
113 | { |
112 | char *translation = rxvt_wcstoutf8 (ws); |
114 | char *action = rxvt_wcstoutf8 (ws); |
113 | |
115 | |
114 | keysym_t *key = new keysym_t; |
116 | keysym_t *key = new keysym_t; |
115 | |
117 | |
116 | key->keysym = keysym; |
118 | key->keysym = keysym; |
117 | key->state = state; |
119 | key->state = state; |
118 | key->str = translation; |
120 | key->str = action; |
119 | key->type = keysym_t::STRING; |
121 | key->type = keysym_t::STRING; |
120 | |
122 | |
121 | if (strncmp (translation, "builtin:", 8) == 0) |
123 | if (strncmp (action, "builtin:", 8) == 0) |
122 | key->type = keysym_t::BUILTIN; |
124 | key->type = keysym_t::BUILTIN; |
|
|
125 | else if (strncmp (action, "builtin-string:", 15) == 0) |
|
|
126 | key->type = keysym_t::BUILTIN_STRING; |
|
|
127 | |
|
|
128 | unregister_action (keysym, state); |
123 | |
129 | |
124 | if (keymap.size () == keymap.capacity ()) |
130 | if (keymap.size () == keymap.capacity ()) |
125 | keymap.reserve (keymap.size () * 2); |
131 | keymap.reserve (keymap.size () * 2); |
126 | |
132 | |
127 | keymap.push_back (key); |
133 | keymap.push_back (key); |
128 | hash[0] = 3; |
134 | hash[0] = 3; |
129 | } |
135 | } |
130 | |
136 | |
131 | bool |
137 | keysym_t * |
132 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
138 | keyboard_manager::lookup_keysym (rxvt_term *term, KeySym keysym, unsigned int state) |
133 | { |
139 | { |
134 | assert (("register_done() need to be called", hash[0] == 0)); |
140 | assert (("register_done() need to be called", hash[0] == 0)); |
135 | |
141 | |
136 | state &= OtherModMask; // mask out uninteresting modifiers |
142 | state &= OtherModMask; // mask out uninteresting modifiers |
137 | |
143 | |
… | |
… | |
142 | if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
148 | if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
143 | state |= AppKeypadMask; |
149 | state |= AppKeypadMask; |
144 | |
150 | |
145 | int index = find_keysym (keysym, state); |
151 | int index = find_keysym (keysym, state); |
146 | |
152 | |
147 | if (index >= 0) |
153 | return index >= 0 ? keymap [index] : 0; |
148 | { |
154 | } |
149 | keysym_t *key = keymap [index]; |
|
|
150 | |
155 | |
|
|
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); |
|
|
160 | |
|
|
161 | if (key) |
|
|
162 | { |
|
|
163 | if (key->type == keysym_t::BUILTIN_STRING) |
|
|
164 | { |
|
|
165 | term->tt_write_user_input (kbuf, len); |
|
|
166 | return true; |
|
|
167 | } |
151 | if (key->type != keysym_t::BUILTIN) |
168 | else if (key->type != keysym_t::BUILTIN) |
152 | { |
169 | { |
153 | wchar_t *ws = rxvt_utf8towcs (key->str); |
170 | wchar_t *ws = rxvt_utf8towcs (key->str); |
154 | char *str = rxvt_wcstombs (ws); |
171 | char *str = rxvt_wcstombs (ws); |
155 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
172 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
156 | free (ws); |
173 | free (ws); |
157 | |
174 | |
158 | output_string (term, str); |
175 | if (char *colon = strchr (str, ':')) |
|
|
176 | { |
|
|
177 | if (strncmp (str, "command:", 8) == 0) |
|
|
178 | term->cmdbuf_append (str + 8, strlen (str) - 8); |
|
|
179 | else if (strncmp (str, "string:", 7) == 0) |
|
|
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)); |
|
|
185 | } |
|
|
186 | else |
|
|
187 | term->tt_write_user_input (str, strlen (str)); |
159 | |
188 | |
160 | free (str); |
189 | free (str); |
161 | |
190 | |
162 | return true; |
191 | return true; |
163 | } |
192 | } |
… | |
… | |
168 | |
197 | |
169 | void |
198 | void |
170 | keyboard_manager::register_done () |
199 | keyboard_manager::register_done () |
171 | { |
200 | { |
172 | unsigned int i, index, hashkey; |
201 | unsigned int i, index, hashkey; |
173 | vector <keysym_t *> sorted_keymap; |
|
|
174 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
202 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
175 | |
203 | |
176 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
204 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
177 | |
205 | |
178 | // determine hash bucket size |
206 | // determine hash bucket size |
… | |
… | |
182 | ++hash_bucket_size [hashkey]; |
210 | ++hash_bucket_size [hashkey]; |
183 | } |
211 | } |
184 | |
212 | |
185 | // now we know the size of each bucket |
213 | // now we know the size of each bucket |
186 | // compute the index of each bucket |
214 | // compute the index of each bucket |
187 | hash [0] = 0; |
|
|
188 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
215 | for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
189 | { |
216 | { |
190 | index += hash_bucket_size [i - 1]; |
|
|
191 | hash [i] = index; |
217 | hash [i] = index; |
|
|
218 | index += hash_bucket_size [i]; |
192 | } |
219 | } |
193 | |
220 | |
194 | // and allocate just enough space |
221 | // and allocate just enough space |
195 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
222 | simplevec <keysym_t *> sorted_keymap (index, 0); |
196 | |
223 | |
197 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
224 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
198 | |
225 | |
199 | // fill in sorted_keymap |
226 | // fill in sorted_keymap |
200 | // it is sorted in each bucket |
227 | // it is sorted in each bucket |