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