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