… | |
… | |
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 | |
67 | static void |
|
|
68 | output_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 |
79 | static int |
67 | static int |
80 | compare_priority (keysym_t *a, keysym_t *b) |
68 | compare_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 | //////////////////////////////////////////////////////////////////////////////// |
95 | keyboard_manager::keyboard_manager () |
78 | keyboard_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 | |
101 | keyboard_manager::~keyboard_manager () |
84 | keyboard_manager::~keyboard_manager () |
102 | { |
85 | { |
103 | hash [0] = 2; |
|
|
104 | |
|
|
105 | for (unsigned int i = 0; i < keymap.size (); ++i) |
86 | for (unsigned int i = 0; i < keymap.size (); ++i) |
106 | { |
87 | { |
107 | free (keymap [i]->str); |
88 | free (keymap [i]->str); |
108 | delete keymap [i]; |
89 | delete keymap [i]; |
109 | keymap [i] = 0; |
|
|
110 | } |
90 | } |
111 | |
|
|
112 | keymap.clear (); |
|
|
113 | } |
91 | } |
114 | |
92 | |
115 | // a wrapper for register_translation that converts the input string |
|
|
116 | // to utf-8 and expands 'list' syntax. |
|
|
117 | void |
93 | void |
118 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
94 | keyboard_manager::unregister_action (KeySym keysym, unsigned int state) |
119 | { |
95 | { |
120 | wchar_t *wc = rxvt_mbstowcs (trans); |
96 | for (unsigned int i = 0; i < keymap.size (); ++i) |
121 | char *translation = rxvt_wcstoutf8 (wc); |
97 | if (keymap [i]->keysym == keysym |
122 | free (wc); |
98 | && keymap [i]->state == state) |
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 | { |
99 | { |
133 | int range = suffix - middle - 1; |
100 | free (keymap [i]->str); |
134 | int prefix_len = middle - prefix - 1; |
101 | delete keymap [i]; |
135 | char buf[STRING_MAX]; |
|
|
136 | |
102 | |
137 | memcpy (buf, prefix + 1, prefix_len); |
103 | if (i < keymap.size () - 1) |
138 | strcpy (buf + prefix_len + 1, suffix + 1); |
104 | keymap [i] = keymap [keymap.size () - 1]; |
|
|
105 | keymap.pop_back (); |
139 | |
106 | |
140 | for (int i = 0; i < range; i++) |
107 | break; |
141 | { |
|
|
142 | buf [prefix_len] = middle [i + 1]; |
|
|
143 | register_translation (keysym + i, state, strdup (buf)); |
|
|
144 | } |
|
|
145 | |
|
|
146 | free (translation); |
|
|
147 | return; |
|
|
148 | } |
108 | } |
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 | } |
109 | } |
155 | |
110 | |
156 | void |
111 | void |
157 | keyboard_manager::register_translation (KeySym keysym, unsigned int state, char *translation) |
112 | keyboard_manager::register_action (KeySym keysym, unsigned int state, const wchar_t *ws) |
158 | { |
113 | { |
|
|
114 | char *action = rxvt_wcstoutf8 (ws); |
|
|
115 | |
159 | keysym_t *key = new keysym_t; |
116 | keysym_t *key = new keysym_t; |
160 | |
117 | |
161 | if (key && translation) |
|
|
162 | { |
|
|
163 | key->keysym = keysym; |
118 | key->keysym = keysym; |
164 | key->state = state; |
119 | key->state = state; |
165 | key->str = translation; |
120 | key->str = action; |
166 | key->type = keysym_t::STRING; |
121 | key->type = keysym_t::STRING; |
167 | |
122 | |
168 | if (strncmp (translation, "builtin:", 8) == 0) |
123 | if (strncmp (action, "builtin:", 8) == 0) |
169 | 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; |
170 | |
127 | |
|
|
128 | unregister_action (keysym, state); |
|
|
129 | |
171 | if (keymap.size () == keymap.capacity ()) |
130 | if (keymap.size () == keymap.capacity ()) |
172 | keymap.reserve (keymap.size () * 2); |
131 | keymap.reserve (keymap.size () * 2); |
173 | |
132 | |
174 | keymap.push_back (key); |
133 | keymap.push_back (key); |
175 | hash[0] = 3; |
134 | hash[0] = 3; |
176 | } |
|
|
177 | else |
|
|
178 | { |
|
|
179 | delete key; |
|
|
180 | free (translation); |
|
|
181 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
|
|
182 | } |
|
|
183 | } |
135 | } |
184 | |
136 | |
185 | bool |
137 | bool |
186 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
138 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state, const char *kbuf, int len) |
187 | { |
139 | { |
188 | assert (("register_done() need to be called", hash[0] == 0)); |
140 | assert (("register_done() need to be called", hash[0] == 0)); |
189 | |
141 | |
190 | state &= OtherModMask; // mask out uninteresting modifiers |
142 | state &= OtherModMask; // mask out uninteresting modifiers |
191 | |
143 | |
… | |
… | |
200 | |
152 | |
201 | if (index >= 0) |
153 | if (index >= 0) |
202 | { |
154 | { |
203 | keysym_t *key = keymap [index]; |
155 | keysym_t *key = keymap [index]; |
204 | |
156 | |
|
|
157 | if (key->type == keysym_t::BUILTIN_STRING) |
|
|
158 | { |
|
|
159 | term->tt_write_user_input (kbuf, len); |
|
|
160 | return true; |
|
|
161 | } |
205 | if (key->type != keysym_t::BUILTIN) |
162 | else if (key->type != keysym_t::BUILTIN) |
206 | { |
163 | { |
207 | wchar_t *wc = rxvt_utf8towcs (key->str); |
164 | wchar_t *ws = rxvt_utf8towcs (key->str); |
208 | char *str = rxvt_wcstombs (wc); |
165 | char *str = rxvt_wcstombs (ws); |
209 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
166 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
210 | free (wc); |
167 | free (ws); |
211 | |
168 | |
212 | 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)); |
213 | |
182 | |
214 | free (str); |
183 | free (str); |
215 | |
184 | |
216 | return true; |
185 | return true; |
217 | } |
186 | } |
… | |
… | |
222 | |
191 | |
223 | void |
192 | void |
224 | keyboard_manager::register_done () |
193 | keyboard_manager::register_done () |
225 | { |
194 | { |
226 | unsigned int i, index, hashkey; |
195 | unsigned int i, index, hashkey; |
227 | vector <keysym_t *> sorted_keymap; |
|
|
228 | 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 |
229 | |
197 | |
230 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
198 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
231 | |
199 | |
232 | // determine hash bucket size |
200 | // determine hash bucket size |
… | |
… | |
236 | ++hash_bucket_size [hashkey]; |
204 | ++hash_bucket_size [hashkey]; |
237 | } |
205 | } |
238 | |
206 | |
239 | // now we know the size of each bucket |
207 | // now we know the size of each bucket |
240 | // compute the index of each bucket |
208 | // compute the index of each bucket |
241 | hash [0] = 0; |
|
|
242 | for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) |
209 | for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
243 | { |
210 | { |
244 | index += hash_bucket_size [i - 1]; |
|
|
245 | hash [i] = index; |
211 | hash [i] = index; |
|
|
212 | index += hash_bucket_size [i]; |
246 | } |
213 | } |
247 | |
214 | |
248 | // and allocate just enough space |
215 | // and allocate just enough space |
249 | sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); |
216 | simplevec <keysym_t *> sorted_keymap (index, 0); |
250 | |
217 | |
251 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
218 | memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
252 | |
219 | |
253 | // fill in sorted_keymap |
220 | // fill in sorted_keymap |
254 | // it is sorted in each bucket |
221 | // it is sorted in each bucket |