… | |
… | |
2 | * File: keyboard.C |
2 | * File: keyboard.C |
3 | *----------------------------------------------------------------------* |
3 | *----------------------------------------------------------------------* |
4 | * |
4 | * |
5 | * All portions of code are copyright by their respective author/s. |
5 | * All portions of code are copyright by their respective author/s. |
6 | * Copyright (c) 2005 WU Fengguang |
6 | * Copyright (c) 2005 WU Fengguang |
7 | * Copyright (c) 2005-2006 Marc Lehmann <pcg@goof.com> |
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 2 of the License, or |
12 | * (at your option) any later version. |
12 | * (at your option) any later version. |
… | |
… | |
63 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
63 | * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
64 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
64 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
65 | */ |
65 | */ |
66 | |
66 | |
67 | static void |
67 | static void |
68 | output_string (rxvt_term *rt, const char *str) |
68 | output_string (rxvt_term *term, const char *str) |
69 | { |
69 | { |
70 | if (strncmp (str, "command:", 8) == 0) |
70 | if (strncmp (str, "command:", 8) == 0) |
71 | rt->cmd_write (str + 8, strlen (str) - 8); |
71 | term->cmdbuf_append (str + 8, strlen (str) - 8); |
72 | else if (strncmp (str, "perl:", 5) == 0) |
72 | else if (strncmp (str, "perl:", 5) == 0) |
73 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
73 | HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
74 | else |
74 | else |
75 | rt->tt_write (str, strlen (str)); |
75 | term->tt_write (str, strlen (str)); |
76 | } |
76 | } |
77 | |
77 | |
78 | // return: priority_of_a - priority_of_b |
78 | // return: priority_of_a - priority_of_b |
79 | static int |
79 | static int |
80 | compare_priority (keysym_t *a, keysym_t *b) |
80 | compare_priority (keysym_t *a, keysym_t *b) |
81 | { |
81 | { |
82 | // (the more '1's in state; the less range): the greater priority |
82 | // (the more '1's in state; the less range): the greater priority |
83 | int ca = rxvt_popcount (a->state /* & OtherModMask */); |
83 | int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
84 | int cb = rxvt_popcount (b->state /* & OtherModMask */); |
84 | int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
85 | |
85 | |
86 | if (ca != cb) |
86 | if (ca != cb) |
87 | return ca - cb; |
87 | return ca - cb; |
88 | //else if (a->state != b->state) // this behavior is to be discussed |
88 | //else if (a->state != b->state) // this behavior is to be discussed |
89 | // return b->state - a->state; |
89 | // return b->state - a->state; |
90 | else |
90 | else |
91 | return b->range - a->range; |
91 | return 0; |
92 | } |
92 | } |
93 | |
93 | |
94 | //////////////////////////////////////////////////////////////////////////////// |
94 | //////////////////////////////////////////////////////////////////////////////// |
95 | keyboard_manager::keyboard_manager () |
95 | keyboard_manager::keyboard_manager () |
96 | { |
96 | { |
… | |
… | |
98 | hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
98 | hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
99 | } |
99 | } |
100 | |
100 | |
101 | keyboard_manager::~keyboard_manager () |
101 | keyboard_manager::~keyboard_manager () |
102 | { |
102 | { |
103 | clear (); |
103 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
104 | { |
|
|
105 | free (keymap [i]->str); |
|
|
106 | delete keymap [i]; |
|
|
107 | } |
104 | } |
108 | } |
105 | |
109 | |
106 | void |
110 | void |
107 | keyboard_manager::clear () |
|
|
108 | { |
|
|
109 | hash [0] = 2; |
|
|
110 | |
|
|
111 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
112 | { |
|
|
113 | free ((void *)keymap [i]->str); |
|
|
114 | delete keymap [i]; |
|
|
115 | keymap [i] = 0; |
|
|
116 | } |
|
|
117 | |
|
|
118 | keymap.clear (); |
|
|
119 | } |
|
|
120 | |
|
|
121 | // a wrapper for register_keymap, |
|
|
122 | // so that outside codes don't have to know so much details. |
|
|
123 | // |
|
|
124 | // the string 'trans' is copied to an internal managed buffer, |
|
|
125 | // so the caller can free memory of 'trans' at any time. |
|
|
126 | void |
|
|
127 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
111 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) |
128 | { |
112 | { |
|
|
113 | char *translation = rxvt_wcstoutf8 (ws); |
|
|
114 | |
129 | keysym_t *key = new keysym_t; |
115 | keysym_t *key = new keysym_t; |
130 | wchar_t *wc = rxvt_mbstowcs (trans); |
|
|
131 | char *translation = rxvt_wcstoutf8 (wc); |
|
|
132 | free (wc); |
|
|
133 | |
116 | |
134 | if (key && translation) |
117 | if (key && translation) |
135 | { |
118 | { |
136 | key->keysym = keysym; |
119 | key->keysym = keysym; |
137 | key->state = state; |
120 | key->state = state; |
138 | key->range = 1; |
|
|
139 | key->str = translation; |
121 | key->str = translation; |
140 | key->type = keysym_t::STRING; |
122 | key->type = keysym_t::STRING; |
141 | |
123 | |
142 | if (strncmp (translation, "list", 4) == 0 && translation [4]) |
|
|
143 | { |
|
|
144 | char *middle = strchr (translation + 5, translation [4]); |
|
|
145 | char *suffix = strrchr (translation + 5, translation [4]); |
|
|
146 | |
|
|
147 | if (suffix && middle && suffix > middle + 1) |
|
|
148 | { |
|
|
149 | key->type = keysym_t::LIST; |
|
|
150 | key->range = suffix - middle - 1; |
|
|
151 | |
|
|
152 | memmove (translation, translation + 4, strlen (translation + 4) + 1); |
|
|
153 | } |
|
|
154 | else |
|
|
155 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
|
|
156 | } |
|
|
157 | else if (strncmp (translation, "builtin:", 8) == 0) |
124 | if (strncmp (translation, "builtin:", 8) == 0) |
158 | key->type = keysym_t::BUILTIN; |
125 | key->type = keysym_t::BUILTIN; |
159 | |
126 | |
160 | register_keymap (key); |
127 | if (keymap.size () == keymap.capacity ()) |
|
|
128 | keymap.reserve (keymap.size () * 2); |
|
|
129 | |
|
|
130 | keymap.push_back (key); |
|
|
131 | hash[0] = 3; |
161 | } |
132 | } |
162 | else |
133 | else |
163 | { |
134 | { |
164 | delete key; |
135 | delete key; |
165 | free ((void *)translation); |
136 | free (translation); |
166 | rxvt_fatal ("out of memory, aborting.\n"); |
137 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
167 | } |
138 | } |
168 | } |
|
|
169 | |
|
|
170 | void |
|
|
171 | keyboard_manager::register_keymap (keysym_t *key) |
|
|
172 | { |
|
|
173 | if (keymap.size () == keymap.capacity ()) |
|
|
174 | keymap.reserve (keymap.size () * 2); |
|
|
175 | |
|
|
176 | keymap.push_back (key); |
|
|
177 | hash[0] = 3; |
|
|
178 | } |
|
|
179 | |
|
|
180 | void |
|
|
181 | keyboard_manager::register_done () |
|
|
182 | { |
|
|
183 | setup_hash (); |
|
|
184 | } |
139 | } |
185 | |
140 | |
186 | bool |
141 | bool |
187 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
142 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
188 | { |
143 | { |
189 | assert (hash[0] == 0 && "register_done() need to be called"); |
144 | assert (("register_done() need to be called", hash[0] == 0)); |
190 | |
145 | |
191 | state &= OtherModMask; // mask out uninteresting modifiers |
146 | state &= OtherModMask; // mask out uninteresting modifiers |
192 | |
147 | |
193 | if (state & term->ModMetaMask) state |= MetaMask; |
148 | if (state & term->ModMetaMask) state |= MetaMask; |
194 | if (state & term->ModNumLockMask) state |= NumLockMask; |
149 | if (state & term->ModNumLockMask) state |= NumLockMask; |
… | |
… | |
199 | |
154 | |
200 | int index = find_keysym (keysym, state); |
155 | int index = find_keysym (keysym, state); |
201 | |
156 | |
202 | if (index >= 0) |
157 | if (index >= 0) |
203 | { |
158 | { |
204 | const keysym_t &key = *keymap [index]; |
159 | keysym_t *key = keymap [index]; |
205 | |
160 | |
206 | if (key.type != keysym_t::BUILTIN) |
161 | if (key->type != keysym_t::BUILTIN) |
207 | { |
162 | { |
208 | int keysym_offset = keysym - key.keysym; |
|
|
209 | |
|
|
210 | wchar_t *wc = rxvt_utf8towcs (key.str); |
163 | wchar_t *ws = rxvt_utf8towcs (key->str); |
211 | char *str = rxvt_wcstombs (wc); |
164 | char *str = rxvt_wcstombs (ws); |
212 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
165 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
213 | free (wc); |
166 | free (ws); |
214 | |
167 | |
215 | switch (key.type) |
|
|
216 | { |
|
|
217 | case keysym_t::STRING: |
|
|
218 | output_string (term, str); |
168 | output_string (term, str); |
219 | break; |
|
|
220 | |
|
|
221 | case keysym_t::LIST: |
|
|
222 | { |
|
|
223 | char buf[STRING_MAX]; |
|
|
224 | |
|
|
225 | char *prefix, *middle, *suffix; |
|
|
226 | |
|
|
227 | prefix = str; |
|
|
228 | middle = strchr (prefix + 1, *prefix); |
|
|
229 | suffix = strrchr (middle + 1, *prefix); |
|
|
230 | |
|
|
231 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
232 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
233 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
234 | |
|
|
235 | output_string (term, buf); |
|
|
236 | } |
|
|
237 | break; |
|
|
238 | } |
|
|
239 | |
169 | |
240 | free (str); |
170 | free (str); |
241 | |
171 | |
242 | return true; |
172 | return true; |
243 | } |
173 | } |
… | |
… | |
245 | |
175 | |
246 | return false; |
176 | return false; |
247 | } |
177 | } |
248 | |
178 | |
249 | void |
179 | void |
250 | keyboard_manager::setup_hash () |
180 | keyboard_manager::register_done () |
251 | { |
181 | { |
252 | unsigned int i, index, hashkey; |
182 | unsigned int i, index, hashkey; |
253 | vector <keysym_t *> sorted_keymap; |
183 | vector <keysym_t *> sorted_keymap; |
254 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
184 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
255 | |
185 | |
256 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
186 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
257 | |
187 | |
258 | // determine hash bucket size |
188 | // determine hash bucket size |
259 | for (i = 0; i < keymap.size (); ++i) |
189 | for (i = 0; i < keymap.size (); ++i) |
260 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
|
|
261 | { |
190 | { |
262 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
191 | hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
263 | ++hash_bucket_size [hashkey]; |
192 | ++hash_bucket_size [hashkey]; |
264 | } |
193 | } |
265 | |
194 | |
266 | // now we know the size of each bucket |
195 | // now we know the size of each bucket |
267 | // compute the index of each bucket |
196 | // compute the index of each bucket |
268 | hash [0] = 0; |
197 | hash [0] = 0; |
269 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
198 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
… | |
… | |
278 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
207 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
279 | |
208 | |
280 | // fill in sorted_keymap |
209 | // fill in sorted_keymap |
281 | // it is sorted in each bucket |
210 | // it is sorted in each bucket |
282 | for (i = 0; i < keymap.size (); ++i) |
211 | for (i = 0; i < keymap.size (); ++i) |
283 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
|
|
284 | { |
212 | { |
285 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
213 | hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
286 | |
214 | |
287 | index = hash [hashkey] + hash_bucket_size [hashkey]; |
215 | index = hash [hashkey] + hash_bucket_size [hashkey]; |
288 | |
216 | |
289 | while (index > hash [hashkey] |
217 | while (index > hash [hashkey] |
290 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
218 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
291 | { |
219 | { |
292 | sorted_keymap [index] = sorted_keymap [index - 1]; |
220 | sorted_keymap [index] = sorted_keymap [index - 1]; |
293 | --index; |
221 | --index; |
294 | } |
222 | } |
295 | |
223 | |
296 | sorted_keymap [index] = keymap [i]; |
224 | sorted_keymap [index] = keymap [i]; |
297 | ++hash_bucket_size [hashkey]; |
225 | ++hash_bucket_size [hashkey]; |
298 | } |
226 | } |
299 | |
227 | |
300 | keymap.swap (sorted_keymap); |
228 | keymap.swap (sorted_keymap); |
301 | |
229 | |
302 | #ifndef NDEBUG |
230 | #ifndef NDEBUG |
303 | // check for invariants |
231 | // check for invariants |
304 | for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
232 | for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
305 | { |
233 | { |
306 | index = hash[i]; |
234 | index = hash[i]; |
307 | for (int j = 0; j < hash_bucket_size [i]; ++j) |
235 | for (int j = 0; j < hash_bucket_size [i]; ++j) |
308 | { |
236 | { |
309 | if (keymap [index + j]->range == 1) |
|
|
310 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
237 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
311 | |
238 | |
312 | if (j) |
239 | if (j) |
313 | assert (compare_priority (keymap [index + j - 1], |
240 | assert (compare_priority (keymap [index + j - 1], |
314 | keymap [index + j]) >= 0); |
241 | keymap [index + j]) >= 0); |
315 | } |
242 | } |
… | |
… | |
317 | |
244 | |
318 | // this should be able to detect most possible bugs |
245 | // this should be able to detect most possible bugs |
319 | for (i = 0; i < sorted_keymap.size (); ++i) |
246 | for (i = 0; i < sorted_keymap.size (); ++i) |
320 | { |
247 | { |
321 | keysym_t *a = sorted_keymap[i]; |
248 | keysym_t *a = sorted_keymap[i]; |
322 | for (int j = 0; j < a->range; ++j) |
|
|
323 | { |
|
|
324 | int index = find_keysym (a->keysym + j, a->state); |
249 | int index = find_keysym (a->keysym, a->state); |
325 | |
250 | |
326 | assert (index >= 0); |
251 | assert (index >= 0); |
327 | keysym_t *b = keymap [index]; |
252 | keysym_t *b = keymap [index]; |
328 | assert (i == index // the normally expected result |
253 | assert (i == index // the normally expected result |
329 | || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range) |
254 | || a->keysym == b->keysym |
330 | && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
255 | && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
331 | } |
|
|
332 | } |
256 | } |
333 | #endif |
257 | #endif |
334 | } |
258 | } |
335 | |
259 | |
336 | int |
260 | int |
… | |
… | |
344 | |
268 | |
345 | for (; index < end; ++index) |
269 | for (; index < end; ++index) |
346 | { |
270 | { |
347 | keysym_t *key = keymap [index]; |
271 | keysym_t *key = keymap [index]; |
348 | |
272 | |
349 | if (key->keysym <= keysym && keysym < key->keysym + key->range |
273 | if (key->keysym == keysym |
350 | // match only the specified bits in state and ignore others |
274 | // match only the specified bits in state and ignore others |
351 | && (key->state & state) == key->state) |
275 | && (key->state & state) == key->state) |
352 | return index; |
276 | return index; |
353 | } |
277 | } |
354 | |
278 | |