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.45 by sf-exg, Sun Nov 27 09:19:04 2011 UTC vs.
Revision 1.71 by sf-exg, Thu Jan 15 14:30:04 2015 UTC

… …
6 * Copyright (c) 2005 WU Fengguang 6 * Copyright (c) 2005 WU Fengguang
7 * Copyright (c) 2005-2006 Marc Lehmann <schmorp@schmorp.de> 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 3 of the License, or
12 * (at your option) any later version. 12 * (at your option) any later version.
13 * 13 *
14 * This program is distributed in the hope that it will be useful, 14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of 15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
… …
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 *
… …
62 * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK 61 * 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[]; 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
68output_string (rxvt_term *rt, const char *str)
69{
70 if (strncmp (str, "command:", 8) == 0)
71 rt->cmdbuf_append (str + 8, strlen (str) - 8);
72 else if (strncmp (str, "perl:", 5) == 0)
73 HOOK_INVOKE((rt, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END));
74 else
75 rt->tt_write (str, strlen (str));
76}
77
78// return: priority_of_a - priority_of_b 66// return: priority_of_a - priority_of_b
79static int 67static int
80compare_priority (keysym_t *a, keysym_t *b) 68compare_priority (keysym_t *a, keysym_t *b)
81{ 69{
82 // (the more '1's in state; the less range): the greater priority 70 // (the more '1's in state; the less range): the greater priority
83 int ca = ecb_popcount32 (a->state /* & OtherModMask */); 71 int ca = ecb_popcount32 (a->state /* & OtherModMask */);
84 int cb = ecb_popcount32 (b->state /* & OtherModMask */); 72 int cb = ecb_popcount32 (b->state /* & OtherModMask */);
85 73
86 if (ca != cb)
87 return ca - cb; 74 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 0;
92} 75}
93 76
94//////////////////////////////////////////////////////////////////////////////// 77////////////////////////////////////////////////////////////////////////////////
95keyboard_manager::keyboard_manager () 78keyboard_manager::keyboard_manager ()
96{ 79{
… …
98 hash [0] = 1; // hash[0] != 0 indicates uninitialized data 81 hash [0] = 1; // hash[0] != 0 indicates uninitialized data
99} 82}
100 83
101keyboard_manager::~keyboard_manager () 84keyboard_manager::~keyboard_manager ()
102{ 85{
103 clear ();
104}
105
106void
107keyboard_manager::clear ()
108{
109 hash [0] = 2;
110
111 for (unsigned int i = 0; i < keymap.size (); ++i) 86 for (unsigned int i = 0; i < keymap.size (); ++i)
112 { 87 {
113 free (keymap [i]->str); 88 free (keymap [i]->str);
114 delete keymap [i]; 89 delete keymap [i];
115 keymap [i] = 0;
116 } 90 }
117
118 keymap.clear ();
119} 91}
120 92
121// a wrapper for register_translation that converts the input string
122// to utf-8 and expands 'list' syntax.
123void 93void
124keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) 94keyboard_manager::unregister_action (KeySym keysym, unsigned int state)
125{ 95{
126 wchar_t *wc = rxvt_mbstowcs (trans); 96 for (unsigned int i = 0; i < keymap.size (); ++i)
127 char *translation = rxvt_wcstoutf8 (wc); 97 if (keymap [i]->keysym == keysym
128 free (wc); 98 && keymap [i]->state == state)
129
130 if (strncmp (translation, "list", 4) == 0 && translation [4]
131 && strlen (translation) < STRING_MAX)
132 {
133 char *prefix = translation + 4;
134 char *middle = strchr (prefix + 1, translation [4]);
135 char *suffix = strrchr (prefix + 1, translation [4]);
136
137 if (suffix && middle && suffix > middle + 1)
138 { 99 {
139 int range = suffix - middle - 1; 100 free (keymap [i]->str);
140 int prefix_len = middle - prefix - 1; 101 delete keymap [i];
141 char buf[STRING_MAX];
142 102
143 memcpy (buf, prefix + 1, prefix_len); 103 if (i < keymap.size () - 1)
144 strcpy (buf + prefix_len + 1, suffix + 1); 104 keymap [i] = keymap [keymap.size () - 1];
105 keymap.pop_back ();
145 106
146 for (int i = 0; i < range; i++) 107 break;
147 {
148 buf [prefix_len] = middle [i + 1];
149 register_translation (keysym + i, state, strdup (buf));
150 }
151
152 free (translation);
153 return;
154 } 108 }
155 else
156 rxvt_warn ("cannot parse list-type keysym '%s', processing as normal keysym.\n", translation);
157 }
158
159 register_translation (keysym, state, translation);
160} 109}
161 110
162void 111void
163keyboard_manager::register_translation (KeySym keysym, unsigned int state, char *translation) 112keyboard_manager::register_action (KeySym keysym, unsigned int state, const wchar_t *ws)
164{ 113{
114 char *action = rxvt_wcstoutf8 (ws);
115
165 keysym_t *key = new keysym_t; 116 keysym_t *key = new keysym_t;
166 117
167 if (key && translation)
168 {
169 key->keysym = keysym; 118 key->keysym = keysym;
170 key->state = state; 119 key->state = state;
171 key->str = translation; 120 key->str = action;
172 key->type = keysym_t::STRING; 121 key->type = keysym_t::STRING;
173 122
174 if (strncmp (translation, "builtin:", 8) == 0) 123 if (strncmp (action, "builtin:", 8) == 0)
175 key->type = keysym_t::BUILTIN; 124 key->type = keysym_t::BUILTIN;
125 else if (strncmp (action, "builtin-string:", 15) == 0)
126 key->type = keysym_t::BUILTIN_STRING;
176 127
177 register_keymap (key); 128 unregister_action (keysym, state);
178 }
179 else
180 {
181 delete key;
182 free (translation);
183 rxvt_fatal ("out of memory, aborting.\n");
184 }
185}
186 129
187void
188keyboard_manager::register_keymap (keysym_t *key)
189{
190 if (keymap.size () == keymap.capacity ()) 130 if (keymap.size () == keymap.capacity ())
191 keymap.reserve (keymap.size () * 2); 131 keymap.reserve (keymap.size () * 2);
192 132
193 keymap.push_back (key); 133 keymap.push_back (key);
194 hash[0] = 3; 134 hash[0] = 3;
195} 135}
196 136
197void
198keyboard_manager::register_done ()
199{
200 setup_hash ();
201}
202
203bool 137bool
204keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 138keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state, const char *kbuf, int len)
205{ 139{
206 assert (hash[0] == 0 && "register_done() need to be called"); 140 assert (("register_done() need to be called", hash[0] == 0));
207 141
208 state &= OtherModMask; // mask out uninteresting modifiers 142 state &= OtherModMask; // mask out uninteresting modifiers
209 143
210 if (state & term->ModMetaMask) state |= MetaMask; 144 if (state & term->ModMetaMask) state |= MetaMask;
211 if (state & term->ModNumLockMask) state |= NumLockMask; 145 if (state & term->ModNumLockMask) state |= NumLockMask;
… …
216 150
217 int index = find_keysym (keysym, state); 151 int index = find_keysym (keysym, state);
218 152
219 if (index >= 0) 153 if (index >= 0)
220 { 154 {
221 const keysym_t &key = *keymap [index]; 155 keysym_t *key = keymap [index];
222 156
157 if (key->type == keysym_t::BUILTIN_STRING)
158 {
159 term->tt_write_user_input (kbuf, len);
160 return true;
161 }
223 if (key.type != keysym_t::BUILTIN) 162 else if (key->type != keysym_t::BUILTIN)
224 { 163 {
225 wchar_t *wc = rxvt_utf8towcs (key.str); 164 wchar_t *ws = rxvt_utf8towcs (key->str);
226 char *str = rxvt_wcstombs (wc); 165 char *str = rxvt_wcstombs (ws);
227 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) 166 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
228 free (wc); 167 free (ws);
229 168
230 output_string (term, str); 169 if (char *colon = strchr (str, ':'))
170 {
171 if (strncmp (str, "command:", 8) == 0)
172 term->cmdbuf_append (str + 8, strlen (str) - 8);
173 else if (strncmp (str, "string:", 7) == 0)
174 term->tt_write_user_input (colon + 1, strlen (colon + 1));
175 else if (strncmp (str, "perl:", 5) == 0)
176 HOOK_INVOKE ((term, HOOK_USER_COMMAND, DT_STR, colon + 1, DT_END));
177 else
178 HOOK_INVOKE ((term, HOOK_ACTION, DT_STR_LEN, str, colon - str, DT_STR, colon + 1, DT_INT, 0, DT_STR_LEN, kbuf, len, DT_END));
179 }
180 else
181 term->tt_write_user_input (str, strlen (str));
231 182
232 free (str); 183 free (str);
233 184
234 return true; 185 return true;
235 } 186 }
… …
237 188
238 return false; 189 return false;
239} 190}
240 191
241void 192void
242keyboard_manager::setup_hash () 193keyboard_manager::register_done ()
243{ 194{
244 unsigned int i, index, hashkey; 195 unsigned int i, index, hashkey;
245 vector <keysym_t *> sorted_keymap;
246 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket 196 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket
247 197
248 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 198 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
249 199
250 // determine hash bucket size 200 // determine hash bucket size
… …
254 ++hash_bucket_size [hashkey]; 204 ++hash_bucket_size [hashkey];
255 } 205 }
256 206
257 // now we know the size of each bucket 207 // now we know the size of each bucket
258 // compute the index of each bucket 208 // compute the index of each bucket
259 hash [0] = 0;
260 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) 209 for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
261 { 210 {
262 index += hash_bucket_size [i - 1];
263 hash [i] = index; 211 hash [i] = index;
212 index += hash_bucket_size [i];
264 } 213 }
265 214
266 // and allocate just enough space 215 // and allocate just enough space
267 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); 216 simplevec <keysym_t *> sorted_keymap (index, 0);
268 217
269 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 218 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
270 219
271 // fill in sorted_keymap 220 // fill in sorted_keymap
272 // it is sorted in each bucket 221 // it is sorted in each bucket

Diff Legend

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