1 /* gtkkeyhash.c: Keymap aware matching of key bindings
3 * GTK - The GIMP Toolkit
4 * Copyright (C) 2002, Red Hat Inc.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the
18 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 * Boston, MA 02111-1307, USA.
23 #include "gtkkeyhash.h"
26 typedef struct _GtkKeyHashEntry GtkKeyHashEntry;
28 struct _GtkKeyHashEntry
31 GdkModifierType modifiers;
34 /* Set as a side effect of generating key_hash->keycode_hash
43 GHashTable *keycode_hash;
44 GHashTable *reverse_hash;
46 GDestroyNotify destroy_notify;
50 key_hash_clear_keycode (gpointer key,
59 key_hash_insert_entry (GtkKeyHash *key_hash,
60 GtkKeyHashEntry *entry)
65 gdk_keymap_get_entries_for_keyval (key_hash->keymap,
67 &entry->keys, &entry->n_keys);
69 for (i = 0; i < entry->n_keys; i++)
71 GSList *old_keys = g_hash_table_lookup (key_hash->keycode_hash,
72 GUINT_TO_POINTER (entry->keys[i].keycode));
73 old_keys = g_slist_prepend (old_keys, entry);
74 g_hash_table_insert (key_hash->keycode_hash,
75 GUINT_TO_POINTER (entry->keys[i].keycode),
81 key_hash_get_keycode_hash (GtkKeyHash *key_hash)
83 if (!key_hash->keycode_hash)
87 key_hash->keycode_hash = g_hash_table_new (g_direct_hash, NULL);
89 /* Preserve the original insertion order
91 for (tmp_list = g_list_last (key_hash->entries_list);
93 tmp_list = tmp_list->prev)
94 key_hash_insert_entry (key_hash, tmp_list->data);
97 return key_hash->keycode_hash;
101 key_hash_keys_changed (GdkKeymap *keymap,
102 GtkKeyHash *key_hash)
104 /* The keymap changed, so we have to regenerate the keycode hash
106 if (key_hash->keycode_hash)
108 g_hash_table_foreach (key_hash->keycode_hash, key_hash_clear_keycode, NULL);
109 g_hash_table_destroy (key_hash->keycode_hash);
110 key_hash->keycode_hash = NULL;
116 * @keymap: a #GdkKeymap
117 * @item_destroy_notify: function to be called when items are removed
118 * from the hash or %NULL.
120 * Create a new key hash object for doing binding resolution.
122 * Return value: the newly created object. Free with _gtk_key_hash_free().
125 _gtk_key_hash_new (GdkKeymap *keymap,
126 GDestroyNotify item_destroy_notify)
128 GtkKeyHash *key_hash = g_new (GtkKeyHash, 1);
130 key_hash->keymap = keymap;
131 g_signal_connect (keymap, "keys-changed",
132 G_CALLBACK (key_hash_keys_changed), key_hash);
134 key_hash->entries_list = NULL;
135 key_hash->keycode_hash = NULL;
136 key_hash->reverse_hash = g_hash_table_new (g_direct_hash, NULL);
137 key_hash->destroy_notify = item_destroy_notify;
143 key_hash_free_entry (GtkKeyHash *key_hash,
144 GtkKeyHashEntry *entry)
146 if (key_hash->destroy_notify)
147 (*key_hash->destroy_notify) (entry->value);
149 g_free (entry->keys);
150 g_slice_free (GtkKeyHashEntry, entry);
154 key_hash_free_entry_foreach (gpointer value,
157 GtkKeyHashEntry *entry = value;
158 GtkKeyHash *key_hash = data;
160 key_hash_free_entry (key_hash, entry);
165 * @key_hash: a #GtkKeyHash
167 * Destroys a key hash created with gtk_key_hash_new()
170 _gtk_key_hash_free (GtkKeyHash *key_hash)
172 g_signal_handlers_disconnect_by_func (key_hash->keymap,
173 key_hash_keys_changed,
176 if (key_hash->keycode_hash)
178 g_hash_table_foreach (key_hash->keycode_hash, key_hash_clear_keycode, NULL);
179 g_hash_table_destroy (key_hash->keycode_hash);
182 g_hash_table_destroy (key_hash->reverse_hash);
184 g_list_foreach (key_hash->entries_list, key_hash_free_entry_foreach, key_hash);
185 g_list_free (key_hash->entries_list);
191 * _gtk_key_hash_add_entry:
192 * @key_hash: a #GtkKeyHash
193 * @keyval: key symbol for this binding
194 * @modifiers: modifiers for this binding
195 * @value: value to insert in the key hash
197 * Inserts a pair of key symbol and modifier mask into the key hash.
200 _gtk_key_hash_add_entry (GtkKeyHash *key_hash,
202 GdkModifierType modifiers,
205 GtkKeyHashEntry *entry = g_slice_new (GtkKeyHashEntry);
207 entry->value = value;
208 entry->keyval = keyval;
209 entry->modifiers = modifiers;
212 key_hash->entries_list = g_list_prepend (key_hash->entries_list, entry);
213 g_hash_table_insert (key_hash->reverse_hash, value, key_hash->entries_list);
215 if (key_hash->keycode_hash)
216 key_hash_insert_entry (key_hash, entry);
220 * _gtk_key_hash_remove_entry:
221 * @key_hash: a #GtkKeyHash
222 * @value: value previously added with _gtk_key_hash_add_entry()
224 * Removes a value previously added to the key hash with
225 * _gtk_key_hash_add_entry().
228 _gtk_key_hash_remove_entry (GtkKeyHash *key_hash,
231 GList *entry_node = g_hash_table_lookup (key_hash->reverse_hash, value);
235 GtkKeyHashEntry *entry = entry_node->data;
237 if (key_hash->keycode_hash)
241 for (i = 0; i < entry->n_keys; i++)
243 GSList *old_keys = g_hash_table_lookup (key_hash->keycode_hash,
244 GUINT_TO_POINTER (entry->keys[i].keycode));
246 GSList *new_keys = g_slist_remove (old_keys, entry);
247 if (new_keys != old_keys)
250 g_hash_table_insert (key_hash->keycode_hash,
251 GUINT_TO_POINTER (entry->keys[i].keycode),
254 g_hash_table_remove (key_hash->keycode_hash,
255 GUINT_TO_POINTER (entry->keys[i].keycode));
260 g_hash_table_remove (key_hash->reverse_hash, entry_node);
261 key_hash->entries_list = g_list_delete_link (key_hash->entries_list, entry_node);
263 key_hash_free_entry (key_hash, entry);
268 lookup_result_compare (gconstpointer a,
271 const GtkKeyHashEntry *entry_a = a;
272 const GtkKeyHashEntry *entry_b = b;
278 modifiers = entry_a->modifiers;
286 modifiers = entry_b->modifiers;
294 return n_bits_a < n_bits_b ? -1 : (n_bits_a == n_bits_b ? 0 : 1);
298 /* Sort a list of results so that matches with less modifiers come
299 * before matches with more modifiers
302 sort_lookup_results (GSList *slist)
304 return g_slist_sort (slist, lookup_result_compare);
308 lookup_result_compare_by_keyval (gconstpointer a,
311 const GtkKeyHashEntry *entry_a = a;
312 const GtkKeyHashEntry *entry_b = b;
314 if (entry_a->keyval < entry_b->keyval)
316 else if (entry_a->keyval > entry_b->keyval)
323 sort_lookup_results_by_keyval (GSList *slist)
325 return g_slist_sort (slist, lookup_result_compare_by_keyval);
328 /* Return true if keyval is defined in keyboard group
331 keyval_in_group (GdkKeymap *keymap,
335 GtkKeyHashEntry entry;
338 gdk_keymap_get_entries_for_keyval (keymap,
340 &entry.keys, &entry.n_keys);
342 for (i = 0; i < entry.n_keys; i++)
344 if (entry.keys[i].group == group)
356 * _gtk_key_hash_lookup:
357 * @key_hash: a #GtkKeyHash
358 * @hardware_keycode: hardware keycode field from a #GdkEventKey
359 * @state: state field from a #GdkEventKey
360 * @mask: mask of modifiers to consider when matching against the
361 * modifiers in entries.
362 * @group: group field from a #GdkEventKey
364 * Looks up the best matching entry or entries in the hash table for
365 * a given event. The results are sorted so that entries with less
366 * modifiers come before entries with more modifiers.
368 * The matches returned by this function can be exact (i.e. keycode, level
369 * and group all match) or fuzzy (i.e. keycode and level match, but group
370 * does not). As long there are any exact matches, only exact matches
371 * are returned. If there are no exact matches, fuzzy matches will be
372 * returned, as long as they are not shadowing a possible exact match.
373 * This means that fuzzy matches won't be considered if their keyval is
374 * present in the current group.
376 * Return value: A #GSList of matching entries.
379 _gtk_key_hash_lookup (GtkKeyHash *key_hash,
380 guint16 hardware_keycode,
381 GdkModifierType state,
382 GdkModifierType mask,
385 GHashTable *keycode_hash = key_hash_get_keycode_hash (key_hash);
386 GSList *keys = g_hash_table_lookup (keycode_hash, GUINT_TO_POINTER ((guint)hardware_keycode));
387 GSList *results = NULL;
389 gboolean have_exact = FALSE;
391 gint effective_group;
393 GdkModifierType modifiers;
394 GdkModifierType consumed_modifiers;
395 const GdkModifierType xmods = GDK_MOD2_MASK|GDK_MOD3_MASK|GDK_MOD4_MASK|GDK_MOD5_MASK;
396 const GdkModifierType vmods = GDK_SUPER_MASK|GDK_HYPER_MASK|GDK_META_MASK;
398 /* We don't want Caps_Lock to affect keybinding lookups.
400 state &= ~GDK_LOCK_MASK;
402 gdk_keymap_map_virtual_modifiers (key_hash->keymap, &mask);
404 gdk_keymap_translate_keyboard_state (key_hash->keymap,
405 hardware_keycode, state, group,
406 &keyval, &effective_group, &level, &consumed_modifiers);
408 GTK_NOTE (KEYBINDINGS,
409 g_message ("Looking up keycode = %u, modifiers = 0x%04x,\n"
410 " keyval = %u, group = %d, level = %d, consumed_modifiers = 0x%04x",
411 hardware_keycode, state, keyval, effective_group, level, consumed_modifiers));
415 GSList *tmp_list = keys;
418 GtkKeyHashEntry *entry = tmp_list->data;
420 /* If the virtual Super, Hyper or Meta modifiers are present,
421 * they will also be mapped to some of the Mod2 - Mod5 modifiers,
422 * so we compare them twice, ignoring either set.
423 * We accept combinations involving virtual modifiers only if they
424 * are mapped to separate modifiers; i.e. if Super and Hyper are
425 * both mapped to Mod4, then pressing a key that is mapped to Mod4
426 * will not match a Super+Hyper entry.
428 modifiers = entry->modifiers;
429 if (gdk_keymap_map_virtual_modifiers (key_hash->keymap, &modifiers) &&
430 ((modifiers & ~consumed_modifiers & mask & ~vmods) == (state & ~consumed_modifiers & mask & ~vmods) ||
431 (modifiers & ~consumed_modifiers & mask & ~xmods) == (state & ~consumed_modifiers & mask & ~xmods)))
435 if (keyval == entry->keyval) /* Exact match */
437 GTK_NOTE (KEYBINDINGS,
438 g_message (" found exact match, keyval = %u, modifiers = 0x%04x",
439 entry->keyval, entry->modifiers));
443 g_slist_free (results);
448 results = g_slist_prepend (results, entry);
453 for (i = 0; i < entry->n_keys; i++)
455 if (entry->keys[i].keycode == hardware_keycode &&
456 entry->keys[i].level == level) /* Match for all but group */
458 GTK_NOTE (KEYBINDINGS,
459 g_message (" found group = %d, level = %d",
460 entry->keys[i].group, entry->keys[i].level));
461 results = g_slist_prepend (results, entry);
468 tmp_list = tmp_list->next;
472 if (!have_exact && results)
474 /* If there are fuzzy matches, check that the current group doesn't also
475 * define these keyvals; if yes, discard results because a widget up in
476 * the stack may have an exact match and we don't want to 'steal' it.
479 GtkKeyHashEntry *keyhashentry;
481 results = sort_lookup_results_by_keyval (results);
482 for (l = results; l; l = l->next)
484 keyhashentry = l->data;
485 if (l == results || oldkeyval != keyhashentry->keyval)
487 oldkeyval = keyhashentry->keyval;
488 if (keyval_in_group (key_hash->keymap, oldkeyval, group))
490 g_slist_free (results);
497 results = sort_lookup_results (results);
498 for (l = results; l; l = l->next)
499 l->data = ((GtkKeyHashEntry *)l->data)->value;
505 * _gtk_key_hash_lookup_keyval:
506 * @key_hash: a #GtkKeyHash
507 * @event: a #GtkEvent
509 * Looks up the best matching entry or entries in the hash table for a
510 * given keyval/modifiers pair. It's better to use
511 * _gtk_key_hash_lookup() if you have the original #GdkEventKey
512 * available. The results are sorted so that entries with less
513 * modifiers come before entries with more modifiers.
515 * Return value: A #GSList of all matching entries.
518 _gtk_key_hash_lookup_keyval (GtkKeyHash *key_hash,
520 GdkModifierType modifiers)
524 GSList *results = NULL;
527 if (!keyval) /* Key without symbol */
530 /* Find some random keycode for this keyval
532 gdk_keymap_get_entries_for_keyval (key_hash->keymap, keyval,
537 GHashTable *keycode_hash = key_hash_get_keycode_hash (key_hash);
538 GSList *entries = g_hash_table_lookup (keycode_hash, GUINT_TO_POINTER (keys[0].keycode));
542 GtkKeyHashEntry *entry = entries->data;
544 if (entry->keyval == keyval && entry->modifiers == modifiers)
545 results = g_slist_prepend (results, entry);
547 entries = entries->next;
553 results = sort_lookup_results (results);
554 for (l = results; l; l = l->next)
555 l->data = ((GtkKeyHashEntry *)l->data)->value;