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