|
428
|
1 /* Simple built-in editing commands.
|
|
|
2 Copyright (C) 1985, 1992, 1993, 1994, 1995 Free Software Foundation, Inc.
|
|
826
|
3 Copyright (C) 2002 Ben Wing.
|
|
428
|
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.30. */
|
|
|
23
|
|
|
24 #include <config.h>
|
|
|
25 #include "lisp.h"
|
|
|
26 #include "commands.h"
|
|
|
27 #include "buffer.h"
|
|
872
|
28 #include "extents.h"
|
|
428
|
29 #include "syntax.h"
|
|
|
30 #include "insdel.h"
|
|
|
31
|
|
|
32 Lisp_Object Qkill_forward_chars;
|
|
|
33 Lisp_Object Qself_insert_command;
|
|
|
34 Lisp_Object Qno_self_insert;
|
|
|
35
|
|
|
36 Lisp_Object Vblink_paren_function;
|
|
|
37
|
|
|
38 /* A possible value for a buffer's overwrite-mode variable. */
|
|
|
39 Lisp_Object Qoverwrite_mode_binary;
|
|
|
40
|
|
|
41 /* Non-nil means put this face on the next self-inserting character. */
|
|
|
42 Lisp_Object Vself_insert_face;
|
|
|
43
|
|
|
44 /* This is the command that set up Vself_insert_face. */
|
|
|
45 Lisp_Object Vself_insert_face_command;
|
|
442
|
46
|
|
|
47 /* A char-table for characters which may invoke auto-filling. */
|
|
|
48 Lisp_Object Vauto_fill_chars;
|
|
428
|
49
|
|
|
50 DEFUN ("forward-char", Fforward_char, 0, 2, "_p", /*
|
|
444
|
51 Move point right COUNT characters (left if COUNT is negative).
|
|
428
|
52 On attempt to pass end of buffer, stop and signal `end-of-buffer'.
|
|
|
53 On attempt to pass beginning of buffer, stop and signal `beginning-of-buffer'.
|
|
|
54 On reaching end of buffer, stop and signal error.
|
|
462
|
55
|
|
|
56 The characters that are moved over may be added to the current selection
|
|
|
57 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
58 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
59 the documentation for this variable for more details.
|
|
428
|
60 */
|
|
444
|
61 (count, buffer))
|
|
428
|
62 {
|
|
|
63 struct buffer *buf = decode_buffer (buffer, 1);
|
|
444
|
64 EMACS_INT n;
|
|
428
|
65
|
|
444
|
66 if (NILP (count))
|
|
|
67 n = 1;
|
|
428
|
68 else
|
|
|
69 {
|
|
444
|
70 CHECK_INT (count);
|
|
|
71 n = XINT (count);
|
|
428
|
72 }
|
|
|
73
|
|
444
|
74 /* This used to just set point to point + XINT (count), and then check
|
|
428
|
75 to see if it was within boundaries. But now that SET_PT can
|
|
|
76 potentially do a lot of stuff (calling entering and exiting
|
|
|
77 hooks, etcetera), that's not a good approach. So we validate the
|
|
|
78 proposed position, then set point. */
|
|
|
79 {
|
|
665
|
80 Charbpos new_point = BUF_PT (buf) + n;
|
|
428
|
81
|
|
|
82 if (new_point < BUF_BEGV (buf))
|
|
|
83 {
|
|
|
84 BUF_SET_PT (buf, BUF_BEGV (buf));
|
|
|
85 Fsignal (Qbeginning_of_buffer, Qnil);
|
|
|
86 return Qnil;
|
|
|
87 }
|
|
|
88 if (new_point > BUF_ZV (buf))
|
|
|
89 {
|
|
|
90 BUF_SET_PT (buf, BUF_ZV (buf));
|
|
|
91 Fsignal (Qend_of_buffer, Qnil);
|
|
|
92 return Qnil;
|
|
|
93 }
|
|
|
94
|
|
|
95 BUF_SET_PT (buf, new_point);
|
|
|
96 }
|
|
|
97
|
|
|
98 return Qnil;
|
|
|
99 }
|
|
|
100
|
|
|
101 DEFUN ("backward-char", Fbackward_char, 0, 2, "_p", /*
|
|
444
|
102 Move point left COUNT characters (right if COUNT is negative).
|
|
428
|
103 On attempt to pass end of buffer, stop and signal `end-of-buffer'.
|
|
|
104 On attempt to pass beginning of buffer, stop and signal `beginning-of-buffer'.
|
|
462
|
105
|
|
|
106 The characters that are moved over may be added to the current selection
|
|
|
107 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
108 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
109 the documentation for this variable for more details.
|
|
428
|
110 */
|
|
444
|
111 (count, buffer))
|
|
428
|
112 {
|
|
444
|
113 if (NILP (count))
|
|
|
114 count = make_int (-1);
|
|
428
|
115 else
|
|
|
116 {
|
|
444
|
117 CHECK_INT (count);
|
|
|
118 count = make_int (- XINT (count));
|
|
428
|
119 }
|
|
444
|
120 return Fforward_char (count, buffer);
|
|
428
|
121 }
|
|
|
122
|
|
|
123 DEFUN ("forward-line", Fforward_line, 0, 2, "_p", /*
|
|
444
|
124 Move COUNT lines forward (backward if COUNT is negative).
|
|
|
125 Precisely, if point is on line I, move to the start of line I + COUNT.
|
|
428
|
126 If there isn't room, go as far as possible (no error).
|
|
|
127 Returns the count of lines left to move. If moving forward,
|
|
444
|
128 that is COUNT - number of lines moved; if backward, COUNT + number moved.
|
|
3577
|
129 \(Note that if COUNT is negative, the return will be non-positive.)
|
|
444
|
130 With positive COUNT, a non-empty line at the end counts as one line
|
|
428
|
131 successfully moved (for the return value).
|
|
|
132 If BUFFER is nil, the current buffer is assumed.
|
|
462
|
133
|
|
|
134 The characters that are moved over may be added to the current selection
|
|
|
135 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
136 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
137 the documentation for this variable for more details.
|
|
428
|
138 */
|
|
444
|
139 (count, buffer))
|
|
428
|
140 {
|
|
|
141 struct buffer *buf = decode_buffer (buffer, 1);
|
|
665
|
142 Charbpos pos2 = BUF_PT (buf);
|
|
|
143 Charbpos pos;
|
|
444
|
144 EMACS_INT n, shortage, negp;
|
|
428
|
145
|
|
444
|
146 if (NILP (count))
|
|
|
147 n = 1;
|
|
428
|
148 else
|
|
|
149 {
|
|
444
|
150 CHECK_INT (count);
|
|
|
151 n = XINT (count);
|
|
428
|
152 }
|
|
|
153
|
|
444
|
154 negp = n <= 0;
|
|
|
155 pos = scan_buffer (buf, '\n', pos2, 0, n - negp, &shortage, 1);
|
|
428
|
156 if (shortage > 0
|
|
|
157 && (negp
|
|
|
158 || (BUF_ZV (buf) > BUF_BEGV (buf)
|
|
|
159 && pos != pos2
|
|
|
160 && BUF_FETCH_CHAR (buf, pos - 1) != '\n')))
|
|
|
161 shortage--;
|
|
|
162 BUF_SET_PT (buf, pos);
|
|
|
163 return make_int (negp ? - shortage : shortage);
|
|
|
164 }
|
|
|
165
|
|
|
166 DEFUN ("point-at-bol", Fpoint_at_bol, 0, 2, 0, /*
|
|
|
167 Return the character position of the first character on the current line.
|
|
444
|
168 With argument COUNT not nil or 1, move forward COUNT - 1 lines first.
|
|
428
|
169 If scan reaches end of buffer, return that position.
|
|
|
170 This function does not move point.
|
|
|
171 */
|
|
444
|
172 (count, buffer))
|
|
428
|
173 {
|
|
|
174 struct buffer *b = decode_buffer (buffer, 1);
|
|
|
175 REGISTER int orig, end;
|
|
|
176
|
|
793
|
177 buffer = wrap_buffer (b);
|
|
444
|
178 if (NILP (count))
|
|
|
179 count = make_int (0);
|
|
428
|
180 else
|
|
|
181 {
|
|
444
|
182 CHECK_INT (count);
|
|
|
183 count = make_int (XINT (count) - 1);
|
|
428
|
184 }
|
|
|
185
|
|
|
186 orig = BUF_PT (b);
|
|
444
|
187 Fforward_line (count, buffer);
|
|
428
|
188 end = BUF_PT (b);
|
|
|
189 BUF_SET_PT (b, orig);
|
|
|
190
|
|
|
191 return make_int (end);
|
|
|
192 }
|
|
|
193
|
|
|
194 DEFUN ("beginning-of-line", Fbeginning_of_line, 0, 2, "_p", /*
|
|
|
195 Move point to beginning of current line.
|
|
444
|
196 With argument COUNT not nil or 1, move forward COUNT - 1 lines first.
|
|
428
|
197 If scan reaches end of buffer, stop there without error.
|
|
|
198 If BUFFER is nil, the current buffer is assumed.
|
|
462
|
199
|
|
|
200 The characters that are moved over may be added to the current selection
|
|
|
201 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
202 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
203 the documentation for this variable for more details.
|
|
428
|
204 */
|
|
444
|
205 (count, buffer))
|
|
428
|
206 {
|
|
|
207 struct buffer *b = decode_buffer (buffer, 1);
|
|
|
208
|
|
444
|
209 BUF_SET_PT (b, XINT (Fpoint_at_bol (count, buffer)));
|
|
428
|
210 return Qnil;
|
|
|
211 }
|
|
|
212
|
|
|
213 DEFUN ("point-at-eol", Fpoint_at_eol, 0, 2, 0, /*
|
|
|
214 Return the character position of the last character on the current line.
|
|
444
|
215 With argument COUNT not nil or 1, move forward COUNT - 1 lines first.
|
|
428
|
216 If scan reaches end of buffer, return that position.
|
|
|
217 This function does not move point.
|
|
|
218 */
|
|
444
|
219 (count, buffer))
|
|
428
|
220 {
|
|
|
221 struct buffer *buf = decode_buffer (buffer, 1);
|
|
446
|
222 EMACS_INT n;
|
|
428
|
223
|
|
444
|
224 if (NILP (count))
|
|
|
225 n = 1;
|
|
428
|
226 else
|
|
|
227 {
|
|
444
|
228 CHECK_INT (count);
|
|
|
229 n = XINT (count);
|
|
428
|
230 }
|
|
|
231
|
|
|
232 return make_int (find_before_next_newline (buf, BUF_PT (buf), 0,
|
|
444
|
233 n - (n <= 0)));
|
|
428
|
234 }
|
|
|
235
|
|
|
236 DEFUN ("end-of-line", Fend_of_line, 0, 2, "_p", /*
|
|
|
237 Move point to end of current line.
|
|
444
|
238 With argument COUNT not nil or 1, move forward COUNT - 1 lines first.
|
|
428
|
239 If scan reaches end of buffer, stop there without error.
|
|
|
240 If BUFFER is nil, the current buffer is assumed.
|
|
462
|
241
|
|
|
242 The characters that are moved over may be added to the current selection
|
|
|
243 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
244 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
245 the documentation for this variable for more details.
|
|
428
|
246 */
|
|
444
|
247 (count, buffer))
|
|
428
|
248 {
|
|
|
249 struct buffer *b = decode_buffer (buffer, 1);
|
|
|
250
|
|
444
|
251 BUF_SET_PT (b, XINT (Fpoint_at_eol (count, buffer)));
|
|
428
|
252 return Qnil;
|
|
|
253 }
|
|
|
254
|
|
446
|
255 DEFUN ("delete-char", Fdelete_char, 0, 2, "*p\nP", /*
|
|
444
|
256 Delete the following COUNT characters (previous, with negative COUNT).
|
|
|
257 Optional second arg KILLP non-nil means kill instead (save in kill ring).
|
|
|
258 Interactively, COUNT is the prefix arg, and KILLP is set if
|
|
|
259 COUNT was explicitly specified.
|
|
428
|
260 */
|
|
444
|
261 (count, killp))
|
|
428
|
262 {
|
|
|
263 /* This function can GC */
|
|
665
|
264 Charbpos pos;
|
|
428
|
265 struct buffer *buf = current_buffer;
|
|
446
|
266 EMACS_INT n;
|
|
428
|
267
|
|
446
|
268 if (NILP (count))
|
|
|
269 n = 1;
|
|
|
270 else
|
|
|
271 {
|
|
|
272 CHECK_INT (count);
|
|
|
273 n = XINT (count);
|
|
|
274 }
|
|
428
|
275
|
|
444
|
276 pos = BUF_PT (buf) + n;
|
|
|
277 if (NILP (killp))
|
|
428
|
278 {
|
|
444
|
279 if (n < 0)
|
|
428
|
280 {
|
|
|
281 if (pos < BUF_BEGV (buf))
|
|
563
|
282 signal_error (Qbeginning_of_buffer, 0, Qunbound);
|
|
428
|
283 else
|
|
|
284 buffer_delete_range (buf, pos, BUF_PT (buf), 0);
|
|
|
285 }
|
|
|
286 else
|
|
|
287 {
|
|
|
288 if (pos > BUF_ZV (buf))
|
|
563
|
289 signal_error (Qend_of_buffer, 0, Qunbound);
|
|
428
|
290 else
|
|
|
291 buffer_delete_range (buf, BUF_PT (buf), pos, 0);
|
|
|
292 }
|
|
|
293 }
|
|
|
294 else
|
|
|
295 {
|
|
444
|
296 call1 (Qkill_forward_chars, count);
|
|
428
|
297 }
|
|
|
298 return Qnil;
|
|
|
299 }
|
|
|
300
|
|
446
|
301 DEFUN ("delete-backward-char", Fdelete_backward_char, 0, 2, "*p\nP", /*
|
|
444
|
302 Delete the previous COUNT characters (following, with negative COUNT).
|
|
|
303 Optional second arg KILLP non-nil means kill instead (save in kill ring).
|
|
|
304 Interactively, COUNT is the prefix arg, and KILLP is set if
|
|
|
305 COUNT was explicitly specified.
|
|
428
|
306 */
|
|
444
|
307 (count, killp))
|
|
428
|
308 {
|
|
|
309 /* This function can GC */
|
|
446
|
310 EMACS_INT n;
|
|
|
311
|
|
|
312 if (NILP (count))
|
|
|
313 n = 1;
|
|
|
314 else
|
|
|
315 {
|
|
|
316 CHECK_INT (count);
|
|
|
317 n = XINT (count);
|
|
|
318 }
|
|
|
319
|
|
|
320 return Fdelete_char (make_int (- n), killp);
|
|
428
|
321 }
|
|
|
322
|
|
867
|
323 static void internal_self_insert (Ichar ch, int noautofill);
|
|
428
|
324
|
|
|
325 DEFUN ("self-insert-command", Fself_insert_command, 1, 1, "*p", /*
|
|
|
326 Insert the character you type.
|
|
|
327 Whichever character you type to run this command is inserted.
|
|
444
|
328 If a prefix arg COUNT is specified, the character is inserted COUNT times.
|
|
428
|
329 */
|
|
444
|
330 (count))
|
|
428
|
331 {
|
|
|
332 /* This function can GC */
|
|
867
|
333 Ichar ch;
|
|
428
|
334 Lisp_Object c;
|
|
446
|
335 EMACS_INT n;
|
|
428
|
336
|
|
444
|
337 CHECK_NATNUM (count);
|
|
|
338 n = XINT (count);
|
|
428
|
339
|
|
|
340 if (CHAR_OR_CHAR_INTP (Vlast_command_char))
|
|
|
341 c = Vlast_command_char;
|
|
|
342 else
|
|
2862
|
343 c = Fevent_to_character (Vlast_command_event, Qnil, Qnil, Qnil);
|
|
428
|
344
|
|
|
345 if (NILP (c))
|
|
2828
|
346 invalid_operation (
|
|
|
347 "Last typed key has no character equivalent (that we know of)",
|
|
|
348 Fcopy_event (Vlast_command_event, Qnil));
|
|
428
|
349
|
|
|
350 CHECK_CHAR_COERCE_INT (c);
|
|
|
351
|
|
|
352 ch = XCHAR (c);
|
|
|
353
|
|
444
|
354 while (n--)
|
|
|
355 internal_self_insert (ch, (n != 0));
|
|
428
|
356
|
|
|
357 return Qnil;
|
|
|
358 }
|
|
|
359
|
|
|
360 /* Insert character C1. If NOAUTOFILL is nonzero, don't do autofill
|
|
|
361 even if it is enabled.
|
|
|
362
|
|
|
363 FSF:
|
|
|
364
|
|
|
365 If this insertion is suitable for direct output (completely simple),
|
|
|
366 return 0. A value of 1 indicates this *might* not have been simple.
|
|
|
367 A value of 2 means this did things that call for an undo boundary. */
|
|
|
368
|
|
|
369 static void
|
|
867
|
370 internal_self_insert (Ichar c1, int noautofill)
|
|
428
|
371 {
|
|
|
372 /* This function can GC */
|
|
|
373 /* int hairy = 0; -- unused */
|
|
|
374 REGISTER enum syntaxcode synt;
|
|
867
|
375 REGISTER Ichar c2;
|
|
428
|
376 Lisp_Object overwrite;
|
|
826
|
377 Lisp_Object syntax_table;
|
|
428
|
378 struct buffer *buf = current_buffer;
|
|
|
379 int tab_width;
|
|
|
380
|
|
|
381 overwrite = buf->overwrite_mode;
|
|
826
|
382 syntax_table = buf->mirror_syntax_table;
|
|
428
|
383
|
|
|
384 #if 0
|
|
|
385 /* No, this is very bad, it makes undo *always* undo a character at a time
|
|
|
386 instead of grouping consecutive self-inserts together. Nasty nasty.
|
|
|
387 */
|
|
|
388 if (!NILP (Vbefore_change_functions) || !NILP (Vafter_change_functions)
|
|
|
389 || !NILP (Vbefore_change_function) || !NILP (Vafter_change_function))
|
|
|
390 hairy = 1;
|
|
|
391 #endif
|
|
|
392
|
|
|
393 if (!NILP (overwrite)
|
|
|
394 && BUF_PT (buf) < BUF_ZV (buf)
|
|
|
395 && (EQ (overwrite, Qoverwrite_mode_binary)
|
|
|
396 || (c1 != '\n' && BUF_FETCH_CHAR (buf, BUF_PT (buf)) != '\n'))
|
|
|
397 && (EQ (overwrite, Qoverwrite_mode_binary)
|
|
|
398 || BUF_FETCH_CHAR (buf, BUF_PT (buf)) != '\t'
|
|
|
399 || ((tab_width = XINT (buf->tab_width), tab_width <= 0)
|
|
|
400 || tab_width > 20
|
|
|
401 || !((current_column (buf) + 1) % tab_width))))
|
|
|
402 {
|
|
|
403 buffer_delete_range (buf, BUF_PT (buf), BUF_PT (buf) + 1, 0);
|
|
|
404 /* hairy = 2; */
|
|
|
405 }
|
|
|
406
|
|
|
407 if (!NILP (buf->abbrev_mode)
|
|
|
408 && !WORD_SYNTAX_P (syntax_table, c1)
|
|
|
409 && NILP (buf->read_only)
|
|
|
410 && BUF_PT (buf) > BUF_BEGV (buf))
|
|
|
411 {
|
|
|
412 c2 = BUF_FETCH_CHAR (buf, BUF_PT (buf) - 1);
|
|
|
413
|
|
|
414 if (WORD_SYNTAX_P (syntax_table, c2))
|
|
|
415 {
|
|
|
416 #if 1
|
|
|
417 Fexpand_abbrev ();
|
|
|
418 #else /* FSFmacs */
|
|
|
419 Lisp_Object sym = Fexpand_abbrev ();
|
|
|
420
|
|
|
421 /* I think this is too bogus to add. The function should
|
|
|
422 have a way of examining the character to be inserted, so
|
|
|
423 it can decide whether to insert it or not. We should
|
|
|
424 design it better than that. */
|
|
|
425
|
|
|
426 /* Here FSFmacs remembers MODIFF, compares it after
|
|
|
427 Fexpand_abbrev() finishes, and updates HAIRY. */
|
|
|
428
|
|
|
429 /* NOTE: we cannot simply check for Vlast_abbrev, because
|
|
|
430 Fexpand_abbrev() can bail out before setting it to
|
|
|
431 anything meaningful, leaving us stuck with an old value.
|
|
|
432 Thus Fexpand_abbrev() was extended to return the actual
|
|
|
433 abbrev symbol. */
|
|
|
434 if (!NILP (sym)
|
|
|
435 && !NILP (symbol_function (XSYMBOL (sym)))
|
|
|
436 && SYMBOLP (symbol_function (XSYMBOL (sym))))
|
|
|
437 {
|
|
|
438 Lisp_Object prop = Fget (symbol_function (XSYMBOL (sym)),
|
|
|
439 Qno_self_insert, Qnil);
|
|
|
440 if (!NILP (prop))
|
|
|
441 return;
|
|
|
442 }
|
|
|
443 #endif /* FSFmacs */
|
|
|
444 }
|
|
|
445 }
|
|
442
|
446 if ((CHAR_TABLEP (Vauto_fill_chars)
|
|
826
|
447 ? !NILP (get_char_table (c1, Vauto_fill_chars))
|
|
442
|
448 : (c1 == ' ' || c1 == '\n'))
|
|
428
|
449 && !noautofill
|
|
|
450 && !NILP (buf->auto_fill_function))
|
|
|
451 {
|
|
|
452 buffer_insert_emacs_char (buf, c1);
|
|
|
453 if (c1 == '\n')
|
|
|
454 /* After inserting a newline, move to previous line and fill */
|
|
|
455 /* that. Must have the newline in place already so filling and */
|
|
|
456 /* justification, if any, know where the end is going to be. */
|
|
|
457 BUF_SET_PT (buf, BUF_PT (buf) - 1);
|
|
|
458 call0 (buf->auto_fill_function);
|
|
|
459 if (c1 == '\n')
|
|
|
460 BUF_SET_PT (buf, BUF_PT (buf) + 1);
|
|
|
461 /* hairy = 2; */
|
|
|
462 }
|
|
|
463 else
|
|
|
464 buffer_insert_emacs_char (buf, c1);
|
|
|
465
|
|
|
466 /* If previous command specified a face to use, use it. */
|
|
|
467 if (!NILP (Vself_insert_face)
|
|
|
468 && EQ (Vlast_command, Vself_insert_face_command))
|
|
|
469 {
|
|
|
470 Lisp_Object before = make_int (BUF_PT (buf) - 1);
|
|
|
471 Lisp_Object after = make_int (BUF_PT (buf));
|
|
|
472 Fput_text_property (before, after, Qface, Vself_insert_face, Qnil);
|
|
|
473 Fput_text_property (before, after, Qstart_open, Qt, Qnil);
|
|
|
474 Fput_text_property (before, after, Qend_open, Qnil, Qnil);
|
|
|
475 /* #### FSFmacs properties are normally closed ("sticky") on the
|
|
|
476 end but not the beginning. It's the opposite for us. */
|
|
|
477 Vself_insert_face = Qnil;
|
|
|
478 }
|
|
|
479 synt = SYNTAX (syntax_table, c1);
|
|
|
480 if ((synt == Sclose || synt == Smath)
|
|
|
481 && !NILP (Vblink_paren_function) && INTERACTIVE
|
|
|
482 && !noautofill)
|
|
|
483 {
|
|
|
484 call0 (Vblink_paren_function);
|
|
|
485 /* hairy = 2; */
|
|
|
486 }
|
|
|
487
|
|
|
488 /* return hairy; */
|
|
|
489 }
|
|
|
490
|
|
|
491 /* (this comes from Mule but is a generally good idea) */
|
|
|
492
|
|
|
493 DEFUN ("self-insert-internal", Fself_insert_internal, 1, 1, 0, /*
|
|
444
|
494 Invoke `self-insert-command' as if CHARACTER is entered from keyboard.
|
|
428
|
495 */
|
|
444
|
496 (character))
|
|
428
|
497 {
|
|
|
498 /* This function can GC */
|
|
444
|
499 CHECK_CHAR_COERCE_INT (character);
|
|
|
500 internal_self_insert (XCHAR (character), 0);
|
|
428
|
501 return Qnil;
|
|
|
502 }
|
|
|
503
|
|
|
504 /* module initialization */
|
|
|
505
|
|
|
506 void
|
|
|
507 syms_of_cmds (void)
|
|
|
508 {
|
|
563
|
509 DEFSYMBOL (Qkill_forward_chars);
|
|
|
510 DEFSYMBOL (Qself_insert_command);
|
|
|
511 DEFSYMBOL (Qoverwrite_mode_binary);
|
|
|
512 DEFSYMBOL (Qno_self_insert);
|
|
428
|
513
|
|
|
514 DEFSUBR (Fforward_char);
|
|
|
515 DEFSUBR (Fbackward_char);
|
|
|
516 DEFSUBR (Fforward_line);
|
|
|
517 DEFSUBR (Fbeginning_of_line);
|
|
|
518 DEFSUBR (Fend_of_line);
|
|
|
519
|
|
|
520 DEFSUBR (Fpoint_at_bol);
|
|
|
521 DEFSUBR (Fpoint_at_eol);
|
|
|
522
|
|
|
523 DEFSUBR (Fdelete_char);
|
|
|
524 DEFSUBR (Fdelete_backward_char);
|
|
|
525
|
|
|
526 DEFSUBR (Fself_insert_command);
|
|
|
527 DEFSUBR (Fself_insert_internal);
|
|
|
528 }
|
|
|
529
|
|
|
530 void
|
|
|
531 vars_of_cmds (void)
|
|
|
532 {
|
|
|
533 DEFVAR_LISP ("self-insert-face", &Vself_insert_face /*
|
|
|
534 If non-nil, set the face of the next self-inserting character to this.
|
|
|
535 See also `self-insert-face-command'.
|
|
|
536 */ );
|
|
|
537 Vself_insert_face = Qnil;
|
|
|
538
|
|
|
539 DEFVAR_LISP ("self-insert-face-command", &Vself_insert_face_command /*
|
|
|
540 This is the command that set up `self-insert-face'.
|
|
|
541 If `last-command' does not equal this value, we ignore `self-insert-face'.
|
|
|
542 */ );
|
|
|
543 Vself_insert_face_command = Qnil;
|
|
|
544
|
|
|
545 DEFVAR_LISP ("blink-paren-function", &Vblink_paren_function /*
|
|
|
546 Function called, if non-nil, whenever a close parenthesis is inserted.
|
|
|
547 More precisely, a char with closeparen syntax is self-inserted.
|
|
|
548 */ );
|
|
|
549 Vblink_paren_function = Qnil;
|
|
442
|
550
|
|
|
551 DEFVAR_LISP ("auto-fill-chars", &Vauto_fill_chars /*
|
|
|
552 A char-table for characters which invoke auto-filling.
|
|
444
|
553 Such characters have value t in this table.
|
|
442
|
554 */);
|
|
|
555 Vauto_fill_chars = Fmake_char_table (Qgeneric);
|
|
|
556 XCHAR_TABLE (Vauto_fill_chars)->ascii[' '] = Qt;
|
|
|
557 XCHAR_TABLE (Vauto_fill_chars)->ascii['\n'] = Qt;
|
|
428
|
558 }
|
