Mercurial > emacs
annotate src/regex.c @ 11464:4921121fbdc0
(set-face-background): Handle FRAME = nil directly
so stipple colors work in that case.
author | Richard M. Stallman <rms@gnu.org> |
---|---|
date | Sun, 16 Apr 1995 04:09:48 +0000 |
parents | 20a91bd7b59d |
children | eba5c25341ff |
rev | line source |
---|---|
1155 | 1 /* Extended regular expression matching and search library, |
2454 | 2 version 0.12. |
1155 | 3 (Implements POSIX draft P10003.2/D11.2, except for |
4 internationalization features.) | |
5 | |
7305
c8787065a00e
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7135
diff
changeset
|
6 Copyright (C) 1993, 1994 Free Software Foundation, Inc. |
1155 | 7 |
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 | |
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
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 | |
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
21 | |
22 /* AIX requires this to be the first thing in the file. */ | |
23 #if defined (_AIX) && !defined (REGEX_MALLOC) | |
24 #pragma alloca | |
25 #endif | |
26 | |
27 #define _GNU_SOURCE | |
28 | |
4846 | 29 #ifdef HAVE_CONFIG_H |
30 #include <config.h> | |
31 #endif | |
32 | |
1155 | 33 /* We need this for `regex.h', and perhaps for the Emacs include files. */ |
34 #include <sys/types.h> | |
35 | |
10100
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
36 /* This is for other GNU distributions with internationalized messages. |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
37 The GNU C Library itself does not yet support such messages. */ |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
38 #if HAVE_LIBINTL_H |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
39 # include <libintl.h> |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
40 #else |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
41 # define gettext(msgid) (msgid) |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
42 #endif |
461530f66e34
(gettext): Make sure this is always defined, even #if emacs.
Karl Heuer <kwzh@gnu.org>
parents:
10090
diff
changeset
|
43 |
1155 | 44 /* The `emacs' switch turns on certain matching commands |
45 that make sense only in Emacs. */ | |
46 #ifdef emacs | |
47 | |
48 #include "lisp.h" | |
49 #include "buffer.h" | |
50 #include "syntax.h" | |
51 | |
52 #else /* not emacs */ | |
53 | |
3766 | 54 #ifdef STDC_HEADERS |
55 #include <stdlib.h> | |
56 #else | |
57 char *malloc (); | |
58 char *realloc (); | |
59 #endif | |
60 | |
61 | |
1155 | 62 /* We used to test for `BSTRING' here, but only GCC and Emacs define |
63 `BSTRING', as far as I know, and neither of them use this code. */ | |
7135 | 64 #ifndef INHIBIT_STRING_HEADER |
1641
47ae0840b2b9
*** empty log message ***
David J. MacKenzie <djm@gnu.org>
parents:
1637
diff
changeset
|
65 #if HAVE_STRING_H || STDC_HEADERS |
1155 | 66 #include <string.h> |
1637 | 67 #ifndef bcmp |
1155 | 68 #define bcmp(s1, s2, n) memcmp ((s1), (s2), (n)) |
1637 | 69 #endif |
70 #ifndef bcopy | |
1155 | 71 #define bcopy(s, d, n) memcpy ((d), (s), (n)) |
1637 | 72 #endif |
73 #ifndef bzero | |
1155 | 74 #define bzero(s, n) memset ((s), 0, (n)) |
1637 | 75 #endif |
1155 | 76 #else |
77 #include <strings.h> | |
78 #endif | |
7135 | 79 #endif |
1155 | 80 |
81 /* Define the syntax stuff for \<, \>, etc. */ | |
82 | |
83 /* This must be nonzero for the wordchar and notwordchar pattern | |
84 commands in re_match_2. */ | |
85 #ifndef Sword | |
86 #define Sword 1 | |
87 #endif | |
88 | |
10456
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
89 #ifdef SWITCH_ENUM_BUG |
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
90 #define SWITCH_ENUM_CAST(x) ((int)(x)) |
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
91 #else |
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
92 #define SWITCH_ENUM_CAST(x) (x) |
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
93 #endif |
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
94 |
1155 | 95 #ifdef SYNTAX_TABLE |
96 | |
97 extern char *re_syntax_table; | |
98 | |
99 #else /* not SYNTAX_TABLE */ | |
100 | |
101 /* How many characters in the character set. */ | |
102 #define CHAR_SET_SIZE 256 | |
103 | |
104 static char re_syntax_table[CHAR_SET_SIZE]; | |
105 | |
106 static void | |
107 init_syntax_once () | |
108 { | |
109 register int c; | |
110 static int done = 0; | |
111 | |
112 if (done) | |
113 return; | |
114 | |
115 bzero (re_syntax_table, sizeof re_syntax_table); | |
116 | |
117 for (c = 'a'; c <= 'z'; c++) | |
118 re_syntax_table[c] = Sword; | |
119 | |
120 for (c = 'A'; c <= 'Z'; c++) | |
121 re_syntax_table[c] = Sword; | |
122 | |
123 for (c = '0'; c <= '9'; c++) | |
124 re_syntax_table[c] = Sword; | |
125 | |
126 re_syntax_table['_'] = Sword; | |
127 | |
128 done = 1; | |
129 } | |
130 | |
131 #endif /* not SYNTAX_TABLE */ | |
132 | |
133 #define SYNTAX(c) re_syntax_table[c] | |
134 | |
135 #endif /* not emacs */ | |
136 | |
137 /* Get the interface, including the syntax bits. */ | |
138 #include "regex.h" | |
139 | |
140 /* isalpha etc. are used for the character classes. */ | |
141 #include <ctype.h> | |
1668 | 142 |
2465 | 143 /* Jim Meyering writes: |
144 | |
145 "... Some ctype macros are valid only for character codes that | |
146 isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when | |
147 using /bin/cc or gcc but without giving an ansi option). So, all | |
148 ctype uses should be through macros like ISPRINT... If | |
149 STDC_HEADERS is defined, then autoconf has verified that the ctype | |
150 macros don't need to be guarded with references to isascii. ... | |
151 Defining isascii to 1 should let any compiler worth its salt | |
152 eliminate the && through constant folding." */ | |
5076 | 153 |
154 #if defined (STDC_HEADERS) || (!defined (isascii) && !defined (HAVE_ISASCII)) | |
155 #define ISASCII(c) 1 | |
156 #else | |
157 #define ISASCII(c) isascii(c) | |
1668 | 158 #endif |
159 | |
160 #ifdef isblank | |
5076 | 161 #define ISBLANK(c) (ISASCII (c) && isblank (c)) |
1668 | 162 #else |
163 #define ISBLANK(c) ((c) == ' ' || (c) == '\t') | |
1155 | 164 #endif |
1668 | 165 #ifdef isgraph |
5076 | 166 #define ISGRAPH(c) (ISASCII (c) && isgraph (c)) |
1668 | 167 #else |
5076 | 168 #define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c)) |
1155 | 169 #endif |
170 | |
5076 | 171 #define ISPRINT(c) (ISASCII (c) && isprint (c)) |
172 #define ISDIGIT(c) (ISASCII (c) && isdigit (c)) | |
173 #define ISALNUM(c) (ISASCII (c) && isalnum (c)) | |
174 #define ISALPHA(c) (ISASCII (c) && isalpha (c)) | |
175 #define ISCNTRL(c) (ISASCII (c) && iscntrl (c)) | |
176 #define ISLOWER(c) (ISASCII (c) && islower (c)) | |
177 #define ISPUNCT(c) (ISASCII (c) && ispunct (c)) | |
178 #define ISSPACE(c) (ISASCII (c) && isspace (c)) | |
179 #define ISUPPER(c) (ISASCII (c) && isupper (c)) | |
180 #define ISXDIGIT(c) (ISASCII (c) && isxdigit (c)) | |
1668 | 181 |
1155 | 182 #ifndef NULL |
183 #define NULL 0 | |
184 #endif | |
185 | |
186 /* We remove any previous definition of `SIGN_EXTEND_CHAR', | |
187 since ours (we hope) works properly with all combinations of | |
188 machines, compilers, `char' and `unsigned char' argument types. | |
189 (Per Bothner suggested the basic approach.) */ | |
190 #undef SIGN_EXTEND_CHAR | |
191 #if __STDC__ | |
192 #define SIGN_EXTEND_CHAR(c) ((signed char) (c)) | |
1637 | 193 #else /* not __STDC__ */ |
1155 | 194 /* As in Harbison and Steele. */ |
195 #define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128) | |
196 #endif | |
197 | |
198 /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we | |
199 use `alloca' instead of `malloc'. This is because using malloc in | |
200 re_search* or re_match* could cause memory leaks when C-g is used in | |
201 Emacs; also, malloc is slower and causes storage fragmentation. On | |
202 the other hand, malloc is more portable, and easier to debug. | |
203 | |
204 Because we sometimes use alloca, some routines have to be macros, | |
205 not functions -- `alloca'-allocated space disappears at the end of the | |
206 function it is called in. */ | |
207 | |
208 #ifdef REGEX_MALLOC | |
209 | |
210 #define REGEX_ALLOCATE malloc | |
211 #define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize) | |
212 | |
213 #else /* not REGEX_MALLOC */ | |
214 | |
215 /* Emacs already defines alloca, sometimes. */ | |
216 #ifndef alloca | |
217 | |
218 /* Make alloca work the best possible way. */ | |
219 #ifdef __GNUC__ | |
220 #define alloca __builtin_alloca | |
221 #else /* not __GNUC__ */ | |
222 #if HAVE_ALLOCA_H | |
223 #include <alloca.h> | |
224 #else /* not __GNUC__ or HAVE_ALLOCA_H */ | |
225 #ifndef _AIX /* Already did AIX, up at the top. */ | |
226 char *alloca (); | |
227 #endif /* not _AIX */ | |
228 #endif /* not HAVE_ALLOCA_H */ | |
229 #endif /* not __GNUC__ */ | |
230 | |
231 #endif /* not alloca */ | |
232 | |
233 #define REGEX_ALLOCATE alloca | |
234 | |
235 /* Assumes a `char *destination' variable. */ | |
236 #define REGEX_REALLOCATE(source, osize, nsize) \ | |
237 (destination = (char *) alloca (nsize), \ | |
238 bcopy (source, destination, osize), \ | |
239 destination) | |
240 | |
241 #endif /* not REGEX_MALLOC */ | |
242 | |
243 | |
244 /* True if `size1' is non-NULL and PTR is pointing anywhere inside | |
245 `string1' or just past its end. This works if PTR is NULL, which is | |
246 a good thing. */ | |
247 #define FIRST_STRING_P(ptr) \ | |
248 (size1 && string1 <= (ptr) && (ptr) <= string1 + size1) | |
249 | |
250 /* (Re)Allocate N items of type T using malloc, or fail. */ | |
251 #define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t))) | |
252 #define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t))) | |
2949 | 253 #define RETALLOC_IF(addr, n, t) \ |
254 if (addr) RETALLOC((addr), (n), t); else (addr) = TALLOC ((n), t) | |
1155 | 255 #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t))) |
256 | |
257 #define BYTEWIDTH 8 /* In bits. */ | |
258 | |
259 #define STREQ(s1, s2) ((strcmp (s1, s2) == 0)) | |
260 | |
5841 | 261 #undef MAX |
262 #undef MIN | |
1155 | 263 #define MAX(a, b) ((a) > (b) ? (a) : (b)) |
264 #define MIN(a, b) ((a) < (b) ? (a) : (b)) | |
265 | |
266 typedef char boolean; | |
267 #define false 0 | |
268 #define true 1 | |
6083 | 269 |
270 static int re_match_2_internal (); | |
1155 | 271 |
272 /* These are the command codes that appear in compiled regular | |
273 expressions. Some opcodes are followed by argument bytes. A | |
274 command code can specify any interpretation whatsoever for its | |
9585 | 275 arguments. Zero bytes may appear in the compiled regular expression. */ |
1155 | 276 |
277 typedef enum | |
278 { | |
279 no_op = 0, | |
280 | |
9983
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
281 /* Succeed right away--no more backtracking. */ |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
282 succeed, |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
283 |
1155 | 284 /* Followed by one byte giving n, then by n literal bytes. */ |
9585 | 285 exactn, |
1155 | 286 |
287 /* Matches any (more or less) character. */ | |
288 anychar, | |
289 | |
290 /* Matches any one char belonging to specified set. First | |
291 following byte is number of bitmap bytes. Then come bytes | |
292 for a bitmap saying which chars are in. Bits in each byte | |
293 are ordered low-bit-first. A character is in the set if its | |
294 bit is 1. A character too large to have a bit in the map is | |
295 automatically not in the set. */ | |
296 charset, | |
297 | |
298 /* Same parameters as charset, but match any character that is | |
299 not one of those specified. */ | |
300 charset_not, | |
301 | |
302 /* Start remembering the text that is matched, for storing in a | |
303 register. Followed by one byte with the register number, in | |
304 the range 0 to one less than the pattern buffer's re_nsub | |
305 field. Then followed by one byte with the number of groups | |
306 inner to this one. (This last has to be part of the | |
307 start_memory only because we need it in the on_failure_jump | |
308 of re_match_2.) */ | |
309 start_memory, | |
310 | |
311 /* Stop remembering the text that is matched and store it in a | |
312 memory register. Followed by one byte with the register | |
313 number, in the range 0 to one less than `re_nsub' in the | |
314 pattern buffer, and one byte with the number of inner groups, | |
315 just like `start_memory'. (We need the number of inner | |
316 groups here because we don't have any easy way of finding the | |
317 corresponding start_memory when we're at a stop_memory.) */ | |
318 stop_memory, | |
319 | |
320 /* Match a duplicate of something remembered. Followed by one | |
321 byte containing the register number. */ | |
322 duplicate, | |
323 | |
324 /* Fail unless at beginning of line. */ | |
325 begline, | |
326 | |
327 /* Fail unless at end of line. */ | |
328 endline, | |
329 | |
330 /* Succeeds if at beginning of buffer (if emacs) or at beginning | |
331 of string to be matched (if not). */ | |
332 begbuf, | |
333 | |
334 /* Analogously, for end of buffer/string. */ | |
335 endbuf, | |
336 | |
337 /* Followed by two byte relative address to which to jump. */ | |
338 jump, | |
339 | |
340 /* Same as jump, but marks the end of an alternative. */ | |
341 jump_past_alt, | |
342 | |
343 /* Followed by two-byte relative address of place to resume at | |
344 in case of failure. */ | |
345 on_failure_jump, | |
346 | |
347 /* Like on_failure_jump, but pushes a placeholder instead of the | |
348 current string position when executed. */ | |
349 on_failure_keep_string_jump, | |
350 | |
351 /* Throw away latest failure point and then jump to following | |
352 two-byte relative address. */ | |
353 pop_failure_jump, | |
354 | |
355 /* Change to pop_failure_jump if know won't have to backtrack to | |
356 match; otherwise change to jump. This is used to jump | |
357 back to the beginning of a repeat. If what follows this jump | |
358 clearly won't match what the repeat does, such that we can be | |
359 sure that there is no use backtracking out of repetitions | |
360 already matched, then we change it to a pop_failure_jump. | |
361 Followed by two-byte address. */ | |
362 maybe_pop_jump, | |
363 | |
364 /* Jump to following two-byte address, and push a dummy failure | |
365 point. This failure point will be thrown away if an attempt | |
366 is made to use it for a failure. A `+' construct makes this | |
367 before the first repeat. Also used as an intermediary kind | |
368 of jump when compiling an alternative. */ | |
369 dummy_failure_jump, | |
370 | |
371 /* Push a dummy failure point and continue. Used at the end of | |
372 alternatives. */ | |
373 push_dummy_failure, | |
374 | |
375 /* Followed by two-byte relative address and two-byte number n. | |
376 After matching N times, jump to the address upon failure. */ | |
377 succeed_n, | |
378 | |
379 /* Followed by two-byte relative address, and two-byte number n. | |
380 Jump to the address N times, then fail. */ | |
381 jump_n, | |
382 | |
383 /* Set the following two-byte relative address to the | |
384 subsequent two-byte number. The address *includes* the two | |
385 bytes of number. */ | |
386 set_number_at, | |
387 | |
388 wordchar, /* Matches any word-constituent character. */ | |
389 notwordchar, /* Matches any char that is not a word-constituent. */ | |
390 | |
391 wordbeg, /* Succeeds if at word beginning. */ | |
392 wordend, /* Succeeds if at word end. */ | |
393 | |
394 wordbound, /* Succeeds if at a word boundary. */ | |
395 notwordbound /* Succeeds if not at a word boundary. */ | |
396 | |
397 #ifdef emacs | |
398 ,before_dot, /* Succeeds if before point. */ | |
399 at_dot, /* Succeeds if at point. */ | |
400 after_dot, /* Succeeds if after point. */ | |
401 | |
402 /* Matches any character whose syntax is specified. Followed by | |
403 a byte which contains a syntax code, e.g., Sword. */ | |
404 syntaxspec, | |
405 | |
406 /* Matches any character whose syntax is not that specified. */ | |
407 notsyntaxspec | |
408 #endif /* emacs */ | |
409 } re_opcode_t; | |
410 | |
411 /* Common operations on the compiled pattern. */ | |
412 | |
413 /* Store NUMBER in two contiguous bytes starting at DESTINATION. */ | |
414 | |
415 #define STORE_NUMBER(destination, number) \ | |
416 do { \ | |
417 (destination)[0] = (number) & 0377; \ | |
418 (destination)[1] = (number) >> 8; \ | |
419 } while (0) | |
420 | |
421 /* Same as STORE_NUMBER, except increment DESTINATION to | |
422 the byte after where the number is stored. Therefore, DESTINATION | |
423 must be an lvalue. */ | |
424 | |
425 #define STORE_NUMBER_AND_INCR(destination, number) \ | |
426 do { \ | |
427 STORE_NUMBER (destination, number); \ | |
428 (destination) += 2; \ | |
429 } while (0) | |
430 | |
431 /* Put into DESTINATION a number stored in two contiguous bytes starting | |
432 at SOURCE. */ | |
433 | |
434 #define EXTRACT_NUMBER(destination, source) \ | |
435 do { \ | |
436 (destination) = *(source) & 0377; \ | |
437 (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \ | |
438 } while (0) | |
439 | |
440 #ifdef DEBUG | |
441 static void | |
442 extract_number (dest, source) | |
443 int *dest; | |
444 unsigned char *source; | |
445 { | |
446 int temp = SIGN_EXTEND_CHAR (*(source + 1)); | |
447 *dest = *source & 0377; | |
448 *dest += temp << 8; | |
449 } | |
450 | |
451 #ifndef EXTRACT_MACROS /* To debug the macros. */ | |
452 #undef EXTRACT_NUMBER | |
453 #define EXTRACT_NUMBER(dest, src) extract_number (&dest, src) | |
454 #endif /* not EXTRACT_MACROS */ | |
455 | |
456 #endif /* DEBUG */ | |
457 | |
458 /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number. | |
459 SOURCE must be an lvalue. */ | |
460 | |
461 #define EXTRACT_NUMBER_AND_INCR(destination, source) \ | |
462 do { \ | |
463 EXTRACT_NUMBER (destination, source); \ | |
464 (source) += 2; \ | |
465 } while (0) | |
466 | |
467 #ifdef DEBUG | |
468 static void | |
469 extract_number_and_incr (destination, source) | |
470 int *destination; | |
471 unsigned char **source; | |
472 { | |
473 extract_number (destination, *source); | |
474 *source += 2; | |
475 } | |
476 | |
477 #ifndef EXTRACT_MACROS | |
478 #undef EXTRACT_NUMBER_AND_INCR | |
479 #define EXTRACT_NUMBER_AND_INCR(dest, src) \ | |
480 extract_number_and_incr (&dest, &src) | |
481 #endif /* not EXTRACT_MACROS */ | |
482 | |
483 #endif /* DEBUG */ | |
484 | |
485 /* If DEBUG is defined, Regex prints many voluminous messages about what | |
486 it is doing (if the variable `debug' is nonzero). If linked with the | |
487 main program in `iregex.c', you can enter patterns and strings | |
488 interactively. And if linked with the main program in `main.c' and | |
489 the other test files, you can run the already-written tests. */ | |
490 | |
491 #ifdef DEBUG | |
492 | |
493 /* We use standard I/O for debugging. */ | |
494 #include <stdio.h> | |
495 | |
496 /* It is useful to test things that ``must'' be true when debugging. */ | |
497 #include <assert.h> | |
498 | |
499 static int debug = 0; | |
500 | |
501 #define DEBUG_STATEMENT(e) e | |
502 #define DEBUG_PRINT1(x) if (debug) printf (x) | |
503 #define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2) | |
504 #define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3) | |
1637 | 505 #define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4) |
1155 | 506 #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \ |
507 if (debug) print_partial_compiled_pattern (s, e) | |
508 #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \ | |
509 if (debug) print_double_string (w, s1, sz1, s2, sz2) | |
510 | |
511 | |
512 /* Print the fastmap in human-readable form. */ | |
513 | |
514 void | |
515 print_fastmap (fastmap) | |
516 char *fastmap; | |
517 { | |
518 unsigned was_a_range = 0; | |
519 unsigned i = 0; | |
520 | |
521 while (i < (1 << BYTEWIDTH)) | |
522 { | |
523 if (fastmap[i++]) | |
524 { | |
525 was_a_range = 0; | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
526 putchar (i - 1); |
1155 | 527 while (i < (1 << BYTEWIDTH) && fastmap[i]) |
528 { | |
529 was_a_range = 1; | |
530 i++; | |
531 } | |
532 if (was_a_range) | |
533 { | |
534 printf ("-"); | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
535 putchar (i - 1); |
1155 | 536 } |
537 } | |
538 } | |
539 putchar ('\n'); | |
540 } | |
541 | |
542 | |
543 /* Print a compiled pattern string in human-readable form, starting at | |
544 the START pointer into it and ending just before the pointer END. */ | |
545 | |
546 void | |
547 print_partial_compiled_pattern (start, end) | |
548 unsigned char *start; | |
549 unsigned char *end; | |
550 { | |
551 int mcnt, mcnt2; | |
552 unsigned char *p = start; | |
553 unsigned char *pend = end; | |
554 | |
555 if (start == NULL) | |
556 { | |
557 printf ("(null)\n"); | |
558 return; | |
559 } | |
560 | |
561 /* Loop over pattern commands. */ | |
562 while (p < pend) | |
563 { | |
2615 | 564 printf ("%d:\t", p - start); |
565 | |
1155 | 566 switch ((re_opcode_t) *p++) |
567 { | |
568 case no_op: | |
569 printf ("/no_op"); | |
570 break; | |
571 | |
572 case exactn: | |
573 mcnt = *p++; | |
574 printf ("/exactn/%d", mcnt); | |
575 do | |
576 { | |
577 putchar ('/'); | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
578 putchar (*p++); |
1155 | 579 } |
580 while (--mcnt); | |
581 break; | |
582 | |
583 case start_memory: | |
584 mcnt = *p++; | |
585 printf ("/start_memory/%d/%d", mcnt, *p++); | |
586 break; | |
587 | |
588 case stop_memory: | |
589 mcnt = *p++; | |
590 printf ("/stop_memory/%d/%d", mcnt, *p++); | |
591 break; | |
592 | |
593 case duplicate: | |
594 printf ("/duplicate/%d", *p++); | |
595 break; | |
596 | |
597 case anychar: | |
598 printf ("/anychar"); | |
599 break; | |
600 | |
601 case charset: | |
602 case charset_not: | |
603 { | |
2615 | 604 register int c, last = -100; |
605 register int in_range = 0; | |
606 | |
607 printf ("/charset [%s", | |
608 (re_opcode_t) *(p - 1) == charset_not ? "^" : ""); | |
1155 | 609 |
610 assert (p + *p < pend); | |
611 | |
2615 | 612 for (c = 0; c < 256; c++) |
613 if (c / 8 < *p | |
614 && (p[1 + (c/8)] & (1 << (c % 8)))) | |
615 { | |
616 /* Are we starting a range? */ | |
617 if (last + 1 == c && ! in_range) | |
618 { | |
619 putchar ('-'); | |
620 in_range = 1; | |
621 } | |
622 /* Have we broken a range? */ | |
623 else if (last + 1 != c && in_range) | |
1155 | 624 { |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
625 putchar (last); |
2615 | 626 in_range = 0; |
627 } | |
1155 | 628 |
2615 | 629 if (! in_range) |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
630 putchar (c); |
2615 | 631 |
632 last = c; | |
1155 | 633 } |
2615 | 634 |
635 if (in_range) | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
636 putchar (last); |
2615 | 637 |
638 putchar (']'); | |
639 | |
1155 | 640 p += 1 + *p; |
641 } | |
2615 | 642 break; |
1155 | 643 |
644 case begline: | |
645 printf ("/begline"); | |
646 break; | |
647 | |
648 case endline: | |
649 printf ("/endline"); | |
650 break; | |
651 | |
652 case on_failure_jump: | |
653 extract_number_and_incr (&mcnt, &p); | |
2615 | 654 printf ("/on_failure_jump to %d", p + mcnt - start); |
1155 | 655 break; |
656 | |
657 case on_failure_keep_string_jump: | |
658 extract_number_and_incr (&mcnt, &p); | |
2615 | 659 printf ("/on_failure_keep_string_jump to %d", p + mcnt - start); |
1155 | 660 break; |
661 | |
662 case dummy_failure_jump: | |
663 extract_number_and_incr (&mcnt, &p); | |
2615 | 664 printf ("/dummy_failure_jump to %d", p + mcnt - start); |
1155 | 665 break; |
666 | |
667 case push_dummy_failure: | |
668 printf ("/push_dummy_failure"); | |
669 break; | |
670 | |
671 case maybe_pop_jump: | |
672 extract_number_and_incr (&mcnt, &p); | |
2615 | 673 printf ("/maybe_pop_jump to %d", p + mcnt - start); |
1155 | 674 break; |
675 | |
676 case pop_failure_jump: | |
677 extract_number_and_incr (&mcnt, &p); | |
2615 | 678 printf ("/pop_failure_jump to %d", p + mcnt - start); |
1155 | 679 break; |
680 | |
681 case jump_past_alt: | |
682 extract_number_and_incr (&mcnt, &p); | |
2615 | 683 printf ("/jump_past_alt to %d", p + mcnt - start); |
1155 | 684 break; |
685 | |
686 case jump: | |
687 extract_number_and_incr (&mcnt, &p); | |
2615 | 688 printf ("/jump to %d", p + mcnt - start); |
1155 | 689 break; |
690 | |
691 case succeed_n: | |
692 extract_number_and_incr (&mcnt, &p); | |
693 extract_number_and_incr (&mcnt2, &p); | |
2615 | 694 printf ("/succeed_n to %d, %d times", p + mcnt - start, mcnt2); |
1155 | 695 break; |
696 | |
697 case jump_n: | |
698 extract_number_and_incr (&mcnt, &p); | |
699 extract_number_and_incr (&mcnt2, &p); | |
2615 | 700 printf ("/jump_n to %d, %d times", p + mcnt - start, mcnt2); |
1155 | 701 break; |
702 | |
703 case set_number_at: | |
704 extract_number_and_incr (&mcnt, &p); | |
705 extract_number_and_incr (&mcnt2, &p); | |
2615 | 706 printf ("/set_number_at location %d to %d", p + mcnt - start, mcnt2); |
1155 | 707 break; |
708 | |
709 case wordbound: | |
710 printf ("/wordbound"); | |
711 break; | |
712 | |
713 case notwordbound: | |
714 printf ("/notwordbound"); | |
715 break; | |
716 | |
717 case wordbeg: | |
718 printf ("/wordbeg"); | |
719 break; | |
720 | |
721 case wordend: | |
722 printf ("/wordend"); | |
723 | |
724 #ifdef emacs | |
725 case before_dot: | |
726 printf ("/before_dot"); | |
727 break; | |
728 | |
729 case at_dot: | |
730 printf ("/at_dot"); | |
731 break; | |
732 | |
733 case after_dot: | |
734 printf ("/after_dot"); | |
735 break; | |
736 | |
737 case syntaxspec: | |
738 printf ("/syntaxspec"); | |
739 mcnt = *p++; | |
740 printf ("/%d", mcnt); | |
741 break; | |
742 | |
743 case notsyntaxspec: | |
744 printf ("/notsyntaxspec"); | |
745 mcnt = *p++; | |
746 printf ("/%d", mcnt); | |
747 break; | |
748 #endif /* emacs */ | |
749 | |
750 case wordchar: | |
751 printf ("/wordchar"); | |
752 break; | |
753 | |
754 case notwordchar: | |
755 printf ("/notwordchar"); | |
756 break; | |
757 | |
758 case begbuf: | |
759 printf ("/begbuf"); | |
760 break; | |
761 | |
762 case endbuf: | |
763 printf ("/endbuf"); | |
764 break; | |
765 | |
766 default: | |
767 printf ("?%d", *(p-1)); | |
768 } | |
2615 | 769 |
770 putchar ('\n'); | |
1155 | 771 } |
2615 | 772 |
773 printf ("%d:\tend of pattern.\n", p - start); | |
1155 | 774 } |
775 | |
776 | |
777 void | |
778 print_compiled_pattern (bufp) | |
779 struct re_pattern_buffer *bufp; | |
780 { | |
781 unsigned char *buffer = bufp->buffer; | |
782 | |
783 print_partial_compiled_pattern (buffer, buffer + bufp->used); | |
784 printf ("%d bytes used/%d bytes allocated.\n", bufp->used, bufp->allocated); | |
785 | |
786 if (bufp->fastmap_accurate && bufp->fastmap) | |
787 { | |
788 printf ("fastmap: "); | |
789 print_fastmap (bufp->fastmap); | |
790 } | |
791 | |
792 printf ("re_nsub: %d\t", bufp->re_nsub); | |
793 printf ("regs_alloc: %d\t", bufp->regs_allocated); | |
794 printf ("can_be_null: %d\t", bufp->can_be_null); | |
795 printf ("newline_anchor: %d\n", bufp->newline_anchor); | |
796 printf ("no_sub: %d\t", bufp->no_sub); | |
797 printf ("not_bol: %d\t", bufp->not_bol); | |
798 printf ("not_eol: %d\t", bufp->not_eol); | |
799 printf ("syntax: %d\n", bufp->syntax); | |
800 /* Perhaps we should print the translate table? */ | |
801 } | |
802 | |
803 | |
804 void | |
805 print_double_string (where, string1, size1, string2, size2) | |
806 const char *where; | |
807 const char *string1; | |
808 const char *string2; | |
809 int size1; | |
810 int size2; | |
811 { | |
812 unsigned this_char; | |
813 | |
814 if (where == NULL) | |
815 printf ("(null)"); | |
816 else | |
817 { | |
818 if (FIRST_STRING_P (where)) | |
819 { | |
820 for (this_char = where - string1; this_char < size1; this_char++) | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
821 putchar (string1[this_char]); |
1155 | 822 |
823 where = string2; | |
824 } | |
825 | |
826 for (this_char = where - string2; this_char < size2; this_char++) | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
827 putchar (string2[this_char]); |
1155 | 828 } |
829 } | |
830 | |
831 #else /* not DEBUG */ | |
832 | |
833 #undef assert | |
834 #define assert(e) | |
835 | |
836 #define DEBUG_STATEMENT(e) | |
837 #define DEBUG_PRINT1(x) | |
838 #define DEBUG_PRINT2(x1, x2) | |
839 #define DEBUG_PRINT3(x1, x2, x3) | |
1637 | 840 #define DEBUG_PRINT4(x1, x2, x3, x4) |
1155 | 841 #define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) |
842 #define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) | |
843 | |
844 #endif /* not DEBUG */ | |
845 | |
846 /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can | |
847 also be assigned to arbitrarily: each pattern buffer stores its own | |
848 syntax, so it can be changed between regex compilations. */ | |
9983
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
849 /* This has no initializer because initialized variables in Emacs |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
850 become read-only after dumping. */ |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
851 reg_syntax_t re_syntax_options; |
1155 | 852 |
853 | |
854 /* Specify the precise syntax of regexps for compilation. This provides | |
855 for compatibility for various utilities which historically have | |
856 different, incompatible syntaxes. | |
857 | |
858 The argument SYNTAX is a bit mask comprised of the various bits | |
859 defined in regex.h. We return the old syntax. */ | |
860 | |
861 reg_syntax_t | |
862 re_set_syntax (syntax) | |
863 reg_syntax_t syntax; | |
864 { | |
865 reg_syntax_t ret = re_syntax_options; | |
866 | |
867 re_syntax_options = syntax; | |
868 return ret; | |
869 } | |
870 | |
871 /* This table gives an error message for each of the error codes listed | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
872 in regex.h. Obviously the order here has to be same as there. |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
873 POSIX doesn't require that we do anything for REG_NOERROR, |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
874 but why not be nice? */ |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
875 |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
876 static const char *re_error_msgid[] = |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
877 { "Success", /* REG_NOERROR */ |
1155 | 878 "No match", /* REG_NOMATCH */ |
879 "Invalid regular expression", /* REG_BADPAT */ | |
880 "Invalid collation character", /* REG_ECOLLATE */ | |
881 "Invalid character class name", /* REG_ECTYPE */ | |
882 "Trailing backslash", /* REG_EESCAPE */ | |
883 "Invalid back reference", /* REG_ESUBREG */ | |
884 "Unmatched [ or [^", /* REG_EBRACK */ | |
885 "Unmatched ( or \\(", /* REG_EPAREN */ | |
886 "Unmatched \\{", /* REG_EBRACE */ | |
887 "Invalid content of \\{\\}", /* REG_BADBR */ | |
888 "Invalid range end", /* REG_ERANGE */ | |
889 "Memory exhausted", /* REG_ESPACE */ | |
890 "Invalid preceding regular expression", /* REG_BADRPT */ | |
891 "Premature end of regular expression", /* REG_EEND */ | |
892 "Regular expression too big", /* REG_ESIZE */ | |
893 "Unmatched ) or \\)", /* REG_ERPAREN */ | |
894 }; | |
895 | |
2949 | 896 /* Avoiding alloca during matching, to placate r_alloc. */ |
897 | |
7011 | 898 /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the |
2949 | 899 searching and matching functions should not call alloca. On some |
900 systems, alloca is implemented in terms of malloc, and if we're | |
901 using the relocating allocator routines, then malloc could cause a | |
902 relocation, which might (if the strings being searched are in the | |
903 ralloc heap) shift the data out from underneath the regexp | |
3614 | 904 routines. |
905 | |
8142
66a5487be3a7
Be less eager to define MATCH_MAY_ALLOCATE.
Richard M. Stallman <rms@gnu.org>
parents:
8114
diff
changeset
|
906 Here's another reason to avoid allocation: Emacs |
66a5487be3a7
Be less eager to define MATCH_MAY_ALLOCATE.
Richard M. Stallman <rms@gnu.org>
parents:
8114
diff
changeset
|
907 processes input from X in a signal handler; processing X input may |
3614 | 908 call malloc; if input arrives while a matching routine is calling |
909 malloc, then we're scrod. But Emacs can't just block input while | |
910 calling matching routines; then we don't notice interrupts when | |
911 they come in. So, Emacs blocks input around all regexp calls | |
912 except the matching calls, which it leaves unprotected, in the | |
913 faith that they will not malloc. */ | |
2952 | 914 |
915 /* Normally, this is fine. */ | |
916 #define MATCH_MAY_ALLOCATE | |
917 | |
8142
66a5487be3a7
Be less eager to define MATCH_MAY_ALLOCATE.
Richard M. Stallman <rms@gnu.org>
parents:
8114
diff
changeset
|
918 /* The match routines may not allocate if (1) they would do it with malloc |
9585 | 919 and (2) it's not safe for them to use malloc. */ |
8142
66a5487be3a7
Be less eager to define MATCH_MAY_ALLOCATE.
Richard M. Stallman <rms@gnu.org>
parents:
8114
diff
changeset
|
920 #if (defined (C_ALLOCA) || defined (REGEX_MALLOC)) && (defined (emacs) || defined (REL_ALLOC)) |
2952 | 921 #undef MATCH_MAY_ALLOCATE |
2949 | 922 #endif |
923 | |
924 | |
925 /* Failure stack declarations and macros; both re_compile_fastmap and | |
926 re_match_2 use a failure stack. These have to be macros because of | |
927 REGEX_ALLOCATE. */ | |
928 | |
929 | |
930 /* Number of failure points for which to initially allocate space | |
931 when matching. If this number is exceeded, we allocate more | |
932 space, so it is not a hard limit. */ | |
933 #ifndef INIT_FAILURE_ALLOC | |
934 #define INIT_FAILURE_ALLOC 5 | |
935 #endif | |
936 | |
937 /* Roughly the maximum number of failure points on the stack. Would be | |
938 exactly that if always used MAX_FAILURE_SPACE each time we failed. | |
939 This is a variable only so users of regex can assign to it; we never | |
940 change it ourselves. */ | |
941 int re_max_failures = 2000; | |
942 | |
4918
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
943 typedef unsigned char *fail_stack_elt_t; |
2949 | 944 |
945 typedef struct | |
946 { | |
947 fail_stack_elt_t *stack; | |
948 unsigned size; | |
949 unsigned avail; /* Offset of next open position. */ | |
950 } fail_stack_type; | |
951 | |
952 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0) | |
953 #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0) | |
954 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size) | |
955 #define FAIL_STACK_TOP() (fail_stack.stack[fail_stack.avail]) | |
956 | |
957 | |
958 /* Initialize `fail_stack'. Do `return -2' if the alloc fails. */ | |
959 | |
2952 | 960 #ifdef MATCH_MAY_ALLOCATE |
2949 | 961 #define INIT_FAIL_STACK() \ |
962 do { \ | |
963 fail_stack.stack = (fail_stack_elt_t *) \ | |
964 REGEX_ALLOCATE (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t)); \ | |
965 \ | |
966 if (fail_stack.stack == NULL) \ | |
967 return -2; \ | |
968 \ | |
969 fail_stack.size = INIT_FAILURE_ALLOC; \ | |
970 fail_stack.avail = 0; \ | |
971 } while (0) | |
972 #else | |
973 #define INIT_FAIL_STACK() \ | |
974 do { \ | |
975 fail_stack.avail = 0; \ | |
976 } while (0) | |
977 #endif | |
978 | |
979 | |
980 /* Double the size of FAIL_STACK, up to approximately `re_max_failures' items. | |
981 | |
982 Return 1 if succeeds, and 0 if either ran out of memory | |
983 allocating space for it or it was already too large. | |
984 | |
985 REGEX_REALLOCATE requires `destination' be declared. */ | |
986 | |
987 #define DOUBLE_FAIL_STACK(fail_stack) \ | |
988 ((fail_stack).size > re_max_failures * MAX_FAILURE_ITEMS \ | |
989 ? 0 \ | |
990 : ((fail_stack).stack = (fail_stack_elt_t *) \ | |
991 REGEX_REALLOCATE ((fail_stack).stack, \ | |
992 (fail_stack).size * sizeof (fail_stack_elt_t), \ | |
993 ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \ | |
994 \ | |
995 (fail_stack).stack == NULL \ | |
996 ? 0 \ | |
997 : ((fail_stack).size <<= 1, \ | |
998 1))) | |
999 | |
1000 | |
1001 /* Push PATTERN_OP on FAIL_STACK. | |
1002 | |
1003 Return 1 if was able to do so and 0 if ran out of memory allocating | |
1004 space to do so. */ | |
1005 #define PUSH_PATTERN_OP(pattern_op, fail_stack) \ | |
1006 ((FAIL_STACK_FULL () \ | |
1007 && !DOUBLE_FAIL_STACK (fail_stack)) \ | |
1008 ? 0 \ | |
1009 : ((fail_stack).stack[(fail_stack).avail++] = pattern_op, \ | |
1010 1)) | |
1011 | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1012 /* Push a pointer value onto the failure stack. |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1013 Assumes the variable `fail_stack'. Probably should only |
2949 | 1014 be called from within `PUSH_FAILURE_POINT'. */ |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1015 #define PUSH_FAILURE_POINTER(item) \ |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1016 fail_stack.stack[fail_stack.avail++] = (fail_stack_elt_t) (item) |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1017 |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1018 /* This pushes an integer-valued item onto the failure stack. |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1019 Assumes the variable `fail_stack'. Probably should only |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1020 be called from within `PUSH_FAILURE_POINT'. */ |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1021 #define PUSH_FAILURE_INT(item) \ |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1022 fail_stack.stack[fail_stack.avail++] = (fail_stack_elt_t) (EMACS_INT) (item) |
2949 | 1023 |
1024 /* The complement operation. Assumes `fail_stack' is nonempty. */ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1025 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail] |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1026 |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1027 /* The complement operation. Assumes `fail_stack' is nonempty. */ |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1028 #define POP_FAILURE_INT() (EMACS_INT) fail_stack.stack[--fail_stack.avail] |
2949 | 1029 |
1030 /* Used to omit pushing failure point id's when we're not debugging. */ | |
1031 #ifdef DEBUG | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1032 #define DEBUG_PUSH PUSH_FAILURE_INT |
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1033 #define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_INT () |
2949 | 1034 #else |
1035 #define DEBUG_PUSH(item) | |
1036 #define DEBUG_POP(item_addr) | |
1037 #endif | |
1038 | |
1039 | |
1040 /* Push the information about the state we will need | |
1041 if we ever fail back to it. | |
1042 | |
1043 Requires variables fail_stack, regstart, regend, reg_info, and | |
1044 num_regs be declared. DOUBLE_FAIL_STACK requires `destination' be | |
1045 declared. | |
1046 | |
1047 Does `return FAILURE_CODE' if runs out of memory. */ | |
1048 | |
1049 #define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code) \ | |
1050 do { \ | |
1051 char *destination; \ | |
1052 /* Must be int, so when we don't save any registers, the arithmetic \ | |
1053 of 0 + -1 isn't done as unsigned. */ \ | |
1054 int this_reg; \ | |
1055 \ | |
1056 DEBUG_STATEMENT (failure_id++); \ | |
1057 DEBUG_STATEMENT (nfailure_points_pushed++); \ | |
1058 DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id); \ | |
1059 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\ | |
1060 DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\ | |
1061 \ | |
1062 DEBUG_PRINT2 (" slots needed: %d\n", NUM_FAILURE_ITEMS); \ | |
1063 DEBUG_PRINT2 (" available: %d\n", REMAINING_AVAIL_SLOTS); \ | |
1064 \ | |
1065 /* Ensure we have enough space allocated for what we will push. */ \ | |
1066 while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS) \ | |
1067 { \ | |
1068 if (!DOUBLE_FAIL_STACK (fail_stack)) \ | |
1069 return failure_code; \ | |
1070 \ | |
1071 DEBUG_PRINT2 ("\n Doubled stack; size now: %d\n", \ | |
1072 (fail_stack).size); \ | |
1073 DEBUG_PRINT2 (" slots available: %d\n", REMAINING_AVAIL_SLOTS);\ | |
1074 } \ | |
1075 \ | |
1076 /* Push the info, starting with the registers. */ \ | |
1077 DEBUG_PRINT1 ("\n"); \ | |
1078 \ | |
1079 for (this_reg = lowest_active_reg; this_reg <= highest_active_reg; \ | |
1080 this_reg++) \ | |
1081 { \ | |
1082 DEBUG_PRINT2 (" Pushing reg: %d\n", this_reg); \ | |
1083 DEBUG_STATEMENT (num_regs_pushed++); \ | |
1084 \ | |
1085 DEBUG_PRINT2 (" start: 0x%x\n", regstart[this_reg]); \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1086 PUSH_FAILURE_POINTER (regstart[this_reg]); \ |
2949 | 1087 \ |
1088 DEBUG_PRINT2 (" end: 0x%x\n", regend[this_reg]); \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1089 PUSH_FAILURE_POINTER (regend[this_reg]); \ |
2949 | 1090 \ |
1091 DEBUG_PRINT2 (" info: 0x%x\n ", reg_info[this_reg]); \ | |
1092 DEBUG_PRINT2 (" match_null=%d", \ | |
1093 REG_MATCH_NULL_STRING_P (reg_info[this_reg])); \ | |
1094 DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg])); \ | |
1095 DEBUG_PRINT2 (" matched_something=%d", \ | |
1096 MATCHED_SOMETHING (reg_info[this_reg])); \ | |
1097 DEBUG_PRINT2 (" ever_matched=%d", \ | |
1098 EVER_MATCHED_SOMETHING (reg_info[this_reg])); \ | |
1099 DEBUG_PRINT1 ("\n"); \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1100 PUSH_FAILURE_POINTER (reg_info[this_reg].word); \ |
2949 | 1101 } \ |
1102 \ | |
1103 DEBUG_PRINT2 (" Pushing low active reg: %d\n", lowest_active_reg);\ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1104 PUSH_FAILURE_INT (lowest_active_reg); \ |
2949 | 1105 \ |
1106 DEBUG_PRINT2 (" Pushing high active reg: %d\n", highest_active_reg);\ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1107 PUSH_FAILURE_INT (highest_active_reg); \ |
2949 | 1108 \ |
1109 DEBUG_PRINT2 (" Pushing pattern 0x%x: ", pattern_place); \ | |
1110 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1111 PUSH_FAILURE_POINTER (pattern_place); \ |
2949 | 1112 \ |
1113 DEBUG_PRINT2 (" Pushing string 0x%x: `", string_place); \ | |
1114 DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, \ | |
1115 size2); \ | |
1116 DEBUG_PRINT1 ("'\n"); \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1117 PUSH_FAILURE_POINTER (string_place); \ |
2949 | 1118 \ |
1119 DEBUG_PRINT2 (" Pushing failure id: %u\n", failure_id); \ | |
1120 DEBUG_PUSH (failure_id); \ | |
1121 } while (0) | |
1122 | |
1123 /* This is the number of items that are pushed and popped on the stack | |
1124 for each register. */ | |
1125 #define NUM_REG_ITEMS 3 | |
1126 | |
1127 /* Individual items aside from the registers. */ | |
1128 #ifdef DEBUG | |
1129 #define NUM_NONREG_ITEMS 5 /* Includes failure point id. */ | |
1130 #else | |
1131 #define NUM_NONREG_ITEMS 4 | |
1132 #endif | |
1133 | |
1134 /* We push at most this many items on the stack. */ | |
1135 #define MAX_FAILURE_ITEMS ((num_regs - 1) * NUM_REG_ITEMS + NUM_NONREG_ITEMS) | |
1136 | |
1137 /* We actually push this many items. */ | |
1138 #define NUM_FAILURE_ITEMS \ | |
1139 ((highest_active_reg - lowest_active_reg + 1) * NUM_REG_ITEMS \ | |
1140 + NUM_NONREG_ITEMS) | |
1141 | |
1142 /* How many items can still be added to the stack without overflowing it. */ | |
1143 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail) | |
1144 | |
1145 | |
1146 /* Pops what PUSH_FAIL_STACK pushes. | |
1147 | |
1148 We restore into the parameters, all of which should be lvalues: | |
1149 STR -- the saved data position. | |
1150 PAT -- the saved pattern position. | |
1151 LOW_REG, HIGH_REG -- the highest and lowest active registers. | |
1152 REGSTART, REGEND -- arrays of string positions. | |
1153 REG_INFO -- array of information about each subexpression. | |
1154 | |
1155 Also assumes the variables `fail_stack' and (if debugging), `bufp', | |
1156 `pend', `string1', `size1', `string2', and `size2'. */ | |
1157 | |
1158 #define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\ | |
1159 { \ | |
1160 DEBUG_STATEMENT (fail_stack_elt_t failure_id;) \ | |
1161 int this_reg; \ | |
1162 const unsigned char *string_temp; \ | |
1163 \ | |
1164 assert (!FAIL_STACK_EMPTY ()); \ | |
1165 \ | |
1166 /* Remove failure points and point to how many regs pushed. */ \ | |
1167 DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \ | |
1168 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \ | |
1169 DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \ | |
1170 \ | |
1171 assert (fail_stack.avail >= NUM_NONREG_ITEMS); \ | |
1172 \ | |
1173 DEBUG_POP (&failure_id); \ | |
1174 DEBUG_PRINT2 (" Popping failure id: %u\n", failure_id); \ | |
1175 \ | |
1176 /* If the saved string location is NULL, it came from an \ | |
1177 on_failure_keep_string_jump opcode, and we want to throw away the \ | |
1178 saved NULL, thus retaining our current position in the string. */ \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1179 string_temp = POP_FAILURE_POINTER (); \ |
2949 | 1180 if (string_temp != NULL) \ |
1181 str = (const char *) string_temp; \ | |
1182 \ | |
1183 DEBUG_PRINT2 (" Popping string 0x%x: `", str); \ | |
1184 DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \ | |
1185 DEBUG_PRINT1 ("'\n"); \ | |
1186 \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1187 pat = (unsigned char *) POP_FAILURE_POINTER (); \ |
2949 | 1188 DEBUG_PRINT2 (" Popping pattern 0x%x: ", pat); \ |
1189 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \ | |
1190 \ | |
1191 /* Restore register info. */ \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1192 high_reg = (unsigned) POP_FAILURE_INT (); \ |
2949 | 1193 DEBUG_PRINT2 (" Popping high active reg: %d\n", high_reg); \ |
1194 \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1195 low_reg = (unsigned) POP_FAILURE_INT (); \ |
2949 | 1196 DEBUG_PRINT2 (" Popping low active reg: %d\n", low_reg); \ |
1197 \ | |
1198 for (this_reg = high_reg; this_reg >= low_reg; this_reg--) \ | |
1199 { \ | |
1200 DEBUG_PRINT2 (" Popping reg: %d\n", this_reg); \ | |
1201 \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1202 reg_info[this_reg].word = POP_FAILURE_POINTER (); \ |
2949 | 1203 DEBUG_PRINT2 (" info: 0x%x\n", reg_info[this_reg]); \ |
1204 \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1205 regend[this_reg] = (const char *) POP_FAILURE_POINTER (); \ |
2949 | 1206 DEBUG_PRINT2 (" end: 0x%x\n", regend[this_reg]); \ |
1207 \ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
1208 regstart[this_reg] = (const char *) POP_FAILURE_POINTER (); \ |
2949 | 1209 DEBUG_PRINT2 (" start: 0x%x\n", regstart[this_reg]); \ |
1210 } \ | |
1211 \ | |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
1212 set_regs_matched_done = 0; \ |
2949 | 1213 DEBUG_STATEMENT (nfailure_points_popped++); \ |
1214 } /* POP_FAILURE_POINT */ | |
1215 | |
1216 | |
1217 | |
1218 /* Structure for per-register (a.k.a. per-group) information. | |
1219 This must not be longer than one word, because we push this value | |
1220 onto the failure stack. Other register information, such as the | |
1221 starting and ending positions (which are addresses), and the list of | |
1222 inner groups (which is a bits list) are maintained in separate | |
1223 variables. | |
1224 | |
1225 We are making a (strictly speaking) nonportable assumption here: that | |
1226 the compiler will pack our bit fields into something that fits into | |
1227 the type of `word', i.e., is something that fits into one item on the | |
1228 failure stack. */ | |
1229 typedef union | |
1230 { | |
1231 fail_stack_elt_t word; | |
1232 struct | |
1233 { | |
1234 /* This field is one if this group can match the empty string, | |
1235 zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */ | |
1236 #define MATCH_NULL_UNSET_VALUE 3 | |
1237 unsigned match_null_string_p : 2; | |
1238 unsigned is_active : 1; | |
1239 unsigned matched_something : 1; | |
1240 unsigned ever_matched_something : 1; | |
1241 } bits; | |
1242 } register_info_type; | |
1243 | |
1244 #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p) | |
1245 #define IS_ACTIVE(R) ((R).bits.is_active) | |
1246 #define MATCHED_SOMETHING(R) ((R).bits.matched_something) | |
1247 #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something) | |
1248 | |
1249 | |
1250 /* Call this when have matched a real character; it sets `matched' flags | |
1251 for the subexpressions which we are currently inside. Also records | |
1252 that those subexprs have matched. */ | |
10850
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1253 #define SET_REGS_MATCHED() \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1254 do \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1255 { \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1256 if (!set_regs_matched_done) \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1257 { \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1258 unsigned r; \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1259 set_regs_matched_done = 1; \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1260 for (r = lowest_active_reg; r <= highest_active_reg; r++) \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1261 { \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1262 MATCHED_SOMETHING (reg_info[r]) \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1263 = EVER_MATCHED_SOMETHING (reg_info[r]) \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1264 = 1; \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1265 } \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1266 } \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1267 } \ |
0794141677db
(SET_REGS_MATCHED): Enclose if-stmt in `do {...} while(0)'
Jim Meyering <jim@meyering.net>
parents:
10456
diff
changeset
|
1268 while (0) |
2949 | 1269 |
1270 /* Registers are set to a sentinel when they haven't yet matched. */ | |
10148
692093cc08d7
[REG_UNSET_VALUE]: Define to the address of a static variable rather than to
Jim Meyering <jim@meyering.net>
parents:
10100
diff
changeset
|
1271 static char reg_unset_dummy; |
692093cc08d7
[REG_UNSET_VALUE]: Define to the address of a static variable rather than to
Jim Meyering <jim@meyering.net>
parents:
10100
diff
changeset
|
1272 #define REG_UNSET_VALUE (®_unset_dummy) |
2949 | 1273 #define REG_UNSET(e) ((e) == REG_UNSET_VALUE) |
1274 | |
1275 | |
1276 | |
2952 | 1277 /* How do we implement a missing MATCH_MAY_ALLOCATE? |
2949 | 1278 We make the fail stack a global thing, and then grow it to |
1279 re_max_failures when we compile. */ | |
2952 | 1280 #ifndef MATCH_MAY_ALLOCATE |
2949 | 1281 static fail_stack_type fail_stack; |
1282 | |
1283 static const char ** regstart, ** regend; | |
1284 static const char ** old_regstart, ** old_regend; | |
1285 static const char **best_regstart, **best_regend; | |
1286 static register_info_type *reg_info; | |
1287 static const char **reg_dummy; | |
1288 static register_info_type *reg_info_dummy; | |
1289 #endif | |
1290 | |
1291 | |
1155 | 1292 /* Subroutine declarations and macros for regex_compile. */ |
1293 | |
1294 static void store_op1 (), store_op2 (); | |
1295 static void insert_op1 (), insert_op2 (); | |
1296 static boolean at_begline_loc_p (), at_endline_loc_p (); | |
1297 static boolean group_in_compile_stack (); | |
1298 static reg_errcode_t compile_range (); | |
1299 | |
1300 /* Fetch the next character in the uncompiled pattern---translating it | |
1301 if necessary. Also cast from a signed character in the constant | |
1302 string passed to us by the user to an unsigned char that we can use | |
1303 as an array index (in, e.g., `translate'). */ | |
1304 #define PATFETCH(c) \ | |
1305 do {if (p == pend) return REG_EEND; \ | |
1306 c = (unsigned char) *p++; \ | |
1307 if (translate) c = translate[c]; \ | |
1308 } while (0) | |
1309 | |
1310 /* Fetch the next character in the uncompiled pattern, with no | |
1311 translation. */ | |
1312 #define PATFETCH_RAW(c) \ | |
1313 do {if (p == pend) return REG_EEND; \ | |
1314 c = (unsigned char) *p++; \ | |
1315 } while (0) | |
1316 | |
1317 /* Go backwards one character in the pattern. */ | |
1318 #define PATUNFETCH p-- | |
1319 | |
1320 | |
1321 /* If `translate' is non-null, return translate[D], else just D. We | |
1322 cast the subscript to translate because some data is declared as | |
1323 `char *', to avoid warnings when a string constant is passed. But | |
1324 when we use a character as a subscript we must make it unsigned. */ | |
1325 #define TRANSLATE(d) (translate ? translate[(unsigned char) (d)] : (d)) | |
1326 | |
1327 | |
1328 /* Macros for outputting the compiled pattern into `buffer'. */ | |
1329 | |
1330 /* If the buffer isn't allocated when it comes in, use this. */ | |
1331 #define INIT_BUF_SIZE 32 | |
1332 | |
1333 /* Make sure we have at least N more bytes of space in buffer. */ | |
1334 #define GET_BUFFER_SPACE(n) \ | |
1335 while (b - bufp->buffer + (n) > bufp->allocated) \ | |
1336 EXTEND_BUFFER () | |
1337 | |
1338 /* Make sure we have one more byte of buffer space and then add C to it. */ | |
1339 #define BUF_PUSH(c) \ | |
1340 do { \ | |
1341 GET_BUFFER_SPACE (1); \ | |
1342 *b++ = (unsigned char) (c); \ | |
1343 } while (0) | |
1344 | |
1345 | |
1346 /* Ensure we have two more bytes of buffer space and then append C1 and C2. */ | |
1347 #define BUF_PUSH_2(c1, c2) \ | |
1348 do { \ | |
1349 GET_BUFFER_SPACE (2); \ | |
1350 *b++ = (unsigned char) (c1); \ | |
1351 *b++ = (unsigned char) (c2); \ | |
1352 } while (0) | |
1353 | |
1354 | |
1355 /* As with BUF_PUSH_2, except for three bytes. */ | |
1356 #define BUF_PUSH_3(c1, c2, c3) \ | |
1357 do { \ | |
1358 GET_BUFFER_SPACE (3); \ | |
1359 *b++ = (unsigned char) (c1); \ | |
1360 *b++ = (unsigned char) (c2); \ | |
1361 *b++ = (unsigned char) (c3); \ | |
1362 } while (0) | |
1363 | |
1364 | |
1365 /* Store a jump with opcode OP at LOC to location TO. We store a | |
1366 relative address offset by the three bytes the jump itself occupies. */ | |
1367 #define STORE_JUMP(op, loc, to) \ | |
1368 store_op1 (op, loc, (to) - (loc) - 3) | |
1369 | |
1370 /* Likewise, for a two-argument jump. */ | |
1371 #define STORE_JUMP2(op, loc, to, arg) \ | |
1372 store_op2 (op, loc, (to) - (loc) - 3, arg) | |
1373 | |
1374 /* Like `STORE_JUMP', but for inserting. Assume `b' is the buffer end. */ | |
1375 #define INSERT_JUMP(op, loc, to) \ | |
1376 insert_op1 (op, loc, (to) - (loc) - 3, b) | |
1377 | |
1378 /* Like `STORE_JUMP2', but for inserting. Assume `b' is the buffer end. */ | |
1379 #define INSERT_JUMP2(op, loc, to, arg) \ | |
1380 insert_op2 (op, loc, (to) - (loc) - 3, arg, b) | |
1381 | |
1382 | |
1383 /* This is not an arbitrary limit: the arguments which represent offsets | |
1384 into the pattern are two bytes long. So if 2^16 bytes turns out to | |
1385 be too small, many things would have to change. */ | |
1386 #define MAX_BUF_SIZE (1L << 16) | |
1387 | |
1388 | |
1389 /* Extend the buffer by twice its current size via realloc and | |
1390 reset the pointers that pointed into the old block to point to the | |
1391 correct places in the new one. If extending the buffer results in it | |
1392 being larger than MAX_BUF_SIZE, then flag memory exhausted. */ | |
1393 #define EXTEND_BUFFER() \ | |
1394 do { \ | |
1395 unsigned char *old_buffer = bufp->buffer; \ | |
1396 if (bufp->allocated == MAX_BUF_SIZE) \ | |
1397 return REG_ESIZE; \ | |
1398 bufp->allocated <<= 1; \ | |
1399 if (bufp->allocated > MAX_BUF_SIZE) \ | |
1400 bufp->allocated = MAX_BUF_SIZE; \ | |
1401 bufp->buffer = (unsigned char *) realloc (bufp->buffer, bufp->allocated);\ | |
1402 if (bufp->buffer == NULL) \ | |
1403 return REG_ESPACE; \ | |
1404 /* If the buffer moved, move all the pointers into it. */ \ | |
1405 if (old_buffer != bufp->buffer) \ | |
1406 { \ | |
1407 b = (b - old_buffer) + bufp->buffer; \ | |
1408 begalt = (begalt - old_buffer) + bufp->buffer; \ | |
1409 if (fixup_alt_jump) \ | |
1410 fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\ | |
1411 if (laststart) \ | |
1412 laststart = (laststart - old_buffer) + bufp->buffer; \ | |
1413 if (pending_exact) \ | |
1414 pending_exact = (pending_exact - old_buffer) + bufp->buffer; \ | |
1415 } \ | |
1416 } while (0) | |
1417 | |
1418 | |
1419 /* Since we have one byte reserved for the register number argument to | |
1420 {start,stop}_memory, the maximum number of groups we can report | |
1421 things about is what fits in that byte. */ | |
1422 #define MAX_REGNUM 255 | |
1423 | |
1424 /* But patterns can have more than `MAX_REGNUM' registers. We just | |
1425 ignore the excess. */ | |
1426 typedef unsigned regnum_t; | |
1427 | |
1428 | |
1429 /* Macros for the compile stack. */ | |
1430 | |
1431 /* Since offsets can go either forwards or backwards, this type needs to | |
1432 be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */ | |
1433 typedef int pattern_offset_t; | |
1434 | |
1435 typedef struct | |
1436 { | |
1437 pattern_offset_t begalt_offset; | |
1438 pattern_offset_t fixup_alt_jump; | |
1439 pattern_offset_t inner_group_offset; | |
1440 pattern_offset_t laststart_offset; | |
1441 regnum_t regnum; | |
1442 } compile_stack_elt_t; | |
1443 | |
1444 | |
1445 typedef struct | |
1446 { | |
1447 compile_stack_elt_t *stack; | |
1448 unsigned size; | |
1449 unsigned avail; /* Offset of next open position. */ | |
1450 } compile_stack_type; | |
1451 | |
1452 | |
1453 #define INIT_COMPILE_STACK_SIZE 32 | |
1454 | |
1455 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0) | |
1456 #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size) | |
1457 | |
1458 /* The next available element. */ | |
1459 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail]) | |
1460 | |
1461 | |
1462 /* Set the bit for character C in a list. */ | |
1463 #define SET_LIST_BIT(c) \ | |
1464 (b[((unsigned char) (c)) / BYTEWIDTH] \ | |
1465 |= 1 << (((unsigned char) c) % BYTEWIDTH)) | |
1466 | |
1467 | |
1468 /* Get the next unsigned number in the uncompiled pattern. */ | |
1469 #define GET_UNSIGNED_NUMBER(num) \ | |
1470 { if (p != pend) \ | |
1471 { \ | |
1472 PATFETCH (c); \ | |
1668 | 1473 while (ISDIGIT (c)) \ |
1155 | 1474 { \ |
1475 if (num < 0) \ | |
1476 num = 0; \ | |
1477 num = num * 10 + c - '0'; \ | |
1478 if (p == pend) \ | |
1479 break; \ | |
1480 PATFETCH (c); \ | |
1481 } \ | |
1482 } \ | |
1483 } | |
1484 | |
1485 #define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */ | |
1486 | |
1487 #define IS_CHAR_CLASS(string) \ | |
1488 (STREQ (string, "alpha") || STREQ (string, "upper") \ | |
1489 || STREQ (string, "lower") || STREQ (string, "digit") \ | |
1490 || STREQ (string, "alnum") || STREQ (string, "xdigit") \ | |
1491 || STREQ (string, "space") || STREQ (string, "print") \ | |
1492 || STREQ (string, "punct") || STREQ (string, "graph") \ | |
1493 || STREQ (string, "cntrl") || STREQ (string, "blank")) | |
1494 | |
1495 /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX. | |
1496 Returns one of error codes defined in `regex.h', or zero for success. | |
1497 | |
1498 Assumes the `allocated' (and perhaps `buffer') and `translate' | |
1499 fields are set in BUFP on entry. | |
1500 | |
1501 If it succeeds, results are put in BUFP (if it returns an error, the | |
1502 contents of BUFP are undefined): | |
1503 `buffer' is the compiled pattern; | |
1504 `syntax' is set to SYNTAX; | |
1505 `used' is set to the length of the compiled pattern; | |
1637 | 1506 `fastmap_accurate' is zero; |
1507 `re_nsub' is the number of subexpressions in PATTERN; | |
1508 `not_bol' and `not_eol' are zero; | |
1155 | 1509 |
1510 The `fastmap' and `newline_anchor' fields are neither | |
1511 examined nor set. */ | |
1512 | |
8102 | 1513 /* Return, freeing storage we allocated. */ |
1514 #define FREE_STACK_RETURN(value) \ | |
8254
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
1515 return (free (compile_stack.stack), value) |
8102 | 1516 |
1155 | 1517 static reg_errcode_t |
1518 regex_compile (pattern, size, syntax, bufp) | |
1519 const char *pattern; | |
1520 int size; | |
1521 reg_syntax_t syntax; | |
1522 struct re_pattern_buffer *bufp; | |
1523 { | |
1524 /* We fetch characters from PATTERN here. Even though PATTERN is | |
1525 `char *' (i.e., signed), we declare these variables as unsigned, so | |
1526 they can be reliably used as array indices. */ | |
1527 register unsigned char c, c1; | |
1528 | |
5841 | 1529 /* A random temporary spot in PATTERN. */ |
1155 | 1530 const char *p1; |
1531 | |
1532 /* Points to the end of the buffer, where we should append. */ | |
1533 register unsigned char *b; | |
1534 | |
1535 /* Keeps track of unclosed groups. */ | |
1536 compile_stack_type compile_stack; | |
1537 | |
1538 /* Points to the current (ending) position in the pattern. */ | |
1539 const char *p = pattern; | |
1540 const char *pend = pattern + size; | |
1541 | |
1542 /* How to translate the characters in the pattern. */ | |
1543 char *translate = bufp->translate; | |
1544 | |
1545 /* Address of the count-byte of the most recently inserted `exactn' | |
1546 command. This makes it possible to tell if a new exact-match | |
1547 character can be added to that command or if the character requires | |
1548 a new `exactn' command. */ | |
1549 unsigned char *pending_exact = 0; | |
1550 | |
1551 /* Address of start of the most recently finished expression. | |
1552 This tells, e.g., postfix * where to find the start of its | |
1553 operand. Reset at the beginning of groups and alternatives. */ | |
1554 unsigned char *laststart = 0; | |
1555 | |
1556 /* Address of beginning of regexp, or inside of last group. */ | |
1557 unsigned char *begalt; | |
1558 | |
1559 /* Place in the uncompiled pattern (i.e., the {) to | |
1560 which to go back if the interval is invalid. */ | |
1561 const char *beg_interval; | |
1562 | |
1563 /* Address of the place where a forward jump should go to the end of | |
1564 the containing expression. Each alternative of an `or' -- except the | |
1565 last -- ends with a forward jump of this sort. */ | |
1566 unsigned char *fixup_alt_jump = 0; | |
1567 | |
1568 /* Counts open-groups as they are encountered. Remembered for the | |
1569 matching close-group on the compile stack, so the same register | |
1570 number is put in the stop_memory as the start_memory. */ | |
1571 regnum_t regnum = 0; | |
1572 | |
1573 #ifdef DEBUG | |
1574 DEBUG_PRINT1 ("\nCompiling pattern: "); | |
1575 if (debug) | |
1576 { | |
1577 unsigned debug_count; | |
1578 | |
1579 for (debug_count = 0; debug_count < size; debug_count++) | |
10297
d6ba9ccec333
(regex_compile): Use putchar, not printchar.
Richard M. Stallman <rms@gnu.org>
parents:
10242
diff
changeset
|
1580 putchar (pattern[debug_count]); |
1155 | 1581 putchar ('\n'); |
1582 } | |
1583 #endif /* DEBUG */ | |
1584 | |
1585 /* Initialize the compile stack. */ | |
1586 compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t); | |
1587 if (compile_stack.stack == NULL) | |
1588 return REG_ESPACE; | |
1589 | |
1590 compile_stack.size = INIT_COMPILE_STACK_SIZE; | |
1591 compile_stack.avail = 0; | |
1592 | |
1593 /* Initialize the pattern buffer. */ | |
1594 bufp->syntax = syntax; | |
1595 bufp->fastmap_accurate = 0; | |
1596 bufp->not_bol = bufp->not_eol = 0; | |
1597 | |
1598 /* Set `used' to zero, so that if we return an error, the pattern | |
1599 printer (for debugging) will think there's no pattern. We reset it | |
1600 at the end. */ | |
1601 bufp->used = 0; | |
1602 | |
1603 /* Always count groups, whether or not bufp->no_sub is set. */ | |
1604 bufp->re_nsub = 0; | |
1605 | |
1606 #if !defined (emacs) && !defined (SYNTAX_TABLE) | |
1607 /* Initialize the syntax table. */ | |
1608 init_syntax_once (); | |
1609 #endif | |
1610 | |
1611 if (bufp->allocated == 0) | |
1612 { | |
1613 if (bufp->buffer) | |
1614 { /* If zero allocated, but buffer is non-null, try to realloc | |
1615 enough space. This loses if buffer's address is bogus, but | |
1616 that is the user's responsibility. */ | |
1617 RETALLOC (bufp->buffer, INIT_BUF_SIZE, unsigned char); | |
1618 } | |
1619 else | |
1620 { /* Caller did not allocate a buffer. Do it for them. */ | |
1621 bufp->buffer = TALLOC (INIT_BUF_SIZE, unsigned char); | |
1622 } | |
8102 | 1623 if (!bufp->buffer) FREE_STACK_RETURN (REG_ESPACE); |
1155 | 1624 |
1625 bufp->allocated = INIT_BUF_SIZE; | |
1626 } | |
1627 | |
1628 begalt = b = bufp->buffer; | |
1629 | |
1630 /* Loop through the uncompiled pattern until we're at the end. */ | |
1631 while (p != pend) | |
1632 { | |
1633 PATFETCH (c); | |
1634 | |
1635 switch (c) | |
1636 { | |
1637 case '^': | |
1638 { | |
1639 if ( /* If at start of pattern, it's an operator. */ | |
1640 p == pattern + 1 | |
1641 /* If context independent, it's an operator. */ | |
1642 || syntax & RE_CONTEXT_INDEP_ANCHORS | |
1643 /* Otherwise, depends on what's come before. */ | |
1644 || at_begline_loc_p (pattern, p, syntax)) | |
1645 BUF_PUSH (begline); | |
1646 else | |
1647 goto normal_char; | |
1648 } | |
1649 break; | |
1650 | |
1651 | |
1652 case '$': | |
1653 { | |
1654 if ( /* If at end of pattern, it's an operator. */ | |
1655 p == pend | |
1656 /* If context independent, it's an operator. */ | |
1657 || syntax & RE_CONTEXT_INDEP_ANCHORS | |
1658 /* Otherwise, depends on what's next. */ | |
1659 || at_endline_loc_p (p, pend, syntax)) | |
1660 BUF_PUSH (endline); | |
1661 else | |
1662 goto normal_char; | |
1663 } | |
1664 break; | |
1665 | |
1666 | |
1667 case '+': | |
1668 case '?': | |
1669 if ((syntax & RE_BK_PLUS_QM) | |
1670 || (syntax & RE_LIMITED_OPS)) | |
1671 goto normal_char; | |
1672 handle_plus: | |
1673 case '*': | |
1674 /* If there is no previous pattern... */ | |
1675 if (!laststart) | |
1676 { | |
1677 if (syntax & RE_CONTEXT_INVALID_OPS) | |
8102 | 1678 FREE_STACK_RETURN (REG_BADRPT); |
1155 | 1679 else if (!(syntax & RE_CONTEXT_INDEP_OPS)) |
1680 goto normal_char; | |
1681 } | |
1682 | |
1683 { | |
1684 /* Are we optimizing this jump? */ | |
1685 boolean keep_string_p = false; | |
1686 | |
1687 /* 1 means zero (many) matches is allowed. */ | |
1688 char zero_times_ok = 0, many_times_ok = 0; | |
1689 | |
1690 /* If there is a sequence of repetition chars, collapse it | |
1691 down to just one (the right one). We can't combine | |
1692 interval operators with these because of, e.g., `a{2}*', | |
1693 which should only match an even number of `a's. */ | |
1694 | |
1695 for (;;) | |
1696 { | |
1697 zero_times_ok |= c != '+'; | |
1698 many_times_ok |= c != '?'; | |
1699 | |
1700 if (p == pend) | |
1701 break; | |
1702 | |
1703 PATFETCH (c); | |
1704 | |
1705 if (c == '*' | |
1706 || (!(syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?'))) | |
1707 ; | |
1708 | |
1709 else if (syntax & RE_BK_PLUS_QM && c == '\\') | |
1710 { | |
8102 | 1711 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); |
1155 | 1712 |
1713 PATFETCH (c1); | |
1714 if (!(c1 == '+' || c1 == '?')) | |
1715 { | |
1716 PATUNFETCH; | |
1717 PATUNFETCH; | |
1718 break; | |
1719 } | |
1720 | |
1721 c = c1; | |
1722 } | |
1723 else | |
1724 { | |
1725 PATUNFETCH; | |
1726 break; | |
1727 } | |
1728 | |
1729 /* If we get here, we found another repeat character. */ | |
1730 } | |
1731 | |
1732 /* Star, etc. applied to an empty pattern is equivalent | |
1733 to an empty pattern. */ | |
1734 if (!laststart) | |
1735 break; | |
1736 | |
1737 /* Now we know whether or not zero matches is allowed | |
1738 and also whether or not two or more matches is allowed. */ | |
1739 if (many_times_ok) | |
1740 { /* More than one repetition is allowed, so put in at the | |
1741 end a backward relative jump from `b' to before the next | |
1742 jump we're going to put in below (which jumps from | |
1743 laststart to after this jump). | |
1744 | |
1745 But if we are at the `*' in the exact sequence `.*\n', | |
1746 insert an unconditional jump backwards to the ., | |
1747 instead of the beginning of the loop. This way we only | |
1748 push a failure point once, instead of every time | |
1749 through the loop. */ | |
1750 assert (p - 1 > pattern); | |
1751 | |
1752 /* Allocate the space for the jump. */ | |
1753 GET_BUFFER_SPACE (3); | |
1754 | |
1755 /* We know we are not at the first character of the pattern, | |
1756 because laststart was nonzero. And we've already | |
1757 incremented `p', by the way, to be the character after | |
1758 the `*'. Do we have to do something analogous here | |
1759 for null bytes, because of RE_DOT_NOT_NULL? */ | |
1760 if (TRANSLATE (*(p - 2)) == TRANSLATE ('.') | |
2453 | 1761 && zero_times_ok |
1155 | 1762 && p < pend && TRANSLATE (*p) == TRANSLATE ('\n') |
1763 && !(syntax & RE_DOT_NEWLINE)) | |
1764 { /* We have .*\n. */ | |
1765 STORE_JUMP (jump, b, laststart); | |
1766 keep_string_p = true; | |
1767 } | |
1768 else | |
1769 /* Anything else. */ | |
1770 STORE_JUMP (maybe_pop_jump, b, laststart - 3); | |
1771 | |
1772 /* We've added more stuff to the buffer. */ | |
1773 b += 3; | |
1774 } | |
1775 | |
1776 /* On failure, jump from laststart to b + 3, which will be the | |
1777 end of the buffer after this jump is inserted. */ | |
1778 GET_BUFFER_SPACE (3); | |
1779 INSERT_JUMP (keep_string_p ? on_failure_keep_string_jump | |
1780 : on_failure_jump, | |
1781 laststart, b + 3); | |
1782 pending_exact = 0; | |
1783 b += 3; | |
1784 | |
1785 if (!zero_times_ok) | |
1786 { | |
1787 /* At least one repetition is required, so insert a | |
1788 `dummy_failure_jump' before the initial | |
1789 `on_failure_jump' instruction of the loop. This | |
1790 effects a skip over that instruction the first time | |
1791 we hit that loop. */ | |
1792 GET_BUFFER_SPACE (3); | |
1793 INSERT_JUMP (dummy_failure_jump, laststart, laststart + 6); | |
1794 b += 3; | |
1795 } | |
1796 } | |
1797 break; | |
1798 | |
1799 | |
1800 case '.': | |
1801 laststart = b; | |
1802 BUF_PUSH (anychar); | |
1803 break; | |
1804 | |
1805 | |
1806 case '[': | |
1807 { | |
1808 boolean had_char_class = false; | |
1809 | |
8102 | 1810 if (p == pend) FREE_STACK_RETURN (REG_EBRACK); |
1155 | 1811 |
1812 /* Ensure that we have enough space to push a charset: the | |
1813 opcode, the length count, and the bitset; 34 bytes in all. */ | |
1814 GET_BUFFER_SPACE (34); | |
1815 | |
1816 laststart = b; | |
1817 | |
1818 /* We test `*p == '^' twice, instead of using an if | |
1819 statement, so we only need one BUF_PUSH. */ | |
1820 BUF_PUSH (*p == '^' ? charset_not : charset); | |
1821 if (*p == '^') | |
1822 p++; | |
1823 | |
1824 /* Remember the first position in the bracket expression. */ | |
1825 p1 = p; | |
1826 | |
1827 /* Push the number of bytes in the bitmap. */ | |
1828 BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH); | |
1829 | |
1830 /* Clear the whole map. */ | |
1831 bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH); | |
1832 | |
1833 /* charset_not matches newline according to a syntax bit. */ | |
1834 if ((re_opcode_t) b[-2] == charset_not | |
1835 && (syntax & RE_HAT_LISTS_NOT_NEWLINE)) | |
1836 SET_LIST_BIT ('\n'); | |
1837 | |
1838 /* Read in characters and ranges, setting map bits. */ | |
1839 for (;;) | |
1840 { | |
8102 | 1841 if (p == pend) FREE_STACK_RETURN (REG_EBRACK); |
1155 | 1842 |
1843 PATFETCH (c); | |
1844 | |
1845 /* \ might escape characters inside [...] and [^...]. */ | |
1846 if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\') | |
1847 { | |
8102 | 1848 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); |
1155 | 1849 |
1850 PATFETCH (c1); | |
1851 SET_LIST_BIT (c1); | |
1852 continue; | |
1853 } | |
1854 | |
1855 /* Could be the end of the bracket expression. If it's | |
1856 not (i.e., when the bracket expression is `[]' so | |
1857 far), the ']' character bit gets set way below. */ | |
1858 if (c == ']' && p != p1 + 1) | |
1859 break; | |
1860 | |
1861 /* Look ahead to see if it's a range when the last thing | |
1862 was a character class. */ | |
1863 if (had_char_class && c == '-' && *p != ']') | |
8102 | 1864 FREE_STACK_RETURN (REG_ERANGE); |
1155 | 1865 |
1866 /* Look ahead to see if it's a range when the last thing | |
1867 was a character: if this is a hyphen not at the | |
1868 beginning or the end of a list, then it's the range | |
1869 operator. */ | |
1870 if (c == '-' | |
1871 && !(p - 2 >= pattern && p[-2] == '[') | |
1872 && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^') | |
1873 && *p != ']') | |
1874 { | |
1875 reg_errcode_t ret | |
1876 = compile_range (&p, pend, translate, syntax, b); | |
8102 | 1877 if (ret != REG_NOERROR) FREE_STACK_RETURN (ret); |
1155 | 1878 } |
1879 | |
1880 else if (p[0] == '-' && p[1] != ']') | |
1881 { /* This handles ranges made up of characters only. */ | |
1882 reg_errcode_t ret; | |
1883 | |
1884 /* Move past the `-'. */ | |
1885 PATFETCH (c1); | |
1886 | |
1887 ret = compile_range (&p, pend, translate, syntax, b); | |
8102 | 1888 if (ret != REG_NOERROR) FREE_STACK_RETURN (ret); |
1155 | 1889 } |
1890 | |
1891 /* See if we're at the beginning of a possible character | |
1892 class. */ | |
1893 | |
1894 else if (syntax & RE_CHAR_CLASSES && c == '[' && *p == ':') | |
1895 { /* Leave room for the null. */ | |
1896 char str[CHAR_CLASS_MAX_LENGTH + 1]; | |
1897 | |
1898 PATFETCH (c); | |
1899 c1 = 0; | |
1900 | |
1901 /* If pattern is `[[:'. */ | |
8102 | 1902 if (p == pend) FREE_STACK_RETURN (REG_EBRACK); |
1155 | 1903 |
1904 for (;;) | |
1905 { | |
1906 PATFETCH (c); | |
1907 if (c == ':' || c == ']' || p == pend | |
1908 || c1 == CHAR_CLASS_MAX_LENGTH) | |
1909 break; | |
1910 str[c1++] = c; | |
1911 } | |
1912 str[c1] = '\0'; | |
1913 | |
1914 /* If isn't a word bracketed by `[:' and:`]': | |
1915 undo the ending character, the letters, and leave | |
1916 the leading `:' and `[' (but set bits for them). */ | |
1917 if (c == ':' && *p == ']') | |
1918 { | |
1919 int ch; | |
1920 boolean is_alnum = STREQ (str, "alnum"); | |
1921 boolean is_alpha = STREQ (str, "alpha"); | |
1922 boolean is_blank = STREQ (str, "blank"); | |
1923 boolean is_cntrl = STREQ (str, "cntrl"); | |
1924 boolean is_digit = STREQ (str, "digit"); | |
1925 boolean is_graph = STREQ (str, "graph"); | |
1926 boolean is_lower = STREQ (str, "lower"); | |
1927 boolean is_print = STREQ (str, "print"); | |
1928 boolean is_punct = STREQ (str, "punct"); | |
1929 boolean is_space = STREQ (str, "space"); | |
1930 boolean is_upper = STREQ (str, "upper"); | |
1931 boolean is_xdigit = STREQ (str, "xdigit"); | |
1932 | |
8102 | 1933 if (!IS_CHAR_CLASS (str)) |
1934 FREE_STACK_RETURN (REG_ECTYPE); | |
1155 | 1935 |
1936 /* Throw away the ] at the end of the character | |
1937 class. */ | |
1938 PATFETCH (c); | |
1939 | |
8102 | 1940 if (p == pend) FREE_STACK_RETURN (REG_EBRACK); |
1155 | 1941 |
1942 for (ch = 0; ch < 1 << BYTEWIDTH; ch++) | |
1943 { | |
8561
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1944 /* This was split into 3 if's to |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1945 avoid an arbitrary limit in some compiler. */ |
1668 | 1946 if ( (is_alnum && ISALNUM (ch)) |
1947 || (is_alpha && ISALPHA (ch)) | |
1948 || (is_blank && ISBLANK (ch)) | |
8561
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1949 || (is_cntrl && ISCNTRL (ch))) |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1950 SET_LIST_BIT (ch); |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1951 if ( (is_digit && ISDIGIT (ch)) |
1668 | 1952 || (is_graph && ISGRAPH (ch)) |
1953 || (is_lower && ISLOWER (ch)) | |
8561
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1954 || (is_print && ISPRINT (ch))) |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1955 SET_LIST_BIT (ch); |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1956 if ( (is_punct && ISPUNCT (ch)) |
1668 | 1957 || (is_space && ISSPACE (ch)) |
1958 || (is_upper && ISUPPER (ch)) | |
1959 || (is_xdigit && ISXDIGIT (ch))) | |
8561
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
1960 SET_LIST_BIT (ch); |
1155 | 1961 } |
1962 had_char_class = true; | |
1963 } | |
1964 else | |
1965 { | |
1966 c1++; | |
1967 while (c1--) | |
1968 PATUNFETCH; | |
1969 SET_LIST_BIT ('['); | |
1970 SET_LIST_BIT (':'); | |
1971 had_char_class = false; | |
1972 } | |
1973 } | |
1974 else | |
1975 { | |
1976 had_char_class = false; | |
1977 SET_LIST_BIT (c); | |
1978 } | |
1979 } | |
1980 | |
1981 /* Discard any (non)matching list bytes that are all 0 at the | |
1982 end of the map. Decrease the map-length byte too. */ | |
1983 while ((int) b[-1] > 0 && b[b[-1] - 1] == 0) | |
1984 b[-1]--; | |
1985 b += b[-1]; | |
1986 } | |
1987 break; | |
1988 | |
1989 | |
1990 case '(': | |
1991 if (syntax & RE_NO_BK_PARENS) | |
1992 goto handle_open; | |
1993 else | |
1994 goto normal_char; | |
1995 | |
1996 | |
1997 case ')': | |
1998 if (syntax & RE_NO_BK_PARENS) | |
1999 goto handle_close; | |
2000 else | |
2001 goto normal_char; | |
2002 | |
2003 | |
2004 case '\n': | |
2005 if (syntax & RE_NEWLINE_ALT) | |
2006 goto handle_alt; | |
2007 else | |
2008 goto normal_char; | |
2009 | |
2010 | |
2011 case '|': | |
2012 if (syntax & RE_NO_BK_VBAR) | |
2013 goto handle_alt; | |
2014 else | |
2015 goto normal_char; | |
2016 | |
2017 | |
2018 case '{': | |
2019 if (syntax & RE_INTERVALS && syntax & RE_NO_BK_BRACES) | |
2020 goto handle_interval; | |
2021 else | |
2022 goto normal_char; | |
2023 | |
2024 | |
2025 case '\\': | |
8102 | 2026 if (p == pend) FREE_STACK_RETURN (REG_EESCAPE); |
1155 | 2027 |
2028 /* Do not translate the character after the \, so that we can | |
2029 distinguish, e.g., \B from \b, even if we normally would | |
2030 translate, e.g., B to b. */ | |
2031 PATFETCH_RAW (c); | |
2032 | |
2033 switch (c) | |
2034 { | |
2035 case '(': | |
2036 if (syntax & RE_NO_BK_PARENS) | |
2037 goto normal_backslash; | |
2038 | |
2039 handle_open: | |
2040 bufp->re_nsub++; | |
2041 regnum++; | |
2042 | |
2043 if (COMPILE_STACK_FULL) | |
2044 { | |
2045 RETALLOC (compile_stack.stack, compile_stack.size << 1, | |
2046 compile_stack_elt_t); | |
2047 if (compile_stack.stack == NULL) return REG_ESPACE; | |
2048 | |
2049 compile_stack.size <<= 1; | |
2050 } | |
2051 | |
2052 /* These are the values to restore when we hit end of this | |
2053 group. They are all relative offsets, so that if the | |
2054 whole pattern moves because of realloc, they will still | |
2055 be valid. */ | |
2056 COMPILE_STACK_TOP.begalt_offset = begalt - bufp->buffer; | |
2057 COMPILE_STACK_TOP.fixup_alt_jump | |
2058 = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0; | |
2059 COMPILE_STACK_TOP.laststart_offset = b - bufp->buffer; | |
2060 COMPILE_STACK_TOP.regnum = regnum; | |
2061 | |
2062 /* We will eventually replace the 0 with the number of | |
2063 groups inner to this one. But do not push a | |
2064 start_memory for groups beyond the last one we can | |
2065 represent in the compiled pattern. */ | |
2066 if (regnum <= MAX_REGNUM) | |
2067 { | |
2068 COMPILE_STACK_TOP.inner_group_offset = b - bufp->buffer + 2; | |
2069 BUF_PUSH_3 (start_memory, regnum, 0); | |
2070 } | |
2071 | |
2072 compile_stack.avail++; | |
2073 | |
2074 fixup_alt_jump = 0; | |
2075 laststart = 0; | |
2076 begalt = b; | |
2453 | 2077 /* If we've reached MAX_REGNUM groups, then this open |
2078 won't actually generate any code, so we'll have to | |
2079 clear pending_exact explicitly. */ | |
2080 pending_exact = 0; | |
1155 | 2081 break; |
2082 | |
2083 | |
2084 case ')': | |
2085 if (syntax & RE_NO_BK_PARENS) goto normal_backslash; | |
2086 | |
2087 if (COMPILE_STACK_EMPTY) | |
2088 if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD) | |
2089 goto normal_backslash; | |
2090 else | |
8102 | 2091 FREE_STACK_RETURN (REG_ERPAREN); |
1155 | 2092 |
2093 handle_close: | |
2094 if (fixup_alt_jump) | |
2095 { /* Push a dummy failure point at the end of the | |
2096 alternative for a possible future | |
2097 `pop_failure_jump' to pop. See comments at | |
2098 `push_dummy_failure' in `re_match_2'. */ | |
2099 BUF_PUSH (push_dummy_failure); | |
2100 | |
2101 /* We allocated space for this jump when we assigned | |
2102 to `fixup_alt_jump', in the `handle_alt' case below. */ | |
2103 STORE_JUMP (jump_past_alt, fixup_alt_jump, b - 1); | |
2104 } | |
2105 | |
2106 /* See similar code for backslashed left paren above. */ | |
2107 if (COMPILE_STACK_EMPTY) | |
2108 if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD) | |
2109 goto normal_char; | |
2110 else | |
8102 | 2111 FREE_STACK_RETURN (REG_ERPAREN); |
1155 | 2112 |
2113 /* Since we just checked for an empty stack above, this | |
2114 ``can't happen''. */ | |
2115 assert (compile_stack.avail != 0); | |
2116 { | |
2117 /* We don't just want to restore into `regnum', because | |
2118 later groups should continue to be numbered higher, | |
2119 as in `(ab)c(de)' -- the second group is #2. */ | |
2120 regnum_t this_group_regnum; | |
2121 | |
2122 compile_stack.avail--; | |
2123 begalt = bufp->buffer + COMPILE_STACK_TOP.begalt_offset; | |
2124 fixup_alt_jump | |
2125 = COMPILE_STACK_TOP.fixup_alt_jump | |
2126 ? bufp->buffer + COMPILE_STACK_TOP.fixup_alt_jump - 1 | |
2127 : 0; | |
2128 laststart = bufp->buffer + COMPILE_STACK_TOP.laststart_offset; | |
2129 this_group_regnum = COMPILE_STACK_TOP.regnum; | |
2453 | 2130 /* If we've reached MAX_REGNUM groups, then this open |
2131 won't actually generate any code, so we'll have to | |
2132 clear pending_exact explicitly. */ | |
2133 pending_exact = 0; | |
1155 | 2134 |
2135 /* We're at the end of the group, so now we know how many | |
2136 groups were inside this one. */ | |
2137 if (this_group_regnum <= MAX_REGNUM) | |
2138 { | |
2139 unsigned char *inner_group_loc | |
2140 = bufp->buffer + COMPILE_STACK_TOP.inner_group_offset; | |
2141 | |
2142 *inner_group_loc = regnum - this_group_regnum; | |
2143 BUF_PUSH_3 (stop_memory, this_group_regnum, | |
2144 regnum - this_group_regnum); | |
2145 } | |
2146 } | |
2147 break; | |
2148 | |
2149 | |
2150 case '|': /* `\|'. */ | |
2151 if (syntax & RE_LIMITED_OPS || syntax & RE_NO_BK_VBAR) | |
2152 goto normal_backslash; | |
2153 handle_alt: | |
2154 if (syntax & RE_LIMITED_OPS) | |
2155 goto normal_char; | |
2156 | |
2157 /* Insert before the previous alternative a jump which | |
2158 jumps to this alternative if the former fails. */ | |
2159 GET_BUFFER_SPACE (3); | |
2160 INSERT_JUMP (on_failure_jump, begalt, b + 6); | |
2161 pending_exact = 0; | |
2162 b += 3; | |
2163 | |
2164 /* The alternative before this one has a jump after it | |
2165 which gets executed if it gets matched. Adjust that | |
2166 jump so it will jump to this alternative's analogous | |
2167 jump (put in below, which in turn will jump to the next | |
2168 (if any) alternative's such jump, etc.). The last such | |
2169 jump jumps to the correct final destination. A picture: | |
2170 _____ _____ | |
2171 | | | | | |
2172 | v | v | |
2173 a | b | c | |
2174 | |
1637 | 2175 If we are at `b', then fixup_alt_jump right now points to a |
2176 three-byte space after `a'. We'll put in the jump, set | |
2177 fixup_alt_jump to right after `b', and leave behind three | |
2178 bytes which we'll fill in when we get to after `c'. */ | |
1155 | 2179 |
2180 if (fixup_alt_jump) | |
2181 STORE_JUMP (jump_past_alt, fixup_alt_jump, b); | |
2182 | |
2183 /* Mark and leave space for a jump after this alternative, | |
2184 to be filled in later either by next alternative or | |
2185 when know we're at the end of a series of alternatives. */ | |
2186 fixup_alt_jump = b; | |
2187 GET_BUFFER_SPACE (3); | |
2188 b += 3; | |
2189 | |
2190 laststart = 0; | |
2191 begalt = b; | |
2192 break; | |
2193 | |
2194 | |
2195 case '{': | |
2196 /* If \{ is a literal. */ | |
2197 if (!(syntax & RE_INTERVALS) | |
2198 /* If we're at `\{' and it's not the open-interval | |
2199 operator. */ | |
2200 || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES)) | |
2201 || (p - 2 == pattern && p == pend)) | |
2202 goto normal_backslash; | |
2203 | |
2204 handle_interval: | |
2205 { | |
2206 /* If got here, then the syntax allows intervals. */ | |
2207 | |
2208 /* At least (most) this many matches must be made. */ | |
2209 int lower_bound = -1, upper_bound = -1; | |
2210 | |
2211 beg_interval = p - 1; | |
2212 | |
2213 if (p == pend) | |
2214 { | |
2215 if (syntax & RE_NO_BK_BRACES) | |
2216 goto unfetch_interval; | |
2217 else | |
8102 | 2218 FREE_STACK_RETURN (REG_EBRACE); |
1155 | 2219 } |
2220 | |
2221 GET_UNSIGNED_NUMBER (lower_bound); | |
2222 | |
2223 if (c == ',') | |
2224 { | |
2225 GET_UNSIGNED_NUMBER (upper_bound); | |
2226 if (upper_bound < 0) upper_bound = RE_DUP_MAX; | |
2227 } | |
2228 else | |
2229 /* Interval such as `{1}' => match exactly once. */ | |
2230 upper_bound = lower_bound; | |
2231 | |
2232 if (lower_bound < 0 || upper_bound > RE_DUP_MAX | |
2233 || lower_bound > upper_bound) | |
2234 { | |
2235 if (syntax & RE_NO_BK_BRACES) | |
2236 goto unfetch_interval; | |
2237 else | |
8102 | 2238 FREE_STACK_RETURN (REG_BADBR); |
1155 | 2239 } |
2240 | |
2241 if (!(syntax & RE_NO_BK_BRACES)) | |
2242 { | |
8102 | 2243 if (c != '\\') FREE_STACK_RETURN (REG_EBRACE); |
1155 | 2244 |
2245 PATFETCH (c); | |
2246 } | |
2247 | |
2248 if (c != '}') | |
2249 { | |
2250 if (syntax & RE_NO_BK_BRACES) | |
2251 goto unfetch_interval; | |
2252 else | |
8102 | 2253 FREE_STACK_RETURN (REG_BADBR); |
1155 | 2254 } |
2255 | |
2256 /* We just parsed a valid interval. */ | |
2257 | |
2258 /* If it's invalid to have no preceding re. */ | |
2259 if (!laststart) | |
2260 { | |
2261 if (syntax & RE_CONTEXT_INVALID_OPS) | |
8102 | 2262 FREE_STACK_RETURN (REG_BADRPT); |
1155 | 2263 else if (syntax & RE_CONTEXT_INDEP_OPS) |
2264 laststart = b; | |
2265 else | |
2266 goto unfetch_interval; | |
2267 } | |
2268 | |
2269 /* If the upper bound is zero, don't want to succeed at | |
2270 all; jump from `laststart' to `b + 3', which will be | |
2271 the end of the buffer after we insert the jump. */ | |
2272 if (upper_bound == 0) | |
2273 { | |
2274 GET_BUFFER_SPACE (3); | |
2275 INSERT_JUMP (jump, laststart, b + 3); | |
2276 b += 3; | |
2277 } | |
2278 | |
2279 /* Otherwise, we have a nontrivial interval. When | |
2280 we're all done, the pattern will look like: | |
2281 set_number_at <jump count> <upper bound> | |
2282 set_number_at <succeed_n count> <lower bound> | |
5841 | 2283 succeed_n <after jump addr> <succeed_n count> |
1155 | 2284 <body of loop> |
2285 jump_n <succeed_n addr> <jump count> | |
2286 (The upper bound and `jump_n' are omitted if | |
2287 `upper_bound' is 1, though.) */ | |
2288 else | |
2289 { /* If the upper bound is > 1, we need to insert | |
2290 more at the end of the loop. */ | |
2291 unsigned nbytes = 10 + (upper_bound > 1) * 10; | |
2292 | |
2293 GET_BUFFER_SPACE (nbytes); | |
2294 | |
2295 /* Initialize lower bound of the `succeed_n', even | |
2296 though it will be set during matching by its | |
2297 attendant `set_number_at' (inserted next), | |
2298 because `re_compile_fastmap' needs to know. | |
2299 Jump to the `jump_n' we might insert below. */ | |
2300 INSERT_JUMP2 (succeed_n, laststart, | |
2301 b + 5 + (upper_bound > 1) * 5, | |
2302 lower_bound); | |
2303 b += 5; | |
2304 | |
2305 /* Code to initialize the lower bound. Insert | |
2306 before the `succeed_n'. The `5' is the last two | |
2307 bytes of this `set_number_at', plus 3 bytes of | |
2308 the following `succeed_n'. */ | |
2309 insert_op2 (set_number_at, laststart, 5, lower_bound, b); | |
2310 b += 5; | |
2311 | |
2312 if (upper_bound > 1) | |
2313 { /* More than one repetition is allowed, so | |
2314 append a backward jump to the `succeed_n' | |
2315 that starts this interval. | |
2316 | |
2317 When we've reached this during matching, | |
2318 we'll have matched the interval once, so | |
2319 jump back only `upper_bound - 1' times. */ | |
2320 STORE_JUMP2 (jump_n, b, laststart + 5, | |
2321 upper_bound - 1); | |
2322 b += 5; | |
2323 | |
2324 /* The location we want to set is the second | |
2325 parameter of the `jump_n'; that is `b-2' as | |
2326 an absolute address. `laststart' will be | |
2327 the `set_number_at' we're about to insert; | |
2328 `laststart+3' the number to set, the source | |
2329 for the relative address. But we are | |
2330 inserting into the middle of the pattern -- | |
2331 so everything is getting moved up by 5. | |
2332 Conclusion: (b - 2) - (laststart + 3) + 5, | |
2333 i.e., b - laststart. | |
2334 | |
2335 We insert this at the beginning of the loop | |
2336 so that if we fail during matching, we'll | |
2337 reinitialize the bounds. */ | |
2338 insert_op2 (set_number_at, laststart, b - laststart, | |
2339 upper_bound - 1, b); | |
2340 b += 5; | |
2341 } | |
2342 } | |
2343 pending_exact = 0; | |
2344 beg_interval = NULL; | |
2345 } | |
2346 break; | |
2347 | |
2348 unfetch_interval: | |
2349 /* If an invalid interval, match the characters as literals. */ | |
2350 assert (beg_interval); | |
2351 p = beg_interval; | |
2352 beg_interval = NULL; | |
2353 | |
2354 /* normal_char and normal_backslash need `c'. */ | |
2355 PATFETCH (c); | |
2356 | |
2357 if (!(syntax & RE_NO_BK_BRACES)) | |
2358 { | |
2359 if (p > pattern && p[-1] == '\\') | |
2360 goto normal_backslash; | |
2361 } | |
2362 goto normal_char; | |
2363 | |
2364 #ifdef emacs | |
2365 /* There is no way to specify the before_dot and after_dot | |
2366 operators. rms says this is ok. --karl */ | |
2367 case '=': | |
2368 BUF_PUSH (at_dot); | |
2369 break; | |
2370 | |
2371 case 's': | |
2372 laststart = b; | |
2373 PATFETCH (c); | |
2374 BUF_PUSH_2 (syntaxspec, syntax_spec_code[c]); | |
2375 break; | |
2376 | |
2377 case 'S': | |
2378 laststart = b; | |
2379 PATFETCH (c); | |
2380 BUF_PUSH_2 (notsyntaxspec, syntax_spec_code[c]); | |
2381 break; | |
2382 #endif /* emacs */ | |
2383 | |
2384 | |
2385 case 'w': | |
2386 laststart = b; | |
2387 BUF_PUSH (wordchar); | |
2388 break; | |
2389 | |
2390 | |
2391 case 'W': | |
2392 laststart = b; | |
2393 BUF_PUSH (notwordchar); | |
2394 break; | |
2395 | |
2396 | |
2397 case '<': | |
2398 BUF_PUSH (wordbeg); | |
2399 break; | |
2400 | |
2401 case '>': | |
2402 BUF_PUSH (wordend); | |
2403 break; | |
2404 | |
2405 case 'b': | |
2406 BUF_PUSH (wordbound); | |
2407 break; | |
2408 | |
2409 case 'B': | |
2410 BUF_PUSH (notwordbound); | |
2411 break; | |
2412 | |
2413 case '`': | |
2414 BUF_PUSH (begbuf); | |
2415 break; | |
2416 | |
2417 case '\'': | |
2418 BUF_PUSH (endbuf); | |
2419 break; | |
2420 | |
2421 case '1': case '2': case '3': case '4': case '5': | |
2422 case '6': case '7': case '8': case '9': | |
2423 if (syntax & RE_NO_BK_REFS) | |
2424 goto normal_char; | |
2425 | |
2426 c1 = c - '0'; | |
2427 | |
2428 if (c1 > regnum) | |
8102 | 2429 FREE_STACK_RETURN (REG_ESUBREG); |
1155 | 2430 |
2431 /* Can't back reference to a subexpression if inside of it. */ | |
2432 if (group_in_compile_stack (compile_stack, c1)) | |
2433 goto normal_char; | |
2434 | |
2435 laststart = b; | |
2436 BUF_PUSH_2 (duplicate, c1); | |
2437 break; | |
2438 | |
2439 | |
2440 case '+': | |
2441 case '?': | |
2442 if (syntax & RE_BK_PLUS_QM) | |
2443 goto handle_plus; | |
2444 else | |
2445 goto normal_backslash; | |
2446 | |
2447 default: | |
2448 normal_backslash: | |
2449 /* You might think it would be useful for \ to mean | |
2450 not to translate; but if we don't translate it | |
2451 it will never match anything. */ | |
2452 c = TRANSLATE (c); | |
2453 goto normal_char; | |
2454 } | |
2455 break; | |
2456 | |
2457 | |
2458 default: | |
2459 /* Expects the character in `c'. */ | |
2460 normal_char: | |
2461 /* If no exactn currently being built. */ | |
2462 if (!pending_exact | |
2463 | |
2464 /* If last exactn not at current position. */ | |
2465 || pending_exact + *pending_exact + 1 != b | |
2466 | |
2467 /* We have only one byte following the exactn for the count. */ | |
2468 || *pending_exact == (1 << BYTEWIDTH) - 1 | |
2469 | |
2470 /* If followed by a repetition operator. */ | |
2471 || *p == '*' || *p == '^' | |
2472 || ((syntax & RE_BK_PLUS_QM) | |
2473 ? *p == '\\' && (p[1] == '+' || p[1] == '?') | |
2474 : (*p == '+' || *p == '?')) | |
2475 || ((syntax & RE_INTERVALS) | |
2476 && ((syntax & RE_NO_BK_BRACES) | |
2477 ? *p == '{' | |
2478 : (p[0] == '\\' && p[1] == '{')))) | |
2479 { | |
2480 /* Start building a new exactn. */ | |
2481 | |
2482 laststart = b; | |
2483 | |
2484 BUF_PUSH_2 (exactn, 0); | |
2485 pending_exact = b - 1; | |
2486 } | |
2487 | |
2488 BUF_PUSH (c); | |
2489 (*pending_exact)++; | |
2490 break; | |
2491 } /* switch (c) */ | |
2492 } /* while p != pend */ | |
2493 | |
2494 | |
2495 /* Through the pattern now. */ | |
2496 | |
2497 if (fixup_alt_jump) | |
2498 STORE_JUMP (jump_past_alt, fixup_alt_jump, b); | |
2499 | |
2500 if (!COMPILE_STACK_EMPTY) | |
8102 | 2501 FREE_STACK_RETURN (REG_EPAREN); |
1155 | 2502 |
9983
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
2503 /* If we don't want backtracking, force success |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
2504 the first time we reach the end of the compiled pattern. */ |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
2505 if (syntax & RE_NO_POSIX_BACKTRACKING) |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
2506 BUF_PUSH (succeed); |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
2507 |
1155 | 2508 free (compile_stack.stack); |
2509 | |
2510 /* We have succeeded; set the length of the buffer. */ | |
2511 bufp->used = b - bufp->buffer; | |
2512 | |
2513 #ifdef DEBUG | |
2514 if (debug) | |
2515 { | |
2615 | 2516 DEBUG_PRINT1 ("\nCompiled pattern: \n"); |
1155 | 2517 print_compiled_pattern (bufp); |
2518 } | |
2519 #endif /* DEBUG */ | |
2520 | |
2952 | 2521 #ifndef MATCH_MAY_ALLOCATE |
2949 | 2522 /* Initialize the failure stack to the largest possible stack. This |
2523 isn't necessary unless we're trying to avoid calling alloca in | |
2524 the search and match routines. */ | |
2525 { | |
2526 int num_regs = bufp->re_nsub + 1; | |
2527 | |
2528 /* Since DOUBLE_FAIL_STACK refuses to double only if the current size | |
2529 is strictly greater than re_max_failures, the largest possible stack | |
2530 is 2 * re_max_failures failure points. */ | |
7012 | 2531 if (fail_stack.size < (2 * re_max_failures * MAX_FAILURE_ITEMS)) |
7011 | 2532 { |
7012 | 2533 fail_stack.size = (2 * re_max_failures * MAX_FAILURE_ITEMS); |
7039
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2534 |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2535 #ifdef emacs |
7011 | 2536 if (! fail_stack.stack) |
7039
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2537 fail_stack.stack |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2538 = (fail_stack_elt_t *) xmalloc (fail_stack.size |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2539 * sizeof (fail_stack_elt_t)); |
7011 | 2540 else |
7039
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2541 fail_stack.stack |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2542 = (fail_stack_elt_t *) xrealloc (fail_stack.stack, |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2543 (fail_stack.size |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2544 * sizeof (fail_stack_elt_t))); |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2545 #else /* not emacs */ |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2546 if (! fail_stack.stack) |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2547 fail_stack.stack |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2548 = (fail_stack_elt_t *) malloc (fail_stack.size |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2549 * sizeof (fail_stack_elt_t)); |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2550 else |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2551 fail_stack.stack |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2552 = (fail_stack_elt_t *) realloc (fail_stack.stack, |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2553 (fail_stack.size |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2554 * sizeof (fail_stack_elt_t))); |
403172c099fc
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7012
diff
changeset
|
2555 #endif /* not emacs */ |
7011 | 2556 } |
2949 | 2557 |
2558 /* Initialize some other variables the matcher uses. */ | |
2559 RETALLOC_IF (regstart, num_regs, const char *); | |
2560 RETALLOC_IF (regend, num_regs, const char *); | |
2561 RETALLOC_IF (old_regstart, num_regs, const char *); | |
2562 RETALLOC_IF (old_regend, num_regs, const char *); | |
2563 RETALLOC_IF (best_regstart, num_regs, const char *); | |
2564 RETALLOC_IF (best_regend, num_regs, const char *); | |
2565 RETALLOC_IF (reg_info, num_regs, register_info_type); | |
2566 RETALLOC_IF (reg_dummy, num_regs, const char *); | |
2567 RETALLOC_IF (reg_info_dummy, num_regs, register_info_type); | |
2568 } | |
2569 #endif | |
2570 | |
1155 | 2571 return REG_NOERROR; |
2572 } /* regex_compile */ | |
2573 | |
2574 /* Subroutines for `regex_compile'. */ | |
2575 | |
2576 /* Store OP at LOC followed by two-byte integer parameter ARG. */ | |
2577 | |
2578 static void | |
2579 store_op1 (op, loc, arg) | |
2580 re_opcode_t op; | |
2581 unsigned char *loc; | |
2582 int arg; | |
2583 { | |
2584 *loc = (unsigned char) op; | |
2585 STORE_NUMBER (loc + 1, arg); | |
2586 } | |
2587 | |
2588 | |
2589 /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */ | |
2590 | |
2591 static void | |
2592 store_op2 (op, loc, arg1, arg2) | |
2593 re_opcode_t op; | |
2594 unsigned char *loc; | |
2595 int arg1, arg2; | |
2596 { | |
2597 *loc = (unsigned char) op; | |
2598 STORE_NUMBER (loc + 1, arg1); | |
2599 STORE_NUMBER (loc + 3, arg2); | |
2600 } | |
2601 | |
2602 | |
2603 /* Copy the bytes from LOC to END to open up three bytes of space at LOC | |
2604 for OP followed by two-byte integer parameter ARG. */ | |
2605 | |
2606 static void | |
2607 insert_op1 (op, loc, arg, end) | |
2608 re_opcode_t op; | |
2609 unsigned char *loc; | |
2610 int arg; | |
2611 unsigned char *end; | |
2612 { | |
2613 register unsigned char *pfrom = end; | |
2614 register unsigned char *pto = end + 3; | |
2615 | |
2616 while (pfrom != loc) | |
2617 *--pto = *--pfrom; | |
2618 | |
2619 store_op1 (op, loc, arg); | |
2620 } | |
2621 | |
2622 | |
2623 /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */ | |
2624 | |
2625 static void | |
2626 insert_op2 (op, loc, arg1, arg2, end) | |
2627 re_opcode_t op; | |
2628 unsigned char *loc; | |
2629 int arg1, arg2; | |
2630 unsigned char *end; | |
2631 { | |
2632 register unsigned char *pfrom = end; | |
2633 register unsigned char *pto = end + 5; | |
2634 | |
2635 while (pfrom != loc) | |
2636 *--pto = *--pfrom; | |
2637 | |
2638 store_op2 (op, loc, arg1, arg2); | |
2639 } | |
2640 | |
2641 | |
2642 /* P points to just after a ^ in PATTERN. Return true if that ^ comes | |
2643 after an alternative or a begin-subexpression. We assume there is at | |
2644 least one character before the ^. */ | |
2645 | |
2646 static boolean | |
2647 at_begline_loc_p (pattern, p, syntax) | |
2648 const char *pattern, *p; | |
2649 reg_syntax_t syntax; | |
2650 { | |
2651 const char *prev = p - 2; | |
2652 boolean prev_prev_backslash = prev > pattern && prev[-1] == '\\'; | |
2653 | |
2654 return | |
2655 /* After a subexpression? */ | |
2656 (*prev == '(' && (syntax & RE_NO_BK_PARENS || prev_prev_backslash)) | |
2657 /* After an alternative? */ | |
2658 || (*prev == '|' && (syntax & RE_NO_BK_VBAR || prev_prev_backslash)); | |
2659 } | |
2660 | |
2661 | |
2662 /* The dual of at_begline_loc_p. This one is for $. We assume there is | |
2663 at least one character after the $, i.e., `P < PEND'. */ | |
2664 | |
2665 static boolean | |
2666 at_endline_loc_p (p, pend, syntax) | |
2667 const char *p, *pend; | |
2668 int syntax; | |
2669 { | |
2670 const char *next = p; | |
2671 boolean next_backslash = *next == '\\'; | |
2672 const char *next_next = p + 1 < pend ? p + 1 : NULL; | |
2673 | |
2674 return | |
2675 /* Before a subexpression? */ | |
2676 (syntax & RE_NO_BK_PARENS ? *next == ')' | |
2677 : next_backslash && next_next && *next_next == ')') | |
2678 /* Before an alternative? */ | |
2679 || (syntax & RE_NO_BK_VBAR ? *next == '|' | |
2680 : next_backslash && next_next && *next_next == '|'); | |
2681 } | |
2682 | |
2683 | |
2684 /* Returns true if REGNUM is in one of COMPILE_STACK's elements and | |
2685 false if it's not. */ | |
2686 | |
2687 static boolean | |
2688 group_in_compile_stack (compile_stack, regnum) | |
2689 compile_stack_type compile_stack; | |
2690 regnum_t regnum; | |
2691 { | |
2692 int this_element; | |
2693 | |
2694 for (this_element = compile_stack.avail - 1; | |
2695 this_element >= 0; | |
2696 this_element--) | |
2697 if (compile_stack.stack[this_element].regnum == regnum) | |
2698 return true; | |
2699 | |
2700 return false; | |
2701 } | |
2702 | |
2703 | |
2704 /* Read the ending character of a range (in a bracket expression) from the | |
2705 uncompiled pattern *P_PTR (which ends at PEND). We assume the | |
2706 starting character is in `P[-2]'. (`P[-1]' is the character `-'.) | |
2707 Then we set the translation of all bits between the starting and | |
2708 ending characters (inclusive) in the compiled pattern B. | |
2709 | |
2710 Return an error code. | |
2711 | |
2712 We use these short variable names so we can use the same macros as | |
2713 `regex_compile' itself. */ | |
2714 | |
2715 static reg_errcode_t | |
2716 compile_range (p_ptr, pend, translate, syntax, b) | |
2717 const char **p_ptr, *pend; | |
2718 char *translate; | |
2719 reg_syntax_t syntax; | |
2720 unsigned char *b; | |
2721 { | |
2722 unsigned this_char; | |
2723 | |
2724 const char *p = *p_ptr; | |
1689 | 2725 int range_start, range_end; |
1155 | 2726 |
2727 if (p == pend) | |
2728 return REG_ERANGE; | |
2729 | |
1689 | 2730 /* Even though the pattern is a signed `char *', we need to fetch |
2731 with unsigned char *'s; if the high bit of the pattern character | |
2732 is set, the range endpoints will be negative if we fetch using a | |
2733 signed char *. | |
2734 | |
2735 We also want to fetch the endpoints without translating them; the | |
2736 appropriate translation is done in the bit-setting loop below. */ | |
9209 | 2737 /* The SVR4 compiler on the 3B2 had trouble with unsigned const char *. */ |
9208
0c6e2b5d3850
(compile_range): When casting to const unsigned char *, put const first.
Richard M. Stallman <rms@gnu.org>
parents:
9097
diff
changeset
|
2738 range_start = ((const unsigned char *) p)[-2]; |
0c6e2b5d3850
(compile_range): When casting to const unsigned char *, put const first.
Richard M. Stallman <rms@gnu.org>
parents:
9097
diff
changeset
|
2739 range_end = ((const unsigned char *) p)[0]; |
1155 | 2740 |
2741 /* Have to increment the pointer into the pattern string, so the | |
2742 caller isn't still at the ending character. */ | |
2743 (*p_ptr)++; | |
2744 | |
2745 /* If the start is after the end, the range is empty. */ | |
2746 if (range_start > range_end) | |
2747 return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR; | |
2748 | |
2749 /* Here we see why `this_char' has to be larger than an `unsigned | |
2750 char' -- the range is inclusive, so if `range_end' == 0xff | |
2751 (assuming 8-bit characters), we would otherwise go into an infinite | |
2752 loop, since all characters <= 0xff. */ | |
2753 for (this_char = range_start; this_char <= range_end; this_char++) | |
2754 { | |
2755 SET_LIST_BIT (TRANSLATE (this_char)); | |
2756 } | |
2757 | |
2758 return REG_NOERROR; | |
2759 } | |
2760 | |
2761 /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in | |
2762 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible | |
2763 characters can start a string that matches the pattern. This fastmap | |
2764 is used by re_search to skip quickly over impossible starting points. | |
2765 | |
2766 The caller must supply the address of a (1 << BYTEWIDTH)-byte data | |
2767 area as BUFP->fastmap. | |
2768 | |
2769 We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in | |
2770 the pattern buffer. | |
2771 | |
2772 Returns 0 if we succeed, -2 if an internal error. */ | |
2773 | |
2774 int | |
2775 re_compile_fastmap (bufp) | |
2776 struct re_pattern_buffer *bufp; | |
2777 { | |
2778 int j, k; | |
2952 | 2779 #ifdef MATCH_MAY_ALLOCATE |
1155 | 2780 fail_stack_type fail_stack; |
2949 | 2781 #endif |
1155 | 2782 #ifndef REGEX_MALLOC |
2783 char *destination; | |
2784 #endif | |
2785 /* We don't push any register information onto the failure stack. */ | |
2786 unsigned num_regs = 0; | |
2787 | |
2788 register char *fastmap = bufp->fastmap; | |
2789 unsigned char *pattern = bufp->buffer; | |
2790 unsigned long size = bufp->used; | |
4918
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
2791 unsigned char *p = pattern; |
1155 | 2792 register unsigned char *pend = pattern + size; |
2793 | |
2794 /* Assume that each path through the pattern can be null until | |
2795 proven otherwise. We set this false at the bottom of switch | |
2796 statement, to which we get only if a particular path doesn't | |
2797 match the empty string. */ | |
2798 boolean path_can_be_null = true; | |
2799 | |
2800 /* We aren't doing a `succeed_n' to begin with. */ | |
2801 boolean succeed_n_p = false; | |
2802 | |
2803 assert (fastmap != NULL && p != NULL); | |
2804 | |
2805 INIT_FAIL_STACK (); | |
2806 bzero (fastmap, 1 << BYTEWIDTH); /* Assume nothing's valid. */ | |
2807 bufp->fastmap_accurate = 1; /* It will be when we're done. */ | |
2808 bufp->can_be_null = 0; | |
2809 | |
10021
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2810 while (1) |
1155 | 2811 { |
10000
659346eafd79
(re_compile_fastmap): Treat `succeed' like end of pattern.
Karl Heuer <kwzh@gnu.org>
parents:
9983
diff
changeset
|
2812 if (p == pend || *p == succeed) |
10021
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2813 { |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2814 /* We have reached the (effective) end of pattern. */ |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2815 if (!FAIL_STACK_EMPTY ()) |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2816 { |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2817 bufp->can_be_null |= path_can_be_null; |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2818 |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2819 /* Reset for next path. */ |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2820 path_can_be_null = true; |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2821 |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2822 p = fail_stack.stack[--fail_stack.avail]; |
10023
a53798af4794
(re_compile_fastmap): Really, really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10021
diff
changeset
|
2823 |
a53798af4794
(re_compile_fastmap): Really, really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10021
diff
changeset
|
2824 continue; |
10021
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2825 } |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2826 else |
9203331b118a
(re_compile_fastmap): Really treat `succeed' like end.
Richard M. Stallman <rms@gnu.org>
parents:
10000
diff
changeset
|
2827 break; |
1155 | 2828 } |
2829 | |
2830 /* We should never be about to go beyond the end of the pattern. */ | |
2831 assert (p < pend); | |
2832 | |
10456
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
2833 switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++)) |
1155 | 2834 { |
2835 | |
2836 /* I guess the idea here is to simply not bother with a fastmap | |
2837 if a backreference is used, since it's too hard to figure out | |
2838 the fastmap for the corresponding group. Setting | |
2839 `can_be_null' stops `re_search_2' from using the fastmap, so | |
2840 that is all we do. */ | |
2841 case duplicate: | |
2842 bufp->can_be_null = 1; | |
2843 return 0; | |
2844 | |
2845 | |
2846 /* Following are the cases which match a character. These end | |
2847 with `break'. */ | |
2848 | |
2849 case exactn: | |
2850 fastmap[p[1]] = 1; | |
2851 break; | |
2852 | |
2853 | |
2854 case charset: | |
2855 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) | |
2856 if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))) | |
2857 fastmap[j] = 1; | |
2858 break; | |
2859 | |
2860 | |
2861 case charset_not: | |
2862 /* Chars beyond end of map must be allowed. */ | |
2863 for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++) | |
2864 fastmap[j] = 1; | |
2865 | |
2866 for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--) | |
2867 if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))) | |
2868 fastmap[j] = 1; | |
2869 break; | |
2870 | |
2871 | |
2872 case wordchar: | |
2873 for (j = 0; j < (1 << BYTEWIDTH); j++) | |
2874 if (SYNTAX (j) == Sword) | |
2875 fastmap[j] = 1; | |
2876 break; | |
2877 | |
2878 | |
2879 case notwordchar: | |
2880 for (j = 0; j < (1 << BYTEWIDTH); j++) | |
2881 if (SYNTAX (j) != Sword) | |
2882 fastmap[j] = 1; | |
2883 break; | |
2884 | |
2885 | |
2886 case anychar: | |
8114
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2887 { |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2888 int fastmap_newline = fastmap['\n']; |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2889 |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2890 /* `.' matches anything ... */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2891 for (j = 0; j < (1 << BYTEWIDTH); j++) |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2892 fastmap[j] = 1; |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2893 |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2894 /* ... except perhaps newline. */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2895 if (!(bufp->syntax & RE_DOT_NEWLINE)) |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2896 fastmap['\n'] = fastmap_newline; |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2897 |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2898 /* Return if we have already set `can_be_null'; if we have, |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2899 then the fastmap is irrelevant. Something's wrong here. */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2900 else if (bufp->can_be_null) |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2901 return 0; |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2902 |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2903 /* Otherwise, have to check alternative paths. */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2904 break; |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
2905 } |
1155 | 2906 |
2907 #ifdef emacs | |
2908 case syntaxspec: | |
2909 k = *p++; | |
2910 for (j = 0; j < (1 << BYTEWIDTH); j++) | |
2911 if (SYNTAX (j) == (enum syntaxcode) k) | |
2912 fastmap[j] = 1; | |
2913 break; | |
2914 | |
2915 | |
2916 case notsyntaxspec: | |
2917 k = *p++; | |
2918 for (j = 0; j < (1 << BYTEWIDTH); j++) | |
2919 if (SYNTAX (j) != (enum syntaxcode) k) | |
2920 fastmap[j] = 1; | |
2921 break; | |
2922 | |
2923 | |
2924 /* All cases after this match the empty string. These end with | |
2925 `continue'. */ | |
2926 | |
2927 | |
2928 case before_dot: | |
2929 case at_dot: | |
2930 case after_dot: | |
2931 continue; | |
2932 #endif /* not emacs */ | |
2933 | |
2934 | |
2935 case no_op: | |
2936 case begline: | |
2937 case endline: | |
2938 case begbuf: | |
2939 case endbuf: | |
2940 case wordbound: | |
2941 case notwordbound: | |
2942 case wordbeg: | |
2943 case wordend: | |
2944 case push_dummy_failure: | |
2945 continue; | |
2946 | |
2947 | |
2948 case jump_n: | |
2949 case pop_failure_jump: | |
2950 case maybe_pop_jump: | |
2951 case jump: | |
2952 case jump_past_alt: | |
2953 case dummy_failure_jump: | |
2954 EXTRACT_NUMBER_AND_INCR (j, p); | |
2955 p += j; | |
2956 if (j > 0) | |
2957 continue; | |
2958 | |
2959 /* Jump backward implies we just went through the body of a | |
2960 loop and matched nothing. Opcode jumped to should be | |
2961 `on_failure_jump' or `succeed_n'. Just treat it like an | |
2962 ordinary jump. For a * loop, it has pushed its failure | |
2963 point already; if so, discard that as redundant. */ | |
2964 if ((re_opcode_t) *p != on_failure_jump | |
2965 && (re_opcode_t) *p != succeed_n) | |
2966 continue; | |
2967 | |
2968 p++; | |
2969 EXTRACT_NUMBER_AND_INCR (j, p); | |
2970 p += j; | |
2971 | |
2972 /* If what's on the stack is where we are now, pop it. */ | |
2973 if (!FAIL_STACK_EMPTY () | |
2974 && fail_stack.stack[fail_stack.avail - 1] == p) | |
2975 fail_stack.avail--; | |
2976 | |
2977 continue; | |
2978 | |
2979 | |
2980 case on_failure_jump: | |
2981 case on_failure_keep_string_jump: | |
2982 handle_on_failure_jump: | |
2983 EXTRACT_NUMBER_AND_INCR (j, p); | |
2984 | |
2985 /* For some patterns, e.g., `(a?)?', `p+j' here points to the | |
2986 end of the pattern. We don't want to push such a point, | |
2987 since when we restore it above, entering the switch will | |
2988 increment `p' past the end of the pattern. We don't need | |
2989 to push such a point since we obviously won't find any more | |
2990 fastmap entries beyond `pend'. Such a pattern can match | |
2991 the null string, though. */ | |
2992 if (p + j < pend) | |
2993 { | |
2994 if (!PUSH_PATTERN_OP (p + j, fail_stack)) | |
2995 return -2; | |
2996 } | |
2997 else | |
2998 bufp->can_be_null = 1; | |
2999 | |
3000 if (succeed_n_p) | |
3001 { | |
3002 EXTRACT_NUMBER_AND_INCR (k, p); /* Skip the n. */ | |
3003 succeed_n_p = false; | |
3004 } | |
3005 | |
3006 continue; | |
3007 | |
3008 | |
3009 case succeed_n: | |
3010 /* Get to the number of times to succeed. */ | |
3011 p += 2; | |
3012 | |
3013 /* Increment p past the n for when k != 0. */ | |
3014 EXTRACT_NUMBER_AND_INCR (k, p); | |
3015 if (k == 0) | |
3016 { | |
3017 p -= 4; | |
3018 succeed_n_p = true; /* Spaghetti code alert. */ | |
3019 goto handle_on_failure_jump; | |
3020 } | |
3021 continue; | |
3022 | |
3023 | |
3024 case set_number_at: | |
3025 p += 4; | |
3026 continue; | |
3027 | |
3028 | |
3029 case start_memory: | |
3030 case stop_memory: | |
3031 p += 2; | |
3032 continue; | |
3033 | |
3034 | |
3035 default: | |
3036 abort (); /* We have listed all the cases. */ | |
3037 } /* switch *p++ */ | |
3038 | |
3039 /* Getting here means we have found the possible starting | |
3040 characters for one path of the pattern -- and that the empty | |
3041 string does not match. We need not follow this path further. | |
3042 Instead, look at the next alternative (remembered on the | |
3043 stack), or quit if no more. The test at the top of the loop | |
3044 does these things. */ | |
3045 path_can_be_null = false; | |
3046 p = pend; | |
3047 } /* while p */ | |
3048 | |
3049 /* Set `can_be_null' for the last path (also the first path, if the | |
3050 pattern is empty). */ | |
3051 bufp->can_be_null |= path_can_be_null; | |
3052 return 0; | |
3053 } /* re_compile_fastmap */ | |
3054 | |
3055 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and | |
3056 ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use | |
3057 this memory for recording register information. STARTS and ENDS | |
3058 must be allocated using the malloc library routine, and must each | |
3059 be at least NUM_REGS * sizeof (regoff_t) bytes long. | |
3060 | |
3061 If NUM_REGS == 0, then subsequent matches should allocate their own | |
3062 register data. | |
3063 | |
3064 Unless this function is called, the first search or match using | |
3065 PATTERN_BUFFER will allocate its own register data, without | |
3066 freeing the old data. */ | |
3067 | |
3068 void | |
3069 re_set_registers (bufp, regs, num_regs, starts, ends) | |
3070 struct re_pattern_buffer *bufp; | |
3071 struct re_registers *regs; | |
3072 unsigned num_regs; | |
3073 regoff_t *starts, *ends; | |
3074 { | |
3075 if (num_regs) | |
3076 { | |
3077 bufp->regs_allocated = REGS_REALLOCATE; | |
3078 regs->num_regs = num_regs; | |
3079 regs->start = starts; | |
3080 regs->end = ends; | |
3081 } | |
3082 else | |
3083 { | |
3084 bufp->regs_allocated = REGS_UNALLOCATED; | |
3085 regs->num_regs = 0; | |
5014
6062331f7430
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4918
diff
changeset
|
3086 regs->start = regs->end = (regoff_t *) 0; |
1155 | 3087 } |
3088 } | |
3089 | |
3090 /* Searching routines. */ | |
3091 | |
3092 /* Like re_search_2, below, but only one string is specified, and | |
3093 doesn't let you say where to stop matching. */ | |
3094 | |
3095 int | |
3096 re_search (bufp, string, size, startpos, range, regs) | |
3097 struct re_pattern_buffer *bufp; | |
3098 const char *string; | |
3099 int size, startpos, range; | |
3100 struct re_registers *regs; | |
3101 { | |
3102 return re_search_2 (bufp, NULL, 0, string, size, startpos, range, | |
3103 regs, size); | |
3104 } | |
3105 | |
3106 | |
3107 /* Using the compiled pattern in BUFP->buffer, first tries to match the | |
3108 virtual concatenation of STRING1 and STRING2, starting first at index | |
3109 STARTPOS, then at STARTPOS + 1, and so on. | |
3110 | |
3111 STRING1 and STRING2 have length SIZE1 and SIZE2, respectively. | |
3112 | |
3113 RANGE is how far to scan while trying to match. RANGE = 0 means try | |
3114 only at STARTPOS; in general, the last start tried is STARTPOS + | |
3115 RANGE. | |
3116 | |
3117 In REGS, return the indices of the virtual concatenation of STRING1 | |
3118 and STRING2 that matched the entire BUFP->buffer and its contained | |
3119 subexpressions. | |
3120 | |
3121 Do not consider matching one past the index STOP in the virtual | |
3122 concatenation of STRING1 and STRING2. | |
3123 | |
3124 We return either the position in the strings at which the match was | |
3125 found, -1 if no match, or -2 if error (such as failure | |
3126 stack overflow). */ | |
3127 | |
3128 int | |
3129 re_search_2 (bufp, string1, size1, string2, size2, startpos, range, regs, stop) | |
3130 struct re_pattern_buffer *bufp; | |
3131 const char *string1, *string2; | |
3132 int size1, size2; | |
3133 int startpos; | |
3134 int range; | |
3135 struct re_registers *regs; | |
3136 int stop; | |
3137 { | |
3138 int val; | |
3139 register char *fastmap = bufp->fastmap; | |
3140 register char *translate = bufp->translate; | |
3141 int total_size = size1 + size2; | |
3142 int endpos = startpos + range; | |
3143 | |
3144 /* Check for out-of-range STARTPOS. */ | |
3145 if (startpos < 0 || startpos > total_size) | |
3146 return -1; | |
3147 | |
3148 /* Fix up RANGE if it might eventually take us outside | |
3149 the virtual concatenation of STRING1 and STRING2. */ | |
3150 if (endpos < -1) | |
3151 range = -1 - startpos; | |
3152 else if (endpos > total_size) | |
3153 range = total_size - startpos; | |
3154 | |
3155 /* If the search isn't to be a backwards one, don't waste time in a | |
1637 | 3156 search for a pattern that must be anchored. */ |
3157 if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == begbuf && range > 0) | |
1155 | 3158 { |
3159 if (startpos > 0) | |
3160 return -1; | |
3161 else | |
3162 range = 1; | |
3163 } | |
3164 | |
1637 | 3165 /* Update the fastmap now if not correct already. */ |
3166 if (fastmap && !bufp->fastmap_accurate) | |
3167 if (re_compile_fastmap (bufp) == -2) | |
3168 return -2; | |
3169 | |
3170 /* Loop through the string, looking for a place to start matching. */ | |
1155 | 3171 for (;;) |
3172 { | |
3173 /* If a fastmap is supplied, skip quickly over characters that | |
3174 cannot be the start of a match. If the pattern can match the | |
3175 null string, however, we don't need to skip characters; we want | |
3176 the first null string. */ | |
3177 if (fastmap && startpos < total_size && !bufp->can_be_null) | |
3178 { | |
3179 if (range > 0) /* Searching forwards. */ | |
3180 { | |
3181 register const char *d; | |
3182 register int lim = 0; | |
3183 int irange = range; | |
3184 | |
3185 if (startpos < size1 && startpos + range >= size1) | |
3186 lim = range - (size1 - startpos); | |
3187 | |
3188 d = (startpos >= size1 ? string2 - size1 : string1) + startpos; | |
3189 | |
3190 /* Written out as an if-else to avoid testing `translate' | |
3191 inside the loop. */ | |
3192 if (translate) | |
3193 while (range > lim | |
2078 | 3194 && !fastmap[(unsigned char) |
3195 translate[(unsigned char) *d++]]) | |
1155 | 3196 range--; |
3197 else | |
3198 while (range > lim && !fastmap[(unsigned char) *d++]) | |
3199 range--; | |
3200 | |
3201 startpos += irange - range; | |
3202 } | |
3203 else /* Searching backwards. */ | |
3204 { | |
3205 register char c = (size1 == 0 || startpos >= size1 | |
3206 ? string2[startpos - size1] | |
3207 : string1[startpos]); | |
3208 | |
1637 | 3209 if (!fastmap[(unsigned char) TRANSLATE (c)]) |
1155 | 3210 goto advance; |
3211 } | |
3212 } | |
3213 | |
3214 /* If can't match the null string, and that's all we have left, fail. */ | |
3215 if (range >= 0 && startpos == total_size && fastmap | |
3216 && !bufp->can_be_null) | |
3217 return -1; | |
3218 | |
6083 | 3219 val = re_match_2_internal (bufp, string1, size1, string2, size2, |
3220 startpos, regs, stop); | |
7318
eed73d042fa4
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7305
diff
changeset
|
3221 #ifndef REGEX_MALLOC |
eed73d042fa4
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7305
diff
changeset
|
3222 #ifdef C_ALLOCA |
6083 | 3223 alloca (0); |
7318
eed73d042fa4
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7305
diff
changeset
|
3224 #endif |
eed73d042fa4
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
7305
diff
changeset
|
3225 #endif |
6083 | 3226 |
1155 | 3227 if (val >= 0) |
3228 return startpos; | |
3229 | |
3230 if (val == -2) | |
3231 return -2; | |
3232 | |
3233 advance: | |
3234 if (!range) | |
3235 break; | |
3236 else if (range > 0) | |
3237 { | |
3238 range--; | |
3239 startpos++; | |
3240 } | |
3241 else | |
3242 { | |
3243 range++; | |
3244 startpos--; | |
3245 } | |
3246 } | |
3247 return -1; | |
3248 } /* re_search_2 */ | |
3249 | |
3250 /* Declarations and macros for re_match_2. */ | |
3251 | |
3252 static int bcmp_translate (); | |
3253 static boolean alt_match_null_string_p (), | |
3254 common_op_match_null_string_p (), | |
3255 group_match_null_string_p (); | |
3256 | |
3257 /* This converts PTR, a pointer into one of the search strings `string1' | |
3258 and `string2' into an offset from the beginning of that string. */ | |
4918
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3259 #define POINTER_TO_OFFSET(ptr) \ |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3260 (FIRST_STRING_P (ptr) \ |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3261 ? ((regoff_t) ((ptr) - string1)) \ |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3262 : ((regoff_t) ((ptr) - string2 + size1))) |
1155 | 3263 |
3264 /* Macros for dealing with the split strings in re_match_2. */ | |
3265 | |
3266 #define MATCHING_IN_FIRST_STRING (dend == end_match_1) | |
3267 | |
3268 /* Call before fetching a character with *d. This switches over to | |
3269 string2 if necessary. */ | |
3270 #define PREFETCH() \ | |
3271 while (d == dend) \ | |
3272 { \ | |
3273 /* End of string2 => fail. */ \ | |
3274 if (dend == end_match_2) \ | |
3275 goto fail; \ | |
3276 /* End of string1 => advance to string2. */ \ | |
3277 d = string2; \ | |
3278 dend = end_match_2; \ | |
3279 } | |
3280 | |
3281 | |
3282 /* Test if at very beginning or at very end of the virtual concatenation | |
3283 of `string1' and `string2'. If only one string, it's `string2'. */ | |
1637 | 3284 #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2) |
3285 #define AT_STRINGS_END(d) ((d) == end2) | |
1155 | 3286 |
3287 | |
3288 /* Test if D points to a character which is word-constituent. We have | |
3289 two special cases to check for: if past the end of string1, look at | |
3290 the first character in string2; and if before the beginning of | |
1637 | 3291 string2, look at the last character in string1. */ |
3292 #define WORDCHAR_P(d) \ | |
1155 | 3293 (SYNTAX ((d) == end1 ? *string2 \ |
1637 | 3294 : (d) == string2 - 1 ? *(end1 - 1) : *(d)) \ |
3295 == Sword) | |
1155 | 3296 |
3297 /* Test if the character before D and the one at D differ with respect | |
3298 to being word-constituent. */ | |
3299 #define AT_WORD_BOUNDARY(d) \ | |
1637 | 3300 (AT_STRINGS_BEG (d) || AT_STRINGS_END (d) \ |
3301 || WORDCHAR_P (d - 1) != WORDCHAR_P (d)) | |
1155 | 3302 |
3303 | |
3304 /* Free everything we malloc. */ | |
2952 | 3305 #ifdef MATCH_MAY_ALLOCATE |
1155 | 3306 #ifdef REGEX_MALLOC |
3307 #define FREE_VAR(var) if (var) free (var); var = NULL | |
3308 #define FREE_VARIABLES() \ | |
3309 do { \ | |
3310 FREE_VAR (fail_stack.stack); \ | |
3311 FREE_VAR (regstart); \ | |
3312 FREE_VAR (regend); \ | |
3313 FREE_VAR (old_regstart); \ | |
3314 FREE_VAR (old_regend); \ | |
3315 FREE_VAR (best_regstart); \ | |
3316 FREE_VAR (best_regend); \ | |
3317 FREE_VAR (reg_info); \ | |
3318 FREE_VAR (reg_dummy); \ | |
3319 FREE_VAR (reg_info_dummy); \ | |
3320 } while (0) | |
3321 #else /* not REGEX_MALLOC */ | |
6083 | 3322 /* This used to do alloca (0), but now we do that in the caller. */ |
3323 #define FREE_VARIABLES() /* Nothing */ | |
1155 | 3324 #endif /* not REGEX_MALLOC */ |
2952 | 3325 #else |
3326 #define FREE_VARIABLES() /* Do nothing! */ | |
3327 #endif /* not MATCH_MAY_ALLOCATE */ | |
1155 | 3328 |
3329 /* These values must meet several constraints. They must not be valid | |
3330 register values; since we have a limit of 255 registers (because | |
3331 we use only one byte in the pattern for the register number), we can | |
3332 use numbers larger than 255. They must differ by 1, because of | |
3333 NUM_FAILURE_ITEMS above. And the value for the lowest register must | |
3334 be larger than the value for the highest register, so we do not try | |
3335 to actually save any registers when none are active. */ | |
3336 #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH) | |
3337 #define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1) | |
3338 | |
3339 /* Matching routines. */ | |
3340 | |
3341 #ifndef emacs /* Emacs never uses this. */ | |
3342 /* re_match is like re_match_2 except it takes only a single string. */ | |
3343 | |
3344 int | |
3345 re_match (bufp, string, size, pos, regs) | |
3346 struct re_pattern_buffer *bufp; | |
3347 const char *string; | |
3348 int size, pos; | |
3349 struct re_registers *regs; | |
6083 | 3350 { |
3351 int result = re_match_2_internal (bufp, NULL, 0, string, size, | |
3352 pos, regs, size); | |
3353 alloca (0); | |
3354 return result; | |
1155 | 3355 } |
3356 #endif /* not emacs */ | |
3357 | |
3358 | |
3359 /* re_match_2 matches the compiled pattern in BUFP against the | |
3360 the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1 | |
3361 and SIZE2, respectively). We start matching at POS, and stop | |
3362 matching at STOP. | |
3363 | |
3364 If REGS is non-null and the `no_sub' field of BUFP is nonzero, we | |
3365 store offsets for the substring each group matched in REGS. See the | |
3366 documentation for exactly how many groups we fill. | |
3367 | |
3368 We return -1 if no match, -2 if an internal error (such as the | |
3369 failure stack overflowing). Otherwise, we return the length of the | |
3370 matched substring. */ | |
3371 | |
3372 int | |
3373 re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop) | |
3374 struct re_pattern_buffer *bufp; | |
3375 const char *string1, *string2; | |
3376 int size1, size2; | |
3377 int pos; | |
3378 struct re_registers *regs; | |
3379 int stop; | |
3380 { | |
6083 | 3381 int result = re_match_2_internal (bufp, string1, size1, string2, size2, |
3382 pos, regs, stop); | |
3383 alloca (0); | |
3384 return result; | |
3385 } | |
3386 | |
3387 /* This is a separate function so that we can force an alloca cleanup | |
3388 afterwards. */ | |
3389 static int | |
3390 re_match_2_internal (bufp, string1, size1, string2, size2, pos, regs, stop) | |
3391 struct re_pattern_buffer *bufp; | |
3392 const char *string1, *string2; | |
3393 int size1, size2; | |
3394 int pos; | |
3395 struct re_registers *regs; | |
3396 int stop; | |
3397 { | |
1155 | 3398 /* General temporaries. */ |
3399 int mcnt; | |
3400 unsigned char *p1; | |
3401 | |
3402 /* Just past the end of the corresponding string. */ | |
3403 const char *end1, *end2; | |
3404 | |
3405 /* Pointers into string1 and string2, just past the last characters in | |
3406 each to consider matching. */ | |
3407 const char *end_match_1, *end_match_2; | |
3408 | |
3409 /* Where we are in the data, and the end of the current string. */ | |
3410 const char *d, *dend; | |
3411 | |
3412 /* Where we are in the pattern, and the end of the pattern. */ | |
3413 unsigned char *p = bufp->buffer; | |
3414 register unsigned char *pend = p + bufp->used; | |
3415 | |
5842 | 3416 /* Mark the opcode just after a start_memory, so we can test for an |
3417 empty subpattern when we get to the stop_memory. */ | |
3418 unsigned char *just_past_start_mem = 0; | |
3419 | |
1155 | 3420 /* We use this to map every character in the string. */ |
3421 char *translate = bufp->translate; | |
3422 | |
3423 /* Failure point stack. Each place that can handle a failure further | |
3424 down the line pushes a failure point on this stack. It consists of | |
3425 restart, regend, and reg_info for all registers corresponding to | |
3426 the subexpressions we're currently inside, plus the number of such | |
3427 registers, and, finally, two char *'s. The first char * is where | |
3428 to resume scanning the pattern; the second one is where to resume | |
3429 scanning the strings. If the latter is zero, the failure point is | |
3430 a ``dummy''; if a failure happens and the failure point is a dummy, | |
3431 it gets discarded and the next next one is tried. */ | |
2952 | 3432 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */ |
1155 | 3433 fail_stack_type fail_stack; |
2949 | 3434 #endif |
1155 | 3435 #ifdef DEBUG |
3436 static unsigned failure_id = 0; | |
1637 | 3437 unsigned nfailure_points_pushed = 0, nfailure_points_popped = 0; |
1155 | 3438 #endif |
3439 | |
3440 /* We fill all the registers internally, independent of what we | |
3441 return, for use in backreferences. The number here includes | |
3442 an element for register zero. */ | |
3443 unsigned num_regs = bufp->re_nsub + 1; | |
3444 | |
3445 /* The currently active registers. */ | |
3446 unsigned lowest_active_reg = NO_LOWEST_ACTIVE_REG; | |
3447 unsigned highest_active_reg = NO_HIGHEST_ACTIVE_REG; | |
3448 | |
3449 /* Information on the contents of registers. These are pointers into | |
3450 the input strings; they record just what was matched (on this | |
3451 attempt) by a subexpression part of the pattern, that is, the | |
3452 regnum-th regstart pointer points to where in the pattern we began | |
3453 matching and the regnum-th regend points to right after where we | |
3454 stopped matching the regnum-th subexpression. (The zeroth register | |
3455 keeps track of what the whole pattern matches.) */ | |
2952 | 3456 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ |
1155 | 3457 const char **regstart, **regend; |
2949 | 3458 #endif |
1155 | 3459 |
3460 /* If a group that's operated upon by a repetition operator fails to | |
3461 match anything, then the register for its start will need to be | |
3462 restored because it will have been set to wherever in the string we | |
3463 are when we last see its open-group operator. Similarly for a | |
3464 register's end. */ | |
2952 | 3465 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ |
1155 | 3466 const char **old_regstart, **old_regend; |
2949 | 3467 #endif |
1155 | 3468 |
3469 /* The is_active field of reg_info helps us keep track of which (possibly | |
3470 nested) subexpressions we are currently in. The matched_something | |
3471 field of reg_info[reg_num] helps us tell whether or not we have | |
3472 matched any of the pattern so far this time through the reg_num-th | |
3473 subexpression. These two fields get reset each time through any | |
3474 loop their register is in. */ | |
2952 | 3475 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */ |
1155 | 3476 register_info_type *reg_info; |
2949 | 3477 #endif |
1155 | 3478 |
3479 /* The following record the register info as found in the above | |
3480 variables when we find a match better than any we've seen before. | |
3481 This happens as we backtrack through the failure points, which in | |
3482 turn happens only if we have not yet matched the entire string. */ | |
3483 unsigned best_regs_set = false; | |
2952 | 3484 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ |
1155 | 3485 const char **best_regstart, **best_regend; |
2949 | 3486 #endif |
1155 | 3487 |
3488 /* Logically, this is `best_regend[0]'. But we don't want to have to | |
3489 allocate space for that if we're not allocating space for anything | |
3490 else (see below). Also, we never need info about register 0 for | |
3491 any of the other register vectors, and it seems rather a kludge to | |
3492 treat `best_regend' differently than the rest. So we keep track of | |
3493 the end of the best match so far in a separate variable. We | |
3494 initialize this to NULL so that when we backtrack the first time | |
3495 and need to test it, it's not garbage. */ | |
3496 const char *match_end = NULL; | |
3497 | |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3498 /* This helps SET_REGS_MATCHED avoid doing redundant work. */ |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3499 int set_regs_matched_done = 0; |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3500 |
1155 | 3501 /* Used when we pop values we don't care about. */ |
2952 | 3502 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */ |
1155 | 3503 const char **reg_dummy; |
3504 register_info_type *reg_info_dummy; | |
2949 | 3505 #endif |
1155 | 3506 |
3507 #ifdef DEBUG | |
3508 /* Counts the total number of registers pushed. */ | |
3509 unsigned num_regs_pushed = 0; | |
3510 #endif | |
3511 | |
3512 DEBUG_PRINT1 ("\n\nEntering re_match_2.\n"); | |
3513 | |
3514 INIT_FAIL_STACK (); | |
3515 | |
2952 | 3516 #ifdef MATCH_MAY_ALLOCATE |
1155 | 3517 /* Do not bother to initialize all the register variables if there are |
3518 no groups in the pattern, as it takes a fair amount of time. If | |
3519 there are groups, we include space for register 0 (the whole | |
3520 pattern), even though we never use it, since it simplifies the | |
3521 array indexing. We should fix this. */ | |
3522 if (bufp->re_nsub) | |
3523 { | |
3524 regstart = REGEX_TALLOC (num_regs, const char *); | |
3525 regend = REGEX_TALLOC (num_regs, const char *); | |
3526 old_regstart = REGEX_TALLOC (num_regs, const char *); | |
3527 old_regend = REGEX_TALLOC (num_regs, const char *); | |
3528 best_regstart = REGEX_TALLOC (num_regs, const char *); | |
3529 best_regend = REGEX_TALLOC (num_regs, const char *); | |
3530 reg_info = REGEX_TALLOC (num_regs, register_info_type); | |
3531 reg_dummy = REGEX_TALLOC (num_regs, const char *); | |
3532 reg_info_dummy = REGEX_TALLOC (num_regs, register_info_type); | |
3533 | |
3534 if (!(regstart && regend && old_regstart && old_regend && reg_info | |
3535 && best_regstart && best_regend && reg_dummy && reg_info_dummy)) | |
3536 { | |
3537 FREE_VARIABLES (); | |
3538 return -2; | |
3539 } | |
3540 } | |
2949 | 3541 #if defined (REGEX_MALLOC) |
1155 | 3542 else |
3543 { | |
3544 /* We must initialize all our variables to NULL, so that | |
1637 | 3545 `FREE_VARIABLES' doesn't try to free them. */ |
1155 | 3546 regstart = regend = old_regstart = old_regend = best_regstart |
3547 = best_regend = reg_dummy = NULL; | |
3548 reg_info = reg_info_dummy = (register_info_type *) NULL; | |
3549 } | |
3550 #endif /* REGEX_MALLOC */ | |
2952 | 3551 #endif /* MATCH_MAY_ALLOCATE */ |
1155 | 3552 |
3553 /* The starting position is bogus. */ | |
3554 if (pos < 0 || pos > size1 + size2) | |
3555 { | |
3556 FREE_VARIABLES (); | |
3557 return -1; | |
3558 } | |
3559 | |
3560 /* Initialize subexpression text positions to -1 to mark ones that no | |
3561 start_memory/stop_memory has been seen for. Also initialize the | |
3562 register information struct. */ | |
3563 for (mcnt = 1; mcnt < num_regs; mcnt++) | |
3564 { | |
3565 regstart[mcnt] = regend[mcnt] | |
3566 = old_regstart[mcnt] = old_regend[mcnt] = REG_UNSET_VALUE; | |
3567 | |
3568 REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE; | |
3569 IS_ACTIVE (reg_info[mcnt]) = 0; | |
3570 MATCHED_SOMETHING (reg_info[mcnt]) = 0; | |
3571 EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0; | |
3572 } | |
3573 | |
3574 /* We move `string1' into `string2' if the latter's empty -- but not if | |
3575 `string1' is null. */ | |
3576 if (size2 == 0 && string1 != NULL) | |
3577 { | |
3578 string2 = string1; | |
3579 size2 = size1; | |
3580 string1 = 0; | |
3581 size1 = 0; | |
3582 } | |
3583 end1 = string1 + size1; | |
3584 end2 = string2 + size2; | |
3585 | |
3586 /* Compute where to stop matching, within the two strings. */ | |
3587 if (stop <= size1) | |
3588 { | |
3589 end_match_1 = string1 + stop; | |
3590 end_match_2 = string2; | |
3591 } | |
3592 else | |
3593 { | |
3594 end_match_1 = end1; | |
3595 end_match_2 = string2 + stop - size1; | |
3596 } | |
3597 | |
3598 /* `p' scans through the pattern as `d' scans through the data. | |
3599 `dend' is the end of the input string that `d' points within. `d' | |
3600 is advanced into the following input string whenever necessary, but | |
3601 this happens before fetching; therefore, at the beginning of the | |
3602 loop, `d' can be pointing at the end of a string, but it cannot | |
3603 equal `string2'. */ | |
3604 if (size1 > 0 && pos <= size1) | |
3605 { | |
3606 d = string1 + pos; | |
3607 dend = end_match_1; | |
3608 } | |
3609 else | |
3610 { | |
3611 d = string2 + pos - size1; | |
3612 dend = end_match_2; | |
3613 } | |
3614 | |
3615 DEBUG_PRINT1 ("The compiled pattern is: "); | |
3616 DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend); | |
3617 DEBUG_PRINT1 ("The string to match is: `"); | |
3618 DEBUG_PRINT_DOUBLE_STRING (d, string1, size1, string2, size2); | |
3619 DEBUG_PRINT1 ("'\n"); | |
3620 | |
3621 /* This loops over pattern commands. It exits by returning from the | |
3622 function if the match is complete, or it drops through if the match | |
3623 fails at this starting point in the input data. */ | |
3624 for (;;) | |
3625 { | |
3626 DEBUG_PRINT2 ("\n0x%x: ", p); | |
3627 | |
3628 if (p == pend) | |
3629 { /* End of pattern means we might have succeeded. */ | |
1637 | 3630 DEBUG_PRINT1 ("end of pattern ... "); |
3631 | |
3632 /* If we haven't matched the entire string, and we want the | |
3633 longest match, try backtracking. */ | |
1155 | 3634 if (d != end_match_2) |
3635 { | |
8114
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3636 /* 1 if this match ends in the same string (string1 or string2) |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3637 as the best previous match. */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3638 boolean same_str_p = (FIRST_STRING_P (match_end) |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3639 == MATCHING_IN_FIRST_STRING); |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3640 /* 1 if this match is the best seen so far. */ |
8561
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3641 boolean best_match_p; |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3642 |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3643 /* AIX compiler got confused when this was combined |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3644 with the previous declaration. */ |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3645 if (same_str_p) |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3646 best_match_p = d > match_end; |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3647 else |
dc5353720725
(regex_compile): Split an if to avoid compiler bug.
Richard M. Stallman <rms@gnu.org>
parents:
8402
diff
changeset
|
3648 best_match_p = !MATCHING_IN_FIRST_STRING; |
8114
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3649 |
1155 | 3650 DEBUG_PRINT1 ("backtracking.\n"); |
3651 | |
3652 if (!FAIL_STACK_EMPTY ()) | |
3653 { /* More failure points to try. */ | |
3654 | |
3655 /* If exceeds best match so far, save it. */ | |
8114
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3656 if (!best_regs_set || best_match_p) |
1155 | 3657 { |
3658 best_regs_set = true; | |
3659 match_end = d; | |
3660 | |
3661 DEBUG_PRINT1 ("\nSAVING match as best so far.\n"); | |
3662 | |
3663 for (mcnt = 1; mcnt < num_regs; mcnt++) | |
3664 { | |
3665 best_regstart[mcnt] = regstart[mcnt]; | |
3666 best_regend[mcnt] = regend[mcnt]; | |
3667 } | |
3668 } | |
3669 goto fail; | |
3670 } | |
3671 | |
8114
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3672 /* If no failure points, don't restore garbage. And if |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3673 last match is real best match, don't restore second |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3674 best one. */ |
bebf92e1b110
(re_compile_fastmap): Either set fastmap['\n'] to 1 or don't change it.
Richard M. Stallman <rms@gnu.org>
parents:
8102
diff
changeset
|
3675 else if (best_regs_set && !best_match_p) |
1155 | 3676 { |
3677 restore_best_regs: | |
3678 /* Restore best match. It may happen that `dend == | |
3679 end_match_1' while the restored d is in string2. | |
3680 For example, the pattern `x.*y.*z' against the | |
3681 strings `x-' and `y-z-', if the two strings are | |
3682 not consecutive in memory. */ | |
1637 | 3683 DEBUG_PRINT1 ("Restoring best registers.\n"); |
3684 | |
1155 | 3685 d = match_end; |
3686 dend = ((d >= string1 && d <= end1) | |
3687 ? end_match_1 : end_match_2); | |
3688 | |
3689 for (mcnt = 1; mcnt < num_regs; mcnt++) | |
3690 { | |
3691 regstart[mcnt] = best_regstart[mcnt]; | |
3692 regend[mcnt] = best_regend[mcnt]; | |
3693 } | |
3694 } | |
3695 } /* d != end_match_2 */ | |
3696 | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
3697 succeed_label: |
1637 | 3698 DEBUG_PRINT1 ("Accepting match.\n"); |
1155 | 3699 |
3700 /* If caller wants register contents data back, do it. */ | |
3701 if (regs && !bufp->no_sub) | |
3702 { | |
3703 /* Have the register data arrays been allocated? */ | |
3704 if (bufp->regs_allocated == REGS_UNALLOCATED) | |
3705 { /* No. So allocate them with malloc. We need one | |
3706 extra element beyond `num_regs' for the `-1' marker | |
3707 GNU code uses. */ | |
3708 regs->num_regs = MAX (RE_NREGS, num_regs + 1); | |
3709 regs->start = TALLOC (regs->num_regs, regoff_t); | |
3710 regs->end = TALLOC (regs->num_regs, regoff_t); | |
3711 if (regs->start == NULL || regs->end == NULL) | |
3712 return -2; | |
3713 bufp->regs_allocated = REGS_REALLOCATE; | |
3714 } | |
3715 else if (bufp->regs_allocated == REGS_REALLOCATE) | |
3716 { /* Yes. If we need more elements than were already | |
3717 allocated, reallocate them. If we need fewer, just | |
3718 leave it alone. */ | |
3719 if (regs->num_regs < num_regs + 1) | |
3720 { | |
3721 regs->num_regs = num_regs + 1; | |
3722 RETALLOC (regs->start, regs->num_regs, regoff_t); | |
3723 RETALLOC (regs->end, regs->num_regs, regoff_t); | |
3724 if (regs->start == NULL || regs->end == NULL) | |
3725 return -2; | |
3726 } | |
3727 } | |
3728 else | |
2465 | 3729 { |
3730 /* These braces fend off a "empty body in an else-statement" | |
3731 warning under GCC when assert expands to nothing. */ | |
3732 assert (bufp->regs_allocated == REGS_FIXED); | |
3733 } | |
1155 | 3734 |
3735 /* Convert the pointer data in `regstart' and `regend' to | |
3736 indices. Register zero has to be set differently, | |
3737 since we haven't kept track of any info for it. */ | |
3738 if (regs->num_regs > 0) | |
3739 { | |
3740 regs->start[0] = pos; | |
4918
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3741 regs->end[0] = (MATCHING_IN_FIRST_STRING |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3742 ? ((regoff_t) (d - string1)) |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3743 : ((regoff_t) (d - string2 + size1))); |
1155 | 3744 } |
3745 | |
3746 /* Go through the first `min (num_regs, regs->num_regs)' | |
3747 registers, since that is all we initialized. */ | |
3748 for (mcnt = 1; mcnt < MIN (num_regs, regs->num_regs); mcnt++) | |
3749 { | |
3750 if (REG_UNSET (regstart[mcnt]) || REG_UNSET (regend[mcnt])) | |
3751 regs->start[mcnt] = regs->end[mcnt] = -1; | |
3752 else | |
3753 { | |
4918
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3754 regs->start[mcnt] |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3755 = (regoff_t) POINTER_TO_OFFSET (regstart[mcnt]); |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3756 regs->end[mcnt] |
e928d39564ad
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
4846
diff
changeset
|
3757 = (regoff_t) POINTER_TO_OFFSET (regend[mcnt]); |
1155 | 3758 } |
3759 } | |
3760 | |
3761 /* If the regs structure we return has more elements than | |
3762 were in the pattern, set the extra elements to -1. If | |
3763 we (re)allocated the registers, this is the case, | |
3764 because we always allocate enough to have at least one | |
3765 -1 at the end. */ | |
3766 for (mcnt = num_regs; mcnt < regs->num_regs; mcnt++) | |
3767 regs->start[mcnt] = regs->end[mcnt] = -1; | |
3768 } /* regs && !bufp->no_sub */ | |
3769 | |
3770 FREE_VARIABLES (); | |
1637 | 3771 DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n", |
3772 nfailure_points_pushed, nfailure_points_popped, | |
3773 nfailure_points_pushed - nfailure_points_popped); | |
3774 DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed); | |
1155 | 3775 |
3776 mcnt = d - pos - (MATCHING_IN_FIRST_STRING | |
3777 ? string1 | |
3778 : string2 - size1); | |
3779 | |
3780 DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt); | |
3781 | |
3782 return mcnt; | |
3783 } | |
3784 | |
3785 /* Otherwise match next pattern command. */ | |
10456
9c6110615166
[!emacs] (SWITCH_ENUM_CAST): New macro, from emacs/lisp.h
Karl Heuer <kwzh@gnu.org>
parents:
10297
diff
changeset
|
3786 switch (SWITCH_ENUM_CAST ((re_opcode_t) *p++)) |
1155 | 3787 { |
3788 /* Ignore these. Used to ignore the n of succeed_n's which | |
3789 currently have n == 0. */ | |
3790 case no_op: | |
3791 DEBUG_PRINT1 ("EXECUTING no_op.\n"); | |
3792 break; | |
3793 | |
9983
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
3794 case succeed: |
ef6e1637c777
(re_opcode_t): New opcode `succeed'
Richard M. Stallman <rms@gnu.org>
parents:
9717
diff
changeset
|
3795 DEBUG_PRINT1 ("EXECUTING succeed.\n"); |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
3796 goto succeed_label; |
1155 | 3797 |
3798 /* Match the next n pattern characters exactly. The following | |
3799 byte in the pattern defines n, and the n bytes after that | |
3800 are the characters to match. */ | |
3801 case exactn: | |
3802 mcnt = *p++; | |
3803 DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt); | |
3804 | |
3805 /* This is written out as an if-else so we don't waste time | |
3806 testing `translate' inside the loop. */ | |
3807 if (translate) | |
3808 { | |
3809 do | |
3810 { | |
3811 PREFETCH (); | |
3812 if (translate[(unsigned char) *d++] != (char) *p++) | |
3813 goto fail; | |
3814 } | |
3815 while (--mcnt); | |
3816 } | |
3817 else | |
3818 { | |
3819 do | |
3820 { | |
3821 PREFETCH (); | |
3822 if (*d++ != (char) *p++) goto fail; | |
3823 } | |
3824 while (--mcnt); | |
3825 } | |
3826 SET_REGS_MATCHED (); | |
3827 break; | |
3828 | |
3829 | |
3830 /* Match any character except possibly a newline or a null. */ | |
3831 case anychar: | |
3832 DEBUG_PRINT1 ("EXECUTING anychar.\n"); | |
3833 | |
3834 PREFETCH (); | |
3835 | |
3836 if ((!(bufp->syntax & RE_DOT_NEWLINE) && TRANSLATE (*d) == '\n') | |
3837 || (bufp->syntax & RE_DOT_NOT_NULL && TRANSLATE (*d) == '\000')) | |
3838 goto fail; | |
3839 | |
3840 SET_REGS_MATCHED (); | |
3841 DEBUG_PRINT2 (" Matched `%d'.\n", *d); | |
3842 d++; | |
3843 break; | |
3844 | |
3845 | |
3846 case charset: | |
3847 case charset_not: | |
3848 { | |
3849 register unsigned char c; | |
3850 boolean not = (re_opcode_t) *(p - 1) == charset_not; | |
3851 | |
3852 DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : ""); | |
3853 | |
3854 PREFETCH (); | |
3855 c = TRANSLATE (*d); /* The character to match. */ | |
3856 | |
3857 /* Cast to `unsigned' instead of `unsigned char' in case the | |
3858 bit list is a full 32 bytes long. */ | |
3859 if (c < (unsigned) (*p * BYTEWIDTH) | |
3860 && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH))) | |
3861 not = !not; | |
3862 | |
3863 p += 1 + *p; | |
3864 | |
3865 if (!not) goto fail; | |
3866 | |
3867 SET_REGS_MATCHED (); | |
3868 d++; | |
3869 break; | |
3870 } | |
3871 | |
3872 | |
3873 /* The beginning of a group is represented by start_memory. | |
3874 The arguments are the register number in the next byte, and the | |
3875 number of groups inner to this one in the next. The text | |
3876 matched within the group is recorded (in the internal | |
3877 registers data structure) under the register number. */ | |
3878 case start_memory: | |
3879 DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p, p[1]); | |
3880 | |
3881 /* Find out if this group can match the empty string. */ | |
3882 p1 = p; /* To send to group_match_null_string_p. */ | |
3883 | |
3884 if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE) | |
3885 REG_MATCH_NULL_STRING_P (reg_info[*p]) | |
3886 = group_match_null_string_p (&p1, pend, reg_info); | |
3887 | |
3888 /* Save the position in the string where we were the last time | |
3889 we were at this open-group operator in case the group is | |
3890 operated upon by a repetition operator, e.g., with `(a*)*b' | |
3891 against `ab'; then we want to ignore where we are now in | |
3892 the string in case this attempt to match fails. */ | |
3893 old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) | |
3894 ? REG_UNSET (regstart[*p]) ? d : regstart[*p] | |
3895 : regstart[*p]; | |
3896 DEBUG_PRINT2 (" old_regstart: %d\n", | |
3897 POINTER_TO_OFFSET (old_regstart[*p])); | |
3898 | |
3899 regstart[*p] = d; | |
3900 DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart[*p])); | |
3901 | |
3902 IS_ACTIVE (reg_info[*p]) = 1; | |
3903 MATCHED_SOMETHING (reg_info[*p]) = 0; | |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3904 |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3905 /* Clear this whenever we change the register activity status. */ |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3906 set_regs_matched_done = 0; |
1155 | 3907 |
3908 /* This is the new highest active register. */ | |
3909 highest_active_reg = *p; | |
3910 | |
3911 /* If nothing was active before, this is the new lowest active | |
3912 register. */ | |
3913 if (lowest_active_reg == NO_LOWEST_ACTIVE_REG) | |
3914 lowest_active_reg = *p; | |
3915 | |
3916 /* Move past the register number and inner group count. */ | |
3917 p += 2; | |
5842 | 3918 just_past_start_mem = p; |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3919 |
1155 | 3920 break; |
3921 | |
3922 | |
3923 /* The stop_memory opcode represents the end of a group. Its | |
3924 arguments are the same as start_memory's: the register | |
3925 number, and the number of inner groups. */ | |
3926 case stop_memory: | |
3927 DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p, p[1]); | |
3928 | |
3929 /* We need to save the string position the last time we were at | |
3930 this close-group operator in case the group is operated | |
3931 upon by a repetition operator, e.g., with `((a*)*(b*)*)*' | |
3932 against `aba'; then we want to ignore where we are now in | |
3933 the string in case this attempt to match fails. */ | |
3934 old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p]) | |
3935 ? REG_UNSET (regend[*p]) ? d : regend[*p] | |
3936 : regend[*p]; | |
3937 DEBUG_PRINT2 (" old_regend: %d\n", | |
3938 POINTER_TO_OFFSET (old_regend[*p])); | |
3939 | |
3940 regend[*p] = d; | |
3941 DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend[*p])); | |
3942 | |
3943 /* This register isn't active anymore. */ | |
3944 IS_ACTIVE (reg_info[*p]) = 0; | |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3945 |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3946 /* Clear this whenever we change the register activity status. */ |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3947 set_regs_matched_done = 0; |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
3948 |
1155 | 3949 /* If this was the only register active, nothing is active |
3950 anymore. */ | |
3951 if (lowest_active_reg == highest_active_reg) | |
3952 { | |
3953 lowest_active_reg = NO_LOWEST_ACTIVE_REG; | |
3954 highest_active_reg = NO_HIGHEST_ACTIVE_REG; | |
3955 } | |
3956 else | |
3957 { /* We must scan for the new highest active register, since | |
3958 it isn't necessarily one less than now: consider | |
3959 (a(b)c(d(e)f)g). When group 3 ends, after the f), the | |
3960 new highest active register is 1. */ | |
3961 unsigned char r = *p - 1; | |
3962 while (r > 0 && !IS_ACTIVE (reg_info[r])) | |
3963 r--; | |
3964 | |
3965 /* If we end up at register zero, that means that we saved | |
3966 the registers as the result of an `on_failure_jump', not | |
3967 a `start_memory', and we jumped to past the innermost | |
3968 `stop_memory'. For example, in ((.)*) we save | |
3969 registers 1 and 2 as a result of the *, but when we pop | |
3970 back to the second ), we are at the stop_memory 1. | |
3971 Thus, nothing is active. */ | |
3972 if (r == 0) | |
3973 { | |
3974 lowest_active_reg = NO_LOWEST_ACTIVE_REG; | |
3975 highest_active_reg = NO_HIGHEST_ACTIVE_REG; | |
3976 } | |
3977 else | |
3978 highest_active_reg = r; | |
3979 } | |
3980 | |
3981 /* If just failed to match something this time around with a | |
3982 group that's operated on by a repetition operator, try to | |
1637 | 3983 force exit from the ``loop'', and restore the register |
1155 | 3984 information for this group that we had before trying this |
3985 last match. */ | |
3986 if ((!MATCHED_SOMETHING (reg_info[*p]) | |
5842 | 3987 || just_past_start_mem == p - 1) |
1155 | 3988 && (p + 2) < pend) |
3989 { | |
3990 boolean is_a_jump_n = false; | |
3991 | |
3992 p1 = p + 2; | |
3993 mcnt = 0; | |
3994 switch ((re_opcode_t) *p1++) | |
3995 { | |
3996 case jump_n: | |
3997 is_a_jump_n = true; | |
3998 case pop_failure_jump: | |
3999 case maybe_pop_jump: | |
4000 case jump: | |
4001 case dummy_failure_jump: | |
4002 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4003 if (is_a_jump_n) | |
4004 p1 += 2; | |
4005 break; | |
4006 | |
4007 default: | |
4008 /* do nothing */ ; | |
4009 } | |
4010 p1 += mcnt; | |
4011 | |
4012 /* If the next operation is a jump backwards in the pattern | |
4013 to an on_failure_jump right before the start_memory | |
4014 corresponding to this stop_memory, exit from the loop | |
4015 by forcing a failure after pushing on the stack the | |
4016 on_failure_jump's jump in the pattern, and d. */ | |
4017 if (mcnt < 0 && (re_opcode_t) *p1 == on_failure_jump | |
4018 && (re_opcode_t) p1[3] == start_memory && p1[4] == *p) | |
4019 { | |
4020 /* If this group ever matched anything, then restore | |
4021 what its registers were before trying this last | |
4022 failed match, e.g., with `(a*)*b' against `ab' for | |
4023 regstart[1], and, e.g., with `((a*)*(b*)*)*' | |
4024 against `aba' for regend[3]. | |
4025 | |
4026 Also restore the registers for inner groups for, | |
4027 e.g., `((a*)(b*))*' against `aba' (register 3 would | |
4028 otherwise get trashed). */ | |
4029 | |
4030 if (EVER_MATCHED_SOMETHING (reg_info[*p])) | |
4031 { | |
4032 unsigned r; | |
4033 | |
4034 EVER_MATCHED_SOMETHING (reg_info[*p]) = 0; | |
4035 | |
4036 /* Restore this and inner groups' (if any) registers. */ | |
4037 for (r = *p; r < *p + *(p + 1); r++) | |
4038 { | |
4039 regstart[r] = old_regstart[r]; | |
4040 | |
4041 /* xx why this test? */ | |
11330
20a91bd7b59d
(re_match_2_internal): Eliminate cast of ptr to int.
Richard M. Stallman <rms@gnu.org>
parents:
10850
diff
changeset
|
4042 if (old_regend[r] >= regstart[r]) |
1155 | 4043 regend[r] = old_regend[r]; |
4044 } | |
4045 } | |
4046 p1++; | |
4047 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4048 PUSH_FAILURE_POINT (p1 + mcnt, d, -2); | |
4049 | |
4050 goto fail; | |
4051 } | |
4052 } | |
4053 | |
4054 /* Move past the register number and the inner group count. */ | |
4055 p += 2; | |
4056 break; | |
4057 | |
4058 | |
4059 /* \<digit> has been turned into a `duplicate' command which is | |
4060 followed by the numeric value of <digit> as the register number. */ | |
4061 case duplicate: | |
4062 { | |
4063 register const char *d2, *dend2; | |
4064 int regno = *p++; /* Get which register to match against. */ | |
4065 DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno); | |
4066 | |
4067 /* Can't back reference a group which we've never matched. */ | |
4068 if (REG_UNSET (regstart[regno]) || REG_UNSET (regend[regno])) | |
4069 goto fail; | |
4070 | |
4071 /* Where in input to try to start matching. */ | |
4072 d2 = regstart[regno]; | |
4073 | |
4074 /* Where to stop matching; if both the place to start and | |
4075 the place to stop matching are in the same string, then | |
4076 set to the place to stop, otherwise, for now have to use | |
4077 the end of the first string. */ | |
4078 | |
4079 dend2 = ((FIRST_STRING_P (regstart[regno]) | |
4080 == FIRST_STRING_P (regend[regno])) | |
4081 ? regend[regno] : end_match_1); | |
4082 for (;;) | |
4083 { | |
4084 /* If necessary, advance to next segment in register | |
4085 contents. */ | |
4086 while (d2 == dend2) | |
4087 { | |
4088 if (dend2 == end_match_2) break; | |
4089 if (dend2 == regend[regno]) break; | |
4090 | |
4091 /* End of string1 => advance to string2. */ | |
4092 d2 = string2; | |
4093 dend2 = regend[regno]; | |
4094 } | |
4095 /* At end of register contents => success */ | |
4096 if (d2 == dend2) break; | |
4097 | |
4098 /* If necessary, advance to next segment in data. */ | |
4099 PREFETCH (); | |
4100 | |
4101 /* How many characters left in this segment to match. */ | |
4102 mcnt = dend - d; | |
4103 | |
4104 /* Want how many consecutive characters we can match in | |
4105 one shot, so, if necessary, adjust the count. */ | |
4106 if (mcnt > dend2 - d2) | |
4107 mcnt = dend2 - d2; | |
4108 | |
4109 /* Compare that many; failure if mismatch, else move | |
4110 past them. */ | |
4111 if (translate | |
4112 ? bcmp_translate (d, d2, mcnt, translate) | |
4113 : bcmp (d, d2, mcnt)) | |
4114 goto fail; | |
4115 d += mcnt, d2 += mcnt; | |
10242
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
4116 |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
4117 /* Do this because we've match some characters. */ |
8fa35cc770be
(SET_REGS_MATCHED): Do nothing if set_regs_matched_done is 1.
Richard M. Stallman <rms@gnu.org>
parents:
10148
diff
changeset
|
4118 SET_REGS_MATCHED (); |
1155 | 4119 } |
4120 } | |
4121 break; | |
4122 | |
4123 | |
4124 /* begline matches the empty string at the beginning of the string | |
4125 (unless `not_bol' is set in `bufp'), and, if | |
4126 `newline_anchor' is set, after newlines. */ | |
4127 case begline: | |
4128 DEBUG_PRINT1 ("EXECUTING begline.\n"); | |
4129 | |
1637 | 4130 if (AT_STRINGS_BEG (d)) |
1155 | 4131 { |
4132 if (!bufp->not_bol) break; | |
4133 } | |
4134 else if (d[-1] == '\n' && bufp->newline_anchor) | |
4135 { | |
4136 break; | |
4137 } | |
4138 /* In all other cases, we fail. */ | |
4139 goto fail; | |
4140 | |
4141 | |
4142 /* endline is the dual of begline. */ | |
4143 case endline: | |
4144 DEBUG_PRINT1 ("EXECUTING endline.\n"); | |
4145 | |
1637 | 4146 if (AT_STRINGS_END (d)) |
1155 | 4147 { |
4148 if (!bufp->not_eol) break; | |
4149 } | |
4150 | |
4151 /* We have to ``prefetch'' the next character. */ | |
4152 else if ((d == end1 ? *string2 : *d) == '\n' | |
4153 && bufp->newline_anchor) | |
4154 { | |
4155 break; | |
4156 } | |
4157 goto fail; | |
4158 | |
4159 | |
4160 /* Match at the very beginning of the data. */ | |
4161 case begbuf: | |
4162 DEBUG_PRINT1 ("EXECUTING begbuf.\n"); | |
1637 | 4163 if (AT_STRINGS_BEG (d)) |
1155 | 4164 break; |
4165 goto fail; | |
4166 | |
4167 | |
4168 /* Match at the very end of the data. */ | |
4169 case endbuf: | |
4170 DEBUG_PRINT1 ("EXECUTING endbuf.\n"); | |
1637 | 4171 if (AT_STRINGS_END (d)) |
1155 | 4172 break; |
4173 goto fail; | |
4174 | |
4175 | |
4176 /* on_failure_keep_string_jump is used to optimize `.*\n'. It | |
4177 pushes NULL as the value for the string on the stack. Then | |
4178 `pop_failure_point' will keep the current value for the | |
4179 string, instead of restoring it. To see why, consider | |
4180 matching `foo\nbar' against `.*\n'. The .* matches the foo; | |
4181 then the . fails against the \n. But the next thing we want | |
4182 to do is match the \n against the \n; if we restored the | |
4183 string value, we would be back at the foo. | |
4184 | |
4185 Because this is used only in specific cases, we don't need to | |
4186 check all the things that `on_failure_jump' does, to make | |
4187 sure the right things get saved on the stack. Hence we don't | |
4188 share its code. The only reason to push anything on the | |
4189 stack at all is that otherwise we would have to change | |
4190 `anychar's code to do something besides goto fail in this | |
4191 case; that seems worse than this. */ | |
4192 case on_failure_keep_string_jump: | |
4193 DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump"); | |
4194 | |
4195 EXTRACT_NUMBER_AND_INCR (mcnt, p); | |
4196 DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt, p + mcnt); | |
4197 | |
4198 PUSH_FAILURE_POINT (p + mcnt, NULL, -2); | |
4199 break; | |
4200 | |
4201 | |
4202 /* Uses of on_failure_jump: | |
4203 | |
4204 Each alternative starts with an on_failure_jump that points | |
4205 to the beginning of the next alternative. Each alternative | |
4206 except the last ends with a jump that in effect jumps past | |
4207 the rest of the alternatives. (They really jump to the | |
4208 ending jump of the following alternative, because tensioning | |
4209 these jumps is a hassle.) | |
4210 | |
4211 Repeats start with an on_failure_jump that points past both | |
4212 the repetition text and either the following jump or | |
4213 pop_failure_jump back to this on_failure_jump. */ | |
4214 case on_failure_jump: | |
4215 on_failure: | |
4216 DEBUG_PRINT1 ("EXECUTING on_failure_jump"); | |
4217 | |
4218 EXTRACT_NUMBER_AND_INCR (mcnt, p); | |
4219 DEBUG_PRINT3 (" %d (to 0x%x)", mcnt, p + mcnt); | |
4220 | |
4221 /* If this on_failure_jump comes right before a group (i.e., | |
4222 the original * applied to a group), save the information | |
4223 for that group and all inner ones, so that if we fail back | |
4224 to this point, the group's information will be correct. | |
1637 | 4225 For example, in \(a*\)*\1, we need the preceding group, |
1155 | 4226 and in \(\(a*\)b*\)\2, we need the inner group. */ |
4227 | |
4228 /* We can't use `p' to check ahead because we push | |
4229 a failure point to `p + mcnt' after we do this. */ | |
4230 p1 = p; | |
4231 | |
4232 /* We need to skip no_op's before we look for the | |
4233 start_memory in case this on_failure_jump is happening as | |
4234 the result of a completed succeed_n, as in \(a\)\{1,3\}b\1 | |
4235 against aba. */ | |
4236 while (p1 < pend && (re_opcode_t) *p1 == no_op) | |
4237 p1++; | |
4238 | |
4239 if (p1 < pend && (re_opcode_t) *p1 == start_memory) | |
4240 { | |
4241 /* We have a new highest active register now. This will | |
4242 get reset at the start_memory we are about to get to, | |
4243 but we will have saved all the registers relevant to | |
4244 this repetition op, as described above. */ | |
4245 highest_active_reg = *(p1 + 1) + *(p1 + 2); | |
4246 if (lowest_active_reg == NO_LOWEST_ACTIVE_REG) | |
4247 lowest_active_reg = *(p1 + 1); | |
4248 } | |
4249 | |
4250 DEBUG_PRINT1 (":\n"); | |
4251 PUSH_FAILURE_POINT (p + mcnt, d, -2); | |
4252 break; | |
4253 | |
4254 | |
1637 | 4255 /* A smart repeat ends with `maybe_pop_jump'. |
4256 We change it to either `pop_failure_jump' or `jump'. */ | |
1155 | 4257 case maybe_pop_jump: |
4258 EXTRACT_NUMBER_AND_INCR (mcnt, p); | |
4259 DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt); | |
4260 { | |
4261 register unsigned char *p2 = p; | |
4262 | |
4263 /* Compare the beginning of the repeat with what in the | |
4264 pattern follows its end. If we can establish that there | |
4265 is nothing that they would both match, i.e., that we | |
4266 would have to backtrack because of (as in, e.g., `a*a') | |
4267 then we can change to pop_failure_jump, because we'll | |
4268 never have to backtrack. | |
4269 | |
4270 This is not true in the case of alternatives: in | |
4271 `(a|ab)*' we do need to backtrack to the `ab' alternative | |
4272 (e.g., if the string was `ab'). But instead of trying to | |
4273 detect that here, the alternative has put on a dummy | |
4274 failure point which is what we will end up popping. */ | |
4275 | |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4276 /* Skip over open/close-group commands. |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4277 If what follows this loop is a ...+ construct, |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4278 look at what begins its body, since we will have to |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4279 match at least one of that. */ |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4280 while (1) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4281 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4282 if (p2 + 2 < pend |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4283 && ((re_opcode_t) *p2 == stop_memory |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4284 || (re_opcode_t) *p2 == start_memory)) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4285 p2 += 3; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4286 else if (p2 + 6 < pend |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4287 && (re_opcode_t) *p2 == dummy_failure_jump) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4288 p2 += 6; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4289 else |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4290 break; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4291 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4292 |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4293 p1 = p + mcnt; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4294 /* p1[0] ... p1[2] are the `on_failure_jump' corresponding |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4295 to the `maybe_finalize_jump' of this case. Examine what |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4296 follows. */ |
1155 | 4297 |
4298 /* If we're at the end of the pattern, we can change. */ | |
4299 if (p2 == pend) | |
1669 | 4300 { |
4301 /* Consider what happens when matching ":\(.*\)" | |
4302 against ":/". I don't really understand this code | |
4303 yet. */ | |
1155 | 4304 p[-3] = (unsigned char) pop_failure_jump; |
1669 | 4305 DEBUG_PRINT1 |
4306 (" End of pattern: change to `pop_failure_jump'.\n"); | |
1155 | 4307 } |
4308 | |
4309 else if ((re_opcode_t) *p2 == exactn | |
4310 || (bufp->newline_anchor && (re_opcode_t) *p2 == endline)) | |
4311 { | |
4312 register unsigned char c | |
4313 = *p2 == (unsigned char) endline ? '\n' : p2[2]; | |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4314 |
1155 | 4315 if ((re_opcode_t) p1[3] == exactn && p1[5] != c) |
1637 | 4316 { |
4317 p[-3] = (unsigned char) pop_failure_jump; | |
4318 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n", | |
4319 c, p1[5]); | |
4320 } | |
4321 | |
1155 | 4322 else if ((re_opcode_t) p1[3] == charset |
4323 || (re_opcode_t) p1[3] == charset_not) | |
4324 { | |
4325 int not = (re_opcode_t) p1[3] == charset_not; | |
4326 | |
4327 if (c < (unsigned char) (p1[4] * BYTEWIDTH) | |
4328 && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH))) | |
4329 not = !not; | |
4330 | |
4331 /* `not' is equal to 1 if c would match, which means | |
4332 that we can't change to pop_failure_jump. */ | |
4333 if (!not) | |
4334 { | |
4335 p[-3] = (unsigned char) pop_failure_jump; | |
1637 | 4336 DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); |
1155 | 4337 } |
4338 } | |
4339 } | |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4340 else if ((re_opcode_t) *p2 == charset) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4341 { |
7358 | 4342 #ifdef DEBUG |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4343 register unsigned char c |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4344 = *p2 == (unsigned char) endline ? '\n' : p2[2]; |
7358 | 4345 #endif |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4346 |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4347 if ((re_opcode_t) p1[3] == exactn |
8254
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4348 && ! ((int) p2[1] * BYTEWIDTH > (int) p1[4] |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4349 && (p2[1 + p1[4] / BYTEWIDTH] |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4350 & (1 << (p1[4] % BYTEWIDTH))))) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4351 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4352 p[-3] = (unsigned char) pop_failure_jump; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4353 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n", |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4354 c, p1[5]); |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4355 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4356 |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4357 else if ((re_opcode_t) p1[3] == charset_not) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4358 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4359 int idx; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4360 /* We win if the charset_not inside the loop |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4361 lists every character listed in the charset after. */ |
8254
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4362 for (idx = 0; idx < (int) p2[1]; idx++) |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4363 if (! (p2[2 + idx] == 0 |
8254
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4364 || (idx < (int) p1[4] |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4365 && ((p2[2 + idx] & ~ p1[5 + idx]) == 0)))) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4366 break; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4367 |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4368 if (idx == p2[1]) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4369 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4370 p[-3] = (unsigned char) pop_failure_jump; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4371 DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4372 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4373 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4374 else if ((re_opcode_t) p1[3] == charset) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4375 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4376 int idx; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4377 /* We win if the charset inside the loop |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4378 has no overlap with the one after the loop. */ |
8254
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4379 for (idx = 0; |
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4380 idx < (int) p2[1] && idx < (int) p1[4]; |
694c4686b446
(re_match_2_internal): Add casts to shut up some compilers.
Richard M. Stallman <rms@gnu.org>
parents:
8142
diff
changeset
|
4381 idx++) |
3541
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4382 if ((p2[2 + idx] & p1[5 + idx]) != 0) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4383 break; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4384 |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4385 if (idx == p2[1] || idx == p1[4]) |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4386 { |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4387 p[-3] = (unsigned char) pop_failure_jump; |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4388 DEBUG_PRINT1 (" No match => pop_failure_jump.\n"); |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4389 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4390 } |
cb4aa2f13edd
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
2952
diff
changeset
|
4391 } |
1155 | 4392 } |
4393 p -= 2; /* Point at relative address again. */ | |
4394 if ((re_opcode_t) p[-1] != pop_failure_jump) | |
4395 { | |
4396 p[-1] = (unsigned char) jump; | |
1637 | 4397 DEBUG_PRINT1 (" Match => jump.\n"); |
1155 | 4398 goto unconditional_jump; |
4399 } | |
4400 /* Note fall through. */ | |
4401 | |
4402 | |
4403 /* The end of a simple repeat has a pop_failure_jump back to | |
4404 its matching on_failure_jump, where the latter will push a | |
4405 failure point. The pop_failure_jump takes off failure | |
4406 points put on by this pop_failure_jump's matching | |
4407 on_failure_jump; we got through the pattern to here from the | |
4408 matching on_failure_jump, so didn't fail. */ | |
4409 case pop_failure_jump: | |
4410 { | |
4411 /* We need to pass separate storage for the lowest and | |
4412 highest registers, even though we don't care about the | |
4413 actual values. Otherwise, we will restore only one | |
4414 register from the stack, since lowest will == highest in | |
4415 `pop_failure_point'. */ | |
4416 unsigned dummy_low_reg, dummy_high_reg; | |
4417 unsigned char *pdummy; | |
4418 const char *sdummy; | |
4419 | |
4420 DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n"); | |
4421 POP_FAILURE_POINT (sdummy, pdummy, | |
4422 dummy_low_reg, dummy_high_reg, | |
4423 reg_dummy, reg_dummy, reg_info_dummy); | |
4424 } | |
4425 /* Note fall through. */ | |
4426 | |
4427 | |
4428 /* Unconditionally jump (without popping any failure points). */ | |
4429 case jump: | |
4430 unconditional_jump: | |
4431 EXTRACT_NUMBER_AND_INCR (mcnt, p); /* Get the amount to jump. */ | |
4432 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt); | |
4433 p += mcnt; /* Do the jump. */ | |
4434 DEBUG_PRINT2 ("(to 0x%x).\n", p); | |
4435 break; | |
4436 | |
4437 | |
4438 /* We need this opcode so we can detect where alternatives end | |
4439 in `group_match_null_string_p' et al. */ | |
4440 case jump_past_alt: | |
4441 DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n"); | |
4442 goto unconditional_jump; | |
4443 | |
4444 | |
4445 /* Normally, the on_failure_jump pushes a failure point, which | |
4446 then gets popped at pop_failure_jump. We will end up at | |
4447 pop_failure_jump, also, and with a pattern of, say, `a+', we | |
4448 are skipping over the on_failure_jump, so we have to push | |
4449 something meaningless for pop_failure_jump to pop. */ | |
4450 case dummy_failure_jump: | |
4451 DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n"); | |
4452 /* It doesn't matter what we push for the string here. What | |
4453 the code at `fail' tests is the value for the pattern. */ | |
4454 PUSH_FAILURE_POINT (0, 0, -2); | |
4455 goto unconditional_jump; | |
4456 | |
4457 | |
4458 /* At the end of an alternative, we need to push a dummy failure | |
1637 | 4459 point in case we are followed by a `pop_failure_jump', because |
1155 | 4460 we don't want the failure point for the alternative to be |
4461 popped. For example, matching `(a|ab)*' against `aab' | |
4462 requires that we match the `ab' alternative. */ | |
4463 case push_dummy_failure: | |
4464 DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n"); | |
4465 /* See comments just above at `dummy_failure_jump' about the | |
4466 two zeroes. */ | |
4467 PUSH_FAILURE_POINT (0, 0, -2); | |
4468 break; | |
4469 | |
4470 /* Have to succeed matching what follows at least n times. | |
4471 After that, handle like `on_failure_jump'. */ | |
4472 case succeed_n: | |
4473 EXTRACT_NUMBER (mcnt, p + 2); | |
4474 DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt); | |
4475 | |
4476 assert (mcnt >= 0); | |
4477 /* Originally, this is how many times we HAVE to succeed. */ | |
4478 if (mcnt > 0) | |
4479 { | |
4480 mcnt--; | |
4481 p += 2; | |
4482 STORE_NUMBER_AND_INCR (p, mcnt); | |
4483 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p, mcnt); | |
4484 } | |
4485 else if (mcnt == 0) | |
4486 { | |
4487 DEBUG_PRINT2 (" Setting two bytes from 0x%x to no_op.\n", p+2); | |
4488 p[2] = (unsigned char) no_op; | |
4489 p[3] = (unsigned char) no_op; | |
4490 goto on_failure; | |
4491 } | |
4492 break; | |
4493 | |
4494 case jump_n: | |
4495 EXTRACT_NUMBER (mcnt, p + 2); | |
4496 DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt); | |
4497 | |
4498 /* Originally, this is how many times we CAN jump. */ | |
4499 if (mcnt) | |
4500 { | |
4501 mcnt--; | |
4502 STORE_NUMBER (p + 2, mcnt); | |
4503 goto unconditional_jump; | |
4504 } | |
4505 /* If don't have to jump any more, skip over the rest of command. */ | |
4506 else | |
4507 p += 4; | |
4508 break; | |
4509 | |
4510 case set_number_at: | |
4511 { | |
4512 DEBUG_PRINT1 ("EXECUTING set_number_at.\n"); | |
4513 | |
4514 EXTRACT_NUMBER_AND_INCR (mcnt, p); | |
4515 p1 = p + mcnt; | |
4516 EXTRACT_NUMBER_AND_INCR (mcnt, p); | |
4517 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p1, mcnt); | |
4518 STORE_NUMBER (p1, mcnt); | |
4519 break; | |
4520 } | |
4521 | |
4522 case wordbound: | |
4523 DEBUG_PRINT1 ("EXECUTING wordbound.\n"); | |
4524 if (AT_WORD_BOUNDARY (d)) | |
4525 break; | |
4526 goto fail; | |
4527 | |
4528 case notwordbound: | |
4529 DEBUG_PRINT1 ("EXECUTING notwordbound.\n"); | |
4530 if (AT_WORD_BOUNDARY (d)) | |
4531 goto fail; | |
4532 break; | |
4533 | |
4534 case wordbeg: | |
4535 DEBUG_PRINT1 ("EXECUTING wordbeg.\n"); | |
1637 | 4536 if (WORDCHAR_P (d) && (AT_STRINGS_BEG (d) || !WORDCHAR_P (d - 1))) |
1155 | 4537 break; |
4538 goto fail; | |
4539 | |
4540 case wordend: | |
4541 DEBUG_PRINT1 ("EXECUTING wordend.\n"); | |
1637 | 4542 if (!AT_STRINGS_BEG (d) && WORDCHAR_P (d - 1) |
4543 && (!WORDCHAR_P (d) || AT_STRINGS_END (d))) | |
1155 | 4544 break; |
4545 goto fail; | |
4546 | |
4547 #ifdef emacs | |
4548 case before_dot: | |
4549 DEBUG_PRINT1 ("EXECUTING before_dot.\n"); | |
4550 if (PTR_CHAR_POS ((unsigned char *) d) >= point) | |
4551 goto fail; | |
4552 break; | |
4553 | |
4554 case at_dot: | |
4555 DEBUG_PRINT1 ("EXECUTING at_dot.\n"); | |
4556 if (PTR_CHAR_POS ((unsigned char *) d) != point) | |
4557 goto fail; | |
4558 break; | |
4559 | |
4560 case after_dot: | |
4561 DEBUG_PRINT1 ("EXECUTING after_dot.\n"); | |
4562 if (PTR_CHAR_POS ((unsigned char *) d) <= point) | |
4563 goto fail; | |
4564 break; | |
6538
815a2d384b6e
*** empty log message ***
Richard M. Stallman <rms@gnu.org>
parents:
6202
diff
changeset
|
4565 #if 0 /* not emacs19 */ |
1155 | 4566 case at_dot: |
4567 DEBUG_PRINT1 ("EXECUTING at_dot.\n"); | |
4568 if (PTR_CHAR_POS ((unsigned char *) d) + 1 != point) | |
4569 goto fail; | |
4570 break; | |
4571 #endif /* not emacs19 */ | |
4572 | |
4573 case syntaxspec: | |
4574 DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt); | |
4575 mcnt = *p++; | |
4576 goto matchsyntax; | |
4577 | |
4578 case wordchar: | |
1637 | 4579 DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n"); |
1155 | 4580 mcnt = (int) Sword; |
4581 matchsyntax: | |
4582 PREFETCH (); | |
6047 | 4583 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */ |
4584 d++; | |
4585 if (SYNTAX (d[-1]) != (enum syntaxcode) mcnt) | |
4586 goto fail; | |
1155 | 4587 SET_REGS_MATCHED (); |
4588 break; | |
4589 | |
4590 case notsyntaxspec: | |
4591 DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt); | |
4592 mcnt = *p++; | |
4593 goto matchnotsyntax; | |
4594 | |
4595 case notwordchar: | |
1637 | 4596 DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n"); |
1155 | 4597 mcnt = (int) Sword; |
1637 | 4598 matchnotsyntax: |
1155 | 4599 PREFETCH (); |
6047 | 4600 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */ |
4601 d++; | |
4602 if (SYNTAX (d[-1]) == (enum syntaxcode) mcnt) | |
4603 goto fail; | |
1155 | 4604 SET_REGS_MATCHED (); |
4605 break; | |
4606 | |
4607 #else /* not emacs */ | |
4608 case wordchar: | |
4609 DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n"); | |
4610 PREFETCH (); | |
1637 | 4611 if (!WORDCHAR_P (d)) |
1155 | 4612 goto fail; |
4613 SET_REGS_MATCHED (); | |
1637 | 4614 d++; |
1155 | 4615 break; |
4616 | |
4617 case notwordchar: | |
4618 DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n"); | |
4619 PREFETCH (); | |
1637 | 4620 if (WORDCHAR_P (d)) |
1155 | 4621 goto fail; |
4622 SET_REGS_MATCHED (); | |
1637 | 4623 d++; |
1155 | 4624 break; |
4625 #endif /* not emacs */ | |
4626 | |
4627 default: | |
4628 abort (); | |
4629 } | |
4630 continue; /* Successfully executed one pattern command; keep going. */ | |
4631 | |
4632 | |
4633 /* We goto here if a matching operation fails. */ | |
4634 fail: | |
4635 if (!FAIL_STACK_EMPTY ()) | |
4636 { /* A restart point is known. Restore to that state. */ | |
4637 DEBUG_PRINT1 ("\nFAIL:\n"); | |
4638 POP_FAILURE_POINT (d, p, | |
4639 lowest_active_reg, highest_active_reg, | |
4640 regstart, regend, reg_info); | |
4641 | |
4642 /* If this failure point is a dummy, try the next one. */ | |
4643 if (!p) | |
4644 goto fail; | |
4645 | |
4646 /* If we failed to the end of the pattern, don't examine *p. */ | |
4647 assert (p <= pend); | |
4648 if (p < pend) | |
4649 { | |
4650 boolean is_a_jump_n = false; | |
4651 | |
4652 /* If failed to a backwards jump that's part of a repetition | |
4653 loop, need to pop this failure point and use the next one. */ | |
4654 switch ((re_opcode_t) *p) | |
4655 { | |
4656 case jump_n: | |
4657 is_a_jump_n = true; | |
4658 case maybe_pop_jump: | |
4659 case pop_failure_jump: | |
4660 case jump: | |
4661 p1 = p + 1; | |
4662 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4663 p1 += mcnt; | |
4664 | |
4665 if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n) | |
4666 || (!is_a_jump_n | |
4667 && (re_opcode_t) *p1 == on_failure_jump)) | |
4668 goto fail; | |
4669 break; | |
4670 default: | |
4671 /* do nothing */ ; | |
4672 } | |
4673 } | |
4674 | |
4675 if (d >= string1 && d <= end1) | |
4676 dend = end_match_1; | |
4677 } | |
4678 else | |
4679 break; /* Matching at this starting point really fails. */ | |
4680 } /* for (;;) */ | |
4681 | |
4682 if (best_regs_set) | |
4683 goto restore_best_regs; | |
4684 | |
4685 FREE_VARIABLES (); | |
4686 | |
4687 return -1; /* Failure to match. */ | |
4688 } /* re_match_2 */ | |
4689 | |
4690 /* Subroutine definitions for re_match_2. */ | |
4691 | |
4692 | |
4693 /* We are passed P pointing to a register number after a start_memory. | |
4694 | |
4695 Return true if the pattern up to the corresponding stop_memory can | |
4696 match the empty string, and false otherwise. | |
4697 | |
4698 If we find the matching stop_memory, sets P to point to one past its number. | |
4699 Otherwise, sets P to an undefined byte less than or equal to END. | |
4700 | |
4701 We don't handle duplicates properly (yet). */ | |
4702 | |
4703 static boolean | |
4704 group_match_null_string_p (p, end, reg_info) | |
4705 unsigned char **p, *end; | |
4706 register_info_type *reg_info; | |
4707 { | |
4708 int mcnt; | |
4709 /* Point to after the args to the start_memory. */ | |
4710 unsigned char *p1 = *p + 2; | |
4711 | |
4712 while (p1 < end) | |
4713 { | |
4714 /* Skip over opcodes that can match nothing, and return true or | |
4715 false, as appropriate, when we get to one that can't, or to the | |
4716 matching stop_memory. */ | |
4717 | |
4718 switch ((re_opcode_t) *p1) | |
4719 { | |
4720 /* Could be either a loop or a series of alternatives. */ | |
4721 case on_failure_jump: | |
4722 p1++; | |
4723 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4724 | |
4725 /* If the next operation is not a jump backwards in the | |
4726 pattern. */ | |
4727 | |
4728 if (mcnt >= 0) | |
4729 { | |
4730 /* Go through the on_failure_jumps of the alternatives, | |
4731 seeing if any of the alternatives cannot match nothing. | |
4732 The last alternative starts with only a jump, | |
4733 whereas the rest start with on_failure_jump and end | |
4734 with a jump, e.g., here is the pattern for `a|b|c': | |
4735 | |
4736 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6 | |
4737 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3 | |
4738 /exactn/1/c | |
4739 | |
4740 So, we have to first go through the first (n-1) | |
4741 alternatives and then deal with the last one separately. */ | |
4742 | |
4743 | |
4744 /* Deal with the first (n-1) alternatives, which start | |
4745 with an on_failure_jump (see above) that jumps to right | |
4746 past a jump_past_alt. */ | |
4747 | |
4748 while ((re_opcode_t) p1[mcnt-3] == jump_past_alt) | |
4749 { | |
4750 /* `mcnt' holds how many bytes long the alternative | |
4751 is, including the ending `jump_past_alt' and | |
4752 its number. */ | |
4753 | |
4754 if (!alt_match_null_string_p (p1, p1 + mcnt - 3, | |
4755 reg_info)) | |
4756 return false; | |
4757 | |
4758 /* Move to right after this alternative, including the | |
4759 jump_past_alt. */ | |
4760 p1 += mcnt; | |
4761 | |
4762 /* Break if it's the beginning of an n-th alternative | |
4763 that doesn't begin with an on_failure_jump. */ | |
4764 if ((re_opcode_t) *p1 != on_failure_jump) | |
4765 break; | |
4766 | |
4767 /* Still have to check that it's not an n-th | |
4768 alternative that starts with an on_failure_jump. */ | |
4769 p1++; | |
4770 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4771 if ((re_opcode_t) p1[mcnt-3] != jump_past_alt) | |
4772 { | |
4773 /* Get to the beginning of the n-th alternative. */ | |
4774 p1 -= 3; | |
4775 break; | |
4776 } | |
4777 } | |
4778 | |
4779 /* Deal with the last alternative: go back and get number | |
4780 of the `jump_past_alt' just before it. `mcnt' contains | |
4781 the length of the alternative. */ | |
4782 EXTRACT_NUMBER (mcnt, p1 - 2); | |
4783 | |
4784 if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info)) | |
4785 return false; | |
4786 | |
4787 p1 += mcnt; /* Get past the n-th alternative. */ | |
4788 } /* if mcnt > 0 */ | |
4789 break; | |
4790 | |
4791 | |
4792 case stop_memory: | |
4793 assert (p1[1] == **p); | |
4794 *p = p1 + 2; | |
4795 return true; | |
4796 | |
4797 | |
4798 default: | |
4799 if (!common_op_match_null_string_p (&p1, end, reg_info)) | |
4800 return false; | |
4801 } | |
4802 } /* while p1 < end */ | |
4803 | |
4804 return false; | |
4805 } /* group_match_null_string_p */ | |
4806 | |
4807 | |
4808 /* Similar to group_match_null_string_p, but doesn't deal with alternatives: | |
4809 It expects P to be the first byte of a single alternative and END one | |
4810 byte past the last. The alternative can contain groups. */ | |
4811 | |
4812 static boolean | |
4813 alt_match_null_string_p (p, end, reg_info) | |
4814 unsigned char *p, *end; | |
4815 register_info_type *reg_info; | |
4816 { | |
4817 int mcnt; | |
4818 unsigned char *p1 = p; | |
4819 | |
4820 while (p1 < end) | |
4821 { | |
4822 /* Skip over opcodes that can match nothing, and break when we get | |
4823 to one that can't. */ | |
4824 | |
4825 switch ((re_opcode_t) *p1) | |
4826 { | |
4827 /* It's a loop. */ | |
4828 case on_failure_jump: | |
4829 p1++; | |
4830 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4831 p1 += mcnt; | |
4832 break; | |
4833 | |
4834 default: | |
4835 if (!common_op_match_null_string_p (&p1, end, reg_info)) | |
4836 return false; | |
4837 } | |
4838 } /* while p1 < end */ | |
4839 | |
4840 return true; | |
4841 } /* alt_match_null_string_p */ | |
4842 | |
4843 | |
4844 /* Deals with the ops common to group_match_null_string_p and | |
4845 alt_match_null_string_p. | |
4846 | |
4847 Sets P to one after the op and its arguments, if any. */ | |
4848 | |
4849 static boolean | |
4850 common_op_match_null_string_p (p, end, reg_info) | |
4851 unsigned char **p, *end; | |
4852 register_info_type *reg_info; | |
4853 { | |
4854 int mcnt; | |
4855 boolean ret; | |
4856 int reg_no; | |
4857 unsigned char *p1 = *p; | |
4858 | |
4859 switch ((re_opcode_t) *p1++) | |
4860 { | |
4861 case no_op: | |
4862 case begline: | |
4863 case endline: | |
4864 case begbuf: | |
4865 case endbuf: | |
4866 case wordbeg: | |
4867 case wordend: | |
4868 case wordbound: | |
4869 case notwordbound: | |
4870 #ifdef emacs | |
4871 case before_dot: | |
4872 case at_dot: | |
4873 case after_dot: | |
4874 #endif | |
4875 break; | |
4876 | |
4877 case start_memory: | |
4878 reg_no = *p1; | |
4879 assert (reg_no > 0 && reg_no <= MAX_REGNUM); | |
4880 ret = group_match_null_string_p (&p1, end, reg_info); | |
4881 | |
4882 /* Have to set this here in case we're checking a group which | |
4883 contains a group and a back reference to it. */ | |
4884 | |
4885 if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE) | |
4886 REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret; | |
4887 | |
4888 if (!ret) | |
4889 return false; | |
4890 break; | |
4891 | |
4892 /* If this is an optimized succeed_n for zero times, make the jump. */ | |
4893 case jump: | |
4894 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4895 if (mcnt >= 0) | |
4896 p1 += mcnt; | |
4897 else | |
4898 return false; | |
4899 break; | |
4900 | |
4901 case succeed_n: | |
4902 /* Get to the number of times to succeed. */ | |
4903 p1 += 2; | |
4904 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4905 | |
4906 if (mcnt == 0) | |
4907 { | |
4908 p1 -= 4; | |
4909 EXTRACT_NUMBER_AND_INCR (mcnt, p1); | |
4910 p1 += mcnt; | |
4911 } | |
4912 else | |
4913 return false; | |
4914 break; | |
4915 | |
4916 case duplicate: | |
4917 if (!REG_MATCH_NULL_STRING_P (reg_info[*p1])) | |
4918 return false; | |
4919 break; | |
4920 | |
4921 case set_number_at: | |
4922 p1 += 4; | |
4923 | |
4924 default: | |
4925 /* All other opcodes mean we cannot match the empty string. */ | |
4926 return false; | |
4927 } | |
4928 | |
4929 *p = p1; | |
4930 return true; | |
4931 } /* common_op_match_null_string_p */ | |
4932 | |
4933 | |
4934 /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN | |
4935 bytes; nonzero otherwise. */ | |
4936 | |
4937 static int | |
4938 bcmp_translate (s1, s2, len, translate) | |
4939 unsigned char *s1, *s2; | |
4940 register int len; | |
4941 char *translate; | |
4942 { | |
4943 register unsigned char *p1 = s1, *p2 = s2; | |
4944 while (len) | |
4945 { | |
4946 if (translate[*p1++] != translate[*p2++]) return 1; | |
4947 len--; | |
4948 } | |
4949 return 0; | |
4950 } | |
4951 | |
4952 /* Entry points for GNU code. */ | |
4953 | |
4954 /* re_compile_pattern is the GNU regular expression compiler: it | |
4955 compiles PATTERN (of length SIZE) and puts the result in BUFP. | |
4956 Returns 0 if the pattern was valid, otherwise an error string. | |
4957 | |
4958 Assumes the `allocated' (and perhaps `buffer') and `translate' fields | |
4959 are set in BUFP on entry. | |
4960 | |
4961 We call regex_compile to do the actual compilation. */ | |
4962 | |
4963 const char * | |
4964 re_compile_pattern (pattern, length, bufp) | |
4965 const char *pattern; | |
4966 int length; | |
4967 struct re_pattern_buffer *bufp; | |
4968 { | |
4969 reg_errcode_t ret; | |
4970 | |
4971 /* GNU code is written to assume at least RE_NREGS registers will be set | |
4972 (and at least one extra will be -1). */ | |
4973 bufp->regs_allocated = REGS_UNALLOCATED; | |
4974 | |
4975 /* And GNU code determines whether or not to get register information | |
4976 by passing null for the REGS argument to re_match, etc., not by | |
4977 setting no_sub. */ | |
4978 bufp->no_sub = 0; | |
4979 | |
4980 /* Match anchors at newline. */ | |
4981 bufp->newline_anchor = 1; | |
4982 | |
4983 ret = regex_compile (pattern, length, re_syntax_options, bufp); | |
4984 | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
4985 if (!ret) |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
4986 return NULL; |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
4987 return gettext (re_error_msgid[(int) ret]); |
1155 | 4988 } |
4989 | |
4990 /* Entry points compatible with 4.2 BSD regex library. We don't define | |
9717
96a592ccb751
(re_comp, re_exec): Define this obsolete 4.2bsd
Paul Eggert <eggert@twinsun.com>
parents:
9585
diff
changeset
|
4991 them unless specifically requested. */ |
96a592ccb751
(re_comp, re_exec): Define this obsolete 4.2bsd
Paul Eggert <eggert@twinsun.com>
parents:
9585
diff
changeset
|
4992 |
96a592ccb751
(re_comp, re_exec): Define this obsolete 4.2bsd
Paul Eggert <eggert@twinsun.com>
parents:
9585
diff
changeset
|
4993 #ifdef _REGEX_RE_COMP |
1155 | 4994 |
4995 /* BSD has one and only one pattern buffer. */ | |
4996 static struct re_pattern_buffer re_comp_buf; | |
4997 | |
4998 char * | |
4999 re_comp (s) | |
5000 const char *s; | |
5001 { | |
5002 reg_errcode_t ret; | |
5003 | |
5004 if (!s) | |
5005 { | |
5006 if (!re_comp_buf.buffer) | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5007 return gettext ("No previous regular expression"); |
1155 | 5008 return 0; |
5009 } | |
5010 | |
5011 if (!re_comp_buf.buffer) | |
5012 { | |
5013 re_comp_buf.buffer = (unsigned char *) malloc (200); | |
5014 if (re_comp_buf.buffer == NULL) | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5015 return gettext (re_error_msgid[(int) REG_ESPACE]); |
1155 | 5016 re_comp_buf.allocated = 200; |
5017 | |
5018 re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH); | |
5019 if (re_comp_buf.fastmap == NULL) | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5020 return gettext (re_error_msgid[(int) REG_ESPACE]); |
1155 | 5021 } |
5022 | |
5023 /* Since `re_exec' always passes NULL for the `regs' argument, we | |
5024 don't need to initialize the pattern buffer fields which affect it. */ | |
5025 | |
5026 /* Match anchors at newlines. */ | |
5027 re_comp_buf.newline_anchor = 1; | |
5028 | |
5029 ret = regex_compile (s, strlen (s), re_syntax_options, &re_comp_buf); | |
5030 | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5031 if (!ret) |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5032 return NULL; |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5033 |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5034 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */ |
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5035 return (char *) gettext (re_error_msgid[(int) ret]); |
1155 | 5036 } |
5037 | |
5038 | |
5039 int | |
5040 re_exec (s) | |
5041 const char *s; | |
5042 { | |
5043 const int len = strlen (s); | |
5044 return | |
5045 0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0); | |
5046 } | |
9717
96a592ccb751
(re_comp, re_exec): Define this obsolete 4.2bsd
Paul Eggert <eggert@twinsun.com>
parents:
9585
diff
changeset
|
5047 #endif /* _REGEX_RE_COMP */ |
1155 | 5048 |
5049 /* POSIX.2 functions. Don't define these for Emacs. */ | |
5050 | |
5051 #ifndef emacs | |
5052 | |
5053 /* regcomp takes a regular expression as a string and compiles it. | |
5054 | |
5055 PREG is a regex_t *. We do not expect any fields to be initialized, | |
5056 since POSIX says we shouldn't. Thus, we set | |
5057 | |
5058 `buffer' to the compiled pattern; | |
5059 `used' to the length of the compiled pattern; | |
5060 `syntax' to RE_SYNTAX_POSIX_EXTENDED if the | |
5061 REG_EXTENDED bit in CFLAGS is set; otherwise, to | |
5062 RE_SYNTAX_POSIX_BASIC; | |
5063 `newline_anchor' to REG_NEWLINE being set in CFLAGS; | |
5064 `fastmap' and `fastmap_accurate' to zero; | |
5065 `re_nsub' to the number of subexpressions in PATTERN. | |
5066 | |
5067 PATTERN is the address of the pattern string. | |
5068 | |
5069 CFLAGS is a series of bits which affect compilation. | |
5070 | |
5071 If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we | |
5072 use POSIX basic syntax. | |
5073 | |
5074 If REG_NEWLINE is set, then . and [^...] don't match newline. | |
5075 Also, regexec will try a match beginning after every newline. | |
5076 | |
5077 If REG_ICASE is set, then we considers upper- and lowercase | |
5078 versions of letters to be equivalent when matching. | |
5079 | |
5080 If REG_NOSUB is set, then when PREG is passed to regexec, that | |
5081 routine will report only success or failure, and nothing about the | |
5082 registers. | |
5083 | |
5084 It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for | |
5085 the return codes and their meanings.) */ | |
5086 | |
5087 int | |
5088 regcomp (preg, pattern, cflags) | |
5089 regex_t *preg; | |
5090 const char *pattern; | |
5091 int cflags; | |
5092 { | |
5093 reg_errcode_t ret; | |
5094 unsigned syntax | |
1642
340feb030df1
*** empty log message ***
David J. MacKenzie <djm@gnu.org>
parents:
1641
diff
changeset
|
5095 = (cflags & REG_EXTENDED) ? |
340feb030df1
*** empty log message ***
David J. MacKenzie <djm@gnu.org>
parents:
1641
diff
changeset
|
5096 RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC; |
1155 | 5097 |
5098 /* regex_compile will allocate the space for the compiled pattern. */ | |
5099 preg->buffer = 0; | |
1642
340feb030df1
*** empty log message ***
David J. MacKenzie <djm@gnu.org>
parents:
1641
diff
changeset
|
5100 preg->allocated = 0; |
2758 | 5101 preg->used = 0; |
1155 | 5102 |
5103 /* Don't bother to use a fastmap when searching. This simplifies the | |
5104 REG_NEWLINE case: if we used a fastmap, we'd have to put all the | |
5105 characters after newlines into the fastmap. This way, we just try | |
5106 every character. */ | |
5107 preg->fastmap = 0; | |
5108 | |
5109 if (cflags & REG_ICASE) | |
5110 { | |
5111 unsigned i; | |
5112 | |
5113 preg->translate = (char *) malloc (CHAR_SET_SIZE); | |
5114 if (preg->translate == NULL) | |
5115 return (int) REG_ESPACE; | |
5116 | |
5117 /* Map uppercase characters to corresponding lowercase ones. */ | |
5118 for (i = 0; i < CHAR_SET_SIZE; i++) | |
1668 | 5119 preg->translate[i] = ISUPPER (i) ? tolower (i) : i; |
1155 | 5120 } |
5121 else | |
5122 preg->translate = NULL; | |
5123 | |
5124 /* If REG_NEWLINE is set, newlines are treated differently. */ | |
5125 if (cflags & REG_NEWLINE) | |
5126 { /* REG_NEWLINE implies neither . nor [^...] match newline. */ | |
5127 syntax &= ~RE_DOT_NEWLINE; | |
5128 syntax |= RE_HAT_LISTS_NOT_NEWLINE; | |
5129 /* It also changes the matching behavior. */ | |
5130 preg->newline_anchor = 1; | |
5131 } | |
5132 else | |
5133 preg->newline_anchor = 0; | |
5134 | |
5135 preg->no_sub = !!(cflags & REG_NOSUB); | |
5136 | |
5137 /* POSIX says a null character in the pattern terminates it, so we | |
5138 can use strlen here in compiling the pattern. */ | |
5139 ret = regex_compile (pattern, strlen (pattern), syntax, preg); | |
5140 | |
5141 /* POSIX doesn't distinguish between an unmatched open-group and an | |
5142 unmatched close-group: both are REG_EPAREN. */ | |
5143 if (ret == REG_ERPAREN) ret = REG_EPAREN; | |
5144 | |
5145 return (int) ret; | |
5146 } | |
5147 | |
5148 | |
5149 /* regexec searches for a given pattern, specified by PREG, in the | |
5150 string STRING. | |
5151 | |
5152 If NMATCH is zero or REG_NOSUB was set in the cflags argument to | |
5153 `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at | |
5154 least NMATCH elements, and we set them to the offsets of the | |
5155 corresponding matched substrings. | |
5156 | |
5157 EFLAGS specifies `execution flags' which affect matching: if | |
5158 REG_NOTBOL is set, then ^ does not match at the beginning of the | |
5159 string; if REG_NOTEOL is set, then $ does not match at the end. | |
5160 | |
5161 We return 0 if we find a match and REG_NOMATCH if not. */ | |
5162 | |
5163 int | |
5164 regexec (preg, string, nmatch, pmatch, eflags) | |
5165 const regex_t *preg; | |
5166 const char *string; | |
5167 size_t nmatch; | |
5168 regmatch_t pmatch[]; | |
5169 int eflags; | |
5170 { | |
5171 int ret; | |
5172 struct re_registers regs; | |
5173 regex_t private_preg; | |
5174 int len = strlen (string); | |
5175 boolean want_reg_info = !preg->no_sub && nmatch > 0; | |
5176 | |
5177 private_preg = *preg; | |
5178 | |
5179 private_preg.not_bol = !!(eflags & REG_NOTBOL); | |
5180 private_preg.not_eol = !!(eflags & REG_NOTEOL); | |
5181 | |
5182 /* The user has told us exactly how many registers to return | |
5183 information about, via `nmatch'. We have to pass that on to the | |
5184 matching routines. */ | |
5185 private_preg.regs_allocated = REGS_FIXED; | |
5186 | |
5187 if (want_reg_info) | |
5188 { | |
5189 regs.num_regs = nmatch; | |
5190 regs.start = TALLOC (nmatch, regoff_t); | |
5191 regs.end = TALLOC (nmatch, regoff_t); | |
5192 if (regs.start == NULL || regs.end == NULL) | |
5193 return (int) REG_NOMATCH; | |
5194 } | |
5195 | |
5196 /* Perform the searching operation. */ | |
5197 ret = re_search (&private_preg, string, len, | |
5198 /* start: */ 0, /* range: */ len, | |
5199 want_reg_info ? ®s : (struct re_registers *) 0); | |
5200 | |
5201 /* Copy the register information to the POSIX structure. */ | |
5202 if (want_reg_info) | |
5203 { | |
5204 if (ret >= 0) | |
5205 { | |
5206 unsigned r; | |
5207 | |
5208 for (r = 0; r < nmatch; r++) | |
5209 { | |
5210 pmatch[r].rm_so = regs.start[r]; | |
5211 pmatch[r].rm_eo = regs.end[r]; | |
5212 } | |
5213 } | |
5214 | |
5215 /* If we needed the temporary register info, free the space now. */ | |
5216 free (regs.start); | |
5217 free (regs.end); | |
5218 } | |
5219 | |
5220 /* We want zero return to mean success, unlike `re_search'. */ | |
5221 return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH; | |
5222 } | |
5223 | |
5224 | |
5225 /* Returns a message corresponding to an error code, ERRCODE, returned | |
1637 | 5226 from either regcomp or regexec. We don't use PREG here. */ |
1155 | 5227 |
5228 size_t | |
5229 regerror (errcode, preg, errbuf, errbuf_size) | |
5230 int errcode; | |
5231 const regex_t *preg; | |
5232 char *errbuf; | |
5233 size_t errbuf_size; | |
5234 { | |
1738 | 5235 const char *msg; |
5236 size_t msg_size; | |
5237 | |
5238 if (errcode < 0 | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5239 || errcode >= (sizeof (re_error_msgid) / sizeof (re_error_msgid[0]))) |
1738 | 5240 /* Only error codes returned by the rest of the code should be passed |
5241 to this routine. If we are given anything else, or if other regex | |
5242 code generates an invalid error code, then the program has a bug. | |
5243 Dump core so we can fix it. */ | |
5244 abort (); | |
5245 | |
10090
672e07670453
(re_compile_pattern, re_comp, regerror): Add gettext wrapper.
Paul Eggert <eggert@twinsun.com>
parents:
10023
diff
changeset
|
5246 msg = gettext (re_error_msgid[errcode]); |
2453 | 5247 |
1738 | 5248 msg_size = strlen (msg) + 1; /* Includes the null. */ |
1155 | 5249 |
5250 if (errbuf_size != 0) | |
5251 { | |
5252 if (msg_size > errbuf_size) | |
5253 { | |
5254 strncpy (errbuf, msg, errbuf_size - 1); | |
5255 errbuf[errbuf_size - 1] = 0; | |
5256 } | |
5257 else | |
5258 strcpy (errbuf, msg); | |
5259 } | |
5260 | |
5261 return msg_size; | |
5262 } | |
5263 | |
5264 | |
5265 /* Free dynamically allocated space used by PREG. */ | |
5266 | |
5267 void | |
5268 regfree (preg) | |
5269 regex_t *preg; | |
5270 { | |
5271 if (preg->buffer != NULL) | |
5272 free (preg->buffer); | |
5273 preg->buffer = NULL; | |
5274 | |
5275 preg->allocated = 0; | |
5276 preg->used = 0; | |
5277 | |
5278 if (preg->fastmap != NULL) | |
5279 free (preg->fastmap); | |
5280 preg->fastmap = NULL; | |
5281 preg->fastmap_accurate = 0; | |
5282 | |
5283 if (preg->translate != NULL) | |
5284 free (preg->translate); | |
5285 preg->translate = NULL; | |
5286 } | |
5287 | |
5288 #endif /* not emacs */ | |
5289 | |
5290 /* | |
5291 Local variables: | |
5292 make-backup-files: t | |
5293 version-control: t | |
5294 trim-versions-without-asking: nil | |
5295 End: | |
5296 */ |