… | |
… | |
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 | static void |
67 | static void |
68 | output_string (rxvt_term *rt, const char *str) |
68 | output_string (rxvt_term *term, const char *str) |
69 | { |
69 | { |
70 | if (strncmp (str, "command:", 8) == 0) |
70 | if (strncmp (str, "command:", 8) == 0) |
71 | rt->cmdbuf_append (str + 8, strlen (str) - 8); |
71 | term->cmdbuf_append (str + 8, strlen (str) - 8); |
72 | else if (strncmp (str, "perl:", 5) == 0) |
72 | else if (strncmp (str, "perl:", 5) == 0) |
73 | 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)); |
74 | else |
74 | else |
75 | rt->tt_write (str, strlen (str)); |
75 | term->tt_write (str, strlen (str)); |
76 | } |
76 | } |
77 | |
77 | |
78 | // return: priority_of_a - priority_of_b |
78 | // return: priority_of_a - priority_of_b |
79 | static int |
79 | static int |
80 | compare_priority (keysym_t *a, keysym_t *b) |
80 | compare_priority (keysym_t *a, keysym_t *b) |
81 | { |
81 | { |
82 | // (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 |
83 | int ca = rxvt_popcount (a->state /* & OtherModMask */); |
83 | int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
84 | int cb = rxvt_popcount (b->state /* & OtherModMask */); |
84 | int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
85 | |
85 | |
86 | if (ca != cb) |
86 | if (ca != cb) |
87 | return ca - cb; |
87 | return ca - cb; |
88 | //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 |
89 | // return b->state - a->state; |
89 | // return b->state - a->state; |
… | |
… | |
98 | hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
98 | hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
99 | } |
99 | } |
100 | |
100 | |
101 | keyboard_manager::~keyboard_manager () |
101 | keyboard_manager::~keyboard_manager () |
102 | { |
102 | { |
103 | clear (); |
|
|
104 | } |
|
|
105 | |
|
|
106 | void |
|
|
107 | keyboard_manager::clear () |
|
|
108 | { |
|
|
109 | hash [0] = 2; |
|
|
110 | |
|
|
111 | for (unsigned int i = 0; i < keymap.size (); ++i) |
103 | for (unsigned int i = 0; i < keymap.size (); ++i) |
112 | { |
104 | { |
113 | free ((void *)keymap [i]->str); |
105 | free (keymap [i]->str); |
114 | delete keymap [i]; |
106 | delete keymap [i]; |
115 | keymap [i] = 0; |
|
|
116 | } |
107 | } |
117 | |
|
|
118 | keymap.clear (); |
|
|
119 | } |
108 | } |
120 | |
109 | |
121 | // a wrapper for register_keymap, |
110 | // a wrapper for register_translation that converts the input string |
122 | // so that outside codes don't have to know so much details. |
111 | // to utf-8 and expands 'list' syntax. |
123 | // |
|
|
124 | // the string 'trans' is copied to an internal managed buffer, |
|
|
125 | // so the caller can free memory of 'trans' at any time. |
|
|
126 | void |
112 | void |
127 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
113 | keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) |
128 | { |
114 | { |
|
|
115 | wchar_t *ws = rxvt_mbstowcs (trans); |
|
|
116 | char *translation = rxvt_wcstoutf8 (ws); |
|
|
117 | free (ws); |
|
|
118 | |
|
|
119 | if (strncmp (translation, "list", 4) == 0 && translation [4] |
|
|
120 | && strlen (translation) < STRING_MAX) |
|
|
121 | { |
|
|
122 | char *prefix = translation + 4; |
|
|
123 | char *middle = strchr (prefix + 1, translation [4]); |
|
|
124 | char *suffix = strrchr (prefix + 1, translation [4]); |
|
|
125 | |
|
|
126 | if (suffix && middle && suffix > middle + 1) |
|
|
127 | { |
|
|
128 | int range = suffix - middle - 1; |
|
|
129 | int prefix_len = middle - prefix - 1; |
|
|
130 | char buf[STRING_MAX]; |
|
|
131 | |
|
|
132 | memcpy (buf, prefix + 1, prefix_len); |
|
|
133 | strcpy (buf + prefix_len + 1, suffix + 1); |
|
|
134 | |
|
|
135 | for (int i = 0; i < range; i++) |
|
|
136 | { |
|
|
137 | buf [prefix_len] = middle [i + 1]; |
|
|
138 | register_translation (keysym + i, state, strdup (buf)); |
|
|
139 | } |
|
|
140 | |
|
|
141 | free (translation); |
|
|
142 | return; |
|
|
143 | } |
|
|
144 | else |
|
|
145 | rxvt_warn ("unable to parse list-type keysym '%s', processing as normal keysym.\n", translation); |
|
|
146 | } |
|
|
147 | |
|
|
148 | register_translation (keysym, state, translation); |
|
|
149 | } |
|
|
150 | |
|
|
151 | void |
|
|
152 | keyboard_manager::register_translation (KeySym keysym, unsigned int state, char *translation) |
|
|
153 | { |
129 | keysym_t *key = new keysym_t; |
154 | keysym_t *key = new keysym_t; |
130 | wchar_t *wc = rxvt_mbstowcs (trans); |
|
|
131 | char *translation = rxvt_wcstoutf8 (wc); |
|
|
132 | free (wc); |
|
|
133 | |
155 | |
134 | if (key && translation) |
156 | if (key && translation) |
135 | { |
157 | { |
136 | key->keysym = keysym; |
158 | key->keysym = keysym; |
137 | key->state = state; |
159 | key->state = state; |
… | |
… | |
139 | key->type = keysym_t::STRING; |
161 | key->type = keysym_t::STRING; |
140 | |
162 | |
141 | if (strncmp (translation, "builtin:", 8) == 0) |
163 | if (strncmp (translation, "builtin:", 8) == 0) |
142 | key->type = keysym_t::BUILTIN; |
164 | key->type = keysym_t::BUILTIN; |
143 | |
165 | |
144 | register_keymap (key); |
166 | if (keymap.size () == keymap.capacity ()) |
|
|
167 | keymap.reserve (keymap.size () * 2); |
|
|
168 | |
|
|
169 | keymap.push_back (key); |
|
|
170 | hash[0] = 3; |
145 | } |
171 | } |
146 | else |
172 | else |
147 | { |
173 | { |
148 | delete key; |
174 | delete key; |
149 | free ((void *)translation); |
175 | free (translation); |
150 | rxvt_fatal ("out of memory, aborting.\n"); |
176 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
151 | } |
177 | } |
152 | } |
|
|
153 | |
|
|
154 | void |
|
|
155 | keyboard_manager::register_keymap (keysym_t *key) |
|
|
156 | { |
|
|
157 | if (keymap.size () == keymap.capacity ()) |
|
|
158 | keymap.reserve (keymap.size () * 2); |
|
|
159 | |
|
|
160 | keymap.push_back (key); |
|
|
161 | hash[0] = 3; |
|
|
162 | } |
|
|
163 | |
|
|
164 | void |
|
|
165 | keyboard_manager::register_done () |
|
|
166 | { |
|
|
167 | setup_hash (); |
|
|
168 | } |
178 | } |
169 | |
179 | |
170 | bool |
180 | bool |
171 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
181 | keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) |
172 | { |
182 | { |
173 | assert (hash[0] == 0 && "register_done() need to be called"); |
183 | assert (("register_done() need to be called", hash[0] == 0)); |
174 | |
184 | |
175 | state &= OtherModMask; // mask out uninteresting modifiers |
185 | state &= OtherModMask; // mask out uninteresting modifiers |
176 | |
186 | |
177 | if (state & term->ModMetaMask) state |= MetaMask; |
187 | if (state & term->ModMetaMask) state |= MetaMask; |
178 | if (state & term->ModNumLockMask) state |= NumLockMask; |
188 | if (state & term->ModNumLockMask) state |= NumLockMask; |
… | |
… | |
183 | |
193 | |
184 | int index = find_keysym (keysym, state); |
194 | int index = find_keysym (keysym, state); |
185 | |
195 | |
186 | if (index >= 0) |
196 | if (index >= 0) |
187 | { |
197 | { |
188 | const keysym_t &key = *keymap [index]; |
198 | keysym_t *key = keymap [index]; |
189 | |
199 | |
190 | if (key.type != keysym_t::BUILTIN) |
200 | if (key->type != keysym_t::BUILTIN) |
191 | { |
201 | { |
192 | wchar_t *wc = rxvt_utf8towcs (key.str); |
202 | wchar_t *ws = rxvt_utf8towcs (key->str); |
193 | char *str = rxvt_wcstombs (wc); |
203 | char *str = rxvt_wcstombs (ws); |
194 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
204 | // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
195 | free (wc); |
205 | free (ws); |
196 | |
206 | |
197 | switch (key.type) |
|
|
198 | { |
|
|
199 | case keysym_t::STRING: |
|
|
200 | output_string (term, str); |
207 | output_string (term, str); |
201 | break; |
|
|
202 | } |
|
|
203 | |
208 | |
204 | free (str); |
209 | free (str); |
205 | |
210 | |
206 | return true; |
211 | return true; |
207 | } |
212 | } |
… | |
… | |
209 | |
214 | |
210 | return false; |
215 | return false; |
211 | } |
216 | } |
212 | |
217 | |
213 | void |
218 | void |
214 | keyboard_manager::setup_hash () |
219 | keyboard_manager::register_done () |
215 | { |
220 | { |
216 | unsigned int i, index, hashkey; |
221 | unsigned int i, index, hashkey; |
217 | vector <keysym_t *> sorted_keymap; |
222 | vector <keysym_t *> sorted_keymap; |
218 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
223 | uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
219 | |
224 | |