ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/keyboard.C
(Generate patch)

Comparing rxvt-unicode/src/keyboard.C (file contents):
Revision 1.26 by root, Mon Oct 9 23:12:45 2006 UTC vs.
Revision 1.55 by sf-exg, Sat Dec 3 11:47:19 2011 UTC

… …
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.
… …
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 66
67#if STOCK_KEYMAP
68////////////////////////////////////////////////////////////////////////////////
69// default keycode translation map and keyevent handlers
70
71keysym_t keyboard_manager::stock_keymap[] = {
72 /* examples */
73 /* keysym, state, range, handler, 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
96static void 67static void
97output_string (rxvt_term *rt, const char *str) 68output_string (rxvt_term *term, const char *str)
98{ 69{
99 if (strncmp (str, "command:", 8) == 0) 70 if (strncmp (str, "command:", 8) == 0)
100 rt->cmd_write (str + 8, strlen (str) - 8); 71 term->cmdbuf_append (str + 8, strlen (str) - 8);
101 else if (strncmp (str, "perl:", 5) == 0) 72 else if (strncmp (str, "perl:", 5) == 0)
102 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));
103 else 74 else
104 rt->tt_write (str, strlen (str)); 75 term->tt_write (str, strlen (str));
105} 76}
106
107static void
108output_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
129static int
130format_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////////////////////////////////////////////////////////////////////////////////
144// return: #bits of '1'
145#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3)
146# define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n__); }))
147#else
148static int
149bitcount (uint16_t n)
150{
151 int i;
152
153 for (i = 0; n; ++i, n &= n - 1)
154 ;
155
156 return i;
157}
158#endif
159 77
160// return: priority_of_a - priority_of_b 78// return: priority_of_a - priority_of_b
161static int 79static int
162compare_priority (keysym_t *a, keysym_t *b) 80compare_priority (keysym_t *a, keysym_t *b)
163{ 81{
164 // (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
165 int ca = bitcount (a->state /* & OtherModMask */); 83 int ca = ecb_popcount32 (a->state /* & OtherModMask */);
166 int cb = bitcount (b->state /* & OtherModMask */); 84 int cb = ecb_popcount32 (b->state /* & OtherModMask */);
167 85
168 if (ca != cb) 86 if (ca != cb)
169 return ca - cb; 87 return ca - cb;
170//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
171// return b->state - a->state; 89// return b->state - a->state;
172 else 90 else
173 return b->range - a->range; 91 return 0;
174} 92}
175 93
176//////////////////////////////////////////////////////////////////////////////// 94////////////////////////////////////////////////////////////////////////////////
177keyboard_manager::keyboard_manager () 95keyboard_manager::keyboard_manager ()
178{ 96{
… …
180 hash [0] = 1; // hash[0] != 0 indicates uninitialized data 98 hash [0] = 1; // hash[0] != 0 indicates uninitialized data
181} 99}
182 100
183keyboard_manager::~keyboard_manager () 101keyboard_manager::~keyboard_manager ()
184{ 102{
185 clear (); 103 for (unsigned int i = 0; i < keymap.size (); ++i)
104 {
105 free (keymap [i]->str);
106 delete keymap [i];
107 }
186} 108}
187 109
188void 110void
189keyboard_manager::clear ()
190{
191 keymap.clear ();
192 hash [0] = 2;
193
194 for (unsigned int i = 0; i < user_translations.size (); ++i)
195 {
196 free ((void *)user_translations [i]);
197 user_translations [i] = 0;
198 }
199
200 for (unsigned int i = 0; i < user_keymap.size (); ++i)
201 {
202 delete user_keymap [i];
203 user_keymap [i] = 0;
204 }
205
206 user_keymap.clear ();
207 user_translations.clear ();
208}
209
210// a wrapper for register_keymap,
211// so that outside codes don't have to know so much details.
212//
213// the string 'trans' is copied to an internal managed buffer,
214// so the caller can free memory of 'trans' at any time.
215void
216keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 111keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws)
217{ 112{
113 char *translation = rxvt_wcstoutf8 (ws);
114
218 keysym_t *key = new keysym_t; 115 keysym_t *key = new keysym_t;
219 wchar_t *wc = rxvt_mbstowcs (trans);
220 char *translation = rxvt_wcstoutf8 (wc);
221 free (wc);
222 116
223 if (key && translation) 117 if (!key)
224 { 118 rxvt_fatal ("memory allocation failure. aborting.\n");
119
225 key->keysym = keysym; 120 key->keysym = keysym;
226 key->state = state; 121 key->state = state;
227 key->range = 1;
228 key->str = translation; 122 key->str = translation;
229 key->type = keysym_t::STRING; 123 key->type = keysym_t::STRING;
230 124
231 if (strncmp (translation, "list", 4) == 0 && translation [4])
232 {
233 char *middle = strchr (translation + 5, translation [4]);
234 char *suffix = strrchr (translation + 5, translation [4]);
235
236 if (suffix && middle && suffix > middle + 1)
237 {
238 key->type = keysym_t::LIST;
239 key->range = suffix - middle - 1;
240
241 memmove (translation, translation + 4, strlen (translation + 4) + 1);
242 }
243 else
244 rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation);
245 }
246 else if (strncmp (translation, "builtin:", 8) == 0) 125 if (strncmp (translation, "builtin:", 8) == 0)
247 key->type = keysym_t::BUILTIN; 126 key->type = keysym_t::BUILTIN;
248 127
249 user_keymap.push_back (key);
250 user_translations.push_back (translation);
251 register_keymap (key);
252 }
253 else
254 {
255 delete key;
256 free ((void *)translation);
257 rxvt_fatal ("out of memory, aborting.\n");
258 }
259}
260
261void
262keyboard_manager::register_keymap (keysym_t *key)
263{
264 if (keymap.size () == keymap.capacity ()) 128 if (keymap.size () == keymap.capacity ())
265 keymap.reserve (keymap.size () * 2); 129 keymap.reserve (keymap.size () * 2);
266 130
267 keymap.push_back (key); 131 keymap.push_back (key);
268 hash[0] = 3; 132 hash[0] = 3;
269} 133}
270 134
271void
272keyboard_manager::register_done ()
273{
274#if STOCK_KEYMAP
275 int n = sizeof (stock_keymap) / sizeof (keysym_t);
276
277 //TODO: shield against repeated calls and empty keymap
278 //if (keymap.back () != &stock_keymap[n - 1])
279 for (int i = 0; i < n; ++i)
280 register_keymap (&stock_keymap[i]);
281#endif
282
283 purge_duplicate_keymap ();
284
285 setup_hash ();
286}
287
288bool 135bool
289keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 136keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state)
290{ 137{
291 assert (hash[0] == 0 && "register_done() need to be called"); 138 assert (("register_done() need to be called", hash[0] == 0));
292 139
293 state &= OtherModMask; // mask out uninteresting modifiers 140 state &= OtherModMask; // mask out uninteresting modifiers
294 141
295 if (state & term->ModMetaMask) state |= MetaMask; 142 if (state & term->ModMetaMask) state |= MetaMask;
296 if (state & term->ModNumLockMask) state |= NumLockMask; 143 if (state & term->ModNumLockMask) state |= NumLockMask;
… …
301 148
302 int index = find_keysym (keysym, state); 149 int index = find_keysym (keysym, state);
303 150
304 if (index >= 0) 151 if (index >= 0)
305 { 152 {
306 const keysym_t &key = *keymap [index]; 153 keysym_t *key = keymap [index];
307 154
308 if (key.type != keysym_t::BUILTIN) 155 if (key->type != keysym_t::BUILTIN)
309 { 156 {
310 int keysym_offset = keysym - key.keysym;
311
312 wchar_t *wc = rxvt_utf8towcs (key.str); 157 wchar_t *ws = rxvt_utf8towcs (key->str);
313 char *str = rxvt_wcstombs (wc); 158 char *str = rxvt_wcstombs (ws);
314 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) 159 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
315 free (wc); 160 free (ws);
316 161
317 switch (key.type)
318 {
319 case keysym_t::STRING:
320 output_string (term, str); 162 output_string (term, str);
321 break;
322
323 case keysym_t::RANGE:
324 {
325 char buf[STRING_MAX];
326
327 if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0)
328 output_string (term, buf);
329 }
330 break;
331
332 case keysym_t::RANGE_META8:
333 {
334 int len;
335 char buf[STRING_MAX];
336
337 len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf));
338 if (len > 0)
339 output_string_meta8 (term, state, buf, len);
340 }
341 break;
342
343 case keysym_t::LIST:
344 {
345 char buf[STRING_MAX];
346
347 char *prefix, *middle, *suffix;
348
349 prefix = str;
350 middle = strchr (prefix + 1, *prefix);
351 suffix = strrchr (middle + 1, *prefix);
352
353 memcpy (buf, prefix + 1, middle - prefix - 1);
354 buf [middle - prefix - 1] = middle [keysym_offset + 1];
355 strcpy (buf + (middle - prefix), suffix + 1);
356
357 output_string (term, buf);
358 }
359 break;
360 }
361 163
362 free (str); 164 free (str);
363 165
364 return true; 166 return true;
365 } 167 }
366 } 168 }
367 169
368 return false; 170 return false;
369} 171}
370 172
371// purge duplicate keymap entries
372void keyboard_manager::purge_duplicate_keymap ()
373{
374 for (unsigned int i = 0; i < keymap.size (); ++i)
375 {
376 for (unsigned int j = 0; j < i; ++j)
377 {
378 if (keymap [i] == keymap [j])
379 {
380 while (keymap [i] == keymap.back ())
381 keymap.pop_back ();
382
383 if (i < keymap.size ())
384 {
385 keymap[i] = keymap.back ();
386 keymap.pop_back ();
387 }
388
389 break;
390 }
391 }
392 }
393}
394
395void 173void
396keyboard_manager::setup_hash () 174keyboard_manager::register_done ()
397{ 175{
398 unsigned int i, index, hashkey; 176 unsigned int i, index, hashkey;
399 vector <keysym_t *> sorted_keymap; 177 vector <keysym_t *> sorted_keymap;
400 uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget 178 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket
401 uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget
402 179
403 memset (hash_budget_size, 0, sizeof (hash_budget_size)); 180 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
404 memset (hash_budget_counter, 0, sizeof (hash_budget_counter));
405 181
406 // determine hash bucket size 182 // determine hash bucket size
407 for (i = 0; i < keymap.size (); ++i) 183 for (i = 0; i < keymap.size (); ++i)
408 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
409 { 184 {
410 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 185 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
411 ++hash_budget_size [hashkey]; 186 ++hash_bucket_size [hashkey];
412 } 187 }
413 188
414 // now we know the size of each budget 189 // now we know the size of each bucket
415 // compute the index of each budget 190 // compute the index of each bucket
416 hash [0] = 0; 191 hash [0] = 0;
417 for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) 192 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i)
418 { 193 {
419 index += hash_budget_size [i - 1]; 194 index += hash_bucket_size [i - 1];
420 hash [i] = index; 195 hash [i] = index;
421 } 196 }
422 197
423 // and allocate just enough space 198 // and allocate just enough space
424 sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); 199 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0);
200
201 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
425 202
426 // fill in sorted_keymap 203 // fill in sorted_keymap
427 // it is sorted in each budget 204 // it is sorted in each bucket
428 for (i = 0; i < keymap.size (); ++i) 205 for (i = 0; i < keymap.size (); ++i)
429 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j)
430 { 206 {
431 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 207 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
432 208
433 index = hash [hashkey] + hash_budget_counter [hashkey]; 209 index = hash [hashkey] + hash_bucket_size [hashkey];
434 210
435 while (index > hash [hashkey] 211 while (index > hash [hashkey]
436 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) 212 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0)
437 { 213 {
438 sorted_keymap [index] = sorted_keymap [index - 1]; 214 sorted_keymap [index] = sorted_keymap [index - 1];
439 --index; 215 --index;
440 } 216 }
441 217
442 sorted_keymap [index] = keymap [i]; 218 sorted_keymap [index] = keymap [i];
443 ++hash_budget_counter [hashkey]; 219 ++hash_bucket_size [hashkey];
444 } 220 }
445 221
446 keymap.swap (sorted_keymap); 222 keymap.swap (sorted_keymap);
447 223
448#ifdef DEBUG_STRICT 224#ifndef NDEBUG
449 // check for invariants 225 // check for invariants
450 for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) 226 for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
451 { 227 {
452 index = hash[i]; 228 index = hash[i];
453 for (int j = 0; j < hash_budget_size [i]; ++j) 229 for (int j = 0; j < hash_bucket_size [i]; ++j)
454 { 230 {
455 if (keymap [index + j]->range == 1)
456 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); 231 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK));
457 232
458 if (j) 233 if (j)
459 assert (compare_priority (keymap [index + j - 1], 234 assert (compare_priority (keymap [index + j - 1],
460 keymap [index + j]) >= 0); 235 keymap [index + j]) >= 0);
461 } 236 }
… …
463 238
464 // this should be able to detect most possible bugs 239 // this should be able to detect most possible bugs
465 for (i = 0; i < sorted_keymap.size (); ++i) 240 for (i = 0; i < sorted_keymap.size (); ++i)
466 { 241 {
467 keysym_t *a = sorted_keymap[i]; 242 keysym_t *a = sorted_keymap[i];
468 for (int j = 0; j < a->range; ++j)
469 {
470 int index = find_keysym (a->keysym + j, a->state); 243 int index = find_keysym (a->keysym, a->state);
471 244
472 assert (index >= 0); 245 assert (index >= 0);
473 keysym_t *b = keymap [index]; 246 keysym_t *b = keymap [index];
474 assert (i == (signed) index || // the normally expected result 247 assert (i == index // the normally expected result
475 (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 248 || a->keysym == b->keysym
476 } 249 && compare_priority (a, b) <= 0); // is effectively the same or a closer match
477 } 250 }
478#endif 251#endif
479} 252}
480 253
481int 254int
482keyboard_manager::find_keysym (KeySym keysym, unsigned int state) 255keyboard_manager::find_keysym (KeySym keysym, unsigned int state)
483{ 256{
484 int hashkey = keysym & KEYSYM_HASH_MASK; 257 int hashkey = keysym & KEYSYM_HASH_MASK;
485 unsigned int index = hash [hashkey]; 258 unsigned int index = hash [hashkey];
486 unsigned int end = hashkey < KEYSYM_HASH_BUDGETS - 1 259 unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1
487 ? hash [hashkey + 1] 260 ? hash [hashkey + 1]
488 : keymap.size (); 261 : keymap.size ();
489 262
490 for (; index < end; ++index) 263 for (; index < end; ++index)
491 { 264 {
492 keysym_t *key = keymap [index]; 265 keysym_t *key = keymap [index];
493 266
494 if (key->keysym <= keysym && keysym < key->keysym + key->range 267 if (key->keysym == keysym
495 // match only the specified bits in state and ignore others 268 // match only the specified bits in state and ignore others
496 && (key->state & state) == key->state) 269 && (key->state & state) == key->state)
497 return index; 270 return index;
498 } 271 }
499 272

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines