| 1 |
/*----------------------------------------------------------------------* |
| 2 |
* File: keyboard.C |
| 3 |
*----------------------------------------------------------------------* |
| 4 |
* |
| 5 |
* All portions of code are copyright by their respective author/s. |
| 6 |
* Copyright (c) 2005 WU Fengguang |
| 7 |
* Copyright (c) 2005-2006 Marc Lehmann <schmorp@schmorp.de> |
| 8 |
* |
| 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 |
| 11 |
* the Free Software Foundation; either version 2 of the License, or |
| 12 |
* (at your option) any later version. |
| 13 |
* |
| 14 |
* This program is distributed in the hope that it will be useful, |
| 15 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 |
* GNU General Public License for more details. |
| 18 |
* |
| 19 |
* You should have received a copy of the GNU General Public License |
| 20 |
* along with this program; if not, write to the Free Software |
| 21 |
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 22 |
*----------------------------------------------------------------------*/ |
| 23 |
|
| 24 |
#include "../config.h" |
| 25 |
#include "rxvt.h" |
| 26 |
|
| 27 |
#ifdef KEYSYM_RESOURCE |
| 28 |
|
| 29 |
#include <string.h> |
| 30 |
|
| 31 |
#include "rxvtperl.h" |
| 32 |
#include "keyboard.h" |
| 33 |
|
| 34 |
/* an intro to the data structure: |
| 35 |
* |
| 36 |
* vector keymap[] is grouped. |
| 37 |
* |
| 38 |
* inside each group, elements are sorted by the criteria given by compare_priority(). |
| 39 |
* the lookup of keysym is done in two steps: |
| 40 |
* 1) locate the group corresponds to the keysym; |
| 41 |
* 2) do a linear search inside the group. |
| 42 |
* |
| 43 |
* array hash[] effectively defines a map from a keysym to a group in keymap[]. |
| 44 |
* |
| 45 |
* each group has its address(the index of first group element in keymap[]), |
| 46 |
* which is computed and stored in hash[]. |
| 47 |
* hash[] stores the addresses in the form of: |
| 48 |
* index: 0 I1 I2 I3 In |
| 49 |
* value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An |
| 50 |
* where |
| 51 |
* A1 = 0; |
| 52 |
* Ai+1 = N1 + N2 + ... + Ni. |
| 53 |
* it is computed from hash_bucket_size[]: |
| 54 |
* index: 0 I1 I2 I3 In |
| 55 |
* value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 |
| 56 |
* 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[]) |
| 57 |
* or we can say |
| 58 |
* hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, |
| 59 |
* where |
| 60 |
* set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } |
| 61 |
* where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK |
| 62 |
* n(the number of groups) = the number of non-zero member of hash_bucket_size[]; |
| 63 |
* Ni(the size of group i) = hash_bucket_size[Ii]. |
| 64 |
*/ |
| 65 |
|
| 66 |
// return: priority_of_a - priority_of_b |
| 67 |
static int |
| 68 |
compare_priority (keysym_t *a, keysym_t *b) |
| 69 |
{ |
| 70 |
// (the more '1's in state; the less range): the greater priority |
| 71 |
int ca = ecb_popcount32 (a->state /* & OtherModMask */); |
| 72 |
int cb = ecb_popcount32 (b->state /* & OtherModMask */); |
| 73 |
|
| 74 |
return ca - cb; |
| 75 |
} |
| 76 |
|
| 77 |
//////////////////////////////////////////////////////////////////////////////// |
| 78 |
keyboard_manager::keyboard_manager () |
| 79 |
{ |
| 80 |
keymap.reserve (256); |
| 81 |
hash [0] = 1; // hash[0] != 0 indicates uninitialized data |
| 82 |
} |
| 83 |
|
| 84 |
keyboard_manager::~keyboard_manager () |
| 85 |
{ |
| 86 |
for (unsigned int i = 0; i < keymap.size (); ++i) |
| 87 |
{ |
| 88 |
free (keymap [i]->str); |
| 89 |
delete keymap [i]; |
| 90 |
} |
| 91 |
} |
| 92 |
|
| 93 |
void |
| 94 |
keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) |
| 95 |
{ |
| 96 |
char *translation = rxvt_wcstoutf8 (ws); |
| 97 |
|
| 98 |
keysym_t *key = new keysym_t; |
| 99 |
|
| 100 |
key->keysym = keysym; |
| 101 |
key->state = state; |
| 102 |
key->str = translation; |
| 103 |
key->type = keysym_t::STRING; |
| 104 |
|
| 105 |
if (strncmp (translation, "builtin:", 8) == 0) |
| 106 |
key->type = keysym_t::BUILTIN; |
| 107 |
|
| 108 |
if (keymap.size () == keymap.capacity ()) |
| 109 |
keymap.reserve (keymap.size () * 2); |
| 110 |
|
| 111 |
keymap.push_back (key); |
| 112 |
hash[0] = 3; |
| 113 |
} |
| 114 |
|
| 115 |
bool |
| 116 |
keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state, const char *kbuf, int len) |
| 117 |
{ |
| 118 |
assert (("register_done() need to be called", hash[0] == 0)); |
| 119 |
|
| 120 |
state &= OtherModMask; // mask out uninteresting modifiers |
| 121 |
|
| 122 |
if (state & term->ModMetaMask) state |= MetaMask; |
| 123 |
if (state & term->ModNumLockMask) state |= NumLockMask; |
| 124 |
if (state & term->ModLevel3Mask) state |= Level3Mask; |
| 125 |
|
| 126 |
if (!!(term->priv_modes & PrivMode_aplKP) != !!(state & ShiftMask)) |
| 127 |
state |= AppKeypadMask; |
| 128 |
|
| 129 |
int index = find_keysym (keysym, state); |
| 130 |
|
| 131 |
if (index >= 0) |
| 132 |
{ |
| 133 |
keysym_t *key = keymap [index]; |
| 134 |
|
| 135 |
if (key->type != keysym_t::BUILTIN) |
| 136 |
{ |
| 137 |
wchar_t *ws = rxvt_utf8towcs (key->str); |
| 138 |
char *str = rxvt_wcstombs (ws); |
| 139 |
// TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) |
| 140 |
free (ws); |
| 141 |
|
| 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 (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 (str, strlen (str)); |
| 155 |
|
| 156 |
free (str); |
| 157 |
|
| 158 |
return true; |
| 159 |
} |
| 160 |
} |
| 161 |
|
| 162 |
return false; |
| 163 |
} |
| 164 |
|
| 165 |
void |
| 166 |
keyboard_manager::register_done () |
| 167 |
{ |
| 168 |
unsigned int i, index, hashkey; |
| 169 |
uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket |
| 170 |
|
| 171 |
memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
| 172 |
|
| 173 |
// determine hash bucket size |
| 174 |
for (i = 0; i < keymap.size (); ++i) |
| 175 |
{ |
| 176 |
hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
| 177 |
++hash_bucket_size [hashkey]; |
| 178 |
} |
| 179 |
|
| 180 |
// now we know the size of each bucket |
| 181 |
// compute the index of each bucket |
| 182 |
for (index = 0, i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
| 183 |
{ |
| 184 |
hash [i] = index; |
| 185 |
index += hash_bucket_size [i]; |
| 186 |
} |
| 187 |
|
| 188 |
// and allocate just enough space |
| 189 |
simplevec <keysym_t *> sorted_keymap (index, 0); |
| 190 |
|
| 191 |
memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); |
| 192 |
|
| 193 |
// fill in sorted_keymap |
| 194 |
// it is sorted in each bucket |
| 195 |
for (i = 0; i < keymap.size (); ++i) |
| 196 |
{ |
| 197 |
hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; |
| 198 |
|
| 199 |
index = hash [hashkey] + hash_bucket_size [hashkey]; |
| 200 |
|
| 201 |
while (index > hash [hashkey] |
| 202 |
&& compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) |
| 203 |
{ |
| 204 |
sorted_keymap [index] = sorted_keymap [index - 1]; |
| 205 |
--index; |
| 206 |
} |
| 207 |
|
| 208 |
sorted_keymap [index] = keymap [i]; |
| 209 |
++hash_bucket_size [hashkey]; |
| 210 |
} |
| 211 |
|
| 212 |
keymap.swap (sorted_keymap); |
| 213 |
|
| 214 |
#ifndef NDEBUG |
| 215 |
// check for invariants |
| 216 |
for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) |
| 217 |
{ |
| 218 |
index = hash[i]; |
| 219 |
for (int j = 0; j < hash_bucket_size [i]; ++j) |
| 220 |
{ |
| 221 |
assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); |
| 222 |
|
| 223 |
if (j) |
| 224 |
assert (compare_priority (keymap [index + j - 1], |
| 225 |
keymap [index + j]) >= 0); |
| 226 |
} |
| 227 |
} |
| 228 |
|
| 229 |
// this should be able to detect most possible bugs |
| 230 |
for (i = 0; i < sorted_keymap.size (); ++i) |
| 231 |
{ |
| 232 |
keysym_t *a = sorted_keymap[i]; |
| 233 |
int index = find_keysym (a->keysym, a->state); |
| 234 |
|
| 235 |
assert (index >= 0); |
| 236 |
keysym_t *b = keymap [index]; |
| 237 |
assert (i == index // the normally expected result |
| 238 |
|| a->keysym == b->keysym |
| 239 |
&& compare_priority (a, b) <= 0); // is effectively the same or a closer match |
| 240 |
} |
| 241 |
#endif |
| 242 |
} |
| 243 |
|
| 244 |
int |
| 245 |
keyboard_manager::find_keysym (KeySym keysym, unsigned int state) |
| 246 |
{ |
| 247 |
int hashkey = keysym & KEYSYM_HASH_MASK; |
| 248 |
unsigned int index = hash [hashkey]; |
| 249 |
unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 |
| 250 |
? hash [hashkey + 1] |
| 251 |
: keymap.size (); |
| 252 |
|
| 253 |
for (; index < end; ++index) |
| 254 |
{ |
| 255 |
keysym_t *key = keymap [index]; |
| 256 |
|
| 257 |
if (key->keysym == keysym |
| 258 |
// match only the specified bits in state and ignore others |
| 259 |
&& (key->state & state) == key->state) |
| 260 |
return index; |
| 261 |
} |
| 262 |
|
| 263 |
return -1; |
| 264 |
} |
| 265 |
|
| 266 |
#endif /* KEYSYM_RESOURCE */ |
| 267 |
// vim:et:ts=2:sw=2 |
