… | |
… | |
49 | * index: 0 I1 I2 I3 In |
49 | * index: 0 I1 I2 I3 In |
50 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
50 | * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
51 | * where |
51 | * where |
52 | * A1 = 0; |
52 | * A1 = 0; |
53 | * Ai+1 = N1 + N2 + ... + Ni. |
53 | * Ai+1 = N1 + N2 + ... + Ni. |
54 | * it is computed from hash_budget_size[]: |
54 | * it is computed from hash_bucket_size[]: |
55 | * index: 0 I1 I2 I3 In |
55 | * index: 0 I1 I2 I3 In |
56 | * 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 |
57 | * 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[]) |
58 | * or we can say |
58 | * or we can say |
59 | * hash_budget_size[Ii] = Ni; hash_budget_size[elsewhere] = 0, |
59 | * hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, |
60 | * where |
60 | * where |
61 | * 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 } |
62 | * 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 |
63 | * 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[]; |
64 | * Ni(the size of group i) = hash_budget_size[Ii]. |
64 | * Ni(the size of group i) = hash_bucket_size[Ii]. |
65 | */ |
65 | */ |
66 | |
|
|
67 | #if STOCK_KEYMAP |
|
|
68 | //////////////////////////////////////////////////////////////////////////////// |
|
|
69 | // default keycode translation map and keyevent handlers |
|
|
70 | |
|
|
71 | keysym_t keyboard_manager::stock_keymap[] = { |
|
|
72 | /* examples */ |
|
|
73 | /* keysym, state, range, type, str */ |
|
|
74 | //{XK_ISO_Left_Tab, 0, 1, keysym_t::STRING, "\033[Z"}, |
|
|
75 | //{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, |
|
|
76 | //{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, |
|
|
77 | //{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, |
|
|
78 | //{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, |
|
|
79 | //{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, |
|
|
80 | //{ XK_Tab, ControlMask, 1, keysym_t::STRING, "\033<C-Tab>"}, |
|
|
81 | //{ XK_apostrophe, ControlMask, 1, keysym_t::STRING, "\033<C-'>"}, |
|
|
82 | //{ XK_slash, ControlMask, 1, keysym_t::STRING, "\033<C-/>"}, |
|
|
83 | //{ XK_semicolon, ControlMask, 1, keysym_t::STRING, "\033<C-;>"}, |
|
|
84 | //{ XK_grave, ControlMask, 1, keysym_t::STRING, "\033<C-`>"}, |
|
|
85 | //{ XK_comma, ControlMask, 1, keysym_t::STRING, "\033<C-\054>"}, |
|
|
86 | //{ XK_Return, ControlMask, 1, keysym_t::STRING, "\033<C-Return>"}, |
|
|
87 | //{ XK_Return, ShiftMask, 1, keysym_t::STRING, "\033<S-Return>"}, |
|
|
88 | //{ ' ', ShiftMask, 1, keysym_t::STRING, "\033<S-Space>"}, |
|
|
89 | //{ '.', ControlMask, 1, keysym_t::STRING, "\033<C-.>"}, |
|
|
90 | //{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033<C-%c>"}, |
|
|
91 | //{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033<M-C-%c>"}, |
|
|
92 | //{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033<M-C-%c>"}, |
|
|
93 | }; |
|
|
94 | #endif |
|
|
95 | |
66 | |
96 | static void |
67 | static void |
97 | output_string (rxvt_term *rt, const char *str) |
68 | output_string (rxvt_term *rt, const char *str) |
98 | { |
69 | { |
99 | if (strncmp (str, "command:", 8) == 0) |
70 | if (strncmp (str, "command:", 8) == 0) |
… | |
… | |
102 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
73 | HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); |
103 | else |
74 | else |
104 | rt->tt_write (str, strlen (str)); |
75 | rt->tt_write (str, strlen (str)); |
105 | } |
76 | } |
106 | |
77 | |
107 | static void |
|
|
108 | output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) |
|
|
109 | { |
|
|
110 | if (state & rt->ModMetaMask) |
|
|
111 | { |
|
|
112 | #ifdef META8_OPTION |
|
|
113 | if (rt->meta_char == 0x80) /* set 8-bit on */ |
|
|
114 | { |
|
|
115 | for (char *ch = buf; ch < buf + buflen; ch++) |
|
|
116 | *ch |= 0x80; |
|
|
117 | } |
|
|
118 | else if (rt->meta_char == C0_ESC) /* escape prefix */ |
|
|
119 | #endif |
|
|
120 | { |
|
|
121 | const char ch = C0_ESC; |
|
|
122 | rt->tt_write (&ch, 1); |
|
|
123 | } |
|
|
124 | } |
|
|
125 | |
|
|
126 | rt->tt_write (buf, buflen); |
|
|
127 | } |
|
|
128 | |
|
|
129 | static int |
|
|
130 | format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) |
|
|
131 | { |
|
|
132 | size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); |
|
|
133 | |
|
|
134 | if (len >= (size_t)bufsize) |
|
|
135 | { |
|
|
136 | rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n"); |
|
|
137 | *buf = 0; |
|
|
138 | } |
|
|
139 | |
|
|
140 | return len; |
|
|
141 | } |
|
|
142 | |
|
|
143 | // return: priority_of_a - priority_of_b |
78 | // return: priority_of_a - priority_of_b |
144 | static int |
79 | static int |
145 | compare_priority (keysym_t *a, keysym_t *b) |
80 | compare_priority (keysym_t *a, keysym_t *b) |
146 | { |
81 | { |
147 | // (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 |
148 | int ca = popcount (a->state /* & OtherModMask */); |
83 | int ca = rxvt_popcount (a->state /* & OtherModMask */); |
149 | int cb = popcount (b->state /* & OtherModMask */); |
84 | int cb = rxvt_popcount (b->state /* & OtherModMask */); |
150 | |
85 | |
151 | if (ca != cb) |
86 | if (ca != cb) |
152 | return ca - cb; |
87 | return ca - cb; |
153 | //else if (a->state != b->state) // this behavior is to be disscussed |
88 | //else if (a->state != b->state) // this behavior is to be discussed |
154 | // return b->state - a->state; |
89 | // return b->state - a->state; |
155 | else |
90 | else |
156 | return b->range - a->range; |
91 | return b->range - a->range; |
157 | } |
92 | } |
158 | |
93 | |
… | |
… | |
169 | } |
104 | } |
170 | |
105 | |
171 | void |
106 | void |
172 | keyboard_manager::clear () |
107 | keyboard_manager::clear () |
173 | { |
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 | |
174 | keymap.clear (); |
118 | keymap.clear (); |
175 | hash [0] = 2; |
|
|
176 | |
|
|
177 | for (unsigned int i = 0; i < user_translations.size (); ++i) |
|
|
178 | { |
|
|
179 | free ((void *)user_translations [i]); |
|
|
180 | user_translations [i] = 0; |
|
|
181 | } |
|
|
182 | |
|
|
183 | for (unsigned int i = 0; i < user_keymap.size (); ++i) |
|
|
184 | { |
|
|
185 | delete user_keymap [i]; |
|
|
186 | user_keymap [i] = 0; |
|
|
187 | } |
|
|
188 | |
|
|
189 | user_keymap.clear (); |
|
|
190 | user_translations.clear (); |
|
|
191 | } |
119 | } |
192 | |
120 | |
193 | // a wrapper for register_keymap, |
121 | // a wrapper for register_keymap, |
194 | // so that outside codes don't have to know so much details. |
122 | // so that outside codes don't have to know so much details. |
195 | // |
123 | // |
… | |
… | |
227 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
155 | rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); |
228 | } |
156 | } |
229 | else if (strncmp (translation, "builtin:", 8) == 0) |
157 | else if (strncmp (translation, "builtin:", 8) == 0) |
230 | key->type = keysym_t::BUILTIN; |
158 | key->type = keysym_t::BUILTIN; |
231 | |
159 | |
232 | user_keymap.push_back (key); |
|
|
233 | user_translations.push_back (translation); |
|
|
234 | register_keymap (key); |
160 | register_keymap (key); |
235 | } |
161 | } |
236 | else |
162 | else |
237 | { |
163 | { |
238 | delete key; |
164 | delete key; |
… | |
… | |
252 | } |
178 | } |
253 | |
179 | |
254 | void |
180 | void |
255 | keyboard_manager::register_done () |
181 | keyboard_manager::register_done () |
256 | { |
182 | { |
257 | #if STOCK_KEYMAP |
|
|
258 | int n = sizeof (stock_keymap) / sizeof (keysym_t); |
|
|
259 | |
|
|
260 | //TODO: shield against repeated calls and empty keymap |
|
|
261 | //if (keymap.back () != &stock_keymap[n - 1]) |
|
|
262 | for (int i = 0; i < n; ++i) |
|
|
263 | register_keymap (&stock_keymap[i]); |
|
|
264 | #endif |
|
|
265 | |
|
|
266 | purge_duplicate_keymap (); |
|
|
267 | |
|
|
268 | setup_hash (); |
183 | setup_hash (); |
269 | } |
184 | } |
270 | |
185 | |
271 | bool |
186 | bool |
272 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
187 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
… | |
… | |
301 | { |
216 | { |
302 | case keysym_t::STRING: |
217 | case keysym_t::STRING: |
303 | output_string (term, str); |
218 | output_string (term, str); |
304 | break; |
219 | break; |
305 | |
220 | |
306 | case keysym_t::RANGE: |
|
|
307 | { |
|
|
308 | char buf[STRING_MAX]; |
|
|
309 | |
|
|
310 | if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) |
|
|
311 | output_string (term, buf); |
|
|
312 | } |
|
|
313 | break; |
|
|
314 | |
|
|
315 | case keysym_t::RANGE_META8: |
|
|
316 | { |
|
|
317 | int len; |
|
|
318 | char buf[STRING_MAX]; |
|
|
319 | |
|
|
320 | len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); |
|
|
321 | if (len > 0) |
|
|
322 | output_string_meta8 (term, state, buf, len); |
|
|
323 | } |
|
|
324 | break; |
|
|
325 | |
|
|
326 | case keysym_t::LIST: |
221 | case keysym_t::LIST: |
327 | { |
222 | { |
328 | char buf[STRING_MAX]; |
223 | char buf[STRING_MAX]; |
329 | |
224 | |
330 | char *prefix, *middle, *suffix; |
225 | char *prefix, *middle, *suffix; |
… | |
… | |
349 | } |
244 | } |
350 | |
245 | |
351 | return false; |
246 | return false; |
352 | } |
247 | } |
353 | |
248 | |
354 | // purge duplicate keymap entries |
|
|
355 | void keyboard_manager::purge_duplicate_keymap () |
|
|
356 | { |
|
|
357 | for (unsigned int i = 0; i < keymap.size (); ++i) |
|
|
358 | { |
|
|
359 | for (unsigned int j = 0; j < i; ++j) |
|
|
360 | { |
|
|
361 | if (keymap [i] == keymap [j]) |
|
|
362 | { |
|
|
363 | while (keymap [i] == keymap.back ()) |
|
|
364 | keymap.pop_back (); |
|
|
365 | |
|
|
366 | if (i < keymap.size ()) |
|
|
367 | { |
|
|
368 | keymap[i] = keymap.back (); |
|
|
369 | keymap.pop_back (); |
|
|
370 | } |
|
|
371 | |
|
|
372 | break; |
|
|
373 | } |
|
|
374 | } |
|
|
375 | } |
|
|
376 | } |
|
|
377 | |
|
|
378 | void |
249 | void |
379 | keyboard_manager::setup_hash () |
250 | keyboard_manager::setup_hash () |
380 | { |
251 | { |
381 | unsigned int i, index, hashkey; |
252 | unsigned int i, index, hashkey; |
382 | vector <keysym_t *> sorted_keymap; |
253 | vector <keysym_t *> sorted_keymap; |
383 | uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget |
254 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
384 | uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget |
255 | uint16_t hash_bucket_counter[KEYSYM_HASH_BUCKETS]; // #elements in each bucket |
385 | |
256 | |
386 | memset (hash_budget_size, 0, sizeof (hash_budget_size)); |
257 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
387 | memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); |
258 | memset (hash_bucket_counter, 0, sizeof (hash_bucket_counter)); |
388 | |
259 | |
389 | // determine hash bucket size |
260 | // determine hash bucket size |
390 | for (i = 0; i < keymap.size (); ++i) |
261 | for (i = 0; i < keymap.size (); ++i) |
391 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
262 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
392 | { |
263 | { |
393 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
264 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
394 | ++hash_budget_size [hashkey]; |
265 | ++hash_bucket_size [hashkey]; |
395 | } |
266 | } |
396 | |
267 | |
397 | // now we know the size of each budget |
268 | // now we know the size of each bucket |
398 | // compute the index of each budget |
269 | // compute the index of each bucket |
399 | hash [0] = 0; |
270 | hash [0] = 0; |
400 | for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) |
271 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
401 | { |
272 | { |
402 | index += hash_budget_size [i - 1]; |
273 | index += hash_bucket_size [i - 1]; |
403 | hash [i] = index; |
274 | hash [i] = index; |
404 | } |
275 | } |
405 | |
276 | |
406 | // and allocate just enough space |
277 | // and allocate just enough space |
407 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); |
278 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
408 | |
279 | |
409 | // fill in sorted_keymap |
280 | // fill in sorted_keymap |
410 | // it is sorted in each budget |
281 | // it is sorted in each bucket |
411 | for (i = 0; i < keymap.size (); ++i) |
282 | for (i = 0; i < keymap.size (); ++i) |
412 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) |
283 | for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j) |
413 | { |
284 | { |
414 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
285 | hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; |
415 | |
286 | |
416 | index = hash [hashkey] + hash_budget_counter [hashkey]; |
287 | index = hash [hashkey] + hash_bucket_counter [hashkey]; |
417 | |
288 | |
418 | while (index > hash [hashkey] |
289 | while (index > hash [hashkey] |
419 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
290 | && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
420 | { |
291 | { |
421 | sorted_keymap [index] = sorted_keymap [index - 1]; |
292 | sorted_keymap [index] = sorted_keymap [index - 1]; |
422 | --index; |
293 | --index; |
423 | } |
294 | } |
424 | |
295 | |
425 | sorted_keymap [index] = keymap [i]; |
296 | sorted_keymap [index] = keymap [i]; |
426 | ++hash_budget_counter [hashkey]; |
297 | ++hash_bucket_counter [hashkey]; |
427 | } |
298 | } |
428 | |
299 | |
429 | keymap.swap (sorted_keymap); |
300 | keymap.swap (sorted_keymap); |
430 | |
301 | |
431 | #ifdef DEBUG_STRICT |
302 | #ifndef NDEBUG |
432 | // check for invariants |
303 | // check for invariants |
433 | for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) |
304 | for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
434 | { |
305 | { |
435 | index = hash[i]; |
306 | index = hash[i]; |
436 | for (int j = 0; j < hash_budget_size [i]; ++j) |
307 | for (int j = 0; j < hash_bucket_size [i]; ++j) |
437 | { |
308 | { |
438 | if (keymap [index + j]->range == 1) |
309 | if (keymap [index + j]->range == 1) |
439 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
310 | assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
440 | |
311 | |
441 | if (j) |
312 | if (j) |
… | |
… | |
452 | { |
323 | { |
453 | int index = find_keysym (a->keysym + j, a->state); |
324 | int index = find_keysym (a->keysym + j, a->state); |
454 | |
325 | |
455 | assert (index >= 0); |
326 | assert (index >= 0); |
456 | keysym_t *b = keymap [index]; |
327 | keysym_t *b = keymap [index]; |
457 | assert (i == (signed) index || // the normally expected result |
328 | assert (i == index // the normally expected result |
458 | (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 |
329 | || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range) |
|
|
330 | && compare_priority (a, b) <= 0); // is effectively the same or a closer match |
459 | } |
331 | } |
460 | } |
332 | } |
461 | #endif |
333 | #endif |
462 | } |
334 | } |
463 | |
335 | |
464 | int |
336 | int |
465 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
337 | keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
466 | { |
338 | { |
467 | int hashkey = keysym & KEYSYM_HASH_MASK; |
339 | int hashkey = keysym & KEYSYM_HASH_MASK; |
468 | unsigned int index = hash [hashkey]; |
340 | unsigned int index = hash [hashkey]; |
469 | unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 |
341 | unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 |
470 | ? hash [hashkey + 1] |
342 | ? hash [hashkey + 1] |
471 | : keymap.size (); |
343 | : keymap.size (); |
472 | |
344 | |
473 | for (; index < end; ++index) |
345 | for (; index < end; ++index) |
474 | { |
346 | { |