1 /* Extended regular expression matching and search library,
3 (Implements POSIX draft P1003.2/D11.2, except for some of the
4 internationalization features.)
5 Copyright (C) 1993, 94, 95, 96, 97, 98 Free Software Foundation, Inc.
7 NOTE: The canonical source of this file is maintained with the
8 GNU C Library. Bugs can be reported to bug-glibc@prep.ai.mit.edu.
10 This program is free software; you can redistribute it and/or modify it
11 under the terms of the GNU General Public License as published by the
12 Free Software Foundation; either version 2, or (at your option) any
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to the Free Software Foundation,
22 Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
24 /* AIX requires this to be the first thing in the file. */
25 #if defined _AIX && !defined REGEX_MALLOC
37 # if defined __GNUC__ || (defined __STDC__ && __STDC__)
38 # define PARAMS(args) args
40 # define PARAMS(args) ()
42 #endif /* Not PARAMS. */
44 #if defined STDC_HEADERS && !defined emacs
47 /* We need this for `regex.h', and perhaps for the Emacs include files. */
48 # include <sys/types.h>
51 /* For platform which support the ISO C amendement 1 functionality we
52 support user defined character classes. */
53 #if defined _LIBC || (defined HAVE_WCTYPE_H && defined HAVE_WCHAR_H)
57 /* We have to keep the namespace clean. */
58 # define regfree(preg) __regfree (preg)
59 # define regexec(pr, st, nm, pm, ef) __regexec (pr, st, nm, pm, ef)
60 # define regcomp(preg, pattern, cflags) __regcomp (preg, pattern, cflags)
61 # define regerror(errcode, preg, errbuf, errbuf_size) \
62 __regerror(errcode, preg, errbuf, errbuf_size)
63 # define re_set_registers(bu, re, nu, st, en) \
64 __re_set_registers (bu, re, nu, st, en)
65 # define re_match_2(bufp, string1, size1, string2, size2, pos, regs, stop) \
66 __re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop)
67 # define re_match(bufp, string, size, pos, regs) \
68 __re_match (bufp, string, size, pos, regs)
69 # define re_search(bufp, string, size, startpos, range, regs) \
70 __re_search (bufp, string, size, startpos, range, regs)
71 # define re_compile_pattern(pattern, length, bufp) \
72 __re_compile_pattern (pattern, length, bufp)
73 # define re_set_syntax(syntax) __re_set_syntax (syntax)
74 # define re_search_2(bufp, st1, s1, st2, s2, startpos, range, regs, stop) \
75 __re_search_2 (bufp, st1, s1, st2, s2, startpos, range, regs, stop)
76 # define re_compile_fastmap(bufp) __re_compile_fastmap (bufp)
81 /* This is for other GNU distributions with internationalized messages. */
82 #if HAVE_LIBINTL_H || defined _LIBC
85 # define gettext(msgid) (msgid)
89 /* This define is so xgettext can find the internationalizable
91 # define gettext_noop(String) String
94 /* The `emacs' switch turns on certain matching commands
95 that make sense only in Emacs. */
102 #else /* not emacs */
104 /* If we are not linking with Emacs proper,
105 we can't use the relocating allocator
106 even if config.h says that we can. */
109 # if defined STDC_HEADERS || defined _LIBC
116 /* When used in Emacs's lib-src, we need to get bzero and bcopy somehow.
117 If nothing else has been done, use the method below. */
118 # ifdef INHIBIT_STRING_HEADER
119 # if !(defined HAVE_BZERO && defined HAVE_BCOPY)
120 # if !defined bzero && !defined bcopy
121 # undef INHIBIT_STRING_HEADER
126 /* This is the normal way of making sure we have a bcopy and a bzero.
127 This is used in most programs--a few other programs avoid this
128 by defining INHIBIT_STRING_HEADER. */
129 # ifndef INHIBIT_STRING_HEADER
130 # if defined HAVE_STRING_H || defined STDC_HEADERS || defined _LIBC
134 # define bzero(s, n) (memset (s, '\0', n), (s))
136 # define bzero(s, n) __bzero (s, n)
140 # include <strings.h>
142 # define memcmp(s1, s2, n) bcmp (s1, s2, n)
145 # define memcpy(d, s, n) (bcopy (s, d, n), (d))
150 /* Define the syntax stuff for \<, \>, etc. */
152 /* This must be nonzero for the wordchar and notwordchar pattern
153 commands in re_match_2. */
158 # ifdef SWITCH_ENUM_BUG
159 # define SWITCH_ENUM_CAST(x) ((int)(x))
161 # define SWITCH_ENUM_CAST(x) (x)
164 /* How many characters in the character set. */
165 # define CHAR_SET_SIZE 256
169 extern char *re_syntax_table
;
171 # else /* not SYNTAX_TABLE */
173 static char re_syntax_table
[CHAR_SET_SIZE
];
184 bzero (re_syntax_table
, sizeof re_syntax_table
);
186 for (c
= 'a'; c
<= 'z'; c
++)
187 re_syntax_table
[c
] = Sword
;
189 for (c
= 'A'; c
<= 'Z'; c
++)
190 re_syntax_table
[c
] = Sword
;
192 for (c
= '0'; c
<= '9'; c
++)
193 re_syntax_table
[c
] = Sword
;
195 re_syntax_table
['_'] = Sword
;
200 # endif /* not SYNTAX_TABLE */
202 # define SYNTAX(c) re_syntax_table[c]
204 #endif /* not emacs */
206 /* Get the interface, including the syntax bits. */
209 /* isalpha etc. are used for the character classes. */
212 /* Jim Meyering writes:
214 "... Some ctype macros are valid only for character codes that
215 isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when
216 using /bin/cc or gcc but without giving an ansi option). So, all
217 ctype uses should be through macros like ISPRINT... If
218 STDC_HEADERS is defined, then autoconf has verified that the ctype
219 macros don't need to be guarded with references to isascii. ...
220 Defining isascii to 1 should let any compiler worth its salt
221 eliminate the && through constant folding."
222 Solaris defines some of these symbols so we must undefine them first. */
225 #if defined STDC_HEADERS || (!defined isascii && !defined HAVE_ISASCII)
226 # define ISASCII(c) 1
228 # define ISASCII(c) isascii(c)
232 # define ISBLANK(c) (ISASCII (c) && isblank (c))
234 # define ISBLANK(c) ((c) == ' ' || (c) == '\t')
237 # define ISGRAPH(c) (ISASCII (c) && isgraph (c))
239 # define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c))
243 #define ISPRINT(c) (ISASCII (c) && isprint (c))
244 #define ISDIGIT(c) (ISASCII (c) && isdigit (c))
245 #define ISALNUM(c) (ISASCII (c) && isalnum (c))
246 #define ISALPHA(c) (ISASCII (c) && isalpha (c))
247 #define ISCNTRL(c) (ISASCII (c) && iscntrl (c))
248 #define ISLOWER(c) (ISASCII (c) && islower (c))
249 #define ISPUNCT(c) (ISASCII (c) && ispunct (c))
250 #define ISSPACE(c) (ISASCII (c) && isspace (c))
251 #define ISUPPER(c) (ISASCII (c) && isupper (c))
252 #define ISXDIGIT(c) (ISASCII (c) && isxdigit (c))
255 # define NULL (void *)0
258 /* We remove any previous definition of `SIGN_EXTEND_CHAR',
259 since ours (we hope) works properly with all combinations of
260 machines, compilers, `char' and `unsigned char' argument types.
261 (Per Bothner suggested the basic approach.) */
262 #undef SIGN_EXTEND_CHAR
264 # define SIGN_EXTEND_CHAR(c) ((signed char) (c))
265 #else /* not __STDC__ */
266 /* As in Harbison and Steele. */
267 # define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
270 /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we
271 use `alloca' instead of `malloc'. This is because using malloc in
272 re_search* or re_match* could cause memory leaks when C-g is used in
273 Emacs; also, malloc is slower and causes storage fragmentation. On
274 the other hand, malloc is more portable, and easier to debug.
276 Because we sometimes use alloca, some routines have to be macros,
277 not functions -- `alloca'-allocated space disappears at the end of the
278 function it is called in. */
282 # define REGEX_ALLOCATE malloc
283 # define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize)
284 # define REGEX_FREE free
286 #else /* not REGEX_MALLOC */
288 /* Emacs already defines alloca, sometimes. */
291 /* Make alloca work the best possible way. */
293 # define alloca __builtin_alloca
294 # else /* not __GNUC__ */
297 # endif /* HAVE_ALLOCA_H */
298 # endif /* not __GNUC__ */
300 # endif /* not alloca */
302 # define REGEX_ALLOCATE alloca
304 /* Assumes a `char *destination' variable. */
305 # define REGEX_REALLOCATE(source, osize, nsize) \
306 (destination = (char *) alloca (nsize), \
307 memcpy (destination, source, osize))
309 /* No need to do anything to free, after alloca. */
310 # define REGEX_FREE(arg) ((void)0) /* Do nothing! But inhibit gcc warning. */
312 #endif /* not REGEX_MALLOC */
314 /* Define how to allocate the failure stack. */
316 #if defined REL_ALLOC && defined REGEX_MALLOC
318 # define REGEX_ALLOCATE_STACK(size) \
319 r_alloc (&failure_stack_ptr, (size))
320 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
321 r_re_alloc (&failure_stack_ptr, (nsize))
322 # define REGEX_FREE_STACK(ptr) \
323 r_alloc_free (&failure_stack_ptr)
325 #else /* not using relocating allocator */
329 # define REGEX_ALLOCATE_STACK malloc
330 # define REGEX_REALLOCATE_STACK(source, osize, nsize) realloc (source, nsize)
331 # define REGEX_FREE_STACK free
333 # else /* not REGEX_MALLOC */
335 # define REGEX_ALLOCATE_STACK alloca
337 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
338 REGEX_REALLOCATE (source, osize, nsize)
339 /* No need to explicitly free anything. */
340 # define REGEX_FREE_STACK(arg)
342 # endif /* not REGEX_MALLOC */
343 #endif /* not using relocating allocator */
346 /* True if `size1' is non-NULL and PTR is pointing anywhere inside
347 `string1' or just past its end. This works if PTR is NULL, which is
349 #define FIRST_STRING_P(ptr) \
350 (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
352 /* (Re)Allocate N items of type T using malloc, or fail. */
353 #define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t)))
354 #define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t)))
355 #define RETALLOC_IF(addr, n, t) \
356 if (addr) RETALLOC((addr), (n), t); else (addr) = TALLOC ((n), t)
357 #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
359 #define BYTEWIDTH 8 /* In bits. */
361 #define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
365 #define MAX(a, b) ((a) > (b) ? (a) : (b))
366 #define MIN(a, b) ((a) < (b) ? (a) : (b))
368 typedef char boolean
;
372 static int re_match_2_internal
PARAMS ((struct re_pattern_buffer
*bufp
,
373 const char *string1
, int size1
,
374 const char *string2
, int size2
,
376 struct re_registers
*regs
,
379 /* These are the command codes that appear in compiled regular
380 expressions. Some opcodes are followed by argument bytes. A
381 command code can specify any interpretation whatsoever for its
382 arguments. Zero bytes may appear in the compiled regular expression. */
388 /* Succeed right away--no more backtracking. */
391 /* Followed by one byte giving n, then by n literal bytes. */
394 /* Matches any (more or less) character. */
397 /* Matches any one char belonging to specified set. First
398 following byte is number of bitmap bytes. Then come bytes
399 for a bitmap saying which chars are in. Bits in each byte
400 are ordered low-bit-first. A character is in the set if its
401 bit is 1. A character too large to have a bit in the map is
402 automatically not in the set. */
405 /* Same parameters as charset, but match any character that is
406 not one of those specified. */
409 /* Start remembering the text that is matched, for storing in a
410 register. Followed by one byte with the register number, in
411 the range 0 to one less than the pattern buffer's re_nsub
412 field. Then followed by one byte with the number of groups
413 inner to this one. (This last has to be part of the
414 start_memory only because we need it in the on_failure_jump
418 /* Stop remembering the text that is matched and store it in a
419 memory register. Followed by one byte with the register
420 number, in the range 0 to one less than `re_nsub' in the
421 pattern buffer, and one byte with the number of inner groups,
422 just like `start_memory'. (We need the number of inner
423 groups here because we don't have any easy way of finding the
424 corresponding start_memory when we're at a stop_memory.) */
427 /* Match a duplicate of something remembered. Followed by one
428 byte containing the register number. */
431 /* Fail unless at beginning of line. */
434 /* Fail unless at end of line. */
437 /* Succeeds if at beginning of buffer (if emacs) or at beginning
438 of string to be matched (if not). */
441 /* Analogously, for end of buffer/string. */
444 /* Followed by two byte relative address to which to jump. */
447 /* Same as jump, but marks the end of an alternative. */
450 /* Followed by two-byte relative address of place to resume at
451 in case of failure. */
454 /* Like on_failure_jump, but pushes a placeholder instead of the
455 current string position when executed. */
456 on_failure_keep_string_jump
,
458 /* Throw away latest failure point and then jump to following
459 two-byte relative address. */
462 /* Change to pop_failure_jump if know won't have to backtrack to
463 match; otherwise change to jump. This is used to jump
464 back to the beginning of a repeat. If what follows this jump
465 clearly won't match what the repeat does, such that we can be
466 sure that there is no use backtracking out of repetitions
467 already matched, then we change it to a pop_failure_jump.
468 Followed by two-byte address. */
471 /* Jump to following two-byte address, and push a dummy failure
472 point. This failure point will be thrown away if an attempt
473 is made to use it for a failure. A `+' construct makes this
474 before the first repeat. Also used as an intermediary kind
475 of jump when compiling an alternative. */
478 /* Push a dummy failure point and continue. Used at the end of
482 /* Followed by two-byte relative address and two-byte number n.
483 After matching N times, jump to the address upon failure. */
486 /* Followed by two-byte relative address, and two-byte number n.
487 Jump to the address N times, then fail. */
490 /* Set the following two-byte relative address to the
491 subsequent two-byte number. The address *includes* the two
495 wordchar
, /* Matches any word-constituent character. */
496 notwordchar
, /* Matches any char that is not a word-constituent. */
498 wordbeg
, /* Succeeds if at word beginning. */
499 wordend
, /* Succeeds if at word end. */
501 wordbound
, /* Succeeds if at a word boundary. */
502 notwordbound
/* Succeeds if not at a word boundary. */
505 ,before_dot
, /* Succeeds if before point. */
506 at_dot
, /* Succeeds if at point. */
507 after_dot
, /* Succeeds if after point. */
509 /* Matches any character whose syntax is specified. Followed by
510 a byte which contains a syntax code, e.g., Sword. */
513 /* Matches any character whose syntax is not that specified. */
518 /* Common operations on the compiled pattern. */
520 /* Store NUMBER in two contiguous bytes starting at DESTINATION. */
522 #define STORE_NUMBER(destination, number) \
524 (destination)[0] = (number) & 0377; \
525 (destination)[1] = (number) >> 8; \
528 /* Same as STORE_NUMBER, except increment DESTINATION to
529 the byte after where the number is stored. Therefore, DESTINATION
530 must be an lvalue. */
532 #define STORE_NUMBER_AND_INCR(destination, number) \
534 STORE_NUMBER (destination, number); \
535 (destination) += 2; \
538 /* Put into DESTINATION a number stored in two contiguous bytes starting
541 #define EXTRACT_NUMBER(destination, source) \
543 (destination) = *(source) & 0377; \
544 (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \
548 static void extract_number
_RE_ARGS ((int *dest
, unsigned char *source
));
550 extract_number (dest
, source
)
552 unsigned char *source
;
554 int temp
= SIGN_EXTEND_CHAR (*(source
+ 1));
555 *dest
= *source
& 0377;
559 # ifndef EXTRACT_MACROS /* To debug the macros. */
560 # undef EXTRACT_NUMBER
561 # define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
562 # endif /* not EXTRACT_MACROS */
566 /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
567 SOURCE must be an lvalue. */
569 #define EXTRACT_NUMBER_AND_INCR(destination, source) \
571 EXTRACT_NUMBER (destination, source); \
576 static void extract_number_and_incr
_RE_ARGS ((int *destination
,
577 unsigned char **source
));
579 extract_number_and_incr (destination
, source
)
581 unsigned char **source
;
583 extract_number (destination
, *source
);
587 # ifndef EXTRACT_MACROS
588 # undef EXTRACT_NUMBER_AND_INCR
589 # define EXTRACT_NUMBER_AND_INCR(dest, src) \
590 extract_number_and_incr (&dest, &src)
591 # endif /* not EXTRACT_MACROS */
595 /* If DEBUG is defined, Regex prints many voluminous messages about what
596 it is doing (if the variable `debug' is nonzero). If linked with the
597 main program in `iregex.c', you can enter patterns and strings
598 interactively. And if linked with the main program in `main.c' and
599 the other test files, you can run the already-written tests. */
603 /* We use standard I/O for debugging. */
606 /* It is useful to test things that ``must'' be true when debugging. */
609 static int debug
= 0;
611 # define DEBUG_STATEMENT(e) e
612 # define DEBUG_PRINT1(x) if (debug) printf (x)
613 # define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2)
614 # define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3)
615 # define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4)
616 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \
617 if (debug) print_partial_compiled_pattern (s, e)
618 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \
619 if (debug) print_double_string (w, s1, sz1, s2, sz2)
622 /* Print the fastmap in human-readable form. */
625 print_fastmap (fastmap
)
628 unsigned was_a_range
= 0;
631 while (i
< (1 << BYTEWIDTH
))
637 while (i
< (1 << BYTEWIDTH
) && fastmap
[i
])
653 /* Print a compiled pattern string in human-readable form, starting at
654 the START pointer into it and ending just before the pointer END. */
657 print_partial_compiled_pattern (start
, end
)
658 unsigned char *start
;
663 unsigned char *p
= start
;
664 unsigned char *pend
= end
;
672 /* Loop over pattern commands. */
675 printf ("%d:\t", p
- start
);
677 switch ((re_opcode_t
) *p
++)
685 printf ("/exactn/%d", mcnt
);
696 printf ("/start_memory/%d/%d", mcnt
, *p
++);
701 printf ("/stop_memory/%d/%d", mcnt
, *p
++);
705 printf ("/duplicate/%d", *p
++);
715 register int c
, last
= -100;
716 register int in_range
= 0;
718 printf ("/charset [%s",
719 (re_opcode_t
) *(p
- 1) == charset_not
? "^" : "");
721 assert (p
+ *p
< pend
);
723 for (c
= 0; c
< 256; c
++)
725 && (p
[1 + (c
/8)] & (1 << (c
% 8))))
727 /* Are we starting a range? */
728 if (last
+ 1 == c
&& ! in_range
)
733 /* Have we broken a range? */
734 else if (last
+ 1 != c
&& in_range
)
763 case on_failure_jump
:
764 extract_number_and_incr (&mcnt
, &p
);
765 printf ("/on_failure_jump to %d", p
+ mcnt
- start
);
768 case on_failure_keep_string_jump
:
769 extract_number_and_incr (&mcnt
, &p
);
770 printf ("/on_failure_keep_string_jump to %d", p
+ mcnt
- start
);
773 case dummy_failure_jump
:
774 extract_number_and_incr (&mcnt
, &p
);
775 printf ("/dummy_failure_jump to %d", p
+ mcnt
- start
);
778 case push_dummy_failure
:
779 printf ("/push_dummy_failure");
783 extract_number_and_incr (&mcnt
, &p
);
784 printf ("/maybe_pop_jump to %d", p
+ mcnt
- start
);
787 case pop_failure_jump
:
788 extract_number_and_incr (&mcnt
, &p
);
789 printf ("/pop_failure_jump to %d", p
+ mcnt
- start
);
793 extract_number_and_incr (&mcnt
, &p
);
794 printf ("/jump_past_alt to %d", p
+ mcnt
- start
);
798 extract_number_and_incr (&mcnt
, &p
);
799 printf ("/jump to %d", p
+ mcnt
- start
);
803 extract_number_and_incr (&mcnt
, &p
);
805 extract_number_and_incr (&mcnt2
, &p
);
806 printf ("/succeed_n to %d, %d times", p1
- start
, mcnt2
);
810 extract_number_and_incr (&mcnt
, &p
);
812 extract_number_and_incr (&mcnt2
, &p
);
813 printf ("/jump_n to %d, %d times", p1
- start
, mcnt2
);
817 extract_number_and_incr (&mcnt
, &p
);
819 extract_number_and_incr (&mcnt2
, &p
);
820 printf ("/set_number_at location %d to %d", p1
- start
, mcnt2
);
824 printf ("/wordbound");
828 printf ("/notwordbound");
840 printf ("/before_dot");
848 printf ("/after_dot");
852 printf ("/syntaxspec");
854 printf ("/%d", mcnt
);
858 printf ("/notsyntaxspec");
860 printf ("/%d", mcnt
);
865 printf ("/wordchar");
869 printf ("/notwordchar");
881 printf ("?%d", *(p
-1));
887 printf ("%d:\tend of pattern.\n", p
- start
);
892 print_compiled_pattern (bufp
)
893 struct re_pattern_buffer
*bufp
;
895 unsigned char *buffer
= bufp
->buffer
;
897 print_partial_compiled_pattern (buffer
, buffer
+ bufp
->used
);
898 printf ("%ld bytes used/%ld bytes allocated.\n",
899 bufp
->used
, bufp
->allocated
);
901 if (bufp
->fastmap_accurate
&& bufp
->fastmap
)
903 printf ("fastmap: ");
904 print_fastmap (bufp
->fastmap
);
907 printf ("re_nsub: %d\t", bufp
->re_nsub
);
908 printf ("regs_alloc: %d\t", bufp
->regs_allocated
);
909 printf ("can_be_null: %d\t", bufp
->can_be_null
);
910 printf ("newline_anchor: %d\n", bufp
->newline_anchor
);
911 printf ("no_sub: %d\t", bufp
->no_sub
);
912 printf ("not_bol: %d\t", bufp
->not_bol
);
913 printf ("not_eol: %d\t", bufp
->not_eol
);
914 printf ("syntax: %lx\n", bufp
->syntax
);
915 /* Perhaps we should print the translate table? */
920 print_double_string (where
, string1
, size1
, string2
, size2
)
933 if (FIRST_STRING_P (where
))
935 for (this_char
= where
- string1
; this_char
< size1
; this_char
++)
936 putchar (string1
[this_char
]);
941 for (this_char
= where
- string2
; this_char
< size2
; this_char
++)
942 putchar (string2
[this_char
]);
953 #else /* not DEBUG */
958 # define DEBUG_STATEMENT(e)
959 # define DEBUG_PRINT1(x)
960 # define DEBUG_PRINT2(x1, x2)
961 # define DEBUG_PRINT3(x1, x2, x3)
962 # define DEBUG_PRINT4(x1, x2, x3, x4)
963 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
964 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
966 #endif /* not DEBUG */
968 /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can
969 also be assigned to arbitrarily: each pattern buffer stores its own
970 syntax, so it can be changed between regex compilations. */
971 /* This has no initializer because initialized variables in Emacs
972 become read-only after dumping. */
973 reg_syntax_t re_syntax_options
;
976 /* Specify the precise syntax of regexps for compilation. This provides
977 for compatibility for various utilities which historically have
978 different, incompatible syntaxes.
980 The argument SYNTAX is a bit mask comprised of the various bits
981 defined in regex.h. We return the old syntax. */
984 re_set_syntax (syntax
)
987 reg_syntax_t ret
= re_syntax_options
;
989 re_syntax_options
= syntax
;
991 if (syntax
& RE_DEBUG
)
993 else if (debug
) /* was on but now is not */
999 weak_alias (__re_set_syntax
, re_set_syntax
)
1002 /* This table gives an error message for each of the error codes listed
1003 in regex.h. Obviously the order here has to be same as there.
1004 POSIX doesn't require that we do anything for REG_NOERROR,
1005 but why not be nice? */
1007 static const char *re_error_msgid
[] =
1009 gettext_noop ("Success"), /* REG_NOERROR */
1010 gettext_noop ("No match"), /* REG_NOMATCH */
1011 gettext_noop ("Invalid regular expression"), /* REG_BADPAT */
1012 gettext_noop ("Invalid collation character"), /* REG_ECOLLATE */
1013 gettext_noop ("Invalid character class name"), /* REG_ECTYPE */
1014 gettext_noop ("Trailing backslash"), /* REG_EESCAPE */
1015 gettext_noop ("Invalid back reference"), /* REG_ESUBREG */
1016 gettext_noop ("Unmatched [ or [^"), /* REG_EBRACK */
1017 gettext_noop ("Unmatched ( or \\("), /* REG_EPAREN */
1018 gettext_noop ("Unmatched \\{"), /* REG_EBRACE */
1019 gettext_noop ("Invalid content of \\{\\}"), /* REG_BADBR */
1020 gettext_noop ("Invalid range end"), /* REG_ERANGE */
1021 gettext_noop ("Memory exhausted"), /* REG_ESPACE */
1022 gettext_noop ("Invalid preceding regular expression"), /* REG_BADRPT */
1023 gettext_noop ("Premature end of regular expression"), /* REG_EEND */
1024 gettext_noop ("Regular expression too big"), /* REG_ESIZE */
1025 gettext_noop ("Unmatched ) or \\)"), /* REG_ERPAREN */
1028 /* Avoiding alloca during matching, to placate r_alloc. */
1030 /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the
1031 searching and matching functions should not call alloca. On some
1032 systems, alloca is implemented in terms of malloc, and if we're
1033 using the relocating allocator routines, then malloc could cause a
1034 relocation, which might (if the strings being searched are in the
1035 ralloc heap) shift the data out from underneath the regexp
1038 Here's another reason to avoid allocation: Emacs
1039 processes input from X in a signal handler; processing X input may
1040 call malloc; if input arrives while a matching routine is calling
1041 malloc, then we're scrod. But Emacs can't just block input while
1042 calling matching routines; then we don't notice interrupts when
1043 they come in. So, Emacs blocks input around all regexp calls
1044 except the matching calls, which it leaves unprotected, in the
1045 faith that they will not malloc. */
1047 /* Normally, this is fine. */
1048 #define MATCH_MAY_ALLOCATE
1050 /* When using GNU C, we are not REALLY using the C alloca, no matter
1051 what config.h may say. So don't take precautions for it. */
1056 /* The match routines may not allocate if (1) they would do it with malloc
1057 and (2) it's not safe for them to use malloc.
1058 Note that if REL_ALLOC is defined, matching would not use malloc for the
1059 failure stack, but we would still use it for the register vectors;
1060 so REL_ALLOC should not affect this. */
1061 #if (defined C_ALLOCA || defined REGEX_MALLOC) && defined emacs
1062 # undef MATCH_MAY_ALLOCATE
1066 /* Failure stack declarations and macros; both re_compile_fastmap and
1067 re_match_2 use a failure stack. These have to be macros because of
1068 REGEX_ALLOCATE_STACK. */
1071 /* Number of failure points for which to initially allocate space
1072 when matching. If this number is exceeded, we allocate more
1073 space, so it is not a hard limit. */
1074 #ifndef INIT_FAILURE_ALLOC
1075 # define INIT_FAILURE_ALLOC 5
1078 /* Roughly the maximum number of failure points on the stack. Would be
1079 exactly that if always used MAX_FAILURE_ITEMS items each time we failed.
1080 This is a variable only so users of regex can assign to it; we never
1081 change it ourselves. */
1085 # if defined MATCH_MAY_ALLOCATE
1086 /* 4400 was enough to cause a crash on Alpha OSF/1,
1087 whose default stack limit is 2mb. */
1088 long int re_max_failures
= 4000;
1090 long int re_max_failures
= 2000;
1093 union fail_stack_elt
1095 unsigned char *pointer
;
1099 typedef union fail_stack_elt fail_stack_elt_t
;
1103 fail_stack_elt_t
*stack
;
1104 unsigned long int size
;
1105 unsigned long int avail
; /* Offset of next open position. */
1108 #else /* not INT_IS_16BIT */
1110 # if defined MATCH_MAY_ALLOCATE
1111 /* 4400 was enough to cause a crash on Alpha OSF/1,
1112 whose default stack limit is 2mb. */
1113 int re_max_failures
= 20000;
1115 int re_max_failures
= 2000;
1118 union fail_stack_elt
1120 unsigned char *pointer
;
1124 typedef union fail_stack_elt fail_stack_elt_t
;
1128 fail_stack_elt_t
*stack
;
1130 unsigned avail
; /* Offset of next open position. */
1133 #endif /* INT_IS_16BIT */
1135 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)
1136 #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
1137 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
1140 /* Define macros to initialize and free the failure stack.
1141 Do `return -2' if the alloc fails. */
1143 #ifdef MATCH_MAY_ALLOCATE
1144 # define INIT_FAIL_STACK() \
1146 fail_stack.stack = (fail_stack_elt_t *) \
1147 REGEX_ALLOCATE_STACK (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t)); \
1149 if (fail_stack.stack == NULL) \
1152 fail_stack.size = INIT_FAILURE_ALLOC; \
1153 fail_stack.avail = 0; \
1156 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
1158 # define INIT_FAIL_STACK() \
1160 fail_stack.avail = 0; \
1163 # define RESET_FAIL_STACK()
1167 /* Double the size of FAIL_STACK, up to approximately `re_max_failures' items.
1169 Return 1 if succeeds, and 0 if either ran out of memory
1170 allocating space for it or it was already too large.
1172 REGEX_REALLOCATE_STACK requires `destination' be declared. */
1174 #define DOUBLE_FAIL_STACK(fail_stack) \
1175 ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \
1177 : ((fail_stack).stack = (fail_stack_elt_t *) \
1178 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
1179 (fail_stack).size * sizeof (fail_stack_elt_t), \
1180 ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \
1182 (fail_stack).stack == NULL \
1184 : ((fail_stack).size <<= 1, \
1188 /* Push pointer POINTER on FAIL_STACK.
1189 Return 1 if was able to do so and 0 if ran out of memory allocating
1191 #define PUSH_PATTERN_OP(POINTER, FAIL_STACK) \
1192 ((FAIL_STACK_FULL () \
1193 && !DOUBLE_FAIL_STACK (FAIL_STACK)) \
1195 : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \
1198 /* Push a pointer value onto the failure stack.
1199 Assumes the variable `fail_stack'. Probably should only
1200 be called from within `PUSH_FAILURE_POINT'. */
1201 #define PUSH_FAILURE_POINTER(item) \
1202 fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
1204 /* This pushes an integer-valued item onto the failure stack.
1205 Assumes the variable `fail_stack'. Probably should only
1206 be called from within `PUSH_FAILURE_POINT'. */
1207 #define PUSH_FAILURE_INT(item) \
1208 fail_stack.stack[fail_stack.avail++].integer = (item)
1210 /* Push a fail_stack_elt_t value onto the failure stack.
1211 Assumes the variable `fail_stack'. Probably should only
1212 be called from within `PUSH_FAILURE_POINT'. */
1213 #define PUSH_FAILURE_ELT(item) \
1214 fail_stack.stack[fail_stack.avail++] = (item)
1216 /* These three POP... operations complement the three PUSH... operations.
1217 All assume that `fail_stack' is nonempty. */
1218 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1219 #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
1220 #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
1222 /* Used to omit pushing failure point id's when we're not debugging. */
1224 # define DEBUG_PUSH PUSH_FAILURE_INT
1225 # define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_INT ()
1227 # define DEBUG_PUSH(item)
1228 # define DEBUG_POP(item_addr)
1232 /* Push the information about the state we will need
1233 if we ever fail back to it.
1235 Requires variables fail_stack, regstart, regend, reg_info, and
1236 num_regs_pushed be declared. DOUBLE_FAIL_STACK requires `destination'
1239 Does `return FAILURE_CODE' if runs out of memory. */
1241 #define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code) \
1243 char *destination; \
1244 /* Must be int, so when we don't save any registers, the arithmetic \
1245 of 0 + -1 isn't done as unsigned. */ \
1246 /* Can't be int, since there is not a shred of a guarantee that int \
1247 is wide enough to hold a value of something to which pointer can \
1249 active_reg_t this_reg; \
1251 DEBUG_STATEMENT (failure_id++); \
1252 DEBUG_STATEMENT (nfailure_points_pushed++); \
1253 DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id); \
1254 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\
1255 DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\
1257 DEBUG_PRINT2 (" slots needed: %ld\n", NUM_FAILURE_ITEMS); \
1258 DEBUG_PRINT2 (" available: %d\n", REMAINING_AVAIL_SLOTS); \
1260 /* Ensure we have enough space allocated for what we will push. */ \
1261 while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS) \
1263 if (!DOUBLE_FAIL_STACK (fail_stack)) \
1264 return failure_code; \
1266 DEBUG_PRINT2 ("\n Doubled stack; size now: %d\n", \
1267 (fail_stack).size); \
1268 DEBUG_PRINT2 (" slots available: %d\n", REMAINING_AVAIL_SLOTS);\
1271 /* Push the info, starting with the registers. */ \
1272 DEBUG_PRINT1 ("\n"); \
1275 for (this_reg = lowest_active_reg; this_reg <= highest_active_reg; \
1278 DEBUG_PRINT2 (" Pushing reg: %lu\n", this_reg); \
1279 DEBUG_STATEMENT (num_regs_pushed++); \
1281 DEBUG_PRINT2 (" start: %p\n", regstart[this_reg]); \
1282 PUSH_FAILURE_POINTER (regstart[this_reg]); \
1284 DEBUG_PRINT2 (" end: %p\n", regend[this_reg]); \
1285 PUSH_FAILURE_POINTER (regend[this_reg]); \
1287 DEBUG_PRINT2 (" info: %p\n ", \
1288 reg_info[this_reg].word.pointer); \
1289 DEBUG_PRINT2 (" match_null=%d", \
1290 REG_MATCH_NULL_STRING_P (reg_info[this_reg])); \
1291 DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg])); \
1292 DEBUG_PRINT2 (" matched_something=%d", \
1293 MATCHED_SOMETHING (reg_info[this_reg])); \
1294 DEBUG_PRINT2 (" ever_matched=%d", \
1295 EVER_MATCHED_SOMETHING (reg_info[this_reg])); \
1296 DEBUG_PRINT1 ("\n"); \
1297 PUSH_FAILURE_ELT (reg_info[this_reg].word); \
1300 DEBUG_PRINT2 (" Pushing low active reg: %ld\n", lowest_active_reg);\
1301 PUSH_FAILURE_INT (lowest_active_reg); \
1303 DEBUG_PRINT2 (" Pushing high active reg: %ld\n", highest_active_reg);\
1304 PUSH_FAILURE_INT (highest_active_reg); \
1306 DEBUG_PRINT2 (" Pushing pattern %p:\n", pattern_place); \
1307 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1308 PUSH_FAILURE_POINTER (pattern_place); \
1310 DEBUG_PRINT2 (" Pushing string %p: `", string_place); \
1311 DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, \
1313 DEBUG_PRINT1 ("'\n"); \
1314 PUSH_FAILURE_POINTER (string_place); \
1316 DEBUG_PRINT2 (" Pushing failure id: %u\n", failure_id); \
1317 DEBUG_PUSH (failure_id); \
1320 /* This is the number of items that are pushed and popped on the stack
1321 for each register. */
1322 #define NUM_REG_ITEMS 3
1324 /* Individual items aside from the registers. */
1326 # define NUM_NONREG_ITEMS 5 /* Includes failure point id. */
1328 # define NUM_NONREG_ITEMS 4
1331 /* We push at most this many items on the stack. */
1332 /* We used to use (num_regs - 1), which is the number of registers
1333 this regexp will save; but that was changed to 5
1334 to avoid stack overflow for a regexp with lots of parens. */
1335 #define MAX_FAILURE_ITEMS (5 * NUM_REG_ITEMS + NUM_NONREG_ITEMS)
1337 /* We actually push this many items. */
1338 #define NUM_FAILURE_ITEMS \
1340 ? 0 : highest_active_reg - lowest_active_reg + 1) \
1344 /* How many items can still be added to the stack without overflowing it. */
1345 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
1348 /* Pops what PUSH_FAIL_STACK pushes.
1350 We restore into the parameters, all of which should be lvalues:
1351 STR -- the saved data position.
1352 PAT -- the saved pattern position.
1353 LOW_REG, HIGH_REG -- the highest and lowest active registers.
1354 REGSTART, REGEND -- arrays of string positions.
1355 REG_INFO -- array of information about each subexpression.
1357 Also assumes the variables `fail_stack' and (if debugging), `bufp',
1358 `pend', `string1', `size1', `string2', and `size2'. */
1360 #define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\
1362 DEBUG_STATEMENT (unsigned failure_id;) \
1363 active_reg_t this_reg; \
1364 const unsigned char *string_temp; \
1366 assert (!FAIL_STACK_EMPTY ()); \
1368 /* Remove failure points and point to how many regs pushed. */ \
1369 DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \
1370 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \
1371 DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \
1373 assert (fail_stack.avail >= NUM_NONREG_ITEMS); \
1375 DEBUG_POP (&failure_id); \
1376 DEBUG_PRINT2 (" Popping failure id: %u\n", failure_id); \
1378 /* If the saved string location is NULL, it came from an \
1379 on_failure_keep_string_jump opcode, and we want to throw away the \
1380 saved NULL, thus retaining our current position in the string. */ \
1381 string_temp = POP_FAILURE_POINTER (); \
1382 if (string_temp != NULL) \
1383 str = (const char *) string_temp; \
1385 DEBUG_PRINT2 (" Popping string %p: `", str); \
1386 DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \
1387 DEBUG_PRINT1 ("'\n"); \
1389 pat = (unsigned char *) POP_FAILURE_POINTER (); \
1390 DEBUG_PRINT2 (" Popping pattern %p:\n", pat); \
1391 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1393 /* Restore register info. */ \
1394 high_reg = (active_reg_t) POP_FAILURE_INT (); \
1395 DEBUG_PRINT2 (" Popping high active reg: %ld\n", high_reg); \
1397 low_reg = (active_reg_t) POP_FAILURE_INT (); \
1398 DEBUG_PRINT2 (" Popping low active reg: %ld\n", low_reg); \
1401 for (this_reg = high_reg; this_reg >= low_reg; this_reg--) \
1403 DEBUG_PRINT2 (" Popping reg: %ld\n", this_reg); \
1405 reg_info[this_reg].word = POP_FAILURE_ELT (); \
1406 DEBUG_PRINT2 (" info: %p\n", \
1407 reg_info[this_reg].word.pointer); \
1409 regend[this_reg] = (const char *) POP_FAILURE_POINTER (); \
1410 DEBUG_PRINT2 (" end: %p\n", regend[this_reg]); \
1412 regstart[this_reg] = (const char *) POP_FAILURE_POINTER (); \
1413 DEBUG_PRINT2 (" start: %p\n", regstart[this_reg]); \
1417 for (this_reg = highest_active_reg; this_reg > high_reg; this_reg--) \
1419 reg_info[this_reg].word.integer = 0; \
1420 regend[this_reg] = 0; \
1421 regstart[this_reg] = 0; \
1423 highest_active_reg = high_reg; \
1426 set_regs_matched_done = 0; \
1427 DEBUG_STATEMENT (nfailure_points_popped++); \
1428 } /* POP_FAILURE_POINT */
1432 /* Structure for per-register (a.k.a. per-group) information.
1433 Other register information, such as the
1434 starting and ending positions (which are addresses), and the list of
1435 inner groups (which is a bits list) are maintained in separate
1438 We are making a (strictly speaking) nonportable assumption here: that
1439 the compiler will pack our bit fields into something that fits into
1440 the type of `word', i.e., is something that fits into one item on the
1444 /* Declarations and macros for re_match_2. */
1448 fail_stack_elt_t word
;
1451 /* This field is one if this group can match the empty string,
1452 zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */
1453 #define MATCH_NULL_UNSET_VALUE 3
1454 unsigned match_null_string_p
: 2;
1455 unsigned is_active
: 1;
1456 unsigned matched_something
: 1;
1457 unsigned ever_matched_something
: 1;
1459 } register_info_type
;
1461 #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p)
1462 #define IS_ACTIVE(R) ((R).bits.is_active)
1463 #define MATCHED_SOMETHING(R) ((R).bits.matched_something)
1464 #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something)
1467 /* Call this when have matched a real character; it sets `matched' flags
1468 for the subexpressions which we are currently inside. Also records
1469 that those subexprs have matched. */
1470 #define SET_REGS_MATCHED() \
1473 if (!set_regs_matched_done) \
1476 set_regs_matched_done = 1; \
1477 for (r = lowest_active_reg; r <= highest_active_reg; r++) \
1479 MATCHED_SOMETHING (reg_info[r]) \
1480 = EVER_MATCHED_SOMETHING (reg_info[r]) \
1487 /* Registers are set to a sentinel when they haven't yet matched. */
1488 static char reg_unset_dummy
;
1489 #define REG_UNSET_VALUE (®_unset_dummy)
1490 #define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
1492 /* Subroutine declarations and macros for regex_compile. */
1494 static reg_errcode_t regex_compile
_RE_ARGS ((const char *pattern
, size_t size
,
1495 reg_syntax_t syntax
,
1496 struct re_pattern_buffer
*bufp
));
1497 static void store_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
, int arg
));
1498 static void store_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1499 int arg1
, int arg2
));
1500 static void insert_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1501 int arg
, unsigned char *end
));
1502 static void insert_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1503 int arg1
, int arg2
, unsigned char *end
));
1504 static boolean at_begline_loc_p
_RE_ARGS ((const char *pattern
, const char *p
,
1505 reg_syntax_t syntax
));
1506 static boolean at_endline_loc_p
_RE_ARGS ((const char *p
, const char *pend
,
1507 reg_syntax_t syntax
));
1508 static reg_errcode_t compile_range
_RE_ARGS ((const char **p_ptr
,
1511 reg_syntax_t syntax
,
1514 /* Fetch the next character in the uncompiled pattern---translating it
1515 if necessary. Also cast from a signed character in the constant
1516 string passed to us by the user to an unsigned char that we can use
1517 as an array index (in, e.g., `translate'). */
1519 # define PATFETCH(c) \
1520 do {if (p == pend) return REG_EEND; \
1521 c = (unsigned char) *p++; \
1522 if (translate) c = (unsigned char) translate[c]; \
1526 /* Fetch the next character in the uncompiled pattern, with no
1528 #define PATFETCH_RAW(c) \
1529 do {if (p == pend) return REG_EEND; \
1530 c = (unsigned char) *p++; \
1533 /* Go backwards one character in the pattern. */
1534 #define PATUNFETCH p--
1537 /* If `translate' is non-null, return translate[D], else just D. We
1538 cast the subscript to translate because some data is declared as
1539 `char *', to avoid warnings when a string constant is passed. But
1540 when we use a character as a subscript we must make it unsigned. */
1542 # define TRANSLATE(d) \
1543 (translate ? (char) translate[(unsigned char) (d)] : (d))
1547 /* Macros for outputting the compiled pattern into `buffer'. */
1549 /* If the buffer isn't allocated when it comes in, use this. */
1550 #define INIT_BUF_SIZE 32
1552 /* Make sure we have at least N more bytes of space in buffer. */
1553 #define GET_BUFFER_SPACE(n) \
1554 while ((unsigned long) (b - bufp->buffer + (n)) > bufp->allocated) \
1557 /* Make sure we have one more byte of buffer space and then add C to it. */
1558 #define BUF_PUSH(c) \
1560 GET_BUFFER_SPACE (1); \
1561 *b++ = (unsigned char) (c); \
1565 /* Ensure we have two more bytes of buffer space and then append C1 and C2. */
1566 #define BUF_PUSH_2(c1, c2) \
1568 GET_BUFFER_SPACE (2); \
1569 *b++ = (unsigned char) (c1); \
1570 *b++ = (unsigned char) (c2); \
1574 /* As with BUF_PUSH_2, except for three bytes. */
1575 #define BUF_PUSH_3(c1, c2, c3) \
1577 GET_BUFFER_SPACE (3); \
1578 *b++ = (unsigned char) (c1); \
1579 *b++ = (unsigned char) (c2); \
1580 *b++ = (unsigned char) (c3); \
1584 /* Store a jump with opcode OP at LOC to location TO. We store a
1585 relative address offset by the three bytes the jump itself occupies. */
1586 #define STORE_JUMP(op, loc, to) \
1587 store_op1 (op, loc, (int) ((to) - (loc) - 3))
1589 /* Likewise, for a two-argument jump. */
1590 #define STORE_JUMP2(op, loc, to, arg) \
1591 store_op2 (op, loc, (int) ((to) - (loc) - 3), arg)
1593 /* Like `STORE_JUMP', but for inserting. Assume `b' is the buffer end. */
1594 #define INSERT_JUMP(op, loc, to) \
1595 insert_op1 (op, loc, (int) ((to) - (loc) - 3), b)
1597 /* Like `STORE_JUMP2', but for inserting. Assume `b' is the buffer end. */
1598 #define INSERT_JUMP2(op, loc, to, arg) \
1599 insert_op2 (op, loc, (int) ((to) - (loc) - 3), arg, b)
1602 /* This is not an arbitrary limit: the arguments which represent offsets
1603 into the pattern are two bytes long. So if 2^16 bytes turns out to
1604 be too small, many things would have to change. */
1605 /* Any other compiler which, like MSC, has allocation limit below 2^16
1606 bytes will have to use approach similar to what was done below for
1607 MSC and drop MAX_BUF_SIZE a bit. Otherwise you may end up
1608 reallocating to 0 bytes. Such thing is not going to work too well.
1609 You have been warned!! */
1610 #if defined _MSC_VER && !defined WIN32
1611 /* Microsoft C 16-bit versions limit malloc to approx 65512 bytes.
1612 The REALLOC define eliminates a flurry of conversion warnings,
1613 but is not required. */
1614 # define MAX_BUF_SIZE 65500L
1615 # define REALLOC(p,s) realloc ((p), (size_t) (s))
1617 # define MAX_BUF_SIZE (1L << 16)
1618 # define REALLOC(p,s) realloc ((p), (s))
1621 /* Extend the buffer by twice its current size via realloc and
1622 reset the pointers that pointed into the old block to point to the
1623 correct places in the new one. If extending the buffer results in it
1624 being larger than MAX_BUF_SIZE, then flag memory exhausted. */
1625 #define EXTEND_BUFFER() \
1627 unsigned char *old_buffer = bufp->buffer; \
1628 if (bufp->allocated == MAX_BUF_SIZE) \
1630 bufp->allocated <<= 1; \
1631 if (bufp->allocated > MAX_BUF_SIZE) \
1632 bufp->allocated = MAX_BUF_SIZE; \
1633 bufp->buffer = (unsigned char *) REALLOC (bufp->buffer, bufp->allocated);\
1634 if (bufp->buffer == NULL) \
1635 return REG_ESPACE; \
1636 /* If the buffer moved, move all the pointers into it. */ \
1637 if (old_buffer != bufp->buffer) \
1639 b = (b - old_buffer) + bufp->buffer; \
1640 begalt = (begalt - old_buffer) + bufp->buffer; \
1641 if (fixup_alt_jump) \
1642 fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\
1644 laststart = (laststart - old_buffer) + bufp->buffer; \
1645 if (pending_exact) \
1646 pending_exact = (pending_exact - old_buffer) + bufp->buffer; \
1651 /* Since we have one byte reserved for the register number argument to
1652 {start,stop}_memory, the maximum number of groups we can report
1653 things about is what fits in that byte. */
1654 #define MAX_REGNUM 255
1656 /* But patterns can have more than `MAX_REGNUM' registers. We just
1657 ignore the excess. */
1658 typedef unsigned regnum_t
;
1661 /* Macros for the compile stack. */
1663 /* Since offsets can go either forwards or backwards, this type needs to
1664 be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */
1665 /* int may be not enough when sizeof(int) == 2. */
1666 typedef long pattern_offset_t
;
1670 pattern_offset_t begalt_offset
;
1671 pattern_offset_t fixup_alt_jump
;
1672 pattern_offset_t inner_group_offset
;
1673 pattern_offset_t laststart_offset
;
1675 } compile_stack_elt_t
;
1680 compile_stack_elt_t
*stack
;
1682 unsigned avail
; /* Offset of next open position. */
1683 } compile_stack_type
;
1686 #define INIT_COMPILE_STACK_SIZE 32
1688 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
1689 #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
1691 /* The next available element. */
1692 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
1695 /* Set the bit for character C in a list. */
1696 #define SET_LIST_BIT(c) \
1697 (b[((unsigned char) (c)) / BYTEWIDTH] \
1698 |= 1 << (((unsigned char) c) % BYTEWIDTH))
1701 /* Get the next unsigned number in the uncompiled pattern. */
1702 #define GET_UNSIGNED_NUMBER(num) \
1706 while (ISDIGIT (c)) \
1710 num = num * 10 + c - '0'; \
1718 #if defined _LIBC || (defined HAVE_WCTYPE_H && defined HAVE_WCHAR_H)
1719 /* The GNU C library provides support for user-defined character classes
1720 and the functions from ISO C amendement 1. */
1721 # ifdef CHARCLASS_NAME_MAX
1722 # define CHAR_CLASS_MAX_LENGTH CHARCLASS_NAME_MAX
1724 /* This shouldn't happen but some implementation might still have this
1725 problem. Use a reasonable default value. */
1726 # define CHAR_CLASS_MAX_LENGTH 256
1730 # define IS_CHAR_CLASS(string) __wctype (string)
1732 # define IS_CHAR_CLASS(string) wctype (string)
1735 # define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */
1737 # define IS_CHAR_CLASS(string) \
1738 (STREQ (string, "alpha") || STREQ (string, "upper") \
1739 || STREQ (string, "lower") || STREQ (string, "digit") \
1740 || STREQ (string, "alnum") || STREQ (string, "xdigit") \
1741 || STREQ (string, "space") || STREQ (string, "print") \
1742 || STREQ (string, "punct") || STREQ (string, "graph") \
1743 || STREQ (string, "cntrl") || STREQ (string, "blank"))
1746 #ifndef MATCH_MAY_ALLOCATE
1748 /* If we cannot allocate large objects within re_match_2_internal,
1749 we make the fail stack and register vectors global.
1750 The fail stack, we grow to the maximum size when a regexp
1752 The register vectors, we adjust in size each time we
1753 compile a regexp, according to the number of registers it needs. */
1755 static fail_stack_type fail_stack
;
1757 /* Size with which the following vectors are currently allocated.
1758 That is so we can make them bigger as needed,
1759 but never make them smaller. */
1760 static int regs_allocated_size
;
1762 static const char ** regstart
, ** regend
;
1763 static const char ** old_regstart
, ** old_regend
;
1764 static const char **best_regstart
, **best_regend
;
1765 static register_info_type
*reg_info
;
1766 static const char **reg_dummy
;
1767 static register_info_type
*reg_info_dummy
;
1769 /* Make the register vectors big enough for NUM_REGS registers,
1770 but don't make them smaller. */
1773 regex_grow_registers (num_regs
)
1776 if (num_regs
> regs_allocated_size
)
1778 RETALLOC_IF (regstart
, num_regs
, const char *);
1779 RETALLOC_IF (regend
, num_regs
, const char *);
1780 RETALLOC_IF (old_regstart
, num_regs
, const char *);
1781 RETALLOC_IF (old_regend
, num_regs
, const char *);
1782 RETALLOC_IF (best_regstart
, num_regs
, const char *);
1783 RETALLOC_IF (best_regend
, num_regs
, const char *);
1784 RETALLOC_IF (reg_info
, num_regs
, register_info_type
);
1785 RETALLOC_IF (reg_dummy
, num_regs
, const char *);
1786 RETALLOC_IF (reg_info_dummy
, num_regs
, register_info_type
);
1788 regs_allocated_size
= num_regs
;
1792 #endif /* not MATCH_MAY_ALLOCATE */
1794 static boolean group_in_compile_stack
_RE_ARGS ((compile_stack_type
1798 /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
1799 Returns one of error codes defined in `regex.h', or zero for success.
1801 Assumes the `allocated' (and perhaps `buffer') and `translate'
1802 fields are set in BUFP on entry.
1804 If it succeeds, results are put in BUFP (if it returns an error, the
1805 contents of BUFP are undefined):
1806 `buffer' is the compiled pattern;
1807 `syntax' is set to SYNTAX;
1808 `used' is set to the length of the compiled pattern;
1809 `fastmap_accurate' is zero;
1810 `re_nsub' is the number of subexpressions in PATTERN;
1811 `not_bol' and `not_eol' are zero;
1813 The `fastmap' and `newline_anchor' fields are neither
1814 examined nor set. */
1816 /* Return, freeing storage we allocated. */
1817 #define FREE_STACK_RETURN(value) \
1818 return (free (compile_stack.stack), value)
1820 static reg_errcode_t
1821 regex_compile (pattern
, size
, syntax
, bufp
)
1822 const char *pattern
;
1824 reg_syntax_t syntax
;
1825 struct re_pattern_buffer
*bufp
;
1827 /* We fetch characters from PATTERN here. Even though PATTERN is
1828 `char *' (i.e., signed), we declare these variables as unsigned, so
1829 they can be reliably used as array indices. */
1830 register unsigned char c
, c1
;
1832 /* A random temporary spot in PATTERN. */
1835 /* Points to the end of the buffer, where we should append. */
1836 register unsigned char *b
;
1838 /* Keeps track of unclosed groups. */
1839 compile_stack_type compile_stack
;
1841 /* Points to the current (ending) position in the pattern. */
1842 const char *p
= pattern
;
1843 const char *pend
= pattern
+ size
;
1845 /* How to translate the characters in the pattern. */
1846 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
1848 /* Address of the count-byte of the most recently inserted `exactn'
1849 command. This makes it possible to tell if a new exact-match
1850 character can be added to that command or if the character requires
1851 a new `exactn' command. */
1852 unsigned char *pending_exact
= 0;
1854 /* Address of start of the most recently finished expression.
1855 This tells, e.g., postfix * where to find the start of its
1856 operand. Reset at the beginning of groups and alternatives. */
1857 unsigned char *laststart
= 0;
1859 /* Address of beginning of regexp, or inside of last group. */
1860 unsigned char *begalt
;
1862 /* Place in the uncompiled pattern (i.e., the {) to
1863 which to go back if the interval is invalid. */
1864 const char *beg_interval
;
1866 /* Address of the place where a forward jump should go to the end of
1867 the containing expression. Each alternative of an `or' -- except the
1868 last -- ends with a forward jump of this sort. */
1869 unsigned char *fixup_alt_jump
= 0;
1871 /* Counts open-groups as they are encountered. Remembered for the
1872 matching close-group on the compile stack, so the same register
1873 number is put in the stop_memory as the start_memory. */
1874 regnum_t regnum
= 0;
1877 DEBUG_PRINT1 ("\nCompiling pattern: ");
1880 unsigned debug_count
;
1882 for (debug_count
= 0; debug_count
< size
; debug_count
++)
1883 putchar (pattern
[debug_count
]);
1888 /* Initialize the compile stack. */
1889 compile_stack
.stack
= TALLOC (INIT_COMPILE_STACK_SIZE
, compile_stack_elt_t
);
1890 if (compile_stack
.stack
== NULL
)
1893 compile_stack
.size
= INIT_COMPILE_STACK_SIZE
;
1894 compile_stack
.avail
= 0;
1896 /* Initialize the pattern buffer. */
1897 bufp
->syntax
= syntax
;
1898 bufp
->fastmap_accurate
= 0;
1899 bufp
->not_bol
= bufp
->not_eol
= 0;
1901 /* Set `used' to zero, so that if we return an error, the pattern
1902 printer (for debugging) will think there's no pattern. We reset it
1906 /* Always count groups, whether or not bufp->no_sub is set. */
1909 #if !defined emacs && !defined SYNTAX_TABLE
1910 /* Initialize the syntax table. */
1911 init_syntax_once ();
1914 if (bufp
->allocated
== 0)
1917 { /* If zero allocated, but buffer is non-null, try to realloc
1918 enough space. This loses if buffer's address is bogus, but
1919 that is the user's responsibility. */
1920 RETALLOC (bufp
->buffer
, INIT_BUF_SIZE
, unsigned char);
1923 { /* Caller did not allocate a buffer. Do it for them. */
1924 bufp
->buffer
= TALLOC (INIT_BUF_SIZE
, unsigned char);
1926 if (!bufp
->buffer
) FREE_STACK_RETURN (REG_ESPACE
);
1928 bufp
->allocated
= INIT_BUF_SIZE
;
1931 begalt
= b
= bufp
->buffer
;
1933 /* Loop through the uncompiled pattern until we're at the end. */
1942 if ( /* If at start of pattern, it's an operator. */
1944 /* If context independent, it's an operator. */
1945 || syntax
& RE_CONTEXT_INDEP_ANCHORS
1946 /* Otherwise, depends on what's come before. */
1947 || at_begline_loc_p (pattern
, p
, syntax
))
1957 if ( /* If at end of pattern, it's an operator. */
1959 /* If context independent, it's an operator. */
1960 || syntax
& RE_CONTEXT_INDEP_ANCHORS
1961 /* Otherwise, depends on what's next. */
1962 || at_endline_loc_p (p
, pend
, syntax
))
1972 if ((syntax
& RE_BK_PLUS_QM
)
1973 || (syntax
& RE_LIMITED_OPS
))
1977 /* If there is no previous pattern... */
1980 if (syntax
& RE_CONTEXT_INVALID_OPS
)
1981 FREE_STACK_RETURN (REG_BADRPT
);
1982 else if (!(syntax
& RE_CONTEXT_INDEP_OPS
))
1987 /* Are we optimizing this jump? */
1988 boolean keep_string_p
= false;
1990 /* 1 means zero (many) matches is allowed. */
1991 char zero_times_ok
= 0, many_times_ok
= 0;
1993 /* If there is a sequence of repetition chars, collapse it
1994 down to just one (the right one). We can't combine
1995 interval operators with these because of, e.g., `a{2}*',
1996 which should only match an even number of `a's. */
2000 zero_times_ok
|= c
!= '+';
2001 many_times_ok
|= c
!= '?';
2009 || (!(syntax
& RE_BK_PLUS_QM
) && (c
== '+' || c
== '?')))
2012 else if (syntax
& RE_BK_PLUS_QM
&& c
== '\\')
2014 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2017 if (!(c1
== '+' || c1
== '?'))
2032 /* If we get here, we found another repeat character. */
2035 /* Star, etc. applied to an empty pattern is equivalent
2036 to an empty pattern. */
2040 /* Now we know whether or not zero matches is allowed
2041 and also whether or not two or more matches is allowed. */
2043 { /* More than one repetition is allowed, so put in at the
2044 end a backward relative jump from `b' to before the next
2045 jump we're going to put in below (which jumps from
2046 laststart to after this jump).
2048 But if we are at the `*' in the exact sequence `.*\n',
2049 insert an unconditional jump backwards to the .,
2050 instead of the beginning of the loop. This way we only
2051 push a failure point once, instead of every time
2052 through the loop. */
2053 assert (p
- 1 > pattern
);
2055 /* Allocate the space for the jump. */
2056 GET_BUFFER_SPACE (3);
2058 /* We know we are not at the first character of the pattern,
2059 because laststart was nonzero. And we've already
2060 incremented `p', by the way, to be the character after
2061 the `*'. Do we have to do something analogous here
2062 for null bytes, because of RE_DOT_NOT_NULL? */
2063 if (TRANSLATE (*(p
- 2)) == TRANSLATE ('.')
2065 && p
< pend
&& TRANSLATE (*p
) == TRANSLATE ('\n')
2066 && !(syntax
& RE_DOT_NEWLINE
))
2067 { /* We have .*\n. */
2068 STORE_JUMP (jump
, b
, laststart
);
2069 keep_string_p
= true;
2072 /* Anything else. */
2073 STORE_JUMP (maybe_pop_jump
, b
, laststart
- 3);
2075 /* We've added more stuff to the buffer. */
2079 /* On failure, jump from laststart to b + 3, which will be the
2080 end of the buffer after this jump is inserted. */
2081 GET_BUFFER_SPACE (3);
2082 INSERT_JUMP (keep_string_p
? on_failure_keep_string_jump
2090 /* At least one repetition is required, so insert a
2091 `dummy_failure_jump' before the initial
2092 `on_failure_jump' instruction of the loop. This
2093 effects a skip over that instruction the first time
2094 we hit that loop. */
2095 GET_BUFFER_SPACE (3);
2096 INSERT_JUMP (dummy_failure_jump
, laststart
, laststart
+ 6);
2111 boolean had_char_class
= false;
2113 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2115 /* Ensure that we have enough space to push a charset: the
2116 opcode, the length count, and the bitset; 34 bytes in all. */
2117 GET_BUFFER_SPACE (34);
2121 /* We test `*p == '^' twice, instead of using an if
2122 statement, so we only need one BUF_PUSH. */
2123 BUF_PUSH (*p
== '^' ? charset_not
: charset
);
2127 /* Remember the first position in the bracket expression. */
2130 /* Push the number of bytes in the bitmap. */
2131 BUF_PUSH ((1 << BYTEWIDTH
) / BYTEWIDTH
);
2133 /* Clear the whole map. */
2134 bzero (b
, (1 << BYTEWIDTH
) / BYTEWIDTH
);
2136 /* charset_not matches newline according to a syntax bit. */
2137 if ((re_opcode_t
) b
[-2] == charset_not
2138 && (syntax
& RE_HAT_LISTS_NOT_NEWLINE
))
2139 SET_LIST_BIT ('\n');
2141 /* Read in characters and ranges, setting map bits. */
2144 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2148 /* \ might escape characters inside [...] and [^...]. */
2149 if ((syntax
& RE_BACKSLASH_ESCAPE_IN_LISTS
) && c
== '\\')
2151 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2158 /* Could be the end of the bracket expression. If it's
2159 not (i.e., when the bracket expression is `[]' so
2160 far), the ']' character bit gets set way below. */
2161 if (c
== ']' && p
!= p1
+ 1)
2164 /* Look ahead to see if it's a range when the last thing
2165 was a character class. */
2166 if (had_char_class
&& c
== '-' && *p
!= ']')
2167 FREE_STACK_RETURN (REG_ERANGE
);
2169 /* Look ahead to see if it's a range when the last thing
2170 was a character: if this is a hyphen not at the
2171 beginning or the end of a list, then it's the range
2174 && !(p
- 2 >= pattern
&& p
[-2] == '[')
2175 && !(p
- 3 >= pattern
&& p
[-3] == '[' && p
[-2] == '^')
2179 = compile_range (&p
, pend
, translate
, syntax
, b
);
2180 if (ret
!= REG_NOERROR
) FREE_STACK_RETURN (ret
);
2183 else if (p
[0] == '-' && p
[1] != ']')
2184 { /* This handles ranges made up of characters only. */
2187 /* Move past the `-'. */
2190 ret
= compile_range (&p
, pend
, translate
, syntax
, b
);
2191 if (ret
!= REG_NOERROR
) FREE_STACK_RETURN (ret
);
2194 /* See if we're at the beginning of a possible character
2197 else if (syntax
& RE_CHAR_CLASSES
&& c
== '[' && *p
== ':')
2198 { /* Leave room for the null. */
2199 char str
[CHAR_CLASS_MAX_LENGTH
+ 1];
2204 /* If pattern is `[[:'. */
2205 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2210 if ((c
== ':' && *p
== ']') || p
== pend
2211 || c1
== CHAR_CLASS_MAX_LENGTH
)
2217 /* If isn't a word bracketed by `[:' and `:]':
2218 undo the ending character, the letters, and leave
2219 the leading `:' and `[' (but set bits for them). */
2220 if (c
== ':' && *p
== ']')
2222 #if defined _LIBC || (defined HAVE_WCTYPE_H && defined HAVE_WCHAR_H)
2223 boolean is_lower
= STREQ (str
, "lower");
2224 boolean is_upper
= STREQ (str
, "upper");
2228 wt
= IS_CHAR_CLASS (str
);
2230 FREE_STACK_RETURN (REG_ECTYPE
);
2232 /* Throw away the ] at the end of the character
2236 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2238 for (ch
= 0; ch
< 1 << BYTEWIDTH
; ++ch
)
2241 if (__iswctype (__btowc (ch
), wt
))
2244 if (iswctype (btowc (ch
), wt
))
2248 if (translate
&& (is_upper
|| is_lower
)
2249 && (ISUPPER (ch
) || ISLOWER (ch
)))
2253 had_char_class
= true;
2256 boolean is_alnum
= STREQ (str
, "alnum");
2257 boolean is_alpha
= STREQ (str
, "alpha");
2258 boolean is_blank
= STREQ (str
, "blank");
2259 boolean is_cntrl
= STREQ (str
, "cntrl");
2260 boolean is_digit
= STREQ (str
, "digit");
2261 boolean is_graph
= STREQ (str
, "graph");
2262 boolean is_lower
= STREQ (str
, "lower");
2263 boolean is_print
= STREQ (str
, "print");
2264 boolean is_punct
= STREQ (str
, "punct");
2265 boolean is_space
= STREQ (str
, "space");
2266 boolean is_upper
= STREQ (str
, "upper");
2267 boolean is_xdigit
= STREQ (str
, "xdigit");
2269 if (!IS_CHAR_CLASS (str
))
2270 FREE_STACK_RETURN (REG_ECTYPE
);
2272 /* Throw away the ] at the end of the character
2276 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2278 for (ch
= 0; ch
< 1 << BYTEWIDTH
; ch
++)
2280 /* This was split into 3 if's to
2281 avoid an arbitrary limit in some compiler. */
2282 if ( (is_alnum
&& ISALNUM (ch
))
2283 || (is_alpha
&& ISALPHA (ch
))
2284 || (is_blank
&& ISBLANK (ch
))
2285 || (is_cntrl
&& ISCNTRL (ch
)))
2287 if ( (is_digit
&& ISDIGIT (ch
))
2288 || (is_graph
&& ISGRAPH (ch
))
2289 || (is_lower
&& ISLOWER (ch
))
2290 || (is_print
&& ISPRINT (ch
)))
2292 if ( (is_punct
&& ISPUNCT (ch
))
2293 || (is_space
&& ISSPACE (ch
))
2294 || (is_upper
&& ISUPPER (ch
))
2295 || (is_xdigit
&& ISXDIGIT (ch
)))
2297 if ( translate
&& (is_upper
|| is_lower
)
2298 && (ISUPPER (ch
) || ISLOWER (ch
)))
2301 had_char_class
= true;
2302 #endif /* libc || wctype.h */
2311 had_char_class
= false;
2316 had_char_class
= false;
2321 /* Discard any (non)matching list bytes that are all 0 at the
2322 end of the map. Decrease the map-length byte too. */
2323 while ((int) b
[-1] > 0 && b
[b
[-1] - 1] == 0)
2331 if (syntax
& RE_NO_BK_PARENS
)
2338 if (syntax
& RE_NO_BK_PARENS
)
2345 if (syntax
& RE_NEWLINE_ALT
)
2352 if (syntax
& RE_NO_BK_VBAR
)
2359 if (syntax
& RE_INTERVALS
&& syntax
& RE_NO_BK_BRACES
)
2360 goto handle_interval
;
2366 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2368 /* Do not translate the character after the \, so that we can
2369 distinguish, e.g., \B from \b, even if we normally would
2370 translate, e.g., B to b. */
2376 if (syntax
& RE_NO_BK_PARENS
)
2377 goto normal_backslash
;
2383 if (COMPILE_STACK_FULL
)
2385 RETALLOC (compile_stack
.stack
, compile_stack
.size
<< 1,
2386 compile_stack_elt_t
);
2387 if (compile_stack
.stack
== NULL
) return REG_ESPACE
;
2389 compile_stack
.size
<<= 1;
2392 /* These are the values to restore when we hit end of this
2393 group. They are all relative offsets, so that if the
2394 whole pattern moves because of realloc, they will still
2396 COMPILE_STACK_TOP
.begalt_offset
= begalt
- bufp
->buffer
;
2397 COMPILE_STACK_TOP
.fixup_alt_jump
2398 = fixup_alt_jump
? fixup_alt_jump
- bufp
->buffer
+ 1 : 0;
2399 COMPILE_STACK_TOP
.laststart_offset
= b
- bufp
->buffer
;
2400 COMPILE_STACK_TOP
.regnum
= regnum
;
2402 /* We will eventually replace the 0 with the number of
2403 groups inner to this one. But do not push a
2404 start_memory for groups beyond the last one we can
2405 represent in the compiled pattern. */
2406 if (regnum
<= MAX_REGNUM
)
2408 COMPILE_STACK_TOP
.inner_group_offset
= b
- bufp
->buffer
+ 2;
2409 BUF_PUSH_3 (start_memory
, regnum
, 0);
2412 compile_stack
.avail
++;
2417 /* If we've reached MAX_REGNUM groups, then this open
2418 won't actually generate any code, so we'll have to
2419 clear pending_exact explicitly. */
2425 if (syntax
& RE_NO_BK_PARENS
) goto normal_backslash
;
2427 if (COMPILE_STACK_EMPTY
)
2429 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
2430 goto normal_backslash
;
2432 FREE_STACK_RETURN (REG_ERPAREN
);
2437 { /* Push a dummy failure point at the end of the
2438 alternative for a possible future
2439 `pop_failure_jump' to pop. See comments at
2440 `push_dummy_failure' in `re_match_2'. */
2441 BUF_PUSH (push_dummy_failure
);
2443 /* We allocated space for this jump when we assigned
2444 to `fixup_alt_jump', in the `handle_alt' case below. */
2445 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
- 1);
2448 /* See similar code for backslashed left paren above. */
2449 if (COMPILE_STACK_EMPTY
)
2451 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
2454 FREE_STACK_RETURN (REG_ERPAREN
);
2457 /* Since we just checked for an empty stack above, this
2458 ``can't happen''. */
2459 assert (compile_stack
.avail
!= 0);
2461 /* We don't just want to restore into `regnum', because
2462 later groups should continue to be numbered higher,
2463 as in `(ab)c(de)' -- the second group is #2. */
2464 regnum_t this_group_regnum
;
2466 compile_stack
.avail
--;
2467 begalt
= bufp
->buffer
+ COMPILE_STACK_TOP
.begalt_offset
;
2469 = COMPILE_STACK_TOP
.fixup_alt_jump
2470 ? bufp
->buffer
+ COMPILE_STACK_TOP
.fixup_alt_jump
- 1
2472 laststart
= bufp
->buffer
+ COMPILE_STACK_TOP
.laststart_offset
;
2473 this_group_regnum
= COMPILE_STACK_TOP
.regnum
;
2474 /* If we've reached MAX_REGNUM groups, then this open
2475 won't actually generate any code, so we'll have to
2476 clear pending_exact explicitly. */
2479 /* We're at the end of the group, so now we know how many
2480 groups were inside this one. */
2481 if (this_group_regnum
<= MAX_REGNUM
)
2483 unsigned char *inner_group_loc
2484 = bufp
->buffer
+ COMPILE_STACK_TOP
.inner_group_offset
;
2486 *inner_group_loc
= regnum
- this_group_regnum
;
2487 BUF_PUSH_3 (stop_memory
, this_group_regnum
,
2488 regnum
- this_group_regnum
);
2494 case '|': /* `\|'. */
2495 if (syntax
& RE_LIMITED_OPS
|| syntax
& RE_NO_BK_VBAR
)
2496 goto normal_backslash
;
2498 if (syntax
& RE_LIMITED_OPS
)
2501 /* Insert before the previous alternative a jump which
2502 jumps to this alternative if the former fails. */
2503 GET_BUFFER_SPACE (3);
2504 INSERT_JUMP (on_failure_jump
, begalt
, b
+ 6);
2508 /* The alternative before this one has a jump after it
2509 which gets executed if it gets matched. Adjust that
2510 jump so it will jump to this alternative's analogous
2511 jump (put in below, which in turn will jump to the next
2512 (if any) alternative's such jump, etc.). The last such
2513 jump jumps to the correct final destination. A picture:
2519 If we are at `b', then fixup_alt_jump right now points to a
2520 three-byte space after `a'. We'll put in the jump, set
2521 fixup_alt_jump to right after `b', and leave behind three
2522 bytes which we'll fill in when we get to after `c'. */
2525 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
);
2527 /* Mark and leave space for a jump after this alternative,
2528 to be filled in later either by next alternative or
2529 when know we're at the end of a series of alternatives. */
2531 GET_BUFFER_SPACE (3);
2540 /* If \{ is a literal. */
2541 if (!(syntax
& RE_INTERVALS
)
2542 /* If we're at `\{' and it's not the open-interval
2544 || ((syntax
& RE_INTERVALS
) && (syntax
& RE_NO_BK_BRACES
))
2545 || (p
- 2 == pattern
&& p
== pend
))
2546 goto normal_backslash
;
2550 /* If got here, then the syntax allows intervals. */
2552 /* At least (most) this many matches must be made. */
2553 int lower_bound
= -1, upper_bound
= -1;
2555 beg_interval
= p
- 1;
2559 if (syntax
& RE_NO_BK_BRACES
)
2560 goto unfetch_interval
;
2562 FREE_STACK_RETURN (REG_EBRACE
);
2565 GET_UNSIGNED_NUMBER (lower_bound
);
2569 GET_UNSIGNED_NUMBER (upper_bound
);
2570 if (upper_bound
< 0) upper_bound
= RE_DUP_MAX
;
2573 /* Interval such as `{1}' => match exactly once. */
2574 upper_bound
= lower_bound
;
2576 if (lower_bound
< 0 || upper_bound
> RE_DUP_MAX
2577 || lower_bound
> upper_bound
)
2579 if (syntax
& RE_NO_BK_BRACES
)
2580 goto unfetch_interval
;
2582 FREE_STACK_RETURN (REG_BADBR
);
2585 if (!(syntax
& RE_NO_BK_BRACES
))
2587 if (c
!= '\\') FREE_STACK_RETURN (REG_EBRACE
);
2594 if (syntax
& RE_NO_BK_BRACES
)
2595 goto unfetch_interval
;
2597 FREE_STACK_RETURN (REG_BADBR
);
2600 /* We just parsed a valid interval. */
2602 /* If it's invalid to have no preceding re. */
2605 if (syntax
& RE_CONTEXT_INVALID_OPS
)
2606 FREE_STACK_RETURN (REG_BADRPT
);
2607 else if (syntax
& RE_CONTEXT_INDEP_OPS
)
2610 goto unfetch_interval
;
2613 /* If the upper bound is zero, don't want to succeed at
2614 all; jump from `laststart' to `b + 3', which will be
2615 the end of the buffer after we insert the jump. */
2616 if (upper_bound
== 0)
2618 GET_BUFFER_SPACE (3);
2619 INSERT_JUMP (jump
, laststart
, b
+ 3);
2623 /* Otherwise, we have a nontrivial interval. When
2624 we're all done, the pattern will look like:
2625 set_number_at <jump count> <upper bound>
2626 set_number_at <succeed_n count> <lower bound>
2627 succeed_n <after jump addr> <succeed_n count>
2629 jump_n <succeed_n addr> <jump count>
2630 (The upper bound and `jump_n' are omitted if
2631 `upper_bound' is 1, though.) */
2633 { /* If the upper bound is > 1, we need to insert
2634 more at the end of the loop. */
2635 unsigned nbytes
= 10 + (upper_bound
> 1) * 10;
2637 GET_BUFFER_SPACE (nbytes
);
2639 /* Initialize lower bound of the `succeed_n', even
2640 though it will be set during matching by its
2641 attendant `set_number_at' (inserted next),
2642 because `re_compile_fastmap' needs to know.
2643 Jump to the `jump_n' we might insert below. */
2644 INSERT_JUMP2 (succeed_n
, laststart
,
2645 b
+ 5 + (upper_bound
> 1) * 5,
2649 /* Code to initialize the lower bound. Insert
2650 before the `succeed_n'. The `5' is the last two
2651 bytes of this `set_number_at', plus 3 bytes of
2652 the following `succeed_n'. */
2653 insert_op2 (set_number_at
, laststart
, 5, lower_bound
, b
);
2656 if (upper_bound
> 1)
2657 { /* More than one repetition is allowed, so
2658 append a backward jump to the `succeed_n'
2659 that starts this interval.
2661 When we've reached this during matching,
2662 we'll have matched the interval once, so
2663 jump back only `upper_bound - 1' times. */
2664 STORE_JUMP2 (jump_n
, b
, laststart
+ 5,
2668 /* The location we want to set is the second
2669 parameter of the `jump_n'; that is `b-2' as
2670 an absolute address. `laststart' will be
2671 the `set_number_at' we're about to insert;
2672 `laststart+3' the number to set, the source
2673 for the relative address. But we are
2674 inserting into the middle of the pattern --
2675 so everything is getting moved up by 5.
2676 Conclusion: (b - 2) - (laststart + 3) + 5,
2677 i.e., b - laststart.
2679 We insert this at the beginning of the loop
2680 so that if we fail during matching, we'll
2681 reinitialize the bounds. */
2682 insert_op2 (set_number_at
, laststart
, b
- laststart
,
2683 upper_bound
- 1, b
);
2688 beg_interval
= NULL
;
2693 /* If an invalid interval, match the characters as literals. */
2694 assert (beg_interval
);
2696 beg_interval
= NULL
;
2698 /* normal_char and normal_backslash need `c'. */
2701 if (!(syntax
& RE_NO_BK_BRACES
))
2703 if (p
> pattern
&& p
[-1] == '\\')
2704 goto normal_backslash
;
2709 /* There is no way to specify the before_dot and after_dot
2710 operators. rms says this is ok. --karl */
2718 BUF_PUSH_2 (syntaxspec
, syntax_spec_code
[c
]);
2724 BUF_PUSH_2 (notsyntaxspec
, syntax_spec_code
[c
]);
2730 if (syntax
& RE_NO_GNU_OPS
)
2733 BUF_PUSH (wordchar
);
2738 if (syntax
& RE_NO_GNU_OPS
)
2741 BUF_PUSH (notwordchar
);
2746 if (syntax
& RE_NO_GNU_OPS
)
2752 if (syntax
& RE_NO_GNU_OPS
)
2758 if (syntax
& RE_NO_GNU_OPS
)
2760 BUF_PUSH (wordbound
);
2764 if (syntax
& RE_NO_GNU_OPS
)
2766 BUF_PUSH (notwordbound
);
2770 if (syntax
& RE_NO_GNU_OPS
)
2776 if (syntax
& RE_NO_GNU_OPS
)
2781 case '1': case '2': case '3': case '4': case '5':
2782 case '6': case '7': case '8': case '9':
2783 if (syntax
& RE_NO_BK_REFS
)
2789 FREE_STACK_RETURN (REG_ESUBREG
);
2791 /* Can't back reference to a subexpression if inside of it. */
2792 if (group_in_compile_stack (compile_stack
, (regnum_t
) c1
))
2796 BUF_PUSH_2 (duplicate
, c1
);
2802 if (syntax
& RE_BK_PLUS_QM
)
2805 goto normal_backslash
;
2809 /* You might think it would be useful for \ to mean
2810 not to translate; but if we don't translate it
2811 it will never match anything. */
2819 /* Expects the character in `c'. */
2821 /* If no exactn currently being built. */
2824 /* If last exactn not at current position. */
2825 || pending_exact
+ *pending_exact
+ 1 != b
2827 /* We have only one byte following the exactn for the count. */
2828 || *pending_exact
== (1 << BYTEWIDTH
) - 1
2830 /* If followed by a repetition operator. */
2831 || *p
== '*' || *p
== '^'
2832 || ((syntax
& RE_BK_PLUS_QM
)
2833 ? *p
== '\\' && (p
[1] == '+' || p
[1] == '?')
2834 : (*p
== '+' || *p
== '?'))
2835 || ((syntax
& RE_INTERVALS
)
2836 && ((syntax
& RE_NO_BK_BRACES
)
2838 : (p
[0] == '\\' && p
[1] == '{'))))
2840 /* Start building a new exactn. */
2844 BUF_PUSH_2 (exactn
, 0);
2845 pending_exact
= b
- 1;
2852 } /* while p != pend */
2855 /* Through the pattern now. */
2858 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
);
2860 if (!COMPILE_STACK_EMPTY
)
2861 FREE_STACK_RETURN (REG_EPAREN
);
2863 /* If we don't want backtracking, force success
2864 the first time we reach the end of the compiled pattern. */
2865 if (syntax
& RE_NO_POSIX_BACKTRACKING
)
2868 free (compile_stack
.stack
);
2870 /* We have succeeded; set the length of the buffer. */
2871 bufp
->used
= b
- bufp
->buffer
;
2876 DEBUG_PRINT1 ("\nCompiled pattern: \n");
2877 print_compiled_pattern (bufp
);
2881 #ifndef MATCH_MAY_ALLOCATE
2882 /* Initialize the failure stack to the largest possible stack. This
2883 isn't necessary unless we're trying to avoid calling alloca in
2884 the search and match routines. */
2886 int num_regs
= bufp
->re_nsub
+ 1;
2888 /* Since DOUBLE_FAIL_STACK refuses to double only if the current size
2889 is strictly greater than re_max_failures, the largest possible stack
2890 is 2 * re_max_failures failure points. */
2891 if (fail_stack
.size
< (2 * re_max_failures
* MAX_FAILURE_ITEMS
))
2893 fail_stack
.size
= (2 * re_max_failures
* MAX_FAILURE_ITEMS
);
2896 if (! fail_stack
.stack
)
2898 = (fail_stack_elt_t
*) xmalloc (fail_stack
.size
2899 * sizeof (fail_stack_elt_t
));
2902 = (fail_stack_elt_t
*) xrealloc (fail_stack
.stack
,
2904 * sizeof (fail_stack_elt_t
)));
2905 # else /* not emacs */
2906 if (! fail_stack
.stack
)
2908 = (fail_stack_elt_t
*) malloc (fail_stack
.size
2909 * sizeof (fail_stack_elt_t
));
2912 = (fail_stack_elt_t
*) realloc (fail_stack
.stack
,
2914 * sizeof (fail_stack_elt_t
)));
2915 # endif /* not emacs */
2918 regex_grow_registers (num_regs
);
2920 #endif /* not MATCH_MAY_ALLOCATE */
2923 } /* regex_compile */
2925 /* Subroutines for `regex_compile'. */
2927 /* Store OP at LOC followed by two-byte integer parameter ARG. */
2930 store_op1 (op
, loc
, arg
)
2935 *loc
= (unsigned char) op
;
2936 STORE_NUMBER (loc
+ 1, arg
);
2940 /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */
2943 store_op2 (op
, loc
, arg1
, arg2
)
2948 *loc
= (unsigned char) op
;
2949 STORE_NUMBER (loc
+ 1, arg1
);
2950 STORE_NUMBER (loc
+ 3, arg2
);
2954 /* Copy the bytes from LOC to END to open up three bytes of space at LOC
2955 for OP followed by two-byte integer parameter ARG. */
2958 insert_op1 (op
, loc
, arg
, end
)
2964 register unsigned char *pfrom
= end
;
2965 register unsigned char *pto
= end
+ 3;
2967 while (pfrom
!= loc
)
2970 store_op1 (op
, loc
, arg
);
2974 /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */
2977 insert_op2 (op
, loc
, arg1
, arg2
, end
)
2983 register unsigned char *pfrom
= end
;
2984 register unsigned char *pto
= end
+ 5;
2986 while (pfrom
!= loc
)
2989 store_op2 (op
, loc
, arg1
, arg2
);
2993 /* P points to just after a ^ in PATTERN. Return true if that ^ comes
2994 after an alternative or a begin-subexpression. We assume there is at
2995 least one character before the ^. */
2998 at_begline_loc_p (pattern
, p
, syntax
)
2999 const char *pattern
, *p
;
3000 reg_syntax_t syntax
;
3002 const char *prev
= p
- 2;
3003 boolean prev_prev_backslash
= prev
> pattern
&& prev
[-1] == '\\';
3006 /* After a subexpression? */
3007 (*prev
== '(' && (syntax
& RE_NO_BK_PARENS
|| prev_prev_backslash
))
3008 /* After an alternative? */
3009 || (*prev
== '|' && (syntax
& RE_NO_BK_VBAR
|| prev_prev_backslash
));
3013 /* The dual of at_begline_loc_p. This one is for $. We assume there is
3014 at least one character after the $, i.e., `P < PEND'. */
3017 at_endline_loc_p (p
, pend
, syntax
)
3018 const char *p
, *pend
;
3019 reg_syntax_t syntax
;
3021 const char *next
= p
;
3022 boolean next_backslash
= *next
== '\\';
3023 const char *next_next
= p
+ 1 < pend
? p
+ 1 : 0;
3026 /* Before a subexpression? */
3027 (syntax
& RE_NO_BK_PARENS
? *next
== ')'
3028 : next_backslash
&& next_next
&& *next_next
== ')')
3029 /* Before an alternative? */
3030 || (syntax
& RE_NO_BK_VBAR
? *next
== '|'
3031 : next_backslash
&& next_next
&& *next_next
== '|');
3035 /* Returns true if REGNUM is in one of COMPILE_STACK's elements and
3036 false if it's not. */
3039 group_in_compile_stack (compile_stack
, regnum
)
3040 compile_stack_type compile_stack
;
3045 for (this_element
= compile_stack
.avail
- 1;
3048 if (compile_stack
.stack
[this_element
].regnum
== regnum
)
3055 /* Read the ending character of a range (in a bracket expression) from the
3056 uncompiled pattern *P_PTR (which ends at PEND). We assume the
3057 starting character is in `P[-2]'. (`P[-1]' is the character `-'.)
3058 Then we set the translation of all bits between the starting and
3059 ending characters (inclusive) in the compiled pattern B.
3061 Return an error code.
3063 We use these short variable names so we can use the same macros as
3064 `regex_compile' itself. */
3066 static reg_errcode_t
3067 compile_range (p_ptr
, pend
, translate
, syntax
, b
)
3068 const char **p_ptr
, *pend
;
3069 RE_TRANSLATE_TYPE translate
;
3070 reg_syntax_t syntax
;
3075 const char *p
= *p_ptr
;
3076 unsigned int range_start
, range_end
;
3081 /* Even though the pattern is a signed `char *', we need to fetch
3082 with unsigned char *'s; if the high bit of the pattern character
3083 is set, the range endpoints will be negative if we fetch using a
3086 We also want to fetch the endpoints without translating them; the
3087 appropriate translation is done in the bit-setting loop below. */
3088 /* The SVR4 compiler on the 3B2 had trouble with unsigned const char *. */
3089 range_start
= ((const unsigned char *) p
)[-2];
3090 range_end
= ((const unsigned char *) p
)[0];
3092 /* Have to increment the pointer into the pattern string, so the
3093 caller isn't still at the ending character. */
3096 /* If the start is after the end, the range is empty. */
3097 if (range_start
> range_end
)
3098 return syntax
& RE_NO_EMPTY_RANGES
? REG_ERANGE
: REG_NOERROR
;
3100 /* Here we see why `this_char' has to be larger than an `unsigned
3101 char' -- the range is inclusive, so if `range_end' == 0xff
3102 (assuming 8-bit characters), we would otherwise go into an infinite
3103 loop, since all characters <= 0xff. */
3104 for (this_char
= range_start
; this_char
<= range_end
; this_char
++)
3106 SET_LIST_BIT (TRANSLATE (this_char
));
3112 /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
3113 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
3114 characters can start a string that matches the pattern. This fastmap
3115 is used by re_search to skip quickly over impossible starting points.
3117 The caller must supply the address of a (1 << BYTEWIDTH)-byte data
3118 area as BUFP->fastmap.
3120 We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
3123 Returns 0 if we succeed, -2 if an internal error. */
3126 re_compile_fastmap (bufp
)
3127 struct re_pattern_buffer
*bufp
;
3130 #ifdef MATCH_MAY_ALLOCATE
3131 fail_stack_type fail_stack
;
3133 #ifndef REGEX_MALLOC
3137 register char *fastmap
= bufp
->fastmap
;
3138 unsigned char *pattern
= bufp
->buffer
;
3139 unsigned char *p
= pattern
;
3140 register unsigned char *pend
= pattern
+ bufp
->used
;
3143 /* This holds the pointer to the failure stack, when
3144 it is allocated relocatably. */
3145 fail_stack_elt_t
*failure_stack_ptr
;
3148 /* Assume that each path through the pattern can be null until
3149 proven otherwise. We set this false at the bottom of switch
3150 statement, to which we get only if a particular path doesn't
3151 match the empty string. */
3152 boolean path_can_be_null
= true;
3154 /* We aren't doing a `succeed_n' to begin with. */
3155 boolean succeed_n_p
= false;
3157 assert (fastmap
!= NULL
&& p
!= NULL
);
3160 bzero (fastmap
, 1 << BYTEWIDTH
); /* Assume nothing's valid. */
3161 bufp
->fastmap_accurate
= 1; /* It will be when we're done. */
3162 bufp
->can_be_null
= 0;
3166 if (p
== pend
|| *p
== succeed
)
3168 /* We have reached the (effective) end of pattern. */
3169 if (!FAIL_STACK_EMPTY ())
3171 bufp
->can_be_null
|= path_can_be_null
;
3173 /* Reset for next path. */
3174 path_can_be_null
= true;
3176 p
= fail_stack
.stack
[--fail_stack
.avail
].pointer
;
3184 /* We should never be about to go beyond the end of the pattern. */
3187 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
3190 /* I guess the idea here is to simply not bother with a fastmap
3191 if a backreference is used, since it's too hard to figure out
3192 the fastmap for the corresponding group. Setting
3193 `can_be_null' stops `re_search_2' from using the fastmap, so
3194 that is all we do. */
3196 bufp
->can_be_null
= 1;
3200 /* Following are the cases which match a character. These end
3209 for (j
= *p
++ * BYTEWIDTH
- 1; j
>= 0; j
--)
3210 if (p
[j
/ BYTEWIDTH
] & (1 << (j
% BYTEWIDTH
)))
3216 /* Chars beyond end of map must be allowed. */
3217 for (j
= *p
* BYTEWIDTH
; j
< (1 << BYTEWIDTH
); j
++)
3220 for (j
= *p
++ * BYTEWIDTH
- 1; j
>= 0; j
--)
3221 if (!(p
[j
/ BYTEWIDTH
] & (1 << (j
% BYTEWIDTH
))))
3227 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3228 if (SYNTAX (j
) == Sword
)
3234 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3235 if (SYNTAX (j
) != Sword
)
3242 int fastmap_newline
= fastmap
['\n'];
3244 /* `.' matches anything ... */
3245 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3248 /* ... except perhaps newline. */
3249 if (!(bufp
->syntax
& RE_DOT_NEWLINE
))
3250 fastmap
['\n'] = fastmap_newline
;
3252 /* Return if we have already set `can_be_null'; if we have,
3253 then the fastmap is irrelevant. Something's wrong here. */
3254 else if (bufp
->can_be_null
)
3257 /* Otherwise, have to check alternative paths. */
3264 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3265 if (SYNTAX (j
) == (enum syntaxcode
) k
)
3272 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3273 if (SYNTAX (j
) != (enum syntaxcode
) k
)
3278 /* All cases after this match the empty string. These end with
3298 case push_dummy_failure
:
3303 case pop_failure_jump
:
3304 case maybe_pop_jump
:
3307 case dummy_failure_jump
:
3308 EXTRACT_NUMBER_AND_INCR (j
, p
);
3313 /* Jump backward implies we just went through the body of a
3314 loop and matched nothing. Opcode jumped to should be
3315 `on_failure_jump' or `succeed_n'. Just treat it like an
3316 ordinary jump. For a * loop, it has pushed its failure
3317 point already; if so, discard that as redundant. */
3318 if ((re_opcode_t
) *p
!= on_failure_jump
3319 && (re_opcode_t
) *p
!= succeed_n
)
3323 EXTRACT_NUMBER_AND_INCR (j
, p
);
3326 /* If what's on the stack is where we are now, pop it. */
3327 if (!FAIL_STACK_EMPTY ()
3328 && fail_stack
.stack
[fail_stack
.avail
- 1].pointer
== p
)
3334 case on_failure_jump
:
3335 case on_failure_keep_string_jump
:
3336 handle_on_failure_jump
:
3337 EXTRACT_NUMBER_AND_INCR (j
, p
);
3339 /* For some patterns, e.g., `(a?)?', `p+j' here points to the
3340 end of the pattern. We don't want to push such a point,
3341 since when we restore it above, entering the switch will
3342 increment `p' past the end of the pattern. We don't need
3343 to push such a point since we obviously won't find any more
3344 fastmap entries beyond `pend'. Such a pattern can match
3345 the null string, though. */
3348 if (!PUSH_PATTERN_OP (p
+ j
, fail_stack
))
3350 RESET_FAIL_STACK ();
3355 bufp
->can_be_null
= 1;
3359 EXTRACT_NUMBER_AND_INCR (k
, p
); /* Skip the n. */
3360 succeed_n_p
= false;
3367 /* Get to the number of times to succeed. */
3370 /* Increment p past the n for when k != 0. */
3371 EXTRACT_NUMBER_AND_INCR (k
, p
);
3375 succeed_n_p
= true; /* Spaghetti code alert. */
3376 goto handle_on_failure_jump
;
3393 abort (); /* We have listed all the cases. */
3396 /* Getting here means we have found the possible starting
3397 characters for one path of the pattern -- and that the empty
3398 string does not match. We need not follow this path further.
3399 Instead, look at the next alternative (remembered on the
3400 stack), or quit if no more. The test at the top of the loop
3401 does these things. */
3402 path_can_be_null
= false;
3406 /* Set `can_be_null' for the last path (also the first path, if the
3407 pattern is empty). */
3408 bufp
->can_be_null
|= path_can_be_null
;
3411 RESET_FAIL_STACK ();
3413 } /* re_compile_fastmap */
3415 weak_alias (__re_compile_fastmap
, re_compile_fastmap
)
3418 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
3419 ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use
3420 this memory for recording register information. STARTS and ENDS
3421 must be allocated using the malloc library routine, and must each
3422 be at least NUM_REGS * sizeof (regoff_t) bytes long.
3424 If NUM_REGS == 0, then subsequent matches should allocate their own
3427 Unless this function is called, the first search or match using
3428 PATTERN_BUFFER will allocate its own register data, without
3429 freeing the old data. */
3432 re_set_registers (bufp
, regs
, num_regs
, starts
, ends
)
3433 struct re_pattern_buffer
*bufp
;
3434 struct re_registers
*regs
;
3436 regoff_t
*starts
, *ends
;
3440 bufp
->regs_allocated
= REGS_REALLOCATE
;
3441 regs
->num_regs
= num_regs
;
3442 regs
->start
= starts
;
3447 bufp
->regs_allocated
= REGS_UNALLOCATED
;
3449 regs
->start
= regs
->end
= (regoff_t
*) 0;
3453 weak_alias (__re_set_registers
, re_set_registers
)
3456 /* Searching routines. */
3458 /* Like re_search_2, below, but only one string is specified, and
3459 doesn't let you say where to stop matching. */
3462 re_search (bufp
, string
, size
, startpos
, range
, regs
)
3463 struct re_pattern_buffer
*bufp
;
3465 int size
, startpos
, range
;
3466 struct re_registers
*regs
;
3468 return re_search_2 (bufp
, NULL
, 0, string
, size
, startpos
, range
,
3472 weak_alias (__re_search
, re_search
)
3476 /* Using the compiled pattern in BUFP->buffer, first tries to match the
3477 virtual concatenation of STRING1 and STRING2, starting first at index
3478 STARTPOS, then at STARTPOS + 1, and so on.
3480 STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
3482 RANGE is how far to scan while trying to match. RANGE = 0 means try
3483 only at STARTPOS; in general, the last start tried is STARTPOS +
3486 In REGS, return the indices of the virtual concatenation of STRING1
3487 and STRING2 that matched the entire BUFP->buffer and its contained
3490 Do not consider matching one past the index STOP in the virtual
3491 concatenation of STRING1 and STRING2.
3493 We return either the position in the strings at which the match was
3494 found, -1 if no match, or -2 if error (such as failure
3498 re_search_2 (bufp
, string1
, size1
, string2
, size2
, startpos
, range
, regs
, stop
)
3499 struct re_pattern_buffer
*bufp
;
3500 const char *string1
, *string2
;
3504 struct re_registers
*regs
;
3508 register char *fastmap
= bufp
->fastmap
;
3509 register RE_TRANSLATE_TYPE translate
= bufp
->translate
;
3510 int total_size
= size1
+ size2
;
3511 int endpos
= startpos
+ range
;
3513 /* Check for out-of-range STARTPOS. */
3514 if (startpos
< 0 || startpos
> total_size
)
3517 /* Fix up RANGE if it might eventually take us outside
3518 the virtual concatenation of STRING1 and STRING2.
3519 Make sure we won't move STARTPOS below 0 or above TOTAL_SIZE. */
3521 range
= 0 - startpos
;
3522 else if (endpos
> total_size
)
3523 range
= total_size
- startpos
;
3525 /* If the search isn't to be a backwards one, don't waste time in a
3526 search for a pattern that must be anchored. */
3527 if (bufp
->used
> 0 && (re_opcode_t
) bufp
->buffer
[0] == begbuf
&& range
> 0)
3536 /* In a forward search for something that starts with \=.
3537 don't keep searching past point. */
3538 if (bufp
->used
> 0 && (re_opcode_t
) bufp
->buffer
[0] == at_dot
&& range
> 0)
3540 range
= PT
- startpos
;
3546 /* Update the fastmap now if not correct already. */
3547 if (fastmap
&& !bufp
->fastmap_accurate
)
3548 if (re_compile_fastmap (bufp
) == -2)
3551 /* Loop through the string, looking for a place to start matching. */
3554 /* If a fastmap is supplied, skip quickly over characters that
3555 cannot be the start of a match. If the pattern can match the
3556 null string, however, we don't need to skip characters; we want
3557 the first null string. */
3558 if (fastmap
&& startpos
< total_size
&& !bufp
->can_be_null
)
3560 if (range
> 0) /* Searching forwards. */
3562 register const char *d
;
3563 register int lim
= 0;
3566 if (startpos
< size1
&& startpos
+ range
>= size1
)
3567 lim
= range
- (size1
- startpos
);
3569 d
= (startpos
>= size1
? string2
- size1
: string1
) + startpos
;
3571 /* Written out as an if-else to avoid testing `translate'
3575 && !fastmap
[(unsigned char)
3576 translate
[(unsigned char) *d
++]])
3579 while (range
> lim
&& !fastmap
[(unsigned char) *d
++])
3582 startpos
+= irange
- range
;
3584 else /* Searching backwards. */
3586 register char c
= (size1
== 0 || startpos
>= size1
3587 ? string2
[startpos
- size1
]
3588 : string1
[startpos
]);
3590 if (!fastmap
[(unsigned char) TRANSLATE (c
)])
3595 /* If can't match the null string, and that's all we have left, fail. */
3596 if (range
>= 0 && startpos
== total_size
&& fastmap
3597 && !bufp
->can_be_null
)
3600 val
= re_match_2_internal (bufp
, string1
, size1
, string2
, size2
,
3601 startpos
, regs
, stop
);
3602 #ifndef REGEX_MALLOC
3631 weak_alias (__re_search_2
, re_search_2
)
3634 /* This converts PTR, a pointer into one of the search strings `string1'
3635 and `string2' into an offset from the beginning of that string. */
3636 #define POINTER_TO_OFFSET(ptr) \
3637 (FIRST_STRING_P (ptr) \
3638 ? ((regoff_t) ((ptr) - string1)) \
3639 : ((regoff_t) ((ptr) - string2 + size1)))
3641 /* Macros for dealing with the split strings in re_match_2. */
3643 #define MATCHING_IN_FIRST_STRING (dend == end_match_1)
3645 /* Call before fetching a character with *d. This switches over to
3646 string2 if necessary. */
3647 #define PREFETCH() \
3650 /* End of string2 => fail. */ \
3651 if (dend == end_match_2) \
3653 /* End of string1 => advance to string2. */ \
3655 dend = end_match_2; \
3659 /* Test if at very beginning or at very end of the virtual concatenation
3660 of `string1' and `string2'. If only one string, it's `string2'. */
3661 #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
3662 #define AT_STRINGS_END(d) ((d) == end2)
3665 /* Test if D points to a character which is word-constituent. We have
3666 two special cases to check for: if past the end of string1, look at
3667 the first character in string2; and if before the beginning of
3668 string2, look at the last character in string1. */
3669 #define WORDCHAR_P(d) \
3670 (SYNTAX ((d) == end1 ? *string2 \
3671 : (d) == string2 - 1 ? *(end1 - 1) : *(d)) \
3674 /* Disabled due to a compiler bug -- see comment at case wordbound */
3676 /* Test if the character before D and the one at D differ with respect
3677 to being word-constituent. */
3678 #define AT_WORD_BOUNDARY(d) \
3679 (AT_STRINGS_BEG (d) || AT_STRINGS_END (d) \
3680 || WORDCHAR_P (d - 1) != WORDCHAR_P (d))
3683 /* Free everything we malloc. */
3684 #ifdef MATCH_MAY_ALLOCATE
3685 # define FREE_VAR(var) if (var) REGEX_FREE (var); var = NULL
3686 # define FREE_VARIABLES() \
3688 REGEX_FREE_STACK (fail_stack.stack); \
3689 FREE_VAR (regstart); \
3690 FREE_VAR (regend); \
3691 FREE_VAR (old_regstart); \
3692 FREE_VAR (old_regend); \
3693 FREE_VAR (best_regstart); \
3694 FREE_VAR (best_regend); \
3695 FREE_VAR (reg_info); \
3696 FREE_VAR (reg_dummy); \
3697 FREE_VAR (reg_info_dummy); \
3700 # define FREE_VARIABLES() ((void)0) /* Do nothing! But inhibit gcc warning. */
3701 #endif /* not MATCH_MAY_ALLOCATE */
3703 /* These values must meet several constraints. They must not be valid
3704 register values; since we have a limit of 255 registers (because
3705 we use only one byte in the pattern for the register number), we can
3706 use numbers larger than 255. They must differ by 1, because of
3707 NUM_FAILURE_ITEMS above. And the value for the lowest register must
3708 be larger than the value for the highest register, so we do not try
3709 to actually save any registers when none are active. */
3710 #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
3711 #define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
3713 /* Matching routines. */
3715 #ifndef emacs /* Emacs never uses this. */
3716 /* re_match is like re_match_2 except it takes only a single string. */
3719 re_match (bufp
, string
, size
, pos
, regs
)
3720 struct re_pattern_buffer
*bufp
;
3723 struct re_registers
*regs
;
3725 int result
= re_match_2_internal (bufp
, NULL
, 0, string
, size
,
3727 # ifndef REGEX_MALLOC
3735 weak_alias (__re_match
, re_match
)
3737 #endif /* not emacs */
3739 static boolean group_match_null_string_p
_RE_ARGS ((unsigned char **p
,
3741 register_info_type
*reg_info
));
3742 static boolean alt_match_null_string_p
_RE_ARGS ((unsigned char *p
,
3744 register_info_type
*reg_info
));
3745 static boolean common_op_match_null_string_p
_RE_ARGS ((unsigned char **p
,
3747 register_info_type
*reg_info
));
3748 static int bcmp_translate
_RE_ARGS ((const char *s1
, const char *s2
,
3749 int len
, char *translate
));
3751 /* re_match_2 matches the compiled pattern in BUFP against the
3752 the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1
3753 and SIZE2, respectively). We start matching at POS, and stop
3756 If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
3757 store offsets for the substring each group matched in REGS. See the
3758 documentation for exactly how many groups we fill.
3760 We return -1 if no match, -2 if an internal error (such as the
3761 failure stack overflowing). Otherwise, we return the length of the
3762 matched substring. */
3765 re_match_2 (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
3766 struct re_pattern_buffer
*bufp
;
3767 const char *string1
, *string2
;
3770 struct re_registers
*regs
;
3773 int result
= re_match_2_internal (bufp
, string1
, size1
, string2
, size2
,
3775 #ifndef REGEX_MALLOC
3783 weak_alias (__re_match_2
, re_match_2
)
3786 /* This is a separate function so that we can force an alloca cleanup
3789 re_match_2_internal (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
3790 struct re_pattern_buffer
*bufp
;
3791 const char *string1
, *string2
;
3794 struct re_registers
*regs
;
3797 /* General temporaries. */
3801 /* Just past the end of the corresponding string. */
3802 const char *end1
, *end2
;
3804 /* Pointers into string1 and string2, just past the last characters in
3805 each to consider matching. */
3806 const char *end_match_1
, *end_match_2
;
3808 /* Where we are in the data, and the end of the current string. */
3809 const char *d
, *dend
;
3811 /* Where we are in the pattern, and the end of the pattern. */
3812 unsigned char *p
= bufp
->buffer
;
3813 register unsigned char *pend
= p
+ bufp
->used
;
3815 /* Mark the opcode just after a start_memory, so we can test for an
3816 empty subpattern when we get to the stop_memory. */
3817 unsigned char *just_past_start_mem
= 0;
3819 /* We use this to map every character in the string. */
3820 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
3822 /* Failure point stack. Each place that can handle a failure further
3823 down the line pushes a failure point on this stack. It consists of
3824 restart, regend, and reg_info for all registers corresponding to
3825 the subexpressions we're currently inside, plus the number of such
3826 registers, and, finally, two char *'s. The first char * is where
3827 to resume scanning the pattern; the second one is where to resume
3828 scanning the strings. If the latter is zero, the failure point is
3829 a ``dummy''; if a failure happens and the failure point is a dummy,
3830 it gets discarded and the next next one is tried. */
3831 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
3832 fail_stack_type fail_stack
;
3835 static unsigned failure_id
= 0;
3836 unsigned nfailure_points_pushed
= 0, nfailure_points_popped
= 0;
3840 /* This holds the pointer to the failure stack, when
3841 it is allocated relocatably. */
3842 fail_stack_elt_t
*failure_stack_ptr
;
3845 /* We fill all the registers internally, independent of what we
3846 return, for use in backreferences. The number here includes
3847 an element for register zero. */
3848 size_t num_regs
= bufp
->re_nsub
+ 1;
3850 /* The currently active registers. */
3851 active_reg_t lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
3852 active_reg_t highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
3854 /* Information on the contents of registers. These are pointers into
3855 the input strings; they record just what was matched (on this
3856 attempt) by a subexpression part of the pattern, that is, the
3857 regnum-th regstart pointer points to where in the pattern we began
3858 matching and the regnum-th regend points to right after where we
3859 stopped matching the regnum-th subexpression. (The zeroth register
3860 keeps track of what the whole pattern matches.) */
3861 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3862 const char **regstart
, **regend
;
3865 /* If a group that's operated upon by a repetition operator fails to
3866 match anything, then the register for its start will need to be
3867 restored because it will have been set to wherever in the string we
3868 are when we last see its open-group operator. Similarly for a
3870 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3871 const char **old_regstart
, **old_regend
;
3874 /* The is_active field of reg_info helps us keep track of which (possibly
3875 nested) subexpressions we are currently in. The matched_something
3876 field of reg_info[reg_num] helps us tell whether or not we have
3877 matched any of the pattern so far this time through the reg_num-th
3878 subexpression. These two fields get reset each time through any
3879 loop their register is in. */
3880 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
3881 register_info_type
*reg_info
;
3884 /* The following record the register info as found in the above
3885 variables when we find a match better than any we've seen before.
3886 This happens as we backtrack through the failure points, which in
3887 turn happens only if we have not yet matched the entire string. */
3888 unsigned best_regs_set
= false;
3889 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3890 const char **best_regstart
, **best_regend
;
3893 /* Logically, this is `best_regend[0]'. But we don't want to have to
3894 allocate space for that if we're not allocating space for anything
3895 else (see below). Also, we never need info about register 0 for
3896 any of the other register vectors, and it seems rather a kludge to
3897 treat `best_regend' differently than the rest. So we keep track of
3898 the end of the best match so far in a separate variable. We
3899 initialize this to NULL so that when we backtrack the first time
3900 and need to test it, it's not garbage. */
3901 const char *match_end
= NULL
;
3903 /* This helps SET_REGS_MATCHED avoid doing redundant work. */
3904 int set_regs_matched_done
= 0;
3906 /* Used when we pop values we don't care about. */
3907 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3908 const char **reg_dummy
;
3909 register_info_type
*reg_info_dummy
;
3913 /* Counts the total number of registers pushed. */
3914 unsigned num_regs_pushed
= 0;
3917 DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
3921 #ifdef MATCH_MAY_ALLOCATE
3922 /* Do not bother to initialize all the register variables if there are
3923 no groups in the pattern, as it takes a fair amount of time. If
3924 there are groups, we include space for register 0 (the whole
3925 pattern), even though we never use it, since it simplifies the
3926 array indexing. We should fix this. */
3929 regstart
= REGEX_TALLOC (num_regs
, const char *);
3930 regend
= REGEX_TALLOC (num_regs
, const char *);
3931 old_regstart
= REGEX_TALLOC (num_regs
, const char *);
3932 old_regend
= REGEX_TALLOC (num_regs
, const char *);
3933 best_regstart
= REGEX_TALLOC (num_regs
, const char *);
3934 best_regend
= REGEX_TALLOC (num_regs
, const char *);
3935 reg_info
= REGEX_TALLOC (num_regs
, register_info_type
);
3936 reg_dummy
= REGEX_TALLOC (num_regs
, const char *);
3937 reg_info_dummy
= REGEX_TALLOC (num_regs
, register_info_type
);
3939 if (!(regstart
&& regend
&& old_regstart
&& old_regend
&& reg_info
3940 && best_regstart
&& best_regend
&& reg_dummy
&& reg_info_dummy
))
3948 /* We must initialize all our variables to NULL, so that
3949 `FREE_VARIABLES' doesn't try to free them. */
3950 regstart
= regend
= old_regstart
= old_regend
= best_regstart
3951 = best_regend
= reg_dummy
= NULL
;
3952 reg_info
= reg_info_dummy
= (register_info_type
*) NULL
;
3954 #endif /* MATCH_MAY_ALLOCATE */
3956 /* The starting position is bogus. */
3957 if (pos
< 0 || pos
> size1
+ size2
)
3963 /* Initialize subexpression text positions to -1 to mark ones that no
3964 start_memory/stop_memory has been seen for. Also initialize the
3965 register information struct. */
3966 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
3968 regstart
[mcnt
] = regend
[mcnt
]
3969 = old_regstart
[mcnt
] = old_regend
[mcnt
] = REG_UNSET_VALUE
;
3971 REG_MATCH_NULL_STRING_P (reg_info
[mcnt
]) = MATCH_NULL_UNSET_VALUE
;
3972 IS_ACTIVE (reg_info
[mcnt
]) = 0;
3973 MATCHED_SOMETHING (reg_info
[mcnt
]) = 0;
3974 EVER_MATCHED_SOMETHING (reg_info
[mcnt
]) = 0;
3977 /* We move `string1' into `string2' if the latter's empty -- but not if
3978 `string1' is null. */
3979 if (size2
== 0 && string1
!= NULL
)
3986 end1
= string1
+ size1
;
3987 end2
= string2
+ size2
;
3989 /* Compute where to stop matching, within the two strings. */
3992 end_match_1
= string1
+ stop
;
3993 end_match_2
= string2
;
3998 end_match_2
= string2
+ stop
- size1
;
4001 /* `p' scans through the pattern as `d' scans through the data.
4002 `dend' is the end of the input string that `d' points within. `d'
4003 is advanced into the following input string whenever necessary, but
4004 this happens before fetching; therefore, at the beginning of the
4005 loop, `d' can be pointing at the end of a string, but it cannot
4007 if (size1
> 0 && pos
<= size1
)
4014 d
= string2
+ pos
- size1
;
4018 DEBUG_PRINT1 ("The compiled pattern is:\n");
4019 DEBUG_PRINT_COMPILED_PATTERN (bufp
, p
, pend
);
4020 DEBUG_PRINT1 ("The string to match is: `");
4021 DEBUG_PRINT_DOUBLE_STRING (d
, string1
, size1
, string2
, size2
);
4022 DEBUG_PRINT1 ("'\n");
4024 /* This loops over pattern commands. It exits by returning from the
4025 function if the match is complete, or it drops through if the match
4026 fails at this starting point in the input data. */
4030 DEBUG_PRINT2 ("\n%p: ", p
);
4032 DEBUG_PRINT2 ("\n0x%x: ", p
);
4036 { /* End of pattern means we might have succeeded. */
4037 DEBUG_PRINT1 ("end of pattern ... ");
4039 /* If we haven't matched the entire string, and we want the
4040 longest match, try backtracking. */
4041 if (d
!= end_match_2
)
4043 /* 1 if this match ends in the same string (string1 or string2)
4044 as the best previous match. */
4045 boolean same_str_p
= (FIRST_STRING_P (match_end
)
4046 == MATCHING_IN_FIRST_STRING
);
4047 /* 1 if this match is the best seen so far. */
4048 boolean best_match_p
;
4050 /* AIX compiler got confused when this was combined
4051 with the previous declaration. */
4053 best_match_p
= d
> match_end
;
4055 best_match_p
= !MATCHING_IN_FIRST_STRING
;
4057 DEBUG_PRINT1 ("backtracking.\n");
4059 if (!FAIL_STACK_EMPTY ())
4060 { /* More failure points to try. */
4062 /* If exceeds best match so far, save it. */
4063 if (!best_regs_set
|| best_match_p
)
4065 best_regs_set
= true;
4068 DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
4070 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
4072 best_regstart
[mcnt
] = regstart
[mcnt
];
4073 best_regend
[mcnt
] = regend
[mcnt
];
4079 /* If no failure points, don't restore garbage. And if
4080 last match is real best match, don't restore second
4082 else if (best_regs_set
&& !best_match_p
)
4085 /* Restore best match. It may happen that `dend ==
4086 end_match_1' while the restored d is in string2.
4087 For example, the pattern `x.*y.*z' against the
4088 strings `x-' and `y-z-', if the two strings are
4089 not consecutive in memory. */
4090 DEBUG_PRINT1 ("Restoring best registers.\n");
4093 dend
= ((d
>= string1
&& d
<= end1
)
4094 ? end_match_1
: end_match_2
);
4096 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
4098 regstart
[mcnt
] = best_regstart
[mcnt
];
4099 regend
[mcnt
] = best_regend
[mcnt
];
4102 } /* d != end_match_2 */
4105 DEBUG_PRINT1 ("Accepting match.\n");
4107 /* If caller wants register contents data back, do it. */
4108 if (regs
&& !bufp
->no_sub
)
4110 /* Have the register data arrays been allocated? */
4111 if (bufp
->regs_allocated
== REGS_UNALLOCATED
)
4112 { /* No. So allocate them with malloc. We need one
4113 extra element beyond `num_regs' for the `-1' marker
4115 regs
->num_regs
= MAX (RE_NREGS
, num_regs
+ 1);
4116 regs
->start
= TALLOC (regs
->num_regs
, regoff_t
);
4117 regs
->end
= TALLOC (regs
->num_regs
, regoff_t
);
4118 if (regs
->start
== NULL
|| regs
->end
== NULL
)
4123 bufp
->regs_allocated
= REGS_REALLOCATE
;
4125 else if (bufp
->regs_allocated
== REGS_REALLOCATE
)
4126 { /* Yes. If we need more elements than were already
4127 allocated, reallocate them. If we need fewer, just
4129 if (regs
->num_regs
< num_regs
+ 1)
4131 regs
->num_regs
= num_regs
+ 1;
4132 RETALLOC (regs
->start
, regs
->num_regs
, regoff_t
);
4133 RETALLOC (regs
->end
, regs
->num_regs
, regoff_t
);
4134 if (regs
->start
== NULL
|| regs
->end
== NULL
)
4143 /* These braces fend off a "empty body in an else-statement"
4144 warning under GCC when assert expands to nothing. */
4145 assert (bufp
->regs_allocated
== REGS_FIXED
);
4148 /* Convert the pointer data in `regstart' and `regend' to
4149 indices. Register zero has to be set differently,
4150 since we haven't kept track of any info for it. */
4151 if (regs
->num_regs
> 0)
4153 regs
->start
[0] = pos
;
4154 regs
->end
[0] = (MATCHING_IN_FIRST_STRING
4155 ? ((regoff_t
) (d
- string1
))
4156 : ((regoff_t
) (d
- string2
+ size1
)));
4159 /* Go through the first `min (num_regs, regs->num_regs)'
4160 registers, since that is all we initialized. */
4161 for (mcnt
= 1; (unsigned) mcnt
< MIN (num_regs
, regs
->num_regs
);
4164 if (REG_UNSET (regstart
[mcnt
]) || REG_UNSET (regend
[mcnt
]))
4165 regs
->start
[mcnt
] = regs
->end
[mcnt
] = -1;
4169 = (regoff_t
) POINTER_TO_OFFSET (regstart
[mcnt
]);
4171 = (regoff_t
) POINTER_TO_OFFSET (regend
[mcnt
]);
4175 /* If the regs structure we return has more elements than
4176 were in the pattern, set the extra elements to -1. If
4177 we (re)allocated the registers, this is the case,
4178 because we always allocate enough to have at least one
4180 for (mcnt
= num_regs
; (unsigned) mcnt
< regs
->num_regs
; mcnt
++)
4181 regs
->start
[mcnt
] = regs
->end
[mcnt
] = -1;
4182 } /* regs && !bufp->no_sub */
4184 DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
4185 nfailure_points_pushed
, nfailure_points_popped
,
4186 nfailure_points_pushed
- nfailure_points_popped
);
4187 DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed
);
4189 mcnt
= d
- pos
- (MATCHING_IN_FIRST_STRING
4193 DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt
);
4199 /* Otherwise match next pattern command. */
4200 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
4202 /* Ignore these. Used to ignore the n of succeed_n's which
4203 currently have n == 0. */
4205 DEBUG_PRINT1 ("EXECUTING no_op.\n");
4209 DEBUG_PRINT1 ("EXECUTING succeed.\n");
4212 /* Match the next n pattern characters exactly. The following
4213 byte in the pattern defines n, and the n bytes after that
4214 are the characters to match. */
4217 DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt
);
4219 /* This is written out as an if-else so we don't waste time
4220 testing `translate' inside the loop. */
4226 if ((unsigned char) translate
[(unsigned char) *d
++]
4227 != (unsigned char) *p
++)
4237 if (*d
++ != (char) *p
++) goto fail
;
4241 SET_REGS_MATCHED ();
4245 /* Match any character except possibly a newline or a null. */
4247 DEBUG_PRINT1 ("EXECUTING anychar.\n");
4251 if ((!(bufp
->syntax
& RE_DOT_NEWLINE
) && TRANSLATE (*d
) == '\n')
4252 || (bufp
->syntax
& RE_DOT_NOT_NULL
&& TRANSLATE (*d
) == '\000'))
4255 SET_REGS_MATCHED ();
4256 DEBUG_PRINT2 (" Matched `%d'.\n", *d
);
4264 register unsigned char c
;
4265 boolean
not = (re_opcode_t
) *(p
- 1) == charset_not
;
4267 DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : "");
4270 c
= TRANSLATE (*d
); /* The character to match. */
4272 /* Cast to `unsigned' instead of `unsigned char' in case the
4273 bit list is a full 32 bytes long. */
4274 if (c
< (unsigned) (*p
* BYTEWIDTH
)
4275 && p
[1 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
4280 if (!not) goto fail
;
4282 SET_REGS_MATCHED ();
4288 /* The beginning of a group is represented by start_memory.
4289 The arguments are the register number in the next byte, and the
4290 number of groups inner to this one in the next. The text
4291 matched within the group is recorded (in the internal
4292 registers data structure) under the register number. */
4294 DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p
, p
[1]);
4296 /* Find out if this group can match the empty string. */
4297 p1
= p
; /* To send to group_match_null_string_p. */
4299 if (REG_MATCH_NULL_STRING_P (reg_info
[*p
]) == MATCH_NULL_UNSET_VALUE
)
4300 REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4301 = group_match_null_string_p (&p1
, pend
, reg_info
);
4303 /* Save the position in the string where we were the last time
4304 we were at this open-group operator in case the group is
4305 operated upon by a repetition operator, e.g., with `(a*)*b'
4306 against `ab'; then we want to ignore where we are now in
4307 the string in case this attempt to match fails. */
4308 old_regstart
[*p
] = REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4309 ? REG_UNSET (regstart
[*p
]) ? d
: regstart
[*p
]
4311 DEBUG_PRINT2 (" old_regstart: %d\n",
4312 POINTER_TO_OFFSET (old_regstart
[*p
]));
4315 DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart
[*p
]));
4317 IS_ACTIVE (reg_info
[*p
]) = 1;
4318 MATCHED_SOMETHING (reg_info
[*p
]) = 0;
4320 /* Clear this whenever we change the register activity status. */
4321 set_regs_matched_done
= 0;
4323 /* This is the new highest active register. */
4324 highest_active_reg
= *p
;
4326 /* If nothing was active before, this is the new lowest active
4328 if (lowest_active_reg
== NO_LOWEST_ACTIVE_REG
)
4329 lowest_active_reg
= *p
;
4331 /* Move past the register number and inner group count. */
4333 just_past_start_mem
= p
;
4338 /* The stop_memory opcode represents the end of a group. Its
4339 arguments are the same as start_memory's: the register
4340 number, and the number of inner groups. */
4342 DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p
, p
[1]);
4344 /* We need to save the string position the last time we were at
4345 this close-group operator in case the group is operated
4346 upon by a repetition operator, e.g., with `((a*)*(b*)*)*'
4347 against `aba'; then we want to ignore where we are now in
4348 the string in case this attempt to match fails. */
4349 old_regend
[*p
] = REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4350 ? REG_UNSET (regend
[*p
]) ? d
: regend
[*p
]
4352 DEBUG_PRINT2 (" old_regend: %d\n",
4353 POINTER_TO_OFFSET (old_regend
[*p
]));
4356 DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend
[*p
]));
4358 /* This register isn't active anymore. */
4359 IS_ACTIVE (reg_info
[*p
]) = 0;
4361 /* Clear this whenever we change the register activity status. */
4362 set_regs_matched_done
= 0;
4364 /* If this was the only register active, nothing is active
4366 if (lowest_active_reg
== highest_active_reg
)
4368 lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
4369 highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
4372 { /* We must scan for the new highest active register, since
4373 it isn't necessarily one less than now: consider
4374 (a(b)c(d(e)f)g). When group 3 ends, after the f), the
4375 new highest active register is 1. */
4376 unsigned char r
= *p
- 1;
4377 while (r
> 0 && !IS_ACTIVE (reg_info
[r
]))
4380 /* If we end up at register zero, that means that we saved
4381 the registers as the result of an `on_failure_jump', not
4382 a `start_memory', and we jumped to past the innermost
4383 `stop_memory'. For example, in ((.)*) we save
4384 registers 1 and 2 as a result of the *, but when we pop
4385 back to the second ), we are at the stop_memory 1.
4386 Thus, nothing is active. */
4389 lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
4390 highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
4393 highest_active_reg
= r
;
4396 /* If just failed to match something this time around with a
4397 group that's operated on by a repetition operator, try to
4398 force exit from the ``loop'', and restore the register
4399 information for this group that we had before trying this
4401 if ((!MATCHED_SOMETHING (reg_info
[*p
])
4402 || just_past_start_mem
== p
- 1)
4405 boolean is_a_jump_n
= false;
4409 switch ((re_opcode_t
) *p1
++)
4413 case pop_failure_jump
:
4414 case maybe_pop_jump
:
4416 case dummy_failure_jump
:
4417 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
4427 /* If the next operation is a jump backwards in the pattern
4428 to an on_failure_jump right before the start_memory
4429 corresponding to this stop_memory, exit from the loop
4430 by forcing a failure after pushing on the stack the
4431 on_failure_jump's jump in the pattern, and d. */
4432 if (mcnt
< 0 && (re_opcode_t
) *p1
== on_failure_jump
4433 && (re_opcode_t
) p1
[3] == start_memory
&& p1
[4] == *p
)
4435 /* If this group ever matched anything, then restore
4436 what its registers were before trying this last
4437 failed match, e.g., with `(a*)*b' against `ab' for
4438 regstart[1], and, e.g., with `((a*)*(b*)*)*'
4439 against `aba' for regend[3].
4441 Also restore the registers for inner groups for,
4442 e.g., `((a*)(b*))*' against `aba' (register 3 would
4443 otherwise get trashed). */
4445 if (EVER_MATCHED_SOMETHING (reg_info
[*p
]))
4449 EVER_MATCHED_SOMETHING (reg_info
[*p
]) = 0;
4451 /* Restore this and inner groups' (if any) registers. */
4452 for (r
= *p
; r
< (unsigned) *p
+ (unsigned) *(p
+ 1);
4455 regstart
[r
] = old_regstart
[r
];
4457 /* xx why this test? */
4458 if (old_regend
[r
] >= regstart
[r
])
4459 regend
[r
] = old_regend
[r
];
4463 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
4464 PUSH_FAILURE_POINT (p1
+ mcnt
, d
, -2);
4470 /* Move past the register number and the inner group count. */
4475 /* \<digit> has been turned into a `duplicate' command which is
4476 followed by the numeric value of <digit> as the register number. */
4479 register const char *d2
, *dend2
;
4480 int regno
= *p
++; /* Get which register to match against. */
4481 DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno
);
4483 /* Can't back reference a group which we've never matched. */
4484 if (REG_UNSET (regstart
[regno
]) || REG_UNSET (regend
[regno
]))
4487 /* Where in input to try to start matching. */
4488 d2
= regstart
[regno
];
4490 /* Where to stop matching; if both the place to start and
4491 the place to stop matching are in the same string, then
4492 set to the place to stop, otherwise, for now have to use
4493 the end of the first string. */
4495 dend2
= ((FIRST_STRING_P (regstart
[regno
])
4496 == FIRST_STRING_P (regend
[regno
]))
4497 ? regend
[regno
] : end_match_1
);
4500 /* If necessary, advance to next segment in register
4504 if (dend2
== end_match_2
) break;
4505 if (dend2
== regend
[regno
]) break;
4507 /* End of string1 => advance to string2. */
4509 dend2
= regend
[regno
];
4511 /* At end of register contents => success */
4512 if (d2
== dend2
) break;
4514 /* If necessary, advance to next segment in data. */
4517 /* How many characters left in this segment to match. */
4520 /* Want how many consecutive characters we can match in
4521 one shot, so, if necessary, adjust the count. */
4522 if (mcnt
> dend2
- d2
)
4525 /* Compare that many; failure if mismatch, else move
4528 ? bcmp_translate (d
, d2
, mcnt
, translate
)
4529 : memcmp (d
, d2
, mcnt
))
4531 d
+= mcnt
, d2
+= mcnt
;
4533 /* Do this because we've match some characters. */
4534 SET_REGS_MATCHED ();
4540 /* begline matches the empty string at the beginning of the string
4541 (unless `not_bol' is set in `bufp'), and, if
4542 `newline_anchor' is set, after newlines. */
4544 DEBUG_PRINT1 ("EXECUTING begline.\n");
4546 if (AT_STRINGS_BEG (d
))
4548 if (!bufp
->not_bol
) break;
4550 else if (d
[-1] == '\n' && bufp
->newline_anchor
)
4554 /* In all other cases, we fail. */
4558 /* endline is the dual of begline. */
4560 DEBUG_PRINT1 ("EXECUTING endline.\n");
4562 if (AT_STRINGS_END (d
))
4564 if (!bufp
->not_eol
) break;
4567 /* We have to ``prefetch'' the next character. */
4568 else if ((d
== end1
? *string2
: *d
) == '\n'
4569 && bufp
->newline_anchor
)
4576 /* Match at the very beginning of the data. */
4578 DEBUG_PRINT1 ("EXECUTING begbuf.\n");
4579 if (AT_STRINGS_BEG (d
))
4584 /* Match at the very end of the data. */
4586 DEBUG_PRINT1 ("EXECUTING endbuf.\n");
4587 if (AT_STRINGS_END (d
))
4592 /* on_failure_keep_string_jump is used to optimize `.*\n'. It
4593 pushes NULL as the value for the string on the stack. Then
4594 `pop_failure_point' will keep the current value for the
4595 string, instead of restoring it. To see why, consider
4596 matching `foo\nbar' against `.*\n'. The .* matches the foo;
4597 then the . fails against the \n. But the next thing we want
4598 to do is match the \n against the \n; if we restored the
4599 string value, we would be back at the foo.
4601 Because this is used only in specific cases, we don't need to
4602 check all the things that `on_failure_jump' does, to make
4603 sure the right things get saved on the stack. Hence we don't
4604 share its code. The only reason to push anything on the
4605 stack at all is that otherwise we would have to change
4606 `anychar's code to do something besides goto fail in this
4607 case; that seems worse than this. */
4608 case on_failure_keep_string_jump
:
4609 DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump");
4611 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4613 DEBUG_PRINT3 (" %d (to %p):\n", mcnt
, p
+ mcnt
);
4615 DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt
, p
+ mcnt
);
4618 PUSH_FAILURE_POINT (p
+ mcnt
, NULL
, -2);
4622 /* Uses of on_failure_jump:
4624 Each alternative starts with an on_failure_jump that points
4625 to the beginning of the next alternative. Each alternative
4626 except the last ends with a jump that in effect jumps past
4627 the rest of the alternatives. (They really jump to the
4628 ending jump of the following alternative, because tensioning
4629 these jumps is a hassle.)
4631 Repeats start with an on_failure_jump that points past both
4632 the repetition text and either the following jump or
4633 pop_failure_jump back to this on_failure_jump. */
4634 case on_failure_jump
:
4636 DEBUG_PRINT1 ("EXECUTING on_failure_jump");
4638 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4640 DEBUG_PRINT3 (" %d (to %p)", mcnt
, p
+ mcnt
);
4642 DEBUG_PRINT3 (" %d (to 0x%x)", mcnt
, p
+ mcnt
);
4645 /* If this on_failure_jump comes right before a group (i.e.,
4646 the original * applied to a group), save the information
4647 for that group and all inner ones, so that if we fail back
4648 to this point, the group's information will be correct.
4649 For example, in \(a*\)*\1, we need the preceding group,
4650 and in \(zz\(a*\)b*\)\2, we need the inner group. */
4652 /* We can't use `p' to check ahead because we push
4653 a failure point to `p + mcnt' after we do this. */
4656 /* We need to skip no_op's before we look for the
4657 start_memory in case this on_failure_jump is happening as
4658 the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
4660 while (p1
< pend
&& (re_opcode_t
) *p1
== no_op
)
4663 if (p1
< pend
&& (re_opcode_t
) *p1
== start_memory
)
4665 /* We have a new highest active register now. This will
4666 get reset at the start_memory we are about to get to,
4667 but we will have saved all the registers relevant to
4668 this repetition op, as described above. */
4669 highest_active_reg
= *(p1
+ 1) + *(p1
+ 2);
4670 if (lowest_active_reg
== NO_LOWEST_ACTIVE_REG
)
4671 lowest_active_reg
= *(p1
+ 1);
4674 DEBUG_PRINT1 (":\n");
4675 PUSH_FAILURE_POINT (p
+ mcnt
, d
, -2);
4679 /* A smart repeat ends with `maybe_pop_jump'.
4680 We change it to either `pop_failure_jump' or `jump'. */
4681 case maybe_pop_jump
:
4682 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4683 DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt
);
4685 register unsigned char *p2
= p
;
4687 /* Compare the beginning of the repeat with what in the
4688 pattern follows its end. If we can establish that there
4689 is nothing that they would both match, i.e., that we
4690 would have to backtrack because of (as in, e.g., `a*a')
4691 then we can change to pop_failure_jump, because we'll
4692 never have to backtrack.
4694 This is not true in the case of alternatives: in
4695 `(a|ab)*' we do need to backtrack to the `ab' alternative
4696 (e.g., if the string was `ab'). But instead of trying to
4697 detect that here, the alternative has put on a dummy
4698 failure point which is what we will end up popping. */
4700 /* Skip over open/close-group commands.
4701 If what follows this loop is a ...+ construct,
4702 look at what begins its body, since we will have to
4703 match at least one of that. */
4707 && ((re_opcode_t
) *p2
== stop_memory
4708 || (re_opcode_t
) *p2
== start_memory
))
4710 else if (p2
+ 6 < pend
4711 && (re_opcode_t
) *p2
== dummy_failure_jump
)
4718 /* p1[0] ... p1[2] are the `on_failure_jump' corresponding
4719 to the `maybe_finalize_jump' of this case. Examine what
4722 /* If we're at the end of the pattern, we can change. */
4725 /* Consider what happens when matching ":\(.*\)"
4726 against ":/". I don't really understand this code
4728 p
[-3] = (unsigned char) pop_failure_jump
;
4730 (" End of pattern: change to `pop_failure_jump'.\n");
4733 else if ((re_opcode_t
) *p2
== exactn
4734 || (bufp
->newline_anchor
&& (re_opcode_t
) *p2
== endline
))
4736 register unsigned char c
4737 = *p2
== (unsigned char) endline
? '\n' : p2
[2];
4739 if ((re_opcode_t
) p1
[3] == exactn
&& p1
[5] != c
)
4741 p
[-3] = (unsigned char) pop_failure_jump
;
4742 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
4746 else if ((re_opcode_t
) p1
[3] == charset
4747 || (re_opcode_t
) p1
[3] == charset_not
)
4749 int not = (re_opcode_t
) p1
[3] == charset_not
;
4751 if (c
< (unsigned char) (p1
[4] * BYTEWIDTH
)
4752 && p1
[5 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
4755 /* `not' is equal to 1 if c would match, which means
4756 that we can't change to pop_failure_jump. */
4759 p
[-3] = (unsigned char) pop_failure_jump
;
4760 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4764 else if ((re_opcode_t
) *p2
== charset
)
4767 register unsigned char c
4768 = *p2
== (unsigned char) endline
? '\n' : p2
[2];
4772 if ((re_opcode_t
) p1
[3] == exactn
4773 && ! ((int) p2
[1] * BYTEWIDTH
> (int) p1
[5]
4774 && (p2
[2 + p1
[5] / BYTEWIDTH
]
4775 & (1 << (p1
[5] % BYTEWIDTH
)))))
4777 if ((re_opcode_t
) p1
[3] == exactn
4778 && ! ((int) p2
[1] * BYTEWIDTH
> (int) p1
[4]
4779 && (p2
[2 + p1
[4] / BYTEWIDTH
]
4780 & (1 << (p1
[4] % BYTEWIDTH
)))))
4783 p
[-3] = (unsigned char) pop_failure_jump
;
4784 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
4788 else if ((re_opcode_t
) p1
[3] == charset_not
)
4791 /* We win if the charset_not inside the loop
4792 lists every character listed in the charset after. */
4793 for (idx
= 0; idx
< (int) p2
[1]; idx
++)
4794 if (! (p2
[2 + idx
] == 0
4795 || (idx
< (int) p1
[4]
4796 && ((p2
[2 + idx
] & ~ p1
[5 + idx
]) == 0))))
4801 p
[-3] = (unsigned char) pop_failure_jump
;
4802 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4805 else if ((re_opcode_t
) p1
[3] == charset
)
4808 /* We win if the charset inside the loop
4809 has no overlap with the one after the loop. */
4811 idx
< (int) p2
[1] && idx
< (int) p1
[4];
4813 if ((p2
[2 + idx
] & p1
[5 + idx
]) != 0)
4816 if (idx
== p2
[1] || idx
== p1
[4])
4818 p
[-3] = (unsigned char) pop_failure_jump
;
4819 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4824 p
-= 2; /* Point at relative address again. */
4825 if ((re_opcode_t
) p
[-1] != pop_failure_jump
)
4827 p
[-1] = (unsigned char) jump
;
4828 DEBUG_PRINT1 (" Match => jump.\n");
4829 goto unconditional_jump
;
4831 /* Note fall through. */
4834 /* The end of a simple repeat has a pop_failure_jump back to
4835 its matching on_failure_jump, where the latter will push a
4836 failure point. The pop_failure_jump takes off failure
4837 points put on by this pop_failure_jump's matching
4838 on_failure_jump; we got through the pattern to here from the
4839 matching on_failure_jump, so didn't fail. */
4840 case pop_failure_jump
:
4842 /* We need to pass separate storage for the lowest and
4843 highest registers, even though we don't care about the
4844 actual values. Otherwise, we will restore only one
4845 register from the stack, since lowest will == highest in
4846 `pop_failure_point'. */
4847 active_reg_t dummy_low_reg
, dummy_high_reg
;
4848 unsigned char *pdummy
;
4851 DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n");
4852 POP_FAILURE_POINT (sdummy
, pdummy
,
4853 dummy_low_reg
, dummy_high_reg
,
4854 reg_dummy
, reg_dummy
, reg_info_dummy
);
4856 /* Note fall through. */
4860 DEBUG_PRINT2 ("\n%p: ", p
);
4862 DEBUG_PRINT2 ("\n0x%x: ", p
);
4864 /* Note fall through. */
4866 /* Unconditionally jump (without popping any failure points). */
4868 EXTRACT_NUMBER_AND_INCR (mcnt
, p
); /* Get the amount to jump. */
4869 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt
);
4870 p
+= mcnt
; /* Do the jump. */
4872 DEBUG_PRINT2 ("(to %p).\n", p
);
4874 DEBUG_PRINT2 ("(to 0x%x).\n", p
);
4879 /* We need this opcode so we can detect where alternatives end
4880 in `group_match_null_string_p' et al. */
4882 DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n");
4883 goto unconditional_jump
;
4886 /* Normally, the on_failure_jump pushes a failure point, which
4887 then gets popped at pop_failure_jump. We will end up at
4888 pop_failure_jump, also, and with a pattern of, say, `a+', we
4889 are skipping over the on_failure_jump, so we have to push
4890 something meaningless for pop_failure_jump to pop. */
4891 case dummy_failure_jump
:
4892 DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n");
4893 /* It doesn't matter what we push for the string here. What
4894 the code at `fail' tests is the value for the pattern. */
4895 PUSH_FAILURE_POINT (NULL
, NULL
, -2);
4896 goto unconditional_jump
;
4899 /* At the end of an alternative, we need to push a dummy failure
4900 point in case we are followed by a `pop_failure_jump', because
4901 we don't want the failure point for the alternative to be
4902 popped. For example, matching `(a|ab)*' against `aab'
4903 requires that we match the `ab' alternative. */
4904 case push_dummy_failure
:
4905 DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n");
4906 /* See comments just above at `dummy_failure_jump' about the
4908 PUSH_FAILURE_POINT (NULL
, NULL
, -2);
4911 /* Have to succeed matching what follows at least n times.
4912 After that, handle like `on_failure_jump'. */
4914 EXTRACT_NUMBER (mcnt
, p
+ 2);
4915 DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt
);
4918 /* Originally, this is how many times we HAVE to succeed. */
4923 STORE_NUMBER_AND_INCR (p
, mcnt
);
4925 DEBUG_PRINT3 (" Setting %p to %d.\n", p
- 2, mcnt
);
4927 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p
- 2, mcnt
);
4933 DEBUG_PRINT2 (" Setting two bytes from %p to no_op.\n", p
+2);
4935 DEBUG_PRINT2 (" Setting two bytes from 0x%x to no_op.\n", p
+2);
4937 p
[2] = (unsigned char) no_op
;
4938 p
[3] = (unsigned char) no_op
;
4944 EXTRACT_NUMBER (mcnt
, p
+ 2);
4945 DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt
);
4947 /* Originally, this is how many times we CAN jump. */
4951 STORE_NUMBER (p
+ 2, mcnt
);
4953 DEBUG_PRINT3 (" Setting %p to %d.\n", p
+ 2, mcnt
);
4955 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p
+ 2, mcnt
);
4957 goto unconditional_jump
;
4959 /* If don't have to jump any more, skip over the rest of command. */
4966 DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
4968 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4970 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4972 DEBUG_PRINT3 (" Setting %p to %d.\n", p1
, mcnt
);
4974 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p1
, mcnt
);
4976 STORE_NUMBER (p1
, mcnt
);
4981 /* The DEC Alpha C compiler 3.x generates incorrect code for the
4982 test WORDCHAR_P (d - 1) != WORDCHAR_P (d) in the expansion of
4983 AT_WORD_BOUNDARY, so this code is disabled. Expanding the
4984 macro and introducing temporary variables works around the bug. */
4987 DEBUG_PRINT1 ("EXECUTING wordbound.\n");
4988 if (AT_WORD_BOUNDARY (d
))
4993 DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
4994 if (AT_WORD_BOUNDARY (d
))
5000 boolean prevchar
, thischar
;
5002 DEBUG_PRINT1 ("EXECUTING wordbound.\n");
5003 if (AT_STRINGS_BEG (d
) || AT_STRINGS_END (d
))
5006 prevchar
= WORDCHAR_P (d
- 1);
5007 thischar
= WORDCHAR_P (d
);
5008 if (prevchar
!= thischar
)
5015 boolean prevchar
, thischar
;
5017 DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
5018 if (AT_STRINGS_BEG (d
) || AT_STRINGS_END (d
))
5021 prevchar
= WORDCHAR_P (d
- 1);
5022 thischar
= WORDCHAR_P (d
);
5023 if (prevchar
!= thischar
)
5030 DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
5031 if (WORDCHAR_P (d
) && (AT_STRINGS_BEG (d
) || !WORDCHAR_P (d
- 1)))
5036 DEBUG_PRINT1 ("EXECUTING wordend.\n");
5037 if (!AT_STRINGS_BEG (d
) && WORDCHAR_P (d
- 1)
5038 && (!WORDCHAR_P (d
) || AT_STRINGS_END (d
)))
5044 DEBUG_PRINT1 ("EXECUTING before_dot.\n");
5045 if (PTR_CHAR_POS ((unsigned char *) d
) >= point
)
5050 DEBUG_PRINT1 ("EXECUTING at_dot.\n");
5051 if (PTR_CHAR_POS ((unsigned char *) d
) != point
)
5056 DEBUG_PRINT1 ("EXECUTING after_dot.\n");
5057 if (PTR_CHAR_POS ((unsigned char *) d
) <= point
)
5062 DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt
);
5067 DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n");
5071 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */
5073 if (SYNTAX (d
[-1]) != (enum syntaxcode
) mcnt
)
5075 SET_REGS_MATCHED ();
5079 DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt
);
5081 goto matchnotsyntax
;
5084 DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n");
5088 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */
5090 if (SYNTAX (d
[-1]) == (enum syntaxcode
) mcnt
)
5092 SET_REGS_MATCHED ();
5095 #else /* not emacs */
5097 DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n");
5099 if (!WORDCHAR_P (d
))
5101 SET_REGS_MATCHED ();
5106 DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n");
5110 SET_REGS_MATCHED ();
5113 #endif /* not emacs */
5118 continue; /* Successfully executed one pattern command; keep going. */
5121 /* We goto here if a matching operation fails. */
5123 if (!FAIL_STACK_EMPTY ())
5124 { /* A restart point is known. Restore to that state. */
5125 DEBUG_PRINT1 ("\nFAIL:\n");
5126 POP_FAILURE_POINT (d
, p
,
5127 lowest_active_reg
, highest_active_reg
,
5128 regstart
, regend
, reg_info
);
5130 /* If this failure point is a dummy, try the next one. */
5134 /* If we failed to the end of the pattern, don't examine *p. */
5138 boolean is_a_jump_n
= false;
5140 /* If failed to a backwards jump that's part of a repetition
5141 loop, need to pop this failure point and use the next one. */
5142 switch ((re_opcode_t
) *p
)
5146 case maybe_pop_jump
:
5147 case pop_failure_jump
:
5150 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5153 if ((is_a_jump_n
&& (re_opcode_t
) *p1
== succeed_n
)
5155 && (re_opcode_t
) *p1
== on_failure_jump
))
5163 if (d
>= string1
&& d
<= end1
)
5167 break; /* Matching at this starting point really fails. */
5171 goto restore_best_regs
;
5175 return -1; /* Failure to match. */
5178 /* Subroutine definitions for re_match_2. */
5181 /* We are passed P pointing to a register number after a start_memory.
5183 Return true if the pattern up to the corresponding stop_memory can
5184 match the empty string, and false otherwise.
5186 If we find the matching stop_memory, sets P to point to one past its number.
5187 Otherwise, sets P to an undefined byte less than or equal to END.
5189 We don't handle duplicates properly (yet). */
5192 group_match_null_string_p (p
, end
, reg_info
)
5193 unsigned char **p
, *end
;
5194 register_info_type
*reg_info
;
5197 /* Point to after the args to the start_memory. */
5198 unsigned char *p1
= *p
+ 2;
5202 /* Skip over opcodes that can match nothing, and return true or
5203 false, as appropriate, when we get to one that can't, or to the
5204 matching stop_memory. */
5206 switch ((re_opcode_t
) *p1
)
5208 /* Could be either a loop or a series of alternatives. */
5209 case on_failure_jump
:
5211 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5213 /* If the next operation is not a jump backwards in the
5218 /* Go through the on_failure_jumps of the alternatives,
5219 seeing if any of the alternatives cannot match nothing.
5220 The last alternative starts with only a jump,
5221 whereas the rest start with on_failure_jump and end
5222 with a jump, e.g., here is the pattern for `a|b|c':
5224 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6
5225 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3
5228 So, we have to first go through the first (n-1)
5229 alternatives and then deal with the last one separately. */
5232 /* Deal with the first (n-1) alternatives, which start
5233 with an on_failure_jump (see above) that jumps to right
5234 past a jump_past_alt. */
5236 while ((re_opcode_t
) p1
[mcnt
-3] == jump_past_alt
)
5238 /* `mcnt' holds how many bytes long the alternative
5239 is, including the ending `jump_past_alt' and
5242 if (!alt_match_null_string_p (p1
, p1
+ mcnt
- 3,
5246 /* Move to right after this alternative, including the
5250 /* Break if it's the beginning of an n-th alternative
5251 that doesn't begin with an on_failure_jump. */
5252 if ((re_opcode_t
) *p1
!= on_failure_jump
)
5255 /* Still have to check that it's not an n-th
5256 alternative that starts with an on_failure_jump. */
5258 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5259 if ((re_opcode_t
) p1
[mcnt
-3] != jump_past_alt
)
5261 /* Get to the beginning of the n-th alternative. */
5267 /* Deal with the last alternative: go back and get number
5268 of the `jump_past_alt' just before it. `mcnt' contains
5269 the length of the alternative. */
5270 EXTRACT_NUMBER (mcnt
, p1
- 2);
5272 if (!alt_match_null_string_p (p1
, p1
+ mcnt
, reg_info
))
5275 p1
+= mcnt
; /* Get past the n-th alternative. */
5281 assert (p1
[1] == **p
);
5287 if (!common_op_match_null_string_p (&p1
, end
, reg_info
))
5290 } /* while p1 < end */
5293 } /* group_match_null_string_p */
5296 /* Similar to group_match_null_string_p, but doesn't deal with alternatives:
5297 It expects P to be the first byte of a single alternative and END one
5298 byte past the last. The alternative can contain groups. */
5301 alt_match_null_string_p (p
, end
, reg_info
)
5302 unsigned char *p
, *end
;
5303 register_info_type
*reg_info
;
5306 unsigned char *p1
= p
;
5310 /* Skip over opcodes that can match nothing, and break when we get
5311 to one that can't. */
5313 switch ((re_opcode_t
) *p1
)
5316 case on_failure_jump
:
5318 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5323 if (!common_op_match_null_string_p (&p1
, end
, reg_info
))
5326 } /* while p1 < end */
5329 } /* alt_match_null_string_p */
5332 /* Deals with the ops common to group_match_null_string_p and
5333 alt_match_null_string_p.
5335 Sets P to one after the op and its arguments, if any. */
5338 common_op_match_null_string_p (p
, end
, reg_info
)
5339 unsigned char **p
, *end
;
5340 register_info_type
*reg_info
;
5345 unsigned char *p1
= *p
;
5347 switch ((re_opcode_t
) *p1
++)
5367 assert (reg_no
> 0 && reg_no
<= MAX_REGNUM
);
5368 ret
= group_match_null_string_p (&p1
, end
, reg_info
);
5370 /* Have to set this here in case we're checking a group which
5371 contains a group and a back reference to it. */
5373 if (REG_MATCH_NULL_STRING_P (reg_info
[reg_no
]) == MATCH_NULL_UNSET_VALUE
)
5374 REG_MATCH_NULL_STRING_P (reg_info
[reg_no
]) = ret
;
5380 /* If this is an optimized succeed_n for zero times, make the jump. */
5382 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5390 /* Get to the number of times to succeed. */
5392 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5397 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5405 if (!REG_MATCH_NULL_STRING_P (reg_info
[*p1
]))
5413 /* All other opcodes mean we cannot match the empty string. */
5419 } /* common_op_match_null_string_p */
5422 /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
5423 bytes; nonzero otherwise. */
5426 bcmp_translate (s1
, s2
, len
, translate
)
5427 const char *s1
, *s2
;
5429 RE_TRANSLATE_TYPE translate
;
5431 register const unsigned char *p1
= (const unsigned char *) s1
;
5432 register const unsigned char *p2
= (const unsigned char *) s2
;
5435 if (translate
[*p1
++] != translate
[*p2
++]) return 1;
5441 /* Entry points for GNU code. */
5443 /* re_compile_pattern is the GNU regular expression compiler: it
5444 compiles PATTERN (of length SIZE) and puts the result in BUFP.
5445 Returns 0 if the pattern was valid, otherwise an error string.
5447 Assumes the `allocated' (and perhaps `buffer') and `translate' fields
5448 are set in BUFP on entry.
5450 We call regex_compile to do the actual compilation. */
5453 re_compile_pattern (pattern
, length
, bufp
)
5454 const char *pattern
;
5456 struct re_pattern_buffer
*bufp
;
5460 /* GNU code is written to assume at least RE_NREGS registers will be set
5461 (and at least one extra will be -1). */
5462 bufp
->regs_allocated
= REGS_UNALLOCATED
;
5464 /* And GNU code determines whether or not to get register information
5465 by passing null for the REGS argument to re_match, etc., not by
5469 /* Match anchors at newline. */
5470 bufp
->newline_anchor
= 1;
5472 ret
= regex_compile (pattern
, length
, re_syntax_options
, bufp
);
5476 return gettext (re_error_msgid
[(int) ret
]);
5479 weak_alias (__re_compile_pattern
, re_compile_pattern
)
5482 /* Entry points compatible with 4.2 BSD regex library. We don't define
5483 them unless specifically requested. */
5485 #if defined _REGEX_RE_COMP || defined _LIBC
5487 /* BSD has one and only one pattern buffer. */
5488 static struct re_pattern_buffer re_comp_buf
;
5492 /* Make these definitions weak in libc, so POSIX programs can redefine
5493 these names if they don't use our functions, and still use
5494 regcomp/regexec below without link errors. */
5504 if (!re_comp_buf
.buffer
)
5505 return gettext ("No previous regular expression");
5509 if (!re_comp_buf
.buffer
)
5511 re_comp_buf
.buffer
= (unsigned char *) malloc (200);
5512 if (re_comp_buf
.buffer
== NULL
)
5513 return gettext (re_error_msgid
[(int) REG_ESPACE
]);
5514 re_comp_buf
.allocated
= 200;
5516 re_comp_buf
.fastmap
= (char *) malloc (1 << BYTEWIDTH
);
5517 if (re_comp_buf
.fastmap
== NULL
)
5518 return gettext (re_error_msgid
[(int) REG_ESPACE
]);
5521 /* Since `re_exec' always passes NULL for the `regs' argument, we
5522 don't need to initialize the pattern buffer fields which affect it. */
5524 /* Match anchors at newlines. */
5525 re_comp_buf
.newline_anchor
= 1;
5527 ret
= regex_compile (s
, strlen (s
), re_syntax_options
, &re_comp_buf
);
5532 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
5533 return (char *) gettext (re_error_msgid
[(int) ret
]);
5544 const int len
= strlen (s
);
5546 0 <= re_search (&re_comp_buf
, s
, len
, 0, len
, (struct re_registers
*) 0);
5549 #endif /* _REGEX_RE_COMP */
5551 /* POSIX.2 functions. Don't define these for Emacs. */
5555 /* regcomp takes a regular expression as a string and compiles it.
5557 PREG is a regex_t *. We do not expect any fields to be initialized,
5558 since POSIX says we shouldn't. Thus, we set
5560 `buffer' to the compiled pattern;
5561 `used' to the length of the compiled pattern;
5562 `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
5563 REG_EXTENDED bit in CFLAGS is set; otherwise, to
5564 RE_SYNTAX_POSIX_BASIC;
5565 `newline_anchor' to REG_NEWLINE being set in CFLAGS;
5566 `fastmap' and `fastmap_accurate' to zero;
5567 `re_nsub' to the number of subexpressions in PATTERN.
5569 PATTERN is the address of the pattern string.
5571 CFLAGS is a series of bits which affect compilation.
5573 If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
5574 use POSIX basic syntax.
5576 If REG_NEWLINE is set, then . and [^...] don't match newline.
5577 Also, regexec will try a match beginning after every newline.
5579 If REG_ICASE is set, then we considers upper- and lowercase
5580 versions of letters to be equivalent when matching.
5582 If REG_NOSUB is set, then when PREG is passed to regexec, that
5583 routine will report only success or failure, and nothing about the
5586 It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for
5587 the return codes and their meanings.) */
5590 regcomp (preg
, pattern
, cflags
)
5592 const char *pattern
;
5597 = (cflags
& REG_EXTENDED
) ?
5598 RE_SYNTAX_POSIX_EXTENDED
: RE_SYNTAX_POSIX_BASIC
;
5600 /* regex_compile will allocate the space for the compiled pattern. */
5602 preg
->allocated
= 0;
5605 /* Don't bother to use a fastmap when searching. This simplifies the
5606 REG_NEWLINE case: if we used a fastmap, we'd have to put all the
5607 characters after newlines into the fastmap. This way, we just try
5611 if (cflags
& REG_ICASE
)
5616 = (RE_TRANSLATE_TYPE
) malloc (CHAR_SET_SIZE
5617 * sizeof (*(RE_TRANSLATE_TYPE
)0));
5618 if (preg
->translate
== NULL
)
5619 return (int) REG_ESPACE
;
5621 /* Map uppercase characters to corresponding lowercase ones. */
5622 for (i
= 0; i
< CHAR_SET_SIZE
; i
++)
5623 preg
->translate
[i
] = ISUPPER (i
) ? tolower (i
) : i
;
5626 preg
->translate
= NULL
;
5628 /* If REG_NEWLINE is set, newlines are treated differently. */
5629 if (cflags
& REG_NEWLINE
)
5630 { /* REG_NEWLINE implies neither . nor [^...] match newline. */
5631 syntax
&= ~RE_DOT_NEWLINE
;
5632 syntax
|= RE_HAT_LISTS_NOT_NEWLINE
;
5633 /* It also changes the matching behavior. */
5634 preg
->newline_anchor
= 1;
5637 preg
->newline_anchor
= 0;
5639 preg
->no_sub
= !!(cflags
& REG_NOSUB
);
5641 /* POSIX says a null character in the pattern terminates it, so we
5642 can use strlen here in compiling the pattern. */
5643 ret
= regex_compile (pattern
, strlen (pattern
), syntax
, preg
);
5645 /* POSIX doesn't distinguish between an unmatched open-group and an
5646 unmatched close-group: both are REG_EPAREN. */
5647 if (ret
== REG_ERPAREN
) ret
= REG_EPAREN
;
5652 weak_alias (__regcomp
, regcomp
)
5656 /* regexec searches for a given pattern, specified by PREG, in the
5659 If NMATCH is zero or REG_NOSUB was set in the cflags argument to
5660 `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at
5661 least NMATCH elements, and we set them to the offsets of the
5662 corresponding matched substrings.
5664 EFLAGS specifies `execution flags' which affect matching: if
5665 REG_NOTBOL is set, then ^ does not match at the beginning of the
5666 string; if REG_NOTEOL is set, then $ does not match at the end.
5668 We return 0 if we find a match and REG_NOMATCH if not. */
5671 regexec (preg
, string
, nmatch
, pmatch
, eflags
)
5672 const regex_t
*preg
;
5675 regmatch_t pmatch
[];
5679 struct re_registers regs
;
5680 regex_t private_preg
;
5681 int len
= strlen (string
);
5682 boolean want_reg_info
= !preg
->no_sub
&& nmatch
> 0;
5684 private_preg
= *preg
;
5686 private_preg
.not_bol
= !!(eflags
& REG_NOTBOL
);
5687 private_preg
.not_eol
= !!(eflags
& REG_NOTEOL
);
5689 /* The user has told us exactly how many registers to return
5690 information about, via `nmatch'. We have to pass that on to the
5691 matching routines. */
5692 private_preg
.regs_allocated
= REGS_FIXED
;
5696 regs
.num_regs
= nmatch
;
5697 regs
.start
= TALLOC (nmatch
, regoff_t
);
5698 regs
.end
= TALLOC (nmatch
, regoff_t
);
5699 if (regs
.start
== NULL
|| regs
.end
== NULL
)
5700 return (int) REG_NOMATCH
;
5703 /* Perform the searching operation. */
5704 ret
= re_search (&private_preg
, string
, len
,
5705 /* start: */ 0, /* range: */ len
,
5706 want_reg_info
? ®s
: (struct re_registers
*) 0);
5708 /* Copy the register information to the POSIX structure. */
5715 for (r
= 0; r
< nmatch
; r
++)
5717 pmatch
[r
].rm_so
= regs
.start
[r
];
5718 pmatch
[r
].rm_eo
= regs
.end
[r
];
5722 /* If we needed the temporary register info, free the space now. */
5727 /* We want zero return to mean success, unlike `re_search'. */
5728 return ret
>= 0 ? (int) REG_NOERROR
: (int) REG_NOMATCH
;
5731 weak_alias (__regexec
, regexec
)
5735 /* Returns a message corresponding to an error code, ERRCODE, returned
5736 from either regcomp or regexec. We don't use PREG here. */
5739 __regerror (errcode
, preg
, errbuf
, errbuf_size
)
5741 const regex_t
*preg
;
5749 || errcode
>= (int) (sizeof (re_error_msgid
)
5750 / sizeof (re_error_msgid
[0])))
5751 /* Only error codes returned by the rest of the code should be passed
5752 to this routine. If we are given anything else, or if other regex
5753 code generates an invalid error code, then the program has a bug.
5754 Dump core so we can fix it. */
5757 msg
= gettext (re_error_msgid
[errcode
]);
5759 msg_size
= strlen (msg
) + 1; /* Includes the null. */
5761 if (errbuf_size
!= 0)
5763 if (msg_size
> errbuf_size
)
5765 #if defined HAVE_MEMPCPY || defined _LIBC
5766 *((char *) __mempcpy (errbuf
, msg
, errbuf_size
- 1)) = '\0';
5768 memcpy (errbuf
, msg
, errbuf_size
- 1);
5769 errbuf
[errbuf_size
- 1] = 0;
5773 memcpy (errbuf
, msg
, msg_size
);
5779 weak_alias (__regerror
, regerror
)
5783 /* Free dynamically allocated space used by PREG. */
5789 if (preg
->buffer
!= NULL
)
5790 free (preg
->buffer
);
5791 preg
->buffer
= NULL
;
5793 preg
->allocated
= 0;
5796 if (preg
->fastmap
!= NULL
)
5797 free (preg
->fastmap
);
5798 preg
->fastmap
= NULL
;
5799 preg
->fastmap_accurate
= 0;
5801 if (preg
->translate
!= NULL
)
5802 free (preg
->translate
);
5803 preg
->translate
= NULL
;
5806 weak_alias (__regfree
, regfree
)
5809 #endif /* not emacs */