--- rxvt-unicode/src/keyboard.C 2005/02/03 10:24:10 1.10 +++ rxvt-unicode/src/keyboard.C 2011/12/03 11:47:19 1.55 @@ -1,3 +1,26 @@ +/*----------------------------------------------------------------------* + * File: keyboard.C + *----------------------------------------------------------------------* + * + * All portions of code are copyright by their respective author/s. + * Copyright (c) 2005 WU Fengguang + * Copyright (c) 2005-2006 Marc Lehmann + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + *----------------------------------------------------------------------*/ + #include "../config.h" #include "rxvt.h" @@ -5,112 +28,67 @@ #include +#include "rxvtperl.h" #include "keyboard.h" #include "command.h" -//////////////////////////////////////////////////////////////////////////////// -// default keycode translation map and keyevent handlers - -keysym_t keyboard_manager::stock_keymap[] = { - /* examples */ - /* keysym, state, range, handler, str */ -//{XK_ISO_Left_Tab, 0, 1, keysym_t::NORMAL, "\033[Z"}, -//{ 'a', 0, 26, keysym_t::RANGE_META8, "a" "%c"}, -//{ 'a', ControlMask, 26, keysym_t::RANGE_META8, "" "%c"}, -//{ XK_Left, 0, 4, keysym_t::LIST, ".\033[.DACB."}, -//{ XK_Left, ShiftMask, 4, keysym_t::LIST, ".\033[.dacb."}, -//{ XK_Left, ControlMask, 4, keysym_t::LIST, ".\033O.dacb."}, -//{ XK_Tab, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_apostrophe, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_slash, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_semicolon, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_grave, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_comma, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_Return, ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ XK_Return, ShiftMask, 1, keysym_t::NORMAL, "\033"}, -//{ ' ', ShiftMask, 1, keysym_t::NORMAL, "\033"}, -//{ '.', ControlMask, 1, keysym_t::NORMAL, "\033"}, -//{ '0', ControlMask, 10, keysym_t::RANGE, "0" "\033"}, -//{ '0', MetaMask|ControlMask, 10, keysym_t::RANGE, "0" "\033"}, -//{ 'a', MetaMask|ControlMask, 26, keysym_t::RANGE, "a" "\033"}, -}; +/* an intro to the data structure: + * + * vector keymap[] is grouped. + * + * inside each group, elements are sorted by the criteria given by compare_priority(). + * the lookup of keysym is done in two steps: + * 1) locate the group corresponds to the keysym; + * 2) do a linear search inside the group. + * + * array hash[] effectively defines a map from a keysym to a group in keymap[]. + * + * each group has its address(the index of first group element in keymap[]), + * which is computed and stored in hash[]. + * hash[] stores the addresses in the form of: + * index: 0 I1 I2 I3 In + * value: 0...0, A1...A1, A2...A2, A3...A3, ..., An...An + * where + * A1 = 0; + * Ai+1 = N1 + N2 + ... + Ni. + * it is computed from hash_bucket_size[]: + * index: 0 I1 I2 I3 In + * value: 0...0, N1, 0...0, N2, 0...0, N3, ..., Nn, 0...0 + * 0...0, 0.......0, N1.....N1, N1+N2...N1+N2, ... (the computation of hash[]) + * or we can say + * hash_bucket_size[Ii] = Ni; hash_bucket_size[elsewhere] = 0, + * where + * set {I1, I2, ..., In} = { hashkey of keymap[0]->keysym, ..., keymap[keymap.size-1]->keysym } + * where hashkey of keymap[i]->keysym = keymap[i]->keysym & KEYSYM_HASH_MASK + * n(the number of groups) = the number of non-zero member of hash_bucket_size[]; + * Ni(the size of group i) = hash_bucket_size[Ii]. + */ static void -output_string (rxvt_term *rt, const char *str) +output_string (rxvt_term *term, const char *str) { if (strncmp (str, "command:", 8) == 0) - rt->cmd_write ((unsigned char *)str + 8, strlen (str) - 8); + term->cmdbuf_append (str + 8, strlen (str) - 8); + else if (strncmp (str, "perl:", 5) == 0) + HOOK_INVOKE((term, HOOK_USER_COMMAND, DT_STR, str + 5, DT_END)); else - rt->tt_write ((unsigned char *)str, strlen (str)); -} - -static void -output_string_meta8 (rxvt_term *rt, unsigned int state, char *buf, int buflen) -{ - if (state & rt->ModMetaMask) - { -#ifdef META8_OPTION - if (rt->meta_char == 0x80) /* set 8-bit on */ - { - for (char *ch = buf; ch < buf + buflen; ch++) - *ch |= 0x80; - } - else if (rt->meta_char == C0_ESC) /* escape prefix */ -#endif - { - const unsigned char ch = C0_ESC; - rt->tt_write (&ch, 1); - } - } - - rt->tt_write ((unsigned char *) buf, buflen); -} - -static int -format_keyrange_string (const char *str, int keysym_offset, char *buf, int bufsize) -{ - size_t len = snprintf (buf, bufsize, str + 1, keysym_offset + str [0]); - - if (len >= (size_t)bufsize) - { - rxvt_warn ("format_keyrange_string: formatting failed, ignoring key.\n"); - *buf = 0; - } - - return len; + term->tt_write (str, strlen (str)); } -//////////////////////////////////////////////////////////////////////////////// -// return: #bits of '1' -#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ > 3) -# define bitcount(n) (__extension__ ({ uint32_t n__ = (n); __builtin_popcount (n); })) -#else -static int -bitcount (uint16_t n) -{ - int i; - - for (i = 0; n; ++i, n &= n - 1) - ; - - return i; -} -#endif - // return: priority_of_a - priority_of_b static int compare_priority (keysym_t *a, keysym_t *b) { // (the more '1's in state; the less range): the greater priority - int ca = bitcount (a->state /* & OtherModMask */); - int cb = bitcount (b->state /* & OtherModMask */); + int ca = ecb_popcount32 (a->state /* & OtherModMask */); + int cb = ecb_popcount32 (b->state /* & OtherModMask */); if (ca != cb) return ca - cb; -//else if (a->state != b->state) // this behavior is to be disscussed +//else if (a->state != b->state) // this behavior is to be discussed // return b->state - a->state; else - return b->range - a->range; + return 0; } //////////////////////////////////////////////////////////////////////////////// @@ -122,83 +100,31 @@ keyboard_manager::~keyboard_manager () { - clear (); -} - -void -keyboard_manager::clear () -{ - keymap.clear (); - hash [0] = 2; - - for (unsigned int i = 0; i < user_translations.size (); ++i) - { - free ((void *)user_translations [i]); - user_translations [i] = 0; - } - - for (unsigned int i = 0; i < user_keymap.size (); ++i) + for (unsigned int i = 0; i < keymap.size (); ++i) { - delete user_keymap [i]; - user_keymap [i] = 0; + free (keymap [i]->str); + delete keymap [i]; } - - user_keymap.clear (); - user_translations.clear (); } -// a wrapper for register_keymap, -// so that outside codes don't have to know so much details. -// -// the string 'trans' is copied to an internal managed buffer, -// so the caller can free memory of 'trans' at any time. void -keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const char *trans) +keyboard_manager::register_user_translation (KeySym keysym, unsigned int state, const wchar_t *ws) { + char *translation = rxvt_wcstoutf8 (ws); + keysym_t *key = new keysym_t; - wchar_t *wc = rxvt_mbstowcs (trans); - const char *translation = rxvt_wcstoutf8 (wc); - free (wc); - if (key && translation) - { - key->keysym = keysym; - key->state = state; - key->range = 1; - key->str = translation; - key->type = keysym_t::NORMAL; + if (!key) + rxvt_fatal ("memory allocation failure. aborting.\n"); - if (strncmp (translation, "list", 4) == 0 && translation [4]) - { - char *middle = strchr (translation + 5, translation [4]); - char *suffix = strrchr (translation + 5, translation [4]); - - if (suffix && middle && suffix > middle + 1) - { - key->type = keysym_t::LIST; - key->range = suffix - middle - 1; - - strcpy (translation, translation + 4); - } - else - rxvt_warn ("cannot parse list-type keysym '%s', treating as normal keysym.\n", translation); - } + key->keysym = keysym; + key->state = state; + key->str = translation; + key->type = keysym_t::STRING; - user_keymap.push_back (key); - user_translations.push_back (translation); - register_keymap (key); - } - else - { - delete key; - free ((void *)translation); - rxvt_fatal ("out of memory, aborting.\n"); - } -} + if (strncmp (translation, "builtin:", 8) == 0) + key->type = keysym_t::BUILTIN; -void -keyboard_manager::register_keymap (keysym_t *key) -{ if (keymap.size () == keymap.capacity ()) keymap.reserve (keymap.size () * 2); @@ -206,24 +132,12 @@ hash[0] = 3; } -void -keyboard_manager::register_done () -{ - unsigned int i, n = sizeof (stock_keymap) / sizeof (keysym_t); - - if (keymap.back () != &stock_keymap[n - 1]) - for (i = 0; i < n; ++i) - register_keymap (&stock_keymap[i]); - - purge_duplicate_keymap (); - - setup_hash (); -} - bool keyboard_manager::dispatch (rxvt_term *term, KeySym keysym, unsigned int state) { - assert (hash[0] == 0 && "register_done() need to be called"); + assert (("register_done() need to be called", hash[0] == 0)); + + state &= OtherModMask; // mask out uninteresting modifiers if (state & term->ModMetaMask) state |= MetaMask; if (state & term->ModNumLockMask) state |= NumLockMask; @@ -236,176 +150,85 @@ if (index >= 0) { - const keysym_t &key = *keymap [index]; - - int keysym_offset = keysym - key.keysym; - - wchar_t *wc = rxvt_utf8towcs (key.str); - - char *str = rxvt_wcstombs (wc); - // TODO: do translations, unescaping etc, here (allow \u escape etc.) - free (wc); + keysym_t *key = keymap [index]; - switch (key.type) + if (key->type != keysym_t::BUILTIN) { - case keysym_t::NORMAL: - output_string (term, str); - break; - - case keysym_t::RANGE: - { - char buf[STRING_MAX]; - - if (format_keyrange_string (str, keysym_offset, buf, sizeof (buf)) > 0) - output_string (term, buf); - } - break; - - case keysym_t::RANGE_META8: - { - int len; - char buf[STRING_MAX]; - - len = format_keyrange_string (str, keysym_offset, buf, sizeof (buf)); - if (len > 0) - output_string_meta8 (term, state, buf, len); - } - break; - - case keysym_t::LIST: - { - char buf[STRING_MAX]; - - char *prefix, *middle, *suffix; - - prefix = str; - middle = strchr (prefix + 1, *prefix); - suffix = strrchr (middle + 1, *prefix); - - memcpy (buf, prefix + 1, middle - prefix - 1); - buf [middle - prefix - 1] = middle [keysym_offset + 1]; - strcpy (buf + (middle - prefix), suffix + 1); - - output_string (term, buf); - } - break; - } + wchar_t *ws = rxvt_utf8towcs (key->str); + char *str = rxvt_wcstombs (ws); + // TODO: do (some) translations, unescaping etc, here (allow \u escape etc.) + free (ws); - free (str); + output_string (term, str); - return true; - } - else - { - // fprintf(stderr,"[%x:%x]",state,keysym); - return false; - } -} + free (str); -// purge duplicate keymap entries -void keyboard_manager::purge_duplicate_keymap () -{ - for (unsigned int i = 0; i < keymap.size (); ++i) - { - for (unsigned int j = 0; j < i; ++j) - { - if (keymap [i] == keymap [j]) - { - while (keymap [i] == keymap.back ()) - keymap.pop_back (); - - if (i < keymap.size ()) - { - keymap[i] = keymap.back (); - keymap.pop_back (); - } - break; - } + return true; } } + + return false; } void -keyboard_manager::setup_hash () +keyboard_manager::register_done () { unsigned int i, index, hashkey; vector sorted_keymap; - uint16_t hash_budget_size[KEYSYM_HASH_BUDGETS]; // size of each budget - uint16_t hash_budget_counter[KEYSYM_HASH_BUDGETS]; // #elements in each budget + uint16_t hash_bucket_size[KEYSYM_HASH_BUCKETS]; // size of each bucket - memset (hash_budget_size, 0, sizeof (hash_budget_size)); - memset (hash_budget_counter, 0, sizeof (hash_budget_counter)); + memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); - // count keysyms for corresponding hash budgets + // determine hash bucket size for (i = 0; i < keymap.size (); ++i) { hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; - ++hash_budget_size [hashkey]; - } - - // a keysym_t with range>1 is counted one more time for every keysym that - // lies in its range - for (i = 0; i < keymap.size (); ++i) - { - if (keymap[i]->range > 1) - { - for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j > 0; --j) - { - hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); - if (hash_budget_size [hashkey]) - ++hash_budget_size [hashkey]; - } - } + ++hash_bucket_size [hashkey]; } - // now we know the size of each budget - // compute the index of each budget + // now we know the size of each bucket + // compute the index of each bucket hash [0] = 0; - for (index = 0, i = 1; i < KEYSYM_HASH_BUDGETS; ++i) + for (index = 0, i = 1; i < KEYSYM_HASH_BUCKETS; ++i) { - index += hash_budget_size [i - 1]; - hash[i] = (hash_budget_size [i] ? index : hash [i - 1]); + index += hash_bucket_size [i - 1]; + hash [i] = index; } // and allocate just enough space - sorted_keymap.insert (sorted_keymap.begin (), index + hash_budget_size [i - 1], 0); + sorted_keymap.insert (sorted_keymap.begin (), index + hash_bucket_size [i - 1], 0); + + memset (hash_bucket_size, 0, sizeof (hash_bucket_size)); // fill in sorted_keymap - // it is sorted in each budget + // it is sorted in each bucket for (i = 0; i < keymap.size (); ++i) { - for (int j = min (keymap [i]->range, KEYSYM_HASH_BUDGETS) - 1; j >= 0; --j) - { - hashkey = ((keymap [i]->keysym + j) & KEYSYM_HASH_MASK); + hashkey = keymap [i]->keysym & KEYSYM_HASH_MASK; - if (hash_budget_size [hashkey]) - { - index = hash [hashkey] + hash_budget_counter [hashkey]; - - while (index > hash [hashkey] - && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) - { - sorted_keymap [index] = sorted_keymap [index - 1]; - --index; - } - - sorted_keymap [index] = keymap [i]; - ++hash_budget_counter [hashkey]; - } + index = hash [hashkey] + hash_bucket_size [hashkey]; + + while (index > hash [hashkey] + && compare_priority (keymap [i], sorted_keymap [index - 1]) > 0) + { + sorted_keymap [index] = sorted_keymap [index - 1]; + --index; } + + sorted_keymap [index] = keymap [i]; + ++hash_bucket_size [hashkey]; } keymap.swap (sorted_keymap); -#if defined (DEBUG_STRICT) || defined (DEBUG_KEYBOARD) +#ifndef NDEBUG // check for invariants - for (i = 0; i < KEYSYM_HASH_BUDGETS; ++i) + for (i = 0; i < KEYSYM_HASH_BUCKETS; ++i) { index = hash[i]; - for (int j = 0; j < hash_budget_size [i]; ++j) + for (int j = 0; j < hash_bucket_size [i]; ++j) { - if (keymap [index + j]->range == 1) - assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); + assert (i == (keymap [index + j]->keysym & KEYSYM_HASH_MASK)); if (j) assert (compare_priority (keymap [index + j - 1], @@ -417,15 +240,13 @@ for (i = 0; i < sorted_keymap.size (); ++i) { keysym_t *a = sorted_keymap[i]; - for (int j = 0; j < a->range; ++j) - { - int index = find_keysym (a->keysym + j, a->state); + int index = find_keysym (a->keysym, a->state); - assert (index >= 0); - keysym_t *b = keymap [index]; - assert (i == (signed) index || // the normally expected result - (a->keysym + j) >= b->keysym && (a->keysym + j) <= (b->keysym + b->range) && compare_priority (a, b) <= 0); // is effectively the same or a closer match - } + assert (index >= 0); + keysym_t *b = keymap [index]; + assert (i == index // the normally expected result + || a->keysym == b->keysym + && compare_priority (a, b) <= 0); // is effectively the same or a closer match } #endif } @@ -435,17 +256,18 @@ { int hashkey = keysym & KEYSYM_HASH_MASK; unsigned int index = hash [hashkey]; + unsigned int end = hashkey < KEYSYM_HASH_BUCKETS - 1 + ? hash [hashkey + 1] + : keymap.size (); - for (; index < keymap.size (); ++index) + for (; index < end; ++index) { keysym_t *key = keymap [index]; - if (key->keysym <= keysym && key->keysym + key->range > keysym + if (key->keysym == keysym // match only the specified bits in state and ignore others && (key->state & state) == key->state) return index; - else if ((key->keysym & KEYSYM_HASH_MASK) > hashkey && key->range == 1) - return -1; } return -1;