… | |
… | |
6 | #include <cstring> |
6 | #include <cstring> |
7 | |
7 | |
8 | #include "keyboard.h" |
8 | #include "keyboard.h" |
9 | #include "command.h" |
9 | #include "command.h" |
10 | |
10 | |
|
|
11 | /* an intro to the data structure: |
|
|
12 | * |
|
|
13 | * vector keymap[] is grouped. |
|
|
14 | * |
|
|
15 | * inside each group, elements are sorted by the criteria given by compare_priority(). |
|
|
16 | * the lookup of keysym is done in two steps: |
|
|
17 | * 1) locate the group corresponds to the keysym; |
|
|
18 | * 2) do a linear search inside the group. |
|
|
19 | * |
|
|
20 | * array hash[] effectively defines a map from a keysym to a group in keymap[]. |
|
|
21 | * |
|
|
22 | * each group has its address(the index of first group element in keymap[]), |
|
|
23 | * which is computed and stored in hash[]. |
|
|
24 | * hash[] stores the addresses in the form of: |
|
|
25 | * index: 0 I1 I2 I3 In |
|
|
26 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
|
|
27 | * where |
|
|
28 | * A1 = 0; |
|
|
29 | * Ai+1 = N1 + N2 + ... + Ni. |
|
|
30 | * it is computed from hash_budget_size[]: |
|
|
31 | * index: 0 I1 I2 I3 In |
|
|
32 | * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
|
|
33 | * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the compution of hash[]) |
|
|
34 | * or we can say |
|
|
35 | * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0, |
|
|
36 | * where |
|
|
37 | * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
|
|
38 | * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK |
|
|
39 | * n(the number of groups) = the number of non-zero member of hash_budget_size[]; |
|
|
40 | * Ni(the size of group i) = hash_budget_size[Ii]. |
|
|
41 | */ |
|
|
42 | |
|
|
43 | #if STOCK_KEYMAP |
11 | //////////////////////////////////////////////////////////////////////////////// |
44 | //////////////////////////////////////////////////////////////////////////////// |
12 | // default keycode translation map and keyevent handlers |
45 | // default keycode translation map and keyevent handlers |
13 | |
46 | |
14 | keysym_t keyboard_manager::stock_keymap[] = { |
47 | keysym_t keyboard_manager::stock_keymap[] = { |
15 | /* examples */ |
48 | /* examples */ |
… | |
… | |
32 | //{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, |
65 | //{ '.', ControlMask, 1, keysym_t::NORMAL, "\033<C-.>"}, |
33 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
66 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
34 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
67 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
35 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
68 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
36 | }; |
69 | }; |
|
|
70 | #endif |
37 | |
71 | |
38 | static void |
72 | static void |
39 | output_string (rxvt_term *rt, const char *str) |
73 | output_string (rxvt_term *rt, const char *str) |
40 | { |
74 | { |
41 | if (strncmp (str, "command:", 8) == 0) |
75 | if (strncmp (str, "command:", 8) == 0) |
… | |
… | |
181 | strcpy (translation, translation + 4); |
215 | strcpy (translation, translation + 4); |
182 | } |
216 | } |
183 | else |
217 | else |
184 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
218 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
185 | } |
219 | } |
|
|
220 | else if (strncmp (translation, "builtin:", 8) == 0) |
|
|
221 | key->type = keysym_t::BUILTIN; |
186 | |
222 | |
187 | user_keymap.push_back (key); |
223 | user_keymap.push_back (key); |
188 | user_translations.push_back (translation); |
224 | user_translations.push_back (translation); |
189 | register_keymap (key); |
225 | register_keymap (key); |
190 | } |
226 | } |
… | |
… | |
207 | } |
243 | } |
208 | |
244 | |
209 | void |
245 | void |
210 | keyboard_manager::register_done () |
246 | keyboard_manager::register_done () |
211 | { |
247 | { |
|
|
248 | #if STOCK_KEYMAP |
212 | unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t); |
249 | int n = sizeof (stock_keymap) / sizeof (keysym_t); |
213 | |
250 | |
|
|
251 | //TODO: shield against repeated calls and empty keymap |
214 | if (keymap.back () != &stock_keymap[n - 1]) |
252 | //if (keymap.back () != &stock_keymap[n - 1]) |
215 | for (i = 0; i < n; ++i) |
253 | for (int i = 0; i < n; ++i) |
216 | register_keymap (&stock_keymap[i]); |
254 | register_keymap (&stock_keymap[i]); |
|
|
255 | #endif |
217 | |
256 | |
218 | purge_duplicate_keymap (); |
257 | purge_duplicate_keymap (); |
219 | |
258 | |
220 | setup_hash (); |
259 | setup_hash (); |
221 | } |
260 | } |
222 | |
261 | |
223 | bool |
262 | bool |
224 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
263 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
225 | { |
264 | { |
226 | assert (hash[0] == 0 && "register_done() need to be called"); |
265 | assert (hash[0] == 0 && "register_done() need to be called"); |
|
|
266 | |
|
|
267 | state &= OtherModMask; // mask out uninteresting modifiers |
227 | |
268 | |
228 | if (state & term->ModMetaMask) state |= MetaMask; |
269 | if (state & term->ModMetaMask) state |= MetaMask; |
229 | if (state & term->ModNumLockMask) state |= NumLockMask; |
270 | if (state & term->ModNumLockMask) state |= NumLockMask; |
230 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
271 | if (state & term->ModLevel3Mask) state |= Level3Mask; |
231 | |
272 | |
… | |
… | |
236 | |
277 | |
237 | if (index >= 0) |
278 | if (index >= 0) |
238 | { |
279 | { |
239 | const keysym_t &key = *keymap [index]; |
280 | const keysym_t &key = *keymap [index]; |
240 | |
281 | |
|
|
282 | if (key.type != keysym_t::BUILTIN) |
|
|
283 | { |
241 | int keysym_offset = keysym - key.keysym; |
284 | int keysym_offset = keysym - key.keysym; |
242 | |
285 | |
243 | wchar_t *wc = rxvt_utf8towcs (key.str); |
286 | wchar_t *wc = rxvt_utf8towcs (key.str); |
244 | char *str = rxvt_wcstombs (wc); |
287 | char *str = rxvt_wcstombs (wc); |
245 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
288 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
246 | free (wc); |
289 | free (wc); |
247 | |
290 | |
248 | switch (key.type) |
291 | switch (key.type) |
249 | { |
|
|
250 | case keysym_t::NORMAL: |
|
|
251 | output_string (term, str); |
|
|
252 | break; |
|
|
253 | |
|
|
254 | case keysym_t::RANGE: |
|
|
255 | { |
292 | { |
|
|
293 | case keysym_t::NORMAL: |
|
|
294 | output_string (term, str); |
|
|
295 | break; |
|
|
296 | |
|
|
297 | case keysym_t::RANGE: |
|
|
298 | { |
256 | char buf[STRING_MAX]; |
299 | char buf[STRING_MAX]; |
257 | |
300 | |
258 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
301 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
|
|
302 | output_string (term, buf); |
|
|
303 | } |
|
|
304 | break; |
|
|
305 | |
|
|
306 | case keysym_t::RANGE_META8: |
|
|
307 | { |
|
|
308 | int len; |
|
|
309 | char buf[STRING_MAX]; |
|
|
310 | |
|
|
311 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
312 | if (len > 0) |
|
|
313 | output_string_meta8 (term, state, buf, len); |
|
|
314 | } |
|
|
315 | break; |
|
|
316 | |
|
|
317 | case keysym_t::LIST: |
|
|
318 | { |
|
|
319 | char buf[STRING_MAX]; |
|
|
320 | |
|
|
321 | char *prefix, *middle, *suffix; |
|
|
322 | |
|
|
323 | prefix = str; |
|
|
324 | middle = strchr (prefix + 1, *prefix); |
|
|
325 | suffix = strrchr (middle + 1, *prefix); |
|
|
326 | |
|
|
327 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
328 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
329 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
330 | |
259 | output_string (term, buf); |
331 | output_string (term, buf); |
|
|
332 | } |
|
|
333 | break; |
260 | } |
334 | } |
261 | break; |
|
|
262 | |
335 | |
263 | case keysym_t::RANGE_META8: |
|
|
264 | { |
|
|
265 | int len; |
|
|
266 | char buf[STRING_MAX]; |
|
|
267 | |
|
|
268 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
269 | if (len > 0) |
|
|
270 | output_string_meta8 (term, state, buf, len); |
|
|
271 | } |
|
|
272 | break; |
|
|
273 | |
|
|
274 | case keysym_t::LIST: |
|
|
275 | { |
|
|
276 | char buf[STRING_MAX]; |
|
|
277 | |
|
|
278 | char *prefix, *middle, *suffix; |
|
|
279 | |
|
|
280 | prefix = str; |
|
|
281 | middle = strchr (prefix + 1, *prefix); |
|
|
282 | suffix = strrchr (middle + 1, *prefix); |
|
|
283 | |
|
|
284 | memcpy (buf, prefix + 1, middle - prefix - 1); |
|
|
285 | buf [middle - prefix - 1] = middle [keysym_offset + 1]; |
|
|
286 | strcpy (buf + (middle - prefix), suffix + 1); |
|
|
287 | |
|
|
288 | output_string (term, buf); |
|
|
289 | } |
|
|
290 | break; |
|
|
291 | } |
|
|
292 | |
|
|
293 | free (str); |
336 | free (str); |
294 | |
337 | |
295 | return true; |
338 | return true; |
|
|
339 | } |
296 | } |
340 | } |
297 | else |
341 | |
298 | return false; |
342 | return false; |
299 | } |
343 | } |
300 | |
344 | |
301 | // purge duplicate keymap entries |
345 | // purge duplicate keymap entries |
302 | void keyboard_manager::purge_duplicate_keymap () |
346 | void keyboard_manager::purge_duplicate_keymap () |
303 | { |
347 | { |