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.38 by sf-exg, Wed Jan 5 17:00:17 2011 UTC vs.
Revision 1.60 by sf-exg, Fri Dec 28 13:29:05 2012 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.
… …
24#include "../config.h" 24#include "../config.h"
25#include "rxvt.h" 25#include "rxvt.h"
26 26
27#ifdef KEYSYM_RESOURCE 27#ifdef KEYSYM_RESOURCE
28 28
29#include <cstring> 29#include <string.h>
30 30
31#include "rxvtperl.h" 31#include "rxvtperl.h"
32#include "keyboard.h" 32#include "keyboard.h"
33#include "command.h"
34 33
35/* an intro to the data structure: 34/* an intro to the data structure:
36 * 35 *
37 * vector keymap[] is grouped. 36 * vector keymap[] is grouped.
38 * 37 *
… …
63 * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; 62 * 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]. 63 * Ni(the size of group i) = hash_bucket_size[Ii].
65 */ 64 */
66 65
67static void 66static void
68output_string (rxvt_term *rt, const char *str) 67output_string (rxvt_term *term, const char *str)
69{ 68{
70 if (strncmp (str, "command:", 8) == 0) 69 if (strncmp (str, "command:", 8) == 0)
71 rt->cmd_write (str + 8, strlen (str) - 8); 70 term->cmdbuf_append (str + 8, strlen (str) - 8);
72 else if (strncmp (str, "perl:", 5) == 0) 71 else if (strncmp (str, "perl:", 5) == 0)
73 HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); 72 HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END));
74 else 73 else
75 rt->tt_write (str, strlen (str)); 74 term->tt_write (str, strlen (str));
76} 75}
77 76
78// return: priority_of_a - priority_of_b 77// return: priority_of_a - priority_of_b
79static int 78static int
80compare_priority (keysym_t *a, keysym_t *b) 79compare_priority (keysym_t *a, keysym_t *b)
81{ 80{
82 // (the more '1's in state; the less range): the greater priority 81 // (the more '1's in state; the less range): the greater priority
83 int ca = rxvt_popcount (a->state /* & OtherModMask */); 82 int ca = ecb_popcount32 (a->state /* & OtherModMask */);
84 int cb = rxvt_popcount (b->state /* & OtherModMask */); 83 int cb = ecb_popcount32 (b->state /* & OtherModMask */);
85 84
86 if (ca != cb)
87 return ca - cb; 85 return ca - cb;
88//else if (a->state != b->state) // this behavior is to be discussed
89// return b->state - a->state;
90 else
91 return b->range - a->range;
92} 86}
93 87
94//////////////////////////////////////////////////////////////////////////////// 88////////////////////////////////////////////////////////////////////////////////
95keyboard_manager::keyboard_manager () 89keyboard_manager::keyboard_manager ()
96{ 90{
… …
98 hash [0] = 1; // hash[0] != 0 indicates uninitialized data 92 hash [0] = 1; // hash[0] != 0 indicates uninitialized data
99} 93}
100 94
101keyboard_manager::~keyboard_manager () 95keyboard_manager::~keyboard_manager ()
102{ 96{
103 clear (); 97 for (unsigned int i = 0; i < keymap.size (); ++i)
98 {
99 free (keymap [i]->str);
100 delete keymap [i];
101 }
104} 102}
105 103
106void 104void
107keyboard_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.
126void
127keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 105keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws)
128{ 106{
107 char *translation = rxvt_wcstoutf8 (ws);
108
129 keysym_t *key = new keysym_t; 109 keysym_t *key = new keysym_t;
130 wchar_t *wc = rxvt_mbstowcs (trans);
131 char *translation = rxvt_wcstoutf8 (wc);
132 free (wc);
133 110
134 if (key && translation)
135 {
136 key->keysym = keysym; 111 key->keysym = keysym;
137 key->state = state; 112 key->state = state;
138 key->range = 1;
139 key->str = translation; 113 key->str = translation;
140 key->type = keysym_t::STRING; 114 key->type = keysym_t::STRING;
141 115
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) 116 if (strncmp (translation, "builtin:", 8) == 0)
158 key->type = keysym_t::BUILTIN; 117 key->type = keysym_t::BUILTIN;
159 118
160 register_keymap (key);
161 }
162 else
163 {
164 delete key;
165 free ((void *)translation);
166 rxvt_fatal ("out of memory, aborting.\n");
167 }
168}
169
170void
171keyboard_manager::register_keymap (keysym_t *key)
172{
173 if (keymap.size () == keymap.capacity ()) 119 if (keymap.size () == keymap.capacity ())
174 keymap.reserve (keymap.size () * 2); 120 keymap.reserve (keymap.size () * 2);
175 121
176 keymap.push_back (key); 122 keymap.push_back (key);
177 hash[0] = 3; 123 hash[0] = 3;
178} 124}
179 125
180void
181keyboard_manager::register_done ()
182{
183 setup_hash ();
184}
185
186bool 126bool
187keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 127keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state)
188{ 128{
189 assert (hash[0] == 0 && "register_done() need to be called"); 129 assert (("register_done() need to be called", hash[0] == 0));
190 130
191 state &= OtherModMask; // mask out uninteresting modifiers 131 state &= OtherModMask; // mask out uninteresting modifiers
192 132
193 if (state & term->ModMetaMask) state |= MetaMask; 133 if (state & term->ModMetaMask) state |= MetaMask;
194 if (state & term->ModNumLockMask) state |= NumLockMask; 134 if (state & term->ModNumLockMask) state |= NumLockMask;
… …
199 139
200 int index = find_keysym (keysym, state); 140 int index = find_keysym (keysym, state);
201 141
202 if (index >= 0) 142 if (index >= 0)
203 { 143 {
204 const keysym_t &key = *keymap [index]; 144 keysym_t *key = keymap [index];
205 145
206 if (key.type != keysym_t::BUILTIN) 146 if (key->type != keysym_t::BUILTIN)
207 { 147 {
208 int keysym_offset = keysym - key.keysym;
209
210 wchar_t *wc = rxvt_utf8towcs (key.str); 148 wchar_t *ws = rxvt_utf8towcs (key->str);
211 char *str = rxvt_wcstombs (wc); 149 char *str = rxvt_wcstombs (ws);
212 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) 150 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
213 free (wc); 151 free (ws);
214 152
215 switch (key.type)
216 {
217 case keysym_t::STRING:
218 output_string (term, str); 153 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 154
240 free (str); 155 free (str);
241 156
242 return true; 157 return true;
243 } 158 }
… …
245 160
246 return false; 161 return false;
247} 162}
248 163
249void 164void
250keyboard_manager::setup_hash () 165keyboard_manager::register_done ()
251{ 166{
252 unsigned int i, index, hashkey; 167 unsigned int i, index, hashkey;
253 vector <keysym_t *> sorted_keymap;
254 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket 168 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket
255 169
256 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 170 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
257 171
258 // determine hash bucket size 172 // determine hash bucket size
259 for (i = 0; i < keymap.size (); ++i) 173 for (i = 0; i < keymap.size (); ++i)
260 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j)
261 { 174 {
262 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 175 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
263 ++hash_bucket_size [hashkey]; 176 ++hash_bucket_size [hashkey];
264 } 177 }
265 178
266 // now we know the size of each bucket 179 // now we know the size of each bucket
267 // compute the index of each bucket 180 // compute the index of each bucket
268 hash [0] = 0;
269 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) 181 for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
270 { 182 {
271 index += hash_bucket_size [i - 1];
272 hash [i] = index; 183 hash [i] = index;
184 index += hash_bucket_size [i];
273 } 185 }
274 186
275 // and allocate just enough space 187 // and allocate just enough space
276 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); 188 simplevec <keysym_t *> sorted_keymap (index, 0);
277 189
278 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 190 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
279 191
280 // fill in sorted_keymap 192 // fill in sorted_keymap
281 // it is sorted in each bucket 193 // it is sorted in each bucket
282 for (i = 0; i < keymap.size (); ++i) 194 for (i = 0; i < keymap.size (); ++i)
283 for (int j = min (keymap [i]->range, KEYSYM_HASH_BUCKETS) - 1; j >= 0; --j)
284 { 195 {
285 hashkey = (keymap [i]->keysym + j) & KEYSYM_HASH_MASK; 196 hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK;
286 197
287 index = hash [hashkey] + hash_bucket_size [hashkey]; 198 index = hash [hashkey] + hash_bucket_size [hashkey];
288 199
289 while (index > hash [hashkey] 200 while (index > hash [hashkey]
290 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) 201 && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0)
291 { 202 {
292 sorted_keymap [index] = sorted_keymap [index - 1]; 203 sorted_keymap [index] = sorted_keymap [index - 1];
293 --index; 204 --index;
294 } 205 }
295 206
296 sorted_keymap [index] = keymap [i]; 207 sorted_keymap [index] = keymap [i];
297 ++hash_bucket_size [hashkey]; 208 ++hash_bucket_size [hashkey];
298 } 209 }
299 210
300 keymap.swap (sorted_keymap); 211 keymap.swap (sorted_keymap);
301 212
302#ifndef NDEBUG 213#ifndef NDEBUG
303 // check for invariants 214 // check for invariants
304 for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) 215 for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
305 { 216 {
306 index = hash[i]; 217 index = hash[i];
307 for (int j = 0; j < hash_bucket_size [i]; ++j) 218 for (int j = 0; j < hash_bucket_size [i]; ++j)
308 { 219 {
309 if (keymap [index + j]->range == 1)
310 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); 220 assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK));
311 221
312 if (j) 222 if (j)
313 assert (compare_priority (keymap [index + j - 1], 223 assert (compare_priority (keymap [index + j - 1],
314 keymap [index + j]) >= 0); 224 keymap [index + j]) >= 0);
315 } 225 }
… …
317 227
318 // this should be able to detect most possible bugs 228 // this should be able to detect most possible bugs
319 for (i = 0; i < sorted_keymap.size (); ++i) 229 for (i = 0; i < sorted_keymap.size (); ++i)
320 { 230 {
321 keysym_t *a = sorted_keymap[i]; 231 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); 232 int index = find_keysym (a->keysym, a->state);
325 233
326 assert (index >= 0); 234 assert (index >= 0);
327 keysym_t *b = keymap [index]; 235 keysym_t *b = keymap [index];
328 assert (i == index // the normally expected result 236 assert (i == index // the normally expected result
329 || IN_RANGE_INC (a->keysym + j, b->keysym, b->keysym + b->range) 237 || a->keysym == b->keysym
330 && compare_priority (a, b) <= 0); // is effectively the same or a closer match 238 && compare_priority (a, b) <= 0); // is effectively the same or a closer match
331 }
332 } 239 }
333#endif 240#endif
334} 241}
335 242
336int 243int
… …
344 251
345 for (; index < end; ++index) 252 for (; index < end; ++index)
346 { 253 {
347 keysym_t *key = keymap [index]; 254 keysym_t *key = keymap [index];
348 255
349 if (key->keysym <= keysym && keysym < key->keysym + key->range 256 if (key->keysym == keysym
350 // match only the specified bits in state and ignore others 257 // match only the specified bits in state and ignore others
351 && (key->state & state) == key->state) 258 && (key->state & state) == key->state)
352 return index; 259 return index;
353 } 260 }
354 261

Diff Legend

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