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

Diff Legend

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