|
428
|
1 /* XEmacs routines to deal with syntax tables; also word and list parsing.
|
|
|
2 Copyright (C) 1985-1994 Free Software Foundation, Inc.
|
|
|
3 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
1296
|
4 Copyright (C) 2001, 2002, 2003 Ben Wing.
|
|
428
|
5
|
|
|
6 This file is part of XEmacs.
|
|
|
7
|
|
|
8 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
9 under the terms of the GNU General Public License as published by the
|
|
|
10 Free Software Foundation; either version 2, or (at your option) any
|
|
|
11 later version.
|
|
|
12
|
|
|
13 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
16 for more details.
|
|
|
17
|
|
|
18 You should have received a copy of the GNU General Public License
|
|
|
19 along with XEmacs; see the file COPYING. If not, write to
|
|
|
20 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
21 Boston, MA 02111-1307, USA. */
|
|
|
22
|
|
|
23 /* Synched up with: FSF 19.28. */
|
|
|
24
|
|
|
25 /* This file has been Mule-ized. */
|
|
|
26
|
|
|
27 #include <config.h>
|
|
|
28 #include "lisp.h"
|
|
|
29
|
|
|
30 #include "buffer.h"
|
|
|
31 #include "syntax.h"
|
|
460
|
32 #include "extents.h"
|
|
428
|
33
|
|
460
|
34 #define ST_COMMENT_STYLE 0x101
|
|
|
35 #define ST_STRING_STYLE 0x102
|
|
|
36
|
|
|
37 Lisp_Object Qsyntax_table;
|
|
|
38 int lookup_syntax_properties;
|
|
|
39
|
|
428
|
40 Lisp_Object Qsyntax_table_p;
|
|
|
41
|
|
|
42 int words_include_escapes;
|
|
|
43
|
|
|
44 int parse_sexp_ignore_comments;
|
|
|
45
|
|
|
46 /* The following two variables are provided to tell additional information
|
|
|
47 to the regex routines. We do it this way rather than change the
|
|
|
48 arguments to re_search_2() in an attempt to maintain some call
|
|
|
49 compatibility with other versions of the regex code. */
|
|
|
50
|
|
|
51 /* Tell the regex routines not to QUIT. Normally there is a QUIT
|
|
|
52 each iteration in re_search_2(). */
|
|
|
53 int no_quit_in_re_search;
|
|
|
54
|
|
826
|
55 /* The standard syntax table is stored where it will automatically
|
|
|
56 be used in all new buffers. */
|
|
428
|
57 Lisp_Object Vstandard_syntax_table;
|
|
|
58
|
|
|
59 Lisp_Object Vsyntax_designator_chars_string;
|
|
|
60
|
|
826
|
61 Lisp_Object Vtemp_table_for_use_updating_syntax_tables;
|
|
|
62
|
|
1296
|
63 /* A value that is guaranteed not be in a syntax table. */
|
|
|
64 Lisp_Object Vbogus_syntax_table_value;
|
|
|
65
|
|
826
|
66 static void syntax_cache_table_was_changed (struct buffer *buf);
|
|
|
67
|
|
428
|
68 /* This is the internal form of the parse state used in parse-partial-sexp. */
|
|
|
69
|
|
|
70 struct lisp_parse_state
|
|
|
71 {
|
|
|
72 int depth; /* Depth at end of parsing */
|
|
867
|
73 Ichar instring; /* -1 if not within string, else desired terminator */
|
|
428
|
74 int incomment; /* Nonzero if within a comment at end of parsing */
|
|
460
|
75 int comstyle; /* comment style a=0, or b=1, or ST_COMMENT_STYLE */
|
|
428
|
76 int quoted; /* Nonzero if just after an escape char at end of
|
|
|
77 parsing */
|
|
665
|
78 Charbpos thislevelstart;/* Char number of most recent start-of-expression
|
|
428
|
79 at current level */
|
|
665
|
80 Charbpos prevlevelstart;/* Char number of start of containing expression */
|
|
|
81 Charbpos location; /* Char number at which parsing stopped */
|
|
428
|
82 int mindepth; /* Minimum depth seen while scanning */
|
|
826
|
83 Charbpos comstr_start;/* Position just after last comment/string starter */
|
|
|
84 Lisp_Object levelstarts;/* Char numbers of starts-of-expression
|
|
|
85 of levels (starting from outermost). */
|
|
428
|
86 };
|
|
|
87
|
|
|
88 /* These variables are a cache for finding the start of a defun.
|
|
|
89 find_start_pos is the place for which the defun start was found.
|
|
|
90 find_start_value is the defun start position found for it.
|
|
|
91 find_start_buffer is the buffer it was found in.
|
|
|
92 find_start_begv is the BEGV value when it was found.
|
|
|
93 find_start_modiff is the value of MODIFF when it was found. */
|
|
|
94
|
|
665
|
95 static Charbpos find_start_pos;
|
|
|
96 static Charbpos find_start_value;
|
|
428
|
97 static struct buffer *find_start_buffer;
|
|
665
|
98 static Charbpos find_start_begv;
|
|
428
|
99 static int find_start_modiff;
|
|
|
100
|
|
|
101 /* Find a defun-start that is the last one before POS (or nearly the last).
|
|
|
102 We record what we find, so that another call in the same area
|
|
|
103 can return the same value right away. */
|
|
|
104
|
|
665
|
105 static Charbpos
|
|
|
106 find_defun_start (struct buffer *buf, Charbpos pos)
|
|
428
|
107 {
|
|
665
|
108 Charbpos tem;
|
|
826
|
109 struct syntax_cache *scache;
|
|
|
110
|
|
428
|
111 /* Use previous finding, if it's valid and applies to this inquiry. */
|
|
|
112 if (buf == find_start_buffer
|
|
|
113 /* Reuse the defun-start even if POS is a little farther on.
|
|
|
114 POS might be in the next defun, but that's ok.
|
|
|
115 Our value may not be the best possible, but will still be usable. */
|
|
|
116 && pos <= find_start_pos + 1000
|
|
|
117 && pos >= find_start_value
|
|
|
118 && BUF_BEGV (buf) == find_start_begv
|
|
|
119 && BUF_MODIFF (buf) == find_start_modiff)
|
|
|
120 return find_start_value;
|
|
|
121
|
|
|
122 /* Back up to start of line. */
|
|
|
123 tem = find_next_newline (buf, pos, -1);
|
|
|
124
|
|
826
|
125 scache = setup_buffer_syntax_cache (buf, tem, 1);
|
|
428
|
126 while (tem > BUF_BEGV (buf))
|
|
|
127 {
|
|
826
|
128 UPDATE_SYNTAX_CACHE_BACKWARD (scache, tem);
|
|
460
|
129
|
|
428
|
130 /* Open-paren at start of line means we found our defun-start. */
|
|
826
|
131 if (SYNTAX_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, tem)) == Sopen)
|
|
428
|
132 break;
|
|
|
133 /* Move to beg of previous line. */
|
|
|
134 tem = find_next_newline (buf, tem, -2);
|
|
|
135 }
|
|
|
136
|
|
|
137 /* Record what we found, for the next try. */
|
|
|
138 find_start_value = tem;
|
|
|
139 find_start_buffer = buf;
|
|
|
140 find_start_modiff = BUF_MODIFF (buf);
|
|
|
141 find_start_begv = BUF_BEGV (buf);
|
|
|
142 find_start_pos = pos;
|
|
|
143
|
|
|
144 return find_start_value;
|
|
|
145 }
|
|
|
146
|
|
|
147 DEFUN ("syntax-table-p", Fsyntax_table_p, 1, 1, 0, /*
|
|
444
|
148 Return t if OBJECT is a syntax table.
|
|
428
|
149 Any vector of 256 elements will do.
|
|
|
150 */
|
|
444
|
151 (object))
|
|
428
|
152 {
|
|
444
|
153 return (CHAR_TABLEP (object)
|
|
|
154 && XCHAR_TABLE_TYPE (object) == CHAR_TABLE_TYPE_SYNTAX)
|
|
428
|
155 ? Qt : Qnil;
|
|
|
156 }
|
|
|
157
|
|
|
158 static Lisp_Object
|
|
|
159 check_syntax_table (Lisp_Object obj, Lisp_Object default_)
|
|
|
160 {
|
|
|
161 if (NILP (obj))
|
|
|
162 obj = default_;
|
|
|
163 while (NILP (Fsyntax_table_p (obj)))
|
|
|
164 obj = wrong_type_argument (Qsyntax_table_p, obj);
|
|
|
165 return obj;
|
|
|
166 }
|
|
|
167
|
|
|
168 DEFUN ("syntax-table", Fsyntax_table, 0, 1, 0, /*
|
|
|
169 Return the current syntax table.
|
|
|
170 This is the one specified by the current buffer, or by BUFFER if it
|
|
|
171 is non-nil.
|
|
|
172 */
|
|
|
173 (buffer))
|
|
|
174 {
|
|
|
175 return decode_buffer (buffer, 0)->syntax_table;
|
|
|
176 }
|
|
|
177
|
|
826
|
178 #ifdef DEBUG_XEMACS
|
|
|
179
|
|
|
180 DEFUN ("mirror-syntax-table", Fmirror_syntax_table, 0, 1, 0, /*
|
|
|
181 Return the current mirror syntax table, for debugging purposes.
|
|
|
182 This is the one specified by the current buffer, or by BUFFER if it
|
|
|
183 is non-nil.
|
|
|
184 */
|
|
|
185 (buffer))
|
|
|
186 {
|
|
|
187 return decode_buffer (buffer, 0)->mirror_syntax_table;
|
|
|
188 }
|
|
|
189
|
|
|
190 DEFUN ("syntax-cache-info", Fsyntax_cache_info, 0, 1, 0, /*
|
|
|
191 Return info about the syntax cache in BUFFER.
|
|
|
192 BUFFER defaults to the current buffer if nil.
|
|
|
193 */
|
|
|
194 (buffer))
|
|
|
195 {
|
|
|
196 struct buffer *buf = decode_buffer (buffer, 0);
|
|
|
197 struct syntax_cache *cache = buf->syntax_cache;
|
|
|
198 return list4 (cache->start, cache->end, make_int (cache->prev_change),
|
|
|
199 make_int (cache->next_change));
|
|
|
200 }
|
|
|
201
|
|
|
202 #endif /* DEBUG_XEMACS */
|
|
|
203
|
|
428
|
204 DEFUN ("standard-syntax-table", Fstandard_syntax_table, 0, 0, 0, /*
|
|
|
205 Return the standard syntax table.
|
|
|
206 This is the one used for new buffers.
|
|
|
207 */
|
|
|
208 ())
|
|
|
209 {
|
|
|
210 return Vstandard_syntax_table;
|
|
|
211 }
|
|
|
212
|
|
|
213 DEFUN ("copy-syntax-table", Fcopy_syntax_table, 0, 1, 0, /*
|
|
444
|
214 Return a new syntax table which is a copy of SYNTAX-TABLE.
|
|
|
215 SYNTAX-TABLE defaults to the standard syntax table.
|
|
428
|
216 */
|
|
444
|
217 (syntax_table))
|
|
428
|
218 {
|
|
|
219 if (NILP (Vstandard_syntax_table))
|
|
|
220 return Fmake_char_table (Qsyntax);
|
|
|
221
|
|
444
|
222 syntax_table = check_syntax_table (syntax_table, Vstandard_syntax_table);
|
|
|
223 return Fcopy_char_table (syntax_table);
|
|
428
|
224 }
|
|
|
225
|
|
|
226 DEFUN ("set-syntax-table", Fset_syntax_table, 1, 2, 0, /*
|
|
444
|
227 Select SYNTAX-TABLE as the new syntax table for BUFFER.
|
|
428
|
228 BUFFER defaults to the current buffer if omitted.
|
|
|
229 */
|
|
444
|
230 (syntax_table, buffer))
|
|
428
|
231 {
|
|
|
232 struct buffer *buf = decode_buffer (buffer, 0);
|
|
444
|
233 syntax_table = check_syntax_table (syntax_table, Qnil);
|
|
|
234 buf->syntax_table = syntax_table;
|
|
|
235 buf->mirror_syntax_table = XCHAR_TABLE (syntax_table)->mirror_table;
|
|
826
|
236 syntax_cache_table_was_changed (buf);
|
|
428
|
237 /* Indicate that this buffer now has a specified syntax table. */
|
|
|
238 buf->local_var_flags |= XINT (buffer_local_flags.syntax_table);
|
|
444
|
239 return syntax_table;
|
|
428
|
240 }
|
|
|
241
|
|
826
|
242
|
|
|
243 static void
|
|
|
244 init_syntax_cache (struct syntax_cache *cache, Lisp_Object object,
|
|
|
245 struct buffer *buffer, int infinite)
|
|
|
246 {
|
|
|
247 xzero (*cache);
|
|
|
248 cache->object = object;
|
|
|
249 cache->buffer = buffer;
|
|
|
250 cache->no_syntax_table_prop = 1;
|
|
1296
|
251 cache->syntax_table =
|
|
|
252 BUFFER_SYNTAX_TABLE (cache->buffer);
|
|
|
253 cache->mirror_table =
|
|
826
|
254 BUFFER_MIRROR_SYNTAX_TABLE (cache->buffer);
|
|
|
255 cache->start = Qnil;
|
|
|
256 cache->end = Qnil;
|
|
3250
|
257 /* #### I'm not sure what INFINITE is for, but it's apparently needed by
|
|
|
258 setup_syntax_cache(). It looks like it's supposed to guarantee that
|
|
|
259 the test for POS outside of cache-valid range will never succeed, so
|
|
|
260 that update_syntax_cache won't get called, but it's hard to be sure.
|
|
|
261 Cf reset_buffer_syntax_cache_range. -- sjt */
|
|
826
|
262 if (infinite)
|
|
|
263 {
|
|
|
264 cache->prev_change = EMACS_INT_MIN;
|
|
|
265 cache->next_change = EMACS_INT_MAX;
|
|
|
266 }
|
|
|
267 else
|
|
|
268 {
|
|
|
269 cache->prev_change = -1;
|
|
|
270 cache->next_change = -1;
|
|
|
271 }
|
|
|
272 }
|
|
|
273
|
|
3250
|
274 /* #### This function and associated logic still needs work, and especially
|
|
|
275 documentation. */
|
|
|
276 struct syntax_cache * /* return CACHE or the cache of OBJECT */
|
|
|
277 setup_syntax_cache (struct syntax_cache *cache, /* syntax cache, may be NULL
|
|
|
278 if OBJECT is a buffer */
|
|
|
279 Lisp_Object object, /* the object (if any) cache
|
|
|
280 is associated with */
|
|
|
281 struct buffer *buffer, /* the buffer to use as source
|
|
|
282 of the syntax table */
|
|
|
283 Charxpos from, /* initial position of cache */
|
|
|
284 int count) /* direction? see code */
|
|
826
|
285 {
|
|
3250
|
286 /* If OBJECT is a buffer, use its cache. Initialize cache. Make it valid
|
|
|
287 for the whole buffer if the syntax-table property is not being respected.
|
|
|
288 Else if OBJECT is not a buffer, initialize the cache passed in CACHE.
|
|
|
289 If the syntax-table property is being respected, update the cache. */
|
|
826
|
290 if (BUFFERP (object))
|
|
3250
|
291 {
|
|
|
292 cache = XBUFFER (object)->syntax_cache;
|
|
|
293 if (!lookup_syntax_properties)
|
|
|
294 reset_buffer_syntax_cache_range (cache, object, 1);
|
|
|
295 }
|
|
|
296 else
|
|
826
|
297 init_syntax_cache (cache, object, buffer, 0);
|
|
|
298 if (lookup_syntax_properties)
|
|
|
299 {
|
|
|
300 if (count <= 0)
|
|
|
301 {
|
|
|
302 from--;
|
|
2167
|
303 from = buffer_or_string_clip_to_accessible_char (cache->object,
|
|
826
|
304 from);
|
|
|
305 }
|
|
|
306 if (!(from >= cache->prev_change && from < cache->next_change))
|
|
|
307 update_syntax_cache (cache, from, count);
|
|
|
308 }
|
|
1296
|
309 #ifdef NOT_WORTH_THE_EFFORT
|
|
|
310 update_mirror_syntax_if_dirty (cache->mirror_table);
|
|
|
311 #endif /* NOT_WORTH_THE_EFFORT */
|
|
826
|
312 return cache;
|
|
|
313 }
|
|
|
314
|
|
|
315 struct syntax_cache *
|
|
|
316 setup_buffer_syntax_cache (struct buffer *buffer, Charxpos from, int count)
|
|
|
317 {
|
|
|
318 return setup_syntax_cache (NULL, wrap_buffer (buffer), buffer, from, count);
|
|
|
319 }
|
|
|
320
|
|
1296
|
321 static const struct memory_description syntax_cache_description_1 [] = {
|
|
|
322 { XD_LISP_OBJECT, offsetof (struct syntax_cache, object) },
|
|
|
323 { XD_LISP_OBJECT, offsetof (struct syntax_cache, buffer) },
|
|
|
324 { XD_LISP_OBJECT, offsetof (struct syntax_cache, syntax_table) },
|
|
|
325 { XD_LISP_OBJECT, offsetof (struct syntax_cache, mirror_table) },
|
|
|
326 { XD_LISP_OBJECT, offsetof (struct syntax_cache, start) },
|
|
|
327 { XD_LISP_OBJECT, offsetof (struct syntax_cache, end) },
|
|
|
328 { XD_END }
|
|
|
329 };
|
|
|
330
|
|
3092
|
331 #ifdef NEW_GC
|
|
|
332 DEFINE_LRECORD_IMPLEMENTATION ("syntax-cache", syntax_cache,
|
|
|
333 1, /*dumpable-flag*/
|
|
|
334 0, 0, 0, 0, 0,
|
|
|
335 syntax_cache_description_1,
|
|
|
336 Lisp_Syntax_Cache);
|
|
|
337 #else /* not NEW_GC */
|
|
|
338
|
|
1296
|
339 const struct sized_memory_description syntax_cache_description = {
|
|
|
340 sizeof (struct syntax_cache),
|
|
|
341 syntax_cache_description_1
|
|
|
342 };
|
|
3092
|
343 #endif /* not NEW_GC */
|
|
1296
|
344
|
|
826
|
345 void
|
|
|
346 mark_buffer_syntax_cache (struct buffer *buf)
|
|
|
347 {
|
|
|
348 struct syntax_cache *cache = buf->syntax_cache;
|
|
|
349 if (!cache) /* Vbuffer_defaults and such don't have caches */
|
|
|
350 return;
|
|
|
351 mark_object (cache->object);
|
|
|
352 if (cache->buffer)
|
|
|
353 mark_object (wrap_buffer (cache->buffer));
|
|
1296
|
354 mark_object (cache->syntax_table);
|
|
|
355 mark_object (cache->mirror_table);
|
|
826
|
356 mark_object (cache->start);
|
|
|
357 mark_object (cache->end);
|
|
|
358 }
|
|
460
|
359
|
|
826
|
360 static void
|
|
3250
|
361 reset_buffer_syntax_cache_range (struct syntax_cache *cache,
|
|
|
362 Lisp_Object buffer, int infinite)
|
|
826
|
363 {
|
|
|
364 Fset_marker (cache->start, make_int (1), buffer);
|
|
|
365 Fset_marker (cache->end, make_int (1), buffer);
|
|
|
366 Fset_marker_insertion_type (cache->start, Qt);
|
|
|
367 Fset_marker_insertion_type (cache->end, Qnil);
|
|
3250
|
368 /* #### Should we "cache->no_syntax_table_prop = 1;" here? */
|
|
|
369 /* #### Cf comment on INFINITE in init_syntax_cache. -- sjt */
|
|
|
370 if (infinite)
|
|
|
371 {
|
|
|
372 cache->prev_change = EMACS_INT_MIN;
|
|
|
373 cache->next_change = EMACS_INT_MAX;
|
|
|
374 }
|
|
|
375 else
|
|
|
376 {
|
|
|
377 cache->prev_change = -1;
|
|
|
378 cache->next_change = -1;
|
|
|
379 }
|
|
826
|
380 }
|
|
|
381
|
|
|
382 void
|
|
|
383 init_buffer_syntax_cache (struct buffer *buf)
|
|
|
384 {
|
|
|
385 struct syntax_cache *cache;
|
|
3092
|
386 #ifdef NEW_GC
|
|
|
387 buf->syntax_cache = alloc_lrecord_type (struct syntax_cache,
|
|
|
388 &lrecord_syntax_cache);
|
|
|
389 #else /* not NEW_GC */
|
|
826
|
390 buf->syntax_cache = xnew_and_zero (struct syntax_cache);
|
|
3092
|
391 #endif /* not NEW_GC */
|
|
826
|
392 cache = buf->syntax_cache;
|
|
|
393 cache->object = wrap_buffer (buf);
|
|
|
394 cache->buffer = buf;
|
|
|
395 cache->no_syntax_table_prop = 1;
|
|
1296
|
396 cache->syntax_table = BUFFER_SYNTAX_TABLE (cache->buffer);
|
|
|
397 cache->mirror_table = BUFFER_MIRROR_SYNTAX_TABLE (cache->buffer);
|
|
826
|
398 cache->start = Fmake_marker ();
|
|
|
399 cache->end = Fmake_marker ();
|
|
3250
|
400 reset_buffer_syntax_cache_range (cache, cache->object, 0);
|
|
826
|
401 }
|
|
|
402
|
|
3250
|
403 /* finalize the syntax cache for BUF */
|
|
826
|
404 void
|
|
|
405 uninit_buffer_syntax_cache (struct buffer *buf)
|
|
|
406 {
|
|
3092
|
407 #ifdef NEW_GC
|
|
|
408 mc_free (buf->syntax_cache);
|
|
|
409 #else /* not NEW_GC */
|
|
1726
|
410 xfree (buf->syntax_cache, struct syntax_cache *);
|
|
3092
|
411 #endif /* not NEW_GC */
|
|
826
|
412 buf->syntax_cache = 0;
|
|
|
413 }
|
|
|
414
|
|
|
415
|
|
|
416 static void
|
|
|
417 syntax_cache_table_was_changed (struct buffer *buf)
|
|
|
418 {
|
|
|
419 struct syntax_cache *cache = buf->syntax_cache;
|
|
|
420 if (cache->no_syntax_table_prop)
|
|
1296
|
421 {
|
|
|
422 cache->syntax_table =
|
|
|
423 BUFFER_SYNTAX_TABLE (buf);
|
|
|
424 cache->mirror_table =
|
|
|
425 BUFFER_MIRROR_SYNTAX_TABLE (buf);
|
|
|
426 }
|
|
826
|
427 }
|
|
|
428
|
|
|
429 /* The syntax-table property on the range covered by EXTENT may be changing,
|
|
|
430 either because EXTENT has a syntax-table property and is being attached
|
|
|
431 or detached (this includes having its endpoints changed), or because
|
|
|
432 the value of EXTENT's syntax-table property is changing. */
|
|
|
433
|
|
|
434 void
|
|
3250
|
435 signal_syntax_cache_extent_changed (EXTENT extent)
|
|
826
|
436 {
|
|
872
|
437 Lisp_Object buffer = Fextent_object (wrap_extent (extent));
|
|
826
|
438 if (BUFFERP (buffer))
|
|
|
439 {
|
|
3250
|
440 /* This was getting called with the buffer's start and end null, eg in
|
|
|
441 cperl mode, which triggers an assert in byte_marker_position. Cf
|
|
|
442 thread rooted at <yxz7j7xzk97.fsf@gimli.holgi.priv> on xemacs-beta.
|
|
|
443 <yxzfymklb6p.fsf@gimli.holgi.priv> has a recipe, but you also need
|
|
|
444 to delete or type SPC to get the crash.
|
|
|
445 #### Delete this comment when setup_syntax_cache is made sane. */
|
|
826
|
446 struct syntax_cache *cache = XBUFFER (buffer)->syntax_cache;
|
|
3250
|
447 /* #### would this be slower or less accurate in character terms? */
|
|
826
|
448 Bytexpos start = extent_endpoint_byte (extent, 0);
|
|
|
449 Bytexpos end = extent_endpoint_byte (extent, 1);
|
|
|
450 Bytexpos start2 = byte_marker_position (cache->start);
|
|
|
451 Bytexpos end2 = byte_marker_position (cache->end);
|
|
3250
|
452 /* If the extent is entirely before or entirely after the cache
|
|
|
453 range, it doesn't overlap. Otherwise, invalidate the range. */
|
|
826
|
454 if (!(end < start2 || start > end2))
|
|
3250
|
455 reset_buffer_syntax_cache_range (cache, buffer, 0);
|
|
826
|
456 }
|
|
|
457 }
|
|
|
458
|
|
|
459 /* Extents have been adjusted for insertion or deletion, so we need to
|
|
|
460 refetch the start and end position of the extent */
|
|
|
461 void
|
|
3250
|
462 signal_syntax_cache_extent_adjust (struct buffer *buf)
|
|
826
|
463 {
|
|
|
464 struct syntax_cache *cache = buf->syntax_cache;
|
|
|
465 /* If the cache was invalid before, leave it that way. We only want
|
|
|
466 to update the limits of validity when they were actually valid. */
|
|
|
467 if (cache->prev_change < 0)
|
|
|
468 return;
|
|
|
469 cache->prev_change = marker_position (cache->start);
|
|
|
470 cache->next_change = marker_position (cache->end);
|
|
|
471 }
|
|
460
|
472
|
|
|
473 /*
|
|
|
474 Update syntax_cache to an appropriate setting for position POS
|
|
|
475
|
|
|
476 The sign of COUNT gives the relative position of POS wrt the
|
|
|
477 previously valid interval. (not currently used)
|
|
|
478
|
|
|
479 `syntax_cache.*_change' are the next and previous positions at
|
|
|
480 which syntax_code and c_s_t will need to be recalculated.
|
|
|
481
|
|
3025
|
482 #### Currently this code uses `get-char-property', which will
|
|
460
|
483 return the "last smallest" extent at a given position. In cases
|
|
|
484 where overlapping extents are defined, this code will simply use
|
|
|
485 whatever is returned by get-char-property.
|
|
|
486
|
|
|
487 It might be worth it at some point to merge provided syntax tables
|
|
826
|
488 outward to the current buffer (#### rewrite in English please?!). */
|
|
460
|
489
|
|
|
490 void
|
|
2286
|
491 update_syntax_cache (struct syntax_cache *cache, Charxpos cpos,
|
|
|
492 int UNUSED (count))
|
|
460
|
493 {
|
|
|
494 Lisp_Object tmp_table;
|
|
826
|
495 Bytexpos pos;
|
|
|
496 Bytexpos lim;
|
|
|
497 Bytexpos next, prev;
|
|
|
498 int at_begin = 0, at_end = 0;
|
|
460
|
499
|
|
826
|
500 if (NILP (cache->object))
|
|
|
501 return;
|
|
|
502
|
|
|
503 pos = buffer_or_string_charxpos_to_bytexpos (cache->object, cpos);
|
|
|
504
|
|
|
505 tmp_table = get_char_property (pos, Qsyntax_table, cache->object,
|
|
|
506 EXTENT_AT_AFTER, 0);
|
|
2506
|
507 lim = next_previous_single_property_change (pos, Qsyntax_table,
|
|
|
508 cache->object, -1, 1, 0);
|
|
826
|
509 if (lim < 0)
|
|
460
|
510 {
|
|
826
|
511 next = buffer_or_string_absolute_end_byte (cache->object);
|
|
|
512 at_begin = 1;
|
|
460
|
513 }
|
|
826
|
514 else
|
|
|
515 next = lim;
|
|
460
|
516
|
|
826
|
517 if (pos < buffer_or_string_absolute_end_byte (cache->object))
|
|
|
518 pos = next_bytexpos (cache->object, pos);
|
|
2506
|
519 lim = next_previous_single_property_change (pos, Qsyntax_table,
|
|
|
520 cache->object, -1, 0, 0);
|
|
826
|
521 if (lim < 0)
|
|
460
|
522 {
|
|
826
|
523 prev = buffer_or_string_absolute_begin_byte (cache->object);
|
|
|
524 at_end = 1;
|
|
460
|
525 }
|
|
|
526 else
|
|
826
|
527 prev = lim;
|
|
460
|
528
|
|
826
|
529 cache->prev_change =
|
|
|
530 buffer_or_string_bytexpos_to_charxpos (cache->object, prev);
|
|
|
531 cache->next_change =
|
|
|
532 buffer_or_string_bytexpos_to_charxpos (cache->object, next);
|
|
460
|
533
|
|
826
|
534 if (BUFFERP (cache->object))
|
|
|
535 {
|
|
|
536 /* If we are at the beginning or end of buffer, check to see if there's
|
|
|
537 a zero-length `syntax-table' extent there (highly unlikely); if not,
|
|
|
538 then we can safely make the end closed, so it will take in newly
|
|
|
539 inserted text. (If such an extent is inserted, we will be informed
|
|
3250
|
540 through signal_syntax_cache_extent_changed().) */
|
|
826
|
541 Fset_marker (cache->start, make_int (cache->prev_change), cache->object);
|
|
|
542 Fset_marker_insertion_type
|
|
|
543 (cache->start,
|
|
|
544 at_begin && NILP (extent_at (prev, cache->object, Qsyntax_table,
|
|
|
545 NULL, EXTENT_AT_AT, 0))
|
|
|
546 ? Qnil : Qt);
|
|
|
547 Fset_marker (cache->end, make_int (cache->next_change), cache->object);
|
|
|
548 Fset_marker_insertion_type
|
|
|
549 (cache->end,
|
|
|
550 at_end && NILP (extent_at (next, cache->object, Qsyntax_table,
|
|
|
551 NULL, EXTENT_AT_AT, 0))
|
|
|
552 ? Qt : Qnil);
|
|
|
553 }
|
|
|
554
|
|
|
555 if (!NILP (Fsyntax_table_p (tmp_table)))
|
|
|
556 {
|
|
|
557 cache->use_code = 0;
|
|
1296
|
558 cache->syntax_table = tmp_table;
|
|
|
559 cache->mirror_table = XCHAR_TABLE (tmp_table)->mirror_table;
|
|
826
|
560 cache->no_syntax_table_prop = 0;
|
|
1296
|
561 #ifdef NOT_WORTH_THE_EFFORT
|
|
|
562 update_mirror_syntax_if_dirty (cache->mirror_table);
|
|
|
563 #endif /* NOT_WORTH_THE_EFFORT */
|
|
826
|
564 }
|
|
|
565 else if (CONSP (tmp_table) && INTP (XCAR (tmp_table)))
|
|
|
566 {
|
|
|
567 cache->use_code = 1;
|
|
|
568 cache->syntax_code = XINT (XCAR (tmp_table));
|
|
|
569 cache->no_syntax_table_prop = 0;
|
|
|
570 }
|
|
|
571 else
|
|
|
572 {
|
|
|
573 cache->use_code = 0;
|
|
|
574 cache->no_syntax_table_prop = 1;
|
|
1296
|
575 cache->syntax_table = BUFFER_SYNTAX_TABLE (cache->buffer);
|
|
|
576 cache->mirror_table = BUFFER_MIRROR_SYNTAX_TABLE (cache->buffer);
|
|
|
577 #ifdef NOT_WORTH_THE_EFFORT
|
|
|
578 update_mirror_syntax_if_dirty (cache->mirror_table);
|
|
|
579 #endif /* NOT_WORTH_THE_EFFORT */
|
|
460
|
580 }
|
|
|
581 }
|
|
|
582
|
|
428
|
583 /* Convert a letter which signifies a syntax code
|
|
|
584 into the code it signifies.
|
|
|
585 This is used by modify-syntax-entry, and other things. */
|
|
|
586
|
|
442
|
587 const unsigned char syntax_spec_code[0400] =
|
|
428
|
588 { 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
589 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
590 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
591 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
592 (char) Swhitespace, 0377, (char) Sstring, 0377,
|
|
|
593 (char) Smath, 0377, 0377, (char) Squote,
|
|
|
594 (char) Sopen, (char) Sclose, 0377, 0377,
|
|
|
595 0377, (char) Swhitespace, (char) Spunct, (char) Scharquote,
|
|
|
596 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
597 0377, 0377, 0377, 0377,
|
|
|
598 (char) Scomment, 0377, (char) Sendcomment, 0377,
|
|
|
599 (char) Sinherit, 0377, 0377, 0377, 0377, 0377, 0377, 0377, /* @, A ... */
|
|
|
600 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
601 0377, 0377, 0377, 0377, 0377, 0377, 0377, (char) Sword,
|
|
|
602 0377, 0377, 0377, 0377, (char) Sescape, 0377, 0377, (char) Ssymbol,
|
|
|
603 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377, /* `, a, ... */
|
|
|
604 0377, 0377, 0377, 0377, 0377, 0377, 0377, 0377,
|
|
|
605 0377, 0377, 0377, 0377, 0377, 0377, 0377, (char) Sword,
|
|
460
|
606 0377, 0377, 0377, 0377, (char) Sstring_fence, 0377, 0377, 0377
|
|
428
|
607 };
|
|
|
608
|
|
460
|
609 const unsigned char syntax_code_spec[] = " .w_()'\"$\\/<>@!|";
|
|
428
|
610
|
|
|
611 DEFUN ("syntax-designator-chars", Fsyntax_designator_chars, 0, 0, 0, /*
|
|
|
612 Return a string of the recognized syntax designator chars.
|
|
|
613 The chars are ordered by their internal syntax codes, which are
|
|
|
614 numbered starting at 0.
|
|
|
615 */
|
|
|
616 ())
|
|
|
617 {
|
|
|
618 return Vsyntax_designator_chars_string;
|
|
|
619 }
|
|
|
620
|
|
|
621 DEFUN ("char-syntax", Fchar_syntax, 1, 2, 0, /*
|
|
444
|
622 Return the syntax code of CHARACTER, described by a character.
|
|
|
623 For example, if CHARACTER is a word constituent,
|
|
|
624 the character `?w' is returned.
|
|
428
|
625 The characters that correspond to various syntax codes
|
|
|
626 are listed in the documentation of `modify-syntax-entry'.
|
|
444
|
627 Optional second argument SYNTAX-TABLE defaults to the current buffer's
|
|
428
|
628 syntax table.
|
|
|
629 */
|
|
444
|
630 (character, syntax_table))
|
|
428
|
631 {
|
|
826
|
632 Lisp_Object mirrortab;
|
|
428
|
633
|
|
444
|
634 if (NILP (character))
|
|
428
|
635 {
|
|
444
|
636 character = make_char ('\000');
|
|
428
|
637 }
|
|
444
|
638 CHECK_CHAR_COERCE_INT (character);
|
|
826
|
639 syntax_table = check_syntax_table (syntax_table,
|
|
|
640 current_buffer->syntax_table);
|
|
|
641 mirrortab = XCHAR_TABLE (syntax_table)->mirror_table;
|
|
|
642 return make_char (syntax_code_spec[(int) SYNTAX (mirrortab,
|
|
|
643 XCHAR (character))]);
|
|
428
|
644 }
|
|
|
645
|
|
|
646 #ifdef MULE
|
|
|
647
|
|
|
648 enum syntaxcode
|
|
2286
|
649 charset_syntax (struct buffer *UNUSED (buf), Lisp_Object UNUSED (charset),
|
|
|
650 int *multi_p_out)
|
|
428
|
651 {
|
|
|
652 *multi_p_out = 1;
|
|
826
|
653 /* !!#### get this right */
|
|
3152
|
654 return Sword;
|
|
428
|
655 }
|
|
|
656
|
|
|
657 #endif
|
|
|
658
|
|
|
659 Lisp_Object
|
|
867
|
660 syntax_match (Lisp_Object syntax_table, Ichar ch)
|
|
428
|
661 {
|
|
826
|
662 Lisp_Object code = get_char_table (ch, syntax_table);
|
|
428
|
663 Lisp_Object code2 = code;
|
|
|
664
|
|
|
665 if (CONSP (code))
|
|
|
666 code2 = XCAR (code);
|
|
|
667 if (SYNTAX_FROM_CODE (XINT (code2)) == Sinherit)
|
|
826
|
668 code = get_char_table (ch, Vstandard_syntax_table);
|
|
428
|
669
|
|
|
670 return CONSP (code) ? XCDR (code) : Qnil;
|
|
|
671 }
|
|
|
672
|
|
|
673 DEFUN ("matching-paren", Fmatching_paren, 1, 2, 0, /*
|
|
444
|
674 Return the matching parenthesis of CHARACTER, or nil if none.
|
|
|
675 Optional second argument SYNTAX-TABLE defaults to the current buffer's
|
|
428
|
676 syntax table.
|
|
|
677 */
|
|
444
|
678 (character, syntax_table))
|
|
428
|
679 {
|
|
826
|
680 Lisp_Object mirrortab;
|
|
1315
|
681 enum syntaxcode code;
|
|
428
|
682
|
|
444
|
683 CHECK_CHAR_COERCE_INT (character);
|
|
826
|
684 syntax_table = check_syntax_table (syntax_table,
|
|
|
685 current_buffer->syntax_table);
|
|
|
686 mirrortab = XCHAR_TABLE (syntax_table)->mirror_table;
|
|
444
|
687 code = SYNTAX (mirrortab, XCHAR (character));
|
|
428
|
688 if (code == Sopen || code == Sclose || code == Sstring)
|
|
444
|
689 return syntax_match (syntax_table, XCHAR (character));
|
|
428
|
690 return Qnil;
|
|
|
691 }
|
|
|
692
|
|
|
693
|
|
|
694
|
|
|
695 #ifdef MULE
|
|
|
696 /* Return 1 if there is a word boundary between two word-constituent
|
|
|
697 characters C1 and C2 if they appear in this order, else return 0.
|
|
|
698 There is no word boundary between two word-constituent ASCII
|
|
|
699 characters. */
|
|
|
700 #define WORD_BOUNDARY_P(c1, c2) \
|
|
867
|
701 (!(ichar_ascii_p (c1) && ichar_ascii_p (c2)) \
|
|
428
|
702 && word_boundary_p (c1, c2))
|
|
|
703 #endif
|
|
|
704
|
|
|
705 /* Return the position across COUNT words from FROM.
|
|
|
706 If that many words cannot be found before the end of the buffer, return 0.
|
|
|
707 COUNT negative means scan backward and stop at word beginning. */
|
|
|
708
|
|
665
|
709 Charbpos
|
|
|
710 scan_words (struct buffer *buf, Charbpos from, int count)
|
|
428
|
711 {
|
|
665
|
712 Charbpos limit = count > 0 ? BUF_ZV (buf) : BUF_BEGV (buf);
|
|
867
|
713 Ichar ch0, ch1;
|
|
428
|
714 enum syntaxcode code;
|
|
826
|
715 struct syntax_cache *scache = setup_buffer_syntax_cache (buf, from, count);
|
|
460
|
716
|
|
428
|
717 /* #### is it really worth it to hand expand both cases? JV */
|
|
|
718 while (count > 0)
|
|
|
719 {
|
|
|
720 QUIT;
|
|
|
721
|
|
|
722 while (1)
|
|
|
723 {
|
|
|
724 if (from == limit)
|
|
|
725 return 0;
|
|
|
726
|
|
826
|
727 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
728 ch0 = BUF_FETCH_CHAR (buf, from);
|
|
826
|
729 code = SYNTAX_FROM_CACHE (scache, ch0);
|
|
428
|
730
|
|
442
|
731 from++;
|
|
428
|
732 if (words_include_escapes
|
|
|
733 && (code == Sescape || code == Scharquote))
|
|
|
734 break;
|
|
|
735 if (code == Sword)
|
|
|
736 break;
|
|
|
737 }
|
|
|
738
|
|
|
739 QUIT;
|
|
|
740
|
|
|
741 while (from != limit)
|
|
|
742 {
|
|
826
|
743 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
744 ch1 = BUF_FETCH_CHAR (buf, from);
|
|
826
|
745 code = SYNTAX_FROM_CACHE (scache, ch1);
|
|
428
|
746 if (!(words_include_escapes
|
|
|
747 && (code == Sescape || code == Scharquote)))
|
|
|
748 if (code != Sword
|
|
|
749 #ifdef MULE
|
|
|
750 || WORD_BOUNDARY_P (ch0, ch1)
|
|
434
|
751 #endif
|
|
428
|
752 )
|
|
|
753 break;
|
|
|
754 #ifdef MULE
|
|
|
755 ch0 = ch1;
|
|
434
|
756 #endif
|
|
428
|
757 from++;
|
|
|
758 }
|
|
|
759 count--;
|
|
|
760 }
|
|
|
761
|
|
|
762 while (count < 0)
|
|
|
763 {
|
|
|
764 QUIT;
|
|
|
765
|
|
|
766 while (1)
|
|
|
767 {
|
|
|
768 if (from == limit)
|
|
|
769 return 0;
|
|
|
770
|
|
826
|
771 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
428
|
772 ch1 = BUF_FETCH_CHAR (buf, from - 1);
|
|
826
|
773 code = SYNTAX_FROM_CACHE (scache, ch1);
|
|
460
|
774 from--;
|
|
442
|
775
|
|
428
|
776 if (words_include_escapes
|
|
|
777 && (code == Sescape || code == Scharquote))
|
|
|
778 break;
|
|
|
779 if (code == Sword)
|
|
|
780 break;
|
|
|
781 }
|
|
|
782
|
|
|
783 QUIT;
|
|
|
784
|
|
|
785 while (from != limit)
|
|
|
786 {
|
|
826
|
787 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
428
|
788 ch0 = BUF_FETCH_CHAR (buf, from - 1);
|
|
826
|
789 code = SYNTAX_FROM_CACHE (scache, ch0);
|
|
460
|
790
|
|
428
|
791 if (!(words_include_escapes
|
|
|
792 && (code == Sescape || code == Scharquote)))
|
|
|
793 if (code != Sword
|
|
|
794 #ifdef MULE
|
|
|
795 || WORD_BOUNDARY_P (ch0, ch1)
|
|
|
796 #endif
|
|
|
797 )
|
|
|
798 break;
|
|
|
799 #ifdef MULE
|
|
|
800 ch1 = ch0;
|
|
|
801 #endif
|
|
|
802 from--;
|
|
|
803 }
|
|
|
804 count++;
|
|
|
805 }
|
|
|
806
|
|
|
807 return from;
|
|
|
808 }
|
|
|
809
|
|
446
|
810 DEFUN ("forward-word", Fforward_word, 0, 2, "_p", /*
|
|
428
|
811 Move point forward COUNT words (backward if COUNT is negative).
|
|
446
|
812 Normally t is returned, but if an edge of the buffer is reached,
|
|
|
813 point is left there and nil is returned.
|
|
428
|
814
|
|
462
|
815 The characters that are moved over may be added to the current selection
|
|
|
816 \(i.e. active region) if the Shift key is held down, a motion key is used
|
|
|
817 to invoke this command, and `shifted-motion-keys-select-region' is t; see
|
|
|
818 the documentation for this variable for more details.
|
|
|
819
|
|
446
|
820 COUNT defaults to 1, and BUFFER defaults to the current buffer.
|
|
428
|
821 */
|
|
|
822 (count, buffer))
|
|
|
823 {
|
|
665
|
824 Charbpos val;
|
|
428
|
825 struct buffer *buf = decode_buffer (buffer, 0);
|
|
446
|
826 EMACS_INT n;
|
|
|
827
|
|
|
828 if (NILP (count))
|
|
|
829 n = 1;
|
|
|
830 else
|
|
|
831 {
|
|
|
832 CHECK_INT (count);
|
|
|
833 n = XINT (count);
|
|
|
834 }
|
|
428
|
835
|
|
446
|
836 val = scan_words (buf, BUF_PT (buf), n);
|
|
|
837 if (val)
|
|
428
|
838 {
|
|
446
|
839 BUF_SET_PT (buf, val);
|
|
|
840 return Qt;
|
|
|
841 }
|
|
|
842 else
|
|
|
843 {
|
|
|
844 BUF_SET_PT (buf, n > 0 ? BUF_ZV (buf) : BUF_BEGV (buf));
|
|
428
|
845 return Qnil;
|
|
|
846 }
|
|
|
847 }
|
|
|
848
|
|
|
849 static void scan_sexps_forward (struct buffer *buf,
|
|
|
850 struct lisp_parse_state *,
|
|
665
|
851 Charbpos from, Charbpos end,
|
|
428
|
852 int targetdepth, int stopbefore,
|
|
|
853 Lisp_Object oldstate,
|
|
|
854 int commentstop);
|
|
|
855
|
|
|
856 static int
|
|
665
|
857 find_start_of_comment (struct buffer *buf, Charbpos from, Charbpos stop,
|
|
460
|
858 int comstyle)
|
|
428
|
859 {
|
|
867
|
860 Ichar c;
|
|
428
|
861 enum syntaxcode code;
|
|
|
862
|
|
|
863 /* Look back, counting the parity of string-quotes,
|
|
|
864 and recording the comment-starters seen.
|
|
|
865 When we reach a safe place, assume that's not in a string;
|
|
|
866 then step the main scan to the earliest comment-starter seen
|
|
|
867 an even number of string quotes away from the safe place.
|
|
|
868
|
|
|
869 OFROM[I] is position of the earliest comment-starter seen
|
|
|
870 which is I+2X quotes from the comment-end.
|
|
|
871 PARITY is current parity of quotes from the comment end. */
|
|
|
872 int parity = 0;
|
|
867
|
873 Ichar my_stringend = 0;
|
|
428
|
874 int string_lossage = 0;
|
|
665
|
875 Charbpos comment_end = from;
|
|
|
876 Charbpos comstart_pos = 0;
|
|
428
|
877 int comstart_parity = 0;
|
|
|
878 int styles_match_p = 0;
|
|
460
|
879 /* mask to match comment styles against; for ST_COMMENT_STYLE, this
|
|
|
880 will get set to SYNTAX_COMMENT_STYLE_B, but never get checked */
|
|
|
881 int mask = comstyle ? SYNTAX_COMMENT_STYLE_B : SYNTAX_COMMENT_STYLE_A;
|
|
826
|
882 struct syntax_cache *scache = buf->syntax_cache;
|
|
428
|
883
|
|
|
884 /* At beginning of range to scan, we're outside of strings;
|
|
|
885 that determines quote parity to the comment-end. */
|
|
|
886 while (from != stop)
|
|
|
887 {
|
|
460
|
888 int syncode;
|
|
|
889
|
|
428
|
890 /* Move back and examine a character. */
|
|
|
891 from--;
|
|
826
|
892 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
428
|
893
|
|
|
894 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
895 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
896 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
897
|
|
|
898 /* is this a 1-char comment end sequence? if so, try
|
|
|
899 to see if style matches previously extracted mask */
|
|
|
900 if (code == Sendcomment)
|
|
|
901 {
|
|
|
902 styles_match_p =
|
|
460
|
903 SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode) & mask;
|
|
428
|
904 }
|
|
|
905
|
|
|
906 /* or are we looking at a 1-char comment start sequence
|
|
|
907 of the style matching mask? */
|
|
460
|
908 else if (code == Scomment)
|
|
428
|
909 {
|
|
460
|
910 styles_match_p =
|
|
|
911 SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode) & mask;
|
|
428
|
912 }
|
|
|
913
|
|
460
|
914 /* otherwise, is this a 2-char comment end or start sequence? */
|
|
|
915 else if (from > stop)
|
|
|
916 do
|
|
|
917 {
|
|
|
918 /* 2-char comment end sequence? */
|
|
|
919 if (SYNTAX_CODE_END_SECOND_P (syncode))
|
|
|
920 {
|
|
|
921 int prev_syncode;
|
|
826
|
922 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
460
|
923 prev_syncode =
|
|
1315
|
924 SYNTAX_CODE_FROM_CACHE (scache,
|
|
|
925 BUF_FETCH_CHAR (buf, from - 1));
|
|
460
|
926
|
|
|
927 if (SYNTAX_CODES_END_P (prev_syncode, syncode))
|
|
|
928 {
|
|
|
929 code = Sendcomment;
|
|
|
930 styles_match_p =
|
|
826
|
931 SYNTAX_CODES_COMMENT_MASK_END (prev_syncode,
|
|
|
932 syncode) & mask;
|
|
460
|
933 from--;
|
|
826
|
934 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
460
|
935 c = BUF_FETCH_CHAR (buf, from);
|
|
|
936
|
|
|
937 /* Found a comment-end sequence, so skip past the
|
|
|
938 check for a comment-start */
|
|
|
939 break;
|
|
|
940 }
|
|
|
941 }
|
|
|
942
|
|
|
943 /* 2-char comment start sequence? */
|
|
|
944 if (SYNTAX_CODE_START_SECOND_P (syncode))
|
|
|
945 {
|
|
|
946 int prev_syncode;
|
|
826
|
947 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
460
|
948 prev_syncode =
|
|
1315
|
949 SYNTAX_CODE_FROM_CACHE (scache,
|
|
|
950 BUF_FETCH_CHAR (buf, from - 1));
|
|
460
|
951
|
|
|
952 if (SYNTAX_CODES_START_P (prev_syncode, syncode))
|
|
|
953 {
|
|
|
954 code = Scomment;
|
|
|
955 styles_match_p =
|
|
826
|
956 SYNTAX_CODES_COMMENT_MASK_START (prev_syncode,
|
|
|
957 syncode) & mask;
|
|
460
|
958 from--;
|
|
826
|
959 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
460
|
960 c = BUF_FETCH_CHAR (buf, from);
|
|
|
961 }
|
|
|
962 }
|
|
|
963 } while (0);
|
|
428
|
964
|
|
|
965 /* Ignore escaped characters. */
|
|
|
966 if (char_quoted (buf, from))
|
|
|
967 continue;
|
|
|
968
|
|
|
969 /* Track parity of quotes. */
|
|
|
970 if (code == Sstring)
|
|
|
971 {
|
|
|
972 parity ^= 1;
|
|
|
973 if (my_stringend == 0)
|
|
|
974 my_stringend = c;
|
|
|
975 /* If we have two kinds of string delimiters.
|
|
|
976 There's no way to grok this scanning backwards. */
|
|
|
977 else if (my_stringend != c)
|
|
|
978 string_lossage = 1;
|
|
|
979 }
|
|
|
980
|
|
460
|
981 if (code == Sstring_fence || code == Scomment_fence)
|
|
|
982 {
|
|
|
983 parity ^= 1;
|
|
|
984 if (my_stringend == 0)
|
|
|
985 my_stringend =
|
|
|
986 code == Sstring_fence ? ST_STRING_STYLE : ST_COMMENT_STYLE;
|
|
|
987 /* If we have two kinds of string delimiters.
|
|
|
988 There's no way to grok this scanning backwards. */
|
|
|
989 else if (my_stringend != (code == Sstring_fence
|
|
|
990 ? ST_STRING_STYLE : ST_COMMENT_STYLE))
|
|
|
991 string_lossage = 1;
|
|
|
992 }
|
|
|
993
|
|
428
|
994 /* Record comment-starters according to that
|
|
|
995 quote-parity to the comment-end. */
|
|
|
996 if (code == Scomment && styles_match_p)
|
|
|
997 {
|
|
|
998 comstart_parity = parity;
|
|
|
999 comstart_pos = from;
|
|
|
1000 }
|
|
|
1001
|
|
|
1002 /* If we find another earlier comment-ender,
|
|
|
1003 any comment-starts earlier than that don't count
|
|
|
1004 (because they go with the earlier comment-ender). */
|
|
|
1005 if (code == Sendcomment && styles_match_p)
|
|
|
1006 break;
|
|
|
1007
|
|
|
1008 /* Assume a defun-start point is outside of strings. */
|
|
|
1009 if (code == Sopen
|
|
|
1010 && (from == stop || BUF_FETCH_CHAR (buf, from - 1) == '\n'))
|
|
|
1011 break;
|
|
|
1012 }
|
|
|
1013
|
|
|
1014 if (comstart_pos == 0)
|
|
|
1015 from = comment_end;
|
|
|
1016 /* If the earliest comment starter
|
|
|
1017 is followed by uniform paired string quotes or none,
|
|
|
1018 we know it can't be inside a string
|
|
|
1019 since if it were then the comment ender would be inside one.
|
|
|
1020 So it does start a comment. Skip back to it. */
|
|
|
1021 else if (comstart_parity == 0 && !string_lossage)
|
|
|
1022 from = comstart_pos;
|
|
|
1023 else
|
|
|
1024 {
|
|
|
1025 /* We had two kinds of string delimiters mixed up
|
|
|
1026 together. Decode this going forwards.
|
|
|
1027 Scan fwd from the previous comment ender
|
|
|
1028 to the one in question; this records where we
|
|
|
1029 last passed a comment starter. */
|
|
|
1030
|
|
|
1031 struct lisp_parse_state state;
|
|
|
1032 scan_sexps_forward (buf, &state, find_defun_start (buf, comment_end),
|
|
|
1033 comment_end - 1, -10000, 0, Qnil, 0);
|
|
|
1034 if (state.incomment)
|
|
460
|
1035 from = state.comstr_start;
|
|
428
|
1036 else
|
|
|
1037 /* We can't grok this as a comment; scan it normally. */
|
|
|
1038 from = comment_end;
|
|
826
|
1039 UPDATE_SYNTAX_CACHE_FORWARD (scache, from - 1);
|
|
428
|
1040 }
|
|
|
1041 return from;
|
|
|
1042 }
|
|
|
1043
|
|
665
|
1044 static Charbpos
|
|
826
|
1045 find_end_of_comment (struct buffer *buf, Charbpos from, Charbpos stop,
|
|
|
1046 int comstyle)
|
|
428
|
1047 {
|
|
|
1048 int c;
|
|
460
|
1049 int prev_code;
|
|
|
1050 /* mask to match comment styles against; for ST_COMMENT_STYLE, this
|
|
|
1051 will get set to SYNTAX_COMMENT_STYLE_B, but never get checked */
|
|
|
1052 int mask = comstyle ? SYNTAX_COMMENT_STYLE_B : SYNTAX_COMMENT_STYLE_A;
|
|
826
|
1053 struct syntax_cache *scache = buf->syntax_cache;
|
|
428
|
1054
|
|
460
|
1055 /* This is only called by functions which have already set up the
|
|
|
1056 syntax_cache and are keeping it up-to-date */
|
|
428
|
1057 while (1)
|
|
|
1058 {
|
|
|
1059 if (from == stop)
|
|
|
1060 {
|
|
|
1061 return -1;
|
|
|
1062 }
|
|
460
|
1063
|
|
826
|
1064 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1065 c = BUF_FETCH_CHAR (buf, from);
|
|
460
|
1066
|
|
|
1067 /* Test for generic comments */
|
|
|
1068 if (comstyle == ST_COMMENT_STYLE)
|
|
|
1069 {
|
|
826
|
1070 if (SYNTAX_FROM_CACHE (scache, c) == Scomment_fence)
|
|
460
|
1071 {
|
|
|
1072 from++;
|
|
826
|
1073 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1074 break;
|
|
|
1075 }
|
|
|
1076 from++;
|
|
|
1077 continue; /* No need to test other comment styles in a
|
|
|
1078 generic comment */
|
|
|
1079 }
|
|
|
1080 else
|
|
|
1081
|
|
826
|
1082 if (SYNTAX_FROM_CACHE (scache, c) == Sendcomment
|
|
460
|
1083 && SYNTAX_CODE_MATCHES_1CHAR_P
|
|
826
|
1084 (SYNTAX_CODE_FROM_CACHE (scache, c), mask))
|
|
428
|
1085 /* we have encountered a comment end of the same style
|
|
|
1086 as the comment sequence which began this comment
|
|
|
1087 section */
|
|
460
|
1088 {
|
|
|
1089 from++;
|
|
826
|
1090 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1091 break;
|
|
|
1092 }
|
|
428
|
1093
|
|
826
|
1094 prev_code = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
428
|
1095 from++;
|
|
826
|
1096 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1097 if (from < stop
|
|
460
|
1098 && SYNTAX_CODES_MATCH_END_P
|
|
|
1099 (prev_code,
|
|
826
|
1100 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from)),
|
|
460
|
1101 mask)
|
|
|
1102
|
|
|
1103 )
|
|
428
|
1104 /* we have encountered a comment end of the same style
|
|
|
1105 as the comment sequence which began this comment
|
|
|
1106 section */
|
|
460
|
1107 {
|
|
|
1108 from++;
|
|
826
|
1109 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1110 break;
|
|
|
1111 }
|
|
428
|
1112 }
|
|
|
1113 return from;
|
|
|
1114 }
|
|
|
1115
|
|
|
1116
|
|
|
1117 /* #### between FSF 19.23 and 19.28 there are some changes to the logic
|
|
|
1118 in this function (and minor changes to find_start_of_comment(),
|
|
|
1119 above, which is part of Fforward_comment() in FSF). Attempts to port
|
|
|
1120 that logic made this function break, so I'm leaving it out. If anyone
|
|
|
1121 ever complains about this function not working properly, take a look
|
|
|
1122 at those changes. --ben */
|
|
|
1123
|
|
446
|
1124 DEFUN ("forward-comment", Fforward_comment, 0, 2, 0, /*
|
|
444
|
1125 Move forward across up to COUNT comments, or backwards if COUNT is negative.
|
|
428
|
1126 Stop scanning if we find something other than a comment or whitespace.
|
|
|
1127 Set point to where scanning stops.
|
|
444
|
1128 If COUNT comments are found as expected, with nothing except whitespace
|
|
428
|
1129 between them, return t; otherwise return nil.
|
|
|
1130 Point is set in either case.
|
|
446
|
1131 COUNT defaults to 1, and BUFFER defaults to the current buffer.
|
|
428
|
1132 */
|
|
444
|
1133 (count, buffer))
|
|
428
|
1134 {
|
|
665
|
1135 Charbpos from;
|
|
|
1136 Charbpos stop;
|
|
867
|
1137 Ichar c;
|
|
428
|
1138 enum syntaxcode code;
|
|
460
|
1139 int syncode;
|
|
444
|
1140 EMACS_INT n;
|
|
428
|
1141 struct buffer *buf = decode_buffer (buffer, 0);
|
|
826
|
1142 struct syntax_cache *scache;
|
|
|
1143
|
|
446
|
1144 if (NILP (count))
|
|
|
1145 n = 1;
|
|
|
1146 else
|
|
|
1147 {
|
|
|
1148 CHECK_INT (count);
|
|
|
1149 n = XINT (count);
|
|
|
1150 }
|
|
428
|
1151
|
|
|
1152 from = BUF_PT (buf);
|
|
|
1153
|
|
826
|
1154 scache = setup_buffer_syntax_cache (buf, from, n);
|
|
444
|
1155 while (n > 0)
|
|
428
|
1156 {
|
|
|
1157 QUIT;
|
|
|
1158
|
|
|
1159 stop = BUF_ZV (buf);
|
|
|
1160 while (from < stop)
|
|
|
1161 {
|
|
460
|
1162 int comstyle = 0; /* mask for finding matching comment style */
|
|
428
|
1163
|
|
|
1164 if (char_quoted (buf, from))
|
|
|
1165 {
|
|
|
1166 from++;
|
|
|
1167 continue;
|
|
|
1168 }
|
|
|
1169
|
|
826
|
1170 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1171 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
1172 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
1173 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
1174
|
|
|
1175 if (code == Scomment)
|
|
|
1176 {
|
|
|
1177 /* we have encountered a single character comment start
|
|
|
1178 sequence, and we are ignoring all text inside comments.
|
|
|
1179 we must record the comment style this character begins
|
|
|
1180 so that later, only a comment end of the same style actually
|
|
|
1181 ends the comment section */
|
|
460
|
1182 comstyle = SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode)
|
|
|
1183 == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
428
|
1184 }
|
|
|
1185
|
|
460
|
1186 else if (code == Scomment_fence)
|
|
|
1187 {
|
|
|
1188 from++;
|
|
|
1189 code = Scomment;
|
|
|
1190 comstyle = ST_COMMENT_STYLE;
|
|
|
1191 }
|
|
|
1192
|
|
428
|
1193 else if (from < stop
|
|
460
|
1194 && SYNTAX_CODE_START_FIRST_P (syncode))
|
|
428
|
1195 {
|
|
460
|
1196 int next_syncode;
|
|
826
|
1197 UPDATE_SYNTAX_CACHE_FORWARD (scache, from + 1);
|
|
460
|
1198 next_syncode =
|
|
826
|
1199 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from + 1));
|
|
460
|
1200
|
|
|
1201 if (SYNTAX_CODES_START_P (syncode, next_syncode))
|
|
|
1202 {
|
|
|
1203 /* we have encountered a 2char comment start sequence and we
|
|
|
1204 are ignoring all text inside comments. we must record
|
|
|
1205 the comment style this sequence begins so that later,
|
|
|
1206 only a comment end of the same style actually ends
|
|
|
1207 the comment section */
|
|
|
1208 code = Scomment;
|
|
|
1209 comstyle =
|
|
|
1210 SYNTAX_CODES_COMMENT_MASK_START (syncode, next_syncode)
|
|
|
1211 == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
|
1212 from++;
|
|
|
1213 }
|
|
428
|
1214 }
|
|
|
1215
|
|
|
1216 if (code == Scomment)
|
|
|
1217 {
|
|
826
|
1218 Charbpos newfrom = find_end_of_comment (buf, from, stop,
|
|
|
1219 comstyle);
|
|
428
|
1220 if (newfrom < 0)
|
|
|
1221 {
|
|
|
1222 /* we stopped because from==stop */
|
|
|
1223 BUF_SET_PT (buf, stop);
|
|
|
1224 return Qnil;
|
|
|
1225 }
|
|
|
1226 from = newfrom;
|
|
|
1227
|
|
|
1228 /* We have skipped one comment. */
|
|
|
1229 break;
|
|
|
1230 }
|
|
|
1231 else if (code != Swhitespace
|
|
|
1232 && code != Sendcomment
|
|
|
1233 && code != Scomment )
|
|
|
1234 {
|
|
|
1235 BUF_SET_PT (buf, from);
|
|
|
1236 return Qnil;
|
|
|
1237 }
|
|
|
1238 from++;
|
|
|
1239 }
|
|
|
1240
|
|
|
1241 /* End of comment reached */
|
|
444
|
1242 n--;
|
|
428
|
1243 }
|
|
|
1244
|
|
444
|
1245 while (n < 0)
|
|
428
|
1246 {
|
|
|
1247 QUIT;
|
|
|
1248
|
|
|
1249 stop = BUF_BEGV (buf);
|
|
|
1250 while (from > stop)
|
|
|
1251 {
|
|
460
|
1252 int comstyle = 0; /* mask for finding matching comment style */
|
|
428
|
1253
|
|
|
1254 from--;
|
|
|
1255 if (char_quoted (buf, from))
|
|
|
1256 {
|
|
|
1257 from--;
|
|
|
1258 continue;
|
|
|
1259 }
|
|
|
1260
|
|
|
1261 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
1262 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
1263 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
1264
|
|
|
1265 if (code == Sendcomment)
|
|
|
1266 {
|
|
|
1267 /* we have found a single char end comment. we must record
|
|
|
1268 the comment style encountered so that later, we can match
|
|
|
1269 only the proper comment begin sequence of the same style */
|
|
460
|
1270 comstyle = SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode)
|
|
|
1271 == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
|
1272 }
|
|
|
1273
|
|
|
1274 else if (code == Scomment_fence)
|
|
|
1275 {
|
|
|
1276 code = Sendcomment;
|
|
|
1277 comstyle = ST_COMMENT_STYLE;
|
|
428
|
1278 }
|
|
|
1279
|
|
|
1280 else if (from > stop
|
|
460
|
1281 && SYNTAX_CODE_END_SECOND_P (syncode))
|
|
428
|
1282 {
|
|
460
|
1283 int prev_syncode;
|
|
826
|
1284 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
460
|
1285 prev_syncode =
|
|
826
|
1286 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from - 1));
|
|
460
|
1287 if (SYNTAX_CODES_END_P (prev_syncode, syncode))
|
|
|
1288 {
|
|
|
1289 /* We must record the comment style encountered so that
|
|
|
1290 later, we can match only the proper comment begin
|
|
|
1291 sequence of the same style. */
|
|
|
1292 code = Sendcomment;
|
|
|
1293 comstyle = SYNTAX_CODES_COMMENT_MASK_END
|
|
|
1294 (prev_syncode, syncode) == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
|
1295 from--;
|
|
|
1296 }
|
|
428
|
1297 }
|
|
|
1298
|
|
|
1299 if (code == Sendcomment)
|
|
|
1300 {
|
|
460
|
1301 from = find_start_of_comment (buf, from, stop, comstyle);
|
|
428
|
1302 break;
|
|
|
1303 }
|
|
|
1304
|
|
|
1305 else if (code != Swhitespace
|
|
460
|
1306 && code != Scomment
|
|
|
1307 && code != Sendcomment)
|
|
428
|
1308 {
|
|
|
1309 BUF_SET_PT (buf, from + 1);
|
|
|
1310 return Qnil;
|
|
|
1311 }
|
|
|
1312 }
|
|
|
1313
|
|
444
|
1314 n++;
|
|
428
|
1315 }
|
|
|
1316
|
|
|
1317 BUF_SET_PT (buf, from);
|
|
|
1318 return Qt;
|
|
|
1319 }
|
|
|
1320
|
|
|
1321
|
|
|
1322 Lisp_Object
|
|
665
|
1323 scan_lists (struct buffer *buf, Charbpos from, int count, int depth,
|
|
444
|
1324 int sexpflag, int noerror)
|
|
428
|
1325 {
|
|
665
|
1326 Charbpos stop;
|
|
867
|
1327 Ichar c;
|
|
428
|
1328 int quoted;
|
|
|
1329 int mathexit = 0;
|
|
|
1330 enum syntaxcode code;
|
|
460
|
1331 int syncode;
|
|
428
|
1332 int min_depth = depth; /* Err out if depth gets less than this. */
|
|
826
|
1333 struct syntax_cache *scache;
|
|
|
1334
|
|
428
|
1335 if (depth > 0) min_depth = 0;
|
|
|
1336
|
|
826
|
1337 scache = setup_buffer_syntax_cache (buf, from, count);
|
|
428
|
1338 while (count > 0)
|
|
|
1339 {
|
|
|
1340 QUIT;
|
|
|
1341
|
|
|
1342 stop = BUF_ZV (buf);
|
|
|
1343 while (from < stop)
|
|
|
1344 {
|
|
460
|
1345 int comstyle = 0; /* mask for finding matching comment style */
|
|
428
|
1346
|
|
826
|
1347 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1348 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
1349 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
1350 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
1351 from++;
|
|
|
1352
|
|
|
1353 /* a 1-char comment start sequence */
|
|
|
1354 if (code == Scomment && parse_sexp_ignore_comments)
|
|
|
1355 {
|
|
460
|
1356 comstyle = SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode) ==
|
|
|
1357 SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
428
|
1358 }
|
|
|
1359
|
|
|
1360 /* else, a 2-char comment start sequence? */
|
|
|
1361 else if (from < stop
|
|
460
|
1362 && SYNTAX_CODE_START_FIRST_P (syncode)
|
|
428
|
1363 && parse_sexp_ignore_comments)
|
|
|
1364 {
|
|
460
|
1365 int next_syncode;
|
|
826
|
1366 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1367 next_syncode =
|
|
826
|
1368 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from));
|
|
460
|
1369
|
|
|
1370 if (SYNTAX_CODES_START_P (syncode, next_syncode))
|
|
|
1371 {
|
|
826
|
1372 /* we have encountered a comment start sequence and we
|
|
|
1373 are ignoring all text inside comments. we must record
|
|
|
1374 the comment style this sequence begins so that later,
|
|
|
1375 only a comment end of the same style actually ends
|
|
|
1376 the comment section */
|
|
|
1377 code = Scomment;
|
|
460
|
1378 comstyle = SYNTAX_CODES_COMMENT_MASK_START
|
|
|
1379 (syncode, next_syncode) == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
826
|
1380 from++;
|
|
|
1381 }
|
|
428
|
1382 }
|
|
826
|
1383 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1384
|
|
460
|
1385 if (SYNTAX_CODE_PREFIX (syncode))
|
|
428
|
1386 continue;
|
|
|
1387
|
|
|
1388 switch (code)
|
|
|
1389 {
|
|
|
1390 case Sescape:
|
|
|
1391 case Scharquote:
|
|
|
1392 if (from == stop) goto lose;
|
|
|
1393 from++;
|
|
|
1394 /* treat following character as a word constituent */
|
|
|
1395 case Sword:
|
|
|
1396 case Ssymbol:
|
|
|
1397 if (depth || !sexpflag) break;
|
|
|
1398 /* This word counts as a sexp; return at end of it. */
|
|
|
1399 while (from < stop)
|
|
|
1400 {
|
|
826
|
1401 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
|
1402 switch (SYNTAX_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from)))
|
|
428
|
1403 {
|
|
|
1404 case Scharquote:
|
|
|
1405 case Sescape:
|
|
|
1406 from++;
|
|
|
1407 if (from == stop) goto lose;
|
|
|
1408 break;
|
|
|
1409 case Sword:
|
|
|
1410 case Ssymbol:
|
|
|
1411 case Squote:
|
|
|
1412 break;
|
|
|
1413 default:
|
|
|
1414 goto done;
|
|
|
1415 }
|
|
|
1416 from++;
|
|
|
1417 }
|
|
|
1418 goto done;
|
|
|
1419
|
|
460
|
1420 case Scomment_fence:
|
|
|
1421 comstyle = ST_COMMENT_STYLE;
|
|
428
|
1422 case Scomment:
|
|
|
1423 if (!parse_sexp_ignore_comments)
|
|
|
1424 break;
|
|
826
|
1425 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
1426 {
|
|
665
|
1427 Charbpos newfrom =
|
|
460
|
1428 find_end_of_comment (buf, from, stop, comstyle);
|
|
428
|
1429 if (newfrom < 0)
|
|
|
1430 {
|
|
|
1431 /* we stopped because from == stop in search forward */
|
|
|
1432 from = stop;
|
|
|
1433 if (depth == 0)
|
|
|
1434 goto done;
|
|
|
1435 goto lose;
|
|
|
1436 }
|
|
|
1437 from = newfrom;
|
|
|
1438 }
|
|
|
1439 break;
|
|
|
1440
|
|
|
1441 case Smath:
|
|
|
1442 if (!sexpflag)
|
|
|
1443 break;
|
|
|
1444 if (from != stop && c == BUF_FETCH_CHAR (buf, from))
|
|
|
1445 from++;
|
|
|
1446 if (mathexit)
|
|
|
1447 {
|
|
|
1448 mathexit = 0;
|
|
|
1449 goto close1;
|
|
|
1450 }
|
|
|
1451 mathexit = 1;
|
|
|
1452
|
|
|
1453 case Sopen:
|
|
|
1454 if (!++depth) goto done;
|
|
|
1455 break;
|
|
|
1456
|
|
|
1457 case Sclose:
|
|
|
1458 close1:
|
|
|
1459 if (!--depth) goto done;
|
|
|
1460 if (depth < min_depth)
|
|
|
1461 {
|
|
444
|
1462 if (noerror)
|
|
428
|
1463 return Qnil;
|
|
826
|
1464 syntax_error ("Containing expression ends prematurely",
|
|
|
1465 Qunbound);
|
|
428
|
1466 }
|
|
|
1467 break;
|
|
|
1468
|
|
460
|
1469 case Sstring_fence:
|
|
428
|
1470 case Sstring:
|
|
|
1471 {
|
|
867
|
1472 Ichar stringterm;
|
|
460
|
1473
|
|
|
1474 if (code != Sstring_fence)
|
|
|
1475 {
|
|
826
|
1476 /* XEmacs change: call syntax_match on character */
|
|
867
|
1477 Ichar ch = BUF_FETCH_CHAR (buf, from - 1);
|
|
460
|
1478 Lisp_Object stermobj =
|
|
1296
|
1479 syntax_match (scache->syntax_table, ch);
|
|
428
|
1480
|
|
|
1481 if (CHARP (stermobj))
|
|
|
1482 stringterm = XCHAR (stermobj);
|
|
|
1483 else
|
|
|
1484 stringterm = ch;
|
|
460
|
1485 }
|
|
|
1486 else
|
|
|
1487 stringterm = '\0'; /* avoid compiler warnings */
|
|
428
|
1488
|
|
|
1489 while (1)
|
|
|
1490 {
|
|
|
1491 if (from >= stop)
|
|
|
1492 goto lose;
|
|
826
|
1493 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1494 c = BUF_FETCH_CHAR (buf, from);
|
|
|
1495 if (code == Sstring
|
|
|
1496 ? c == stringterm
|
|
826
|
1497 : SYNTAX_FROM_CACHE (scache, c) == Sstring_fence)
|
|
428
|
1498 break;
|
|
460
|
1499
|
|
826
|
1500 switch (SYNTAX_FROM_CACHE (scache, c))
|
|
428
|
1501 {
|
|
|
1502 case Scharquote:
|
|
|
1503 case Sescape:
|
|
|
1504 from++;
|
|
|
1505 break;
|
|
|
1506 default:
|
|
|
1507 break;
|
|
|
1508 }
|
|
|
1509 from++;
|
|
|
1510 }
|
|
|
1511 from++;
|
|
|
1512 if (!depth && sexpflag) goto done;
|
|
|
1513 break;
|
|
|
1514 }
|
|
|
1515
|
|
|
1516 default:
|
|
|
1517 break;
|
|
|
1518 }
|
|
|
1519 }
|
|
|
1520
|
|
|
1521 /* Reached end of buffer. Error if within object,
|
|
|
1522 return nil if between */
|
|
|
1523 if (depth) goto lose;
|
|
|
1524
|
|
|
1525 return Qnil;
|
|
|
1526
|
|
|
1527 /* End of object reached */
|
|
|
1528 done:
|
|
|
1529 count--;
|
|
|
1530 }
|
|
|
1531
|
|
|
1532 while (count < 0)
|
|
|
1533 {
|
|
|
1534 QUIT;
|
|
|
1535
|
|
|
1536 stop = BUF_BEGV (buf);
|
|
|
1537 while (from > stop)
|
|
|
1538 {
|
|
460
|
1539 int comstyle = 0; /* mask for finding matching comment style */
|
|
428
|
1540
|
|
|
1541 from--;
|
|
826
|
1542 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
428
|
1543 quoted = char_quoted (buf, from);
|
|
|
1544 if (quoted)
|
|
460
|
1545 {
|
|
428
|
1546 from--;
|
|
826
|
1547 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
460
|
1548 }
|
|
428
|
1549
|
|
|
1550 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
1551 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
1552 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
1553
|
|
|
1554 if (code == Sendcomment && parse_sexp_ignore_comments)
|
|
|
1555 {
|
|
|
1556 /* we have found a single char end comment. we must record
|
|
|
1557 the comment style encountered so that later, we can match
|
|
|
1558 only the proper comment begin sequence of the same style */
|
|
460
|
1559 comstyle = SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode)
|
|
|
1560 == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
428
|
1561 }
|
|
|
1562
|
|
|
1563 else if (from > stop
|
|
460
|
1564 && SYNTAX_CODE_END_SECOND_P (syncode)
|
|
428
|
1565 && !char_quoted (buf, from - 1)
|
|
|
1566 && parse_sexp_ignore_comments)
|
|
|
1567 {
|
|
460
|
1568 int prev_syncode;
|
|
826
|
1569 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
|
1570 prev_syncode =
|
|
|
1571 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from - 1));
|
|
460
|
1572
|
|
|
1573 if (SYNTAX_CODES_END_P (prev_syncode, syncode))
|
|
|
1574 {
|
|
428
|
1575 /* we must record the comment style encountered so that
|
|
|
1576 later, we can match only the proper comment begin
|
|
|
1577 sequence of the same style */
|
|
|
1578 code = Sendcomment;
|
|
460
|
1579 comstyle = SYNTAX_CODES_COMMENT_MASK_END
|
|
|
1580 (prev_syncode, syncode) == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
428
|
1581 from--;
|
|
|
1582 }
|
|
460
|
1583 }
|
|
428
|
1584
|
|
460
|
1585 if (SYNTAX_CODE_PREFIX (syncode))
|
|
428
|
1586 continue;
|
|
|
1587
|
|
434
|
1588 switch (quoted ? Sword : code)
|
|
428
|
1589 {
|
|
|
1590 case Sword:
|
|
|
1591 case Ssymbol:
|
|
|
1592 if (depth || !sexpflag) break;
|
|
|
1593 /* This word counts as a sexp; count object finished after
|
|
|
1594 passing it. */
|
|
|
1595 while (from > stop)
|
|
|
1596 {
|
|
826
|
1597 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from);
|
|
428
|
1598 quoted = char_quoted (buf, from - 1);
|
|
|
1599
|
|
|
1600 if (quoted)
|
|
|
1601 from--;
|
|
|
1602 if (! (quoted
|
|
|
1603 || (syncode =
|
|
826
|
1604 SYNTAX_FROM_CACHE (scache, BUF_FETCH_CHAR (buf,
|
|
|
1605 from - 1)))
|
|
428
|
1606 == Sword
|
|
|
1607 || syncode == Ssymbol
|
|
|
1608 || syncode == Squote))
|
|
|
1609 goto done2;
|
|
|
1610 from--;
|
|
|
1611 }
|
|
|
1612 goto done2;
|
|
|
1613
|
|
|
1614 case Smath:
|
|
|
1615 if (!sexpflag)
|
|
|
1616 break;
|
|
|
1617 if (from != stop && c == BUF_FETCH_CHAR (buf, from - 1))
|
|
|
1618 from--;
|
|
|
1619 if (mathexit)
|
|
|
1620 {
|
|
|
1621 mathexit = 0;
|
|
|
1622 goto open2;
|
|
|
1623 }
|
|
|
1624 mathexit = 1;
|
|
|
1625
|
|
|
1626 case Sclose:
|
|
|
1627 if (!++depth) goto done2;
|
|
|
1628 break;
|
|
|
1629
|
|
|
1630 case Sopen:
|
|
|
1631 open2:
|
|
|
1632 if (!--depth) goto done2;
|
|
|
1633 if (depth < min_depth)
|
|
|
1634 {
|
|
444
|
1635 if (noerror)
|
|
428
|
1636 return Qnil;
|
|
826
|
1637 syntax_error ("Containing expression ends prematurely",
|
|
|
1638 Qunbound);
|
|
428
|
1639 }
|
|
|
1640 break;
|
|
|
1641
|
|
460
|
1642 case Scomment_fence:
|
|
|
1643 comstyle = ST_COMMENT_STYLE;
|
|
428
|
1644 case Sendcomment:
|
|
|
1645 if (parse_sexp_ignore_comments)
|
|
460
|
1646 from = find_start_of_comment (buf, from, stop, comstyle);
|
|
428
|
1647 break;
|
|
|
1648
|
|
460
|
1649 case Sstring_fence:
|
|
428
|
1650 case Sstring:
|
|
|
1651 {
|
|
867
|
1652 Ichar stringterm;
|
|
460
|
1653
|
|
|
1654 if (code != Sstring_fence)
|
|
|
1655 {
|
|
428
|
1656 /* XEmacs change: call syntax_match() on character */
|
|
867
|
1657 Ichar ch = BUF_FETCH_CHAR (buf, from);
|
|
460
|
1658 Lisp_Object stermobj =
|
|
1296
|
1659 syntax_match (scache->syntax_table, ch);
|
|
428
|
1660
|
|
|
1661 if (CHARP (stermobj))
|
|
|
1662 stringterm = XCHAR (stermobj);
|
|
|
1663 else
|
|
|
1664 stringterm = ch;
|
|
460
|
1665 }
|
|
|
1666 else
|
|
|
1667 stringterm = '\0'; /* avoid compiler warnings */
|
|
428
|
1668
|
|
|
1669 while (1)
|
|
|
1670 {
|
|
|
1671 if (from == stop) goto lose;
|
|
460
|
1672
|
|
826
|
1673 UPDATE_SYNTAX_CACHE_BACKWARD (scache, from - 1);
|
|
460
|
1674 c = BUF_FETCH_CHAR (buf, from - 1);
|
|
|
1675
|
|
|
1676 if ((code == Sstring
|
|
|
1677 ? c == stringterm
|
|
826
|
1678 : SYNTAX_FROM_CACHE (scache, c) == Sstring_fence)
|
|
460
|
1679 && !char_quoted (buf, from - 1))
|
|
|
1680 {
|
|
428
|
1681 break;
|
|
460
|
1682 }
|
|
|
1683
|
|
428
|
1684 from--;
|
|
|
1685 }
|
|
|
1686 from--;
|
|
|
1687 if (!depth && sexpflag) goto done2;
|
|
|
1688 break;
|
|
|
1689 }
|
|
|
1690 }
|
|
|
1691 }
|
|
|
1692
|
|
|
1693 /* Reached start of buffer. Error if within object,
|
|
|
1694 return nil if between */
|
|
|
1695 if (depth) goto lose;
|
|
|
1696
|
|
|
1697 return Qnil;
|
|
|
1698
|
|
|
1699 done2:
|
|
|
1700 count++;
|
|
|
1701 }
|
|
|
1702
|
|
|
1703
|
|
|
1704 return (make_int (from));
|
|
|
1705
|
|
|
1706 lose:
|
|
444
|
1707 if (!noerror)
|
|
826
|
1708 syntax_error ("Unbalanced parentheses", Qunbound);
|
|
428
|
1709 return Qnil;
|
|
|
1710 }
|
|
|
1711
|
|
|
1712 int
|
|
665
|
1713 char_quoted (struct buffer *buf, Charbpos pos)
|
|
428
|
1714 {
|
|
|
1715 enum syntaxcode code;
|
|
665
|
1716 Charbpos beg = BUF_BEGV (buf);
|
|
428
|
1717 int quoted = 0;
|
|
665
|
1718 Charbpos startpos = pos;
|
|
826
|
1719 struct syntax_cache *scache = buf->syntax_cache;
|
|
460
|
1720
|
|
|
1721 while (pos > beg)
|
|
|
1722 {
|
|
826
|
1723 UPDATE_SYNTAX_CACHE_BACKWARD (scache, pos - 1);
|
|
|
1724 code = SYNTAX_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, pos - 1));
|
|
428
|
1725
|
|
460
|
1726 if (code != Scharquote && code != Sescape)
|
|
|
1727 break;
|
|
|
1728 pos--;
|
|
|
1729 quoted = !quoted;
|
|
|
1730 }
|
|
|
1731
|
|
826
|
1732 UPDATE_SYNTAX_CACHE (scache, startpos);
|
|
428
|
1733 return quoted;
|
|
|
1734 }
|
|
|
1735
|
|
|
1736 DEFUN ("scan-lists", Fscan_lists, 3, 5, 0, /*
|
|
|
1737 Scan from character number FROM by COUNT lists.
|
|
|
1738 Returns the character number of the position thus found.
|
|
|
1739
|
|
|
1740 If DEPTH is nonzero, paren depth begins counting from that value,
|
|
|
1741 only places where the depth in parentheses becomes zero
|
|
|
1742 are candidates for stopping; COUNT such places are counted.
|
|
|
1743 Thus, a positive value for DEPTH means go out levels.
|
|
|
1744
|
|
|
1745 Comments are ignored if `parse-sexp-ignore-comments' is non-nil.
|
|
|
1746
|
|
|
1747 If the beginning or end of (the accessible part of) the buffer is reached
|
|
|
1748 and the depth is wrong, an error is signaled.
|
|
|
1749 If the depth is right but the count is not used up, nil is returned.
|
|
|
1750
|
|
|
1751 If optional arg BUFFER is non-nil, scanning occurs in that buffer instead
|
|
|
1752 of in the current buffer.
|
|
|
1753
|
|
|
1754 If optional arg NOERROR is non-nil, scan-lists will return nil instead of
|
|
|
1755 signalling an error.
|
|
|
1756 */
|
|
444
|
1757 (from, count, depth, buffer, noerror))
|
|
428
|
1758 {
|
|
|
1759 struct buffer *buf;
|
|
|
1760
|
|
|
1761 CHECK_INT (from);
|
|
|
1762 CHECK_INT (count);
|
|
|
1763 CHECK_INT (depth);
|
|
|
1764 buf = decode_buffer (buffer, 0);
|
|
|
1765
|
|
|
1766 return scan_lists (buf, XINT (from), XINT (count), XINT (depth), 0,
|
|
444
|
1767 !NILP (noerror));
|
|
428
|
1768 }
|
|
|
1769
|
|
|
1770 DEFUN ("scan-sexps", Fscan_sexps, 2, 4, 0, /*
|
|
|
1771 Scan from character number FROM by COUNT balanced expressions.
|
|
|
1772 If COUNT is negative, scan backwards.
|
|
|
1773 Returns the character number of the position thus found.
|
|
|
1774
|
|
|
1775 Comments are ignored if `parse-sexp-ignore-comments' is non-nil.
|
|
|
1776
|
|
|
1777 If the beginning or end of (the accessible part of) the buffer is reached
|
|
|
1778 in the middle of a parenthetical grouping, an error is signaled.
|
|
|
1779 If the beginning or end is reached between groupings
|
|
|
1780 but before count is used up, nil is returned.
|
|
|
1781
|
|
|
1782 If optional arg BUFFER is non-nil, scanning occurs in that buffer instead
|
|
|
1783 of in the current buffer.
|
|
|
1784
|
|
|
1785 If optional arg NOERROR is non-nil, scan-sexps will return nil instead of
|
|
|
1786 signalling an error.
|
|
|
1787 */
|
|
444
|
1788 (from, count, buffer, noerror))
|
|
428
|
1789 {
|
|
|
1790 struct buffer *buf = decode_buffer (buffer, 0);
|
|
|
1791 CHECK_INT (from);
|
|
|
1792 CHECK_INT (count);
|
|
|
1793
|
|
444
|
1794 return scan_lists (buf, XINT (from), XINT (count), 0, 1, !NILP (noerror));
|
|
428
|
1795 }
|
|
|
1796
|
|
|
1797 DEFUN ("backward-prefix-chars", Fbackward_prefix_chars, 0, 1, 0, /*
|
|
|
1798 Move point backward over any number of chars with prefix syntax.
|
|
|
1799 This includes chars with "quote" or "prefix" syntax (' or p).
|
|
|
1800
|
|
|
1801 Optional arg BUFFER defaults to the current buffer.
|
|
|
1802 */
|
|
|
1803 (buffer))
|
|
|
1804 {
|
|
|
1805 struct buffer *buf = decode_buffer (buffer, 0);
|
|
665
|
1806 Charbpos beg = BUF_BEGV (buf);
|
|
|
1807 Charbpos pos = BUF_PT (buf);
|
|
867
|
1808 Ichar c = '\0'; /* initialize to avoid compiler warnings */
|
|
826
|
1809 struct syntax_cache *scache;
|
|
|
1810
|
|
|
1811 scache = setup_buffer_syntax_cache (buf, pos, -1);
|
|
428
|
1812
|
|
|
1813 while (pos > beg && !char_quoted (buf, pos - 1)
|
|
460
|
1814 /* Previous statement updates syntax table. */
|
|
826
|
1815 && (SYNTAX_FROM_CACHE (scache, c = BUF_FETCH_CHAR (buf, pos - 1)) == Squote
|
|
|
1816 || SYNTAX_CODE_PREFIX (SYNTAX_CODE_FROM_CACHE (scache, c))))
|
|
428
|
1817 pos--;
|
|
|
1818
|
|
|
1819 BUF_SET_PT (buf, pos);
|
|
|
1820
|
|
|
1821 return Qnil;
|
|
|
1822 }
|
|
|
1823
|
|
|
1824 /* Parse forward from FROM to END,
|
|
|
1825 assuming that FROM has state OLDSTATE (nil means FROM is start of function),
|
|
|
1826 and return a description of the state of the parse at END.
|
|
|
1827 If STOPBEFORE is nonzero, stop at the start of an atom.
|
|
|
1828 If COMMENTSTOP is nonzero, stop at the start of a comment. */
|
|
|
1829
|
|
|
1830 static void
|
|
|
1831 scan_sexps_forward (struct buffer *buf, struct lisp_parse_state *stateptr,
|
|
665
|
1832 Charbpos from, Charbpos end,
|
|
428
|
1833 int targetdepth, int stopbefore,
|
|
|
1834 Lisp_Object oldstate,
|
|
|
1835 int commentstop)
|
|
|
1836 {
|
|
|
1837 struct lisp_parse_state state;
|
|
|
1838
|
|
|
1839 enum syntaxcode code;
|
|
|
1840 struct level { int last, prev; };
|
|
|
1841 struct level levelstart[100];
|
|
|
1842 struct level *curlevel = levelstart;
|
|
|
1843 struct level *endlevel = levelstart + 100;
|
|
|
1844 int depth; /* Paren depth of current scanning location.
|
|
|
1845 level - levelstart equals this except
|
|
|
1846 when the depth becomes negative. */
|
|
|
1847 int mindepth; /* Lowest DEPTH value seen. */
|
|
|
1848 int start_quoted = 0; /* Nonzero means starting after a char quote */
|
|
460
|
1849 int boundary_stop = commentstop == -1;
|
|
428
|
1850 Lisp_Object tem;
|
|
826
|
1851 struct syntax_cache *scache;
|
|
|
1852
|
|
|
1853 scache = setup_buffer_syntax_cache (buf, from, 1);
|
|
428
|
1854 if (NILP (oldstate))
|
|
|
1855 {
|
|
|
1856 depth = 0;
|
|
|
1857 state.instring = -1;
|
|
|
1858 state.incomment = 0;
|
|
|
1859 state.comstyle = 0; /* comment style a by default */
|
|
460
|
1860 state.comstr_start = -1; /* no comment/string seen. */
|
|
428
|
1861 }
|
|
|
1862 else
|
|
|
1863 {
|
|
|
1864 tem = Fcar (oldstate); /* elt 0, depth */
|
|
|
1865 if (!NILP (tem))
|
|
|
1866 depth = XINT (tem);
|
|
|
1867 else
|
|
|
1868 depth = 0;
|
|
|
1869
|
|
|
1870 oldstate = Fcdr (oldstate);
|
|
|
1871 oldstate = Fcdr (oldstate);
|
|
|
1872 oldstate = Fcdr (oldstate);
|
|
|
1873 tem = Fcar (oldstate); /* elt 3, instring */
|
|
460
|
1874 state.instring = ( !NILP (tem)
|
|
|
1875 ? ( INTP (tem) ? XINT (tem) : ST_STRING_STYLE)
|
|
|
1876 : -1);
|
|
428
|
1877
|
|
460
|
1878 oldstate = Fcdr (oldstate);
|
|
|
1879 tem = Fcar (oldstate); /* elt 4, incomment */
|
|
428
|
1880 state.incomment = !NILP (tem);
|
|
|
1881
|
|
|
1882 oldstate = Fcdr (oldstate);
|
|
|
1883 tem = Fcar (oldstate); /* elt 5, follows-quote */
|
|
|
1884 start_quoted = !NILP (tem);
|
|
|
1885
|
|
|
1886 /* if the eighth element of the list is nil, we are in comment style
|
|
3025
|
1887 a; if it is t, we are in comment style b; if it is `syntax-table',
|
|
460
|
1888 we are in a generic comment */
|
|
428
|
1889 oldstate = Fcdr (oldstate);
|
|
|
1890 oldstate = Fcdr (oldstate);
|
|
460
|
1891 tem = Fcar (oldstate); /* elt 7, comment style a/b/fence */
|
|
|
1892 state.comstyle = NILP (tem) ? 0 : ( EQ (tem, Qsyntax_table)
|
|
|
1893 ? ST_COMMENT_STYLE : 1 );
|
|
|
1894
|
|
|
1895 oldstate = Fcdr (oldstate); /* elt 8, start of last comment/string */
|
|
|
1896 tem = Fcar (oldstate);
|
|
|
1897 state.comstr_start = NILP (tem) ? -1 : XINT (tem);
|
|
|
1898
|
|
|
1899 /* elt 9, char numbers of starts-of-expression of levels
|
|
|
1900 (starting from outermost). */
|
|
|
1901 oldstate = Fcdr (oldstate);
|
|
|
1902 tem = Fcar (oldstate); /* elt 9, intermediate data for
|
|
|
1903 continuation of parsing (subject
|
|
|
1904 to change). */
|
|
|
1905 while (!NILP (tem)) /* >= second enclosing sexps. */
|
|
|
1906 {
|
|
|
1907 curlevel->last = XINT (Fcar (tem));
|
|
|
1908 if (++curlevel == endlevel)
|
|
826
|
1909 stack_overflow ("Nesting too deep for parser",
|
|
|
1910 make_int (curlevel - levelstart));
|
|
460
|
1911 curlevel->prev = -1;
|
|
|
1912 curlevel->last = -1;
|
|
|
1913 tem = Fcdr (tem);
|
|
|
1914 }
|
|
428
|
1915 }
|
|
|
1916 state.quoted = 0;
|
|
|
1917 mindepth = depth;
|
|
|
1918
|
|
|
1919 curlevel->prev = -1;
|
|
|
1920 curlevel->last = -1;
|
|
|
1921
|
|
|
1922 /* Enter the loop at a place appropriate for initial state. */
|
|
|
1923
|
|
|
1924 if (state.incomment) goto startincomment;
|
|
|
1925 if (state.instring >= 0)
|
|
|
1926 {
|
|
|
1927 if (start_quoted) goto startquotedinstring;
|
|
|
1928 goto startinstring;
|
|
|
1929 }
|
|
|
1930 if (start_quoted) goto startquoted;
|
|
|
1931
|
|
|
1932 while (from < end)
|
|
|
1933 {
|
|
867
|
1934 Ichar c;
|
|
460
|
1935 int syncode;
|
|
|
1936
|
|
428
|
1937 QUIT;
|
|
|
1938
|
|
826
|
1939 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1940 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
1941 syncode = SYNTAX_CODE_FROM_CACHE (scache, c);
|
|
|
1942 code = SYNTAX_FROM_CODE (syncode);
|
|
428
|
1943 from++;
|
|
|
1944
|
|
|
1945 /* record the comment style we have entered so that only the
|
|
|
1946 comment-ender sequence (or single char) of the same style
|
|
|
1947 actually terminates the comment section. */
|
|
460
|
1948 if (code == Scomment)
|
|
|
1949 {
|
|
|
1950 state.comstyle =
|
|
|
1951 SYNTAX_CODE_COMMENT_1CHAR_MASK (syncode)
|
|
|
1952 == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
|
1953 state.comstr_start = from - 1;
|
|
|
1954 }
|
|
|
1955
|
|
|
1956 /* a generic comment delimiter? */
|
|
|
1957 else if (code == Scomment_fence)
|
|
|
1958 {
|
|
|
1959 state.comstyle = ST_COMMENT_STYLE;
|
|
|
1960 state.comstr_start = from - 1;
|
|
|
1961 code = Scomment;
|
|
428
|
1962 }
|
|
|
1963
|
|
|
1964 else if (from < end &&
|
|
460
|
1965 SYNTAX_CODE_START_FIRST_P (syncode))
|
|
428
|
1966 {
|
|
460
|
1967 int next_syncode;
|
|
826
|
1968 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1969 next_syncode =
|
|
826
|
1970 SYNTAX_CODE_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from));
|
|
460
|
1971
|
|
|
1972 if (SYNTAX_CODES_START_P (syncode, next_syncode))
|
|
|
1973 {
|
|
428
|
1974 code = Scomment;
|
|
460
|
1975 state.comstyle = SYNTAX_CODES_COMMENT_MASK_START
|
|
|
1976 (syncode, next_syncode) == SYNTAX_COMMENT_STYLE_A ? 0 : 1;
|
|
|
1977 state.comstr_start = from - 1;
|
|
428
|
1978 from++;
|
|
826
|
1979 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
1980 }
|
|
428
|
1981 }
|
|
|
1982
|
|
460
|
1983 if (SYNTAX_CODE_PREFIX (syncode))
|
|
428
|
1984 continue;
|
|
|
1985 switch (code)
|
|
|
1986 {
|
|
|
1987 case Sescape:
|
|
|
1988 case Scharquote:
|
|
|
1989 if (stopbefore) goto stop; /* this arg means stop at sexp start */
|
|
|
1990 curlevel->last = from - 1;
|
|
|
1991 startquoted:
|
|
|
1992 if (from == end) goto endquoted;
|
|
|
1993 from++;
|
|
|
1994 goto symstarted;
|
|
|
1995 /* treat following character as a word constituent */
|
|
|
1996 case Sword:
|
|
|
1997 case Ssymbol:
|
|
|
1998 if (stopbefore) goto stop; /* this arg means stop at sexp start */
|
|
|
1999 curlevel->last = from - 1;
|
|
|
2000 symstarted:
|
|
|
2001 while (from < end)
|
|
|
2002 {
|
|
826
|
2003 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
|
2004 switch (SYNTAX_FROM_CACHE (scache, BUF_FETCH_CHAR (buf, from)))
|
|
428
|
2005 {
|
|
|
2006 case Scharquote:
|
|
|
2007 case Sescape:
|
|
|
2008 from++;
|
|
|
2009 if (from == end) goto endquoted;
|
|
|
2010 break;
|
|
|
2011 case Sword:
|
|
|
2012 case Ssymbol:
|
|
|
2013 case Squote:
|
|
|
2014 break;
|
|
|
2015 default:
|
|
|
2016 goto symdone;
|
|
|
2017 }
|
|
|
2018 from++;
|
|
|
2019 }
|
|
|
2020 symdone:
|
|
|
2021 curlevel->prev = curlevel->last;
|
|
|
2022 break;
|
|
|
2023
|
|
|
2024 case Scomment:
|
|
|
2025 state.incomment = 1;
|
|
460
|
2026 if (commentstop || boundary_stop) goto done;
|
|
428
|
2027 startincomment:
|
|
460
|
2028 if (commentstop == 1)
|
|
428
|
2029 goto done;
|
|
826
|
2030 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
428
|
2031 {
|
|
826
|
2032 Charbpos newfrom = find_end_of_comment (buf, from, end,
|
|
|
2033 state.comstyle);
|
|
428
|
2034 if (newfrom < 0)
|
|
|
2035 {
|
|
|
2036 /* we terminated search because from == end */
|
|
|
2037 from = end;
|
|
|
2038 goto done;
|
|
|
2039 }
|
|
|
2040 from = newfrom;
|
|
|
2041 }
|
|
|
2042 state.incomment = 0;
|
|
|
2043 state.comstyle = 0; /* reset the comment style */
|
|
460
|
2044 if (boundary_stop) goto done;
|
|
428
|
2045 break;
|
|
|
2046
|
|
|
2047 case Sopen:
|
|
|
2048 if (stopbefore) goto stop; /* this arg means stop at sexp start */
|
|
|
2049 depth++;
|
|
|
2050 /* curlevel++->last ran into compiler bug on Apollo */
|
|
|
2051 curlevel->last = from - 1;
|
|
|
2052 if (++curlevel == endlevel)
|
|
826
|
2053 stack_overflow ("Nesting too deep for parser",
|
|
|
2054 make_int (curlevel - levelstart));
|
|
428
|
2055 curlevel->prev = -1;
|
|
|
2056 curlevel->last = -1;
|
|
|
2057 if (targetdepth == depth) goto done;
|
|
|
2058 break;
|
|
|
2059
|
|
|
2060 case Sclose:
|
|
|
2061 depth--;
|
|
|
2062 if (depth < mindepth)
|
|
|
2063 mindepth = depth;
|
|
|
2064 if (curlevel != levelstart)
|
|
|
2065 curlevel--;
|
|
|
2066 curlevel->prev = curlevel->last;
|
|
|
2067 if (targetdepth == depth) goto done;
|
|
|
2068 break;
|
|
|
2069
|
|
|
2070 case Sstring:
|
|
460
|
2071 case Sstring_fence:
|
|
|
2072 state.comstr_start = from - 1;
|
|
428
|
2073 if (stopbefore) goto stop; /* this arg means stop at sexp start */
|
|
|
2074 curlevel->last = from - 1;
|
|
460
|
2075 if (code == Sstring_fence)
|
|
428
|
2076 {
|
|
460
|
2077 state.instring = ST_STRING_STYLE;
|
|
|
2078 }
|
|
|
2079 else
|
|
|
2080 {
|
|
|
2081 /* XEmacs change: call syntax_match() on character */
|
|
867
|
2082 Ichar ch = BUF_FETCH_CHAR (buf, from - 1);
|
|
460
|
2083 Lisp_Object stermobj =
|
|
1296
|
2084 syntax_match (scache->syntax_table, ch);
|
|
428
|
2085
|
|
|
2086 if (CHARP (stermobj))
|
|
|
2087 state.instring = XCHAR (stermobj);
|
|
|
2088 else
|
|
|
2089 state.instring = ch;
|
|
|
2090 }
|
|
460
|
2091 if (boundary_stop) goto done;
|
|
428
|
2092 startinstring:
|
|
|
2093 while (1)
|
|
|
2094 {
|
|
460
|
2095 enum syntaxcode temp_code;
|
|
|
2096
|
|
428
|
2097 if (from >= end) goto done;
|
|
460
|
2098
|
|
826
|
2099 UPDATE_SYNTAX_CACHE_FORWARD (scache, from);
|
|
460
|
2100 c = BUF_FETCH_CHAR (buf, from);
|
|
826
|
2101 temp_code = SYNTAX_FROM_CACHE (scache, c);
|
|
460
|
2102
|
|
|
2103 if (
|
|
|
2104 state.instring != ST_STRING_STYLE &&
|
|
|
2105 temp_code == Sstring &&
|
|
|
2106 c == state.instring) break;
|
|
|
2107
|
|
|
2108 switch (temp_code)
|
|
428
|
2109 {
|
|
460
|
2110 case Sstring_fence:
|
|
|
2111 if (state.instring == ST_STRING_STYLE)
|
|
|
2112 goto string_end;
|
|
|
2113 break;
|
|
428
|
2114 case Scharquote:
|
|
|
2115 case Sescape:
|
|
|
2116 {
|
|
|
2117 from++;
|
|
|
2118 startquotedinstring:
|
|
|
2119 if (from >= end) goto endquoted;
|
|
|
2120 break;
|
|
|
2121 }
|
|
|
2122 default:
|
|
|
2123 break;
|
|
|
2124 }
|
|
|
2125 from++;
|
|
|
2126 }
|
|
460
|
2127 string_end:
|
|
428
|
2128 state.instring = -1;
|
|
|
2129 curlevel->prev = curlevel->last;
|
|
|
2130 from++;
|
|
460
|
2131 if (boundary_stop) goto done;
|
|
428
|
2132 break;
|
|
|
2133
|
|
|
2134 case Smath:
|
|
|
2135 break;
|
|
|
2136
|
|
|
2137 case Swhitespace:
|
|
|
2138 case Spunct:
|
|
|
2139 case Squote:
|
|
|
2140 case Sendcomment:
|
|
460
|
2141 case Scomment_fence:
|
|
428
|
2142 case Sinherit:
|
|
|
2143 case Smax:
|
|
|
2144 break;
|
|
|
2145 }
|
|
|
2146 }
|
|
|
2147 goto done;
|
|
|
2148
|
|
|
2149 stop: /* Here if stopping before start of sexp. */
|
|
|
2150 from--; /* We have just fetched the char that starts it; */
|
|
|
2151 goto done; /* but return the position before it. */
|
|
|
2152
|
|
|
2153 endquoted:
|
|
|
2154 state.quoted = 1;
|
|
|
2155 done:
|
|
|
2156 state.depth = depth;
|
|
|
2157 state.mindepth = mindepth;
|
|
|
2158 state.thislevelstart = curlevel->prev;
|
|
|
2159 state.prevlevelstart
|
|
|
2160 = (curlevel == levelstart) ? -1 : (curlevel - 1)->last;
|
|
|
2161 state.location = from;
|
|
460
|
2162 state.levelstarts = Qnil;
|
|
|
2163 while (--curlevel >= levelstart)
|
|
|
2164 state.levelstarts = Fcons (make_int (curlevel->last),
|
|
|
2165 state.levelstarts);
|
|
428
|
2166
|
|
|
2167 *stateptr = state;
|
|
|
2168 }
|
|
|
2169
|
|
|
2170 DEFUN ("parse-partial-sexp", Fparse_partial_sexp, 2, 7, 0, /*
|
|
|
2171 Parse Lisp syntax starting at FROM until TO; return status of parse at TO.
|
|
|
2172 Parsing stops at TO or when certain criteria are met;
|
|
|
2173 point is set to where parsing stops.
|
|
444
|
2174 If fifth arg OLDSTATE is omitted or nil,
|
|
428
|
2175 parsing assumes that FROM is the beginning of a function.
|
|
460
|
2176 Value is a list of nine elements describing final state of parsing:
|
|
428
|
2177 0. depth in parens.
|
|
|
2178 1. character address of start of innermost containing list; nil if none.
|
|
|
2179 2. character address of start of last complete sexp terminated.
|
|
|
2180 3. non-nil if inside a string.
|
|
460
|
2181 (It is the character that will terminate the string,
|
|
|
2182 or t if the string should be terminated by an explicit
|
|
|
2183 `syntax-table' property.)
|
|
428
|
2184 4. t if inside a comment.
|
|
|
2185 5. t if following a quote character.
|
|
|
2186 6. the minimum paren-depth encountered during this scan.
|
|
460
|
2187 7. nil if in comment style a, or not in a comment; t if in comment style b;
|
|
|
2188 `syntax-table' if given by an explicit `syntax-table' property.
|
|
|
2189 8. character address of start of last comment or string; nil if none.
|
|
|
2190 9. Intermediate data for continuation of parsing (subject to change).
|
|
428
|
2191 If third arg TARGETDEPTH is non-nil, parsing stops if the depth
|
|
|
2192 in parentheses becomes equal to TARGETDEPTH.
|
|
|
2193 Fourth arg STOPBEFORE non-nil means stop when come to
|
|
|
2194 any character that starts a sexp.
|
|
460
|
2195 Fifth arg OLDSTATE is a nine-element list like what this function returns.
|
|
428
|
2196 It is used to initialize the state of the parse. Its second and third
|
|
|
2197 elements are ignored.
|
|
460
|
2198 Sixth arg COMMENTSTOP non-nil means stop at the start of a comment. If it
|
|
|
2199 is `syntax-table', stop after the start of a comment or a string, or after
|
|
|
2200 the end of a comment or string.
|
|
826
|
2201 Seventh arg BUFFER specifies the buffer to do the parsing in, and defaults
|
|
|
2202 to the current buffer.
|
|
428
|
2203 */
|
|
|
2204 (from, to, targetdepth, stopbefore, oldstate, commentstop, buffer))
|
|
|
2205 {
|
|
|
2206 struct lisp_parse_state state;
|
|
|
2207 int target;
|
|
665
|
2208 Charbpos start, end;
|
|
428
|
2209 struct buffer *buf = decode_buffer (buffer, 0);
|
|
|
2210 Lisp_Object val;
|
|
|
2211
|
|
|
2212 if (!NILP (targetdepth))
|
|
|
2213 {
|
|
|
2214 CHECK_INT (targetdepth);
|
|
|
2215 target = XINT (targetdepth);
|
|
|
2216 }
|
|
|
2217 else
|
|
|
2218 target = -100000; /* We won't reach this depth */
|
|
|
2219
|
|
|
2220 get_buffer_range_char (buf, from, to, &start, &end, 0);
|
|
|
2221 scan_sexps_forward (buf, &state, start, end,
|
|
|
2222 target, !NILP (stopbefore), oldstate,
|
|
460
|
2223 (NILP (commentstop)
|
|
|
2224 ? 0 : (EQ (commentstop, Qsyntax_table) ? -1 : 1)));
|
|
428
|
2225 BUF_SET_PT (buf, state.location);
|
|
|
2226
|
|
|
2227 /* reverse order */
|
|
|
2228 val = Qnil;
|
|
460
|
2229 val = Fcons (state.levelstarts, val);
|
|
|
2230 val = Fcons ((state.incomment || (state.instring >= 0))
|
|
|
2231 ? make_int (state.comstr_start) : Qnil, val);
|
|
|
2232 val = Fcons (state.comstyle ? (state.comstyle == ST_COMMENT_STYLE
|
|
|
2233 ? Qsyntax_table : Qt) : Qnil, val);
|
|
428
|
2234 val = Fcons (make_int (state.mindepth), val);
|
|
|
2235 val = Fcons (state.quoted ? Qt : Qnil, val);
|
|
|
2236 val = Fcons (state.incomment ? Qt : Qnil, val);
|
|
460
|
2237 val = Fcons (state.instring < 0
|
|
|
2238 ? Qnil
|
|
|
2239 : (state.instring == ST_STRING_STYLE
|
|
|
2240 ? Qt : make_int (state.instring)), val);
|
|
826
|
2241 val = Fcons (state.thislevelstart < 0 ? Qnil :
|
|
|
2242 make_int (state.thislevelstart), val);
|
|
|
2243 val = Fcons (state.prevlevelstart < 0 ? Qnil :
|
|
|
2244 make_int (state.prevlevelstart), val);
|
|
428
|
2245 val = Fcons (make_int (state.depth), val);
|
|
|
2246
|
|
|
2247 return val;
|
|
|
2248 }
|
|
|
2249
|
|
|
2250
|
|
|
2251 /* Updating of the mirror syntax table.
|
|
|
2252
|
|
1296
|
2253 Each syntax table has a corresponding mirror table in it. Whenever we
|
|
|
2254 make a change to a syntax table, we set a dirty flag. When accessing a
|
|
|
2255 value from the mirror table and the table is dirty, we call
|
|
|
2256 update_syntax_table() to clean it up.
|
|
428
|
2257
|
|
|
2258 #### We really only need to map over the changed range.
|
|
|
2259
|
|
|
2260 If we change the standard syntax table, we need to map over
|
|
|
2261 all tables because any of them could be inheriting from the
|
|
|
2262 standard syntax table.
|
|
|
2263
|
|
|
2264 When `set-syntax-table' is called, we set the buffer's mirror
|
|
|
2265 syntax table as well.
|
|
|
2266 */
|
|
|
2267
|
|
826
|
2268 static int
|
|
2286
|
2269 copy_to_mirrortab (struct chartab_range *range, Lisp_Object UNUSED (table),
|
|
826
|
2270 Lisp_Object val, void *arg)
|
|
428
|
2271 {
|
|
826
|
2272 Lisp_Object mirrortab = VOID_TO_LISP (arg);
|
|
428
|
2273
|
|
|
2274 if (CONSP (val))
|
|
|
2275 val = XCAR (val);
|
|
826
|
2276 if (SYNTAX_FROM_CODE (XINT (val)) != Sinherit)
|
|
|
2277 put_char_table (mirrortab, range, val);
|
|
|
2278 return 0;
|
|
|
2279 }
|
|
|
2280
|
|
|
2281 static int
|
|
2286
|
2282 copy_if_not_already_present (struct chartab_range *range,
|
|
|
2283 Lisp_Object UNUSED (table),
|
|
826
|
2284 Lisp_Object val, void *arg)
|
|
|
2285 {
|
|
1296
|
2286 Lisp_Object mirrortab = VOID_TO_LISP (arg);
|
|
826
|
2287 if (CONSP (val))
|
|
|
2288 val = XCAR (val);
|
|
|
2289 if (SYNTAX_FROM_CODE (XINT (val)) != Sinherit)
|
|
|
2290 {
|
|
|
2291 Lisp_Object existing =
|
|
1296
|
2292 updating_mirror_get_range_char_table (range, mirrortab,
|
|
|
2293 Vbogus_syntax_table_value);
|
|
826
|
2294 if (NILP (existing))
|
|
|
2295 /* nothing at all */
|
|
1296
|
2296 put_char_table (mirrortab, range, val);
|
|
|
2297 else if (!EQ (existing, Vbogus_syntax_table_value))
|
|
826
|
2298 /* full */
|
|
|
2299 ;
|
|
|
2300 else
|
|
|
2301 {
|
|
|
2302 Freset_char_table (Vtemp_table_for_use_updating_syntax_tables);
|
|
|
2303 copy_char_table_range
|
|
1296
|
2304 (mirrortab, Vtemp_table_for_use_updating_syntax_tables, range);
|
|
|
2305 put_char_table (mirrortab, range, val);
|
|
826
|
2306 copy_char_table_range
|
|
1296
|
2307 (Vtemp_table_for_use_updating_syntax_tables, mirrortab, range);
|
|
826
|
2308 }
|
|
428
|
2309 }
|
|
826
|
2310
|
|
428
|
2311 return 0;
|
|
|
2312 }
|
|
|
2313
|
|
|
2314 static void
|
|
826
|
2315 update_just_this_syntax_table (Lisp_Object table)
|
|
428
|
2316 {
|
|
|
2317 struct chartab_range range;
|
|
826
|
2318 Lisp_Object mirrortab = XCHAR_TABLE (table)->mirror_table;
|
|
|
2319
|
|
1296
|
2320 assert (!XCHAR_TABLE (table)->mirror_table_p);
|
|
826
|
2321 range.type = CHARTAB_RANGE_ALL;
|
|
|
2322 Freset_char_table (mirrortab);
|
|
1296
|
2323
|
|
826
|
2324 /* First, copy the tables values other than inherit into the mirror
|
|
|
2325 table. Then, for tables other than the standard syntax table, map
|
|
|
2326 over the standard table, copying values into the mirror table only if
|
|
|
2327 entries don't already exist in that table. (The copying step requires
|
|
|
2328 another mapping.)
|
|
|
2329 */
|
|
428
|
2330
|
|
826
|
2331 map_char_table (table, &range, copy_to_mirrortab, LISP_TO_VOID (mirrortab));
|
|
|
2332 /* second clause catches bootstrapping problems when initializing the
|
|
|
2333 standard syntax table */
|
|
|
2334 if (!EQ (table, Vstandard_syntax_table) && !NILP (Vstandard_syntax_table))
|
|
1296
|
2335 map_char_table (Vstandard_syntax_table, &range,
|
|
|
2336 copy_if_not_already_present, LISP_TO_VOID (mirrortab));
|
|
3152
|
2337 /* The resetting made the default be Qnil. Put it back to Sword. */
|
|
|
2338 set_char_table_default (mirrortab, make_int (Sword));
|
|
1296
|
2339 XCHAR_TABLE (mirrortab)->dirty = 0;
|
|
428
|
2340 }
|
|
|
2341
|
|
|
2342 /* Called from chartab.c when a change is made to a syntax table.
|
|
|
2343 If this is the standard syntax table, we need to recompute
|
|
|
2344 *all* syntax tables (yuck). Otherwise we just recompute this
|
|
|
2345 one. */
|
|
|
2346
|
|
|
2347 void
|
|
826
|
2348 update_syntax_table (Lisp_Object table)
|
|
428
|
2349 {
|
|
1296
|
2350 Lisp_Object nonmirror = XCHAR_TABLE (table)->mirror_table;
|
|
|
2351 assert (XCHAR_TABLE (table)->mirror_table_p);
|
|
|
2352 if (EQ (nonmirror, Vstandard_syntax_table))
|
|
428
|
2353 {
|
|
|
2354 Lisp_Object syntab;
|
|
|
2355
|
|
|
2356 for (syntab = Vall_syntax_tables; !NILP (syntab);
|
|
|
2357 syntab = XCHAR_TABLE (syntab)->next_table)
|
|
826
|
2358 update_just_this_syntax_table (syntab);
|
|
428
|
2359 }
|
|
|
2360 else
|
|
1296
|
2361 update_just_this_syntax_table (nonmirror);
|
|
428
|
2362 }
|
|
|
2363
|
|
|
2364
|
|
|
2365 /************************************************************************/
|
|
|
2366 /* initialization */
|
|
|
2367 /************************************************************************/
|
|
|
2368
|
|
|
2369 void
|
|
|
2370 syms_of_syntax (void)
|
|
|
2371 {
|
|
3092
|
2372 #ifdef NEW_GC
|
|
|
2373 INIT_LRECORD_IMPLEMENTATION (syntax_cache);
|
|
|
2374 #endif /* NEW_GC */
|
|
563
|
2375 DEFSYMBOL (Qsyntax_table_p);
|
|
|
2376 DEFSYMBOL (Qsyntax_table);
|
|
428
|
2377
|
|
|
2378 DEFSUBR (Fsyntax_table_p);
|
|
|
2379 DEFSUBR (Fsyntax_table);
|
|
826
|
2380 #ifdef DEBUG_XEMACS
|
|
|
2381 DEFSUBR (Fmirror_syntax_table);
|
|
|
2382 DEFSUBR (Fsyntax_cache_info);
|
|
|
2383 #endif /* DEBUG_XEMACS */
|
|
428
|
2384 DEFSUBR (Fstandard_syntax_table);
|
|
|
2385 DEFSUBR (Fcopy_syntax_table);
|
|
|
2386 DEFSUBR (Fset_syntax_table);
|
|
|
2387 DEFSUBR (Fsyntax_designator_chars);
|
|
|
2388 DEFSUBR (Fchar_syntax);
|
|
|
2389 DEFSUBR (Fmatching_paren);
|
|
|
2390 /* DEFSUBR (Fmodify_syntax_entry); now in Lisp. */
|
|
|
2391 /* DEFSUBR (Fdescribe_syntax); now in Lisp. */
|
|
|
2392
|
|
|
2393 DEFSUBR (Fforward_word);
|
|
|
2394
|
|
|
2395 DEFSUBR (Fforward_comment);
|
|
|
2396 DEFSUBR (Fscan_lists);
|
|
|
2397 DEFSUBR (Fscan_sexps);
|
|
|
2398 DEFSUBR (Fbackward_prefix_chars);
|
|
|
2399 DEFSUBR (Fparse_partial_sexp);
|
|
|
2400 }
|
|
|
2401
|
|
|
2402 void
|
|
|
2403 vars_of_syntax (void)
|
|
|
2404 {
|
|
|
2405 DEFVAR_BOOL ("parse-sexp-ignore-comments", &parse_sexp_ignore_comments /*
|
|
|
2406 Non-nil means `forward-sexp', etc., should treat comments as whitespace.
|
|
|
2407 */ );
|
|
434
|
2408 parse_sexp_ignore_comments = 0;
|
|
428
|
2409
|
|
460
|
2410 DEFVAR_BOOL ("lookup-syntax-properties", &lookup_syntax_properties /*
|
|
826
|
2411 Non-nil means `forward-sexp', etc., respect the `syntax-table' property.
|
|
|
2412 This property can be placed on buffers or strings and can be used to explicitly
|
|
|
2413 specify the syntax table to be used for looking up the syntax of the chars
|
|
|
2414 having this property, or to directly specify the syntax of the chars.
|
|
|
2415
|
|
460
|
2416 The value of this property should be either a syntax table, or a cons
|
|
|
2417 of the form (SYNTAXCODE . MATCHCHAR), SYNTAXCODE being the numeric
|
|
|
2418 syntax code, MATCHCHAR being nil or the character to match (which is
|
|
826
|
2419 relevant only when the syntax code is open/close-type).
|
|
460
|
2420 */ );
|
|
|
2421 lookup_syntax_properties = 1;
|
|
|
2422
|
|
428
|
2423 DEFVAR_BOOL ("words-include-escapes", &words_include_escapes /*
|
|
|
2424 Non-nil means `forward-word', etc., should treat escape chars part of words.
|
|
|
2425 */ );
|
|
434
|
2426 words_include_escapes = 0;
|
|
428
|
2427
|
|
|
2428 no_quit_in_re_search = 0;
|
|
1296
|
2429
|
|
|
2430 Vbogus_syntax_table_value = make_float (0.0);
|
|
|
2431 staticpro (&Vbogus_syntax_table_value);
|
|
428
|
2432 }
|
|
|
2433
|
|
|
2434 static void
|
|
442
|
2435 define_standard_syntax (const char *p, enum syntaxcode syn)
|
|
428
|
2436 {
|
|
|
2437 for (; *p; p++)
|
|
|
2438 Fput_char_table (make_char (*p), make_int (syn), Vstandard_syntax_table);
|
|
|
2439 }
|
|
|
2440
|
|
|
2441 void
|
|
|
2442 complex_vars_of_syntax (void)
|
|
|
2443 {
|
|
867
|
2444 Ichar i;
|
|
442
|
2445 const char *p;
|
|
428
|
2446 /* Set this now, so first buffer creation can refer to it. */
|
|
|
2447 /* Make it nil before calling copy-syntax-table
|
|
|
2448 so that copy-syntax-table will know not to try to copy from garbage */
|
|
|
2449 Vstandard_syntax_table = Qnil;
|
|
|
2450 Vstandard_syntax_table = Fcopy_syntax_table (Qnil);
|
|
|
2451 staticpro (&Vstandard_syntax_table);
|
|
|
2452
|
|
826
|
2453 Vtemp_table_for_use_updating_syntax_tables = Fmake_char_table (Qgeneric);
|
|
|
2454 staticpro (&Vtemp_table_for_use_updating_syntax_tables);
|
|
|
2455
|
|
428
|
2456 Vsyntax_designator_chars_string = make_string_nocopy (syntax_code_spec,
|
|
|
2457 Smax);
|
|
|
2458 staticpro (&Vsyntax_designator_chars_string);
|
|
|
2459
|
|
3152
|
2460 set_char_table_default (Vstandard_syntax_table, make_int (Sword));
|
|
428
|
2461
|
|
|
2462 for (i = 0; i <= 32; i++) /* Control 0 plus SPACE */
|
|
|
2463 Fput_char_table (make_char (i), make_int (Swhitespace),
|
|
|
2464 Vstandard_syntax_table);
|
|
|
2465 for (i = 127; i <= 159; i++) /* DEL plus Control 1 */
|
|
|
2466 Fput_char_table (make_char (i), make_int (Swhitespace),
|
|
|
2467 Vstandard_syntax_table);
|
|
|
2468
|
|
|
2469 define_standard_syntax ("abcdefghijklmnopqrstuvwxyz"
|
|
|
2470 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
|
|
2471 "0123456789"
|
|
|
2472 "$%", Sword);
|
|
|
2473 define_standard_syntax ("\"", Sstring);
|
|
|
2474 define_standard_syntax ("\\", Sescape);
|
|
|
2475 define_standard_syntax ("_-+*/&|<>=", Ssymbol);
|
|
|
2476 define_standard_syntax (".,;:?!#@~^'`", Spunct);
|
|
|
2477
|
|
|
2478 for (p = "()[]{}"; *p; p+=2)
|
|
|
2479 {
|
|
|
2480 Fput_char_table (make_char (p[0]),
|
|
|
2481 Fcons (make_int (Sopen), make_char (p[1])),
|
|
|
2482 Vstandard_syntax_table);
|
|
|
2483 Fput_char_table (make_char (p[1]),
|
|
|
2484 Fcons (make_int (Sclose), make_char (p[0])),
|
|
|
2485 Vstandard_syntax_table);
|
|
|
2486 }
|
|
|
2487 }
|
