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