Commit | Line | Data |
---|---|---|
f927c5ae JB |
1 | /* Minibuffer input and completion. |
2 | Copyright (C) 1985, 1986 Free Software Foundation, Inc. | |
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 | |
8 | the Free Software Foundation; either version 1, or (at your option) | |
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 | |
18 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | ||
20 | ||
21 | #include "config.h" | |
22 | #include "lisp.h" | |
23 | #include "commands.h" | |
24 | #include "buffer.h" | |
25 | #include "dispextern.h" | |
26 | #include "screen.h" | |
27 | #include "window.h" | |
28 | #include "syntax.h" | |
29 | ||
30 | #define min(a, b) ((a) < (b) ? (a) : (b)) | |
31 | ||
32 | /* List of buffers for use as minibuffers. | |
33 | The first element of the list is used for the outermost minibuffer invocation, | |
34 | the next element is used for a recursive minibuffer invocation, etc. | |
35 | The list is extended at the end as deeped minibuffer recursions are encountered. */ | |
36 | Lisp_Object Vminibuffer_list; | |
37 | ||
38 | struct minibuf_save_data | |
39 | { | |
40 | char *prompt; | |
41 | int prompt_width; | |
42 | Lisp_Object help_form; | |
43 | Lisp_Object current_prefix_arg; | |
44 | }; | |
45 | ||
46 | int minibuf_save_vector_size; | |
47 | struct minibuf_save_data *minibuf_save_vector; | |
48 | ||
49 | /* Depth in minibuffer invocations. */ | |
50 | int minibuf_level; | |
51 | ||
52 | /* Nonzero means display completion help for invalid input */ | |
53 | int auto_help; | |
54 | ||
55 | /* Fread_minibuffer leaves the input, as a string, here */ | |
56 | Lisp_Object last_minibuf_string; | |
57 | ||
58 | /* Nonzero means let functions called when within a minibuffer | |
59 | invoke recursive minibuffers (to read arguments, or whatever) */ | |
60 | int enable_recursive_minibuffers; | |
61 | ||
62 | /* help-form is bound to this while in the minibuffer. */ | |
63 | ||
64 | Lisp_Object Vminibuffer_help_form; | |
65 | ||
66 | /* Nonzero means completion ignores case. */ | |
67 | ||
68 | int completion_ignore_case; | |
69 | ||
70 | /* If last completion attempt reported "Complete but not unique" | |
71 | then this is the string completed then; otherwise this is nil. */ | |
72 | ||
73 | static Lisp_Object last_exact_completion; | |
74 | ||
75 | Lisp_Object Quser_variable_p; | |
76 | ||
77 | /* Width in columns of current minibuffer prompt. */ | |
78 | ||
79 | extern int minibuf_prompt_width; | |
80 | ||
81 | #ifdef MULTI_SCREEN | |
82 | ||
83 | /* When the global-minibuffer-screen is not used, this is the screen | |
84 | where the minbuffer is active, and thus where certain windows | |
85 | (completions, etc.) should appear. */ | |
86 | struct screen *active_screen; | |
87 | ||
88 | extern Lisp_Object Vglobal_minibuffer_screen; | |
89 | #endif | |
90 | \f | |
91 | /* Actual minibuffer invocation. */ | |
92 | ||
93 | void read_minibuf_unwind (); | |
94 | Lisp_Object get_minibuffer (); | |
95 | Lisp_Object read_minibuf (); | |
96 | ||
97 | Lisp_Object | |
98 | read_minibuf (map, initial, prompt, backup_n, expflag) | |
99 | Lisp_Object map; | |
100 | Lisp_Object initial; | |
101 | Lisp_Object prompt; | |
102 | Lisp_Object backup_n; | |
103 | int expflag; | |
104 | { | |
105 | register Lisp_Object val; | |
106 | int count = specpdl_ptr - specpdl; | |
107 | struct gcpro gcpro1, gcpro2; | |
108 | Lisp_Object prev_screen = Qnil; | |
109 | ||
110 | if (XTYPE (prompt) != Lisp_String) | |
111 | prompt = build_string (""); | |
112 | ||
113 | /* Emacs in -batch mode calls minibuffer: print the prompt. */ | |
114 | if (noninteractive && XTYPE (prompt) == Lisp_String) | |
115 | printf ("%s", XSTRING (prompt)->data); | |
116 | ||
117 | if (!enable_recursive_minibuffers | |
118 | && minibuf_level > 0 | |
119 | && (EQ (selected_window, minibuf_window))) | |
120 | #if 0 | |
121 | || selected_screen != XSCREEN (WINDOW_SCREEN (XWINDOW (minibuf_window))) | |
122 | #endif | |
123 | error ("Command attempted to use minibuffer while in minibuffer"); | |
124 | ||
125 | if (minibuf_level == minibuf_save_vector_size) | |
126 | minibuf_save_vector = | |
127 | (struct minibuf_save_data *) | |
128 | xrealloc (minibuf_save_vector, | |
129 | (minibuf_save_vector_size *= 2) | |
130 | * sizeof (struct minibuf_save_data)); | |
131 | minibuf_save_vector[minibuf_level].prompt = minibuf_prompt; | |
132 | minibuf_save_vector[minibuf_level].prompt_width = minibuf_prompt_width; | |
133 | minibuf_prompt_width = 0; | |
134 | /* >> Why is this done this way rather than binding these variables? */ | |
135 | minibuf_save_vector[minibuf_level].help_form = Vhelp_form; | |
136 | minibuf_save_vector[minibuf_level].current_prefix_arg = Vcurrent_prefix_arg; | |
137 | GCPRO2 (minibuf_save_vector[minibuf_level].help_form, | |
138 | minibuf_save_vector[minibuf_level].current_prefix_arg); | |
139 | ||
140 | record_unwind_protect (Fset_window_configuration, | |
141 | Fcurrent_window_configuration ()); | |
142 | ||
143 | val = current_buffer->directory; | |
144 | Fset_buffer (get_minibuffer (minibuf_level)); | |
145 | current_buffer->directory = val; | |
146 | Fmake_local_variable (Qprint_escape_newlines); | |
147 | print_escape_newlines = 1; | |
148 | ||
149 | Vminibuf_scroll_window = selected_window; | |
150 | Fset_window_buffer (minibuf_window, Fcurrent_buffer ()); | |
151 | #ifdef MULTI_SCREEN | |
152 | if (SCREENP (Vglobal_minibuffer_screen)) | |
153 | active_screen = selected_screen; | |
154 | #endif | |
155 | Fselect_window (minibuf_window); | |
156 | XFASTINT (XWINDOW (minibuf_window)->hscroll) = 0; | |
157 | ||
158 | Ferase_buffer (); | |
159 | minibuf_level++; | |
160 | record_unwind_protect (read_minibuf_unwind, Qnil); | |
161 | ||
162 | if (!NULL (initial)) | |
163 | { | |
164 | Finsert (1, &initial); | |
165 | if (!NULL (backup_n) && XTYPE (backup_n) == Lisp_Int) | |
166 | Fforward_char (backup_n); | |
167 | } | |
168 | ||
169 | minibuf_prompt = (char *) alloca (XSTRING (prompt)->size + 1); | |
170 | bcopy (XSTRING (prompt)->data, minibuf_prompt, XSTRING (prompt)->size + 1); | |
171 | echo_area_glyphs = 0; | |
172 | ||
173 | Vhelp_form = Vminibuffer_help_form; | |
174 | current_buffer->keymap = map; | |
175 | ||
176 | /* ??? MCC did redraw_screen here if switching screens. */ | |
177 | recursive_edit_1 (); | |
178 | ||
179 | /* If cursor is on the minibuffer line, | |
180 | show the user we have exited by putting it in column 0. */ | |
181 | if ((SCREEN_CURSOR_Y (selected_screen) | |
182 | >= XFASTINT (XWINDOW (minibuf_window)->top)) | |
183 | && !noninteractive) | |
184 | { | |
185 | SCREEN_CURSOR_X (selected_screen) = 0; | |
186 | update_screen (selected_screen, 1, 1); | |
187 | } | |
188 | ||
189 | /* Make minibuffer contents into a string */ | |
190 | val = make_string (BEG_ADDR, Z - BEG); | |
191 | bcopy (GAP_END_ADDR, XSTRING (val)->data + GPT - BEG, Z - GPT); | |
192 | unbind_to (count, Qnil); /* The appropriate screen will get selected | |
193 | from set-window-configuration. */ | |
194 | ||
195 | UNGCPRO; | |
196 | ||
197 | /* VAL is the string of minibuffer text. */ | |
198 | ||
199 | last_minibuf_string = val; | |
200 | ||
201 | /* If Lisp form desired instead of string, parse it */ | |
202 | if (expflag) | |
203 | val = Fread (val); | |
204 | ||
205 | #ifdef MULTI_SCREEN | |
206 | if (active_screen) | |
207 | active_screen = (struct screen *) 0; | |
208 | #endif | |
209 | ||
210 | return val; | |
211 | } | |
212 | ||
213 | /* Return a buffer to be used as the minibuffer at depth `depth'. | |
214 | depth = 0 is the lowest allowed argument, and that is the value | |
215 | used for nonrecursive minibuffer invocations */ | |
216 | ||
217 | Lisp_Object | |
218 | get_minibuffer (depth) | |
219 | int depth; | |
220 | { | |
221 | Lisp_Object tail, num, buf; | |
222 | char name[14]; | |
223 | extern Lisp_Object nconc2 (); | |
224 | ||
225 | XFASTINT (num) = depth; | |
226 | tail = Fnthcdr (num, Vminibuffer_list); | |
227 | if (NULL (tail)) | |
228 | { | |
229 | tail = Fcons (Qnil, Qnil); | |
230 | Vminibuffer_list = nconc2 (Vminibuffer_list, tail); | |
231 | } | |
232 | buf = Fcar (tail); | |
233 | if (NULL (buf) || NULL (XBUFFER (buf)->name)) | |
234 | { | |
235 | sprintf (name, " *Minibuf-%d*", depth); | |
236 | buf = Fget_buffer_create (build_string (name)); | |
237 | XCONS (tail)->car = buf; | |
238 | } | |
239 | else | |
240 | reset_buffer (XBUFFER (buf)); | |
241 | return buf; | |
242 | } | |
243 | ||
244 | /* This function is called on exiting minibuffer, whether normally or not, | |
245 | and it restores the current window, buffer, etc. */ | |
246 | ||
247 | void | |
248 | read_minibuf_unwind () | |
249 | { | |
250 | /* Erase the minibuffer we were using at this level. */ | |
251 | Fset_buffer (XWINDOW (minibuf_window)->buffer); | |
252 | ||
253 | /* Prevent error in erase-buffer. */ | |
254 | current_buffer->read_only = Qnil; | |
255 | Ferase_buffer (); | |
256 | ||
257 | /* If this was a recursive minibuffer, | |
258 | tie the minibuffer window back to the outer level minibuffer buffer */ | |
259 | minibuf_level--; | |
260 | /* Make sure minibuffer window is erased, not ignored */ | |
261 | windows_or_buffers_changed++; | |
262 | XFASTINT (XWINDOW (minibuf_window)->last_modified) = 0; | |
263 | ||
264 | /* Restore prompt from outer minibuffer */ | |
265 | minibuf_prompt = minibuf_save_vector[minibuf_level].prompt; | |
266 | minibuf_prompt_width = minibuf_save_vector[minibuf_level].prompt_width; | |
267 | Vhelp_form = minibuf_save_vector[minibuf_level].help_form; | |
268 | Vcurrent_prefix_arg = minibuf_save_vector[minibuf_level].current_prefix_arg; | |
269 | } | |
270 | \f | |
271 | DEFUN ("read-from-minibuffer", Fread_from_minibuffer, Sread_from_minibuffer, 1, 5, 0, | |
272 | "Read a string from the minibuffer, prompting with string PROMPT.\n\ | |
273 | If optional second arg INITIAL-CONTENTS is non-nil, it is a string\n\ | |
274 | to be inserted into the minibuffer before reading input.\n\ | |
275 | Third arg KEYMAP is a keymap to use whilst reading;\n\ | |
276 | if omitted or nil, the default is `minibuffer-local-map'.\n\ | |
277 | If fourth arg READ is non-nil, then interpret the result as a lisp object\n\ | |
278 | and return that object:\n\ | |
279 | in other words, do `(car (read-from-string INPUT-STRING))'\n\ | |
280 | Fifth arg POSITION, if non-nil, is where to put point\n\ | |
281 | in the minibuffer after inserting INITIAL-CONTENTS.") | |
282 | (prompt, initial_input, keymap, read, position) | |
283 | Lisp_Object prompt, initial_input, keymap, read, position; | |
284 | { | |
285 | int pos = 0; | |
286 | ||
287 | CHECK_STRING (prompt, 0); | |
288 | if (!NULL (initial_input)) | |
289 | { | |
290 | CHECK_STRING (initial_input, 1); | |
291 | if (!NULL (position)) | |
292 | { | |
293 | CHECK_NUMBER (position, 0); | |
294 | /* Convert to distance from end of input. */ | |
295 | pos = XINT (position) - 1 - XSTRING (initial_input)->size; | |
296 | } | |
297 | } | |
298 | ||
299 | if (NULL (keymap)) | |
300 | keymap = Vminibuffer_local_map; | |
301 | else | |
302 | keymap = get_keymap (keymap,2); | |
303 | return read_minibuf (keymap, initial_input, prompt, | |
304 | pos, !NULL (read)); | |
305 | } | |
306 | ||
307 | DEFUN ("read-minibuffer", Fread_minibuffer, Sread_minibuffer, 1, 2, 0, | |
308 | "Return a Lisp object read using the minibuffer.\n\ | |
309 | Prompt with PROMPT. If non-nil, optional second arg INITIAL-CONTENTS\n\ | |
310 | is a string to insert in the minibuffer before reading.") | |
311 | (prompt, initial_contents) | |
312 | Lisp_Object prompt, initial_contents; | |
313 | { | |
314 | CHECK_STRING (prompt, 0); | |
315 | if (!NULL (initial_contents)) | |
316 | CHECK_STRING (initial_contents, 1) | |
317 | return read_minibuf (Vminibuffer_local_map, initial_contents, prompt, Qnil, 1); | |
318 | } | |
319 | ||
320 | DEFUN ("eval-minibuffer", Feval_minibuffer, Seval_minibuffer, 1, 2, 0, | |
321 | "Return value of Lisp expression read using the minibuffer.\n\ | |
322 | Prompt with PROMPT. If non-nil, optional second arg INITIAL-CONTENTS\n\ | |
323 | is a string to insert in the minibuffer before reading.") | |
324 | (prompt, initial_contents) | |
325 | Lisp_Object prompt, initial_contents; | |
326 | { | |
327 | return Feval (Fread_minibuffer (prompt, initial_contents)); | |
328 | } | |
329 | ||
330 | /* Functions that use the minibuffer to read various things. */ | |
331 | ||
332 | DEFUN ("read-string", Fread_string, Sread_string, 1, 2, 0, | |
333 | "Read a string from the minibuffer, prompting with string PROMPT.\n\ | |
334 | If non-nil second arg INITIAL-INPUT is a string to insert before reading.") | |
335 | (prompt, initial_input) | |
336 | Lisp_Object prompt, initial_input; | |
337 | { | |
338 | return Fread_from_minibuffer (prompt, initial_input, Qnil, Qnil, Qnil); | |
339 | } | |
340 | ||
341 | DEFUN ("read-no-blanks-input", Fread_no_blanks_input, Sread_no_blanks_input, 2, 1, 0, | |
342 | "Args PROMPT and INIT, strings. Read a string from the terminal, not allowing blanks.\n\ | |
343 | Prompt with PROMPT, and provide INIT as an initial value of the input string.") | |
344 | (prompt, init) | |
345 | Lisp_Object prompt, init; | |
346 | { | |
347 | CHECK_STRING (prompt, 0); | |
348 | if (! NULL (init)) | |
349 | CHECK_STRING (init, 1); | |
350 | ||
351 | return read_minibuf (Vminibuffer_local_ns_map, init, prompt, Qnil, 0); | |
352 | } | |
353 | ||
354 | DEFUN ("read-command", Fread_command, Sread_command, 1, 1, 0, | |
355 | "One arg PROMPT, a string. Read the name of a command and return as a symbol.\n\ | |
356 | Prompts with PROMPT.") | |
357 | (prompt) | |
358 | Lisp_Object prompt; | |
359 | { | |
360 | return Fintern (Fcompleting_read (prompt, Vobarray, Qcommandp, Qt, Qnil, Qnil), | |
361 | Qnil); | |
362 | } | |
363 | ||
364 | #ifdef NOTDEF | |
365 | DEFUN ("read-function", Fread_function, Sread_function, 1, 1, 0, | |
366 | "One arg PROMPT, a string. Read the name of a function and return as a symbol.\n\ | |
367 | Prompts with PROMPT.") | |
368 | (prompt) | |
369 | Lisp_Object prompt; | |
370 | { | |
371 | return Fintern (Fcompleting_read (prompt, Vobarray, Qfboundp, Qt, Qnil, Qnil), | |
372 | Qnil); | |
373 | } | |
374 | #endif /* NOTDEF */ | |
375 | ||
376 | DEFUN ("read-variable", Fread_variable, Sread_variable, 1, 1, 0, | |
377 | "One arg PROMPT, a string. Read the name of a user variable and return\n\ | |
378 | it as a symbol. Prompts with PROMPT.\n\ | |
379 | A user variable is one whose documentation starts with a `*' character.") | |
380 | (prompt) | |
381 | Lisp_Object prompt; | |
382 | { | |
383 | return Fintern (Fcompleting_read (prompt, Vobarray, | |
384 | Quser_variable_p, Qt, Qnil, Qnil), | |
385 | Qnil); | |
386 | } | |
387 | ||
388 | DEFUN ("read-buffer", Fread_buffer, Sread_buffer, 1, 3, 0, | |
389 | "One arg PROMPT, a string. Read the name of a buffer and return as a string.\n\ | |
390 | Prompts with PROMPT.\n\ | |
391 | Optional second arg is value to return if user enters an empty line.\n\ | |
392 | If optional third arg REQUIRE-MATCH is non-nil, only existing buffer names are allowed.") | |
393 | (prompt, def, require_match) | |
394 | Lisp_Object prompt, def, require_match; | |
395 | { | |
396 | Lisp_Object tem; | |
397 | Lisp_Object args[3]; | |
398 | struct gcpro gcpro1; | |
399 | ||
400 | if (XTYPE (def) == Lisp_Buffer) | |
401 | def = XBUFFER (def)->name; | |
402 | if (!NULL (def)) | |
403 | { | |
404 | args[0] = build_string ("%s(default %s) "); | |
405 | args[1] = prompt; | |
406 | args[2] = def; | |
407 | prompt = Fformat (3, args); | |
408 | } | |
409 | GCPRO1 (def); | |
410 | tem = Fcompleting_read (prompt, Vbuffer_alist, Qnil, require_match, Qnil, Qnil); | |
411 | UNGCPRO; | |
412 | if (XSTRING (tem)->size) | |
413 | return tem; | |
414 | return def; | |
415 | } | |
416 | \f | |
417 | DEFUN ("try-completion", Ftry_completion, Stry_completion, 2, 3, 0, | |
418 | "Return common substring of all completions of STRING in ALIST.\n\ | |
419 | Each car of each element of ALIST is tested to see if it begins with STRING.\n\ | |
420 | All that match are compared together; the longest initial sequence\n\ | |
421 | common to all matches is returned as a string.\n\ | |
422 | If there is no match at all, nil is returned.\n\ | |
423 | For an exact match, t is returned.\n\ | |
424 | \n\ | |
425 | ALIST can be an obarray instead of an alist.\n\ | |
426 | Then the print names of all symbols in the obarray are the possible matches.\n\ | |
427 | \n\ | |
428 | ALIST can also be a function to do the completion itself.\n\ | |
429 | It receives three arguments: the values STRING, PREDICATE and nil.\n\ | |
430 | Whatever it returns becomes the value of `try-completion'.\n\ | |
431 | \n\ | |
432 | If optional third argument PREDICATE is non-nil,\n\ | |
433 | it is used to test each possible match.\n\ | |
434 | The match is a candidate only if PREDICATE returns non-nil.\n\ | |
435 | The argument given to PREDICATE is the alist element or the symbol from the obarray.") | |
436 | (string, alist, pred) | |
437 | Lisp_Object string, alist, pred; | |
438 | { | |
439 | Lisp_Object bestmatch, tail, elt, eltstring; | |
440 | int bestmatchsize; | |
441 | int compare, matchsize; | |
442 | int list = CONSP (alist) || NULL (alist); | |
443 | int index, obsize; | |
444 | int matchcount = 0; | |
445 | Lisp_Object bucket, zero, end, tem; | |
446 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; | |
447 | ||
448 | CHECK_STRING (string, 0); | |
449 | if (!list && XTYPE (alist) != Lisp_Vector) | |
450 | return call3 (alist, string, pred, Qnil); | |
451 | ||
452 | bestmatch = Qnil; | |
453 | ||
454 | /* If ALIST is not a list, set TAIL just for gc pro. */ | |
455 | tail = alist; | |
456 | if (! list) | |
457 | { | |
458 | index = 0; | |
459 | obsize = XVECTOR (alist)->size; | |
460 | bucket = XVECTOR (alist)->contents[index]; | |
461 | } | |
462 | ||
463 | while (1) | |
464 | { | |
465 | /* Get the next element of the alist or obarray. */ | |
466 | /* Exit the loop if the elements are all used up. */ | |
467 | /* elt gets the alist element or symbol. | |
468 | eltstring gets the name to check as a completion. */ | |
469 | ||
470 | if (list) | |
471 | { | |
472 | if (NULL (tail)) | |
473 | break; | |
474 | elt = Fcar (tail); | |
475 | eltstring = Fcar (elt); | |
476 | tail = Fcdr (tail); | |
477 | } | |
478 | else | |
479 | { | |
480 | if (XFASTINT (bucket) != 0) | |
481 | { | |
482 | elt = bucket; | |
483 | eltstring = Fsymbol_name (elt); | |
484 | if (XSYMBOL (bucket)->next) | |
485 | XSETSYMBOL (bucket, XSYMBOL (bucket)->next); | |
486 | else | |
487 | XFASTINT (bucket) = 0; | |
488 | } | |
489 | else if (++index >= obsize) | |
490 | break; | |
491 | else | |
492 | { | |
493 | bucket = XVECTOR (alist)->contents[index]; | |
494 | continue; | |
495 | } | |
496 | } | |
497 | ||
498 | /* Is this element a possible completion? */ | |
499 | ||
500 | if (XTYPE (eltstring) == Lisp_String && | |
501 | XSTRING (string)->size <= XSTRING (eltstring)->size && | |
502 | 0 > scmp (XSTRING (eltstring)->data, XSTRING (string)->data, | |
503 | XSTRING (string)->size)) | |
504 | { | |
505 | /* Yes. */ | |
506 | /* Ignore this element if there is a predicate | |
507 | and the predicate doesn't like it. */ | |
508 | ||
509 | if (!NULL (pred)) | |
510 | { | |
511 | if (EQ (pred, Qcommandp)) | |
512 | tem = Fcommandp (elt); | |
513 | else | |
514 | { | |
515 | GCPRO4 (tail, string, eltstring, bestmatch); | |
516 | tem = call1 (pred, elt); | |
517 | UNGCPRO; | |
518 | } | |
519 | if (NULL (tem)) continue; | |
520 | } | |
521 | ||
522 | /* Update computation of how much all possible completions match */ | |
523 | ||
524 | matchcount++; | |
525 | if (NULL (bestmatch)) | |
526 | bestmatch = eltstring, bestmatchsize = XSTRING (eltstring)->size; | |
527 | else | |
528 | { | |
529 | compare = min (bestmatchsize, XSTRING (eltstring)->size); | |
530 | matchsize = scmp (XSTRING (bestmatch)->data, | |
531 | XSTRING (eltstring)->data, | |
532 | compare); | |
533 | bestmatchsize = (matchsize >= 0) ? matchsize : compare; | |
534 | } | |
535 | } | |
536 | } | |
537 | ||
538 | if (NULL (bestmatch)) | |
539 | return Qnil; /* No completions found */ | |
540 | if (matchcount == 1 && bestmatchsize == XSTRING (string)->size) | |
541 | return Qt; | |
542 | ||
543 | XFASTINT (zero) = 0; /* Else extract the part in which */ | |
544 | XFASTINT (end) = bestmatchsize; /* all completions agree */ | |
545 | return Fsubstring (bestmatch, zero, end); | |
546 | } | |
547 | ||
548 | /* Compare exactly LEN chars of strings at S1 and S2, | |
549 | ignoring case if appropriate. | |
550 | Return -1 if strings match, | |
551 | else number of chars that match at the beginning. */ | |
552 | ||
553 | scmp (s1, s2, len) | |
554 | register char *s1, *s2; | |
555 | int len; | |
556 | { | |
557 | register int l = len; | |
558 | ||
559 | if (completion_ignore_case) | |
560 | { | |
561 | while (l && DOWNCASE (*s1++) == DOWNCASE (*s2++)) | |
562 | l--; | |
563 | } | |
564 | else | |
565 | { | |
566 | while (l && *s1++ == *s2++) | |
567 | l--; | |
568 | } | |
569 | if (l == 0) | |
570 | return -1; | |
571 | else return len - l; | |
572 | } | |
573 | \f | |
574 | DEFUN ("all-completions", Fall_completions, Sall_completions, 2, 3, 0, | |
575 | "Search for partial matches to STRING in ALIST.\n\ | |
576 | Each car of each element of ALIST is tested to see if it begins with STRING.\n\ | |
577 | The value is a list of all the strings from ALIST that match.\n\ | |
578 | ALIST can be an obarray instead of an alist.\n\ | |
579 | Then the print names of all symbols in the obarray are the possible matches.\n\ | |
580 | \n\ | |
581 | ALIST can also be a function to do the completion itself.\n\ | |
582 | It receives three arguments: the values STRING, PREDICATE and t.\n\ | |
583 | Whatever it returns becomes the value of `all-completion'.\n\ | |
584 | \n\ | |
585 | If optional third argument PREDICATE is non-nil,\n\ | |
586 | it is used to test each possible match.\n\ | |
587 | The match is a candidate only if PREDICATE returns non-nil.\n\ | |
588 | The argument given to PREDICATE is the alist element or the symbol from the obarray.") | |
589 | (string, alist, pred) | |
590 | Lisp_Object string, alist, pred; | |
591 | { | |
592 | Lisp_Object tail, elt, eltstring; | |
593 | Lisp_Object allmatches; | |
594 | int list = CONSP (alist) || NULL (alist); | |
595 | int index, obsize; | |
596 | Lisp_Object bucket, tem; | |
597 | struct gcpro gcpro1, gcpro2, gcpro3, gcpro4; | |
598 | ||
599 | CHECK_STRING (string, 0); | |
600 | if (!list && XTYPE (alist) != Lisp_Vector) | |
601 | { | |
602 | return call3 (alist, string, pred, Qt); | |
603 | } | |
604 | allmatches = Qnil; | |
605 | ||
606 | /* If ALIST is not a list, set TAIL just for gc pro. */ | |
607 | tail = alist; | |
608 | if (! list) | |
609 | { | |
610 | index = 0; | |
611 | obsize = XVECTOR (alist)->size; | |
612 | bucket = XVECTOR (alist)->contents[index]; | |
613 | } | |
614 | ||
615 | while (1) | |
616 | { | |
617 | /* Get the next element of the alist or obarray. */ | |
618 | /* Exit the loop if the elements are all used up. */ | |
619 | /* elt gets the alist element or symbol. | |
620 | eltstring gets the name to check as a completion. */ | |
621 | ||
622 | if (list) | |
623 | { | |
624 | if (NULL (tail)) | |
625 | break; | |
626 | elt = Fcar (tail); | |
627 | eltstring = Fcar (elt); | |
628 | tail = Fcdr (tail); | |
629 | } | |
630 | else | |
631 | { | |
632 | if (XFASTINT (bucket) != 0) | |
633 | { | |
634 | elt = bucket; | |
635 | eltstring = Fsymbol_name (elt); | |
636 | if (XSYMBOL (bucket)->next) | |
637 | XSETSYMBOL (bucket, XSYMBOL (bucket)->next); | |
638 | else | |
639 | XFASTINT (bucket) = 0; | |
640 | } | |
641 | else if (++index >= obsize) | |
642 | break; | |
643 | else | |
644 | { | |
645 | bucket = XVECTOR (alist)->contents[index]; | |
646 | continue; | |
647 | } | |
648 | } | |
649 | ||
650 | /* Is this element a possible completion? */ | |
651 | ||
652 | if (XTYPE (eltstring) == Lisp_String && | |
653 | XSTRING (string)->size <= XSTRING (eltstring)->size && | |
654 | XSTRING (eltstring)->data[0] != ' ' && | |
655 | 0 > scmp (XSTRING (eltstring)->data, XSTRING (string)->data, | |
656 | XSTRING (string)->size)) | |
657 | { | |
658 | /* Yes. */ | |
659 | /* Ignore this element if there is a predicate | |
660 | and the predicate doesn't like it. */ | |
661 | ||
662 | if (!NULL (pred)) | |
663 | { | |
664 | if (EQ (pred, Qcommandp)) | |
665 | tem = Fcommandp (elt); | |
666 | else | |
667 | { | |
668 | GCPRO4 (tail, eltstring, allmatches, string); | |
669 | tem = call1 (pred, elt); | |
670 | UNGCPRO; | |
671 | } | |
672 | if (NULL (tem)) continue; | |
673 | } | |
674 | /* Ok => put it on the list. */ | |
675 | allmatches = Fcons (eltstring, allmatches); | |
676 | } | |
677 | } | |
678 | ||
679 | return Fnreverse (allmatches); | |
680 | } | |
681 | \f | |
682 | Lisp_Object Vminibuffer_completion_table, Qminibuffer_completion_table; | |
683 | Lisp_Object Vminibuffer_completion_predicate, Qminibuffer_completion_predicate; | |
684 | Lisp_Object Vminibuffer_completion_confirm, Qminibuffer_completion_confirm; | |
685 | ||
686 | DEFUN ("completing-read", Fcompleting_read, Scompleting_read, 2, 6, 0, | |
687 | "Read a string in the minibuffer, with completion.\n\ | |
688 | Args are PROMPT, TABLE, PREDICATE, REQUIRE-MATCH and INITIAL-INPUT.\n\ | |
689 | PROMPT is a string to prompt with; normally it ends in a colon and a space.\n\ | |
690 | TABLE is an alist whose elements' cars are strings, or an obarray.\n\ | |
691 | PREDICATE limits completion to a subset of TABLE.\n\ | |
692 | See `try-completion' for more details on completion, TABLE, and PREDICATE.\n\ | |
693 | If REQUIRE-MATCH is non-nil, the user is not allowed to exit unless\n\ | |
694 | the input is (or completes to) an element of TABLE.\n\ | |
695 | If it is also not t, Return does not exit if it does non-null completion.\n\ | |
696 | If INITIAL-INPUT is non-nil, insert it in the minibuffer initially.\n\ | |
697 | Case is ignored if ambient value of `completion-ignore-case' is non-nil.\n\ | |
698 | If BACKUP-N is specified, point should be placed that many spaces from\n\ | |
699 | the end of the buffer. This is useful when providing default values,\n\ | |
700 | because you can put point before the last component of a filename or any\n\ | |
701 | other component that is likely to be deleted.") | |
702 | (prompt, table, pred, require_match, init, backup_n) | |
703 | Lisp_Object prompt, table, pred, require_match, init, backup_n; | |
704 | { | |
705 | Lisp_Object val; | |
706 | int count = specpdl_ptr - specpdl; | |
707 | specbind (Qminibuffer_completion_table, table); | |
708 | specbind (Qminibuffer_completion_predicate, pred); | |
709 | specbind (Qminibuffer_completion_confirm, | |
710 | EQ (require_match, Qt) ? Qnil : Qt); | |
711 | last_exact_completion = Qnil; | |
712 | val = read_minibuf (NULL (require_match) | |
713 | ? Vminibuffer_local_completion_map | |
714 | : Vminibuffer_local_must_match_map, | |
715 | init, prompt, backup_n, 0); | |
716 | return unbind_to (count, val); | |
717 | } | |
718 | \f | |
719 | /* Temporarily display the string M at the end of the current | |
720 | minibuffer contents. This is used to display things like | |
721 | "[No Match]" when the user requests a completion for a prefix | |
722 | that has no possible completions, and other quick, unobtrusive | |
723 | messages. */ | |
724 | ||
725 | temp_echo_area_glyphs (m) | |
726 | char *m; | |
727 | { | |
728 | /* It's not very modular to do things this way, but then it seems | |
729 | to me that the whole echo_area_glyphs thing is a hack anyway. */ | |
730 | extern char *previous_echo_glyphs; | |
731 | ||
732 | int osize = ZV; | |
733 | Lisp_Object oinhibit; | |
734 | oinhibit = Vinhibit_quit; | |
735 | ||
736 | /* Clear out any old echo-area message to make way for our new | |
737 | thing. */ | |
738 | echo_area_glyphs = previous_echo_glyphs = 0; | |
739 | ||
740 | SET_PT (osize); | |
741 | insert_string (m); | |
742 | SET_PT (osize); | |
743 | Vinhibit_quit = Qt; | |
744 | Fsit_for (make_number (2), Qnil, Qnil); | |
745 | del_range (point, ZV); | |
746 | if (!NULL (Vquit_flag)) | |
747 | { | |
748 | Vquit_flag = Qnil; | |
749 | unread_command_char = Ctl ('g'); | |
750 | } | |
751 | Vinhibit_quit = oinhibit; | |
752 | } | |
753 | ||
754 | Lisp_Object Fminibuffer_completion_help (); | |
755 | ||
756 | /* returns: | |
757 | * 0 no possible completion | |
758 | * 1 was already an exact and unique completion | |
759 | * 3 was already an exact completion | |
760 | * 4 completed to an exact completion | |
761 | * 5 some completion happened | |
762 | * 6 no completion happened | |
763 | */ | |
764 | int | |
765 | do_completion () | |
766 | { | |
767 | Lisp_Object completion, tem; | |
768 | int completedp; | |
769 | Lisp_Object last; | |
770 | ||
771 | completion = Ftry_completion (Fbuffer_string (), Vminibuffer_completion_table, | |
772 | Vminibuffer_completion_predicate); | |
773 | last = last_exact_completion; | |
774 | last_exact_completion = Qnil; | |
775 | ||
776 | if (NULL (completion)) | |
777 | { | |
778 | bitch_at_user (); | |
779 | temp_echo_area_glyphs (" [No match]"); | |
780 | return 0; | |
781 | } | |
782 | ||
783 | if (EQ (completion, Qt)) /* exact and unique match */ | |
784 | return 1; | |
785 | ||
786 | /* compiler bug */ | |
787 | tem = Fstring_equal (completion, Fbuffer_string()); | |
788 | if (completedp = NULL (tem)) | |
789 | { | |
790 | Ferase_buffer (); /* Some completion happened */ | |
791 | Finsert (1, &completion); | |
792 | } | |
793 | ||
794 | /* It did find a match. Do we match some possibility exactly now? */ | |
795 | if (CONSP (Vminibuffer_completion_table) | |
796 | || NULL (Vminibuffer_completion_table)) | |
797 | tem = Fassoc (Fbuffer_string (), Vminibuffer_completion_table); | |
798 | else if (XTYPE (Vminibuffer_completion_table) == Lisp_Vector) | |
799 | { | |
800 | /* the primitive used by Fintern_soft */ | |
801 | extern Lisp_Object oblookup (); | |
802 | ||
803 | tem = Fbuffer_string (); | |
804 | /* Bypass intern-soft as that loses for nil */ | |
805 | tem = oblookup (Vminibuffer_completion_table, | |
806 | XSTRING (tem)->data, XSTRING (tem)->size); | |
807 | if (XTYPE (tem) != Lisp_Symbol) | |
808 | tem = Qnil; | |
809 | else if (!NULL (Vminibuffer_completion_predicate)) | |
810 | tem = call1 (Vminibuffer_completion_predicate, tem); | |
811 | else | |
812 | tem = Qt; | |
813 | } | |
814 | else | |
815 | tem = call3 (Vminibuffer_completion_table, | |
816 | Fbuffer_string (), | |
817 | Vminibuffer_completion_predicate, | |
818 | Qlambda); | |
819 | ||
820 | if (NULL (tem)) | |
821 | { /* not an exact match */ | |
822 | if (completedp) | |
823 | return 5; | |
824 | else if (auto_help) | |
825 | Fminibuffer_completion_help (); | |
826 | else | |
827 | temp_echo_area_glyphs (" [Next char not unique]"); | |
828 | return 6; | |
829 | } | |
830 | else if (completedp) | |
831 | return 4; | |
832 | /* If the last exact completion and this one were the same, | |
833 | it means we've already given a "Complete but not unique" | |
834 | message and the user's hit TAB again, so no we give him help. */ | |
835 | last_exact_completion = completion; | |
836 | if (!NULL (last)) | |
837 | { | |
838 | tem = Fbuffer_string (); | |
839 | if (!NULL (Fequal (tem, last))) | |
840 | Fminibuffer_completion_help (); | |
841 | } | |
842 | return 3; | |
843 | ||
844 | } | |
845 | ||
846 | ||
847 | DEFUN ("minibuffer-complete", Fminibuffer_complete, Sminibuffer_complete, 0, 0, "", | |
848 | "Complete the minibuffer contents as far as possible.") | |
849 | () | |
850 | { | |
851 | register int i = do_completion (); | |
852 | switch (i) | |
853 | { | |
854 | case 0: | |
855 | return Qnil; | |
856 | ||
857 | case 1: | |
858 | temp_echo_area_glyphs (" [Sole completion]"); | |
859 | break; | |
860 | ||
861 | case 3: | |
862 | temp_echo_area_glyphs (" [Complete, but not unique]"); | |
863 | break; | |
864 | } | |
865 | ||
866 | return Qt; | |
867 | } | |
868 | ||
869 | DEFUN ("minibuffer-complete-and-exit", Fminibuffer_complete_and_exit, | |
870 | Sminibuffer_complete_and_exit, 0, 0, "", | |
871 | "Complete the minibuffer contents, and maybe exit.\n\ | |
872 | Exit if the name is valid with no completion needed.\n\ | |
873 | If name was completed to a valid match,\n\ | |
874 | a repetition of this command will exit.") | |
875 | () | |
876 | { | |
877 | register int i; | |
878 | ||
879 | /* Allow user to specify null string */ | |
880 | if (BEGV == ZV) | |
881 | goto exit; | |
882 | ||
883 | i = do_completion (); | |
884 | switch (i) | |
885 | { | |
886 | case 1: | |
887 | case 3: | |
888 | goto exit; | |
889 | ||
890 | case 4: | |
891 | if (!NULL (Vminibuffer_completion_confirm)) | |
892 | { | |
893 | temp_echo_area_glyphs (" [Confirm]"); | |
894 | return Qnil; | |
895 | } | |
896 | else | |
897 | goto exit; | |
898 | ||
899 | default: | |
900 | return Qnil; | |
901 | } | |
902 | exit: | |
903 | Fthrow (Qexit, Qnil); | |
904 | /* NOTREACHED */ | |
905 | } | |
906 | ||
907 | DEFUN ("minibuffer-complete-word", Fminibuffer_complete_word, Sminibuffer_complete_word, | |
908 | 0, 0, "", | |
909 | "Complete the minibuffer contents at most a single word.\n\ | |
910 | After one word is completed as much as possible, a space or hyphen\n\ | |
911 | is added, provided that matches some possible completion.") | |
912 | () | |
913 | { | |
914 | Lisp_Object completion, tem; | |
915 | register int i; | |
916 | register unsigned char *completion_string; | |
917 | /* We keep calling Fbuffer_string | |
918 | rather than arrange for GC to hold onto a pointer to | |
919 | one of the strings thus made. */ | |
920 | ||
921 | completion = Ftry_completion (Fbuffer_string (), | |
922 | Vminibuffer_completion_table, | |
923 | Vminibuffer_completion_predicate); | |
924 | if (NULL (completion)) | |
925 | { | |
926 | bitch_at_user (); | |
927 | temp_echo_area_glyphs (" [No match]"); | |
928 | return Qnil; | |
929 | } | |
930 | if (EQ (completion, Qt)) | |
931 | return Qnil; | |
932 | ||
933 | #if 0 /* How the below code used to look, for reference */ | |
934 | tem = Fbuffer_string (); | |
935 | b = XSTRING (tem)->data; | |
936 | i = ZV - 1 - XSTRING (completion)->size; | |
937 | p = XSTRING (completion)->data; | |
938 | if (i > 0 || | |
939 | 0 <= scmp (b, p, ZV - 1)) | |
940 | { | |
941 | i = 1; | |
942 | /* Set buffer to longest match of buffer tail and completion head. */ | |
943 | while (0 <= scmp (b + i, p, ZV - 1 - i)) | |
944 | i++; | |
945 | del_range (1, i + 1); | |
946 | SET_PT (ZV); | |
947 | } | |
948 | #else /* Rewritten code */ | |
949 | { | |
950 | register unsigned char *buffer_string; | |
951 | int buffer_length, completion_length; | |
952 | ||
953 | tem = Fbuffer_string (); | |
954 | buffer_string = XSTRING (tem)->data; | |
955 | completion_string = XSTRING (completion)->data; | |
956 | buffer_length = XSTRING (tem)->size; /* ie ZV - BEGV */ | |
957 | completion_length = XSTRING (completion)->size; | |
958 | i = buffer_length - completion_length; | |
959 | /* Mly: I don't understand what this is supposed to do AT ALL */ | |
960 | if (i > 0 || | |
961 | 0 <= scmp (buffer_string, completion_string, buffer_length)) | |
962 | { | |
963 | /* Set buffer to longest match of buffer tail and completion head. */ | |
964 | if (i <= 0) i = 1; | |
965 | buffer_string += i; | |
966 | buffer_length -= i; | |
967 | while (0 <= scmp (buffer_string++, completion_string, buffer_length--)) | |
968 | i++; | |
969 | del_range (1, i + 1); | |
970 | SET_PT (ZV); | |
971 | } | |
972 | } | |
973 | #endif /* Rewritten code */ | |
974 | i = ZV - BEGV; | |
975 | ||
976 | /* If completion finds next char not unique, | |
977 | consider adding a space or a hyphen */ | |
978 | if (i == XSTRING (completion)->size) | |
979 | { | |
980 | tem = Ftry_completion (concat2 (Fbuffer_string (), build_string (" ")), | |
981 | Vminibuffer_completion_table, | |
982 | Vminibuffer_completion_predicate); | |
983 | if (XTYPE (tem) == Lisp_String) | |
984 | completion = tem; | |
985 | else | |
986 | { | |
987 | tem = Ftry_completion (concat2 (Fbuffer_string (), build_string ("-")), | |
988 | Vminibuffer_completion_table, | |
989 | Vminibuffer_completion_predicate); | |
990 | if (XTYPE (tem) == Lisp_String) | |
991 | completion = tem; | |
992 | } | |
993 | } | |
994 | ||
995 | /* Now find first word-break in the stuff found by completion. | |
996 | i gets index in string of where to stop completing. */ | |
997 | completion_string = XSTRING (completion)->data; | |
998 | ||
999 | for (; i < XSTRING (completion)->size; i++) | |
1000 | if (SYNTAX (completion_string[i]) != Sword) break; | |
1001 | if (i < XSTRING (completion)->size) | |
1002 | i = i + 1; | |
1003 | ||
1004 | /* If got no characters, print help for user. */ | |
1005 | ||
1006 | if (i == ZV - BEGV) | |
1007 | { | |
1008 | if (auto_help) | |
1009 | Fminibuffer_completion_help (); | |
1010 | return Qnil; | |
1011 | } | |
1012 | ||
1013 | /* Otherwise insert in minibuffer the chars we got */ | |
1014 | ||
1015 | Ferase_buffer (); | |
1016 | insert_from_string (completion, 0, i); | |
1017 | return Qt; | |
1018 | } | |
1019 | \f | |
1020 | DEFUN ("display-completion-list", Fdisplay_completion_list, Sdisplay_completion_list, | |
1021 | 1, 1, 0, | |
1022 | "Display in a buffer the list of completions, COMPLETIONS.\n\ | |
1023 | Each element may be just a symbol or string\n\ | |
1024 | or may be a list of two strings to be printed as if concatenated.") | |
1025 | (completions) | |
1026 | Lisp_Object completions; | |
1027 | { | |
1028 | register Lisp_Object tail, elt; | |
1029 | register int i; | |
1030 | struct buffer *old = current_buffer; | |
1031 | /* No GCPRO needed, since (when it matters) every variable | |
1032 | points to a non-string that is pointed to by COMPLETIONS. */ | |
1033 | ||
1034 | set_buffer_internal (XBUFFER (Vstandard_output)); | |
1035 | ||
1036 | if (NULL (completions)) | |
1037 | insert_string ("There are no possible completions of what you have typed."); | |
1038 | else | |
1039 | { | |
1040 | insert_string ("Possible completions are:"); | |
1041 | for (tail = completions, i = 0; !NULL (tail); tail = Fcdr (tail), i++) | |
1042 | { | |
1043 | /* this needs fixing for the case of long completions | |
1044 | and/or narrow windows */ | |
1045 | /* Sadly, the window it will appear in is not known | |
1046 | until after the text has been made. */ | |
1047 | if (i & 1) | |
1048 | Findent_to (make_number (35), make_number (1)); | |
1049 | else | |
1050 | Fterpri (Qnil); | |
1051 | elt = Fcar (tail); | |
1052 | if (CONSP (elt)) | |
1053 | { | |
1054 | Fprinc (Fcar (elt), Qnil); | |
1055 | Fprinc (Fcar (Fcdr (elt)), Qnil); | |
1056 | } | |
1057 | else | |
1058 | Fprinc (elt, Qnil); | |
1059 | } | |
1060 | } | |
1061 | set_buffer_internal (old); | |
1062 | return Qnil; | |
1063 | } | |
1064 | ||
1065 | DEFUN ("minibuffer-completion-help", Fminibuffer_completion_help, Sminibuffer_completion_help, | |
1066 | 0, 0, "", | |
1067 | "Display a list of possible completions of the current minibuffer contents.") | |
1068 | () | |
1069 | { | |
1070 | Lisp_Object completions; | |
1071 | ||
1072 | message ("Making completion list..."); | |
1073 | completions = Fall_completions (Fbuffer_string (), | |
1074 | Vminibuffer_completion_table, | |
1075 | Vminibuffer_completion_predicate); | |
1076 | echo_area_glyphs = 0; | |
1077 | ||
1078 | if (NULL (completions)) | |
1079 | { | |
1080 | bitch_at_user (); | |
1081 | temp_echo_area_glyphs (" [No completions]"); | |
1082 | } | |
1083 | else | |
1084 | internal_with_output_to_temp_buffer ("*Completions*", | |
1085 | Fdisplay_completion_list, | |
1086 | Fsort (completions, Qstring_lessp)); | |
1087 | return Qnil; | |
1088 | } | |
1089 | \f | |
1090 | DEFUN ("self-insert-and-exit", Fself_insert_and_exit, Sself_insert_and_exit, 0, 0, "", | |
1091 | "Terminate minibuffer input.") | |
1092 | () | |
1093 | { | |
1094 | if (XTYPE (last_command_char) == Lisp_Int) | |
1095 | internal_self_insert (last_command_char, 0); | |
1096 | else | |
1097 | bitch_at_user (); | |
1098 | ||
1099 | Fthrow (Qexit, Qnil); | |
1100 | } | |
1101 | ||
1102 | DEFUN ("exit-minibuffer", Fexit_minibuffer, Sexit_minibuffer, 0, 0, "", | |
1103 | "Terminate this minibuffer argument.") | |
1104 | () | |
1105 | { | |
1106 | Fthrow (Qexit, Qnil); | |
1107 | } | |
1108 | ||
1109 | DEFUN ("minibuffer-depth", Fminibuffer_depth, Sminibuffer_depth, 0, 0, 0, | |
1110 | "Return current depth of activations of minibuffer, a nonnegative integer.") | |
1111 | () | |
1112 | { | |
1113 | return make_number (minibuf_level); | |
1114 | } | |
1115 | ||
1116 | \f | |
1117 | init_minibuf_once () | |
1118 | { | |
1119 | Vminibuffer_list = Qnil; | |
1120 | staticpro (&Vminibuffer_list); | |
1121 | } | |
1122 | ||
1123 | syms_of_minibuf () | |
1124 | { | |
1125 | minibuf_level = 0; | |
1126 | minibuf_prompt = 0; | |
1127 | minibuf_save_vector_size = 5; | |
1128 | minibuf_save_vector = (struct minibuf_save_data *) malloc (5 * sizeof (struct minibuf_save_data)); | |
1129 | ||
1130 | Qminibuffer_completion_table = intern ("minibuffer-completion-table"); | |
1131 | staticpro (&Qminibuffer_completion_table); | |
1132 | ||
1133 | Qminibuffer_completion_confirm = intern ("minibuffer-completion-confirm"); | |
1134 | staticpro (&Qminibuffer_completion_confirm); | |
1135 | ||
1136 | Qminibuffer_completion_predicate = intern ("minibuffer-completion-predicate"); | |
1137 | staticpro (&Qminibuffer_completion_predicate); | |
1138 | ||
1139 | staticpro (&last_minibuf_string); | |
1140 | last_minibuf_string = Qnil; | |
1141 | ||
1142 | Quser_variable_p = intern ("user-variable-p"); | |
1143 | staticpro (&Quser_variable_p); | |
1144 | ||
1145 | ||
1146 | ||
1147 | DEFVAR_BOOL ("completion-auto-help", &auto_help, | |
1148 | "*Non-nil means automatically provide help for invalid completion input."); | |
1149 | auto_help = 1; | |
1150 | ||
1151 | DEFVAR_BOOL ("completion-ignore-case", &completion_ignore_case, | |
1152 | "Non-nil means don't consider case significant in completion."); | |
1153 | completion_ignore_case = 0; | |
1154 | ||
1155 | DEFVAR_BOOL ("enable-recursive-minibuffers", &enable_recursive_minibuffers, | |
1156 | "*Non-nil means to allow minibuffer commands while in the minibuffer.\n\ | |
1157 | More precisely, this variable makes a difference when the minibuffer window\n\ | |
1158 | is the selected window. If you are in some other window, minibuffer commands\n\ | |
1159 | are allowed even if a minibuffer is active."); | |
1160 | enable_recursive_minibuffers = 0; | |
1161 | ||
1162 | DEFVAR_LISP ("minibuffer-completion-table", &Vminibuffer_completion_table, | |
1163 | "Alist or obarray used for completion in the minibuffer.\n\ | |
1164 | This becomes the ALIST argument to `try-completion' and `all-completion'.\n\ | |
1165 | \n\ | |
1166 | The value may alternatively be a function, which is given three arguments:\n\ | |
1167 | STRING, the current buffer contents;\n\ | |
1168 | PREDICATE, the predicate for filtering possible matches;\n\ | |
1169 | CODE, which says what kind of things to do.\n\ | |
1170 | CODE can be nil, t or `lambda'.\n\ | |
1171 | nil means to return the best completion of STRING, or nil if there is none.\n\ | |
1172 | t means to return a list of all possible completions of STRING.\n\ | |
1173 | `lambda' means to return t if STRING is a valid completion as it stands."); | |
1174 | Vminibuffer_completion_table = Qnil; | |
1175 | ||
1176 | DEFVAR_LISP ("minibuffer-completion-predicate", &Vminibuffer_completion_predicate, | |
1177 | "Within call to `completing-read', this holds the PREDICATE argument."); | |
1178 | Vminibuffer_completion_predicate = Qnil; | |
1179 | ||
1180 | DEFVAR_LISP ("minibuffer-completion-confirm", &Vminibuffer_completion_confirm, | |
1181 | "Non-nil => demand confirmation of completion before exiting minibuffer."); | |
1182 | Vminibuffer_completion_confirm = Qnil; | |
1183 | ||
1184 | DEFVAR_LISP ("minibuffer-help-form", &Vminibuffer_help_form, | |
1185 | "Value that `help-form' takes on inside the minibuffer."); | |
1186 | Vminibuffer_help_form = Qnil; | |
1187 | ||
1188 | defsubr (&Sread_from_minibuffer); | |
1189 | defsubr (&Seval_minibuffer); | |
1190 | defsubr (&Sread_minibuffer); | |
1191 | defsubr (&Sread_string); | |
1192 | defsubr (&Sread_command); | |
1193 | defsubr (&Sread_variable); | |
1194 | defsubr (&Sread_buffer); | |
1195 | defsubr (&Sread_no_blanks_input); | |
1196 | defsubr (&Sminibuffer_depth); | |
1197 | ||
1198 | defsubr (&Stry_completion); | |
1199 | defsubr (&Sall_completions); | |
1200 | defsubr (&Scompleting_read); | |
1201 | defsubr (&Sminibuffer_complete); | |
1202 | defsubr (&Sminibuffer_complete_word); | |
1203 | defsubr (&Sminibuffer_complete_and_exit); | |
1204 | defsubr (&Sdisplay_completion_list); | |
1205 | defsubr (&Sminibuffer_completion_help); | |
1206 | ||
1207 | defsubr (&Sself_insert_and_exit); | |
1208 | defsubr (&Sexit_minibuffer); | |
1209 | ||
1210 | } | |
1211 | ||
1212 | keys_of_minibuf () | |
1213 | { | |
1214 | initial_define_key (Vminibuffer_local_map, Ctl ('g'), | |
1215 | "abort-recursive-edit"); | |
1216 | initial_define_key (Vminibuffer_local_map, Ctl ('m'), | |
1217 | "exit-minibuffer"); | |
1218 | initial_define_key (Vminibuffer_local_map, Ctl ('j'), | |
1219 | "exit-minibuffer"); | |
1220 | ||
1221 | initial_define_key (Vminibuffer_local_ns_map, Ctl ('g'), | |
1222 | "abort-recursive-edit"); | |
1223 | initial_define_key (Vminibuffer_local_ns_map, Ctl ('m'), | |
1224 | "exit-minibuffer"); | |
1225 | initial_define_key (Vminibuffer_local_ns_map, Ctl ('j'), | |
1226 | "exit-minibuffer"); | |
1227 | ||
1228 | initial_define_key (Vminibuffer_local_ns_map, ' ', | |
1229 | "exit-minibuffer"); | |
1230 | initial_define_key (Vminibuffer_local_ns_map, '\t', | |
1231 | "exit-minibuffer"); | |
1232 | initial_define_key (Vminibuffer_local_ns_map, '?', | |
1233 | "self-insert-and-exit"); | |
1234 | ||
1235 | initial_define_key (Vminibuffer_local_completion_map, Ctl ('g'), | |
1236 | "abort-recursive-edit"); | |
1237 | initial_define_key (Vminibuffer_local_completion_map, Ctl ('m'), | |
1238 | "exit-minibuffer"); | |
1239 | initial_define_key (Vminibuffer_local_completion_map, Ctl ('j'), | |
1240 | "exit-minibuffer"); | |
1241 | ||
1242 | initial_define_key (Vminibuffer_local_completion_map, '\t', | |
1243 | "minibuffer-complete"); | |
1244 | initial_define_key (Vminibuffer_local_completion_map, ' ', | |
1245 | "minibuffer-complete-word"); | |
1246 | initial_define_key (Vminibuffer_local_completion_map, '?', | |
1247 | "minibuffer-completion-help"); | |
1248 | ||
1249 | initial_define_key (Vminibuffer_local_must_match_map, Ctl ('g'), | |
1250 | "abort-recursive-edit"); | |
1251 | initial_define_key (Vminibuffer_local_must_match_map, Ctl ('m'), | |
1252 | "minibuffer-complete-and-exit"); | |
1253 | initial_define_key (Vminibuffer_local_must_match_map, Ctl ('j'), | |
1254 | "minibuffer-complete-and-exit"); | |
1255 | initial_define_key (Vminibuffer_local_must_match_map, '\t', | |
1256 | "minibuffer-complete"); | |
1257 | initial_define_key (Vminibuffer_local_must_match_map, ' ', | |
1258 | "minibuffer-complete-word"); | |
1259 | initial_define_key (Vminibuffer_local_must_match_map, '?', | |
1260 | "minibuffer-completion-help"); | |
1261 | } |