|
428
|
1 /* Extended regular expression matching and search library,
|
|
|
2 version 0.12, extended for XEmacs.
|
|
|
3 (Implements POSIX draft P10003.2/D11.2, except for
|
|
|
4 internationalization features.)
|
|
|
5
|
|
|
6 Copyright (C) 1993, 1994, 1995 Free Software Foundation, Inc.
|
|
|
7 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
1333
|
8 Copyright (C) 1995, 2001, 2002, 2003 Ben Wing.
|
|
428
|
9
|
|
|
10 This program is free software; you can redistribute it and/or modify
|
|
|
11 it under the terms of the GNU General Public License as published by
|
|
|
12 the Free Software Foundation; either version 2, or (at your option)
|
|
|
13 any later version.
|
|
|
14
|
|
|
15 This program is distributed in the hope that it will be useful,
|
|
|
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
18 GNU General Public License for more details.
|
|
|
19
|
|
|
20 You should have received a copy of the GNU General Public License
|
|
|
21 along with this program; see the file COPYING. If not, write to
|
|
|
22 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
23 Boston, MA 02111-1307, USA. */
|
|
|
24
|
|
|
25 /* Synched up with: FSF 19.29. */
|
|
|
26
|
|
|
27 #ifdef HAVE_CONFIG_H
|
|
|
28 #include <config.h>
|
|
|
29 #endif
|
|
|
30
|
|
|
31 #ifndef _GNU_SOURCE
|
|
|
32 #define _GNU_SOURCE 1
|
|
|
33 #endif
|
|
|
34
|
|
|
35 /* We assume non-Mule if emacs isn't defined. */
|
|
|
36 #ifndef emacs
|
|
|
37 #undef MULE
|
|
|
38 #endif
|
|
|
39
|
|
771
|
40 /* XEmacs addition */
|
|
|
41 #ifdef REL_ALLOC
|
|
|
42 #define REGEX_REL_ALLOC /* may be undefined below */
|
|
|
43 #endif
|
|
|
44
|
|
428
|
45 /* XEmacs: define this to add in a speedup for patterns anchored at
|
|
|
46 the beginning of a line. Keep the ifdefs so that it's easier to
|
|
|
47 tell where/why this code has diverged from v19. */
|
|
|
48 #define REGEX_BEGLINE_CHECK
|
|
|
49
|
|
|
50 /* XEmacs: the current mmap-based ralloc handles small blocks very
|
|
|
51 poorly, so we disable it here. */
|
|
|
52
|
|
771
|
53 #if defined (HAVE_MMAP) || defined (DOUG_LEA_MALLOC)
|
|
|
54 # undef REGEX_REL_ALLOC
|
|
428
|
55 #endif
|
|
|
56
|
|
|
57 /* The `emacs' switch turns on certain matching commands
|
|
|
58 that make sense only in Emacs. */
|
|
|
59 #ifdef emacs
|
|
|
60
|
|
|
61 #include "lisp.h"
|
|
|
62 #include "buffer.h"
|
|
|
63 #include "syntax.h"
|
|
|
64
|
|
|
65 #if (defined (DEBUG_XEMACS) && !defined (DEBUG))
|
|
|
66 #define DEBUG
|
|
|
67 #endif
|
|
|
68
|
|
867
|
69 #define RE_TRANSLATE_1(ch) TRT_TABLE_OF (translate, (Ichar) ch)
|
|
446
|
70 #define TRANSLATE_P(tr) (!NILP (tr))
|
|
428
|
71
|
|
826
|
72 /* Converts the pointer to the char to BEG-based offset from the start. */
|
|
|
73 #define PTR_TO_OFFSET(d) (MATCHING_IN_FIRST_STRING \
|
|
|
74 ? (d) - string1 : (d) - (string2 - size1))
|
|
|
75
|
|
428
|
76 #else /* not emacs */
|
|
|
77
|
|
2367
|
78 #include <stdlib.h>
|
|
|
79 #include <sys/types.h>
|
|
|
80 #include <stddef.h> /* needed for ptrdiff_t under Solaris */
|
|
|
81 #include <string.h>
|
|
|
82
|
|
2286
|
83 #include "compiler.h" /* Get compiler-specific definitions like UNUSED */
|
|
|
84
|
|
428
|
85 /* If we are not linking with Emacs proper,
|
|
|
86 we can't use the relocating allocator
|
|
|
87 even if config.h says that we can. */
|
|
771
|
88 #undef REGEX_REL_ALLOC
|
|
428
|
89
|
|
544
|
90 /* defined in lisp.h */
|
|
|
91 #ifdef REGEX_MALLOC
|
|
|
92 #ifndef DECLARE_NOTHING
|
|
|
93 #define DECLARE_NOTHING struct nosuchstruct
|
|
|
94 #endif
|
|
|
95 #endif
|
|
|
96
|
|
867
|
97 #define itext_ichar(str) ((Ichar) (str)[0])
|
|
|
98 #define itext_ichar_fmt(str, fmt, object) ((Ichar) (str)[0])
|
|
|
99 #define itext_ichar_ascii_fmt(str, fmt, object) ((Ichar) (str)[0])
|
|
428
|
100
|
|
|
101 #if (LONGBITS > INTBITS)
|
|
|
102 # define EMACS_INT long
|
|
|
103 #else
|
|
|
104 # define EMACS_INT int
|
|
|
105 #endif
|
|
|
106
|
|
867
|
107 typedef int Ichar;
|
|
|
108
|
|
|
109 #define INC_IBYTEPTR(p) ((p)++)
|
|
|
110 #define INC_IBYTEPTR_FMT(p, fmt) ((p)++)
|
|
|
111 #define DEC_IBYTEPTR(p) ((p)--)
|
|
|
112 #define DEC_IBYTEPTR_FMT(p, fmt) ((p)--)
|
|
|
113 #define itext_ichar_len(ptr) 1
|
|
|
114 #define itext_ichar_len_fmt(ptr, fmt) 1
|
|
428
|
115
|
|
|
116 /* Define the syntax stuff for \<, \>, etc. */
|
|
|
117
|
|
|
118 /* This must be nonzero for the wordchar and notwordchar pattern
|
|
|
119 commands in re_match_2. */
|
|
|
120 #ifndef Sword
|
|
|
121 #define Sword 1
|
|
|
122 #endif
|
|
|
123
|
|
|
124 #ifdef SYNTAX_TABLE
|
|
|
125
|
|
|
126 extern char *re_syntax_table;
|
|
|
127
|
|
|
128 #else /* not SYNTAX_TABLE */
|
|
|
129
|
|
|
130 /* How many characters in the character set. */
|
|
|
131 #define CHAR_SET_SIZE 256
|
|
|
132
|
|
|
133 static char re_syntax_table[CHAR_SET_SIZE];
|
|
|
134
|
|
|
135 static void
|
|
|
136 init_syntax_once (void)
|
|
|
137 {
|
|
|
138 static int done = 0;
|
|
|
139
|
|
|
140 if (!done)
|
|
|
141 {
|
|
442
|
142 const char *word_syntax_chars =
|
|
428
|
143 "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_";
|
|
|
144
|
|
|
145 memset (re_syntax_table, 0, sizeof (re_syntax_table));
|
|
|
146
|
|
|
147 while (*word_syntax_chars)
|
|
647
|
148 re_syntax_table[(unsigned int) (*word_syntax_chars++)] = Sword;
|
|
428
|
149
|
|
|
150 done = 1;
|
|
|
151 }
|
|
|
152 }
|
|
|
153
|
|
446
|
154 #endif /* SYNTAX_TABLE */
|
|
428
|
155
|
|
826
|
156 #define SYNTAX(ignored, c) re_syntax_table[c]
|
|
460
|
157 #undef SYNTAX_FROM_CACHE
|
|
826
|
158 #define SYNTAX_FROM_CACHE SYNTAX
|
|
|
159
|
|
|
160 #define RE_TRANSLATE_1(c) translate[(unsigned char) (c)]
|
|
446
|
161 #define TRANSLATE_P(tr) tr
|
|
|
162
|
|
|
163 #endif /* emacs */
|
|
428
|
164
|
|
2201
|
165 /* This is for other GNU distributions with internationalized messages. */
|
|
|
166 #if defined (I18N3) && (defined (HAVE_LIBINTL_H) || defined (_LIBC))
|
|
|
167 # include <libintl.h>
|
|
|
168 #else
|
|
|
169 # define gettext(msgid) (msgid)
|
|
|
170 #endif
|
|
|
171
|
|
428
|
172 /* Under XEmacs, this is needed because we don't define it elsewhere. */
|
|
|
173 #ifdef SWITCH_ENUM_BUG
|
|
|
174 #define SWITCH_ENUM_CAST(x) ((int)(x))
|
|
|
175 #else
|
|
|
176 #define SWITCH_ENUM_CAST(x) (x)
|
|
|
177 #endif
|
|
|
178
|
|
|
179
|
|
|
180 /* Get the interface, including the syntax bits. */
|
|
|
181 #include "regex.h"
|
|
|
182
|
|
|
183 /* isalpha etc. are used for the character classes. */
|
|
|
184 #include <ctype.h>
|
|
|
185
|
|
|
186 /* Jim Meyering writes:
|
|
|
187
|
|
|
188 "... Some ctype macros are valid only for character codes that
|
|
|
189 isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when
|
|
|
190 using /bin/cc or gcc but without giving an ansi option). So, all
|
|
|
191 ctype uses should be through macros like ISPRINT... If
|
|
|
192 STDC_HEADERS is defined, then autoconf has verified that the ctype
|
|
|
193 macros don't need to be guarded with references to isascii. ...
|
|
|
194 Defining isascii to 1 should let any compiler worth its salt
|
|
|
195 eliminate the && through constant folding." */
|
|
|
196
|
|
|
197 #if defined (STDC_HEADERS) || (!defined (isascii) && !defined (HAVE_ISASCII))
|
|
|
198 #define ISASCII_1(c) 1
|
|
|
199 #else
|
|
|
200 #define ISASCII_1(c) isascii(c)
|
|
|
201 #endif
|
|
|
202
|
|
|
203 #ifdef MULE
|
|
|
204 /* The IS*() macros can be passed any character, including an extended
|
|
|
205 one. We need to make sure there are no crashes, which would occur
|
|
|
206 otherwise due to out-of-bounds array references. */
|
|
|
207 #define ISASCII(c) (((EMACS_UINT) (c)) < 0x100 && ISASCII_1 (c))
|
|
|
208 #else
|
|
|
209 #define ISASCII(c) ISASCII_1 (c)
|
|
|
210 #endif /* MULE */
|
|
|
211
|
|
|
212 #ifdef isblank
|
|
|
213 #define ISBLANK(c) (ISASCII (c) && isblank (c))
|
|
|
214 #else
|
|
|
215 #define ISBLANK(c) ((c) == ' ' || (c) == '\t')
|
|
|
216 #endif
|
|
|
217 #ifdef isgraph
|
|
|
218 #define ISGRAPH(c) (ISASCII (c) && isgraph (c))
|
|
|
219 #else
|
|
|
220 #define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c))
|
|
|
221 #endif
|
|
|
222
|
|
|
223 #define ISPRINT(c) (ISASCII (c) && isprint (c))
|
|
|
224 #define ISDIGIT(c) (ISASCII (c) && isdigit (c))
|
|
|
225 #define ISALNUM(c) (ISASCII (c) && isalnum (c))
|
|
|
226 #define ISALPHA(c) (ISASCII (c) && isalpha (c))
|
|
|
227 #define ISCNTRL(c) (ISASCII (c) && iscntrl (c))
|
|
|
228 #define ISLOWER(c) (ISASCII (c) && islower (c))
|
|
|
229 #define ISPUNCT(c) (ISASCII (c) && ispunct (c))
|
|
|
230 #define ISSPACE(c) (ISASCII (c) && isspace (c))
|
|
|
231 #define ISUPPER(c) (ISASCII (c) && isupper (c))
|
|
|
232 #define ISXDIGIT(c) (ISASCII (c) && isxdigit (c))
|
|
|
233
|
|
|
234 #ifndef NULL
|
|
|
235 #define NULL (void *)0
|
|
|
236 #endif
|
|
|
237
|
|
|
238 /* We remove any previous definition of `SIGN_EXTEND_CHAR',
|
|
|
239 since ours (we hope) works properly with all combinations of
|
|
|
240 machines, compilers, `char' and `unsigned char' argument types.
|
|
|
241 (Per Bothner suggested the basic approach.) */
|
|
|
242 #undef SIGN_EXTEND_CHAR
|
|
|
243 #if __STDC__
|
|
|
244 #define SIGN_EXTEND_CHAR(c) ((signed char) (c))
|
|
|
245 #else /* not __STDC__ */
|
|
|
246 /* As in Harbison and Steele. */
|
|
|
247 #define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
|
|
|
248 #endif
|
|
|
249
|
|
|
250 /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we
|
|
|
251 use `alloca' instead of `malloc'. This is because using malloc in
|
|
|
252 re_search* or re_match* could cause memory leaks when C-g is used in
|
|
|
253 Emacs; also, malloc is slower and causes storage fragmentation. On
|
|
|
254 the other hand, malloc is more portable, and easier to debug.
|
|
|
255
|
|
|
256 Because we sometimes use alloca, some routines have to be macros,
|
|
|
257 not functions -- `alloca'-allocated space disappears at the end of the
|
|
|
258 function it is called in. */
|
|
|
259
|
|
1333
|
260 #ifndef emacs
|
|
|
261 #define ALLOCA alloca
|
|
|
262 #define xmalloc malloc
|
|
|
263 #define xrealloc realloc
|
|
1726
|
264 #define xfree(x,type) free (x)
|
|
1333
|
265 #endif
|
|
|
266
|
|
|
267 #ifdef emacs
|
|
|
268 #define ALLOCA_GARBAGE_COLLECT() \
|
|
|
269 do \
|
|
|
270 { \
|
|
|
271 if (need_to_check_c_alloca) \
|
|
|
272 xemacs_c_alloca (0); \
|
|
|
273 } while (0)
|
|
|
274 #elif defined (C_ALLOCA)
|
|
|
275 #define ALLOCA_GARBAGE_COLLECT() alloca (0)
|
|
|
276 #else
|
|
|
277 #define ALLOCA_GARBAGE_COLLECT()
|
|
|
278 #endif
|
|
|
279
|
|
|
280 #ifndef emacs
|
|
|
281 /* So we can use just it to conditionalize on */
|
|
|
282 #undef ERROR_CHECK_MALLOC
|
|
|
283 #endif
|
|
|
284
|
|
|
285 #ifdef ERROR_CHECK_MALLOC
|
|
|
286 /* When REL_ALLOC, malloc() is problematic because it could potentially
|
|
|
287 cause all rel-alloc()ed data -- including buffer text -- to be relocated.
|
|
|
288 We deal with this by checking for such relocation whenever we have
|
|
|
289 executed a statement that may call malloc() -- or alloca(), which may
|
|
|
290 end up calling malloc() in some circumstances -- and recomputing all
|
|
|
291 of our string pointers in re_match_2_internal() and re_search_2().
|
|
|
292 However, if malloc() or alloca() happens and we don't know about it,
|
|
|
293 we could still be screwed. So we set up a system where we indicate all
|
|
|
294 places where we are prepared for malloc() or alloca(), and in any
|
|
|
295 other circumstances, calls to those functions (from anywhere inside of
|
|
|
296 XEmacs!) will abort(). We do this even when REL_ALLOC is not defined
|
|
|
297 so that we catch these problems sooner, since many developers and beta
|
|
|
298 testers will not be running with REL_ALLOC. */
|
|
|
299 int regex_malloc_disallowed;
|
|
|
300 #define BEGIN_REGEX_MALLOC_OK() regex_malloc_disallowed = 0
|
|
|
301 #define END_REGEX_MALLOC_OK() regex_malloc_disallowed = 1
|
|
|
302 #define UNBIND_REGEX_MALLOC_CHECK() unbind_to (depth)
|
|
|
303 #else
|
|
|
304 #define BEGIN_REGEX_MALLOC_OK()
|
|
|
305 #define END_REGEX_MALLOC_OK()
|
|
|
306 #define UNBIND_REGEX_MALLOC_CHECK()
|
|
|
307 #endif
|
|
|
308
|
|
|
309
|
|
428
|
310 #ifdef REGEX_MALLOC
|
|
|
311
|
|
1333
|
312 #define REGEX_ALLOCATE xmalloc
|
|
|
313 #define REGEX_REALLOCATE(source, osize, nsize) xrealloc (source, nsize)
|
|
|
314 #define REGEX_FREE xfree
|
|
428
|
315
|
|
|
316 #else /* not REGEX_MALLOC */
|
|
|
317
|
|
|
318 /* Emacs already defines alloca, sometimes. */
|
|
|
319 #ifndef alloca
|
|
|
320
|
|
|
321 /* Make alloca work the best possible way. */
|
|
|
322 #ifdef __GNUC__
|
|
|
323 #define alloca __builtin_alloca
|
|
771
|
324 #elif defined (__DECC) /* XEmacs: added next 3 lines, similar to config.h.in */
|
|
|
325 #include <alloca.h>
|
|
|
326 #pragma intrinsic(alloca)
|
|
428
|
327 #else /* not __GNUC__ */
|
|
|
328 #if HAVE_ALLOCA_H
|
|
|
329 #include <alloca.h>
|
|
|
330 #else /* not __GNUC__ or HAVE_ALLOCA_H */
|
|
|
331 #ifndef _AIX /* Already did AIX, up at the top. */
|
|
444
|
332 void *alloca ();
|
|
428
|
333 #endif /* not _AIX */
|
|
446
|
334 #endif /* HAVE_ALLOCA_H */
|
|
|
335 #endif /* __GNUC__ */
|
|
428
|
336
|
|
|
337 #endif /* not alloca */
|
|
|
338
|
|
1333
|
339 #define REGEX_ALLOCATE ALLOCA
|
|
428
|
340
|
|
2367
|
341 /* !!#### Needs review */
|
|
428
|
342 /* Assumes a `char *destination' variable. */
|
|
|
343 #define REGEX_REALLOCATE(source, osize, nsize) \
|
|
1333
|
344 (destination = (char *) ALLOCA (nsize), \
|
|
428
|
345 memmove (destination, source, osize), \
|
|
|
346 destination)
|
|
|
347
|
|
1726
|
348 /* No need to do anything to free, after alloca.
|
|
|
349 Do nothing! But inhibit gcc warning. */
|
|
|
350 #define REGEX_FREE(arg,type) ((void)0)
|
|
428
|
351
|
|
446
|
352 #endif /* REGEX_MALLOC */
|
|
428
|
353
|
|
|
354 /* Define how to allocate the failure stack. */
|
|
|
355
|
|
771
|
356 #ifdef REGEX_REL_ALLOC
|
|
428
|
357 #define REGEX_ALLOCATE_STACK(size) \
|
|
1346
|
358 r_alloc ((unsigned char **) &failure_stack_ptr, (size))
|
|
428
|
359 #define REGEX_REALLOCATE_STACK(source, osize, nsize) \
|
|
1346
|
360 r_re_alloc ((unsigned char **) &failure_stack_ptr, (nsize))
|
|
428
|
361 #define REGEX_FREE_STACK(ptr) \
|
|
1346
|
362 r_alloc_free ((unsigned char **) &failure_stack_ptr)
|
|
428
|
363
|
|
771
|
364 #else /* not REGEX_REL_ALLOC */
|
|
428
|
365
|
|
|
366 #ifdef REGEX_MALLOC
|
|
|
367
|
|
1333
|
368 #define REGEX_ALLOCATE_STACK xmalloc
|
|
|
369 #define REGEX_REALLOCATE_STACK(source, osize, nsize) xrealloc (source, nsize)
|
|
1726
|
370 #define REGEX_FREE_STACK(arg) xfree (arg, fail_stack_elt_t *)
|
|
428
|
371
|
|
|
372 #else /* not REGEX_MALLOC */
|
|
|
373
|
|
1333
|
374 #define REGEX_ALLOCATE_STACK ALLOCA
|
|
428
|
375
|
|
|
376 #define REGEX_REALLOCATE_STACK(source, osize, nsize) \
|
|
|
377 REGEX_REALLOCATE (source, osize, nsize)
|
|
|
378 /* No need to explicitly free anything. */
|
|
|
379 #define REGEX_FREE_STACK(arg)
|
|
|
380
|
|
446
|
381 #endif /* REGEX_MALLOC */
|
|
771
|
382 #endif /* REGEX_REL_ALLOC */
|
|
428
|
383
|
|
|
384
|
|
|
385 /* True if `size1' is non-NULL and PTR is pointing anywhere inside
|
|
|
386 `string1' or just past its end. This works if PTR is NULL, which is
|
|
|
387 a good thing. */
|
|
|
388 #define FIRST_STRING_P(ptr) \
|
|
|
389 (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
|
|
|
390
|
|
|
391 /* (Re)Allocate N items of type T using malloc, or fail. */
|
|
1333
|
392 #define TALLOC(n, t) ((t *) xmalloc ((n) * sizeof (t)))
|
|
|
393 #define RETALLOC(addr, n, t) ((addr) = (t *) xrealloc (addr, (n) * sizeof (t)))
|
|
428
|
394 #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
|
|
|
395
|
|
|
396 #define BYTEWIDTH 8 /* In bits. */
|
|
|
397
|
|
434
|
398 #define STREQ(s1, s2) (strcmp (s1, s2) == 0)
|
|
428
|
399
|
|
|
400 #undef MAX
|
|
|
401 #undef MIN
|
|
|
402 #define MAX(a, b) ((a) > (b) ? (a) : (b))
|
|
|
403 #define MIN(a, b) ((a) < (b) ? (a) : (b))
|
|
|
404
|
|
446
|
405 /* Type of source-pattern and string chars. */
|
|
|
406 typedef const unsigned char re_char;
|
|
|
407
|
|
460
|
408 typedef char re_bool;
|
|
428
|
409 #define false 0
|
|
|
410 #define true 1
|
|
|
411
|
|
|
412
|
|
1346
|
413 #ifdef emacs
|
|
|
414
|
|
|
415 #ifdef MULE
|
|
|
416
|
|
|
417 Lisp_Object Vthe_lisp_rangetab;
|
|
|
418
|
|
|
419 void
|
|
|
420 vars_of_regex (void)
|
|
|
421 {
|
|
|
422 Vthe_lisp_rangetab = Fmake_range_table ();
|
|
|
423 staticpro (&Vthe_lisp_rangetab);
|
|
|
424 }
|
|
|
425
|
|
|
426 #else /* not MULE */
|
|
|
427
|
|
|
428 void
|
|
|
429 vars_of_regex (void)
|
|
|
430 {
|
|
|
431 }
|
|
|
432
|
|
|
433 #endif /* MULE */
|
|
|
434
|
|
|
435 /* Convert an offset from the start of the logical text string formed by
|
|
|
436 concatenating the two strings together into a character position in the
|
|
|
437 Lisp buffer or string that the text represents. Knows that
|
|
|
438 when handling buffer text, the "string" we're passed in is always
|
|
|
439 BEGV - ZV. */
|
|
|
440
|
|
|
441 static Charxpos
|
|
|
442 offset_to_charxpos (Lisp_Object lispobj, int off)
|
|
|
443 {
|
|
|
444 if (STRINGP (lispobj))
|
|
|
445 return string_index_byte_to_char (lispobj, off);
|
|
|
446 else if (BUFFERP (lispobj))
|
|
|
447 return bytebpos_to_charbpos (XBUFFER (lispobj),
|
|
|
448 off + BYTE_BUF_BEGV (XBUFFER (lispobj)));
|
|
|
449 else
|
|
|
450 return 0;
|
|
|
451 }
|
|
|
452
|
|
|
453 #ifdef REL_ALLOC
|
|
|
454
|
|
|
455 /* STRING1 is the value of STRING1 given to re_match_2(). LISPOBJ is
|
|
|
456 the Lisp object (if any) from which the string is taken. If LISPOBJ
|
|
|
457 is a buffer, return a relocation offset to be added to all pointers to
|
|
|
458 string data so that they will be accurate again, after an allocation or
|
|
|
459 reallocation that potentially relocated the buffer data.
|
|
|
460 */
|
|
|
461 static Bytecount
|
|
|
462 offset_post_relocation (Lisp_Object lispobj, Ibyte *orig_buftext)
|
|
|
463 {
|
|
|
464 if (!BUFFERP (lispobj))
|
|
|
465 return 0;
|
|
|
466 return (BYTE_BUF_BYTE_ADDRESS (XBUFFER (lispobj),
|
|
|
467 BYTE_BUF_BEGV (XBUFFER (lispobj))) -
|
|
|
468 orig_buftext);
|
|
|
469 }
|
|
|
470
|
|
|
471 #endif /* REL_ALLOC */
|
|
|
472
|
|
|
473 #ifdef ERROR_CHECK_MALLOC
|
|
|
474
|
|
|
475 /* NOTE that this can run malloc() so you need to adjust afterwards. */
|
|
|
476
|
|
|
477 static int
|
|
|
478 bind_regex_malloc_disallowed (int value)
|
|
|
479 {
|
|
|
480 /* Tricky, because the act of binding can run malloc(). */
|
|
|
481 int old_regex_malloc_disallowed = regex_malloc_disallowed;
|
|
|
482 int depth;
|
|
|
483 regex_malloc_disallowed = 0;
|
|
|
484 depth = record_unwind_protect_restoring_int (®ex_malloc_disallowed,
|
|
|
485 old_regex_malloc_disallowed);
|
|
|
486 regex_malloc_disallowed = value;
|
|
|
487 return depth;
|
|
|
488 }
|
|
|
489
|
|
|
490 #endif /* ERROR_CHECK_MALLOC */
|
|
|
491
|
|
|
492 #endif /* emacs */
|
|
|
493
|
|
|
494
|
|
428
|
495 /* These are the command codes that appear in compiled regular
|
|
|
496 expressions. Some opcodes are followed by argument bytes. A
|
|
|
497 command code can specify any interpretation whatsoever for its
|
|
|
498 arguments. Zero bytes may appear in the compiled regular expression. */
|
|
|
499
|
|
|
500 typedef enum
|
|
|
501 {
|
|
|
502 no_op = 0,
|
|
|
503
|
|
|
504 /* Succeed right away--no more backtracking. */
|
|
|
505 succeed,
|
|
|
506
|
|
|
507 /* Followed by one byte giving n, then by n literal bytes. */
|
|
|
508 exactn,
|
|
|
509
|
|
|
510 /* Matches any (more or less) character. */
|
|
|
511 anychar,
|
|
|
512
|
|
|
513 /* Matches any one char belonging to specified set. First
|
|
|
514 following byte is number of bitmap bytes. Then come bytes
|
|
|
515 for a bitmap saying which chars are in. Bits in each byte
|
|
|
516 are ordered low-bit-first. A character is in the set if its
|
|
|
517 bit is 1. A character too large to have a bit in the map is
|
|
|
518 automatically not in the set. */
|
|
|
519 charset,
|
|
|
520
|
|
|
521 /* Same parameters as charset, but match any character that is
|
|
|
522 not one of those specified. */
|
|
|
523 charset_not,
|
|
|
524
|
|
|
525 /* Start remembering the text that is matched, for storing in a
|
|
|
526 register. Followed by one byte with the register number, in
|
|
502
|
527 the range 1 to the pattern buffer's re_ngroups
|
|
428
|
528 field. Then followed by one byte with the number of groups
|
|
|
529 inner to this one. (This last has to be part of the
|
|
|
530 start_memory only because we need it in the on_failure_jump
|
|
|
531 of re_match_2.) */
|
|
|
532 start_memory,
|
|
|
533
|
|
|
534 /* Stop remembering the text that is matched and store it in a
|
|
|
535 memory register. Followed by one byte with the register
|
|
502
|
536 number, in the range 1 to `re_ngroups' in the
|
|
428
|
537 pattern buffer, and one byte with the number of inner groups,
|
|
|
538 just like `start_memory'. (We need the number of inner
|
|
|
539 groups here because we don't have any easy way of finding the
|
|
|
540 corresponding start_memory when we're at a stop_memory.) */
|
|
|
541 stop_memory,
|
|
|
542
|
|
|
543 /* Match a duplicate of something remembered. Followed by one
|
|
|
544 byte containing the register number. */
|
|
|
545 duplicate,
|
|
|
546
|
|
|
547 /* Fail unless at beginning of line. */
|
|
|
548 begline,
|
|
|
549
|
|
|
550 /* Fail unless at end of line. */
|
|
|
551 endline,
|
|
|
552
|
|
|
553 /* Succeeds if at beginning of buffer (if emacs) or at beginning
|
|
|
554 of string to be matched (if not). */
|
|
|
555 begbuf,
|
|
|
556
|
|
|
557 /* Analogously, for end of buffer/string. */
|
|
|
558 endbuf,
|
|
|
559
|
|
|
560 /* Followed by two byte relative address to which to jump. */
|
|
|
561 jump,
|
|
|
562
|
|
|
563 /* Same as jump, but marks the end of an alternative. */
|
|
|
564 jump_past_alt,
|
|
|
565
|
|
|
566 /* Followed by two-byte relative address of place to resume at
|
|
|
567 in case of failure. */
|
|
|
568 on_failure_jump,
|
|
|
569
|
|
|
570 /* Like on_failure_jump, but pushes a placeholder instead of the
|
|
|
571 current string position when executed. */
|
|
|
572 on_failure_keep_string_jump,
|
|
|
573
|
|
|
574 /* Throw away latest failure point and then jump to following
|
|
|
575 two-byte relative address. */
|
|
|
576 pop_failure_jump,
|
|
|
577
|
|
|
578 /* Change to pop_failure_jump if know won't have to backtrack to
|
|
|
579 match; otherwise change to jump. This is used to jump
|
|
|
580 back to the beginning of a repeat. If what follows this jump
|
|
|
581 clearly won't match what the repeat does, such that we can be
|
|
|
582 sure that there is no use backtracking out of repetitions
|
|
|
583 already matched, then we change it to a pop_failure_jump.
|
|
|
584 Followed by two-byte address. */
|
|
|
585 maybe_pop_jump,
|
|
|
586
|
|
|
587 /* Jump to following two-byte address, and push a dummy failure
|
|
|
588 point. This failure point will be thrown away if an attempt
|
|
|
589 is made to use it for a failure. A `+' construct makes this
|
|
|
590 before the first repeat. Also used as an intermediary kind
|
|
|
591 of jump when compiling an alternative. */
|
|
|
592 dummy_failure_jump,
|
|
|
593
|
|
|
594 /* Push a dummy failure point and continue. Used at the end of
|
|
|
595 alternatives. */
|
|
|
596 push_dummy_failure,
|
|
|
597
|
|
|
598 /* Followed by two-byte relative address and two-byte number n.
|
|
|
599 After matching N times, jump to the address upon failure. */
|
|
|
600 succeed_n,
|
|
|
601
|
|
|
602 /* Followed by two-byte relative address, and two-byte number n.
|
|
|
603 Jump to the address N times, then fail. */
|
|
|
604 jump_n,
|
|
|
605
|
|
|
606 /* Set the following two-byte relative address to the
|
|
|
607 subsequent two-byte number. The address *includes* the two
|
|
|
608 bytes of number. */
|
|
|
609 set_number_at,
|
|
|
610
|
|
|
611 wordchar, /* Matches any word-constituent character. */
|
|
|
612 notwordchar, /* Matches any char that is not a word-constituent. */
|
|
|
613
|
|
|
614 wordbeg, /* Succeeds if at word beginning. */
|
|
|
615 wordend, /* Succeeds if at word end. */
|
|
|
616
|
|
|
617 wordbound, /* Succeeds if at a word boundary. */
|
|
|
618 notwordbound /* Succeeds if not at a word boundary. */
|
|
|
619
|
|
|
620 #ifdef emacs
|
|
|
621 ,before_dot, /* Succeeds if before point. */
|
|
|
622 at_dot, /* Succeeds if at point. */
|
|
|
623 after_dot, /* Succeeds if after point. */
|
|
|
624
|
|
|
625 /* Matches any character whose syntax is specified. Followed by
|
|
|
626 a byte which contains a syntax code, e.g., Sword. */
|
|
|
627 syntaxspec,
|
|
|
628
|
|
|
629 /* Matches any character whose syntax is not that specified. */
|
|
|
630 notsyntaxspec
|
|
|
631
|
|
|
632 #endif /* emacs */
|
|
|
633
|
|
|
634 #ifdef MULE
|
|
|
635 /* need extra stuff to be able to properly work with XEmacs/Mule
|
|
|
636 characters (which may take up more than one byte) */
|
|
|
637
|
|
|
638 ,charset_mule, /* Matches any character belonging to specified set.
|
|
|
639 The set is stored in "unified range-table
|
|
|
640 format"; see rangetab.c. Unlike the `charset'
|
|
|
641 opcode, this can handle arbitrary characters. */
|
|
|
642
|
|
|
643 charset_mule_not /* Same parameters as charset_mule, but match any
|
|
|
644 character that is not one of those specified. */
|
|
|
645
|
|
|
646 /* 97/2/17 jhod: The following two were merged back in from the Mule
|
|
|
647 2.3 code to enable some language specific processing */
|
|
|
648 ,categoryspec, /* Matches entries in the character category tables */
|
|
|
649 notcategoryspec /* The opposite of the above */
|
|
|
650 #endif /* MULE */
|
|
|
651
|
|
|
652 } re_opcode_t;
|
|
|
653
|
|
|
654 /* Common operations on the compiled pattern. */
|
|
|
655
|
|
|
656 /* Store NUMBER in two contiguous bytes starting at DESTINATION. */
|
|
|
657
|
|
|
658 #define STORE_NUMBER(destination, number) \
|
|
|
659 do { \
|
|
|
660 (destination)[0] = (number) & 0377; \
|
|
|
661 (destination)[1] = (number) >> 8; \
|
|
|
662 } while (0)
|
|
|
663
|
|
|
664 /* Same as STORE_NUMBER, except increment DESTINATION to
|
|
|
665 the byte after where the number is stored. Therefore, DESTINATION
|
|
|
666 must be an lvalue. */
|
|
|
667
|
|
|
668 #define STORE_NUMBER_AND_INCR(destination, number) \
|
|
|
669 do { \
|
|
|
670 STORE_NUMBER (destination, number); \
|
|
|
671 (destination) += 2; \
|
|
|
672 } while (0)
|
|
|
673
|
|
|
674 /* Put into DESTINATION a number stored in two contiguous bytes starting
|
|
|
675 at SOURCE. */
|
|
|
676
|
|
|
677 #define EXTRACT_NUMBER(destination, source) \
|
|
|
678 do { \
|
|
|
679 (destination) = *(source) & 0377; \
|
|
|
680 (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \
|
|
|
681 } while (0)
|
|
|
682
|
|
|
683 #ifdef DEBUG
|
|
|
684 static void
|
|
446
|
685 extract_number (int *dest, re_char *source)
|
|
428
|
686 {
|
|
|
687 int temp = SIGN_EXTEND_CHAR (*(source + 1));
|
|
|
688 *dest = *source & 0377;
|
|
|
689 *dest += temp << 8;
|
|
|
690 }
|
|
|
691
|
|
|
692 #ifndef EXTRACT_MACROS /* To debug the macros. */
|
|
|
693 #undef EXTRACT_NUMBER
|
|
|
694 #define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
|
|
|
695 #endif /* not EXTRACT_MACROS */
|
|
|
696
|
|
|
697 #endif /* DEBUG */
|
|
|
698
|
|
|
699 /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
|
|
|
700 SOURCE must be an lvalue. */
|
|
|
701
|
|
|
702 #define EXTRACT_NUMBER_AND_INCR(destination, source) \
|
|
|
703 do { \
|
|
|
704 EXTRACT_NUMBER (destination, source); \
|
|
|
705 (source) += 2; \
|
|
|
706 } while (0)
|
|
|
707
|
|
|
708 #ifdef DEBUG
|
|
|
709 static void
|
|
|
710 extract_number_and_incr (int *destination, unsigned char **source)
|
|
|
711 {
|
|
|
712 extract_number (destination, *source);
|
|
|
713 *source += 2;
|
|
|
714 }
|
|
|
715
|
|
|
716 #ifndef EXTRACT_MACROS
|
|
|
717 #undef EXTRACT_NUMBER_AND_INCR
|
|
|
718 #define EXTRACT_NUMBER_AND_INCR(dest, src) \
|
|
|
719 extract_number_and_incr (&dest, &src)
|
|
|
720 #endif /* not EXTRACT_MACROS */
|
|
|
721
|
|
|
722 #endif /* DEBUG */
|
|
|
723
|
|
|
724 /* If DEBUG is defined, Regex prints many voluminous messages about what
|
|
|
725 it is doing (if the variable `debug' is nonzero). If linked with the
|
|
|
726 main program in `iregex.c', you can enter patterns and strings
|
|
|
727 interactively. And if linked with the main program in `main.c' and
|
|
|
728 the other test files, you can run the already-written tests. */
|
|
|
729
|
|
|
730 #if defined (DEBUG)
|
|
|
731
|
|
|
732 /* We use standard I/O for debugging. */
|
|
|
733 #include <stdio.h>
|
|
|
734
|
|
|
735 #ifndef emacs
|
|
|
736 /* XEmacs provides its own version of assert() */
|
|
|
737 /* It is useful to test things that ``must'' be true when debugging. */
|
|
|
738 #include <assert.h>
|
|
|
739 #endif
|
|
|
740
|
|
|
741 static int debug = 0;
|
|
|
742
|
|
|
743 #define DEBUG_STATEMENT(e) e
|
|
|
744 #define DEBUG_PRINT1(x) if (debug) printf (x)
|
|
|
745 #define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2)
|
|
|
746 #define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3)
|
|
|
747 #define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4)
|
|
|
748 #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \
|
|
|
749 if (debug) print_partial_compiled_pattern (s, e)
|
|
|
750 #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \
|
|
|
751 if (debug) print_double_string (w, s1, sz1, s2, sz2)
|
|
|
752
|
|
|
753
|
|
|
754 /* Print the fastmap in human-readable form. */
|
|
|
755
|
|
|
756 static void
|
|
|
757 print_fastmap (char *fastmap)
|
|
|
758 {
|
|
647
|
759 int was_a_range = 0;
|
|
|
760 int i = 0;
|
|
428
|
761
|
|
|
762 while (i < (1 << BYTEWIDTH))
|
|
|
763 {
|
|
|
764 if (fastmap[i++])
|
|
|
765 {
|
|
|
766 was_a_range = 0;
|
|
|
767 putchar (i - 1);
|
|
|
768 while (i < (1 << BYTEWIDTH) && fastmap[i])
|
|
|
769 {
|
|
|
770 was_a_range = 1;
|
|
|
771 i++;
|
|
|
772 }
|
|
|
773 if (was_a_range)
|
|
|
774 {
|
|
|
775 putchar ('-');
|
|
|
776 putchar (i - 1);
|
|
|
777 }
|
|
|
778 }
|
|
|
779 }
|
|
|
780 putchar ('\n');
|
|
|
781 }
|
|
|
782
|
|
|
783
|
|
|
784 /* Print a compiled pattern string in human-readable form, starting at
|
|
|
785 the START pointer into it and ending just before the pointer END. */
|
|
|
786
|
|
|
787 static void
|
|
446
|
788 print_partial_compiled_pattern (re_char *start, re_char *end)
|
|
428
|
789 {
|
|
|
790 int mcnt, mcnt2;
|
|
446
|
791 unsigned char *p = (unsigned char *) start;
|
|
|
792 re_char *pend = end;
|
|
428
|
793
|
|
|
794 if (start == NULL)
|
|
|
795 {
|
|
|
796 puts ("(null)");
|
|
|
797 return;
|
|
|
798 }
|
|
|
799
|
|
|
800 /* Loop over pattern commands. */
|
|
|
801 while (p < pend)
|
|
|
802 {
|
|
|
803 printf ("%ld:\t", (long)(p - start));
|
|
|
804
|
|
|
805 switch ((re_opcode_t) *p++)
|
|
|
806 {
|
|
|
807 case no_op:
|
|
|
808 printf ("/no_op");
|
|
|
809 break;
|
|
|
810
|
|
|
811 case exactn:
|
|
|
812 mcnt = *p++;
|
|
|
813 printf ("/exactn/%d", mcnt);
|
|
|
814 do
|
|
|
815 {
|
|
|
816 putchar ('/');
|
|
|
817 putchar (*p++);
|
|
|
818 }
|
|
|
819 while (--mcnt);
|
|
|
820 break;
|
|
|
821
|
|
|
822 case start_memory:
|
|
|
823 mcnt = *p++;
|
|
|
824 printf ("/start_memory/%d/%d", mcnt, *p++);
|
|
|
825 break;
|
|
|
826
|
|
|
827 case stop_memory:
|
|
|
828 mcnt = *p++;
|
|
|
829 printf ("/stop_memory/%d/%d", mcnt, *p++);
|
|
|
830 break;
|
|
|
831
|
|
|
832 case duplicate:
|
|
|
833 printf ("/duplicate/%d", *p++);
|
|
|
834 break;
|
|
|
835
|
|
|
836 case anychar:
|
|
|
837 printf ("/anychar");
|
|
|
838 break;
|
|
|
839
|
|
|
840 case charset:
|
|
|
841 case charset_not:
|
|
|
842 {
|
|
|
843 REGISTER int c, last = -100;
|
|
|
844 REGISTER int in_range = 0;
|
|
|
845
|
|
|
846 printf ("/charset [%s",
|
|
|
847 (re_opcode_t) *(p - 1) == charset_not ? "^" : "");
|
|
|
848
|
|
|
849 assert (p + *p < pend);
|
|
|
850
|
|
|
851 for (c = 0; c < 256; c++)
|
|
|
852 if (((unsigned char) (c / 8) < *p)
|
|
|
853 && (p[1 + (c/8)] & (1 << (c % 8))))
|
|
|
854 {
|
|
|
855 /* Are we starting a range? */
|
|
|
856 if (last + 1 == c && ! in_range)
|
|
|
857 {
|
|
|
858 putchar ('-');
|
|
|
859 in_range = 1;
|
|
|
860 }
|
|
|
861 /* Have we broken a range? */
|
|
|
862 else if (last + 1 != c && in_range)
|
|
|
863 {
|
|
|
864 putchar (last);
|
|
|
865 in_range = 0;
|
|
|
866 }
|
|
|
867
|
|
|
868 if (! in_range)
|
|
|
869 putchar (c);
|
|
|
870
|
|
|
871 last = c;
|
|
|
872 }
|
|
|
873
|
|
|
874 if (in_range)
|
|
|
875 putchar (last);
|
|
|
876
|
|
|
877 putchar (']');
|
|
|
878
|
|
|
879 p += 1 + *p;
|
|
|
880 }
|
|
|
881 break;
|
|
|
882
|
|
|
883 #ifdef MULE
|
|
|
884 case charset_mule:
|
|
|
885 case charset_mule_not:
|
|
|
886 {
|
|
|
887 int nentries, i;
|
|
|
888
|
|
|
889 printf ("/charset_mule [%s",
|
|
|
890 (re_opcode_t) *(p - 1) == charset_mule_not ? "^" : "");
|
|
|
891 nentries = unified_range_table_nentries (p);
|
|
|
892 for (i = 0; i < nentries; i++)
|
|
|
893 {
|
|
|
894 EMACS_INT first, last;
|
|
|
895 Lisp_Object dummy_val;
|
|
|
896
|
|
|
897 unified_range_table_get_range (p, i, &first, &last,
|
|
|
898 &dummy_val);
|
|
|
899 if (first < 0x100)
|
|
|
900 putchar (first);
|
|
|
901 else
|
|
|
902 printf ("(0x%lx)", (long)first);
|
|
|
903 if (first != last)
|
|
|
904 {
|
|
|
905 putchar ('-');
|
|
|
906 if (last < 0x100)
|
|
|
907 putchar (last);
|
|
|
908 else
|
|
|
909 printf ("(0x%lx)", (long)last);
|
|
|
910 }
|
|
|
911 }
|
|
|
912 putchar (']');
|
|
|
913 p += unified_range_table_bytes_used (p);
|
|
|
914 }
|
|
|
915 break;
|
|
|
916 #endif
|
|
|
917
|
|
|
918 case begline:
|
|
|
919 printf ("/begline");
|
|
|
920 break;
|
|
|
921
|
|
|
922 case endline:
|
|
|
923 printf ("/endline");
|
|
|
924 break;
|
|
|
925
|
|
|
926 case on_failure_jump:
|
|
|
927 extract_number_and_incr (&mcnt, &p);
|
|
|
928 printf ("/on_failure_jump to %ld", (long)(p + mcnt - start));
|
|
|
929 break;
|
|
|
930
|
|
|
931 case on_failure_keep_string_jump:
|
|
|
932 extract_number_and_incr (&mcnt, &p);
|
|
|
933 printf ("/on_failure_keep_string_jump to %ld", (long)(p + mcnt - start));
|
|
|
934 break;
|
|
|
935
|
|
|
936 case dummy_failure_jump:
|
|
|
937 extract_number_and_incr (&mcnt, &p);
|
|
|
938 printf ("/dummy_failure_jump to %ld", (long)(p + mcnt - start));
|
|
|
939 break;
|
|
|
940
|
|
|
941 case push_dummy_failure:
|
|
|
942 printf ("/push_dummy_failure");
|
|
|
943 break;
|
|
|
944
|
|
|
945 case maybe_pop_jump:
|
|
|
946 extract_number_and_incr (&mcnt, &p);
|
|
|
947 printf ("/maybe_pop_jump to %ld", (long)(p + mcnt - start));
|
|
|
948 break;
|
|
|
949
|
|
|
950 case pop_failure_jump:
|
|
|
951 extract_number_and_incr (&mcnt, &p);
|
|
|
952 printf ("/pop_failure_jump to %ld", (long)(p + mcnt - start));
|
|
|
953 break;
|
|
|
954
|
|
|
955 case jump_past_alt:
|
|
|
956 extract_number_and_incr (&mcnt, &p);
|
|
|
957 printf ("/jump_past_alt to %ld", (long)(p + mcnt - start));
|
|
|
958 break;
|
|
|
959
|
|
|
960 case jump:
|
|
|
961 extract_number_and_incr (&mcnt, &p);
|
|
|
962 printf ("/jump to %ld", (long)(p + mcnt - start));
|
|
|
963 break;
|
|
|
964
|
|
|
965 case succeed_n:
|
|
|
966 extract_number_and_incr (&mcnt, &p);
|
|
|
967 extract_number_and_incr (&mcnt2, &p);
|
|
|
968 printf ("/succeed_n to %ld, %d times", (long)(p + mcnt - start), mcnt2);
|
|
|
969 break;
|
|
|
970
|
|
|
971 case jump_n:
|
|
|
972 extract_number_and_incr (&mcnt, &p);
|
|
|
973 extract_number_and_incr (&mcnt2, &p);
|
|
|
974 printf ("/jump_n to %ld, %d times", (long)(p + mcnt - start), mcnt2);
|
|
|
975 break;
|
|
|
976
|
|
|
977 case set_number_at:
|
|
|
978 extract_number_and_incr (&mcnt, &p);
|
|
|
979 extract_number_and_incr (&mcnt2, &p);
|
|
|
980 printf ("/set_number_at location %ld to %d", (long)(p + mcnt - start), mcnt2);
|
|
|
981 break;
|
|
|
982
|
|
|
983 case wordbound:
|
|
|
984 printf ("/wordbound");
|
|
|
985 break;
|
|
|
986
|
|
|
987 case notwordbound:
|
|
|
988 printf ("/notwordbound");
|
|
|
989 break;
|
|
|
990
|
|
|
991 case wordbeg:
|
|
|
992 printf ("/wordbeg");
|
|
|
993 break;
|
|
|
994
|
|
|
995 case wordend:
|
|
|
996 printf ("/wordend");
|
|
|
997
|
|
|
998 #ifdef emacs
|
|
|
999 case before_dot:
|
|
|
1000 printf ("/before_dot");
|
|
|
1001 break;
|
|
|
1002
|
|
|
1003 case at_dot:
|
|
|
1004 printf ("/at_dot");
|
|
|
1005 break;
|
|
|
1006
|
|
|
1007 case after_dot:
|
|
|
1008 printf ("/after_dot");
|
|
|
1009 break;
|
|
|
1010
|
|
|
1011 case syntaxspec:
|
|
|
1012 printf ("/syntaxspec");
|
|
|
1013 mcnt = *p++;
|
|
|
1014 printf ("/%d", mcnt);
|
|
|
1015 break;
|
|
|
1016
|
|
|
1017 case notsyntaxspec:
|
|
|
1018 printf ("/notsyntaxspec");
|
|
|
1019 mcnt = *p++;
|
|
|
1020 printf ("/%d", mcnt);
|
|
|
1021 break;
|
|
|
1022
|
|
|
1023 #ifdef MULE
|
|
|
1024 /* 97/2/17 jhod Mule category patch */
|
|
|
1025 case categoryspec:
|
|
|
1026 printf ("/categoryspec");
|
|
|
1027 mcnt = *p++;
|
|
|
1028 printf ("/%d", mcnt);
|
|
|
1029 break;
|
|
|
1030
|
|
|
1031 case notcategoryspec:
|
|
|
1032 printf ("/notcategoryspec");
|
|
|
1033 mcnt = *p++;
|
|
|
1034 printf ("/%d", mcnt);
|
|
|
1035 break;
|
|
|
1036 /* end of category patch */
|
|
|
1037 #endif /* MULE */
|
|
|
1038 #endif /* emacs */
|
|
|
1039
|
|
|
1040 case wordchar:
|
|
|
1041 printf ("/wordchar");
|
|
|
1042 break;
|
|
|
1043
|
|
|
1044 case notwordchar:
|
|
|
1045 printf ("/notwordchar");
|
|
|
1046 break;
|
|
|
1047
|
|
|
1048 case begbuf:
|
|
|
1049 printf ("/begbuf");
|
|
|
1050 break;
|
|
|
1051
|
|
|
1052 case endbuf:
|
|
|
1053 printf ("/endbuf");
|
|
|
1054 break;
|
|
|
1055
|
|
|
1056 default:
|
|
|
1057 printf ("?%d", *(p-1));
|
|
|
1058 }
|
|
|
1059
|
|
|
1060 putchar ('\n');
|
|
|
1061 }
|
|
|
1062
|
|
|
1063 printf ("%ld:\tend of pattern.\n", (long)(p - start));
|
|
|
1064 }
|
|
|
1065
|
|
|
1066
|
|
|
1067 static void
|
|
|
1068 print_compiled_pattern (struct re_pattern_buffer *bufp)
|
|
|
1069 {
|
|
446
|
1070 re_char *buffer = bufp->buffer;
|
|
428
|
1071
|
|
|
1072 print_partial_compiled_pattern (buffer, buffer + bufp->used);
|
|
|
1073 printf ("%ld bytes used/%ld bytes allocated.\n", bufp->used,
|
|
|
1074 bufp->allocated);
|
|
|
1075
|
|
|
1076 if (bufp->fastmap_accurate && bufp->fastmap)
|
|
|
1077 {
|
|
|
1078 printf ("fastmap: ");
|
|
|
1079 print_fastmap (bufp->fastmap);
|
|
|
1080 }
|
|
|
1081
|
|
|
1082 printf ("re_nsub: %ld\t", (long)bufp->re_nsub);
|
|
502
|
1083 printf ("re_ngroups: %ld\t", (long)bufp->re_ngroups);
|
|
428
|
1084 printf ("regs_alloc: %d\t", bufp->regs_allocated);
|
|
|
1085 printf ("can_be_null: %d\t", bufp->can_be_null);
|
|
|
1086 printf ("newline_anchor: %d\n", bufp->newline_anchor);
|
|
|
1087 printf ("no_sub: %d\t", bufp->no_sub);
|
|
|
1088 printf ("not_bol: %d\t", bufp->not_bol);
|
|
|
1089 printf ("not_eol: %d\t", bufp->not_eol);
|
|
|
1090 printf ("syntax: %d\n", bufp->syntax);
|
|
|
1091 /* Perhaps we should print the translate table? */
|
|
|
1092 /* and maybe the category table? */
|
|
502
|
1093
|
|
|
1094 if (bufp->external_to_internal_register)
|
|
|
1095 {
|
|
|
1096 int i;
|
|
|
1097
|
|
|
1098 printf ("external_to_internal_register:\n");
|
|
|
1099 for (i = 0; i <= bufp->re_nsub; i++)
|
|
|
1100 {
|
|
|
1101 if (i > 0)
|
|
|
1102 printf (", ");
|
|
|
1103 printf ("%d -> %d", i, bufp->external_to_internal_register[i]);
|
|
|
1104 }
|
|
|
1105 printf ("\n");
|
|
|
1106 }
|
|
428
|
1107 }
|
|
|
1108
|
|
|
1109
|
|
|
1110 static void
|
|
446
|
1111 print_double_string (re_char *where, re_char *string1, int size1,
|
|
|
1112 re_char *string2, int size2)
|
|
428
|
1113 {
|
|
|
1114 if (where == NULL)
|
|
|
1115 printf ("(null)");
|
|
|
1116 else
|
|
|
1117 {
|
|
647
|
1118 int this_char;
|
|
428
|
1119
|
|
|
1120 if (FIRST_STRING_P (where))
|
|
|
1121 {
|
|
|
1122 for (this_char = where - string1; this_char < size1; this_char++)
|
|
|
1123 putchar (string1[this_char]);
|
|
|
1124
|
|
|
1125 where = string2;
|
|
|
1126 }
|
|
|
1127
|
|
|
1128 for (this_char = where - string2; this_char < size2; this_char++)
|
|
|
1129 putchar (string2[this_char]);
|
|
|
1130 }
|
|
|
1131 }
|
|
|
1132
|
|
|
1133 #else /* not DEBUG */
|
|
|
1134
|
|
771
|
1135 #ifndef emacs
|
|
428
|
1136 #undef assert
|
|
771
|
1137 #define assert(e) ((void) (1))
|
|
|
1138 #endif
|
|
428
|
1139
|
|
|
1140 #define DEBUG_STATEMENT(e)
|
|
|
1141 #define DEBUG_PRINT1(x)
|
|
|
1142 #define DEBUG_PRINT2(x1, x2)
|
|
|
1143 #define DEBUG_PRINT3(x1, x2, x3)
|
|
|
1144 #define DEBUG_PRINT4(x1, x2, x3, x4)
|
|
|
1145 #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
|
|
|
1146 #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
|
|
|
1147
|
|
446
|
1148 #endif /* DEBUG */
|
|
428
|
1149
|
|
|
1150 /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can
|
|
|
1151 also be assigned to arbitrarily: each pattern buffer stores its own
|
|
|
1152 syntax, so it can be changed between regex compilations. */
|
|
|
1153 /* This has no initializer because initialized variables in Emacs
|
|
|
1154 become read-only after dumping. */
|
|
|
1155 reg_syntax_t re_syntax_options;
|
|
|
1156
|
|
|
1157
|
|
|
1158 /* Specify the precise syntax of regexps for compilation. This provides
|
|
|
1159 for compatibility for various utilities which historically have
|
|
|
1160 different, incompatible syntaxes.
|
|
|
1161
|
|
|
1162 The argument SYNTAX is a bit mask comprised of the various bits
|
|
|
1163 defined in regex.h. We return the old syntax. */
|
|
|
1164
|
|
|
1165 reg_syntax_t
|
|
|
1166 re_set_syntax (reg_syntax_t syntax)
|
|
|
1167 {
|
|
|
1168 reg_syntax_t ret = re_syntax_options;
|
|
|
1169
|
|
|
1170 re_syntax_options = syntax;
|
|
|
1171 return ret;
|
|
|
1172 }
|
|
|
1173
|
|
|
1174 /* This table gives an error message for each of the error codes listed
|
|
|
1175 in regex.h. Obviously the order here has to be same as there.
|
|
|
1176 POSIX doesn't require that we do anything for REG_NOERROR,
|
|
|
1177 but why not be nice? */
|
|
|
1178
|
|
442
|
1179 static const char *re_error_msgid[] =
|
|
428
|
1180 {
|
|
|
1181 "Success", /* REG_NOERROR */
|
|
|
1182 "No match", /* REG_NOMATCH */
|
|
|
1183 "Invalid regular expression", /* REG_BADPAT */
|
|
|
1184 "Invalid collation character", /* REG_ECOLLATE */
|
|
|
1185 "Invalid character class name", /* REG_ECTYPE */
|
|
|
1186 "Trailing backslash", /* REG_EESCAPE */
|
|
|
1187 "Invalid back reference", /* REG_ESUBREG */
|
|
|
1188 "Unmatched [ or [^", /* REG_EBRACK */
|
|
|
1189 "Unmatched ( or \\(", /* REG_EPAREN */
|
|
|
1190 "Unmatched \\{", /* REG_EBRACE */
|
|
|
1191 "Invalid content of \\{\\}", /* REG_BADBR */
|
|
|
1192 "Invalid range end", /* REG_ERANGE */
|
|
|
1193 "Memory exhausted", /* REG_ESPACE */
|
|
|
1194 "Invalid preceding regular expression", /* REG_BADRPT */
|
|
|
1195 "Premature end of regular expression", /* REG_EEND */
|
|
|
1196 "Regular expression too big", /* REG_ESIZE */
|
|
|
1197 "Unmatched ) or \\)", /* REG_ERPAREN */
|
|
|
1198 #ifdef emacs
|
|
|
1199 "Invalid syntax designator", /* REG_ESYNTAX */
|
|
|
1200 #endif
|
|
|
1201 #ifdef MULE
|
|
|
1202 "Ranges may not span charsets", /* REG_ERANGESPAN */
|
|
|
1203 "Invalid category designator", /* REG_ECATEGORY */
|
|
|
1204 #endif
|
|
|
1205 };
|
|
|
1206
|
|
|
1207 /* Avoiding alloca during matching, to placate r_alloc. */
|
|
|
1208
|
|
1333
|
1209 /* About these various flags:
|
|
|
1210
|
|
|
1211 MATCH_MAY_ALLOCATE indicates that it's OK to do allocation in the
|
|
|
1212 searching and matching functions. In this case, we use local variables
|
|
|
1213 to hold the values allocated. If not, we use *global* variables, which
|
|
|
1214 are pre-allocated. NOTE: XEmacs ***MUST*** run with MATCH_MAY_ALLOCATE,
|
|
|
1215 because the regexp routines may get called reentrantly as a result of
|
|
|
1216 QUIT processing (e.g. under Windows: re_match -> QUIT -> quit_p -> drain
|
|
|
1217 events -> process WM_INITMENU -> call filter -> re_match; see stack
|
|
|
1218 trace in signal.c), so we cannot have any global variables (unless we do
|
|
|
1219 lots of trickiness including some unwind-protects, which isn't worth it
|
|
|
1220 at this point).
|
|
|
1221
|
|
|
1222 REL_ALLOC means that the relocating allocator is in use, for buffers
|
|
|
1223 and such. REGEX_REL_ALLOC means that we use rel-alloc to manage the
|
|
|
1224 fail stack, which may grow quite large. REGEX_MALLOC means we use
|
|
|
1225 malloc() in place of alloca() to allocate the fail stack -- only
|
|
|
1226 applicable if REGEX_REL_ALLOC is not defined.
|
|
|
1227 */
|
|
|
1228
|
|
428
|
1229 /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the
|
|
|
1230 searching and matching functions should not call alloca. On some
|
|
|
1231 systems, alloca is implemented in terms of malloc, and if we're
|
|
|
1232 using the relocating allocator routines, then malloc could cause a
|
|
|
1233 relocation, which might (if the strings being searched are in the
|
|
|
1234 ralloc heap) shift the data out from underneath the regexp
|
|
771
|
1235 routines. [To clarify: The purpose of rel-alloc is to allow data to
|
|
|
1236 be moved in memory from one place to another so that all data
|
|
|
1237 blocks can be consolidated together and excess memory released back
|
|
|
1238 to the operating system. This requires that all the blocks that
|
|
|
1239 are managed by rel-alloc go at the very end of the program's heap,
|
|
|
1240 after all regularly malloc()ed data. malloc(), however, is used to
|
|
|
1241 owning the end of the heap, so that when more memory is needed, it
|
|
|
1242 just expands the heap using sbrk(). This is reconciled by using a
|
|
|
1243 malloc() (such as malloc.c, gmalloc.c, or recent versions of
|
|
|
1244 malloc() in libc) where the sbrk() call can be replaced with a
|
|
|
1245 user-specified call -- in this case, to rel-alloc's r_alloc_sbrk()
|
|
|
1246 routine. This routine calls the real sbrk(), but then shifts all
|
|
|
1247 the rel-alloc-managed blocks forward to the end of the heap again,
|
|
|
1248 so that malloc() gets the memory it needs in the location it needs
|
|
|
1249 it at. The regex routines may well have pointers to buffer data as
|
|
|
1250 their arguments, and buffers are managed by rel-alloc if rel-alloc
|
|
|
1251 has been enabled, so calling malloc() may potentially screw things
|
|
|
1252 up badly if it runs out of space and asks for more from the OS.]
|
|
|
1253
|
|
|
1254 [[Here's another reason to avoid allocation: Emacs processes input
|
|
|
1255 from X in a signal handler; processing X input may call malloc; if
|
|
|
1256 input arrives while a matching routine is calling malloc, then
|
|
|
1257 we're scrod. But Emacs can't just block input while calling
|
|
|
1258 matching routines; then we don't notice interrupts when they come
|
|
|
1259 in. So, Emacs blocks input around all regexp calls except the
|
|
|
1260 matching calls, which it leaves unprotected, in the faith that they
|
|
1333
|
1261 will not malloc.]] This previous paragraph is irrelevant under XEmacs,
|
|
|
1262 as we *do not* do anything so stupid as process input from within a
|
|
|
1263 signal handler.
|
|
|
1264
|
|
|
1265 However, the regexp routines may get called reentrantly as a result of
|
|
|
1266 QUIT processing (e.g. under Windows: re_match -> QUIT -> quit_p -> drain
|
|
|
1267 events -> process WM_INITMENU -> call filter -> re_match; see stack
|
|
|
1268 trace in signal.c), so we cannot have any global variables (unless we do
|
|
|
1269 lots of trickiness including some unwind-protects, which isn't worth it
|
|
|
1270 at this point). Hence we MUST have MATCH_MAY_ALLOCATE defined.
|
|
|
1271
|
|
|
1272 Also, the first paragraph does not make complete sense to me -- what
|
|
|
1273 about the use of rel-alloc to handle the fail stacks? Shouldn't these
|
|
|
1274 reallocations potentially cause buffer data to be relocated as well? I
|
|
826
|
1275 must be missing something, though -- perhaps the writer above is
|
|
|
1276 assuming that the failure stack(s) will always be allocated after the
|
|
|
1277 buffer data, and thus reallocating them with rel-alloc won't move buffer
|
|
1333
|
1278 data. (In fact, a cursory glance at the code in ralloc.c seems to
|
|
|
1279 confirm this.) --ben */
|
|
428
|
1280
|
|
|
1281 /* Normally, this is fine. */
|
|
|
1282 #define MATCH_MAY_ALLOCATE
|
|
|
1283
|
|
|
1284 /* When using GNU C, we are not REALLY using the C alloca, no matter
|
|
|
1285 what config.h may say. So don't take precautions for it. */
|
|
|
1286 #ifdef __GNUC__
|
|
|
1287 #undef C_ALLOCA
|
|
|
1288 #endif
|
|
|
1289
|
|
|
1290 /* The match routines may not allocate if (1) they would do it with malloc
|
|
|
1291 and (2) it's not safe for them to use malloc.
|
|
|
1292 Note that if REL_ALLOC is defined, matching would not use malloc for the
|
|
|
1293 failure stack, but we would still use it for the register vectors;
|
|
|
1294 so REL_ALLOC should not affect this. */
|
|
771
|
1295
|
|
1333
|
1296 /* XEmacs can handle REL_ALLOC and malloc() OK */
|
|
|
1297 #if !defined (emacs) && (defined (C_ALLOCA) || defined (REGEX_MALLOC)) && defined (REL_ALLOC)
|
|
428
|
1298 #undef MATCH_MAY_ALLOCATE
|
|
|
1299 #endif
|
|
|
1300
|
|
1333
|
1301 #if !defined (MATCH_MAY_ALLOCATE) && defined (emacs)
|
|
771
|
1302 #error regex must be handle reentrancy; MATCH_MAY_ALLOCATE must be defined
|
|
|
1303 #endif
|
|
|
1304
|
|
428
|
1305
|
|
|
1306 /* Failure stack declarations and macros; both re_compile_fastmap and
|
|
|
1307 re_match_2 use a failure stack. These have to be macros because of
|
|
|
1308 REGEX_ALLOCATE_STACK. */
|
|
|
1309
|
|
|
1310
|
|
|
1311 /* Number of failure points for which to initially allocate space
|
|
|
1312 when matching. If this number is exceeded, we allocate more
|
|
|
1313 space, so it is not a hard limit. */
|
|
|
1314 #ifndef INIT_FAILURE_ALLOC
|
|
|
1315 #define INIT_FAILURE_ALLOC 5
|
|
|
1316 #endif
|
|
|
1317
|
|
|
1318 /* Roughly the maximum number of failure points on the stack. Would be
|
|
|
1319 exactly that if always used MAX_FAILURE_SPACE each time we failed.
|
|
|
1320 This is a variable only so users of regex can assign to it; we never
|
|
|
1321 change it ourselves. */
|
|
|
1322 #if defined (MATCH_MAY_ALLOCATE)
|
|
|
1323 /* 4400 was enough to cause a crash on Alpha OSF/1,
|
|
|
1324 whose default stack limit is 2mb. */
|
|
|
1325 int re_max_failures = 20000;
|
|
|
1326 #else
|
|
|
1327 int re_max_failures = 2000;
|
|
|
1328 #endif
|
|
|
1329
|
|
|
1330 union fail_stack_elt
|
|
|
1331 {
|
|
446
|
1332 re_char *pointer;
|
|
428
|
1333 int integer;
|
|
|
1334 };
|
|
|
1335
|
|
|
1336 typedef union fail_stack_elt fail_stack_elt_t;
|
|
|
1337
|
|
|
1338 typedef struct
|
|
|
1339 {
|
|
|
1340 fail_stack_elt_t *stack;
|
|
665
|
1341 Elemcount size;
|
|
|
1342 Elemcount avail; /* Offset of next open position. */
|
|
428
|
1343 } fail_stack_type;
|
|
|
1344
|
|
|
1345 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)
|
|
|
1346 #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
|
|
|
1347 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
|
|
|
1348
|
|
|
1349
|
|
|
1350 /* Define macros to initialize and free the failure stack.
|
|
|
1351 Do `return -2' if the alloc fails. */
|
|
|
1352
|
|
|
1353 #ifdef MATCH_MAY_ALLOCATE
|
|
1333
|
1354 #define INIT_FAIL_STACK() \
|
|
|
1355 do { \
|
|
|
1356 fail_stack.stack = (fail_stack_elt_t *) \
|
|
|
1357 REGEX_ALLOCATE_STACK (INIT_FAILURE_ALLOC * \
|
|
|
1358 sizeof (fail_stack_elt_t)); \
|
|
|
1359 \
|
|
|
1360 if (fail_stack.stack == NULL) \
|
|
|
1361 { \
|
|
|
1362 UNBIND_REGEX_MALLOC_CHECK (); \
|
|
|
1363 return -2; \
|
|
|
1364 } \
|
|
|
1365 \
|
|
|
1366 fail_stack.size = INIT_FAILURE_ALLOC; \
|
|
|
1367 fail_stack.avail = 0; \
|
|
428
|
1368 } while (0)
|
|
|
1369
|
|
|
1370 #define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
|
|
|
1371 #else
|
|
|
1372 #define INIT_FAIL_STACK() \
|
|
|
1373 do { \
|
|
|
1374 fail_stack.avail = 0; \
|
|
|
1375 } while (0)
|
|
|
1376
|
|
|
1377 #define RESET_FAIL_STACK()
|
|
|
1378 #endif
|
|
|
1379
|
|
|
1380
|
|
|
1381 /* Double the size of FAIL_STACK, up to approximately `re_max_failures' items.
|
|
|
1382
|
|
|
1383 Return 1 if succeeds, and 0 if either ran out of memory
|
|
|
1384 allocating space for it or it was already too large.
|
|
|
1385
|
|
|
1386 REGEX_REALLOCATE_STACK requires `destination' be declared. */
|
|
|
1387
|
|
|
1388 #define DOUBLE_FAIL_STACK(fail_stack) \
|
|
|
1389 ((fail_stack).size > re_max_failures * MAX_FAILURE_ITEMS \
|
|
|
1390 ? 0 \
|
|
|
1391 : ((fail_stack).stack = (fail_stack_elt_t *) \
|
|
|
1392 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
|
|
|
1393 (fail_stack).size * sizeof (fail_stack_elt_t), \
|
|
|
1394 ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \
|
|
|
1395 \
|
|
|
1396 (fail_stack).stack == NULL \
|
|
|
1397 ? 0 \
|
|
|
1398 : ((fail_stack).size <<= 1, \
|
|
|
1399 1)))
|
|
|
1400
|
|
1333
|
1401 #if !defined (emacs) || !defined (REL_ALLOC)
|
|
|
1402 #define RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS()
|
|
|
1403 #else
|
|
|
1404 /* Don't change NULL pointers */
|
|
|
1405 #define ADD_IF_NZ(val) if (val) val += rmdp_offset
|
|
1346
|
1406 #define RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS() \
|
|
|
1407 do \
|
|
|
1408 { \
|
|
|
1409 Bytecount rmdp_offset = offset_post_relocation (lispobj, orig_buftext); \
|
|
|
1410 \
|
|
|
1411 if (rmdp_offset) \
|
|
|
1412 { \
|
|
|
1413 int i; \
|
|
|
1414 \
|
|
|
1415 ADD_IF_NZ (string1); \
|
|
|
1416 ADD_IF_NZ (string2); \
|
|
|
1417 ADD_IF_NZ (d); \
|
|
|
1418 ADD_IF_NZ (dend); \
|
|
|
1419 ADD_IF_NZ (end1); \
|
|
|
1420 ADD_IF_NZ (end2); \
|
|
|
1421 ADD_IF_NZ (end_match_1); \
|
|
|
1422 ADD_IF_NZ (end_match_2); \
|
|
|
1423 \
|
|
|
1424 if (bufp->re_ngroups) \
|
|
|
1425 { \
|
|
|
1426 for (i = 0; i < num_regs; i++) \
|
|
|
1427 { \
|
|
|
1428 ADD_IF_NZ (regstart[i]); \
|
|
|
1429 ADD_IF_NZ (regend[i]); \
|
|
|
1430 ADD_IF_NZ (old_regstart[i]); \
|
|
|
1431 ADD_IF_NZ (old_regend[i]); \
|
|
|
1432 ADD_IF_NZ (best_regstart[i]); \
|
|
|
1433 ADD_IF_NZ (best_regend[i]); \
|
|
|
1434 ADD_IF_NZ (reg_dummy[i]); \
|
|
|
1435 } \
|
|
|
1436 } \
|
|
|
1437 \
|
|
|
1438 ADD_IF_NZ (match_end); \
|
|
|
1439 } \
|
|
1333
|
1440 } while (0)
|
|
|
1441 #endif /* !defined (emacs) || !defined (REL_ALLOC) */
|
|
|
1442
|
|
|
1443 #if !defined (emacs) || !defined (REL_ALLOC)
|
|
|
1444 #define RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS()
|
|
|
1445 #else
|
|
1346
|
1446 #define RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS() \
|
|
|
1447 do \
|
|
|
1448 { \
|
|
|
1449 Bytecount rmdp_offset = offset_post_relocation (lispobj, orig_buftext); \
|
|
|
1450 \
|
|
|
1451 if (rmdp_offset) \
|
|
|
1452 { \
|
|
|
1453 ADD_IF_NZ (str1); \
|
|
|
1454 ADD_IF_NZ (str2); \
|
|
|
1455 ADD_IF_NZ (string1); \
|
|
|
1456 ADD_IF_NZ (string2); \
|
|
|
1457 ADD_IF_NZ (d); \
|
|
|
1458 } \
|
|
1333
|
1459 } while (0)
|
|
|
1460
|
|
|
1461 #endif /* emacs */
|
|
428
|
1462
|
|
|
1463 /* Push pointer POINTER on FAIL_STACK.
|
|
|
1464 Return 1 if was able to do so and 0 if ran out of memory allocating
|
|
|
1465 space to do so. */
|
|
|
1466 #define PUSH_PATTERN_OP(POINTER, FAIL_STACK) \
|
|
|
1467 ((FAIL_STACK_FULL () \
|
|
|
1468 && !DOUBLE_FAIL_STACK (FAIL_STACK)) \
|
|
|
1469 ? 0 \
|
|
|
1470 : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \
|
|
|
1471 1))
|
|
|
1472
|
|
|
1473 /* Push a pointer value onto the failure stack.
|
|
|
1474 Assumes the variable `fail_stack'. Probably should only
|
|
|
1475 be called from within `PUSH_FAILURE_POINT'. */
|
|
|
1476 #define PUSH_FAILURE_POINTER(item) \
|
|
|
1477 fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
|
|
|
1478
|
|
|
1479 /* This pushes an integer-valued item onto the failure stack.
|
|
|
1480 Assumes the variable `fail_stack'. Probably should only
|
|
|
1481 be called from within `PUSH_FAILURE_POINT'. */
|
|
|
1482 #define PUSH_FAILURE_INT(item) \
|
|
|
1483 fail_stack.stack[fail_stack.avail++].integer = (item)
|
|
|
1484
|
|
|
1485 /* Push a fail_stack_elt_t value onto the failure stack.
|
|
|
1486 Assumes the variable `fail_stack'. Probably should only
|
|
|
1487 be called from within `PUSH_FAILURE_POINT'. */
|
|
|
1488 #define PUSH_FAILURE_ELT(item) \
|
|
|
1489 fail_stack.stack[fail_stack.avail++] = (item)
|
|
|
1490
|
|
|
1491 /* These three POP... operations complement the three PUSH... operations.
|
|
|
1492 All assume that `fail_stack' is nonempty. */
|
|
|
1493 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
|
|
|
1494 #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
|
|
|
1495 #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
|
|
|
1496
|
|
|
1497 /* Used to omit pushing failure point id's when we're not debugging. */
|
|
|
1498 #ifdef DEBUG
|
|
|
1499 #define DEBUG_PUSH PUSH_FAILURE_INT
|
|
|
1500 #define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_INT ()
|
|
|
1501 #else
|
|
|
1502 #define DEBUG_PUSH(item)
|
|
|
1503 #define DEBUG_POP(item_addr)
|
|
|
1504 #endif
|
|
|
1505
|
|
|
1506
|
|
|
1507 /* Push the information about the state we will need
|
|
|
1508 if we ever fail back to it.
|
|
|
1509
|
|
|
1510 Requires variables fail_stack, regstart, regend, reg_info, and
|
|
|
1511 num_regs be declared. DOUBLE_FAIL_STACK requires `destination' be
|
|
|
1512 declared.
|
|
|
1513
|
|
|
1514 Does `return FAILURE_CODE' if runs out of memory. */
|
|
|
1515
|
|
771
|
1516 #if !defined (REGEX_MALLOC) && !defined (REGEX_REL_ALLOC)
|
|
456
|
1517 #define DECLARE_DESTINATION char *destination
|
|
428
|
1518 #else
|
|
456
|
1519 #define DECLARE_DESTINATION DECLARE_NOTHING
|
|
428
|
1520 #endif
|
|
|
1521
|
|
|
1522 #define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code) \
|
|
456
|
1523 do { \
|
|
|
1524 DECLARE_DESTINATION; \
|
|
|
1525 /* Must be int, so when we don't save any registers, the arithmetic \
|
|
|
1526 of 0 + -1 isn't done as unsigned. */ \
|
|
|
1527 int this_reg; \
|
|
428
|
1528 \
|
|
456
|
1529 DEBUG_STATEMENT (failure_id++); \
|
|
|
1530 DEBUG_STATEMENT (nfailure_points_pushed++); \
|
|
647
|
1531 DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%d:\n", failure_id); \
|
|
|
1532 DEBUG_PRINT2 (" Before push, next avail: %ld\n", \
|
|
|
1533 (long) (fail_stack).avail); \
|
|
|
1534 DEBUG_PRINT2 (" size: %ld\n", \
|
|
|
1535 (long) (fail_stack).size); \
|
|
456
|
1536 \
|
|
|
1537 DEBUG_PRINT2 (" slots needed: %d\n", NUM_FAILURE_ITEMS); \
|
|
|
1538 DEBUG_PRINT2 (" available: %ld\n", \
|
|
|
1539 (long) REMAINING_AVAIL_SLOTS); \
|
|
428
|
1540 \
|
|
456
|
1541 /* Ensure we have enough space allocated for what we will push. */ \
|
|
|
1542 while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS) \
|
|
|
1543 { \
|
|
1333
|
1544 BEGIN_REGEX_MALLOC_OK (); \
|
|
456
|
1545 if (!DOUBLE_FAIL_STACK (fail_stack)) \
|
|
1333
|
1546 { \
|
|
|
1547 END_REGEX_MALLOC_OK (); \
|
|
|
1548 UNBIND_REGEX_MALLOC_CHECK (); \
|
|
|
1549 return failure_code; \
|
|
|
1550 } \
|
|
|
1551 END_REGEX_MALLOC_OK (); \
|
|
647
|
1552 DEBUG_PRINT2 ("\n Doubled stack; size now: %ld\n", \
|
|
|
1553 (long) (fail_stack).size); \
|
|
456
|
1554 DEBUG_PRINT2 (" slots available: %ld\n", \
|
|
|
1555 (long) REMAINING_AVAIL_SLOTS); \
|
|
1333
|
1556 \
|
|
|
1557 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS (); \
|
|
456
|
1558 } \
|
|
428
|
1559 \
|
|
456
|
1560 /* Push the info, starting with the registers. */ \
|
|
|
1561 DEBUG_PRINT1 ("\n"); \
|
|
428
|
1562 \
|
|
456
|
1563 for (this_reg = lowest_active_reg; this_reg <= highest_active_reg; \
|
|
|
1564 this_reg++) \
|
|
|
1565 { \
|
|
|
1566 DEBUG_PRINT2 (" Pushing reg: %d\n", this_reg); \
|
|
|
1567 DEBUG_STATEMENT (num_regs_pushed++); \
|
|
428
|
1568 \
|
|
456
|
1569 DEBUG_PRINT2 (" start: 0x%lx\n", (long) regstart[this_reg]); \
|
|
|
1570 PUSH_FAILURE_POINTER (regstart[this_reg]); \
|
|
|
1571 \
|
|
|
1572 DEBUG_PRINT2 (" end: 0x%lx\n", (long) regend[this_reg]); \
|
|
|
1573 PUSH_FAILURE_POINTER (regend[this_reg]); \
|
|
428
|
1574 \
|
|
456
|
1575 DEBUG_PRINT2 (" info: 0x%lx\n ", \
|
|
|
1576 * (long *) (®_info[this_reg])); \
|
|
|
1577 DEBUG_PRINT2 (" match_null=%d", \
|
|
|
1578 REG_MATCH_NULL_STRING_P (reg_info[this_reg])); \
|
|
|
1579 DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg])); \
|
|
|
1580 DEBUG_PRINT2 (" matched_something=%d", \
|
|
|
1581 MATCHED_SOMETHING (reg_info[this_reg])); \
|
|
|
1582 DEBUG_PRINT2 (" ever_matched_something=%d", \
|
|
|
1583 EVER_MATCHED_SOMETHING (reg_info[this_reg])); \
|
|
|
1584 DEBUG_PRINT1 ("\n"); \
|
|
|
1585 PUSH_FAILURE_ELT (reg_info[this_reg].word); \
|
|
|
1586 } \
|
|
428
|
1587 \
|
|
456
|
1588 DEBUG_PRINT2 (" Pushing low active reg: %d\n", lowest_active_reg); \
|
|
|
1589 PUSH_FAILURE_INT (lowest_active_reg); \
|
|
428
|
1590 \
|
|
456
|
1591 DEBUG_PRINT2 (" Pushing high active reg: %d\n", highest_active_reg); \
|
|
|
1592 PUSH_FAILURE_INT (highest_active_reg); \
|
|
428
|
1593 \
|
|
456
|
1594 DEBUG_PRINT2 (" Pushing pattern 0x%lx: \n", (long) pattern_place); \
|
|
|
1595 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
|
|
|
1596 PUSH_FAILURE_POINTER (pattern_place); \
|
|
428
|
1597 \
|
|
456
|
1598 DEBUG_PRINT2 (" Pushing string 0x%lx: `", (long) string_place); \
|
|
|
1599 DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, \
|
|
|
1600 size2); \
|
|
|
1601 DEBUG_PRINT1 ("'\n"); \
|
|
|
1602 PUSH_FAILURE_POINTER (string_place); \
|
|
428
|
1603 \
|
|
456
|
1604 DEBUG_PRINT2 (" Pushing failure id: %u\n", failure_id); \
|
|
|
1605 DEBUG_PUSH (failure_id); \
|
|
|
1606 } while (0)
|
|
428
|
1607
|
|
|
1608 /* This is the number of items that are pushed and popped on the stack
|
|
|
1609 for each register. */
|
|
|
1610 #define NUM_REG_ITEMS 3
|
|
|
1611
|
|
|
1612 /* Individual items aside from the registers. */
|
|
|
1613 #ifdef DEBUG
|
|
|
1614 #define NUM_NONREG_ITEMS 5 /* Includes failure point id. */
|
|
|
1615 #else
|
|
|
1616 #define NUM_NONREG_ITEMS 4
|
|
|
1617 #endif
|
|
|
1618
|
|
|
1619 /* We push at most this many items on the stack. */
|
|
|
1620 /* We used to use (num_regs - 1), which is the number of registers
|
|
|
1621 this regexp will save; but that was changed to 5
|
|
|
1622 to avoid stack overflow for a regexp with lots of parens. */
|
|
|
1623 #define MAX_FAILURE_ITEMS (5 * NUM_REG_ITEMS + NUM_NONREG_ITEMS)
|
|
|
1624
|
|
|
1625 /* We actually push this many items. */
|
|
|
1626 #define NUM_FAILURE_ITEMS \
|
|
|
1627 ((highest_active_reg - lowest_active_reg + 1) * NUM_REG_ITEMS \
|
|
|
1628 + NUM_NONREG_ITEMS)
|
|
|
1629
|
|
|
1630 /* How many items can still be added to the stack without overflowing it. */
|
|
|
1631 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
|
|
|
1632
|
|
|
1633
|
|
|
1634 /* Pops what PUSH_FAIL_STACK pushes.
|
|
|
1635
|
|
|
1636 We restore into the parameters, all of which should be lvalues:
|
|
|
1637 STR -- the saved data position.
|
|
|
1638 PAT -- the saved pattern position.
|
|
|
1639 LOW_REG, HIGH_REG -- the highest and lowest active registers.
|
|
|
1640 REGSTART, REGEND -- arrays of string positions.
|
|
|
1641 REG_INFO -- array of information about each subexpression.
|
|
|
1642
|
|
|
1643 Also assumes the variables `fail_stack' and (if debugging), `bufp',
|
|
|
1644 `pend', `string1', `size1', `string2', and `size2'. */
|
|
|
1645
|
|
456
|
1646 #define POP_FAILURE_POINT(str, pat, low_reg, high_reg, \
|
|
|
1647 regstart, regend, reg_info) \
|
|
|
1648 do { \
|
|
428
|
1649 DEBUG_STATEMENT (fail_stack_elt_t ffailure_id;) \
|
|
|
1650 int this_reg; \
|
|
442
|
1651 const unsigned char *string_temp; \
|
|
428
|
1652 \
|
|
|
1653 assert (!FAIL_STACK_EMPTY ()); \
|
|
|
1654 \
|
|
|
1655 /* Remove failure points and point to how many regs pushed. */ \
|
|
|
1656 DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \
|
|
647
|
1657 DEBUG_PRINT2 (" Before pop, next avail: %ld\n", \
|
|
|
1658 (long) fail_stack.avail); \
|
|
|
1659 DEBUG_PRINT2 (" size: %ld\n", \
|
|
|
1660 (long) fail_stack.size); \
|
|
428
|
1661 \
|
|
|
1662 assert (fail_stack.avail >= NUM_NONREG_ITEMS); \
|
|
|
1663 \
|
|
|
1664 DEBUG_POP (&ffailure_id.integer); \
|
|
647
|
1665 DEBUG_PRINT2 (" Popping failure id: %d\n", \
|
|
|
1666 * (int *) &ffailure_id); \
|
|
428
|
1667 \
|
|
|
1668 /* If the saved string location is NULL, it came from an \
|
|
|
1669 on_failure_keep_string_jump opcode, and we want to throw away the \
|
|
|
1670 saved NULL, thus retaining our current position in the string. */ \
|
|
|
1671 string_temp = POP_FAILURE_POINTER (); \
|
|
|
1672 if (string_temp != NULL) \
|
|
446
|
1673 str = string_temp; \
|
|
428
|
1674 \
|
|
|
1675 DEBUG_PRINT2 (" Popping string 0x%lx: `", (long) str); \
|
|
|
1676 DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \
|
|
|
1677 DEBUG_PRINT1 ("'\n"); \
|
|
|
1678 \
|
|
|
1679 pat = (unsigned char *) POP_FAILURE_POINTER (); \
|
|
|
1680 DEBUG_PRINT2 (" Popping pattern 0x%lx: ", (long) pat); \
|
|
|
1681 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
|
|
|
1682 \
|
|
|
1683 /* Restore register info. */ \
|
|
647
|
1684 high_reg = POP_FAILURE_INT (); \
|
|
428
|
1685 DEBUG_PRINT2 (" Popping high active reg: %d\n", high_reg); \
|
|
|
1686 \
|
|
647
|
1687 low_reg = POP_FAILURE_INT (); \
|
|
428
|
1688 DEBUG_PRINT2 (" Popping low active reg: %d\n", low_reg); \
|
|
|
1689 \
|
|
|
1690 for (this_reg = high_reg; this_reg >= low_reg; this_reg--) \
|
|
|
1691 { \
|
|
|
1692 DEBUG_PRINT2 (" Popping reg: %d\n", this_reg); \
|
|
|
1693 \
|
|
|
1694 reg_info[this_reg].word = POP_FAILURE_ELT (); \
|
|
|
1695 DEBUG_PRINT2 (" info: 0x%lx\n", \
|
|
|
1696 * (long *) ®_info[this_reg]); \
|
|
|
1697 \
|
|
446
|
1698 regend[this_reg] = POP_FAILURE_POINTER (); \
|
|
428
|
1699 DEBUG_PRINT2 (" end: 0x%lx\n", (long) regend[this_reg]); \
|
|
|
1700 \
|
|
446
|
1701 regstart[this_reg] = POP_FAILURE_POINTER (); \
|
|
428
|
1702 DEBUG_PRINT2 (" start: 0x%lx\n", (long) regstart[this_reg]); \
|
|
|
1703 } \
|
|
|
1704 \
|
|
|
1705 set_regs_matched_done = 0; \
|
|
|
1706 DEBUG_STATEMENT (nfailure_points_popped++); \
|
|
456
|
1707 } while (0) /* POP_FAILURE_POINT */
|
|
428
|
1708
|
|
|
1709
|
|
|
1710
|
|
|
1711 /* Structure for per-register (a.k.a. per-group) information.
|
|
|
1712 Other register information, such as the
|
|
|
1713 starting and ending positions (which are addresses), and the list of
|
|
|
1714 inner groups (which is a bits list) are maintained in separate
|
|
|
1715 variables.
|
|
|
1716
|
|
|
1717 We are making a (strictly speaking) nonportable assumption here: that
|
|
|
1718 the compiler will pack our bit fields into something that fits into
|
|
|
1719 the type of `word', i.e., is something that fits into one item on the
|
|
|
1720 failure stack. */
|
|
|
1721
|
|
|
1722 typedef union
|
|
|
1723 {
|
|
|
1724 fail_stack_elt_t word;
|
|
|
1725 struct
|
|
|
1726 {
|
|
|
1727 /* This field is one if this group can match the empty string,
|
|
|
1728 zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */
|
|
|
1729 #define MATCH_NULL_UNSET_VALUE 3
|
|
647
|
1730 unsigned int match_null_string_p : 2;
|
|
|
1731 unsigned int is_active : 1;
|
|
|
1732 unsigned int matched_something : 1;
|
|
|
1733 unsigned int ever_matched_something : 1;
|
|
428
|
1734 } bits;
|
|
|
1735 } register_info_type;
|
|
|
1736
|
|
|
1737 #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p)
|
|
|
1738 #define IS_ACTIVE(R) ((R).bits.is_active)
|
|
|
1739 #define MATCHED_SOMETHING(R) ((R).bits.matched_something)
|
|
|
1740 #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something)
|
|
|
1741
|
|
|
1742
|
|
|
1743 /* Call this when have matched a real character; it sets `matched' flags
|
|
|
1744 for the subexpressions which we are currently inside. Also records
|
|
|
1745 that those subexprs have matched. */
|
|
|
1746 #define SET_REGS_MATCHED() \
|
|
|
1747 do \
|
|
|
1748 { \
|
|
|
1749 if (!set_regs_matched_done) \
|
|
|
1750 { \
|
|
647
|
1751 int r; \
|
|
428
|
1752 set_regs_matched_done = 1; \
|
|
|
1753 for (r = lowest_active_reg; r <= highest_active_reg; r++) \
|
|
|
1754 { \
|
|
|
1755 MATCHED_SOMETHING (reg_info[r]) \
|
|
|
1756 = EVER_MATCHED_SOMETHING (reg_info[r]) \
|
|
|
1757 = 1; \
|
|
|
1758 } \
|
|
|
1759 } \
|
|
|
1760 } \
|
|
|
1761 while (0)
|
|
|
1762
|
|
|
1763 /* Registers are set to a sentinel when they haven't yet matched. */
|
|
446
|
1764 static unsigned char reg_unset_dummy;
|
|
428
|
1765 #define REG_UNSET_VALUE (®_unset_dummy)
|
|
|
1766 #define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
|
|
|
1767
|
|
|
1768 /* Subroutine declarations and macros for regex_compile. */
|
|
|
1769
|
|
|
1770 /* Fetch the next character in the uncompiled pattern---translating it
|
|
826
|
1771 if necessary. */
|
|
428
|
1772 #define PATFETCH(c) \
|
|
446
|
1773 do { \
|
|
|
1774 PATFETCH_RAW (c); \
|
|
826
|
1775 c = RE_TRANSLATE (c); \
|
|
428
|
1776 } while (0)
|
|
|
1777
|
|
|
1778 /* Fetch the next character in the uncompiled pattern, with no
|
|
|
1779 translation. */
|
|
|
1780 #define PATFETCH_RAW(c) \
|
|
|
1781 do {if (p == pend) return REG_EEND; \
|
|
|
1782 assert (p < pend); \
|
|
867
|
1783 c = itext_ichar (p); \
|
|
|
1784 INC_IBYTEPTR (p); \
|
|
428
|
1785 } while (0)
|
|
|
1786
|
|
|
1787 /* Go backwards one character in the pattern. */
|
|
867
|
1788 #define PATUNFETCH DEC_IBYTEPTR (p)
|
|
428
|
1789
|
|
|
1790 /* If `translate' is non-null, return translate[D], else just D. We
|
|
|
1791 cast the subscript to translate because some data is declared as
|
|
|
1792 `char *', to avoid warnings when a string constant is passed. But
|
|
|
1793 when we use a character as a subscript we must make it unsigned. */
|
|
826
|
1794 #define RE_TRANSLATE(d) \
|
|
|
1795 (TRANSLATE_P (translate) ? RE_TRANSLATE_1 (d) : (d))
|
|
428
|
1796
|
|
|
1797 /* Macros for outputting the compiled pattern into `buffer'. */
|
|
|
1798
|
|
|
1799 /* If the buffer isn't allocated when it comes in, use this. */
|
|
|
1800 #define INIT_BUF_SIZE 32
|
|
|
1801
|
|
|
1802 /* Make sure we have at least N more bytes of space in buffer. */
|
|
|
1803 #define GET_BUFFER_SPACE(n) \
|
|
647
|
1804 while (buf_end - bufp->buffer + (n) > (ptrdiff_t) bufp->allocated) \
|
|
428
|
1805 EXTEND_BUFFER ()
|
|
|
1806
|
|
|
1807 /* Make sure we have one more byte of buffer space and then add C to it. */
|
|
|
1808 #define BUF_PUSH(c) \
|
|
|
1809 do { \
|
|
|
1810 GET_BUFFER_SPACE (1); \
|
|
446
|
1811 *buf_end++ = (unsigned char) (c); \
|
|
428
|
1812 } while (0)
|
|
|
1813
|
|
|
1814
|
|
|
1815 /* Ensure we have two more bytes of buffer space and then append C1 and C2. */
|
|
|
1816 #define BUF_PUSH_2(c1, c2) \
|
|
|
1817 do { \
|
|
|
1818 GET_BUFFER_SPACE (2); \
|
|
446
|
1819 *buf_end++ = (unsigned char) (c1); \
|
|
|
1820 *buf_end++ = (unsigned char) (c2); \
|
|
428
|
1821 } while (0)
|
|
|
1822
|
|
|
1823
|
|
|
1824 /* As with BUF_PUSH_2, except for three bytes. */
|
|
|
1825 #define BUF_PUSH_3(c1, c2, c3) \
|
|
|
1826 do { \
|
|
|
1827 GET_BUFFER_SPACE (3); \
|
|
446
|
1828 *buf_end++ = (unsigned char) (c1); \
|
|
|
1829 *buf_end++ = (unsigned char) (c2); \
|
|
|
1830 *buf_end++ = (unsigned char) (c3); \
|
|
428
|
1831 } while (0)
|
|
|
1832
|
|
|
1833
|
|
|
1834 /* Store a jump with opcode OP at LOC to location TO. We store a
|
|
|
1835 relative address offset by the three bytes the jump itself occupies. */
|
|
|
1836 #define STORE_JUMP(op, loc, to) \
|
|
|
1837 store_op1 (op, loc, (to) - (loc) - 3)
|
|
|
1838
|
|
|
1839 /* Likewise, for a two-argument jump. */
|
|
|
1840 #define STORE_JUMP2(op, loc, to, arg) \
|
|
|
1841 store_op2 (op, loc, (to) - (loc) - 3, arg)
|
|
|
1842
|
|
446
|
1843 /* Like `STORE_JUMP', but for inserting. Assume `buf_end' is the
|
|
|
1844 buffer end. */
|
|
428
|
1845 #define INSERT_JUMP(op, loc, to) \
|
|
446
|
1846 insert_op1 (op, loc, (to) - (loc) - 3, buf_end)
|
|
|
1847
|
|
|
1848 /* Like `STORE_JUMP2', but for inserting. Assume `buf_end' is the
|
|
|
1849 buffer end. */
|
|
428
|
1850 #define INSERT_JUMP2(op, loc, to, arg) \
|
|
446
|
1851 insert_op2 (op, loc, (to) - (loc) - 3, arg, buf_end)
|
|
428
|
1852
|
|
|
1853
|
|
|
1854 /* This is not an arbitrary limit: the arguments which represent offsets
|
|
|
1855 into the pattern are two bytes long. So if 2^16 bytes turns out to
|
|
|
1856 be too small, many things would have to change. */
|
|
|
1857 #define MAX_BUF_SIZE (1L << 16)
|
|
|
1858
|
|
|
1859
|
|
|
1860 /* Extend the buffer by twice its current size via realloc and
|
|
|
1861 reset the pointers that pointed into the old block to point to the
|
|
|
1862 correct places in the new one. If extending the buffer results in it
|
|
|
1863 being larger than MAX_BUF_SIZE, then flag memory exhausted. */
|
|
1333
|
1864 #define EXTEND_BUFFER() \
|
|
|
1865 do { \
|
|
|
1866 re_char *old_buffer = bufp->buffer; \
|
|
|
1867 if (bufp->allocated == MAX_BUF_SIZE) \
|
|
|
1868 return REG_ESIZE; \
|
|
|
1869 bufp->allocated <<= 1; \
|
|
|
1870 if (bufp->allocated > MAX_BUF_SIZE) \
|
|
|
1871 bufp->allocated = MAX_BUF_SIZE; \
|
|
|
1872 bufp->buffer = \
|
|
|
1873 (unsigned char *) xrealloc (bufp->buffer, bufp->allocated); \
|
|
|
1874 if (bufp->buffer == NULL) \
|
|
|
1875 return REG_ESPACE; \
|
|
|
1876 /* If the buffer moved, move all the pointers into it. */ \
|
|
|
1877 if (old_buffer != bufp->buffer) \
|
|
|
1878 { \
|
|
|
1879 buf_end = (buf_end - old_buffer) + bufp->buffer; \
|
|
|
1880 begalt = (begalt - old_buffer) + bufp->buffer; \
|
|
|
1881 if (fixup_alt_jump) \
|
|
|
1882 fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer; \
|
|
|
1883 if (laststart) \
|
|
|
1884 laststart = (laststart - old_buffer) + bufp->buffer; \
|
|
|
1885 if (pending_exact) \
|
|
|
1886 pending_exact = (pending_exact - old_buffer) + bufp->buffer; \
|
|
|
1887 } \
|
|
428
|
1888 } while (0)
|
|
|
1889
|
|
|
1890
|
|
|
1891 /* Since we have one byte reserved for the register number argument to
|
|
|
1892 {start,stop}_memory, the maximum number of groups we can report
|
|
|
1893 things about is what fits in that byte. */
|
|
|
1894 #define MAX_REGNUM 255
|
|
|
1895
|
|
|
1896 /* But patterns can have more than `MAX_REGNUM' registers. We just
|
|
502
|
1897 ignore the excess.
|
|
|
1898 #### not true! groups past this will fail in lots of ways, if we
|
|
|
1899 ever have to backtrack.
|
|
|
1900 */
|
|
647
|
1901 typedef int regnum_t;
|
|
428
|
1902
|
|
502
|
1903 #define INIT_REG_TRANSLATE_SIZE 5
|
|
428
|
1904
|
|
|
1905 /* Macros for the compile stack. */
|
|
|
1906
|
|
|
1907 /* Since offsets can go either forwards or backwards, this type needs to
|
|
|
1908 be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */
|
|
|
1909 typedef int pattern_offset_t;
|
|
|
1910
|
|
|
1911 typedef struct
|
|
|
1912 {
|
|
|
1913 pattern_offset_t begalt_offset;
|
|
|
1914 pattern_offset_t fixup_alt_jump;
|
|
|
1915 pattern_offset_t inner_group_offset;
|
|
|
1916 pattern_offset_t laststart_offset;
|
|
|
1917 regnum_t regnum;
|
|
|
1918 } compile_stack_elt_t;
|
|
|
1919
|
|
|
1920
|
|
|
1921 typedef struct
|
|
|
1922 {
|
|
|
1923 compile_stack_elt_t *stack;
|
|
647
|
1924 int size;
|
|
|
1925 int avail; /* Offset of next open position. */
|
|
428
|
1926 } compile_stack_type;
|
|
|
1927
|
|
|
1928
|
|
|
1929 #define INIT_COMPILE_STACK_SIZE 32
|
|
|
1930
|
|
|
1931 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
|
|
|
1932 #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
|
|
|
1933
|
|
|
1934 /* The next available element. */
|
|
|
1935 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
|
|
|
1936
|
|
|
1937
|
|
|
1938 /* Set the bit for character C in a bit vector. */
|
|
|
1939 #define SET_LIST_BIT(c) \
|
|
446
|
1940 (buf_end[((unsigned char) (c)) / BYTEWIDTH] \
|
|
428
|
1941 |= 1 << (((unsigned char) c) % BYTEWIDTH))
|
|
|
1942
|
|
|
1943 #ifdef MULE
|
|
|
1944
|
|
|
1945 /* Set the "bit" for character C in a range table. */
|
|
|
1946 #define SET_RANGETAB_BIT(c) put_range_table (rtab, c, c, Qt)
|
|
|
1947
|
|
|
1948 /* Set the "bit" for character c in the appropriate table. */
|
|
|
1949 #define SET_EITHER_BIT(c) \
|
|
|
1950 do { \
|
|
|
1951 if (has_extended_chars) \
|
|
|
1952 SET_RANGETAB_BIT (c); \
|
|
|
1953 else \
|
|
|
1954 SET_LIST_BIT (c); \
|
|
|
1955 } while (0)
|
|
|
1956
|
|
|
1957 #else /* not MULE */
|
|
|
1958
|
|
|
1959 #define SET_EITHER_BIT(c) SET_LIST_BIT (c)
|
|
|
1960
|
|
|
1961 #endif
|
|
|
1962
|
|
|
1963
|
|
|
1964 /* Get the next unsigned number in the uncompiled pattern. */
|
|
|
1965 #define GET_UNSIGNED_NUMBER(num) \
|
|
|
1966 { if (p != pend) \
|
|
|
1967 { \
|
|
|
1968 PATFETCH (c); \
|
|
|
1969 while (ISDIGIT (c)) \
|
|
|
1970 { \
|
|
|
1971 if (num < 0) \
|
|
|
1972 num = 0; \
|
|
|
1973 num = num * 10 + c - '0'; \
|
|
|
1974 if (p == pend) \
|
|
|
1975 break; \
|
|
|
1976 PATFETCH (c); \
|
|
|
1977 } \
|
|
|
1978 } \
|
|
|
1979 }
|
|
|
1980
|
|
|
1981 #define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */
|
|
|
1982
|
|
|
1983 #define IS_CHAR_CLASS(string) \
|
|
|
1984 (STREQ (string, "alpha") || STREQ (string, "upper") \
|
|
|
1985 || STREQ (string, "lower") || STREQ (string, "digit") \
|
|
|
1986 || STREQ (string, "alnum") || STREQ (string, "xdigit") \
|
|
|
1987 || STREQ (string, "space") || STREQ (string, "print") \
|
|
|
1988 || STREQ (string, "punct") || STREQ (string, "graph") \
|
|
|
1989 || STREQ (string, "cntrl") || STREQ (string, "blank"))
|
|
|
1990
|
|
|
1991 static void store_op1 (re_opcode_t op, unsigned char *loc, int arg);
|
|
|
1992 static void store_op2 (re_opcode_t op, unsigned char *loc, int arg1, int arg2);
|
|
|
1993 static void insert_op1 (re_opcode_t op, unsigned char *loc, int arg,
|
|
|
1994 unsigned char *end);
|
|
|
1995 static void insert_op2 (re_opcode_t op, unsigned char *loc, int arg1, int arg2,
|
|
|
1996 unsigned char *end);
|
|
460
|
1997 static re_bool at_begline_loc_p (re_char *pattern, re_char *p,
|
|
428
|
1998 reg_syntax_t syntax);
|
|
460
|
1999 static re_bool at_endline_loc_p (re_char *p, re_char *pend, int syntax);
|
|
|
2000 static re_bool group_in_compile_stack (compile_stack_type compile_stack,
|
|
428
|
2001 regnum_t regnum);
|
|
446
|
2002 static reg_errcode_t compile_range (re_char **p_ptr, re_char *pend,
|
|
|
2003 RE_TRANSLATE_TYPE translate,
|
|
|
2004 reg_syntax_t syntax,
|
|
428
|
2005 unsigned char *b);
|
|
|
2006 #ifdef MULE
|
|
446
|
2007 static reg_errcode_t compile_extended_range (re_char **p_ptr,
|
|
|
2008 re_char *pend,
|
|
|
2009 RE_TRANSLATE_TYPE translate,
|
|
428
|
2010 reg_syntax_t syntax,
|
|
|
2011 Lisp_Object rtab);
|
|
|
2012 #endif /* MULE */
|
|
460
|
2013 static re_bool group_match_null_string_p (unsigned char **p,
|
|
428
|
2014 unsigned char *end,
|
|
|
2015 register_info_type *reg_info);
|
|
460
|
2016 static re_bool alt_match_null_string_p (unsigned char *p, unsigned char *end,
|
|
428
|
2017 register_info_type *reg_info);
|
|
460
|
2018 static re_bool common_op_match_null_string_p (unsigned char **p,
|
|
428
|
2019 unsigned char *end,
|
|
|
2020 register_info_type *reg_info);
|
|
826
|
2021 static int bcmp_translate (re_char *s1, re_char *s2,
|
|
|
2022 REGISTER int len, RE_TRANSLATE_TYPE translate
|
|
|
2023 #ifdef emacs
|
|
|
2024 , Internal_Format fmt, Lisp_Object lispobj
|
|
|
2025 #endif
|
|
|
2026 );
|
|
428
|
2027 static int re_match_2_internal (struct re_pattern_buffer *bufp,
|
|
446
|
2028 re_char *string1, int size1,
|
|
|
2029 re_char *string2, int size2, int pos,
|
|
826
|
2030 struct re_registers *regs, int stop
|
|
|
2031 RE_LISP_CONTEXT_ARGS_DECL);
|
|
428
|
2032
|
|
|
2033 #ifndef MATCH_MAY_ALLOCATE
|
|
|
2034
|
|
|
2035 /* If we cannot allocate large objects within re_match_2_internal,
|
|
|
2036 we make the fail stack and register vectors global.
|
|
|
2037 The fail stack, we grow to the maximum size when a regexp
|
|
|
2038 is compiled.
|
|
|
2039 The register vectors, we adjust in size each time we
|
|
|
2040 compile a regexp, according to the number of registers it needs. */
|
|
|
2041
|
|
|
2042 static fail_stack_type fail_stack;
|
|
|
2043
|
|
|
2044 /* Size with which the following vectors are currently allocated.
|
|
|
2045 That is so we can make them bigger as needed,
|
|
|
2046 but never make them smaller. */
|
|
|
2047 static int regs_allocated_size;
|
|
|
2048
|
|
446
|
2049 static re_char ** regstart, ** regend;
|
|
|
2050 static re_char ** old_regstart, ** old_regend;
|
|
|
2051 static re_char **best_regstart, **best_regend;
|
|
428
|
2052 static register_info_type *reg_info;
|
|
446
|
2053 static re_char **reg_dummy;
|
|
428
|
2054 static register_info_type *reg_info_dummy;
|
|
|
2055
|
|
|
2056 /* Make the register vectors big enough for NUM_REGS registers,
|
|
|
2057 but don't make them smaller. */
|
|
|
2058
|
|
|
2059 static
|
|
|
2060 regex_grow_registers (int num_regs)
|
|
|
2061 {
|
|
|
2062 if (num_regs > regs_allocated_size)
|
|
|
2063 {
|
|
551
|
2064 RETALLOC (regstart, num_regs, re_char *);
|
|
|
2065 RETALLOC (regend, num_regs, re_char *);
|
|
|
2066 RETALLOC (old_regstart, num_regs, re_char *);
|
|
|
2067 RETALLOC (old_regend, num_regs, re_char *);
|
|
|
2068 RETALLOC (best_regstart, num_regs, re_char *);
|
|
|
2069 RETALLOC (best_regend, num_regs, re_char *);
|
|
|
2070 RETALLOC (reg_info, num_regs, register_info_type);
|
|
|
2071 RETALLOC (reg_dummy, num_regs, re_char *);
|
|
|
2072 RETALLOC (reg_info_dummy, num_regs, register_info_type);
|
|
428
|
2073
|
|
|
2074 regs_allocated_size = num_regs;
|
|
|
2075 }
|
|
|
2076 }
|
|
|
2077
|
|
|
2078 #endif /* not MATCH_MAY_ALLOCATE */
|
|
|
2079
|
|
|
2080 /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
|
|
|
2081 Returns one of error codes defined in `regex.h', or zero for success.
|
|
|
2082
|
|
|
2083 Assumes the `allocated' (and perhaps `buffer') and `translate'
|
|
|
2084 fields are set in BUFP on entry.
|
|
|
2085
|
|
|
2086 If it succeeds, results are put in BUFP (if it returns an error, the
|
|
|
2087 contents of BUFP are undefined):
|
|
|
2088 `buffer' is the compiled pattern;
|
|
|
2089 `syntax' is set to SYNTAX;
|
|
|
2090 `used' is set to the length of the compiled pattern;
|
|
|
2091 `fastmap_accurate' is zero;
|
|
502
|
2092 `re_ngroups' is the number of groups/subexpressions (including shy
|
|
|
2093 groups) in PATTERN;
|
|
|
2094 `re_nsub' is the number of non-shy groups in PATTERN;
|
|
428
|
2095 `not_bol' and `not_eol' are zero;
|
|
|
2096
|
|
|
2097 The `fastmap' and `newline_anchor' fields are neither
|
|
|
2098 examined nor set. */
|
|
|
2099
|
|
|
2100 /* Return, freeing storage we allocated. */
|
|
1726
|
2101 #define FREE_STACK_RETURN(value) \
|
|
|
2102 do \
|
|
|
2103 { \
|
|
|
2104 xfree (compile_stack.stack, compile_stack_elt_t *); \
|
|
|
2105 return value; \
|
|
1333
|
2106 } while (0)
|
|
428
|
2107
|
|
|
2108 static reg_errcode_t
|
|
446
|
2109 regex_compile (re_char *pattern, int size, reg_syntax_t syntax,
|
|
428
|
2110 struct re_pattern_buffer *bufp)
|
|
|
2111 {
|
|
|
2112 /* We fetch characters from PATTERN here. We declare these as int
|
|
|
2113 (or possibly long) so that chars above 127 can be used as
|
|
|
2114 array indices. The macros that fetch a character from the pattern
|
|
|
2115 make sure to coerce to unsigned char before assigning, so we won't
|
|
|
2116 get bitten by negative numbers here. */
|
|
|
2117 /* XEmacs change: used to be unsigned char. */
|
|
|
2118 REGISTER EMACS_INT c, c1;
|
|
|
2119
|
|
|
2120 /* A random temporary spot in PATTERN. */
|
|
446
|
2121 re_char *p1;
|
|
428
|
2122
|
|
|
2123 /* Points to the end of the buffer, where we should append. */
|
|
446
|
2124 REGISTER unsigned char *buf_end;
|
|
428
|
2125
|
|
|
2126 /* Keeps track of unclosed groups. */
|
|
|
2127 compile_stack_type compile_stack;
|
|
|
2128
|
|
|
2129 /* Points to the current (ending) position in the pattern. */
|
|
446
|
2130 re_char *p = pattern;
|
|
|
2131 re_char *pend = pattern + size;
|
|
428
|
2132
|
|
|
2133 /* How to translate the characters in the pattern. */
|
|
446
|
2134 RE_TRANSLATE_TYPE translate = bufp->translate;
|
|
428
|
2135
|
|
|
2136 /* Address of the count-byte of the most recently inserted `exactn'
|
|
|
2137 command. This makes it possible to tell if a new exact-match
|
|
|
2138 character can be added to that command or if the character requires
|
|
|
2139 a new `exactn' command. */
|
|
|
2140 unsigned char *pending_exact = 0;
|
|
|
2141
|
|
|
2142 /* Address of start of the most recently finished expression.
|
|
|
2143 This tells, e.g., postfix * where to find the start of its
|
|
|
2144 operand. Reset at the beginning of groups and alternatives. */
|
|
|
2145 unsigned char *laststart = 0;
|
|
|
2146
|
|
|
2147 /* Address of beginning of regexp, or inside of last group. */
|
|
|
2148 unsigned char *begalt;
|
|
|
2149
|
|
|
2150 /* Place in the uncompiled pattern (i.e., the {) to
|
|
|
2151 which to go back if the interval is invalid. */
|
|
446
|
2152 re_char *beg_interval;
|
|
428
|
2153
|
|
|
2154 /* Address of the place where a forward jump should go to the end of
|
|
|
2155 the containing expression. Each alternative of an `or' -- except the
|
|
|
2156 last -- ends with a forward jump of this sort. */
|
|
|
2157 unsigned char *fixup_alt_jump = 0;
|
|
|
2158
|
|
|
2159 /* Counts open-groups as they are encountered. Remembered for the
|
|
|
2160 matching close-group on the compile stack, so the same register
|
|
|
2161 number is put in the stop_memory as the start_memory. */
|
|
|
2162 regnum_t regnum = 0;
|
|
|
2163
|
|
|
2164 #ifdef DEBUG
|
|
|
2165 DEBUG_PRINT1 ("\nCompiling pattern: ");
|
|
|
2166 if (debug)
|
|
|
2167 {
|
|
647
|
2168 int debug_count;
|
|
428
|
2169
|
|
|
2170 for (debug_count = 0; debug_count < size; debug_count++)
|
|
|
2171 putchar (pattern[debug_count]);
|
|
|
2172 putchar ('\n');
|
|
|
2173 }
|
|
|
2174 #endif /* DEBUG */
|
|
|
2175
|
|
|
2176 /* Initialize the compile stack. */
|
|
|
2177 compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
|
|
|
2178 if (compile_stack.stack == NULL)
|
|
|
2179 return REG_ESPACE;
|
|
|
2180
|
|
|
2181 compile_stack.size = INIT_COMPILE_STACK_SIZE;
|
|
|
2182 compile_stack.avail = 0;
|
|
|
2183
|
|
|
2184 /* Initialize the pattern buffer. */
|
|
|
2185 bufp->syntax = syntax;
|
|
|
2186 bufp->fastmap_accurate = 0;
|
|
|
2187 bufp->not_bol = bufp->not_eol = 0;
|
|
|
2188
|
|
|
2189 /* Set `used' to zero, so that if we return an error, the pattern
|
|
|
2190 printer (for debugging) will think there's no pattern. We reset it
|
|
|
2191 at the end. */
|
|
|
2192 bufp->used = 0;
|
|
|
2193
|
|
|
2194 /* Always count groups, whether or not bufp->no_sub is set. */
|
|
|
2195 bufp->re_nsub = 0;
|
|
502
|
2196 bufp->re_ngroups = 0;
|
|
|
2197
|
|
|
2198 bufp->warned_about_incompatible_back_references = 0;
|
|
|
2199
|
|
|
2200 if (bufp->external_to_internal_register == 0)
|
|
|
2201 {
|
|
|
2202 bufp->external_to_internal_register_size = INIT_REG_TRANSLATE_SIZE;
|
|
|
2203 RETALLOC (bufp->external_to_internal_register,
|
|
|
2204 bufp->external_to_internal_register_size,
|
|
|
2205 int);
|
|
|
2206 }
|
|
|
2207
|
|
|
2208 {
|
|
|
2209 int i;
|
|
|
2210
|
|
|
2211 bufp->external_to_internal_register[0] = 0;
|
|
|
2212 for (i = 1; i < bufp->external_to_internal_register_size; i++)
|
|
|
2213 bufp->external_to_internal_register[i] = (int) 0xDEADBEEF;
|
|
|
2214 }
|
|
428
|
2215
|
|
|
2216 #if !defined (emacs) && !defined (SYNTAX_TABLE)
|
|
|
2217 /* Initialize the syntax table. */
|
|
|
2218 init_syntax_once ();
|
|
|
2219 #endif
|
|
|
2220
|
|
|
2221 if (bufp->allocated == 0)
|
|
|
2222 {
|
|
|
2223 if (bufp->buffer)
|
|
|
2224 { /* If zero allocated, but buffer is non-null, try to realloc
|
|
|
2225 enough space. This loses if buffer's address is bogus, but
|
|
|
2226 that is the user's responsibility. */
|
|
|
2227 RETALLOC (bufp->buffer, INIT_BUF_SIZE, unsigned char);
|
|
|
2228 }
|
|
|
2229 else
|
|
|
2230 { /* Caller did not allocate a buffer. Do it for them. */
|
|
|
2231 bufp->buffer = TALLOC (INIT_BUF_SIZE, unsigned char);
|
|
|
2232 }
|
|
|
2233 if (!bufp->buffer) FREE_STACK_RETURN (REG_ESPACE);
|
|
|
2234
|
|
|
2235 bufp->allocated = INIT_BUF_SIZE;
|
|
|
2236 }
|
|
|
2237
|
|
446
|
2238 begalt = buf_end = bufp->buffer;
|
|
428
|
2239
|
|
|
2240 /* Loop through the uncompiled pattern until we're at the end. */
|
|
|
2241 while (p != pend)
|
|
|
2242 {
|
|
|
2243 PATFETCH (c);
|
|
|
2244
|
|
|
2245 switch (c)
|
|
|
2246 {
|
|
|
2247 case '^':
|
|
|
2248 {
|
|
|
2249 if ( /* If at start of pattern, it's an operator. */
|
|
|
2250 p == pattern + 1
|
|
|
2251 /* If context independent, it's an operator. */
|
|
|
2252 || syntax & RE_CONTEXT_INDEP_ANCHORS
|
|
|
2253 /* Otherwise, depends on what's come before. */
|
|
|
2254 || at_begline_loc_p (pattern, p, syntax))
|
|
|
2255 BUF_PUSH (begline);
|
|
|
2256 else
|
|
|
2257 goto normal_char;
|
|
|
2258 }
|
|
|
2259 break;
|
|
|
2260
|
|
|
2261
|
|
|
2262 case '$':
|
|
|
2263 {
|
|
|
2264 if ( /* If at end of pattern, it's an operator. */
|
|
|
2265 p == pend
|
|
|
2266 /* If context independent, it's an operator. */
|
|
|
2267 || syntax & RE_CONTEXT_INDEP_ANCHORS
|
|
|
2268 /* Otherwise, depends on what's next. */
|
|
|
2269 || at_endline_loc_p (p, pend, syntax))
|
|
|
2270 BUF_PUSH (endline);
|
|
|
2271 else
|
|
|
2272 goto normal_char;
|
|
|
2273 }
|
|
|
2274 break;
|
|
|
2275
|
|
|
2276
|
|
|
2277 case '+':
|
|
|
2278 case '?':
|
|
|
2279 if ((syntax & RE_BK_PLUS_QM)
|
|
|
2280 || (syntax & RE_LIMITED_OPS))
|
|
|
2281 goto normal_char;
|
|
|
2282 handle_plus:
|
|
|
2283 case '*':
|
|
|
2284 /* If there is no previous pattern... */
|
|
|
2285 if (!laststart)
|
|
|
2286 {
|
|
|
2287 if (syntax & RE_CONTEXT_INVALID_OPS)
|
|
|
2288 FREE_STACK_RETURN (REG_BADRPT);
|
|
|
2289 else if (!(syntax & RE_CONTEXT_INDEP_OPS))
|
|
|
2290 goto normal_char;
|
|
|
2291 }
|
|
|
2292
|
|
|
2293 {
|
|
|
2294 /* true means zero/many matches are allowed. */
|
|
460
|
2295 re_bool zero_times_ok = c != '+';
|
|
|
2296 re_bool many_times_ok = c != '?';
|
|
428
|
2297
|
|
|
2298 /* true means match shortest string possible. */
|
|
460
|
2299 re_bool minimal = false;
|
|
428
|
2300
|
|
|
2301 /* If there is a sequence of repetition chars, collapse it
|
|
|
2302 down to just one (the right one). We can't combine
|
|
|
2303 interval operators with these because of, e.g., `a{2}*',
|
|
|
2304 which should only match an even number of `a's. */
|
|
|
2305 while (p != pend)
|
|
|
2306 {
|
|
|
2307 PATFETCH (c);
|
|
|
2308
|
|
|
2309 if (c == '*' || (!(syntax & RE_BK_PLUS_QM)
|
|
|
2310 && (c == '+' || c == '?')))
|
|
|
2311 ;
|
|
|
2312
|
|
|
2313 else if (syntax & RE_BK_PLUS_QM && c == '\\')
|
|
|
2314 {
|
|
|
2315 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
|
|
|
2316
|
|
|
2317 PATFETCH (c1);
|
|
|
2318 if (!(c1 == '+' || c1 == '?'))
|
|
|
2319 {
|
|
|
2320 PATUNFETCH;
|
|
|
2321 PATUNFETCH;
|
|
|
2322 break;
|
|
|
2323 }
|
|
|
2324
|
|
|
2325 c = c1;
|
|
|
2326 }
|
|
|
2327 else
|
|
|
2328 {
|
|
|
2329 PATUNFETCH;
|
|
|
2330 break;
|
|
|
2331 }
|
|
|
2332
|
|
|
2333 /* If we get here, we found another repeat character. */
|
|
|
2334 if (!(syntax & RE_NO_MINIMAL_MATCHING))
|
|
|
2335 {
|
|
440
|
2336 /* "*?" and "+?" and "??" are okay (and mean match
|
|
|
2337 minimally), but other sequences (such as "*??" and
|
|
|
2338 "+++") are rejected (reserved for future use). */
|
|
428
|
2339 if (minimal || c != '?')
|
|
|
2340 FREE_STACK_RETURN (REG_BADRPT);
|
|
|
2341 minimal = true;
|
|
|
2342 }
|
|
|
2343 else
|
|
|
2344 {
|
|
|
2345 zero_times_ok |= c != '+';
|
|
|
2346 many_times_ok |= c != '?';
|
|
|
2347 }
|
|
|
2348 }
|
|
|
2349
|
|
|
2350 /* Star, etc. applied to an empty pattern is equivalent
|
|
|
2351 to an empty pattern. */
|
|
|
2352 if (!laststart)
|
|
|
2353 break;
|
|
|
2354
|
|
|
2355 /* Now we know whether zero matches is allowed
|
|
|
2356 and whether two or more matches is allowed
|
|
|
2357 and whether we want minimal or maximal matching. */
|
|
|
2358 if (minimal)
|
|
|
2359 {
|
|
|
2360 if (!many_times_ok)
|
|
|
2361 {
|
|
|
2362 /* "a??" becomes:
|
|
|
2363 0: /on_failure_jump to 6
|
|
|
2364 3: /jump to 9
|
|
|
2365 6: /exactn/1/A
|
|
|
2366 9: end of pattern.
|
|
|
2367 */
|
|
|
2368 GET_BUFFER_SPACE (6);
|
|
446
|
2369 INSERT_JUMP (jump, laststart, buf_end + 3);
|
|
|
2370 buf_end += 3;
|
|
428
|
2371 INSERT_JUMP (on_failure_jump, laststart, laststart + 6);
|
|
446
|
2372 buf_end += 3;
|
|
428
|
2373 }
|
|
|
2374 else if (zero_times_ok)
|
|
|
2375 {
|
|
|
2376 /* "a*?" becomes:
|
|
|
2377 0: /jump to 6
|
|
|
2378 3: /exactn/1/A
|
|
|
2379 6: /on_failure_jump to 3
|
|
|
2380 9: end of pattern.
|
|
|
2381 */
|
|
|
2382 GET_BUFFER_SPACE (6);
|
|
446
|
2383 INSERT_JUMP (jump, laststart, buf_end + 3);
|
|
|
2384 buf_end += 3;
|
|
|
2385 STORE_JUMP (on_failure_jump, buf_end, laststart + 3);
|
|
|
2386 buf_end += 3;
|
|
428
|
2387 }
|
|
|
2388 else
|
|
|
2389 {
|
|
|
2390 /* "a+?" becomes:
|
|
|
2391 0: /exactn/1/A
|
|
|
2392 3: /on_failure_jump to 0
|
|
|
2393 6: end of pattern.
|
|
|
2394 */
|
|
|
2395 GET_BUFFER_SPACE (3);
|
|
446
|
2396 STORE_JUMP (on_failure_jump, buf_end, laststart);
|
|
|
2397 buf_end += 3;
|
|
428
|
2398 }
|
|
|
2399 }
|
|
|
2400 else
|
|
|
2401 {
|
|
|
2402 /* Are we optimizing this jump? */
|
|
460
|
2403 re_bool keep_string_p = false;
|
|
428
|
2404
|
|
|
2405 if (many_times_ok)
|
|
446
|
2406 { /* More than one repetition is allowed, so put in
|
|
|
2407 at the end a backward relative jump from
|
|
|
2408 `buf_end' to before the next jump we're going
|
|
|
2409 to put in below (which jumps from laststart to
|
|
|
2410 after this jump).
|
|
428
|
2411
|
|
|
2412 But if we are at the `*' in the exact sequence `.*\n',
|
|
|
2413 insert an unconditional jump backwards to the .,
|
|
|
2414 instead of the beginning of the loop. This way we only
|
|
|
2415 push a failure point once, instead of every time
|
|
|
2416 through the loop. */
|
|
|
2417 assert (p - 1 > pattern);
|
|
|
2418
|
|
|
2419 /* Allocate the space for the jump. */
|
|
|
2420 GET_BUFFER_SPACE (3);
|
|
|
2421
|
|
|
2422 /* We know we are not at the first character of the
|
|
|
2423 pattern, because laststart was nonzero. And we've
|
|
|
2424 already incremented `p', by the way, to be the
|
|
|
2425 character after the `*'. Do we have to do something
|
|
|
2426 analogous here for null bytes, because of
|
|
|
2427 RE_DOT_NOT_NULL? */
|
|
446
|
2428 if (*(p - 2) == '.'
|
|
428
|
2429 && zero_times_ok
|
|
446
|
2430 && p < pend && *p == '\n'
|
|
428
|
2431 && !(syntax & RE_DOT_NEWLINE))
|
|
|
2432 { /* We have .*\n. */
|
|
446
|
2433 STORE_JUMP (jump, buf_end, laststart);
|
|
428
|
2434 keep_string_p = true;
|
|
|
2435 }
|
|
|
2436 else
|
|
|
2437 /* Anything else. */
|
|
446
|
2438 STORE_JUMP (maybe_pop_jump, buf_end, laststart - 3);
|
|
428
|
2439
|
|
|
2440 /* We've added more stuff to the buffer. */
|
|
446
|
2441 buf_end += 3;
|
|
428
|
2442 }
|
|
|
2443
|
|
446
|
2444 /* On failure, jump from laststart to buf_end + 3,
|
|
|
2445 which will be the end of the buffer after this jump
|
|
|
2446 is inserted. */
|
|
428
|
2447 GET_BUFFER_SPACE (3);
|
|
|
2448 INSERT_JUMP (keep_string_p ? on_failure_keep_string_jump
|
|
|
2449 : on_failure_jump,
|
|
446
|
2450 laststart, buf_end + 3);
|
|
|
2451 buf_end += 3;
|
|
428
|
2452
|
|
|
2453 if (!zero_times_ok)
|
|
|
2454 {
|
|
|
2455 /* At least one repetition is required, so insert a
|
|
|
2456 `dummy_failure_jump' before the initial
|
|
|
2457 `on_failure_jump' instruction of the loop. This
|
|
|
2458 effects a skip over that instruction the first time
|
|
|
2459 we hit that loop. */
|
|
|
2460 GET_BUFFER_SPACE (3);
|
|
|
2461 INSERT_JUMP (dummy_failure_jump, laststart, laststart + 6);
|
|
446
|
2462 buf_end += 3;
|
|
428
|
2463 }
|
|
|
2464 }
|
|
|
2465 pending_exact = 0;
|
|
|
2466 }
|
|
|
2467 break;
|
|
|
2468
|
|
|
2469
|
|
|
2470 case '.':
|
|
446
|
2471 laststart = buf_end;
|
|
428
|
2472 BUF_PUSH (anychar);
|
|
|
2473 break;
|
|
|
2474
|
|
|
2475
|
|
|
2476 case '[':
|
|
|
2477 {
|
|
|
2478 /* XEmacs change: this whole section */
|
|
460
|
2479 re_bool had_char_class = false;
|
|
428
|
2480 #ifdef MULE
|
|
460
|
2481 re_bool has_extended_chars = false;
|
|
428
|
2482 REGISTER Lisp_Object rtab = Qnil;
|
|
|
2483 #endif
|
|
|
2484
|
|
|
2485 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
|
|
|
2486
|
|
|
2487 /* Ensure that we have enough space to push a charset: the
|
|
|
2488 opcode, the length count, and the bitset; 34 bytes in all. */
|
|
|
2489 GET_BUFFER_SPACE (34);
|
|
|
2490
|
|
446
|
2491 laststart = buf_end;
|
|
428
|
2492
|
|
|
2493 /* We test `*p == '^' twice, instead of using an if
|
|
|
2494 statement, so we only need one BUF_PUSH. */
|
|
|
2495 BUF_PUSH (*p == '^' ? charset_not : charset);
|
|
|
2496 if (*p == '^')
|
|
|
2497 p++;
|
|
|
2498
|
|
|
2499 /* Remember the first position in the bracket expression. */
|
|
|
2500 p1 = p;
|
|
|
2501
|
|
|
2502 /* Push the number of bytes in the bitmap. */
|
|
|
2503 BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
|
|
|
2504
|
|
|
2505 /* Clear the whole map. */
|
|
446
|
2506 memset (buf_end, 0, (1 << BYTEWIDTH) / BYTEWIDTH);
|
|
428
|
2507
|
|
|
2508 /* charset_not matches newline according to a syntax bit. */
|
|
446
|
2509 if ((re_opcode_t) buf_end[-2] == charset_not
|
|
428
|
2510 && (syntax & RE_HAT_LISTS_NOT_NEWLINE))
|
|
|
2511 SET_LIST_BIT ('\n');
|
|
|
2512
|
|
|
2513 #ifdef MULE
|
|
|
2514 start_over_with_extended:
|
|
|
2515 if (has_extended_chars)
|
|
|
2516 {
|
|
|
2517 /* There are extended chars here, which means we need to start
|
|
|
2518 over and shift to unified range-table format. */
|
|
446
|
2519 if (buf_end[-2] == charset)
|
|
|
2520 buf_end[-2] = charset_mule;
|
|
428
|
2521 else
|
|
446
|
2522 buf_end[-2] = charset_mule_not;
|
|
|
2523 buf_end--;
|
|
428
|
2524 p = p1; /* go back to the beginning of the charset, after
|
|
|
2525 a possible ^. */
|
|
|
2526 rtab = Vthe_lisp_rangetab;
|
|
|
2527 Fclear_range_table (rtab);
|
|
|
2528
|
|
|
2529 /* charset_not matches newline according to a syntax bit. */
|
|
446
|
2530 if ((re_opcode_t) buf_end[-1] == charset_mule_not
|
|
428
|
2531 && (syntax & RE_HAT_LISTS_NOT_NEWLINE))
|
|
|
2532 SET_EITHER_BIT ('\n');
|
|
|
2533 }
|
|
|
2534 #endif /* MULE */
|
|
|
2535
|
|
|
2536 /* Read in characters and ranges, setting map bits. */
|
|
|
2537 for (;;)
|
|
|
2538 {
|
|
|
2539 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
|
|
|
2540
|
|
446
|
2541 PATFETCH (c);
|
|
428
|
2542
|
|
|
2543 #ifdef MULE
|
|
|
2544 if (c >= 0x80 && !has_extended_chars)
|
|
|
2545 {
|
|
|
2546 has_extended_chars = 1;
|
|
|
2547 /* Frumble-bumble, we've found some extended chars.
|
|
|
2548 Need to start over, process everything using
|
|
|
2549 the general extended-char mechanism, and need
|
|
|
2550 to use charset_mule and charset_mule_not instead
|
|
|
2551 of charset and charset_not. */
|
|
|
2552 goto start_over_with_extended;
|
|
|
2553 }
|
|
|
2554 #endif /* MULE */
|
|
|
2555 /* \ might escape characters inside [...] and [^...]. */
|
|
|
2556 if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\')
|
|
|
2557 {
|
|
|
2558 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
|
|
|
2559
|
|
446
|
2560 PATFETCH (c1);
|
|
428
|
2561 #ifdef MULE
|
|
|
2562 if (c1 >= 0x80 && !has_extended_chars)
|
|
|
2563 {
|
|
|
2564 has_extended_chars = 1;
|
|
|
2565 goto start_over_with_extended;
|
|
|
2566 }
|
|
|
2567 #endif /* MULE */
|
|
|
2568 SET_EITHER_BIT (c1);
|
|
|
2569 continue;
|
|
|
2570 }
|
|
|
2571
|
|
|
2572 /* Could be the end of the bracket expression. If it's
|
|
|
2573 not (i.e., when the bracket expression is `[]' so
|
|
|
2574 far), the ']' character bit gets set way below. */
|
|
|
2575 if (c == ']' && p != p1 + 1)
|
|
|
2576 break;
|
|
|
2577
|
|
|
2578 /* Look ahead to see if it's a range when the last thing
|
|
|
2579 was a character class. */
|
|
|
2580 if (had_char_class && c == '-' && *p != ']')
|
|
|
2581 FREE_STACK_RETURN (REG_ERANGE);
|
|
|
2582
|
|
|
2583 /* Look ahead to see if it's a range when the last thing
|
|
|
2584 was a character: if this is a hyphen not at the
|
|
|
2585 beginning or the end of a list, then it's the range
|
|
|
2586 operator. */
|
|
|
2587 if (c == '-'
|
|
|
2588 && !(p - 2 >= pattern && p[-2] == '[')
|
|
446
|
2589 && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^')
|
|
428
|
2590 && *p != ']')
|
|
|
2591 {
|
|
|
2592 reg_errcode_t ret;
|
|
|
2593
|
|
|
2594 #ifdef MULE
|
|
|
2595 if (* (unsigned char *) p >= 0x80 && !has_extended_chars)
|
|
|
2596 {
|
|
|
2597 has_extended_chars = 1;
|
|
|
2598 goto start_over_with_extended;
|
|
|
2599 }
|
|
|
2600 if (has_extended_chars)
|
|
|
2601 ret = compile_extended_range (&p, pend, translate,
|
|
|
2602 syntax, rtab);
|
|
|
2603 else
|
|
|
2604 #endif /* MULE */
|
|
446
|
2605 ret = compile_range (&p, pend, translate, syntax, buf_end);
|
|
428
|
2606 if (ret != REG_NOERROR) FREE_STACK_RETURN (ret);
|
|
|
2607 }
|
|
|
2608
|
|
|
2609 else if (p[0] == '-' && p[1] != ']')
|
|
|
2610 { /* This handles ranges made up of characters only. */
|
|
|
2611 reg_errcode_t ret;
|
|
|
2612
|
|
|
2613 /* Move past the `-'. */
|
|
|
2614 PATFETCH (c1);
|
|
|
2615
|
|
|
2616 #ifdef MULE
|
|
|
2617 if (* (unsigned char *) p >= 0x80 && !has_extended_chars)
|
|
|
2618 {
|
|
|
2619 has_extended_chars = 1;
|
|
|
2620 goto start_over_with_extended;
|
|
|
2621 }
|
|
|
2622 if (has_extended_chars)
|
|
|
2623 ret = compile_extended_range (&p, pend, translate,
|
|
|
2624 syntax, rtab);
|
|
|
2625 else
|
|
|
2626 #endif /* MULE */
|
|
446
|
2627 ret = compile_range (&p, pend, translate, syntax, buf_end);
|
|
428
|
2628 if (ret != REG_NOERROR) FREE_STACK_RETURN (ret);
|
|
|
2629 }
|
|
|
2630
|
|
|
2631 /* See if we're at the beginning of a possible character
|
|
|
2632 class. */
|
|
|
2633
|
|
|
2634 else if (syntax & RE_CHAR_CLASSES && c == '[' && *p == ':')
|
|
|
2635 { /* Leave room for the null. */
|
|
|
2636 char str[CHAR_CLASS_MAX_LENGTH + 1];
|
|
|
2637
|
|
|
2638 PATFETCH (c);
|
|
|
2639 c1 = 0;
|
|
|
2640
|
|
|
2641 /* If pattern is `[[:'. */
|
|
|
2642 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
|
|
|
2643
|
|
|
2644 for (;;)
|
|
|
2645 {
|
|
446
|
2646 /* #### This code is unused.
|
|
|
2647 Correctness is not checked after TRT
|
|
|
2648 table change. */
|
|
428
|
2649 PATFETCH (c);
|
|
|
2650 if (c == ':' || c == ']' || p == pend
|
|
|
2651 || c1 == CHAR_CLASS_MAX_LENGTH)
|
|
|
2652 break;
|
|
442
|
2653 str[c1++] = (char) c;
|
|
428
|
2654 }
|
|
|
2655 str[c1] = '\0';
|
|
|
2656
|
|
446
|
2657 /* If isn't a word bracketed by `[:' and `:]':
|
|
428
|
2658 undo the ending character, the letters, and leave
|
|
|
2659 the leading `:' and `[' (but set bits for them). */
|
|
|
2660 if (c == ':' && *p == ']')
|
|
|
2661 {
|
|
|
2662 int ch;
|
|
460
|
2663 re_bool is_alnum = STREQ (str, "alnum");
|
|
|
2664 re_bool is_alpha = STREQ (str, "alpha");
|
|
|
2665 re_bool is_blank = STREQ (str, "blank");
|
|
|
2666 re_bool is_cntrl = STREQ (str, "cntrl");
|
|
|
2667 re_bool is_digit = STREQ (str, "digit");
|
|
|
2668 re_bool is_graph = STREQ (str, "graph");
|
|
|
2669 re_bool is_lower = STREQ (str, "lower");
|
|
|
2670 re_bool is_print = STREQ (str, "print");
|
|
|
2671 re_bool is_punct = STREQ (str, "punct");
|
|
|
2672 re_bool is_space = STREQ (str, "space");
|
|
|
2673 re_bool is_upper = STREQ (str, "upper");
|
|
|
2674 re_bool is_xdigit = STREQ (str, "xdigit");
|
|
428
|
2675
|
|
|
2676 if (!IS_CHAR_CLASS (str))
|
|
|
2677 FREE_STACK_RETURN (REG_ECTYPE);
|
|
|
2678
|
|
|
2679 /* Throw away the ] at the end of the character
|
|
|
2680 class. */
|
|
|
2681 PATFETCH (c);
|
|
|
2682
|
|
|
2683 if (p == pend) FREE_STACK_RETURN (REG_EBRACK);
|
|
|
2684
|
|
|
2685 for (ch = 0; ch < 1 << BYTEWIDTH; ch++)
|
|
|
2686 {
|
|
|
2687 /* This was split into 3 if's to
|
|
|
2688 avoid an arbitrary limit in some compiler. */
|
|
|
2689 if ( (is_alnum && ISALNUM (ch))
|
|
|
2690 || (is_alpha && ISALPHA (ch))
|
|
|
2691 || (is_blank && ISBLANK (ch))
|
|
|
2692 || (is_cntrl && ISCNTRL (ch)))
|
|
|
2693 SET_EITHER_BIT (ch);
|
|
|
2694 if ( (is_digit && ISDIGIT (ch))
|
|
|
2695 || (is_graph && ISGRAPH (ch))
|
|
|
2696 || (is_lower && ISLOWER (ch))
|
|
|
2697 || (is_print && ISPRINT (ch)))
|
|
|
2698 SET_EITHER_BIT (ch);
|
|
|
2699 if ( (is_punct && ISPUNCT (ch))
|
|
|
2700 || (is_space && ISSPACE (ch))
|
|
|
2701 || (is_upper && ISUPPER (ch))
|
|
|
2702 || (is_xdigit && ISXDIGIT (ch)))
|
|
|
2703 SET_EITHER_BIT (ch);
|
|
|
2704 }
|
|
|
2705 had_char_class = true;
|
|
|
2706 }
|
|
|
2707 else
|
|
|
2708 {
|
|
|
2709 c1++;
|
|
|
2710 while (c1--)
|
|
|
2711 PATUNFETCH;
|
|
|
2712 SET_EITHER_BIT ('[');
|
|
|
2713 SET_EITHER_BIT (':');
|
|
|
2714 had_char_class = false;
|
|
|
2715 }
|
|
|
2716 }
|
|
|
2717 else
|
|
|
2718 {
|
|
|
2719 had_char_class = false;
|
|
|
2720 SET_EITHER_BIT (c);
|
|
|
2721 }
|
|
|
2722 }
|
|
|
2723
|
|
|
2724 #ifdef MULE
|
|
|
2725 if (has_extended_chars)
|
|
|
2726 {
|
|
|
2727 /* We have a range table, not a bit vector. */
|
|
|
2728 int bytes_needed =
|
|
|
2729 unified_range_table_bytes_needed (rtab);
|
|
|
2730 GET_BUFFER_SPACE (bytes_needed);
|
|
446
|
2731 unified_range_table_copy_data (rtab, buf_end);
|
|
|
2732 buf_end += unified_range_table_bytes_used (buf_end);
|
|
428
|
2733 break;
|
|
|
2734 }
|
|
|
2735 #endif /* MULE */
|
|
|
2736 /* Discard any (non)matching list bytes that are all 0 at the
|
|
|
2737 end of the map. Decrease the map-length byte too. */
|
|
446
|
2738 while ((int) buf_end[-1] > 0 && buf_end[buf_end[-1] - 1] == 0)
|
|
|
2739 buf_end[-1]--;
|
|
|
2740 buf_end += buf_end[-1];
|
|
428
|
2741 }
|
|
|
2742 break;
|
|
|
2743
|
|
|
2744
|
|
|
2745 case '(':
|
|
|
2746 if (syntax & RE_NO_BK_PARENS)
|
|
|
2747 goto handle_open;
|
|
|
2748 else
|
|
|
2749 goto normal_char;
|
|
|
2750
|
|
|
2751
|
|
|
2752 case ')':
|
|
|
2753 if (syntax & RE_NO_BK_PARENS)
|
|
|
2754 goto handle_close;
|
|
|
2755 else
|
|
|
2756 goto normal_char;
|
|
|
2757
|
|
|
2758
|
|
|
2759 case '\n':
|
|
|
2760 if (syntax & RE_NEWLINE_ALT)
|
|
|
2761 goto handle_alt;
|
|
|
2762 else
|
|
|
2763 goto normal_char;
|
|
|
2764
|
|
|
2765
|
|
|
2766 case '|':
|
|
|
2767 if (syntax & RE_NO_BK_VBAR)
|
|
|
2768 goto handle_alt;
|
|
|
2769 else
|
|
|
2770 goto normal_char;
|
|
|
2771
|
|
|
2772
|
|
|
2773 case '{':
|
|
|
2774 if (syntax & RE_INTERVALS && syntax & RE_NO_BK_BRACES)
|
|
|
2775 goto handle_interval;
|
|
|
2776 else
|
|
|
2777 goto normal_char;
|
|
|
2778
|
|
|
2779
|
|
|
2780 case '\\':
|
|
|
2781 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE);
|
|
|
2782
|
|
|
2783 /* Do not translate the character after the \, so that we can
|
|
|
2784 distinguish, e.g., \B from \b, even if we normally would
|
|
|
2785 translate, e.g., B to b. */
|
|
|
2786 PATFETCH_RAW (c);
|
|
|
2787
|
|
|
2788 switch (c)
|
|
|
2789 {
|
|
|
2790 case '(':
|
|
|
2791 if (syntax & RE_NO_BK_PARENS)
|
|
|
2792 goto normal_backslash;
|
|
|
2793
|
|
|
2794 handle_open:
|
|
|
2795 {
|
|
|
2796 regnum_t r;
|
|
502
|
2797 int shy = 0;
|
|
428
|
2798
|
|
|
2799 if (!(syntax & RE_NO_SHY_GROUPS)
|
|
|
2800 && p != pend
|
|
446
|
2801 && *p == '?')
|
|
428
|
2802 {
|
|
|
2803 p++;
|
|
446
|
2804 PATFETCH (c);
|
|
428
|
2805 switch (c)
|
|
|
2806 {
|
|
|
2807 case ':': /* shy groups */
|
|
502
|
2808 shy = 1;
|
|
428
|
2809 break;
|
|
|
2810
|
|
|
2811 /* All others are reserved for future constructs. */
|
|
|
2812 default:
|
|
|
2813 FREE_STACK_RETURN (REG_BADPAT);
|
|
|
2814 }
|
|
|
2815 }
|
|
502
|
2816
|
|
|
2817 r = ++regnum;
|
|
|
2818 bufp->re_ngroups++;
|
|
|
2819 if (!shy)
|
|
|
2820 {
|
|
|
2821 bufp->re_nsub++;
|
|
|
2822 while (bufp->external_to_internal_register_size <=
|
|
|
2823 bufp->re_nsub)
|
|
|
2824 {
|
|
|
2825 int i;
|
|
|
2826 int old_size =
|
|
|
2827 bufp->external_to_internal_register_size;
|
|
|
2828 bufp->external_to_internal_register_size += 5;
|
|
|
2829 RETALLOC (bufp->external_to_internal_register,
|
|
|
2830 bufp->external_to_internal_register_size,
|
|
|
2831 int);
|
|
|
2832 /* debugging */
|
|
|
2833 for (i = old_size;
|
|
|
2834 i < bufp->external_to_internal_register_size; i++)
|
|
|
2835 bufp->external_to_internal_register[i] =
|
|
|
2836 (int) 0xDEADBEEF;
|
|
|
2837 }
|
|
|
2838
|
|
|
2839 bufp->external_to_internal_register[bufp->re_nsub] =
|
|
|
2840 bufp->re_ngroups;
|
|
|
2841 }
|
|
428
|
2842
|
|
|
2843 if (COMPILE_STACK_FULL)
|
|
|
2844 {
|
|
|
2845 RETALLOC (compile_stack.stack, compile_stack.size << 1,
|
|
|
2846 compile_stack_elt_t);
|
|
|
2847 if (compile_stack.stack == NULL) return REG_ESPACE;
|
|
|
2848
|
|
|
2849 compile_stack.size <<= 1;
|
|
|
2850 }
|
|
|
2851
|
|
|
2852 /* These are the values to restore when we hit end of this
|
|
|
2853 group. They are all relative offsets, so that if the
|
|
|
2854 whole pattern moves because of realloc, they will still
|
|
|
2855 be valid. */
|
|
|
2856 COMPILE_STACK_TOP.begalt_offset = begalt - bufp->buffer;
|
|
|
2857 COMPILE_STACK_TOP.fixup_alt_jump
|
|
|
2858 = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0;
|
|
446
|
2859 COMPILE_STACK_TOP.laststart_offset = buf_end - bufp->buffer;
|
|
428
|
2860 COMPILE_STACK_TOP.regnum = r;
|
|
|
2861
|
|
|
2862 /* We will eventually replace the 0 with the number of
|
|
|
2863 groups inner to this one. But do not push a
|
|
|
2864 start_memory for groups beyond the last one we can
|
|
502
|
2865 represent in the compiled pattern.
|
|
|
2866 #### bad bad bad. this will fail in lots of ways, if we
|
|
|
2867 ever have to backtrack for these groups.
|
|
|
2868 */
|
|
428
|
2869 if (r <= MAX_REGNUM)
|
|
|
2870 {
|
|
|
2871 COMPILE_STACK_TOP.inner_group_offset
|
|
446
|
2872 = buf_end - bufp->buffer + 2;
|
|
428
|
2873 BUF_PUSH_3 (start_memory, r, 0);
|
|
|
2874 }
|
|
|
2875
|
|
|
2876 compile_stack.avail++;
|
|
|
2877
|
|
|
2878 fixup_alt_jump = 0;
|
|
|
2879 laststart = 0;
|
|
446
|
2880 begalt = buf_end;
|
|
428
|
2881 /* If we've reached MAX_REGNUM groups, then this open
|
|
|
2882 won't actually generate any code, so we'll have to
|
|
|
2883 clear pending_exact explicitly. */
|
|
|
2884 pending_exact = 0;
|
|
|
2885 }
|
|
|
2886 break;
|
|
|
2887
|
|
|
2888
|
|
|
2889 case ')':
|
|
|
2890 if (syntax & RE_NO_BK_PARENS) goto normal_backslash;
|
|
|
2891
|
|
|
2892 if (COMPILE_STACK_EMPTY) {
|
|
|
2893 if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
|
|
|
2894 goto normal_backslash;
|
|
|
2895 else
|
|
|
2896 FREE_STACK_RETURN (REG_ERPAREN);
|
|
|
2897 }
|
|
|
2898
|
|
|
2899 handle_close:
|
|
|
2900 if (fixup_alt_jump)
|
|
|
2901 { /* Push a dummy failure point at the end of the
|
|
|
2902 alternative for a possible future
|
|
|
2903 `pop_failure_jump' to pop. See comments at
|
|
|
2904 `push_dummy_failure' in `re_match_2'. */
|
|
|
2905 BUF_PUSH (push_dummy_failure);
|
|
|
2906
|
|
|
2907 /* We allocated space for this jump when we assigned
|
|
|
2908 to `fixup_alt_jump', in the `handle_alt' case below. */
|
|
446
|
2909 STORE_JUMP (jump_past_alt, fixup_alt_jump, buf_end - 1);
|
|
428
|
2910 }
|
|
|
2911
|
|
|
2912 /* See similar code for backslashed left paren above. */
|
|
|
2913 if (COMPILE_STACK_EMPTY) {
|
|
|
2914 if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
|
|
|
2915 goto normal_char;
|
|
|
2916 else
|
|
|
2917 FREE_STACK_RETURN (REG_ERPAREN);
|
|
|
2918 }
|
|
|
2919
|
|
|
2920 /* Since we just checked for an empty stack above, this
|
|
|
2921 ``can't happen''. */
|
|
|
2922 assert (compile_stack.avail != 0);
|
|
|
2923 {
|
|
|
2924 /* We don't just want to restore into `regnum', because
|
|
|
2925 later groups should continue to be numbered higher,
|
|
|
2926 as in `(ab)c(de)' -- the second group is #2. */
|
|
|
2927 regnum_t this_group_regnum;
|
|
|
2928
|
|
|
2929 compile_stack.avail--;
|
|
|
2930 begalt = bufp->buffer + COMPILE_STACK_TOP.begalt_offset;
|
|
|
2931 fixup_alt_jump
|
|
|
2932 = COMPILE_STACK_TOP.fixup_alt_jump
|
|
|
2933 ? bufp->buffer + COMPILE_STACK_TOP.fixup_alt_jump - 1
|
|
|
2934 : 0;
|
|
|
2935 laststart = bufp->buffer + COMPILE_STACK_TOP.laststart_offset;
|
|
|
2936 this_group_regnum = COMPILE_STACK_TOP.regnum;
|
|
|
2937 /* If we've reached MAX_REGNUM groups, then this open
|
|
|
2938 won't actually generate any code, so we'll have to
|
|
|
2939 clear pending_exact explicitly. */
|
|
|
2940 pending_exact = 0;
|
|
|
2941
|
|
|
2942 /* We're at the end of the group, so now we know how many
|
|
|
2943 groups were inside this one. */
|
|
|
2944 if (this_group_regnum <= MAX_REGNUM)
|
|
|
2945 {
|
|
|
2946 unsigned char *inner_group_loc
|
|
|
2947 = bufp->buffer + COMPILE_STACK_TOP.inner_group_offset;
|
|
|
2948
|
|
|
2949 *inner_group_loc = regnum - this_group_regnum;
|
|
|
2950 BUF_PUSH_3 (stop_memory, this_group_regnum,
|
|
|
2951 regnum - this_group_regnum);
|
|
|
2952 }
|
|
|
2953 }
|
|
|
2954 break;
|
|
|
2955
|
|
|
2956
|
|
|
2957 case '|': /* `\|'. */
|
|
|
2958 if (syntax & RE_LIMITED_OPS || syntax & RE_NO_BK_VBAR)
|
|
|
2959 goto normal_backslash;
|
|
|
2960 handle_alt:
|
|
|
2961 if (syntax & RE_LIMITED_OPS)
|
|
|
2962 goto normal_char;
|
|
|
2963
|
|
|
2964 /* Insert before the previous alternative a jump which
|
|
|
2965 jumps to this alternative if the former fails. */
|
|
|
2966 GET_BUFFER_SPACE (3);
|
|
446
|
2967 INSERT_JUMP (on_failure_jump, begalt, buf_end + 6);
|
|
428
|
2968 pending_exact = 0;
|
|
446
|
2969 buf_end += 3;
|
|
428
|
2970
|
|
|
2971 /* The alternative before this one has a jump after it
|
|
|
2972 which gets executed if it gets matched. Adjust that
|
|
|
2973 jump so it will jump to this alternative's analogous
|
|
|
2974 jump (put in below, which in turn will jump to the next
|
|
|
2975 (if any) alternative's such jump, etc.). The last such
|
|
|
2976 jump jumps to the correct final destination. A picture:
|
|
|
2977 _____ _____
|
|
|
2978 | | | |
|
|
|
2979 | v | v
|
|
|
2980 a | b | c
|
|
|
2981
|
|
|
2982 If we are at `b', then fixup_alt_jump right now points to a
|
|
|
2983 three-byte space after `a'. We'll put in the jump, set
|
|
|
2984 fixup_alt_jump to right after `b', and leave behind three
|
|
|
2985 bytes which we'll fill in when we get to after `c'. */
|
|
|
2986
|
|
|
2987 if (fixup_alt_jump)
|
|
446
|
2988 STORE_JUMP (jump_past_alt, fixup_alt_jump, buf_end);
|
|
428
|
2989
|
|
|
2990 /* Mark and leave space for a jump after this alternative,
|
|
|
2991 to be filled in later either by next alternative or
|
|
|
2992 when know we're at the end of a series of alternatives. */
|
|
446
|
2993 fixup_alt_jump = buf_end;
|
|
428
|
2994 GET_BUFFER_SPACE (3);
|
|
446
|
2995 buf_end += 3;
|
|
428
|
2996
|
|
|
2997 laststart = 0;
|
|
446
|
2998 begalt = buf_end;
|
|
428
|
2999 break;
|
|
|
3000
|
|
|
3001
|
|
|
3002 case '{':
|
|
|
3003 /* If \{ is a literal. */
|
|
|
3004 if (!(syntax & RE_INTERVALS)
|
|
|
3005 /* If we're at `\{' and it's not the open-interval
|
|
|
3006 operator. */
|
|
|
3007 || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES))
|
|
|
3008 || (p - 2 == pattern && p == pend))
|
|
|
3009 goto normal_backslash;
|
|
|
3010
|
|
|
3011 handle_interval:
|
|
|
3012 {
|
|
|
3013 /* If got here, then the syntax allows intervals. */
|
|
|
3014
|
|
|
3015 /* At least (most) this many matches must be made. */
|
|
|
3016 int lower_bound = -1, upper_bound = -1;
|
|
|
3017
|
|
|
3018 beg_interval = p - 1;
|
|
|
3019
|
|
|
3020 if (p == pend)
|
|
|
3021 {
|
|
|
3022 if (syntax & RE_NO_BK_BRACES)
|
|
|
3023 goto unfetch_interval;
|
|
|
3024 else
|
|
|
3025 FREE_STACK_RETURN (REG_EBRACE);
|
|
|
3026 }
|
|
|
3027
|
|
|
3028 GET_UNSIGNED_NUMBER (lower_bound);
|
|
|
3029
|
|
|
3030 if (c == ',')
|
|
|
3031 {
|
|
|
3032 GET_UNSIGNED_NUMBER (upper_bound);
|
|
|
3033 if (upper_bound < 0) upper_bound = RE_DUP_MAX;
|
|
|
3034 }
|
|
|
3035 else
|
|
|
3036 /* Interval such as `{1}' => match exactly once. */
|
|
|
3037 upper_bound = lower_bound;
|
|
|
3038
|
|
|
3039 if (lower_bound < 0 || upper_bound > RE_DUP_MAX
|
|
|
3040 || lower_bound > upper_bound)
|
|
|
3041 {
|
|
|
3042 if (syntax & RE_NO_BK_BRACES)
|
|
|
3043 goto unfetch_interval;
|
|
|
3044 else
|
|
|
3045 FREE_STACK_RETURN (REG_BADBR);
|
|
|
3046 }
|
|
|
3047
|
|
|
3048 if (!(syntax & RE_NO_BK_BRACES))
|
|
|
3049 {
|
|
|
3050 if (c != '\\') FREE_STACK_RETURN (REG_EBRACE);
|
|
|
3051
|
|
|
3052 PATFETCH (c);
|
|
|
3053 }
|
|
|
3054
|
|
|
3055 if (c != '}')
|
|
|
3056 {
|
|
|
3057 if (syntax & RE_NO_BK_BRACES)
|
|
|
3058 goto unfetch_interval;
|
|
|
3059 else
|
|
|
3060 FREE_STACK_RETURN (REG_BADBR);
|
|
|
3061 }
|
|
|
3062
|
|
|
3063 /* We just parsed a valid interval. */
|
|
|
3064
|
|
|
3065 /* If it's invalid to have no preceding re. */
|
|
|
3066 if (!laststart)
|
|
|
3067 {
|
|
|
3068 if (syntax & RE_CONTEXT_INVALID_OPS)
|
|
|
3069 FREE_STACK_RETURN (REG_BADRPT);
|
|
|
3070 else if (syntax & RE_CONTEXT_INDEP_OPS)
|
|
446
|
3071 laststart = buf_end;
|
|
428
|
3072 else
|
|
|
3073 goto unfetch_interval;
|
|
|
3074 }
|
|
|
3075
|
|
|
3076 /* If the upper bound is zero, don't want to succeed at
|
|
|
3077 all; jump from `laststart' to `b + 3', which will be
|
|
|
3078 the end of the buffer after we insert the jump. */
|
|
|
3079 if (upper_bound == 0)
|
|
|
3080 {
|
|
|
3081 GET_BUFFER_SPACE (3);
|
|
446
|
3082 INSERT_JUMP (jump, laststart, buf_end + 3);
|
|
|
3083 buf_end += 3;
|
|
428
|
3084 }
|
|
|
3085
|
|
|
3086 /* Otherwise, we have a nontrivial interval. When
|
|
|
3087 we're all done, the pattern will look like:
|
|
|
3088 set_number_at <jump count> <upper bound>
|
|
|
3089 set_number_at <succeed_n count> <lower bound>
|
|
|
3090 succeed_n <after jump addr> <succeed_n count>
|
|
|
3091 <body of loop>
|
|
|
3092 jump_n <succeed_n addr> <jump count>
|
|
|
3093 (The upper bound and `jump_n' are omitted if
|
|
|
3094 `upper_bound' is 1, though.) */
|
|
|
3095 else
|
|
|
3096 { /* If the upper bound is > 1, we need to insert
|
|
|
3097 more at the end of the loop. */
|
|
647
|
3098 int nbytes = 10 + (upper_bound > 1) * 10;
|
|
428
|
3099
|
|
|
3100 GET_BUFFER_SPACE (nbytes);
|
|
|
3101
|
|
|
3102 /* Initialize lower bound of the `succeed_n', even
|
|
|
3103 though it will be set during matching by its
|
|
|
3104 attendant `set_number_at' (inserted next),
|
|
|
3105 because `re_compile_fastmap' needs to know.
|
|
|
3106 Jump to the `jump_n' we might insert below. */
|
|
|
3107 INSERT_JUMP2 (succeed_n, laststart,
|
|
446
|
3108 buf_end + 5 + (upper_bound > 1) * 5,
|
|
428
|
3109 lower_bound);
|
|
446
|
3110 buf_end += 5;
|
|
428
|
3111
|
|
|
3112 /* Code to initialize the lower bound. Insert
|
|
|
3113 before the `succeed_n'. The `5' is the last two
|
|
|
3114 bytes of this `set_number_at', plus 3 bytes of
|
|
|
3115 the following `succeed_n'. */
|
|
446
|
3116 insert_op2 (set_number_at, laststart, 5, lower_bound, buf_end);
|
|
|
3117 buf_end += 5;
|
|
428
|
3118
|
|
|
3119 if (upper_bound > 1)
|
|
|
3120 { /* More than one repetition is allowed, so
|
|
|
3121 append a backward jump to the `succeed_n'
|
|
|
3122 that starts this interval.
|
|
|
3123
|
|
|
3124 When we've reached this during matching,
|
|
|
3125 we'll have matched the interval once, so
|
|
|
3126 jump back only `upper_bound - 1' times. */
|
|
446
|
3127 STORE_JUMP2 (jump_n, buf_end, laststart + 5,
|
|
428
|
3128 upper_bound - 1);
|
|
446
|
3129 buf_end += 5;
|
|
428
|
3130
|
|
|
3131 /* The location we want to set is the second
|
|
|
3132 parameter of the `jump_n'; that is `b-2' as
|
|
|
3133 an absolute address. `laststart' will be
|
|
|
3134 the `set_number_at' we're about to insert;
|
|
|
3135 `laststart+3' the number to set, the source
|
|
|
3136 for the relative address. But we are
|
|
|
3137 inserting into the middle of the pattern --
|
|
|
3138 so everything is getting moved up by 5.
|
|
|
3139 Conclusion: (b - 2) - (laststart + 3) + 5,
|
|
|
3140 i.e., b - laststart.
|
|
|
3141
|
|
|
3142 We insert this at the beginning of the loop
|
|
|
3143 so that if we fail during matching, we'll
|
|
|
3144 reinitialize the bounds. */
|
|
446
|
3145 insert_op2 (set_number_at, laststart,
|
|
|
3146 buf_end - laststart,
|
|
|
3147 upper_bound - 1, buf_end);
|
|
|
3148 buf_end += 5;
|
|
428
|
3149 }
|
|
|
3150 }
|
|
|
3151 pending_exact = 0;
|
|
|
3152 beg_interval = NULL;
|
|
|
3153 }
|
|
|
3154 break;
|
|
|
3155
|
|
|
3156 unfetch_interval:
|
|
|
3157 /* If an invalid interval, match the characters as literals. */
|
|
|
3158 assert (beg_interval);
|
|
|
3159 p = beg_interval;
|
|
|
3160 beg_interval = NULL;
|
|
|
3161
|
|
|
3162 /* normal_char and normal_backslash need `c'. */
|
|
|
3163 PATFETCH (c);
|
|
|
3164
|
|
|
3165 if (!(syntax & RE_NO_BK_BRACES))
|
|
|
3166 {
|
|
|
3167 if (p > pattern && p[-1] == '\\')
|
|
|
3168 goto normal_backslash;
|
|
|
3169 }
|
|
|
3170 goto normal_char;
|
|
|
3171
|
|
|
3172 #ifdef emacs
|
|
|
3173 /* There is no way to specify the before_dot and after_dot
|
|
|
3174 operators. rms says this is ok. --karl */
|
|
|
3175 case '=':
|
|
|
3176 BUF_PUSH (at_dot);
|
|
|
3177 break;
|
|
|
3178
|
|
|
3179 case 's':
|
|
446
|
3180 laststart = buf_end;
|
|
428
|
3181 PATFETCH (c);
|
|
|
3182 /* XEmacs addition */
|
|
|
3183 if (c >= 0x80 || syntax_spec_code[c] == 0377)
|
|
|
3184 FREE_STACK_RETURN (REG_ESYNTAX);
|
|
|
3185 BUF_PUSH_2 (syntaxspec, syntax_spec_code[c]);
|
|
|
3186 break;
|
|
|
3187
|
|
|
3188 case 'S':
|
|
446
|
3189 laststart = buf_end;
|
|
428
|
3190 PATFETCH (c);
|
|
|
3191 /* XEmacs addition */
|
|
|
3192 if (c >= 0x80 || syntax_spec_code[c] == 0377)
|
|
|
3193 FREE_STACK_RETURN (REG_ESYNTAX);
|
|
|
3194 BUF_PUSH_2 (notsyntaxspec, syntax_spec_code[c]);
|
|
|
3195 break;
|
|
|
3196
|
|
|
3197 #ifdef MULE
|
|
|
3198 /* 97.2.17 jhod merged in to XEmacs from mule-2.3 */
|
|
|
3199 case 'c':
|
|
446
|
3200 laststart = buf_end;
|
|
428
|
3201 PATFETCH_RAW (c);
|
|
|
3202 if (c < 32 || c > 127)
|
|
|
3203 FREE_STACK_RETURN (REG_ECATEGORY);
|
|
|
3204 BUF_PUSH_2 (categoryspec, c);
|
|
|
3205 break;
|
|
|
3206
|
|
|
3207 case 'C':
|
|
446
|
3208 laststart = buf_end;
|
|
428
|
3209 PATFETCH_RAW (c);
|
|
|
3210 if (c < 32 || c > 127)
|
|
|
3211 FREE_STACK_RETURN (REG_ECATEGORY);
|
|
|
3212 BUF_PUSH_2 (notcategoryspec, c);
|
|
|
3213 break;
|
|
|
3214 /* end of category patch */
|
|
|
3215 #endif /* MULE */
|
|
|
3216 #endif /* emacs */
|
|
|
3217
|
|
|
3218
|
|
|
3219 case 'w':
|
|
446
|
3220 laststart = buf_end;
|
|
428
|
3221 BUF_PUSH (wordchar);
|
|
|
3222 break;
|
|
|
3223
|
|
|
3224
|
|
|
3225 case 'W':
|
|
446
|
3226 laststart = buf_end;
|
|
428
|
3227 BUF_PUSH (notwordchar);
|
|
|
3228 break;
|
|
|
3229
|
|
|
3230
|
|
|
3231 case '<':
|
|
|
3232 BUF_PUSH (wordbeg);
|
|
|
3233 break;
|
|
|
3234
|
|
|
3235 case '>':
|
|
|
3236 BUF_PUSH (wordend);
|
|
|
3237 break;
|
|
|
3238
|
|
|
3239 case 'b':
|
|
|
3240 BUF_PUSH (wordbound);
|
|
|
3241 break;
|
|
|
3242
|
|
|
3243 case 'B':
|
|
|
3244 BUF_PUSH (notwordbound);
|
|
|
3245 break;
|
|
|
3246
|
|
|
3247 case '`':
|
|
|
3248 BUF_PUSH (begbuf);
|
|
|
3249 break;
|
|
|
3250
|
|
|
3251 case '\'':
|
|
|
3252 BUF_PUSH (endbuf);
|
|
|
3253 break;
|
|
|
3254
|
|
|
3255 case '1': case '2': case '3': case '4': case '5':
|
|
|
3256 case '6': case '7': case '8': case '9':
|
|
446
|
3257 {
|
|
502
|
3258 regnum_t reg, regint;
|
|
|
3259 int may_need_to_unfetch = 0;
|
|
446
|
3260 if (syntax & RE_NO_BK_REFS)
|
|
|
3261 goto normal_char;
|
|
|
3262
|
|
502
|
3263 /* This only goes up to 99. It could be extended to work
|
|
|
3264 up to 255 (the maximum number of registers that can be
|
|
|
3265 handled by the current regexp engine, because it stores
|
|
|
3266 its register numbers in the compiled pattern as one byte,
|
|
|
3267 ugh). Doing that's a bit trickier, because you might
|
|
|
3268 have the case where \25 a back-ref but \255 is not, ... */
|
|
446
|
3269 reg = c - '0';
|
|
502
|
3270 if (p < pend)
|
|
|
3271 {
|
|
|
3272 PATFETCH (c);
|
|
|
3273 if (c >= '0' && c <= '9')
|
|
|
3274 {
|
|
|
3275 regnum_t new_reg = reg * 10 + c - '0';
|
|
|
3276 if (new_reg <= bufp->re_nsub)
|
|
|
3277 {
|
|
|
3278 reg = new_reg;
|
|
|
3279 may_need_to_unfetch = 1;
|
|
|
3280 }
|
|
|
3281 else
|
|
|
3282 PATUNFETCH;
|
|
|
3283 }
|
|
523
|
3284 else
|
|
|
3285 PATUNFETCH;
|
|
502
|
3286 }
|
|
|
3287
|
|
|
3288 if (reg > bufp->re_nsub)
|
|
446
|
3289 FREE_STACK_RETURN (REG_ESUBREG);
|
|
|
3290
|
|
502
|
3291 regint = bufp->external_to_internal_register[reg];
|
|
446
|
3292 /* Can't back reference to a subexpression if inside of it. */
|
|
502
|
3293 if (group_in_compile_stack (compile_stack, regint))
|
|
|
3294 {
|
|
|
3295 if (may_need_to_unfetch)
|
|
|
3296 PATUNFETCH;
|
|
|
3297 goto normal_char;
|
|
|
3298 }
|
|
|
3299
|
|
|
3300 #ifdef emacs
|
|
|
3301 if (reg > 9 &&
|
|
|
3302 bufp->warned_about_incompatible_back_references == 0)
|
|
|
3303 {
|
|
|
3304 bufp->warned_about_incompatible_back_references = 1;
|
|
|
3305 warn_when_safe (intern ("regex"), Qinfo,
|
|
|
3306 "Back reference \\%d now has new "
|
|
|
3307 "semantics in %s", reg, pattern);
|
|
|
3308 }
|
|
|
3309 #endif
|
|
446
|
3310
|
|
|
3311 laststart = buf_end;
|
|
502
|
3312 BUF_PUSH_2 (duplicate, regint);
|
|
446
|
3313 }
|
|
428
|
3314 break;
|
|
|
3315
|
|
|
3316
|
|
|
3317 case '+':
|
|
|
3318 case '?':
|
|
|
3319 if (syntax & RE_BK_PLUS_QM)
|
|
|
3320 goto handle_plus;
|
|
|
3321 else
|
|
|
3322 goto normal_backslash;
|
|
|
3323
|
|
|
3324 default:
|
|
|
3325 normal_backslash:
|
|
|
3326 /* You might think it would be useful for \ to mean
|
|
|
3327 not to translate; but if we don't translate it,
|
|
|
3328 it will never match anything. */
|
|
826
|
3329 c = RE_TRANSLATE (c);
|
|
428
|
3330 goto normal_char;
|
|
|
3331 }
|
|
|
3332 break;
|
|
|
3333
|
|
|
3334
|
|
|
3335 default:
|
|
|
3336 /* Expects the character in `c'. */
|
|
|
3337 /* `p' points to the location after where `c' came from. */
|
|
|
3338 normal_char:
|
|
|
3339 {
|
|
|
3340 /* XEmacs: modifications here for Mule. */
|
|
|
3341 /* `q' points to the beginning of the next char. */
|
|
446
|
3342 re_char *q = p;
|
|
428
|
3343
|
|
|
3344 /* If no exactn currently being built. */
|
|
|
3345 if (!pending_exact
|
|
|
3346
|
|
|
3347 /* If last exactn not at current position. */
|
|
446
|
3348 || pending_exact + *pending_exact + 1 != buf_end
|
|
428
|
3349
|
|
|
3350 /* We have only one byte following the exactn for the count. */
|
|
|
3351 || ((unsigned int) (*pending_exact + (q - p)) >=
|
|
|
3352 ((unsigned int) (1 << BYTEWIDTH) - 1))
|
|
|
3353
|
|
|
3354 /* If followed by a repetition operator. */
|
|
|
3355 || *q == '*' || *q == '^'
|
|
|
3356 || ((syntax & RE_BK_PLUS_QM)
|
|
|
3357 ? *q == '\\' && (q[1] == '+' || q[1] == '?')
|
|
|
3358 : (*q == '+' || *q == '?'))
|
|
|
3359 || ((syntax & RE_INTERVALS)
|
|
|
3360 && ((syntax & RE_NO_BK_BRACES)
|
|
|
3361 ? *q == '{'
|
|
|
3362 : (q[0] == '\\' && q[1] == '{'))))
|
|
|
3363 {
|
|
|
3364 /* Start building a new exactn. */
|
|
|
3365
|
|
446
|
3366 laststart = buf_end;
|
|
428
|
3367
|
|
|
3368 BUF_PUSH_2 (exactn, 0);
|
|
446
|
3369 pending_exact = buf_end - 1;
|
|
428
|
3370 }
|
|
|
3371
|
|
446
|
3372 #ifndef MULE
|
|
428
|
3373 BUF_PUSH (c);
|
|
|
3374 (*pending_exact)++;
|
|
446
|
3375 #else
|
|
|
3376 {
|
|
|
3377 Bytecount bt_count;
|
|
867
|
3378 Ibyte tmp_buf[MAX_ICHAR_LEN];
|
|
446
|
3379 int i;
|
|
|
3380
|
|
867
|
3381 bt_count = set_itext_ichar (tmp_buf, c);
|
|
446
|
3382
|
|
|
3383 for (i = 0; i < bt_count; i++)
|
|
|
3384 {
|
|
|
3385 BUF_PUSH (tmp_buf[i]);
|
|
|
3386 (*pending_exact)++;
|
|
|
3387 }
|
|
|
3388 }
|
|
|
3389 #endif
|
|
428
|
3390 break;
|
|
|
3391 }
|
|
|
3392 } /* switch (c) */
|
|
|
3393 } /* while p != pend */
|
|
|
3394
|
|
|
3395
|
|
|
3396 /* Through the pattern now. */
|
|
|
3397
|
|
|
3398 if (fixup_alt_jump)
|
|
446
|
3399 STORE_JUMP (jump_past_alt, fixup_alt_jump, buf_end);
|
|
428
|
3400
|
|
|
3401 if (!COMPILE_STACK_EMPTY)
|
|
|
3402 FREE_STACK_RETURN (REG_EPAREN);
|
|
|
3403
|
|
|
3404 /* If we don't want backtracking, force success
|
|
|
3405 the first time we reach the end of the compiled pattern. */
|
|
|
3406 if (syntax & RE_NO_POSIX_BACKTRACKING)
|
|
|
3407 BUF_PUSH (succeed);
|
|
|
3408
|
|
1726
|
3409 xfree (compile_stack.stack, compile_stack_elt_t *);
|
|
428
|
3410
|
|
|
3411 /* We have succeeded; set the length of the buffer. */
|
|
446
|
3412 bufp->used = buf_end - bufp->buffer;
|
|
428
|
3413
|
|
|
3414 #ifdef DEBUG
|
|
|
3415 if (debug)
|
|
|
3416 {
|
|
|
3417 DEBUG_PRINT1 ("\nCompiled pattern: \n");
|
|
|
3418 print_compiled_pattern (bufp);
|
|
|
3419 }
|
|
|
3420 #endif /* DEBUG */
|
|
|
3421
|
|
|
3422 #ifndef MATCH_MAY_ALLOCATE
|
|
|
3423 /* Initialize the failure stack to the largest possible stack. This
|
|
|
3424 isn't necessary unless we're trying to avoid calling alloca in
|
|
|
3425 the search and match routines. */
|
|
|
3426 {
|
|
502
|
3427 int num_regs = bufp->re_ngroups + 1;
|
|
428
|
3428
|
|
|
3429 /* Since DOUBLE_FAIL_STACK refuses to double only if the current size
|
|
|
3430 is strictly greater than re_max_failures, the largest possible stack
|
|
|
3431 is 2 * re_max_failures failure points. */
|
|
|
3432 if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS))
|
|
|
3433 {
|
|
|
3434 fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS);
|
|
|
3435
|
|
|
3436 if (! fail_stack.stack)
|
|
|
3437 fail_stack.stack
|
|
|
3438 = (fail_stack_elt_t *) xmalloc (fail_stack.size
|
|
|
3439 * sizeof (fail_stack_elt_t));
|
|
|
3440 else
|
|
|
3441 fail_stack.stack
|
|
|
3442 = (fail_stack_elt_t *) xrealloc (fail_stack.stack,
|
|
|
3443 (fail_stack.size
|
|
|
3444 * sizeof (fail_stack_elt_t)));
|
|
|
3445 }
|
|
|
3446
|
|
|
3447 regex_grow_registers (num_regs);
|
|
|
3448 }
|
|
|
3449 #endif /* not MATCH_MAY_ALLOCATE */
|
|
|
3450
|
|
|
3451 return REG_NOERROR;
|
|
|
3452 } /* regex_compile */
|
|
|
3453
|
|
|
3454 /* Subroutines for `regex_compile'. */
|
|
|
3455
|
|
|
3456 /* Store OP at LOC followed by two-byte integer parameter ARG. */
|
|
|
3457
|
|
|
3458 static void
|
|
|
3459 store_op1 (re_opcode_t op, unsigned char *loc, int arg)
|
|
|
3460 {
|
|
|
3461 *loc = (unsigned char) op;
|
|
|
3462 STORE_NUMBER (loc + 1, arg);
|
|
|
3463 }
|
|
|
3464
|
|
|
3465
|
|
|
3466 /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */
|
|
|
3467
|
|
|
3468 static void
|
|
|
3469 store_op2 (re_opcode_t op, unsigned char *loc, int arg1, int arg2)
|
|
|
3470 {
|
|
|
3471 *loc = (unsigned char) op;
|
|
|
3472 STORE_NUMBER (loc + 1, arg1);
|
|
|
3473 STORE_NUMBER (loc + 3, arg2);
|
|
|
3474 }
|
|
|
3475
|
|
|
3476
|
|
|
3477 /* Copy the bytes from LOC to END to open up three bytes of space at LOC
|
|
|
3478 for OP followed by two-byte integer parameter ARG. */
|
|
|
3479
|
|
|
3480 static void
|
|
|
3481 insert_op1 (re_opcode_t op, unsigned char *loc, int arg, unsigned char *end)
|
|
|
3482 {
|
|
|
3483 REGISTER unsigned char *pfrom = end;
|
|
|
3484 REGISTER unsigned char *pto = end + 3;
|
|
|
3485
|
|
|
3486 while (pfrom != loc)
|
|
|
3487 *--pto = *--pfrom;
|
|
|
3488
|
|
|
3489 store_op1 (op, loc, arg);
|
|
|
3490 }
|
|
|
3491
|
|
|
3492
|
|
|
3493 /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */
|
|
|
3494
|
|
|
3495 static void
|
|
|
3496 insert_op2 (re_opcode_t op, unsigned char *loc, int arg1, int arg2,
|
|
|
3497 unsigned char *end)
|
|
|
3498 {
|
|
|
3499 REGISTER unsigned char *pfrom = end;
|
|
|
3500 REGISTER unsigned char *pto = end + 5;
|
|
|
3501
|
|
|
3502 while (pfrom != loc)
|
|
|
3503 *--pto = *--pfrom;
|
|
|
3504
|
|
|
3505 store_op2 (op, loc, arg1, arg2);
|
|
|
3506 }
|
|
|
3507
|
|
|
3508
|
|
|
3509 /* P points to just after a ^ in PATTERN. Return true if that ^ comes
|
|
|
3510 after an alternative or a begin-subexpression. We assume there is at
|
|
|
3511 least one character before the ^. */
|
|
|
3512
|
|
460
|
3513 static re_bool
|
|
446
|
3514 at_begline_loc_p (re_char *pattern, re_char *p, reg_syntax_t syntax)
|
|
428
|
3515 {
|
|
446
|
3516 re_char *prev = p - 2;
|
|
460
|
3517 re_bool prev_prev_backslash = prev > pattern && prev[-1] == '\\';
|
|
428
|
3518
|
|
|
3519 return
|
|
|
3520 /* After a subexpression? */
|
|
|
3521 (*prev == '(' && (syntax & RE_NO_BK_PARENS || prev_prev_backslash))
|
|
|
3522 /* After an alternative? */
|
|
|
3523 || (*prev == '|' && (syntax & RE_NO_BK_VBAR || prev_prev_backslash));
|
|
|
3524 }
|
|
|
3525
|
|
|
3526
|
|
|
3527 /* The dual of at_begline_loc_p. This one is for $. We assume there is
|
|
|
3528 at least one character after the $, i.e., `P < PEND'. */
|
|
|
3529
|
|
460
|
3530 static re_bool
|
|
446
|
3531 at_endline_loc_p (re_char *p, re_char *pend, int syntax)
|
|
428
|
3532 {
|
|
446
|
3533 re_char *next = p;
|
|
460
|
3534 re_bool next_backslash = *next == '\\';
|
|
446
|
3535 re_char *next_next = p + 1 < pend ? p + 1 : 0;
|
|
428
|
3536
|
|
|
3537 return
|
|
|
3538 /* Before a subexpression? */
|
|
|
3539 (syntax & RE_NO_BK_PARENS ? *next == ')'
|
|
|
3540 : next_backslash && next_next && *next_next == ')')
|
|
|
3541 /* Before an alternative? */
|
|
|
3542 || (syntax & RE_NO_BK_VBAR ? *next == '|'
|
|
|
3543 : next_backslash && next_next && *next_next == '|');
|
|
|
3544 }
|
|
|
3545
|
|
|
3546
|
|
|
3547 /* Returns true if REGNUM is in one of COMPILE_STACK's elements and
|
|
|
3548 false if it's not. */
|
|
|
3549
|
|
460
|
3550 static re_bool
|
|
428
|
3551 group_in_compile_stack (compile_stack_type compile_stack, regnum_t regnum)
|
|
|
3552 {
|
|
|
3553 int this_element;
|
|
|
3554
|
|
|
3555 for (this_element = compile_stack.avail - 1;
|
|
|
3556 this_element >= 0;
|
|
|
3557 this_element--)
|
|
|
3558 if (compile_stack.stack[this_element].regnum == regnum)
|
|
|
3559 return true;
|
|
|
3560
|
|
|
3561 return false;
|
|
|
3562 }
|
|
|
3563
|
|
|
3564
|
|
|
3565 /* Read the ending character of a range (in a bracket expression) from the
|
|
|
3566 uncompiled pattern *P_PTR (which ends at PEND). We assume the
|
|
|
3567 starting character is in `P[-2]'. (`P[-1]' is the character `-'.)
|
|
|
3568 Then we set the translation of all bits between the starting and
|
|
|
3569 ending characters (inclusive) in the compiled pattern B.
|
|
|
3570
|
|
|
3571 Return an error code.
|
|
|
3572
|
|
|
3573 We use these short variable names so we can use the same macros as
|
|
826
|
3574 `regex_compile' itself.
|
|
|
3575
|
|
|
3576 Under Mule, this is only called when both chars of the range are
|
|
|
3577 ASCII. */
|
|
428
|
3578
|
|
|
3579 static reg_errcode_t
|
|
446
|
3580 compile_range (re_char **p_ptr, re_char *pend, RE_TRANSLATE_TYPE translate,
|
|
|
3581 reg_syntax_t syntax, unsigned char *buf_end)
|
|
428
|
3582 {
|
|
867
|
3583 Ichar this_char;
|
|
428
|
3584
|
|
446
|
3585 re_char *p = *p_ptr;
|
|
428
|
3586 int range_start, range_end;
|
|
|
3587
|
|
|
3588 if (p == pend)
|
|
|
3589 return REG_ERANGE;
|
|
|
3590
|
|
|
3591 /* Even though the pattern is a signed `char *', we need to fetch
|
|
|
3592 with unsigned char *'s; if the high bit of the pattern character
|
|
|
3593 is set, the range endpoints will be negative if we fetch using a
|
|
|
3594 signed char *.
|
|
|
3595
|
|
|
3596 We also want to fetch the endpoints without translating them; the
|
|
|
3597 appropriate translation is done in the bit-setting loop below. */
|
|
442
|
3598 /* The SVR4 compiler on the 3B2 had trouble with unsigned const char *. */
|
|
|
3599 range_start = ((const unsigned char *) p)[-2];
|
|
|
3600 range_end = ((const unsigned char *) p)[0];
|
|
428
|
3601
|
|
|
3602 /* Have to increment the pointer into the pattern string, so the
|
|
|
3603 caller isn't still at the ending character. */
|
|
|
3604 (*p_ptr)++;
|
|
|
3605
|
|
|
3606 /* If the start is after the end, the range is empty. */
|
|
|
3607 if (range_start > range_end)
|
|
|
3608 return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR;
|
|
|
3609
|
|
|
3610 /* Here we see why `this_char' has to be larger than an `unsigned
|
|
|
3611 char' -- the range is inclusive, so if `range_end' == 0xff
|
|
|
3612 (assuming 8-bit characters), we would otherwise go into an infinite
|
|
|
3613 loop, since all characters <= 0xff. */
|
|
|
3614 for (this_char = range_start; this_char <= range_end; this_char++)
|
|
|
3615 {
|
|
826
|
3616 SET_LIST_BIT (RE_TRANSLATE (this_char));
|
|
428
|
3617 }
|
|
|
3618
|
|
|
3619 return REG_NOERROR;
|
|
|
3620 }
|
|
|
3621
|
|
|
3622 #ifdef MULE
|
|
|
3623
|
|
|
3624 static reg_errcode_t
|
|
446
|
3625 compile_extended_range (re_char **p_ptr, re_char *pend,
|
|
|
3626 RE_TRANSLATE_TYPE translate,
|
|
428
|
3627 reg_syntax_t syntax, Lisp_Object rtab)
|
|
|
3628 {
|
|
867
|
3629 Ichar this_char, range_start, range_end;
|
|
|
3630 const Ibyte *p;
|
|
428
|
3631
|
|
|
3632 if (*p_ptr == pend)
|
|
|
3633 return REG_ERANGE;
|
|
|
3634
|
|
867
|
3635 p = (const Ibyte *) *p_ptr;
|
|
|
3636 range_end = itext_ichar (p);
|
|
428
|
3637 p--; /* back to '-' */
|
|
867
|
3638 DEC_IBYTEPTR (p); /* back to start of range */
|
|
428
|
3639 /* We also want to fetch the endpoints without translating them; the
|
|
|
3640 appropriate translation is done in the bit-setting loop below. */
|
|
867
|
3641 range_start = itext_ichar (p);
|
|
|
3642 INC_IBYTEPTR (*p_ptr);
|
|
428
|
3643
|
|
|
3644 /* If the start is after the end, the range is empty. */
|
|
|
3645 if (range_start > range_end)
|
|
|
3646 return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR;
|
|
|
3647
|
|
|
3648 /* Can't have ranges spanning different charsets, except maybe for
|
|
|
3649 ranges entirely within the first 256 chars. */
|
|
|
3650
|
|
|
3651 if ((range_start >= 0x100 || range_end >= 0x100)
|
|
867
|
3652 && ichar_leading_byte (range_start) !=
|
|
|
3653 ichar_leading_byte (range_end))
|
|
428
|
3654 return REG_ERANGESPAN;
|
|
|
3655
|
|
826
|
3656 /* #### This might be way inefficient if the range encompasses 10,000
|
|
|
3657 chars or something. To be efficient, you'd have to do something like
|
|
|
3658 this:
|
|
428
|
3659
|
|
|
3660 range_table a;
|
|
|
3661 range_table b;
|
|
|
3662 map over translation table in [range_start, range_end] of
|
|
|
3663 (put the mapped range in a;
|
|
|
3664 put the translation in b)
|
|
|
3665 invert the range in a and truncate to [range_start, range_end]
|
|
|
3666 compute the union of a, b
|
|
|
3667 union the result into rtab
|
|
|
3668 */
|
|
826
|
3669 for (this_char = range_start; this_char <= range_end; this_char++)
|
|
428
|
3670 {
|
|
826
|
3671 SET_RANGETAB_BIT (RE_TRANSLATE (this_char));
|
|
428
|
3672 }
|
|
|
3673
|
|
|
3674 if (this_char <= range_end)
|
|
|
3675 put_range_table (rtab, this_char, range_end, Qt);
|
|
|
3676
|
|
|
3677 return REG_NOERROR;
|
|
|
3678 }
|
|
|
3679
|
|
|
3680 #endif /* MULE */
|
|
|
3681
|
|
|
3682 /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
|
|
|
3683 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
|
|
|
3684 characters can start a string that matches the pattern. This fastmap
|
|
|
3685 is used by re_search to skip quickly over impossible starting points.
|
|
|
3686
|
|
|
3687 The caller must supply the address of a (1 << BYTEWIDTH)-byte data
|
|
|
3688 area as BUFP->fastmap.
|
|
|
3689
|
|
|
3690 We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
|
|
|
3691 the pattern buffer.
|
|
|
3692
|
|
|
3693 Returns 0 if we succeed, -2 if an internal error. */
|
|
|
3694
|
|
|
3695 int
|
|
826
|
3696 re_compile_fastmap (struct re_pattern_buffer *bufp
|
|
|
3697 RE_LISP_SHORT_CONTEXT_ARGS_DECL)
|
|
428
|
3698 {
|
|
|
3699 int j, k;
|
|
|
3700 #ifdef MATCH_MAY_ALLOCATE
|
|
|
3701 fail_stack_type fail_stack;
|
|
|
3702 #endif
|
|
456
|
3703 DECLARE_DESTINATION;
|
|
428
|
3704 /* We don't push any register information onto the failure stack. */
|
|
|
3705
|
|
826
|
3706 /* &&#### this should be changed for 8-bit-fixed, for efficiency. see
|
|
|
3707 comment marked with &&#### in re_search_2. */
|
|
|
3708
|
|
428
|
3709 REGISTER char *fastmap = bufp->fastmap;
|
|
|
3710 unsigned char *pattern = bufp->buffer;
|
|
647
|
3711 long size = bufp->used;
|
|
428
|
3712 unsigned char *p = pattern;
|
|
|
3713 REGISTER unsigned char *pend = pattern + size;
|
|
|
3714
|
|
771
|
3715 #ifdef REGEX_REL_ALLOC
|
|
428
|
3716 /* This holds the pointer to the failure stack, when
|
|
|
3717 it is allocated relocatably. */
|
|
|
3718 fail_stack_elt_t *failure_stack_ptr;
|
|
|
3719 #endif
|
|
|
3720
|
|
|
3721 /* Assume that each path through the pattern can be null until
|
|
|
3722 proven otherwise. We set this false at the bottom of switch
|
|
|
3723 statement, to which we get only if a particular path doesn't
|
|
|
3724 match the empty string. */
|
|
460
|
3725 re_bool path_can_be_null = true;
|
|
428
|
3726
|
|
|
3727 /* We aren't doing a `succeed_n' to begin with. */
|
|
460
|
3728 re_bool succeed_n_p = false;
|
|
428
|
3729
|
|
1333
|
3730 #ifdef ERROR_CHECK_MALLOC
|
|
|
3731 /* The pattern comes from string data, not buffer data. We don't access
|
|
|
3732 any buffer data, so we don't have to worry about malloc() (but the
|
|
|
3733 disallowed flag may have been set by a caller). */
|
|
|
3734 int depth = bind_regex_malloc_disallowed (0);
|
|
|
3735 #endif
|
|
|
3736
|
|
428
|
3737 assert (fastmap != NULL && p != NULL);
|
|
|
3738
|
|
|
3739 INIT_FAIL_STACK ();
|
|
|
3740 memset (fastmap, 0, 1 << BYTEWIDTH); /* Assume nothing's valid. */
|
|
|
3741 bufp->fastmap_accurate = 1; /* It will be when we're done. */
|
|
|
3742 bufp->can_be_null = 0;
|
|
|
3743
|
|
|
3744 while (1)
|
|
|
3745 {
|
|
|
3746 if (p == pend || *p == succeed)
|
|
|
3747 {
|
|
|
3748 /* We have reached the (effective) end of pattern. */
|
|
|
3749 if (!FAIL_STACK_EMPTY ())
|
|
|
3750 {
|
|
|
3751 bufp->can_be_null |= path_can_be_null;
|
|
|
3752
|
|
|
3753 /* Reset for next path. */
|
|
|
3754 path_can_be_null = true;
|
|
|
3755
|
|
446
|
3756 p = (unsigned char *) fail_stack.stack[--fail_stack.avail].pointer;
|
|
428
|
3757
|
|
|
3758 continue;
|
|
|
3759 }
|
|
|
3760 else
|
|
|
3761 break;
|
|
|
3762 }
|
|
|
3763
|
|
|
3764 /* We should never be about to go beyond the end of the pattern. */
|
|
|
3765 assert (p < pend);
|
|
|
3766
|
|
|
3767 switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++))
|
|
|
3768 {
|
|
|
3769
|
|
|
3770 /* I guess the idea here is to simply not bother with a fastmap
|
|
|
3771 if a backreference is used, since it's too hard to figure out
|
|
|
3772 the fastmap for the corresponding group. Setting
|
|
|
3773 `can_be_null' stops `re_search_2' from using the fastmap, so
|
|
|
3774 that is all we do. */
|
|
|
3775 case duplicate:
|
|
|
3776 bufp->can_be_null = 1;
|
|
|
3777 goto done;
|
|
|
3778
|
|
|
3779
|
|
|
3780 /* Following are the cases which match a character. These end
|
|
|
3781 with `break'. */
|
|
|
3782
|
|
|
3783 case exactn:
|
|
|
3784 fastmap[p[1]] = 1;
|
|
|
3785 break;
|
|
|
3786
|
|
|
3787
|
|
|
3788 case charset:
|
|
|
3789 /* XEmacs: Under Mule, these bit vectors will
|
|
|
3790 only contain values for characters below 0x80. */
|
|
|
3791 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
|
|
|
3792 if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))
|
|
|
3793 fastmap[j] = 1;
|
|
|
3794 break;
|
|
|
3795
|
|
|
3796
|
|
|
3797 case charset_not:
|
|
|
3798 /* Chars beyond end of map must be allowed. */
|
|
|
3799 #ifdef MULE
|
|
|
3800 for (j = *p * BYTEWIDTH; j < 0x80; j++)
|
|
|
3801 fastmap[j] = 1;
|
|
|
3802 /* And all extended characters must be allowed, too. */
|
|
|
3803 for (j = 0x80; j < 0xA0; j++)
|
|
|
3804 fastmap[j] = 1;
|
|
446
|
3805 #else /* not MULE */
|
|
428
|
3806 for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
|
|
|
3807 fastmap[j] = 1;
|
|
446
|
3808 #endif /* MULE */
|
|
428
|
3809
|
|
|
3810 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
|
|
|
3811 if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))))
|
|
|
3812 fastmap[j] = 1;
|
|
|
3813 break;
|
|
|
3814
|
|
|
3815 #ifdef MULE
|
|
|
3816 case charset_mule:
|
|
|
3817 {
|
|
|
3818 int nentries;
|
|
|
3819 int i;
|
|
|
3820
|
|
|
3821 nentries = unified_range_table_nentries (p);
|
|
|
3822 for (i = 0; i < nentries; i++)
|
|
|
3823 {
|
|
|
3824 EMACS_INT first, last;
|
|
|
3825 Lisp_Object dummy_val;
|
|
|
3826 int jj;
|
|
867
|
3827 Ibyte strr[MAX_ICHAR_LEN];
|
|
428
|
3828
|
|
|
3829 unified_range_table_get_range (p, i, &first, &last,
|
|
|
3830 &dummy_val);
|
|
|
3831 for (jj = first; jj <= last && jj < 0x80; jj++)
|
|
|
3832 fastmap[jj] = 1;
|
|
|
3833 /* Ranges below 0x100 can span charsets, but there
|
|
|
3834 are only two (Control-1 and Latin-1), and
|
|
|
3835 either first or last has to be in them. */
|
|
867
|
3836 set_itext_ichar (strr, first);
|
|
428
|
3837 fastmap[*strr] = 1;
|
|
|
3838 if (last < 0x100)
|
|
|
3839 {
|
|
867
|
3840 set_itext_ichar (strr, last);
|
|
428
|
3841 fastmap[*strr] = 1;
|
|
|
3842 }
|
|
|
3843 }
|
|
|
3844 }
|
|
|
3845 break;
|
|
|
3846
|
|
|
3847 case charset_mule_not:
|
|
|
3848 {
|
|
|
3849 int nentries;
|
|
|
3850 int i;
|
|
|
3851
|
|
|
3852 nentries = unified_range_table_nentries (p);
|
|
|
3853 for (i = 0; i < nentries; i++)
|
|
|
3854 {
|
|
|
3855 EMACS_INT first, last;
|
|
|
3856 Lisp_Object dummy_val;
|
|
|
3857 int jj;
|
|
|
3858 int smallest_prev = 0;
|
|
|
3859
|
|
|
3860 unified_range_table_get_range (p, i, &first, &last,
|
|
|
3861 &dummy_val);
|
|
|
3862 for (jj = smallest_prev; jj < first && jj < 0x80; jj++)
|
|
|
3863 fastmap[jj] = 1;
|
|
|
3864 smallest_prev = last + 1;
|
|
|
3865 if (smallest_prev >= 0x80)
|
|
|
3866 break;
|
|
|
3867 }
|
|
|
3868 /* Calculating which leading bytes are actually allowed
|
|
|
3869 here is rather difficult, so we just punt and allow
|
|
|
3870 all of them. */
|
|
|
3871 for (i = 0x80; i < 0xA0; i++)
|
|
|
3872 fastmap[i] = 1;
|
|
|
3873 }
|
|
|
3874 break;
|
|
|
3875 #endif /* MULE */
|
|
|
3876
|
|
|
3877
|
|
|
3878 case anychar:
|
|
|
3879 {
|
|
|
3880 int fastmap_newline = fastmap['\n'];
|
|
|
3881
|
|
|
3882 /* `.' matches anything ... */
|
|
|
3883 #ifdef MULE
|
|
|
3884 /* "anything" only includes bytes that can be the
|
|
|
3885 first byte of a character. */
|
|
|
3886 for (j = 0; j < 0xA0; j++)
|
|
|
3887 fastmap[j] = 1;
|
|
|
3888 #else
|
|
|
3889 for (j = 0; j < (1 << BYTEWIDTH); j++)
|
|
|
3890 fastmap[j] = 1;
|
|
|
3891 #endif
|
|
|
3892
|
|
|
3893 /* ... except perhaps newline. */
|
|
|
3894 if (!(bufp->syntax & RE_DOT_NEWLINE))
|
|
|
3895 fastmap['\n'] = fastmap_newline;
|
|
|
3896
|
|
|
3897 /* Return if we have already set `can_be_null'; if we have,
|
|
|
3898 then the fastmap is irrelevant. Something's wrong here. */
|
|
|
3899 else if (bufp->can_be_null)
|
|
|
3900 goto done;
|
|
|
3901
|
|
|
3902 /* Otherwise, have to check alternative paths. */
|
|
|
3903 break;
|
|
|
3904 }
|
|
|
3905
|
|
826
|
3906 #ifndef emacs
|
|
|
3907 case wordchar:
|
|
|
3908 for (j = 0; j < (1 << BYTEWIDTH); j++)
|
|
|
3909 if (SYNTAX (ignored, j) == Sword)
|
|
|
3910 fastmap[j] = 1;
|
|
|
3911 break;
|
|
|
3912
|
|
|
3913 case notwordchar:
|
|
|
3914 for (j = 0; j < (1 << BYTEWIDTH); j++)
|
|
|
3915 if (SYNTAX (ignored, j) != Sword)
|
|
|
3916 fastmap[j] = 1;
|
|
|
3917 break;
|
|
|
3918 #else /* emacs */
|
|
|
3919 case wordchar:
|
|
|
3920 case notwordchar:
|
|
460
|
3921 case wordbound:
|
|
|
3922 case notwordbound:
|
|
|
3923 case wordbeg:
|
|
|
3924 case wordend:
|
|
|
3925 case notsyntaxspec:
|
|
|
3926 case syntaxspec:
|
|
|
3927 /* This match depends on text properties. These end with
|
|
|
3928 aborting optimizations. */
|
|
|
3929 bufp->can_be_null = 1;
|
|
|
3930 goto done;
|
|
826
|
3931 #if 0 /* all of the following code is unused now that the `syntax-table'
|
|
|
3932 property exists -- it's trickier to do this than just look in
|
|
|
3933 the buffer. &&#### but we could just use the syntax-cache stuff
|
|
|
3934 instead; why don't we? --ben */
|
|
|
3935 case wordchar:
|
|
|
3936 k = (int) Sword;
|
|
|
3937 goto matchsyntax;
|
|
|
3938
|
|
|
3939 case notwordchar:
|
|
|
3940 k = (int) Sword;
|
|
|
3941 goto matchnotsyntax;
|
|
|
3942
|
|
428
|
3943 case syntaxspec:
|
|
|
3944 k = *p++;
|
|
826
|
3945 matchsyntax:
|
|
428
|
3946 #ifdef MULE
|
|
|
3947 for (j = 0; j < 0x80; j++)
|
|
826
|
3948 if (SYNTAX
|
|
|
3949 (XCHAR_TABLE (BUFFER_MIRROR_SYNTAX_TABLE (lispbuf)), j) ==
|
|
428
|
3950 (enum syntaxcode) k)
|
|
|
3951 fastmap[j] = 1;
|
|
|
3952 for (j = 0x80; j < 0xA0; j++)
|
|
|
3953 {
|
|
826
|
3954 if (leading_byte_prefix_p ((unsigned char) j))
|
|
428
|
3955 /* too complicated to calculate this right */
|
|
|
3956 fastmap[j] = 1;
|
|
|
3957 else
|
|
|
3958 {
|
|
|
3959 int multi_p;
|
|
|
3960 Lisp_Object cset;
|
|
|
3961
|
|
826
|
3962 cset = charset_by_leading_byte (j);
|
|
428
|
3963 if (CHARSETP (cset))
|
|
|
3964 {
|
|
826
|
3965 if (charset_syntax (lispbuf, cset, &multi_p)
|
|
428
|
3966 == Sword || multi_p)
|
|
|
3967 fastmap[j] = 1;
|
|
|
3968 }
|
|
|
3969 }
|
|
|
3970 }
|
|
446
|
3971 #else /* not MULE */
|
|
428
|
3972 for (j = 0; j < (1 << BYTEWIDTH); j++)
|
|
826
|
3973 if (SYNTAX
|
|
|
3974 (XCHAR_TABLE (BUFFER_MIRROR_SYNTAX_TABLE (lispbuf)), j) ==
|
|
428
|
3975 (enum syntaxcode) k)
|
|
|
3976 fastmap[j] = 1;
|
|
446
|
3977 #endif /* MULE */
|
|
428
|
3978 break;
|
|
|
3979
|
|
|
3980
|
|
|
3981 case notsyntaxspec:
|
|
|
3982 k = *p++;
|
|
826
|
3983 matchnotsyntax:
|
|
428
|
3984 #ifdef MULE
|
|
|
3985 for (j = 0; j < 0x80; j++)
|
|
826
|
3986 if (SYNTAX
|
|
428
|
3987 (XCHAR_TABLE
|
|
826
|
3988 (BUFFER_MIRROR_SYNTAX_TABLE (lispbuf)), j) !=
|
|
428
|
3989 (enum syntaxcode) k)
|
|
|
3990 fastmap[j] = 1;
|
|
|
3991 for (j = 0x80; j < 0xA0; j++)
|
|
|
3992 {
|
|
826
|
3993 if (leading_byte_prefix_p ((unsigned char) j))
|
|
428
|
3994 /* too complicated to calculate this right */
|
|
|
3995 fastmap[j] = 1;
|
|
|
3996 else
|
|
|
3997 {
|
|
|
3998 int multi_p;
|
|
|
3999 Lisp_Object cset;
|
|
|
4000
|
|
826
|
4001 cset = charset_by_leading_byte (j);
|
|
428
|
4002 if (CHARSETP (cset))
|
|
|
4003 {
|
|
826
|
4004 if (charset_syntax (lispbuf, cset, &multi_p)
|
|
428
|
4005 != Sword || multi_p)
|
|
|
4006 fastmap[j] = 1;
|
|
|
4007 }
|
|
|
4008 }
|
|
|
4009 }
|
|
446
|
4010 #else /* not MULE */
|
|
428
|
4011 for (j = 0; j < (1 << BYTEWIDTH); j++)
|
|
826
|
4012 if (SYNTAX
|
|
428
|
4013 (XCHAR_TABLE
|
|
826
|
4014 (BUFFER_MIRROR_SYNTAX_TABLE (lispbuf)), j) !=
|
|
428
|
4015 (enum syntaxcode) k)
|
|
|
4016 fastmap[j] = 1;
|
|
446
|
4017 #endif /* MULE */
|
|
428
|
4018 break;
|
|
826
|
4019 #endif /* 0 */
|
|
428
|
4020
|
|
|
4021 #ifdef MULE
|
|
|
4022 /* 97/2/17 jhod category patch */
|
|
|
4023 case categoryspec:
|
|
|
4024 case notcategoryspec:
|
|
|
4025 bufp->can_be_null = 1;
|
|
1333
|
4026 UNBIND_REGEX_MALLOC_CHECK ();
|
|
428
|
4027 return 0;
|
|
|
4028 /* end if category patch */
|
|
|
4029 #endif /* MULE */
|
|
|
4030
|
|
|
4031 /* All cases after this match the empty string. These end with
|
|
|
4032 `continue'. */
|
|
|
4033 case before_dot:
|
|
|
4034 case at_dot:
|
|
|
4035 case after_dot:
|
|
|
4036 continue;
|
|
826
|
4037 #endif /* emacs */
|
|
428
|
4038
|
|
|
4039
|
|
|
4040 case no_op:
|
|
|
4041 case begline:
|
|
|
4042 case endline:
|
|
|
4043 case begbuf:
|
|
|
4044 case endbuf:
|
|
460
|
4045 #ifndef emacs
|
|
428
|
4046 case wordbound:
|
|
|
4047 case notwordbound:
|
|
|
4048 case wordbeg:
|
|
|
4049 case wordend:
|
|
460
|
4050 #endif
|
|
428
|
4051 case push_dummy_failure:
|
|
|
4052 continue;
|
|
|
4053
|
|
|
4054
|
|
|
4055 case jump_n:
|
|
|
4056 case pop_failure_jump:
|
|
|
4057 case maybe_pop_jump:
|
|
|
4058 case jump:
|
|
|
4059 case jump_past_alt:
|
|
|
4060 case dummy_failure_jump:
|
|
|
4061 EXTRACT_NUMBER_AND_INCR (j, p);
|
|
|
4062 p += j;
|
|
|
4063 if (j > 0)
|
|
|
4064 continue;
|
|
|
4065
|
|
|
4066 /* Jump backward implies we just went through the body of a
|
|
|
4067 loop and matched nothing. Opcode jumped to should be
|
|
|
4068 `on_failure_jump' or `succeed_n'. Just treat it like an
|
|
|
4069 ordinary jump. For a * loop, it has pushed its failure
|
|
|
4070 point already; if so, discard that as redundant. */
|
|
|
4071 if ((re_opcode_t) *p != on_failure_jump
|
|
|
4072 && (re_opcode_t) *p != succeed_n)
|
|
|
4073 continue;
|
|
|
4074
|
|
|
4075 p++;
|
|
|
4076 EXTRACT_NUMBER_AND_INCR (j, p);
|
|
|
4077 p += j;
|
|
|
4078
|
|
|
4079 /* If what's on the stack is where we are now, pop it. */
|
|
|
4080 if (!FAIL_STACK_EMPTY ()
|
|
|
4081 && fail_stack.stack[fail_stack.avail - 1].pointer == p)
|
|
|
4082 fail_stack.avail--;
|
|
|
4083
|
|
|
4084 continue;
|
|
|
4085
|
|
|
4086
|
|
|
4087 case on_failure_jump:
|
|
|
4088 case on_failure_keep_string_jump:
|
|
|
4089 handle_on_failure_jump:
|
|
|
4090 EXTRACT_NUMBER_AND_INCR (j, p);
|
|
|
4091
|
|
|
4092 /* For some patterns, e.g., `(a?)?', `p+j' here points to the
|
|
|
4093 end of the pattern. We don't want to push such a point,
|
|
|
4094 since when we restore it above, entering the switch will
|
|
|
4095 increment `p' past the end of the pattern. We don't need
|
|
|
4096 to push such a point since we obviously won't find any more
|
|
|
4097 fastmap entries beyond `pend'. Such a pattern can match
|
|
|
4098 the null string, though. */
|
|
|
4099 if (p + j < pend)
|
|
|
4100 {
|
|
|
4101 if (!PUSH_PATTERN_OP (p + j, fail_stack))
|
|
|
4102 {
|
|
|
4103 RESET_FAIL_STACK ();
|
|
1333
|
4104 UNBIND_REGEX_MALLOC_CHECK ();
|
|
428
|
4105 return -2;
|
|
|
4106 }
|
|
|
4107 }
|
|
|
4108 else
|
|
|
4109 bufp->can_be_null = 1;
|
|
|
4110
|
|
|
4111 if (succeed_n_p)
|
|
|
4112 {
|
|
|
4113 EXTRACT_NUMBER_AND_INCR (k, p); /* Skip the n. */
|
|
|
4114 succeed_n_p = false;
|
|
|
4115 }
|
|
|
4116
|
|
|
4117 continue;
|
|
|
4118
|
|
|
4119
|
|
|
4120 case succeed_n:
|
|
|
4121 /* Get to the number of times to succeed. */
|
|
|
4122 p += 2;
|
|
|
4123
|
|
|
4124 /* Increment p past the n for when k != 0. */
|
|
|
4125 EXTRACT_NUMBER_AND_INCR (k, p);
|
|
|
4126 if (k == 0)
|
|
|
4127 {
|
|
|
4128 p -= 4;
|
|
|
4129 succeed_n_p = true; /* Spaghetti code alert. */
|
|
|
4130 goto handle_on_failure_jump;
|
|
|
4131 }
|
|
|
4132 continue;
|
|
|
4133
|
|
|
4134
|
|
|
4135 case set_number_at:
|
|
|
4136 p += 4;
|
|
|
4137 continue;
|
|
|
4138
|
|
|
4139
|
|
|
4140 case start_memory:
|
|
|
4141 case stop_memory:
|
|
|
4142 p += 2;
|
|
|
4143 continue;
|
|
|
4144
|
|
|
4145
|
|
|
4146 default:
|
|
|
4147 abort (); /* We have listed all the cases. */
|
|
|
4148 } /* switch *p++ */
|
|
|
4149
|
|
|
4150 /* Getting here means we have found the possible starting
|
|
|
4151 characters for one path of the pattern -- and that the empty
|
|
|
4152 string does not match. We need not follow this path further.
|
|
|
4153 Instead, look at the next alternative (remembered on the
|
|
|
4154 stack), or quit if no more. The test at the top of the loop
|
|
|
4155 does these things. */
|
|
|
4156 path_can_be_null = false;
|
|
|
4157 p = pend;
|
|
|
4158 } /* while p */
|
|
|
4159
|
|
|
4160 /* Set `can_be_null' for the last path (also the first path, if the
|
|
|
4161 pattern is empty). */
|
|
|
4162 bufp->can_be_null |= path_can_be_null;
|
|
|
4163
|
|
|
4164 done:
|
|
|
4165 RESET_FAIL_STACK ();
|
|
1333
|
4166 UNBIND_REGEX_MALLOC_CHECK ();
|
|
428
|
4167 return 0;
|
|
|
4168 } /* re_compile_fastmap */
|
|
|
4169
|
|
|
4170 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
|
|
|
4171 ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use
|
|
|
4172 this memory for recording register information. STARTS and ENDS
|
|
|
4173 must be allocated using the malloc library routine, and must each
|
|
|
4174 be at least NUM_REGS * sizeof (regoff_t) bytes long.
|
|
|
4175
|
|
|
4176 If NUM_REGS == 0, then subsequent matches should allocate their own
|
|
|
4177 register data.
|
|
|
4178
|
|
|
4179 Unless this function is called, the first search or match using
|
|
|
4180 PATTERN_BUFFER will allocate its own register data, without
|
|
|
4181 freeing the old data. */
|
|
|
4182
|
|
|
4183 void
|
|
|
4184 re_set_registers (struct re_pattern_buffer *bufp, struct re_registers *regs,
|
|
647
|
4185 int num_regs, regoff_t *starts, regoff_t *ends)
|
|
428
|
4186 {
|
|
|
4187 if (num_regs)
|
|
|
4188 {
|
|
|
4189 bufp->regs_allocated = REGS_REALLOCATE;
|
|
|
4190 regs->num_regs = num_regs;
|
|
|
4191 regs->start = starts;
|
|
|
4192 regs->end = ends;
|
|
|
4193 }
|
|
|
4194 else
|
|
|
4195 {
|
|
|
4196 bufp->regs_allocated = REGS_UNALLOCATED;
|
|
|
4197 regs->num_regs = 0;
|
|
|
4198 regs->start = regs->end = (regoff_t *) 0;
|
|
|
4199 }
|
|
|
4200 }
|
|
|
4201
|
|
|
4202 /* Searching routines. */
|
|
|
4203
|
|
|
4204 /* Like re_search_2, below, but only one string is specified, and
|
|
|
4205 doesn't let you say where to stop matching. */
|
|
|
4206
|
|
|
4207 int
|
|
442
|
4208 re_search (struct re_pattern_buffer *bufp, const char *string, int size,
|
|
826
|
4209 int startpos, int range, struct re_registers *regs
|
|
|
4210 RE_LISP_CONTEXT_ARGS_DECL)
|
|
428
|
4211 {
|
|
|
4212 return re_search_2 (bufp, NULL, 0, string, size, startpos, range,
|
|
826
|
4213 regs, size RE_LISP_CONTEXT_ARGS);
|
|
428
|
4214 }
|
|
|
4215
|
|
|
4216 /* Using the compiled pattern in BUFP->buffer, first tries to match the
|
|
|
4217 virtual concatenation of STRING1 and STRING2, starting first at index
|
|
|
4218 STARTPOS, then at STARTPOS + 1, and so on.
|
|
|
4219
|
|
|
4220 STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
|
|
|
4221
|
|
|
4222 RANGE is how far to scan while trying to match. RANGE = 0 means try
|
|
|
4223 only at STARTPOS; in general, the last start tried is STARTPOS +
|
|
|
4224 RANGE.
|
|
|
4225
|
|
826
|
4226 All sizes and positions refer to bytes (not chars); under Mule, the code
|
|
|
4227 knows about the format of the text and will only check at positions
|
|
|
4228 where a character starts.
|
|
|
4229
|
|
428
|
4230 With MULE, RANGE is a byte position, not a char position. The last
|
|
|
4231 start tried is the character starting <= STARTPOS + RANGE.
|
|
|
4232
|
|
|
4233 In REGS, return the indices of the virtual concatenation of STRING1
|
|
|
4234 and STRING2 that matched the entire BUFP->buffer and its contained
|
|
|
4235 subexpressions.
|
|
|
4236
|
|
|
4237 Do not consider matching one past the index STOP in the virtual
|
|
|
4238 concatenation of STRING1 and STRING2.
|
|
|
4239
|
|
|
4240 We return either the position in the strings at which the match was
|
|
|
4241 found, -1 if no match, or -2 if error (such as failure
|
|
|
4242 stack overflow). */
|
|
|
4243
|
|
|
4244 int
|
|
446
|
4245 re_search_2 (struct re_pattern_buffer *bufp, const char *str1,
|
|
|
4246 int size1, const char *str2, int size2, int startpos,
|
|
826
|
4247 int range, struct re_registers *regs, int stop
|
|
|
4248 RE_LISP_CONTEXT_ARGS_DECL)
|
|
428
|
4249 {
|
|
|
4250 int val;
|
|
446
|
4251 re_char *string1 = (re_char *) str1;
|
|
|
4252 re_char *string2 = (re_char *) str2;
|
|
428
|
4253 REGISTER char *fastmap = bufp->fastmap;
|
|
446
|
4254 REGISTER RE_TRANSLATE_TYPE translate = bufp->translate;
|
|
428
|
4255 int total_size = size1 + size2;
|
|
|
4256 int endpos = startpos + range;
|
|
|
4257 #ifdef REGEX_BEGLINE_CHECK
|
|
|
4258 int anchored_at_begline = 0;
|
|
|
4259 #endif
|
|
446
|
4260 re_char *d;
|
|
826
|
4261 #ifdef emacs
|
|
|
4262 Internal_Format fmt = buffer_or_other_internal_format (lispobj);
|
|
1346
|
4263 #ifdef REL_ALLOC
|
|
|
4264 Ibyte *orig_buftext =
|
|
|
4265 BUFFERP (lispobj) ?
|
|
|
4266 BYTE_BUF_BYTE_ADDRESS (XBUFFER (lispobj),
|
|
|
4267 BYTE_BUF_BEGV (XBUFFER (lispobj))) :
|
|
|
4268 0;
|
|
|
4269 #endif
|
|
1333
|
4270 #ifdef ERROR_CHECK_MALLOC
|
|
|
4271 int depth;
|
|
|
4272 #endif
|
|
826
|
4273 #endif /* emacs */
|
|
|
4274 #if 1
|
|
|
4275 int forward_search_p;
|
|
|
4276 #endif
|
|
428
|
4277
|
|
|
4278 /* Check for out-of-range STARTPOS. */
|
|
|
4279 if (startpos < 0 || startpos > total_size)
|
|
|
4280 return -1;
|
|
|
4281
|
|
|
4282 /* Fix up RANGE if it might eventually take us outside
|
|
|
4283 the virtual concatenation of STRING1 and STRING2. */
|
|
|
4284 if (endpos < 0)
|
|
|
4285 range = 0 - startpos;
|
|
|
4286 else if (endpos > total_size)
|
|
|
4287 range = total_size - startpos;
|
|
|
4288
|
|
826
|
4289 #if 1
|
|
|
4290 forward_search_p = range > 0;
|
|
|
4291 #endif
|
|
|
4292
|
|
428
|
4293 /* If the search isn't to be a backwards one, don't waste time in a
|
|
|
4294 search for a pattern that must be anchored. */
|
|
|
4295 if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == begbuf && range > 0)
|
|
|
4296 {
|
|
|
4297 if (startpos > 0)
|
|
|
4298 return -1;
|
|
|
4299 else
|
|
|
4300 {
|
|
442
|
4301 d = ((const unsigned char *)
|
|
428
|
4302 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
867
|
4303 range = itext_ichar_len_fmt (d, fmt);
|
|
428
|
4304 }
|
|
|
4305 }
|
|
|
4306
|
|
460
|
4307 #ifdef emacs
|
|
|
4308 /* In a forward search for something that starts with \=.
|
|
|
4309 don't keep searching past point. */
|
|
|
4310 if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == at_dot && range > 0)
|
|
|
4311 {
|
|
826
|
4312 if (!BUFFERP (lispobj))
|
|
|
4313 return -1;
|
|
|
4314 range = (BUF_PT (XBUFFER (lispobj)) - BUF_BEGV (XBUFFER (lispobj))
|
|
|
4315 - startpos);
|
|
460
|
4316 if (range < 0)
|
|
|
4317 return -1;
|
|
|
4318 }
|
|
|
4319 #endif /* emacs */
|
|
|
4320
|
|
1333
|
4321 #ifdef ERROR_CHECK_MALLOC
|
|
|
4322 /* Do this after the above return()s. */
|
|
|
4323 depth = bind_regex_malloc_disallowed (1);
|
|
|
4324 #endif
|
|
|
4325
|
|
428
|
4326 /* Update the fastmap now if not correct already. */
|
|
1333
|
4327 BEGIN_REGEX_MALLOC_OK ();
|
|
428
|
4328 if (fastmap && !bufp->fastmap_accurate)
|
|
826
|
4329 if (re_compile_fastmap (bufp RE_LISP_SHORT_CONTEXT_ARGS) == -2)
|
|
1333
|
4330 {
|
|
|
4331 END_REGEX_MALLOC_OK ();
|
|
|
4332 UNBIND_REGEX_MALLOC_CHECK ();
|
|
|
4333 return -2;
|
|
|
4334 }
|
|
|
4335
|
|
|
4336 END_REGEX_MALLOC_OK ();
|
|
|
4337 RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
428
|
4338
|
|
|
4339 #ifdef REGEX_BEGLINE_CHECK
|
|
|
4340 {
|
|
647
|
4341 long i = 0;
|
|
428
|
4342
|
|
|
4343 while (i < bufp->used)
|
|
|
4344 {
|
|
|
4345 if (bufp->buffer[i] == start_memory ||
|
|
|
4346 bufp->buffer[i] == stop_memory)
|
|
|
4347 i += 2;
|
|
|
4348 else
|
|
|
4349 break;
|
|
|
4350 }
|
|
|
4351 anchored_at_begline = i < bufp->used && bufp->buffer[i] == begline;
|
|
|
4352 }
|
|
|
4353 #endif
|
|
|
4354
|
|
460
|
4355 #ifdef emacs
|
|
1333
|
4356 BEGIN_REGEX_MALLOC_OK ();
|
|
826
|
4357 scache = setup_syntax_cache (scache, lispobj, lispbuf,
|
|
|
4358 offset_to_charxpos (lispobj, startpos),
|
|
|
4359 1);
|
|
1333
|
4360 END_REGEX_MALLOC_OK ();
|
|
|
4361 RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
460
|
4362 #endif
|
|
|
4363
|
|
428
|
4364 /* Loop through the string, looking for a place to start matching. */
|
|
|
4365 for (;;)
|
|
|
4366 {
|
|
|
4367 #ifdef REGEX_BEGLINE_CHECK
|
|
826
|
4368 /* If the regex is anchored at the beginning of a line (i.e. with a
|
|
|
4369 ^), then we can speed things up by skipping to the next
|
|
|
4370 beginning-of-line. However, to determine "beginning of line" we
|
|
|
4371 need to look at the previous char, so can't do this check if at
|
|
|
4372 beginning of either string. (Well, we could if at the beginning of
|
|
|
4373 the second string, but it would require additional code, and this
|
|
|
4374 is just an optimization.) */
|
|
|
4375 if (anchored_at_begline && startpos > 0 && startpos != size1)
|
|
428
|
4376 {
|
|
826
|
4377 if (range > 0)
|
|
|
4378 {
|
|
|
4379 /* whose stupid idea was it anyway to make this
|
|
|
4380 function take two strings to match?? */
|
|
|
4381 int lim = 0;
|
|
|
4382 re_char *orig_d;
|
|
|
4383 re_char *stop_d;
|
|
|
4384
|
|
|
4385 /* Compute limit as below in fastmap code, so we are guaranteed
|
|
|
4386 to remain within a single string. */
|
|
|
4387 if (startpos < size1 && startpos + range >= size1)
|
|
|
4388 lim = range - (size1 - startpos);
|
|
|
4389
|
|
|
4390 d = ((const unsigned char *)
|
|
|
4391 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
|
4392 orig_d = d;
|
|
|
4393 stop_d = d + range - lim;
|
|
|
4394
|
|
|
4395 /* We want to find the next location (including the current
|
|
|
4396 one) where the previous char is a newline, so back up one
|
|
|
4397 and search forward for a newline. */
|
|
867
|
4398 DEC_IBYTEPTR_FMT (d, fmt); /* Ok, since startpos != size1. */
|
|
826
|
4399
|
|
|
4400 /* Written out as an if-else to avoid testing `translate'
|
|
|
4401 inside the loop. */
|
|
|
4402 if (TRANSLATE_P (translate))
|
|
|
4403 while (d < stop_d &&
|
|
867
|
4404 RE_TRANSLATE_1 (itext_ichar_fmt (d, fmt, lispobj))
|
|
826
|
4405 != '\n')
|
|
867
|
4406 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
4407 else
|
|
|
4408 while (d < stop_d &&
|
|
867
|
4409 itext_ichar_ascii_fmt (d, fmt, lispobj) != '\n')
|
|
|
4410 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
4411
|
|
|
4412 /* If we were stopped by a newline, skip forward over it.
|
|
|
4413 Otherwise we will get in an infloop when our start position
|
|
|
4414 was at begline. */
|
|
|
4415 if (d < stop_d)
|
|
867
|
4416 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
4417 range -= d - orig_d;
|
|
|
4418 startpos += d - orig_d;
|
|
|
4419 #if 1
|
|
|
4420 assert (!forward_search_p || range >= 0);
|
|
|
4421 #endif
|
|
|
4422 }
|
|
|
4423 else if (range < 0)
|
|
|
4424 {
|
|
|
4425 /* We're lazy, like in the fastmap code below */
|
|
867
|
4426 Ichar c;
|
|
826
|
4427
|
|
|
4428 d = ((const unsigned char *)
|
|
|
4429 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
867
|
4430 DEC_IBYTEPTR_FMT (d, fmt);
|
|
|
4431 c = itext_ichar_fmt (d, fmt, lispobj);
|
|
826
|
4432 c = RE_TRANSLATE (c);
|
|
|
4433 if (c != '\n')
|
|
|
4434 goto advance;
|
|
|
4435 }
|
|
428
|
4436 }
|
|
|
4437 #endif /* REGEX_BEGLINE_CHECK */
|
|
|
4438
|
|
|
4439 /* If a fastmap is supplied, skip quickly over characters that
|
|
|
4440 cannot be the start of a match. If the pattern can match the
|
|
|
4441 null string, however, we don't need to skip characters; we want
|
|
|
4442 the first null string. */
|
|
|
4443 if (fastmap && startpos < total_size && !bufp->can_be_null)
|
|
|
4444 {
|
|
826
|
4445 /* For the moment, fastmap always works as if buffer
|
|
|
4446 is in default format, so convert chars in the search strings
|
|
|
4447 into default format as we go along, if necessary.
|
|
|
4448
|
|
|
4449 &&#### fastmap needs rethinking for 8-bit-fixed so
|
|
|
4450 it's faster. We need it to reflect the raw
|
|
|
4451 8-bit-fixed values. That isn't so hard if we assume
|
|
|
4452 that the top 96 bytes represent a single 1-byte
|
|
|
4453 charset. For 16-bit/32-bit stuff it's probably not
|
|
|
4454 worth it to make the fastmap represent the raw, due to
|
|
|
4455 its nature -- we'd have to use the LSB for the
|
|
|
4456 fastmap, and that causes lots of problems with Mule
|
|
|
4457 chars, where it essentially wipes out the usefulness
|
|
|
4458 of the fastmap entirely. */
|
|
428
|
4459 if (range > 0) /* Searching forwards. */
|
|
|
4460 {
|
|
|
4461 int lim = 0;
|
|
|
4462 int irange = range;
|
|
|
4463
|
|
|
4464 if (startpos < size1 && startpos + range >= size1)
|
|
|
4465 lim = range - (size1 - startpos);
|
|
|
4466
|
|
442
|
4467 d = ((const unsigned char *)
|
|
428
|
4468 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
|
4469
|
|
|
4470 /* Written out as an if-else to avoid testing `translate'
|
|
|
4471 inside the loop. */
|
|
446
|
4472 if (TRANSLATE_P (translate))
|
|
826
|
4473 {
|
|
|
4474 while (range > lim)
|
|
|
4475 {
|
|
|
4476 re_char *old_d = d;
|
|
428
|
4477 #ifdef MULE
|
|
867
|
4478 Ibyte tempch[MAX_ICHAR_LEN];
|
|
|
4479 Ichar buf_ch =
|
|
|
4480 RE_TRANSLATE_1 (itext_ichar_fmt (d, fmt, lispobj));
|
|
|
4481 set_itext_ichar (tempch, buf_ch);
|
|
826
|
4482 if (fastmap[*tempch])
|
|
|
4483 break;
|
|
446
|
4484 #else
|
|
826
|
4485 if (fastmap[(unsigned char) RE_TRANSLATE_1 (*d)])
|
|
|
4486 break;
|
|
446
|
4487 #endif /* MULE */
|
|
867
|
4488 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
4489 range -= (d - old_d);
|
|
|
4490 #if 1
|
|
1333
|
4491 assert (!forward_search_p || range >= 0);
|
|
826
|
4492 #endif
|
|
|
4493 }
|
|
|
4494 }
|
|
|
4495 #ifdef MULE
|
|
|
4496 else if (fmt != FORMAT_DEFAULT)
|
|
|
4497 {
|
|
|
4498 while (range > lim)
|
|
|
4499 {
|
|
|
4500 re_char *old_d = d;
|
|
867
|
4501 Ibyte tempch[MAX_ICHAR_LEN];
|
|
|
4502 Ichar buf_ch = itext_ichar_fmt (d, fmt, lispobj);
|
|
|
4503 set_itext_ichar (tempch, buf_ch);
|
|
826
|
4504 if (fastmap[*tempch])
|
|
|
4505 break;
|
|
867
|
4506 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
4507 range -= (d - old_d);
|
|
|
4508 #if 1
|
|
1333
|
4509 assert (!forward_search_p || range >= 0);
|
|
826
|
4510 #endif
|
|
|
4511 }
|
|
|
4512 }
|
|
|
4513 #endif /* MULE */
|
|
428
|
4514 else
|
|
826
|
4515 {
|
|
|
4516 while (range > lim && !fastmap[*d])
|
|
|
4517 {
|
|
|
4518 re_char *old_d = d;
|
|
867
|
4519 INC_IBYTEPTR (d);
|
|
826
|
4520 range -= (d - old_d);
|
|
|
4521 #if 1
|
|
|
4522 assert (!forward_search_p || range >= 0);
|
|
|
4523 #endif
|
|
|
4524 }
|
|
|
4525 }
|
|
428
|
4526
|
|
|
4527 startpos += irange - range;
|
|
|
4528 }
|
|
|
4529 else /* Searching backwards. */
|
|
|
4530 {
|
|
826
|
4531 /* #### It's not clear why we don't just write a loop, like
|
|
|
4532 for the moving-forward case. Perhaps the writer got lazy,
|
|
|
4533 since backward searches aren't so common. */
|
|
|
4534 d = ((const unsigned char *)
|
|
|
4535 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
428
|
4536 #ifdef MULE
|
|
826
|
4537 {
|
|
867
|
4538 Ibyte tempch[MAX_ICHAR_LEN];
|
|
|
4539 Ichar buf_ch =
|
|
|
4540 RE_TRANSLATE (itext_ichar_fmt (d, fmt, lispobj));
|
|
|
4541 set_itext_ichar (tempch, buf_ch);
|
|
826
|
4542 if (!fastmap[*tempch])
|
|
|
4543 goto advance;
|
|
|
4544 }
|
|
428
|
4545 #else
|
|
826
|
4546 if (!fastmap[(unsigned char) RE_TRANSLATE (*d)])
|
|
446
|
4547 goto advance;
|
|
826
|
4548 #endif /* MULE */
|
|
428
|
4549 }
|
|
|
4550 }
|
|
|
4551
|
|
|
4552 /* If can't match the null string, and that's all we have left, fail. */
|
|
|
4553 if (range >= 0 && startpos == total_size && fastmap
|
|
|
4554 && !bufp->can_be_null)
|
|
1333
|
4555 {
|
|
|
4556 UNBIND_REGEX_MALLOC_CHECK ();
|
|
|
4557 return -1;
|
|
|
4558 }
|
|
428
|
4559
|
|
|
4560 #ifdef emacs /* XEmacs added, w/removal of immediate_quit */
|
|
|
4561 if (!no_quit_in_re_search)
|
|
1333
|
4562 {
|
|
|
4563 BEGIN_REGEX_MALLOC_OK ();
|
|
|
4564 QUIT;
|
|
|
4565 END_REGEX_MALLOC_OK ();
|
|
|
4566 RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
|
4567 }
|
|
|
4568
|
|
428
|
4569 #endif
|
|
1333
|
4570 BEGIN_REGEX_MALLOC_OK ();
|
|
428
|
4571 val = re_match_2_internal (bufp, string1, size1, string2, size2,
|
|
826
|
4572 startpos, regs, stop
|
|
|
4573 RE_LISP_CONTEXT_ARGS);
|
|
428
|
4574 #ifndef REGEX_MALLOC
|
|
1333
|
4575 ALLOCA_GARBAGE_COLLECT ();
|
|
428
|
4576 #endif
|
|
1333
|
4577 END_REGEX_MALLOC_OK ();
|
|
|
4578 RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
428
|
4579
|
|
|
4580 if (val >= 0)
|
|
1333
|
4581 {
|
|
|
4582 UNBIND_REGEX_MALLOC_CHECK ();
|
|
|
4583 return startpos;
|
|
|
4584 }
|
|
428
|
4585
|
|
|
4586 if (val == -2)
|
|
1333
|
4587 {
|
|
|
4588 UNBIND_REGEX_MALLOC_CHECK ();
|
|
|
4589 return -2;
|
|
|
4590 }
|
|
|
4591
|
|
|
4592 RE_SEARCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
428
|
4593 advance:
|
|
|
4594 if (!range)
|
|
|
4595 break;
|
|
|
4596 else if (range > 0)
|
|
|
4597 {
|
|
826
|
4598 Bytecount d_size;
|
|
442
|
4599 d = ((const unsigned char *)
|
|
428
|
4600 (startpos >= size1 ? string2 - size1 : string1) + startpos);
|
|
867
|
4601 d_size = itext_ichar_len_fmt (d, fmt);
|
|
428
|
4602 range -= d_size;
|
|
826
|
4603 #if 1
|
|
|
4604 assert (!forward_search_p || range >= 0);
|
|
|
4605 #endif
|
|
428
|
4606 startpos += d_size;
|
|
|
4607 }
|
|
|
4608 else
|
|
|
4609 {
|
|
826
|
4610 Bytecount d_size;
|
|
428
|
4611 /* Note startpos > size1 not >=. If we are on the
|
|
|
4612 string1/string2 boundary, we want to backup into string1. */
|
|
442
|
4613 d = ((const unsigned char *)
|
|
428
|
4614 (startpos > size1 ? string2 - size1 : string1) + startpos);
|
|
867
|
4615 DEC_IBYTEPTR_FMT (d, fmt);
|
|
|
4616 d_size = itext_ichar_len_fmt (d, fmt);
|
|
428
|
4617 range += d_size;
|
|
826
|
4618 #if 1
|
|
|
4619 assert (!forward_search_p || range >= 0);
|
|
|
4620 #endif
|
|
428
|
4621 startpos -= d_size;
|
|
|
4622 }
|
|
|
4623 }
|
|
1333
|
4624 UNBIND_REGEX_MALLOC_CHECK ();
|
|
428
|
4625 return -1;
|
|
|
4626 } /* re_search_2 */
|
|
826
|
4627
|
|
428
|
4628
|
|
|
4629 /* Declarations and macros for re_match_2. */
|
|
|
4630
|
|
|
4631 /* This converts PTR, a pointer into one of the search strings `string1'
|
|
|
4632 and `string2' into an offset from the beginning of that string. */
|
|
|
4633 #define POINTER_TO_OFFSET(ptr) \
|
|
|
4634 (FIRST_STRING_P (ptr) \
|
|
|
4635 ? ((regoff_t) ((ptr) - string1)) \
|
|
|
4636 : ((regoff_t) ((ptr) - string2 + size1)))
|
|
|
4637
|
|
|
4638 /* Macros for dealing with the split strings in re_match_2. */
|
|
|
4639
|
|
|
4640 #define MATCHING_IN_FIRST_STRING (dend == end_match_1)
|
|
|
4641
|
|
|
4642 /* Call before fetching a character with *d. This switches over to
|
|
|
4643 string2 if necessary. */
|
|
826
|
4644 #define REGEX_PREFETCH() \
|
|
428
|
4645 while (d == dend) \
|
|
|
4646 { \
|
|
|
4647 /* End of string2 => fail. */ \
|
|
|
4648 if (dend == end_match_2) \
|
|
|
4649 goto fail; \
|
|
|
4650 /* End of string1 => advance to string2. */ \
|
|
|
4651 d = string2; \
|
|
|
4652 dend = end_match_2; \
|
|
|
4653 }
|
|
|
4654
|
|
|
4655
|
|
|
4656 /* Test if at very beginning or at very end of the virtual concatenation
|
|
|
4657 of `string1' and `string2'. If only one string, it's `string2'. */
|
|
|
4658 #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
|
|
|
4659 #define AT_STRINGS_END(d) ((d) == end2)
|
|
|
4660
|
|
|
4661 /* XEmacs change:
|
|
|
4662 If the given position straddles the string gap, return the equivalent
|
|
|
4663 position that is before or after the gap, respectively; otherwise,
|
|
|
4664 return the same position. */
|
|
|
4665 #define POS_BEFORE_GAP_UNSAFE(d) ((d) == string2 ? end1 : (d))
|
|
|
4666 #define POS_AFTER_GAP_UNSAFE(d) ((d) == end1 ? string2 : (d))
|
|
|
4667
|
|
|
4668 /* Test if CH is a word-constituent character. (XEmacs change) */
|
|
826
|
4669 #define WORDCHAR_P(ch) \
|
|
|
4670 (SYNTAX (BUFFER_MIRROR_SYNTAX_TABLE (lispbuf), ch) == Sword)
|
|
428
|
4671
|
|
|
4672 /* Free everything we malloc. */
|
|
|
4673 #ifdef MATCH_MAY_ALLOCATE
|
|
1726
|
4674 #define FREE_VAR(var,type) if (var) REGEX_FREE (var, type); var = NULL
|
|
428
|
4675 #define FREE_VARIABLES() \
|
|
|
4676 do { \
|
|
1333
|
4677 UNBIND_REGEX_MALLOC_CHECK (); \
|
|
428
|
4678 REGEX_FREE_STACK (fail_stack.stack); \
|
|
1726
|
4679 FREE_VAR (regstart, re_char **); \
|
|
|
4680 FREE_VAR (regend, re_char **); \
|
|
|
4681 FREE_VAR (old_regstart, re_char **); \
|
|
|
4682 FREE_VAR (old_regend, re_char **); \
|
|
|
4683 FREE_VAR (best_regstart, re_char **); \
|
|
|
4684 FREE_VAR (best_regend, re_char **); \
|
|
|
4685 FREE_VAR (reg_info, register_info_type *); \
|
|
|
4686 FREE_VAR (reg_dummy, re_char **); \
|
|
|
4687 FREE_VAR (reg_info_dummy, register_info_type *); \
|
|
428
|
4688 } while (0)
|
|
446
|
4689 #else /* not MATCH_MAY_ALLOCATE */
|
|
1333
|
4690 #define FREE_VARIABLES() \
|
|
|
4691 do { \
|
|
|
4692 UNBIND_REGEX_MALLOC_CHECK (); \
|
|
|
4693 } while (0)
|
|
446
|
4694 #endif /* MATCH_MAY_ALLOCATE */
|
|
428
|
4695
|
|
|
4696 /* These values must meet several constraints. They must not be valid
|
|
|
4697 register values; since we have a limit of 255 registers (because
|
|
|
4698 we use only one byte in the pattern for the register number), we can
|
|
|
4699 use numbers larger than 255. They must differ by 1, because of
|
|
|
4700 NUM_FAILURE_ITEMS above. And the value for the lowest register must
|
|
|
4701 be larger than the value for the highest register, so we do not try
|
|
|
4702 to actually save any registers when none are active. */
|
|
|
4703 #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
|
|
|
4704 #define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
|
|
|
4705
|
|
|
4706 /* Matching routines. */
|
|
|
4707
|
|
826
|
4708 #ifndef emacs /* XEmacs never uses this. */
|
|
428
|
4709 /* re_match is like re_match_2 except it takes only a single string. */
|
|
|
4710
|
|
|
4711 int
|
|
442
|
4712 re_match (struct re_pattern_buffer *bufp, const char *string, int size,
|
|
826
|
4713 int pos, struct re_registers *regs
|
|
|
4714 RE_LISP_CONTEXT_ARGS_DECL)
|
|
428
|
4715 {
|
|
446
|
4716 int result = re_match_2_internal (bufp, NULL, 0, (re_char *) string, size,
|
|
826
|
4717 pos, regs, size
|
|
|
4718 RE_LISP_CONTEXT_ARGS);
|
|
1333
|
4719 ALLOCA_GARBAGE_COLLECT ();
|
|
428
|
4720 return result;
|
|
|
4721 }
|
|
|
4722 #endif /* not emacs */
|
|
|
4723
|
|
|
4724 /* re_match_2 matches the compiled pattern in BUFP against the
|
|
|
4725 (virtual) concatenation of STRING1 and STRING2 (of length SIZE1 and
|
|
|
4726 SIZE2, respectively). We start matching at POS, and stop matching
|
|
|
4727 at STOP.
|
|
|
4728
|
|
|
4729 If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
|
|
|
4730 store offsets for the substring each group matched in REGS. See the
|
|
|
4731 documentation for exactly how many groups we fill.
|
|
|
4732
|
|
|
4733 We return -1 if no match, -2 if an internal error (such as the
|
|
|
4734 failure stack overflowing). Otherwise, we return the length of the
|
|
|
4735 matched substring. */
|
|
|
4736
|
|
|
4737 int
|
|
442
|
4738 re_match_2 (struct re_pattern_buffer *bufp, const char *string1,
|
|
|
4739 int size1, const char *string2, int size2, int pos,
|
|
826
|
4740 struct re_registers *regs, int stop
|
|
|
4741 RE_LISP_CONTEXT_ARGS_DECL)
|
|
428
|
4742 {
|
|
460
|
4743 int result;
|
|
|
4744
|
|
|
4745 #ifdef emacs
|
|
826
|
4746 scache = setup_syntax_cache (scache, lispobj, lispbuf,
|
|
|
4747 offset_to_charxpos (lispobj, pos),
|
|
|
4748 1);
|
|
460
|
4749 #endif
|
|
|
4750
|
|
|
4751 result = re_match_2_internal (bufp, (re_char *) string1, size1,
|
|
|
4752 (re_char *) string2, size2,
|
|
826
|
4753 pos, regs, stop
|
|
|
4754 RE_LISP_CONTEXT_ARGS);
|
|
460
|
4755
|
|
1333
|
4756 ALLOCA_GARBAGE_COLLECT ();
|
|
428
|
4757 return result;
|
|
|
4758 }
|
|
|
4759
|
|
|
4760 /* This is a separate function so that we can force an alloca cleanup
|
|
|
4761 afterwards. */
|
|
|
4762 static int
|
|
446
|
4763 re_match_2_internal (struct re_pattern_buffer *bufp, re_char *string1,
|
|
|
4764 int size1, re_char *string2, int size2, int pos,
|
|
826
|
4765 struct re_registers *regs, int stop
|
|
2333
|
4766 RE_LISP_CONTEXT_ARGS_MULE_DECL)
|
|
428
|
4767 {
|
|
|
4768 /* General temporaries. */
|
|
|
4769 int mcnt;
|
|
|
4770 unsigned char *p1;
|
|
|
4771 int should_succeed; /* XEmacs change */
|
|
|
4772
|
|
|
4773 /* Just past the end of the corresponding string. */
|
|
446
|
4774 re_char *end1, *end2;
|
|
428
|
4775
|
|
|
4776 /* Pointers into string1 and string2, just past the last characters in
|
|
|
4777 each to consider matching. */
|
|
446
|
4778 re_char *end_match_1, *end_match_2;
|
|
428
|
4779
|
|
|
4780 /* Where we are in the data, and the end of the current string. */
|
|
446
|
4781 re_char *d, *dend;
|
|
428
|
4782
|
|
|
4783 /* Where we are in the pattern, and the end of the pattern. */
|
|
|
4784 unsigned char *p = bufp->buffer;
|
|
|
4785 REGISTER unsigned char *pend = p + bufp->used;
|
|
|
4786
|
|
|
4787 /* Mark the opcode just after a start_memory, so we can test for an
|
|
|
4788 empty subpattern when we get to the stop_memory. */
|
|
446
|
4789 re_char *just_past_start_mem = 0;
|
|
428
|
4790
|
|
|
4791 /* We use this to map every character in the string. */
|
|
446
|
4792 RE_TRANSLATE_TYPE translate = bufp->translate;
|
|
428
|
4793
|
|
|
4794 /* Failure point stack. Each place that can handle a failure further
|
|
|
4795 down the line pushes a failure point on this stack. It consists of
|
|
|
4796 restart, regend, and reg_info for all registers corresponding to
|
|
|
4797 the subexpressions we're currently inside, plus the number of such
|
|
|
4798 registers, and, finally, two char *'s. The first char * is where
|
|
|
4799 to resume scanning the pattern; the second one is where to resume
|
|
|
4800 scanning the strings. If the latter is zero, the failure point is
|
|
|
4801 a ``dummy''; if a failure happens and the failure point is a dummy,
|
|
|
4802 it gets discarded and the next one is tried. */
|
|
|
4803 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
|
|
|
4804 fail_stack_type fail_stack;
|
|
|
4805 #endif
|
|
|
4806 #ifdef DEBUG
|
|
647
|
4807 static int failure_id;
|
|
|
4808 int nfailure_points_pushed = 0, nfailure_points_popped = 0;
|
|
428
|
4809 #endif
|
|
|
4810
|
|
771
|
4811 #ifdef REGEX_REL_ALLOC
|
|
428
|
4812 /* This holds the pointer to the failure stack, when
|
|
|
4813 it is allocated relocatably. */
|
|
|
4814 fail_stack_elt_t *failure_stack_ptr;
|
|
|
4815 #endif
|
|
|
4816
|
|
|
4817 /* We fill all the registers internally, independent of what we
|
|
|
4818 return, for use in backreferences. The number here includes
|
|
|
4819 an element for register zero. */
|
|
647
|
4820 int num_regs = bufp->re_ngroups + 1;
|
|
428
|
4821
|
|
|
4822 /* The currently active registers. */
|
|
647
|
4823 int lowest_active_reg = NO_LOWEST_ACTIVE_REG;
|
|
|
4824 int highest_active_reg = NO_HIGHEST_ACTIVE_REG;
|
|
428
|
4825
|
|
|
4826 /* Information on the contents of registers. These are pointers into
|
|
|
4827 the input strings; they record just what was matched (on this
|
|
|
4828 attempt) by a subexpression part of the pattern, that is, the
|
|
|
4829 regnum-th regstart pointer points to where in the pattern we began
|
|
|
4830 matching and the regnum-th regend points to right after where we
|
|
|
4831 stopped matching the regnum-th subexpression. (The zeroth register
|
|
|
4832 keeps track of what the whole pattern matches.) */
|
|
|
4833 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
|
|
446
|
4834 re_char **regstart, **regend;
|
|
428
|
4835 #endif
|
|
|
4836
|
|
|
4837 /* If a group that's operated upon by a repetition operator fails to
|
|
|
4838 match anything, then the register for its start will need to be
|
|
|
4839 restored because it will have been set to wherever in the string we
|
|
|
4840 are when we last see its open-group operator. Similarly for a
|
|
|
4841 register's end. */
|
|
|
4842 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
|
|
446
|
4843 re_char **old_regstart, **old_regend;
|
|
428
|
4844 #endif
|
|
|
4845
|
|
|
4846 /* The is_active field of reg_info helps us keep track of which (possibly
|
|
|
4847 nested) subexpressions we are currently in. The matched_something
|
|
|
4848 field of reg_info[reg_num] helps us tell whether or not we have
|
|
|
4849 matched any of the pattern so far this time through the reg_num-th
|
|
|
4850 subexpression. These two fields get reset each time through any
|
|
|
4851 loop their register is in. */
|
|
|
4852 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
|
|
|
4853 register_info_type *reg_info;
|
|
|
4854 #endif
|
|
|
4855
|
|
|
4856 /* The following record the register info as found in the above
|
|
|
4857 variables when we find a match better than any we've seen before.
|
|
|
4858 This happens as we backtrack through the failure points, which in
|
|
|
4859 turn happens only if we have not yet matched the entire string. */
|
|
647
|
4860 int best_regs_set = false;
|
|
428
|
4861 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
|
|
446
|
4862 re_char **best_regstart, **best_regend;
|
|
428
|
4863 #endif
|
|
|
4864
|
|
|
4865 /* Logically, this is `best_regend[0]'. But we don't want to have to
|
|
|
4866 allocate space for that if we're not allocating space for anything
|
|
|
4867 else (see below). Also, we never need info about register 0 for
|
|
|
4868 any of the other register vectors, and it seems rather a kludge to
|
|
|
4869 treat `best_regend' differently than the rest. So we keep track of
|
|
|
4870 the end of the best match so far in a separate variable. We
|
|
|
4871 initialize this to NULL so that when we backtrack the first time
|
|
|
4872 and need to test it, it's not garbage. */
|
|
446
|
4873 re_char *match_end = NULL;
|
|
428
|
4874
|
|
|
4875 /* This helps SET_REGS_MATCHED avoid doing redundant work. */
|
|
|
4876 int set_regs_matched_done = 0;
|
|
|
4877
|
|
|
4878 /* Used when we pop values we don't care about. */
|
|
|
4879 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
|
|
446
|
4880 re_char **reg_dummy;
|
|
428
|
4881 register_info_type *reg_info_dummy;
|
|
|
4882 #endif
|
|
|
4883
|
|
|
4884 #ifdef DEBUG
|
|
|
4885 /* Counts the total number of registers pushed. */
|
|
647
|
4886 int num_regs_pushed = 0;
|
|
428
|
4887 #endif
|
|
|
4888
|
|
|
4889 /* 1 if this match ends in the same string (string1 or string2)
|
|
|
4890 as the best previous match. */
|
|
460
|
4891 re_bool same_str_p;
|
|
428
|
4892
|
|
|
4893 /* 1 if this match is the best seen so far. */
|
|
460
|
4894 re_bool best_match_p;
|
|
428
|
4895
|
|
826
|
4896 #ifdef emacs
|
|
|
4897 Internal_Format fmt = buffer_or_other_internal_format (lispobj);
|
|
1346
|
4898 #ifdef REL_ALLOC
|
|
|
4899 Ibyte *orig_buftext =
|
|
|
4900 BUFFERP (lispobj) ?
|
|
|
4901 BYTE_BUF_BYTE_ADDRESS (XBUFFER (lispobj),
|
|
|
4902 BYTE_BUF_BEGV (XBUFFER (lispobj))) :
|
|
|
4903 0;
|
|
|
4904 #endif
|
|
|
4905
|
|
1333
|
4906 #ifdef ERROR_CHECK_MALLOC
|
|
|
4907 int depth = bind_regex_malloc_disallowed (1);
|
|
|
4908 #endif
|
|
826
|
4909 #endif /* emacs */
|
|
771
|
4910
|
|
428
|
4911 DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
|
|
|
4912
|
|
1333
|
4913 BEGIN_REGEX_MALLOC_OK ();
|
|
428
|
4914 INIT_FAIL_STACK ();
|
|
1333
|
4915 END_REGEX_MALLOC_OK ();
|
|
428
|
4916
|
|
|
4917 #ifdef MATCH_MAY_ALLOCATE
|
|
|
4918 /* Do not bother to initialize all the register variables if there are
|
|
|
4919 no groups in the pattern, as it takes a fair amount of time. If
|
|
|
4920 there are groups, we include space for register 0 (the whole
|
|
|
4921 pattern), even though we never use it, since it simplifies the
|
|
|
4922 array indexing. We should fix this. */
|
|
502
|
4923 if (bufp->re_ngroups)
|
|
428
|
4924 {
|
|
1333
|
4925 BEGIN_REGEX_MALLOC_OK ();
|
|
446
|
4926 regstart = REGEX_TALLOC (num_regs, re_char *);
|
|
|
4927 regend = REGEX_TALLOC (num_regs, re_char *);
|
|
|
4928 old_regstart = REGEX_TALLOC (num_regs, re_char *);
|
|
|
4929 old_regend = REGEX_TALLOC (num_regs, re_char *);
|
|
|
4930 best_regstart = REGEX_TALLOC (num_regs, re_char *);
|
|
|
4931 best_regend = REGEX_TALLOC (num_regs, re_char *);
|
|
428
|
4932 reg_info = REGEX_TALLOC (num_regs, register_info_type);
|
|
446
|
4933 reg_dummy = REGEX_TALLOC (num_regs, re_char *);
|
|
428
|
4934 reg_info_dummy = REGEX_TALLOC (num_regs, register_info_type);
|
|
1333
|
4935 END_REGEX_MALLOC_OK ();
|
|
428
|
4936
|
|
|
4937 if (!(regstart && regend && old_regstart && old_regend && reg_info
|
|
|
4938 && best_regstart && best_regend && reg_dummy && reg_info_dummy))
|
|
|
4939 {
|
|
|
4940 FREE_VARIABLES ();
|
|
|
4941 return -2;
|
|
|
4942 }
|
|
|
4943 }
|
|
|
4944 else
|
|
|
4945 {
|
|
|
4946 /* We must initialize all our variables to NULL, so that
|
|
|
4947 `FREE_VARIABLES' doesn't try to free them. */
|
|
|
4948 regstart = regend = old_regstart = old_regend = best_regstart
|
|
|
4949 = best_regend = reg_dummy = NULL;
|
|
|
4950 reg_info = reg_info_dummy = (register_info_type *) NULL;
|
|
|
4951 }
|
|
|
4952 #endif /* MATCH_MAY_ALLOCATE */
|
|
|
4953
|
|
1333
|
4954 #if defined (emacs) && defined (REL_ALLOC)
|
|
|
4955 {
|
|
|
4956 /* If the allocations above (or the call to setup_syntax_cache() in
|
|
|
4957 re_match_2) caused a rel-alloc relocation, then fix up the data
|
|
|
4958 pointers */
|
|
1346
|
4959 Bytecount offset = offset_post_relocation (lispobj, orig_buftext);
|
|
1333
|
4960 if (offset)
|
|
|
4961 {
|
|
|
4962 string1 += offset;
|
|
|
4963 string2 += offset;
|
|
|
4964 }
|
|
|
4965 }
|
|
|
4966 #endif /* defined (emacs) && defined (REL_ALLOC) */
|
|
|
4967
|
|
428
|
4968 /* The starting position is bogus. */
|
|
|
4969 if (pos < 0 || pos > size1 + size2)
|
|
|
4970 {
|
|
|
4971 FREE_VARIABLES ();
|
|
|
4972 return -1;
|
|
|
4973 }
|
|
|
4974
|
|
|
4975 /* Initialize subexpression text positions to -1 to mark ones that no
|
|
|
4976 start_memory/stop_memory has been seen for. Also initialize the
|
|
|
4977 register information struct. */
|
|
|
4978 for (mcnt = 1; mcnt < num_regs; mcnt++)
|
|
|
4979 {
|
|
|
4980 regstart[mcnt] = regend[mcnt]
|
|
|
4981 = old_regstart[mcnt] = old_regend[mcnt] = REG_UNSET_VALUE;
|
|
|
4982
|
|
|
4983 REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE;
|
|
|
4984 IS_ACTIVE (reg_info[mcnt]) = 0;
|
|
|
4985 MATCHED_SOMETHING (reg_info[mcnt]) = 0;
|
|
|
4986 EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0;
|
|
|
4987 }
|
|
|
4988 /* We move `string1' into `string2' if the latter's empty -- but not if
|
|
|
4989 `string1' is null. */
|
|
|
4990 if (size2 == 0 && string1 != NULL)
|
|
|
4991 {
|
|
|
4992 string2 = string1;
|
|
|
4993 size2 = size1;
|
|
|
4994 string1 = 0;
|
|
|
4995 size1 = 0;
|
|
|
4996 }
|
|
|
4997 end1 = string1 + size1;
|
|
|
4998 end2 = string2 + size2;
|
|
|
4999
|
|
|
5000 /* Compute where to stop matching, within the two strings. */
|
|
|
5001 if (stop <= size1)
|
|
|
5002 {
|
|
|
5003 end_match_1 = string1 + stop;
|
|
|
5004 end_match_2 = string2;
|
|
|
5005 }
|
|
|
5006 else
|
|
|
5007 {
|
|
|
5008 end_match_1 = end1;
|
|
|
5009 end_match_2 = string2 + stop - size1;
|
|
|
5010 }
|
|
|
5011
|
|
|
5012 /* `p' scans through the pattern as `d' scans through the data.
|
|
|
5013 `dend' is the end of the input string that `d' points within. `d'
|
|
|
5014 is advanced into the following input string whenever necessary, but
|
|
|
5015 this happens before fetching; therefore, at the beginning of the
|
|
|
5016 loop, `d' can be pointing at the end of a string, but it cannot
|
|
|
5017 equal `string2'. */
|
|
|
5018 if (size1 > 0 && pos <= size1)
|
|
|
5019 {
|
|
|
5020 d = string1 + pos;
|
|
|
5021 dend = end_match_1;
|
|
|
5022 }
|
|
|
5023 else
|
|
|
5024 {
|
|
|
5025 d = string2 + pos - size1;
|
|
|
5026 dend = end_match_2;
|
|
|
5027 }
|
|
|
5028
|
|
446
|
5029 DEBUG_PRINT1 ("The compiled pattern is: \n");
|
|
428
|
5030 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
|
|
|
5031 DEBUG_PRINT1 ("The string to match is: `");
|
|
|
5032 DEBUG_PRINT_DOUBLE_STRING (d, string1, size1, string2, size2);
|
|
|
5033 DEBUG_PRINT1 ("'\n");
|
|
|
5034
|
|
|
5035 /* This loops over pattern commands. It exits by returning from the
|
|
|
5036 function if the match is complete, or it drops through if the match
|
|
|
5037 fails at this starting point in the input data. */
|
|
|
5038 for (;;)
|
|
|
5039 {
|
|
|
5040 DEBUG_PRINT2 ("\n0x%lx: ", (long) p);
|
|
|
5041 #ifdef emacs /* XEmacs added, w/removal of immediate_quit */
|
|
|
5042 if (!no_quit_in_re_search)
|
|
1333
|
5043 {
|
|
|
5044 BEGIN_REGEX_MALLOC_OK ();
|
|
|
5045 QUIT;
|
|
|
5046 END_REGEX_MALLOC_OK ();
|
|
1346
|
5047 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
1333
|
5048 }
|
|
428
|
5049 #endif
|
|
|
5050
|
|
|
5051 if (p == pend)
|
|
|
5052 { /* End of pattern means we might have succeeded. */
|
|
|
5053 DEBUG_PRINT1 ("end of pattern ... ");
|
|
|
5054
|
|
|
5055 /* If we haven't matched the entire string, and we want the
|
|
|
5056 longest match, try backtracking. */
|
|
|
5057 if (d != end_match_2)
|
|
|
5058 {
|
|
|
5059 same_str_p = (FIRST_STRING_P (match_end)
|
|
|
5060 == MATCHING_IN_FIRST_STRING);
|
|
|
5061
|
|
|
5062 /* AIX compiler got confused when this was combined
|
|
|
5063 with the previous declaration. */
|
|
|
5064 if (same_str_p)
|
|
|
5065 best_match_p = d > match_end;
|
|
|
5066 else
|
|
|
5067 best_match_p = !MATCHING_IN_FIRST_STRING;
|
|
|
5068
|
|
|
5069 DEBUG_PRINT1 ("backtracking.\n");
|
|
|
5070
|
|
|
5071 if (!FAIL_STACK_EMPTY ())
|
|
|
5072 { /* More failure points to try. */
|
|
|
5073
|
|
|
5074 /* If exceeds best match so far, save it. */
|
|
|
5075 if (!best_regs_set || best_match_p)
|
|
|
5076 {
|
|
|
5077 best_regs_set = true;
|
|
|
5078 match_end = d;
|
|
|
5079
|
|
|
5080 DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
|
|
|
5081
|
|
|
5082 for (mcnt = 1; mcnt < num_regs; mcnt++)
|
|
|
5083 {
|
|
|
5084 best_regstart[mcnt] = regstart[mcnt];
|
|
|
5085 best_regend[mcnt] = regend[mcnt];
|
|
|
5086 }
|
|
|
5087 }
|
|
|
5088 goto fail;
|
|
|
5089 }
|
|
|
5090
|
|
|
5091 /* If no failure points, don't restore garbage. And if
|
|
|
5092 last match is real best match, don't restore second
|
|
|
5093 best one. */
|
|
|
5094 else if (best_regs_set && !best_match_p)
|
|
|
5095 {
|
|
|
5096 restore_best_regs:
|
|
|
5097 /* Restore best match. It may happen that `dend ==
|
|
|
5098 end_match_1' while the restored d is in string2.
|
|
|
5099 For example, the pattern `x.*y.*z' against the
|
|
|
5100 strings `x-' and `y-z-', if the two strings are
|
|
|
5101 not consecutive in memory. */
|
|
|
5102 DEBUG_PRINT1 ("Restoring best registers.\n");
|
|
|
5103
|
|
|
5104 d = match_end;
|
|
|
5105 dend = ((d >= string1 && d <= end1)
|
|
|
5106 ? end_match_1 : end_match_2);
|
|
|
5107
|
|
|
5108 for (mcnt = 1; mcnt < num_regs; mcnt++)
|
|
|
5109 {
|
|
|
5110 regstart[mcnt] = best_regstart[mcnt];
|
|
|
5111 regend[mcnt] = best_regend[mcnt];
|
|
|
5112 }
|
|
|
5113 }
|
|
|
5114 } /* d != end_match_2 */
|
|
|
5115
|
|
|
5116 succeed_label:
|
|
|
5117 DEBUG_PRINT1 ("Accepting match.\n");
|
|
|
5118
|
|
|
5119 /* If caller wants register contents data back, do it. */
|
|
1028
|
5120 {
|
|
|
5121 int num_nonshy_regs = bufp->re_nsub + 1;
|
|
|
5122 if (regs && !bufp->no_sub)
|
|
|
5123 {
|
|
|
5124 /* Have the register data arrays been allocated? */
|
|
|
5125 if (bufp->regs_allocated == REGS_UNALLOCATED)
|
|
|
5126 { /* No. So allocate them with malloc. We need one
|
|
|
5127 extra element beyond `num_regs' for the `-1' marker
|
|
|
5128 GNU code uses. */
|
|
|
5129 regs->num_regs = MAX (RE_NREGS, num_nonshy_regs + 1);
|
|
1333
|
5130 BEGIN_REGEX_MALLOC_OK ();
|
|
1028
|
5131 regs->start = TALLOC (regs->num_regs, regoff_t);
|
|
|
5132 regs->end = TALLOC (regs->num_regs, regoff_t);
|
|
1333
|
5133 END_REGEX_MALLOC_OK ();
|
|
|
5134 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
1028
|
5135 if (regs->start == NULL || regs->end == NULL)
|
|
|
5136 {
|
|
|
5137 FREE_VARIABLES ();
|
|
|
5138 return -2;
|
|
|
5139 }
|
|
|
5140 bufp->regs_allocated = REGS_REALLOCATE;
|
|
|
5141 }
|
|
|
5142 else if (bufp->regs_allocated == REGS_REALLOCATE)
|
|
|
5143 { /* Yes. If we need more elements than were already
|
|
|
5144 allocated, reallocate them. If we need fewer, just
|
|
|
5145 leave it alone. */
|
|
|
5146 if (regs->num_regs < num_nonshy_regs + 1)
|
|
|
5147 {
|
|
|
5148 regs->num_regs = num_nonshy_regs + 1;
|
|
1333
|
5149 BEGIN_REGEX_MALLOC_OK ();
|
|
1028
|
5150 RETALLOC (regs->start, regs->num_regs, regoff_t);
|
|
|
5151 RETALLOC (regs->end, regs->num_regs, regoff_t);
|
|
1333
|
5152 END_REGEX_MALLOC_OK ();
|
|
|
5153 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
1028
|
5154 if (regs->start == NULL || regs->end == NULL)
|
|
|
5155 {
|
|
|
5156 FREE_VARIABLES ();
|
|
|
5157 return -2;
|
|
|
5158 }
|
|
|
5159 }
|
|
|
5160 }
|
|
|
5161 else
|
|
|
5162 {
|
|
|
5163 /* The braces fend off a "empty body in an else-statement"
|
|
|
5164 warning under GCC when assert expands to nothing. */
|
|
|
5165 assert (bufp->regs_allocated == REGS_FIXED);
|
|
|
5166 }
|
|
|
5167
|
|
|
5168 /* Convert the pointer data in `regstart' and `regend' to
|
|
|
5169 indices. Register zero has to be set differently,
|
|
|
5170 since we haven't kept track of any info for it. */
|
|
|
5171 if (regs->num_regs > 0)
|
|
|
5172 {
|
|
|
5173 regs->start[0] = pos;
|
|
|
5174 regs->end[0] = (MATCHING_IN_FIRST_STRING
|
|
|
5175 ? ((regoff_t) (d - string1))
|
|
|
5176 : ((regoff_t) (d - string2 + size1)));
|
|
|
5177 }
|
|
|
5178
|
|
|
5179 /* Go through the first `min (num_regs, regs->num_regs)'
|
|
|
5180 registers, since that is all we initialized. */
|
|
|
5181 for (mcnt = 1; mcnt < MIN (num_nonshy_regs, regs->num_regs);
|
|
|
5182 mcnt++)
|
|
|
5183 {
|
|
|
5184 int internal_reg = bufp->external_to_internal_register[mcnt];
|
|
|
5185 if (REG_UNSET (regstart[internal_reg]) ||
|
|
|
5186 REG_UNSET (regend[internal_reg]))
|
|
|
5187 regs->start[mcnt] = regs->end[mcnt] = -1;
|
|
|
5188 else
|
|
|
5189 {
|
|
|
5190 regs->start[mcnt] =
|
|
|
5191 (regoff_t) POINTER_TO_OFFSET (regstart[internal_reg]);
|
|
|
5192 regs->end[mcnt] =
|
|
|
5193 (regoff_t) POINTER_TO_OFFSET (regend[internal_reg]);
|
|
|
5194 }
|
|
|
5195 }
|
|
|
5196 } /* regs && !bufp->no_sub */
|
|
|
5197
|
|
|
5198 /* If we have regs and the regs structure has more elements than
|
|
|
5199 were in the pattern, set the extra elements to -1. If we
|
|
|
5200 (re)allocated the registers, this is the case, because we
|
|
|
5201 always allocate enough to have at least one -1 at the end.
|
|
|
5202
|
|
|
5203 We do this even when no_sub is set because some applications
|
|
|
5204 (XEmacs) reuse register structures which may contain stale
|
|
|
5205 information, and permit attempts to access those registers.
|
|
|
5206
|
|
|
5207 It would be possible to require the caller to do this, but we'd
|
|
|
5208 have to change the API for this function to reflect that, and
|
|
1425
|
5209 audit all callers. Note: as of 2003-04-17 callers in XEmacs
|
|
|
5210 do clear the registers, but it's safer to leave this code in
|
|
|
5211 because of reallocation.
|
|
|
5212 */
|
|
1028
|
5213 if (regs && regs->num_regs > 0)
|
|
|
5214 for (mcnt = num_nonshy_regs; mcnt < regs->num_regs; mcnt++)
|
|
|
5215 regs->start[mcnt] = regs->end[mcnt] = -1;
|
|
|
5216 }
|
|
428
|
5217 DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
|
|
|
5218 nfailure_points_pushed, nfailure_points_popped,
|
|
|
5219 nfailure_points_pushed - nfailure_points_popped);
|
|
|
5220 DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed);
|
|
|
5221
|
|
|
5222 mcnt = d - pos - (MATCHING_IN_FIRST_STRING
|
|
|
5223 ? string1
|
|
|
5224 : string2 - size1);
|
|
|
5225
|
|
|
5226 DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt);
|
|
|
5227
|
|
|
5228 FREE_VARIABLES ();
|
|
|
5229 return mcnt;
|
|
|
5230 }
|
|
|
5231
|
|
|
5232 /* Otherwise match next pattern command. */
|
|
|
5233 switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++))
|
|
|
5234 {
|
|
|
5235 /* Ignore these. Used to ignore the n of succeed_n's which
|
|
|
5236 currently have n == 0. */
|
|
|
5237 case no_op:
|
|
|
5238 DEBUG_PRINT1 ("EXECUTING no_op.\n");
|
|
|
5239 break;
|
|
|
5240
|
|
|
5241 case succeed:
|
|
|
5242 DEBUG_PRINT1 ("EXECUTING succeed.\n");
|
|
|
5243 goto succeed_label;
|
|
|
5244
|
|
826
|
5245 /* Match exactly a string of length n in the pattern. The
|
|
|
5246 following byte in the pattern defines n, and the n bytes after
|
|
|
5247 that make up the string to match. (Under Mule, this will be in
|
|
|
5248 the default internal format.) */
|
|
428
|
5249 case exactn:
|
|
|
5250 mcnt = *p++;
|
|
|
5251 DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt);
|
|
|
5252
|
|
|
5253 /* This is written out as an if-else so we don't waste time
|
|
|
5254 testing `translate' inside the loop. */
|
|
446
|
5255 if (TRANSLATE_P (translate))
|
|
428
|
5256 {
|
|
|
5257 do
|
|
|
5258 {
|
|
446
|
5259 #ifdef MULE
|
|
|
5260 Bytecount pat_len;
|
|
|
5261
|
|
450
|
5262 REGEX_PREFETCH ();
|
|
867
|
5263 if (RE_TRANSLATE_1 (itext_ichar_fmt (d, fmt, lispobj))
|
|
|
5264 != itext_ichar (p))
|
|
428
|
5265 goto fail;
|
|
446
|
5266
|
|
867
|
5267 pat_len = itext_ichar_len (p);
|
|
446
|
5268 p += pat_len;
|
|
867
|
5269 INC_IBYTEPTR_FMT (d, fmt);
|
|
446
|
5270
|
|
|
5271 mcnt -= pat_len;
|
|
|
5272 #else /* not MULE */
|
|
450
|
5273 REGEX_PREFETCH ();
|
|
826
|
5274 if ((unsigned char) RE_TRANSLATE_1 (*d++) != *p++)
|
|
446
|
5275 goto fail;
|
|
|
5276 mcnt--;
|
|
|
5277 #endif
|
|
428
|
5278 }
|
|
446
|
5279 while (mcnt > 0);
|
|
428
|
5280 }
|
|
|
5281 else
|
|
|
5282 {
|
|
826
|
5283 #ifdef MULE
|
|
|
5284 /* If buffer format is default, then we can shortcut and just
|
|
|
5285 compare the text directly, byte by byte. Otherwise, we
|
|
|
5286 need to go character by character. */
|
|
|
5287 if (fmt != FORMAT_DEFAULT)
|
|
428
|
5288 {
|
|
826
|
5289 do
|
|
|
5290 {
|
|
|
5291 Bytecount pat_len;
|
|
|
5292
|
|
|
5293 REGEX_PREFETCH ();
|
|
867
|
5294 if (itext_ichar_fmt (d, fmt, lispobj) !=
|
|
|
5295 itext_ichar (p))
|
|
826
|
5296 goto fail;
|
|
|
5297
|
|
867
|
5298 pat_len = itext_ichar_len (p);
|
|
826
|
5299 p += pat_len;
|
|
867
|
5300 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
5301
|
|
|
5302 mcnt -= pat_len;
|
|
|
5303 }
|
|
|
5304 while (mcnt > 0);
|
|
428
|
5305 }
|
|
826
|
5306 else
|
|
|
5307 #endif
|
|
|
5308 {
|
|
|
5309 do
|
|
|
5310 {
|
|
|
5311 REGEX_PREFETCH ();
|
|
|
5312 if (*d++ != *p++) goto fail;
|
|
|
5313 mcnt--;
|
|
|
5314 }
|
|
|
5315 while (mcnt > 0);
|
|
|
5316 }
|
|
428
|
5317 }
|
|
|
5318 SET_REGS_MATCHED ();
|
|
|
5319 break;
|
|
|
5320
|
|
|
5321
|
|
|
5322 /* Match any character except possibly a newline or a null. */
|
|
|
5323 case anychar:
|
|
|
5324 DEBUG_PRINT1 ("EXECUTING anychar.\n");
|
|
|
5325
|
|
450
|
5326 REGEX_PREFETCH ();
|
|
428
|
5327
|
|
826
|
5328 if ((!(bufp->syntax & RE_DOT_NEWLINE) &&
|
|
867
|
5329 RE_TRANSLATE (itext_ichar_fmt (d, fmt, lispobj)) == '\n')
|
|
826
|
5330 || (bufp->syntax & RE_DOT_NOT_NULL &&
|
|
867
|
5331 RE_TRANSLATE (itext_ichar_fmt (d, fmt, lispobj)) ==
|
|
826
|
5332 '\000'))
|
|
428
|
5333 goto fail;
|
|
|
5334
|
|
|
5335 SET_REGS_MATCHED ();
|
|
|
5336 DEBUG_PRINT2 (" Matched `%d'.\n", *d);
|
|
867
|
5337 INC_IBYTEPTR_FMT (d, fmt); /* XEmacs change */
|
|
428
|
5338 break;
|
|
|
5339
|
|
|
5340
|
|
|
5341 case charset:
|
|
|
5342 case charset_not:
|
|
|
5343 {
|
|
1414
|
5344 REGISTER Ichar c;
|
|
460
|
5345 re_bool not_p = (re_opcode_t) *(p - 1) == charset_not;
|
|
458
|
5346
|
|
|
5347 DEBUG_PRINT2 ("EXECUTING charset%s.\n", not_p ? "_not" : "");
|
|
428
|
5348
|
|
450
|
5349 REGEX_PREFETCH ();
|
|
867
|
5350 c = itext_ichar_fmt (d, fmt, lispobj);
|
|
826
|
5351 c = RE_TRANSLATE (c); /* The character to match. */
|
|
428
|
5352
|
|
647
|
5353 /* Cast to `unsigned int' instead of `unsigned char' in case the
|
|
428
|
5354 bit list is a full 32 bytes long. */
|
|
1414
|
5355 if ((unsigned int)c < (unsigned int) (*p * BYTEWIDTH)
|
|
428
|
5356 && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
|
|
458
|
5357 not_p = !not_p;
|
|
428
|
5358
|
|
|
5359 p += 1 + *p;
|
|
|
5360
|
|
458
|
5361 if (!not_p) goto fail;
|
|
428
|
5362
|
|
|
5363 SET_REGS_MATCHED ();
|
|
867
|
5364 INC_IBYTEPTR_FMT (d, fmt); /* XEmacs change */
|
|
428
|
5365 break;
|
|
|
5366 }
|
|
|
5367
|
|
|
5368 #ifdef MULE
|
|
|
5369 case charset_mule:
|
|
|
5370 case charset_mule_not:
|
|
|
5371 {
|
|
867
|
5372 REGISTER Ichar c;
|
|
460
|
5373 re_bool not_p = (re_opcode_t) *(p - 1) == charset_mule_not;
|
|
458
|
5374
|
|
|
5375 DEBUG_PRINT2 ("EXECUTING charset_mule%s.\n", not_p ? "_not" : "");
|
|
428
|
5376
|
|
450
|
5377 REGEX_PREFETCH ();
|
|
867
|
5378 c = itext_ichar_fmt (d, fmt, lispobj);
|
|
826
|
5379 c = RE_TRANSLATE (c); /* The character to match. */
|
|
428
|
5380
|
|
|
5381 if (EQ (Qt, unified_range_table_lookup (p, c, Qnil)))
|
|
458
|
5382 not_p = !not_p;
|
|
428
|
5383
|
|
|
5384 p += unified_range_table_bytes_used (p);
|
|
|
5385
|
|
458
|
5386 if (!not_p) goto fail;
|
|
428
|
5387
|
|
|
5388 SET_REGS_MATCHED ();
|
|
867
|
5389 INC_IBYTEPTR_FMT (d, fmt);
|
|
428
|
5390 break;
|
|
|
5391 }
|
|
|
5392 #endif /* MULE */
|
|
|
5393
|
|
|
5394
|
|
|
5395 /* The beginning of a group is represented by start_memory.
|
|
|
5396 The arguments are the register number in the next byte, and the
|
|
|
5397 number of groups inner to this one in the next. The text
|
|
|
5398 matched within the group is recorded (in the internal
|
|
|
5399 registers data structure) under the register number. */
|
|
|
5400 case start_memory:
|
|
|
5401 DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p, p[1]);
|
|
|
5402
|
|
|
5403 /* Find out if this group can match the empty string. */
|
|
|
5404 p1 = p; /* To send to group_match_null_string_p. */
|
|
|
5405
|
|
|
5406 if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE)
|
|
|
5407 REG_MATCH_NULL_STRING_P (reg_info[*p])
|
|
|
5408 = group_match_null_string_p (&p1, pend, reg_info);
|
|
|
5409
|
|
|
5410 /* Save the position in the string where we were the last time
|
|
|
5411 we were at this open-group operator in case the group is
|
|
|
5412 operated upon by a repetition operator, e.g., with `(a*)*b'
|
|
|
5413 against `ab'; then we want to ignore where we are now in
|
|
|
5414 the string in case this attempt to match fails. */
|
|
|
5415 old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
|
|
|
5416 ? REG_UNSET (regstart[*p]) ? d : regstart[*p]
|
|
|
5417 : regstart[*p];
|
|
|
5418 DEBUG_PRINT2 (" old_regstart: %d\n",
|
|
|
5419 POINTER_TO_OFFSET (old_regstart[*p]));
|
|
|
5420
|
|
|
5421 regstart[*p] = d;
|
|
|
5422 DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart[*p]));
|
|
|
5423
|
|
|
5424 IS_ACTIVE (reg_info[*p]) = 1;
|
|
|
5425 MATCHED_SOMETHING (reg_info[*p]) = 0;
|
|
|
5426
|
|
|
5427 /* Clear this whenever we change the register activity status. */
|
|
|
5428 set_regs_matched_done = 0;
|
|
|
5429
|
|
|
5430 /* This is the new highest active register. */
|
|
|
5431 highest_active_reg = *p;
|
|
|
5432
|
|
|
5433 /* If nothing was active before, this is the new lowest active
|
|
|
5434 register. */
|
|
|
5435 if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
|
|
|
5436 lowest_active_reg = *p;
|
|
|
5437
|
|
|
5438 /* Move past the register number and inner group count. */
|
|
|
5439 p += 2;
|
|
|
5440 just_past_start_mem = p;
|
|
|
5441
|
|
|
5442 break;
|
|
|
5443
|
|
|
5444
|
|
|
5445 /* The stop_memory opcode represents the end of a group. Its
|
|
|
5446 arguments are the same as start_memory's: the register
|
|
|
5447 number, and the number of inner groups. */
|
|
|
5448 case stop_memory:
|
|
|
5449 DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p, p[1]);
|
|
|
5450
|
|
|
5451 /* We need to save the string position the last time we were at
|
|
|
5452 this close-group operator in case the group is operated
|
|
|
5453 upon by a repetition operator, e.g., with `((a*)*(b*)*)*'
|
|
|
5454 against `aba'; then we want to ignore where we are now in
|
|
|
5455 the string in case this attempt to match fails. */
|
|
|
5456 old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
|
|
|
5457 ? REG_UNSET (regend[*p]) ? d : regend[*p]
|
|
|
5458 : regend[*p];
|
|
|
5459 DEBUG_PRINT2 (" old_regend: %d\n",
|
|
|
5460 POINTER_TO_OFFSET (old_regend[*p]));
|
|
|
5461
|
|
|
5462 regend[*p] = d;
|
|
|
5463 DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend[*p]));
|
|
|
5464
|
|
|
5465 /* This register isn't active anymore. */
|
|
|
5466 IS_ACTIVE (reg_info[*p]) = 0;
|
|
|
5467
|
|
|
5468 /* Clear this whenever we change the register activity status. */
|
|
|
5469 set_regs_matched_done = 0;
|
|
|
5470
|
|
|
5471 /* If this was the only register active, nothing is active
|
|
|
5472 anymore. */
|
|
|
5473 if (lowest_active_reg == highest_active_reg)
|
|
|
5474 {
|
|
|
5475 lowest_active_reg = NO_LOWEST_ACTIVE_REG;
|
|
|
5476 highest_active_reg = NO_HIGHEST_ACTIVE_REG;
|
|
|
5477 }
|
|
|
5478 else
|
|
|
5479 { /* We must scan for the new highest active register, since
|
|
|
5480 it isn't necessarily one less than now: consider
|
|
|
5481 (a(b)c(d(e)f)g). When group 3 ends, after the f), the
|
|
|
5482 new highest active register is 1. */
|
|
|
5483 unsigned char r = *p - 1;
|
|
|
5484 while (r > 0 && !IS_ACTIVE (reg_info[r]))
|
|
|
5485 r--;
|
|
|
5486
|
|
|
5487 /* If we end up at register zero, that means that we saved
|
|
|
5488 the registers as the result of an `on_failure_jump', not
|
|
|
5489 a `start_memory', and we jumped to past the innermost
|
|
|
5490 `stop_memory'. For example, in ((.)*) we save
|
|
|
5491 registers 1 and 2 as a result of the *, but when we pop
|
|
|
5492 back to the second ), we are at the stop_memory 1.
|
|
|
5493 Thus, nothing is active. */
|
|
|
5494 if (r == 0)
|
|
|
5495 {
|
|
|
5496 lowest_active_reg = NO_LOWEST_ACTIVE_REG;
|
|
|
5497 highest_active_reg = NO_HIGHEST_ACTIVE_REG;
|
|
|
5498 }
|
|
|
5499 else
|
|
|
5500 {
|
|
|
5501 highest_active_reg = r;
|
|
|
5502
|
|
|
5503 /* 98/9/21 jhod: We've also gotta set lowest_active_reg, don't we? */
|
|
|
5504 r = 1;
|
|
|
5505 while (r < highest_active_reg && !IS_ACTIVE(reg_info[r]))
|
|
|
5506 r++;
|
|
|
5507 lowest_active_reg = r;
|
|
|
5508 }
|
|
|
5509 }
|
|
|
5510
|
|
|
5511 /* If just failed to match something this time around with a
|
|
|
5512 group that's operated on by a repetition operator, try to
|
|
|
5513 force exit from the ``loop'', and restore the register
|
|
|
5514 information for this group that we had before trying this
|
|
|
5515 last match. */
|
|
|
5516 if ((!MATCHED_SOMETHING (reg_info[*p])
|
|
|
5517 || just_past_start_mem == p - 1)
|
|
|
5518 && (p + 2) < pend)
|
|
|
5519 {
|
|
460
|
5520 re_bool is_a_jump_n = false;
|
|
428
|
5521
|
|
|
5522 p1 = p + 2;
|
|
|
5523 mcnt = 0;
|
|
|
5524 switch ((re_opcode_t) *p1++)
|
|
|
5525 {
|
|
|
5526 case jump_n:
|
|
|
5527 is_a_jump_n = true;
|
|
|
5528 case pop_failure_jump:
|
|
|
5529 case maybe_pop_jump:
|
|
|
5530 case jump:
|
|
|
5531 case dummy_failure_jump:
|
|
|
5532 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
5533 if (is_a_jump_n)
|
|
|
5534 p1 += 2;
|
|
|
5535 break;
|
|
|
5536
|
|
|
5537 default:
|
|
|
5538 /* do nothing */ ;
|
|
|
5539 }
|
|
|
5540 p1 += mcnt;
|
|
|
5541
|
|
|
5542 /* If the next operation is a jump backwards in the pattern
|
|
|
5543 to an on_failure_jump right before the start_memory
|
|
|
5544 corresponding to this stop_memory, exit from the loop
|
|
|
5545 by forcing a failure after pushing on the stack the
|
|
|
5546 on_failure_jump's jump in the pattern, and d. */
|
|
|
5547 if (mcnt < 0 && (re_opcode_t) *p1 == on_failure_jump
|
|
|
5548 && (re_opcode_t) p1[3] == start_memory && p1[4] == *p)
|
|
|
5549 {
|
|
|
5550 /* If this group ever matched anything, then restore
|
|
|
5551 what its registers were before trying this last
|
|
|
5552 failed match, e.g., with `(a*)*b' against `ab' for
|
|
|
5553 regstart[1], and, e.g., with `((a*)*(b*)*)*'
|
|
|
5554 against `aba' for regend[3].
|
|
|
5555
|
|
|
5556 Also restore the registers for inner groups for,
|
|
|
5557 e.g., `((a*)(b*))*' against `aba' (register 3 would
|
|
|
5558 otherwise get trashed). */
|
|
|
5559
|
|
|
5560 if (EVER_MATCHED_SOMETHING (reg_info[*p]))
|
|
|
5561 {
|
|
647
|
5562 int r;
|
|
428
|
5563
|
|
|
5564 EVER_MATCHED_SOMETHING (reg_info[*p]) = 0;
|
|
|
5565
|
|
|
5566 /* Restore this and inner groups' (if any) registers. */
|
|
|
5567 for (r = *p; r < *p + *(p + 1); r++)
|
|
|
5568 {
|
|
|
5569 regstart[r] = old_regstart[r];
|
|
|
5570
|
|
|
5571 /* xx why this test? */
|
|
|
5572 if (old_regend[r] >= regstart[r])
|
|
|
5573 regend[r] = old_regend[r];
|
|
|
5574 }
|
|
|
5575 }
|
|
|
5576 p1++;
|
|
|
5577 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
5578 PUSH_FAILURE_POINT (p1 + mcnt, d, -2);
|
|
|
5579
|
|
|
5580 goto fail;
|
|
|
5581 }
|
|
|
5582 }
|
|
|
5583
|
|
|
5584 /* Move past the register number and the inner group count. */
|
|
|
5585 p += 2;
|
|
|
5586 break;
|
|
|
5587
|
|
|
5588
|
|
|
5589 /* \<digit> has been turned into a `duplicate' command which is
|
|
502
|
5590 followed by the numeric value of <digit> as the register number.
|
|
|
5591 (Already passed through external-to-internal-register mapping,
|
|
|
5592 so it refers to the actual group number, not the non-shy-only
|
|
|
5593 numbering used in the external world.) */
|
|
428
|
5594 case duplicate:
|
|
|
5595 {
|
|
446
|
5596 REGISTER re_char *d2, *dend2;
|
|
502
|
5597 /* Get which register to match against. */
|
|
|
5598 int regno = *p++;
|
|
428
|
5599 DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno);
|
|
|
5600
|
|
|
5601 /* Can't back reference a group which we've never matched. */
|
|
|
5602 if (REG_UNSET (regstart[regno]) || REG_UNSET (regend[regno]))
|
|
|
5603 goto fail;
|
|
|
5604
|
|
|
5605 /* Where in input to try to start matching. */
|
|
|
5606 d2 = regstart[regno];
|
|
|
5607
|
|
|
5608 /* Where to stop matching; if both the place to start and
|
|
|
5609 the place to stop matching are in the same string, then
|
|
|
5610 set to the place to stop, otherwise, for now have to use
|
|
|
5611 the end of the first string. */
|
|
|
5612
|
|
|
5613 dend2 = ((FIRST_STRING_P (regstart[regno])
|
|
|
5614 == FIRST_STRING_P (regend[regno]))
|
|
|
5615 ? regend[regno] : end_match_1);
|
|
|
5616 for (;;)
|
|
|
5617 {
|
|
|
5618 /* If necessary, advance to next segment in register
|
|
|
5619 contents. */
|
|
|
5620 while (d2 == dend2)
|
|
|
5621 {
|
|
|
5622 if (dend2 == end_match_2) break;
|
|
|
5623 if (dend2 == regend[regno]) break;
|
|
|
5624
|
|
|
5625 /* End of string1 => advance to string2. */
|
|
|
5626 d2 = string2;
|
|
|
5627 dend2 = regend[regno];
|
|
|
5628 }
|
|
|
5629 /* At end of register contents => success */
|
|
|
5630 if (d2 == dend2) break;
|
|
|
5631
|
|
|
5632 /* If necessary, advance to next segment in data. */
|
|
450
|
5633 REGEX_PREFETCH ();
|
|
428
|
5634
|
|
|
5635 /* How many characters left in this segment to match. */
|
|
|
5636 mcnt = dend - d;
|
|
|
5637
|
|
|
5638 /* Want how many consecutive characters we can match in
|
|
|
5639 one shot, so, if necessary, adjust the count. */
|
|
|
5640 if (mcnt > dend2 - d2)
|
|
|
5641 mcnt = dend2 - d2;
|
|
|
5642
|
|
|
5643 /* Compare that many; failure if mismatch, else move
|
|
|
5644 past them. */
|
|
446
|
5645 if (TRANSLATE_P (translate)
|
|
826
|
5646 ? bcmp_translate (d, d2, mcnt, translate
|
|
|
5647 #ifdef emacs
|
|
|
5648 , fmt, lispobj
|
|
|
5649 #endif
|
|
|
5650 )
|
|
428
|
5651 : memcmp (d, d2, mcnt))
|
|
|
5652 goto fail;
|
|
|
5653 d += mcnt, d2 += mcnt;
|
|
|
5654
|
|
|
5655 /* Do this because we've match some characters. */
|
|
|
5656 SET_REGS_MATCHED ();
|
|
|
5657 }
|
|
|
5658 }
|
|
|
5659 break;
|
|
|
5660
|
|
|
5661
|
|
|
5662 /* begline matches the empty string at the beginning of the string
|
|
|
5663 (unless `not_bol' is set in `bufp'), and, if
|
|
|
5664 `newline_anchor' is set, after newlines. */
|
|
|
5665 case begline:
|
|
|
5666 DEBUG_PRINT1 ("EXECUTING begline.\n");
|
|
|
5667
|
|
|
5668 if (AT_STRINGS_BEG (d))
|
|
|
5669 {
|
|
|
5670 if (!bufp->not_bol) break;
|
|
|
5671 }
|
|
826
|
5672 else
|
|
|
5673 {
|
|
|
5674 re_char *d2 = d;
|
|
867
|
5675 DEC_IBYTEPTR (d2);
|
|
|
5676 if (itext_ichar_ascii_fmt (d2, fmt, lispobj) == '\n' &&
|
|
826
|
5677 bufp->newline_anchor)
|
|
|
5678 break;
|
|
|
5679 }
|
|
428
|
5680 /* In all other cases, we fail. */
|
|
|
5681 goto fail;
|
|
|
5682
|
|
|
5683
|
|
|
5684 /* endline is the dual of begline. */
|
|
|
5685 case endline:
|
|
|
5686 DEBUG_PRINT1 ("EXECUTING endline.\n");
|
|
|
5687
|
|
|
5688 if (AT_STRINGS_END (d))
|
|
|
5689 {
|
|
|
5690 if (!bufp->not_eol) break;
|
|
|
5691 }
|
|
|
5692
|
|
|
5693 /* We have to ``prefetch'' the next character. */
|
|
826
|
5694 else if ((d == end1 ?
|
|
867
|
5695 itext_ichar_ascii_fmt (string2, fmt, lispobj) :
|
|
|
5696 itext_ichar_ascii_fmt (d, fmt, lispobj)) == '\n'
|
|
428
|
5697 && bufp->newline_anchor)
|
|
|
5698 {
|
|
|
5699 break;
|
|
|
5700 }
|
|
|
5701 goto fail;
|
|
|
5702
|
|
|
5703
|
|
|
5704 /* Match at the very beginning of the data. */
|
|
|
5705 case begbuf:
|
|
|
5706 DEBUG_PRINT1 ("EXECUTING begbuf.\n");
|
|
|
5707 if (AT_STRINGS_BEG (d))
|
|
|
5708 break;
|
|
|
5709 goto fail;
|
|
|
5710
|
|
|
5711
|
|
|
5712 /* Match at the very end of the data. */
|
|
|
5713 case endbuf:
|
|
|
5714 DEBUG_PRINT1 ("EXECUTING endbuf.\n");
|
|
|
5715 if (AT_STRINGS_END (d))
|
|
|
5716 break;
|
|
|
5717 goto fail;
|
|
|
5718
|
|
|
5719
|
|
|
5720 /* on_failure_keep_string_jump is used to optimize `.*\n'. It
|
|
|
5721 pushes NULL as the value for the string on the stack. Then
|
|
|
5722 `pop_failure_point' will keep the current value for the
|
|
|
5723 string, instead of restoring it. To see why, consider
|
|
|
5724 matching `foo\nbar' against `.*\n'. The .* matches the foo;
|
|
|
5725 then the . fails against the \n. But the next thing we want
|
|
|
5726 to do is match the \n against the \n; if we restored the
|
|
|
5727 string value, we would be back at the foo.
|
|
|
5728
|
|
|
5729 Because this is used only in specific cases, we don't need to
|
|
|
5730 check all the things that `on_failure_jump' does, to make
|
|
|
5731 sure the right things get saved on the stack. Hence we don't
|
|
|
5732 share its code. The only reason to push anything on the
|
|
|
5733 stack at all is that otherwise we would have to change
|
|
|
5734 `anychar's code to do something besides goto fail in this
|
|
|
5735 case; that seems worse than this. */
|
|
|
5736 case on_failure_keep_string_jump:
|
|
|
5737 DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump");
|
|
|
5738
|
|
|
5739 EXTRACT_NUMBER_AND_INCR (mcnt, p);
|
|
|
5740 DEBUG_PRINT3 (" %d (to 0x%lx):\n", mcnt, (long) (p + mcnt));
|
|
|
5741
|
|
446
|
5742 PUSH_FAILURE_POINT (p + mcnt, (unsigned char *) 0, -2);
|
|
428
|
5743 break;
|
|
|
5744
|
|
|
5745
|
|
|
5746 /* Uses of on_failure_jump:
|
|
|
5747
|
|
|
5748 Each alternative starts with an on_failure_jump that points
|
|
|
5749 to the beginning of the next alternative. Each alternative
|
|
|
5750 except the last ends with a jump that in effect jumps past
|
|
|
5751 the rest of the alternatives. (They really jump to the
|
|
|
5752 ending jump of the following alternative, because tensioning
|
|
|
5753 these jumps is a hassle.)
|
|
|
5754
|
|
|
5755 Repeats start with an on_failure_jump that points past both
|
|
|
5756 the repetition text and either the following jump or
|
|
|
5757 pop_failure_jump back to this on_failure_jump. */
|
|
|
5758 case on_failure_jump:
|
|
|
5759 on_failure:
|
|
|
5760 DEBUG_PRINT1 ("EXECUTING on_failure_jump");
|
|
|
5761
|
|
|
5762 EXTRACT_NUMBER_AND_INCR (mcnt, p);
|
|
|
5763 DEBUG_PRINT3 (" %d (to 0x%lx)", mcnt, (long) (p + mcnt));
|
|
|
5764
|
|
|
5765 /* If this on_failure_jump comes right before a group (i.e.,
|
|
|
5766 the original * applied to a group), save the information
|
|
|
5767 for that group and all inner ones, so that if we fail back
|
|
|
5768 to this point, the group's information will be correct.
|
|
|
5769 For example, in \(a*\)*\1, we need the preceding group,
|
|
|
5770 and in \(\(a*\)b*\)\2, we need the inner group. */
|
|
|
5771
|
|
|
5772 /* We can't use `p' to check ahead because we push
|
|
|
5773 a failure point to `p + mcnt' after we do this. */
|
|
|
5774 p1 = p;
|
|
|
5775
|
|
|
5776 /* We need to skip no_op's before we look for the
|
|
|
5777 start_memory in case this on_failure_jump is happening as
|
|
|
5778 the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
|
|
|
5779 against aba. */
|
|
|
5780 while (p1 < pend && (re_opcode_t) *p1 == no_op)
|
|
|
5781 p1++;
|
|
|
5782
|
|
|
5783 if (p1 < pend && (re_opcode_t) *p1 == start_memory)
|
|
|
5784 {
|
|
|
5785 /* We have a new highest active register now. This will
|
|
|
5786 get reset at the start_memory we are about to get to,
|
|
|
5787 but we will have saved all the registers relevant to
|
|
|
5788 this repetition op, as described above. */
|
|
|
5789 highest_active_reg = *(p1 + 1) + *(p1 + 2);
|
|
|
5790 if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
|
|
|
5791 lowest_active_reg = *(p1 + 1);
|
|
|
5792 }
|
|
|
5793
|
|
|
5794 DEBUG_PRINT1 (":\n");
|
|
|
5795 PUSH_FAILURE_POINT (p + mcnt, d, -2);
|
|
|
5796 break;
|
|
|
5797
|
|
|
5798
|
|
|
5799 /* A smart repeat ends with `maybe_pop_jump'.
|
|
|
5800 We change it to either `pop_failure_jump' or `jump'. */
|
|
|
5801 case maybe_pop_jump:
|
|
|
5802 EXTRACT_NUMBER_AND_INCR (mcnt, p);
|
|
|
5803 DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt);
|
|
|
5804 {
|
|
|
5805 REGISTER unsigned char *p2 = p;
|
|
|
5806
|
|
|
5807 /* Compare the beginning of the repeat with what in the
|
|
|
5808 pattern follows its end. If we can establish that there
|
|
|
5809 is nothing that they would both match, i.e., that we
|
|
|
5810 would have to backtrack because of (as in, e.g., `a*a')
|
|
|
5811 then we can change to pop_failure_jump, because we'll
|
|
|
5812 never have to backtrack.
|
|
|
5813
|
|
|
5814 This is not true in the case of alternatives: in
|
|
|
5815 `(a|ab)*' we do need to backtrack to the `ab' alternative
|
|
|
5816 (e.g., if the string was `ab'). But instead of trying to
|
|
|
5817 detect that here, the alternative has put on a dummy
|
|
|
5818 failure point which is what we will end up popping. */
|
|
|
5819
|
|
|
5820 /* Skip over open/close-group commands.
|
|
|
5821 If what follows this loop is a ...+ construct,
|
|
|
5822 look at what begins its body, since we will have to
|
|
|
5823 match at least one of that. */
|
|
|
5824 while (1)
|
|
|
5825 {
|
|
|
5826 if (p2 + 2 < pend
|
|
|
5827 && ((re_opcode_t) *p2 == stop_memory
|
|
|
5828 || (re_opcode_t) *p2 == start_memory))
|
|
|
5829 p2 += 3;
|
|
|
5830 else if (p2 + 6 < pend
|
|
|
5831 && (re_opcode_t) *p2 == dummy_failure_jump)
|
|
|
5832 p2 += 6;
|
|
|
5833 else
|
|
|
5834 break;
|
|
|
5835 }
|
|
|
5836
|
|
|
5837 p1 = p + mcnt;
|
|
|
5838 /* p1[0] ... p1[2] are the `on_failure_jump' corresponding
|
|
|
5839 to the `maybe_finalize_jump' of this case. Examine what
|
|
|
5840 follows. */
|
|
|
5841
|
|
|
5842 /* If we're at the end of the pattern, we can change. */
|
|
|
5843 if (p2 == pend)
|
|
|
5844 {
|
|
|
5845 /* Consider what happens when matching ":\(.*\)"
|
|
|
5846 against ":/". I don't really understand this code
|
|
|
5847 yet. */
|
|
|
5848 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5849 DEBUG_PRINT1
|
|
|
5850 (" End of pattern: change to `pop_failure_jump'.\n");
|
|
|
5851 }
|
|
|
5852
|
|
|
5853 else if ((re_opcode_t) *p2 == exactn
|
|
|
5854 || (bufp->newline_anchor && (re_opcode_t) *p2 == endline))
|
|
|
5855 {
|
|
|
5856 REGISTER unsigned char c
|
|
|
5857 = *p2 == (unsigned char) endline ? '\n' : p2[2];
|
|
|
5858
|
|
|
5859 if ((re_opcode_t) p1[3] == exactn && p1[5] != c)
|
|
|
5860 {
|
|
|
5861 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5862 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
|
|
|
5863 c, p1[5]);
|
|
|
5864 }
|
|
|
5865
|
|
|
5866 else if ((re_opcode_t) p1[3] == charset
|
|
|
5867 || (re_opcode_t) p1[3] == charset_not)
|
|
|
5868 {
|
|
458
|
5869 int not_p = (re_opcode_t) p1[3] == charset_not;
|
|
428
|
5870
|
|
|
5871 if (c < (unsigned char) (p1[4] * BYTEWIDTH)
|
|
|
5872 && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
|
|
458
|
5873 not_p = !not_p;
|
|
|
5874
|
|
|
5875 /* `not_p' is equal to 1 if c would match, which means
|
|
428
|
5876 that we can't change to pop_failure_jump. */
|
|
458
|
5877 if (!not_p)
|
|
428
|
5878 {
|
|
|
5879 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5880 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
|
|
|
5881 }
|
|
|
5882 }
|
|
|
5883 }
|
|
|
5884 else if ((re_opcode_t) *p2 == charset)
|
|
|
5885 {
|
|
|
5886 #ifdef DEBUG
|
|
|
5887 REGISTER unsigned char c
|
|
|
5888 = *p2 == (unsigned char) endline ? '\n' : p2[2];
|
|
|
5889 #endif
|
|
|
5890
|
|
|
5891 if ((re_opcode_t) p1[3] == exactn
|
|
|
5892 && ! ((int) p2[1] * BYTEWIDTH > (int) p1[5]
|
|
|
5893 && (p2[2 + p1[5] / BYTEWIDTH]
|
|
|
5894 & (1 << (p1[5] % BYTEWIDTH)))))
|
|
|
5895 {
|
|
|
5896 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5897 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
|
|
|
5898 c, p1[5]);
|
|
|
5899 }
|
|
|
5900
|
|
|
5901 else if ((re_opcode_t) p1[3] == charset_not)
|
|
|
5902 {
|
|
|
5903 int idx;
|
|
|
5904 /* We win if the charset_not inside the loop
|
|
|
5905 lists every character listed in the charset after. */
|
|
|
5906 for (idx = 0; idx < (int) p2[1]; idx++)
|
|
|
5907 if (! (p2[2 + idx] == 0
|
|
|
5908 || (idx < (int) p1[4]
|
|
|
5909 && ((p2[2 + idx] & ~ p1[5 + idx]) == 0))))
|
|
|
5910 break;
|
|
|
5911
|
|
|
5912 if (idx == p2[1])
|
|
|
5913 {
|
|
|
5914 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5915 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
|
|
|
5916 }
|
|
|
5917 }
|
|
|
5918 else if ((re_opcode_t) p1[3] == charset)
|
|
|
5919 {
|
|
|
5920 int idx;
|
|
|
5921 /* We win if the charset inside the loop
|
|
|
5922 has no overlap with the one after the loop. */
|
|
|
5923 for (idx = 0;
|
|
|
5924 idx < (int) p2[1] && idx < (int) p1[4];
|
|
|
5925 idx++)
|
|
|
5926 if ((p2[2 + idx] & p1[5 + idx]) != 0)
|
|
|
5927 break;
|
|
|
5928
|
|
|
5929 if (idx == p2[1] || idx == p1[4])
|
|
|
5930 {
|
|
|
5931 p[-3] = (unsigned char) pop_failure_jump;
|
|
|
5932 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
|
|
|
5933 }
|
|
|
5934 }
|
|
|
5935 }
|
|
|
5936 }
|
|
|
5937 p -= 2; /* Point at relative address again. */
|
|
|
5938 if ((re_opcode_t) p[-1] != pop_failure_jump)
|
|
|
5939 {
|
|
|
5940 p[-1] = (unsigned char) jump;
|
|
|
5941 DEBUG_PRINT1 (" Match => jump.\n");
|
|
|
5942 goto unconditional_jump;
|
|
|
5943 }
|
|
|
5944 /* Note fall through. */
|
|
|
5945
|
|
|
5946
|
|
|
5947 /* The end of a simple repeat has a pop_failure_jump back to
|
|
|
5948 its matching on_failure_jump, where the latter will push a
|
|
|
5949 failure point. The pop_failure_jump takes off failure
|
|
|
5950 points put on by this pop_failure_jump's matching
|
|
|
5951 on_failure_jump; we got through the pattern to here from the
|
|
|
5952 matching on_failure_jump, so didn't fail. */
|
|
|
5953 case pop_failure_jump:
|
|
|
5954 {
|
|
|
5955 /* We need to pass separate storage for the lowest and
|
|
|
5956 highest registers, even though we don't care about the
|
|
|
5957 actual values. Otherwise, we will restore only one
|
|
|
5958 register from the stack, since lowest will == highest in
|
|
|
5959 `pop_failure_point'. */
|
|
647
|
5960 int dummy_low_reg, dummy_high_reg;
|
|
428
|
5961 unsigned char *pdummy;
|
|
446
|
5962 re_char *sdummy = NULL;
|
|
428
|
5963
|
|
|
5964 DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n");
|
|
|
5965 POP_FAILURE_POINT (sdummy, pdummy,
|
|
|
5966 dummy_low_reg, dummy_high_reg,
|
|
|
5967 reg_dummy, reg_dummy, reg_info_dummy);
|
|
|
5968 }
|
|
|
5969 /* Note fall through. */
|
|
|
5970
|
|
|
5971
|
|
|
5972 /* Unconditionally jump (without popping any failure points). */
|
|
|
5973 case jump:
|
|
|
5974 unconditional_jump:
|
|
|
5975 EXTRACT_NUMBER_AND_INCR (mcnt, p); /* Get the amount to jump. */
|
|
|
5976 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt);
|
|
|
5977 p += mcnt; /* Do the jump. */
|
|
|
5978 DEBUG_PRINT2 ("(to 0x%lx).\n", (long) p);
|
|
|
5979 break;
|
|
|
5980
|
|
|
5981
|
|
|
5982 /* We need this opcode so we can detect where alternatives end
|
|
|
5983 in `group_match_null_string_p' et al. */
|
|
|
5984 case jump_past_alt:
|
|
|
5985 DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n");
|
|
|
5986 goto unconditional_jump;
|
|
|
5987
|
|
|
5988
|
|
|
5989 /* Normally, the on_failure_jump pushes a failure point, which
|
|
|
5990 then gets popped at pop_failure_jump. We will end up at
|
|
|
5991 pop_failure_jump, also, and with a pattern of, say, `a+', we
|
|
|
5992 are skipping over the on_failure_jump, so we have to push
|
|
|
5993 something meaningless for pop_failure_jump to pop. */
|
|
|
5994 case dummy_failure_jump:
|
|
|
5995 DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n");
|
|
|
5996 /* It doesn't matter what we push for the string here. What
|
|
|
5997 the code at `fail' tests is the value for the pattern. */
|
|
446
|
5998 PUSH_FAILURE_POINT ((unsigned char *) 0, (unsigned char *) 0, -2);
|
|
428
|
5999 goto unconditional_jump;
|
|
|
6000
|
|
|
6001
|
|
|
6002 /* At the end of an alternative, we need to push a dummy failure
|
|
|
6003 point in case we are followed by a `pop_failure_jump', because
|
|
|
6004 we don't want the failure point for the alternative to be
|
|
|
6005 popped. For example, matching `(a|ab)*' against `aab'
|
|
|
6006 requires that we match the `ab' alternative. */
|
|
|
6007 case push_dummy_failure:
|
|
|
6008 DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n");
|
|
|
6009 /* See comments just above at `dummy_failure_jump' about the
|
|
|
6010 two zeroes. */
|
|
446
|
6011 PUSH_FAILURE_POINT ((unsigned char *) 0, (unsigned char *) 0, -2);
|
|
428
|
6012 break;
|
|
|
6013
|
|
|
6014 /* Have to succeed matching what follows at least n times.
|
|
|
6015 After that, handle like `on_failure_jump'. */
|
|
|
6016 case succeed_n:
|
|
|
6017 EXTRACT_NUMBER (mcnt, p + 2);
|
|
|
6018 DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt);
|
|
|
6019
|
|
|
6020 assert (mcnt >= 0);
|
|
|
6021 /* Originally, this is how many times we HAVE to succeed. */
|
|
|
6022 if (mcnt > 0)
|
|
|
6023 {
|
|
|
6024 mcnt--;
|
|
|
6025 p += 2;
|
|
|
6026 STORE_NUMBER_AND_INCR (p, mcnt);
|
|
|
6027 DEBUG_PRINT3 (" Setting 0x%lx to %d.\n", (long) p, mcnt);
|
|
|
6028 }
|
|
|
6029 else if (mcnt == 0)
|
|
|
6030 {
|
|
|
6031 DEBUG_PRINT2 (" Setting two bytes from 0x%lx to no_op.\n",
|
|
|
6032 (long) (p+2));
|
|
|
6033 p[2] = (unsigned char) no_op;
|
|
|
6034 p[3] = (unsigned char) no_op;
|
|
|
6035 goto on_failure;
|
|
|
6036 }
|
|
|
6037 break;
|
|
|
6038
|
|
|
6039 case jump_n:
|
|
|
6040 EXTRACT_NUMBER (mcnt, p + 2);
|
|
|
6041 DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt);
|
|
|
6042
|
|
|
6043 /* Originally, this is how many times we CAN jump. */
|
|
|
6044 if (mcnt)
|
|
|
6045 {
|
|
|
6046 mcnt--;
|
|
|
6047 STORE_NUMBER (p + 2, mcnt);
|
|
|
6048 goto unconditional_jump;
|
|
|
6049 }
|
|
|
6050 /* If don't have to jump any more, skip over the rest of command. */
|
|
|
6051 else
|
|
|
6052 p += 4;
|
|
|
6053 break;
|
|
|
6054
|
|
|
6055 case set_number_at:
|
|
|
6056 {
|
|
|
6057 DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
|
|
|
6058
|
|
|
6059 EXTRACT_NUMBER_AND_INCR (mcnt, p);
|
|
|
6060 p1 = p + mcnt;
|
|
|
6061 EXTRACT_NUMBER_AND_INCR (mcnt, p);
|
|
|
6062 DEBUG_PRINT3 (" Setting 0x%lx to %d.\n", (long) p1, mcnt);
|
|
|
6063 STORE_NUMBER (p1, mcnt);
|
|
|
6064 break;
|
|
|
6065 }
|
|
|
6066
|
|
|
6067 case wordbound:
|
|
|
6068 DEBUG_PRINT1 ("EXECUTING wordbound.\n");
|
|
|
6069 should_succeed = 1;
|
|
|
6070 matchwordbound:
|
|
|
6071 {
|
|
|
6072 /* XEmacs change */
|
|
1377
|
6073 /* Straightforward and (I hope) correct implementation.
|
|
|
6074 Probably should be optimized by arranging to compute
|
|
1497
|
6075 charpos only once. */
|
|
1377
|
6076 /* emch1 is the character before d, syn1 is the syntax of
|
|
|
6077 emch1, emch2 is the character at d, and syn2 is the
|
|
|
6078 syntax of emch2. */
|
|
|
6079 Ichar emch1, emch2;
|
|
1468
|
6080 int syn1 = 0,
|
|
|
6081 syn2 = 0;
|
|
1377
|
6082 re_char *d_before, *d_after;
|
|
|
6083 int result,
|
|
|
6084 at_beg = AT_STRINGS_BEG (d),
|
|
|
6085 at_end = AT_STRINGS_END (d);
|
|
|
6086 #ifdef emacs
|
|
1497
|
6087 Charxpos charpos;
|
|
1377
|
6088 #endif
|
|
|
6089
|
|
|
6090 if (at_beg && at_end)
|
|
|
6091 {
|
|
|
6092 result = 0;
|
|
|
6093 }
|
|
428
|
6094 else
|
|
|
6095 {
|
|
1377
|
6096 if (!at_beg)
|
|
|
6097 {
|
|
|
6098 d_before = POS_BEFORE_GAP_UNSAFE (d);
|
|
|
6099 DEC_IBYTEPTR_FMT (d_before, fmt);
|
|
|
6100 emch1 = itext_ichar_fmt (d_before, fmt, lispobj);
|
|
460
|
6101 #ifdef emacs
|
|
1497
|
6102 charpos = offset_to_charxpos (lispobj,
|
|
|
6103 PTR_TO_OFFSET (d)) - 1;
|
|
1377
|
6104 BEGIN_REGEX_MALLOC_OK ();
|
|
1497
|
6105 UPDATE_SYNTAX_CACHE (scache, charpos);
|
|
460
|
6106 #endif
|
|
1377
|
6107 syn1 = SYNTAX_FROM_CACHE (scache, emch1);
|
|
|
6108 END_REGEX_MALLOC_OK ();
|
|
|
6109 }
|
|
|
6110 if (!at_end)
|
|
|
6111 {
|
|
|
6112 d_after = POS_AFTER_GAP_UNSAFE (d);
|
|
|
6113 emch2 = itext_ichar_fmt (d_after, fmt, lispobj);
|
|
460
|
6114 #ifdef emacs
|
|
1497
|
6115 charpos = offset_to_charxpos (lispobj, PTR_TO_OFFSET (d));
|
|
1377
|
6116 BEGIN_REGEX_MALLOC_OK ();
|
|
1497
|
6117 UPDATE_SYNTAX_CACHE_FORWARD (scache, charpos);
|
|
460
|
6118 #endif
|
|
1377
|
6119 syn2 = SYNTAX_FROM_CACHE (scache, emch2);
|
|
|
6120 END_REGEX_MALLOC_OK ();
|
|
|
6121 }
|
|
1333
|
6122 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
1377
|
6123
|
|
|
6124 if (at_beg)
|
|
|
6125 result = (syn2 == Sword);
|
|
|
6126 else if (at_end)
|
|
|
6127 result = (syn1 == Sword);
|
|
|
6128 else
|
|
|
6129 result = ((syn1 == Sword) != (syn2 == Sword));
|
|
428
|
6130 }
|
|
1377
|
6131
|
|
428
|
6132 if (result == should_succeed)
|
|
|
6133 break;
|
|
|
6134 goto fail;
|
|
|
6135 }
|
|
|
6136
|
|
|
6137 case notwordbound:
|
|
|
6138 DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
|
|
|
6139 should_succeed = 0;
|
|
|
6140 goto matchwordbound;
|
|
|
6141
|
|
|
6142 case wordbeg:
|
|
|
6143 DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
|
|
460
|
6144 if (AT_STRINGS_END (d))
|
|
|
6145 goto fail;
|
|
428
|
6146 {
|
|
|
6147 /* XEmacs: this originally read:
|
|
|
6148
|
|
|
6149 if (WORDCHAR_P (d) && (AT_STRINGS_BEG (d) || !WORDCHAR_P (d - 1)))
|
|
|
6150 break;
|
|
|
6151
|
|
|
6152 */
|
|
460
|
6153 re_char *dtmp = POS_AFTER_GAP_UNSAFE (d);
|
|
867
|
6154 Ichar emch = itext_ichar_fmt (dtmp, fmt, lispobj);
|
|
1333
|
6155 int tempres;
|
|
1347
|
6156 #ifdef emacs
|
|
|
6157 Charxpos charpos = offset_to_charxpos (lispobj, PTR_TO_OFFSET (d));
|
|
|
6158 #endif
|
|
1333
|
6159 BEGIN_REGEX_MALLOC_OK ();
|
|
460
|
6160 #ifdef emacs
|
|
826
|
6161 UPDATE_SYNTAX_CACHE (scache, charpos);
|
|
460
|
6162 #endif
|
|
1333
|
6163 tempres = (SYNTAX_FROM_CACHE (scache, emch) != Sword);
|
|
|
6164 END_REGEX_MALLOC_OK ();
|
|
|
6165 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
|
6166 if (tempres)
|
|
428
|
6167 goto fail;
|
|
|
6168 if (AT_STRINGS_BEG (d))
|
|
|
6169 break;
|
|
460
|
6170 dtmp = POS_BEFORE_GAP_UNSAFE (d);
|
|
867
|
6171 DEC_IBYTEPTR_FMT (dtmp, fmt);
|
|
|
6172 emch = itext_ichar_fmt (dtmp, fmt, lispobj);
|
|
1333
|
6173 BEGIN_REGEX_MALLOC_OK ();
|
|
460
|
6174 #ifdef emacs
|
|
826
|
6175 UPDATE_SYNTAX_CACHE_BACKWARD (scache, charpos - 1);
|
|
460
|
6176 #endif
|
|
1333
|
6177 tempres = (SYNTAX_FROM_CACHE (scache, emch) != Sword);
|
|
|
6178 END_REGEX_MALLOC_OK ();
|
|
|
6179 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
|
6180 if (tempres)
|
|
428
|
6181 break;
|
|
|
6182 goto fail;
|
|
|
6183 }
|
|
|
6184
|
|
|
6185 case wordend:
|
|
|
6186 DEBUG_PRINT1 ("EXECUTING wordend.\n");
|
|
460
|
6187 if (AT_STRINGS_BEG (d))
|
|
|
6188 goto fail;
|
|
428
|
6189 {
|
|
|
6190 /* XEmacs: this originally read:
|
|
|
6191
|
|
|
6192 if (!AT_STRINGS_BEG (d) && WORDCHAR_P (d - 1)
|
|
|
6193 && (!WORDCHAR_P (d) || AT_STRINGS_END (d)))
|
|
|
6194 break;
|
|
|
6195
|
|
|
6196 The or condition is incorrect (reversed).
|
|
|
6197 */
|
|
460
|
6198 re_char *dtmp;
|
|
867
|
6199 Ichar emch;
|
|
1333
|
6200 int tempres;
|
|
460
|
6201 #ifdef emacs
|
|
826
|
6202 Charxpos charpos = offset_to_charxpos (lispobj, PTR_TO_OFFSET (d));
|
|
1347
|
6203 BEGIN_REGEX_MALLOC_OK ();
|
|
826
|
6204 UPDATE_SYNTAX_CACHE (scache, charpos);
|
|
1333
|
6205 END_REGEX_MALLOC_OK ();
|
|
|
6206 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
1347
|
6207 #endif
|
|
460
|
6208 dtmp = POS_BEFORE_GAP_UNSAFE (d);
|
|
867
|
6209 DEC_IBYTEPTR_FMT (dtmp, fmt);
|
|
|
6210 emch = itext_ichar_fmt (dtmp, fmt, lispobj);
|
|
1333
|
6211 BEGIN_REGEX_MALLOC_OK ();
|
|
|
6212 tempres = (SYNTAX_FROM_CACHE (scache, emch) != Sword);
|
|
|
6213 END_REGEX_MALLOC_OK ();
|
|
|
6214 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
|
6215 if (tempres)
|
|
428
|
6216 goto fail;
|
|
|
6217 if (AT_STRINGS_END (d))
|
|
|
6218 break;
|
|
460
|
6219 dtmp = POS_AFTER_GAP_UNSAFE (d);
|
|
867
|
6220 emch = itext_ichar_fmt (dtmp, fmt, lispobj);
|
|
1333
|
6221 BEGIN_REGEX_MALLOC_OK ();
|
|
460
|
6222 #ifdef emacs
|
|
826
|
6223 UPDATE_SYNTAX_CACHE_FORWARD (scache, charpos + 1);
|
|
460
|
6224 #endif
|
|
1333
|
6225 tempres = (SYNTAX_FROM_CACHE (scache, emch) != Sword);
|
|
|
6226 END_REGEX_MALLOC_OK ();
|
|
|
6227 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
|
6228 if (tempres)
|
|
428
|
6229 break;
|
|
|
6230 goto fail;
|
|
|
6231 }
|
|
|
6232
|
|
|
6233 #ifdef emacs
|
|
|
6234 case before_dot:
|
|
|
6235 DEBUG_PRINT1 ("EXECUTING before_dot.\n");
|
|
826
|
6236 if (!BUFFERP (lispobj)
|
|
|
6237 || (BUF_PTR_BYTE_POS (XBUFFER (lispobj), (unsigned char *) d)
|
|
|
6238 >= BUF_PT (XBUFFER (lispobj))))
|
|
428
|
6239 goto fail;
|
|
|
6240 break;
|
|
|
6241
|
|
|
6242 case at_dot:
|
|
|
6243 DEBUG_PRINT1 ("EXECUTING at_dot.\n");
|
|
826
|
6244 if (!BUFFERP (lispobj)
|
|
|
6245 || (BUF_PTR_BYTE_POS (XBUFFER (lispobj), (unsigned char *) d)
|
|
|
6246 != BUF_PT (XBUFFER (lispobj))))
|
|
428
|
6247 goto fail;
|
|
|
6248 break;
|
|
|
6249
|
|
|
6250 case after_dot:
|
|
|
6251 DEBUG_PRINT1 ("EXECUTING after_dot.\n");
|
|
826
|
6252 if (!BUFFERP (lispobj)
|
|
|
6253 || (BUF_PTR_BYTE_POS (XBUFFER (lispobj), (unsigned char *) d)
|
|
|
6254 <= BUF_PT (XBUFFER (lispobj))))
|
|
428
|
6255 goto fail;
|
|
|
6256 break;
|
|
|
6257
|
|
|
6258 case syntaxspec:
|
|
|
6259 DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt);
|
|
|
6260 mcnt = *p++;
|
|
|
6261 goto matchsyntax;
|
|
|
6262
|
|
|
6263 case wordchar:
|
|
|
6264 DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n");
|
|
|
6265 mcnt = (int) Sword;
|
|
|
6266 matchsyntax:
|
|
|
6267 should_succeed = 1;
|
|
|
6268 matchornotsyntax:
|
|
|
6269 {
|
|
|
6270 int matches;
|
|
867
|
6271 Ichar emch;
|
|
428
|
6272
|
|
450
|
6273 REGEX_PREFETCH ();
|
|
1333
|
6274 BEGIN_REGEX_MALLOC_OK ();
|
|
826
|
6275 UPDATE_SYNTAX_CACHE
|
|
|
6276 (scache, offset_to_charxpos (lispobj, PTR_TO_OFFSET (d)));
|
|
1333
|
6277 END_REGEX_MALLOC_OK ();
|
|
|
6278 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
826
|
6279
|
|
867
|
6280 emch = itext_ichar_fmt (d, fmt, lispobj);
|
|
1333
|
6281 BEGIN_REGEX_MALLOC_OK ();
|
|
826
|
6282 matches = (SYNTAX_FROM_CACHE (scache, emch) ==
|
|
|
6283 (enum syntaxcode) mcnt);
|
|
1333
|
6284 END_REGEX_MALLOC_OK ();
|
|
|
6285 RE_MATCH_RELOCATE_MOVEABLE_DATA_POINTERS ();
|
|
867
|
6286 INC_IBYTEPTR_FMT (d, fmt);
|
|
428
|
6287 if (matches != should_succeed)
|
|
|
6288 goto fail;
|
|
|
6289 SET_REGS_MATCHED ();
|
|
|
6290 }
|
|
|
6291 break;
|
|
|
6292
|
|
|
6293 case notsyntaxspec:
|
|
|
6294 DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt);
|
|
|
6295 mcnt = *p++;
|
|
|
6296 goto matchnotsyntax;
|
|
|
6297
|
|
|
6298 case notwordchar:
|
|
|
6299 DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n");
|
|
|
6300 mcnt = (int) Sword;
|
|
|
6301 matchnotsyntax:
|
|
|
6302 should_succeed = 0;
|
|
|
6303 goto matchornotsyntax;
|
|
|
6304
|
|
|
6305 #ifdef MULE
|
|
|
6306 /* 97/2/17 jhod Mule category code patch */
|
|
|
6307 case categoryspec:
|
|
|
6308 should_succeed = 1;
|
|
|
6309 matchornotcategory:
|
|
|
6310 {
|
|
867
|
6311 Ichar emch;
|
|
428
|
6312
|
|
|
6313 mcnt = *p++;
|
|
450
|
6314 REGEX_PREFETCH ();
|
|
867
|
6315 emch = itext_ichar_fmt (d, fmt, lispobj);
|
|
|
6316 INC_IBYTEPTR_FMT (d, fmt);
|
|
826
|
6317 if (check_category_char (emch, BUFFER_CATEGORY_TABLE (lispbuf),
|
|
|
6318 mcnt, should_succeed))
|
|
428
|
6319 goto fail;
|
|
|
6320 SET_REGS_MATCHED ();
|
|
|
6321 }
|
|
|
6322 break;
|
|
|
6323
|
|
|
6324 case notcategoryspec:
|
|
|
6325 should_succeed = 0;
|
|
|
6326 goto matchornotcategory;
|
|
|
6327 /* end of category patch */
|
|
|
6328 #endif /* MULE */
|
|
|
6329 #else /* not emacs */
|
|
|
6330 case wordchar:
|
|
|
6331 DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n");
|
|
450
|
6332 REGEX_PREFETCH ();
|
|
826
|
6333 if (!WORDCHAR_P ((int) (*d)))
|
|
428
|
6334 goto fail;
|
|
|
6335 SET_REGS_MATCHED ();
|
|
|
6336 d++;
|
|
|
6337 break;
|
|
|
6338
|
|
|
6339 case notwordchar:
|
|
|
6340 DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n");
|
|
450
|
6341 REGEX_PREFETCH ();
|
|
826
|
6342 if (!WORDCHAR_P ((int) (*d)))
|
|
428
|
6343 goto fail;
|
|
|
6344 SET_REGS_MATCHED ();
|
|
|
6345 d++;
|
|
|
6346 break;
|
|
446
|
6347 #endif /* emacs */
|
|
428
|
6348
|
|
|
6349 default:
|
|
|
6350 abort ();
|
|
|
6351 }
|
|
|
6352 continue; /* Successfully executed one pattern command; keep going. */
|
|
|
6353
|
|
|
6354
|
|
|
6355 /* We goto here if a matching operation fails. */
|
|
|
6356 fail:
|
|
|
6357 if (!FAIL_STACK_EMPTY ())
|
|
|
6358 { /* A restart point is known. Restore to that state. */
|
|
|
6359 DEBUG_PRINT1 ("\nFAIL:\n");
|
|
|
6360 POP_FAILURE_POINT (d, p,
|
|
|
6361 lowest_active_reg, highest_active_reg,
|
|
|
6362 regstart, regend, reg_info);
|
|
|
6363
|
|
|
6364 /* If this failure point is a dummy, try the next one. */
|
|
|
6365 if (!p)
|
|
|
6366 goto fail;
|
|
|
6367
|
|
|
6368 /* If we failed to the end of the pattern, don't examine *p. */
|
|
|
6369 assert (p <= pend);
|
|
|
6370 if (p < pend)
|
|
|
6371 {
|
|
460
|
6372 re_bool is_a_jump_n = false;
|
|
428
|
6373
|
|
|
6374 /* If failed to a backwards jump that's part of a repetition
|
|
|
6375 loop, need to pop this failure point and use the next one. */
|
|
|
6376 switch ((re_opcode_t) *p)
|
|
|
6377 {
|
|
|
6378 case jump_n:
|
|
|
6379 is_a_jump_n = true;
|
|
|
6380 case maybe_pop_jump:
|
|
|
6381 case pop_failure_jump:
|
|
|
6382 case jump:
|
|
|
6383 p1 = p + 1;
|
|
|
6384 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6385 p1 += mcnt;
|
|
|
6386
|
|
|
6387 if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n)
|
|
|
6388 || (!is_a_jump_n
|
|
|
6389 && (re_opcode_t) *p1 == on_failure_jump))
|
|
|
6390 goto fail;
|
|
|
6391 break;
|
|
|
6392 default:
|
|
|
6393 /* do nothing */ ;
|
|
|
6394 }
|
|
|
6395 }
|
|
|
6396
|
|
|
6397 if (d >= string1 && d <= end1)
|
|
|
6398 dend = end_match_1;
|
|
|
6399 }
|
|
|
6400 else
|
|
|
6401 break; /* Matching at this starting point really fails. */
|
|
|
6402 } /* for (;;) */
|
|
|
6403
|
|
|
6404 if (best_regs_set)
|
|
|
6405 goto restore_best_regs;
|
|
|
6406
|
|
|
6407 FREE_VARIABLES ();
|
|
|
6408
|
|
|
6409 return -1; /* Failure to match. */
|
|
1333
|
6410 } /* re_match_2_internal */
|
|
428
|
6411
|
|
|
6412 /* Subroutine definitions for re_match_2. */
|
|
|
6413
|
|
|
6414
|
|
|
6415 /* We are passed P pointing to a register number after a start_memory.
|
|
|
6416
|
|
|
6417 Return true if the pattern up to the corresponding stop_memory can
|
|
|
6418 match the empty string, and false otherwise.
|
|
|
6419
|
|
|
6420 If we find the matching stop_memory, sets P to point to one past its number.
|
|
|
6421 Otherwise, sets P to an undefined byte less than or equal to END.
|
|
|
6422
|
|
|
6423 We don't handle duplicates properly (yet). */
|
|
|
6424
|
|
460
|
6425 static re_bool
|
|
428
|
6426 group_match_null_string_p (unsigned char **p, unsigned char *end,
|
|
|
6427 register_info_type *reg_info)
|
|
|
6428 {
|
|
|
6429 int mcnt;
|
|
|
6430 /* Point to after the args to the start_memory. */
|
|
|
6431 unsigned char *p1 = *p + 2;
|
|
|
6432
|
|
|
6433 while (p1 < end)
|
|
|
6434 {
|
|
|
6435 /* Skip over opcodes that can match nothing, and return true or
|
|
|
6436 false, as appropriate, when we get to one that can't, or to the
|
|
|
6437 matching stop_memory. */
|
|
|
6438
|
|
|
6439 switch ((re_opcode_t) *p1)
|
|
|
6440 {
|
|
|
6441 /* Could be either a loop or a series of alternatives. */
|
|
|
6442 case on_failure_jump:
|
|
|
6443 p1++;
|
|
|
6444 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6445
|
|
|
6446 /* If the next operation is not a jump backwards in the
|
|
|
6447 pattern. */
|
|
|
6448
|
|
|
6449 if (mcnt >= 0)
|
|
|
6450 {
|
|
|
6451 /* Go through the on_failure_jumps of the alternatives,
|
|
|
6452 seeing if any of the alternatives cannot match nothing.
|
|
|
6453 The last alternative starts with only a jump,
|
|
|
6454 whereas the rest start with on_failure_jump and end
|
|
|
6455 with a jump, e.g., here is the pattern for `a|b|c':
|
|
|
6456
|
|
|
6457 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6
|
|
|
6458 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3
|
|
|
6459 /exactn/1/c
|
|
|
6460
|
|
|
6461 So, we have to first go through the first (n-1)
|
|
|
6462 alternatives and then deal with the last one separately. */
|
|
|
6463
|
|
|
6464
|
|
|
6465 /* Deal with the first (n-1) alternatives, which start
|
|
|
6466 with an on_failure_jump (see above) that jumps to right
|
|
|
6467 past a jump_past_alt. */
|
|
|
6468
|
|
|
6469 while ((re_opcode_t) p1[mcnt-3] == jump_past_alt)
|
|
|
6470 {
|
|
|
6471 /* `mcnt' holds how many bytes long the alternative
|
|
|
6472 is, including the ending `jump_past_alt' and
|
|
|
6473 its number. */
|
|
|
6474
|
|
|
6475 if (!alt_match_null_string_p (p1, p1 + mcnt - 3,
|
|
|
6476 reg_info))
|
|
|
6477 return false;
|
|
|
6478
|
|
|
6479 /* Move to right after this alternative, including the
|
|
|
6480 jump_past_alt. */
|
|
|
6481 p1 += mcnt;
|
|
|
6482
|
|
|
6483 /* Break if it's the beginning of an n-th alternative
|
|
|
6484 that doesn't begin with an on_failure_jump. */
|
|
|
6485 if ((re_opcode_t) *p1 != on_failure_jump)
|
|
|
6486 break;
|
|
|
6487
|
|
|
6488 /* Still have to check that it's not an n-th
|
|
|
6489 alternative that starts with an on_failure_jump. */
|
|
|
6490 p1++;
|
|
|
6491 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6492 if ((re_opcode_t) p1[mcnt-3] != jump_past_alt)
|
|
|
6493 {
|
|
|
6494 /* Get to the beginning of the n-th alternative. */
|
|
|
6495 p1 -= 3;
|
|
|
6496 break;
|
|
|
6497 }
|
|
|
6498 }
|
|
|
6499
|
|
|
6500 /* Deal with the last alternative: go back and get number
|
|
|
6501 of the `jump_past_alt' just before it. `mcnt' contains
|
|
|
6502 the length of the alternative. */
|
|
|
6503 EXTRACT_NUMBER (mcnt, p1 - 2);
|
|
|
6504
|
|
|
6505 if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info))
|
|
|
6506 return false;
|
|
|
6507
|
|
|
6508 p1 += mcnt; /* Get past the n-th alternative. */
|
|
|
6509 } /* if mcnt > 0 */
|
|
|
6510 break;
|
|
|
6511
|
|
|
6512
|
|
|
6513 case stop_memory:
|
|
|
6514 assert (p1[1] == **p);
|
|
|
6515 *p = p1 + 2;
|
|
|
6516 return true;
|
|
|
6517
|
|
|
6518
|
|
|
6519 default:
|
|
|
6520 if (!common_op_match_null_string_p (&p1, end, reg_info))
|
|
|
6521 return false;
|
|
|
6522 }
|
|
|
6523 } /* while p1 < end */
|
|
|
6524
|
|
|
6525 return false;
|
|
|
6526 } /* group_match_null_string_p */
|
|
|
6527
|
|
|
6528
|
|
|
6529 /* Similar to group_match_null_string_p, but doesn't deal with alternatives:
|
|
|
6530 It expects P to be the first byte of a single alternative and END one
|
|
|
6531 byte past the last. The alternative can contain groups. */
|
|
|
6532
|
|
460
|
6533 static re_bool
|
|
428
|
6534 alt_match_null_string_p (unsigned char *p, unsigned char *end,
|
|
|
6535 register_info_type *reg_info)
|
|
|
6536 {
|
|
|
6537 int mcnt;
|
|
|
6538 unsigned char *p1 = p;
|
|
|
6539
|
|
|
6540 while (p1 < end)
|
|
|
6541 {
|
|
|
6542 /* Skip over opcodes that can match nothing, and break when we get
|
|
|
6543 to one that can't. */
|
|
|
6544
|
|
|
6545 switch ((re_opcode_t) *p1)
|
|
|
6546 {
|
|
|
6547 /* It's a loop. */
|
|
|
6548 case on_failure_jump:
|
|
|
6549 p1++;
|
|
|
6550 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6551 p1 += mcnt;
|
|
|
6552 break;
|
|
|
6553
|
|
|
6554 default:
|
|
|
6555 if (!common_op_match_null_string_p (&p1, end, reg_info))
|
|
|
6556 return false;
|
|
|
6557 }
|
|
|
6558 } /* while p1 < end */
|
|
|
6559
|
|
|
6560 return true;
|
|
|
6561 } /* alt_match_null_string_p */
|
|
|
6562
|
|
|
6563
|
|
|
6564 /* Deals with the ops common to group_match_null_string_p and
|
|
|
6565 alt_match_null_string_p.
|
|
|
6566
|
|
|
6567 Sets P to one after the op and its arguments, if any. */
|
|
|
6568
|
|
460
|
6569 static re_bool
|
|
428
|
6570 common_op_match_null_string_p (unsigned char **p, unsigned char *end,
|
|
|
6571 register_info_type *reg_info)
|
|
|
6572 {
|
|
|
6573 int mcnt;
|
|
460
|
6574 re_bool ret;
|
|
428
|
6575 int reg_no;
|
|
|
6576 unsigned char *p1 = *p;
|
|
|
6577
|
|
|
6578 switch ((re_opcode_t) *p1++)
|
|
|
6579 {
|
|
|
6580 case no_op:
|
|
|
6581 case begline:
|
|
|
6582 case endline:
|
|
|
6583 case begbuf:
|
|
|
6584 case endbuf:
|
|
|
6585 case wordbeg:
|
|
|
6586 case wordend:
|
|
|
6587 case wordbound:
|
|
|
6588 case notwordbound:
|
|
|
6589 #ifdef emacs
|
|
|
6590 case before_dot:
|
|
|
6591 case at_dot:
|
|
|
6592 case after_dot:
|
|
|
6593 #endif
|
|
|
6594 break;
|
|
|
6595
|
|
|
6596 case start_memory:
|
|
|
6597 reg_no = *p1;
|
|
|
6598 assert (reg_no > 0 && reg_no <= MAX_REGNUM);
|
|
|
6599 ret = group_match_null_string_p (&p1, end, reg_info);
|
|
|
6600
|
|
|
6601 /* Have to set this here in case we're checking a group which
|
|
|
6602 contains a group and a back reference to it. */
|
|
|
6603
|
|
|
6604 if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE)
|
|
|
6605 REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret;
|
|
|
6606
|
|
|
6607 if (!ret)
|
|
|
6608 return false;
|
|
|
6609 break;
|
|
|
6610
|
|
|
6611 /* If this is an optimized succeed_n for zero times, make the jump. */
|
|
|
6612 case jump:
|
|
|
6613 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6614 if (mcnt >= 0)
|
|
|
6615 p1 += mcnt;
|
|
|
6616 else
|
|
|
6617 return false;
|
|
|
6618 break;
|
|
|
6619
|
|
|
6620 case succeed_n:
|
|
|
6621 /* Get to the number of times to succeed. */
|
|
|
6622 p1 += 2;
|
|
|
6623 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6624
|
|
|
6625 if (mcnt == 0)
|
|
|
6626 {
|
|
|
6627 p1 -= 4;
|
|
|
6628 EXTRACT_NUMBER_AND_INCR (mcnt, p1);
|
|
|
6629 p1 += mcnt;
|
|
|
6630 }
|
|
|
6631 else
|
|
|
6632 return false;
|
|
|
6633 break;
|
|
|
6634
|
|
|
6635 case duplicate:
|
|
|
6636 if (!REG_MATCH_NULL_STRING_P (reg_info[*p1]))
|
|
|
6637 return false;
|
|
|
6638 break;
|
|
|
6639
|
|
|
6640 case set_number_at:
|
|
|
6641 p1 += 4;
|
|
|
6642
|
|
|
6643 default:
|
|
|
6644 /* All other opcodes mean we cannot match the empty string. */
|
|
|
6645 return false;
|
|
|
6646 }
|
|
|
6647
|
|
|
6648 *p = p1;
|
|
|
6649 return true;
|
|
|
6650 } /* common_op_match_null_string_p */
|
|
|
6651
|
|
|
6652
|
|
|
6653 /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
|
|
|
6654 bytes; nonzero otherwise. */
|
|
|
6655
|
|
|
6656 static int
|
|
446
|
6657 bcmp_translate (re_char *s1, re_char *s2,
|
|
826
|
6658 REGISTER int len, RE_TRANSLATE_TYPE translate
|
|
|
6659 #ifdef emacs
|
|
2333
|
6660 , Internal_Format USED_IF_MULE (fmt),
|
|
|
6661 Lisp_Object USED_IF_MULE (lispobj)
|
|
826
|
6662 #endif
|
|
|
6663 )
|
|
428
|
6664 {
|
|
826
|
6665 REGISTER re_char *p1 = s1, *p2 = s2;
|
|
446
|
6666 #ifdef MULE
|
|
826
|
6667 re_char *p1_end = s1 + len;
|
|
|
6668 re_char *p2_end = s2 + len;
|
|
446
|
6669
|
|
|
6670 while (p1 != p1_end && p2 != p2_end)
|
|
|
6671 {
|
|
867
|
6672 Ichar p1_ch, p2_ch;
|
|
|
6673
|
|
|
6674 p1_ch = itext_ichar_fmt (p1, fmt, lispobj);
|
|
|
6675 p2_ch = itext_ichar_fmt (p2, fmt, lispobj);
|
|
826
|
6676
|
|
|
6677 if (RE_TRANSLATE_1 (p1_ch)
|
|
|
6678 != RE_TRANSLATE_1 (p2_ch))
|
|
446
|
6679 return 1;
|
|
867
|
6680 INC_IBYTEPTR_FMT (p1, fmt);
|
|
|
6681 INC_IBYTEPTR_FMT (p2, fmt);
|
|
446
|
6682 }
|
|
|
6683 #else /* not MULE */
|
|
428
|
6684 while (len)
|
|
|
6685 {
|
|
826
|
6686 if (RE_TRANSLATE_1 (*p1++) != RE_TRANSLATE_1 (*p2++)) return 1;
|
|
428
|
6687 len--;
|
|
|
6688 }
|
|
446
|
6689 #endif /* MULE */
|
|
428
|
6690 return 0;
|
|
|
6691 }
|
|
|
6692
|
|
|
6693 /* Entry points for GNU code. */
|
|
|
6694
|
|
|
6695 /* re_compile_pattern is the GNU regular expression compiler: it
|
|
|
6696 compiles PATTERN (of length SIZE) and puts the result in BUFP.
|
|
|
6697 Returns 0 if the pattern was valid, otherwise an error string.
|
|
|
6698
|
|
|
6699 Assumes the `allocated' (and perhaps `buffer') and `translate' fields
|
|
|
6700 are set in BUFP on entry.
|
|
|
6701
|
|
|
6702 We call regex_compile to do the actual compilation. */
|
|
|
6703
|
|
442
|
6704 const char *
|
|
|
6705 re_compile_pattern (const char *pattern, int length,
|
|
428
|
6706 struct re_pattern_buffer *bufp)
|
|
|
6707 {
|
|
|
6708 reg_errcode_t ret;
|
|
|
6709
|
|
|
6710 /* GNU code is written to assume at least RE_NREGS registers will be set
|
|
|
6711 (and at least one extra will be -1). */
|
|
|
6712 bufp->regs_allocated = REGS_UNALLOCATED;
|
|
|
6713
|
|
|
6714 /* And GNU code determines whether or not to get register information
|
|
|
6715 by passing null for the REGS argument to re_match, etc., not by
|
|
|
6716 setting no_sub. */
|
|
|
6717 bufp->no_sub = 0;
|
|
|
6718
|
|
|
6719 /* Match anchors at newline. */
|
|
|
6720 bufp->newline_anchor = 1;
|
|
|
6721
|
|
826
|
6722 ret = regex_compile ((unsigned char *) pattern, length, re_syntax_options,
|
|
|
6723 bufp);
|
|
428
|
6724
|
|
|
6725 if (!ret)
|
|
|
6726 return NULL;
|
|
|
6727 return gettext (re_error_msgid[(int) ret]);
|
|
|
6728 }
|
|
|
6729
|
|
|
6730 /* Entry points compatible with 4.2 BSD regex library. We don't define
|
|
|
6731 them unless specifically requested. */
|
|
|
6732
|
|
|
6733 #ifdef _REGEX_RE_COMP
|
|
|
6734
|
|
|
6735 /* BSD has one and only one pattern buffer. */
|
|
|
6736 static struct re_pattern_buffer re_comp_buf;
|
|
|
6737
|
|
|
6738 char *
|
|
442
|
6739 re_comp (const char *s)
|
|
428
|
6740 {
|
|
|
6741 reg_errcode_t ret;
|
|
|
6742
|
|
|
6743 if (!s)
|
|
|
6744 {
|
|
|
6745 if (!re_comp_buf.buffer)
|
|
|
6746 return gettext ("No previous regular expression");
|
|
|
6747 return 0;
|
|
|
6748 }
|
|
|
6749
|
|
|
6750 if (!re_comp_buf.buffer)
|
|
|
6751 {
|
|
1333
|
6752 re_comp_buf.buffer = (unsigned char *) xmalloc (200);
|
|
428
|
6753 if (re_comp_buf.buffer == NULL)
|
|
|
6754 return gettext (re_error_msgid[(int) REG_ESPACE]);
|
|
|
6755 re_comp_buf.allocated = 200;
|
|
|
6756
|
|
1333
|
6757 re_comp_buf.fastmap = (char *) xmalloc (1 << BYTEWIDTH);
|
|
428
|
6758 if (re_comp_buf.fastmap == NULL)
|
|
|
6759 return gettext (re_error_msgid[(int) REG_ESPACE]);
|
|
|
6760 }
|
|
|
6761
|
|
|
6762 /* Since `re_exec' always passes NULL for the `regs' argument, we
|
|
|
6763 don't need to initialize the pattern buffer fields which affect it. */
|
|
|
6764
|
|
|
6765 /* Match anchors at newlines. */
|
|
|
6766 re_comp_buf.newline_anchor = 1;
|
|
|
6767
|
|
826
|
6768 ret = regex_compile ((unsigned char *)s, strlen (s), re_syntax_options,
|
|
|
6769 &re_comp_buf);
|
|
428
|
6770
|
|
|
6771 if (!ret)
|
|
|
6772 return NULL;
|
|
|
6773
|
|
442
|
6774 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
|
|
428
|
6775 return (char *) gettext (re_error_msgid[(int) ret]);
|
|
|
6776 }
|
|
|
6777
|
|
|
6778
|
|
|
6779 int
|
|
442
|
6780 re_exec (const char *s)
|
|
428
|
6781 {
|
|
442
|
6782 const int len = strlen (s);
|
|
428
|
6783 return
|
|
|
6784 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
|
|
|
6785 }
|
|
|
6786 #endif /* _REGEX_RE_COMP */
|
|
|
6787
|
|
|
6788 /* POSIX.2 functions. Don't define these for Emacs. */
|
|
|
6789
|
|
|
6790 #ifndef emacs
|
|
|
6791
|
|
|
6792 /* regcomp takes a regular expression as a string and compiles it.
|
|
|
6793
|
|
|
6794 PREG is a regex_t *. We do not expect any fields to be initialized,
|
|
|
6795 since POSIX says we shouldn't. Thus, we set
|
|
|
6796
|
|
|
6797 `buffer' to the compiled pattern;
|
|
|
6798 `used' to the length of the compiled pattern;
|
|
|
6799 `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
|
|
|
6800 REG_EXTENDED bit in CFLAGS is set; otherwise, to
|
|
|
6801 RE_SYNTAX_POSIX_BASIC;
|
|
|
6802 `newline_anchor' to REG_NEWLINE being set in CFLAGS;
|
|
|
6803 `fastmap' and `fastmap_accurate' to zero;
|
|
|
6804 `re_nsub' to the number of subexpressions in PATTERN.
|
|
502
|
6805 (non-shy of course. POSIX probably doesn't know about
|
|
|
6806 shy ones, and in any case they should be invisible.)
|
|
428
|
6807
|
|
|
6808 PATTERN is the address of the pattern string.
|
|
|
6809
|
|
|
6810 CFLAGS is a series of bits which affect compilation.
|
|
|
6811
|
|
|
6812 If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
|
|
|
6813 use POSIX basic syntax.
|
|
|
6814
|
|
|
6815 If REG_NEWLINE is set, then . and [^...] don't match newline.
|
|
|
6816 Also, regexec will try a match beginning after every newline.
|
|
|
6817
|
|
|
6818 If REG_ICASE is set, then we considers upper- and lowercase
|
|
|
6819 versions of letters to be equivalent when matching.
|
|
|
6820
|
|
|
6821 If REG_NOSUB is set, then when PREG is passed to regexec, that
|
|
|
6822 routine will report only success or failure, and nothing about the
|
|
|
6823 registers.
|
|
|
6824
|
|
|
6825 It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for
|
|
|
6826 the return codes and their meanings.) */
|
|
|
6827
|
|
|
6828 int
|
|
442
|
6829 regcomp (regex_t *preg, const char *pattern, int cflags)
|
|
428
|
6830 {
|
|
|
6831 reg_errcode_t ret;
|
|
647
|
6832 unsigned int syntax
|
|
428
|
6833 = (cflags & REG_EXTENDED) ?
|
|
|
6834 RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC;
|
|
|
6835
|
|
|
6836 /* regex_compile will allocate the space for the compiled pattern. */
|
|
|
6837 preg->buffer = 0;
|
|
|
6838 preg->allocated = 0;
|
|
|
6839 preg->used = 0;
|
|
|
6840
|
|
|
6841 /* Don't bother to use a fastmap when searching. This simplifies the
|
|
|
6842 REG_NEWLINE case: if we used a fastmap, we'd have to put all the
|
|
|
6843 characters after newlines into the fastmap. This way, we just try
|
|
|
6844 every character. */
|
|
|
6845 preg->fastmap = 0;
|
|
|
6846
|
|
|
6847 if (cflags & REG_ICASE)
|
|
|
6848 {
|
|
647
|
6849 int i;
|
|
428
|
6850
|
|
1333
|
6851 preg->translate = (char *) xmalloc (CHAR_SET_SIZE);
|
|
428
|
6852 if (preg->translate == NULL)
|
|
|
6853 return (int) REG_ESPACE;
|
|
|
6854
|
|
|
6855 /* Map uppercase characters to corresponding lowercase ones. */
|
|
|
6856 for (i = 0; i < CHAR_SET_SIZE; i++)
|
|
|
6857 preg->translate[i] = ISUPPER (i) ? tolower (i) : i;
|
|
|
6858 }
|
|
|
6859 else
|
|
|
6860 preg->translate = NULL;
|
|
|
6861
|
|
|
6862 /* If REG_NEWLINE is set, newlines are treated differently. */
|
|
|
6863 if (cflags & REG_NEWLINE)
|
|
|
6864 { /* REG_NEWLINE implies neither . nor [^...] match newline. */
|
|
|
6865 syntax &= ~RE_DOT_NEWLINE;
|
|
|
6866 syntax |= RE_HAT_LISTS_NOT_NEWLINE;
|
|
|
6867 /* It also changes the matching behavior. */
|
|
|
6868 preg->newline_anchor = 1;
|
|
|
6869 }
|
|
|
6870 else
|
|
|
6871 preg->newline_anchor = 0;
|
|
|
6872
|
|
|
6873 preg->no_sub = !!(cflags & REG_NOSUB);
|
|
|
6874
|
|
|
6875 /* POSIX says a null character in the pattern terminates it, so we
|
|
|
6876 can use strlen here in compiling the pattern. */
|
|
446
|
6877 ret = regex_compile ((unsigned char *) pattern, strlen (pattern), syntax, preg);
|
|
428
|
6878
|
|
|
6879 /* POSIX doesn't distinguish between an unmatched open-group and an
|
|
|
6880 unmatched close-group: both are REG_EPAREN. */
|
|
|
6881 if (ret == REG_ERPAREN) ret = REG_EPAREN;
|
|
|
6882
|
|
|
6883 return (int) ret;
|
|
|
6884 }
|
|
|
6885
|
|
|
6886
|
|
|
6887 /* regexec searches for a given pattern, specified by PREG, in the
|
|
|
6888 string STRING.
|
|
|
6889
|
|
|
6890 If NMATCH is zero or REG_NOSUB was set in the cflags argument to
|
|
|
6891 `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at
|
|
|
6892 least NMATCH elements, and we set them to the offsets of the
|
|
|
6893 corresponding matched substrings.
|
|
|
6894
|
|
|
6895 EFLAGS specifies `execution flags' which affect matching: if
|
|
|
6896 REG_NOTBOL is set, then ^ does not match at the beginning of the
|
|
|
6897 string; if REG_NOTEOL is set, then $ does not match at the end.
|
|
|
6898
|
|
|
6899 We return 0 if we find a match and REG_NOMATCH if not. */
|
|
|
6900
|
|
|
6901 int
|
|
442
|
6902 regexec (const regex_t *preg, const char *string, size_t nmatch,
|
|
428
|
6903 regmatch_t pmatch[], int eflags)
|
|
|
6904 {
|
|
|
6905 int ret;
|
|
|
6906 struct re_registers regs;
|
|
|
6907 regex_t private_preg;
|
|
|
6908 int len = strlen (string);
|
|
460
|
6909 re_bool want_reg_info = !preg->no_sub && nmatch > 0;
|
|
428
|
6910
|
|
|
6911 private_preg = *preg;
|
|
|
6912
|
|
|
6913 private_preg.not_bol = !!(eflags & REG_NOTBOL);
|
|
|
6914 private_preg.not_eol = !!(eflags & REG_NOTEOL);
|
|
|
6915
|
|
|
6916 /* The user has told us exactly how many registers to return
|
|
|
6917 information about, via `nmatch'. We have to pass that on to the
|
|
|
6918 matching routines. */
|
|
|
6919 private_preg.regs_allocated = REGS_FIXED;
|
|
|
6920
|
|
|
6921 if (want_reg_info)
|
|
|
6922 {
|
|
647
|
6923 regs.num_regs = (int) nmatch;
|
|
|
6924 regs.start = TALLOC ((int) nmatch, regoff_t);
|
|
|
6925 regs.end = TALLOC ((int) nmatch, regoff_t);
|
|
428
|
6926 if (regs.start == NULL || regs.end == NULL)
|
|
|
6927 return (int) REG_NOMATCH;
|
|
|
6928 }
|
|
|
6929
|
|
|
6930 /* Perform the searching operation. */
|
|
|
6931 ret = re_search (&private_preg, string, len,
|
|
|
6932 /* start: */ 0, /* range: */ len,
|
|
|
6933 want_reg_info ? ®s : (struct re_registers *) 0);
|
|
|
6934
|
|
|
6935 /* Copy the register information to the POSIX structure. */
|
|
|
6936 if (want_reg_info)
|
|
|
6937 {
|
|
|
6938 if (ret >= 0)
|
|
|
6939 {
|
|
647
|
6940 int r;
|
|
|
6941
|
|
|
6942 for (r = 0; r < (int) nmatch; r++)
|
|
428
|
6943 {
|
|
|
6944 pmatch[r].rm_so = regs.start[r];
|
|
|
6945 pmatch[r].rm_eo = regs.end[r];
|
|
|
6946 }
|
|
|
6947 }
|
|
|
6948
|
|
|
6949 /* If we needed the temporary register info, free the space now. */
|
|
1726
|
6950 xfree (regs.start, regoff_t *);
|
|
|
6951 xfree (regs.end, regoff_t *);
|
|
428
|
6952 }
|
|
|
6953
|
|
|
6954 /* We want zero return to mean success, unlike `re_search'. */
|
|
|
6955 return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH;
|
|
|
6956 }
|
|
|
6957
|
|
|
6958
|
|
|
6959 /* Returns a message corresponding to an error code, ERRCODE, returned
|
|
|
6960 from either regcomp or regexec. We don't use PREG here. */
|
|
|
6961
|
|
|
6962 size_t
|
|
2286
|
6963 regerror (int errcode, const regex_t *UNUSED (preg), char *errbuf,
|
|
647
|
6964 size_t errbuf_size)
|
|
428
|
6965 {
|
|
442
|
6966 const char *msg;
|
|
665
|
6967 Bytecount msg_size;
|
|
428
|
6968
|
|
|
6969 if (errcode < 0
|
|
647
|
6970 || errcode >= (int) (sizeof (re_error_msgid) /
|
|
|
6971 sizeof (re_error_msgid[0])))
|
|
428
|
6972 /* Only error codes returned by the rest of the code should be passed
|
|
|
6973 to this routine. If we are given anything else, or if other regex
|
|
|
6974 code generates an invalid error code, then the program has a bug.
|
|
|
6975 Dump core so we can fix it. */
|
|
|
6976 abort ();
|
|
|
6977
|
|
|
6978 msg = gettext (re_error_msgid[errcode]);
|
|
|
6979
|
|
|
6980 msg_size = strlen (msg) + 1; /* Includes the null. */
|
|
|
6981
|
|
|
6982 if (errbuf_size != 0)
|
|
|
6983 {
|
|
665
|
6984 if (msg_size > (Bytecount) errbuf_size)
|
|
428
|
6985 {
|
|
|
6986 strncpy (errbuf, msg, errbuf_size - 1);
|
|
|
6987 errbuf[errbuf_size - 1] = 0;
|
|
|
6988 }
|
|
|
6989 else
|
|
|
6990 strcpy (errbuf, msg);
|
|
|
6991 }
|
|
|
6992
|
|
647
|
6993 return (size_t) msg_size;
|
|
428
|
6994 }
|
|
|
6995
|
|
|
6996
|
|
|
6997 /* Free dynamically allocated space used by PREG. */
|
|
|
6998
|
|
|
6999 void
|
|
|
7000 regfree (regex_t *preg)
|
|
|
7001 {
|
|
|
7002 if (preg->buffer != NULL)
|
|
1726
|
7003 xfree (preg->buffer, unsigned char *);
|
|
428
|
7004 preg->buffer = NULL;
|
|
|
7005
|
|
|
7006 preg->allocated = 0;
|
|
|
7007 preg->used = 0;
|
|
|
7008
|
|
|
7009 if (preg->fastmap != NULL)
|
|
1726
|
7010 xfree (preg->fastmap, char *);
|
|
428
|
7011 preg->fastmap = NULL;
|
|
|
7012 preg->fastmap_accurate = 0;
|
|
|
7013
|
|
|
7014 if (preg->translate != NULL)
|
|
1726
|
7015 xfree (preg->translate, RE_TRANSLATE_TYPE);
|
|
428
|
7016 preg->translate = NULL;
|
|
|
7017 }
|
|
|
7018
|
|
|
7019 #endif /* not emacs */
|
|
|
7020
|
