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.52 by sf-exg, Fri Dec 2 09:02:05 2011 UTC vs.
Revision 1.64 by sf-exg, Tue Apr 29 13:10:06 2014 UTC

… …
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 *term, const char *str)
69{
70 if (strncmp (str, "command:", 8) == 0)
71 term->cmdbuf_append (str + 8, strlen (str) - 8);
72 else if (strncmp (str, "perl:", 5) == 0)
73 HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END));
74 else
75 term->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{
… …
105 free (keymap [i]->str); 88 free (keymap [i]->str);
106 delete keymap [i]; 89 delete keymap [i];
107 } 90 }
108} 91}
109 92
110// a wrapper for register_translation that converts the input string
111// to utf-8 and expands 'list' syntax.
112void 93void
113keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) 94keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws)
114{ 95{
115 char *translation = rxvt_wcstoutf8 (ws); 96 char *translation = rxvt_wcstoutf8 (ws);
116 97
117 if (strncmp (translation, "list", 4) == 0 && translation [4]
118 && strlen (translation) < STRING_MAX)
119 {
120 char *prefix = translation + 4;
121 char *middle = strchr (prefix + 1, translation [4]);
122 char *suffix = strrchr (prefix + 1, translation [4]);
123
124 if (suffix && middle && suffix > middle + 1)
125 {
126 int range = suffix - middle - 1;
127 int prefix_len = middle - prefix - 1;
128 char buf[STRING_MAX];
129
130 memcpy (buf, prefix + 1, prefix_len);
131 strcpy (buf + prefix_len + 1, suffix + 1);
132
133 for (int i = 0; i < range; i++)
134 {
135 buf [prefix_len] = middle [i + 1];
136 register_translation (keysym + i, state, strdup (buf));
137 }
138
139 free (translation);
140 return;
141 }
142 else
143 rxvt_warn ("unable to parse list-type keysym '%s', processing as normal keysym.\n", translation);
144 }
145
146 register_translation (keysym, state, translation);
147}
148
149void
150keyboard_manager::register_translation (KeySym keysym, unsigned int state, char *translation)
151{
152 keysym_t *key = new keysym_t; 98 keysym_t *key = new keysym_t;
153 99
154 if (key && translation)
155 {
156 key->keysym = keysym; 100 key->keysym = keysym;
157 key->state = state; 101 key->state = state;
158 key->str = translation; 102 key->str = translation;
159 key->type = keysym_t::STRING; 103 key->type = keysym_t::STRING;
160 104
161 if (strncmp (translation, "builtin:", 8) == 0) 105 if (strncmp (translation, "builtin:", 8) == 0)
162 key->type = keysym_t::BUILTIN; 106 key->type = keysym_t::BUILTIN;
163 107
164 if (keymap.size () == keymap.capacity ()) 108 if (keymap.size () == keymap.capacity ())
165 keymap.reserve (keymap.size () * 2); 109 keymap.reserve (keymap.size () * 2);
166 110
167 keymap.push_back (key); 111 keymap.push_back (key);
168 hash[0] = 3; 112 hash[0] = 3;
169 }
170 else
171 {
172 delete key;
173 free (translation);
174 rxvt_fatal ("memory allocation failure. aborting.\n");
175 }
176} 113}
177 114
178bool 115bool
179keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) 116keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state, const char *kbuf, int len)
180{ 117{
181 assert (("register_done() need to be called", hash[0] == 0)); 118 assert (("register_done() need to be called", hash[0] == 0));
182 119
183 state &= OtherModMask; // mask out uninteresting modifiers 120 state &= OtherModMask; // mask out uninteresting modifiers
184 121
… …
200 wchar_t *ws = rxvt_utf8towcs (key->str); 137 wchar_t *ws = rxvt_utf8towcs (key->str);
201 char *str = rxvt_wcstombs (ws); 138 char *str = rxvt_wcstombs (ws);
202 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) 139 // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.)
203 free (ws); 140 free (ws);
204 141
205 output_string (term, str); 142 if (char *colon = strchr (str, ':'))
143 {
144 if (strncmp (str, "command:", 8) == 0)
145 term->cmdbuf_append (str + 8, strlen (str) - 8);
146 else if (strncmp (str, "string:", 7) == 0)
147 term->tt_write_user_input (colon + 1, strlen (colon + 1));
148 else if (strncmp (str, "perl:", 8) == 0)
149 HOOK_INVOKE ((term, HOOK_USER_COMMAND, DT_STR, colon + 1, DT_END));
150 else
151 HOOK_INVOKE ((term, HOOK_KEYBOARD_DISPATCH, DT_STR_LEN, str, colon - str, DT_STR, colon + 1, DT_END));
152 }
153 else
154 term->tt_write_user_input (str, strlen (str));
206 155
207 free (str); 156 free (str);
208 157
209 return true; 158 return true;
210 } 159 }
… …
215 164
216void 165void
217keyboard_manager::register_done () 166keyboard_manager::register_done ()
218{ 167{
219 unsigned int i, index, hashkey; 168 unsigned int i, index, hashkey;
220 vector <keysym_t *> sorted_keymap;
221 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket 169 uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket
222 170
223 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 171 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
224 172
225 // determine hash bucket size 173 // determine hash bucket size
… …
229 ++hash_bucket_size [hashkey]; 177 ++hash_bucket_size [hashkey];
230 } 178 }
231 179
232 // now we know the size of each bucket 180 // now we know the size of each bucket
233 // compute the index of each bucket 181 // compute the index of each bucket
234 hash [0] = 0;
235 for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) 182 for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i)
236 { 183 {
237 index += hash_bucket_size [i - 1];
238 hash [i] = index; 184 hash [i] = index;
185 index += hash_bucket_size [i];
239 } 186 }
240 187
241 // and allocate just enough space 188 // and allocate just enough space
242 sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); 189 simplevec <keysym_t *> sorted_keymap (index, 0);
243 190
244 memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); 191 memset (hash_bucket_size, 0, sizeof (hash_bucket_size));
245 192
246 // fill in sorted_keymap 193 // fill in sorted_keymap
247 // it is sorted in each bucket 194 // it is sorted in each bucket

Diff Legend

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