Commit | Line | Data |
---|---|---|
2c6f1a39 | 1 | /* Manipulation of keymaps |
d4ae91d2 | 2 | Copyright (C) 1985, 86,87,88,93,94,95,98,99, 2000, 2001 |
11adc310 | 3 | Free Software Foundation, Inc. |
2c6f1a39 JB |
4 | |
5 | This file is part of GNU Emacs. | |
6 | ||
7 | GNU Emacs is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
502ddf23 | 9 | the Free Software Foundation; either version 2, or (at your option) |
2c6f1a39 JB |
10 | any later version. |
11 | ||
12 | GNU Emacs is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU Emacs; see the file COPYING. If not, write to | |
3b7ad313 EN |
19 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
2c6f1a39 JB |
21 | |
22 | ||
18160b98 | 23 | #include <config.h> |
2c6f1a39 | 24 | #include <stdio.h> |
2c6f1a39 JB |
25 | #include "lisp.h" |
26 | #include "commands.h" | |
27 | #include "buffer.h" | |
a98f1d1d | 28 | #include "charset.h" |
6bbbd9b0 | 29 | #include "keyboard.h" |
6ba6e250 | 30 | #include "termhooks.h" |
9ac0d9e0 | 31 | #include "blockinput.h" |
d964248c | 32 | #include "puresize.h" |
93d2aa1c | 33 | #include "intervals.h" |
8feddab4 | 34 | #include "keymap.h" |
2c6f1a39 | 35 | |
f5b79c1c | 36 | /* The number of elements in keymap vectors. */ |
2c6f1a39 JB |
37 | #define DENSE_TABLE_SIZE (0200) |
38 | ||
39 | /* Actually allocate storage for these variables */ | |
40 | ||
41 | Lisp_Object current_global_map; /* Current global keymap */ | |
42 | ||
43 | Lisp_Object global_map; /* default global key bindings */ | |
44 | ||
45 | Lisp_Object meta_map; /* The keymap used for globally bound | |
46 | ESC-prefixed default commands */ | |
47 | ||
48 | Lisp_Object control_x_map; /* The keymap used for globally bound | |
49 | C-x-prefixed default commands */ | |
50 | ||
51 | /* was MinibufLocalMap */ | |
52 | Lisp_Object Vminibuffer_local_map; | |
53 | /* The keymap used by the minibuf for local | |
54 | bindings when spaces are allowed in the | |
55 | minibuf */ | |
56 | ||
57 | /* was MinibufLocalNSMap */ | |
d55627cc | 58 | Lisp_Object Vminibuffer_local_ns_map; |
2c6f1a39 JB |
59 | /* The keymap used by the minibuf for local |
60 | bindings when spaces are not encouraged | |
61 | in the minibuf */ | |
62 | ||
63 | /* keymap used for minibuffers when doing completion */ | |
64 | /* was MinibufLocalCompletionMap */ | |
65 | Lisp_Object Vminibuffer_local_completion_map; | |
66 | ||
67 | /* keymap used for minibuffers when doing completion and require a match */ | |
68 | /* was MinibufLocalMustMatchMap */ | |
69 | Lisp_Object Vminibuffer_local_must_match_map; | |
70 | ||
cc0a8174 JB |
71 | /* Alist of minor mode variables and keymaps. */ |
72 | Lisp_Object Vminor_mode_map_alist; | |
73 | ||
dd9cda06 RS |
74 | /* Alist of major-mode-specific overrides for |
75 | minor mode variables and keymaps. */ | |
76 | Lisp_Object Vminor_mode_overriding_map_alist; | |
77 | ||
99cbcaca KS |
78 | /* List of emulation mode keymap alists. */ |
79 | Lisp_Object Vemulation_mode_map_alists; | |
80 | ||
6bbbd9b0 JB |
81 | /* Keymap mapping ASCII function key sequences onto their preferred forms. |
82 | Initialized by the terminal-specific lisp files. See DEFVAR for more | |
83 | documentation. */ | |
84 | Lisp_Object Vfunction_key_map; | |
85 | ||
d7bf9bf5 RS |
86 | /* Keymap mapping ASCII function key sequences onto their preferred forms. */ |
87 | Lisp_Object Vkey_translation_map; | |
88 | ||
107fd03d RS |
89 | /* A list of all commands given new bindings since a certain time |
90 | when nil was stored here. | |
91 | This is used to speed up recomputation of menu key equivalents | |
92 | when Emacs starts up. t means don't record anything here. */ | |
93 | Lisp_Object Vdefine_key_rebound_commands; | |
94 | ||
a1df473f | 95 | Lisp_Object Qkeymapp, Qkeymap, Qnon_ascii, Qmenu_item, Qremap; |
2c6f1a39 | 96 | |
ade19cac RS |
97 | /* Alist of elements like (DEL . "\d"). */ |
98 | static Lisp_Object exclude_keys; | |
99 | ||
023b93f6 KS |
100 | /* Pre-allocated 2-element vector for Fcommand_remapping to use. */ |
101 | static Lisp_Object command_remapping_vector; | |
a1df473f | 102 | |
3d248688 JB |
103 | /* A char with the CHAR_META bit set in a vector or the 0200 bit set |
104 | in a string key sequence is equivalent to prefixing with this | |
105 | character. */ | |
2c6f1a39 JB |
106 | extern Lisp_Object meta_prefix_char; |
107 | ||
7d92e329 RS |
108 | extern Lisp_Object Voverriding_local_map; |
109 | ||
1e7d1ab0 SM |
110 | /* Hash table used to cache a reverse-map to speed up calls to where-is. */ |
111 | static Lisp_Object where_is_cache; | |
112 | /* Which keymaps are reverse-stored in the cache. */ | |
113 | static Lisp_Object where_is_cache_keymaps; | |
114 | ||
57495396 SM |
115 | static Lisp_Object store_in_keymap P_ ((Lisp_Object, Lisp_Object, Lisp_Object)); |
116 | static void fix_submap_inheritance P_ ((Lisp_Object, Lisp_Object, Lisp_Object)); | |
117 | ||
118 | static Lisp_Object define_as_prefix P_ ((Lisp_Object, Lisp_Object)); | |
d55627cc SM |
119 | static void describe_command P_ ((Lisp_Object, Lisp_Object)); |
120 | static void describe_translation P_ ((Lisp_Object, Lisp_Object)); | |
57495396 | 121 | static void describe_map P_ ((Lisp_Object, Lisp_Object, |
d55627cc | 122 | void (*) P_ ((Lisp_Object, Lisp_Object)), |
57495396 | 123 | int, Lisp_Object, Lisp_Object*, int)); |
15fff01d | 124 | static void silly_event_symbol_error P_ ((Lisp_Object)); |
2c6f1a39 | 125 | \f |
cc0a8174 JB |
126 | /* Keymap object support - constructors and predicates. */ |
127 | ||
ce6e5d0b | 128 | DEFUN ("make-keymap", Fmake_keymap, Smake_keymap, 0, 1, 0, |
335c5470 PJ |
129 | doc: /* Construct and return a new keymap, of the form (keymap CHARTABLE . ALIST). |
130 | CHARTABLE is a char-table that holds the bindings for the ASCII | |
131 | characters. ALIST is an assoc-list which holds bindings for function keys, | |
132 | mouse events, and any other things that appear in the input stream. | |
133 | All entries in it are initially nil, meaning "command undefined". | |
134 | ||
135 | The optional arg STRING supplies a menu name for the keymap | |
136 | in case you use it as a menu with `x-popup-menu'. */) | |
137 | (string) | |
ce6e5d0b | 138 | Lisp_Object string; |
2c6f1a39 | 139 | { |
ce6e5d0b RS |
140 | Lisp_Object tail; |
141 | if (!NILP (string)) | |
142 | tail = Fcons (string, Qnil); | |
143 | else | |
144 | tail = Qnil; | |
2c6f1a39 | 145 | return Fcons (Qkeymap, |
0403641f | 146 | Fcons (Fmake_char_table (Qkeymap, Qnil), tail)); |
2c6f1a39 JB |
147 | } |
148 | ||
ce6e5d0b | 149 | DEFUN ("make-sparse-keymap", Fmake_sparse_keymap, Smake_sparse_keymap, 0, 1, 0, |
335c5470 PJ |
150 | doc: /* Construct and return a new sparse keymap. |
151 | Its car is `keymap' and its cdr is an alist of (CHAR . DEFINITION), | |
152 | which binds the character CHAR to DEFINITION, or (SYMBOL . DEFINITION), | |
153 | which binds the function key or mouse event SYMBOL to DEFINITION. | |
154 | Initially the alist is nil. | |
155 | ||
156 | The optional arg STRING supplies a menu name for the keymap | |
157 | in case you use it as a menu with `x-popup-menu'. */) | |
158 | (string) | |
ce6e5d0b | 159 | Lisp_Object string; |
2c6f1a39 | 160 | { |
ce6e5d0b RS |
161 | if (!NILP (string)) |
162 | return Fcons (Qkeymap, Fcons (string, Qnil)); | |
2c6f1a39 JB |
163 | return Fcons (Qkeymap, Qnil); |
164 | } | |
165 | ||
166 | /* This function is used for installing the standard key bindings | |
167 | at initialization time. | |
168 | ||
169 | For example: | |
170 | ||
e25c4e44 | 171 | initial_define_key (control_x_map, Ctl('X'), "exchange-point-and-mark"); */ |
2c6f1a39 JB |
172 | |
173 | void | |
174 | initial_define_key (keymap, key, defname) | |
175 | Lisp_Object keymap; | |
176 | int key; | |
177 | char *defname; | |
178 | { | |
179 | store_in_keymap (keymap, make_number (key), intern (defname)); | |
180 | } | |
181 | ||
e25c4e44 JB |
182 | void |
183 | initial_define_lispy_key (keymap, keyname, defname) | |
184 | Lisp_Object keymap; | |
185 | char *keyname; | |
186 | char *defname; | |
187 | { | |
188 | store_in_keymap (keymap, intern (keyname), intern (defname)); | |
189 | } | |
190 | ||
2c6f1a39 | 191 | DEFUN ("keymapp", Fkeymapp, Skeymapp, 1, 1, 0, |
335c5470 PJ |
192 | doc: /* Return t if OBJECT is a keymap. |
193 | ||
194 | A keymap is a list (keymap . ALIST), | |
195 | or a symbol whose function definition is itself a keymap. | |
196 | ALIST elements look like (CHAR . DEFN) or (SYMBOL . DEFN); | |
197 | a vector of densely packed bindings for small character codes | |
198 | is also allowed as an element. */) | |
199 | (object) | |
2c6f1a39 JB |
200 | Lisp_Object object; |
201 | { | |
02067692 | 202 | return (KEYMAPP (object) ? Qt : Qnil); |
2c6f1a39 JB |
203 | } |
204 | ||
54cbc3d4 | 205 | DEFUN ("keymap-prompt", Fkeymap_prompt, Skeymap_prompt, 1, 1, 0, |
335c5470 PJ |
206 | doc: /* Return the prompt-string of a keymap MAP. |
207 | If non-nil, the prompt is shown in the echo-area | |
208 | when reading a key-sequence to be looked-up in this keymap. */) | |
209 | (map) | |
54cbc3d4 SM |
210 | Lisp_Object map; |
211 | { | |
212 | while (CONSP (map)) | |
213 | { | |
214 | register Lisp_Object tem; | |
215 | tem = Fcar (map); | |
216 | if (STRINGP (tem)) | |
217 | return tem; | |
218 | map = Fcdr (map); | |
219 | } | |
220 | return Qnil; | |
221 | } | |
222 | ||
2c6f1a39 | 223 | /* Check that OBJECT is a keymap (after dereferencing through any |
d09b2024 JB |
224 | symbols). If it is, return it. |
225 | ||
226 | If AUTOLOAD is non-zero and OBJECT is a symbol whose function value | |
227 | is an autoload form, do the autoload and try again. | |
21a0d7a0 | 228 | If AUTOLOAD is nonzero, callers must assume GC is possible. |
d09b2024 | 229 | |
02067692 SM |
230 | If the map needs to be autoloaded, but AUTOLOAD is zero (and ERROR |
231 | is zero as well), return Qt. | |
232 | ||
d09b2024 JB |
233 | ERROR controls how we respond if OBJECT isn't a keymap. |
234 | If ERROR is non-zero, signal an error; otherwise, just return Qnil. | |
235 | ||
236 | Note that most of the time, we don't want to pursue autoloads. | |
237 | Functions like Faccessible_keymaps which scan entire keymap trees | |
238 | shouldn't load every autoloaded keymap. I'm not sure about this, | |
239 | but it seems to me that only read_key_sequence, Flookup_key, and | |
df75b1a3 GM |
240 | Fdefine_key should cause keymaps to be autoloaded. |
241 | ||
242 | This function can GC when AUTOLOAD is non-zero, because it calls | |
243 | do_autoload which can GC. */ | |
d09b2024 | 244 | |
2c6f1a39 | 245 | Lisp_Object |
02067692 | 246 | get_keymap (object, error, autoload) |
2c6f1a39 | 247 | Lisp_Object object; |
d09b2024 | 248 | int error, autoload; |
2c6f1a39 | 249 | { |
d09b2024 | 250 | Lisp_Object tem; |
2c6f1a39 | 251 | |
d09b2024 | 252 | autoload_retry: |
b1314e15 KH |
253 | if (NILP (object)) |
254 | goto end; | |
255 | if (CONSP (object) && EQ (XCAR (object), Qkeymap)) | |
256 | return object; | |
f5b79c1c | 257 | |
02067692 SM |
258 | tem = indirect_function (object); |
259 | if (CONSP (tem)) | |
d09b2024 | 260 | { |
02067692 SM |
261 | if (EQ (XCAR (tem), Qkeymap)) |
262 | return tem; | |
d09b2024 | 263 | |
02067692 SM |
264 | /* Should we do an autoload? Autoload forms for keymaps have |
265 | Qkeymap as their fifth element. */ | |
266 | if ((autoload || !error) && EQ (XCAR (tem), Qautoload)) | |
8e4dfd54 | 267 | { |
02067692 | 268 | Lisp_Object tail; |
d09b2024 | 269 | |
02067692 SM |
270 | tail = Fnth (make_number (4), tem); |
271 | if (EQ (tail, Qkeymap)) | |
272 | { | |
273 | if (autoload) | |
274 | { | |
275 | struct gcpro gcpro1, gcpro2; | |
31bea176 | 276 | |
02067692 SM |
277 | GCPRO2 (tem, object); |
278 | do_autoload (tem, object); | |
279 | UNGCPRO; | |
31bea176 | 280 | |
02067692 SM |
281 | goto autoload_retry; |
282 | } | |
283 | else | |
284 | return Qt; | |
285 | } | |
8e4dfd54 | 286 | } |
d09b2024 JB |
287 | } |
288 | ||
b1314e15 | 289 | end: |
2c6f1a39 JB |
290 | if (error) |
291 | wrong_type_argument (Qkeymapp, object); | |
6bbd7a29 | 292 | return Qnil; |
2c6f1a39 | 293 | } |
7d58ed99 | 294 | \f |
31bea176 SM |
295 | /* Return the parent map of KEYMAP, or nil if it has none. |
296 | We assume that KEYMAP is a valid keymap. */ | |
7d58ed99 | 297 | |
31bea176 SM |
298 | Lisp_Object |
299 | keymap_parent (keymap, autoload) | |
7d58ed99 | 300 | Lisp_Object keymap; |
31bea176 | 301 | int autoload; |
7d58ed99 RS |
302 | { |
303 | Lisp_Object list; | |
304 | ||
31bea176 | 305 | keymap = get_keymap (keymap, 1, autoload); |
7d58ed99 RS |
306 | |
307 | /* Skip past the initial element `keymap'. */ | |
03699b14 KR |
308 | list = XCDR (keymap); |
309 | for (; CONSP (list); list = XCDR (list)) | |
7d58ed99 RS |
310 | { |
311 | /* See if there is another `keymap'. */ | |
57495396 | 312 | if (KEYMAPP (list)) |
7d58ed99 RS |
313 | return list; |
314 | } | |
315 | ||
31bea176 | 316 | return get_keymap (list, 0, autoload); |
7d58ed99 RS |
317 | } |
318 | ||
31bea176 SM |
319 | DEFUN ("keymap-parent", Fkeymap_parent, Skeymap_parent, 1, 1, 0, |
320 | doc: /* Return the parent keymap of KEYMAP. */) | |
321 | (keymap) | |
322 | Lisp_Object keymap; | |
323 | { | |
324 | return keymap_parent (keymap, 1); | |
325 | } | |
3015eec0 | 326 | |
b1904cd9 SM |
327 | /* Check whether MAP is one of MAPS parents. */ |
328 | int | |
329 | keymap_memberp (map, maps) | |
330 | Lisp_Object map, maps; | |
331 | { | |
7e05cdaf | 332 | if (NILP (map)) return 0; |
b1904cd9 | 333 | while (KEYMAPP (maps) && !EQ (map, maps)) |
31bea176 | 334 | maps = keymap_parent (maps, 0); |
b1904cd9 SM |
335 | return (EQ (map, maps)); |
336 | } | |
337 | ||
7d58ed99 RS |
338 | /* Set the parent keymap of MAP to PARENT. */ |
339 | ||
340 | DEFUN ("set-keymap-parent", Fset_keymap_parent, Sset_keymap_parent, 2, 2, 0, | |
335c5470 PJ |
341 | doc: /* Modify KEYMAP to set its parent map to PARENT. |
342 | PARENT should be nil or another keymap. */) | |
343 | (keymap, parent) | |
7d58ed99 RS |
344 | Lisp_Object keymap, parent; |
345 | { | |
346 | Lisp_Object list, prev; | |
31bea176 | 347 | struct gcpro gcpro1, gcpro2; |
7d58ed99 | 348 | int i; |
2c6f1a39 | 349 | |
1e7d1ab0 SM |
350 | /* Force a keymap flush for the next call to where-is. |
351 | Since this can be called from within where-is, we don't set where_is_cache | |
352 | directly but only where_is_cache_keymaps, since where_is_cache shouldn't | |
353 | be changed during where-is, while where_is_cache_keymaps is only used at | |
354 | the very beginning of where-is and can thus be changed here without any | |
355 | adverse effect. | |
356 | This is a very minor correctness (rather than safety) issue. */ | |
357 | where_is_cache_keymaps = Qt; | |
358 | ||
31bea176 | 359 | GCPRO2 (keymap, parent); |
02067692 | 360 | keymap = get_keymap (keymap, 1, 1); |
31bea176 | 361 | |
7d58ed99 | 362 | if (!NILP (parent)) |
3015eec0 | 363 | { |
02067692 | 364 | parent = get_keymap (parent, 1, 1); |
3015eec0 GM |
365 | |
366 | /* Check for cycles. */ | |
b1904cd9 | 367 | if (keymap_memberp (keymap, parent)) |
3015eec0 GM |
368 | error ("Cyclic keymap inheritance"); |
369 | } | |
2c6f1a39 | 370 | |
7d58ed99 RS |
371 | /* Skip past the initial element `keymap'. */ |
372 | prev = keymap; | |
373 | while (1) | |
374 | { | |
03699b14 | 375 | list = XCDR (prev); |
7d58ed99 RS |
376 | /* If there is a parent keymap here, replace it. |
377 | If we came to the end, add the parent in PREV. */ | |
54cbc3d4 | 378 | if (!CONSP (list) || KEYMAPP (list)) |
7d58ed99 | 379 | { |
2a5af1cf RS |
380 | /* If we already have the right parent, return now |
381 | so that we avoid the loops below. */ | |
03699b14 | 382 | if (EQ (XCDR (prev), parent)) |
df75b1a3 | 383 | RETURN_UNGCPRO (parent); |
2a5af1cf | 384 | |
f3fbd155 | 385 | XSETCDR (prev, parent); |
7d58ed99 RS |
386 | break; |
387 | } | |
388 | prev = list; | |
389 | } | |
390 | ||
391 | /* Scan through for submaps, and set their parents too. */ | |
392 | ||
03699b14 | 393 | for (list = XCDR (keymap); CONSP (list); list = XCDR (list)) |
7d58ed99 RS |
394 | { |
395 | /* Stop the scan when we come to the parent. */ | |
03699b14 | 396 | if (EQ (XCAR (list), Qkeymap)) |
7d58ed99 RS |
397 | break; |
398 | ||
399 | /* If this element holds a prefix map, deal with it. */ | |
03699b14 KR |
400 | if (CONSP (XCAR (list)) |
401 | && CONSP (XCDR (XCAR (list)))) | |
402 | fix_submap_inheritance (keymap, XCAR (XCAR (list)), | |
403 | XCDR (XCAR (list))); | |
404 | ||
405 | if (VECTORP (XCAR (list))) | |
406 | for (i = 0; i < XVECTOR (XCAR (list))->size; i++) | |
407 | if (CONSP (XVECTOR (XCAR (list))->contents[i])) | |
7d58ed99 | 408 | fix_submap_inheritance (keymap, make_number (i), |
03699b14 | 409 | XVECTOR (XCAR (list))->contents[i]); |
0403641f | 410 | |
03699b14 | 411 | if (CHAR_TABLE_P (XCAR (list))) |
0403641f | 412 | { |
23cf1efa | 413 | Lisp_Object indices[3]; |
0403641f | 414 | |
03699b14 | 415 | map_char_table (fix_submap_inheritance, Qnil, XCAR (list), |
0403641f RS |
416 | keymap, 0, indices); |
417 | } | |
7d58ed99 RS |
418 | } |
419 | ||
df75b1a3 | 420 | RETURN_UNGCPRO (parent); |
7d58ed99 RS |
421 | } |
422 | ||
423 | /* EVENT is defined in MAP as a prefix, and SUBMAP is its definition. | |
424 | if EVENT is also a prefix in MAP's parent, | |
425 | make sure that SUBMAP inherits that definition as its own parent. */ | |
426 | ||
57495396 | 427 | static void |
7d58ed99 RS |
428 | fix_submap_inheritance (map, event, submap) |
429 | Lisp_Object map, event, submap; | |
430 | { | |
431 | Lisp_Object map_parent, parent_entry; | |
432 | ||
433 | /* SUBMAP is a cons that we found as a key binding. | |
434 | Discard the other things found in a menu key binding. */ | |
435 | ||
02067692 | 436 | submap = get_keymap (get_keyelt (submap, 0), 0, 0); |
7d58ed99 RS |
437 | |
438 | /* If it isn't a keymap now, there's no work to do. */ | |
02067692 | 439 | if (!CONSP (submap)) |
7d58ed99 RS |
440 | return; |
441 | ||
31bea176 | 442 | map_parent = keymap_parent (map, 0); |
02067692 | 443 | if (!NILP (map_parent)) |
320c9428 | 444 | parent_entry = |
02067692 | 445 | get_keymap (access_keymap (map_parent, event, 0, 0, 0), 0, 0); |
7d58ed99 RS |
446 | else |
447 | parent_entry = Qnil; | |
448 | ||
3393c3f5 | 449 | /* If MAP's parent has something other than a keymap, |
9d0ffdd9 | 450 | our own submap shadows it completely. */ |
02067692 | 451 | if (!CONSP (parent_entry)) |
9d0ffdd9 | 452 | return; |
3393c3f5 | 453 | |
7d58ed99 | 454 | if (! EQ (parent_entry, submap)) |
61684f41 RS |
455 | { |
456 | Lisp_Object submap_parent; | |
457 | submap_parent = submap; | |
458 | while (1) | |
459 | { | |
460 | Lisp_Object tem; | |
9d0ffdd9 | 461 | |
31bea176 | 462 | tem = keymap_parent (submap_parent, 0); |
9d0ffdd9 SM |
463 | |
464 | if (KEYMAPP (tem)) | |
465 | { | |
466 | if (keymap_memberp (tem, parent_entry)) | |
467 | /* Fset_keymap_parent could create a cycle. */ | |
468 | return; | |
469 | submap_parent = tem; | |
470 | } | |
61684f41 RS |
471 | else |
472 | break; | |
473 | } | |
474 | Fset_keymap_parent (submap_parent, parent_entry); | |
475 | } | |
7d58ed99 RS |
476 | } |
477 | \f | |
2c6f1a39 | 478 | /* Look up IDX in MAP. IDX may be any sort of event. |
f5b79c1c | 479 | Note that this does only one level of lookup; IDX must be a single |
744cd66b | 480 | event, not a sequence. |
e25c4e44 JB |
481 | |
482 | If T_OK is non-zero, bindings for Qt are treated as default | |
483 | bindings; any key left unmentioned by other tables and bindings is | |
744cd66b | 484 | given the binding of Qt. |
e25c4e44 | 485 | |
c07aec97 RS |
486 | If T_OK is zero, bindings for Qt are not treated specially. |
487 | ||
488 | If NOINHERIT, don't accept a subkeymap found in an inherited keymap. */ | |
2c6f1a39 JB |
489 | |
490 | Lisp_Object | |
db785038 | 491 | access_keymap (map, idx, t_ok, noinherit, autoload) |
2c6f1a39 JB |
492 | Lisp_Object map; |
493 | Lisp_Object idx; | |
e25c4e44 | 494 | int t_ok; |
c07aec97 | 495 | int noinherit; |
db785038 | 496 | int autoload; |
2c6f1a39 | 497 | { |
efb91645 RS |
498 | Lisp_Object val; |
499 | ||
500 | /* Qunbound in VAL means we have found no binding yet. */ | |
501 | val = Qunbound; | |
c07aec97 | 502 | |
2c6f1a39 JB |
503 | /* If idx is a list (some sort of mouse click, perhaps?), |
504 | the index we want to use is the car of the list, which | |
505 | ought to be a symbol. */ | |
cebd887d | 506 | idx = EVENT_HEAD (idx); |
2c6f1a39 | 507 | |
f5b79c1c JB |
508 | /* If idx is a symbol, it might have modifiers, which need to |
509 | be put in the canonical order. */ | |
47684cd9 | 510 | if (SYMBOLP (idx)) |
f5b79c1c | 511 | idx = reorder_modifiers (idx); |
2732bdbb RS |
512 | else if (INTEGERP (idx)) |
513 | /* Clobber the high bits that can be present on a machine | |
514 | with more than 24 bits of integer. */ | |
6e344130 | 515 | XSETFASTINT (idx, XINT (idx) & (CHAR_META | (CHAR_META - 1))); |
2c6f1a39 | 516 | |
db785038 SM |
517 | /* Handle the special meta -> esc mapping. */ |
518 | if (INTEGERP (idx) && XUINT (idx) & meta_modifier) | |
519 | { | |
7396a36c GM |
520 | /* See if there is a meta-map. If there's none, there is |
521 | no binding for IDX, unless a default binding exists in MAP. */ | |
31bea176 SM |
522 | struct gcpro gcpro1; |
523 | Lisp_Object meta_map; | |
524 | GCPRO1 (map); | |
525 | meta_map = get_keymap (access_keymap (map, meta_prefix_char, | |
526 | t_ok, noinherit, autoload), | |
527 | 0, autoload); | |
528 | UNGCPRO; | |
02067692 | 529 | if (CONSP (meta_map)) |
7396a36c | 530 | { |
9d0ffdd9 | 531 | map = meta_map; |
7396a36c GM |
532 | idx = make_number (XUINT (idx) & ~meta_modifier); |
533 | } | |
534 | else if (t_ok) | |
535 | /* Set IDX to t, so that we only find a default binding. */ | |
536 | idx = Qt; | |
537 | else | |
538 | /* We know there is no binding. */ | |
539 | return Qnil; | |
db785038 SM |
540 | } |
541 | ||
31bea176 SM |
542 | /* t_binding is where we put a default binding that applies, |
543 | to use in case we do not find a binding specifically | |
544 | for this key sequence. */ | |
f5b79c1c JB |
545 | { |
546 | Lisp_Object tail; | |
31bea176 SM |
547 | Lisp_Object t_binding = Qnil; |
548 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; | |
efb91645 | 549 | |
31bea176 | 550 | GCPRO4 (map, tail, idx, t_binding); |
845e4cf4 SM |
551 | |
552 | /* If `t_ok' is 2, both `t' and generic-char bindings are accepted. | |
553 | If it is 1, only generic-char bindings are accepted. | |
554 | Otherwise, neither are. */ | |
555 | t_ok = t_ok ? 2 : 0; | |
2c6f1a39 | 556 | |
db785038 | 557 | for (tail = XCDR (map); |
7396a36c | 558 | (CONSP (tail) |
02067692 | 559 | || (tail = get_keymap (tail, 0, autoload), CONSP (tail))); |
db785038 | 560 | tail = XCDR (tail)) |
2c6f1a39 | 561 | { |
e9b6dfb0 | 562 | Lisp_Object binding; |
f5b79c1c | 563 | |
03699b14 | 564 | binding = XCAR (tail); |
783a2838 | 565 | if (SYMBOLP (binding)) |
f5b79c1c | 566 | { |
c07aec97 RS |
567 | /* If NOINHERIT, stop finding prefix definitions |
568 | after we pass a second occurrence of the `keymap' symbol. */ | |
db785038 | 569 | if (noinherit && EQ (binding, Qkeymap)) |
31bea176 | 570 | RETURN_UNGCPRO (Qnil); |
783a2838 KH |
571 | } |
572 | else if (CONSP (binding)) | |
573 | { | |
859ea4b8 | 574 | Lisp_Object key = XCAR (binding); |
744cd66b | 575 | |
859ea4b8 | 576 | if (EQ (key, idx)) |
845e4cf4 SM |
577 | val = XCDR (binding); |
578 | else if (t_ok | |
579 | && INTEGERP (idx) | |
62b366ff | 580 | && (XINT (idx) & CHAR_MODIFIER_MASK) == 0 |
859ea4b8 | 581 | && INTEGERP (key) |
62b366ff | 582 | && (XINT (key) & CHAR_MODIFIER_MASK) == 0 |
859ea4b8 GM |
583 | && !SINGLE_BYTE_CHAR_P (XINT (idx)) |
584 | && !SINGLE_BYTE_CHAR_P (XINT (key)) | |
585 | && CHAR_VALID_P (XINT (key), 1) | |
586 | && !CHAR_VALID_P (XINT (key), 0) | |
587 | && (CHAR_CHARSET (XINT (key)) | |
588 | == CHAR_CHARSET (XINT (idx)))) | |
589 | { | |
590 | /* KEY is the generic character of the charset of IDX. | |
591 | Use KEY's binding if there isn't a binding for IDX | |
592 | itself. */ | |
845e4cf4 SM |
593 | t_binding = XCDR (binding); |
594 | t_ok = 0; | |
595 | } | |
596 | else if (t_ok > 1 && EQ (key, Qt)) | |
597 | { | |
598 | t_binding = XCDR (binding); | |
599 | t_ok = 1; | |
859ea4b8 | 600 | } |
783a2838 KH |
601 | } |
602 | else if (VECTORP (binding)) | |
603 | { | |
845e4cf4 SM |
604 | if (NATNUMP (idx) && XFASTINT (idx) < ASIZE (binding)) |
605 | val = AREF (binding, XFASTINT (idx)); | |
f5b79c1c | 606 | } |
0403641f RS |
607 | else if (CHAR_TABLE_P (binding)) |
608 | { | |
6418ea16 RS |
609 | /* Character codes with modifiers |
610 | are not included in a char-table. | |
611 | All character codes without modifiers are included. */ | |
4dc3eb25 SM |
612 | if (NATNUMP (idx) && (XFASTINT (idx) & CHAR_MODIFIER_MASK) == 0) |
613 | { | |
614 | val = Faref (binding, idx); | |
615 | /* `nil' has a special meaning for char-tables, so | |
616 | we use something else to record an explicitly | |
617 | unbound entry. */ | |
618 | if (NILP (val)) | |
619 | val = Qunbound; | |
620 | } | |
0403641f | 621 | } |
20218e2f | 622 | |
845e4cf4 SM |
623 | /* If we found a binding, clean it up and return it. */ |
624 | if (!EQ (val, Qunbound)) | |
625 | { | |
4dc3eb25 SM |
626 | if (EQ (val, Qt)) |
627 | /* A Qt binding is just like an explicit nil binding | |
628 | (i.e. it shadows any parent binding but not bindings in | |
629 | keymaps of lower precedence). */ | |
630 | val = Qnil; | |
845e4cf4 SM |
631 | val = get_keyelt (val, autoload); |
632 | if (KEYMAPP (val)) | |
633 | fix_submap_inheritance (map, idx, val); | |
31bea176 | 634 | RETURN_UNGCPRO (val); |
845e4cf4 | 635 | } |
20218e2f | 636 | QUIT; |
2c6f1a39 | 637 | } |
31bea176 | 638 | UNGCPRO; |
db785038 | 639 | return get_keyelt (t_binding, autoload); |
e25c4e44 | 640 | } |
2c6f1a39 JB |
641 | } |
642 | ||
9d3153eb SM |
643 | static void |
644 | map_keymap_item (fun, args, key, val, data) | |
645 | map_keymap_function_t fun; | |
646 | Lisp_Object args, key, val; | |
647 | void *data; | |
648 | { | |
649 | /* We should maybe try to detect bindings shadowed by previous | |
650 | ones and things like that. */ | |
651 | if (EQ (val, Qt)) | |
652 | val = Qnil; | |
653 | (*fun) (key, val, args, data); | |
654 | } | |
655 | ||
656 | static void | |
657 | map_keymap_char_table_item (args, key, val) | |
658 | Lisp_Object args, key, val; | |
659 | { | |
660 | if (!NILP (val)) | |
661 | { | |
662 | map_keymap_function_t fun = XSAVE_VALUE (XCAR (args))->pointer; | |
663 | args = XCDR (args); | |
664 | map_keymap_item (fun, XCDR (args), key, val, | |
665 | XSAVE_VALUE (XCAR (args))->pointer); | |
666 | } | |
667 | } | |
668 | ||
669 | /* Call FUN for every binding in MAP. | |
edf505ce SM |
670 | FUN is called with 4 arguments: FUN (KEY, BINDING, ARGS, DATA). |
671 | AUTOLOAD if non-zero means that we can autoload keymaps if necessary. */ | |
9d3153eb SM |
672 | void |
673 | map_keymap (map, fun, args, data, autoload) | |
674 | map_keymap_function_t fun; | |
675 | Lisp_Object map, args; | |
676 | void *data; | |
677 | int autoload; | |
678 | { | |
679 | struct gcpro gcpro1, gcpro2, gcpro3; | |
680 | Lisp_Object tail; | |
681 | ||
682 | GCPRO3 (map, args, tail); | |
683 | map = get_keymap (map, 1, autoload); | |
684 | for (tail = (CONSP (map) && EQ (Qkeymap, XCAR (map))) ? XCDR (map) : map; | |
685 | CONSP (tail) || (tail = get_keymap (tail, 0, autoload), CONSP (tail)); | |
686 | tail = XCDR (tail)) | |
687 | { | |
688 | Lisp_Object binding = XCAR (tail); | |
689 | ||
690 | if (CONSP (binding)) | |
691 | map_keymap_item (fun, args, XCAR (binding), XCDR (binding), data); | |
692 | else if (VECTORP (binding)) | |
693 | { | |
694 | /* Loop over the char values represented in the vector. */ | |
695 | int len = ASIZE (binding); | |
696 | int c; | |
697 | abort(); | |
698 | for (c = 0; c < len; c++) | |
699 | { | |
700 | Lisp_Object character; | |
701 | XSETFASTINT (character, c); | |
702 | map_keymap_item (fun, args, character, AREF (binding, c), data); | |
703 | } | |
704 | } | |
705 | else if (CHAR_TABLE_P (binding)) | |
706 | { | |
707 | Lisp_Object indices[3]; | |
708 | map_char_table (map_keymap_char_table_item, Qnil, binding, | |
709 | Fcons (make_save_value (fun, 0), | |
710 | Fcons (make_save_value (data, 0), | |
711 | args)), | |
712 | 0, indices); | |
713 | } | |
714 | } | |
715 | UNGCPRO; | |
716 | } | |
717 | ||
718 | static void | |
719 | map_keymap_call (key, val, fun, dummy) | |
720 | Lisp_Object key, val, fun; | |
721 | void *dummy; | |
722 | { | |
723 | call2 (fun, key, val); | |
724 | } | |
725 | ||
726 | DEFUN ("map-keymap", Fmap_keymap, Smap_keymap, 2, 2, 0, | |
727 | doc: /* Call FUNCTION for every binding in KEYMAP. | |
728 | FUNCTION is called with two arguments: the event and its binding. */) | |
729 | (function, keymap) | |
730 | Lisp_Object function, keymap; | |
731 | { | |
732 | if (INTEGERP (function)) | |
733 | /* We have to stop integers early since map_keymap gives them special | |
734 | significance. */ | |
735 | Fsignal (Qinvalid_function, Fcons (function, Qnil)); | |
736 | map_keymap (keymap, map_keymap_call, function, NULL, 1); | |
737 | return Qnil; | |
738 | } | |
739 | ||
2c6f1a39 JB |
740 | /* Given OBJECT which was found in a slot in a keymap, |
741 | trace indirect definitions to get the actual definition of that slot. | |
742 | An indirect definition is a list of the form | |
743 | (KEYMAP . INDEX), where KEYMAP is a keymap or a symbol defined as one | |
744 | and INDEX is the object to look up in KEYMAP to yield the definition. | |
745 | ||
746 | Also if OBJECT has a menu string as the first element, | |
224a16e8 RS |
747 | remove that. Also remove a menu help string as second element. |
748 | ||
749 | If AUTOLOAD is nonzero, load autoloadable keymaps | |
750 | that are referred to with indirection. */ | |
2c6f1a39 JB |
751 | |
752 | Lisp_Object | |
224a16e8 | 753 | get_keyelt (object, autoload) |
31bea176 | 754 | Lisp_Object object; |
224a16e8 | 755 | int autoload; |
2c6f1a39 JB |
756 | { |
757 | while (1) | |
758 | { | |
b1314e15 KH |
759 | if (!(CONSP (object))) |
760 | /* This is really the value. */ | |
761 | return object; | |
2c6f1a39 | 762 | |
b1314e15 KH |
763 | /* If the keymap contents looks like (keymap ...) or (lambda ...) |
764 | then use itself. */ | |
765 | else if (EQ (XCAR (object), Qkeymap) || EQ (XCAR (object), Qlambda)) | |
766 | return object; | |
767 | ||
768 | /* If the keymap contents looks like (menu-item name . DEFN) | |
769 | or (menu-item name DEFN ...) then use DEFN. | |
3fc720e4 | 770 | This is a new format menu item. */ |
b1314e15 | 771 | else if (EQ (XCAR (object), Qmenu_item)) |
0403641f | 772 | { |
b1314e15 | 773 | if (CONSP (XCDR (object))) |
0403641f | 774 | { |
3fc720e4 GM |
775 | Lisp_Object tem; |
776 | ||
b1314e15 | 777 | object = XCDR (XCDR (object)); |
3fc720e4 | 778 | tem = object; |
b1314e15 KH |
779 | if (CONSP (object)) |
780 | object = XCAR (object); | |
3fc720e4 GM |
781 | |
782 | /* If there's a `:filter FILTER', apply FILTER to the | |
783 | menu-item's definition to get the real definition to | |
d5b3eb1b | 784 | use. */ |
3fc720e4 | 785 | for (; CONSP (tem) && CONSP (XCDR (tem)); tem = XCDR (tem)) |
d5b3eb1b | 786 | if (EQ (XCAR (tem), QCfilter) && autoload) |
3fc720e4 GM |
787 | { |
788 | Lisp_Object filter; | |
789 | filter = XCAR (XCDR (tem)); | |
790 | filter = list2 (filter, list2 (Qquote, object)); | |
791 | object = menu_item_eval_property (filter); | |
792 | break; | |
793 | } | |
0403641f RS |
794 | } |
795 | else | |
31bea176 | 796 | /* Invalid keymap. */ |
b1314e15 | 797 | return object; |
0403641f RS |
798 | } |
799 | ||
b1314e15 | 800 | /* If the keymap contents looks like (STRING . DEFN), use DEFN. |
2c6f1a39 JB |
801 | Keymap alist elements like (CHAR MENUSTRING . DEFN) |
802 | will be used by HierarKey menus. */ | |
b1314e15 | 803 | else if (STRINGP (XCAR (object))) |
1a8c3f10 | 804 | { |
b1314e15 | 805 | object = XCDR (object); |
1a8c3f10 RS |
806 | /* Also remove a menu help string, if any, |
807 | following the menu item name. */ | |
b1314e15 KH |
808 | if (CONSP (object) && STRINGP (XCAR (object))) |
809 | object = XCDR (object); | |
c6ec9f6e | 810 | /* Also remove the sublist that caches key equivalences, if any. */ |
b1314e15 | 811 | if (CONSP (object) && CONSP (XCAR (object))) |
ffab2bd6 | 812 | { |
c6ec9f6e | 813 | Lisp_Object carcar; |
b1314e15 | 814 | carcar = XCAR (XCAR (object)); |
c6ec9f6e | 815 | if (NILP (carcar) || VECTORP (carcar)) |
b1314e15 | 816 | object = XCDR (object); |
ffab2bd6 | 817 | } |
1a8c3f10 | 818 | } |
2c6f1a39 | 819 | |
b1314e15 KH |
820 | /* If the contents are (KEYMAP . ELEMENT), go indirect. */ |
821 | else | |
a3fc8840 | 822 | { |
31bea176 | 823 | struct gcpro gcpro1; |
df75b1a3 | 824 | Lisp_Object map; |
31bea176 | 825 | GCPRO1 (object); |
02067692 | 826 | map = get_keymap (Fcar_safe (object), 0, autoload); |
31bea176 | 827 | UNGCPRO; |
02067692 | 828 | return (!CONSP (map) ? object /* Invalid keymap */ |
db785038 | 829 | : access_keymap (map, Fcdr (object), 0, 0, autoload)); |
a3fc8840 | 830 | } |
2c6f1a39 JB |
831 | } |
832 | } | |
833 | ||
2d929694 | 834 | static Lisp_Object |
2c6f1a39 JB |
835 | store_in_keymap (keymap, idx, def) |
836 | Lisp_Object keymap; | |
837 | register Lisp_Object idx; | |
838 | register Lisp_Object def; | |
839 | { | |
1e7d1ab0 SM |
840 | /* Flush any reverse-map cache. */ |
841 | where_is_cache = Qnil; | |
842 | where_is_cache_keymaps = Qt; | |
843 | ||
dce4372a | 844 | /* If we are preparing to dump, and DEF is a menu element |
a3fc8840 RS |
845 | with a menu item indicator, copy it to ensure it is not pure. */ |
846 | if (CONSP (def) && PURE_P (def) | |
03699b14 KR |
847 | && (EQ (XCAR (def), Qmenu_item) || STRINGP (XCAR (def)))) |
848 | def = Fcons (XCAR (def), XCDR (def)); | |
32ce36ad | 849 | |
54cbc3d4 | 850 | if (!CONSP (keymap) || !EQ (XCAR (keymap), Qkeymap)) |
f5b79c1c JB |
851 | error ("attempt to define a key in a non-keymap"); |
852 | ||
2c6f1a39 JB |
853 | /* If idx is a list (some sort of mouse click, perhaps?), |
854 | the index we want to use is the car of the list, which | |
855 | ought to be a symbol. */ | |
cebd887d | 856 | idx = EVENT_HEAD (idx); |
2c6f1a39 | 857 | |
f5b79c1c JB |
858 | /* If idx is a symbol, it might have modifiers, which need to |
859 | be put in the canonical order. */ | |
416349ec | 860 | if (SYMBOLP (idx)) |
f5b79c1c | 861 | idx = reorder_modifiers (idx); |
2732bdbb RS |
862 | else if (INTEGERP (idx)) |
863 | /* Clobber the high bits that can be present on a machine | |
864 | with more than 24 bits of integer. */ | |
6e344130 | 865 | XSETFASTINT (idx, XINT (idx) & (CHAR_META | (CHAR_META - 1))); |
f5b79c1c JB |
866 | |
867 | /* Scan the keymap for a binding of idx. */ | |
2c6f1a39 | 868 | { |
f5b79c1c | 869 | Lisp_Object tail; |
2c6f1a39 | 870 | |
f5b79c1c JB |
871 | /* The cons after which we should insert new bindings. If the |
872 | keymap has a table element, we record its position here, so new | |
873 | bindings will go after it; this way, the table will stay | |
874 | towards the front of the alist and character lookups in dense | |
875 | keymaps will remain fast. Otherwise, this just points at the | |
876 | front of the keymap. */ | |
e9b6dfb0 | 877 | Lisp_Object insertion_point; |
2c6f1a39 | 878 | |
e9b6dfb0 | 879 | insertion_point = keymap; |
03699b14 | 880 | for (tail = XCDR (keymap); CONSP (tail); tail = XCDR (tail)) |
2c6f1a39 | 881 | { |
e9b6dfb0 | 882 | Lisp_Object elt; |
f5b79c1c | 883 | |
03699b14 | 884 | elt = XCAR (tail); |
783a2838 | 885 | if (VECTORP (elt)) |
f5b79c1c | 886 | { |
49801145 | 887 | if (NATNUMP (idx) && XFASTINT (idx) < ASIZE (elt)) |
f5b79c1c | 888 | { |
49801145 | 889 | ASET (elt, XFASTINT (idx), def); |
f5b79c1c JB |
890 | return def; |
891 | } | |
892 | insertion_point = tail; | |
783a2838 | 893 | } |
0403641f RS |
894 | else if (CHAR_TABLE_P (elt)) |
895 | { | |
6418ea16 RS |
896 | /* Character codes with modifiers |
897 | are not included in a char-table. | |
898 | All character codes without modifiers are included. */ | |
4dc3eb25 | 899 | if (NATNUMP (idx) && !(XFASTINT (idx) & CHAR_MODIFIER_MASK)) |
0403641f | 900 | { |
4dc3eb25 SM |
901 | Faset (elt, idx, |
902 | /* `nil' has a special meaning for char-tables, so | |
903 | we use something else to record an explicitly | |
904 | unbound entry. */ | |
905 | NILP (def) ? Qt : def); | |
0403641f RS |
906 | return def; |
907 | } | |
908 | insertion_point = tail; | |
909 | } | |
783a2838 KH |
910 | else if (CONSP (elt)) |
911 | { | |
03699b14 | 912 | if (EQ (idx, XCAR (elt))) |
f5b79c1c | 913 | { |
f3fbd155 | 914 | XSETCDR (elt, def); |
f5b79c1c JB |
915 | return def; |
916 | } | |
783a2838 | 917 | } |
49801145 SM |
918 | else if (EQ (elt, Qkeymap)) |
919 | /* If we find a 'keymap' symbol in the spine of KEYMAP, | |
920 | then we must have found the start of a second keymap | |
921 | being used as the tail of KEYMAP, and a binding for IDX | |
922 | should be inserted before it. */ | |
923 | goto keymap_end; | |
0188441d JB |
924 | |
925 | QUIT; | |
2c6f1a39 | 926 | } |
2c6f1a39 | 927 | |
f5b79c1c JB |
928 | keymap_end: |
929 | /* We have scanned the entire keymap, and not found a binding for | |
930 | IDX. Let's add one. */ | |
f3fbd155 KR |
931 | XSETCDR (insertion_point, |
932 | Fcons (Fcons (idx, def), XCDR (insertion_point))); | |
f5b79c1c | 933 | } |
31bea176 | 934 | |
2c6f1a39 JB |
935 | return def; |
936 | } | |
937 | ||
2b6748c0 SM |
938 | EXFUN (Fcopy_keymap, 1); |
939 | ||
31bea176 SM |
940 | Lisp_Object |
941 | copy_keymap_item (elt) | |
942 | Lisp_Object elt; | |
943 | { | |
944 | Lisp_Object res, tem; | |
945 | ||
946 | if (!CONSP (elt)) | |
947 | return elt; | |
948 | ||
949 | res = tem = elt; | |
950 | ||
951 | /* Is this a new format menu item. */ | |
952 | if (EQ (XCAR (tem), Qmenu_item)) | |
953 | { | |
954 | /* Copy cell with menu-item marker. */ | |
955 | res = elt = Fcons (XCAR (tem), XCDR (tem)); | |
956 | tem = XCDR (elt); | |
957 | if (CONSP (tem)) | |
958 | { | |
959 | /* Copy cell with menu-item name. */ | |
960 | XSETCDR (elt, Fcons (XCAR (tem), XCDR (tem))); | |
961 | elt = XCDR (elt); | |
962 | tem = XCDR (elt); | |
963 | } | |
964 | if (CONSP (tem)) | |
965 | { | |
966 | /* Copy cell with binding and if the binding is a keymap, | |
967 | copy that. */ | |
968 | XSETCDR (elt, Fcons (XCAR (tem), XCDR (tem))); | |
969 | elt = XCDR (elt); | |
970 | tem = XCAR (elt); | |
971 | if (CONSP (tem) && EQ (XCAR (tem), Qkeymap)) | |
972 | XSETCAR (elt, Fcopy_keymap (tem)); | |
973 | tem = XCDR (elt); | |
974 | if (CONSP (tem) && CONSP (XCAR (tem))) | |
975 | /* Delete cache for key equivalences. */ | |
976 | XSETCDR (elt, XCDR (tem)); | |
977 | } | |
978 | } | |
979 | else | |
980 | { | |
981 | /* It may be an old fomat menu item. | |
982 | Skip the optional menu string. */ | |
983 | if (STRINGP (XCAR (tem))) | |
984 | { | |
985 | /* Copy the cell, since copy-alist didn't go this deep. */ | |
986 | res = elt = Fcons (XCAR (tem), XCDR (tem)); | |
987 | tem = XCDR (elt); | |
988 | /* Also skip the optional menu help string. */ | |
989 | if (CONSP (tem) && STRINGP (XCAR (tem))) | |
990 | { | |
991 | XSETCDR (elt, Fcons (XCAR (tem), XCDR (tem))); | |
992 | elt = XCDR (elt); | |
993 | tem = XCDR (elt); | |
994 | } | |
995 | /* There may also be a list that caches key equivalences. | |
996 | Just delete it for the new keymap. */ | |
997 | if (CONSP (tem) | |
998 | && CONSP (XCAR (tem)) | |
999 | && (NILP (XCAR (XCAR (tem))) | |
1000 | || VECTORP (XCAR (XCAR (tem))))) | |
1001 | { | |
1002 | XSETCDR (elt, XCDR (tem)); | |
1003 | tem = XCDR (tem); | |
1004 | } | |
1005 | if (CONSP (tem) && EQ (XCAR (tem), Qkeymap)) | |
1006 | XSETCDR (elt, Fcopy_keymap (tem)); | |
1007 | } | |
1008 | else if (EQ (XCAR (tem), Qkeymap)) | |
1009 | res = Fcopy_keymap (elt); | |
1010 | } | |
1011 | return res; | |
1012 | } | |
1013 | ||
80951487 | 1014 | static void |
0403641f RS |
1015 | copy_keymap_1 (chartable, idx, elt) |
1016 | Lisp_Object chartable, idx, elt; | |
1017 | { | |
31bea176 | 1018 | Faset (chartable, idx, copy_keymap_item (elt)); |
0403641f | 1019 | } |
f5b79c1c | 1020 | |
2c6f1a39 | 1021 | DEFUN ("copy-keymap", Fcopy_keymap, Scopy_keymap, 1, 1, 0, |
335c5470 PJ |
1022 | doc: /* Return a copy of the keymap KEYMAP. |
1023 | The copy starts out with the same definitions of KEYMAP, | |
1024 | but changing either the copy or KEYMAP does not affect the other. | |
1025 | Any key definitions that are subkeymaps are recursively copied. | |
1026 | However, a key definition which is a symbol whose definition is a keymap | |
1027 | is not copied. */) | |
1028 | (keymap) | |
2c6f1a39 JB |
1029 | Lisp_Object keymap; |
1030 | { | |
1031 | register Lisp_Object copy, tail; | |
31bea176 SM |
1032 | keymap = get_keymap (keymap, 1, 0); |
1033 | copy = tail = Fcons (Qkeymap, Qnil); | |
1034 | keymap = XCDR (keymap); /* Skip the `keymap' symbol. */ | |
2c6f1a39 | 1035 | |
31bea176 | 1036 | while (CONSP (keymap) && !EQ (XCAR (keymap), Qkeymap)) |
2c6f1a39 | 1037 | { |
31bea176 | 1038 | Lisp_Object elt = XCAR (keymap); |
0403641f RS |
1039 | if (CHAR_TABLE_P (elt)) |
1040 | { | |
23cf1efa | 1041 | Lisp_Object indices[3]; |
0403641f RS |
1042 | elt = Fcopy_sequence (elt); |
1043 | map_char_table (copy_keymap_1, Qnil, elt, elt, 0, indices); | |
1044 | } | |
1045 | else if (VECTORP (elt)) | |
2c6f1a39 | 1046 | { |
f5b79c1c | 1047 | int i; |
f5b79c1c | 1048 | elt = Fcopy_sequence (elt); |
49801145 | 1049 | for (i = 0; i < ASIZE (elt); i++) |
31bea176 | 1050 | ASET (elt, i, copy_keymap_item (AREF (elt, i))); |
d65a13c5 | 1051 | } |
31bea176 SM |
1052 | else if (CONSP (elt)) |
1053 | elt = Fcons (XCAR (elt), copy_keymap_item (XCDR (elt))); | |
1054 | XSETCDR (tail, Fcons (elt, Qnil)); | |
1055 | tail = XCDR (tail); | |
1056 | keymap = XCDR (keymap); | |
2c6f1a39 | 1057 | } |
31bea176 | 1058 | XSETCDR (tail, keymap); |
2c6f1a39 JB |
1059 | return copy; |
1060 | } | |
1061 | \f | |
cc0a8174 JB |
1062 | /* Simple Keymap mutators and accessors. */ |
1063 | ||
21a0d7a0 RS |
1064 | /* GC is possible in this function if it autoloads a keymap. */ |
1065 | ||
2c6f1a39 | 1066 | DEFUN ("define-key", Fdefine_key, Sdefine_key, 3, 3, 0, |
2d772f45 | 1067 | doc: /* In KEYMAP, define key sequence KEY as DEF. |
0c412762 KS |
1068 | KEYMAP is a keymap. |
1069 | ||
1070 | KEY is a string or a vector of symbols and characters meaning a | |
1071 | sequence of keystrokes and events. Non-ASCII characters with codes | |
1072 | above 127 (such as ISO Latin-1) can be included if you use a vector. | |
bbc4541d | 1073 | Using [t] for KEY creates a default definition, which applies to any |
64239341 | 1074 | event type that has no other definition in this keymap. |
0c412762 | 1075 | |
335c5470 PJ |
1076 | DEF is anything that can be a key's definition: |
1077 | nil (means key is undefined in this keymap), | |
1078 | a command (a Lisp function suitable for interactive calling) | |
1079 | a string (treated as a keyboard macro), | |
1080 | a keymap (to define a prefix key), | |
1081 | a symbol. When the key is looked up, the symbol will stand for its | |
1082 | function definition, which should at that time be one of the above, | |
1083 | or another symbol whose function definition is used, etc. | |
1084 | a cons (STRING . DEFN), meaning that DEFN is the definition | |
1085 | (DEFN should be a valid definition in its own right), | |
1086 | or a cons (KEYMAP . CHAR), meaning use definition of CHAR in map KEYMAP. | |
1087 | ||
3abeca61 KG |
1088 | If KEYMAP is a sparse keymap with a binding for KEY, the existing |
1089 | binding is altered. If there is no binding for KEY, the new pair | |
1090 | binding KEY to DEF is added at the front of KEYMAP. */) | |
335c5470 | 1091 | (keymap, key, def) |
d09b2024 | 1092 | Lisp_Object keymap; |
2c6f1a39 JB |
1093 | Lisp_Object key; |
1094 | Lisp_Object def; | |
1095 | { | |
1096 | register int idx; | |
1097 | register Lisp_Object c; | |
2c6f1a39 JB |
1098 | register Lisp_Object cmd; |
1099 | int metized = 0; | |
6ba6e250 | 1100 | int meta_bit; |
2c6f1a39 | 1101 | int length; |
d09b2024 | 1102 | struct gcpro gcpro1, gcpro2, gcpro3; |
2c6f1a39 | 1103 | |
31bea176 | 1104 | GCPRO3 (keymap, key, def); |
02067692 | 1105 | keymap = get_keymap (keymap, 1, 1); |
2c6f1a39 | 1106 | |
a1df473f | 1107 | if (!VECTORP (key) && !STRINGP (key)) |
31bea176 | 1108 | key = wrong_type_argument (Qarrayp, key); |
2c6f1a39 | 1109 | |
d09b2024 | 1110 | length = XFASTINT (Flength (key)); |
2c6f1a39 | 1111 | if (length == 0) |
31bea176 | 1112 | RETURN_UNGCPRO (Qnil); |
a1df473f | 1113 | |
107fd03d RS |
1114 | if (SYMBOLP (def) && !EQ (Vdefine_key_rebound_commands, Qt)) |
1115 | Vdefine_key_rebound_commands = Fcons (def, Vdefine_key_rebound_commands); | |
1116 | ||
31bea176 | 1117 | meta_bit = VECTORP (key) ? meta_modifier : 0x80; |
6ba6e250 | 1118 | |
2c6f1a39 JB |
1119 | idx = 0; |
1120 | while (1) | |
1121 | { | |
1122 | c = Faref (key, make_number (idx)); | |
1123 | ||
f09bc924 | 1124 | if (CONSP (c) && lucid_event_type_list_p (c)) |
41015a19 | 1125 | c = Fevent_convert_list (c); |
f09bc924 | 1126 | |
15fff01d RS |
1127 | if (SYMBOLP (c)) |
1128 | silly_event_symbol_error (c); | |
2fae9111 | 1129 | |
416349ec | 1130 | if (INTEGERP (c) |
6ba6e250 | 1131 | && (XINT (c) & meta_bit) |
2c6f1a39 JB |
1132 | && !metized) |
1133 | { | |
1134 | c = meta_prefix_char; | |
1135 | metized = 1; | |
1136 | } | |
1137 | else | |
1138 | { | |
416349ec | 1139 | if (INTEGERP (c)) |
0b8fc2d4 | 1140 | XSETINT (c, XINT (c) & ~meta_bit); |
2c6f1a39 JB |
1141 | |
1142 | metized = 0; | |
1143 | idx++; | |
1144 | } | |
1145 | ||
54cbc3d4 | 1146 | if (!INTEGERP (c) && !SYMBOLP (c) && !CONSP (c)) |
2fae9111 | 1147 | error ("Key sequence contains invalid event"); |
5907b863 | 1148 | |
2c6f1a39 | 1149 | if (idx == length) |
d09b2024 | 1150 | RETURN_UNGCPRO (store_in_keymap (keymap, c, def)); |
2c6f1a39 | 1151 | |
db785038 | 1152 | cmd = access_keymap (keymap, c, 0, 1, 1); |
2c6f1a39 | 1153 | |
c07aec97 | 1154 | /* If this key is undefined, make it a prefix. */ |
265a9e55 | 1155 | if (NILP (cmd)) |
c07aec97 | 1156 | cmd = define_as_prefix (keymap, c); |
2c6f1a39 | 1157 | |
02067692 SM |
1158 | keymap = get_keymap (cmd, 0, 1); |
1159 | if (!CONSP (keymap)) | |
e9b6dfb0 KH |
1160 | /* We must use Fkey_description rather than just passing key to |
1161 | error; key might be a vector, not a string. */ | |
1162 | error ("Key sequence %s uses invalid prefix characters", | |
d5db4077 | 1163 | SDATA (Fkey_description (key))); |
2c6f1a39 JB |
1164 | } |
1165 | } | |
1166 | ||
a1df473f KS |
1167 | /* This function may GC (it calls Fkey_binding). */ |
1168 | ||
023b93f6 | 1169 | DEFUN ("command-remapping", Fcommand_remapping, Scommand_remapping, 1, 1, 0, |
a1df473f | 1170 | doc: /* Return the remapping for command COMMAND in current keymaps. |
078d0f38 | 1171 | Returns nil if COMMAND is not remapped (or not a symbol). */) |
a1df473f KS |
1172 | (command) |
1173 | Lisp_Object command; | |
1174 | { | |
078d0f38 KS |
1175 | if (!SYMBOLP (command)) |
1176 | return Qnil; | |
1177 | ||
023b93f6 KS |
1178 | ASET (command_remapping_vector, 1, command); |
1179 | return Fkey_binding (command_remapping_vector, Qnil, Qt); | |
a1df473f KS |
1180 | } |
1181 | ||
f0529b5b | 1182 | /* Value is number if KEY is too long; nil if valid but has no definition. */ |
21a0d7a0 | 1183 | /* GC is possible in this function if it autoloads a keymap. */ |
2c6f1a39 | 1184 | |
7c140252 | 1185 | DEFUN ("lookup-key", Flookup_key, Slookup_key, 2, 3, 0, |
335c5470 PJ |
1186 | doc: /* In keymap KEYMAP, look up key sequence KEY. Return the definition. |
1187 | nil means undefined. See doc of `define-key' for kinds of definitions. | |
1188 | ||
1189 | A number as value means KEY is "too long"; | |
1190 | that is, characters or symbols in it except for the last one | |
1191 | fail to be a valid sequence of prefix characters in KEYMAP. | |
1192 | The number is how many characters at the front of KEY | |
1193 | it takes to reach a non-prefix command. | |
1194 | ||
1195 | Normally, `lookup-key' ignores bindings for t, which act as default | |
1196 | bindings, used when nothing else in the keymap applies; this makes it | |
1197 | usable as a general function for probing keymaps. However, if the | |
1198 | third optional argument ACCEPT-DEFAULT is non-nil, `lookup-key' will | |
1199 | recognize the default bindings, just as `read-key-sequence' does. */) | |
1200 | (keymap, key, accept_default) | |
31bea176 | 1201 | Lisp_Object keymap; |
2c6f1a39 | 1202 | Lisp_Object key; |
7c140252 | 1203 | Lisp_Object accept_default; |
2c6f1a39 JB |
1204 | { |
1205 | register int idx; | |
2c6f1a39 JB |
1206 | register Lisp_Object cmd; |
1207 | register Lisp_Object c; | |
2c6f1a39 | 1208 | int length; |
54cbc3d4 | 1209 | int t_ok = !NILP (accept_default); |
31bea176 | 1210 | struct gcpro gcpro1, gcpro2; |
2c6f1a39 | 1211 | |
31bea176 | 1212 | GCPRO2 (keymap, key); |
02067692 | 1213 | keymap = get_keymap (keymap, 1, 1); |
2c6f1a39 | 1214 | |
416349ec | 1215 | if (!VECTORP (key) && !STRINGP (key)) |
2c6f1a39 JB |
1216 | key = wrong_type_argument (Qarrayp, key); |
1217 | ||
d09b2024 | 1218 | length = XFASTINT (Flength (key)); |
2c6f1a39 | 1219 | if (length == 0) |
31bea176 | 1220 | RETURN_UNGCPRO (keymap); |
21a0d7a0 | 1221 | |
2c6f1a39 JB |
1222 | idx = 0; |
1223 | while (1) | |
1224 | { | |
db785038 | 1225 | c = Faref (key, make_number (idx++)); |
2c6f1a39 | 1226 | |
f09bc924 | 1227 | if (CONSP (c) && lucid_event_type_list_p (c)) |
41015a19 | 1228 | c = Fevent_convert_list (c); |
f09bc924 | 1229 | |
db785038 SM |
1230 | /* Turn the 8th bit of string chars into a meta modifier. */ |
1231 | if (XINT (c) & 0x80 && STRINGP (key)) | |
1232 | XSETINT (c, (XINT (c) | meta_modifier) & ~0x80); | |
2c6f1a39 | 1233 | |
5f245371 KS |
1234 | /* Allow string since binding for `menu-bar-select-buffer' |
1235 | includes the buffer name in the key sequence. */ | |
1236 | if (!INTEGERP (c) && !SYMBOLP (c) && !CONSP (c) && !STRINGP (c)) | |
2fae9111 RS |
1237 | error ("Key sequence contains invalid event"); |
1238 | ||
db785038 | 1239 | cmd = access_keymap (keymap, c, t_ok, 0, 1); |
2c6f1a39 | 1240 | if (idx == length) |
21a0d7a0 | 1241 | RETURN_UNGCPRO (cmd); |
2c6f1a39 | 1242 | |
02067692 SM |
1243 | keymap = get_keymap (cmd, 0, 1); |
1244 | if (!CONSP (keymap)) | |
21a0d7a0 | 1245 | RETURN_UNGCPRO (make_number (idx)); |
2c6f1a39 | 1246 | |
2c6f1a39 JB |
1247 | QUIT; |
1248 | } | |
1249 | } | |
1250 | ||
c07aec97 RS |
1251 | /* Make KEYMAP define event C as a keymap (i.e., as a prefix). |
1252 | Assume that currently it does not define C at all. | |
1253 | Return the keymap. */ | |
1254 | ||
1255 | static Lisp_Object | |
1256 | define_as_prefix (keymap, c) | |
1257 | Lisp_Object keymap, c; | |
1258 | { | |
db785038 | 1259 | Lisp_Object cmd; |
c07aec97 RS |
1260 | |
1261 | cmd = Fmake_sparse_keymap (Qnil); | |
1262 | /* If this key is defined as a prefix in an inherited keymap, | |
1263 | make it a prefix in this map, and make its definition | |
1264 | inherit the other prefix definition. */ | |
db785038 | 1265 | cmd = nconc2 (cmd, access_keymap (keymap, c, 0, 0, 0)); |
c07aec97 RS |
1266 | store_in_keymap (keymap, c, cmd); |
1267 | ||
1268 | return cmd; | |
1269 | } | |
1270 | ||
0b8fc2d4 RS |
1271 | /* Append a key to the end of a key sequence. We always make a vector. */ |
1272 | ||
2c6f1a39 JB |
1273 | Lisp_Object |
1274 | append_key (key_sequence, key) | |
1275 | Lisp_Object key_sequence, key; | |
1276 | { | |
1277 | Lisp_Object args[2]; | |
1278 | ||
1279 | args[0] = key_sequence; | |
1280 | ||
0b8fc2d4 RS |
1281 | args[1] = Fcons (key, Qnil); |
1282 | return Fvconcat (2, args); | |
2c6f1a39 JB |
1283 | } |
1284 | ||
15fff01d RS |
1285 | /* Given a event type C which is a symbol, |
1286 | signal an error if is a mistake such as RET or M-RET or C-DEL, etc. */ | |
1287 | ||
1288 | static void | |
1289 | silly_event_symbol_error (c) | |
1290 | Lisp_Object c; | |
1291 | { | |
1292 | Lisp_Object parsed, base, name, assoc; | |
1293 | int modifiers; | |
744cd66b | 1294 | |
15fff01d RS |
1295 | parsed = parse_modifiers (c); |
1296 | modifiers = (int) XUINT (XCAR (XCDR (parsed))); | |
1297 | base = XCAR (parsed); | |
1298 | name = Fsymbol_name (base); | |
1299 | /* This alist includes elements such as ("RET" . "\\r"). */ | |
1300 | assoc = Fassoc (name, exclude_keys); | |
1301 | ||
1302 | if (! NILP (assoc)) | |
1303 | { | |
1304 | char new_mods[sizeof ("\\A-\\C-\\H-\\M-\\S-\\s-")]; | |
1305 | char *p = new_mods; | |
1306 | Lisp_Object keystring; | |
1307 | if (modifiers & alt_modifier) | |
1308 | { *p++ = '\\'; *p++ = 'A'; *p++ = '-'; } | |
1309 | if (modifiers & ctrl_modifier) | |
1310 | { *p++ = '\\'; *p++ = 'C'; *p++ = '-'; } | |
1311 | if (modifiers & hyper_modifier) | |
1312 | { *p++ = '\\'; *p++ = 'H'; *p++ = '-'; } | |
1313 | if (modifiers & meta_modifier) | |
1314 | { *p++ = '\\'; *p++ = 'M'; *p++ = '-'; } | |
1315 | if (modifiers & shift_modifier) | |
1316 | { *p++ = '\\'; *p++ = 'S'; *p++ = '-'; } | |
1317 | if (modifiers & super_modifier) | |
1318 | { *p++ = '\\'; *p++ = 's'; *p++ = '-'; } | |
1319 | *p = 0; | |
1320 | ||
1321 | c = reorder_modifiers (c); | |
1322 | keystring = concat2 (build_string (new_mods), XCDR (assoc)); | |
744cd66b | 1323 | |
15fff01d RS |
1324 | error ((modifiers & ~meta_modifier |
1325 | ? "To bind the key %s, use [?%s], not [%s]" | |
1326 | : "To bind the key %s, use \"%s\", not [%s]"), | |
d5db4077 KR |
1327 | SDATA (SYMBOL_NAME (c)), SDATA (keystring), |
1328 | SDATA (SYMBOL_NAME (c))); | |
15fff01d RS |
1329 | } |
1330 | } | |
2c6f1a39 | 1331 | \f |
cc0a8174 JB |
1332 | /* Global, local, and minor mode keymap stuff. */ |
1333 | ||
265a9e55 | 1334 | /* We can't put these variables inside current_minor_maps, since under |
6bbbd9b0 JB |
1335 | some systems, static gets macro-defined to be the empty string. |
1336 | Ickypoo. */ | |
cd6db61a KS |
1337 | static Lisp_Object *cmm_modes = NULL, *cmm_maps = NULL; |
1338 | static int cmm_size = 0; | |
265a9e55 | 1339 | |
fbb90829 KH |
1340 | /* Error handler used in current_minor_maps. */ |
1341 | static Lisp_Object | |
1342 | current_minor_maps_error () | |
1343 | { | |
1344 | return Qnil; | |
1345 | } | |
1346 | ||
cc0a8174 JB |
1347 | /* Store a pointer to an array of the keymaps of the currently active |
1348 | minor modes in *buf, and return the number of maps it contains. | |
1349 | ||
1350 | This function always returns a pointer to the same buffer, and may | |
1351 | free or reallocate it, so if you want to keep it for a long time or | |
1352 | hand it out to lisp code, copy it. This procedure will be called | |
1353 | for every key sequence read, so the nice lispy approach (return a | |
1354 | new assoclist, list, what have you) for each invocation would | |
1355 | result in a lot of consing over time. | |
1356 | ||
1357 | If we used xrealloc/xmalloc and ran out of memory, they would throw | |
1358 | back to the command loop, which would try to read a key sequence, | |
1359 | which would call this function again, resulting in an infinite | |
1360 | loop. Instead, we'll use realloc/malloc and silently truncate the | |
1361 | list, let the key sequence be read, and hope some other piece of | |
1362 | code signals the error. */ | |
1363 | int | |
1364 | current_minor_maps (modeptr, mapptr) | |
1365 | Lisp_Object **modeptr, **mapptr; | |
1366 | { | |
cc0a8174 | 1367 | int i = 0; |
dd9cda06 | 1368 | int list_number = 0; |
6bbbd9b0 | 1369 | Lisp_Object alist, assoc, var, val; |
99cbcaca | 1370 | Lisp_Object emulation_alists; |
dd9cda06 RS |
1371 | Lisp_Object lists[2]; |
1372 | ||
99cbcaca | 1373 | emulation_alists = Vemulation_mode_map_alists; |
dd9cda06 RS |
1374 | lists[0] = Vminor_mode_overriding_map_alist; |
1375 | lists[1] = Vminor_mode_map_alist; | |
1376 | ||
1377 | for (list_number = 0; list_number < 2; list_number++) | |
99cbcaca KS |
1378 | { |
1379 | if (CONSP (emulation_alists)) | |
dd9cda06 | 1380 | { |
99cbcaca KS |
1381 | alist = XCAR (emulation_alists); |
1382 | emulation_alists = XCDR (emulation_alists); | |
1383 | if (SYMBOLP (alist)) | |
1384 | alist = find_symbol_value (alist); | |
1385 | list_number = -1; | |
1386 | } | |
1387 | else | |
1388 | alist = lists[list_number]; | |
cc0a8174 | 1389 | |
99cbcaca KS |
1390 | for ( ; CONSP (alist); alist = XCDR (alist)) |
1391 | if ((assoc = XCAR (alist), CONSP (assoc)) | |
1392 | && (var = XCAR (assoc), SYMBOLP (var)) | |
1393 | && (val = find_symbol_value (var), !EQ (val, Qunbound)) | |
1394 | && !NILP (val)) | |
1395 | { | |
1396 | Lisp_Object temp; | |
64dd3629 | 1397 | |
99cbcaca KS |
1398 | /* If a variable has an entry in Vminor_mode_overriding_map_alist, |
1399 | and also an entry in Vminor_mode_map_alist, | |
1400 | ignore the latter. */ | |
1401 | if (list_number == 1) | |
1402 | { | |
1403 | val = assq_no_quit (var, lists[0]); | |
1404 | if (!NILP (val)) | |
1405 | continue; | |
1406 | } | |
cc0a8174 | 1407 | |
99cbcaca KS |
1408 | if (i >= cmm_size) |
1409 | { | |
cd6db61a | 1410 | int newsize, allocsize; |
99cbcaca | 1411 | Lisp_Object *newmodes, *newmaps; |
cc0a8174 | 1412 | |
cd6db61a KS |
1413 | newsize = cmm_size == 0 ? 30 : cmm_size * 2; |
1414 | allocsize = newsize * sizeof *newmodes; | |
1415 | ||
744cd66b | 1416 | /* Use malloc here. See the comment above this function. |
cd6db61a KS |
1417 | Avoid realloc here; it causes spurious traps on GNU/Linux [KFS] */ |
1418 | BLOCK_INPUT; | |
1419 | newmodes = (Lisp_Object *) malloc (allocsize); | |
1420 | if (newmodes) | |
99cbcaca | 1421 | { |
cd6db61a KS |
1422 | if (cmm_modes) |
1423 | { | |
1424 | bcopy (cmm_modes, newmodes, cmm_size * sizeof cmm_modes[0]); | |
1425 | free (cmm_modes); | |
1426 | } | |
1427 | cmm_modes = newmodes; | |
99cbcaca KS |
1428 | } |
1429 | ||
cd6db61a | 1430 | newmaps = (Lisp_Object *) malloc (allocsize); |
99cbcaca | 1431 | if (newmaps) |
cd6db61a KS |
1432 | { |
1433 | if (cmm_maps) | |
1434 | { | |
1435 | bcopy (cmm_maps, newmaps, cmm_size * sizeof cmm_maps[0]); | |
1436 | free (cmm_maps); | |
1437 | } | |
1438 | cmm_maps = newmaps; | |
1439 | } | |
1440 | UNBLOCK_INPUT; | |
744cd66b | 1441 | |
99cbcaca KS |
1442 | if (newmodes == NULL || newmaps == NULL) |
1443 | break; | |
cd6db61a | 1444 | cmm_size = newsize; |
99cbcaca | 1445 | } |
fbb90829 | 1446 | |
99cbcaca KS |
1447 | /* Get the keymap definition--or nil if it is not defined. */ |
1448 | temp = internal_condition_case_1 (Findirect_function, | |
1449 | XCDR (assoc), | |
1450 | Qerror, current_minor_maps_error); | |
1451 | if (!NILP (temp)) | |
1452 | { | |
1453 | cmm_modes[i] = var; | |
1454 | cmm_maps [i] = temp; | |
1455 | i++; | |
1456 | } | |
1457 | } | |
1458 | } | |
cc0a8174 | 1459 | |
265a9e55 JB |
1460 | if (modeptr) *modeptr = cmm_modes; |
1461 | if (mapptr) *mapptr = cmm_maps; | |
cc0a8174 JB |
1462 | return i; |
1463 | } | |
1464 | ||
54cbc3d4 | 1465 | DEFUN ("current-active-maps", Fcurrent_active_maps, Scurrent_active_maps, |
335c5470 PJ |
1466 | 0, 1, 0, |
1467 | doc: /* Return a list of the currently active keymaps. | |
1468 | OLP if non-nil indicates that we should obey `overriding-local-map' and | |
1469 | `overriding-terminal-local-map'. */) | |
54cbc3d4 SM |
1470 | (olp) |
1471 | Lisp_Object olp; | |
1472 | { | |
1473 | Lisp_Object keymaps = Fcons (current_global_map, Qnil); | |
1474 | ||
1475 | if (!NILP (olp)) | |
1476 | { | |
1477 | if (!NILP (Voverriding_local_map)) | |
1478 | keymaps = Fcons (Voverriding_local_map, keymaps); | |
1479 | if (!NILP (current_kboard->Voverriding_terminal_local_map)) | |
1480 | keymaps = Fcons (current_kboard->Voverriding_terminal_local_map, keymaps); | |
1481 | } | |
1482 | if (NILP (XCDR (keymaps))) | |
1483 | { | |
1484 | Lisp_Object local; | |
1485 | Lisp_Object *maps; | |
1486 | int nmaps, i; | |
1487 | ||
1488 | local = get_local_map (PT, current_buffer, Qlocal_map); | |
1489 | if (!NILP (local)) | |
1490 | keymaps = Fcons (local, keymaps); | |
1491 | ||
54cbc3d4 SM |
1492 | nmaps = current_minor_maps (0, &maps); |
1493 | ||
1494 | for (i = --nmaps; i >= 0; i--) | |
1495 | if (!NILP (maps[i])) | |
1496 | keymaps = Fcons (maps[i], keymaps); | |
d1d070e3 RS |
1497 | |
1498 | local = get_local_map (PT, current_buffer, Qkeymap); | |
1499 | if (!NILP (local)) | |
1500 | keymaps = Fcons (local, keymaps); | |
54cbc3d4 | 1501 | } |
31bea176 | 1502 | |
54cbc3d4 SM |
1503 | return keymaps; |
1504 | } | |
1505 | ||
21a0d7a0 RS |
1506 | /* GC is possible in this function if it autoloads a keymap. */ |
1507 | ||
0c412762 | 1508 | DEFUN ("key-binding", Fkey_binding, Skey_binding, 1, 3, 0, |
335c5470 PJ |
1509 | doc: /* Return the binding for command KEY in current keymaps. |
1510 | KEY is a string or vector, a sequence of keystrokes. | |
1511 | The binding is probably a symbol with a function definition. | |
1512 | ||
1513 | Normally, `key-binding' ignores bindings for t, which act as default | |
1514 | bindings, used when nothing else in the keymap applies; this makes it | |
1515 | usable as a general function for probing keymaps. However, if the | |
1516 | optional second argument ACCEPT-DEFAULT is non-nil, `key-binding' does | |
0c412762 KS |
1517 | recognize the default bindings, just as `read-key-sequence' does. |
1518 | ||
1519 | Like the normal command loop, `key-binding' will remap the command | |
1520 | resulting from looking up KEY by looking up the command in the | |
35936c5c | 1521 | current keymaps. However, if the optional third argument NO-REMAP |
0c412762 KS |
1522 | is non-nil, `key-binding' returns the unmapped command. */) |
1523 | (key, accept_default, no_remap) | |
1524 | Lisp_Object key, accept_default, no_remap; | |
2c6f1a39 | 1525 | { |
cc0a8174 JB |
1526 | Lisp_Object *maps, value; |
1527 | int nmaps, i; | |
21a0d7a0 RS |
1528 | struct gcpro gcpro1; |
1529 | ||
1530 | GCPRO1 (key); | |
cc0a8174 | 1531 | |
e784236d KH |
1532 | if (!NILP (current_kboard->Voverriding_terminal_local_map)) |
1533 | { | |
1534 | value = Flookup_key (current_kboard->Voverriding_terminal_local_map, | |
1535 | key, accept_default); | |
1536 | if (! NILP (value) && !INTEGERP (value)) | |
0c412762 | 1537 | goto done; |
e784236d KH |
1538 | } |
1539 | else if (!NILP (Voverriding_local_map)) | |
2c6f1a39 | 1540 | { |
7d92e329 | 1541 | value = Flookup_key (Voverriding_local_map, key, accept_default); |
416349ec | 1542 | if (! NILP (value) && !INTEGERP (value)) |
0c412762 | 1543 | goto done; |
2c6f1a39 | 1544 | } |
7d92e329 | 1545 | else |
744cd66b | 1546 | { |
d964248c KH |
1547 | Lisp_Object local; |
1548 | ||
d1d070e3 RS |
1549 | local = get_local_map (PT, current_buffer, Qkeymap); |
1550 | if (! NILP (local)) | |
1551 | { | |
1552 | value = Flookup_key (local, key, accept_default); | |
1553 | if (! NILP (value) && !INTEGERP (value)) | |
0c412762 | 1554 | goto done; |
d1d070e3 RS |
1555 | } |
1556 | ||
7d92e329 | 1557 | nmaps = current_minor_maps (0, &maps); |
21a0d7a0 RS |
1558 | /* Note that all these maps are GCPRO'd |
1559 | in the places where we found them. */ | |
1560 | ||
7d92e329 RS |
1561 | for (i = 0; i < nmaps; i++) |
1562 | if (! NILP (maps[i])) | |
1563 | { | |
1564 | value = Flookup_key (maps[i], key, accept_default); | |
416349ec | 1565 | if (! NILP (value) && !INTEGERP (value)) |
0c412762 | 1566 | goto done; |
7d92e329 RS |
1567 | } |
1568 | ||
4956d1ef | 1569 | local = get_local_map (PT, current_buffer, Qlocal_map); |
d964248c | 1570 | if (! NILP (local)) |
7d92e329 | 1571 | { |
d964248c | 1572 | value = Flookup_key (local, key, accept_default); |
416349ec | 1573 | if (! NILP (value) && !INTEGERP (value)) |
0c412762 | 1574 | goto done; |
7d92e329 RS |
1575 | } |
1576 | } | |
cc0a8174 | 1577 | |
7c140252 | 1578 | value = Flookup_key (current_global_map, key, accept_default); |
0c412762 KS |
1579 | |
1580 | done: | |
21a0d7a0 | 1581 | UNGCPRO; |
0c412762 KS |
1582 | if (NILP (value) || INTEGERP (value)) |
1583 | return Qnil; | |
1584 | ||
1585 | /* If the result of the ordinary keymap lookup is an interactive | |
1586 | command, look for a key binding (ie. remapping) for that command. */ | |
744cd66b | 1587 | |
a1df473f | 1588 | if (NILP (no_remap) && SYMBOLP (value)) |
0c412762 KS |
1589 | { |
1590 | Lisp_Object value1; | |
023b93f6 | 1591 | if (value1 = Fcommand_remapping (value), !NILP (value1)) |
0c412762 KS |
1592 | value = value1; |
1593 | } | |
744cd66b | 1594 | |
0c412762 | 1595 | return value; |
2c6f1a39 JB |
1596 | } |
1597 | ||
21a0d7a0 RS |
1598 | /* GC is possible in this function if it autoloads a keymap. */ |
1599 | ||
7c140252 | 1600 | DEFUN ("local-key-binding", Flocal_key_binding, Slocal_key_binding, 1, 2, 0, |
335c5470 PJ |
1601 | doc: /* Return the binding for command KEYS in current local keymap only. |
1602 | KEYS is a string, a sequence of keystrokes. | |
1603 | The binding is probably a symbol with a function definition. | |
1604 | ||
1605 | If optional argument ACCEPT-DEFAULT is non-nil, recognize default | |
1606 | bindings; see the description of `lookup-key' for more details about this. */) | |
1607 | (keys, accept_default) | |
7c140252 | 1608 | Lisp_Object keys, accept_default; |
2c6f1a39 JB |
1609 | { |
1610 | register Lisp_Object map; | |
1611 | map = current_buffer->keymap; | |
265a9e55 | 1612 | if (NILP (map)) |
2c6f1a39 | 1613 | return Qnil; |
7c140252 | 1614 | return Flookup_key (map, keys, accept_default); |
2c6f1a39 JB |
1615 | } |
1616 | ||
21a0d7a0 RS |
1617 | /* GC is possible in this function if it autoloads a keymap. */ |
1618 | ||
7c140252 | 1619 | DEFUN ("global-key-binding", Fglobal_key_binding, Sglobal_key_binding, 1, 2, 0, |
335c5470 PJ |
1620 | doc: /* Return the binding for command KEYS in current global keymap only. |
1621 | KEYS is a string, a sequence of keystrokes. | |
1622 | The binding is probably a symbol with a function definition. | |
1623 | This function's return values are the same as those of lookup-key | |
1624 | \(which see). | |
1625 | ||
1626 | If optional argument ACCEPT-DEFAULT is non-nil, recognize default | |
1627 | bindings; see the description of `lookup-key' for more details about this. */) | |
1628 | (keys, accept_default) | |
7c140252 | 1629 | Lisp_Object keys, accept_default; |
2c6f1a39 | 1630 | { |
7c140252 | 1631 | return Flookup_key (current_global_map, keys, accept_default); |
2c6f1a39 JB |
1632 | } |
1633 | ||
21a0d7a0 RS |
1634 | /* GC is possible in this function if it autoloads a keymap. */ |
1635 | ||
7c140252 | 1636 | DEFUN ("minor-mode-key-binding", Fminor_mode_key_binding, Sminor_mode_key_binding, 1, 2, 0, |
335c5470 PJ |
1637 | doc: /* Find the visible minor mode bindings of KEY. |
1638 | Return an alist of pairs (MODENAME . BINDING), where MODENAME is the | |
1639 | the symbol which names the minor mode binding KEY, and BINDING is | |
1640 | KEY's definition in that mode. In particular, if KEY has no | |
1641 | minor-mode bindings, return nil. If the first binding is a | |
1642 | non-prefix, all subsequent bindings will be omitted, since they would | |
1643 | be ignored. Similarly, the list doesn't include non-prefix bindings | |
1644 | that come after prefix bindings. | |
1645 | ||
1646 | If optional argument ACCEPT-DEFAULT is non-nil, recognize default | |
1647 | bindings; see the description of `lookup-key' for more details about this. */) | |
1648 | (key, accept_default) | |
7c140252 | 1649 | Lisp_Object key, accept_default; |
cc0a8174 JB |
1650 | { |
1651 | Lisp_Object *modes, *maps; | |
1652 | int nmaps; | |
1653 | Lisp_Object binding; | |
1654 | int i, j; | |
21a0d7a0 | 1655 | struct gcpro gcpro1, gcpro2; |
cc0a8174 JB |
1656 | |
1657 | nmaps = current_minor_maps (&modes, &maps); | |
21a0d7a0 RS |
1658 | /* Note that all these maps are GCPRO'd |
1659 | in the places where we found them. */ | |
1660 | ||
1661 | binding = Qnil; | |
1662 | GCPRO2 (key, binding); | |
cc0a8174 JB |
1663 | |
1664 | for (i = j = 0; i < nmaps; i++) | |
02067692 SM |
1665 | if (!NILP (maps[i]) |
1666 | && !NILP (binding = Flookup_key (maps[i], key, accept_default)) | |
416349ec | 1667 | && !INTEGERP (binding)) |
cc0a8174 | 1668 | { |
02067692 | 1669 | if (KEYMAPP (binding)) |
cc0a8174 JB |
1670 | maps[j++] = Fcons (modes[i], binding); |
1671 | else if (j == 0) | |
21a0d7a0 | 1672 | RETURN_UNGCPRO (Fcons (Fcons (modes[i], binding), Qnil)); |
cc0a8174 JB |
1673 | } |
1674 | ||
21a0d7a0 | 1675 | UNGCPRO; |
cc0a8174 JB |
1676 | return Flist (j, maps); |
1677 | } | |
1678 | ||
7f8f0e67 | 1679 | DEFUN ("define-prefix-command", Fdefine_prefix_command, Sdefine_prefix_command, 1, 3, 0, |
335c5470 PJ |
1680 | doc: /* Define COMMAND as a prefix command. COMMAND should be a symbol. |
1681 | A new sparse keymap is stored as COMMAND's function definition and its value. | |
1682 | If a second optional argument MAPVAR is given, the map is stored as | |
1683 | its value instead of as COMMAND's value; but COMMAND is still defined | |
1684 | as a function. | |
1685 | The third optional argument NAME, if given, supplies a menu name | |
1686 | string for the map. This is required to use the keymap as a menu. */) | |
1687 | (command, mapvar, name) | |
7f8f0e67 | 1688 | Lisp_Object command, mapvar, name; |
2c6f1a39 JB |
1689 | { |
1690 | Lisp_Object map; | |
7f8f0e67 | 1691 | map = Fmake_sparse_keymap (name); |
88539837 | 1692 | Ffset (command, map); |
265a9e55 | 1693 | if (!NILP (mapvar)) |
2c6f1a39 JB |
1694 | Fset (mapvar, map); |
1695 | else | |
88539837 EN |
1696 | Fset (command, map); |
1697 | return command; | |
2c6f1a39 JB |
1698 | } |
1699 | ||
1700 | DEFUN ("use-global-map", Fuse_global_map, Suse_global_map, 1, 1, 0, | |
335c5470 PJ |
1701 | doc: /* Select KEYMAP as the global keymap. */) |
1702 | (keymap) | |
2c6f1a39 JB |
1703 | Lisp_Object keymap; |
1704 | { | |
02067692 | 1705 | keymap = get_keymap (keymap, 1, 1); |
2c6f1a39 | 1706 | current_global_map = keymap; |
6f27e7a2 | 1707 | |
2c6f1a39 JB |
1708 | return Qnil; |
1709 | } | |
1710 | ||
1711 | DEFUN ("use-local-map", Fuse_local_map, Suse_local_map, 1, 1, 0, | |
335c5470 PJ |
1712 | doc: /* Select KEYMAP as the local keymap. |
1713 | If KEYMAP is nil, that means no local keymap. */) | |
1714 | (keymap) | |
2c6f1a39 JB |
1715 | Lisp_Object keymap; |
1716 | { | |
265a9e55 | 1717 | if (!NILP (keymap)) |
02067692 | 1718 | keymap = get_keymap (keymap, 1, 1); |
2c6f1a39 JB |
1719 | |
1720 | current_buffer->keymap = keymap; | |
1721 | ||
1722 | return Qnil; | |
1723 | } | |
1724 | ||
1725 | DEFUN ("current-local-map", Fcurrent_local_map, Scurrent_local_map, 0, 0, 0, | |
335c5470 PJ |
1726 | doc: /* Return current buffer's local keymap, or nil if it has none. */) |
1727 | () | |
2c6f1a39 JB |
1728 | { |
1729 | return current_buffer->keymap; | |
1730 | } | |
1731 | ||
1732 | DEFUN ("current-global-map", Fcurrent_global_map, Scurrent_global_map, 0, 0, 0, | |
335c5470 PJ |
1733 | doc: /* Return the current global keymap. */) |
1734 | () | |
2c6f1a39 JB |
1735 | { |
1736 | return current_global_map; | |
1737 | } | |
cc0a8174 JB |
1738 | |
1739 | DEFUN ("current-minor-mode-maps", Fcurrent_minor_mode_maps, Scurrent_minor_mode_maps, 0, 0, 0, | |
335c5470 PJ |
1740 | doc: /* Return a list of keymaps for the minor modes of the current buffer. */) |
1741 | () | |
cc0a8174 JB |
1742 | { |
1743 | Lisp_Object *maps; | |
1744 | int nmaps = current_minor_maps (0, &maps); | |
1745 | ||
1746 | return Flist (nmaps, maps); | |
1747 | } | |
2c6f1a39 | 1748 | \f |
cc0a8174 JB |
1749 | /* Help functions for describing and documenting keymaps. */ |
1750 | ||
54cbc3d4 SM |
1751 | |
1752 | static void | |
1753 | accessible_keymaps_1 (key, cmd, maps, tail, thisseq, is_metized) | |
1754 | Lisp_Object maps, tail, thisseq, key, cmd; | |
1755 | int is_metized; /* If 1, `key' is assumed to be INTEGERP. */ | |
1756 | { | |
1757 | Lisp_Object tem; | |
1758 | ||
73a4675c | 1759 | cmd = get_keymap (get_keyelt (cmd, 0), 0, 0); |
54cbc3d4 SM |
1760 | if (NILP (cmd)) |
1761 | return; | |
1762 | ||
73a4675c SM |
1763 | /* Look for and break cycles. */ |
1764 | while (!NILP (tem = Frassq (cmd, maps))) | |
54cbc3d4 | 1765 | { |
73a4675c SM |
1766 | Lisp_Object prefix = XCAR (tem); |
1767 | int lim = XINT (Flength (XCAR (tem))); | |
1768 | if (lim <= XINT (Flength (thisseq))) | |
1769 | { /* This keymap was already seen with a smaller prefix. */ | |
1770 | int i = 0; | |
1771 | while (i < lim && EQ (Faref (prefix, make_number (i)), | |
1772 | Faref (thisseq, make_number (i)))) | |
1773 | i++; | |
1774 | if (i >= lim) | |
1775 | /* `prefix' is a prefix of `thisseq' => there's a cycle. */ | |
1776 | return; | |
54cbc3d4 | 1777 | } |
73a4675c SM |
1778 | /* This occurrence of `cmd' in `maps' does not correspond to a cycle, |
1779 | but maybe `cmd' occurs again further down in `maps', so keep | |
1780 | looking. */ | |
1781 | maps = XCDR (Fmemq (tem, maps)); | |
1782 | } | |
1783 | ||
1784 | /* If the last key in thisseq is meta-prefix-char, | |
1785 | turn it into a meta-ized keystroke. We know | |
1786 | that the event we're about to append is an | |
1787 | ascii keystroke since we're processing a | |
1788 | keymap table. */ | |
1789 | if (is_metized) | |
1790 | { | |
1791 | int meta_bit = meta_modifier; | |
1792 | Lisp_Object last = make_number (XINT (Flength (thisseq)) - 1); | |
1793 | tem = Fcopy_sequence (thisseq); | |
1794 | ||
1795 | Faset (tem, last, make_number (XINT (key) | meta_bit)); | |
1796 | ||
1797 | /* This new sequence is the same length as | |
1798 | thisseq, so stick it in the list right | |
1799 | after this one. */ | |
1800 | XSETCDR (tail, | |
1801 | Fcons (Fcons (tem, cmd), XCDR (tail))); | |
1802 | } | |
1803 | else | |
1804 | { | |
1805 | tem = append_key (thisseq, key); | |
1806 | nconc2 (tail, Fcons (Fcons (tem, cmd), Qnil)); | |
54cbc3d4 SM |
1807 | } |
1808 | } | |
1809 | ||
1810 | static void | |
1811 | accessible_keymaps_char_table (args, index, cmd) | |
1812 | Lisp_Object args, index, cmd; | |
1813 | { | |
1814 | accessible_keymaps_1 (index, cmd, | |
1815 | XCAR (XCAR (args)), | |
1816 | XCAR (XCDR (args)), | |
1817 | XCDR (XCDR (args)), | |
1818 | XINT (XCDR (XCAR (args)))); | |
1819 | } | |
0403641f | 1820 | |
21a0d7a0 RS |
1821 | /* This function cannot GC. */ |
1822 | ||
2c6f1a39 | 1823 | DEFUN ("accessible-keymaps", Faccessible_keymaps, Saccessible_keymaps, |
335c5470 PJ |
1824 | 1, 2, 0, |
1825 | doc: /* Find all keymaps accessible via prefix characters from KEYMAP. | |
1826 | Returns a list of elements of the form (KEYS . MAP), where the sequence | |
1827 | KEYS starting from KEYMAP gets you to MAP. These elements are ordered | |
1828 | so that the KEYS increase in length. The first element is ([] . KEYMAP). | |
1829 | An optional argument PREFIX, if non-nil, should be a key sequence; | |
1830 | then the value includes only maps for prefixes that start with PREFIX. */) | |
1831 | (keymap, prefix) | |
88539837 | 1832 | Lisp_Object keymap, prefix; |
2c6f1a39 | 1833 | { |
fad865a3 | 1834 | Lisp_Object maps, tail; |
53c8f9fa RS |
1835 | int prefixlen = 0; |
1836 | ||
21a0d7a0 RS |
1837 | /* no need for gcpro because we don't autoload any keymaps. */ |
1838 | ||
53c8f9fa RS |
1839 | if (!NILP (prefix)) |
1840 | prefixlen = XINT (Flength (prefix)); | |
2c6f1a39 | 1841 | |
44a4a59b RS |
1842 | if (!NILP (prefix)) |
1843 | { | |
1844 | /* If a prefix was specified, start with the keymap (if any) for | |
1845 | that prefix, so we don't waste time considering other prefixes. */ | |
1846 | Lisp_Object tem; | |
88539837 | 1847 | tem = Flookup_key (keymap, prefix, Qt); |
1ae2097f RS |
1848 | /* Flookup_key may give us nil, or a number, |
1849 | if the prefix is not defined in this particular map. | |
1850 | It might even give us a list that isn't a keymap. */ | |
02067692 SM |
1851 | tem = get_keymap (tem, 0, 0); |
1852 | if (CONSP (tem)) | |
67fc16a3 RS |
1853 | { |
1854 | /* Convert PREFIX to a vector now, so that later on | |
1855 | we don't have to deal with the possibility of a string. */ | |
1856 | if (STRINGP (prefix)) | |
1857 | { | |
f3ba5409 | 1858 | int i, i_byte, c; |
67fc16a3 RS |
1859 | Lisp_Object copy; |
1860 | ||
d5db4077 KR |
1861 | copy = Fmake_vector (make_number (SCHARS (prefix)), Qnil); |
1862 | for (i = 0, i_byte = 0; i < SCHARS (prefix);) | |
67fc16a3 | 1863 | { |
f3ba5409 | 1864 | int i_before = i; |
54e03a4a KH |
1865 | |
1866 | FETCH_STRING_CHAR_ADVANCE (c, prefix, i, i_byte); | |
1867 | if (SINGLE_BYTE_CHAR_P (c) && (c & 0200)) | |
1868 | c ^= 0200 | meta_modifier; | |
49801145 | 1869 | ASET (copy, i_before, make_number (c)); |
67fc16a3 RS |
1870 | } |
1871 | prefix = copy; | |
1872 | } | |
1873 | maps = Fcons (Fcons (prefix, tem), Qnil); | |
1874 | } | |
44a4a59b RS |
1875 | else |
1876 | return Qnil; | |
1877 | } | |
1878 | else | |
1879 | maps = Fcons (Fcons (Fmake_vector (make_number (0), Qnil), | |
02067692 | 1880 | get_keymap (keymap, 1, 0)), |
44a4a59b | 1881 | Qnil); |
2c6f1a39 JB |
1882 | |
1883 | /* For each map in the list maps, | |
1884 | look at any other maps it points to, | |
1885 | and stick them at the end if they are not already in the list. | |
1886 | ||
1887 | This is a breadth-first traversal, where tail is the queue of | |
1888 | nodes, and maps accumulates a list of all nodes visited. */ | |
1889 | ||
03699b14 | 1890 | for (tail = maps; CONSP (tail); tail = XCDR (tail)) |
2c6f1a39 | 1891 | { |
e9b6dfb0 KH |
1892 | register Lisp_Object thisseq, thismap; |
1893 | Lisp_Object last; | |
2c6f1a39 | 1894 | /* Does the current sequence end in the meta-prefix-char? */ |
e9b6dfb0 KH |
1895 | int is_metized; |
1896 | ||
1897 | thisseq = Fcar (Fcar (tail)); | |
1898 | thismap = Fcdr (Fcar (tail)); | |
1899 | last = make_number (XINT (Flength (thisseq)) - 1); | |
1900 | is_metized = (XINT (last) >= 0 | |
97ae4b89 RS |
1901 | /* Don't metize the last char of PREFIX. */ |
1902 | && XINT (last) >= prefixlen | |
e9b6dfb0 | 1903 | && EQ (Faref (thisseq, last), meta_prefix_char)); |
2c6f1a39 | 1904 | |
03699b14 | 1905 | for (; CONSP (thismap); thismap = XCDR (thismap)) |
2c6f1a39 | 1906 | { |
e9b6dfb0 KH |
1907 | Lisp_Object elt; |
1908 | ||
03699b14 | 1909 | elt = XCAR (thismap); |
2c6f1a39 | 1910 | |
f5b79c1c JB |
1911 | QUIT; |
1912 | ||
0403641f RS |
1913 | if (CHAR_TABLE_P (elt)) |
1914 | { | |
23cf1efa | 1915 | Lisp_Object indices[3]; |
0403641f RS |
1916 | |
1917 | map_char_table (accessible_keymaps_char_table, Qnil, | |
fc18e547 | 1918 | elt, Fcons (Fcons (maps, make_number (is_metized)), |
f58c6494 | 1919 | Fcons (tail, thisseq)), |
0403641f RS |
1920 | 0, indices); |
1921 | } | |
1922 | else if (VECTORP (elt)) | |
2c6f1a39 JB |
1923 | { |
1924 | register int i; | |
1925 | ||
1926 | /* Vector keymap. Scan all the elements. */ | |
49801145 | 1927 | for (i = 0; i < ASIZE (elt); i++) |
54cbc3d4 SM |
1928 | accessible_keymaps_1 (make_number (i), AREF (elt, i), |
1929 | maps, tail, thisseq, is_metized); | |
31bea176 | 1930 | |
0403641f | 1931 | } |
f5b79c1c | 1932 | else if (CONSP (elt)) |
54cbc3d4 SM |
1933 | accessible_keymaps_1 (XCAR (elt), XCDR (elt), |
1934 | maps, tail, thisseq, | |
1935 | is_metized && INTEGERP (XCAR (elt))); | |
31bea176 | 1936 | |
2c6f1a39 | 1937 | } |
2c6f1a39 JB |
1938 | } |
1939 | ||
73a4675c | 1940 | return maps; |
2c6f1a39 | 1941 | } |
0403641f | 1942 | \f |
2c6f1a39 JB |
1943 | Lisp_Object Qsingle_key_description, Qkey_description; |
1944 | ||
21a0d7a0 RS |
1945 | /* This function cannot GC. */ |
1946 | ||
2c6f1a39 | 1947 | DEFUN ("key-description", Fkey_description, Skey_description, 1, 1, 0, |
335c5470 PJ |
1948 | doc: /* Return a pretty description of key-sequence KEYS. |
1949 | Control characters turn into "C-foo" sequences, meta into "M-foo" | |
1950 | spaces are put between sequence elements, etc. */) | |
1951 | (keys) | |
2c6f1a39 JB |
1952 | Lisp_Object keys; |
1953 | { | |
6bbd7a29 | 1954 | int len = 0; |
f3ba5409 | 1955 | int i, i_byte; |
4c7d5f13 | 1956 | Lisp_Object sep; |
6bbd7a29 | 1957 | Lisp_Object *args = NULL; |
4c7d5f13 | 1958 | |
47684cd9 | 1959 | if (STRINGP (keys)) |
6ba6e250 RS |
1960 | { |
1961 | Lisp_Object vector; | |
6ba6e250 | 1962 | vector = Fmake_vector (Flength (keys), Qnil); |
d5db4077 | 1963 | for (i = 0, i_byte = 0; i < SCHARS (keys); ) |
6ba6e250 | 1964 | { |
f3ba5409 | 1965 | int c; |
28246d85 | 1966 | int i_before = i; |
f3ba5409 | 1967 | |
54e03a4a KH |
1968 | FETCH_STRING_CHAR_ADVANCE (c, keys, i, i_byte); |
1969 | if (SINGLE_BYTE_CHAR_P (c) && (c & 0200)) | |
1970 | c ^= 0200 | meta_modifier; | |
49801145 | 1971 | XSETFASTINT (AREF (vector, i_before), c); |
6ba6e250 RS |
1972 | } |
1973 | keys = vector; | |
1974 | } | |
4c7d5f13 | 1975 | |
5c9c2c3f RS |
1976 | if (VECTORP (keys)) |
1977 | { | |
1978 | /* In effect, this computes | |
1979 | (mapconcat 'single-key-description keys " ") | |
1980 | but we shouldn't use mapconcat because it can do GC. */ | |
4c7d5f13 | 1981 | |
5c9c2c3f RS |
1982 | len = XVECTOR (keys)->size; |
1983 | sep = build_string (" "); | |
1984 | /* This has one extra element at the end that we don't pass to Fconcat. */ | |
1985 | args = (Lisp_Object *) alloca (len * 2 * sizeof (Lisp_Object)); | |
4c7d5f13 | 1986 | |
5c9c2c3f RS |
1987 | for (i = 0; i < len; i++) |
1988 | { | |
49801145 | 1989 | args[i * 2] = Fsingle_key_description (AREF (keys, i), Qnil); |
5c9c2c3f RS |
1990 | args[i * 2 + 1] = sep; |
1991 | } | |
1992 | } | |
1993 | else if (CONSP (keys)) | |
4c7d5f13 | 1994 | { |
5c9c2c3f RS |
1995 | /* In effect, this computes |
1996 | (mapconcat 'single-key-description keys " ") | |
1997 | but we shouldn't use mapconcat because it can do GC. */ | |
1998 | ||
1999 | len = XFASTINT (Flength (keys)); | |
2000 | sep = build_string (" "); | |
2001 | /* This has one extra element at the end that we don't pass to Fconcat. */ | |
2002 | args = (Lisp_Object *) alloca (len * 2 * sizeof (Lisp_Object)); | |
2003 | ||
2004 | for (i = 0; i < len; i++) | |
2005 | { | |
c1848a97 | 2006 | args[i * 2] = Fsingle_key_description (XCAR (keys), Qnil); |
5c9c2c3f | 2007 | args[i * 2 + 1] = sep; |
03699b14 | 2008 | keys = XCDR (keys); |
5c9c2c3f | 2009 | } |
4c7d5f13 | 2010 | } |
5c9c2c3f RS |
2011 | else |
2012 | keys = wrong_type_argument (Qarrayp, keys); | |
4c7d5f13 | 2013 | |
6e80fddb | 2014 | if (len == 0) |
2b6748c0 | 2015 | return empty_string; |
4c7d5f13 | 2016 | return Fconcat (len * 2 - 1, args); |
2c6f1a39 JB |
2017 | } |
2018 | ||
2019 | char * | |
f1cb0a25 | 2020 | push_key_description (c, p, force_multibyte) |
2c6f1a39 JB |
2021 | register unsigned int c; |
2022 | register char *p; | |
f1cb0a25 | 2023 | int force_multibyte; |
2c6f1a39 | 2024 | { |
bc89c609 | 2025 | unsigned c2; |
31bea176 | 2026 | |
71ac885b RS |
2027 | /* Clear all the meaningless bits above the meta bit. */ |
2028 | c &= meta_modifier | ~ - meta_modifier; | |
bc89c609 GM |
2029 | c2 = c & ~(alt_modifier | ctrl_modifier | hyper_modifier |
2030 | | meta_modifier | shift_modifier | super_modifier); | |
71ac885b | 2031 | |
6ba6e250 RS |
2032 | if (c & alt_modifier) |
2033 | { | |
2034 | *p++ = 'A'; | |
2035 | *p++ = '-'; | |
2036 | c -= alt_modifier; | |
2037 | } | |
bc89c609 GM |
2038 | if ((c & ctrl_modifier) != 0 |
2039 | || (c2 < ' ' && c2 != 27 && c2 != '\t' && c2 != Ctl ('M'))) | |
6ba6e250 RS |
2040 | { |
2041 | *p++ = 'C'; | |
2042 | *p++ = '-'; | |
bc89c609 | 2043 | c &= ~ctrl_modifier; |
6ba6e250 RS |
2044 | } |
2045 | if (c & hyper_modifier) | |
2046 | { | |
2047 | *p++ = 'H'; | |
2048 | *p++ = '-'; | |
2049 | c -= hyper_modifier; | |
2050 | } | |
2051 | if (c & meta_modifier) | |
2c6f1a39 JB |
2052 | { |
2053 | *p++ = 'M'; | |
2054 | *p++ = '-'; | |
6ba6e250 RS |
2055 | c -= meta_modifier; |
2056 | } | |
2057 | if (c & shift_modifier) | |
2058 | { | |
2059 | *p++ = 'S'; | |
2060 | *p++ = '-'; | |
2061 | c -= shift_modifier; | |
2062 | } | |
2063 | if (c & super_modifier) | |
2064 | { | |
2065 | *p++ = 's'; | |
2066 | *p++ = '-'; | |
2067 | c -= super_modifier; | |
2c6f1a39 JB |
2068 | } |
2069 | if (c < 040) | |
2070 | { | |
2071 | if (c == 033) | |
2072 | { | |
2073 | *p++ = 'E'; | |
2074 | *p++ = 'S'; | |
2075 | *p++ = 'C'; | |
2076 | } | |
6ba6e250 | 2077 | else if (c == '\t') |
2c6f1a39 JB |
2078 | { |
2079 | *p++ = 'T'; | |
2080 | *p++ = 'A'; | |
2081 | *p++ = 'B'; | |
2082 | } | |
b8cab006 | 2083 | else if (c == Ctl ('M')) |
2c6f1a39 JB |
2084 | { |
2085 | *p++ = 'R'; | |
2086 | *p++ = 'E'; | |
2087 | *p++ = 'T'; | |
2088 | } | |
2089 | else | |
2090 | { | |
bc89c609 | 2091 | /* `C-' already added above. */ |
2c6f1a39 JB |
2092 | if (c > 0 && c <= Ctl ('Z')) |
2093 | *p++ = c + 0140; | |
2094 | else | |
2095 | *p++ = c + 0100; | |
2096 | } | |
2097 | } | |
2098 | else if (c == 0177) | |
2099 | { | |
2100 | *p++ = 'D'; | |
2101 | *p++ = 'E'; | |
2102 | *p++ = 'L'; | |
2103 | } | |
2104 | else if (c == ' ') | |
9fb71293 | 2105 | { |
2c6f1a39 JB |
2106 | *p++ = 'S'; |
2107 | *p++ = 'P'; | |
2108 | *p++ = 'C'; | |
2109 | } | |
d3c00496 KH |
2110 | else if (c < 128 |
2111 | || (NILP (current_buffer->enable_multibyte_characters) | |
f1cb0a25 GM |
2112 | && SINGLE_BYTE_CHAR_P (c) |
2113 | && !force_multibyte)) | |
2114 | { | |
2115 | *p++ = c; | |
2116 | } | |
6ba6e250 RS |
2117 | else |
2118 | { | |
f1cb0a25 | 2119 | int valid_p = SINGLE_BYTE_CHAR_P (c) || char_valid_p (c, 0); |
31bea176 | 2120 | |
f1cb0a25 GM |
2121 | if (force_multibyte && valid_p) |
2122 | { | |
2123 | if (SINGLE_BYTE_CHAR_P (c)) | |
2124 | c = unibyte_char_to_multibyte (c); | |
2125 | p += CHAR_STRING (c, p); | |
2126 | } | |
2127 | else if (NILP (current_buffer->enable_multibyte_characters) | |
2128 | || valid_p) | |
9fb71293 KH |
2129 | { |
2130 | int bit_offset; | |
2131 | *p++ = '\\'; | |
2132 | /* The biggest character code uses 19 bits. */ | |
2133 | for (bit_offset = 18; bit_offset >= 0; bit_offset -= 3) | |
2134 | { | |
2135 | if (c >= (1 << bit_offset)) | |
2136 | *p++ = ((c & (7 << bit_offset)) >> bit_offset) + '0'; | |
2137 | } | |
2138 | } | |
2139 | else | |
f1cb0a25 | 2140 | p += CHAR_STRING (c, p); |
6ba6e250 | 2141 | } |
2c6f1a39 | 2142 | |
d55627cc | 2143 | return p; |
2c6f1a39 JB |
2144 | } |
2145 | ||
21a0d7a0 RS |
2146 | /* This function cannot GC. */ |
2147 | ||
c1848a97 GM |
2148 | DEFUN ("single-key-description", Fsingle_key_description, |
2149 | Ssingle_key_description, 1, 2, 0, | |
335c5470 PJ |
2150 | doc: /* Return a pretty description of command character KEY. |
2151 | Control characters turn into C-whatever, etc. | |
2152 | Optional argument NO-ANGLES non-nil means don't put angle brackets | |
2153 | around function keys and event symbols. */) | |
2154 | (key, no_angles) | |
c1848a97 | 2155 | Lisp_Object key, no_angles; |
2c6f1a39 | 2156 | { |
5c9c2c3f RS |
2157 | if (CONSP (key) && lucid_event_type_list_p (key)) |
2158 | key = Fevent_convert_list (key); | |
2159 | ||
cebd887d | 2160 | key = EVENT_HEAD (key); |
6bbbd9b0 | 2161 | |
e958fd9a | 2162 | if (INTEGERP (key)) /* Normal character */ |
2c6f1a39 | 2163 | { |
47a18cef | 2164 | unsigned int charset, c1, c2; |
f4977051 | 2165 | int without_bits = XINT (key) & ~((-1) << CHARACTERBITS); |
47a18cef | 2166 | |
f4977051 | 2167 | if (SINGLE_BYTE_CHAR_P (without_bits)) |
47a18cef RS |
2168 | charset = 0; |
2169 | else | |
54e03a4a | 2170 | SPLIT_CHAR (without_bits, charset, c1, c2); |
47a18cef RS |
2171 | |
2172 | if (charset | |
9fb71293 | 2173 | && CHARSET_DEFINED_P (charset) |
47a18cef RS |
2174 | && ((c1 >= 0 && c1 < 32) |
2175 | || (c2 >= 0 && c2 < 32))) | |
2176 | { | |
2177 | /* Handle a generic character. */ | |
2178 | Lisp_Object name; | |
2179 | name = CHARSET_TABLE_INFO (charset, CHARSET_LONG_NAME_IDX); | |
b7826503 | 2180 | CHECK_STRING (name); |
47a18cef RS |
2181 | return concat2 (build_string ("Character set "), name); |
2182 | } | |
2183 | else | |
2184 | { | |
3d9d7a9b GM |
2185 | char tem[KEY_DESCRIPTION_SIZE], *end; |
2186 | int nbytes, nchars; | |
2187 | Lisp_Object string; | |
2188 | ||
2189 | end = push_key_description (XUINT (key), tem, 1); | |
2190 | nbytes = end - tem; | |
2191 | nchars = multibyte_chars_in_text (tem, nbytes); | |
2192 | if (nchars == nbytes) | |
e15e2828 GM |
2193 | { |
2194 | *end = '\0'; | |
2195 | string = build_string (tem); | |
2196 | } | |
3d9d7a9b GM |
2197 | else |
2198 | string = make_multibyte_string (tem, nchars, nbytes); | |
2199 | return string; | |
47a18cef | 2200 | } |
2c6f1a39 | 2201 | } |
e958fd9a | 2202 | else if (SYMBOLP (key)) /* Function key or event-symbol */ |
c7edb960 | 2203 | { |
c1848a97 GM |
2204 | if (NILP (no_angles)) |
2205 | { | |
2206 | char *buffer | |
d5db4077 KR |
2207 | = (char *) alloca (SBYTES (SYMBOL_NAME (key)) + 5); |
2208 | sprintf (buffer, "<%s>", SDATA (SYMBOL_NAME (key))); | |
c1848a97 GM |
2209 | return build_string (buffer); |
2210 | } | |
2211 | else | |
2212 | return Fsymbol_name (key); | |
c7edb960 | 2213 | } |
e958fd9a KH |
2214 | else if (STRINGP (key)) /* Buffer names in the menubar. */ |
2215 | return Fcopy_sequence (key); | |
2216 | else | |
2217 | error ("KEY must be an integer, cons, symbol, or string"); | |
6bbd7a29 | 2218 | return Qnil; |
2c6f1a39 JB |
2219 | } |
2220 | ||
2221 | char * | |
2222 | push_text_char_description (c, p) | |
2223 | register unsigned int c; | |
2224 | register char *p; | |
2225 | { | |
2226 | if (c >= 0200) | |
2227 | { | |
2228 | *p++ = 'M'; | |
2229 | *p++ = '-'; | |
2230 | c -= 0200; | |
2231 | } | |
2232 | if (c < 040) | |
2233 | { | |
2234 | *p++ = '^'; | |
2235 | *p++ = c + 64; /* 'A' - 1 */ | |
2236 | } | |
2237 | else if (c == 0177) | |
2238 | { | |
2239 | *p++ = '^'; | |
2240 | *p++ = '?'; | |
2241 | } | |
2242 | else | |
2243 | *p++ = c; | |
d55627cc | 2244 | return p; |
2c6f1a39 JB |
2245 | } |
2246 | ||
21a0d7a0 RS |
2247 | /* This function cannot GC. */ |
2248 | ||
2c6f1a39 | 2249 | DEFUN ("text-char-description", Ftext_char_description, Stext_char_description, 1, 1, 0, |
335c5470 PJ |
2250 | doc: /* Return a pretty description of file-character CHARACTER. |
2251 | Control characters turn into "^char", etc. */) | |
2252 | (character) | |
88539837 | 2253 | Lisp_Object character; |
2c6f1a39 | 2254 | { |
0a16479f KH |
2255 | /* Currently MAX_MULTIBYTE_LENGTH is 4 (< 6). */ |
2256 | unsigned char str[6]; | |
2257 | int c; | |
2c6f1a39 | 2258 | |
b7826503 | 2259 | CHECK_NUMBER (character); |
2c6f1a39 | 2260 | |
0a16479f KH |
2261 | c = XINT (character); |
2262 | if (!SINGLE_BYTE_CHAR_P (c)) | |
a98f1d1d | 2263 | { |
0a16479f | 2264 | int len = CHAR_STRING (c, str); |
a98f1d1d | 2265 | |
f3ba5409 | 2266 | return make_multibyte_string (str, 1, len); |
a98f1d1d KH |
2267 | } |
2268 | ||
0a16479f | 2269 | *push_text_char_description (c & 0377, str) = 0; |
2c6f1a39 | 2270 | |
0a16479f | 2271 | return build_string (str); |
2c6f1a39 | 2272 | } |
2fc66973 JB |
2273 | |
2274 | /* Return non-zero if SEQ contains only ASCII characters, perhaps with | |
2275 | a meta bit. */ | |
2276 | static int | |
2277 | ascii_sequence_p (seq) | |
2278 | Lisp_Object seq; | |
2279 | { | |
6e344130 | 2280 | int i; |
2fc66973 | 2281 | int len = XINT (Flength (seq)); |
ffab2bd6 | 2282 | |
6e344130 | 2283 | for (i = 0; i < len; i++) |
2fc66973 | 2284 | { |
6e344130 | 2285 | Lisp_Object ii, elt; |
ffab2bd6 | 2286 | |
6e344130 KH |
2287 | XSETFASTINT (ii, i); |
2288 | elt = Faref (seq, ii); | |
2fc66973 | 2289 | |
416349ec | 2290 | if (!INTEGERP (elt) |
2fc66973 JB |
2291 | || (XUINT (elt) & ~CHAR_META) >= 0x80) |
2292 | return 0; | |
2293 | } | |
2294 | ||
2295 | return 1; | |
2296 | } | |
2297 | ||
2c6f1a39 | 2298 | \f |
cc0a8174 JB |
2299 | /* where-is - finding a command in a set of keymaps. */ |
2300 | ||
0c412762 | 2301 | static Lisp_Object where_is_internal (); |
0403641f | 2302 | static Lisp_Object where_is_internal_1 (); |
69248761 | 2303 | static void where_is_internal_2 (); |
0403641f | 2304 | |
49801145 SM |
2305 | /* Like Flookup_key, but uses a list of keymaps SHADOW instead of a single map. |
2306 | Returns the first non-nil binding found in any of those maps. */ | |
2307 | ||
2308 | static Lisp_Object | |
2309 | shadow_lookup (shadow, key, flag) | |
2310 | Lisp_Object shadow, key, flag; | |
2311 | { | |
2312 | Lisp_Object tail, value; | |
2313 | ||
2314 | for (tail = shadow; CONSP (tail); tail = XCDR (tail)) | |
2315 | { | |
2316 | value = Flookup_key (XCAR (tail), key, flag); | |
2317 | if (!NILP (value) && !NATNUMP (value)) | |
2318 | return value; | |
2319 | } | |
2320 | return Qnil; | |
2321 | } | |
2322 | ||
d378869e SM |
2323 | static Lisp_Object Vmenu_events; |
2324 | ||
49801145 SM |
2325 | /* This function can GC if Flookup_key autoloads any keymaps. */ |
2326 | ||
1e7d1ab0 | 2327 | static Lisp_Object |
0c412762 | 2328 | where_is_internal (definition, keymaps, firstonly, noindirect, no_remap) |
1e7d1ab0 | 2329 | Lisp_Object definition, keymaps; |
0c412762 | 2330 | Lisp_Object firstonly, noindirect, no_remap; |
2c6f1a39 | 2331 | { |
49801145 | 2332 | Lisp_Object maps = Qnil; |
0403641f | 2333 | Lisp_Object found, sequences; |
21a0d7a0 | 2334 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4, gcpro5; |
0bc395d4 RS |
2335 | /* 1 means ignore all menu bindings entirely. */ |
2336 | int nomenus = !NILP (firstonly) && !EQ (firstonly, Qnon_ascii); | |
2c6f1a39 | 2337 | |
0c412762 KS |
2338 | /* If this command is remapped, then it has no key bindings |
2339 | of its own. */ | |
a1df473f KS |
2340 | if (NILP (no_remap) && SYMBOLP (definition)) |
2341 | { | |
2342 | Lisp_Object tem; | |
023b93f6 | 2343 | if (tem = Fcommand_remapping (definition), !NILP (tem)) |
a1df473f KS |
2344 | return Qnil; |
2345 | } | |
0c412762 | 2346 | |
49801145 SM |
2347 | found = keymaps; |
2348 | while (CONSP (found)) | |
93d2aa1c | 2349 | { |
49801145 | 2350 | maps = |
02067692 SM |
2351 | nconc2 (maps, |
2352 | Faccessible_keymaps (get_keymap (XCAR (found), 1, 0), Qnil)); | |
49801145 | 2353 | found = XCDR (found); |
93d2aa1c | 2354 | } |
31bea176 | 2355 | |
49801145 | 2356 | GCPRO5 (definition, keymaps, maps, found, sequences); |
2c6f1a39 | 2357 | found = Qnil; |
0403641f | 2358 | sequences = Qnil; |
2c6f1a39 | 2359 | |
265a9e55 | 2360 | for (; !NILP (maps); maps = Fcdr (maps)) |
2c6f1a39 | 2361 | { |
e9b6dfb0 | 2362 | /* Key sequence to reach map, and the map that it reaches */ |
d378869e | 2363 | register Lisp_Object this, map, tem; |
f5b79c1c | 2364 | |
2c6f1a39 JB |
2365 | /* In order to fold [META-PREFIX-CHAR CHAR] sequences into |
2366 | [M-CHAR] sequences, check if last character of the sequence | |
2367 | is the meta-prefix char. */ | |
e9b6dfb0 KH |
2368 | Lisp_Object last; |
2369 | int last_is_meta; | |
2370 | ||
2371 | this = Fcar (Fcar (maps)); | |
2372 | map = Fcdr (Fcar (maps)); | |
2373 | last = make_number (XINT (Flength (this)) - 1); | |
2374 | last_is_meta = (XINT (last) >= 0 | |
2375 | && EQ (Faref (this, last), meta_prefix_char)); | |
2c6f1a39 | 2376 | |
2ba11bbd | 2377 | /* if (nomenus && !ascii_sequence_p (this)) */ |
f58c6494 | 2378 | if (nomenus && XINT (last) >= 0 |
d378869e SM |
2379 | && SYMBOLP (tem = Faref (this, make_number (0))) |
2380 | && !NILP (Fmemq (XCAR (parse_modifiers (tem)), Vmenu_events))) | |
88416888 SM |
2381 | /* If no menu entries should be returned, skip over the |
2382 | keymaps bound to `menu-bar' and `tool-bar' and other | |
2ba11bbd | 2383 | non-ascii prefixes like `C-down-mouse-2'. */ |
88416888 | 2384 | continue; |
31bea176 | 2385 | |
fde3a52f JB |
2386 | QUIT; |
2387 | ||
f5b79c1c | 2388 | while (CONSP (map)) |
2c6f1a39 | 2389 | { |
f5b79c1c JB |
2390 | /* Because the code we want to run on each binding is rather |
2391 | large, we don't want to have two separate loop bodies for | |
2392 | sparse keymap bindings and tables; we want to iterate one | |
2393 | loop body over both keymap and vector bindings. | |
2394 | ||
2395 | For this reason, if Fcar (map) is a vector, we don't | |
2396 | advance map to the next element until i indicates that we | |
2397 | have finished off the vector. */ | |
21a0d7a0 | 2398 | Lisp_Object elt, key, binding; |
03699b14 KR |
2399 | elt = XCAR (map); |
2400 | map = XCDR (map); | |
0403641f RS |
2401 | |
2402 | sequences = Qnil; | |
f5b79c1c | 2403 | |
fde3a52f JB |
2404 | QUIT; |
2405 | ||
f5b79c1c JB |
2406 | /* Set key and binding to the current key and binding, and |
2407 | advance map and i to the next binding. */ | |
416349ec | 2408 | if (VECTORP (elt)) |
2c6f1a39 | 2409 | { |
0403641f RS |
2410 | Lisp_Object sequence; |
2411 | int i; | |
2c6f1a39 | 2412 | /* In a vector, look at each element. */ |
0403641f | 2413 | for (i = 0; i < XVECTOR (elt)->size; i++) |
2c6f1a39 | 2414 | { |
49801145 | 2415 | binding = AREF (elt, i); |
0403641f RS |
2416 | XSETFASTINT (key, i); |
2417 | sequence = where_is_internal_1 (binding, key, definition, | |
49801145 | 2418 | noindirect, this, |
0403641f RS |
2419 | last, nomenus, last_is_meta); |
2420 | if (!NILP (sequence)) | |
2421 | sequences = Fcons (sequence, sequences); | |
2c6f1a39 | 2422 | } |
f5b79c1c | 2423 | } |
0403641f | 2424 | else if (CHAR_TABLE_P (elt)) |
f5b79c1c | 2425 | { |
23cf1efa | 2426 | Lisp_Object indices[3]; |
0403641f | 2427 | Lisp_Object args; |
23cf1efa | 2428 | |
0403641f | 2429 | args = Fcons (Fcons (Fcons (definition, noindirect), |
49801145 | 2430 | Qnil), /* Result accumulator. */ |
0403641f RS |
2431 | Fcons (Fcons (this, last), |
2432 | Fcons (make_number (nomenus), | |
2433 | make_number (last_is_meta)))); | |
0403641f RS |
2434 | map_char_table (where_is_internal_2, Qnil, elt, args, |
2435 | 0, indices); | |
49801145 | 2436 | sequences = XCDR (XCAR (args)); |
2c6f1a39 | 2437 | } |
0403641f | 2438 | else if (CONSP (elt)) |
fde3a52f | 2439 | { |
0403641f | 2440 | Lisp_Object sequence; |
2c6f1a39 | 2441 | |
03699b14 KR |
2442 | key = XCAR (elt); |
2443 | binding = XCDR (elt); | |
2c6f1a39 | 2444 | |
0403641f | 2445 | sequence = where_is_internal_1 (binding, key, definition, |
49801145 | 2446 | noindirect, this, |
0403641f RS |
2447 | last, nomenus, last_is_meta); |
2448 | if (!NILP (sequence)) | |
2449 | sequences = Fcons (sequence, sequences); | |
2c6f1a39 | 2450 | } |
2c6f1a39 | 2451 | |
2c6f1a39 | 2452 | |
0c412762 | 2453 | while (!NILP (sequences)) |
2c6f1a39 | 2454 | { |
a1df473f | 2455 | Lisp_Object sequence, remapped, function; |
0403641f | 2456 | |
03699b14 | 2457 | sequence = XCAR (sequences); |
0c412762 KS |
2458 | sequences = XCDR (sequences); |
2459 | ||
a1df473f KS |
2460 | /* If the current sequence is a command remapping with |
2461 | format [remap COMMAND], find the key sequences | |
2462 | which run COMMAND, and use those sequences instead. */ | |
0c412762 KS |
2463 | remapped = Qnil; |
2464 | if (NILP (no_remap) | |
a1df473f KS |
2465 | && VECTORP (sequence) && XVECTOR (sequence)->size == 2 |
2466 | && EQ (AREF (sequence, 0), Qremap) | |
2467 | && (function = AREF (sequence, 1), SYMBOLP (function))) | |
0c412762 | 2468 | { |
a1df473f | 2469 | Lisp_Object remapped1; |
0c412762 | 2470 | |
a1df473f KS |
2471 | remapped1 = where_is_internal (function, keymaps, firstonly, noindirect, Qt); |
2472 | if (CONSP (remapped1)) | |
0c412762 | 2473 | { |
a1df473f KS |
2474 | /* Verify that this key binding actually maps to the |
2475 | remapped command (see below). */ | |
2476 | if (!EQ (shadow_lookup (keymaps, XCAR (remapped1), Qnil), function)) | |
2477 | continue; | |
2478 | sequence = XCAR (remapped1); | |
2479 | remapped = XCDR (remapped1); | |
2480 | goto record_sequence; | |
0c412762 KS |
2481 | } |
2482 | } | |
0403641f | 2483 | |
49801145 SM |
2484 | /* Verify that this key binding is not shadowed by another |
2485 | binding for the same key, before we say it exists. | |
2486 | ||
2487 | Mechanism: look for local definition of this key and if | |
2488 | it is defined and does not match what we found then | |
2489 | ignore this key. | |
2490 | ||
2491 | Either nil or number as value from Flookup_key | |
2492 | means undefined. */ | |
1e7d1ab0 | 2493 | if (!EQ (shadow_lookup (keymaps, sequence, Qnil), definition)) |
49801145 SM |
2494 | continue; |
2495 | ||
0c412762 | 2496 | record_sequence: |
0403641f RS |
2497 | /* It is a true unshadowed match. Record it, unless it's already |
2498 | been seen (as could happen when inheriting keymaps). */ | |
2499 | if (NILP (Fmember (sequence, found))) | |
2500 | found = Fcons (sequence, found); | |
2501 | ||
2502 | /* If firstonly is Qnon_ascii, then we can return the first | |
2503 | binding we find. If firstonly is not Qnon_ascii but not | |
2504 | nil, then we should return the first ascii-only binding | |
2505 | we find. */ | |
2506 | if (EQ (firstonly, Qnon_ascii)) | |
2507 | RETURN_UNGCPRO (sequence); | |
54cbc3d4 | 2508 | else if (!NILP (firstonly) && ascii_sequence_p (sequence)) |
0403641f | 2509 | RETURN_UNGCPRO (sequence); |
0c412762 KS |
2510 | |
2511 | if (CONSP (remapped)) | |
2512 | { | |
2513 | sequence = XCAR (remapped); | |
2514 | remapped = XCDR (remapped); | |
2515 | goto record_sequence; | |
2516 | } | |
2c6f1a39 | 2517 | } |
2c6f1a39 JB |
2518 | } |
2519 | } | |
2fc66973 | 2520 | |
21a0d7a0 RS |
2521 | UNGCPRO; |
2522 | ||
2fc66973 JB |
2523 | found = Fnreverse (found); |
2524 | ||
2525 | /* firstonly may have been t, but we may have gone all the way through | |
2526 | the keymaps without finding an all-ASCII key sequence. So just | |
2527 | return the best we could find. */ | |
54cbc3d4 | 2528 | if (!NILP (firstonly)) |
2fc66973 | 2529 | return Fcar (found); |
31bea176 | 2530 | |
2fc66973 | 2531 | return found; |
2c6f1a39 | 2532 | } |
0403641f | 2533 | |
0c412762 | 2534 | DEFUN ("where-is-internal", Fwhere_is_internal, Swhere_is_internal, 1, 5, 0, |
335c5470 PJ |
2535 | doc: /* Return list of keys that invoke DEFINITION. |
2536 | If KEYMAP is non-nil, search only KEYMAP and the global keymap. | |
2537 | If KEYMAP is nil, search all the currently active keymaps. | |
2538 | If KEYMAP is a list of keymaps, search only those keymaps. | |
2539 | ||
2540 | If optional 3rd arg FIRSTONLY is non-nil, return the first key sequence found, | |
2541 | rather than a list of all possible key sequences. | |
2542 | If FIRSTONLY is the symbol `non-ascii', return the first binding found, | |
2543 | no matter what it is. | |
2544 | If FIRSTONLY has another non-nil value, prefer sequences of ASCII characters, | |
2545 | and entirely reject menu bindings. | |
2546 | ||
2547 | If optional 4th arg NOINDIRECT is non-nil, don't follow indirections | |
2548 | to other keymaps or slots. This makes it possible to search for an | |
0c412762 KS |
2549 | indirect definition itself. |
2550 | ||
2551 | If optional 5th arg NO-REMAP is non-nil, don't search for key sequences | |
2552 | that invoke a command which is remapped to DEFINITION, but include the | |
2553 | remapped command in the returned list. */) | |
2554 | (definition, keymap, firstonly, noindirect, no_remap) | |
4956d1ef | 2555 | Lisp_Object definition, keymap; |
0c412762 | 2556 | Lisp_Object firstonly, noindirect, no_remap; |
1e7d1ab0 SM |
2557 | { |
2558 | Lisp_Object sequences, keymaps; | |
1e7d1ab0 SM |
2559 | /* 1 means ignore all menu bindings entirely. */ |
2560 | int nomenus = !NILP (firstonly) && !EQ (firstonly, Qnon_ascii); | |
f9aaedb6 | 2561 | Lisp_Object result; |
1e7d1ab0 SM |
2562 | |
2563 | /* Find the relevant keymaps. */ | |
4956d1ef GM |
2564 | if (CONSP (keymap) && KEYMAPP (XCAR (keymap))) |
2565 | keymaps = keymap; | |
54cbc3d4 | 2566 | else if (!NILP (keymap)) |
4956d1ef | 2567 | keymaps = Fcons (keymap, Fcons (current_global_map, Qnil)); |
1e7d1ab0 | 2568 | else |
54cbc3d4 | 2569 | keymaps = Fcurrent_active_maps (Qnil); |
1e7d1ab0 SM |
2570 | |
2571 | /* Only use caching for the menubar (i.e. called with (def nil t nil). | |
4956d1ef GM |
2572 | We don't really need to check `keymap'. */ |
2573 | if (nomenus && NILP (noindirect) && NILP (keymap)) | |
1e7d1ab0 | 2574 | { |
f9aaedb6 | 2575 | Lisp_Object *defns; |
60dc6558 | 2576 | int i, j, n; |
0c412762 | 2577 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4, gcpro5; |
744cd66b | 2578 | |
1e7d1ab0 SM |
2579 | /* Check heuristic-consistency of the cache. */ |
2580 | if (NILP (Fequal (keymaps, where_is_cache_keymaps))) | |
2581 | where_is_cache = Qnil; | |
2582 | ||
2583 | if (NILP (where_is_cache)) | |
2584 | { | |
2585 | /* We need to create the cache. */ | |
2586 | Lisp_Object args[2]; | |
2587 | where_is_cache = Fmake_hash_table (0, args); | |
2588 | where_is_cache_keymaps = Qt; | |
31bea176 | 2589 | |
1e7d1ab0 | 2590 | /* Fill in the cache. */ |
0c412762 KS |
2591 | GCPRO5 (definition, keymaps, firstonly, noindirect, no_remap); |
2592 | where_is_internal (definition, keymaps, firstonly, noindirect, no_remap); | |
1e7d1ab0 SM |
2593 | UNGCPRO; |
2594 | ||
2595 | where_is_cache_keymaps = keymaps; | |
2596 | } | |
2597 | ||
f9aaedb6 GM |
2598 | /* We want to process definitions from the last to the first. |
2599 | Instead of consing, copy definitions to a vector and step | |
2600 | over that vector. */ | |
1e7d1ab0 | 2601 | sequences = Fgethash (definition, where_is_cache, Qnil); |
f58c6494 | 2602 | n = XINT (Flength (sequences)); |
f9aaedb6 GM |
2603 | defns = (Lisp_Object *) alloca (n * sizeof *defns); |
2604 | for (i = 0; CONSP (sequences); sequences = XCDR (sequences)) | |
2605 | defns[i++] = XCAR (sequences); | |
31bea176 | 2606 | |
f9aaedb6 GM |
2607 | /* Verify that the key bindings are not shadowed. Note that |
2608 | the following can GC. */ | |
2609 | GCPRO2 (definition, keymaps); | |
2610 | result = Qnil; | |
60dc6558 | 2611 | j = -1; |
f9aaedb6 | 2612 | for (i = n - 1; i >= 0; --i) |
60dc6558 SM |
2613 | if (EQ (shadow_lookup (keymaps, defns[i], Qnil), definition)) |
2614 | { | |
2615 | if (ascii_sequence_p (defns[i])) | |
2616 | break; | |
2617 | else if (j < 0) | |
2618 | j = i; | |
2619 | } | |
f9aaedb6 | 2620 | |
60dc6558 | 2621 | result = i >= 0 ? defns[i] : (j >= 0 ? defns[j] : Qnil); |
f9aaedb6 | 2622 | UNGCPRO; |
1e7d1ab0 SM |
2623 | } |
2624 | else | |
2625 | { | |
2626 | /* Kill the cache so that where_is_internal_1 doesn't think | |
2627 | we're filling it up. */ | |
2628 | where_is_cache = Qnil; | |
0c412762 | 2629 | result = where_is_internal (definition, keymaps, firstonly, noindirect, no_remap); |
1e7d1ab0 | 2630 | } |
f9aaedb6 GM |
2631 | |
2632 | return result; | |
1e7d1ab0 SM |
2633 | } |
2634 | ||
0403641f RS |
2635 | /* This is the function that Fwhere_is_internal calls using map_char_table. |
2636 | ARGS has the form | |
2637 | (((DEFINITION . NOINDIRECT) . (KEYMAP . RESULT)) | |
2638 | . | |
2639 | ((THIS . LAST) . (NOMENUS . LAST_IS_META))) | |
2640 | Since map_char_table doesn't really use the return value from this function, | |
df75b1a3 GM |
2641 | we the result append to RESULT, the slot in ARGS. |
2642 | ||
2643 | This function can GC because it calls where_is_internal_1 which can | |
2644 | GC. */ | |
0403641f | 2645 | |
69248761 | 2646 | static void |
0403641f RS |
2647 | where_is_internal_2 (args, key, binding) |
2648 | Lisp_Object args, key, binding; | |
2649 | { | |
49801145 | 2650 | Lisp_Object definition, noindirect, this, last; |
0403641f RS |
2651 | Lisp_Object result, sequence; |
2652 | int nomenus, last_is_meta; | |
df75b1a3 | 2653 | struct gcpro gcpro1, gcpro2, gcpro3; |
0403641f | 2654 | |
df75b1a3 | 2655 | GCPRO3 (args, key, binding); |
49801145 | 2656 | result = XCDR (XCAR (args)); |
03699b14 KR |
2657 | definition = XCAR (XCAR (XCAR (args))); |
2658 | noindirect = XCDR (XCAR (XCAR (args))); | |
03699b14 KR |
2659 | this = XCAR (XCAR (XCDR (args))); |
2660 | last = XCDR (XCAR (XCDR (args))); | |
2661 | nomenus = XFASTINT (XCAR (XCDR (XCDR (args)))); | |
2662 | last_is_meta = XFASTINT (XCDR (XCDR (XCDR (args)))); | |
0403641f | 2663 | |
49801145 | 2664 | sequence = where_is_internal_1 (binding, key, definition, noindirect, |
0403641f RS |
2665 | this, last, nomenus, last_is_meta); |
2666 | ||
2667 | if (!NILP (sequence)) | |
f3fbd155 | 2668 | XSETCDR (XCAR (args), Fcons (sequence, result)); |
df75b1a3 GM |
2669 | |
2670 | UNGCPRO; | |
0403641f RS |
2671 | } |
2672 | ||
df75b1a3 | 2673 | |
49801145 | 2674 | /* This function cannot GC. */ |
df75b1a3 | 2675 | |
0403641f | 2676 | static Lisp_Object |
49801145 | 2677 | where_is_internal_1 (binding, key, definition, noindirect, this, last, |
0403641f | 2678 | nomenus, last_is_meta) |
49801145 | 2679 | Lisp_Object binding, key, definition, noindirect, this, last; |
0403641f RS |
2680 | int nomenus, last_is_meta; |
2681 | { | |
2682 | Lisp_Object sequence; | |
0403641f RS |
2683 | |
2684 | /* Search through indirections unless that's not wanted. */ | |
2685 | if (NILP (noindirect)) | |
35810b6f | 2686 | binding = get_keyelt (binding, 0); |
0403641f RS |
2687 | |
2688 | /* End this iteration if this element does not match | |
2689 | the target. */ | |
2690 | ||
1e7d1ab0 SM |
2691 | if (!(!NILP (where_is_cache) /* everything "matches" during cache-fill. */ |
2692 | || EQ (binding, definition) | |
2693 | || (CONSP (definition) && !NILP (Fequal (binding, definition))))) | |
2694 | /* Doesn't match. */ | |
2695 | return Qnil; | |
0403641f | 2696 | |
1e7d1ab0 | 2697 | /* We have found a match. Construct the key sequence where we found it. */ |
0403641f RS |
2698 | if (INTEGERP (key) && last_is_meta) |
2699 | { | |
2700 | sequence = Fcopy_sequence (this); | |
2701 | Faset (sequence, last, make_number (XINT (key) | meta_modifier)); | |
2702 | } | |
2703 | else | |
2704 | sequence = append_key (this, key); | |
2705 | ||
1e7d1ab0 SM |
2706 | if (!NILP (where_is_cache)) |
2707 | { | |
2708 | Lisp_Object sequences = Fgethash (binding, where_is_cache, Qnil); | |
2709 | Fputhash (binding, Fcons (sequence, sequences), where_is_cache); | |
2710 | return Qnil; | |
2711 | } | |
2712 | else | |
2713 | return sequence; | |
0403641f | 2714 | } |
2c6f1a39 | 2715 | \f |
cc0a8174 JB |
2716 | /* describe-bindings - summarizing all the bindings in a set of keymaps. */ |
2717 | ||
54cbc3d4 | 2718 | DEFUN ("describe-buffer-bindings", Fdescribe_buffer_bindings, Sdescribe_buffer_bindings, 1, 3, 0, |
335c5470 PJ |
2719 | doc: /* Insert the list of all defined keys and their definitions. |
2720 | The list is inserted in the current buffer, while the bindings are | |
2721 | looked up in BUFFER. | |
2722 | The optional argument PREFIX, if non-nil, should be a key sequence; | |
2723 | then we display only bindings that start with that prefix. | |
2724 | The optional argument MENUS, if non-nil, says to mention menu bindings. | |
2725 | \(Ordinarily these are omitted from the output.) */) | |
2726 | (buffer, prefix, menus) | |
54cbc3d4 | 2727 | Lisp_Object buffer, prefix, menus; |
2c6f1a39 | 2728 | { |
54cbc3d4 SM |
2729 | Lisp_Object outbuf, shadow; |
2730 | int nomenu = NILP (menus); | |
d7ab90a9 KH |
2731 | register Lisp_Object start1; |
2732 | struct gcpro gcpro1; | |
2c6f1a39 | 2733 | |
4726a9f1 JB |
2734 | char *alternate_heading |
2735 | = "\ | |
6cec169a RS |
2736 | Keyboard translations:\n\n\ |
2737 | You type Translation\n\ | |
2738 | -------- -----------\n"; | |
2c6f1a39 | 2739 | |
a588e041 | 2740 | shadow = Qnil; |
d7ab90a9 | 2741 | GCPRO1 (shadow); |
53c8f9fa | 2742 | |
36ca6189 | 2743 | outbuf = Fcurrent_buffer (); |
2c6f1a39 | 2744 | |
4726a9f1 | 2745 | /* Report on alternates for keys. */ |
d7bf9bf5 | 2746 | if (STRINGP (Vkeyboard_translate_table) && !NILP (prefix)) |
4726a9f1 JB |
2747 | { |
2748 | int c; | |
3141e0ab | 2749 | const unsigned char *translate = SDATA (Vkeyboard_translate_table); |
d5db4077 | 2750 | int translate_len = SCHARS (Vkeyboard_translate_table); |
4726a9f1 JB |
2751 | |
2752 | for (c = 0; c < translate_len; c++) | |
2753 | if (translate[c] != c) | |
2754 | { | |
d2d9586a | 2755 | char buf[KEY_DESCRIPTION_SIZE]; |
4726a9f1 JB |
2756 | char *bufend; |
2757 | ||
2758 | if (alternate_heading) | |
2759 | { | |
2760 | insert_string (alternate_heading); | |
2761 | alternate_heading = 0; | |
2762 | } | |
2763 | ||
f1cb0a25 | 2764 | bufend = push_key_description (translate[c], buf, 1); |
4726a9f1 JB |
2765 | insert (buf, bufend - buf); |
2766 | Findent_to (make_number (16), make_number (1)); | |
f1cb0a25 | 2767 | bufend = push_key_description (c, buf, 1); |
4726a9f1 JB |
2768 | insert (buf, bufend - buf); |
2769 | ||
2770 | insert ("\n", 1); | |
2771 | } | |
2772 | ||
2773 | insert ("\n", 1); | |
2774 | } | |
2775 | ||
d7bf9bf5 RS |
2776 | if (!NILP (Vkey_translation_map)) |
2777 | describe_map_tree (Vkey_translation_map, 0, Qnil, prefix, | |
6cec169a | 2778 | "Key translations", nomenu, 1, 0); |
d7bf9bf5 | 2779 | |
cc0a8174 | 2780 | |
53c8f9fa | 2781 | /* Print the (major mode) local map. */ |
36ca6189 | 2782 | start1 = Qnil; |
e784236d KH |
2783 | if (!NILP (current_kboard->Voverriding_terminal_local_map)) |
2784 | start1 = current_kboard->Voverriding_terminal_local_map; | |
2785 | else if (!NILP (Voverriding_local_map)) | |
7d92e329 | 2786 | start1 = Voverriding_local_map; |
7d92e329 | 2787 | |
265a9e55 | 2788 | if (!NILP (start1)) |
2c6f1a39 | 2789 | { |
91f64ec2 | 2790 | describe_map_tree (start1, 1, shadow, prefix, |
36ca6189 | 2791 | "\f\nOverriding Bindings", nomenu, 0, 0); |
53c8f9fa | 2792 | shadow = Fcons (start1, shadow); |
2c6f1a39 | 2793 | } |
36ca6189 RS |
2794 | else |
2795 | { | |
2796 | /* Print the minor mode and major mode keymaps. */ | |
2797 | int i, nmaps; | |
2798 | Lisp_Object *modes, *maps; | |
2799 | ||
2800 | /* Temporarily switch to `buffer', so that we can get that buffer's | |
2801 | minor modes correctly. */ | |
2802 | Fset_buffer (buffer); | |
2803 | ||
2804 | nmaps = current_minor_maps (&modes, &maps); | |
2805 | Fset_buffer (outbuf); | |
2806 | ||
d1d070e3 RS |
2807 | start1 = get_local_map (BUF_PT (XBUFFER (buffer)), |
2808 | XBUFFER (buffer), Qkeymap); | |
2809 | if (!NILP (start1)) | |
2810 | { | |
2811 | describe_map_tree (start1, 1, shadow, prefix, | |
2812 | "\f\n`keymap' Property Bindings", nomenu, 0, 0); | |
2813 | shadow = Fcons (start1, shadow); | |
2814 | } | |
2815 | ||
36ca6189 RS |
2816 | /* Print the minor mode maps. */ |
2817 | for (i = 0; i < nmaps; i++) | |
2818 | { | |
2819 | /* The title for a minor mode keymap | |
2820 | is constructed at run time. | |
2821 | We let describe_map_tree do the actual insertion | |
2822 | because it takes care of other features when doing so. */ | |
2823 | char *title, *p; | |
2824 | ||
2825 | if (!SYMBOLP (modes[i])) | |
2826 | abort(); | |
2827 | ||
d5db4077 | 2828 | p = title = (char *) alloca (42 + SCHARS (SYMBOL_NAME (modes[i]))); |
36ca6189 RS |
2829 | *p++ = '\f'; |
2830 | *p++ = '\n'; | |
2831 | *p++ = '`'; | |
d5db4077 KR |
2832 | bcopy (SDATA (SYMBOL_NAME (modes[i])), p, |
2833 | SCHARS (SYMBOL_NAME (modes[i]))); | |
2834 | p += SCHARS (SYMBOL_NAME (modes[i])); | |
36ca6189 RS |
2835 | *p++ = '\''; |
2836 | bcopy (" Minor Mode Bindings", p, sizeof (" Minor Mode Bindings") - 1); | |
2837 | p += sizeof (" Minor Mode Bindings") - 1; | |
2838 | *p = 0; | |
2839 | ||
2840 | describe_map_tree (maps[i], 1, shadow, prefix, title, nomenu, 0, 0); | |
2841 | shadow = Fcons (maps[i], shadow); | |
2842 | } | |
2843 | ||
36ca6189 RS |
2844 | start1 = get_local_map (BUF_PT (XBUFFER (buffer)), |
2845 | XBUFFER (buffer), Qlocal_map); | |
2846 | if (!NILP (start1)) | |
2847 | { | |
2848 | if (EQ (start1, XBUFFER (buffer)->keymap)) | |
2849 | describe_map_tree (start1, 1, shadow, prefix, | |
2850 | "\f\nMajor Mode Bindings", nomenu, 0, 0); | |
2851 | else | |
2852 | describe_map_tree (start1, 1, shadow, prefix, | |
d1d070e3 RS |
2853 | "\f\n`local-map' Property Bindings", |
2854 | nomenu, 0, 0); | |
36ca6189 RS |
2855 | |
2856 | shadow = Fcons (start1, shadow); | |
2857 | } | |
2858 | } | |
2c6f1a39 | 2859 | |
91f64ec2 | 2860 | describe_map_tree (current_global_map, 1, shadow, prefix, |
97d4edaa | 2861 | "\f\nGlobal Bindings", nomenu, 0, 1); |
d7bf9bf5 RS |
2862 | |
2863 | /* Print the function-key-map translations under this prefix. */ | |
2864 | if (!NILP (Vfunction_key_map)) | |
2865 | describe_map_tree (Vfunction_key_map, 0, Qnil, prefix, | |
97d4edaa | 2866 | "\f\nFunction key map translations", nomenu, 1, 0); |
2c6f1a39 | 2867 | |
d7ab90a9 | 2868 | UNGCPRO; |
2c6f1a39 JB |
2869 | return Qnil; |
2870 | } | |
2871 | ||
b31a4218 | 2872 | /* Insert a description of the key bindings in STARTMAP, |
2c6f1a39 JB |
2873 | followed by those of all maps reachable through STARTMAP. |
2874 | If PARTIAL is nonzero, omit certain "uninteresting" commands | |
2875 | (such as `undefined'). | |
53c8f9fa RS |
2876 | If SHADOW is non-nil, it is a list of maps; |
2877 | don't mention keys which would be shadowed by any of them. | |
2878 | PREFIX, if non-nil, says mention only keys that start with PREFIX. | |
07f15dfd | 2879 | TITLE, if not 0, is a string to insert at the beginning. |
af1d6f09 | 2880 | TITLE should not end with a colon or a newline; we supply that. |
d7bf9bf5 RS |
2881 | If NOMENU is not 0, then omit menu-bar commands. |
2882 | ||
2883 | If TRANSL is nonzero, the definitions are actually key translations | |
c2b714de RS |
2884 | so print strings and vectors differently. |
2885 | ||
2886 | If ALWAYS_TITLE is nonzero, print the title even if there are no maps | |
2887 | to look through. */ | |
2c6f1a39 JB |
2888 | |
2889 | void | |
c2b714de RS |
2890 | describe_map_tree (startmap, partial, shadow, prefix, title, nomenu, transl, |
2891 | always_title) | |
53c8f9fa | 2892 | Lisp_Object startmap, shadow, prefix; |
2c6f1a39 | 2893 | int partial; |
53c8f9fa | 2894 | char *title; |
af1d6f09 | 2895 | int nomenu; |
d7bf9bf5 | 2896 | int transl; |
c2b714de | 2897 | int always_title; |
2c6f1a39 | 2898 | { |
e4b6f8e3 | 2899 | Lisp_Object maps, orig_maps, seen, sub_shadows; |
e3dfcd4e | 2900 | struct gcpro gcpro1, gcpro2, gcpro3; |
07f15dfd | 2901 | int something = 0; |
53c8f9fa RS |
2902 | char *key_heading |
2903 | = "\ | |
2904 | key binding\n\ | |
2905 | --- -------\n"; | |
2c6f1a39 | 2906 | |
e4b6f8e3 | 2907 | orig_maps = maps = Faccessible_keymaps (startmap, prefix); |
925083d1 | 2908 | seen = Qnil; |
e3dfcd4e KH |
2909 | sub_shadows = Qnil; |
2910 | GCPRO3 (maps, seen, sub_shadows); | |
2c6f1a39 | 2911 | |
af1d6f09 RS |
2912 | if (nomenu) |
2913 | { | |
2914 | Lisp_Object list; | |
2915 | ||
2916 | /* Delete from MAPS each element that is for the menu bar. */ | |
03699b14 | 2917 | for (list = maps; !NILP (list); list = XCDR (list)) |
af1d6f09 RS |
2918 | { |
2919 | Lisp_Object elt, prefix, tem; | |
2920 | ||
2921 | elt = Fcar (list); | |
2922 | prefix = Fcar (elt); | |
2923 | if (XVECTOR (prefix)->size >= 1) | |
2924 | { | |
2925 | tem = Faref (prefix, make_number (0)); | |
2926 | if (EQ (tem, Qmenu_bar)) | |
2927 | maps = Fdelq (elt, maps); | |
2928 | } | |
2929 | } | |
2930 | } | |
2931 | ||
c2b714de | 2932 | if (!NILP (maps) || always_title) |
53c8f9fa RS |
2933 | { |
2934 | if (title) | |
07f15dfd RS |
2935 | { |
2936 | insert_string (title); | |
2937 | if (!NILP (prefix)) | |
2938 | { | |
2939 | insert_string (" Starting With "); | |
2940 | insert1 (Fkey_description (prefix)); | |
2941 | } | |
2942 | insert_string (":\n"); | |
2943 | } | |
53c8f9fa | 2944 | insert_string (key_heading); |
07f15dfd | 2945 | something = 1; |
53c8f9fa RS |
2946 | } |
2947 | ||
265a9e55 | 2948 | for (; !NILP (maps); maps = Fcdr (maps)) |
2c6f1a39 | 2949 | { |
e3dfcd4e | 2950 | register Lisp_Object elt, prefix, tail; |
53c8f9fa | 2951 | |
2c6f1a39 | 2952 | elt = Fcar (maps); |
53c8f9fa RS |
2953 | prefix = Fcar (elt); |
2954 | ||
2955 | sub_shadows = Qnil; | |
2956 | ||
03699b14 | 2957 | for (tail = shadow; CONSP (tail); tail = XCDR (tail)) |
2c6f1a39 | 2958 | { |
53c8f9fa RS |
2959 | Lisp_Object shmap; |
2960 | ||
03699b14 | 2961 | shmap = XCAR (tail); |
53c8f9fa RS |
2962 | |
2963 | /* If the sequence by which we reach this keymap is zero-length, | |
2964 | then the shadow map for this keymap is just SHADOW. */ | |
d5db4077 | 2965 | if ((STRINGP (prefix) && SCHARS (prefix) == 0) |
416349ec | 2966 | || (VECTORP (prefix) && XVECTOR (prefix)->size == 0)) |
53c8f9fa RS |
2967 | ; |
2968 | /* If the sequence by which we reach this keymap actually has | |
2969 | some elements, then the sequence's definition in SHADOW is | |
2970 | what we should use. */ | |
2971 | else | |
2972 | { | |
98234407 | 2973 | shmap = Flookup_key (shmap, Fcar (elt), Qt); |
416349ec | 2974 | if (INTEGERP (shmap)) |
53c8f9fa RS |
2975 | shmap = Qnil; |
2976 | } | |
2977 | ||
2978 | /* If shmap is not nil and not a keymap, | |
2979 | it completely shadows this map, so don't | |
2980 | describe this map at all. */ | |
02067692 | 2981 | if (!NILP (shmap) && !KEYMAPP (shmap)) |
53c8f9fa RS |
2982 | goto skip; |
2983 | ||
2984 | if (!NILP (shmap)) | |
2985 | sub_shadows = Fcons (shmap, sub_shadows); | |
2c6f1a39 JB |
2986 | } |
2987 | ||
e4b6f8e3 | 2988 | /* Maps we have already listed in this loop shadow this map. */ |
54cbc3d4 | 2989 | for (tail = orig_maps; !EQ (tail, maps); tail = XCDR (tail)) |
e4b6f8e3 RS |
2990 | { |
2991 | Lisp_Object tem; | |
2992 | tem = Fequal (Fcar (XCAR (tail)), prefix); | |
54cbc3d4 | 2993 | if (!NILP (tem)) |
e4b6f8e3 RS |
2994 | sub_shadows = Fcons (XCDR (XCAR (tail)), sub_shadows); |
2995 | } | |
2996 | ||
2997 | describe_map (Fcdr (elt), prefix, | |
d7bf9bf5 | 2998 | transl ? describe_translation : describe_command, |
279a482a | 2999 | partial, sub_shadows, &seen, nomenu); |
53c8f9fa RS |
3000 | |
3001 | skip: ; | |
2c6f1a39 JB |
3002 | } |
3003 | ||
07f15dfd RS |
3004 | if (something) |
3005 | insert_string ("\n"); | |
3006 | ||
2c6f1a39 JB |
3007 | UNGCPRO; |
3008 | } | |
3009 | ||
c3f27064 KH |
3010 | static int previous_description_column; |
3011 | ||
2c6f1a39 | 3012 | static void |
d55627cc SM |
3013 | describe_command (definition, args) |
3014 | Lisp_Object definition, args; | |
2c6f1a39 JB |
3015 | { |
3016 | register Lisp_Object tem1; | |
744cd66b | 3017 | int column = (int) current_column (); /* iftc */ |
c3f27064 | 3018 | int description_column; |
2c6f1a39 | 3019 | |
c3f27064 KH |
3020 | /* If column 16 is no good, go to col 32; |
3021 | but don't push beyond that--go to next line instead. */ | |
3022 | if (column > 30) | |
3023 | { | |
3024 | insert_char ('\n'); | |
3025 | description_column = 32; | |
3026 | } | |
3027 | else if (column > 14 || (column > 10 && previous_description_column == 32)) | |
3028 | description_column = 32; | |
3029 | else | |
3030 | description_column = 16; | |
3031 | ||
3032 | Findent_to (make_number (description_column), make_number (1)); | |
3033 | previous_description_column = description_column; | |
2c6f1a39 | 3034 | |
416349ec | 3035 | if (SYMBOLP (definition)) |
2c6f1a39 | 3036 | { |
c85d524c | 3037 | tem1 = SYMBOL_NAME (definition); |
2c6f1a39 | 3038 | insert1 (tem1); |
055234ef | 3039 | insert_string ("\n"); |
2c6f1a39 | 3040 | } |
d7bf9bf5 | 3041 | else if (STRINGP (definition) || VECTORP (definition)) |
24065b9c | 3042 | insert_string ("Keyboard Macro\n"); |
02067692 SM |
3043 | else if (KEYMAPP (definition)) |
3044 | insert_string ("Prefix Command\n"); | |
2c6f1a39 | 3045 | else |
02067692 | 3046 | insert_string ("??\n"); |
2c6f1a39 JB |
3047 | } |
3048 | ||
d7bf9bf5 | 3049 | static void |
d55627cc SM |
3050 | describe_translation (definition, args) |
3051 | Lisp_Object definition, args; | |
d7bf9bf5 RS |
3052 | { |
3053 | register Lisp_Object tem1; | |
3054 | ||
3055 | Findent_to (make_number (16), make_number (1)); | |
3056 | ||
3057 | if (SYMBOLP (definition)) | |
3058 | { | |
c85d524c | 3059 | tem1 = SYMBOL_NAME (definition); |
d7bf9bf5 RS |
3060 | insert1 (tem1); |
3061 | insert_string ("\n"); | |
3062 | } | |
3063 | else if (STRINGP (definition) || VECTORP (definition)) | |
b902ac28 RS |
3064 | { |
3065 | insert1 (Fkey_description (definition)); | |
3066 | insert_string ("\n"); | |
3067 | } | |
02067692 SM |
3068 | else if (KEYMAPP (definition)) |
3069 | insert_string ("Prefix Command\n"); | |
d7bf9bf5 | 3070 | else |
02067692 | 3071 | insert_string ("??\n"); |
d7bf9bf5 RS |
3072 | } |
3073 | ||
c3c0ee93 KH |
3074 | /* Describe the contents of map MAP, assuming that this map itself is |
3075 | reached by the sequence of prefix keys KEYS (a string or vector). | |
279a482a | 3076 | PARTIAL, SHADOW, NOMENU are as in `describe_map_tree' above. */ |
2c6f1a39 JB |
3077 | |
3078 | static void | |
279a482a | 3079 | describe_map (map, keys, elt_describer, partial, shadow, seen, nomenu) |
c3c0ee93 KH |
3080 | register Lisp_Object map; |
3081 | Lisp_Object keys; | |
d55627cc | 3082 | void (*elt_describer) P_ ((Lisp_Object, Lisp_Object)); |
2c6f1a39 JB |
3083 | int partial; |
3084 | Lisp_Object shadow; | |
925083d1 | 3085 | Lisp_Object *seen; |
279a482a | 3086 | int nomenu; |
2c6f1a39 | 3087 | { |
c3c0ee93 | 3088 | Lisp_Object elt_prefix; |
53c8f9fa | 3089 | Lisp_Object tail, definition, event; |
99a225a9 | 3090 | Lisp_Object tem; |
2c6f1a39 JB |
3091 | Lisp_Object suppress; |
3092 | Lisp_Object kludge; | |
3093 | int first = 1; | |
3094 | struct gcpro gcpro1, gcpro2, gcpro3; | |
3095 | ||
6bbd7a29 GM |
3096 | suppress = Qnil; |
3097 | ||
c3c0ee93 KH |
3098 | if (!NILP (keys) && XFASTINT (Flength (keys)) > 0) |
3099 | { | |
c3c0ee93 KH |
3100 | /* Call Fkey_description first, to avoid GC bug for the other string. */ |
3101 | tem = Fkey_description (keys); | |
3102 | elt_prefix = concat2 (tem, build_string (" ")); | |
3103 | } | |
3104 | else | |
3105 | elt_prefix = Qnil; | |
3106 | ||
2c6f1a39 JB |
3107 | if (partial) |
3108 | suppress = intern ("suppress-keymap"); | |
3109 | ||
3110 | /* This vector gets used to present single keys to Flookup_key. Since | |
f5b79c1c | 3111 | that is done once per keymap element, we don't want to cons up a |
2c6f1a39 JB |
3112 | fresh vector every time. */ |
3113 | kludge = Fmake_vector (make_number (1), Qnil); | |
99a225a9 | 3114 | definition = Qnil; |
2c6f1a39 | 3115 | |
99a225a9 | 3116 | GCPRO3 (elt_prefix, definition, kludge); |
2c6f1a39 | 3117 | |
03699b14 | 3118 | for (tail = map; CONSP (tail); tail = XCDR (tail)) |
2c6f1a39 JB |
3119 | { |
3120 | QUIT; | |
2c6f1a39 | 3121 | |
03699b14 KR |
3122 | if (VECTORP (XCAR (tail)) |
3123 | || CHAR_TABLE_P (XCAR (tail))) | |
3124 | describe_vector (XCAR (tail), | |
d55627cc | 3125 | elt_prefix, Qnil, elt_describer, partial, shadow, map, |
0403641f | 3126 | (int *)0, 0); |
03699b14 | 3127 | else if (CONSP (XCAR (tail))) |
2c6f1a39 | 3128 | { |
03699b14 | 3129 | event = XCAR (XCAR (tail)); |
2c3b35b0 RS |
3130 | |
3131 | /* Ignore bindings whose "keys" are not really valid events. | |
3132 | (We get these in the frames and buffers menu.) */ | |
54cbc3d4 | 3133 | if (!(SYMBOLP (event) || INTEGERP (event))) |
c96dcc01 | 3134 | continue; |
2c3b35b0 | 3135 | |
279a482a KH |
3136 | if (nomenu && EQ (event, Qmenu_bar)) |
3137 | continue; | |
3138 | ||
03699b14 | 3139 | definition = get_keyelt (XCDR (XCAR (tail)), 0); |
2c6f1a39 | 3140 | |
f5b79c1c | 3141 | /* Don't show undefined commands or suppressed commands. */ |
99a225a9 | 3142 | if (NILP (definition)) continue; |
416349ec | 3143 | if (SYMBOLP (definition) && partial) |
f5b79c1c | 3144 | { |
99a225a9 RS |
3145 | tem = Fget (definition, suppress); |
3146 | if (!NILP (tem)) | |
f5b79c1c JB |
3147 | continue; |
3148 | } | |
2c6f1a39 | 3149 | |
f5b79c1c JB |
3150 | /* Don't show a command that isn't really visible |
3151 | because a local definition of the same key shadows it. */ | |
2c6f1a39 | 3152 | |
49801145 | 3153 | ASET (kludge, 0, event); |
f5b79c1c JB |
3154 | if (!NILP (shadow)) |
3155 | { | |
53c8f9fa | 3156 | tem = shadow_lookup (shadow, kludge, Qt); |
f5b79c1c JB |
3157 | if (!NILP (tem)) continue; |
3158 | } | |
3159 | ||
c3c0ee93 | 3160 | tem = Flookup_key (map, kludge, Qt); |
54cbc3d4 | 3161 | if (!EQ (tem, definition)) continue; |
99a225a9 | 3162 | |
f5b79c1c JB |
3163 | if (first) |
3164 | { | |
c3f27064 | 3165 | previous_description_column = 0; |
f5b79c1c JB |
3166 | insert ("\n", 1); |
3167 | first = 0; | |
3168 | } | |
2c6f1a39 | 3169 | |
f5b79c1c JB |
3170 | if (!NILP (elt_prefix)) |
3171 | insert1 (elt_prefix); | |
2c6f1a39 | 3172 | |
99a225a9 | 3173 | /* THIS gets the string to describe the character EVENT. */ |
c1848a97 | 3174 | insert1 (Fsingle_key_description (event, Qnil)); |
2c6f1a39 | 3175 | |
f5b79c1c JB |
3176 | /* Print a description of the definition of this character. |
3177 | elt_describer will take care of spacing out far enough | |
3178 | for alignment purposes. */ | |
d55627cc | 3179 | (*elt_describer) (definition, Qnil); |
f5b79c1c | 3180 | } |
03699b14 | 3181 | else if (EQ (XCAR (tail), Qkeymap)) |
925083d1 KH |
3182 | { |
3183 | /* The same keymap might be in the structure twice, if we're | |
3184 | using an inherited keymap. So skip anything we've already | |
3185 | encountered. */ | |
3186 | tem = Fassq (tail, *seen); | |
03699b14 | 3187 | if (CONSP (tem) && !NILP (Fequal (XCAR (tem), keys))) |
925083d1 KH |
3188 | break; |
3189 | *seen = Fcons (Fcons (tail, keys), *seen); | |
3190 | } | |
2c6f1a39 JB |
3191 | } |
3192 | ||
3193 | UNGCPRO; | |
3194 | } | |
3195 | ||
69248761 | 3196 | static void |
d55627cc SM |
3197 | describe_vector_princ (elt, fun) |
3198 | Lisp_Object elt, fun; | |
2c6f1a39 | 3199 | { |
81fa9e2f | 3200 | Findent_to (make_number (16), make_number (1)); |
d55627cc | 3201 | call1 (fun, elt); |
ad4ec84a | 3202 | Fterpri (Qnil); |
2c6f1a39 JB |
3203 | } |
3204 | ||
d55627cc | 3205 | DEFUN ("describe-vector", Fdescribe_vector, Sdescribe_vector, 1, 2, 0, |
335c5470 PJ |
3206 | doc: /* Insert a description of contents of VECTOR. |
3207 | This is text showing the elements of vector matched against indices. */) | |
d55627cc SM |
3208 | (vector, describer) |
3209 | Lisp_Object vector, describer; | |
2c6f1a39 | 3210 | { |
aed13378 | 3211 | int count = SPECPDL_INDEX (); |
d55627cc SM |
3212 | if (NILP (describer)) |
3213 | describer = intern ("princ"); | |
ad4ec84a | 3214 | specbind (Qstandard_output, Fcurrent_buffer ()); |
b7826503 | 3215 | CHECK_VECTOR_OR_CHAR_TABLE (vector); |
d55627cc | 3216 | describe_vector (vector, Qnil, describer, describe_vector_princ, 0, |
0403641f | 3217 | Qnil, Qnil, (int *)0, 0); |
ad4ec84a RS |
3218 | |
3219 | return unbind_to (count, Qnil); | |
2c6f1a39 JB |
3220 | } |
3221 | ||
352e5dea RS |
3222 | /* Insert in the current buffer a description of the contents of VECTOR. |
3223 | We call ELT_DESCRIBER to insert the description of one value found | |
3224 | in VECTOR. | |
3225 | ||
3226 | ELT_PREFIX describes what "comes before" the keys or indices defined | |
0403641f RS |
3227 | by this vector. This is a human-readable string whose size |
3228 | is not necessarily related to the situation. | |
352e5dea RS |
3229 | |
3230 | If the vector is in a keymap, ELT_PREFIX is a prefix key which | |
3231 | leads to this keymap. | |
3232 | ||
3233 | If the vector is a chartable, ELT_PREFIX is the vector | |
3234 | of bytes that lead to the character set or portion of a character | |
3235 | set described by this chartable. | |
3236 | ||
3237 | If PARTIAL is nonzero, it means do not mention suppressed commands | |
3238 | (that assumes the vector is in a keymap). | |
3239 | ||
3240 | SHADOW is a list of keymaps that shadow this map. | |
3241 | If it is non-nil, then we look up the key in those maps | |
3242 | and we don't mention it now if it is defined by any of them. | |
3243 | ||
3244 | ENTIRE_MAP is the keymap in which this vector appears. | |
3245 | If the definition in effect in the whole map does not match | |
0403641f RS |
3246 | the one in this vector, we ignore this one. |
3247 | ||
3248 | When describing a sub-char-table, INDICES is a list of | |
3249 | indices at higher levels in this char-table, | |
d55627cc SM |
3250 | and CHAR_TABLE_DEPTH says how many levels down we have gone. |
3251 | ||
3252 | ARGS is simply passed as the second argument to ELT_DESCRIBER. */ | |
352e5dea | 3253 | |
71a956a6 | 3254 | void |
d55627cc | 3255 | describe_vector (vector, elt_prefix, args, elt_describer, |
0403641f RS |
3256 | partial, shadow, entire_map, |
3257 | indices, char_table_depth) | |
2c6f1a39 | 3258 | register Lisp_Object vector; |
d55627cc SM |
3259 | Lisp_Object elt_prefix, args; |
3260 | void (*elt_describer) P_ ((Lisp_Object, Lisp_Object)); | |
2c6f1a39 JB |
3261 | int partial; |
3262 | Lisp_Object shadow; | |
32bfcae1 | 3263 | Lisp_Object entire_map; |
0403641f RS |
3264 | int *indices; |
3265 | int char_table_depth; | |
2c6f1a39 | 3266 | { |
32bfcae1 KH |
3267 | Lisp_Object definition; |
3268 | Lisp_Object tem2; | |
2c6f1a39 JB |
3269 | register int i; |
3270 | Lisp_Object suppress; | |
3271 | Lisp_Object kludge; | |
3272 | int first = 1; | |
47935df1 | 3273 | struct gcpro gcpro1, gcpro2, gcpro3; |
a98f1d1d KH |
3274 | /* Range of elements to be handled. */ |
3275 | int from, to; | |
a98f1d1d KH |
3276 | /* A flag to tell if a leaf in this level of char-table is not a |
3277 | generic character (i.e. a complete multibyte character). */ | |
3278 | int complete_char; | |
0403641f RS |
3279 | int character; |
3280 | int starting_i; | |
3281 | ||
6bbd7a29 GM |
3282 | suppress = Qnil; |
3283 | ||
0403641f | 3284 | if (indices == 0) |
2e34157c | 3285 | indices = (int *) alloca (3 * sizeof (int)); |
2c6f1a39 | 3286 | |
32bfcae1 | 3287 | definition = Qnil; |
2c6f1a39 JB |
3288 | |
3289 | /* This vector gets used to present single keys to Flookup_key. Since | |
3290 | that is done once per vector element, we don't want to cons up a | |
3291 | fresh vector every time. */ | |
3292 | kludge = Fmake_vector (make_number (1), Qnil); | |
0403641f | 3293 | GCPRO3 (elt_prefix, definition, kludge); |
2c6f1a39 JB |
3294 | |
3295 | if (partial) | |
3296 | suppress = intern ("suppress-keymap"); | |
3297 | ||
a98f1d1d KH |
3298 | if (CHAR_TABLE_P (vector)) |
3299 | { | |
0403641f | 3300 | if (char_table_depth == 0) |
a98f1d1d | 3301 | { |
a1942d88 | 3302 | /* VECTOR is a top level char-table. */ |
0403641f | 3303 | complete_char = 1; |
a98f1d1d KH |
3304 | from = 0; |
3305 | to = CHAR_TABLE_ORDINARY_SLOTS; | |
3306 | } | |
3307 | else | |
3308 | { | |
a1942d88 | 3309 | /* VECTOR is a sub char-table. */ |
0403641f RS |
3310 | if (char_table_depth >= 3) |
3311 | /* A char-table is never that deep. */ | |
a1942d88 | 3312 | error ("Too deep char table"); |
a98f1d1d | 3313 | |
a98f1d1d | 3314 | complete_char |
0403641f RS |
3315 | = (CHARSET_VALID_P (indices[0]) |
3316 | && ((CHARSET_DIMENSION (indices[0]) == 1 | |
3317 | && char_table_depth == 1) | |
3318 | || char_table_depth == 2)); | |
a98f1d1d KH |
3319 | |
3320 | /* Meaningful elements are from 32th to 127th. */ | |
3321 | from = 32; | |
a1942d88 | 3322 | to = SUB_CHAR_TABLE_ORDINARY_SLOTS; |
a98f1d1d | 3323 | } |
a98f1d1d KH |
3324 | } |
3325 | else | |
3326 | { | |
a98f1d1d | 3327 | /* This does the right thing for ordinary vectors. */ |
0403641f RS |
3328 | |
3329 | complete_char = 1; | |
3330 | from = 0; | |
3331 | to = XVECTOR (vector)->size; | |
a98f1d1d | 3332 | } |
b5585f5c | 3333 | |
a98f1d1d | 3334 | for (i = from; i < to; i++) |
2c6f1a39 JB |
3335 | { |
3336 | QUIT; | |
2c6f1a39 | 3337 | |
a1942d88 KH |
3338 | if (CHAR_TABLE_P (vector)) |
3339 | { | |
0403641f RS |
3340 | if (char_table_depth == 0 && i >= CHAR_TABLE_SINGLE_BYTE_SLOTS) |
3341 | complete_char = 0; | |
3342 | ||
a1942d88 KH |
3343 | if (i >= CHAR_TABLE_SINGLE_BYTE_SLOTS |
3344 | && !CHARSET_DEFINED_P (i - 128)) | |
3345 | continue; | |
0403641f RS |
3346 | |
3347 | definition | |
3348 | = get_keyelt (XCHAR_TABLE (vector)->contents[i], 0); | |
a1942d88 KH |
3349 | } |
3350 | else | |
49801145 | 3351 | definition = get_keyelt (AREF (vector, i), 0); |
2c6f1a39 | 3352 | |
d55627cc | 3353 | if (NILP (definition)) continue; |
cc3e6465 | 3354 | |
2c6f1a39 | 3355 | /* Don't mention suppressed commands. */ |
32bfcae1 | 3356 | if (SYMBOLP (definition) && partial) |
2c6f1a39 | 3357 | { |
a98f1d1d KH |
3358 | Lisp_Object tem; |
3359 | ||
3360 | tem = Fget (definition, suppress); | |
3361 | ||
3362 | if (!NILP (tem)) continue; | |
2c6f1a39 JB |
3363 | } |
3364 | ||
0403641f RS |
3365 | /* Set CHARACTER to the character this entry describes, if any. |
3366 | Also update *INDICES. */ | |
3367 | if (CHAR_TABLE_P (vector)) | |
3368 | { | |
3369 | indices[char_table_depth] = i; | |
3370 | ||
3371 | if (char_table_depth == 0) | |
3372 | { | |
3373 | character = i; | |
3374 | indices[0] = i - 128; | |
3375 | } | |
3376 | else if (complete_char) | |
3377 | { | |
54e03a4a | 3378 | character = MAKE_CHAR (indices[0], indices[1], indices[2]); |
0403641f RS |
3379 | } |
3380 | else | |
3381 | character = 0; | |
3382 | } | |
3383 | else | |
3384 | character = i; | |
3385 | ||
32bfcae1 | 3386 | /* If this binding is shadowed by some other map, ignore it. */ |
0403641f | 3387 | if (!NILP (shadow) && complete_char) |
2c6f1a39 JB |
3388 | { |
3389 | Lisp_Object tem; | |
31bea176 | 3390 | |
49801145 | 3391 | ASET (kludge, 0, make_number (character)); |
53c8f9fa | 3392 | tem = shadow_lookup (shadow, kludge, Qt); |
2c6f1a39 | 3393 | |
265a9e55 | 3394 | if (!NILP (tem)) continue; |
2c6f1a39 JB |
3395 | } |
3396 | ||
32bfcae1 KH |
3397 | /* Ignore this definition if it is shadowed by an earlier |
3398 | one in the same keymap. */ | |
0403641f | 3399 | if (!NILP (entire_map) && complete_char) |
32bfcae1 KH |
3400 | { |
3401 | Lisp_Object tem; | |
3402 | ||
49801145 | 3403 | ASET (kludge, 0, make_number (character)); |
32bfcae1 KH |
3404 | tem = Flookup_key (entire_map, kludge, Qt); |
3405 | ||
54cbc3d4 | 3406 | if (!EQ (tem, definition)) |
32bfcae1 KH |
3407 | continue; |
3408 | } | |
3409 | ||
2c6f1a39 JB |
3410 | if (first) |
3411 | { | |
0403641f | 3412 | if (char_table_depth == 0) |
a98f1d1d | 3413 | insert ("\n", 1); |
2c6f1a39 JB |
3414 | first = 0; |
3415 | } | |
3416 | ||
0403641f RS |
3417 | /* For a sub char-table, show the depth by indentation. |
3418 | CHAR_TABLE_DEPTH can be greater than 0 only for a char-table. */ | |
3419 | if (char_table_depth > 0) | |
3420 | insert (" ", char_table_depth * 2); /* depth is 1 or 2. */ | |
a98f1d1d | 3421 | |
0403641f RS |
3422 | /* Output the prefix that applies to every entry in this map. */ |
3423 | if (!NILP (elt_prefix)) | |
3424 | insert1 (elt_prefix); | |
a98f1d1d | 3425 | |
0403641f RS |
3426 | /* Insert or describe the character this slot is for, |
3427 | or a description of what it is for. */ | |
3428 | if (SUB_CHAR_TABLE_P (vector)) | |
a1942d88 | 3429 | { |
0403641f RS |
3430 | if (complete_char) |
3431 | insert_char (character); | |
3432 | else | |
3433 | { | |
3434 | /* We need an octal representation for this block of | |
3435 | characters. */ | |
542d7fd2 RS |
3436 | char work[16]; |
3437 | sprintf (work, "(row %d)", i); | |
3438 | insert (work, strlen (work)); | |
0403641f RS |
3439 | } |
3440 | } | |
3441 | else if (CHAR_TABLE_P (vector)) | |
3442 | { | |
3443 | if (complete_char) | |
c1848a97 | 3444 | insert1 (Fsingle_key_description (make_number (character), Qnil)); |
a1942d88 KH |
3445 | else |
3446 | { | |
3447 | /* Print the information for this character set. */ | |
3448 | insert_string ("<"); | |
3449 | tem2 = CHARSET_TABLE_INFO (i - 128, CHARSET_SHORT_NAME_IDX); | |
3450 | if (STRINGP (tem2)) | |
d5db4077 KR |
3451 | insert_from_string (tem2, 0, 0, SCHARS (tem2), |
3452 | SBYTES (tem2), 0); | |
a1942d88 KH |
3453 | else |
3454 | insert ("?", 1); | |
3455 | insert (">", 1); | |
3456 | } | |
3457 | } | |
352e5dea RS |
3458 | else |
3459 | { | |
c1848a97 | 3460 | insert1 (Fsingle_key_description (make_number (character), Qnil)); |
a98f1d1d | 3461 | } |
352e5dea | 3462 | |
a1942d88 | 3463 | /* If we find a sub char-table within a char-table, |
a98f1d1d KH |
3464 | scan it recursively; it defines the details for |
3465 | a character set or a portion of a character set. */ | |
f3ba5409 | 3466 | if (CHAR_TABLE_P (vector) && SUB_CHAR_TABLE_P (definition)) |
a98f1d1d | 3467 | { |
a98f1d1d | 3468 | insert ("\n", 1); |
d55627cc | 3469 | describe_vector (definition, elt_prefix, args, elt_describer, |
0403641f RS |
3470 | partial, shadow, entire_map, |
3471 | indices, char_table_depth + 1); | |
a98f1d1d | 3472 | continue; |
352e5dea | 3473 | } |
2c6f1a39 | 3474 | |
0403641f RS |
3475 | starting_i = i; |
3476 | ||
542d7fd2 | 3477 | /* Find all consecutive characters or rows that have the same |
a1942d88 KH |
3478 | definition. But, for elements of a top level char table, if |
3479 | they are for charsets, we had better describe one by one even | |
3480 | if they have the same definition. */ | |
3481 | if (CHAR_TABLE_P (vector)) | |
3482 | { | |
0403641f RS |
3483 | int limit = to; |
3484 | ||
3485 | if (char_table_depth == 0) | |
3486 | limit = CHAR_TABLE_SINGLE_BYTE_SLOTS; | |
3487 | ||
3488 | while (i + 1 < limit | |
3489 | && (tem2 = get_keyelt (XCHAR_TABLE (vector)->contents[i + 1], 0), | |
3490 | !NILP (tem2)) | |
3491 | && !NILP (Fequal (tem2, definition))) | |
3492 | i++; | |
a1942d88 KH |
3493 | } |
3494 | else | |
0403641f | 3495 | while (i + 1 < to |
49801145 | 3496 | && (tem2 = get_keyelt (AREF (vector, i + 1), 0), |
a1942d88 KH |
3497 | !NILP (tem2)) |
3498 | && !NILP (Fequal (tem2, definition))) | |
3499 | i++; | |
31bea176 | 3500 | |
2c6f1a39 JB |
3501 | |
3502 | /* If we have a range of more than one character, | |
3503 | print where the range reaches to. */ | |
3504 | ||
0403641f | 3505 | if (i != starting_i) |
2c6f1a39 JB |
3506 | { |
3507 | insert (" .. ", 4); | |
0403641f RS |
3508 | |
3509 | if (!NILP (elt_prefix)) | |
3510 | insert1 (elt_prefix); | |
3511 | ||
352e5dea RS |
3512 | if (CHAR_TABLE_P (vector)) |
3513 | { | |
0403641f | 3514 | if (char_table_depth == 0) |
a98f1d1d | 3515 | { |
c1848a97 | 3516 | insert1 (Fsingle_key_description (make_number (i), Qnil)); |
a98f1d1d | 3517 | } |
0403641f | 3518 | else if (complete_char) |
352e5dea | 3519 | { |
0403641f | 3520 | indices[char_table_depth] = i; |
54e03a4a | 3521 | character = MAKE_CHAR (indices[0], indices[1], indices[2]); |
0403641f | 3522 | insert_char (character); |
352e5dea RS |
3523 | } |
3524 | else | |
3525 | { | |
542d7fd2 RS |
3526 | /* We need an octal representation for this block of |
3527 | characters. */ | |
3528 | char work[16]; | |
3529 | sprintf (work, "(row %d)", i); | |
3530 | insert (work, strlen (work)); | |
352e5dea RS |
3531 | } |
3532 | } | |
3533 | else | |
3534 | { | |
c1848a97 | 3535 | insert1 (Fsingle_key_description (make_number (i), Qnil)); |
352e5dea | 3536 | } |
2c6f1a39 JB |
3537 | } |
3538 | ||
3539 | /* Print a description of the definition of this character. | |
3540 | elt_describer will take care of spacing out far enough | |
3541 | for alignment purposes. */ | |
d55627cc | 3542 | (*elt_describer) (definition, args); |
2c6f1a39 JB |
3543 | } |
3544 | ||
a1942d88 | 3545 | /* For (sub) char-table, print `defalt' slot at last. */ |
a98f1d1d KH |
3546 | if (CHAR_TABLE_P (vector) && !NILP (XCHAR_TABLE (vector)->defalt)) |
3547 | { | |
0403641f | 3548 | insert (" ", char_table_depth * 2); |
a98f1d1d | 3549 | insert_string ("<<default>>"); |
d55627cc | 3550 | (*elt_describer) (XCHAR_TABLE (vector)->defalt, args); |
a98f1d1d KH |
3551 | } |
3552 | ||
2c6f1a39 JB |
3553 | UNGCPRO; |
3554 | } | |
3555 | \f | |
cc0a8174 | 3556 | /* Apropos - finding all symbols whose names match a regexp. */ |
5d55ffd0 RS |
3557 | static Lisp_Object apropos_predicate; |
3558 | static Lisp_Object apropos_accumulate; | |
2c6f1a39 JB |
3559 | |
3560 | static void | |
3561 | apropos_accum (symbol, string) | |
3562 | Lisp_Object symbol, string; | |
3563 | { | |
3564 | register Lisp_Object tem; | |
3565 | ||
3566 | tem = Fstring_match (string, Fsymbol_name (symbol), Qnil); | |
265a9e55 | 3567 | if (!NILP (tem) && !NILP (apropos_predicate)) |
2c6f1a39 | 3568 | tem = call1 (apropos_predicate, symbol); |
265a9e55 | 3569 | if (!NILP (tem)) |
2c6f1a39 JB |
3570 | apropos_accumulate = Fcons (symbol, apropos_accumulate); |
3571 | } | |
3572 | ||
744cd66b | 3573 | DEFUN ("apropos-internal", Fapropos_internal, Sapropos_internal, 1, 2, 0, |
335c5470 PJ |
3574 | doc: /* Show all symbols whose names contain match for REGEXP. |
3575 | If optional 2nd arg PREDICATE is non-nil, (funcall PREDICATE SYMBOL) is done | |
3576 | for each symbol and a symbol is mentioned only if that returns non-nil. | |
3577 | Return list of symbols found. */) | |
3578 | (regexp, predicate) | |
88539837 | 3579 | Lisp_Object regexp, predicate; |
2c6f1a39 | 3580 | { |
5d55ffd0 | 3581 | Lisp_Object tem; |
b7826503 | 3582 | CHECK_STRING (regexp); |
88539837 | 3583 | apropos_predicate = predicate; |
2c6f1a39 | 3584 | apropos_accumulate = Qnil; |
88539837 | 3585 | map_obarray (Vobarray, apropos_accum, regexp); |
5d55ffd0 RS |
3586 | tem = Fsort (apropos_accumulate, Qstring_lessp); |
3587 | apropos_accumulate = Qnil; | |
3588 | apropos_predicate = Qnil; | |
3589 | return tem; | |
2c6f1a39 JB |
3590 | } |
3591 | \f | |
dfcf069d | 3592 | void |
2c6f1a39 JB |
3593 | syms_of_keymap () |
3594 | { | |
2c6f1a39 JB |
3595 | Qkeymap = intern ("keymap"); |
3596 | staticpro (&Qkeymap); | |
5d55ffd0 RS |
3597 | staticpro (&apropos_predicate); |
3598 | staticpro (&apropos_accumulate); | |
3599 | apropos_predicate = Qnil; | |
3600 | apropos_accumulate = Qnil; | |
2c6f1a39 | 3601 | |
0403641f RS |
3602 | /* Now we are ready to set up this property, so we can |
3603 | create char tables. */ | |
3604 | Fput (Qkeymap, Qchar_table_extra_slots, make_number (0)); | |
3605 | ||
3606 | /* Initialize the keymaps standardly used. | |
3607 | Each one is the value of a Lisp variable, and is also | |
3608 | pointed to by a C variable */ | |
2c6f1a39 | 3609 | |
0403641f | 3610 | global_map = Fmake_keymap (Qnil); |
2c6f1a39 JB |
3611 | Fset (intern ("global-map"), global_map); |
3612 | ||
44bff953 | 3613 | current_global_map = global_map; |
a3e99933 | 3614 | staticpro (&global_map); |
44bff953 RS |
3615 | staticpro (¤t_global_map); |
3616 | ||
ce6e5d0b | 3617 | meta_map = Fmake_keymap (Qnil); |
2c6f1a39 JB |
3618 | Fset (intern ("esc-map"), meta_map); |
3619 | Ffset (intern ("ESC-prefix"), meta_map); | |
3620 | ||
ce6e5d0b | 3621 | control_x_map = Fmake_keymap (Qnil); |
2c6f1a39 JB |
3622 | Fset (intern ("ctl-x-map"), control_x_map); |
3623 | Ffset (intern ("Control-X-prefix"), control_x_map); | |
3624 | ||
2fae9111 RS |
3625 | exclude_keys |
3626 | = Fcons (Fcons (build_string ("DEL"), build_string ("\\d")), | |
3627 | Fcons (Fcons (build_string ("TAB"), build_string ("\\t")), | |
3628 | Fcons (Fcons (build_string ("RET"), build_string ("\\r")), | |
3629 | Fcons (Fcons (build_string ("ESC"), build_string ("\\e")), | |
3630 | Fcons (Fcons (build_string ("SPC"), build_string (" ")), | |
3631 | Qnil))))); | |
3632 | staticpro (&exclude_keys); | |
3633 | ||
107fd03d | 3634 | DEFVAR_LISP ("define-key-rebound-commands", &Vdefine_key_rebound_commands, |
335c5470 PJ |
3635 | doc: /* List of commands given new key bindings recently. |
3636 | This is used for internal purposes during Emacs startup; | |
3637 | don't alter it yourself. */); | |
107fd03d RS |
3638 | Vdefine_key_rebound_commands = Qt; |
3639 | ||
2c6f1a39 | 3640 | DEFVAR_LISP ("minibuffer-local-map", &Vminibuffer_local_map, |
335c5470 | 3641 | doc: /* Default keymap to use when reading from the minibuffer. */); |
ce6e5d0b | 3642 | Vminibuffer_local_map = Fmake_sparse_keymap (Qnil); |
2c6f1a39 JB |
3643 | |
3644 | DEFVAR_LISP ("minibuffer-local-ns-map", &Vminibuffer_local_ns_map, | |
335c5470 | 3645 | doc: /* Local keymap for the minibuffer when spaces are not allowed. */); |
ce6e5d0b | 3646 | Vminibuffer_local_ns_map = Fmake_sparse_keymap (Qnil); |
2b6748c0 | 3647 | Fset_keymap_parent (Vminibuffer_local_ns_map, Vminibuffer_local_map); |
2c6f1a39 JB |
3648 | |
3649 | DEFVAR_LISP ("minibuffer-local-completion-map", &Vminibuffer_local_completion_map, | |
335c5470 | 3650 | doc: /* Local keymap for minibuffer input with completion. */); |
ce6e5d0b | 3651 | Vminibuffer_local_completion_map = Fmake_sparse_keymap (Qnil); |
2b6748c0 | 3652 | Fset_keymap_parent (Vminibuffer_local_completion_map, Vminibuffer_local_map); |
2c6f1a39 JB |
3653 | |
3654 | DEFVAR_LISP ("minibuffer-local-must-match-map", &Vminibuffer_local_must_match_map, | |
335c5470 | 3655 | doc: /* Local keymap for minibuffer input with completion, for exact match. */); |
ce6e5d0b | 3656 | Vminibuffer_local_must_match_map = Fmake_sparse_keymap (Qnil); |
2b6748c0 SM |
3657 | Fset_keymap_parent (Vminibuffer_local_must_match_map, |
3658 | Vminibuffer_local_completion_map); | |
2c6f1a39 | 3659 | |
cc0a8174 | 3660 | DEFVAR_LISP ("minor-mode-map-alist", &Vminor_mode_map_alist, |
335c5470 PJ |
3661 | doc: /* Alist of keymaps to use for minor modes. |
3662 | Each element looks like (VARIABLE . KEYMAP); KEYMAP is used to read | |
3663 | key sequences and look up bindings iff VARIABLE's value is non-nil. | |
3664 | If two active keymaps bind the same key, the keymap appearing earlier | |
3665 | in the list takes precedence. */); | |
cc0a8174 JB |
3666 | Vminor_mode_map_alist = Qnil; |
3667 | ||
dd9cda06 | 3668 | DEFVAR_LISP ("minor-mode-overriding-map-alist", &Vminor_mode_overriding_map_alist, |
335c5470 | 3669 | doc: /* Alist of keymaps to use for minor modes, in current major mode. |
95296eac | 3670 | This variable is an alist just like `minor-mode-map-alist', and it is |
335c5470 PJ |
3671 | used the same way (and before `minor-mode-map-alist'); however, |
3672 | it is provided for major modes to bind locally. */); | |
dd9cda06 RS |
3673 | Vminor_mode_overriding_map_alist = Qnil; |
3674 | ||
99cbcaca KS |
3675 | DEFVAR_LISP ("emulation-mode-map-alists", &Vemulation_mode_map_alists, |
3676 | doc: /* List of keymap alists to use for emulations modes. | |
3677 | It is intended for modes or packages using multiple minor-mode keymaps. | |
3678 | Each element is a keymap alist just like `minor-mode-map-alist', or a | |
3679 | symbol with a variable binding which is a keymap alist, and it is used | |
3680 | the same way. The "active" keymaps in each alist are used before | |
744cd66b | 3681 | `minor-mode-map-alist' and `minor-mode-overriding-map-alist'. */); |
99cbcaca KS |
3682 | Vemulation_mode_map_alists = Qnil; |
3683 | ||
3684 | ||
6bbbd9b0 | 3685 | DEFVAR_LISP ("function-key-map", &Vfunction_key_map, |
335c5470 PJ |
3686 | doc: /* Keymap mapping ASCII function key sequences onto their preferred forms. |
3687 | This allows Emacs to recognize function keys sent from ASCII | |
3688 | terminals at any point in a key sequence. | |
3689 | ||
3690 | The `read-key-sequence' function replaces any subsequence bound by | |
3691 | `function-key-map' with its binding. More precisely, when the active | |
3692 | keymaps have no binding for the current key sequence but | |
3693 | `function-key-map' binds a suffix of the sequence to a vector or string, | |
3694 | `read-key-sequence' replaces the matching suffix with its binding, and | |
3695 | continues with the new sequence. | |
3696 | ||
3697 | The events that come from bindings in `function-key-map' are not | |
3698 | themselves looked up in `function-key-map'. | |
3699 | ||
3700 | For example, suppose `function-key-map' binds `ESC O P' to [f1]. | |
3701 | Typing `ESC O P' to `read-key-sequence' would return [f1]. Typing | |
3702 | `C-x ESC O P' would return [?\\C-x f1]. If [f1] were a prefix | |
3703 | key, typing `ESC O P x' would return [f1 x]. */); | |
ce6e5d0b | 3704 | Vfunction_key_map = Fmake_sparse_keymap (Qnil); |
6bbbd9b0 | 3705 | |
d7bf9bf5 | 3706 | DEFVAR_LISP ("key-translation-map", &Vkey_translation_map, |
335c5470 PJ |
3707 | doc: /* Keymap of key translations that can override keymaps. |
3708 | This keymap works like `function-key-map', but comes after that, | |
3709 | and applies even for keys that have ordinary bindings. */); | |
d7bf9bf5 RS |
3710 | Vkey_translation_map = Qnil; |
3711 | ||
d378869e SM |
3712 | staticpro (&Vmenu_events); |
3713 | Vmenu_events = Fcons (intern ("menu-bar"), | |
3714 | Fcons (intern ("tool-bar"), | |
3715 | Fcons (intern ("mouse-1"), | |
3716 | Fcons (intern ("mouse-2"), | |
3717 | Fcons (intern ("mouse-3"), | |
3718 | Qnil))))); | |
3719 | ||
3720 | ||
2c6f1a39 JB |
3721 | Qsingle_key_description = intern ("single-key-description"); |
3722 | staticpro (&Qsingle_key_description); | |
3723 | ||
3724 | Qkey_description = intern ("key-description"); | |
3725 | staticpro (&Qkey_description); | |
3726 | ||
3727 | Qkeymapp = intern ("keymapp"); | |
3728 | staticpro (&Qkeymapp); | |
3729 | ||
2fc66973 JB |
3730 | Qnon_ascii = intern ("non-ascii"); |
3731 | staticpro (&Qnon_ascii); | |
3732 | ||
a3fc8840 RS |
3733 | Qmenu_item = intern ("menu-item"); |
3734 | staticpro (&Qmenu_item); | |
3735 | ||
a1df473f KS |
3736 | Qremap = intern ("remap"); |
3737 | staticpro (&Qremap); | |
3738 | ||
023b93f6 KS |
3739 | command_remapping_vector = Fmake_vector (make_number (2), Qremap); |
3740 | staticpro (&command_remapping_vector); | |
a1df473f | 3741 | |
1e7d1ab0 SM |
3742 | where_is_cache_keymaps = Qt; |
3743 | where_is_cache = Qnil; | |
3744 | staticpro (&where_is_cache); | |
3745 | staticpro (&where_is_cache_keymaps); | |
3746 | ||
2c6f1a39 | 3747 | defsubr (&Skeymapp); |
7d58ed99 | 3748 | defsubr (&Skeymap_parent); |
54cbc3d4 | 3749 | defsubr (&Skeymap_prompt); |
7d58ed99 | 3750 | defsubr (&Sset_keymap_parent); |
2c6f1a39 JB |
3751 | defsubr (&Smake_keymap); |
3752 | defsubr (&Smake_sparse_keymap); | |
9d3153eb | 3753 | defsubr (&Smap_keymap); |
2c6f1a39 | 3754 | defsubr (&Scopy_keymap); |
023b93f6 | 3755 | defsubr (&Scommand_remapping); |
2c6f1a39 JB |
3756 | defsubr (&Skey_binding); |
3757 | defsubr (&Slocal_key_binding); | |
3758 | defsubr (&Sglobal_key_binding); | |
cc0a8174 | 3759 | defsubr (&Sminor_mode_key_binding); |
2c6f1a39 JB |
3760 | defsubr (&Sdefine_key); |
3761 | defsubr (&Slookup_key); | |
2c6f1a39 JB |
3762 | defsubr (&Sdefine_prefix_command); |
3763 | defsubr (&Suse_global_map); | |
3764 | defsubr (&Suse_local_map); | |
3765 | defsubr (&Scurrent_local_map); | |
3766 | defsubr (&Scurrent_global_map); | |
cc0a8174 | 3767 | defsubr (&Scurrent_minor_mode_maps); |
54cbc3d4 | 3768 | defsubr (&Scurrent_active_maps); |
2c6f1a39 JB |
3769 | defsubr (&Saccessible_keymaps); |
3770 | defsubr (&Skey_description); | |
3771 | defsubr (&Sdescribe_vector); | |
3772 | defsubr (&Ssingle_key_description); | |
3773 | defsubr (&Stext_char_description); | |
3774 | defsubr (&Swhere_is_internal); | |
54cbc3d4 | 3775 | defsubr (&Sdescribe_buffer_bindings); |
2c6f1a39 JB |
3776 | defsubr (&Sapropos_internal); |
3777 | } | |
3778 | ||
dfcf069d | 3779 | void |
2c6f1a39 JB |
3780 | keys_of_keymap () |
3781 | { | |
2c6f1a39 JB |
3782 | initial_define_key (global_map, 033, "ESC-prefix"); |
3783 | initial_define_key (global_map, Ctl('X'), "Control-X-prefix"); | |
3784 | } |