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