|
0
|
1 /* Manipulation of keymaps
|
|
|
2 Copyright (C) 1985, 1991-1995 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995 Board of Trustees, University of Illinois.
|
|
|
4 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
|
5 Totally redesigned by jwz in 1991.
|
|
|
6
|
|
|
7 This file is part of XEmacs.
|
|
|
8
|
|
|
9 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
10 under the terms of the GNU General Public License as published by the
|
|
|
11 Free Software Foundation; either version 2, or (at your option) any
|
|
|
12 later version.
|
|
|
13
|
|
|
14 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
15 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
17 for more details.
|
|
|
18
|
|
|
19 You should have received a copy of the GNU General Public License
|
|
|
20 along with XEmacs; see the file COPYING. If not, write to
|
|
|
21 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
22 Boston, MA 02111-1307, USA. */
|
|
|
23
|
|
70
|
24 /* Synched up with: Mule 2.0. Not synched with FSF. Substantially
|
|
|
25 different from FSF. */
|
|
|
26
|
|
0
|
27
|
|
|
28 #include <config.h>
|
|
|
29 #include "lisp.h"
|
|
|
30
|
|
|
31 #include "buffer.h"
|
|
|
32 #include "bytecode.h"
|
|
|
33 #include "commands.h"
|
|
|
34 #include "console.h"
|
|
|
35 #include "elhash.h"
|
|
|
36 #include "events.h"
|
|
|
37 #include "frame.h"
|
|
|
38 #include "insdel.h"
|
|
|
39 #include "keymap.h"
|
|
|
40 #include "window.h"
|
|
|
41
|
|
100
|
42 #ifdef WINDOWSNT
|
|
|
43 /* Hmm, under unix we want X modifiers, under NT we want X modifiers if
|
|
|
44 we are running X and Windows modifiers otherwise.
|
|
|
45 gak. This is a kludge until we support multiple native GUIs!
|
|
|
46 */
|
|
|
47 #undef MOD_ALT
|
|
|
48 #undef MOD_CONTROL
|
|
|
49 #undef MOD_SHIFT
|
|
|
50 #endif
|
|
|
51
|
|
157
|
52 #include "events-mod.h"
|
|
100
|
53
|
|
0
|
54
|
|
245
|
55 /* A keymap contains six slots:
|
|
0
|
56
|
|
|
57 parents Ordered list of keymaps to search after
|
|
|
58 this one if no match is found.
|
|
|
59 Keymaps can thus be arranged in a hierarchy.
|
|
|
60
|
|
|
61 table A hash table, hashing keysyms to their bindings.
|
|
70
|
62 It will be one of the following:
|
|
|
63
|
|
|
64 -- a symbol, e.g. 'home
|
|
|
65 -- a character, representing something printable
|
|
|
66 (not ?\C-c meaning C-c, for instance)
|
|
|
67 -- an integer representing a modifier combination
|
|
0
|
68
|
|
|
69 inverse_table A hash table, hashing bindings to the list of keysyms
|
|
|
70 in this keymap which are bound to them. This is to make
|
|
|
71 the Fwhere_is_internal() function be fast. It needs to be
|
|
|
72 fast because we want to be able to call it in realtime to
|
|
|
73 update the keyboard-equivalents on the pulldown menus.
|
|
|
74 Values of the table are either atoms (keysyms)
|
|
|
75 or a dotted list of keysyms.
|
|
|
76
|
|
|
77 sub_maps_cache An alist; for each entry in this keymap whose binding is
|
|
|
78 a keymap (that is, Fkeymapp()) this alist associates that
|
|
|
79 keysym with that binding. This is used to optimize both
|
|
|
80 Fwhere_is_internal() and Faccessible_keymaps(). This slot
|
|
|
81 gets set to the symbol `t' every time a change is made to
|
|
|
82 this keymap, causing it to be recomputed when next needed.
|
|
|
83
|
|
|
84 prompt See `set-keymap-prompt'.
|
|
|
85
|
|
|
86 default_binding See `set-keymap-default-binding'.
|
|
|
87
|
|
|
88 Sequences of keys are stored in the obvious way: if the sequence of keys
|
|
|
89 "abc" was bound to some command `foo', the hierarchy would look like
|
|
|
90
|
|
|
91 keymap-1: associates "a" with keymap-2
|
|
|
92 keymap-2: associates "b" with keymap-3
|
|
|
93 keymap-3: associates "c" with foo
|
|
|
94
|
|
|
95 However, bucky bits ("modifiers" to the X-minded) are represented in the
|
|
|
96 keymap hierarchy as well. (This lets us use EQable objects as hash keys.)
|
|
|
97 Each combination of modifiers (e.g. control-hyper) gets its own submap
|
|
|
98 off of the main map. The hash key for a modifier combination is
|
|
70
|
99 an integer, computed by MAKE_MODIFIER_HASH_KEY().
|
|
185
|
100
|
|
0
|
101 If the key `C-a' was bound to some command, the hierarchy would look like
|
|
|
102
|
|
70
|
103 keymap-1: associates the integer MOD_CONTROL with keymap-2
|
|
0
|
104 keymap-2: associates "a" with the command
|
|
|
105
|
|
|
106 Similarly, if the key `C-H-a' was bound to some command, the hierarchy
|
|
|
107 would look like
|
|
|
108
|
|
70
|
109 keymap-1: associates the integer (MOD_CONTROL | MOD_HYPER)
|
|
0
|
110 with keymap-2
|
|
|
111 keymap-2: associates "a" with the command
|
|
|
112
|
|
|
113 Note that a special exception is made for the meta modifier, in order
|
|
|
114 to deal with ESC/meta lossage. Any key combination containing the
|
|
|
115 meta modifier is first indexed off of the main map into the meta
|
|
70
|
116 submap (with hash key MOD_META) and then indexed off of the
|
|
0
|
117 meta submap with the meta modifier removed from the key combination.
|
|
|
118 For example, when associating a command with C-M-H-a, we'd have
|
|
|
119
|
|
70
|
120 keymap-1: associates the integer MOD_META with keymap-2
|
|
|
121 keymap-2: associates the integer (MOD_CONTROL | MOD_HYPER)
|
|
0
|
122 with keymap-3
|
|
|
123 keymap-3: associates "a" with the command
|
|
|
124
|
|
|
125 Note that keymap-2 might have normal bindings in it; these would be
|
|
|
126 for key combinations containing only the meta modifier, such as
|
|
|
127 M-y or meta-backspace.
|
|
|
128
|
|
|
129 If the command that "a" was bound to in keymap-3 was itself a keymap,
|
|
|
130 then that would make the key "C-M-H-a" be a prefix character.
|
|
|
131
|
|
|
132 Note that this new model of keymaps takes much of the magic away from
|
|
|
133 the Escape key: the value of the variable `esc-map' is no longer indexed
|
|
|
134 in the `global-map' under the ESC key. It's indexed under the integer
|
|
70
|
135 MOD_META. This is not user-visible, however; none of the "bucky"
|
|
0
|
136 maps are.
|
|
|
137
|
|
|
138 There is a hack in Flookup_key() that makes (lookup-key global-map "\^[")
|
|
|
139 and (define-key some-random-map "\^[" my-esc-map) work as before, for
|
|
|
140 compatibility.
|
|
|
141
|
|
|
142 Since keymaps are opaque, the only way to extract information from them
|
|
|
143 is with the functions lookup-key, key-binding, local-key-binding, and
|
|
|
144 global-key-binding, which work just as before, and the new function
|
|
185
|
145 map-keymap, which is roughly analagous to maphash.
|
|
0
|
146
|
|
|
147 Note that map-keymap perpetuates the illusion that the "bucky" submaps
|
|
|
148 don't exist: if you map over a keymap with bucky submaps, it will also
|
|
|
149 map over those submaps. It does not, however, map over other random
|
|
|
150 submaps of the keymap, just the bucky ones.
|
|
|
151
|
|
|
152 One implication of this is that when you map over `global-map', you will
|
|
|
153 also map over `esc-map'. It is merely for compatibility that the esc-map
|
|
|
154 is accessible at all; I think that's a bad thing, since it blurs the
|
|
|
155 distinction between ESC and "meta" even more. "M-x" is no more a two-
|
|
|
156 key sequence than "C-x" is.
|
|
|
157
|
|
|
158 */
|
|
|
159
|
|
|
160 struct keymap
|
|
|
161 {
|
|
|
162 struct lcrecord_header header;
|
|
|
163 Lisp_Object parents; /* Keymaps to be searched after this one
|
|
|
164 * An ordered list */
|
|
|
165 Lisp_Object prompt; /* Qnil or a string to print in the minibuffer
|
|
|
166 * when reading from this keymap */
|
|
185
|
167
|
|
0
|
168 Lisp_Object table; /* The contents of this keymap */
|
|
|
169 Lisp_Object inverse_table; /* The inverse mapping of the above */
|
|
|
170
|
|
|
171 Lisp_Object default_binding; /* Use this if no other binding is found
|
|
|
172 * (this overrides parent maps and the
|
|
|
173 * normal global-map lookup). */
|
|
|
174
|
|
|
175
|
|
|
176 Lisp_Object sub_maps_cache; /* Cache of directly inferior keymaps;
|
|
|
177 This holds an alist, of the key and the
|
|
|
178 maps, or the modifier bit and the map.
|
|
|
179 If this is the symbol t, then the cache
|
|
|
180 needs to be recomputed.
|
|
|
181 */
|
|
|
182 int fullness; /* How many entries there are in this table.
|
|
|
183 This should be the same as the fullness
|
|
|
184 of the `table', but hash.c is broken. */
|
|
|
185 Lisp_Object name; /* Just for debugging convenience */
|
|
|
186 };
|
|
|
187
|
|
|
188 #define XKEYMAP(x) XRECORD (x, keymap, struct keymap)
|
|
|
189 #define XSETKEYMAP(x, p) XSETRECORD (x, p, keymap)
|
|
|
190 #define KEYMAPP(x) RECORDP (x, keymap)
|
|
|
191 #define CHECK_KEYMAP(x) CHECK_RECORD (x, keymap)
|
|
|
192
|
|
70
|
193 #define MAKE_MODIFIER_HASH_KEY(modifier) make_int (modifier)
|
|
|
194 #define MODIFIER_HASH_KEY_BITS(x) (INTP (x) ? XINT (x) : 0)
|
|
0
|
195
|
|
|
196
|
|
|
197
|
|
|
198 /* Actually allocate storage for these variables */
|
|
|
199
|
|
|
200 static Lisp_Object Vcurrent_global_map; /* Always a keymap */
|
|
|
201
|
|
|
202 static Lisp_Object Vmouse_grabbed_buffer;
|
|
|
203
|
|
|
204 /* Alist of minor mode variables and keymaps. */
|
|
|
205 static Lisp_Object Qminor_mode_map_alist;
|
|
|
206
|
|
|
207 static Lisp_Object Voverriding_local_map;
|
|
|
208
|
|
|
209 static Lisp_Object Vkey_translation_map;
|
|
|
210
|
|
|
211 /* This is incremented whenever a change is made to a keymap. This is
|
|
|
212 so that things which care (such as the menubar code) can recompute
|
|
|
213 privately-cached data when the user has changed keybindings.
|
|
|
214 */
|
|
|
215 int keymap_tick;
|
|
|
216
|
|
|
217 /* Prefixing a key with this character is the same as sending a meta bit. */
|
|
|
218 Lisp_Object Vmeta_prefix_char;
|
|
|
219
|
|
|
220 Lisp_Object Qkeymapp;
|
|
|
221
|
|
|
222 Lisp_Object Vsingle_space_string;
|
|
|
223
|
|
|
224 Lisp_Object Qsuppress_keymap;
|
|
|
225
|
|
|
226 Lisp_Object Qmodeline_map;
|
|
|
227 Lisp_Object Qtoolbar_map;
|
|
|
228
|
|
219
|
229 static void describe_command (Lisp_Object definition, Lisp_Object buffer);
|
|
0
|
230 static void describe_map (Lisp_Object keymap, Lisp_Object elt_prefix,
|
|
219
|
231 void (*elt_describer) (Lisp_Object, Lisp_Object),
|
|
185
|
232 int partial,
|
|
|
233 Lisp_Object shadow,
|
|
219
|
234 int mice_only_p,
|
|
|
235 Lisp_Object buffer);
|
|
0
|
236 Lisp_Object Qcontrol, Qctrl, Qmeta, Qsuper, Qhyper, Qalt, Qshift;
|
|
|
237 /* Lisp_Object Qsymbol; defined in general.c */
|
|
|
238 Lisp_Object Qbutton0, Qbutton1, Qbutton2, Qbutton3, Qbutton4, Qbutton5,
|
|
|
239 Qbutton6, Qbutton7;
|
|
|
240 Lisp_Object Qbutton0up, Qbutton1up, Qbutton2up, Qbutton3up, Qbutton4up,
|
|
|
241 Qbutton5up, Qbutton6up, Qbutton7up;
|
|
249
|
242 #if defined(HAVE_OFFIX_DND) || defined(HAVE_MS_WINDOWS)
|
|
197
|
243 Lisp_Object Qdrop0, Qdrop1, Qdrop2, Qdrop3, Qdrop4, Qdrop5, Qdrop6, Qdrop7;
|
|
|
244 #endif
|
|
0
|
245 Lisp_Object Qmenu_selection;
|
|
98
|
246 /* Emacs compatibility */
|
|
265
|
247 Lisp_Object Qdown_mouse_1, Qdown_mouse_2, Qdown_mouse_3, Qdown_mouse_4,
|
|
|
248 Qdown_mouse_5;
|
|
|
249 Lisp_Object Qmouse_1, Qmouse_2, Qmouse_3, Qmouse_4, Qmouse_5;
|
|
0
|
250
|
|
|
251 /* Kludge kludge kludge */
|
|
|
252 Lisp_Object QLFD, QTAB, QRET, QESC, QDEL, QSPC, QBS;
|
|
|
253
|
|
|
254
|
|
|
255 /************************************************************************/
|
|
|
256 /* The keymap Lisp object */
|
|
|
257 /************************************************************************/
|
|
|
258
|
|
|
259 static Lisp_Object mark_keymap (Lisp_Object, void (*) (Lisp_Object));
|
|
|
260 static void print_keymap (Lisp_Object, Lisp_Object, int);
|
|
|
261 /* No need for keymap_equal #### Why not? */
|
|
|
262 DEFINE_LRECORD_IMPLEMENTATION ("keymap", keymap,
|
|
|
263 mark_keymap, print_keymap, 0, 0, 0,
|
|
|
264 struct keymap);
|
|
|
265 static Lisp_Object
|
|
|
266 mark_keymap (Lisp_Object obj, void (*markobj) (Lisp_Object))
|
|
|
267 {
|
|
|
268 struct keymap *keymap = XKEYMAP (obj);
|
|
|
269 ((markobj) (keymap->parents));
|
|
|
270 ((markobj) (keymap->prompt));
|
|
|
271 ((markobj) (keymap->inverse_table));
|
|
|
272 ((markobj) (keymap->sub_maps_cache));
|
|
|
273 ((markobj) (keymap->default_binding));
|
|
|
274 ((markobj) (keymap->name));
|
|
173
|
275 return keymap->table;
|
|
0
|
276 }
|
|
185
|
277
|
|
0
|
278 static void
|
|
|
279 print_keymap (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
280 {
|
|
|
281 /* This function can GC */
|
|
|
282 struct keymap *keymap = XKEYMAP (obj);
|
|
|
283 char buf[200];
|
|
|
284 int size = XINT (Fkeymap_fullness (obj));
|
|
|
285 if (print_readably)
|
|
|
286 error ("printing unreadable object #<keymap 0x%x>", keymap->header.uid);
|
|
|
287 write_c_string ("#<keymap ", printcharfun);
|
|
|
288 if (!NILP (keymap->name))
|
|
|
289 print_internal (keymap->name, printcharfun, 1);
|
|
267
|
290 /* #### Yuck! This is no way to form plural! --hniksic */
|
|
0
|
291 sprintf (buf, "%s%d entr%s 0x%x>",
|
|
|
292 ((NILP (keymap->name)) ? "" : " "),
|
|
|
293 size,
|
|
|
294 ((size == 1) ? "y" : "ies"),
|
|
|
295 keymap->header.uid);
|
|
|
296 write_c_string (buf, printcharfun);
|
|
|
297 }
|
|
|
298
|
|
|
299
|
|
|
300 /************************************************************************/
|
|
|
301 /* Traversing keymaps and their parents */
|
|
|
302 /************************************************************************/
|
|
|
303
|
|
|
304 static Lisp_Object
|
|
|
305 traverse_keymaps (Lisp_Object start_keymap, Lisp_Object start_parents,
|
|
|
306 Lisp_Object (*mapper) (Lisp_Object keymap, void *mapper_arg),
|
|
|
307 void *mapper_arg)
|
|
|
308 {
|
|
|
309 /* This function can GC */
|
|
|
310 Lisp_Object keymap;
|
|
|
311 Lisp_Object tail = start_parents;
|
|
|
312 Lisp_Object malloc_sucks[10];
|
|
|
313 Lisp_Object malloc_bites = Qnil;
|
|
|
314 int stack_depth = 0;
|
|
|
315 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
316 GCPRO4 (*malloc_sucks, malloc_bites, start_keymap, tail);
|
|
|
317 gcpro1.nvars = 0;
|
|
|
318
|
|
|
319 start_keymap = get_keymap (start_keymap, 1, 1);
|
|
|
320 keymap = start_keymap;
|
|
|
321 /* Hack special-case parents at top-level */
|
|
|
322 tail = ((!NILP (tail)) ? tail : XKEYMAP (keymap)->parents);
|
|
|
323
|
|
|
324 for (;;)
|
|
|
325 {
|
|
|
326 Lisp_Object result;
|
|
|
327
|
|
|
328 QUIT;
|
|
|
329 result = ((mapper) (keymap, mapper_arg));
|
|
|
330 if (!NILP (result))
|
|
|
331 {
|
|
|
332 while (CONSP (malloc_bites))
|
|
|
333 {
|
|
|
334 struct Lisp_Cons *victim = XCONS (malloc_bites);
|
|
|
335 malloc_bites = victim->cdr;
|
|
|
336 free_cons (victim);
|
|
|
337 }
|
|
|
338 UNGCPRO;
|
|
173
|
339 return result;
|
|
0
|
340 }
|
|
|
341 if (NILP (tail))
|
|
|
342 {
|
|
|
343 if (stack_depth == 0)
|
|
|
344 {
|
|
|
345 UNGCPRO;
|
|
173
|
346 return Qnil; /* Nothing found */
|
|
0
|
347 }
|
|
|
348 stack_depth--;
|
|
|
349 if (CONSP (malloc_bites))
|
|
|
350 {
|
|
|
351 struct Lisp_Cons *victim = XCONS (malloc_bites);
|
|
|
352 tail = victim->car;
|
|
|
353 malloc_bites = victim->cdr;
|
|
|
354 free_cons (victim);
|
|
|
355 }
|
|
|
356 else
|
|
|
357 {
|
|
|
358 tail = malloc_sucks[stack_depth];
|
|
|
359 gcpro1.nvars = stack_depth;
|
|
|
360 }
|
|
|
361 keymap = XCAR (tail);
|
|
|
362 tail = XCDR (tail);
|
|
|
363 }
|
|
|
364 else
|
|
|
365 {
|
|
|
366 Lisp_Object parents;
|
|
|
367
|
|
|
368 keymap = XCAR (tail);
|
|
|
369 tail = XCDR (tail);
|
|
|
370 parents = XKEYMAP (keymap)->parents;
|
|
|
371 if (!CONSP (parents))
|
|
|
372 ;
|
|
|
373 else if (NILP (tail))
|
|
|
374 /* Tail-recurse */
|
|
|
375 tail = parents;
|
|
|
376 else
|
|
|
377 {
|
|
|
378 if (CONSP (malloc_bites))
|
|
|
379 malloc_bites = noseeum_cons (tail, malloc_bites);
|
|
|
380 else if (stack_depth < countof (malloc_sucks))
|
|
|
381 {
|
|
|
382 malloc_sucks[stack_depth++] = tail;
|
|
|
383 gcpro1.nvars = stack_depth;
|
|
|
384 }
|
|
|
385 else
|
|
|
386 {
|
|
|
387 /* *&@##[*&^$ C. @#[$*&@# Unix. Losers all. */
|
|
|
388 int i;
|
|
|
389 for (i = 0, malloc_bites = Qnil;
|
|
|
390 i < countof (malloc_sucks);
|
|
|
391 i++)
|
|
|
392 malloc_bites = noseeum_cons (malloc_sucks[i],
|
|
|
393 malloc_bites);
|
|
|
394 gcpro1.nvars = 0;
|
|
|
395 }
|
|
|
396 tail = parents;
|
|
|
397 }
|
|
|
398 }
|
|
|
399 keymap = get_keymap (keymap, 1, 1);
|
|
|
400 if (EQ (keymap, start_keymap))
|
|
|
401 {
|
|
|
402 signal_simple_error ("Cyclic keymap indirection",
|
|
|
403 start_keymap);
|
|
|
404 }
|
|
|
405 }
|
|
|
406 }
|
|
|
407
|
|
|
408
|
|
|
409 /************************************************************************/
|
|
|
410 /* Some low-level functions */
|
|
|
411 /************************************************************************/
|
|
|
412
|
|
|
413 static unsigned int
|
|
|
414 bucky_sym_to_bucky_bit (Lisp_Object sym)
|
|
|
415 {
|
|
185
|
416 if (EQ (sym, Qcontrol)) return MOD_CONTROL;
|
|
|
417 if (EQ (sym, Qmeta)) return MOD_META;
|
|
|
418 if (EQ (sym, Qsuper)) return MOD_SUPER;
|
|
|
419 if (EQ (sym, Qhyper)) return MOD_HYPER;
|
|
|
420 if (EQ (sym, Qalt)) return MOD_ALT;
|
|
|
421 if (EQ (sym, Qsymbol)) return MOD_ALT; /* #### - reverse compat */
|
|
|
422 if (EQ (sym, Qshift)) return MOD_SHIFT;
|
|
|
423
|
|
|
424 return 0;
|
|
0
|
425 }
|
|
|
426
|
|
|
427 static Lisp_Object
|
|
|
428 control_meta_superify (Lisp_Object frob, unsigned int modifiers)
|
|
|
429 {
|
|
|
430 if (modifiers == 0)
|
|
|
431 return frob;
|
|
|
432 frob = Fcons (frob, Qnil);
|
|
173
|
433 if (modifiers & MOD_SHIFT) frob = Fcons (Qshift, frob);
|
|
|
434 if (modifiers & MOD_ALT) frob = Fcons (Qalt, frob);
|
|
|
435 if (modifiers & MOD_HYPER) frob = Fcons (Qhyper, frob);
|
|
|
436 if (modifiers & MOD_SUPER) frob = Fcons (Qsuper, frob);
|
|
|
437 if (modifiers & MOD_CONTROL) frob = Fcons (Qcontrol, frob);
|
|
|
438 if (modifiers & MOD_META) frob = Fcons (Qmeta, frob);
|
|
|
439 return frob;
|
|
0
|
440 }
|
|
|
441
|
|
|
442 static Lisp_Object
|
|
|
443 make_key_description (CONST struct key_data *key, int prettify)
|
|
|
444 {
|
|
|
445 Lisp_Object keysym = key->keysym;
|
|
|
446 unsigned int modifiers = key->modifiers;
|
|
|
447
|
|
70
|
448 if (prettify && CHARP (keysym))
|
|
0
|
449 {
|
|
|
450 /* This is a little slow, but (control a) is prettier than (control 65).
|
|
|
451 It's now ok to do this for digit-chars too, since we've fixed the
|
|
|
452 bug where \9 read as the integer 9 instead of as the symbol with
|
|
|
453 "9" as its name.
|
|
|
454 */
|
|
|
455 /* !!#### I'm not sure how correct this is. */
|
|
|
456 Bufbyte str [1 + MAX_EMCHAR_LEN];
|
|
|
457 Bytecount count = set_charptr_emchar (str, XCHAR (keysym));
|
|
|
458 str[count] = 0;
|
|
|
459 keysym = intern ((char *) str);
|
|
|
460 }
|
|
173
|
461 return control_meta_superify (keysym, modifiers);
|
|
0
|
462 }
|
|
|
463
|
|
|
464
|
|
|
465 /************************************************************************/
|
|
|
466 /* Low-level keymap-store functions */
|
|
|
467 /************************************************************************/
|
|
|
468
|
|
|
469 static Lisp_Object
|
|
|
470 raw_lookup_key (Lisp_Object keymap,
|
|
|
471 CONST struct key_data *raw_keys, int raw_keys_count,
|
|
|
472 int keys_so_far, int accept_default);
|
|
|
473
|
|
|
474 /* Relies on caller to gc-protect args */
|
|
|
475 static Lisp_Object
|
|
|
476 keymap_lookup_directly (Lisp_Object keymap,
|
|
|
477 Lisp_Object keysym, unsigned int modifiers)
|
|
|
478 {
|
|
|
479 struct keymap *k;
|
|
|
480
|
|
|
481 if ((modifiers & ~(MOD_CONTROL | MOD_META | MOD_SUPER | MOD_HYPER
|
|
|
482 | MOD_ALT | MOD_SHIFT)) != 0)
|
|
|
483 abort ();
|
|
|
484
|
|
|
485 k = XKEYMAP (keymap);
|
|
|
486
|
|
|
487 /* If the keysym is a one-character symbol, use the char code instead. */
|
|
|
488 if (SYMBOLP (keysym) && string_char_length (XSYMBOL (keysym)->name) == 1)
|
|
|
489 {
|
|
|
490 Lisp_Object i_fart_on_gcc =
|
|
|
491 make_char (string_char (XSYMBOL (keysym)->name, 0));
|
|
|
492 keysym = i_fart_on_gcc;
|
|
|
493 }
|
|
|
494
|
|
|
495 if (modifiers & MOD_META) /* Utterly hateful ESC lossage */
|
|
2
|
496 {
|
|
|
497 Lisp_Object submap = Fgethash (MAKE_MODIFIER_HASH_KEY (MOD_META),
|
|
|
498 k->table, Qnil);
|
|
|
499 if (NILP (submap))
|
|
173
|
500 return Qnil;
|
|
2
|
501 k = XKEYMAP (submap);
|
|
|
502 modifiers &= ~MOD_META;
|
|
|
503 }
|
|
0
|
504
|
|
|
505 if (modifiers != 0)
|
|
2
|
506 {
|
|
|
507 Lisp_Object submap = Fgethash (MAKE_MODIFIER_HASH_KEY (modifiers),
|
|
|
508 k->table, Qnil);
|
|
|
509 if (NILP (submap))
|
|
173
|
510 return Qnil;
|
|
2
|
511 k = XKEYMAP (submap);
|
|
|
512 }
|
|
173
|
513 return Fgethash (keysym, k->table, Qnil);
|
|
0
|
514 }
|
|
|
515
|
|
|
516 static void
|
|
|
517 keymap_store_inverse_internal (Lisp_Object inverse_table,
|
|
|
518 Lisp_Object keysym,
|
|
|
519 Lisp_Object value)
|
|
|
520 {
|
|
|
521 Lisp_Object keys = Fgethash (value, inverse_table, Qunbound);
|
|
|
522
|
|
|
523 if (UNBOUNDP (keys))
|
|
|
524 {
|
|
|
525 keys = keysym;
|
|
|
526 /* Don't cons this unless necessary */
|
|
|
527 /* keys = Fcons (keysym, Qnil); */
|
|
|
528 Fputhash (value, keys, inverse_table);
|
|
|
529 }
|
|
|
530 else if (!CONSP (keys))
|
|
|
531 {
|
|
|
532 /* Now it's necessary to cons */
|
|
|
533 keys = Fcons (keys, keysym);
|
|
|
534 Fputhash (value, keys, inverse_table);
|
|
|
535 }
|
|
|
536 else
|
|
|
537 {
|
|
|
538 while (CONSP (Fcdr (keys)))
|
|
|
539 keys = XCDR (keys);
|
|
|
540 XCDR (keys) = Fcons (XCDR (keys), keysym);
|
|
|
541 /* No need to call puthash because we've destructively
|
|
|
542 modified the list tail in place */
|
|
|
543 }
|
|
|
544 }
|
|
|
545
|
|
|
546
|
|
|
547 static void
|
|
|
548 keymap_delete_inverse_internal (Lisp_Object inverse_table,
|
|
185
|
549 Lisp_Object keysym,
|
|
0
|
550 Lisp_Object value)
|
|
|
551 {
|
|
|
552 Lisp_Object keys = Fgethash (value, inverse_table, Qunbound);
|
|
|
553 Lisp_Object new_keys = keys;
|
|
|
554 Lisp_Object tail;
|
|
|
555 Lisp_Object *prev;
|
|
|
556
|
|
|
557 if (UNBOUNDP (keys))
|
|
|
558 abort ();
|
|
|
559
|
|
|
560 for (prev = &new_keys, tail = new_keys;
|
|
|
561 ;
|
|
|
562 prev = &(XCDR (tail)), tail = XCDR (tail))
|
|
|
563 {
|
|
|
564 if (EQ (tail, keysym))
|
|
|
565 {
|
|
|
566 *prev = Qnil;
|
|
|
567 break;
|
|
|
568 }
|
|
|
569 else if (EQ (keysym, XCAR (tail)))
|
|
|
570 {
|
|
|
571 *prev = XCDR (tail);
|
|
|
572 break;
|
|
|
573 }
|
|
|
574 }
|
|
|
575
|
|
|
576 if (NILP (new_keys))
|
|
|
577 Fremhash (value, inverse_table);
|
|
|
578 else if (!EQ (keys, new_keys))
|
|
|
579 /* Removed the first elt */
|
|
|
580 Fputhash (value, new_keys, inverse_table);
|
|
|
581 /* else the list's tail has been modified, so we don't need to
|
|
|
582 touch the hash table again (the pointer in there is ok).
|
|
|
583 */
|
|
|
584 }
|
|
|
585
|
|
|
586
|
|
|
587 static void
|
|
|
588 keymap_store_internal (Lisp_Object keysym, struct keymap *keymap,
|
|
|
589 Lisp_Object value)
|
|
|
590 {
|
|
|
591 Lisp_Object prev_value = Fgethash (keysym, keymap->table, Qnil);
|
|
|
592
|
|
|
593 if (EQ (prev_value, value))
|
|
|
594 return;
|
|
|
595 if (!NILP (prev_value))
|
|
185
|
596 keymap_delete_inverse_internal (keymap->inverse_table,
|
|
0
|
597 keysym, prev_value);
|
|
|
598 if (NILP (value))
|
|
|
599 {
|
|
|
600 keymap->fullness--;
|
|
|
601 if (keymap->fullness < 0) abort ();
|
|
|
602 Fremhash (keysym, keymap->table);
|
|
|
603 }
|
|
|
604 else
|
|
|
605 {
|
|
|
606 if (NILP (prev_value))
|
|
|
607 keymap->fullness++;
|
|
|
608 Fputhash (keysym, value, keymap->table);
|
|
185
|
609 keymap_store_inverse_internal (keymap->inverse_table,
|
|
0
|
610 keysym, value);
|
|
|
611 }
|
|
|
612 keymap_tick++;
|
|
|
613 }
|
|
|
614
|
|
|
615
|
|
|
616 static Lisp_Object
|
|
|
617 create_bucky_submap (struct keymap *k, unsigned int modifiers,
|
|
|
618 Lisp_Object parent_for_debugging_info)
|
|
|
619 {
|
|
|
620 Lisp_Object submap = Fmake_sparse_keymap (Qnil);
|
|
|
621 /* User won't see this, but it is nice for debugging Emacs */
|
|
|
622 XKEYMAP (submap)->name
|
|
|
623 = control_meta_superify (parent_for_debugging_info, modifiers);
|
|
|
624 /* Invalidate cache */
|
|
|
625 k->sub_maps_cache = Qt;
|
|
|
626 keymap_store_internal (MAKE_MODIFIER_HASH_KEY (modifiers), k, submap);
|
|
173
|
627 return submap;
|
|
0
|
628 }
|
|
|
629
|
|
|
630
|
|
|
631 /* Relies on caller to gc-protect keymap, keysym, value */
|
|
|
632 static void
|
|
|
633 keymap_store (Lisp_Object keymap, CONST struct key_data *key,
|
|
|
634 Lisp_Object value)
|
|
|
635 {
|
|
|
636 Lisp_Object keysym = key->keysym;
|
|
|
637 unsigned int modifiers = key->modifiers;
|
|
|
638 struct keymap *k;
|
|
|
639
|
|
|
640 if ((modifiers & ~(MOD_CONTROL | MOD_META | MOD_SUPER | MOD_HYPER
|
|
|
641 | MOD_ALT | MOD_SHIFT)) != 0)
|
|
|
642 abort ();
|
|
|
643
|
|
|
644 k = XKEYMAP (keymap);
|
|
|
645
|
|
|
646 /* If the keysym is a one-character symbol, use the char code instead. */
|
|
|
647 if (SYMBOLP (keysym) && string_char_length (XSYMBOL (keysym)->name) == 1)
|
|
|
648 {
|
|
|
649 Lisp_Object run_the_gcc_developers_over_with_a_steamroller =
|
|
|
650 make_char (string_char (XSYMBOL (keysym)->name, 0));
|
|
|
651 keysym = run_the_gcc_developers_over_with_a_steamroller;
|
|
|
652 }
|
|
|
653
|
|
|
654 if (modifiers & MOD_META) /* Utterly hateful ESC lossage */
|
|
|
655 {
|
|
|
656 Lisp_Object submap = Fgethash (MAKE_MODIFIER_HASH_KEY (MOD_META),
|
|
|
657 k->table, Qnil);
|
|
|
658 if (NILP (submap))
|
|
|
659 submap = create_bucky_submap (k, MOD_META, keymap);
|
|
|
660 k = XKEYMAP (submap);
|
|
|
661 modifiers &= ~MOD_META;
|
|
|
662 }
|
|
|
663
|
|
|
664 if (modifiers != 0)
|
|
|
665 {
|
|
|
666 Lisp_Object submap = Fgethash (MAKE_MODIFIER_HASH_KEY (modifiers),
|
|
|
667 k->table, Qnil);
|
|
|
668 if (NILP (submap))
|
|
|
669 submap = create_bucky_submap (k, modifiers, keymap);
|
|
|
670 k = XKEYMAP (submap);
|
|
|
671 }
|
|
|
672 k->sub_maps_cache = Qt; /* Invalidate cache */
|
|
|
673 keymap_store_internal (keysym, k, value);
|
|
|
674 }
|
|
|
675
|
|
|
676
|
|
|
677 /************************************************************************/
|
|
|
678 /* Listing the submaps of a keymap */
|
|
|
679 /************************************************************************/
|
|
|
680
|
|
|
681 struct keymap_submaps_closure
|
|
|
682 {
|
|
|
683 Lisp_Object *result_locative;
|
|
|
684 };
|
|
|
685
|
|
241
|
686 static int
|
|
185
|
687 keymap_submaps_mapper_0 (CONST void *hash_key, void *hash_contents,
|
|
0
|
688 void *keymap_submaps_closure)
|
|
|
689 {
|
|
|
690 /* This function can GC */
|
|
|
691 Lisp_Object contents;
|
|
|
692 VOID_TO_LISP (contents, hash_contents);
|
|
|
693 /* Perform any autoloads, etc */
|
|
183
|
694 Fkeymapp (contents);
|
|
241
|
695 return 0;
|
|
0
|
696 }
|
|
|
697
|
|
241
|
698 static int
|
|
185
|
699 keymap_submaps_mapper (CONST void *hash_key, void *hash_contents,
|
|
0
|
700 void *keymap_submaps_closure)
|
|
|
701 {
|
|
|
702 /* This function can GC */
|
|
|
703 Lisp_Object key, contents;
|
|
|
704 Lisp_Object *result_locative;
|
|
185
|
705 struct keymap_submaps_closure *cl =
|
|
|
706 (struct keymap_submaps_closure *) keymap_submaps_closure;
|
|
0
|
707 CVOID_TO_LISP (key, hash_key);
|
|
|
708 VOID_TO_LISP (contents, hash_contents);
|
|
|
709 result_locative = cl->result_locative;
|
|
|
710
|
|
|
711 if (!NILP (Fkeymapp (contents)))
|
|
|
712 *result_locative = Fcons (Fcons (key, contents), *result_locative);
|
|
241
|
713 return 0;
|
|
0
|
714 }
|
|
|
715
|
|
185
|
716 static int map_keymap_sort_predicate (Lisp_Object obj1, Lisp_Object obj2,
|
|
0
|
717 Lisp_Object pred);
|
|
|
718
|
|
|
719 static Lisp_Object
|
|
|
720 keymap_submaps (Lisp_Object keymap)
|
|
|
721 {
|
|
|
722 /* This function can GC */
|
|
|
723 struct keymap *k = XKEYMAP (keymap);
|
|
|
724
|
|
|
725 if (EQ (k->sub_maps_cache, Qt)) /* Unknown */
|
|
|
726 {
|
|
|
727 Lisp_Object result = Qnil;
|
|
|
728 struct gcpro gcpro1, gcpro2;
|
|
|
729 struct keymap_submaps_closure keymap_submaps_closure;
|
|
|
730
|
|
|
731 GCPRO2 (keymap, result);
|
|
|
732 keymap_submaps_closure.result_locative = &result;
|
|
|
733 /* Do this first pass to touch (and load) any autoloaded maps */
|
|
|
734 elisp_maphash (keymap_submaps_mapper_0, k->table,
|
|
|
735 &keymap_submaps_closure);
|
|
|
736 result = Qnil;
|
|
|
737 elisp_maphash (keymap_submaps_mapper, k->table,
|
|
|
738 &keymap_submaps_closure);
|
|
|
739 /* keep it sorted so that the result of accessible-keymaps is ordered */
|
|
185
|
740 k->sub_maps_cache = list_sort (result,
|
|
0
|
741 Qnil,
|
|
|
742 map_keymap_sort_predicate);
|
|
|
743 UNGCPRO;
|
|
|
744 }
|
|
173
|
745 return k->sub_maps_cache;
|
|
0
|
746 }
|
|
|
747
|
|
|
748
|
|
|
749 /************************************************************************/
|
|
|
750 /* Basic operations on keymaps */
|
|
|
751 /************************************************************************/
|
|
|
752
|
|
|
753 static Lisp_Object
|
|
|
754 make_keymap (int size)
|
|
|
755 {
|
|
|
756 Lisp_Object result = Qnil;
|
|
185
|
757 struct keymap *keymap = alloc_lcrecord_type (struct keymap, lrecord_keymap);
|
|
0
|
758
|
|
|
759 XSETKEYMAP (result, keymap);
|
|
|
760
|
|
|
761 keymap->parents = Qnil;
|
|
|
762 keymap->table = Qnil;
|
|
|
763 keymap->prompt = Qnil;
|
|
|
764 keymap->default_binding = Qnil;
|
|
|
765 keymap->inverse_table = Qnil;
|
|
|
766 keymap->sub_maps_cache = Qnil; /* No possible submaps */
|
|
|
767 keymap->fullness = 0;
|
|
|
768 if (size != 0) /* hack for copy-keymap */
|
|
|
769 {
|
|
|
770 keymap->table = Fmake_hashtable (make_int (size), Qnil);
|
|
|
771 /* Inverse table is often less dense because of duplicate key-bindings.
|
|
|
772 If not, it will grow anyway. */
|
|
|
773 keymap->inverse_table = Fmake_hashtable (make_int (size * 3 / 4), Qnil);
|
|
|
774 }
|
|
|
775 keymap->name = Qnil;
|
|
173
|
776 return result;
|
|
0
|
777 }
|
|
|
778
|
|
20
|
779 DEFUN ("make-keymap", Fmake_keymap, 0, 1, 0, /*
|
|
0
|
780 Construct and return a new keymap object.
|
|
185
|
781 All entries in it are nil, meaning "command undefined".
|
|
0
|
782
|
|
|
783 Optional argument NAME specifies a name to assign to the keymap,
|
|
|
784 as in `set-keymap-name'. This name is only a debugging convenience;
|
|
|
785 it is not used except when printing the keymap.
|
|
20
|
786 */
|
|
|
787 (name))
|
|
0
|
788 {
|
|
|
789 Lisp_Object keymap = make_keymap (60);
|
|
|
790 if (!NILP (name))
|
|
|
791 Fset_keymap_name (keymap, name);
|
|
|
792 return keymap;
|
|
|
793 }
|
|
|
794
|
|
20
|
795 DEFUN ("make-sparse-keymap", Fmake_sparse_keymap, 0, 1, 0, /*
|
|
0
|
796 Construct and return a new keymap object.
|
|
185
|
797 All entries in it are nil, meaning "command undefined". The only
|
|
0
|
798 difference between this function and make-keymap is that this function
|
|
185
|
799 returns a "smaller" keymap (one that is expected to contain fewer
|
|
0
|
800 entries). As keymaps dynamically resize, the distinction is not great.
|
|
|
801
|
|
|
802 Optional argument NAME specifies a name to assign to the keymap,
|
|
|
803 as in `set-keymap-name'. This name is only a debugging convenience;
|
|
|
804 it is not used except when printing the keymap.
|
|
20
|
805 */
|
|
|
806 (name))
|
|
0
|
807 {
|
|
|
808 Lisp_Object keymap = make_keymap (8);
|
|
|
809 if (!NILP (name))
|
|
|
810 Fset_keymap_name (keymap, name);
|
|
|
811 return keymap;
|
|
|
812 }
|
|
|
813
|
|
20
|
814 DEFUN ("keymap-parents", Fkeymap_parents, 1, 1, 0, /*
|
|
0
|
815 Return the `parent' keymaps of the given keymap, or nil.
|
|
|
816 The parents of a keymap are searched for keybindings when a key sequence
|
|
|
817 isn't bound in this one. `(current-global-map)' is the default parent
|
|
|
818 of all keymaps.
|
|
20
|
819 */
|
|
|
820 (keymap))
|
|
0
|
821 {
|
|
|
822 keymap = get_keymap (keymap, 1, 1);
|
|
173
|
823 return Fcopy_sequence (XKEYMAP (keymap)->parents);
|
|
0
|
824 }
|
|
|
825
|
|
185
|
826
|
|
|
827
|
|
0
|
828 static Lisp_Object
|
|
|
829 traverse_keymaps_noop (Lisp_Object keymap, void *arg)
|
|
|
830 {
|
|
173
|
831 return Qnil;
|
|
0
|
832 }
|
|
|
833
|
|
20
|
834 DEFUN ("set-keymap-parents", Fset_keymap_parents, 2, 2, 0, /*
|
|
0
|
835 Sets the `parent' keymaps of the given keymap.
|
|
|
836 The parents of a keymap are searched for keybindings when a key sequence
|
|
|
837 isn't bound in this one. `(current-global-map)' is the default parent
|
|
|
838 of all keymaps.
|
|
20
|
839 */
|
|
|
840 (keymap, parents))
|
|
0
|
841 {
|
|
|
842 /* This function can GC */
|
|
|
843 Lisp_Object k;
|
|
|
844 struct gcpro gcpro1, gcpro2;
|
|
|
845
|
|
|
846 GCPRO2 (keymap, parents);
|
|
|
847 keymap = get_keymap (keymap, 1, 1);
|
|
|
848
|
|
|
849 if (KEYMAPP (parents)) /* backwards-compatibility */
|
|
|
850 parents = list1 (parents);
|
|
|
851 if (!NILP (parents))
|
|
|
852 {
|
|
|
853 Lisp_Object tail = parents;
|
|
|
854 while (!NILP (tail))
|
|
|
855 {
|
|
|
856 QUIT;
|
|
|
857 CHECK_CONS (tail);
|
|
|
858 k = XCAR (tail);
|
|
|
859 /* Require that it be an actual keymap object, rather than a symbol
|
|
|
860 with a (crockish) symbol-function which is a keymap */
|
|
|
861 CHECK_KEYMAP (k); /* get_keymap (k, 1, 1); */
|
|
|
862 tail = XCDR (tail);
|
|
|
863 }
|
|
|
864 }
|
|
|
865
|
|
|
866 /* Check for circularities */
|
|
|
867 traverse_keymaps (keymap, parents, traverse_keymaps_noop, 0);
|
|
|
868 keymap_tick++;
|
|
|
869 XKEYMAP (keymap)->parents = Fcopy_sequence (parents);
|
|
|
870 UNGCPRO;
|
|
173
|
871 return parents;
|
|
0
|
872 }
|
|
|
873
|
|
20
|
874 DEFUN ("set-keymap-name", Fset_keymap_name, 2, 2, 0, /*
|
|
0
|
875 Set the `name' of the KEYMAP to NEW-NAME.
|
|
|
876 The name is only a debugging convenience; it is not used except
|
|
|
877 when printing the keymap.
|
|
20
|
878 */
|
|
|
879 (keymap, new_name))
|
|
0
|
880 {
|
|
|
881 keymap = get_keymap (keymap, 1, 1);
|
|
|
882
|
|
|
883 XKEYMAP (keymap)->name = new_name;
|
|
173
|
884 return new_name;
|
|
0
|
885 }
|
|
|
886
|
|
20
|
887 DEFUN ("keymap-name", Fkeymap_name, 1, 1, 0, /*
|
|
0
|
888 Return the `name' of KEYMAP.
|
|
|
889 The name is only a debugging convenience; it is not used except
|
|
|
890 when printing the keymap.
|
|
20
|
891 */
|
|
|
892 (keymap))
|
|
0
|
893 {
|
|
|
894 keymap = get_keymap (keymap, 1, 1);
|
|
|
895
|
|
173
|
896 return XKEYMAP (keymap)->name;
|
|
0
|
897 }
|
|
|
898
|
|
20
|
899 DEFUN ("set-keymap-prompt", Fset_keymap_prompt, 2, 2, 0, /*
|
|
0
|
900 Sets the `prompt' of KEYMAP to string NEW-PROMPT, or `nil'
|
|
|
901 if no prompt is desired. The prompt is shown in the echo-area
|
|
|
902 when reading a key-sequence to be looked-up in this keymap.
|
|
20
|
903 */
|
|
|
904 (keymap, new_prompt))
|
|
0
|
905 {
|
|
|
906 keymap = get_keymap (keymap, 1, 1);
|
|
185
|
907
|
|
0
|
908 if (!NILP (new_prompt))
|
|
|
909 CHECK_STRING (new_prompt);
|
|
|
910
|
|
|
911 XKEYMAP (keymap)->prompt = new_prompt;
|
|
173
|
912 return new_prompt;
|
|
0
|
913 }
|
|
|
914
|
|
|
915 static Lisp_Object
|
|
|
916 keymap_prompt_mapper (Lisp_Object keymap, void *arg)
|
|
|
917 {
|
|
173
|
918 return XKEYMAP (keymap)->prompt;
|
|
0
|
919 }
|
|
|
920
|
|
|
921
|
|
20
|
922 DEFUN ("keymap-prompt", Fkeymap_prompt, 1, 2, 0, /*
|
|
0
|
923 Return the `prompt' of the given keymap.
|
|
|
924 If non-nil, the prompt is shown in the echo-area
|
|
|
925 when reading a key-sequence to be looked-up in this keymap.
|
|
20
|
926 */
|
|
|
927 (keymap, use_inherited))
|
|
0
|
928 {
|
|
|
929 /* This function can GC */
|
|
|
930 Lisp_Object prompt;
|
|
|
931
|
|
|
932 keymap = get_keymap (keymap, 1, 1);
|
|
|
933 prompt = XKEYMAP (keymap)->prompt;
|
|
|
934 if (!NILP (prompt) || NILP (use_inherited))
|
|
173
|
935 return prompt;
|
|
0
|
936 else
|
|
173
|
937 return traverse_keymaps (keymap, Qnil, keymap_prompt_mapper, 0);
|
|
0
|
938 }
|
|
|
939
|
|
20
|
940 DEFUN ("set-keymap-default-binding", Fset_keymap_default_binding, 2, 2, 0, /*
|
|
0
|
941 Sets the default binding of KEYMAP to COMMAND, or `nil'
|
|
|
942 if no default is desired. The default-binding is returned when
|
|
|
943 no other binding for a key-sequence is found in the keymap.
|
|
|
944 If a keymap has a non-nil default-binding, neither the keymap's
|
|
|
945 parents nor the current global map are searched for key bindings.
|
|
20
|
946 */
|
|
|
947 (keymap, command))
|
|
0
|
948 {
|
|
|
949 /* This function can GC */
|
|
|
950 keymap = get_keymap (keymap, 1, 1);
|
|
185
|
951
|
|
0
|
952 XKEYMAP (keymap)->default_binding = command;
|
|
173
|
953 return command;
|
|
0
|
954 }
|
|
|
955
|
|
20
|
956 DEFUN ("keymap-default-binding", Fkeymap_default_binding, 1, 1, 0, /*
|
|
0
|
957 Return the default binding of KEYMAP, or `nil' if it has none.
|
|
|
958 The default-binding is returned when no other binding for a key-sequence
|
|
|
959 is found in the keymap.
|
|
|
960 If a keymap has a non-nil default-binding, neither the keymap's
|
|
|
961 parents nor the current global map are searched for key bindings.
|
|
20
|
962 */
|
|
|
963 (keymap))
|
|
0
|
964 {
|
|
|
965 /* This function can GC */
|
|
|
966 keymap = get_keymap (keymap, 1, 1);
|
|
173
|
967 return XKEYMAP (keymap)->default_binding;
|
|
0
|
968 }
|
|
|
969
|
|
20
|
970 DEFUN ("keymapp", Fkeymapp, 1, 1, 0, /*
|
|
0
|
971 Return t if ARG is a keymap object.
|
|
|
972 The keymap may be autoloaded first if necessary.
|
|
20
|
973 */
|
|
|
974 (object))
|
|
0
|
975 {
|
|
|
976 /* This function can GC */
|
|
185
|
977 return KEYMAPP (get_keymap (object, 0, 0)) ? Qt : Qnil;
|
|
0
|
978 }
|
|
|
979
|
|
|
980 /* Check that OBJECT is a keymap (after dereferencing through any
|
|
|
981 symbols). If it is, return it.
|
|
|
982
|
|
|
983 If AUTOLOAD is non-zero and OBJECT is a symbol whose function value
|
|
|
984 is an autoload form, do the autoload and try again.
|
|
185
|
985 If AUTOLOAD is nonzero, callers must assume GC is possible.
|
|
0
|
986
|
|
|
987 ERRORP controls how we respond if OBJECT isn't a keymap.
|
|
185
|
988 If ERRORP is non-zero, signal an error; otherwise, just return Qnil.
|
|
|
989
|
|
|
990 Note that most of the time, we don't want to pursue autoloads.
|
|
|
991 Functions like Faccessible_keymaps which scan entire keymap trees
|
|
|
992 shouldn't load every autoloaded keymap. I'm not sure about this,
|
|
|
993 but it seems to me that only read_key_sequence, Flookup_key, and
|
|
|
994 Fdefine_key should cause keymaps to be autoloaded. */
|
|
|
995
|
|
0
|
996 Lisp_Object
|
|
|
997 get_keymap (Lisp_Object object, int errorp, int autoload)
|
|
|
998 {
|
|
|
999 /* This function can GC */
|
|
|
1000 while (1)
|
|
|
1001 {
|
|
|
1002 Lisp_Object tem = indirect_function (object, 0);
|
|
185
|
1003
|
|
0
|
1004 if (KEYMAPP (tem))
|
|
|
1005 return tem;
|
|
|
1006 /* Should we do an autoload? */
|
|
|
1007 else if (autoload
|
|
|
1008 /* (autoload "filename" doc nil keymap) */
|
|
|
1009 && SYMBOLP (object)
|
|
|
1010 && CONSP (tem)
|
|
|
1011 && EQ (XCAR (tem), Qautoload)
|
|
|
1012 && EQ (Fcar (Fcdr (Fcdr (Fcdr (Fcdr (tem))))), Qkeymap))
|
|
|
1013 {
|
|
|
1014 struct gcpro gcpro1, gcpro2;
|
|
|
1015 GCPRO2 (tem, object);
|
|
|
1016 do_autoload (tem, object);
|
|
|
1017 UNGCPRO;
|
|
|
1018 }
|
|
|
1019 else if (errorp)
|
|
|
1020 object = wrong_type_argument (Qkeymapp, object);
|
|
|
1021 else
|
|
|
1022 return Qnil;
|
|
|
1023 }
|
|
|
1024 }
|
|
|
1025
|
|
|
1026 /* Given OBJECT which was found in a slot in a keymap,
|
|
|
1027 trace indirect definitions to get the actual definition of that slot.
|
|
|
1028 An indirect definition is a list of the form
|
|
|
1029 (KEYMAP . INDEX), where KEYMAP is a keymap or a symbol defined as one
|
|
|
1030 and INDEX is an ASCII code, or a cons of (KEYSYM . MODIFIERS).
|
|
|
1031 */
|
|
|
1032 static Lisp_Object
|
|
|
1033 get_keyelt (Lisp_Object object, int accept_default)
|
|
|
1034 {
|
|
|
1035 /* This function can GC */
|
|
|
1036 Lisp_Object map;
|
|
|
1037
|
|
|
1038 tail_recurse:
|
|
|
1039 if (!CONSP (object))
|
|
173
|
1040 return object;
|
|
0
|
1041
|
|
|
1042 {
|
|
|
1043 struct gcpro gcpro1;
|
|
|
1044 GCPRO1 (object);
|
|
|
1045 map = XCAR (object);
|
|
|
1046 map = get_keymap (map, 0, 1);
|
|
|
1047 UNGCPRO;
|
|
|
1048 }
|
|
|
1049 /* If the contents are (KEYMAP . ELEMENT), go indirect. */
|
|
|
1050 if (!NILP (map))
|
|
|
1051 {
|
|
|
1052 Lisp_Object idx = Fcdr (object);
|
|
|
1053 struct key_data indirection;
|
|
|
1054 if (CHARP (idx))
|
|
|
1055 {
|
|
|
1056 struct Lisp_Event event;
|
|
|
1057 event.event_type = empty_event;
|
|
|
1058 character_to_event (XCHAR (idx), &event,
|
|
263
|
1059 XCONSOLE (Vselected_console), 0, 0);
|
|
0
|
1060 indirection = event.event.key;
|
|
|
1061 }
|
|
|
1062 else if (CONSP (idx))
|
|
|
1063 {
|
|
|
1064 if (!INTP (XCDR (idx)))
|
|
173
|
1065 return Qnil;
|
|
0
|
1066 indirection.keysym = XCAR (idx);
|
|
|
1067 indirection.modifiers = XINT (XCDR (idx));
|
|
|
1068 }
|
|
|
1069 else if (SYMBOLP (idx))
|
|
|
1070 {
|
|
|
1071 indirection.keysym = idx;
|
|
|
1072 indirection.modifiers = 0;
|
|
|
1073 }
|
|
|
1074 else
|
|
|
1075 {
|
|
|
1076 /* Random junk */
|
|
173
|
1077 return Qnil;
|
|
0
|
1078 }
|
|
173
|
1079 return raw_lookup_key (map, &indirection, 1, 0, accept_default);
|
|
0
|
1080 }
|
|
|
1081 else if (STRINGP (XCAR (object)))
|
|
|
1082 {
|
|
|
1083 /* If the keymap contents looks like (STRING . DEFN),
|
|
|
1084 use DEFN.
|
|
|
1085 Keymap alist elements like (CHAR MENUSTRING . DEFN)
|
|
|
1086 will be used by HierarKey menus. */
|
|
|
1087 object = XCDR (object);
|
|
|
1088 goto tail_recurse;
|
|
|
1089 }
|
|
|
1090 else
|
|
|
1091 {
|
|
|
1092 /* Anything else is really the value. */
|
|
173
|
1093 return object;
|
|
0
|
1094 }
|
|
|
1095 }
|
|
|
1096
|
|
|
1097 static Lisp_Object
|
|
|
1098 keymap_lookup_1 (Lisp_Object keymap, CONST struct key_data *key,
|
|
|
1099 int accept_default)
|
|
|
1100 {
|
|
|
1101 /* This function can GC */
|
|
173
|
1102 return get_keyelt (keymap_lookup_directly (keymap,
|
|
|
1103 key->keysym, key->modifiers),
|
|
|
1104 accept_default);
|
|
0
|
1105 }
|
|
|
1106
|
|
|
1107
|
|
|
1108 /************************************************************************/
|
|
|
1109 /* Copying keymaps */
|
|
|
1110 /************************************************************************/
|
|
|
1111
|
|
|
1112 struct copy_keymap_inverse_closure
|
|
|
1113 {
|
|
|
1114 Lisp_Object inverse_table;
|
|
|
1115 };
|
|
|
1116
|
|
241
|
1117 static int
|
|
185
|
1118 copy_keymap_inverse_mapper (CONST void *hash_key, void *hash_contents,
|
|
0
|
1119 void *copy_keymap_inverse_closure)
|
|
|
1120 {
|
|
|
1121 Lisp_Object key, inverse_table, inverse_contents;
|
|
185
|
1122 struct copy_keymap_inverse_closure *closure =
|
|
|
1123 (struct copy_keymap_inverse_closure *) copy_keymap_inverse_closure;
|
|
0
|
1124
|
|
|
1125 VOID_TO_LISP (inverse_table, closure);
|
|
|
1126 VOID_TO_LISP (inverse_contents, hash_contents);
|
|
|
1127 CVOID_TO_LISP (key, hash_key);
|
|
|
1128 /* copy-sequence deals with dotted lists. */
|
|
|
1129 if (CONSP (inverse_contents))
|
|
|
1130 inverse_contents = Fcopy_sequence (inverse_contents);
|
|
|
1131 Fputhash (key, inverse_contents, closure->inverse_table);
|
|
241
|
1132
|
|
|
1133 return 0;
|
|
0
|
1134 }
|
|
|
1135
|
|
|
1136
|
|
|
1137 static Lisp_Object
|
|
|
1138 copy_keymap_internal (struct keymap *keymap)
|
|
|
1139 {
|
|
|
1140 Lisp_Object nkm = make_keymap (0);
|
|
|
1141 struct keymap *new_keymap = XKEYMAP (nkm);
|
|
|
1142 struct copy_keymap_inverse_closure copy_keymap_inverse_closure;
|
|
|
1143 copy_keymap_inverse_closure.inverse_table = keymap->inverse_table;
|
|
|
1144
|
|
|
1145 new_keymap->parents = Fcopy_sequence (keymap->parents);
|
|
|
1146 new_keymap->fullness = keymap->fullness;
|
|
|
1147 new_keymap->sub_maps_cache = Qnil; /* No submaps */
|
|
|
1148 new_keymap->table = Fcopy_hashtable (keymap->table);
|
|
|
1149 new_keymap->inverse_table = Fcopy_hashtable (keymap->inverse_table);
|
|
|
1150 /* After copying the inverse map, we need to copy the conses which
|
|
|
1151 are its values, lest they be shared by the copy, and mangled.
|
|
|
1152 */
|
|
|
1153 elisp_maphash (copy_keymap_inverse_mapper, keymap->inverse_table,
|
|
|
1154 ©_keymap_inverse_closure);
|
|
|
1155 return nkm;
|
|
|
1156 }
|
|
|
1157
|
|
|
1158
|
|
|
1159 static Lisp_Object copy_keymap (Lisp_Object keymap);
|
|
|
1160
|
|
|
1161 struct copy_keymap_closure
|
|
|
1162 {
|
|
|
1163 struct keymap *self;
|
|
|
1164 };
|
|
|
1165
|
|
241
|
1166 static int
|
|
185
|
1167 copy_keymap_mapper (CONST void *hash_key, void *hash_contents,
|
|
0
|
1168 void *copy_keymap_closure)
|
|
|
1169 {
|
|
|
1170 /* This function can GC */
|
|
|
1171 Lisp_Object key, contents;
|
|
185
|
1172 struct copy_keymap_closure *closure =
|
|
|
1173 (struct copy_keymap_closure *) copy_keymap_closure;
|
|
0
|
1174
|
|
|
1175 CVOID_TO_LISP (key, hash_key);
|
|
|
1176 VOID_TO_LISP (contents, hash_contents);
|
|
|
1177 /* When we encounter a keymap which is indirected through a
|
|
|
1178 symbol, we need to copy the sub-map. In v18, the form
|
|
|
1179 (lookup-key (copy-keymap global-map) "\C-x")
|
|
|
1180 returned a new keymap, not the symbol 'Control-X-prefix.
|
|
|
1181 */
|
|
|
1182 contents = get_keymap (contents,
|
|
|
1183 0, 1); /* #### autoload GC-safe here? */
|
|
|
1184 if (KEYMAPP (contents))
|
|
|
1185 keymap_store_internal (key, closure->self,
|
|
|
1186 copy_keymap (contents));
|
|
241
|
1187 return 0;
|
|
0
|
1188 }
|
|
|
1189
|
|
|
1190 static Lisp_Object
|
|
|
1191 copy_keymap (Lisp_Object keymap)
|
|
|
1192 {
|
|
|
1193 /* This function can GC */
|
|
|
1194 struct copy_keymap_closure copy_keymap_closure;
|
|
|
1195
|
|
|
1196 keymap = copy_keymap_internal (XKEYMAP (keymap));
|
|
|
1197 copy_keymap_closure.self = XKEYMAP (keymap);
|
|
|
1198 elisp_maphash (copy_keymap_mapper,
|
|
|
1199 XKEYMAP (keymap)->table,
|
|
|
1200 ©_keymap_closure);
|
|
|
1201 return keymap;
|
|
|
1202 }
|
|
|
1203
|
|
20
|
1204 DEFUN ("copy-keymap", Fcopy_keymap, 1, 1, 0, /*
|
|
0
|
1205 Return a copy of the keymap KEYMAP.
|
|
|
1206 The copy starts out with the same definitions of KEYMAP,
|
|
|
1207 but changing either the copy or KEYMAP does not affect the other.
|
|
|
1208 Any key definitions that are subkeymaps are recursively copied.
|
|
20
|
1209 */
|
|
|
1210 (keymap))
|
|
0
|
1211 {
|
|
|
1212 /* This function can GC */
|
|
|
1213 keymap = get_keymap (keymap, 1, 1);
|
|
|
1214 return copy_keymap (keymap);
|
|
|
1215 }
|
|
|
1216
|
|
|
1217
|
|
|
1218 static int
|
|
|
1219 keymap_fullness (Lisp_Object keymap)
|
|
|
1220 {
|
|
|
1221 /* This function can GC */
|
|
|
1222 int fullness;
|
|
|
1223 Lisp_Object sub_maps;
|
|
|
1224 struct gcpro gcpro1, gcpro2;
|
|
|
1225
|
|
|
1226 keymap = get_keymap (keymap, 1, 1);
|
|
|
1227 fullness = XKEYMAP (keymap)->fullness;
|
|
|
1228 sub_maps = keymap_submaps (keymap);
|
|
|
1229 GCPRO2 (keymap, sub_maps);
|
|
|
1230 for (; !NILP (sub_maps); sub_maps = XCDR (sub_maps))
|
|
|
1231 {
|
|
|
1232 if (MODIFIER_HASH_KEY_BITS (XCAR (XCAR (sub_maps))) != 0)
|
|
|
1233 {
|
|
|
1234 Lisp_Object sub_map = XCDR (XCAR (sub_maps));
|
|
|
1235 fullness--; /* don't count bucky maps */
|
|
|
1236 fullness += keymap_fullness (sub_map);
|
|
|
1237 }
|
|
|
1238 }
|
|
|
1239 UNGCPRO;
|
|
173
|
1240 return fullness;
|
|
0
|
1241 }
|
|
|
1242
|
|
20
|
1243 DEFUN ("keymap-fullness", Fkeymap_fullness, 1, 1, 0, /*
|
|
0
|
1244 Return the number of bindings in the keymap.
|
|
20
|
1245 */
|
|
|
1246 (keymap))
|
|
0
|
1247 {
|
|
|
1248 /* This function can GC */
|
|
173
|
1249 return make_int (keymap_fullness (get_keymap (keymap, 1, 1)));
|
|
0
|
1250 }
|
|
|
1251
|
|
|
1252
|
|
|
1253 /************************************************************************/
|
|
|
1254 /* Defining keys in keymaps */
|
|
|
1255 /************************************************************************/
|
|
|
1256
|
|
70
|
1257 /* Given a keysym (should be a symbol, int, char), make sure it's valid
|
|
|
1258 and perform any necessary canonicalization. */
|
|
|
1259
|
|
0
|
1260 static void
|
|
70
|
1261 define_key_check_and_coerce_keysym (Lisp_Object spec,
|
|
|
1262 Lisp_Object *keysym,
|
|
|
1263 unsigned int modifiers)
|
|
0
|
1264 {
|
|
|
1265 /* Now, check and massage the trailing keysym specifier. */
|
|
8
|
1266 if (SYMBOLP (*keysym))
|
|
0
|
1267 {
|
|
70
|
1268 if (string_char_length (XSYMBOL (*keysym)->name) == 1)
|
|
0
|
1269 {
|
|
70
|
1270 Lisp_Object ream_gcc_up_the_ass =
|
|
|
1271 make_char (string_char (XSYMBOL (*keysym)->name, 0));
|
|
|
1272 *keysym = ream_gcc_up_the_ass;
|
|
0
|
1273 goto fixnum_keysym;
|
|
|
1274 }
|
|
|
1275 }
|
|
70
|
1276 else if (CHAR_OR_CHAR_INTP (*keysym))
|
|
0
|
1277 {
|
|
70
|
1278 CHECK_CHAR_COERCE_INT (*keysym);
|
|
0
|
1279 fixnum_keysym:
|
|
70
|
1280 if (XCHAR (*keysym) < ' '
|
|
|
1281 /* || (XCHAR (*keysym) >= 128 && XCHAR (*keysym) < 160) */)
|
|
|
1282 /* yuck! Can't make the above restriction; too many compatibility
|
|
|
1283 problems ... */
|
|
|
1284 signal_simple_error ("keysym char must be printable", *keysym);
|
|
0
|
1285 /* #### This bites! I want to be able to write (control shift a) */
|
|
|
1286 if (modifiers & MOD_SHIFT)
|
|
70
|
1287 signal_simple_error
|
|
|
1288 ("the `shift' modifier may not be applied to ASCII keysyms",
|
|
|
1289 spec);
|
|
0
|
1290 }
|
|
|
1291 else
|
|
|
1292 {
|
|
|
1293 signal_simple_error ("unknown keysym specifier",
|
|
8
|
1294 *keysym);
|
|
|
1295 }
|
|
|
1296
|
|
|
1297 if (SYMBOLP (*keysym))
|
|
|
1298 {
|
|
|
1299 char *name = (char *)
|
|
|
1300 string_data (XSYMBOL (*keysym)->name);
|
|
|
1301
|
|
70
|
1302 /* FSFmacs uses symbols with the printed representation of keysyms in
|
|
|
1303 their names, like 'M-x, and we use the syntax '(meta x). So, to avoid
|
|
|
1304 confusion, notice the M-x syntax and signal an error - because
|
|
|
1305 otherwise it would be interpreted as a regular keysym, and would even
|
|
|
1306 show up in the list-buffers output, causing confusion to the naive.
|
|
|
1307
|
|
|
1308 We can get away with this because none of the X keysym names contain
|
|
|
1309 a hyphen (some contain underscore, however).
|
|
|
1310
|
|
|
1311 It might be useful to reject keysyms which are not x-valid-keysym-
|
|
|
1312 name-p, but that would interfere with various tricks we do to
|
|
|
1313 sanitize the Sun keyboards, and would make it trickier to
|
|
|
1314 conditionalize a .emacs file for multiple X servers.
|
|
|
1315 */
|
|
|
1316 if (((int) strlen (name) >= 2 && name[1] == '-')
|
|
|
1317 #if 1
|
|
|
1318 ||
|
|
|
1319 /* Ok, this is a bit more dubious - prevent people from doing things
|
|
|
1320 like (global-set-key 'RET 'something) because that will have the
|
|
|
1321 same problem as above. (Gag!) Maybe we should just silently
|
|
|
1322 accept these as aliases for the "real" names?
|
|
|
1323 */
|
|
185
|
1324 (string_length (XSYMBOL (*keysym)->name) <= 3 &&
|
|
70
|
1325 (!strcmp (name, "LFD") ||
|
|
|
1326 !strcmp (name, "TAB") ||
|
|
|
1327 !strcmp (name, "RET") ||
|
|
|
1328 !strcmp (name, "ESC") ||
|
|
|
1329 !strcmp (name, "DEL") ||
|
|
|
1330 !strcmp (name, "SPC") ||
|
|
|
1331 !strcmp (name, "BS")))
|
|
|
1332 #endif /* unused */
|
|
|
1333 )
|
|
|
1334 signal_simple_error
|
|
|
1335 ("Invalid (FSF Emacs) key format (see doc of define-key)",
|
|
|
1336 *keysym);
|
|
|
1337
|
|
|
1338 /* #### Ok, this is a bit more dubious - make people not lose if they
|
|
|
1339 do things like (global-set-key 'RET 'something) because that would
|
|
|
1340 otherwise have the same problem as above. (Gag!) We silently
|
|
|
1341 accept these as aliases for the "real" names.
|
|
|
1342 */
|
|
74
|
1343 else if (!strncmp(name, "kp_", 3)) {
|
|
|
1344 /* Likewise, the obsolete keysym binding of kp_.* should not lose. */
|
|
|
1345 char temp[50];
|
|
|
1346
|
|
|
1347 strncpy(temp, name, sizeof (temp));
|
|
|
1348 temp[sizeof (temp) - 1] = '\0';
|
|
|
1349 temp[2] = '-';
|
|
76
|
1350 *keysym = Fintern_soft(make_string((Bufbyte *)temp,
|
|
|
1351 strlen(temp)),
|
|
|
1352 Qnil);
|
|
74
|
1353 } else if (EQ (*keysym, QLFD))
|
|
70
|
1354 *keysym = QKlinefeed;
|
|
|
1355 else if (EQ (*keysym, QTAB))
|
|
|
1356 *keysym = QKtab;
|
|
|
1357 else if (EQ (*keysym, QRET))
|
|
|
1358 *keysym = QKreturn;
|
|
|
1359 else if (EQ (*keysym, QESC))
|
|
|
1360 *keysym = QKescape;
|
|
|
1361 else if (EQ (*keysym, QDEL))
|
|
|
1362 *keysym = QKdelete;
|
|
|
1363 else if (EQ (*keysym, QBS))
|
|
|
1364 *keysym = QKbackspace;
|
|
98
|
1365 /* Emacs compatibility */
|
|
|
1366 else if (EQ(*keysym, Qdown_mouse_1))
|
|
|
1367 *keysym = Qbutton1;
|
|
|
1368 else if (EQ(*keysym, Qdown_mouse_2))
|
|
|
1369 *keysym = Qbutton2;
|
|
|
1370 else if (EQ(*keysym, Qdown_mouse_3))
|
|
|
1371 *keysym = Qbutton3;
|
|
265
|
1372 else if (EQ(*keysym, Qdown_mouse_4))
|
|
|
1373 *keysym = Qbutton4;
|
|
|
1374 else if (EQ(*keysym, Qdown_mouse_5))
|
|
|
1375 *keysym = Qbutton5;
|
|
98
|
1376 else if (EQ(*keysym, Qmouse_1))
|
|
|
1377 *keysym = Qbutton1up;
|
|
|
1378 else if (EQ(*keysym, Qmouse_2))
|
|
|
1379 *keysym = Qbutton2up;
|
|
|
1380 else if (EQ(*keysym, Qmouse_3))
|
|
|
1381 *keysym = Qbutton3up;
|
|
265
|
1382 else if (EQ(*keysym, Qmouse_4))
|
|
|
1383 *keysym = Qbutton4up;
|
|
|
1384 else if (EQ(*keysym, Qmouse_5))
|
|
|
1385 *keysym = Qbutton5up;
|
|
0
|
1386 }
|
|
|
1387 }
|
|
|
1388
|
|
70
|
1389
|
|
0
|
1390 /* Given any kind of key-specifier, return a keysym and modifier mask.
|
|
70
|
1391 Proper canonicalization is performed:
|
|
|
1392
|
|
|
1393 -- integers are converted into the equivalent characters.
|
|
|
1394 -- one-character strings are converted into the equivalent characters.
|
|
0
|
1395 */
|
|
70
|
1396
|
|
0
|
1397 static void
|
|
|
1398 define_key_parser (Lisp_Object spec, struct key_data *returned_value)
|
|
|
1399 {
|
|
70
|
1400 if (CHAR_OR_CHAR_INTP (spec))
|
|
0
|
1401 {
|
|
|
1402 struct Lisp_Event event;
|
|
|
1403 event.event_type = empty_event;
|
|
70
|
1404 character_to_event (XCHAR_OR_CHAR_INT (spec), &event,
|
|
263
|
1405 XCONSOLE (Vselected_console), 0, 0);
|
|
185
|
1406 returned_value->keysym = event.event.key.keysym;
|
|
0
|
1407 returned_value->modifiers = event.event.key.modifiers;
|
|
|
1408 }
|
|
|
1409 else if (EVENTP (spec))
|
|
|
1410 {
|
|
|
1411 switch (XEVENT (spec)->event_type)
|
|
|
1412 {
|
|
|
1413 case key_press_event:
|
|
|
1414 {
|
|
185
|
1415 returned_value->keysym = XEVENT (spec)->event.key.keysym;
|
|
0
|
1416 returned_value->modifiers = XEVENT (spec)->event.key.modifiers;
|
|
|
1417 break;
|
|
|
1418 }
|
|
|
1419 case button_press_event:
|
|
|
1420 case button_release_event:
|
|
|
1421 {
|
|
|
1422 int down = (XEVENT (spec)->event_type == button_press_event);
|
|
|
1423 switch (XEVENT (spec)->event.button.button)
|
|
|
1424 {
|
|
|
1425 case 1:
|
|
|
1426 returned_value->keysym = (down ? Qbutton1 : Qbutton1up); break;
|
|
|
1427 case 2:
|
|
|
1428 returned_value->keysym = (down ? Qbutton2 : Qbutton2up); break;
|
|
|
1429 case 3:
|
|
|
1430 returned_value->keysym = (down ? Qbutton3 : Qbutton3up); break;
|
|
|
1431 case 4:
|
|
|
1432 returned_value->keysym = (down ? Qbutton4 : Qbutton4up); break;
|
|
|
1433 case 5:
|
|
|
1434 returned_value->keysym = (down ? Qbutton5 : Qbutton5up); break;
|
|
|
1435 case 6:
|
|
|
1436 returned_value->keysym = (down ? Qbutton6 : Qbutton6up); break;
|
|
|
1437 case 7:
|
|
|
1438 returned_value->keysym = (down ? Qbutton7 : Qbutton7up); break;
|
|
|
1439 default:
|
|
185
|
1440 returned_value->keysym = (down ? Qbutton0 : Qbutton0up); break;
|
|
0
|
1441 }
|
|
|
1442 returned_value->modifiers = XEVENT (spec)->event.button.modifiers;
|
|
|
1443 break;
|
|
|
1444 }
|
|
249
|
1445 #if defined(HAVE_OFFIX_DND) || defined(HAVE_MS_WINDOWS)
|
|
197
|
1446 case dnd_drop_event:
|
|
|
1447 {
|
|
|
1448 switch (XEVENT (spec)->event.dnd_drop.button)
|
|
|
1449 {
|
|
|
1450 case 1:
|
|
|
1451 returned_value->keysym = Qdrop1; break;
|
|
|
1452 case 2:
|
|
|
1453 returned_value->keysym = Qdrop2; break;
|
|
|
1454 case 3:
|
|
|
1455 returned_value->keysym = Qdrop3; break;
|
|
|
1456 case 4:
|
|
|
1457 returned_value->keysym = Qdrop4; break;
|
|
|
1458 case 5:
|
|
|
1459 returned_value->keysym = Qdrop5; break;
|
|
|
1460 case 6:
|
|
|
1461 returned_value->keysym = Qdrop6; break;
|
|
|
1462 case 7:
|
|
|
1463 returned_value->keysym = Qdrop7; break;
|
|
|
1464 default:
|
|
|
1465 returned_value->keysym = Qdrop0; break;
|
|
|
1466 }
|
|
|
1467 returned_value->modifiers = XEVENT (spec)->event.dnd_drop.modifiers;
|
|
|
1468 break;
|
|
|
1469 }
|
|
|
1470 #endif
|
|
0
|
1471 default:
|
|
|
1472 signal_error (Qwrong_type_argument,
|
|
|
1473 list2 (build_translated_string
|
|
|
1474 ("unable to bind this type of event"),
|
|
|
1475 spec));
|
|
|
1476 }
|
|
|
1477 }
|
|
|
1478 else if (SYMBOLP (spec))
|
|
|
1479 {
|
|
|
1480 /* Be nice, allow = to mean (=) */
|
|
|
1481 if (bucky_sym_to_bucky_bit (spec) != 0)
|
|
|
1482 signal_simple_error ("Key is a modifier name", spec);
|
|
70
|
1483 define_key_check_and_coerce_keysym (spec, &spec, 0);
|
|
0
|
1484 returned_value->keysym = spec;
|
|
|
1485 returned_value->modifiers = 0;
|
|
|
1486 }
|
|
|
1487 else if (CONSP (spec))
|
|
|
1488 {
|
|
|
1489 unsigned int modifiers = 0;
|
|
|
1490 Lisp_Object keysym = Qnil;
|
|
|
1491 Lisp_Object rest = spec;
|
|
|
1492
|
|
|
1493 /* First, parse out the leading modifier symbols. */
|
|
|
1494 while (CONSP (rest))
|
|
|
1495 {
|
|
|
1496 unsigned int modifier;
|
|
|
1497
|
|
|
1498 keysym = XCAR (rest);
|
|
|
1499 modifier = bucky_sym_to_bucky_bit (keysym);
|
|
|
1500 modifiers |= modifier;
|
|
|
1501 if (!NILP (XCDR (rest)))
|
|
|
1502 {
|
|
|
1503 if (! modifier)
|
|
|
1504 signal_simple_error ("unknown modifier", keysym);
|
|
|
1505 }
|
|
|
1506 else
|
|
|
1507 {
|
|
|
1508 if (modifier)
|
|
|
1509 signal_simple_error ("nothing but modifiers here",
|
|
|
1510 spec);
|
|
|
1511 }
|
|
|
1512 rest = XCDR (rest);
|
|
|
1513 QUIT;
|
|
|
1514 }
|
|
|
1515 if (!NILP (rest))
|
|
|
1516 signal_simple_error ("dotted list", spec);
|
|
|
1517
|
|
70
|
1518 define_key_check_and_coerce_keysym (spec, &keysym, modifiers);
|
|
0
|
1519 returned_value->keysym = keysym;
|
|
|
1520 returned_value->modifiers = modifiers;
|
|
|
1521 }
|
|
|
1522 else
|
|
|
1523 {
|
|
|
1524 signal_simple_error ("unknown key-sequence specifier",
|
|
|
1525 spec);
|
|
|
1526 }
|
|
|
1527 }
|
|
|
1528
|
|
|
1529 /* Used by character-to-event */
|
|
|
1530 void
|
|
|
1531 key_desc_list_to_event (Lisp_Object list, Lisp_Object event,
|
|
|
1532 int allow_menu_events)
|
|
|
1533 {
|
|
|
1534 struct key_data raw_key;
|
|
|
1535
|
|
|
1536 if (allow_menu_events &&
|
|
|
1537 CONSP (list) &&
|
|
|
1538 /* #### where the hell does this come from? */
|
|
|
1539 EQ (XCAR (list), Qmenu_selection))
|
|
|
1540 {
|
|
|
1541 Lisp_Object fn, arg;
|
|
|
1542 if (! NILP (Fcdr (Fcdr (list))))
|
|
|
1543 signal_simple_error ("invalid menu event desc", list);
|
|
|
1544 arg = Fcar (Fcdr (list));
|
|
|
1545 if (SYMBOLP (arg))
|
|
|
1546 fn = Qcall_interactively;
|
|
|
1547 else
|
|
|
1548 fn = Qeval;
|
|
|
1549 XSETFRAME (XEVENT (event)->channel, selected_frame ());
|
|
|
1550 XEVENT (event)->event_type = misc_user_event;
|
|
|
1551 XEVENT (event)->event.eval.function = fn;
|
|
|
1552 XEVENT (event)->event.eval.object = arg;
|
|
|
1553 return;
|
|
|
1554 }
|
|
|
1555
|
|
|
1556 define_key_parser (list, &raw_key);
|
|
|
1557
|
|
|
1558 if (EQ (raw_key.keysym, Qbutton0) || EQ (raw_key.keysym, Qbutton0up) ||
|
|
|
1559 EQ (raw_key.keysym, Qbutton1) || EQ (raw_key.keysym, Qbutton1up) ||
|
|
|
1560 EQ (raw_key.keysym, Qbutton2) || EQ (raw_key.keysym, Qbutton2up) ||
|
|
|
1561 EQ (raw_key.keysym, Qbutton3) || EQ (raw_key.keysym, Qbutton3up) ||
|
|
|
1562 EQ (raw_key.keysym, Qbutton4) || EQ (raw_key.keysym, Qbutton4up) ||
|
|
|
1563 EQ (raw_key.keysym, Qbutton5) || EQ (raw_key.keysym, Qbutton5up) ||
|
|
|
1564 EQ (raw_key.keysym, Qbutton6) || EQ (raw_key.keysym, Qbutton6up) ||
|
|
197
|
1565 EQ (raw_key.keysym, Qbutton7) || EQ (raw_key.keysym, Qbutton7up)
|
|
249
|
1566 #if defined(HAVE_OFFIX_DND) || defined(HAVE_MS_WINDOWS)
|
|
197
|
1567 || EQ (raw_key.keysym, Qdrop0) || EQ (raw_key.keysym, Qdrop1) ||
|
|
|
1568 EQ (raw_key.keysym, Qdrop2) || EQ (raw_key.keysym, Qdrop3) ||
|
|
|
1569 EQ (raw_key.keysym, Qdrop4) || EQ (raw_key.keysym, Qdrop5) ||
|
|
|
1570 EQ (raw_key.keysym, Qdrop6) || EQ (raw_key.keysym, Qdrop7)
|
|
|
1571 #endif
|
|
|
1572 )
|
|
0
|
1573 error ("Mouse-clicks can't appear in saved keyboard macros.");
|
|
|
1574
|
|
|
1575 XEVENT (event)->channel = Vselected_console;
|
|
|
1576 XEVENT (event)->event_type = key_press_event;
|
|
|
1577 XEVENT (event)->event.key.keysym = raw_key.keysym;
|
|
|
1578 XEVENT (event)->event.key.modifiers = raw_key.modifiers;
|
|
|
1579 }
|
|
|
1580
|
|
|
1581
|
|
|
1582 int
|
|
|
1583 event_matches_key_specifier_p (struct Lisp_Event *event,
|
|
|
1584 Lisp_Object key_specifier)
|
|
|
1585 {
|
|
|
1586 Lisp_Object event2;
|
|
|
1587 int retval;
|
|
|
1588 struct gcpro gcpro1;
|
|
|
1589
|
|
|
1590 if (event->event_type != key_press_event || NILP (key_specifier) ||
|
|
70
|
1591 (INTP (key_specifier) && !CHAR_INTP (key_specifier)))
|
|
0
|
1592 return 0;
|
|
|
1593
|
|
|
1594 /* if the specifier is an integer such as 27, then it should match
|
|
|
1595 both of the events 'escape' and 'control ['. Calling
|
|
|
1596 Fcharacter_to_event() will only match 'escape'. */
|
|
70
|
1597 if (CHAR_OR_CHAR_INTP (key_specifier))
|
|
|
1598 return (XCHAR_OR_CHAR_INT (key_specifier)
|
|
|
1599 == event_to_character (event, 0, 0, 0));
|
|
0
|
1600
|
|
|
1601 /* Otherwise, we cannot call event_to_character() because we may
|
|
|
1602 be dealing with non-ASCII keystrokes. In any case, if I ask
|
|
|
1603 for 'control [' then I should get exactly that, and not
|
|
|
1604 'escape'.
|
|
|
1605
|
|
|
1606 However, we have to behave differently on TTY's, where 'control ['
|
|
|
1607 is silently converted into 'escape' by the keyboard driver.
|
|
|
1608 In this case, ASCII is the only thing we know about, so we have
|
|
|
1609 to compare the ASCII values. */
|
|
|
1610
|
|
|
1611 GCPRO1 (event2);
|
|
189
|
1612 event2 = Fmake_event (Qnil, Qnil);
|
|
0
|
1613 Fcharacter_to_event (key_specifier, event2, Qnil, Qnil);
|
|
|
1614 if (XEVENT (event2)->event_type != key_press_event)
|
|
|
1615 retval = 0;
|
|
|
1616 else if (CONSOLE_TTY_P (XCONSOLE (EVENT_CHANNEL (event))))
|
|
|
1617 {
|
|
|
1618 int ch1, ch2;
|
|
|
1619
|
|
|
1620 ch1 = event_to_character (event, 0, 0, 0);
|
|
|
1621 ch2 = event_to_character (XEVENT (event2), 0, 0, 0);
|
|
|
1622 retval = (ch1 >= 0 && ch2 >= 0 && ch1 == ch2);
|
|
|
1623 }
|
|
|
1624 else if (EQ (event->event.key.keysym, XEVENT (event2)->event.key.keysym) &&
|
|
|
1625 event->event.key.modifiers == XEVENT (event2)->event.key.modifiers)
|
|
|
1626 retval = 1;
|
|
|
1627 else
|
|
|
1628 retval = 0;
|
|
|
1629 Fdeallocate_event (event2);
|
|
|
1630 UNGCPRO;
|
|
|
1631 return retval;
|
|
|
1632 }
|
|
|
1633
|
|
|
1634 static int
|
|
|
1635 meta_prefix_char_p (CONST struct key_data *key)
|
|
|
1636 {
|
|
|
1637 struct Lisp_Event event;
|
|
|
1638
|
|
|
1639 event.event_type = key_press_event;
|
|
|
1640 event.channel = Vselected_console;
|
|
|
1641 event.event.key.keysym = key->keysym;
|
|
|
1642 event.event.key.modifiers = key->modifiers;
|
|
|
1643 return event_matches_key_specifier_p (&event, Vmeta_prefix_char);
|
|
|
1644 }
|
|
|
1645
|
|
20
|
1646 DEFUN ("event-matches-key-specifier-p", Fevent_matches_key_specifier_p, 2, 2, 0, /*
|
|
0
|
1647 Return non-nil if EVENT matches KEY-SPECIFIER.
|
|
|
1648 This can be useful, e.g., to determine if the user pressed `help-char' or
|
|
|
1649 `quit-char'.
|
|
20
|
1650 */
|
|
|
1651 (event, key_specifier))
|
|
0
|
1652 {
|
|
|
1653 CHECK_LIVE_EVENT (event);
|
|
|
1654 return (event_matches_key_specifier_p (XEVENT (event), key_specifier)
|
|
|
1655 ? Qt : Qnil);
|
|
|
1656 }
|
|
|
1657
|
|
|
1658 /* ASCII grunge.
|
|
185
|
1659 Given a keysym, return another keysym/modifier pair which could be
|
|
|
1660 considered the same key in an ASCII world. Backspace returns ^H, for
|
|
0
|
1661 example.
|
|
|
1662 */
|
|
|
1663 static void
|
|
|
1664 define_key_alternate_name (struct key_data *key,
|
|
|
1665 struct key_data *returned_value)
|
|
|
1666 {
|
|
|
1667 Lisp_Object keysym = key->keysym;
|
|
|
1668 unsigned int modifiers = key->modifiers;
|
|
|
1669 unsigned int modifiers_sans_control = (modifiers & (~MOD_CONTROL));
|
|
|
1670 unsigned int modifiers_sans_meta = (modifiers & (~MOD_META));
|
|
|
1671 returned_value->keysym = Qnil; /* By default, no "alternate" key */
|
|
|
1672 returned_value->modifiers = 0;
|
|
|
1673 #define MACROLET(k,m) do { returned_value->keysym = (k); \
|
|
|
1674 returned_value->modifiers = (m); \
|
|
|
1675 RETURN__; } while (0)
|
|
|
1676 if (modifiers_sans_meta == MOD_CONTROL)
|
|
|
1677 {
|
|
|
1678 if EQ (keysym, QKspace)
|
|
|
1679 MACROLET (make_char ('@'), modifiers);
|
|
|
1680 else if (!CHARP (keysym))
|
|
|
1681 return;
|
|
|
1682 else switch (XCHAR (keysym))
|
|
|
1683 {
|
|
|
1684 case '@': /* c-@ => c-space */
|
|
|
1685 MACROLET (QKspace, modifiers);
|
|
|
1686 case 'h': /* c-h => backspace */
|
|
|
1687 MACROLET (QKbackspace, modifiers_sans_control);
|
|
|
1688 case 'i': /* c-i => tab */
|
|
|
1689 MACROLET (QKtab, modifiers_sans_control);
|
|
|
1690 case 'j': /* c-j => linefeed */
|
|
|
1691 MACROLET (QKlinefeed, modifiers_sans_control);
|
|
|
1692 case 'm': /* c-m => return */
|
|
|
1693 MACROLET (QKreturn, modifiers_sans_control);
|
|
|
1694 case '[': /* c-[ => escape */
|
|
|
1695 MACROLET (QKescape, modifiers_sans_control);
|
|
|
1696 default:
|
|
|
1697 return;
|
|
|
1698 }
|
|
|
1699 }
|
|
|
1700 else if (modifiers_sans_meta != 0)
|
|
|
1701 return;
|
|
|
1702 else if (EQ (keysym, QKbackspace)) /* backspace => c-h */
|
|
|
1703 MACROLET (make_char ('h'), (modifiers | MOD_CONTROL));
|
|
|
1704 else if (EQ (keysym, QKtab)) /* tab => c-i */
|
|
|
1705 MACROLET (make_char ('i'), (modifiers | MOD_CONTROL));
|
|
|
1706 else if (EQ (keysym, QKlinefeed)) /* linefeed => c-j */
|
|
|
1707 MACROLET (make_char ('j'), (modifiers | MOD_CONTROL));
|
|
|
1708 else if (EQ (keysym, QKreturn)) /* return => c-m */
|
|
|
1709 MACROLET (make_char ('m'), (modifiers | MOD_CONTROL));
|
|
|
1710 else if (EQ (keysym, QKescape)) /* escape => c-[ */
|
|
|
1711 MACROLET (make_char ('['), (modifiers | MOD_CONTROL));
|
|
|
1712 else
|
|
|
1713 return;
|
|
|
1714 #undef MACROLET
|
|
|
1715 }
|
|
|
1716
|
|
|
1717
|
|
|
1718 static void
|
|
|
1719 ensure_meta_prefix_char_keymapp (Lisp_Object keys, int indx,
|
|
|
1720 Lisp_Object keymap)
|
|
|
1721 {
|
|
|
1722 /* This function can GC */
|
|
|
1723 Lisp_Object new_keys;
|
|
|
1724 int i;
|
|
|
1725 Lisp_Object mpc_binding;
|
|
|
1726 struct key_data meta_key;
|
|
|
1727
|
|
|
1728 if (NILP (Vmeta_prefix_char) ||
|
|
70
|
1729 (INTP (Vmeta_prefix_char) && !CHAR_INTP (Vmeta_prefix_char)))
|
|
0
|
1730 return;
|
|
|
1731
|
|
|
1732 define_key_parser (Vmeta_prefix_char, &meta_key);
|
|
|
1733 mpc_binding = keymap_lookup_1 (keymap, &meta_key, 0);
|
|
|
1734 if (NILP (mpc_binding) || !NILP (Fkeymapp (mpc_binding)))
|
|
|
1735 return;
|
|
|
1736
|
|
|
1737 if (indx == 0)
|
|
|
1738 new_keys = keys;
|
|
|
1739 else if (STRINGP (keys))
|
|
|
1740 new_keys = Fsubstring (keys, Qzero, make_int (indx));
|
|
|
1741 else if (VECTORP (keys))
|
|
|
1742 {
|
|
|
1743 new_keys = make_vector (indx, Qnil);
|
|
|
1744 for (i = 0; i < indx; i++)
|
|
173
|
1745 XVECTOR_DATA (new_keys) [i] = XVECTOR_DATA (keys) [i];
|
|
0
|
1746 }
|
|
|
1747 else
|
|
|
1748 abort ();
|
|
267
|
1749
|
|
0
|
1750 if (EQ (keys, new_keys))
|
|
267
|
1751 error_with_frob (mpc_binding,
|
|
|
1752 "can't bind %s: %s has a non-keymap binding",
|
|
|
1753 (char *) XSTRING_DATA (Fkey_description (keys)),
|
|
|
1754 (char *) XSTRING_DATA (Fsingle_key_description
|
|
|
1755 (Vmeta_prefix_char)));
|
|
0
|
1756 else
|
|
267
|
1757 error_with_frob (mpc_binding,
|
|
|
1758 "can't bind %s: %s %s has a non-keymap binding",
|
|
|
1759 (char *) XSTRING_DATA (Fkey_description (keys)),
|
|
|
1760 (char *) XSTRING_DATA (Fkey_description (new_keys)),
|
|
|
1761 (char *) XSTRING_DATA (Fsingle_key_description
|
|
|
1762 (Vmeta_prefix_char)));
|
|
0
|
1763 }
|
|
|
1764
|
|
20
|
1765 DEFUN ("define-key", Fdefine_key, 3, 3, 0, /*
|
|
0
|
1766 Define key sequence KEYS, in KEYMAP, as DEF.
|
|
|
1767 KEYMAP is a keymap object.
|
|
|
1768 KEYS is the sequence of keystrokes to bind, described below.
|
|
|
1769 DEF is anything that can be a key's definition:
|
|
|
1770 nil (means key is undefined in this keymap);
|
|
|
1771 a command (a Lisp function suitable for interactive calling);
|
|
|
1772 a string or key sequence vector (treated as a keyboard macro);
|
|
|
1773 a keymap (to define a prefix key);
|
|
|
1774 a symbol; when the key is looked up, the symbol will stand for its
|
|
|
1775 function definition, that should at that time be one of the above,
|
|
|
1776 or another symbol whose function definition is used, and so on.
|
|
|
1777 a cons (STRING . DEFN), meaning that DEFN is the definition
|
|
|
1778 (DEFN should be a valid definition in its own right);
|
|
|
1779 or a cons (KEYMAP . CHAR), meaning use definition of CHAR in map KEYMAP.
|
|
|
1780
|
|
|
1781 Contrary to popular belief, the world is not ASCII. When running under a
|
|
|
1782 window manager, XEmacs can tell the difference between, for example, the
|
|
|
1783 keystrokes control-h, control-shift-h, and backspace. You can, in fact,
|
|
|
1784 bind different commands to each of these.
|
|
|
1785
|
|
|
1786 A `key sequence' is a set of keystrokes. A `keystroke' is a keysym and some
|
|
|
1787 set of modifiers (such as control and meta). A `keysym' is what is printed
|
|
|
1788 on the keys on your keyboard.
|
|
|
1789
|
|
|
1790 A keysym may be represented by a symbol, or (if and only if it is equivalent
|
|
|
1791 to an ASCII character in the range 32 - 255) by a character or its equivalent
|
|
|
1792 ASCII code. The `A' key may be represented by the symbol `A', the character
|
|
|
1793 `?A', or by the number 65. The `break' key may be represented only by the
|
|
|
1794 symbol `break'.
|
|
|
1795
|
|
|
1796 A keystroke may be represented by a list: the last element of the list
|
|
|
1797 is the key (a symbol, character, or number, as above) and the
|
|
|
1798 preceding elements are the symbolic names of modifier keys (control,
|
|
|
1799 meta, super, hyper, alt, and shift). Thus, the sequence control-b is
|
|
|
1800 represented by the forms `(control b)', `(control ?b)', and `(control
|
|
|
1801 98)'. A keystroke may also be represented by an event object, as
|
|
|
1802 returned by the `next-command-event' and `read-key-sequence'
|
|
|
1803 functions.
|
|
|
1804
|
|
|
1805 Note that in this context, the keystroke `control-b' is *not* represented
|
|
|
1806 by the number 2 (the ASCII code for ^B) or the character `?\^B'. See below.
|
|
|
1807
|
|
|
1808 The `shift' modifier is somewhat of a special case. You should not (and
|
|
|
1809 cannot) use `(meta shift a)' to mean `(meta A)', since for characters that
|
|
|
1810 have ASCII equivalents, the state of the shift key is implicit in the
|
|
|
1811 keysym (a vs. A). You also cannot say `(shift =)' to mean `+', as that
|
|
|
1812 sort of thing varies from keyboard to keyboard. The shift modifier is for
|
|
|
1813 use only with characters that do not have a second keysym on the same key,
|
|
|
1814 such as `backspace' and `tab'.
|
|
|
1815
|
|
|
1816 A key sequence is a vector of keystrokes. As a degenerate case, elements
|
|
|
1817 of this vector may also be keysyms if they have no modifiers. That is,
|
|
|
1818 the `A' keystroke is represented by all of these forms:
|
|
|
1819 A ?A 65 (A) (?A) (65)
|
|
|
1820 [A] [?A] [65] [(A)] [(?A)] [(65)]
|
|
185
|
1821
|
|
0
|
1822 the `control-a' keystroke is represented by these forms:
|
|
|
1823 (control A) (control ?A) (control 65)
|
|
|
1824 [(control A)] [(control ?A)] [(control 65)]
|
|
|
1825 the key sequence `control-c control-a' is represented by these forms:
|
|
|
1826 [(control c) (control a)] [(control ?c) (control ?a)]
|
|
|
1827 [(control 99) (control 65)] etc.
|
|
|
1828
|
|
|
1829 Mouse button clicks work just like keypresses: (control button1) means
|
|
|
1830 pressing the left mouse button while holding down the control key.
|
|
|
1831 \[(control c) (shift button3)] means control-c, hold shift, click right.
|
|
|
1832
|
|
|
1833 Commands may be bound to the mouse-button up-stroke rather than the down-
|
|
|
1834 stroke as well. `button1' means the down-stroke, and `button1up' means the
|
|
|
1835 up-stroke. Different commands may be bound to the up and down strokes,
|
|
|
1836 though that is probably not what you want, so be careful.
|
|
|
1837
|
|
|
1838 For backward compatibility, a key sequence may also be represented by a
|
|
|
1839 string. In this case, it represents the key sequence(s) that would
|
|
|
1840 produce that sequence of ASCII characters in a purely ASCII world. For
|
|
185
|
1841 example, a string containing the ASCII backspace character, "\\^H", would
|
|
0
|
1842 represent two key sequences: `(control h)' and `backspace'. Binding a
|
|
|
1843 command to this will actually bind both of those key sequences. Likewise
|
|
|
1844 for the following pairs:
|
|
|
1845
|
|
|
1846 control h backspace
|
|
|
1847 control i tab
|
|
|
1848 control m return
|
|
|
1849 control j linefeed
|
|
|
1850 control [ escape
|
|
|
1851 control @ control space
|
|
|
1852
|
|
|
1853 After binding a command to two key sequences with a form like
|
|
|
1854
|
|
185
|
1855 (define-key global-map "\\^X\\^I" \'command-1)
|
|
0
|
1856
|
|
|
1857 it is possible to redefine only one of those sequences like so:
|
|
|
1858
|
|
|
1859 (define-key global-map [(control x) (control i)] \'command-2)
|
|
|
1860 (define-key global-map [(control x) tab] \'command-3)
|
|
|
1861
|
|
|
1862 Of course, all of this applies only when running under a window system. If
|
|
|
1863 you're talking to XEmacs through a TTY connection, you don't get any of
|
|
|
1864 these features.
|
|
20
|
1865 */
|
|
|
1866 (keymap, keys, def))
|
|
0
|
1867 {
|
|
|
1868 /* This function can GC */
|
|
|
1869 int idx;
|
|
|
1870 int metized = 0;
|
|
173
|
1871 int len;
|
|
0
|
1872 int ascii_hack;
|
|
|
1873 struct gcpro gcpro1, gcpro2, gcpro3;
|
|
|
1874
|
|
|
1875 if (VECTORP (keys))
|
|
173
|
1876 len = XVECTOR_LENGTH (keys);
|
|
0
|
1877 else if (STRINGP (keys))
|
|
173
|
1878 len = string_char_length (XSTRING (keys));
|
|
70
|
1879 else if (CHAR_OR_CHAR_INTP (keys) || SYMBOLP (keys) || CONSP (keys))
|
|
0
|
1880 {
|
|
|
1881 if (!CONSP (keys)) keys = list1 (keys);
|
|
173
|
1882 len = 1;
|
|
0
|
1883 keys = make_vector (1, keys); /* this is kinda sleazy. */
|
|
|
1884 }
|
|
|
1885 else
|
|
|
1886 {
|
|
|
1887 keys = wrong_type_argument (Qsequencep, keys);
|
|
173
|
1888 len = XINT (Flength (keys));
|
|
0
|
1889 }
|
|
173
|
1890 if (len == 0)
|
|
|
1891 return Qnil;
|
|
0
|
1892
|
|
|
1893 GCPRO3 (keymap, keys, def);
|
|
|
1894
|
|
|
1895 /* ASCII grunge.
|
|
|
1896 When the user defines a key which, in a strictly ASCII world, would be
|
|
|
1897 produced by two different keys (^J and linefeed, or ^H and backspace,
|
|
|
1898 for example) then the binding will be made for both keysyms.
|
|
|
1899
|
|
|
1900 This is done if the user binds a command to a string, as in
|
|
|
1901 (define-key map "\^H" 'something), but not when using one of the new
|
|
|
1902 syntaxes, like (define-key map '(control h) 'something).
|
|
|
1903 */
|
|
|
1904 ascii_hack = (STRINGP (keys));
|
|
|
1905
|
|
|
1906 keymap = get_keymap (keymap, 1, 1);
|
|
|
1907
|
|
|
1908 idx = 0;
|
|
|
1909 while (1)
|
|
|
1910 {
|
|
|
1911 Lisp_Object c;
|
|
|
1912 struct key_data raw_key1;
|
|
|
1913 struct key_data raw_key2;
|
|
|
1914
|
|
|
1915 if (STRINGP (keys))
|
|
|
1916 c = make_char (string_char (XSTRING (keys), idx));
|
|
|
1917 else
|
|
173
|
1918 c = XVECTOR_DATA (keys) [idx];
|
|
0
|
1919
|
|
|
1920 define_key_parser (c, &raw_key1);
|
|
|
1921
|
|
|
1922 if (!metized && ascii_hack && meta_prefix_char_p (&raw_key1))
|
|
|
1923 {
|
|
173
|
1924 if (idx == (len - 1))
|
|
0
|
1925 {
|
|
|
1926 /* This is a hack to prevent a binding for the meta-prefix-char
|
|
|
1927 from being made in a map which already has a non-empty "meta"
|
|
|
1928 submap. That is, we can't let both "escape" and "meta" have
|
|
|
1929 a binding in the same keymap. This implies that the idiom
|
|
|
1930 (define-key my-map "\e" my-escape-map)
|
|
|
1931 (define-key my-escape-map "a" 'my-command)
|
|
|
1932 no longer works. That's ok. Instead the luser should do
|
|
|
1933 (define-key my-map "\ea" 'my-command)
|
|
|
1934 or, more correctly
|
|
|
1935 (define-key my-map "\M-a" 'my-command)
|
|
|
1936 and then perhaps
|
|
|
1937 (defvar my-escape-map (lookup-key my-map "\e"))
|
|
|
1938 if the luser really wants the map in a variable.
|
|
|
1939 */
|
|
|
1940 Lisp_Object mmap;
|
|
|
1941 struct gcpro ngcpro1;
|
|
|
1942
|
|
|
1943 NGCPRO1 (c);
|
|
|
1944 mmap = Fgethash (MAKE_MODIFIER_HASH_KEY (MOD_META),
|
|
|
1945 XKEYMAP (keymap)->table, Qnil);
|
|
|
1946 if (!NILP (mmap)
|
|
|
1947 && keymap_fullness (mmap) != 0)
|
|
|
1948 {
|
|
|
1949 Lisp_Object desc
|
|
|
1950 = Fsingle_key_description (Vmeta_prefix_char);
|
|
|
1951 signal_simple_error_2
|
|
|
1952 ("Map contains meta-bindings, can't bind", desc, keymap);
|
|
|
1953 }
|
|
|
1954 NUNGCPRO;
|
|
|
1955 }
|
|
|
1956 else
|
|
|
1957 {
|
|
|
1958 metized = 1;
|
|
|
1959 idx++;
|
|
|
1960 continue;
|
|
|
1961 }
|
|
|
1962 }
|
|
|
1963
|
|
|
1964 if (ascii_hack)
|
|
|
1965 define_key_alternate_name (&raw_key1, &raw_key2);
|
|
|
1966 else
|
|
|
1967 {
|
|
|
1968 raw_key2.keysym = Qnil;
|
|
|
1969 raw_key2.modifiers = 0;
|
|
|
1970 }
|
|
185
|
1971
|
|
0
|
1972 if (metized)
|
|
|
1973 {
|
|
|
1974 raw_key1.modifiers |= MOD_META;
|
|
|
1975 raw_key2.modifiers |= MOD_META;
|
|
|
1976 metized = 0;
|
|
|
1977 }
|
|
|
1978
|
|
|
1979 /* This crap is to make sure that someone doesn't bind something like
|
|
|
1980 "C-x M-a" while "C-x ESC" has a non-keymap binding. */
|
|
|
1981 if (raw_key1.modifiers & MOD_META)
|
|
|
1982 ensure_meta_prefix_char_keymapp (keys, idx, keymap);
|
|
|
1983
|
|
173
|
1984 if (++idx == len)
|
|
0
|
1985 {
|
|
|
1986 keymap_store (keymap, &raw_key1, def);
|
|
|
1987 if (ascii_hack && !NILP (raw_key2.keysym))
|
|
|
1988 keymap_store (keymap, &raw_key2, def);
|
|
|
1989 UNGCPRO;
|
|
|
1990 return def;
|
|
|
1991 }
|
|
185
|
1992
|
|
0
|
1993 {
|
|
|
1994 Lisp_Object cmd;
|
|
|
1995 struct gcpro ngcpro1;
|
|
|
1996 NGCPRO1 (c);
|
|
|
1997
|
|
|
1998 cmd = keymap_lookup_1 (keymap, &raw_key1, 0);
|
|
|
1999 if (NILP (cmd))
|
|
|
2000 {
|
|
|
2001 cmd = Fmake_sparse_keymap (Qnil);
|
|
|
2002 XKEYMAP (cmd)->name /* for debugging */
|
|
|
2003 = list2 (make_key_description (&raw_key1, 1), keymap);
|
|
|
2004 keymap_store (keymap, &raw_key1, cmd);
|
|
|
2005 }
|
|
|
2006 if (NILP (Fkeymapp (cmd)))
|
|
|
2007 signal_simple_error_2 ("invalid prefix keys in sequence",
|
|
|
2008 c, keys);
|
|
|
2009
|
|
|
2010 if (ascii_hack && !NILP (raw_key2.keysym) &&
|
|
|
2011 NILP (keymap_lookup_1 (keymap, &raw_key2, 0)))
|
|
|
2012 keymap_store (keymap, &raw_key2, cmd);
|
|
|
2013
|
|
|
2014 keymap = get_keymap (cmd, 1, 1);
|
|
|
2015 NUNGCPRO;
|
|
|
2016 }
|
|
|
2017 }
|
|
|
2018 }
|
|
|
2019
|
|
|
2020
|
|
|
2021 /************************************************************************/
|
|
|
2022 /* Looking up keys in keymaps */
|
|
|
2023 /************************************************************************/
|
|
|
2024
|
|
185
|
2025 /* We need a very fast (i.e., non-consing) version of lookup-key in order
|
|
2
|
2026 to make where-is-internal really fly. */
|
|
0
|
2027
|
|
|
2028 struct raw_lookup_key_mapper_closure
|
|
2
|
2029 {
|
|
|
2030 int remaining;
|
|
|
2031 CONST struct key_data *raw_keys;
|
|
|
2032 int raw_keys_count;
|
|
|
2033 int keys_so_far;
|
|
|
2034 int accept_default;
|
|
|
2035 };
|
|
0
|
2036
|
|
|
2037 static Lisp_Object raw_lookup_key_mapper (Lisp_Object k, void *);
|
|
|
2038
|
|
|
2039 /* Caller should gc-protect args (keymaps may autoload) */
|
|
|
2040 static Lisp_Object
|
|
|
2041 raw_lookup_key (Lisp_Object keymap,
|
|
|
2042 CONST struct key_data *raw_keys, int raw_keys_count,
|
|
|
2043 int keys_so_far, int accept_default)
|
|
|
2044 {
|
|
|
2045 /* This function can GC */
|
|
|
2046 struct raw_lookup_key_mapper_closure c;
|
|
|
2047 c.remaining = raw_keys_count - 1;
|
|
|
2048 c.raw_keys = raw_keys;
|
|
|
2049 c.raw_keys_count = raw_keys_count;
|
|
|
2050 c.keys_so_far = keys_so_far;
|
|
|
2051 c.accept_default = accept_default;
|
|
|
2052
|
|
173
|
2053 return traverse_keymaps (keymap, Qnil, raw_lookup_key_mapper, &c);
|
|
0
|
2054 }
|
|
|
2055
|
|
|
2056 static Lisp_Object
|
|
|
2057 raw_lookup_key_mapper (Lisp_Object k, void *arg)
|
|
|
2058 {
|
|
|
2059 /* This function can GC */
|
|
185
|
2060 struct raw_lookup_key_mapper_closure *c =
|
|
|
2061 (struct raw_lookup_key_mapper_closure *) arg;
|
|
0
|
2062 int accept_default = c->accept_default;
|
|
|
2063 int remaining = c->remaining;
|
|
|
2064 int keys_so_far = c->keys_so_far;
|
|
|
2065 CONST struct key_data *raw_keys = c->raw_keys;
|
|
|
2066 Lisp_Object cmd;
|
|
185
|
2067
|
|
0
|
2068 if (! meta_prefix_char_p (&(raw_keys[0])))
|
|
|
2069 {
|
|
|
2070 /* Normal case: every case except the meta-hack (see below). */
|
|
|
2071 cmd = keymap_lookup_1 (k, &(raw_keys[0]), accept_default);
|
|
185
|
2072
|
|
0
|
2073 if (remaining == 0)
|
|
|
2074 /* Return whatever we found if we're out of keys */
|
|
|
2075 ;
|
|
|
2076 else if (NILP (cmd))
|
|
|
2077 /* Found nothing (though perhaps parent map may have binding) */
|
|
|
2078 ;
|
|
|
2079 else if (NILP (Fkeymapp (cmd)))
|
|
|
2080 /* Didn't find a keymap, and we have more keys.
|
|
|
2081 * Return a fixnum to indicate that keys were too long.
|
|
|
2082 */
|
|
|
2083 cmd = make_int (keys_so_far + 1);
|
|
|
2084 else
|
|
185
|
2085 cmd = raw_lookup_key (cmd, raw_keys + 1, remaining,
|
|
0
|
2086 keys_so_far + 1, accept_default);
|
|
|
2087 }
|
|
|
2088 else
|
|
|
2089 {
|
|
|
2090 /* This is a hack so that looking up a key-sequence whose last
|
|
|
2091 * element is the meta-prefix-char will return the keymap that
|
|
|
2092 * the "meta" keys are stored in, if there is no binding for
|
|
|
2093 * the meta-prefix-char (and if this map has a "meta" submap).
|
|
|
2094 * If this map doesnt have a "meta" submap, then the
|
|
|
2095 * meta-prefix-char is looked up just like any other key.
|
|
|
2096 */
|
|
|
2097 if (remaining == 0)
|
|
|
2098 {
|
|
|
2099 /* First look for the prefix-char directly */
|
|
|
2100 cmd = keymap_lookup_1 (k, &(raw_keys[0]), accept_default);
|
|
|
2101 if (NILP (cmd))
|
|
|
2102 {
|
|
185
|
2103 /* Do kludgy return of the meta-map */
|
|
0
|
2104 cmd = Fgethash (MAKE_MODIFIER_HASH_KEY (MOD_META),
|
|
|
2105 XKEYMAP (k)->table, Qnil);
|
|
|
2106 }
|
|
|
2107 }
|
|
|
2108 else
|
|
|
2109 {
|
|
|
2110 /* Search for the prefix-char-prefixed sequence directly */
|
|
|
2111 cmd = keymap_lookup_1 (k, &(raw_keys[0]), accept_default);
|
|
|
2112 cmd = get_keymap (cmd, 0, 1);
|
|
|
2113 if (!NILP (cmd))
|
|
185
|
2114 cmd = raw_lookup_key (cmd, raw_keys + 1, remaining,
|
|
0
|
2115 keys_so_far + 1, accept_default);
|
|
|
2116 else if ((raw_keys[1].modifiers & MOD_META) == 0)
|
|
|
2117 {
|
|
|
2118 struct key_data metified;
|
|
|
2119 metified.keysym = raw_keys[1].keysym;
|
|
|
2120 metified.modifiers = raw_keys[1].modifiers | MOD_META;
|
|
|
2121
|
|
|
2122 /* Search for meta-next-char sequence directly */
|
|
|
2123 cmd = keymap_lookup_1 (k, &metified, accept_default);
|
|
|
2124 if (remaining == 1)
|
|
|
2125 ;
|
|
|
2126 else
|
|
|
2127 {
|
|
|
2128 cmd = get_keymap (cmd, 0, 1);
|
|
|
2129 if (!NILP (cmd))
|
|
|
2130 cmd = raw_lookup_key (cmd, raw_keys + 2, remaining - 1,
|
|
|
2131 keys_so_far + 2,
|
|
|
2132 accept_default);
|
|
|
2133 }
|
|
|
2134 }
|
|
|
2135 }
|
|
|
2136 }
|
|
|
2137 if (accept_default && NILP (cmd))
|
|
|
2138 cmd = XKEYMAP (k)->default_binding;
|
|
173
|
2139 return cmd;
|
|
0
|
2140 }
|
|
|
2141
|
|
|
2142 /* Value is number if `keys' is too long; NIL if valid but has no definition.*/
|
|
|
2143 /* Caller should gc-protect arguments */
|
|
|
2144 static Lisp_Object
|
|
|
2145 lookup_keys (Lisp_Object keymap, int nkeys, Lisp_Object *keys,
|
|
|
2146 int accept_default)
|
|
|
2147 {
|
|
|
2148 /* This function can GC */
|
|
|
2149 struct key_data kkk[20];
|
|
|
2150 struct key_data *raw_keys;
|
|
|
2151 int i;
|
|
|
2152
|
|
|
2153 if (nkeys == 0)
|
|
|
2154 return Qnil;
|
|
|
2155
|
|
100
|
2156 if (nkeys < (countof (kkk)))
|
|
0
|
2157 raw_keys = kkk;
|
|
|
2158 else
|
|
185
|
2159 raw_keys = alloca_array (struct key_data, nkeys);
|
|
0
|
2160
|
|
|
2161 for (i = 0; i < nkeys; i++)
|
|
|
2162 {
|
|
|
2163 define_key_parser (keys[i], &(raw_keys[i]));
|
|
|
2164 }
|
|
173
|
2165 return raw_lookup_key (keymap, raw_keys, nkeys, 0, accept_default);
|
|
0
|
2166 }
|
|
|
2167
|
|
|
2168 static Lisp_Object
|
|
|
2169 lookup_events (Lisp_Object event_head, int nmaps, Lisp_Object keymaps[],
|
|
|
2170 int accept_default)
|
|
|
2171 {
|
|
|
2172 /* This function can GC */
|
|
|
2173 struct key_data kkk[20];
|
|
|
2174 Lisp_Object event;
|
|
|
2175
|
|
|
2176 int nkeys;
|
|
|
2177 struct key_data *raw_keys;
|
|
|
2178 Lisp_Object tem = Qnil;
|
|
|
2179 struct gcpro gcpro1, gcpro2;
|
|
|
2180 int iii;
|
|
|
2181
|
|
|
2182 CHECK_LIVE_EVENT (event_head);
|
|
|
2183
|
|
|
2184 nkeys = event_chain_count (event_head);
|
|
|
2185
|
|
|
2186 if (nkeys < (countof (kkk)))
|
|
|
2187 raw_keys = kkk;
|
|
|
2188 else
|
|
185
|
2189 raw_keys = alloca_array (struct key_data, nkeys);
|
|
0
|
2190
|
|
|
2191 nkeys = 0;
|
|
|
2192 EVENT_CHAIN_LOOP (event, event_head)
|
|
|
2193 define_key_parser (event, &(raw_keys[nkeys++]));
|
|
|
2194 GCPRO2 (keymaps[0], event_head);
|
|
|
2195 gcpro1.nvars = nmaps;
|
|
|
2196 /* ####raw_keys[].keysym slots aren't gc-protected. We rely (but shouldn't)
|
|
|
2197 * on somebody else somewhere (obarray) having a pointer to all keysyms. */
|
|
|
2198 for (iii = 0; iii < nmaps; iii++)
|
|
|
2199 {
|
|
|
2200 tem = raw_lookup_key (keymaps[iii], raw_keys, nkeys, 0,
|
|
|
2201 accept_default);
|
|
|
2202 if (INTP (tem))
|
|
|
2203 {
|
|
|
2204 /* Too long in some local map means don't look at global map */
|
|
|
2205 tem = Qnil;
|
|
|
2206 break;
|
|
|
2207 }
|
|
|
2208 else if (!NILP (tem))
|
|
|
2209 break;
|
|
|
2210 }
|
|
|
2211 UNGCPRO;
|
|
173
|
2212 return tem;
|
|
0
|
2213 }
|
|
|
2214
|
|
20
|
2215 DEFUN ("lookup-key", Flookup_key, 2, 3, 0, /*
|
|
0
|
2216 In keymap KEYMAP, look up key-sequence KEYS. Return the definition.
|
|
|
2217 Nil is returned if KEYS is unbound. See documentation of `define-key'
|
|
|
2218 for valid key definitions and key-sequence specifications.
|
|
185
|
2219 A number is returned if KEYS is "too long"; that is, the leading
|
|
0
|
2220 characters fail to be a valid sequence of prefix characters in KEYMAP.
|
|
|
2221 The number is how many characters at the front of KEYS
|
|
|
2222 it takes to reach a non-prefix command.
|
|
20
|
2223 */
|
|
|
2224 (keymap, keys, accept_default))
|
|
0
|
2225 {
|
|
|
2226 /* This function can GC */
|
|
|
2227 if (VECTORP (keys))
|
|
|
2228 {
|
|
|
2229 return lookup_keys (keymap,
|
|
173
|
2230 XVECTOR_LENGTH (keys),
|
|
|
2231 XVECTOR_DATA (keys),
|
|
0
|
2232 !NILP (accept_default));
|
|
|
2233 }
|
|
70
|
2234 else if (SYMBOLP (keys) || CHAR_OR_CHAR_INTP (keys) || CONSP (keys))
|
|
0
|
2235 {
|
|
|
2236 return lookup_keys (keymap, 1, &keys,
|
|
|
2237 !NILP (accept_default));
|
|
|
2238 }
|
|
|
2239 else if (!STRINGP (keys))
|
|
|
2240 {
|
|
|
2241 keys = wrong_type_argument (Qsequencep, keys);
|
|
|
2242 return Flookup_key (keymap, keys, accept_default);
|
|
|
2243 }
|
|
2
|
2244 else /* STRINGP (keys) */
|
|
0
|
2245 {
|
|
|
2246 int length = string_char_length (XSTRING (keys));
|
|
|
2247 int i;
|
|
185
|
2248 struct key_data *raw_keys = alloca_array (struct key_data, length);
|
|
0
|
2249 if (length == 0)
|
|
|
2250 return Qnil;
|
|
|
2251
|
|
|
2252 for (i = 0; i < length; i++)
|
|
|
2253 {
|
|
|
2254 Emchar n = string_char (XSTRING (keys), i);
|
|
|
2255 define_key_parser (make_char (n), &(raw_keys[i]));
|
|
|
2256 }
|
|
173
|
2257 return raw_lookup_key (keymap, raw_keys, length, 0,
|
|
|
2258 !NILP (accept_default));
|
|
0
|
2259 }
|
|
|
2260 }
|
|
|
2261
|
|
|
2262 /* Given a key sequence, returns a list of keymaps to search for bindings.
|
|
|
2263 Does all manner of semi-hairy heuristics, like looking in the current
|
|
|
2264 buffer's map before looking in the global map and looking in the local
|
|
|
2265 map of the buffer in which the mouse was clicked in event0 is a click.
|
|
|
2266
|
|
|
2267 It would be kind of nice if this were in Lisp so that this semi-hairy
|
|
|
2268 semi-heuristic command-lookup behaviour could be readily understood and
|
|
|
2269 customised. However, this needs to be pretty fast, or performance of
|
|
|
2270 keyboard macros goes to shit; putting this in lisp slows macros down
|
|
185
|
2271 2-3x. And they're already slower than v18 by 5-6x.
|
|
0
|
2272 */
|
|
|
2273
|
|
|
2274 struct relevant_maps
|
|
|
2275 {
|
|
|
2276 int nmaps;
|
|
|
2277 unsigned int max_maps;
|
|
|
2278 Lisp_Object *maps;
|
|
|
2279 struct gcpro *gcpro;
|
|
|
2280 };
|
|
|
2281
|
|
|
2282 static void get_relevant_extent_keymaps (Lisp_Object pos,
|
|
|
2283 Lisp_Object buffer_or_string,
|
|
|
2284 Lisp_Object glyph,
|
|
|
2285 struct relevant_maps *closure);
|
|
|
2286 static void get_relevant_minor_maps (Lisp_Object buffer,
|
|
|
2287 struct relevant_maps *closure);
|
|
|
2288
|
|
|
2289 static void
|
|
|
2290 relevant_map_push (Lisp_Object map, struct relevant_maps *closure)
|
|
185
|
2291 {
|
|
0
|
2292 unsigned int nmaps = closure->nmaps;
|
|
|
2293
|
|
|
2294 if (!KEYMAPP (map))
|
|
|
2295 return;
|
|
|
2296 closure->nmaps = nmaps + 1;
|
|
|
2297 if (nmaps < closure->max_maps)
|
|
|
2298 {
|
|
|
2299 closure->maps[nmaps] = map;
|
|
|
2300 closure->gcpro->nvars = nmaps;
|
|
|
2301 }
|
|
|
2302 }
|
|
|
2303
|
|
|
2304 static int
|
|
|
2305 get_relevant_keymaps (Lisp_Object keys,
|
|
|
2306 int max_maps, Lisp_Object maps[])
|
|
|
2307 {
|
|
|
2308 /* This function can GC */
|
|
|
2309 Lisp_Object terminal = Qnil;
|
|
|
2310 struct gcpro gcpro1;
|
|
|
2311 struct relevant_maps closure;
|
|
|
2312 struct console *con;
|
|
|
2313
|
|
|
2314 GCPRO1 (*maps);
|
|
|
2315 gcpro1.nvars = 0;
|
|
|
2316 closure.nmaps = 0;
|
|
|
2317 closure.max_maps = max_maps;
|
|
|
2318 closure.maps = maps;
|
|
|
2319 closure.gcpro = &gcpro1;
|
|
|
2320
|
|
|
2321 if (EVENTP (keys))
|
|
|
2322 terminal = event_chain_tail (keys);
|
|
|
2323 else if (VECTORP (keys))
|
|
|
2324 {
|
|
173
|
2325 int len = XVECTOR_LENGTH (keys);
|
|
0
|
2326 if (len > 0)
|
|
173
|
2327 terminal = XVECTOR_DATA (keys)[len - 1];
|
|
0
|
2328 }
|
|
|
2329
|
|
|
2330 if (EVENTP (terminal))
|
|
|
2331 {
|
|
|
2332 CHECK_LIVE_EVENT (terminal);
|
|
|
2333 con = event_console_or_selected (terminal);
|
|
|
2334 }
|
|
|
2335 else
|
|
|
2336 con = XCONSOLE (Vselected_console);
|
|
185
|
2337
|
|
0
|
2338 if (KEYMAPP (con->overriding_terminal_local_map)
|
|
|
2339 || KEYMAPP (Voverriding_local_map))
|
|
|
2340 {
|
|
|
2341 if (KEYMAPP (con->overriding_terminal_local_map))
|
|
|
2342 relevant_map_push (con->overriding_terminal_local_map, &closure);
|
|
|
2343 if (KEYMAPP (Voverriding_local_map))
|
|
|
2344 relevant_map_push (Voverriding_local_map, &closure);
|
|
|
2345 }
|
|
|
2346 else if (!EVENTP (terminal)
|
|
185
|
2347 || (XEVENT (terminal)->event_type != button_press_event
|
|
0
|
2348 && XEVENT (terminal)->event_type != button_release_event))
|
|
|
2349 {
|
|
|
2350 Lisp_Object tem;
|
|
|
2351 XSETBUFFER (tem, current_buffer);
|
|
|
2352 /* It's not a mouse event; order of keymaps searched is:
|
|
|
2353 o keymap of any/all extents under the mouse
|
|
|
2354 o minor-mode maps
|
|
|
2355 o local-map of current-buffer
|
|
|
2356 o global-map
|
|
|
2357 */
|
|
|
2358 /* The terminal element of the lookup may be nil or a keysym.
|
|
|
2359 In those cases we don't want to check for an extent
|
|
|
2360 keymap. */
|
|
|
2361 if (EVENTP (terminal))
|
|
|
2362 {
|
|
|
2363 get_relevant_extent_keymaps (make_int (BUF_PT (current_buffer)),
|
|
|
2364 tem, Qnil, &closure);
|
|
|
2365 }
|
|
|
2366 get_relevant_minor_maps (tem, &closure);
|
|
|
2367
|
|
|
2368 tem = current_buffer->keymap;
|
|
|
2369 if (!NILP (tem))
|
|
|
2370 relevant_map_push (tem, &closure);
|
|
|
2371 }
|
|
|
2372 #ifdef HAVE_WINDOW_SYSTEM
|
|
|
2373 else
|
|
|
2374 {
|
|
|
2375 /* It's a mouse event; order of keymaps searched is:
|
|
|
2376 o local-map of mouse-grabbed-buffer
|
|
|
2377 o keymap of any/all extents under the mouse
|
|
|
2378 if the mouse is over a modeline:
|
|
|
2379 o modeline-map of buffer corresponding to that modeline
|
|
|
2380 o else, local-map of buffer under the mouse
|
|
|
2381 o minor-mode maps
|
|
|
2382 o local-map of current-buffer
|
|
|
2383 o global-map
|
|
|
2384 */
|
|
|
2385 Lisp_Object window = Fevent_window (terminal);
|
|
|
2386
|
|
|
2387 if (BUFFERP (Vmouse_grabbed_buffer))
|
|
|
2388 {
|
|
|
2389 Lisp_Object map = XBUFFER (Vmouse_grabbed_buffer)->keymap;
|
|
|
2390
|
|
|
2391 get_relevant_minor_maps (Vmouse_grabbed_buffer, &closure);
|
|
|
2392 if (!NILP (map))
|
|
|
2393 relevant_map_push (map, &closure);
|
|
|
2394 }
|
|
|
2395
|
|
|
2396 if (!NILP (window))
|
|
|
2397 {
|
|
|
2398 Lisp_Object buffer = Fwindow_buffer (window);
|
|
|
2399
|
|
|
2400 if (!NILP (buffer))
|
|
|
2401 {
|
|
|
2402 if (!NILP (Fevent_over_modeline_p (terminal)))
|
|
|
2403 {
|
|
|
2404 Lisp_Object map = symbol_value_in_buffer (Qmodeline_map,
|
|
|
2405 buffer);
|
|
|
2406
|
|
|
2407 get_relevant_extent_keymaps
|
|
|
2408 (Fevent_modeline_position (terminal),
|
|
|
2409 XBUFFER (buffer)->generated_modeline_string,
|
|
|
2410 /* #### third arg should maybe be a glyph. */
|
|
|
2411 Qnil, &closure);
|
|
|
2412
|
|
|
2413 if (!UNBOUNDP (map) && !NILP (map))
|
|
|
2414 relevant_map_push (get_keymap (map, 1, 1), &closure);
|
|
|
2415 }
|
|
|
2416 else
|
|
|
2417 {
|
|
|
2418 get_relevant_extent_keymaps (Fevent_point (terminal), buffer,
|
|
|
2419 Fevent_glyph_extent (terminal),
|
|
|
2420 &closure);
|
|
|
2421 }
|
|
|
2422
|
|
|
2423 if (!EQ (buffer, Vmouse_grabbed_buffer)) /* already pushed */
|
|
|
2424 {
|
|
114
|
2425 Lisp_Object map = XBUFFER (buffer)->keymap;
|
|
|
2426
|
|
0
|
2427 get_relevant_minor_maps (buffer, &closure);
|
|
114
|
2428 if (!NILP(map))
|
|
|
2429 relevant_map_push (map, &closure);
|
|
0
|
2430 }
|
|
|
2431 }
|
|
|
2432 }
|
|
|
2433 else if (!NILP (Fevent_over_toolbar_p (terminal)))
|
|
|
2434 {
|
|
|
2435 Lisp_Object map = Fsymbol_value (Qtoolbar_map);
|
|
|
2436
|
|
|
2437 if (!UNBOUNDP (map) && !NILP (map))
|
|
|
2438 relevant_map_push (map, &closure);
|
|
|
2439 }
|
|
|
2440 }
|
|
|
2441 #endif /* HAVE_WINDOW_SYSTEM */
|
|
|
2442
|
|
|
2443 {
|
|
|
2444 int nmaps = closure.nmaps;
|
|
|
2445 /* Silently truncate at 100 keymaps to prevent infinite losssage */
|
|
|
2446 if (nmaps >= max_maps && max_maps > 0)
|
|
|
2447 maps[max_maps - 1] = Vcurrent_global_map;
|
|
|
2448 else
|
|
|
2449 maps[nmaps] = Vcurrent_global_map;
|
|
|
2450 UNGCPRO;
|
|
173
|
2451 return nmaps + 1;
|
|
0
|
2452 }
|
|
|
2453 }
|
|
|
2454
|
|
|
2455 /* Returns a set of keymaps extracted from the extents at POS in
|
|
|
2456 BUFFER_OR_STRING. The GLYPH arg, if specified, is one more extent
|
|
|
2457 to look for a keymap in, and if it has one, its keymap will be the
|
|
|
2458 first element in the list returned. This is so we can correctly
|
|
|
2459 search the keymaps associated with glyphs which may be physically
|
|
|
2460 disjoint from their extents: for example, if a glyph is out in the
|
|
|
2461 margin, we should still consult the kemyap of that glyph's extent,
|
|
|
2462 which may not itself be under the mouse.
|
|
|
2463 */
|
|
157
|
2464
|
|
0
|
2465 static void
|
|
|
2466 get_relevant_extent_keymaps (Lisp_Object pos, Lisp_Object buffer_or_string,
|
|
|
2467 Lisp_Object glyph,
|
|
|
2468 struct relevant_maps *closure)
|
|
|
2469 {
|
|
|
2470 /* This function can GC */
|
|
|
2471 /* the glyph keymap, if any, comes first.
|
|
|
2472 (Processing it twice is no big deal: noop.) */
|
|
|
2473 if (!NILP (glyph))
|
|
|
2474 {
|
|
|
2475 Lisp_Object keymap = Fextent_property (glyph, Qkeymap, Qnil);
|
|
|
2476 if (!NILP (keymap))
|
|
|
2477 relevant_map_push (get_keymap (keymap, 1, 1), closure);
|
|
|
2478 }
|
|
185
|
2479
|
|
0
|
2480 /* Next check the extents at the text position, if any */
|
|
|
2481 if (!NILP (pos))
|
|
|
2482 {
|
|
|
2483 Lisp_Object extent;
|
|
195
|
2484 for (extent = Fextent_at (pos, buffer_or_string, Qkeymap, Qnil, Qnil);
|
|
0
|
2485 !NILP (extent);
|
|
195
|
2486 extent = Fextent_at (pos, buffer_or_string, Qkeymap, extent, Qnil))
|
|
0
|
2487 {
|
|
195
|
2488 Lisp_Object keymap = Fextent_property (extent, Qkeymap, Qnil);
|
|
|
2489 if (!NILP (keymap))
|
|
|
2490 relevant_map_push (get_keymap (keymap, 1, 1), closure);
|
|
|
2491 QUIT;
|
|
0
|
2492 }
|
|
|
2493 }
|
|
|
2494 }
|
|
|
2495
|
|
|
2496 static Lisp_Object
|
|
|
2497 minor_mode_keymap_predicate (Lisp_Object assoc, Lisp_Object buffer)
|
|
|
2498 {
|
|
|
2499 /* This function can GC */
|
|
|
2500 if (CONSP (assoc))
|
|
|
2501 {
|
|
|
2502 Lisp_Object sym = XCAR (assoc);
|
|
|
2503 if (SYMBOLP (sym))
|
|
|
2504 {
|
|
|
2505 Lisp_Object val = symbol_value_in_buffer (sym, buffer);
|
|
|
2506 if (!NILP (val) && !UNBOUNDP (val))
|
|
|
2507 {
|
|
|
2508 Lisp_Object map = get_keymap (XCDR (assoc), 0, 1);
|
|
173
|
2509 return map;
|
|
0
|
2510 }
|
|
|
2511 }
|
|
|
2512 }
|
|
173
|
2513 return Qnil;
|
|
0
|
2514 }
|
|
|
2515
|
|
|
2516 static void
|
|
|
2517 get_relevant_minor_maps (Lisp_Object buffer, struct relevant_maps *closure)
|
|
|
2518 {
|
|
|
2519 /* This function can GC */
|
|
|
2520 Lisp_Object alist;
|
|
|
2521
|
|
|
2522 /* Will you ever lose badly if you make this circular! */
|
|
|
2523 for (alist = symbol_value_in_buffer (Qminor_mode_map_alist, buffer);
|
|
|
2524 CONSP (alist);
|
|
|
2525 alist = XCDR (alist))
|
|
|
2526 {
|
|
|
2527 Lisp_Object m = minor_mode_keymap_predicate (XCAR (alist),
|
|
|
2528 buffer);
|
|
|
2529 if (!NILP (m)) relevant_map_push (m, closure);
|
|
|
2530 QUIT;
|
|
|
2531 }
|
|
|
2532 }
|
|
|
2533
|
|
|
2534 /* #### Would map-current-keymaps be a better thing?? */
|
|
20
|
2535 DEFUN ("current-keymaps", Fcurrent_keymaps, 0, 1, 0, /*
|
|
0
|
2536 Return a list of the current keymaps that will be searched for bindings.
|
|
|
2537 This lists keymaps such as the current local map and the minor-mode maps,
|
|
|
2538 but does not list the parents of those keymaps.
|
|
|
2539 EVENT-OR-KEYS controls which keymaps will be listed.
|
|
|
2540 If EVENT-OR-KEYS is a mouse event (or a vector whose last element is a
|
|
|
2541 mouse event), the keymaps for that mouse event will be listed (see
|
|
|
2542 `key-binding'). Otherwise, the keymaps for key presses will be listed.
|
|
20
|
2543 */
|
|
|
2544 (event_or_keys))
|
|
0
|
2545 {
|
|
|
2546 /* This function can GC */
|
|
|
2547 struct gcpro gcpro1;
|
|
|
2548 Lisp_Object maps[100];
|
|
|
2549 Lisp_Object *gubbish = maps;
|
|
|
2550 int nmaps;
|
|
|
2551
|
|
|
2552 GCPRO1 (event_or_keys);
|
|
|
2553 nmaps = get_relevant_keymaps (event_or_keys, countof (maps),
|
|
|
2554 gubbish);
|
|
|
2555 if (nmaps > countof (maps))
|
|
|
2556 {
|
|
185
|
2557 gubbish = alloca_array (Lisp_Object, nmaps);
|
|
0
|
2558 nmaps = get_relevant_keymaps (event_or_keys, nmaps, gubbish);
|
|
|
2559 }
|
|
|
2560 UNGCPRO;
|
|
173
|
2561 return Flist (nmaps, gubbish);
|
|
0
|
2562 }
|
|
|
2563
|
|
20
|
2564 DEFUN ("key-binding", Fkey_binding, 1, 2, 0, /*
|
|
0
|
2565 Return the binding for command KEYS in current keymaps.
|
|
|
2566 KEYS is a string, a vector of events, or a vector of key-description lists
|
|
|
2567 as described in the documentation for the `define-key' function.
|
|
|
2568 The binding is probably a symbol with a function definition; see
|
|
|
2569 the documentation for `lookup-key' for more information.
|
|
|
2570
|
|
|
2571 For key-presses, the order of keymaps searched is:
|
|
|
2572 - the `keymap' property of any extent(s) at point;
|
|
|
2573 - any applicable minor-mode maps;
|
|
|
2574 - the current-local-map of the current-buffer;
|
|
|
2575 - the current global map.
|
|
|
2576
|
|
|
2577 For mouse-clicks, the order of keymaps searched is:
|
|
|
2578 - the current-local-map of the `mouse-grabbed-buffer' if any;
|
|
|
2579 - the `keymap' property of any extent(s) at the position of the click
|
|
|
2580 (this includes modeline extents);
|
|
|
2581 - the modeline-map of the buffer corresponding to the modeline under
|
|
|
2582 the mouse (if the click happened over a modeline);
|
|
|
2583 - the value of toolbar-map in the current-buffer (if the click
|
|
|
2584 happened over a toolbar);
|
|
|
2585 - the current-local-map of the buffer under the mouse (does not
|
|
|
2586 apply to toolbar clicks);
|
|
|
2587 - any applicable minor-mode maps;
|
|
|
2588 - the current global map.
|
|
|
2589
|
|
|
2590 Note that if `overriding-local-map' or `overriding-terminal-local-map'
|
|
|
2591 is non-nil, *only* those two maps and the current global map are searched.
|
|
20
|
2592 */
|
|
|
2593 (keys, accept_default))
|
|
0
|
2594 {
|
|
|
2595 /* This function can GC */
|
|
|
2596 int i;
|
|
|
2597 Lisp_Object maps[100];
|
|
|
2598 int nmaps;
|
|
|
2599 struct gcpro gcpro1, gcpro2;
|
|
|
2600 GCPRO2 (keys, accept_default); /* get_relevant_keymaps may autoload */
|
|
|
2601
|
|
|
2602 nmaps = get_relevant_keymaps (keys, countof (maps), maps);
|
|
|
2603
|
|
|
2604 UNGCPRO;
|
|
|
2605
|
|
|
2606 if (EVENTP (keys)) /* unadvertised "feature" for the future */
|
|
173
|
2607 return lookup_events (keys, nmaps, maps, !NILP (accept_default));
|
|
0
|
2608
|
|
|
2609 for (i = 0; i < nmaps; i++)
|
|
|
2610 {
|
|
|
2611 Lisp_Object tem = Flookup_key (maps[i], keys,
|
|
|
2612 accept_default);
|
|
|
2613 if (INTP (tem))
|
|
|
2614 {
|
|
|
2615 /* Too long in some local map means don't look at global map */
|
|
173
|
2616 return Qnil;
|
|
0
|
2617 }
|
|
|
2618 else if (!NILP (tem))
|
|
173
|
2619 return tem;
|
|
0
|
2620 }
|
|
173
|
2621 return Qnil;
|
|
0
|
2622 }
|
|
|
2623
|
|
|
2624 static Lisp_Object
|
|
|
2625 process_event_binding_result (Lisp_Object result)
|
|
|
2626 {
|
|
|
2627 if (EQ (result, Qundefined))
|
|
|
2628 /* The suppress-keymap function binds keys to 'undefined - special-case
|
|
|
2629 that here, so that being bound to that has the same error-behavior as
|
|
|
2630 not being defined at all.
|
|
|
2631 */
|
|
|
2632 result = Qnil;
|
|
|
2633 if (!NILP (result))
|
|
|
2634 {
|
|
|
2635 Lisp_Object map;
|
|
|
2636 /* Snap out possible keymap indirections */
|
|
|
2637 map = get_keymap (result, 0, 1);
|
|
|
2638 if (!NILP (map))
|
|
|
2639 result = map;
|
|
|
2640 }
|
|
|
2641
|
|
|
2642 return result;
|
|
|
2643 }
|
|
|
2644
|
|
|
2645 /* Attempts to find a command corresponding to the event-sequence
|
|
|
2646 whose head is event0 (sequence is threaded though event_next).
|
|
|
2647
|
|
|
2648 The return value will be
|
|
|
2649
|
|
|
2650 -- nil (there is no binding; this will also be returned
|
|
|
2651 whenever the event chain is "too long", i.e. there
|
|
|
2652 is a non-nil, non-keymap binding for a prefix of
|
|
|
2653 the event chain)
|
|
|
2654 -- a keymap (part of a command has been specified)
|
|
|
2655 -- a command (anything that satisfies `commandp'; this includes
|
|
|
2656 some symbols, lists, subrs, strings, vectors, and
|
|
|
2657 compiled-function objects) */
|
|
|
2658 Lisp_Object
|
|
|
2659 event_binding (Lisp_Object event0, int accept_default)
|
|
|
2660 {
|
|
|
2661 /* This function can GC */
|
|
|
2662 Lisp_Object maps[100];
|
|
|
2663 int nmaps;
|
|
|
2664
|
|
|
2665 assert (EVENTP (event0));
|
|
|
2666
|
|
|
2667 nmaps = get_relevant_keymaps (event0, countof (maps), maps);
|
|
114
|
2668 if (nmaps > countof (maps))
|
|
|
2669 nmaps = countof (maps);
|
|
173
|
2670 return process_event_binding_result (lookup_events (event0, nmaps, maps,
|
|
|
2671 accept_default));
|
|
0
|
2672 }
|
|
|
2673
|
|
175
|
2674 /* like event_binding, but specify a keymap to search */
|
|
|
2675
|
|
|
2676 Lisp_Object
|
|
|
2677 event_binding_in (Lisp_Object event0, Lisp_Object keymap, int accept_default)
|
|
|
2678 {
|
|
|
2679 /* This function can GC */
|
|
|
2680 if (!KEYMAPP (keymap))
|
|
|
2681 return Qnil;
|
|
185
|
2682
|
|
|
2683 return process_event_binding_result (lookup_events (event0, 1, &keymap,
|
|
175
|
2684 accept_default));
|
|
|
2685 }
|
|
|
2686
|
|
0
|
2687 /* Attempts to find a function key mapping corresponding to the
|
|
|
2688 event-sequence whose head is event0 (sequence is threaded through
|
|
|
2689 event_next). The return value will be the same as for event_binding(). */
|
|
|
2690 Lisp_Object
|
|
|
2691 munging_key_map_event_binding (Lisp_Object event0,
|
|
|
2692 enum munge_me_out_the_door munge)
|
|
|
2693 {
|
|
185
|
2694 Lisp_Object keymap = (munge == MUNGE_ME_FUNCTION_KEY) ?
|
|
|
2695 CONSOLE_FUNCTION_KEY_MAP (event_console_or_selected (event0)) :
|
|
|
2696 Vkey_translation_map;
|
|
|
2697
|
|
|
2698 if (NILP (keymap))
|
|
0
|
2699 return Qnil;
|
|
|
2700
|
|
185
|
2701 return process_event_binding_result (lookup_events (event0, 1, &keymap, 1));
|
|
0
|
2702 }
|
|
|
2703
|
|
|
2704
|
|
|
2705 /************************************************************************/
|
|
|
2706 /* Setting/querying the global and local maps */
|
|
|
2707 /************************************************************************/
|
|
|
2708
|
|
20
|
2709 DEFUN ("use-global-map", Fuse_global_map, 1, 1, 0, /*
|
|
0
|
2710 Select KEYMAP as the global keymap.
|
|
20
|
2711 */
|
|
|
2712 (keymap))
|
|
0
|
2713 {
|
|
|
2714 /* This function can GC */
|
|
|
2715 keymap = get_keymap (keymap, 1, 1);
|
|
|
2716 Vcurrent_global_map = keymap;
|
|
|
2717 return Qnil;
|
|
|
2718 }
|
|
|
2719
|
|
20
|
2720 DEFUN ("use-local-map", Fuse_local_map, 1, 2, 0, /*
|
|
0
|
2721 Select KEYMAP as the local keymap in BUFFER.
|
|
|
2722 If KEYMAP is nil, that means no local keymap.
|
|
|
2723 If BUFFER is nil, the current buffer is assumed.
|
|
20
|
2724 */
|
|
|
2725 (keymap, buffer))
|
|
0
|
2726 {
|
|
|
2727 /* This function can GC */
|
|
|
2728 struct buffer *b = decode_buffer (buffer, 0);
|
|
|
2729 if (!NILP (keymap))
|
|
|
2730 keymap = get_keymap (keymap, 1, 1);
|
|
|
2731
|
|
|
2732 b->keymap = keymap;
|
|
|
2733
|
|
|
2734 return Qnil;
|
|
|
2735 }
|
|
|
2736
|
|
20
|
2737 DEFUN ("current-local-map", Fcurrent_local_map, 0, 1, 0, /*
|
|
0
|
2738 Return BUFFER's local keymap, or nil if it has none.
|
|
|
2739 If BUFFER is nil, the current buffer is assumed.
|
|
20
|
2740 */
|
|
|
2741 (buffer))
|
|
0
|
2742 {
|
|
|
2743 struct buffer *b = decode_buffer (buffer, 0);
|
|
|
2744 return b->keymap;
|
|
|
2745 }
|
|
|
2746
|
|
20
|
2747 DEFUN ("current-global-map", Fcurrent_global_map, 0, 0, 0, /*
|
|
0
|
2748 Return the current global keymap.
|
|
20
|
2749 */
|
|
|
2750 ())
|
|
0
|
2751 {
|
|
173
|
2752 return Vcurrent_global_map;
|
|
0
|
2753 }
|
|
|
2754
|
|
|
2755
|
|
|
2756 /************************************************************************/
|
|
|
2757 /* Mapping over keymap elements */
|
|
|
2758 /************************************************************************/
|
|
|
2759
|
|
|
2760 /* Since keymaps are arranged in a hierarchy, one keymap per bucky bit or
|
|
185
|
2761 prefix key, it's not entirely obvious what map-keymap should do, but
|
|
0
|
2762 what it does is: map over all keys in this map; then recursively map
|
|
|
2763 over all submaps of this map that are "bucky" submaps. This means that,
|
|
|
2764 when mapping over a keymap, it appears that "x" and "C-x" are in the
|
|
|
2765 same map, although "C-x" is really in the "control" submap of this one.
|
|
|
2766 However, since we don't recursively descend the submaps that are bound
|
|
|
2767 to prefix keys (like C-x, C-h, etc) the caller will have to recurse on
|
|
|
2768 those explicitly, if that's what they want.
|
|
|
2769
|
|
|
2770 So the end result of this is that the bucky keymaps (the ones indexed
|
|
|
2771 under the large integers returned from MAKE_MODIFIER_HASH_KEY()) are
|
|
|
2772 invisible from elisp. They're just an implementation detail that code
|
|
|
2773 outside of this file doesn't need to know about.
|
|
|
2774 */
|
|
|
2775
|
|
|
2776 struct map_keymap_unsorted_closure
|
|
|
2777 {
|
|
|
2778 void (*fn) (CONST struct key_data *, Lisp_Object binding, void *arg);
|
|
|
2779 void *arg;
|
|
|
2780 unsigned int modifiers;
|
|
|
2781 };
|
|
|
2782
|
|
|
2783 /* used by map_keymap() */
|
|
241
|
2784 static int
|
|
185
|
2785 map_keymap_unsorted_mapper (CONST void *hash_key, void *hash_contents,
|
|
0
|
2786 void *map_keymap_unsorted_closure)
|
|
|
2787 {
|
|
|
2788 /* This function can GC */
|
|
|
2789 Lisp_Object keysym;
|
|
|
2790 Lisp_Object contents;
|
|
185
|
2791 struct map_keymap_unsorted_closure *closure =
|
|
|
2792 (struct map_keymap_unsorted_closure *) map_keymap_unsorted_closure;
|
|
0
|
2793 unsigned int modifiers = closure->modifiers;
|
|
|
2794 unsigned int mod_bit;
|
|
|
2795 CVOID_TO_LISP (keysym, hash_key);
|
|
|
2796 VOID_TO_LISP (contents, hash_contents);
|
|
|
2797 mod_bit = MODIFIER_HASH_KEY_BITS (keysym);
|
|
|
2798 if (mod_bit != 0)
|
|
|
2799 {
|
|
|
2800 int omod = modifiers;
|
|
|
2801 closure->modifiers = (modifiers | mod_bit);
|
|
185
|
2802 contents = get_keymap (contents, 1, 0);
|
|
0
|
2803 elisp_maphash (map_keymap_unsorted_mapper,
|
|
|
2804 XKEYMAP (contents)->table,
|
|
|
2805 map_keymap_unsorted_closure);
|
|
|
2806 closure->modifiers = omod;
|
|
|
2807 }
|
|
|
2808 else
|
|
|
2809 {
|
|
|
2810 struct key_data key;
|
|
|
2811 key.keysym = keysym;
|
|
|
2812 key.modifiers = modifiers;
|
|
|
2813 ((*closure->fn) (&key, contents, closure->arg));
|
|
|
2814 }
|
|
241
|
2815 return 0;
|
|
0
|
2816 }
|
|
|
2817
|
|
|
2818
|
|
|
2819 struct map_keymap_sorted_closure
|
|
|
2820 {
|
|
|
2821 Lisp_Object *result_locative;
|
|
|
2822 };
|
|
|
2823
|
|
|
2824 /* used by map_keymap_sorted() */
|
|
241
|
2825 static int
|
|
185
|
2826 map_keymap_sorted_mapper (CONST void *hash_key, void *hash_contents,
|
|
0
|
2827 void *map_keymap_sorted_closure)
|
|
|
2828 {
|
|
185
|
2829 struct map_keymap_sorted_closure *cl =
|
|
|
2830 (struct map_keymap_sorted_closure *) map_keymap_sorted_closure;
|
|
0
|
2831 Lisp_Object key, contents;
|
|
|
2832 Lisp_Object *list = cl->result_locative;
|
|
|
2833 CVOID_TO_LISP (key, hash_key);
|
|
|
2834 VOID_TO_LISP (contents, hash_contents);
|
|
|
2835 *list = Fcons (Fcons (key, contents), *list);
|
|
241
|
2836 return 0;
|
|
0
|
2837 }
|
|
|
2838
|
|
|
2839
|
|
|
2840 /* used by map_keymap_sorted(), describe_map_sort_predicate(),
|
|
|
2841 and keymap_submaps().
|
|
|
2842 */
|
|
|
2843 static int
|
|
185
|
2844 map_keymap_sort_predicate (Lisp_Object obj1, Lisp_Object obj2,
|
|
0
|
2845 Lisp_Object pred)
|
|
|
2846 {
|
|
|
2847 /* obj1 and obj2 are conses with keysyms in their cars. Cdrs are ignored.
|
|
|
2848 */
|
|
|
2849 unsigned int bit1, bit2;
|
|
|
2850 int sym1_p = 0;
|
|
|
2851 int sym2_p = 0;
|
|
|
2852 obj1 = XCAR (obj1);
|
|
|
2853 obj2 = XCAR (obj2);
|
|
|
2854
|
|
|
2855 if (EQ (obj1, obj2))
|
|
|
2856 return -1;
|
|
|
2857 bit1 = MODIFIER_HASH_KEY_BITS (obj1);
|
|
|
2858 bit2 = MODIFIER_HASH_KEY_BITS (obj2);
|
|
185
|
2859
|
|
0
|
2860 /* If either is a symbol with a character-set-property, then sort it by
|
|
|
2861 that code instead of alphabetically.
|
|
|
2862 */
|
|
|
2863 if (! bit1 && SYMBOLP (obj1))
|
|
|
2864 {
|
|
|
2865 Lisp_Object code = Fget (obj1, Vcharacter_set_property, Qnil);
|
|
70
|
2866 if (CHAR_OR_CHAR_INTP (code))
|
|
|
2867 {
|
|
|
2868 obj1 = code;
|
|
|
2869 CHECK_CHAR_COERCE_INT (obj1);
|
|
|
2870 sym1_p = 1;
|
|
|
2871 }
|
|
0
|
2872 }
|
|
|
2873 if (! bit2 && SYMBOLP (obj2))
|
|
|
2874 {
|
|
|
2875 Lisp_Object code = Fget (obj2, Vcharacter_set_property, Qnil);
|
|
70
|
2876 if (CHAR_OR_CHAR_INTP (code))
|
|
|
2877 {
|
|
|
2878 obj2 = code;
|
|
|
2879 CHECK_CHAR_COERCE_INT (obj2);
|
|
|
2880 sym2_p = 1;
|
|
|
2881 }
|
|
0
|
2882 }
|
|
|
2883
|
|
|
2884 /* all symbols (non-ASCIIs) come after characters (ASCIIs) */
|
|
|
2885 if (XTYPE (obj1) != XTYPE (obj2))
|
|
173
|
2886 return SYMBOLP (obj2) ? 1 : -1;
|
|
0
|
2887
|
|
|
2888 if (! bit1 && CHARP (obj1)) /* they're both ASCII */
|
|
|
2889 {
|
|
|
2890 int o1 = XCHAR (obj1);
|
|
|
2891 int o2 = XCHAR (obj2);
|
|
|
2892 if (o1 == o2 && /* If one started out as a symbol and the */
|
|
|
2893 sym1_p != sym2_p) /* other didn't, the symbol comes last. */
|
|
173
|
2894 return sym2_p ? 1 : -1;
|
|
|
2895
|
|
|
2896 return o1 < o2 ? 1 : -1; /* else just compare them */
|
|
0
|
2897 }
|
|
|
2898
|
|
|
2899 /* else they're both symbols. If they're both buckys, then order them. */
|
|
|
2900 if (bit1 && bit2)
|
|
173
|
2901 return bit1 < bit2 ? 1 : -1;
|
|
185
|
2902
|
|
0
|
2903 /* if only one is a bucky, then it comes later */
|
|
|
2904 if (bit1 || bit2)
|
|
173
|
2905 return bit2 ? 1 : -1;
|
|
0
|
2906
|
|
|
2907 /* otherwise, string-sort them. */
|
|
|
2908 {
|
|
|
2909 char *s1 = (char *) string_data (XSYMBOL (obj1)->name);
|
|
|
2910 char *s2 = (char *) string_data (XSYMBOL (obj2)->name);
|
|
|
2911 #ifdef I18N2
|
|
173
|
2912 return 0 > strcoll (s1, s2) ? 1 : -1;
|
|
0
|
2913 #else
|
|
173
|
2914 return 0 > strcmp (s1, s2) ? 1 : -1;
|
|
0
|
2915 #endif
|
|
|
2916 }
|
|
|
2917 }
|
|
|
2918
|
|
|
2919
|
|
|
2920 /* used by map_keymap() */
|
|
|
2921 static void
|
|
|
2922 map_keymap_sorted (Lisp_Object keymap_table,
|
|
185
|
2923 unsigned int modifiers,
|
|
0
|
2924 void (*function) (CONST struct key_data *key,
|
|
185
|
2925 Lisp_Object binding,
|
|
0
|
2926 void *map_keymap_sorted_closure),
|
|
|
2927 void *map_keymap_sorted_closure)
|
|
|
2928 {
|
|
|
2929 /* This function can GC */
|
|
|
2930 struct gcpro gcpro1;
|
|
|
2931 Lisp_Object contents = Qnil;
|
|
|
2932
|
|
|
2933 if (XINT (Fhashtable_fullness (keymap_table)) == 0)
|
|
|
2934 return;
|
|
|
2935
|
|
|
2936 GCPRO1 (contents);
|
|
|
2937
|
|
|
2938 {
|
|
|
2939 struct map_keymap_sorted_closure c1;
|
|
|
2940 c1.result_locative = &contents;
|
|
|
2941 elisp_maphash (map_keymap_sorted_mapper, keymap_table, &c1);
|
|
|
2942 }
|
|
|
2943 contents = list_sort (contents, Qnil, map_keymap_sort_predicate);
|
|
|
2944 for (; !NILP (contents); contents = XCDR (contents))
|
|
|
2945 {
|
|
|
2946 Lisp_Object keysym = XCAR (XCAR (contents));
|
|
|
2947 Lisp_Object binding = XCDR (XCAR (contents));
|
|
|
2948 unsigned int sub_bits = MODIFIER_HASH_KEY_BITS (keysym);
|
|
|
2949 if (sub_bits != 0)
|
|
|
2950 map_keymap_sorted (XKEYMAP (get_keymap (binding,
|
|
|
2951 1, 1))->table,
|
|
|
2952 (modifiers | sub_bits),
|
|
|
2953 function,
|
|
|
2954 map_keymap_sorted_closure);
|
|
|
2955 else
|
|
|
2956 {
|
|
|
2957 struct key_data k;
|
|
|
2958 k.keysym = keysym;
|
|
|
2959 k.modifiers = modifiers;
|
|
|
2960 ((*function) (&k, binding, map_keymap_sorted_closure));
|
|
|
2961 }
|
|
|
2962 }
|
|
|
2963 UNGCPRO;
|
|
|
2964 }
|
|
|
2965
|
|
|
2966
|
|
|
2967 /* used by Fmap_keymap() */
|
|
|
2968 static void
|
|
|
2969 map_keymap_mapper (CONST struct key_data *key,
|
|
185
|
2970 Lisp_Object binding,
|
|
0
|
2971 void *function)
|
|
|
2972 {
|
|
|
2973 /* This function can GC */
|
|
|
2974 Lisp_Object fn;
|
|
|
2975 VOID_TO_LISP (fn, function);
|
|
|
2976 call2 (fn, make_key_description (key, 1), binding);
|
|
|
2977 }
|
|
|
2978
|
|
|
2979
|
|
|
2980 static void
|
|
|
2981 map_keymap (Lisp_Object keymap_table, int sort_first,
|
|
|
2982 void (*function) (CONST struct key_data *key,
|
|
|
2983 Lisp_Object binding,
|
|
|
2984 void *fn_arg),
|
|
|
2985 void *fn_arg)
|
|
|
2986 {
|
|
|
2987 /* This function can GC */
|
|
|
2988 if (sort_first)
|
|
|
2989 map_keymap_sorted (keymap_table, 0, function, fn_arg);
|
|
|
2990 else
|
|
|
2991 {
|
|
|
2992 struct map_keymap_unsorted_closure map_keymap_unsorted_closure;
|
|
|
2993 map_keymap_unsorted_closure.fn = function;
|
|
|
2994 map_keymap_unsorted_closure.arg = fn_arg;
|
|
|
2995 map_keymap_unsorted_closure.modifiers = 0;
|
|
|
2996 elisp_maphash (map_keymap_unsorted_mapper, keymap_table,
|
|
|
2997 &map_keymap_unsorted_closure);
|
|
|
2998 }
|
|
|
2999 }
|
|
|
3000
|
|
20
|
3001 DEFUN ("map-keymap", Fmap_keymap, 2, 3, 0, /*
|
|
0
|
3002 Apply FUNCTION to each element of KEYMAP.
|
|
|
3003 FUNCTION will be called with two arguments: a key-description list, and
|
|
|
3004 the binding. The order in which the elements of the keymap are passed to
|
|
|
3005 the function is unspecified. If the function inserts new elements into
|
|
|
3006 the keymap, it may or may not be called with them later. No element of
|
|
|
3007 the keymap will ever be passed to the function more than once.
|
|
|
3008
|
|
|
3009 The function will not be called on elements of this keymap's parents
|
|
|
3010 (see the function `keymap-parents') or upon keymaps which are contained
|
|
|
3011 within this keymap (multi-character definitions).
|
|
185
|
3012 It will be called on "meta" characters since they are not really
|
|
0
|
3013 two-character sequences.
|
|
|
3014
|
|
|
3015 If the optional third argument SORT-FIRST is non-nil, then the elements of
|
|
|
3016 the keymap will be passed to the mapper function in a canonical order.
|
|
|
3017 Otherwise, they will be passed in hash (that is, random) order, which is
|
|
|
3018 faster.
|
|
20
|
3019 */
|
|
70
|
3020 (function, keymap, sort_first))
|
|
0
|
3021 {
|
|
|
3022 /* This function can GC */
|
|
|
3023 struct gcpro gcpro1, gcpro2;
|
|
|
3024
|
|
|
3025 /* tolerate obviously transposed args */
|
|
|
3026 if (!NILP (Fkeymapp (function)))
|
|
|
3027 {
|
|
|
3028 Lisp_Object tmp = function;
|
|
|
3029 function = keymap;
|
|
|
3030 keymap = tmp;
|
|
|
3031 }
|
|
|
3032 GCPRO2 (function, keymap);
|
|
|
3033 keymap = get_keymap (keymap, 1, 1);
|
|
|
3034 map_keymap (XKEYMAP (keymap)->table, !NILP (sort_first),
|
|
|
3035 map_keymap_mapper, LISP_TO_VOID (function));
|
|
|
3036 UNGCPRO;
|
|
|
3037 return Qnil;
|
|
|
3038 }
|
|
|
3039
|
|
|
3040
|
|
|
3041
|
|
|
3042 /************************************************************************/
|
|
|
3043 /* Accessible keymaps */
|
|
|
3044 /************************************************************************/
|
|
|
3045
|
|
|
3046 struct accessible_keymaps_closure
|
|
|
3047 {
|
|
|
3048 Lisp_Object tail;
|
|
|
3049 };
|
|
|
3050
|
|
|
3051
|
|
|
3052 static void
|
|
|
3053 accessible_keymaps_mapper_1 (Lisp_Object keysym, Lisp_Object contents,
|
|
|
3054 unsigned int modifiers,
|
|
|
3055 struct accessible_keymaps_closure *closure)
|
|
|
3056 {
|
|
|
3057 /* This function can GC */
|
|
|
3058 unsigned int subbits = MODIFIER_HASH_KEY_BITS (keysym);
|
|
|
3059
|
|
|
3060 if (subbits != 0)
|
|
|
3061 {
|
|
|
3062 Lisp_Object submaps;
|
|
|
3063
|
|
|
3064 contents = get_keymap (contents, 1, 1);
|
|
|
3065 submaps = keymap_submaps (contents);
|
|
|
3066 for (; !NILP (submaps); submaps = XCDR (submaps))
|
|
|
3067 {
|
|
|
3068 accessible_keymaps_mapper_1 (XCAR (XCAR (submaps)),
|
|
|
3069 XCDR (XCAR (submaps)),
|
|
|
3070 (subbits | modifiers),
|
|
|
3071 closure);
|
|
|
3072 }
|
|
|
3073 }
|
|
|
3074 else
|
|
|
3075 {
|
|
|
3076 Lisp_Object thisseq = Fcar (Fcar (closure->tail));
|
|
|
3077 Lisp_Object cmd = get_keyelt (contents, 1);
|
|
|
3078 Lisp_Object vec;
|
|
|
3079 int j;
|
|
173
|
3080 int len;
|
|
0
|
3081 struct key_data key;
|
|
|
3082 key.keysym = keysym;
|
|
|
3083 key.modifiers = modifiers;
|
|
|
3084
|
|
|
3085 if (NILP (cmd))
|
|
|
3086 abort ();
|
|
|
3087 cmd = get_keymap (cmd, 0, 1);
|
|
|
3088 if (!KEYMAPP (cmd))
|
|
|
3089 abort ();
|
|
|
3090
|
|
173
|
3091 vec = make_vector (XVECTOR_LENGTH (thisseq) + 1, Qnil);
|
|
|
3092 len = XVECTOR_LENGTH (thisseq);
|
|
|
3093 for (j = 0; j < len; j++)
|
|
|
3094 XVECTOR_DATA (vec) [j] = XVECTOR_DATA (thisseq) [j];
|
|
|
3095 XVECTOR_DATA (vec) [j] = make_key_description (&key, 1);
|
|
0
|
3096
|
|
|
3097 nconc2 (closure->tail, list1 (Fcons (vec, cmd)));
|
|
|
3098 }
|
|
|
3099 }
|
|
|
3100
|
|
|
3101
|
|
|
3102 static Lisp_Object
|
|
|
3103 accessible_keymaps_keymap_mapper (Lisp_Object thismap, void *arg)
|
|
|
3104 {
|
|
|
3105 /* This function can GC */
|
|
185
|
3106 struct accessible_keymaps_closure *closure =
|
|
|
3107 (struct accessible_keymaps_closure *) arg;
|
|
0
|
3108 Lisp_Object submaps = keymap_submaps (thismap);
|
|
|
3109
|
|
|
3110 for (; !NILP (submaps); submaps = XCDR (submaps))
|
|
|
3111 {
|
|
|
3112 accessible_keymaps_mapper_1 (XCAR (XCAR (submaps)),
|
|
|
3113 XCDR (XCAR (submaps)),
|
|
|
3114 0,
|
|
|
3115 closure);
|
|
|
3116 }
|
|
173
|
3117 return Qnil;
|
|
0
|
3118 }
|
|
|
3119
|
|
|
3120
|
|
20
|
3121 DEFUN ("accessible-keymaps", Faccessible_keymaps, 1, 2, 0, /*
|
|
185
|
3122 Find all keymaps accessible via prefix characters from KEYMAP.
|
|
0
|
3123 Returns a list of elements of the form (KEYS . MAP), where the sequence
|
|
185
|
3124 KEYS starting from KEYMAP gets you to MAP. These elements are ordered
|
|
|
3125 so that the KEYS increase in length. The first element is ([] . KEYMAP).
|
|
0
|
3126 An optional argument PREFIX, if non-nil, should be a key sequence;
|
|
|
3127 then the value includes only maps for prefixes that start with PREFIX.
|
|
20
|
3128 */
|
|
185
|
3129 (keymap, prefix))
|
|
0
|
3130 {
|
|
|
3131 /* This function can GC */
|
|
|
3132 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
3133 Lisp_Object accessible_keymaps = Qnil;
|
|
|
3134 struct accessible_keymaps_closure c;
|
|
|
3135 c.tail = Qnil;
|
|
185
|
3136 GCPRO4 (accessible_keymaps, c.tail, prefix, keymap);
|
|
0
|
3137
|
|
|
3138 retry:
|
|
185
|
3139 keymap = get_keymap (keymap, 1, 1);
|
|
0
|
3140 if (NILP (prefix))
|
|
|
3141 prefix = make_vector (0, Qnil);
|
|
|
3142 else if (!VECTORP (prefix) || STRINGP (prefix))
|
|
|
3143 {
|
|
|
3144 prefix = wrong_type_argument (Qarrayp, prefix);
|
|
|
3145 goto retry;
|
|
|
3146 }
|
|
|
3147 else
|
|
|
3148 {
|
|
|
3149 int len = XINT (Flength (prefix));
|
|
185
|
3150 Lisp_Object def = Flookup_key (keymap, prefix, Qnil);
|
|
0
|
3151 Lisp_Object p;
|
|
|
3152 int iii;
|
|
|
3153 struct gcpro ngcpro1;
|
|
|
3154
|
|
|
3155 def = get_keymap (def, 0, 1);
|
|
|
3156 if (!KEYMAPP (def))
|
|
|
3157 goto RETURN;
|
|
|
3158
|
|
185
|
3159 keymap = def;
|
|
0
|
3160 p = make_vector (len, Qnil);
|
|
|
3161 NGCPRO1 (p);
|
|
|
3162 for (iii = 0; iii < len; iii++)
|
|
|
3163 {
|
|
|
3164 struct key_data key;
|
|
|
3165 define_key_parser (Faref (prefix, make_int (iii)), &key);
|
|
173
|
3166 XVECTOR_DATA (p)[iii] = make_key_description (&key, 1);
|
|
0
|
3167 }
|
|
|
3168 NUNGCPRO;
|
|
|
3169 prefix = p;
|
|
|
3170 }
|
|
185
|
3171
|
|
|
3172 accessible_keymaps = list1 (Fcons (prefix, keymap));
|
|
0
|
3173
|
|
|
3174 /* For each map in the list maps,
|
|
|
3175 look at any other maps it points to
|
|
|
3176 and stick them at the end if they are not already in the list */
|
|
|
3177
|
|
|
3178 for (c.tail = accessible_keymaps;
|
|
|
3179 !NILP (c.tail);
|
|
|
3180 c.tail = XCDR (c.tail))
|
|
|
3181 {
|
|
|
3182 Lisp_Object thismap = Fcdr (Fcar (c.tail));
|
|
|
3183 CHECK_KEYMAP (thismap);
|
|
|
3184 traverse_keymaps (thismap, Qnil,
|
|
|
3185 accessible_keymaps_keymap_mapper, &c);
|
|
|
3186 }
|
|
|
3187 RETURN:
|
|
|
3188 UNGCPRO;
|
|
173
|
3189 return accessible_keymaps;
|
|
0
|
3190 }
|
|
|
3191
|
|
|
3192
|
|
|
3193
|
|
|
3194 /************************************************************************/
|
|
|
3195 /* Pretty descriptions of key sequences */
|
|
|
3196 /************************************************************************/
|
|
|
3197
|
|
20
|
3198 DEFUN ("key-description", Fkey_description, 1, 1, 0, /*
|
|
0
|
3199 Return a pretty description of key-sequence KEYS.
|
|
185
|
3200 Control characters turn into "C-foo" sequences, meta into "M-foo",
|
|
|
3201 spaces are put between sequence elements, etc...
|
|
20
|
3202 */
|
|
|
3203 (keys))
|
|
0
|
3204 {
|
|
70
|
3205 if (CHAR_OR_CHAR_INTP (keys) || CONSP (keys) || SYMBOLP (keys)
|
|
|
3206 || EVENTP (keys))
|
|
0
|
3207 {
|
|
|
3208 return Fsingle_key_description (keys);
|
|
|
3209 }
|
|
|
3210 else if (VECTORP (keys) ||
|
|
|
3211 STRINGP (keys))
|
|
|
3212 {
|
|
|
3213 Lisp_Object string = Qnil;
|
|
|
3214 /* Lisp_Object sep = Qnil; */
|
|
|
3215 int size = XINT (Flength (keys));
|
|
|
3216 int i;
|
|
|
3217
|
|
|
3218 for (i = 0; i < size; i++)
|
|
|
3219 {
|
|
|
3220 Lisp_Object s2 = Fsingle_key_description
|
|
|
3221 (((STRINGP (keys))
|
|
|
3222 ? make_char (string_char (XSTRING (keys), i))
|
|
173
|
3223 : XVECTOR_DATA (keys)[i]));
|
|
0
|
3224
|
|
|
3225 if (i == 0)
|
|
|
3226 string = s2;
|
|
|
3227 else
|
|
|
3228 {
|
|
|
3229 /* if (NILP (sep)) Lisp_Object sep = build_string (" ") */;
|
|
|
3230 string = concat2 (string, concat2 (Vsingle_space_string, s2));
|
|
|
3231 }
|
|
|
3232 }
|
|
173
|
3233 return string;
|
|
0
|
3234 }
|
|
|
3235 return Fkey_description (wrong_type_argument (Qsequencep, keys));
|
|
|
3236 }
|
|
|
3237
|
|
20
|
3238 DEFUN ("single-key-description", Fsingle_key_description, 1, 1, 0, /*
|
|
0
|
3239 Return a pretty description of command character KEY.
|
|
|
3240 Control characters turn into C-whatever, etc.
|
|
|
3241 This differs from `text-char-description' in that it returns a description
|
|
|
3242 of a key read from the user rather than a character from a buffer.
|
|
20
|
3243 */
|
|
|
3244 (key))
|
|
0
|
3245 {
|
|
|
3246 if (SYMBOLP (key))
|
|
|
3247 key = Fcons (key, Qnil); /* sleaze sleaze */
|
|
|
3248
|
|
70
|
3249 if (EVENTP (key) || CHAR_OR_CHAR_INTP (key))
|
|
0
|
3250 {
|
|
|
3251 char buf [255];
|
|
|
3252 if (!EVENTP (key))
|
|
|
3253 {
|
|
|
3254 struct Lisp_Event event;
|
|
|
3255 event.event_type = empty_event;
|
|
|
3256 CHECK_CHAR_COERCE_INT (key);
|
|
|
3257 character_to_event (XCHAR (key), &event,
|
|
263
|
3258 XCONSOLE (Vselected_console), 0, 1);
|
|
0
|
3259 format_event_object (buf, &event, 1);
|
|
|
3260 }
|
|
|
3261 else
|
|
|
3262 format_event_object (buf, XEVENT (key), 1);
|
|
173
|
3263 return build_string (buf);
|
|
0
|
3264 }
|
|
|
3265
|
|
|
3266 if (CONSP (key))
|
|
|
3267 {
|
|
|
3268 char buf[255];
|
|
|
3269 char *bufp = buf;
|
|
|
3270 Lisp_Object rest;
|
|
|
3271 buf[0] = 0;
|
|
|
3272 LIST_LOOP (rest, key)
|
|
|
3273 {
|
|
|
3274 Lisp_Object keysym = XCAR (rest);
|
|
|
3275 if (EQ (keysym, Qcontrol)) strcpy (bufp, "C-"), bufp += 2;
|
|
|
3276 else if (EQ (keysym, Qctrl)) strcpy (bufp, "C-"), bufp += 2;
|
|
|
3277 else if (EQ (keysym, Qmeta)) strcpy (bufp, "M-"), bufp += 2;
|
|
|
3278 else if (EQ (keysym, Qsuper)) strcpy (bufp, "S-"), bufp += 2;
|
|
|
3279 else if (EQ (keysym, Qhyper)) strcpy (bufp, "H-"), bufp += 2;
|
|
|
3280 else if (EQ (keysym, Qalt)) strcpy (bufp, "A-"), bufp += 2;
|
|
|
3281 else if (EQ (keysym, Qshift)) strcpy (bufp, "Sh-"), bufp += 3;
|
|
70
|
3282 else if (CHAR_OR_CHAR_INTP (keysym))
|
|
|
3283 {
|
|
|
3284 bufp += set_charptr_emchar ((Bufbyte *) bufp,
|
|
|
3285 XCHAR_OR_CHAR_INT (keysym));
|
|
|
3286 *bufp = 0;
|
|
|
3287 }
|
|
0
|
3288 else
|
|
|
3289 {
|
|
|
3290 CHECK_SYMBOL (keysym);
|
|
|
3291 #if 0 /* This is bogus */
|
|
185
|
3292 if (EQ (keysym, QKlinefeed)) strcpy (bufp, "LFD");
|
|
|
3293 else if (EQ (keysym, QKtab)) strcpy (bufp, "TAB");
|
|
|
3294 else if (EQ (keysym, QKreturn)) strcpy (bufp, "RET");
|
|
|
3295 else if (EQ (keysym, QKescape)) strcpy (bufp, "ESC");
|
|
|
3296 else if (EQ (keysym, QKdelete)) strcpy (bufp, "DEL");
|
|
|
3297 else if (EQ (keysym, QKspace)) strcpy (bufp, "SPC");
|
|
|
3298 else if (EQ (keysym, QKbackspace)) strcpy (bufp, "BS");
|
|
0
|
3299 else
|
|
|
3300 #endif
|
|
|
3301 strcpy (bufp, (char *) string_data (XSYMBOL (keysym)->name));
|
|
|
3302 if (!NILP (XCDR (rest)))
|
|
|
3303 signal_simple_error ("invalid key description",
|
|
|
3304 key);
|
|
|
3305 }
|
|
|
3306 }
|
|
|
3307 return build_string (buf);
|
|
|
3308 }
|
|
|
3309 return Fsingle_key_description
|
|
|
3310 (wrong_type_argument (intern ("char-or-event-p"), key));
|
|
|
3311 }
|
|
|
3312
|
|
20
|
3313 DEFUN ("text-char-description", Ftext_char_description, 1, 1, 0, /*
|
|
0
|
3314 Return a pretty description of file-character CHR.
|
|
185
|
3315 Unprintable characters turn into "^char" or \\NNN, depending on the value
|
|
0
|
3316 of the `ctl-arrow' variable.
|
|
|
3317 This differs from `single-key-description' in that it returns a description
|
|
|
3318 of a character from a buffer rather than a key read from the user.
|
|
20
|
3319 */
|
|
|
3320 (chr))
|
|
0
|
3321 {
|
|
|
3322 Bufbyte buf[200];
|
|
|
3323 Bufbyte *p;
|
|
|
3324 unsigned int c;
|
|
|
3325 Lisp_Object ctl_arrow = current_buffer->ctl_arrow;
|
|
|
3326 int ctl_p = !NILP (ctl_arrow);
|
|
70
|
3327 Emchar printable_min = (CHAR_OR_CHAR_INTP (ctl_arrow)
|
|
|
3328 ? XCHAR_OR_CHAR_INT (ctl_arrow)
|
|
|
3329 : ((EQ (ctl_arrow, Qt) || NILP (ctl_arrow))
|
|
|
3330 ? 256 : 160));
|
|
0
|
3331
|
|
|
3332 if (EVENTP (chr))
|
|
|
3333 {
|
|
|
3334 Lisp_Object ch = Fevent_to_character (chr, Qnil, Qnil, Qt);
|
|
|
3335 if (NILP (ch))
|
|
|
3336 return
|
|
|
3337 signal_simple_continuable_error
|
|
|
3338 ("character has no ASCII equivalent", Fcopy_event (chr, Qnil));
|
|
|
3339 chr = ch;
|
|
|
3340 }
|
|
|
3341
|
|
|
3342 CHECK_CHAR_COERCE_INT (chr);
|
|
|
3343
|
|
|
3344 c = XCHAR (chr);
|
|
|
3345 p = buf;
|
|
|
3346
|
|
|
3347 if (c >= printable_min)
|
|
|
3348 {
|
|
|
3349 p += set_charptr_emchar (p, c);
|
|
|
3350 }
|
|
|
3351 else if (c < 040 && ctl_p)
|
|
|
3352 {
|
|
|
3353 *p++ = '^';
|
|
|
3354 *p++ = c + 64; /* 'A' - 1 */
|
|
|
3355 }
|
|
|
3356 else if (c == 0177)
|
|
|
3357 {
|
|
|
3358 *p++ = '^';
|
|
|
3359 *p++ = '?';
|
|
|
3360 }
|
|
|
3361 else if (c >= 0200 || c < 040)
|
|
|
3362 {
|
|
|
3363 *p++ = '\\';
|
|
70
|
3364 #ifdef MULE
|
|
|
3365 /* !!#### This syntax is not readable. It will
|
|
|
3366 be interpreted as a 3-digit octal number rather
|
|
|
3367 than a 7-digit octal number. */
|
|
|
3368 if (c >= 0400)
|
|
|
3369 {
|
|
|
3370 *p++ = '0' + ((c & 07000000) >> 18);
|
|
|
3371 *p++ = '0' + ((c & 0700000) >> 15);
|
|
|
3372 *p++ = '0' + ((c & 070000) >> 12);
|
|
|
3373 *p++ = '0' + ((c & 07000) >> 9);
|
|
|
3374 }
|
|
|
3375 #endif
|
|
0
|
3376 *p++ = '0' + ((c & 0700) >> 6);
|
|
|
3377 *p++ = '0' + ((c & 0070) >> 3);
|
|
|
3378 *p++ = '0' + ((c & 0007));
|
|
|
3379 }
|
|
|
3380 else
|
|
|
3381 {
|
|
|
3382 p += set_charptr_emchar (p, c);
|
|
|
3383 }
|
|
|
3384
|
|
|
3385 *p = 0;
|
|
|
3386 return build_string ((char *) buf);
|
|
|
3387 }
|
|
|
3388
|
|
|
3389
|
|
|
3390 /************************************************************************/
|
|
|
3391 /* where-is (mapping bindings to keys) */
|
|
|
3392 /************************************************************************/
|
|
|
3393
|
|
|
3394 static Lisp_Object
|
|
|
3395 where_is_internal (Lisp_Object definition, Lisp_Object *maps, int nmaps,
|
|
|
3396 Lisp_Object firstonly, char *target_buffer);
|
|
|
3397
|
|
20
|
3398 DEFUN ("where-is-internal", Fwhere_is_internal, 1, 5, 0, /*
|
|
0
|
3399 Return list of keys that invoke DEFINITION in KEYMAPS.
|
|
|
3400 KEYMAPS can be either a keymap (meaning search in that keymap and the
|
|
|
3401 current global keymap) or a list of keymaps (meaning search in exactly
|
|
|
3402 those keymaps and no others). If KEYMAPS is nil, search in the currently
|
|
|
3403 applicable maps for EVENT-OR-KEYS (this is equivalent to specifying
|
|
|
3404 `(current-keymaps EVENT-OR-KEYS)' as the argument to KEYMAPS).
|
|
|
3405
|
|
|
3406 If optional 3rd arg FIRSTONLY is non-nil, return a vector representing
|
|
|
3407 the first key sequence found, rather than a list of all possible key
|
|
|
3408 sequences.
|
|
|
3409
|
|
|
3410 If optional 4th arg NOINDIRECT is non-nil, don't follow indirections
|
|
|
3411 to other keymaps or slots. This makes it possible to search for an
|
|
|
3412 indirect definition itself.
|
|
20
|
3413 */
|
|
|
3414 (definition, keymaps, firstonly, noindirect, event_or_keys))
|
|
0
|
3415 {
|
|
|
3416 /* This function can GC */
|
|
|
3417 Lisp_Object maps[100];
|
|
|
3418 Lisp_Object *gubbish = maps;
|
|
|
3419 int nmaps;
|
|
|
3420
|
|
|
3421 /* Get keymaps as an array */
|
|
|
3422 if (NILP (keymaps))
|
|
|
3423 {
|
|
|
3424 nmaps = get_relevant_keymaps (event_or_keys, countof (maps),
|
|
|
3425 gubbish);
|
|
|
3426 if (nmaps > countof (maps))
|
|
|
3427 {
|
|
185
|
3428 gubbish = alloca_array (Lisp_Object, nmaps);
|
|
0
|
3429 nmaps = get_relevant_keymaps (event_or_keys, nmaps, gubbish);
|
|
|
3430 }
|
|
|
3431 }
|
|
|
3432 else if (CONSP (keymaps))
|
|
|
3433 {
|
|
|
3434 Lisp_Object rest;
|
|
|
3435 int i;
|
|
|
3436
|
|
|
3437 nmaps = XINT (Flength (keymaps));
|
|
|
3438 if (nmaps > countof (maps))
|
|
|
3439 {
|
|
185
|
3440 gubbish = alloca_array (Lisp_Object, nmaps);
|
|
0
|
3441 }
|
|
|
3442 for (rest = keymaps, i = 0; !NILP (rest);
|
|
|
3443 rest = XCDR (keymaps), i++)
|
|
|
3444 {
|
|
|
3445 gubbish[i] = get_keymap (XCAR (keymaps), 1, 1);
|
|
|
3446 }
|
|
|
3447 }
|
|
|
3448 else
|
|
|
3449 {
|
|
|
3450 nmaps = 1;
|
|
|
3451 gubbish[0] = get_keymap (keymaps, 1, 1);
|
|
|
3452 if (!EQ (gubbish[0], Vcurrent_global_map))
|
|
|
3453 {
|
|
|
3454 gubbish[1] = Vcurrent_global_map;
|
|
|
3455 nmaps++;
|
|
|
3456 }
|
|
|
3457 }
|
|
185
|
3458
|
|
0
|
3459 return where_is_internal (definition, gubbish, nmaps, firstonly, 0);
|
|
|
3460 }
|
|
|
3461
|
|
|
3462 /* This function is like
|
|
|
3463 (key-description (where-is-internal definition nil t))
|
|
185
|
3464 except that it writes its output into a (char *) buffer that you
|
|
0
|
3465 provide; it doesn't cons (or allocate memory) at all, so it's
|
|
|
3466 very fast. This is used by menubar.c.
|
|
|
3467 */
|
|
|
3468 void
|
|
|
3469 where_is_to_char (Lisp_Object definition, char *buffer)
|
|
|
3470 {
|
|
|
3471 /* This function can GC */
|
|
|
3472 Lisp_Object maps[100];
|
|
|
3473 Lisp_Object *gubbish = maps;
|
|
|
3474 int nmaps;
|
|
|
3475
|
|
|
3476 /* Get keymaps as an array */
|
|
|
3477 nmaps = get_relevant_keymaps (Qnil, countof (maps), gubbish);
|
|
|
3478 if (nmaps > countof (maps))
|
|
|
3479 {
|
|
185
|
3480 gubbish = alloca_array (Lisp_Object, nmaps);
|
|
0
|
3481 nmaps = get_relevant_keymaps (Qnil, nmaps, gubbish);
|
|
|
3482 }
|
|
|
3483
|
|
|
3484 buffer[0] = 0;
|
|
|
3485 where_is_internal (definition, maps, nmaps, Qt, buffer);
|
|
|
3486 }
|
|
|
3487
|
|
|
3488
|
|
185
|
3489 static Lisp_Object
|
|
0
|
3490 raw_keys_to_keys (struct key_data *keys, int count)
|
|
|
3491 {
|
|
|
3492 Lisp_Object result = make_vector (count, Qnil);
|
|
|
3493 while (count--)
|
|
173
|
3494 XVECTOR_DATA (result) [count] = make_key_description (&(keys[count]), 1);
|
|
|
3495 return result;
|
|
0
|
3496 }
|
|
|
3497
|
|
|
3498
|
|
|
3499 static void
|
|
|
3500 format_raw_keys (struct key_data *keys, int count, char *buf)
|
|
|
3501 {
|
|
|
3502 int i;
|
|
|
3503 struct Lisp_Event event;
|
|
|
3504 event.event_type = key_press_event;
|
|
|
3505 event.channel = Vselected_console;
|
|
|
3506 for (i = 0; i < count; i++)
|
|
|
3507 {
|
|
|
3508 event.event.key.keysym = keys[i].keysym;
|
|
|
3509 event.event.key.modifiers = keys[i].modifiers;
|
|
|
3510 format_event_object (buf, &event, 1);
|
|
|
3511 buf += strlen (buf);
|
|
|
3512 if (i < count-1)
|
|
|
3513 buf[0] = ' ', buf++;
|
|
|
3514 }
|
|
|
3515 }
|
|
|
3516
|
|
|
3517
|
|
|
3518 /* definition is the thing to look for.
|
|
|
3519 map is a keymap.
|
|
|
3520 shadow is an array of shadow_count keymaps; if there is a different
|
|
|
3521 binding in any of the keymaps of a key that we are considering
|
|
|
3522 returning, then we reconsider.
|
|
|
3523 firstonly means give up after finding the first match;
|
|
|
3524 keys_so_far and modifiers_so_far describe which map we're looking in;
|
|
|
3525 If we're in the "meta" submap of the map that "C-x 4" is bound to,
|
|
|
3526 then keys_so_far will be {(control x), \4}, and modifiers_so_far
|
|
|
3527 will be MOD_META. That is, keys_so_far is the chain of keys that we
|
|
|
3528 have followed, and modifiers_so_far_so_far is the bits (partial keys)
|
|
|
3529 beyond that.
|
|
185
|
3530
|
|
0
|
3531 (keys_so_far is a global buffer and the keys_count arg says how much
|
|
|
3532 of it we're currently interested in.)
|
|
185
|
3533
|
|
0
|
3534 If target_buffer is provided, then we write a key-description into it,
|
|
|
3535 to avoid consing a string. This only works with firstonly on.
|
|
|
3536 */
|
|
|
3537
|
|
|
3538 struct where_is_closure
|
|
|
3539 {
|
|
|
3540 Lisp_Object definition;
|
|
|
3541 Lisp_Object *shadow;
|
|
|
3542 int shadow_count;
|
|
|
3543 int firstonly;
|
|
|
3544 int keys_count;
|
|
|
3545 unsigned int modifiers_so_far;
|
|
|
3546 char *target_buffer;
|
|
|
3547 struct key_data *keys_so_far;
|
|
|
3548 int keys_so_far_total_size;
|
|
|
3549 int keys_so_far_malloced;
|
|
|
3550 };
|
|
|
3551
|
|
|
3552 static Lisp_Object where_is_recursive_mapper (Lisp_Object map, void *arg);
|
|
|
3553
|
|
|
3554 static Lisp_Object
|
|
|
3555 where_is_recursive_mapper (Lisp_Object map, void *arg)
|
|
|
3556 {
|
|
|
3557 /* This function can GC */
|
|
185
|
3558 struct where_is_closure *c = (struct where_is_closure *) arg;
|
|
0
|
3559 Lisp_Object definition = c->definition;
|
|
|
3560 CONST int firstonly = c->firstonly;
|
|
|
3561 CONST unsigned int keys_count = c->keys_count;
|
|
|
3562 CONST unsigned int modifiers_so_far = c->modifiers_so_far;
|
|
|
3563 char *target_buffer = c->target_buffer;
|
|
|
3564 Lisp_Object keys = Fgethash (definition,
|
|
|
3565 XKEYMAP (map)->inverse_table,
|
|
|
3566 Qnil);
|
|
|
3567 Lisp_Object submaps;
|
|
|
3568 Lisp_Object result = Qnil;
|
|
|
3569
|
|
|
3570 if (!NILP (keys))
|
|
|
3571 {
|
|
185
|
3572 /* One or more keys in this map match the definition we're looking for.
|
|
|
3573 Verify that these bindings aren't shadowed by other bindings
|
|
0
|
3574 in the shadow maps. Either nil or number as value from
|
|
185
|
3575 raw_lookup_key() means undefined. */
|
|
0
|
3576 struct key_data *so_far = c->keys_so_far;
|
|
|
3577
|
|
|
3578 for (;;) /* loop over all keys that match */
|
|
|
3579 {
|
|
|
3580 Lisp_Object k = ((CONSP (keys)) ? XCAR (keys) : keys);
|
|
|
3581 int i;
|
|
185
|
3582
|
|
0
|
3583 so_far [keys_count].keysym = k;
|
|
|
3584 so_far [keys_count].modifiers = modifiers_so_far;
|
|
|
3585
|
|
|
3586 /* now loop over all shadow maps */
|
|
|
3587 for (i = 0; i < c->shadow_count; i++)
|
|
|
3588 {
|
|
|
3589 Lisp_Object shadowed = raw_lookup_key (c->shadow[i],
|
|
|
3590 so_far,
|
|
185
|
3591 keys_count + 1,
|
|
0
|
3592 0, 1);
|
|
|
3593
|
|
|
3594 if (NILP (shadowed) || CHARP (shadowed) ||
|
|
|
3595 EQ (shadowed, definition))
|
|
|
3596 continue; /* we passed this test; it's not shadowed here. */
|
|
|
3597 else
|
|
|
3598 /* ignore this key binding, since it actually has a
|
|
|
3599 different binding in a shadowing map */
|
|
|
3600 goto c_doesnt_have_proper_loop_exit_statements;
|
|
|
3601 }
|
|
|
3602
|
|
|
3603 /* OK, the key is for real */
|
|
|
3604 if (target_buffer)
|
|
|
3605 {
|
|
|
3606 if (!firstonly) abort ();
|
|
|
3607 format_raw_keys (so_far, keys_count + 1, target_buffer);
|
|
173
|
3608 return make_int (1);
|
|
0
|
3609 }
|
|
|
3610 else if (firstonly)
|
|
|
3611 return raw_keys_to_keys (so_far, keys_count + 1);
|
|
|
3612 else
|
|
|
3613 result = Fcons (raw_keys_to_keys (so_far, keys_count + 1),
|
|
|
3614 result);
|
|
|
3615
|
|
|
3616 c_doesnt_have_proper_loop_exit_statements:
|
|
|
3617 /* now on to the next matching key ... */
|
|
|
3618 if (!CONSP (keys)) break;
|
|
|
3619 keys = XCDR (keys);
|
|
|
3620 }
|
|
|
3621 }
|
|
|
3622
|
|
|
3623 /* Now search the sub-keymaps of this map.
|
|
185
|
3624 If we're in "firstonly" mode and have already found one, this
|
|
0
|
3625 point is not reached. If we get one from lower down, either
|
|
|
3626 return it immediately (in firstonly mode) or tack it onto the
|
|
|
3627 end of the ones we've gotten so far.
|
|
|
3628 */
|
|
|
3629 for (submaps = keymap_submaps (map);
|
|
|
3630 !NILP (submaps);
|
|
|
3631 submaps = XCDR (submaps))
|
|
|
3632 {
|
|
|
3633 Lisp_Object key = XCAR (XCAR (submaps));
|
|
|
3634 Lisp_Object submap = XCDR (XCAR (submaps));
|
|
|
3635 unsigned int lower_modifiers;
|
|
|
3636 int lower_keys_count = keys_count;
|
|
|
3637 unsigned int bucky;
|
|
|
3638
|
|
185
|
3639 submap = get_keymap (submap, 0, 0);
|
|
0
|
3640
|
|
|
3641 if (EQ (submap, map))
|
|
|
3642 /* Arrgh! Some loser has introduced a loop... */
|
|
|
3643 continue;
|
|
|
3644
|
|
|
3645 /* If this is not a keymap, then that's probably because someone
|
|
|
3646 did an `fset' of a symbol that used to point to a map such that
|
|
|
3647 it no longer does. Sigh. Ignore this, and invalidate the cache
|
|
|
3648 so that it doesn't happen to us next time too.
|
|
|
3649 */
|
|
|
3650 if (NILP (submap))
|
|
|
3651 {
|
|
|
3652 XKEYMAP (map)->sub_maps_cache = Qt;
|
|
|
3653 continue;
|
|
|
3654 }
|
|
|
3655
|
|
|
3656 /* If the map is a "bucky" map, then add a bit to the
|
|
|
3657 modifiers_so_far list.
|
|
|
3658 Otherwise, add a new raw_key onto the end of keys_so_far.
|
|
|
3659 */
|
|
|
3660 bucky = MODIFIER_HASH_KEY_BITS (key);
|
|
|
3661 if (bucky != 0)
|
|
|
3662 lower_modifiers = (modifiers_so_far | bucky);
|
|
|
3663 else
|
|
|
3664 {
|
|
|
3665 struct key_data *so_far = c->keys_so_far;
|
|
|
3666 lower_modifiers = 0;
|
|
|
3667 so_far [lower_keys_count].keysym = key;
|
|
|
3668 so_far [lower_keys_count].modifiers = modifiers_so_far;
|
|
|
3669 lower_keys_count++;
|
|
|
3670 }
|
|
|
3671
|
|
|
3672 if (lower_keys_count >= c->keys_so_far_total_size)
|
|
|
3673 {
|
|
|
3674 int size = lower_keys_count + 50;
|
|
|
3675 if (! c->keys_so_far_malloced)
|
|
|
3676 {
|
|
185
|
3677 struct key_data *new = xnew_array (struct key_data, size);
|
|
203
|
3678 memcpy ((void *)new, (CONST void *)c->keys_so_far,
|
|
0
|
3679 c->keys_so_far_total_size * sizeof (struct key_data));
|
|
|
3680 }
|
|
|
3681 else
|
|
185
|
3682 XREALLOC_ARRAY (c->keys_so_far, struct key_data, size);
|
|
0
|
3683
|
|
|
3684 c->keys_so_far_total_size = size;
|
|
|
3685 c->keys_so_far_malloced = 1;
|
|
|
3686 }
|
|
|
3687
|
|
|
3688 {
|
|
|
3689 Lisp_Object lower;
|
|
|
3690
|
|
|
3691 c->keys_count = lower_keys_count;
|
|
|
3692 c->modifiers_so_far = lower_modifiers;
|
|
|
3693
|
|
185
|
3694 lower = traverse_keymaps (submap, Qnil, where_is_recursive_mapper, c);
|
|
|
3695
|
|
0
|
3696 c->keys_count = keys_count;
|
|
|
3697 c->modifiers_so_far = modifiers_so_far;
|
|
|
3698
|
|
|
3699 if (!firstonly)
|
|
|
3700 result = nconc2 (lower, result);
|
|
|
3701 else if (!NILP (lower))
|
|
173
|
3702 return lower;
|
|
0
|
3703 }
|
|
|
3704 }
|
|
173
|
3705 return result;
|
|
0
|
3706 }
|
|
|
3707
|
|
|
3708
|
|
|
3709 static Lisp_Object
|
|
|
3710 where_is_internal (Lisp_Object definition, Lisp_Object *maps, int nmaps,
|
|
|
3711 Lisp_Object firstonly, char *target_buffer)
|
|
|
3712 {
|
|
|
3713 /* This function can GC */
|
|
|
3714 Lisp_Object result = Qnil;
|
|
|
3715 int i;
|
|
|
3716 struct key_data raw[20];
|
|
|
3717 struct where_is_closure c;
|
|
|
3718
|
|
|
3719 c.definition = definition;
|
|
|
3720 c.shadow = maps;
|
|
|
3721 c.firstonly = !NILP (firstonly);
|
|
|
3722 c.target_buffer = target_buffer;
|
|
|
3723 c.keys_so_far = raw;
|
|
|
3724 c.keys_so_far_total_size = countof (raw);
|
|
|
3725 c.keys_so_far_malloced = 0;
|
|
|
3726
|
|
|
3727 /* Loop over each of the maps, accumulating the keys found.
|
|
|
3728 For each map searched, all previous maps shadow this one
|
|
|
3729 so that bogus keys aren't listed. */
|
|
|
3730 for (i = 0; i < nmaps; i++)
|
|
|
3731 {
|
|
|
3732 Lisp_Object this_result;
|
|
|
3733 c.shadow_count = i;
|
|
|
3734 /* Reset the things set in each iteration */
|
|
|
3735 c.keys_count = 0;
|
|
|
3736 c.modifiers_so_far = 0;
|
|
|
3737
|
|
|
3738 this_result = traverse_keymaps (maps[i], Qnil, where_is_recursive_mapper,
|
|
|
3739 &c);
|
|
|
3740 if (!NILP (firstonly))
|
|
|
3741 {
|
|
|
3742 result = this_result;
|
|
|
3743 if (!NILP (result))
|
|
|
3744 break;
|
|
|
3745 }
|
|
|
3746 else
|
|
|
3747 result = nconc2 (this_result, result);
|
|
|
3748 }
|
|
|
3749
|
|
|
3750 if (NILP (firstonly))
|
|
|
3751 result = Fnreverse (result);
|
|
|
3752
|
|
|
3753 if (c.keys_so_far_malloced)
|
|
|
3754 xfree (c.keys_so_far);
|
|
173
|
3755 return result;
|
|
0
|
3756 }
|
|
|
3757
|
|
|
3758
|
|
|
3759 /************************************************************************/
|
|
|
3760 /* Describing keymaps */
|
|
|
3761 /************************************************************************/
|
|
|
3762
|
|
20
|
3763 DEFUN ("describe-bindings-internal", Fdescribe_bindings_internal, 1, 5, 0, /*
|
|
0
|
3764 Insert a list of all defined keys and their definitions in MAP.
|
|
185
|
3765 Optional second argument ALL says whether to include even "uninteresting"
|
|
0
|
3766 definitions (ie symbols with a non-nil `suppress-keymap' property.
|
|
|
3767 Third argument SHADOW is a list of keymaps whose bindings shadow those
|
|
|
3768 of map; if a binding is present in any shadowing map, it is not printed.
|
|
|
3769 Fourth argument PREFIX, if non-nil, should be a key sequence;
|
|
|
3770 only bindings which start with that key sequence will be printed.
|
|
|
3771 Fifth argument MOUSE-ONLY-P says to only print bindings for mouse clicks.
|
|
20
|
3772 */
|
|
|
3773 (map, all, shadow, prefix, mouse_only_p))
|
|
0
|
3774 {
|
|
|
3775 /* This function can GC */
|
|
219
|
3776
|
|
|
3777 /* #### At some point, this function should be changed to accept a
|
|
|
3778 BUFFER argument. Currently, the BUFFER argument to
|
|
|
3779 describe_map_tree is being used only internally. */
|
|
0
|
3780 describe_map_tree (map, NILP (all), shadow, prefix,
|
|
219
|
3781 !NILP (mouse_only_p), Fcurrent_buffer ());
|
|
173
|
3782 return Qnil;
|
|
0
|
3783 }
|
|
|
3784
|
|
|
3785
|
|
|
3786 /* Insert a desription of the key bindings in STARTMAP,
|
|
|
3787 followed by those of all maps reachable through STARTMAP.
|
|
|
3788 If PARTIAL is nonzero, omit certain "uninteresting" commands
|
|
|
3789 (such as `undefined').
|
|
|
3790 If SHADOW is non-nil, it is a list of other maps;
|
|
|
3791 don't mention keys which would be shadowed by any of them
|
|
185
|
3792 If PREFIX is non-nil, only list bindings which start with those keys.
|
|
0
|
3793 */
|
|
|
3794
|
|
|
3795 void
|
|
|
3796 describe_map_tree (Lisp_Object startmap, int partial, Lisp_Object shadow,
|
|
219
|
3797 Lisp_Object prefix, int mice_only_p, Lisp_Object buffer)
|
|
0
|
3798 {
|
|
|
3799 /* This function can GC */
|
|
|
3800 Lisp_Object maps = Qnil;
|
|
|
3801 struct gcpro gcpro1, gcpro2; /* get_keymap may autoload */
|
|
|
3802 GCPRO2 (maps, shadow);
|
|
|
3803
|
|
|
3804 maps = Faccessible_keymaps (startmap, prefix);
|
|
|
3805
|
|
|
3806 for (; !NILP (maps); maps = Fcdr (maps))
|
|
|
3807 {
|
|
|
3808 Lisp_Object sub_shadow = Qnil;
|
|
|
3809 Lisp_Object elt = Fcar (maps);
|
|
185
|
3810 Lisp_Object tail;
|
|
0
|
3811 int no_prefix = (VECTORP (Fcar (elt))
|
|
|
3812 && XINT (Flength (Fcar (elt))) == 0);
|
|
|
3813 struct gcpro ngcpro1, ngcpro2, ngcpro3;
|
|
|
3814 NGCPRO3 (sub_shadow, elt, tail);
|
|
|
3815
|
|
185
|
3816 for (tail = shadow; CONSP (tail); tail = XCDR (tail))
|
|
0
|
3817 {
|
|
185
|
3818 Lisp_Object shmap = XCAR (tail);
|
|
0
|
3819
|
|
|
3820 /* If the sequence by which we reach this keymap is zero-length,
|
|
|
3821 then the shadow maps for this keymap are just SHADOW. */
|
|
|
3822 if (no_prefix)
|
|
|
3823 ;
|
|
|
3824 /* If the sequence by which we reach this keymap actually has
|
|
|
3825 some elements, then the sequence's definition in SHADOW is
|
|
|
3826 what we should use. */
|
|
|
3827 else
|
|
|
3828 {
|
|
185
|
3829 shmap = Flookup_key (shmap, Fcar (elt), Qt);
|
|
|
3830 if (CHARP (shmap))
|
|
|
3831 shmap = Qnil;
|
|
0
|
3832 }
|
|
|
3833
|
|
185
|
3834 if (!NILP (shmap))
|
|
0
|
3835 {
|
|
185
|
3836 Lisp_Object shm = get_keymap (shmap, 0, 1);
|
|
|
3837 /* If shmap is not nil and not a keymap, it completely
|
|
|
3838 shadows this map, so don't describe this map at all. */
|
|
0
|
3839 if (!KEYMAPP (shm))
|
|
|
3840 goto SKIP;
|
|
|
3841 sub_shadow = Fcons (shm, sub_shadow);
|
|
|
3842 }
|
|
|
3843 }
|
|
|
3844
|
|
|
3845 {
|
|
|
3846 /* Describe the contents of map MAP, assuming that this map
|
|
|
3847 itself is reached by the sequence of prefix keys KEYS (a vector).
|
|
|
3848 PARTIAL and SHADOW are as in `describe_map_tree'. */
|
|
|
3849 Lisp_Object keysdesc
|
|
|
3850 = ((!no_prefix)
|
|
|
3851 ? concat2 (Fkey_description (Fcar (elt)), Vsingle_space_string)
|
|
|
3852 : Qnil);
|
|
|
3853 describe_map (Fcdr (elt), keysdesc,
|
|
|
3854 describe_command,
|
|
|
3855 partial,
|
|
|
3856 sub_shadow,
|
|
219
|
3857 mice_only_p,
|
|
|
3858 buffer);
|
|
0
|
3859 }
|
|
|
3860 SKIP:
|
|
|
3861 NUNGCPRO;
|
|
|
3862 }
|
|
|
3863 UNGCPRO;
|
|
|
3864 }
|
|
|
3865
|
|
|
3866
|
|
|
3867 static void
|
|
219
|
3868 describe_command (Lisp_Object definition, Lisp_Object buffer)
|
|
0
|
3869 {
|
|
|
3870 /* This function can GC */
|
|
|
3871 int keymapp = !NILP (Fkeymapp (definition));
|
|
219
|
3872 struct gcpro gcpro1;
|
|
|
3873 GCPRO1 (definition);
|
|
|
3874
|
|
0
|
3875 Findent_to (make_int (16), make_int (3), buffer);
|
|
|
3876 if (keymapp)
|
|
|
3877 buffer_insert_c_string (XBUFFER (buffer), "<< ");
|
|
|
3878
|
|
|
3879 if (SYMBOLP (definition))
|
|
|
3880 {
|
|
|
3881 buffer_insert1 (XBUFFER (buffer), Fsymbol_name (definition));
|
|
|
3882 }
|
|
|
3883 else if (STRINGP (definition) || VECTORP (definition))
|
|
|
3884 {
|
|
|
3885 buffer_insert_c_string (XBUFFER (buffer), "Kbd Macro: ");
|
|
|
3886 buffer_insert1 (XBUFFER (buffer), Fkey_description (definition));
|
|
|
3887 }
|
|
|
3888 else if (COMPILED_FUNCTIONP (definition))
|
|
|
3889 buffer_insert_c_string (XBUFFER (buffer), "Anonymous Compiled Function");
|
|
|
3890 else if (CONSP (definition) && EQ (XCAR (definition), Qlambda))
|
|
|
3891 buffer_insert_c_string (XBUFFER (buffer), "Anonymous Lambda");
|
|
|
3892 else if (KEYMAPP (definition))
|
|
|
3893 {
|
|
|
3894 Lisp_Object name = XKEYMAP (definition)->name;
|
|
|
3895 if (STRINGP (name) || (SYMBOLP (name) && !NILP (name)))
|
|
|
3896 {
|
|
|
3897 buffer_insert_c_string (XBUFFER (buffer), "Prefix command ");
|
|
185
|
3898 if (SYMBOLP (name)
|
|
0
|
3899 && EQ (find_symbol_value (name), definition))
|
|
|
3900 buffer_insert1 (XBUFFER (buffer), Fsymbol_name (name));
|
|
|
3901 else
|
|
|
3902 {
|
|
|
3903 buffer_insert1 (XBUFFER (buffer), Fprin1_to_string (name, Qnil));
|
|
|
3904 }
|
|
|
3905 }
|
|
|
3906 else
|
|
|
3907 buffer_insert_c_string (XBUFFER (buffer), "Prefix Command");
|
|
|
3908 }
|
|
|
3909 else
|
|
|
3910 buffer_insert_c_string (XBUFFER (buffer), "??");
|
|
|
3911
|
|
|
3912 if (keymapp)
|
|
|
3913 buffer_insert_c_string (XBUFFER (buffer), " >>");
|
|
|
3914 buffer_insert_c_string (XBUFFER (buffer), "\n");
|
|
|
3915 UNGCPRO;
|
|
|
3916 }
|
|
|
3917
|
|
|
3918 struct describe_map_closure
|
|
|
3919 {
|
|
|
3920 Lisp_Object *list; /* pointer to the list to update */
|
|
|
3921 Lisp_Object partial; /* whether to ignore suppressed commands */
|
|
|
3922 Lisp_Object shadow; /* list of maps shadowing this one */
|
|
|
3923 Lisp_Object self; /* this map */
|
|
|
3924 Lisp_Object self_root; /* this map, or some map that has this map as
|
|
|
3925 a parent. this is the base of the tree */
|
|
|
3926 int mice_only_p; /* whether we are to display only button bindings */
|
|
|
3927 };
|
|
|
3928
|
|
|
3929 struct describe_map_shadow_closure
|
|
|
3930 {
|
|
|
3931 CONST struct key_data *raw_key;
|
|
|
3932 Lisp_Object self;
|
|
|
3933 };
|
|
|
3934
|
|
|
3935 static Lisp_Object
|
|
|
3936 describe_map_mapper_shadow_search (Lisp_Object map, void *arg)
|
|
|
3937 {
|
|
185
|
3938 struct describe_map_shadow_closure *c =
|
|
|
3939 (struct describe_map_shadow_closure *) arg;
|
|
0
|
3940
|
|
|
3941 if (EQ (map, c->self))
|
|
173
|
3942 return Qzero; /* Not shadowed; terminate search */
|
|
185
|
3943
|
|
|
3944 return (!NILP (keymap_lookup_directly (map,
|
|
|
3945 c->raw_key->keysym,
|
|
|
3946 c->raw_key->modifiers)))
|
|
|
3947 ? Qt : Qnil;
|
|
0
|
3948 }
|
|
185
|
3949
|
|
0
|
3950
|
|
|
3951 static Lisp_Object
|
|
|
3952 keymap_lookup_inherited_mapper (Lisp_Object km, void *arg)
|
|
|
3953 {
|
|
185
|
3954 struct key_data *k = (struct key_data *) arg;
|
|
173
|
3955 return keymap_lookup_directly (km, k->keysym, k->modifiers);
|
|
0
|
3956 }
|
|
|
3957
|
|
|
3958
|
|
|
3959 static void
|
|
|
3960 describe_map_mapper (CONST struct key_data *key,
|
|
|
3961 Lisp_Object binding,
|
|
|
3962 void *describe_map_closure)
|
|
|
3963 {
|
|
|
3964 /* This function can GC */
|
|
185
|
3965 struct describe_map_closure *closure =
|
|
|
3966 (struct describe_map_closure *) describe_map_closure;
|
|
0
|
3967 Lisp_Object keysym = key->keysym;
|
|
|
3968 unsigned int modifiers = key->modifiers;
|
|
|
3969
|
|
|
3970 /* Dont mention suppressed commands. */
|
|
|
3971 if (SYMBOLP (binding)
|
|
|
3972 && !NILP (closure->partial)
|
|
|
3973 && !NILP (Fget (binding, closure->partial, Qnil)))
|
|
|
3974 return;
|
|
185
|
3975
|
|
0
|
3976 /* If we're only supposed to display mouse bindings and this isn't one,
|
|
|
3977 then bug out. */
|
|
|
3978 if (closure->mice_only_p &&
|
|
185
|
3979 (! (EQ (keysym, Qbutton0) ||
|
|
|
3980 EQ (keysym, Qbutton1) ||
|
|
|
3981 EQ (keysym, Qbutton2) ||
|
|
|
3982 EQ (keysym, Qbutton3) ||
|
|
|
3983 EQ (keysym, Qbutton4) ||
|
|
|
3984 EQ (keysym, Qbutton5) ||
|
|
|
3985 EQ (keysym, Qbutton6) ||
|
|
215
|
3986 EQ (keysym, Qbutton7) ||
|
|
|
3987 EQ (keysym, Qbutton0up) ||
|
|
|
3988 EQ (keysym, Qbutton1up) ||
|
|
|
3989 EQ (keysym, Qbutton2up) ||
|
|
|
3990 EQ (keysym, Qbutton3up) ||
|
|
|
3991 EQ (keysym, Qbutton4up) ||
|
|
|
3992 EQ (keysym, Qbutton5up) ||
|
|
|
3993 EQ (keysym, Qbutton6up) ||
|
|
|
3994 EQ (keysym, Qbutton7up))))
|
|
0
|
3995 return;
|
|
|
3996
|
|
|
3997 /* If this command in this map is shadowed by some other map, ignore it. */
|
|
|
3998 {
|
|
|
3999 Lisp_Object tail;
|
|
|
4000
|
|
|
4001 for (tail = closure->shadow; CONSP (tail); tail = XCDR (tail))
|
|
|
4002 {
|
|
|
4003 QUIT;
|
|
|
4004 if (!NILP (traverse_keymaps (XCAR (tail), Qnil,
|
|
|
4005 keymap_lookup_inherited_mapper,
|
|
|
4006 /* Cast to discard `const' */
|
|
|
4007 (void *)key)))
|
|
|
4008 return;
|
|
|
4009 }
|
|
|
4010 }
|
|
|
4011
|
|
|
4012 /* If this key is in some map of which this map is a parent, then ignore
|
|
|
4013 it (in that case, it has been shadowed).
|
|
|
4014 */
|
|
|
4015 {
|
|
|
4016 Lisp_Object sh;
|
|
|
4017 struct describe_map_shadow_closure c;
|
|
|
4018 c.raw_key = key;
|
|
|
4019 c.self = closure->self;
|
|
|
4020
|
|
|
4021 sh = traverse_keymaps (closure->self_root, Qnil,
|
|
|
4022 describe_map_mapper_shadow_search, &c);
|
|
|
4023 if (!NILP (sh) && !ZEROP (sh))
|
|
|
4024 return;
|
|
|
4025 }
|
|
|
4026
|
|
|
4027 /* Otherwise add it to the list to be sorted. */
|
|
|
4028 *(closure->list) = Fcons (Fcons (Fcons (keysym, make_int (modifiers)),
|
|
|
4029 binding),
|
|
|
4030 *(closure->list));
|
|
|
4031 }
|
|
|
4032
|
|
|
4033
|
|
|
4034 static int
|
|
185
|
4035 describe_map_sort_predicate (Lisp_Object obj1, Lisp_Object obj2,
|
|
0
|
4036 Lisp_Object pred)
|
|
|
4037 {
|
|
|
4038 /* obj1 and obj2 are conses of the form
|
|
|
4039 ( ( <keysym> . <modifiers> ) . <binding> )
|
|
|
4040 keysym and modifiers are used, binding is ignored.
|
|
|
4041 */
|
|
|
4042 unsigned int bit1, bit2;
|
|
|
4043 obj1 = XCAR (obj1);
|
|
|
4044 obj2 = XCAR (obj2);
|
|
|
4045 bit1 = XINT (XCDR (obj1));
|
|
|
4046 bit2 = XINT (XCDR (obj2));
|
|
|
4047 if (bit1 != bit2)
|
|
173
|
4048 return bit1 < bit2 ? 1 : -1;
|
|
0
|
4049 else
|
|
|
4050 return map_keymap_sort_predicate (obj1, obj2, pred);
|
|
|
4051 }
|
|
|
4052
|
|
|
4053 /* Elide 2 or more consecutive numeric keysyms bound to the same thing,
|
|
|
4054 or 2 or more symbolic keysyms that are bound to the same thing and
|
|
|
4055 have consecutive character-set-properties.
|
|
|
4056 */
|
|
|
4057 static int
|
|
|
4058 elide_next_two_p (Lisp_Object list)
|
|
|
4059 {
|
|
|
4060 Lisp_Object s1, s2;
|
|
|
4061
|
|
|
4062 if (NILP (XCDR (list)))
|
|
|
4063 return 0;
|
|
|
4064
|
|
|
4065 /* next two bindings differ */
|
|
|
4066 if (!EQ (XCDR (XCAR (list)),
|
|
|
4067 XCDR (XCAR (XCDR (list)))))
|
|
|
4068 return 0;
|
|
|
4069
|
|
|
4070 /* next two modifier-sets differ */
|
|
|
4071 if (!EQ (XCDR (XCAR (XCAR (list))),
|
|
|
4072 XCDR (XCAR (XCAR (XCDR (list))))))
|
|
|
4073 return 0;
|
|
|
4074
|
|
|
4075 s1 = XCAR (XCAR (XCAR (list)));
|
|
|
4076 s2 = XCAR (XCAR (XCAR (XCDR (list))));
|
|
|
4077
|
|
|
4078 if (SYMBOLP (s1))
|
|
|
4079 {
|
|
|
4080 Lisp_Object code = Fget (s1, Vcharacter_set_property, Qnil);
|
|
70
|
4081 if (CHAR_OR_CHAR_INTP (code))
|
|
|
4082 {
|
|
|
4083 s1 = code;
|
|
|
4084 CHECK_CHAR_COERCE_INT (s1);
|
|
|
4085 }
|
|
0
|
4086 else return 0;
|
|
|
4087 }
|
|
|
4088 if (SYMBOLP (s2))
|
|
|
4089 {
|
|
|
4090 Lisp_Object code = Fget (s2, Vcharacter_set_property, Qnil);
|
|
70
|
4091 if (CHAR_OR_CHAR_INTP (code))
|
|
|
4092 {
|
|
|
4093 s2 = code;
|
|
|
4094 CHECK_CHAR_COERCE_INT (s2);
|
|
|
4095 }
|
|
0
|
4096 else return 0;
|
|
|
4097 }
|
|
|
4098
|
|
185
|
4099 return (XCHAR (s1) == XCHAR (s2) ||
|
|
|
4100 XCHAR (s1) + 1 == XCHAR (s2));
|
|
0
|
4101 }
|
|
|
4102
|
|
|
4103
|
|
|
4104 static Lisp_Object
|
|
|
4105 describe_map_parent_mapper (Lisp_Object keymap, void *arg)
|
|
|
4106 {
|
|
|
4107 /* This function can GC */
|
|
185
|
4108 struct describe_map_closure *describe_map_closure =
|
|
|
4109 (struct describe_map_closure *) arg;
|
|
0
|
4110 describe_map_closure->self = keymap;
|
|
|
4111 map_keymap (XKEYMAP (keymap)->table,
|
|
|
4112 0, /* don't sort: we'll do it later */
|
|
|
4113 describe_map_mapper, describe_map_closure);
|
|
173
|
4114 return Qnil;
|
|
0
|
4115 }
|
|
|
4116
|
|
|
4117
|
|
185
|
4118 /* Describe the contents of map MAP, assuming that this map itself is
|
|
|
4119 reached by the sequence of prefix keys KEYS (a string or vector).
|
|
|
4120 PARTIAL, SHADOW, NOMENU are as in `describe_map_tree' above. */
|
|
|
4121
|
|
0
|
4122 static void
|
|
|
4123 describe_map (Lisp_Object keymap, Lisp_Object elt_prefix,
|
|
219
|
4124 void (*elt_describer) (Lisp_Object, Lisp_Object),
|
|
185
|
4125 int partial,
|
|
0
|
4126 Lisp_Object shadow,
|
|
219
|
4127 int mice_only_p,
|
|
|
4128 Lisp_Object buffer)
|
|
0
|
4129 {
|
|
|
4130 /* This function can GC */
|
|
|
4131 struct describe_map_closure describe_map_closure;
|
|
|
4132 Lisp_Object list = Qnil;
|
|
219
|
4133 struct buffer *buf = XBUFFER (buffer);
|
|
0
|
4134 Emchar printable_min = (CHAR_OR_CHAR_INTP (buf->ctl_arrow)
|
|
|
4135 ? XCHAR_OR_CHAR_INT (buf->ctl_arrow)
|
|
|
4136 : ((EQ (buf->ctl_arrow, Qt)
|
|
|
4137 || EQ (buf->ctl_arrow, Qnil))
|
|
|
4138 ? 256 : 160));
|
|
|
4139 int elided = 0;
|
|
|
4140 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
4141
|
|
|
4142 keymap = get_keymap (keymap, 1, 1);
|
|
|
4143 describe_map_closure.partial = (partial ? Qsuppress_keymap : Qnil);
|
|
|
4144 describe_map_closure.shadow = shadow;
|
|
|
4145 describe_map_closure.list = &list;
|
|
|
4146 describe_map_closure.self_root = keymap;
|
|
|
4147 describe_map_closure.mice_only_p = mice_only_p;
|
|
|
4148
|
|
|
4149 GCPRO4 (keymap, elt_prefix, shadow, list);
|
|
|
4150
|
|
|
4151 traverse_keymaps (keymap, Qnil,
|
|
|
4152 describe_map_parent_mapper, &describe_map_closure);
|
|
|
4153
|
|
|
4154 if (!NILP (list))
|
|
|
4155 {
|
|
|
4156 list = list_sort (list, Qnil, describe_map_sort_predicate);
|
|
|
4157 buffer_insert_c_string (buf, "\n");
|
|
|
4158 while (!NILP (list))
|
|
|
4159 {
|
|
|
4160 Lisp_Object elt = XCAR (XCAR (list));
|
|
|
4161 Lisp_Object keysym = XCAR (elt);
|
|
|
4162 unsigned int modifiers = XINT (XCDR (elt));
|
|
|
4163
|
|
|
4164 if (!NILP (elt_prefix))
|
|
|
4165 buffer_insert_lisp_string (buf, elt_prefix);
|
|
|
4166
|
|
|
4167 if (modifiers & MOD_META) buffer_insert_c_string (buf, "M-");
|
|
|
4168 if (modifiers & MOD_CONTROL) buffer_insert_c_string (buf, "C-");
|
|
|
4169 if (modifiers & MOD_SUPER) buffer_insert_c_string (buf, "S-");
|
|
|
4170 if (modifiers & MOD_HYPER) buffer_insert_c_string (buf, "H-");
|
|
|
4171 if (modifiers & MOD_ALT) buffer_insert_c_string (buf, "Alt-");
|
|
|
4172 if (modifiers & MOD_SHIFT) buffer_insert_c_string (buf, "Sh-");
|
|
|
4173 if (SYMBOLP (keysym))
|
|
|
4174 {
|
|
|
4175 Lisp_Object code = Fget (keysym, Vcharacter_set_property, Qnil);
|
|
|
4176 Emchar c = (CHAR_OR_CHAR_INTP (code)
|
|
|
4177 ? XCHAR_OR_CHAR_INT (code) : -1);
|
|
|
4178 /* Calling Fsingle_key_description() would cons more */
|
|
|
4179 #if 0 /* This is bogus */
|
|
|
4180 if (EQ (keysym, QKlinefeed))
|
|
|
4181 buffer_insert_c_string (buf, "LFD");
|
|
|
4182 else if (EQ (keysym, QKtab))
|
|
|
4183 buffer_insert_c_string (buf, "TAB");
|
|
|
4184 else if (EQ (keysym, QKreturn))
|
|
|
4185 buffer_insert_c_string (buf, "RET");
|
|
|
4186 else if (EQ (keysym, QKescape))
|
|
|
4187 buffer_insert_c_string (buf, "ESC");
|
|
|
4188 else if (EQ (keysym, QKdelete))
|
|
|
4189 buffer_insert_c_string (buf, "DEL");
|
|
|
4190 else if (EQ (keysym, QKspace))
|
|
|
4191 buffer_insert_c_string (buf, "SPC");
|
|
|
4192 else if (EQ (keysym, QKbackspace))
|
|
|
4193 buffer_insert_c_string (buf, "BS");
|
|
185
|
4194 else
|
|
0
|
4195 #endif
|
|
|
4196 if (c >= printable_min)
|
|
|
4197 buffer_insert_emacs_char (buf, c);
|
|
|
4198 else buffer_insert1 (buf, Fsymbol_name (keysym));
|
|
|
4199 }
|
|
|
4200 else if (CHARP (keysym))
|
|
|
4201 buffer_insert_emacs_char (buf, XCHAR (keysym));
|
|
|
4202 else
|
|
|
4203 buffer_insert_c_string (buf, "---bad keysym---");
|
|
|
4204
|
|
|
4205 if (elided)
|
|
|
4206 elided = 0;
|
|
|
4207 else
|
|
|
4208 {
|
|
|
4209 int k = 0;
|
|
|
4210
|
|
|
4211 while (elide_next_two_p (list))
|
|
|
4212 {
|
|
|
4213 k++;
|
|
|
4214 list = XCDR (list);
|
|
|
4215 }
|
|
|
4216 if (k != 0)
|
|
|
4217 {
|
|
|
4218 if (k == 1)
|
|
|
4219 buffer_insert_c_string (buf, ", ");
|
|
|
4220 else
|
|
|
4221 buffer_insert_c_string (buf, " .. ");
|
|
|
4222 elided = 1;
|
|
|
4223 continue;
|
|
|
4224 }
|
|
|
4225 }
|
|
|
4226
|
|
|
4227 /* Print a description of the definition of this character. */
|
|
219
|
4228 (*elt_describer) (XCDR (XCAR (list)), buffer);
|
|
0
|
4229 list = XCDR (list);
|
|
|
4230 }
|
|
|
4231 }
|
|
|
4232 UNGCPRO;
|
|
|
4233 }
|
|
|
4234
|
|
|
4235
|
|
|
4236 void
|
|
|
4237 syms_of_keymap (void)
|
|
|
4238 {
|
|
|
4239 defsymbol (&Qminor_mode_map_alist, "minor-mode-map-alist");
|
|
|
4240
|
|
|
4241 defsymbol (&Qkeymapp, "keymapp");
|
|
|
4242
|
|
|
4243 defsymbol (&Qsuppress_keymap, "suppress-keymap");
|
|
|
4244
|
|
|
4245 defsymbol (&Qmodeline_map, "modeline-map");
|
|
|
4246 defsymbol (&Qtoolbar_map, "toolbar-map");
|
|
|
4247
|
|
20
|
4248 DEFSUBR (Fkeymap_parents);
|
|
|
4249 DEFSUBR (Fset_keymap_parents);
|
|
|
4250 DEFSUBR (Fkeymap_name);
|
|
|
4251 DEFSUBR (Fset_keymap_name);
|
|
|
4252 DEFSUBR (Fkeymap_prompt);
|
|
|
4253 DEFSUBR (Fset_keymap_prompt);
|
|
|
4254 DEFSUBR (Fkeymap_default_binding);
|
|
|
4255 DEFSUBR (Fset_keymap_default_binding);
|
|
|
4256
|
|
|
4257 DEFSUBR (Fkeymapp);
|
|
|
4258 DEFSUBR (Fmake_keymap);
|
|
|
4259 DEFSUBR (Fmake_sparse_keymap);
|
|
|
4260
|
|
|
4261 DEFSUBR (Fcopy_keymap);
|
|
|
4262 DEFSUBR (Fkeymap_fullness);
|
|
|
4263 DEFSUBR (Fmap_keymap);
|
|
|
4264 DEFSUBR (Fevent_matches_key_specifier_p);
|
|
|
4265 DEFSUBR (Fdefine_key);
|
|
|
4266 DEFSUBR (Flookup_key);
|
|
|
4267 DEFSUBR (Fkey_binding);
|
|
|
4268 DEFSUBR (Fuse_global_map);
|
|
|
4269 DEFSUBR (Fuse_local_map);
|
|
|
4270 DEFSUBR (Fcurrent_local_map);
|
|
|
4271 DEFSUBR (Fcurrent_global_map);
|
|
|
4272 DEFSUBR (Fcurrent_keymaps);
|
|
|
4273 DEFSUBR (Faccessible_keymaps);
|
|
|
4274 DEFSUBR (Fkey_description);
|
|
|
4275 DEFSUBR (Fsingle_key_description);
|
|
|
4276 DEFSUBR (Fwhere_is_internal);
|
|
|
4277 DEFSUBR (Fdescribe_bindings_internal);
|
|
|
4278
|
|
|
4279 DEFSUBR (Ftext_char_description);
|
|
0
|
4280
|
|
|
4281 defsymbol (&Qcontrol, "control");
|
|
|
4282 defsymbol (&Qctrl, "ctrl");
|
|
185
|
4283 defsymbol (&Qmeta, "meta");
|
|
|
4284 defsymbol (&Qsuper, "super");
|
|
|
4285 defsymbol (&Qhyper, "hyper");
|
|
0
|
4286 defsymbol (&Qalt, "alt");
|
|
|
4287 defsymbol (&Qshift, "shift");
|
|
|
4288 defsymbol (&Qbutton0, "button0");
|
|
|
4289 defsymbol (&Qbutton1, "button1");
|
|
|
4290 defsymbol (&Qbutton2, "button2");
|
|
|
4291 defsymbol (&Qbutton3, "button3");
|
|
|
4292 defsymbol (&Qbutton4, "button4");
|
|
|
4293 defsymbol (&Qbutton5, "button5");
|
|
|
4294 defsymbol (&Qbutton6, "button6");
|
|
|
4295 defsymbol (&Qbutton7, "button7");
|
|
|
4296 defsymbol (&Qbutton0up, "button0up");
|
|
|
4297 defsymbol (&Qbutton1up, "button1up");
|
|
|
4298 defsymbol (&Qbutton2up, "button2up");
|
|
|
4299 defsymbol (&Qbutton3up, "button3up");
|
|
|
4300 defsymbol (&Qbutton4up, "button4up");
|
|
|
4301 defsymbol (&Qbutton5up, "button5up");
|
|
|
4302 defsymbol (&Qbutton6up, "button6up");
|
|
|
4303 defsymbol (&Qbutton7up, "button7up");
|
|
249
|
4304 #if defined(HAVE_OFFIX_DND) || defined(HAVE_MS_WINDOWS)
|
|
197
|
4305 defsymbol (&Qdrop0, "drop0");
|
|
|
4306 defsymbol (&Qdrop1, "drop1");
|
|
|
4307 defsymbol (&Qdrop2, "drop2");
|
|
|
4308 defsymbol (&Qdrop3, "drop3");
|
|
|
4309 defsymbol (&Qdrop4, "drop4");
|
|
|
4310 defsymbol (&Qdrop5, "drop5");
|
|
|
4311 defsymbol (&Qdrop6, "drop6");
|
|
|
4312 defsymbol (&Qdrop7, "drop7");
|
|
|
4313 #endif
|
|
98
|
4314 defsymbol (&Qmouse_1, "mouse-1");
|
|
|
4315 defsymbol (&Qmouse_2, "mouse-2");
|
|
|
4316 defsymbol (&Qmouse_3, "mouse-3");
|
|
265
|
4317 defsymbol (&Qmouse_4, "mouse-4");
|
|
|
4318 defsymbol (&Qmouse_5, "mouse-5");
|
|
98
|
4319 defsymbol (&Qdown_mouse_1, "down-mouse-1");
|
|
|
4320 defsymbol (&Qdown_mouse_2, "down-mouse-2");
|
|
|
4321 defsymbol (&Qdown_mouse_3, "down-mouse-3");
|
|
265
|
4322 defsymbol (&Qdown_mouse_4, "down-mouse-4");
|
|
|
4323 defsymbol (&Qdown_mouse_5, "down-mouse-5");
|
|
0
|
4324 defsymbol (&Qmenu_selection, "menu-selection");
|
|
|
4325 defsymbol (&QLFD, "LFD");
|
|
|
4326 defsymbol (&QTAB, "TAB");
|
|
|
4327 defsymbol (&QRET, "RET");
|
|
|
4328 defsymbol (&QESC, "ESC");
|
|
|
4329 defsymbol (&QDEL, "DEL");
|
|
|
4330 defsymbol (&QBS, "BS");
|
|
|
4331 }
|
|
|
4332
|
|
|
4333 void
|
|
|
4334 vars_of_keymap (void)
|
|
|
4335 {
|
|
|
4336 DEFVAR_LISP ("meta-prefix-char", &Vmeta_prefix_char /*
|
|
|
4337 Meta-prefix character.
|
|
|
4338 This character followed by some character `foo' turns into `Meta-foo'.
|
|
|
4339 This can be any form recognized as a single key specifier.
|
|
|
4340 To disable the meta-prefix-char, set it to a negative number.
|
|
|
4341 */ );
|
|
|
4342 Vmeta_prefix_char = make_char (033);
|
|
|
4343
|
|
|
4344 DEFVAR_LISP ("mouse-grabbed-buffer", &Vmouse_grabbed_buffer /*
|
|
|
4345 A buffer which should be consulted first for all mouse activity.
|
|
|
4346 When a mouse-click is processed, it will first be looked up in the
|
|
|
4347 local-map of this buffer, and then through the normal mechanism if there
|
|
|
4348 is no binding for that click. This buffer's value of `mode-motion-hook'
|
|
|
4349 will be consulted instead of the `mode-motion-hook' of the buffer of the
|
|
|
4350 window under the mouse. You should *bind* this, not set it.
|
|
|
4351 */ );
|
|
|
4352 Vmouse_grabbed_buffer = Qnil;
|
|
|
4353
|
|
|
4354 DEFVAR_LISP ("overriding-local-map", &Voverriding_local_map /*
|
|
|
4355 Keymap that overrides all other local keymaps.
|
|
|
4356 If this variable is non-nil, it is used as a keymap instead of the
|
|
|
4357 buffer's local map, and the minor mode keymaps and extent-local keymaps.
|
|
|
4358 You should *bind* this, not set it.
|
|
|
4359 */ );
|
|
|
4360 Voverriding_local_map = Qnil;
|
|
|
4361
|
|
|
4362 Fset (Qminor_mode_map_alist, Qnil);
|
|
|
4363
|
|
|
4364 DEFVAR_LISP ("key-translation-map", &Vkey_translation_map /*
|
|
|
4365 Keymap of key translations that can override keymaps.
|
|
|
4366 This keymap works like `function-key-map', but comes after that,
|
|
|
4367 and applies even for keys that have ordinary bindings.
|
|
|
4368 */ );
|
|
|
4369
|
|
|
4370 DEFVAR_INT ("keymap-tick", &keymap_tick /*
|
|
|
4371 Incremented for each change to any keymap.
|
|
|
4372 */ );
|
|
|
4373 keymap_tick = 0;
|
|
|
4374
|
|
|
4375 staticpro (&Vcurrent_global_map);
|
|
|
4376
|
|
|
4377 Vsingle_space_string = make_pure_string ((CONST Bufbyte *) " ", 1, Qnil, 1);
|
|
|
4378 staticpro (&Vsingle_space_string);
|
|
|
4379 }
|
|
|
4380
|
|
|
4381 void
|
|
|
4382 complex_vars_of_keymap (void)
|
|
|
4383 {
|
|
|
4384 /* This function can GC */
|
|
|
4385 Lisp_Object ESC_prefix = intern ("ESC-prefix");
|
|
|
4386 Lisp_Object meta_disgustitute;
|
|
|
4387
|
|
|
4388 Vcurrent_global_map = Fmake_keymap (Qnil);
|
|
|
4389
|
|
|
4390 meta_disgustitute = Fmake_keymap (Qnil);
|
|
|
4391 Ffset (ESC_prefix, meta_disgustitute);
|
|
|
4392 /* no need to protect meta_disgustitute, though */
|
|
|
4393 keymap_store_internal (MAKE_MODIFIER_HASH_KEY (MOD_META),
|
|
|
4394 XKEYMAP (Vcurrent_global_map),
|
|
|
4395 meta_disgustitute);
|
|
|
4396 XKEYMAP (Vcurrent_global_map)->sub_maps_cache = Qt;
|
|
|
4397
|
|
|
4398 Vkey_translation_map = Fmake_sparse_keymap (intern ("key-translation-map"));
|
|
|
4399 }
|
