|
0
|
1 /* Minibuffer input and completion.
|
|
|
2 Copyright (C) 1985, 1986, 1992-1995 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Mule 2.0, FSF 19.28. Mule-ized except as noted.
|
|
|
23 Substantially different from FSF. */
|
|
|
24
|
|
44
|
25 /* #### dmoore - All sorts of things in here can call lisp, like message.
|
|
|
26 Track all this stuff. */
|
|
|
27
|
|
0
|
28 #include <config.h>
|
|
|
29 #include "lisp.h"
|
|
|
30
|
|
|
31 #include "buffer.h"
|
|
|
32 #include "commands.h"
|
|
|
33 #include "console-stream.h"
|
|
|
34 #include "events.h"
|
|
|
35 #include "frame.h"
|
|
|
36 #include "insdel.h"
|
|
|
37 #include "redisplay.h"
|
|
|
38 #include "window.h"
|
|
|
39
|
|
|
40 /* Depth in minibuffer invocations. */
|
|
|
41 int minibuf_level;
|
|
|
42
|
|
|
43 Lisp_Object Qcompletion_ignore_case;
|
|
|
44
|
|
|
45 /* Nonzero means completion ignores case. */
|
|
|
46 int completion_ignore_case;
|
|
|
47
|
|
|
48 /* List of regexps that should restrict possible completions. */
|
|
|
49 Lisp_Object Vcompletion_regexp_list;
|
|
|
50
|
|
|
51 /* The echo area buffer. */
|
|
|
52 Lisp_Object Vecho_area_buffer;
|
|
|
53
|
|
|
54 /* Prompt to display in front of the minibuffer contents */
|
|
|
55 Lisp_Object Vminibuf_prompt;
|
|
|
56
|
|
|
57 /* Hook to run just after entry to minibuffer. */
|
|
|
58 Lisp_Object Qminibuffer_setup_hook, Vminibuffer_setup_hook;
|
|
|
59
|
|
|
60 Lisp_Object Qappend_message, Qcurrent_message_label,
|
|
|
61 Qclear_message, Qdisplay_message;
|
|
|
62
|
|
|
63
|
|
20
|
64 DEFUN ("minibuffer-depth", Fminibuffer_depth, 0, 0, 0, /*
|
|
0
|
65 Return current depth of activations of minibuffer, a nonnegative integer.
|
|
20
|
66 */
|
|
|
67 ())
|
|
0
|
68 {
|
|
|
69 return make_int (minibuf_level);
|
|
|
70 }
|
|
|
71
|
|
|
72 /* The default buffer to use as the window-buffer of minibuffer windows */
|
|
|
73 /* Note there is special code in kill-buffer to make this unkillable */
|
|
|
74 Lisp_Object Vminibuffer_zero;
|
|
|
75
|
|
|
76
|
|
|
77 /* Actual minibuffer invocation. */
|
|
|
78
|
|
|
79 static Lisp_Object
|
|
|
80 read_minibuffer_internal_unwind (Lisp_Object unwind_data)
|
|
|
81 {
|
|
|
82 Lisp_Object frame;
|
|
|
83 XWINDOW (minibuf_window)->last_modified[CURRENT_DISP] = Qzero;
|
|
|
84 XWINDOW (minibuf_window)->last_modified[DESIRED_DISP] = Qzero;
|
|
|
85 XWINDOW (minibuf_window)->last_modified[CMOTION_DISP] = Qzero;
|
|
|
86 XWINDOW (minibuf_window)->last_facechange[CURRENT_DISP] = Qzero;
|
|
|
87 XWINDOW (minibuf_window)->last_facechange[DESIRED_DISP] = Qzero;
|
|
|
88 XWINDOW (minibuf_window)->last_facechange[CMOTION_DISP] = Qzero;
|
|
|
89 Vminibuf_prompt = Felt (unwind_data, Qzero);
|
|
|
90 minibuf_level = XINT (Felt (unwind_data, make_int (1)));
|
|
|
91 while (CONSP (unwind_data))
|
|
|
92 {
|
|
|
93 Lisp_Object victim = unwind_data;
|
|
|
94 unwind_data = XCDR (unwind_data);
|
|
|
95 free_cons (XCONS (victim));
|
|
|
96 }
|
|
|
97
|
|
|
98 /* If cursor is on the minibuffer line,
|
|
|
99 show the user we have exited by putting it in column 0. */
|
|
|
100 frame = Fselected_frame (Qnil);
|
|
|
101 if (!noninteractive
|
|
|
102 && !NILP (frame)
|
|
|
103 && !NILP (XFRAME (frame)->minibuffer_window))
|
|
|
104 {
|
|
|
105 struct window *w = XWINDOW (XFRAME (frame)->minibuffer_window);
|
|
|
106 redisplay_move_cursor (w, 0, 0);
|
|
|
107 }
|
|
|
108
|
|
|
109 return Qnil;
|
|
|
110 }
|
|
|
111
|
|
20
|
112 DEFUN ("read-minibuffer-internal", Fread_minibuffer_internal, 1, 1, 0, /*
|
|
0
|
113 Lowest-level interface to minibuffers. Don't call this.
|
|
20
|
114 */
|
|
|
115 (prompt))
|
|
0
|
116 {
|
|
|
117 /* This function can GC */
|
|
|
118 int speccount = specpdl_depth ();
|
|
|
119 Lisp_Object val;
|
|
|
120
|
|
|
121 CHECK_STRING (prompt);
|
|
|
122
|
|
|
123 single_console_state ();
|
|
|
124
|
|
|
125 record_unwind_protect (read_minibuffer_internal_unwind,
|
|
|
126 noseeum_cons
|
|
|
127 (Vminibuf_prompt,
|
|
|
128 noseeum_cons (make_int (minibuf_level), Qnil)));
|
|
|
129 Vminibuf_prompt = LISP_GETTEXT (prompt);
|
|
|
130
|
|
|
131 /* NOTE: Here (or somewhere around here), in FSFmacs 19.30,
|
|
|
132 choose_minibuf_frame() is called. This is the only
|
|
|
133 place in FSFmacs that it's called any more -- there's
|
|
|
134 also a call in xterm.c, but commented out, and 19.28
|
|
|
135 had the calls in different places.
|
|
|
136
|
|
|
137 choose_minibuf_frame() does the following:
|
|
|
138
|
|
|
139 if (!EQ (minibuf_window, selected_frame()->minibuffer_window))
|
|
|
140 {
|
|
|
141 Fset_window_buffer (selected_frame()->minibuffer_window,
|
|
|
142 XWINDOW (minibuf_window)->buffer);
|
|
|
143 minibuf_window = selected_frame()->minibuffer_window;
|
|
|
144 }
|
|
|
145
|
|
|
146 #### Note that we don't do the set-window-buffer. This call is
|
|
|
147 similar, but not identical, to a set-window-buffer call made
|
|
|
148 in `read-from-minibuffer' in minibuf.el. I hope it's close
|
|
|
149 enough, because minibuf_window isn't really exported to Lisp.
|
|
|
150
|
|
|
151 The comment above choose_minibuf_frame() reads:
|
|
|
152
|
|
|
153 Put minibuf on currently selected frame's minibuffer.
|
|
|
154 We do this whenever the user starts a new minibuffer
|
|
|
155 or when a minibuffer exits. */
|
|
|
156
|
|
|
157 minibuf_window = FRAME_MINIBUF_WINDOW (selected_frame ());
|
|
|
158
|
|
|
159 run_hook (Qminibuffer_setup_hook);
|
|
|
160
|
|
|
161 minibuf_level++;
|
|
|
162 clear_echo_area (selected_frame (), Qnil, 0);
|
|
|
163
|
|
|
164 val = call_command_loop (Qt);
|
|
|
165
|
|
|
166 return (unbind_to (speccount, val));
|
|
|
167 }
|
|
|
168
|
|
|
169
|
|
|
170
|
|
|
171 /* Completion hair */
|
|
|
172
|
|
|
173 /* Compare exactly LEN chars of strings at S1 and S2,
|
|
|
174 ignoring case if appropriate.
|
|
|
175 Return -1 if strings match,
|
|
|
176 else number of chars that match at the beginning. */
|
|
|
177
|
|
|
178 /* Note that this function works in Charcounts, unlike most functions.
|
|
|
179 This is necessary for many reasons, one of which is that two
|
|
|
180 strings may match even if they have different numbers of bytes,
|
|
|
181 if IGNORE_CASE is true. */
|
|
|
182
|
|
|
183 Charcount
|
|
|
184 scmp_1 (CONST Bufbyte *s1, CONST Bufbyte *s2, Charcount len,
|
|
|
185 int ignore_case)
|
|
|
186 {
|
|
|
187 Charcount l = len;
|
|
|
188
|
|
|
189 if (ignore_case)
|
|
|
190 {
|
|
|
191 while (l)
|
|
|
192 {
|
|
|
193 Bufbyte c1 = DOWNCASE (current_buffer, charptr_emchar (s1));
|
|
|
194 Bufbyte c2 = DOWNCASE (current_buffer, charptr_emchar (s2));
|
|
|
195
|
|
|
196 if (c1 == c2)
|
|
|
197 {
|
|
|
198 l--;
|
|
|
199 INC_CHARPTR (s1);
|
|
|
200 INC_CHARPTR (s2);
|
|
|
201 }
|
|
|
202 else
|
|
|
203 break;
|
|
|
204 }
|
|
|
205 }
|
|
|
206 else
|
|
|
207 {
|
|
|
208 while (l && charptr_emchar (s1) == charptr_emchar (s2))
|
|
|
209 {
|
|
|
210 l--;
|
|
|
211 INC_CHARPTR (s1);
|
|
|
212 INC_CHARPTR (s2);
|
|
|
213 }
|
|
|
214 }
|
|
|
215
|
|
|
216 if (l == 0)
|
|
|
217 return -1;
|
|
|
218 else return len - l;
|
|
|
219 }
|
|
|
220
|
|
|
221
|
|
|
222 int
|
|
|
223 regexp_ignore_completion_p (CONST Bufbyte *nonreloc,
|
|
|
224 Lisp_Object reloc, Bytecount offset,
|
|
|
225 Bytecount length)
|
|
|
226 {
|
|
|
227 /* Ignore this element if it fails to match all the regexps. */
|
|
|
228 if (!NILP (Vcompletion_regexp_list))
|
|
|
229 {
|
|
|
230 Lisp_Object regexps;
|
|
|
231 for (regexps = Vcompletion_regexp_list;
|
|
|
232 CONSP (regexps);
|
|
|
233 regexps = XCDR (regexps))
|
|
|
234 {
|
|
|
235 Lisp_Object re = XCAR (regexps);
|
|
|
236 if (STRINGP (re)
|
|
|
237 && (fast_string_match (re, nonreloc, reloc, offset,
|
|
32
|
238 length, 0, ERROR_ME, 0) < 0))
|
|
0
|
239 return (1);
|
|
|
240 }
|
|
|
241 }
|
|
|
242 return (0);
|
|
|
243 }
|
|
|
244
|
|
|
245
|
|
|
246 /* Callers should GCPRO, since this may call eval */
|
|
|
247 static int
|
|
|
248 ignore_completion_p (Lisp_Object completion_string,
|
|
|
249 Lisp_Object pred, Lisp_Object completion)
|
|
|
250 {
|
|
|
251 if (regexp_ignore_completion_p (0, completion_string, 0, -1))
|
|
|
252 return (1);
|
|
|
253
|
|
|
254 /* Ignore this element if there is a predicate
|
|
|
255 and the predicate doesn't like it. */
|
|
|
256 if (!NILP (pred))
|
|
|
257 {
|
|
|
258 Lisp_Object tem;
|
|
|
259 if (EQ (pred, Qcommandp))
|
|
|
260 tem = Fcommandp (completion);
|
|
|
261 else
|
|
|
262 tem = call1 (pred, completion);
|
|
|
263 if (NILP (tem))
|
|
|
264 return (1);
|
|
|
265 }
|
|
|
266 return (0);
|
|
|
267 }
|
|
|
268
|
|
|
269
|
|
|
270
|
|
|
271
|
|
20
|
272 DEFUN ("try-completion", Ftry_completion, 2, 3, 0, /*
|
|
0
|
273 Return common substring of all completions of STRING in ALIST.
|
|
|
274 Each car of each element of ALIST is tested to see if it begins with STRING.
|
|
|
275 All that match are compared together; the longest initial sequence
|
|
|
276 common to all matches is returned as a string.
|
|
|
277 If there is no match at all, nil is returned.
|
|
|
278 For an exact match, t is returned.
|
|
|
279
|
|
|
280 ALIST can be an obarray instead of an alist.
|
|
|
281 Then the print names of all symbols in the obarray are the possible matches.
|
|
|
282
|
|
|
283 ALIST can also be a function to do the completion itself.
|
|
|
284 It receives three arguments: the values STRING, PREDICATE and nil.
|
|
|
285 Whatever it returns becomes the value of `try-completion'.
|
|
|
286
|
|
|
287 If optional third argument PREDICATE is non-nil,
|
|
|
288 it is used to test each possible match.
|
|
|
289 The match is a candidate only if PREDICATE returns non-nil.
|
|
|
290 The argument given to PREDICATE is the alist element or the symbol from the obarray.
|
|
20
|
291 */
|
|
|
292 (string, alist, pred))
|
|
0
|
293 {
|
|
|
294 /* This function can GC */
|
|
|
295 Lisp_Object bestmatch, tail;
|
|
|
296 Charcount bestmatchsize = 0;
|
|
|
297 int list;
|
|
|
298 int indice = 0;
|
|
|
299 int obsize = 0;
|
|
|
300 int matchcount = 0;
|
|
|
301 Lisp_Object bucket;
|
|
|
302 Charcount slength, blength;
|
|
|
303
|
|
|
304 CHECK_STRING (string);
|
|
|
305
|
|
|
306 if (CONSP (alist))
|
|
|
307 {
|
|
|
308 Lisp_Object tem = XCAR (alist);
|
|
|
309 if (SYMBOLP (tem)) /* lambda, autoload, etc. Emacs-lisp sucks */
|
|
|
310 return call3 (alist, string, pred, Qnil);
|
|
|
311 else
|
|
|
312 list = 1;
|
|
|
313 }
|
|
|
314 else if (VECTORP (alist))
|
|
|
315 list = 0;
|
|
|
316 else if (NILP (alist))
|
|
|
317 list = 1;
|
|
|
318 else
|
|
|
319 return call3 (alist, string, pred, Qnil);
|
|
|
320
|
|
|
321 bestmatch = Qnil;
|
|
|
322 blength = 0;
|
|
|
323 slength = string_char_length (XSTRING (string));
|
|
|
324
|
|
|
325 /* If ALIST is not a list, set TAIL just for gc pro. */
|
|
|
326 tail = alist;
|
|
|
327 if (!list)
|
|
|
328 {
|
|
|
329 obsize = vector_length (XVECTOR (alist));
|
|
|
330 bucket = vector_data (XVECTOR (alist))[indice];
|
|
|
331 }
|
|
|
332
|
|
|
333 while (1)
|
|
|
334 {
|
|
|
335 /* Get the next element of the alist or obarray. */
|
|
|
336 /* Exit the loop if the elements are all used up. */
|
|
|
337 /* elt gets the alist element or symbol.
|
|
|
338 eltstring gets the name to check as a completion. */
|
|
|
339 Lisp_Object elt;
|
|
|
340 Lisp_Object eltstring;
|
|
|
341
|
|
|
342 if (list)
|
|
|
343 {
|
|
|
344 if (NILP (tail))
|
|
|
345 break;
|
|
|
346 elt = Fcar (tail);
|
|
|
347 eltstring = Fcar (elt);
|
|
|
348 tail = Fcdr (tail);
|
|
|
349 }
|
|
|
350 else
|
|
|
351 {
|
|
|
352 if (!ZEROP (bucket))
|
|
|
353 {
|
|
14
|
354 struct Lisp_Symbol *next;
|
|
|
355 if (!SYMBOLP (bucket)) {
|
|
|
356 signal_simple_error("Bad obarry passed to try-completions",
|
|
|
357 bucket);
|
|
|
358 }
|
|
|
359 next = symbol_next (XSYMBOL (bucket));
|
|
0
|
360 elt = bucket;
|
|
|
361 eltstring = Fsymbol_name (elt);
|
|
|
362 if (next)
|
|
|
363 XSETSYMBOL (bucket, next);
|
|
|
364 else
|
|
|
365 bucket = Qzero;
|
|
|
366 }
|
|
|
367 else if (++indice >= obsize)
|
|
|
368 break;
|
|
|
369 else
|
|
|
370 {
|
|
|
371 bucket = vector_data (XVECTOR (alist))[indice];
|
|
|
372 continue;
|
|
|
373 }
|
|
|
374 }
|
|
|
375
|
|
|
376 /* Is this element a possible completion? */
|
|
|
377
|
|
|
378 if (STRINGP (eltstring))
|
|
|
379 {
|
|
|
380 Charcount eltlength = string_char_length (XSTRING (eltstring));
|
|
|
381 if (slength <= eltlength
|
|
16
|
382 && (0 > scmp (XSTRING_DATA (eltstring),
|
|
|
383 XSTRING_DATA (string),
|
|
0
|
384 slength)))
|
|
|
385 {
|
|
|
386 {
|
|
|
387 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
388 int loser;
|
|
|
389 GCPRO4 (tail, string, eltstring, bestmatch);
|
|
|
390 loser = ignore_completion_p (eltstring, pred, elt);
|
|
|
391 UNGCPRO;
|
|
|
392 if (loser) /* reject this one */
|
|
|
393 continue;
|
|
|
394 }
|
|
|
395
|
|
|
396 /* Update computation of how much all possible
|
|
|
397 completions match */
|
|
|
398
|
|
|
399 matchcount++;
|
|
|
400 if (NILP (bestmatch))
|
|
|
401 {
|
|
|
402 bestmatch = eltstring;
|
|
|
403 blength = eltlength;
|
|
|
404 bestmatchsize = eltlength;
|
|
|
405 }
|
|
|
406 else
|
|
|
407 {
|
|
|
408 Charcount compare = min (bestmatchsize, eltlength);
|
|
|
409 Charcount matchsize =
|
|
16
|
410 scmp (XSTRING_DATA (bestmatch),
|
|
|
411 XSTRING_DATA (eltstring),
|
|
0
|
412 compare);
|
|
|
413 if (matchsize < 0)
|
|
|
414 matchsize = compare;
|
|
|
415 if (completion_ignore_case)
|
|
|
416 {
|
|
|
417 /* If this is an exact match except for case,
|
|
|
418 use it as the best match rather than one that is not
|
|
|
419 an exact match. This way, we get the case pattern
|
|
|
420 of the actual match. */
|
|
|
421 if ((matchsize == eltlength
|
|
|
422 && matchsize < blength)
|
|
|
423 ||
|
|
|
424 /* If there is more than one exact match ignoring
|
|
|
425 case, and one of them is exact including case,
|
|
|
426 prefer that one. */
|
|
|
427 /* If there is no exact match ignoring case,
|
|
|
428 prefer a match that does not change the case
|
|
|
429 of the input. */
|
|
|
430 ((matchsize == eltlength)
|
|
|
431 ==
|
|
|
432 (matchsize == blength)
|
|
16
|
433 && 0 > scmp_1 (XSTRING_DATA (eltstring),
|
|
|
434 XSTRING_DATA (string),
|
|
0
|
435 slength, 0)
|
|
16
|
436 && 0 <= scmp_1 (XSTRING_DATA (bestmatch),
|
|
|
437 XSTRING_DATA (string),
|
|
0
|
438 slength, 0)))
|
|
|
439 {
|
|
|
440 bestmatch = eltstring;
|
|
|
441 blength = eltlength;
|
|
|
442 }
|
|
|
443 }
|
|
|
444 bestmatchsize = matchsize;
|
|
|
445 }
|
|
|
446 }
|
|
|
447 }
|
|
|
448 }
|
|
|
449
|
|
|
450 if (NILP (bestmatch))
|
|
|
451 return Qnil; /* No completions found */
|
|
|
452 /* If we are ignoring case, and there is no exact match,
|
|
|
453 and no additional text was supplied,
|
|
|
454 don't change the case of what the user typed. */
|
|
|
455 if (completion_ignore_case
|
|
|
456 && bestmatchsize == slength
|
|
|
457 && blength > bestmatchsize)
|
|
|
458 return string;
|
|
|
459
|
|
|
460 /* Return t if the supplied string is an exact match (counting case);
|
|
|
461 it does not require any change to be made. */
|
|
|
462 if (matchcount == 1
|
|
|
463 && bestmatchsize == slength
|
|
16
|
464 && 0 > scmp_1 (XSTRING_DATA (bestmatch),
|
|
|
465 XSTRING_DATA (string),
|
|
0
|
466 bestmatchsize, 0))
|
|
|
467 return Qt;
|
|
|
468
|
|
|
469 /* Else extract the part in which all completions agree */
|
|
|
470 return Fsubstring (bestmatch, Qzero, make_int (bestmatchsize));
|
|
|
471 }
|
|
|
472
|
|
|
473
|
|
20
|
474 DEFUN ("all-completions", Fall_completions, 2, 3, 0, /*
|
|
0
|
475 Search for partial matches to STRING in ALIST.
|
|
|
476 Each car of each element of ALIST is tested to see if it begins with STRING.
|
|
|
477 The value is a list of all the strings from ALIST that match.
|
|
|
478 ALIST can be an obarray instead of an alist.
|
|
|
479 Then the print names of all symbols in the obarray are the possible matches.
|
|
|
480
|
|
|
481 ALIST can also be a function to do the completion itself.
|
|
|
482 It receives three arguments: the values STRING, PREDICATE and t.
|
|
|
483 Whatever it returns becomes the value of `all-completions'.
|
|
|
484
|
|
|
485 If optional third argument PREDICATE is non-nil,
|
|
|
486 it is used to test each possible match.
|
|
|
487 The match is a candidate only if PREDICATE returns non-nil.
|
|
|
488 The argument given to PREDICATE is the alist element or
|
|
|
489 the symbol from the obarray.
|
|
20
|
490 */
|
|
|
491 (string, alist, pred))
|
|
0
|
492 {
|
|
|
493 /* This function can GC */
|
|
|
494 Lisp_Object tail;
|
|
|
495 Lisp_Object allmatches;
|
|
|
496 int list;
|
|
|
497 int indice = 0;
|
|
|
498 int obsize = 0;
|
|
|
499 Lisp_Object bucket;
|
|
|
500 Charcount slength;
|
|
|
501
|
|
|
502 CHECK_STRING (string);
|
|
|
503
|
|
|
504 if (CONSP (alist))
|
|
|
505 {
|
|
|
506 Lisp_Object tem = XCAR (alist);
|
|
|
507 if (SYMBOLP (tem)) /* lambda, autoload, etc. Emacs-lisp sucks */
|
|
|
508 return call3 (alist, string, pred, Qt);
|
|
|
509 else
|
|
|
510 list = 1;
|
|
|
511 }
|
|
|
512 else if (VECTORP (alist))
|
|
|
513 list = 0;
|
|
|
514 else if (NILP (alist))
|
|
|
515 list = 1;
|
|
|
516 else
|
|
|
517 return call3 (alist, string, pred, Qt);
|
|
|
518
|
|
|
519 allmatches = Qnil;
|
|
|
520 slength = string_char_length (XSTRING (string));
|
|
|
521
|
|
|
522 /* If ALIST is not a list, set TAIL just for gc pro. */
|
|
|
523 tail = alist;
|
|
|
524 if (!list)
|
|
|
525 {
|
|
|
526 obsize = vector_length (XVECTOR (alist));
|
|
|
527 bucket = vector_data (XVECTOR (alist))[indice];
|
|
|
528 }
|
|
|
529
|
|
|
530 while (1)
|
|
|
531 {
|
|
|
532 /* Get the next element of the alist or obarray. */
|
|
|
533 /* Exit the loop if the elements are all used up. */
|
|
|
534 /* elt gets the alist element or symbol.
|
|
|
535 eltstring gets the name to check as a completion. */
|
|
|
536 Lisp_Object elt;
|
|
|
537 Lisp_Object eltstring;
|
|
|
538
|
|
|
539 if (list)
|
|
|
540 {
|
|
|
541 if (NILP (tail))
|
|
|
542 break;
|
|
|
543 elt = Fcar (tail);
|
|
|
544 eltstring = Fcar (elt);
|
|
|
545 tail = Fcdr (tail);
|
|
|
546 }
|
|
|
547 else
|
|
|
548 {
|
|
|
549 if (!ZEROP (bucket))
|
|
|
550 {
|
|
|
551 struct Lisp_Symbol *next = symbol_next (XSYMBOL (bucket));
|
|
|
552 elt = bucket;
|
|
|
553 eltstring = Fsymbol_name (elt);
|
|
|
554 if (next)
|
|
|
555 XSETSYMBOL (bucket, next);
|
|
|
556 else
|
|
|
557 bucket = Qzero;
|
|
|
558 }
|
|
|
559 else if (++indice >= obsize)
|
|
|
560 break;
|
|
|
561 else
|
|
|
562 {
|
|
|
563 bucket = vector_data (XVECTOR (alist))[indice];
|
|
|
564 continue;
|
|
|
565 }
|
|
|
566 }
|
|
|
567
|
|
|
568 /* Is this element a possible completion? */
|
|
|
569
|
|
|
570 if (STRINGP (eltstring)
|
|
|
571 && (slength <= string_char_length (XSTRING (eltstring)))
|
|
|
572 /* Reject alternatives that start with space
|
|
|
573 unless the input starts with space. */
|
|
|
574 && ((string_char_length (XSTRING (string)) > 0 &&
|
|
|
575 string_char (XSTRING (string), 0) == ' ')
|
|
|
576 || string_char (XSTRING (eltstring), 0) != ' ')
|
|
16
|
577 && (0 > scmp (XSTRING_DATA (eltstring),
|
|
|
578 XSTRING_DATA (string),
|
|
0
|
579 slength)))
|
|
|
580 {
|
|
|
581 /* Yes. Now check whether predicate likes it. */
|
|
|
582 struct gcpro gcpro1, gcpro2, gcpro3, gcpro4;
|
|
|
583 int loser;
|
|
|
584 GCPRO4 (tail, eltstring, allmatches, string);
|
|
|
585 loser = ignore_completion_p (eltstring, pred, elt);
|
|
|
586 UNGCPRO;
|
|
|
587 if (!loser)
|
|
|
588 /* Ok => put it on the list. */
|
|
|
589 allmatches = Fcons (eltstring, allmatches);
|
|
|
590 }
|
|
|
591 }
|
|
|
592
|
|
|
593 return Fnreverse (allmatches);
|
|
|
594 }
|
|
|
595
|
|
|
596 /* Useless FSFmacs functions */
|
|
|
597 /* More than useless. I've nuked minibuf_prompt_width so they won't
|
|
|
598 function at all in XEmacs at the moment. They are used to
|
|
|
599 implement some braindamage in FSF which we aren't including. --cet */
|
|
|
600
|
|
|
601 #if 0
|
|
|
602 xxDEFUN ("minibuffer-prompt", Fminibuffer_prompt, Sminibuffer_prompt, 0, 0, 0,
|
|
|
603 "Return the prompt string of the currently-active minibuffer.\n"
|
|
|
604 "If no minibuffer is active, return nil.")
|
|
|
605 ()
|
|
|
606 {
|
|
|
607 return (Fcopy_sequence (Vminibuf_prompt));
|
|
|
608 }
|
|
|
609
|
|
|
610 xxDEFUN ("minibuffer-prompt-width", Fminibuffer_prompt_width,
|
|
|
611 Sminibuffer_prompt_width, 0, 0, 0,
|
|
|
612 "Return the display width of the minibuffer prompt.")
|
|
|
613 ()
|
|
|
614 {
|
|
|
615 return (make_int (minibuf_prompt_width));
|
|
|
616 }
|
|
16
|
617 #endif /* 0 */
|
|
0
|
618
|
|
|
619
|
|
|
620 /************************************************************************/
|
|
|
621 /* echo area */
|
|
|
622 /************************************************************************/
|
|
|
623
|
|
|
624 extern int stdout_needs_newline;
|
|
|
625
|
|
|
626 static Lisp_Object
|
|
|
627 clear_echo_area_internal (struct frame *f, Lisp_Object label, int from_print,
|
|
|
628 int no_restore)
|
|
|
629 {
|
|
44
|
630 /* This function can call lisp */
|
|
0
|
631 if (!NILP (Ffboundp (Qclear_message)))
|
|
|
632 {
|
|
|
633 Lisp_Object frame;
|
|
|
634
|
|
|
635 XSETFRAME (frame, f);
|
|
|
636 return call4 (Qclear_message, label, frame, from_print ? Qt : Qnil,
|
|
|
637 no_restore ? Qt : Qnil);
|
|
|
638 }
|
|
|
639 else
|
|
|
640 {
|
|
|
641 write_string_to_stdio_stream (stderr, 0, (CONST Bufbyte *) "\n", 0, 1,
|
|
16
|
642 FORMAT_TERMINAL);
|
|
0
|
643 return Qnil;
|
|
|
644 }
|
|
|
645 }
|
|
|
646
|
|
|
647 Lisp_Object
|
|
|
648 clear_echo_area (struct frame *f, Lisp_Object label, int no_restore)
|
|
|
649 {
|
|
44
|
650 /* This function can call lisp */
|
|
0
|
651 return clear_echo_area_internal (f, label, 0, no_restore);
|
|
|
652 }
|
|
|
653
|
|
|
654 Lisp_Object
|
|
|
655 clear_echo_area_from_print (struct frame *f, Lisp_Object label, int no_restore)
|
|
|
656 {
|
|
44
|
657 /* This function can call lisp */
|
|
0
|
658 return clear_echo_area_internal (f, label, 1, no_restore);
|
|
|
659 }
|
|
|
660
|
|
|
661 void
|
|
|
662 echo_area_append (struct frame *f, CONST Bufbyte *nonreloc, Lisp_Object reloc,
|
|
|
663 Bytecount offset, Bytecount length,
|
|
|
664 Lisp_Object label)
|
|
|
665 {
|
|
44
|
666 /* This function can call lisp */
|
|
0
|
667 Lisp_Object obj;
|
|
|
668 struct gcpro gcpro1;
|
|
|
669 Lisp_Object frame;
|
|
|
670
|
|
|
671 /* some callers pass in a null string as a way of clearing the echo area.
|
|
|
672 check for length == 0 now; if this case, neither nonreloc nor reloc
|
|
|
673 may be valid. */
|
|
|
674 if (length == 0)
|
|
|
675 return;
|
|
|
676
|
|
|
677 fixup_internal_substring (nonreloc, reloc, offset, &length);
|
|
|
678
|
|
|
679 /* also check it here, in case the string was really blank. */
|
|
|
680 if (length == 0)
|
|
|
681 return;
|
|
|
682
|
|
|
683 if (!NILP (Ffboundp (Qappend_message)))
|
|
|
684 {
|
|
16
|
685 if (STRINGP (reloc) && offset == 0 && length == XSTRING_LENGTH (reloc))
|
|
0
|
686 obj = reloc;
|
|
|
687 else
|
|
|
688 {
|
|
|
689 if (STRINGP (reloc))
|
|
16
|
690 nonreloc = XSTRING_DATA (reloc);
|
|
0
|
691 obj = make_string (nonreloc + offset, length);
|
|
|
692 }
|
|
|
693
|
|
|
694 XSETFRAME (frame, f);
|
|
|
695 GCPRO1 (obj);
|
|
|
696 call4 (Qappend_message, label, obj, frame,
|
|
|
697 EQ (label, Qprint) ? Qt : Qnil);
|
|
|
698 UNGCPRO;
|
|
|
699 }
|
|
|
700 else
|
|
|
701 {
|
|
|
702 if (STRINGP (reloc))
|
|
16
|
703 nonreloc = XSTRING_DATA (reloc);
|
|
0
|
704 write_string_to_stdio_stream (stderr, 0, nonreloc, offset, length,
|
|
16
|
705 FORMAT_TERMINAL);
|
|
0
|
706 }
|
|
|
707 }
|
|
|
708
|
|
|
709 void
|
|
|
710 echo_area_message (struct frame *f, CONST Bufbyte *nonreloc,
|
|
|
711 Lisp_Object reloc, Bytecount offset, Bytecount length,
|
|
|
712 Lisp_Object label)
|
|
|
713 {
|
|
44
|
714 /* This function can call lisp */
|
|
0
|
715 clear_echo_area (f, label, 1);
|
|
|
716 echo_area_append (f, nonreloc, reloc, offset, length, label);
|
|
|
717 }
|
|
|
718
|
|
|
719 int
|
|
|
720 echo_area_active (struct frame *f)
|
|
|
721 {
|
|
|
722 /* By definition, the echo area is active if the echo-area buffer
|
|
|
723 is not empty. No need to call Lisp code. (Anyway, this function
|
|
|
724 is called from redisplay.) */
|
|
16
|
725 struct buffer *echo_buffer = XBUFFER (Vecho_area_buffer);
|
|
|
726 return (BUF_BEGV (echo_buffer) != BUF_ZV (echo_buffer));
|
|
0
|
727 }
|
|
|
728
|
|
|
729 Lisp_Object
|
|
|
730 echo_area_status (struct frame *f)
|
|
|
731 {
|
|
44
|
732 /* This function can call lisp */
|
|
0
|
733 if (!NILP (Ffboundp (Qcurrent_message_label)))
|
|
|
734 {
|
|
|
735 Lisp_Object frame;
|
|
|
736
|
|
|
737 XSETFRAME (frame, f);
|
|
|
738 return (call1 (Qcurrent_message_label, frame));
|
|
|
739 }
|
|
|
740 else
|
|
|
741 return stdout_needs_newline ? Qmessage : Qnil;
|
|
|
742 }
|
|
|
743
|
|
|
744 Lisp_Object
|
|
|
745 echo_area_contents (struct frame *f)
|
|
|
746 {
|
|
|
747 /* See above. By definition, the contents of the echo-area buffer
|
|
|
748 are the contents of the echo area. */
|
|
|
749 return Fbuffer_substring (Qnil, Qnil, Vecho_area_buffer);
|
|
|
750 }
|
|
|
751
|
|
|
752 /* Dump an informative message to the echo area. This function takes a
|
|
|
753 string in internal format. */
|
|
|
754 void
|
|
|
755 message_internal (CONST Bufbyte *nonreloc, Lisp_Object reloc,
|
|
|
756 Bytecount offset, Bytecount length)
|
|
|
757 {
|
|
44
|
758 /* This function can call lisp */
|
|
0
|
759 if (NILP (Vexecuting_macro))
|
|
|
760 echo_area_message (selected_frame (), nonreloc, reloc, offset, length,
|
|
|
761 Qmessage);
|
|
|
762 }
|
|
|
763
|
|
|
764 void
|
|
|
765 message_append_internal (CONST Bufbyte *nonreloc, Lisp_Object reloc,
|
|
|
766 Bytecount offset, Bytecount length)
|
|
|
767 {
|
|
44
|
768 /* This function can call lisp */
|
|
0
|
769 if (NILP (Vexecuting_macro))
|
|
|
770 echo_area_append (selected_frame (), nonreloc, reloc, offset, length,
|
|
|
771 Qmessage);
|
|
|
772 }
|
|
|
773
|
|
|
774 /* The next three functions are interfaces to message_internal() that
|
|
|
775 take strings in external format. message() does I18N3 translating
|
|
|
776 on the format string; message_no_translate() does not. */
|
|
|
777
|
|
|
778 static void
|
|
|
779 message_1 (CONST char *fmt, va_list args)
|
|
|
780 {
|
|
44
|
781 /* This function can call lisp */
|
|
0
|
782 if (fmt)
|
|
|
783 {
|
|
|
784 struct gcpro gcpro1;
|
|
|
785 /* message_internal() might GC, e.g. if there are after-change-hooks
|
|
|
786 on the echo area buffer */
|
|
|
787 Lisp_Object obj = emacs_doprnt_string_va ((CONST Bufbyte *) fmt, Qnil,
|
|
|
788 -1, args);
|
|
|
789 GCPRO1 (obj);
|
|
|
790 message_internal (0, obj, 0, -1);
|
|
|
791 UNGCPRO;
|
|
|
792 }
|
|
|
793 else
|
|
|
794 message_internal (0, Qnil, 0, 0);
|
|
|
795 }
|
|
|
796
|
|
|
797 static void
|
|
|
798 message_append_1 (CONST char *fmt, va_list args)
|
|
|
799 {
|
|
44
|
800 /* This function can call lisp */
|
|
0
|
801 if (fmt)
|
|
|
802 {
|
|
|
803 struct gcpro gcpro1;
|
|
|
804 /* message_internal() might GC, e.g. if there are after-change-hooks
|
|
|
805 on the echo area buffer */
|
|
|
806 Lisp_Object obj = emacs_doprnt_string_va ((CONST Bufbyte *) fmt, Qnil,
|
|
|
807 -1, args);
|
|
|
808 GCPRO1 (obj);
|
|
|
809 message_append_internal (0, obj, 0, -1);
|
|
|
810 UNGCPRO;
|
|
|
811 }
|
|
|
812 else
|
|
|
813 message_append_internal (0, Qnil, 0, 0);
|
|
|
814 }
|
|
|
815
|
|
|
816 void
|
|
|
817 clear_message (void)
|
|
|
818 {
|
|
44
|
819 /* This function can call lisp */
|
|
0
|
820 message_internal (0, Qnil, 0, 0);
|
|
|
821 }
|
|
|
822
|
|
|
823 void
|
|
|
824 message (CONST char *fmt, ...)
|
|
|
825 {
|
|
44
|
826 /* This function can call lisp */
|
|
0
|
827 /* I think it's OK to pass the data of Lisp strings as arguments to
|
|
|
828 this function. No GC'ing will occur until the data has already
|
|
|
829 been copied. */
|
|
|
830 va_list args;
|
|
|
831
|
|
|
832 va_start (args, fmt);
|
|
|
833 if (fmt)
|
|
|
834 fmt = GETTEXT (fmt);
|
|
|
835 message_1 (fmt, args);
|
|
|
836 va_end (args);
|
|
|
837 }
|
|
|
838
|
|
|
839 void
|
|
|
840 message_append (CONST char *fmt, ...)
|
|
|
841 {
|
|
44
|
842 /* This function can call lisp */
|
|
0
|
843 va_list args;
|
|
|
844
|
|
|
845 va_start (args, fmt);
|
|
|
846 if (fmt)
|
|
|
847 fmt = GETTEXT (fmt);
|
|
|
848 message_append_1 (fmt, args);
|
|
|
849 va_end (args);
|
|
|
850 }
|
|
|
851
|
|
|
852 void
|
|
|
853 message_no_translate (CONST char *fmt, ...)
|
|
|
854 {
|
|
44
|
855 /* This function can call lisp */
|
|
0
|
856 /* I think it's OK to pass the data of Lisp strings as arguments to
|
|
|
857 this function. No GC'ing will occur until the data has already
|
|
|
858 been copied. */
|
|
|
859 va_list args;
|
|
|
860
|
|
|
861 va_start (args, fmt);
|
|
|
862 message_1 (fmt, args);
|
|
|
863 va_end (args);
|
|
|
864 }
|
|
|
865
|
|
|
866
|
|
|
867 /************************************************************************/
|
|
|
868 /* initialization */
|
|
|
869 /************************************************************************/
|
|
|
870
|
|
|
871 void
|
|
|
872 syms_of_minibuf (void)
|
|
|
873 {
|
|
|
874 defsymbol (&Qminibuffer_setup_hook, "minibuffer-setup-hook");
|
|
|
875
|
|
|
876 defsymbol (&Qcompletion_ignore_case, "completion-ignore-case");
|
|
|
877
|
|
20
|
878 DEFSUBR (Fminibuffer_depth);
|
|
0
|
879 #if 0
|
|
20
|
880 DEFSUBR (Fminibuffer_prompt);
|
|
|
881 DEFSUBR (Fminibuffer_prompt_width);
|
|
0
|
882 #endif
|
|
|
883
|
|
20
|
884 DEFSUBR (Fread_minibuffer_internal);
|
|
0
|
885
|
|
20
|
886 DEFSUBR (Ftry_completion);
|
|
|
887 DEFSUBR (Fall_completions);
|
|
0
|
888
|
|
|
889 defsymbol (&Qappend_message, "append-message");
|
|
|
890 defsymbol (&Qclear_message, "clear-message");
|
|
|
891 defsymbol (&Qdisplay_message, "display-message");
|
|
|
892 defsymbol (&Qcurrent_message_label, "current-message-label");
|
|
|
893 }
|
|
|
894
|
|
|
895 void
|
|
|
896 vars_of_minibuf (void)
|
|
|
897 {
|
|
|
898 minibuf_level = 0;
|
|
|
899
|
|
|
900 staticpro (&Vminibuf_prompt);
|
|
|
901 Vminibuf_prompt = Qnil;
|
|
|
902
|
|
|
903 DEFVAR_LISP ("minibuffer-setup-hook", &Vminibuffer_setup_hook /*
|
|
|
904 Normal hook run just after entry to minibuffer.
|
|
|
905 */ );
|
|
|
906 Vminibuffer_setup_hook = Qnil;
|
|
|
907
|
|
|
908 DEFVAR_BOOL ("completion-ignore-case", &completion_ignore_case /*
|
|
|
909 Non-nil means don't consider case significant in completion.
|
|
|
910 */ );
|
|
|
911 completion_ignore_case = 0;
|
|
|
912
|
|
|
913 DEFVAR_LISP ("completion-regexp-list", &Vcompletion_regexp_list /*
|
|
|
914 List of regexps that should restrict possible completions.
|
|
32
|
915 Each completion has to match all regexps in this list.
|
|
0
|
916 */ );
|
|
|
917 Vcompletion_regexp_list = Qnil;
|
|
|
918 }
|
|
|
919
|
|
|
920 void
|
|
|
921 complex_vars_of_minibuf (void)
|
|
|
922 {
|
|
|
923 /* This function can GC */
|
|
|
924 #ifdef I18N3
|
|
|
925 /* #### This needs to be fixed up so that the gettext() gets called
|
|
|
926 at runtime instead of at load time. */
|
|
|
927 #endif
|
|
|
928 Vminibuffer_zero
|
|
|
929 = Fget_buffer_create
|
|
|
930 (Fpurecopy (build_string (DEFER_GETTEXT (" *Minibuf-0*"))));
|
|
|
931 Vecho_area_buffer
|
|
|
932 = Fget_buffer_create
|
|
|
933 (Fpurecopy (build_string (DEFER_GETTEXT (" *Echo Area*"))));
|
|
|
934 }
|
