1 /* Extended regular expression matching and search library, version
2 0.12. (Implements POSIX draft P1003.2/D11.2, except for some of the
3 internationalization features.)
5 Copyright (C) 1993,94,95,96,97,98,99,2000,04 Free Software Foundation, Inc.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
23 - structure the opcode space into opcode+flag.
24 - merge with glibc's regex.[ch].
25 - replace (succeed_n + jump_n + set_number_at) with something that doesn't
26 need to modify the compiled regexp so that re_match can be reentrant.
27 - get rid of on_failure_jump_smart by doing the optimization in re_comp
28 rather than at run-time, so that re_match can be reentrant.
31 /* AIX requires this to be the first thing in the file. */
32 #if defined _AIX && !defined REGEX_MALLOC
40 #if defined STDC_HEADERS && !defined emacs
43 /* We need this for `regex.h', and perhaps for the Emacs include files. */
44 # include <sys/types.h>
47 /* Whether to use ISO C Amendment 1 wide char functions.
48 Those should not be used for Emacs since it uses its own. */
50 #define WIDE_CHAR_SUPPORT 1
52 #define WIDE_CHAR_SUPPORT \
53 (HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_BTOWC && !emacs)
56 /* For platform which support the ISO C amendement 1 functionality we
57 support user defined character classes. */
59 /* Solaris 2.5 has a bug: <wchar.h> must be included before <wctype.h>. */
65 /* We have to keep the namespace clean. */
66 # define regfree(preg) __regfree (preg)
67 # define regexec(pr, st, nm, pm, ef) __regexec (pr, st, nm, pm, ef)
68 # define regcomp(preg, pattern, cflags) __regcomp (preg, pattern, cflags)
69 # define regerror(errcode, preg, errbuf, errbuf_size) \
70 __regerror(errcode, preg, errbuf, errbuf_size)
71 # define re_set_registers(bu, re, nu, st, en) \
72 __re_set_registers (bu, re, nu, st, en)
73 # define re_match_2(bufp, string1, size1, string2, size2, pos, regs, stop) \
74 __re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop)
75 # define re_match(bufp, string, size, pos, regs) \
76 __re_match (bufp, string, size, pos, regs)
77 # define re_search(bufp, string, size, startpos, range, regs) \
78 __re_search (bufp, string, size, startpos, range, regs)
79 # define re_compile_pattern(pattern, length, bufp) \
80 __re_compile_pattern (pattern, length, bufp)
81 # define re_set_syntax(syntax) __re_set_syntax (syntax)
82 # define re_search_2(bufp, st1, s1, st2, s2, startpos, range, regs, stop) \
83 __re_search_2 (bufp, st1, s1, st2, s2, startpos, range, regs, stop)
84 # define re_compile_fastmap(bufp) __re_compile_fastmap (bufp)
86 /* Make sure we call libc's function even if the user overrides them. */
87 # define btowc __btowc
88 # define iswctype __iswctype
89 # define wctype __wctype
91 # define WEAK_ALIAS(a,b) weak_alias (a, b)
93 /* We are also using some library internals. */
94 # include <locale/localeinfo.h>
95 # include <locale/elem-hash.h>
96 # include <langinfo.h>
98 # define WEAK_ALIAS(a,b)
101 /* This is for other GNU distributions with internationalized messages. */
102 #if HAVE_LIBINTL_H || defined _LIBC
103 # include <libintl.h>
105 # define gettext(msgid) (msgid)
109 /* This define is so xgettext can find the internationalizable
111 # define gettext_noop(String) String
114 /* The `emacs' switch turns on certain matching commands
115 that make sense only in Emacs. */
121 /* Make syntax table lookup grant data in gl_state. */
122 # define SYNTAX_ENTRY_VIA_PROPERTY
125 # include "charset.h"
126 # include "category.h"
131 # define malloc xmalloc
135 # define realloc xrealloc
141 /* Converts the pointer to the char to BEG-based offset from the start. */
142 # define PTR_TO_OFFSET(d) POS_AS_IN_BUFFER (POINTER_TO_OFFSET (d))
143 # define POS_AS_IN_BUFFER(p) ((p) + (NILP (re_match_object) || BUFFERP (re_match_object)))
145 # define RE_MULTIBYTE_P(bufp) ((bufp)->multibyte)
146 # define RE_STRING_CHAR(p, s) \
147 (multibyte ? (STRING_CHAR (p, s)) : (*(p)))
148 # define RE_STRING_CHAR_AND_LENGTH(p, s, len) \
149 (multibyte ? (STRING_CHAR_AND_LENGTH (p, s, len)) : ((len) = 1, *(p)))
151 /* Set C a (possibly multibyte) character before P. P points into a
152 string which is the virtual concatenation of STR1 (which ends at
153 END1) or STR2 (which ends at END2). */
154 # define GET_CHAR_BEFORE_2(c, p, str1, end1, str2, end2) \
158 re_char *dtemp = (p) == (str2) ? (end1) : (p); \
159 re_char *dlimit = ((p) > (str2) && (p) <= (end2)) ? (str2) : (str1); \
160 re_char *d0 = dtemp; \
161 PREV_CHAR_BOUNDARY (d0, dlimit); \
162 c = STRING_CHAR (d0, dtemp - d0); \
165 (c = ((p) == (str2) ? (end1) : (p))[-1]); \
169 #else /* not emacs */
171 /* If we are not linking with Emacs proper,
172 we can't use the relocating allocator
173 even if config.h says that we can. */
176 # if defined STDC_HEADERS || defined _LIBC
183 /* When used in Emacs's lib-src, we need to get bzero and bcopy somehow.
184 If nothing else has been done, use the method below. */
185 # ifdef INHIBIT_STRING_HEADER
186 # if !(defined HAVE_BZERO && defined HAVE_BCOPY)
187 # if !defined bzero && !defined bcopy
188 # undef INHIBIT_STRING_HEADER
193 /* This is the normal way of making sure we have memcpy, memcmp and bzero.
194 This is used in most programs--a few other programs avoid this
195 by defining INHIBIT_STRING_HEADER. */
196 # ifndef INHIBIT_STRING_HEADER
197 # if defined HAVE_STRING_H || defined STDC_HEADERS || defined _LIBC
201 # define bzero(s, n) (memset (s, '\0', n), (s))
203 # define bzero(s, n) __bzero (s, n)
207 # include <strings.h>
209 # define memcmp(s1, s2, n) bcmp (s1, s2, n)
212 # define memcpy(d, s, n) (bcopy (s, d, n), (d))
217 /* Define the syntax stuff for \<, \>, etc. */
219 /* Sword must be nonzero for the wordchar pattern commands in re_match_2. */
220 enum syntaxcode
{ Swhitespace
= 0, Sword
= 1, Ssymbol
= 2 };
222 # ifdef SWITCH_ENUM_BUG
223 # define SWITCH_ENUM_CAST(x) ((int)(x))
225 # define SWITCH_ENUM_CAST(x) (x)
228 /* Dummy macros for non-Emacs environments. */
229 # define BASE_LEADING_CODE_P(c) (0)
230 # define CHAR_CHARSET(c) 0
231 # define CHARSET_LEADING_CODE_BASE(c) 0
232 # define MAX_MULTIBYTE_LENGTH 1
233 # define RE_MULTIBYTE_P(x) 0
234 # define WORD_BOUNDARY_P(c1, c2) (0)
235 # define CHAR_HEAD_P(p) (1)
236 # define SINGLE_BYTE_CHAR_P(c) (1)
237 # define SAME_CHARSET_P(c1, c2) (1)
238 # define MULTIBYTE_FORM_LENGTH(p, s) (1)
239 # define PREV_CHAR_BOUNDARY(p, limit) ((p)--)
240 # define STRING_CHAR(p, s) (*(p))
241 # define RE_STRING_CHAR STRING_CHAR
242 # define CHAR_STRING(c, s) (*(s) = (c), 1)
243 # define STRING_CHAR_AND_LENGTH(p, s, actual_len) ((actual_len) = 1, *(p))
244 # define RE_STRING_CHAR_AND_LENGTH STRING_CHAR_AND_LENGTH
245 # define GET_CHAR_BEFORE_2(c, p, str1, end1, str2, end2) \
246 (c = ((p) == (str2) ? *((end1) - 1) : *((p) - 1)))
247 # define MAKE_CHAR(charset, c1, c2) (c1)
248 #endif /* not emacs */
251 # define RE_TRANSLATE(TBL, C) ((unsigned char)(TBL)[C])
252 # define RE_TRANSLATE_P(TBL) (TBL)
255 /* Get the interface, including the syntax bits. */
258 /* isalpha etc. are used for the character classes. */
263 /* 1 if C is an ASCII character. */
264 # define IS_REAL_ASCII(c) ((c) < 0200)
266 /* 1 if C is a unibyte character. */
267 # define ISUNIBYTE(c) (SINGLE_BYTE_CHAR_P ((c)))
269 /* The Emacs definitions should not be directly affected by locales. */
271 /* In Emacs, these are only used for single-byte characters. */
272 # define ISDIGIT(c) ((c) >= '0' && (c) <= '9')
273 # define ISCNTRL(c) ((c) < ' ')
274 # define ISXDIGIT(c) (((c) >= '0' && (c) <= '9') \
275 || ((c) >= 'a' && (c) <= 'f') \
276 || ((c) >= 'A' && (c) <= 'F'))
278 /* This is only used for single-byte characters. */
279 # define ISBLANK(c) ((c) == ' ' || (c) == '\t')
281 /* The rest must handle multibyte characters. */
283 # define ISGRAPH(c) (SINGLE_BYTE_CHAR_P (c) \
284 ? (c) > ' ' && !((c) >= 0177 && (c) <= 0237) \
287 # define ISPRINT(c) (SINGLE_BYTE_CHAR_P (c) \
288 ? (c) >= ' ' && !((c) >= 0177 && (c) <= 0237) \
291 # define ISALNUM(c) (IS_REAL_ASCII (c) \
292 ? (((c) >= 'a' && (c) <= 'z') \
293 || ((c) >= 'A' && (c) <= 'Z') \
294 || ((c) >= '0' && (c) <= '9')) \
295 : SYNTAX (c) == Sword)
297 # define ISALPHA(c) (IS_REAL_ASCII (c) \
298 ? (((c) >= 'a' && (c) <= 'z') \
299 || ((c) >= 'A' && (c) <= 'Z')) \
300 : SYNTAX (c) == Sword)
302 # define ISLOWER(c) (LOWERCASEP (c))
304 # define ISPUNCT(c) (IS_REAL_ASCII (c) \
305 ? ((c) > ' ' && (c) < 0177 \
306 && !(((c) >= 'a' && (c) <= 'z') \
307 || ((c) >= 'A' && (c) <= 'Z') \
308 || ((c) >= '0' && (c) <= '9'))) \
309 : SYNTAX (c) != Sword)
311 # define ISSPACE(c) (SYNTAX (c) == Swhitespace)
313 # define ISUPPER(c) (UPPERCASEP (c))
315 # define ISWORD(c) (SYNTAX (c) == Sword)
317 #else /* not emacs */
319 /* Jim Meyering writes:
321 "... Some ctype macros are valid only for character codes that
322 isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when
323 using /bin/cc or gcc but without giving an ansi option). So, all
324 ctype uses should be through macros like ISPRINT... If
325 STDC_HEADERS is defined, then autoconf has verified that the ctype
326 macros don't need to be guarded with references to isascii. ...
327 Defining isascii to 1 should let any compiler worth its salt
328 eliminate the && through constant folding."
329 Solaris defines some of these symbols so we must undefine them first. */
332 # if defined STDC_HEADERS || (!defined isascii && !defined HAVE_ISASCII)
333 # define ISASCII(c) 1
335 # define ISASCII(c) isascii(c)
338 /* 1 if C is an ASCII character. */
339 # define IS_REAL_ASCII(c) ((c) < 0200)
341 /* This distinction is not meaningful, except in Emacs. */
342 # define ISUNIBYTE(c) 1
345 # define ISBLANK(c) (ISASCII (c) && isblank (c))
347 # define ISBLANK(c) ((c) == ' ' || (c) == '\t')
350 # define ISGRAPH(c) (ISASCII (c) && isgraph (c))
352 # define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c))
356 # define ISPRINT(c) (ISASCII (c) && isprint (c))
357 # define ISDIGIT(c) (ISASCII (c) && isdigit (c))
358 # define ISALNUM(c) (ISASCII (c) && isalnum (c))
359 # define ISALPHA(c) (ISASCII (c) && isalpha (c))
360 # define ISCNTRL(c) (ISASCII (c) && iscntrl (c))
361 # define ISLOWER(c) (ISASCII (c) && islower (c))
362 # define ISPUNCT(c) (ISASCII (c) && ispunct (c))
363 # define ISSPACE(c) (ISASCII (c) && isspace (c))
364 # define ISUPPER(c) (ISASCII (c) && isupper (c))
365 # define ISXDIGIT(c) (ISASCII (c) && isxdigit (c))
367 # define ISWORD(c) ISALPHA(c)
370 # define TOLOWER(c) _tolower(c)
372 # define TOLOWER(c) tolower(c)
375 /* How many characters in the character set. */
376 # define CHAR_SET_SIZE 256
380 extern char *re_syntax_table
;
382 # else /* not SYNTAX_TABLE */
384 static char re_syntax_table
[CHAR_SET_SIZE
];
395 bzero (re_syntax_table
, sizeof re_syntax_table
);
397 for (c
= 0; c
< CHAR_SET_SIZE
; ++c
)
399 re_syntax_table
[c
] = Sword
;
401 re_syntax_table
['_'] = Ssymbol
;
406 # endif /* not SYNTAX_TABLE */
408 # define SYNTAX(c) re_syntax_table[(c)]
410 #endif /* not emacs */
413 # define NULL (void *)0
416 /* We remove any previous definition of `SIGN_EXTEND_CHAR',
417 since ours (we hope) works properly with all combinations of
418 machines, compilers, `char' and `unsigned char' argument types.
419 (Per Bothner suggested the basic approach.) */
420 #undef SIGN_EXTEND_CHAR
422 # define SIGN_EXTEND_CHAR(c) ((signed char) (c))
423 #else /* not __STDC__ */
424 /* As in Harbison and Steele. */
425 # define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
428 /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we
429 use `alloca' instead of `malloc'. This is because using malloc in
430 re_search* or re_match* could cause memory leaks when C-g is used in
431 Emacs; also, malloc is slower and causes storage fragmentation. On
432 the other hand, malloc is more portable, and easier to debug.
434 Because we sometimes use alloca, some routines have to be macros,
435 not functions -- `alloca'-allocated space disappears at the end of the
436 function it is called in. */
440 # define REGEX_ALLOCATE malloc
441 # define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize)
442 # define REGEX_FREE free
444 #else /* not REGEX_MALLOC */
446 /* Emacs already defines alloca, sometimes. */
449 /* Make alloca work the best possible way. */
451 # define alloca __builtin_alloca
452 # else /* not __GNUC__ */
455 # endif /* HAVE_ALLOCA_H */
456 # endif /* not __GNUC__ */
458 # endif /* not alloca */
460 # define REGEX_ALLOCATE alloca
462 /* Assumes a `char *destination' variable. */
463 # define REGEX_REALLOCATE(source, osize, nsize) \
464 (destination = (char *) alloca (nsize), \
465 memcpy (destination, source, osize))
467 /* No need to do anything to free, after alloca. */
468 # define REGEX_FREE(arg) ((void)0) /* Do nothing! But inhibit gcc warning. */
470 #endif /* not REGEX_MALLOC */
472 /* Define how to allocate the failure stack. */
474 #if defined REL_ALLOC && defined REGEX_MALLOC
476 # define REGEX_ALLOCATE_STACK(size) \
477 r_alloc (&failure_stack_ptr, (size))
478 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
479 r_re_alloc (&failure_stack_ptr, (nsize))
480 # define REGEX_FREE_STACK(ptr) \
481 r_alloc_free (&failure_stack_ptr)
483 #else /* not using relocating allocator */
487 # define REGEX_ALLOCATE_STACK malloc
488 # define REGEX_REALLOCATE_STACK(source, osize, nsize) realloc (source, nsize)
489 # define REGEX_FREE_STACK free
491 # else /* not REGEX_MALLOC */
493 # define REGEX_ALLOCATE_STACK alloca
495 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
496 REGEX_REALLOCATE (source, osize, nsize)
497 /* No need to explicitly free anything. */
498 # define REGEX_FREE_STACK(arg) ((void)0)
500 # endif /* not REGEX_MALLOC */
501 #endif /* not using relocating allocator */
504 /* True if `size1' is non-NULL and PTR is pointing anywhere inside
505 `string1' or just past its end. This works if PTR is NULL, which is
507 #define FIRST_STRING_P(ptr) \
508 (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
510 /* (Re)Allocate N items of type T using malloc, or fail. */
511 #define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t)))
512 #define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t)))
513 #define RETALLOC_IF(addr, n, t) \
514 if (addr) RETALLOC((addr), (n), t); else (addr) = TALLOC ((n), t)
515 #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
517 #define BYTEWIDTH 8 /* In bits. */
519 #define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
523 #define MAX(a, b) ((a) > (b) ? (a) : (b))
524 #define MIN(a, b) ((a) < (b) ? (a) : (b))
526 /* Type of source-pattern and string chars. */
527 typedef const unsigned char re_char
;
529 typedef char boolean
;
533 static int re_match_2_internal
_RE_ARGS ((struct re_pattern_buffer
*bufp
,
534 re_char
*string1
, int size1
,
535 re_char
*string2
, int size2
,
537 struct re_registers
*regs
,
540 /* These are the command codes that appear in compiled regular
541 expressions. Some opcodes are followed by argument bytes. A
542 command code can specify any interpretation whatsoever for its
543 arguments. Zero bytes may appear in the compiled regular expression. */
549 /* Succeed right away--no more backtracking. */
552 /* Followed by one byte giving n, then by n literal bytes. */
555 /* Matches any (more or less) character. */
558 /* Matches any one char belonging to specified set. First
559 following byte is number of bitmap bytes. Then come bytes
560 for a bitmap saying which chars are in. Bits in each byte
561 are ordered low-bit-first. A character is in the set if its
562 bit is 1. A character too large to have a bit in the map is
563 automatically not in the set.
565 If the length byte has the 0x80 bit set, then that stuff
566 is followed by a range table:
567 2 bytes of flags for character sets (low 8 bits, high 8 bits)
568 See RANGE_TABLE_WORK_BITS below.
569 2 bytes, the number of pairs that follow (upto 32767)
570 pairs, each 2 multibyte characters,
571 each multibyte character represented as 3 bytes. */
574 /* Same parameters as charset, but match any character that is
575 not one of those specified. */
578 /* Start remembering the text that is matched, for storing in a
579 register. Followed by one byte with the register number, in
580 the range 0 to one less than the pattern buffer's re_nsub
584 /* Stop remembering the text that is matched and store it in a
585 memory register. Followed by one byte with the register
586 number, in the range 0 to one less than `re_nsub' in the
590 /* Match a duplicate of something remembered. Followed by one
591 byte containing the register number. */
594 /* Fail unless at beginning of line. */
597 /* Fail unless at end of line. */
600 /* Succeeds if at beginning of buffer (if emacs) or at beginning
601 of string to be matched (if not). */
604 /* Analogously, for end of buffer/string. */
607 /* Followed by two byte relative address to which to jump. */
610 /* Followed by two-byte relative address of place to resume at
611 in case of failure. */
614 /* Like on_failure_jump, but pushes a placeholder instead of the
615 current string position when executed. */
616 on_failure_keep_string_jump
,
618 /* Just like `on_failure_jump', except that it checks that we
619 don't get stuck in an infinite loop (matching an empty string
621 on_failure_jump_loop
,
623 /* Just like `on_failure_jump_loop', except that it checks for
624 a different kind of loop (the kind that shows up with non-greedy
625 operators). This operation has to be immediately preceded
627 on_failure_jump_nastyloop
,
629 /* A smart `on_failure_jump' used for greedy * and + operators.
630 It analyses the loop before which it is put and if the
631 loop does not require backtracking, it changes itself to
632 `on_failure_keep_string_jump' and short-circuits the loop,
633 else it just defaults to changing itself into `on_failure_jump'.
634 It assumes that it is pointing to just past a `jump'. */
635 on_failure_jump_smart
,
637 /* Followed by two-byte relative address and two-byte number n.
638 After matching N times, jump to the address upon failure.
639 Does not work if N starts at 0: use on_failure_jump_loop
643 /* Followed by two-byte relative address, and two-byte number n.
644 Jump to the address N times, then fail. */
647 /* Set the following two-byte relative address to the
648 subsequent two-byte number. The address *includes* the two
652 wordbeg
, /* Succeeds if at word beginning. */
653 wordend
, /* Succeeds if at word end. */
655 wordbound
, /* Succeeds if at a word boundary. */
656 notwordbound
, /* Succeeds if not at a word boundary. */
658 symbeg
, /* Succeeds if at symbol beginning. */
659 symend
, /* Succeeds if at symbol end. */
661 /* Matches any character whose syntax is specified. Followed by
662 a byte which contains a syntax code, e.g., Sword. */
665 /* Matches any character whose syntax is not that specified. */
669 ,before_dot
, /* Succeeds if before point. */
670 at_dot
, /* Succeeds if at point. */
671 after_dot
, /* Succeeds if after point. */
673 /* Matches any character whose category-set contains the specified
674 category. The operator is followed by a byte which contains a
675 category code (mnemonic ASCII character). */
678 /* Matches any character whose category-set does not contain the
679 specified category. The operator is followed by a byte which
680 contains the category code (mnemonic ASCII character). */
685 /* Common operations on the compiled pattern. */
687 /* Store NUMBER in two contiguous bytes starting at DESTINATION. */
689 #define STORE_NUMBER(destination, number) \
691 (destination)[0] = (number) & 0377; \
692 (destination)[1] = (number) >> 8; \
695 /* Same as STORE_NUMBER, except increment DESTINATION to
696 the byte after where the number is stored. Therefore, DESTINATION
697 must be an lvalue. */
699 #define STORE_NUMBER_AND_INCR(destination, number) \
701 STORE_NUMBER (destination, number); \
702 (destination) += 2; \
705 /* Put into DESTINATION a number stored in two contiguous bytes starting
708 #define EXTRACT_NUMBER(destination, source) \
710 (destination) = *(source) & 0377; \
711 (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \
715 static void extract_number
_RE_ARGS ((int *dest
, re_char
*source
));
717 extract_number (dest
, source
)
721 int temp
= SIGN_EXTEND_CHAR (*(source
+ 1));
722 *dest
= *source
& 0377;
726 # ifndef EXTRACT_MACROS /* To debug the macros. */
727 # undef EXTRACT_NUMBER
728 # define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
729 # endif /* not EXTRACT_MACROS */
733 /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
734 SOURCE must be an lvalue. */
736 #define EXTRACT_NUMBER_AND_INCR(destination, source) \
738 EXTRACT_NUMBER (destination, source); \
743 static void extract_number_and_incr
_RE_ARGS ((int *destination
,
746 extract_number_and_incr (destination
, source
)
750 extract_number (destination
, *source
);
754 # ifndef EXTRACT_MACROS
755 # undef EXTRACT_NUMBER_AND_INCR
756 # define EXTRACT_NUMBER_AND_INCR(dest, src) \
757 extract_number_and_incr (&dest, &src)
758 # endif /* not EXTRACT_MACROS */
762 /* Store a multibyte character in three contiguous bytes starting
763 DESTINATION, and increment DESTINATION to the byte after where the
764 character is stored. Therefore, DESTINATION must be an lvalue. */
766 #define STORE_CHARACTER_AND_INCR(destination, character) \
768 (destination)[0] = (character) & 0377; \
769 (destination)[1] = ((character) >> 8) & 0377; \
770 (destination)[2] = (character) >> 16; \
771 (destination) += 3; \
774 /* Put into DESTINATION a character stored in three contiguous bytes
775 starting at SOURCE. */
777 #define EXTRACT_CHARACTER(destination, source) \
779 (destination) = ((source)[0] \
780 | ((source)[1] << 8) \
781 | ((source)[2] << 16)); \
785 /* Macros for charset. */
787 /* Size of bitmap of charset P in bytes. P is a start of charset,
788 i.e. *P is (re_opcode_t) charset or (re_opcode_t) charset_not. */
789 #define CHARSET_BITMAP_SIZE(p) ((p)[1] & 0x7F)
791 /* Nonzero if charset P has range table. */
792 #define CHARSET_RANGE_TABLE_EXISTS_P(p) ((p)[1] & 0x80)
794 /* Return the address of range table of charset P. But not the start
795 of table itself, but the before where the number of ranges is
796 stored. `2 +' means to skip re_opcode_t and size of bitmap,
797 and the 2 bytes of flags at the start of the range table. */
798 #define CHARSET_RANGE_TABLE(p) (&(p)[4 + CHARSET_BITMAP_SIZE (p)])
800 /* Extract the bit flags that start a range table. */
801 #define CHARSET_RANGE_TABLE_BITS(p) \
802 ((p)[2 + CHARSET_BITMAP_SIZE (p)] \
803 + (p)[3 + CHARSET_BITMAP_SIZE (p)] * 0x100)
805 /* Test if C is listed in the bitmap of charset P. */
806 #define CHARSET_LOOKUP_BITMAP(p, c) \
807 ((c) < CHARSET_BITMAP_SIZE (p) * BYTEWIDTH \
808 && (p)[2 + (c) / BYTEWIDTH] & (1 << ((c) % BYTEWIDTH)))
810 /* Return the address of end of RANGE_TABLE. COUNT is number of
811 ranges (which is a pair of (start, end)) in the RANGE_TABLE. `* 2'
812 is start of range and end of range. `* 3' is size of each start
814 #define CHARSET_RANGE_TABLE_END(range_table, count) \
815 ((range_table) + (count) * 2 * 3)
817 /* Test if C is in RANGE_TABLE. A flag NOT is negated if C is in.
818 COUNT is number of ranges in RANGE_TABLE. */
819 #define CHARSET_LOOKUP_RANGE_TABLE_RAW(not, c, range_table, count) \
822 re_wchar_t range_start, range_end; \
824 re_char *range_table_end \
825 = CHARSET_RANGE_TABLE_END ((range_table), (count)); \
827 for (p = (range_table); p < range_table_end; p += 2 * 3) \
829 EXTRACT_CHARACTER (range_start, p); \
830 EXTRACT_CHARACTER (range_end, p + 3); \
832 if (range_start <= (c) && (c) <= range_end) \
841 /* Test if C is in range table of CHARSET. The flag NOT is negated if
842 C is listed in it. */
843 #define CHARSET_LOOKUP_RANGE_TABLE(not, c, charset) \
846 /* Number of ranges in range table. */ \
848 re_char *range_table = CHARSET_RANGE_TABLE (charset); \
850 EXTRACT_NUMBER_AND_INCR (count, range_table); \
851 CHARSET_LOOKUP_RANGE_TABLE_RAW ((not), (c), range_table, count); \
855 /* If DEBUG is defined, Regex prints many voluminous messages about what
856 it is doing (if the variable `debug' is nonzero). If linked with the
857 main program in `iregex.c', you can enter patterns and strings
858 interactively. And if linked with the main program in `main.c' and
859 the other test files, you can run the already-written tests. */
863 /* We use standard I/O for debugging. */
866 /* It is useful to test things that ``must'' be true when debugging. */
869 static int debug
= -100000;
871 # define DEBUG_STATEMENT(e) e
872 # define DEBUG_PRINT1(x) if (debug > 0) printf (x)
873 # define DEBUG_PRINT2(x1, x2) if (debug > 0) printf (x1, x2)
874 # define DEBUG_PRINT3(x1, x2, x3) if (debug > 0) printf (x1, x2, x3)
875 # define DEBUG_PRINT4(x1, x2, x3, x4) if (debug > 0) printf (x1, x2, x3, x4)
876 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \
877 if (debug > 0) print_partial_compiled_pattern (s, e)
878 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \
879 if (debug > 0) print_double_string (w, s1, sz1, s2, sz2)
882 /* Print the fastmap in human-readable form. */
885 print_fastmap (fastmap
)
888 unsigned was_a_range
= 0;
891 while (i
< (1 << BYTEWIDTH
))
897 while (i
< (1 << BYTEWIDTH
) && fastmap
[i
])
913 /* Print a compiled pattern string in human-readable form, starting at
914 the START pointer into it and ending just before the pointer END. */
917 print_partial_compiled_pattern (start
, end
)
927 fprintf (stderr
, "(null)\n");
931 /* Loop over pattern commands. */
934 fprintf (stderr
, "%d:\t", p
- start
);
936 switch ((re_opcode_t
) *p
++)
939 fprintf (stderr
, "/no_op");
943 fprintf (stderr
, "/succeed");
948 fprintf (stderr
, "/exactn/%d", mcnt
);
951 fprintf (stderr
, "/%c", *p
++);
957 fprintf (stderr
, "/start_memory/%d", *p
++);
961 fprintf (stderr
, "/stop_memory/%d", *p
++);
965 fprintf (stderr
, "/duplicate/%d", *p
++);
969 fprintf (stderr
, "/anychar");
975 register int c
, last
= -100;
976 register int in_range
= 0;
977 int length
= CHARSET_BITMAP_SIZE (p
- 1);
978 int has_range_table
= CHARSET_RANGE_TABLE_EXISTS_P (p
- 1);
980 fprintf (stderr
, "/charset [%s",
981 (re_opcode_t
) *(p
- 1) == charset_not
? "^" : "");
984 fprintf (stderr
, " !extends past end of pattern! ");
986 for (c
= 0; c
< 256; c
++)
988 && (p
[1 + (c
/8)] & (1 << (c
% 8))))
990 /* Are we starting a range? */
991 if (last
+ 1 == c
&& ! in_range
)
993 fprintf (stderr
, "-");
996 /* Have we broken a range? */
997 else if (last
+ 1 != c
&& in_range
)
999 fprintf (stderr
, "%c", last
);
1004 fprintf (stderr
, "%c", c
);
1010 fprintf (stderr
, "%c", last
);
1012 fprintf (stderr
, "]");
1016 if (has_range_table
)
1019 fprintf (stderr
, "has-range-table");
1021 /* ??? Should print the range table; for now, just skip it. */
1022 p
+= 2; /* skip range table bits */
1023 EXTRACT_NUMBER_AND_INCR (count
, p
);
1024 p
= CHARSET_RANGE_TABLE_END (p
, count
);
1030 fprintf (stderr
, "/begline");
1034 fprintf (stderr
, "/endline");
1037 case on_failure_jump
:
1038 extract_number_and_incr (&mcnt
, &p
);
1039 fprintf (stderr
, "/on_failure_jump to %d", p
+ mcnt
- start
);
1042 case on_failure_keep_string_jump
:
1043 extract_number_and_incr (&mcnt
, &p
);
1044 fprintf (stderr
, "/on_failure_keep_string_jump to %d", p
+ mcnt
- start
);
1047 case on_failure_jump_nastyloop
:
1048 extract_number_and_incr (&mcnt
, &p
);
1049 fprintf (stderr
, "/on_failure_jump_nastyloop to %d", p
+ mcnt
- start
);
1052 case on_failure_jump_loop
:
1053 extract_number_and_incr (&mcnt
, &p
);
1054 fprintf (stderr
, "/on_failure_jump_loop to %d", p
+ mcnt
- start
);
1057 case on_failure_jump_smart
:
1058 extract_number_and_incr (&mcnt
, &p
);
1059 fprintf (stderr
, "/on_failure_jump_smart to %d", p
+ mcnt
- start
);
1063 extract_number_and_incr (&mcnt
, &p
);
1064 fprintf (stderr
, "/jump to %d", p
+ mcnt
- start
);
1068 extract_number_and_incr (&mcnt
, &p
);
1069 extract_number_and_incr (&mcnt2
, &p
);
1070 fprintf (stderr
, "/succeed_n to %d, %d times", p
- 2 + mcnt
- start
, mcnt2
);
1074 extract_number_and_incr (&mcnt
, &p
);
1075 extract_number_and_incr (&mcnt2
, &p
);
1076 fprintf (stderr
, "/jump_n to %d, %d times", p
- 2 + mcnt
- start
, mcnt2
);
1080 extract_number_and_incr (&mcnt
, &p
);
1081 extract_number_and_incr (&mcnt2
, &p
);
1082 fprintf (stderr
, "/set_number_at location %d to %d", p
- 2 + mcnt
- start
, mcnt2
);
1086 fprintf (stderr
, "/wordbound");
1090 fprintf (stderr
, "/notwordbound");
1094 fprintf (stderr
, "/wordbeg");
1098 fprintf (stderr
, "/wordend");
1102 fprintf (stderr
, "/symbeg");
1106 fprintf (stderr
, "/symend");
1110 fprintf (stderr
, "/syntaxspec");
1112 fprintf (stderr
, "/%d", mcnt
);
1116 fprintf (stderr
, "/notsyntaxspec");
1118 fprintf (stderr
, "/%d", mcnt
);
1123 fprintf (stderr
, "/before_dot");
1127 fprintf (stderr
, "/at_dot");
1131 fprintf (stderr
, "/after_dot");
1135 fprintf (stderr
, "/categoryspec");
1137 fprintf (stderr
, "/%d", mcnt
);
1140 case notcategoryspec
:
1141 fprintf (stderr
, "/notcategoryspec");
1143 fprintf (stderr
, "/%d", mcnt
);
1148 fprintf (stderr
, "/begbuf");
1152 fprintf (stderr
, "/endbuf");
1156 fprintf (stderr
, "?%d", *(p
-1));
1159 fprintf (stderr
, "\n");
1162 fprintf (stderr
, "%d:\tend of pattern.\n", p
- start
);
1167 print_compiled_pattern (bufp
)
1168 struct re_pattern_buffer
*bufp
;
1170 re_char
*buffer
= bufp
->buffer
;
1172 print_partial_compiled_pattern (buffer
, buffer
+ bufp
->used
);
1173 printf ("%ld bytes used/%ld bytes allocated.\n",
1174 bufp
->used
, bufp
->allocated
);
1176 if (bufp
->fastmap_accurate
&& bufp
->fastmap
)
1178 printf ("fastmap: ");
1179 print_fastmap (bufp
->fastmap
);
1182 printf ("re_nsub: %d\t", bufp
->re_nsub
);
1183 printf ("regs_alloc: %d\t", bufp
->regs_allocated
);
1184 printf ("can_be_null: %d\t", bufp
->can_be_null
);
1185 printf ("no_sub: %d\t", bufp
->no_sub
);
1186 printf ("not_bol: %d\t", bufp
->not_bol
);
1187 printf ("not_eol: %d\t", bufp
->not_eol
);
1188 printf ("syntax: %lx\n", bufp
->syntax
);
1190 /* Perhaps we should print the translate table? */
1195 print_double_string (where
, string1
, size1
, string2
, size2
)
1208 if (FIRST_STRING_P (where
))
1210 for (this_char
= where
- string1
; this_char
< size1
; this_char
++)
1211 putchar (string1
[this_char
]);
1216 for (this_char
= where
- string2
; this_char
< size2
; this_char
++)
1217 putchar (string2
[this_char
]);
1221 #else /* not DEBUG */
1226 # define DEBUG_STATEMENT(e)
1227 # define DEBUG_PRINT1(x)
1228 # define DEBUG_PRINT2(x1, x2)
1229 # define DEBUG_PRINT3(x1, x2, x3)
1230 # define DEBUG_PRINT4(x1, x2, x3, x4)
1231 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
1232 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
1234 #endif /* not DEBUG */
1236 /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can
1237 also be assigned to arbitrarily: each pattern buffer stores its own
1238 syntax, so it can be changed between regex compilations. */
1239 /* This has no initializer because initialized variables in Emacs
1240 become read-only after dumping. */
1241 reg_syntax_t re_syntax_options
;
1244 /* Specify the precise syntax of regexps for compilation. This provides
1245 for compatibility for various utilities which historically have
1246 different, incompatible syntaxes.
1248 The argument SYNTAX is a bit mask comprised of the various bits
1249 defined in regex.h. We return the old syntax. */
1252 re_set_syntax (syntax
)
1253 reg_syntax_t syntax
;
1255 reg_syntax_t ret
= re_syntax_options
;
1257 re_syntax_options
= syntax
;
1260 WEAK_ALIAS (__re_set_syntax
, re_set_syntax
)
1262 /* Regexp to use to replace spaces, or NULL meaning don't. */
1263 static re_char
*whitespace_regexp
;
1266 re_set_whitespace_regexp (regexp
)
1269 whitespace_regexp
= regexp
;
1271 WEAK_ALIAS (__re_set_syntax
, re_set_syntax
)
1273 /* This table gives an error message for each of the error codes listed
1274 in regex.h. Obviously the order here has to be same as there.
1275 POSIX doesn't require that we do anything for REG_NOERROR,
1276 but why not be nice? */
1278 static const char *re_error_msgid
[] =
1280 gettext_noop ("Success"), /* REG_NOERROR */
1281 gettext_noop ("No match"), /* REG_NOMATCH */
1282 gettext_noop ("Invalid regular expression"), /* REG_BADPAT */
1283 gettext_noop ("Invalid collation character"), /* REG_ECOLLATE */
1284 gettext_noop ("Invalid character class name"), /* REG_ECTYPE */
1285 gettext_noop ("Trailing backslash"), /* REG_EESCAPE */
1286 gettext_noop ("Invalid back reference"), /* REG_ESUBREG */
1287 gettext_noop ("Unmatched [ or [^"), /* REG_EBRACK */
1288 gettext_noop ("Unmatched ( or \\("), /* REG_EPAREN */
1289 gettext_noop ("Unmatched \\{"), /* REG_EBRACE */
1290 gettext_noop ("Invalid content of \\{\\}"), /* REG_BADBR */
1291 gettext_noop ("Invalid range end"), /* REG_ERANGE */
1292 gettext_noop ("Memory exhausted"), /* REG_ESPACE */
1293 gettext_noop ("Invalid preceding regular expression"), /* REG_BADRPT */
1294 gettext_noop ("Premature end of regular expression"), /* REG_EEND */
1295 gettext_noop ("Regular expression too big"), /* REG_ESIZE */
1296 gettext_noop ("Unmatched ) or \\)"), /* REG_ERPAREN */
1297 gettext_noop ("Range striding over charsets") /* REG_ERANGEX */
1300 /* Avoiding alloca during matching, to placate r_alloc. */
1302 /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the
1303 searching and matching functions should not call alloca. On some
1304 systems, alloca is implemented in terms of malloc, and if we're
1305 using the relocating allocator routines, then malloc could cause a
1306 relocation, which might (if the strings being searched are in the
1307 ralloc heap) shift the data out from underneath the regexp
1310 Here's another reason to avoid allocation: Emacs
1311 processes input from X in a signal handler; processing X input may
1312 call malloc; if input arrives while a matching routine is calling
1313 malloc, then we're scrod. But Emacs can't just block input while
1314 calling matching routines; then we don't notice interrupts when
1315 they come in. So, Emacs blocks input around all regexp calls
1316 except the matching calls, which it leaves unprotected, in the
1317 faith that they will not malloc. */
1319 /* Normally, this is fine. */
1320 #define MATCH_MAY_ALLOCATE
1322 /* When using GNU C, we are not REALLY using the C alloca, no matter
1323 what config.h may say. So don't take precautions for it. */
1328 /* The match routines may not allocate if (1) they would do it with malloc
1329 and (2) it's not safe for them to use malloc.
1330 Note that if REL_ALLOC is defined, matching would not use malloc for the
1331 failure stack, but we would still use it for the register vectors;
1332 so REL_ALLOC should not affect this. */
1333 #if (defined C_ALLOCA || defined REGEX_MALLOC) && defined emacs
1334 # undef MATCH_MAY_ALLOCATE
1338 /* Failure stack declarations and macros; both re_compile_fastmap and
1339 re_match_2 use a failure stack. These have to be macros because of
1340 REGEX_ALLOCATE_STACK. */
1343 /* Approximate number of failure points for which to initially allocate space
1344 when matching. If this number is exceeded, we allocate more
1345 space, so it is not a hard limit. */
1346 #ifndef INIT_FAILURE_ALLOC
1347 # define INIT_FAILURE_ALLOC 20
1350 /* Roughly the maximum number of failure points on the stack. Would be
1351 exactly that if always used TYPICAL_FAILURE_SIZE items each time we failed.
1352 This is a variable only so users of regex can assign to it; we never
1353 change it ourselves. We always multiply it by TYPICAL_FAILURE_SIZE
1354 before using it, so it should probably be a byte-count instead. */
1355 # if defined MATCH_MAY_ALLOCATE
1356 /* Note that 4400 was enough to cause a crash on Alpha OSF/1,
1357 whose default stack limit is 2mb. In order for a larger
1358 value to work reliably, you have to try to make it accord
1359 with the process stack limit. */
1360 size_t re_max_failures
= 40000;
1362 size_t re_max_failures
= 4000;
1365 union fail_stack_elt
1368 /* This should be the biggest `int' that's no bigger than a pointer. */
1372 typedef union fail_stack_elt fail_stack_elt_t
;
1376 fail_stack_elt_t
*stack
;
1378 size_t avail
; /* Offset of next open position. */
1379 size_t frame
; /* Offset of the cur constructed frame. */
1382 #define FAIL_STACK_EMPTY() (fail_stack.frame == 0)
1383 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
1386 /* Define macros to initialize and free the failure stack.
1387 Do `return -2' if the alloc fails. */
1389 #ifdef MATCH_MAY_ALLOCATE
1390 # define INIT_FAIL_STACK() \
1392 fail_stack.stack = (fail_stack_elt_t *) \
1393 REGEX_ALLOCATE_STACK (INIT_FAILURE_ALLOC * TYPICAL_FAILURE_SIZE \
1394 * sizeof (fail_stack_elt_t)); \
1396 if (fail_stack.stack == NULL) \
1399 fail_stack.size = INIT_FAILURE_ALLOC; \
1400 fail_stack.avail = 0; \
1401 fail_stack.frame = 0; \
1404 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
1406 # define INIT_FAIL_STACK() \
1408 fail_stack.avail = 0; \
1409 fail_stack.frame = 0; \
1412 # define RESET_FAIL_STACK() ((void)0)
1416 /* Double the size of FAIL_STACK, up to a limit
1417 which allows approximately `re_max_failures' items.
1419 Return 1 if succeeds, and 0 if either ran out of memory
1420 allocating space for it or it was already too large.
1422 REGEX_REALLOCATE_STACK requires `destination' be declared. */
1424 /* Factor to increase the failure stack size by
1425 when we increase it.
1426 This used to be 2, but 2 was too wasteful
1427 because the old discarded stacks added up to as much space
1428 were as ultimate, maximum-size stack. */
1429 #define FAIL_STACK_GROWTH_FACTOR 4
1431 #define GROW_FAIL_STACK(fail_stack) \
1432 (((fail_stack).size * sizeof (fail_stack_elt_t) \
1433 >= re_max_failures * TYPICAL_FAILURE_SIZE) \
1435 : ((fail_stack).stack \
1436 = (fail_stack_elt_t *) \
1437 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
1438 (fail_stack).size * sizeof (fail_stack_elt_t), \
1439 MIN (re_max_failures * TYPICAL_FAILURE_SIZE, \
1440 ((fail_stack).size * sizeof (fail_stack_elt_t) \
1441 * FAIL_STACK_GROWTH_FACTOR))), \
1443 (fail_stack).stack == NULL \
1445 : ((fail_stack).size \
1446 = (MIN (re_max_failures * TYPICAL_FAILURE_SIZE, \
1447 ((fail_stack).size * sizeof (fail_stack_elt_t) \
1448 * FAIL_STACK_GROWTH_FACTOR)) \
1449 / sizeof (fail_stack_elt_t)), \
1453 /* Push a pointer value onto the failure stack.
1454 Assumes the variable `fail_stack'. Probably should only
1455 be called from within `PUSH_FAILURE_POINT'. */
1456 #define PUSH_FAILURE_POINTER(item) \
1457 fail_stack.stack[fail_stack.avail++].pointer = (item)
1459 /* This pushes an integer-valued item onto the failure stack.
1460 Assumes the variable `fail_stack'. Probably should only
1461 be called from within `PUSH_FAILURE_POINT'. */
1462 #define PUSH_FAILURE_INT(item) \
1463 fail_stack.stack[fail_stack.avail++].integer = (item)
1465 /* Push a fail_stack_elt_t value onto the failure stack.
1466 Assumes the variable `fail_stack'. Probably should only
1467 be called from within `PUSH_FAILURE_POINT'. */
1468 #define PUSH_FAILURE_ELT(item) \
1469 fail_stack.stack[fail_stack.avail++] = (item)
1471 /* These three POP... operations complement the three PUSH... operations.
1472 All assume that `fail_stack' is nonempty. */
1473 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1474 #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
1475 #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
1477 /* Individual items aside from the registers. */
1478 #define NUM_NONREG_ITEMS 3
1480 /* Used to examine the stack (to detect infinite loops). */
1481 #define FAILURE_PAT(h) fail_stack.stack[(h) - 1].pointer
1482 #define FAILURE_STR(h) (fail_stack.stack[(h) - 2].pointer)
1483 #define NEXT_FAILURE_HANDLE(h) fail_stack.stack[(h) - 3].integer
1484 #define TOP_FAILURE_HANDLE() fail_stack.frame
1487 #define ENSURE_FAIL_STACK(space) \
1488 while (REMAINING_AVAIL_SLOTS <= space) { \
1489 if (!GROW_FAIL_STACK (fail_stack)) \
1491 DEBUG_PRINT2 ("\n Doubled stack; size now: %d\n", (fail_stack).size);\
1492 DEBUG_PRINT2 (" slots available: %d\n", REMAINING_AVAIL_SLOTS);\
1495 /* Push register NUM onto the stack. */
1496 #define PUSH_FAILURE_REG(num) \
1498 char *destination; \
1499 ENSURE_FAIL_STACK(3); \
1500 DEBUG_PRINT4 (" Push reg %d (spanning %p -> %p)\n", \
1501 num, regstart[num], regend[num]); \
1502 PUSH_FAILURE_POINTER (regstart[num]); \
1503 PUSH_FAILURE_POINTER (regend[num]); \
1504 PUSH_FAILURE_INT (num); \
1507 /* Change the counter's value to VAL, but make sure that it will
1508 be reset when backtracking. */
1509 #define PUSH_NUMBER(ptr,val) \
1511 char *destination; \
1513 ENSURE_FAIL_STACK(3); \
1514 EXTRACT_NUMBER (c, ptr); \
1515 DEBUG_PRINT4 (" Push number %p = %d -> %d\n", ptr, c, val); \
1516 PUSH_FAILURE_INT (c); \
1517 PUSH_FAILURE_POINTER (ptr); \
1518 PUSH_FAILURE_INT (-1); \
1519 STORE_NUMBER (ptr, val); \
1522 /* Pop a saved register off the stack. */
1523 #define POP_FAILURE_REG_OR_COUNT() \
1525 int reg = POP_FAILURE_INT (); \
1528 /* It's a counter. */ \
1529 /* Here, we discard `const', making re_match non-reentrant. */ \
1530 unsigned char *ptr = (unsigned char*) POP_FAILURE_POINTER (); \
1531 reg = POP_FAILURE_INT (); \
1532 STORE_NUMBER (ptr, reg); \
1533 DEBUG_PRINT3 (" Pop counter %p = %d\n", ptr, reg); \
1537 regend[reg] = POP_FAILURE_POINTER (); \
1538 regstart[reg] = POP_FAILURE_POINTER (); \
1539 DEBUG_PRINT4 (" Pop reg %d (spanning %p -> %p)\n", \
1540 reg, regstart[reg], regend[reg]); \
1544 /* Check that we are not stuck in an infinite loop. */
1545 #define CHECK_INFINITE_LOOP(pat_cur, string_place) \
1547 int failure = TOP_FAILURE_HANDLE (); \
1548 /* Check for infinite matching loops */ \
1549 while (failure > 0 \
1550 && (FAILURE_STR (failure) == string_place \
1551 || FAILURE_STR (failure) == NULL)) \
1553 assert (FAILURE_PAT (failure) >= bufp->buffer \
1554 && FAILURE_PAT (failure) <= bufp->buffer + bufp->used); \
1555 if (FAILURE_PAT (failure) == pat_cur) \
1560 DEBUG_PRINT2 (" Other pattern: %p\n", FAILURE_PAT (failure)); \
1561 failure = NEXT_FAILURE_HANDLE(failure); \
1563 DEBUG_PRINT2 (" Other string: %p\n", FAILURE_STR (failure)); \
1566 /* Push the information about the state we will need
1567 if we ever fail back to it.
1569 Requires variables fail_stack, regstart, regend and
1570 num_regs be declared. GROW_FAIL_STACK requires `destination' be
1573 Does `return FAILURE_CODE' if runs out of memory. */
1575 #define PUSH_FAILURE_POINT(pattern, string_place) \
1577 char *destination; \
1578 /* Must be int, so when we don't save any registers, the arithmetic \
1579 of 0 + -1 isn't done as unsigned. */ \
1581 DEBUG_STATEMENT (nfailure_points_pushed++); \
1582 DEBUG_PRINT1 ("\nPUSH_FAILURE_POINT:\n"); \
1583 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail); \
1584 DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\
1586 ENSURE_FAIL_STACK (NUM_NONREG_ITEMS); \
1588 DEBUG_PRINT1 ("\n"); \
1590 DEBUG_PRINT2 (" Push frame index: %d\n", fail_stack.frame); \
1591 PUSH_FAILURE_INT (fail_stack.frame); \
1593 DEBUG_PRINT2 (" Push string %p: `", string_place); \
1594 DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, size2);\
1595 DEBUG_PRINT1 ("'\n"); \
1596 PUSH_FAILURE_POINTER (string_place); \
1598 DEBUG_PRINT2 (" Push pattern %p: ", pattern); \
1599 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern, pend); \
1600 PUSH_FAILURE_POINTER (pattern); \
1602 /* Close the frame by moving the frame pointer past it. */ \
1603 fail_stack.frame = fail_stack.avail; \
1606 /* Estimate the size of data pushed by a typical failure stack entry.
1607 An estimate is all we need, because all we use this for
1608 is to choose a limit for how big to make the failure stack. */
1609 /* BEWARE, the value `20' is hard-coded in emacs.c:main(). */
1610 #define TYPICAL_FAILURE_SIZE 20
1612 /* How many items can still be added to the stack without overflowing it. */
1613 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
1616 /* Pops what PUSH_FAIL_STACK pushes.
1618 We restore into the parameters, all of which should be lvalues:
1619 STR -- the saved data position.
1620 PAT -- the saved pattern position.
1621 REGSTART, REGEND -- arrays of string positions.
1623 Also assumes the variables `fail_stack' and (if debugging), `bufp',
1624 `pend', `string1', `size1', `string2', and `size2'. */
1626 #define POP_FAILURE_POINT(str, pat) \
1628 assert (!FAIL_STACK_EMPTY ()); \
1630 /* Remove failure points and point to how many regs pushed. */ \
1631 DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \
1632 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \
1633 DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \
1635 /* Pop the saved registers. */ \
1636 while (fail_stack.frame < fail_stack.avail) \
1637 POP_FAILURE_REG_OR_COUNT (); \
1639 pat = POP_FAILURE_POINTER (); \
1640 DEBUG_PRINT2 (" Popping pattern %p: ", pat); \
1641 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1643 /* If the saved string location is NULL, it came from an \
1644 on_failure_keep_string_jump opcode, and we want to throw away the \
1645 saved NULL, thus retaining our current position in the string. */ \
1646 str = POP_FAILURE_POINTER (); \
1647 DEBUG_PRINT2 (" Popping string %p: `", str); \
1648 DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \
1649 DEBUG_PRINT1 ("'\n"); \
1651 fail_stack.frame = POP_FAILURE_INT (); \
1652 DEBUG_PRINT2 (" Popping frame index: %d\n", fail_stack.frame); \
1654 assert (fail_stack.avail >= 0); \
1655 assert (fail_stack.frame <= fail_stack.avail); \
1657 DEBUG_STATEMENT (nfailure_points_popped++); \
1658 } while (0) /* POP_FAILURE_POINT */
1662 /* Registers are set to a sentinel when they haven't yet matched. */
1663 #define REG_UNSET(e) ((e) == NULL)
1665 /* Subroutine declarations and macros for regex_compile. */
1667 static reg_errcode_t regex_compile
_RE_ARGS ((re_char
*pattern
, size_t size
,
1668 reg_syntax_t syntax
,
1669 struct re_pattern_buffer
*bufp
));
1670 static void store_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
, int arg
));
1671 static void store_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1672 int arg1
, int arg2
));
1673 static void insert_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1674 int arg
, unsigned char *end
));
1675 static void insert_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1676 int arg1
, int arg2
, unsigned char *end
));
1677 static boolean at_begline_loc_p
_RE_ARGS ((re_char
*pattern
,
1679 reg_syntax_t syntax
));
1680 static boolean at_endline_loc_p
_RE_ARGS ((re_char
*p
,
1682 reg_syntax_t syntax
));
1683 static re_char
*skip_one_char
_RE_ARGS ((re_char
*p
));
1684 static int analyse_first
_RE_ARGS ((re_char
*p
, re_char
*pend
,
1685 char *fastmap
, const int multibyte
));
1687 /* Fetch the next character in the uncompiled pattern, with no
1689 #define PATFETCH(c) \
1692 if (p == pend) return REG_EEND; \
1693 c = RE_STRING_CHAR_AND_LENGTH (p, pend - p, len); \
1698 /* If `translate' is non-null, return translate[D], else just D. We
1699 cast the subscript to translate because some data is declared as
1700 `char *', to avoid warnings when a string constant is passed. But
1701 when we use a character as a subscript we must make it unsigned. */
1703 # define TRANSLATE(d) \
1704 (RE_TRANSLATE_P (translate) ? RE_TRANSLATE (translate, (d)) : (d))
1708 /* Macros for outputting the compiled pattern into `buffer'. */
1710 /* If the buffer isn't allocated when it comes in, use this. */
1711 #define INIT_BUF_SIZE 32
1713 /* Make sure we have at least N more bytes of space in buffer. */
1714 #define GET_BUFFER_SPACE(n) \
1715 while ((size_t) (b - bufp->buffer + (n)) > bufp->allocated) \
1718 /* Make sure we have one more byte of buffer space and then add C to it. */
1719 #define BUF_PUSH(c) \
1721 GET_BUFFER_SPACE (1); \
1722 *b++ = (unsigned char) (c); \
1726 /* Ensure we have two more bytes of buffer space and then append C1 and C2. */
1727 #define BUF_PUSH_2(c1, c2) \
1729 GET_BUFFER_SPACE (2); \
1730 *b++ = (unsigned char) (c1); \
1731 *b++ = (unsigned char) (c2); \
1735 /* As with BUF_PUSH_2, except for three bytes. */
1736 #define BUF_PUSH_3(c1, c2, c3) \
1738 GET_BUFFER_SPACE (3); \
1739 *b++ = (unsigned char) (c1); \
1740 *b++ = (unsigned char) (c2); \
1741 *b++ = (unsigned char) (c3); \
1745 /* Store a jump with opcode OP at LOC to location TO. We store a
1746 relative address offset by the three bytes the jump itself occupies. */
1747 #define STORE_JUMP(op, loc, to) \
1748 store_op1 (op, loc, (to) - (loc) - 3)
1750 /* Likewise, for a two-argument jump. */
1751 #define STORE_JUMP2(op, loc, to, arg) \
1752 store_op2 (op, loc, (to) - (loc) - 3, arg)
1754 /* Like `STORE_JUMP', but for inserting. Assume `b' is the buffer end. */
1755 #define INSERT_JUMP(op, loc, to) \
1756 insert_op1 (op, loc, (to) - (loc) - 3, b)
1758 /* Like `STORE_JUMP2', but for inserting. Assume `b' is the buffer end. */
1759 #define INSERT_JUMP2(op, loc, to, arg) \
1760 insert_op2 (op, loc, (to) - (loc) - 3, arg, b)
1763 /* This is not an arbitrary limit: the arguments which represent offsets
1764 into the pattern are two bytes long. So if 2^15 bytes turns out to
1765 be too small, many things would have to change. */
1766 # define MAX_BUF_SIZE (1L << 15)
1768 #if 0 /* This is when we thought it could be 2^16 bytes. */
1769 /* Any other compiler which, like MSC, has allocation limit below 2^16
1770 bytes will have to use approach similar to what was done below for
1771 MSC and drop MAX_BUF_SIZE a bit. Otherwise you may end up
1772 reallocating to 0 bytes. Such thing is not going to work too well.
1773 You have been warned!! */
1774 #if defined _MSC_VER && !defined WIN32
1775 /* Microsoft C 16-bit versions limit malloc to approx 65512 bytes. */
1776 # define MAX_BUF_SIZE 65500L
1778 # define MAX_BUF_SIZE (1L << 16)
1782 /* Extend the buffer by twice its current size via realloc and
1783 reset the pointers that pointed into the old block to point to the
1784 correct places in the new one. If extending the buffer results in it
1785 being larger than MAX_BUF_SIZE, then flag memory exhausted. */
1786 #if __BOUNDED_POINTERS__
1787 # define SET_HIGH_BOUND(P) (__ptrhigh (P) = __ptrlow (P) + bufp->allocated)
1788 # define MOVE_BUFFER_POINTER(P) \
1789 (__ptrlow (P) += incr, SET_HIGH_BOUND (P), __ptrvalue (P) += incr)
1790 # define ELSE_EXTEND_BUFFER_HIGH_BOUND \
1793 SET_HIGH_BOUND (b); \
1794 SET_HIGH_BOUND (begalt); \
1795 if (fixup_alt_jump) \
1796 SET_HIGH_BOUND (fixup_alt_jump); \
1798 SET_HIGH_BOUND (laststart); \
1799 if (pending_exact) \
1800 SET_HIGH_BOUND (pending_exact); \
1803 # define MOVE_BUFFER_POINTER(P) (P) += incr
1804 # define ELSE_EXTEND_BUFFER_HIGH_BOUND
1806 #define EXTEND_BUFFER() \
1808 re_char *old_buffer = bufp->buffer; \
1809 if (bufp->allocated == MAX_BUF_SIZE) \
1811 bufp->allocated <<= 1; \
1812 if (bufp->allocated > MAX_BUF_SIZE) \
1813 bufp->allocated = MAX_BUF_SIZE; \
1814 RETALLOC (bufp->buffer, bufp->allocated, unsigned char); \
1815 if (bufp->buffer == NULL) \
1816 return REG_ESPACE; \
1817 /* If the buffer moved, move all the pointers into it. */ \
1818 if (old_buffer != bufp->buffer) \
1820 int incr = bufp->buffer - old_buffer; \
1821 MOVE_BUFFER_POINTER (b); \
1822 MOVE_BUFFER_POINTER (begalt); \
1823 if (fixup_alt_jump) \
1824 MOVE_BUFFER_POINTER (fixup_alt_jump); \
1826 MOVE_BUFFER_POINTER (laststart); \
1827 if (pending_exact) \
1828 MOVE_BUFFER_POINTER (pending_exact); \
1830 ELSE_EXTEND_BUFFER_HIGH_BOUND \
1834 /* Since we have one byte reserved for the register number argument to
1835 {start,stop}_memory, the maximum number of groups we can report
1836 things about is what fits in that byte. */
1837 #define MAX_REGNUM 255
1839 /* But patterns can have more than `MAX_REGNUM' registers. We just
1840 ignore the excess. */
1841 typedef int regnum_t
;
1844 /* Macros for the compile stack. */
1846 /* Since offsets can go either forwards or backwards, this type needs to
1847 be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */
1848 /* int may be not enough when sizeof(int) == 2. */
1849 typedef long pattern_offset_t
;
1853 pattern_offset_t begalt_offset
;
1854 pattern_offset_t fixup_alt_jump
;
1855 pattern_offset_t laststart_offset
;
1857 } compile_stack_elt_t
;
1862 compile_stack_elt_t
*stack
;
1864 unsigned avail
; /* Offset of next open position. */
1865 } compile_stack_type
;
1868 #define INIT_COMPILE_STACK_SIZE 32
1870 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
1871 #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
1873 /* The next available element. */
1874 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
1876 /* Explicit quit checking is only used on NTemacs. */
1877 #if defined WINDOWSNT && defined emacs && defined QUIT
1878 extern int immediate_quit
;
1879 # define IMMEDIATE_QUIT_CHECK \
1881 if (immediate_quit) QUIT; \
1884 # define IMMEDIATE_QUIT_CHECK ((void)0)
1887 /* Structure to manage work area for range table. */
1888 struct range_table_work_area
1890 int *table
; /* actual work area. */
1891 int allocated
; /* allocated size for work area in bytes. */
1892 int used
; /* actually used size in words. */
1893 int bits
; /* flag to record character classes */
1896 /* Make sure that WORK_AREA can hold more N multibyte characters.
1897 This is used only in set_image_of_range and set_image_of_range_1.
1898 It expects WORK_AREA to be a pointer.
1899 If it can't get the space, it returns from the surrounding function. */
1901 #define EXTEND_RANGE_TABLE(work_area, n) \
1903 if (((work_area)->used + (n)) * sizeof (int) > (work_area)->allocated) \
1905 extend_range_table_work_area (work_area); \
1906 if ((work_area)->table == 0) \
1907 return (REG_ESPACE); \
1911 #define SET_RANGE_TABLE_WORK_AREA_BIT(work_area, bit) \
1912 (work_area).bits |= (bit)
1914 /* Bits used to implement the multibyte-part of the various character classes
1915 such as [:alnum:] in a charset's range table. */
1916 #define BIT_WORD 0x1
1917 #define BIT_LOWER 0x2
1918 #define BIT_PUNCT 0x4
1919 #define BIT_SPACE 0x8
1920 #define BIT_UPPER 0x10
1921 #define BIT_MULTIBYTE 0x20
1923 /* Set a range START..END to WORK_AREA.
1924 The range is passed through TRANSLATE, so START and END
1925 should be untranslated. */
1926 #define SET_RANGE_TABLE_WORK_AREA(work_area, start, end) \
1929 tem = set_image_of_range (&work_area, start, end, translate); \
1931 FREE_STACK_RETURN (tem); \
1934 /* Free allocated memory for WORK_AREA. */
1935 #define FREE_RANGE_TABLE_WORK_AREA(work_area) \
1937 if ((work_area).table) \
1938 free ((work_area).table); \
1941 #define CLEAR_RANGE_TABLE_WORK_USED(work_area) ((work_area).used = 0, (work_area).bits = 0)
1942 #define RANGE_TABLE_WORK_USED(work_area) ((work_area).used)
1943 #define RANGE_TABLE_WORK_BITS(work_area) ((work_area).bits)
1944 #define RANGE_TABLE_WORK_ELT(work_area, i) ((work_area).table[i])
1947 /* Set the bit for character C in a list. */
1948 #define SET_LIST_BIT(c) (b[((c)) / BYTEWIDTH] |= 1 << ((c) % BYTEWIDTH))
1951 /* Get the next unsigned number in the uncompiled pattern. */
1952 #define GET_UNSIGNED_NUMBER(num) \
1953 do { if (p != pend) \
1957 FREE_STACK_RETURN (REG_BADBR); \
1958 while ('0' <= c && c <= '9') \
1964 num = num * 10 + c - '0'; \
1965 if (num / 10 != prev) \
1966 FREE_STACK_RETURN (REG_BADBR); \
1972 FREE_STACK_RETURN (REG_BADBR); \
1976 #if ! WIDE_CHAR_SUPPORT
1978 /* Map a string to the char class it names (if any). */
1983 const char *string
= str
;
1984 if (STREQ (string
, "alnum")) return RECC_ALNUM
;
1985 else if (STREQ (string
, "alpha")) return RECC_ALPHA
;
1986 else if (STREQ (string
, "word")) return RECC_WORD
;
1987 else if (STREQ (string
, "ascii")) return RECC_ASCII
;
1988 else if (STREQ (string
, "nonascii")) return RECC_NONASCII
;
1989 else if (STREQ (string
, "graph")) return RECC_GRAPH
;
1990 else if (STREQ (string
, "lower")) return RECC_LOWER
;
1991 else if (STREQ (string
, "print")) return RECC_PRINT
;
1992 else if (STREQ (string
, "punct")) return RECC_PUNCT
;
1993 else if (STREQ (string
, "space")) return RECC_SPACE
;
1994 else if (STREQ (string
, "upper")) return RECC_UPPER
;
1995 else if (STREQ (string
, "unibyte")) return RECC_UNIBYTE
;
1996 else if (STREQ (string
, "multibyte")) return RECC_MULTIBYTE
;
1997 else if (STREQ (string
, "digit")) return RECC_DIGIT
;
1998 else if (STREQ (string
, "xdigit")) return RECC_XDIGIT
;
1999 else if (STREQ (string
, "cntrl")) return RECC_CNTRL
;
2000 else if (STREQ (string
, "blank")) return RECC_BLANK
;
2004 /* True iff CH is in the char class CC. */
2006 re_iswctype (ch
, cc
)
2012 case RECC_ALNUM
: return ISALNUM (ch
);
2013 case RECC_ALPHA
: return ISALPHA (ch
);
2014 case RECC_BLANK
: return ISBLANK (ch
);
2015 case RECC_CNTRL
: return ISCNTRL (ch
);
2016 case RECC_DIGIT
: return ISDIGIT (ch
);
2017 case RECC_GRAPH
: return ISGRAPH (ch
);
2018 case RECC_LOWER
: return ISLOWER (ch
);
2019 case RECC_PRINT
: return ISPRINT (ch
);
2020 case RECC_PUNCT
: return ISPUNCT (ch
);
2021 case RECC_SPACE
: return ISSPACE (ch
);
2022 case RECC_UPPER
: return ISUPPER (ch
);
2023 case RECC_XDIGIT
: return ISXDIGIT (ch
);
2024 case RECC_ASCII
: return IS_REAL_ASCII (ch
);
2025 case RECC_NONASCII
: return !IS_REAL_ASCII (ch
);
2026 case RECC_UNIBYTE
: return ISUNIBYTE (ch
);
2027 case RECC_MULTIBYTE
: return !ISUNIBYTE (ch
);
2028 case RECC_WORD
: return ISWORD (ch
);
2029 case RECC_ERROR
: return false;
2035 /* Return a bit-pattern to use in the range-table bits to match multibyte
2036 chars of class CC. */
2038 re_wctype_to_bit (cc
)
2043 case RECC_NONASCII
: case RECC_PRINT
: case RECC_GRAPH
:
2044 case RECC_MULTIBYTE
: return BIT_MULTIBYTE
;
2045 case RECC_ALPHA
: case RECC_ALNUM
: case RECC_WORD
: return BIT_WORD
;
2046 case RECC_LOWER
: return BIT_LOWER
;
2047 case RECC_UPPER
: return BIT_UPPER
;
2048 case RECC_PUNCT
: return BIT_PUNCT
;
2049 case RECC_SPACE
: return BIT_SPACE
;
2050 case RECC_ASCII
: case RECC_DIGIT
: case RECC_XDIGIT
: case RECC_CNTRL
:
2051 case RECC_BLANK
: case RECC_UNIBYTE
: case RECC_ERROR
: return 0;
2058 /* Filling in the work area of a range. */
2060 /* Actually extend the space in WORK_AREA. */
2063 extend_range_table_work_area (work_area
)
2064 struct range_table_work_area
*work_area
;
2066 work_area
->allocated
+= 16 * sizeof (int);
2067 if (work_area
->table
)
2069 = (int *) realloc (work_area
->table
, work_area
->allocated
);
2072 = (int *) malloc (work_area
->allocated
);
2077 /* Carefully find the ranges of codes that are equivalent
2078 under case conversion to the range start..end when passed through
2079 TRANSLATE. Handle the case where non-letters can come in between
2080 two upper-case letters (which happens in Latin-1).
2081 Also handle the case of groups of more than 2 case-equivalent chars.
2083 The basic method is to look at consecutive characters and see
2084 if they can form a run that can be handled as one.
2086 Returns -1 if successful, REG_ESPACE if ran out of space. */
2089 set_image_of_range_1 (work_area
, start
, end
, translate
)
2090 RE_TRANSLATE_TYPE translate
;
2091 struct range_table_work_area
*work_area
;
2092 re_wchar_t start
, end
;
2094 /* `one_case' indicates a character, or a run of characters,
2095 each of which is an isolate (no case-equivalents).
2096 This includes all ASCII non-letters.
2098 `two_case' indicates a character, or a run of characters,
2099 each of which has two case-equivalent forms.
2100 This includes all ASCII letters.
2102 `strange' indicates a character that has more than one
2105 enum case_type
{one_case
, two_case
, strange
};
2107 /* Describe the run that is in progress,
2108 which the next character can try to extend.
2109 If run_type is strange, that means there really is no run.
2110 If run_type is one_case, then run_start...run_end is the run.
2111 If run_type is two_case, then the run is run_start...run_end,
2112 and the case-equivalents end at run_eqv_end. */
2114 enum case_type run_type
= strange
;
2115 int run_start
, run_end
, run_eqv_end
;
2117 Lisp_Object eqv_table
;
2119 if (!RE_TRANSLATE_P (translate
))
2121 EXTEND_RANGE_TABLE (work_area
, 2);
2122 work_area
->table
[work_area
->used
++] = (start
);
2123 work_area
->table
[work_area
->used
++] = (end
);
2127 eqv_table
= XCHAR_TABLE (translate
)->extras
[2];
2129 for (; start
<= end
; start
++)
2131 enum case_type this_type
;
2132 int eqv
= RE_TRANSLATE (eqv_table
, start
);
2133 int minchar
, maxchar
;
2135 /* Classify this character */
2137 this_type
= one_case
;
2138 else if (RE_TRANSLATE (eqv_table
, eqv
) == start
)
2139 this_type
= two_case
;
2141 this_type
= strange
;
2144 minchar
= start
, maxchar
= eqv
;
2146 minchar
= eqv
, maxchar
= start
;
2148 /* Can this character extend the run in progress? */
2149 if (this_type
== strange
|| this_type
!= run_type
2150 || !(minchar
== run_end
+ 1
2151 && (run_type
== two_case
2152 ? maxchar
== run_eqv_end
+ 1 : 1)))
2155 Record each of its equivalent ranges. */
2156 if (run_type
== one_case
)
2158 EXTEND_RANGE_TABLE (work_area
, 2);
2159 work_area
->table
[work_area
->used
++] = run_start
;
2160 work_area
->table
[work_area
->used
++] = run_end
;
2162 else if (run_type
== two_case
)
2164 EXTEND_RANGE_TABLE (work_area
, 4);
2165 work_area
->table
[work_area
->used
++] = run_start
;
2166 work_area
->table
[work_area
->used
++] = run_end
;
2167 work_area
->table
[work_area
->used
++]
2168 = RE_TRANSLATE (eqv_table
, run_start
);
2169 work_area
->table
[work_area
->used
++]
2170 = RE_TRANSLATE (eqv_table
, run_end
);
2175 if (this_type
== strange
)
2177 /* For a strange character, add each of its equivalents, one
2178 by one. Don't start a range. */
2181 EXTEND_RANGE_TABLE (work_area
, 2);
2182 work_area
->table
[work_area
->used
++] = eqv
;
2183 work_area
->table
[work_area
->used
++] = eqv
;
2184 eqv
= RE_TRANSLATE (eqv_table
, eqv
);
2186 while (eqv
!= start
);
2189 /* Add this char to the run, or start a new run. */
2190 else if (run_type
== strange
)
2192 /* Initialize a new range. */
2193 run_type
= this_type
;
2196 run_eqv_end
= RE_TRANSLATE (eqv_table
, run_end
);
2200 /* Extend a running range. */
2202 run_eqv_end
= RE_TRANSLATE (eqv_table
, run_end
);
2206 /* If a run is still in progress at the end, finish it now
2207 by recording its equivalent ranges. */
2208 if (run_type
== one_case
)
2210 EXTEND_RANGE_TABLE (work_area
, 2);
2211 work_area
->table
[work_area
->used
++] = run_start
;
2212 work_area
->table
[work_area
->used
++] = run_end
;
2214 else if (run_type
== two_case
)
2216 EXTEND_RANGE_TABLE (work_area
, 4);
2217 work_area
->table
[work_area
->used
++] = run_start
;
2218 work_area
->table
[work_area
->used
++] = run_end
;
2219 work_area
->table
[work_area
->used
++]
2220 = RE_TRANSLATE (eqv_table
, run_start
);
2221 work_area
->table
[work_area
->used
++]
2222 = RE_TRANSLATE (eqv_table
, run_end
);
2230 /* Record the the image of the range start..end when passed through
2231 TRANSLATE. This is not necessarily TRANSLATE(start)..TRANSLATE(end)
2232 and is not even necessarily contiguous.
2233 Normally we approximate it with the smallest contiguous range that contains
2234 all the chars we need. However, for Latin-1 we go to extra effort
2237 This function is not called for ASCII ranges.
2239 Returns -1 if successful, REG_ESPACE if ran out of space. */
2242 set_image_of_range (work_area
, start
, end
, translate
)
2243 RE_TRANSLATE_TYPE translate
;
2244 struct range_table_work_area
*work_area
;
2245 re_wchar_t start
, end
;
2247 re_wchar_t cmin
, cmax
;
2250 /* For Latin-1 ranges, use set_image_of_range_1
2251 to get proper handling of ranges that include letters and nonletters.
2252 For a range that includes the whole of Latin-1, this is not necessary.
2253 For other character sets, we don't bother to get this right. */
2254 if (RE_TRANSLATE_P (translate
) && start
< 04400
2255 && !(start
< 04200 && end
>= 04377))
2262 tem
= set_image_of_range_1 (work_area
, start
, newend
, translate
);
2272 EXTEND_RANGE_TABLE (work_area
, 2);
2273 work_area
->table
[work_area
->used
++] = (start
);
2274 work_area
->table
[work_area
->used
++] = (end
);
2276 cmin
= -1, cmax
= -1;
2278 if (RE_TRANSLATE_P (translate
))
2282 for (ch
= start
; ch
<= end
; ch
++)
2284 re_wchar_t c
= TRANSLATE (ch
);
2285 if (! (start
<= c
&& c
<= end
))
2291 cmin
= MIN (cmin
, c
);
2292 cmax
= MAX (cmax
, c
);
2299 EXTEND_RANGE_TABLE (work_area
, 2);
2300 work_area
->table
[work_area
->used
++] = (cmin
);
2301 work_area
->table
[work_area
->used
++] = (cmax
);
2308 #ifndef MATCH_MAY_ALLOCATE
2310 /* If we cannot allocate large objects within re_match_2_internal,
2311 we make the fail stack and register vectors global.
2312 The fail stack, we grow to the maximum size when a regexp
2314 The register vectors, we adjust in size each time we
2315 compile a regexp, according to the number of registers it needs. */
2317 static fail_stack_type fail_stack
;
2319 /* Size with which the following vectors are currently allocated.
2320 That is so we can make them bigger as needed,
2321 but never make them smaller. */
2322 static int regs_allocated_size
;
2324 static re_char
** regstart
, ** regend
;
2325 static re_char
**best_regstart
, **best_regend
;
2327 /* Make the register vectors big enough for NUM_REGS registers,
2328 but don't make them smaller. */
2331 regex_grow_registers (num_regs
)
2334 if (num_regs
> regs_allocated_size
)
2336 RETALLOC_IF (regstart
, num_regs
, re_char
*);
2337 RETALLOC_IF (regend
, num_regs
, re_char
*);
2338 RETALLOC_IF (best_regstart
, num_regs
, re_char
*);
2339 RETALLOC_IF (best_regend
, num_regs
, re_char
*);
2341 regs_allocated_size
= num_regs
;
2345 #endif /* not MATCH_MAY_ALLOCATE */
2347 static boolean group_in_compile_stack
_RE_ARGS ((compile_stack_type
2351 /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
2352 Returns one of error codes defined in `regex.h', or zero for success.
2354 Assumes the `allocated' (and perhaps `buffer') and `translate'
2355 fields are set in BUFP on entry.
2357 If it succeeds, results are put in BUFP (if it returns an error, the
2358 contents of BUFP are undefined):
2359 `buffer' is the compiled pattern;
2360 `syntax' is set to SYNTAX;
2361 `used' is set to the length of the compiled pattern;
2362 `fastmap_accurate' is zero;
2363 `re_nsub' is the number of subexpressions in PATTERN;
2364 `not_bol' and `not_eol' are zero;
2366 The `fastmap' field is neither examined nor set. */
2368 /* Insert the `jump' from the end of last alternative to "here".
2369 The space for the jump has already been allocated. */
2370 #define FIXUP_ALT_JUMP() \
2372 if (fixup_alt_jump) \
2373 STORE_JUMP (jump, fixup_alt_jump, b); \
2377 /* Return, freeing storage we allocated. */
2378 #define FREE_STACK_RETURN(value) \
2380 FREE_RANGE_TABLE_WORK_AREA (range_table_work); \
2381 free (compile_stack.stack); \
2385 static reg_errcode_t
2386 regex_compile (pattern
, size
, syntax
, bufp
)
2389 reg_syntax_t syntax
;
2390 struct re_pattern_buffer
*bufp
;
2392 /* We fetch characters from PATTERN here. */
2393 register re_wchar_t c
, c1
;
2395 /* A random temporary spot in PATTERN. */
2398 /* Points to the end of the buffer, where we should append. */
2399 register unsigned char *b
;
2401 /* Keeps track of unclosed groups. */
2402 compile_stack_type compile_stack
;
2404 /* Points to the current (ending) position in the pattern. */
2406 /* `const' makes AIX compiler fail. */
2407 unsigned char *p
= pattern
;
2409 re_char
*p
= pattern
;
2411 re_char
*pend
= pattern
+ size
;
2413 /* How to translate the characters in the pattern. */
2414 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
2416 /* Address of the count-byte of the most recently inserted `exactn'
2417 command. This makes it possible to tell if a new exact-match
2418 character can be added to that command or if the character requires
2419 a new `exactn' command. */
2420 unsigned char *pending_exact
= 0;
2422 /* Address of start of the most recently finished expression.
2423 This tells, e.g., postfix * where to find the start of its
2424 operand. Reset at the beginning of groups and alternatives. */
2425 unsigned char *laststart
= 0;
2427 /* Address of beginning of regexp, or inside of last group. */
2428 unsigned char *begalt
;
2430 /* Place in the uncompiled pattern (i.e., the {) to
2431 which to go back if the interval is invalid. */
2432 re_char
*beg_interval
;
2434 /* Address of the place where a forward jump should go to the end of
2435 the containing expression. Each alternative of an `or' -- except the
2436 last -- ends with a forward jump of this sort. */
2437 unsigned char *fixup_alt_jump
= 0;
2439 /* Counts open-groups as they are encountered. Remembered for the
2440 matching close-group on the compile stack, so the same register
2441 number is put in the stop_memory as the start_memory. */
2442 regnum_t regnum
= 0;
2444 /* Work area for range table of charset. */
2445 struct range_table_work_area range_table_work
;
2447 /* If the object matched can contain multibyte characters. */
2448 const boolean multibyte
= RE_MULTIBYTE_P (bufp
);
2450 /* Nonzero if we have pushed down into a subpattern. */
2451 int in_subpattern
= 0;
2453 /* These hold the values of p, pattern, and pend from the main
2454 pattern when we have pushed into a subpattern. */
2456 re_char
*main_pattern
;
2461 DEBUG_PRINT1 ("\nCompiling pattern: ");
2464 unsigned debug_count
;
2466 for (debug_count
= 0; debug_count
< size
; debug_count
++)
2467 putchar (pattern
[debug_count
]);
2472 /* Initialize the compile stack. */
2473 compile_stack
.stack
= TALLOC (INIT_COMPILE_STACK_SIZE
, compile_stack_elt_t
);
2474 if (compile_stack
.stack
== NULL
)
2477 compile_stack
.size
= INIT_COMPILE_STACK_SIZE
;
2478 compile_stack
.avail
= 0;
2480 range_table_work
.table
= 0;
2481 range_table_work
.allocated
= 0;
2483 /* Initialize the pattern buffer. */
2484 bufp
->syntax
= syntax
;
2485 bufp
->fastmap_accurate
= 0;
2486 bufp
->not_bol
= bufp
->not_eol
= 0;
2488 /* Set `used' to zero, so that if we return an error, the pattern
2489 printer (for debugging) will think there's no pattern. We reset it
2493 /* Always count groups, whether or not bufp->no_sub is set. */
2496 #if !defined emacs && !defined SYNTAX_TABLE
2497 /* Initialize the syntax table. */
2498 init_syntax_once ();
2501 if (bufp
->allocated
== 0)
2504 { /* If zero allocated, but buffer is non-null, try to realloc
2505 enough space. This loses if buffer's address is bogus, but
2506 that is the user's responsibility. */
2507 RETALLOC (bufp
->buffer
, INIT_BUF_SIZE
, unsigned char);
2510 { /* Caller did not allocate a buffer. Do it for them. */
2511 bufp
->buffer
= TALLOC (INIT_BUF_SIZE
, unsigned char);
2513 if (!bufp
->buffer
) FREE_STACK_RETURN (REG_ESPACE
);
2515 bufp
->allocated
= INIT_BUF_SIZE
;
2518 begalt
= b
= bufp
->buffer
;
2520 /* Loop through the uncompiled pattern until we're at the end. */
2525 /* If this is the end of an included regexp,
2526 pop back to the main regexp and try again. */
2530 pattern
= main_pattern
;
2535 /* If this is the end of the main regexp, we are done. */
2547 /* If there's no special whitespace regexp, treat
2549 if (!whitespace_regexp
)
2552 /* Peek past following spaces. */
2559 /* If the spaces are followed by a repetition op,
2560 treat them normally. */
2562 || (*p1
== '*' || *p1
== '+' || *p1
== '?'
2563 || (*p1
== '\\' && p1
+ 1 != pend
&& p1
[1] == '{')))
2566 /* Replace the spaces with the whitespace regexp. */
2570 main_pattern
= pattern
;
2571 p
= pattern
= whitespace_regexp
;
2572 pend
= p
+ strlen (p
);
2578 if ( /* If at start of pattern, it's an operator. */
2580 /* If context independent, it's an operator. */
2581 || syntax
& RE_CONTEXT_INDEP_ANCHORS
2582 /* Otherwise, depends on what's come before. */
2583 || at_begline_loc_p (pattern
, p
, syntax
))
2584 BUF_PUSH ((syntax
& RE_NO_NEWLINE_ANCHOR
) ? begbuf
: begline
);
2593 if ( /* If at end of pattern, it's an operator. */
2595 /* If context independent, it's an operator. */
2596 || syntax
& RE_CONTEXT_INDEP_ANCHORS
2597 /* Otherwise, depends on what's next. */
2598 || at_endline_loc_p (p
, pend
, syntax
))
2599 BUF_PUSH ((syntax
& RE_NO_NEWLINE_ANCHOR
) ? endbuf
: endline
);
2608 if ((syntax
& RE_BK_PLUS_QM
)
2609 || (syntax
& RE_LIMITED_OPS
))
2613 /* If there is no previous pattern... */
2616 if (syntax
& RE_CONTEXT_INVALID_OPS
)
2617 FREE_STACK_RETURN (REG_BADRPT
);
2618 else if (!(syntax
& RE_CONTEXT_INDEP_OPS
))
2623 /* 1 means zero (many) matches is allowed. */
2624 boolean zero_times_ok
= 0, many_times_ok
= 0;
2627 /* If there is a sequence of repetition chars, collapse it
2628 down to just one (the right one). We can't combine
2629 interval operators with these because of, e.g., `a{2}*',
2630 which should only match an even number of `a's. */
2634 if ((syntax
& RE_FRUGAL
)
2635 && c
== '?' && (zero_times_ok
|| many_times_ok
))
2639 zero_times_ok
|= c
!= '+';
2640 many_times_ok
|= c
!= '?';
2646 || (!(syntax
& RE_BK_PLUS_QM
)
2647 && (*p
== '+' || *p
== '?')))
2649 else if (syntax
& RE_BK_PLUS_QM
&& *p
== '\\')
2652 FREE_STACK_RETURN (REG_EESCAPE
);
2653 if (p
[1] == '+' || p
[1] == '?')
2654 PATFETCH (c
); /* Gobble up the backslash. */
2660 /* If we get here, we found another repeat character. */
2664 /* Star, etc. applied to an empty pattern is equivalent
2665 to an empty pattern. */
2666 if (!laststart
|| laststart
== b
)
2669 /* Now we know whether or not zero matches is allowed
2670 and also whether or not two or more matches is allowed. */
2675 boolean simple
= skip_one_char (laststart
) == b
;
2676 unsigned int startoffset
= 0;
2678 /* Check if the loop can match the empty string. */
2679 (simple
|| !analyse_first (laststart
, b
, NULL
, 0))
2680 ? on_failure_jump
: on_failure_jump_loop
;
2681 assert (skip_one_char (laststart
) <= b
);
2683 if (!zero_times_ok
&& simple
)
2684 { /* Since simple * loops can be made faster by using
2685 on_failure_keep_string_jump, we turn simple P+
2686 into PP* if P is simple. */
2687 unsigned char *p1
, *p2
;
2688 startoffset
= b
- laststart
;
2689 GET_BUFFER_SPACE (startoffset
);
2690 p1
= b
; p2
= laststart
;
2696 GET_BUFFER_SPACE (6);
2699 STORE_JUMP (ofj
, b
, b
+ 6);
2701 /* Simple * loops can use on_failure_keep_string_jump
2702 depending on what follows. But since we don't know
2703 that yet, we leave the decision up to
2704 on_failure_jump_smart. */
2705 INSERT_JUMP (simple
? on_failure_jump_smart
: ofj
,
2706 laststart
+ startoffset
, b
+ 6);
2708 STORE_JUMP (jump
, b
, laststart
+ startoffset
);
2713 /* A simple ? pattern. */
2714 assert (zero_times_ok
);
2715 GET_BUFFER_SPACE (3);
2716 INSERT_JUMP (on_failure_jump
, laststart
, b
+ 3);
2720 else /* not greedy */
2721 { /* I wish the greedy and non-greedy cases could be merged. */
2723 GET_BUFFER_SPACE (7); /* We might use less. */
2726 boolean emptyp
= analyse_first (laststart
, b
, NULL
, 0);
2728 /* The non-greedy multiple match looks like
2729 a repeat..until: we only need a conditional jump
2730 at the end of the loop. */
2731 if (emptyp
) BUF_PUSH (no_op
);
2732 STORE_JUMP (emptyp
? on_failure_jump_nastyloop
2733 : on_failure_jump
, b
, laststart
);
2737 /* The repeat...until naturally matches one or more.
2738 To also match zero times, we need to first jump to
2739 the end of the loop (its conditional jump). */
2740 INSERT_JUMP (jump
, laststart
, b
);
2746 /* non-greedy a?? */
2747 INSERT_JUMP (jump
, laststart
, b
+ 3);
2749 INSERT_JUMP (on_failure_jump
, laststart
, laststart
+ 6);
2766 CLEAR_RANGE_TABLE_WORK_USED (range_table_work
);
2768 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2770 /* Ensure that we have enough space to push a charset: the
2771 opcode, the length count, and the bitset; 34 bytes in all. */
2772 GET_BUFFER_SPACE (34);
2776 /* We test `*p == '^' twice, instead of using an if
2777 statement, so we only need one BUF_PUSH. */
2778 BUF_PUSH (*p
== '^' ? charset_not
: charset
);
2782 /* Remember the first position in the bracket expression. */
2785 /* Push the number of bytes in the bitmap. */
2786 BUF_PUSH ((1 << BYTEWIDTH
) / BYTEWIDTH
);
2788 /* Clear the whole map. */
2789 bzero (b
, (1 << BYTEWIDTH
) / BYTEWIDTH
);
2791 /* charset_not matches newline according to a syntax bit. */
2792 if ((re_opcode_t
) b
[-2] == charset_not
2793 && (syntax
& RE_HAT_LISTS_NOT_NEWLINE
))
2794 SET_LIST_BIT ('\n');
2796 /* Read in characters and ranges, setting map bits. */
2799 boolean escaped_char
= false;
2800 const unsigned char *p2
= p
;
2802 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2804 /* Don't translate yet. The range TRANSLATE(X..Y) cannot
2805 always be determined from TRANSLATE(X) and TRANSLATE(Y)
2806 So the translation is done later in a loop. Example:
2807 (let ((case-fold-search t)) (string-match "[A-_]" "A")) */
2810 /* \ might escape characters inside [...] and [^...]. */
2811 if ((syntax
& RE_BACKSLASH_ESCAPE_IN_LISTS
) && c
== '\\')
2813 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2816 escaped_char
= true;
2820 /* Could be the end of the bracket expression. If it's
2821 not (i.e., when the bracket expression is `[]' so
2822 far), the ']' character bit gets set way below. */
2823 if (c
== ']' && p2
!= p1
)
2827 /* What should we do for the character which is
2828 greater than 0x7F, but not BASE_LEADING_CODE_P?
2831 /* See if we're at the beginning of a possible character
2834 if (!escaped_char
&&
2835 syntax
& RE_CHAR_CLASSES
&& c
== '[' && *p
== ':')
2837 /* Leave room for the null. */
2838 unsigned char str
[CHAR_CLASS_MAX_LENGTH
+ 1];
2839 const unsigned char *class_beg
;
2845 /* If pattern is `[[:'. */
2846 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2851 if ((c
== ':' && *p
== ']') || p
== pend
)
2853 if (c1
< CHAR_CLASS_MAX_LENGTH
)
2856 /* This is in any case an invalid class name. */
2861 /* If isn't a word bracketed by `[:' and `:]':
2862 undo the ending character, the letters, and
2863 leave the leading `:' and `[' (but set bits for
2865 if (c
== ':' && *p
== ']')
2870 cc
= re_wctype (str
);
2873 FREE_STACK_RETURN (REG_ECTYPE
);
2875 /* Throw away the ] at the end of the character
2879 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2881 /* Most character classes in a multibyte match
2882 just set a flag. Exceptions are is_blank,
2883 is_digit, is_cntrl, and is_xdigit, since
2884 they can only match ASCII characters. We
2885 don't need to handle them for multibyte.
2886 They are distinguished by a negative wctype. */
2889 SET_RANGE_TABLE_WORK_AREA_BIT (range_table_work
,
2890 re_wctype_to_bit (cc
));
2892 for (ch
= 0; ch
< 1 << BYTEWIDTH
; ++ch
)
2894 int translated
= TRANSLATE (ch
);
2895 if (re_iswctype (btowc (ch
), cc
))
2896 SET_LIST_BIT (translated
);
2899 /* Repeat the loop. */
2904 /* Go back to right after the "[:". */
2908 /* Because the `:' may starts the range, we
2909 can't simply set bit and repeat the loop.
2910 Instead, just set it to C and handle below. */
2915 if (p
< pend
&& p
[0] == '-' && p
[1] != ']')
2918 /* Discard the `-'. */
2921 /* Fetch the character which ends the range. */
2924 if (SINGLE_BYTE_CHAR_P (c
))
2926 if (! SINGLE_BYTE_CHAR_P (c1
))
2928 /* Handle a range starting with a
2929 character of less than 256, and ending
2930 with a character of not less than 256.
2931 Split that into two ranges, the low one
2932 ending at 0377, and the high one
2933 starting at the smallest character in
2934 the charset of C1 and ending at C1. */
2935 int charset
= CHAR_CHARSET (c1
);
2936 re_wchar_t c2
= MAKE_CHAR (charset
, 0, 0);
2938 SET_RANGE_TABLE_WORK_AREA (range_table_work
,
2943 else if (!SAME_CHARSET_P (c
, c1
))
2944 FREE_STACK_RETURN (REG_ERANGEX
);
2947 /* Range from C to C. */
2950 /* Set the range ... */
2951 if (SINGLE_BYTE_CHAR_P (c
))
2952 /* ... into bitmap. */
2954 re_wchar_t this_char
;
2955 re_wchar_t range_start
= c
, range_end
= c1
;
2957 /* If the start is after the end, the range is empty. */
2958 if (range_start
> range_end
)
2960 if (syntax
& RE_NO_EMPTY_RANGES
)
2961 FREE_STACK_RETURN (REG_ERANGE
);
2962 /* Else, repeat the loop. */
2966 for (this_char
= range_start
; this_char
<= range_end
;
2968 SET_LIST_BIT (TRANSLATE (this_char
));
2972 /* ... into range table. */
2973 SET_RANGE_TABLE_WORK_AREA (range_table_work
, c
, c1
);
2976 /* Discard any (non)matching list bytes that are all 0 at the
2977 end of the map. Decrease the map-length byte too. */
2978 while ((int) b
[-1] > 0 && b
[b
[-1] - 1] == 0)
2982 /* Build real range table from work area. */
2983 if (RANGE_TABLE_WORK_USED (range_table_work
)
2984 || RANGE_TABLE_WORK_BITS (range_table_work
))
2987 int used
= RANGE_TABLE_WORK_USED (range_table_work
);
2989 /* Allocate space for COUNT + RANGE_TABLE. Needs two
2990 bytes for flags, two for COUNT, and three bytes for
2992 GET_BUFFER_SPACE (4 + used
* 3);
2994 /* Indicate the existence of range table. */
2995 laststart
[1] |= 0x80;
2997 /* Store the character class flag bits into the range table.
2998 If not in emacs, these flag bits are always 0. */
2999 *b
++ = RANGE_TABLE_WORK_BITS (range_table_work
) & 0xff;
3000 *b
++ = RANGE_TABLE_WORK_BITS (range_table_work
) >> 8;
3002 STORE_NUMBER_AND_INCR (b
, used
/ 2);
3003 for (i
= 0; i
< used
; i
++)
3004 STORE_CHARACTER_AND_INCR
3005 (b
, RANGE_TABLE_WORK_ELT (range_table_work
, i
));
3012 if (syntax
& RE_NO_BK_PARENS
)
3019 if (syntax
& RE_NO_BK_PARENS
)
3026 if (syntax
& RE_NEWLINE_ALT
)
3033 if (syntax
& RE_NO_BK_VBAR
)
3040 if (syntax
& RE_INTERVALS
&& syntax
& RE_NO_BK_BRACES
)
3041 goto handle_interval
;
3047 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
3049 /* Do not translate the character after the \, so that we can
3050 distinguish, e.g., \B from \b, even if we normally would
3051 translate, e.g., B to b. */
3057 if (syntax
& RE_NO_BK_PARENS
)
3058 goto normal_backslash
;
3065 /* Look for a special (?...) construct */
3066 if ((syntax
& RE_SHY_GROUPS
) && *p
== '?')
3068 PATFETCH (c
); /* Gobble up the '?'. */
3072 case ':': shy
= 1; break;
3074 /* Only (?:...) is supported right now. */
3075 FREE_STACK_RETURN (REG_BADPAT
);
3086 if (COMPILE_STACK_FULL
)
3088 RETALLOC (compile_stack
.stack
, compile_stack
.size
<< 1,
3089 compile_stack_elt_t
);
3090 if (compile_stack
.stack
== NULL
) return REG_ESPACE
;
3092 compile_stack
.size
<<= 1;
3095 /* These are the values to restore when we hit end of this
3096 group. They are all relative offsets, so that if the
3097 whole pattern moves because of realloc, they will still
3099 COMPILE_STACK_TOP
.begalt_offset
= begalt
- bufp
->buffer
;
3100 COMPILE_STACK_TOP
.fixup_alt_jump
3101 = fixup_alt_jump
? fixup_alt_jump
- bufp
->buffer
+ 1 : 0;
3102 COMPILE_STACK_TOP
.laststart_offset
= b
- bufp
->buffer
;
3103 COMPILE_STACK_TOP
.regnum
= shy
? -regnum
: regnum
;
3106 start_memory for groups beyond the last one we can
3107 represent in the compiled pattern. */
3108 if (regnum
<= MAX_REGNUM
&& !shy
)
3109 BUF_PUSH_2 (start_memory
, regnum
);
3111 compile_stack
.avail
++;
3116 /* If we've reached MAX_REGNUM groups, then this open
3117 won't actually generate any code, so we'll have to
3118 clear pending_exact explicitly. */
3124 if (syntax
& RE_NO_BK_PARENS
) goto normal_backslash
;
3126 if (COMPILE_STACK_EMPTY
)
3128 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
3129 goto normal_backslash
;
3131 FREE_STACK_RETURN (REG_ERPAREN
);
3137 /* See similar code for backslashed left paren above. */
3138 if (COMPILE_STACK_EMPTY
)
3140 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
3143 FREE_STACK_RETURN (REG_ERPAREN
);
3146 /* Since we just checked for an empty stack above, this
3147 ``can't happen''. */
3148 assert (compile_stack
.avail
!= 0);
3150 /* We don't just want to restore into `regnum', because
3151 later groups should continue to be numbered higher,
3152 as in `(ab)c(de)' -- the second group is #2. */
3153 regnum_t this_group_regnum
;
3155 compile_stack
.avail
--;
3156 begalt
= bufp
->buffer
+ COMPILE_STACK_TOP
.begalt_offset
;
3158 = COMPILE_STACK_TOP
.fixup_alt_jump
3159 ? bufp
->buffer
+ COMPILE_STACK_TOP
.fixup_alt_jump
- 1
3161 laststart
= bufp
->buffer
+ COMPILE_STACK_TOP
.laststart_offset
;
3162 this_group_regnum
= COMPILE_STACK_TOP
.regnum
;
3163 /* If we've reached MAX_REGNUM groups, then this open
3164 won't actually generate any code, so we'll have to
3165 clear pending_exact explicitly. */
3168 /* We're at the end of the group, so now we know how many
3169 groups were inside this one. */
3170 if (this_group_regnum
<= MAX_REGNUM
&& this_group_regnum
> 0)
3171 BUF_PUSH_2 (stop_memory
, this_group_regnum
);
3176 case '|': /* `\|'. */
3177 if (syntax
& RE_LIMITED_OPS
|| syntax
& RE_NO_BK_VBAR
)
3178 goto normal_backslash
;
3180 if (syntax
& RE_LIMITED_OPS
)
3183 /* Insert before the previous alternative a jump which
3184 jumps to this alternative if the former fails. */
3185 GET_BUFFER_SPACE (3);
3186 INSERT_JUMP (on_failure_jump
, begalt
, b
+ 6);
3190 /* The alternative before this one has a jump after it
3191 which gets executed if it gets matched. Adjust that
3192 jump so it will jump to this alternative's analogous
3193 jump (put in below, which in turn will jump to the next
3194 (if any) alternative's such jump, etc.). The last such
3195 jump jumps to the correct final destination. A picture:
3201 If we are at `b', then fixup_alt_jump right now points to a
3202 three-byte space after `a'. We'll put in the jump, set
3203 fixup_alt_jump to right after `b', and leave behind three
3204 bytes which we'll fill in when we get to after `c'. */
3208 /* Mark and leave space for a jump after this alternative,
3209 to be filled in later either by next alternative or
3210 when know we're at the end of a series of alternatives. */
3212 GET_BUFFER_SPACE (3);
3221 /* If \{ is a literal. */
3222 if (!(syntax
& RE_INTERVALS
)
3223 /* If we're at `\{' and it's not the open-interval
3225 || (syntax
& RE_NO_BK_BRACES
))
3226 goto normal_backslash
;
3230 /* If got here, then the syntax allows intervals. */
3232 /* At least (most) this many matches must be made. */
3233 int lower_bound
= 0, upper_bound
= -1;
3238 FREE_STACK_RETURN (REG_EBRACE
);
3240 GET_UNSIGNED_NUMBER (lower_bound
);
3243 GET_UNSIGNED_NUMBER (upper_bound
);
3245 /* Interval such as `{1}' => match exactly once. */
3246 upper_bound
= lower_bound
;
3248 if (lower_bound
< 0 || upper_bound
> RE_DUP_MAX
3249 || (upper_bound
>= 0 && lower_bound
> upper_bound
))
3250 FREE_STACK_RETURN (REG_BADBR
);
3252 if (!(syntax
& RE_NO_BK_BRACES
))
3255 FREE_STACK_RETURN (REG_BADBR
);
3261 FREE_STACK_RETURN (REG_BADBR
);
3263 /* We just parsed a valid interval. */
3265 /* If it's invalid to have no preceding re. */
3268 if (syntax
& RE_CONTEXT_INVALID_OPS
)
3269 FREE_STACK_RETURN (REG_BADRPT
);
3270 else if (syntax
& RE_CONTEXT_INDEP_OPS
)
3273 goto unfetch_interval
;
3276 if (upper_bound
== 0)
3277 /* If the upper bound is zero, just drop the sub pattern
3280 else if (lower_bound
== 1 && upper_bound
== 1)
3281 /* Just match it once: nothing to do here. */
3284 /* Otherwise, we have a nontrivial interval. When
3285 we're all done, the pattern will look like:
3286 set_number_at <jump count> <upper bound>
3287 set_number_at <succeed_n count> <lower bound>
3288 succeed_n <after jump addr> <succeed_n count>
3290 jump_n <succeed_n addr> <jump count>
3291 (The upper bound and `jump_n' are omitted if
3292 `upper_bound' is 1, though.) */
3294 { /* If the upper bound is > 1, we need to insert
3295 more at the end of the loop. */
3296 unsigned int nbytes
= (upper_bound
< 0 ? 3
3297 : upper_bound
> 1 ? 5 : 0);
3298 unsigned int startoffset
= 0;
3300 GET_BUFFER_SPACE (20); /* We might use less. */
3302 if (lower_bound
== 0)
3304 /* A succeed_n that starts with 0 is really a
3305 a simple on_failure_jump_loop. */
3306 INSERT_JUMP (on_failure_jump_loop
, laststart
,
3312 /* Initialize lower bound of the `succeed_n', even
3313 though it will be set during matching by its
3314 attendant `set_number_at' (inserted next),
3315 because `re_compile_fastmap' needs to know.
3316 Jump to the `jump_n' we might insert below. */
3317 INSERT_JUMP2 (succeed_n
, laststart
,
3322 /* Code to initialize the lower bound. Insert
3323 before the `succeed_n'. The `5' is the last two
3324 bytes of this `set_number_at', plus 3 bytes of
3325 the following `succeed_n'. */
3326 insert_op2 (set_number_at
, laststart
, 5, lower_bound
, b
);
3331 if (upper_bound
< 0)
3333 /* A negative upper bound stands for infinity,
3334 in which case it degenerates to a plain jump. */
3335 STORE_JUMP (jump
, b
, laststart
+ startoffset
);
3338 else if (upper_bound
> 1)
3339 { /* More than one repetition is allowed, so
3340 append a backward jump to the `succeed_n'
3341 that starts this interval.
3343 When we've reached this during matching,
3344 we'll have matched the interval once, so
3345 jump back only `upper_bound - 1' times. */
3346 STORE_JUMP2 (jump_n
, b
, laststart
+ startoffset
,
3350 /* The location we want to set is the second
3351 parameter of the `jump_n'; that is `b-2' as
3352 an absolute address. `laststart' will be
3353 the `set_number_at' we're about to insert;
3354 `laststart+3' the number to set, the source
3355 for the relative address. But we are
3356 inserting into the middle of the pattern --
3357 so everything is getting moved up by 5.
3358 Conclusion: (b - 2) - (laststart + 3) + 5,
3359 i.e., b - laststart.
3361 We insert this at the beginning of the loop
3362 so that if we fail during matching, we'll
3363 reinitialize the bounds. */
3364 insert_op2 (set_number_at
, laststart
, b
- laststart
,
3365 upper_bound
- 1, b
);
3370 beg_interval
= NULL
;
3375 /* If an invalid interval, match the characters as literals. */
3376 assert (beg_interval
);
3378 beg_interval
= NULL
;
3380 /* normal_char and normal_backslash need `c'. */
3383 if (!(syntax
& RE_NO_BK_BRACES
))
3385 assert (p
> pattern
&& p
[-1] == '\\');
3386 goto normal_backslash
;
3392 /* There is no way to specify the before_dot and after_dot
3393 operators. rms says this is ok. --karl */
3401 BUF_PUSH_2 (syntaxspec
, syntax_spec_code
[c
]);
3407 BUF_PUSH_2 (notsyntaxspec
, syntax_spec_code
[c
]);
3413 BUF_PUSH_2 (categoryspec
, c
);
3419 BUF_PUSH_2 (notcategoryspec
, c
);
3425 if (syntax
& RE_NO_GNU_OPS
)
3428 BUF_PUSH_2 (syntaxspec
, Sword
);
3433 if (syntax
& RE_NO_GNU_OPS
)
3436 BUF_PUSH_2 (notsyntaxspec
, Sword
);
3441 if (syntax
& RE_NO_GNU_OPS
)
3447 if (syntax
& RE_NO_GNU_OPS
)
3453 if (syntax
& RE_NO_GNU_OPS
)
3462 FREE_STACK_RETURN (REG_BADPAT
);
3466 if (syntax
& RE_NO_GNU_OPS
)
3468 BUF_PUSH (wordbound
);
3472 if (syntax
& RE_NO_GNU_OPS
)
3474 BUF_PUSH (notwordbound
);
3478 if (syntax
& RE_NO_GNU_OPS
)
3484 if (syntax
& RE_NO_GNU_OPS
)
3489 case '1': case '2': case '3': case '4': case '5':
3490 case '6': case '7': case '8': case '9':
3494 if (syntax
& RE_NO_BK_REFS
)
3495 goto normal_backslash
;
3499 /* Can't back reference to a subexpression before its end. */
3500 if (reg
> regnum
|| group_in_compile_stack (compile_stack
, reg
))
3501 FREE_STACK_RETURN (REG_ESUBREG
);
3504 BUF_PUSH_2 (duplicate
, reg
);
3511 if (syntax
& RE_BK_PLUS_QM
)
3514 goto normal_backslash
;
3518 /* You might think it would be useful for \ to mean
3519 not to translate; but if we don't translate it
3520 it will never match anything. */
3527 /* Expects the character in `c'. */
3529 /* If no exactn currently being built. */
3532 /* If last exactn not at current position. */
3533 || pending_exact
+ *pending_exact
+ 1 != b
3535 /* We have only one byte following the exactn for the count. */
3536 || *pending_exact
>= (1 << BYTEWIDTH
) - MAX_MULTIBYTE_LENGTH
3538 /* If followed by a repetition operator. */
3539 || (p
!= pend
&& (*p
== '*' || *p
== '^'))
3540 || ((syntax
& RE_BK_PLUS_QM
)
3541 ? p
+ 1 < pend
&& *p
== '\\' && (p
[1] == '+' || p
[1] == '?')
3542 : p
!= pend
&& (*p
== '+' || *p
== '?'))
3543 || ((syntax
& RE_INTERVALS
)
3544 && ((syntax
& RE_NO_BK_BRACES
)
3545 ? p
!= pend
&& *p
== '{'
3546 : p
+ 1 < pend
&& p
[0] == '\\' && p
[1] == '{')))
3548 /* Start building a new exactn. */
3552 BUF_PUSH_2 (exactn
, 0);
3553 pending_exact
= b
- 1;
3556 GET_BUFFER_SPACE (MAX_MULTIBYTE_LENGTH
);
3562 len
= CHAR_STRING (c
, b
);
3566 (*pending_exact
) += len
;
3571 } /* while p != pend */
3574 /* Through the pattern now. */
3578 if (!COMPILE_STACK_EMPTY
)
3579 FREE_STACK_RETURN (REG_EPAREN
);
3581 /* If we don't want backtracking, force success
3582 the first time we reach the end of the compiled pattern. */
3583 if (syntax
& RE_NO_POSIX_BACKTRACKING
)
3586 /* We have succeeded; set the length of the buffer. */
3587 bufp
->used
= b
- bufp
->buffer
;
3592 re_compile_fastmap (bufp
);
3593 DEBUG_PRINT1 ("\nCompiled pattern: \n");
3594 print_compiled_pattern (bufp
);
3599 #ifndef MATCH_MAY_ALLOCATE
3600 /* Initialize the failure stack to the largest possible stack. This
3601 isn't necessary unless we're trying to avoid calling alloca in
3602 the search and match routines. */
3604 int num_regs
= bufp
->re_nsub
+ 1;
3606 if (fail_stack
.size
< re_max_failures
* TYPICAL_FAILURE_SIZE
)
3608 fail_stack
.size
= re_max_failures
* TYPICAL_FAILURE_SIZE
;
3610 if (! fail_stack
.stack
)
3612 = (fail_stack_elt_t
*) malloc (fail_stack
.size
3613 * sizeof (fail_stack_elt_t
));
3616 = (fail_stack_elt_t
*) realloc (fail_stack
.stack
,
3618 * sizeof (fail_stack_elt_t
)));
3621 regex_grow_registers (num_regs
);
3623 #endif /* not MATCH_MAY_ALLOCATE */
3625 FREE_STACK_RETURN (REG_NOERROR
);
3626 } /* regex_compile */
3628 /* Subroutines for `regex_compile'. */
3630 /* Store OP at LOC followed by two-byte integer parameter ARG. */
3633 store_op1 (op
, loc
, arg
)
3638 *loc
= (unsigned char) op
;
3639 STORE_NUMBER (loc
+ 1, arg
);
3643 /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */
3646 store_op2 (op
, loc
, arg1
, arg2
)
3651 *loc
= (unsigned char) op
;
3652 STORE_NUMBER (loc
+ 1, arg1
);
3653 STORE_NUMBER (loc
+ 3, arg2
);
3657 /* Copy the bytes from LOC to END to open up three bytes of space at LOC
3658 for OP followed by two-byte integer parameter ARG. */
3661 insert_op1 (op
, loc
, arg
, end
)
3667 register unsigned char *pfrom
= end
;
3668 register unsigned char *pto
= end
+ 3;
3670 while (pfrom
!= loc
)
3673 store_op1 (op
, loc
, arg
);
3677 /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */
3680 insert_op2 (op
, loc
, arg1
, arg2
, end
)
3686 register unsigned char *pfrom
= end
;
3687 register unsigned char *pto
= end
+ 5;
3689 while (pfrom
!= loc
)
3692 store_op2 (op
, loc
, arg1
, arg2
);
3696 /* P points to just after a ^ in PATTERN. Return true if that ^ comes
3697 after an alternative or a begin-subexpression. We assume there is at
3698 least one character before the ^. */
3701 at_begline_loc_p (pattern
, p
, syntax
)
3702 re_char
*pattern
, *p
;
3703 reg_syntax_t syntax
;
3705 re_char
*prev
= p
- 2;
3706 boolean prev_prev_backslash
= prev
> pattern
&& prev
[-1] == '\\';
3709 /* After a subexpression? */
3710 (*prev
== '(' && (syntax
& RE_NO_BK_PARENS
|| prev_prev_backslash
))
3711 /* After an alternative? */
3712 || (*prev
== '|' && (syntax
& RE_NO_BK_VBAR
|| prev_prev_backslash
))
3713 /* After a shy subexpression? */
3714 || ((syntax
& RE_SHY_GROUPS
) && prev
- 2 >= pattern
3715 && prev
[-1] == '?' && prev
[-2] == '('
3716 && (syntax
& RE_NO_BK_PARENS
3717 || (prev
- 3 >= pattern
&& prev
[-3] == '\\')));
3721 /* The dual of at_begline_loc_p. This one is for $. We assume there is
3722 at least one character after the $, i.e., `P < PEND'. */
3725 at_endline_loc_p (p
, pend
, syntax
)
3727 reg_syntax_t syntax
;
3730 boolean next_backslash
= *next
== '\\';
3731 re_char
*next_next
= p
+ 1 < pend
? p
+ 1 : 0;
3734 /* Before a subexpression? */
3735 (syntax
& RE_NO_BK_PARENS
? *next
== ')'
3736 : next_backslash
&& next_next
&& *next_next
== ')')
3737 /* Before an alternative? */
3738 || (syntax
& RE_NO_BK_VBAR
? *next
== '|'
3739 : next_backslash
&& next_next
&& *next_next
== '|');
3743 /* Returns true if REGNUM is in one of COMPILE_STACK's elements and
3744 false if it's not. */
3747 group_in_compile_stack (compile_stack
, regnum
)
3748 compile_stack_type compile_stack
;
3753 for (this_element
= compile_stack
.avail
- 1;
3756 if (compile_stack
.stack
[this_element
].regnum
== regnum
)
3763 If fastmap is non-NULL, go through the pattern and fill fastmap
3764 with all the possible leading chars. If fastmap is NULL, don't
3765 bother filling it up (obviously) and only return whether the
3766 pattern could potentially match the empty string.
3768 Return 1 if p..pend might match the empty string.
3769 Return 0 if p..pend matches at least one char.
3770 Return -1 if fastmap was not updated accurately. */
3773 analyse_first (p
, pend
, fastmap
, multibyte
)
3776 const int multibyte
;
3781 /* If all elements for base leading-codes in fastmap is set, this
3782 flag is set true. */
3783 boolean match_any_multibyte_characters
= false;
3787 /* The loop below works as follows:
3788 - It has a working-list kept in the PATTERN_STACK and which basically
3789 starts by only containing a pointer to the first operation.
3790 - If the opcode we're looking at is a match against some set of
3791 chars, then we add those chars to the fastmap and go on to the
3792 next work element from the worklist (done via `break').
3793 - If the opcode is a control operator on the other hand, we either
3794 ignore it (if it's meaningless at this point, such as `start_memory')
3795 or execute it (if it's a jump). If the jump has several destinations
3796 (i.e. `on_failure_jump'), then we push the other destination onto the
3798 We guarantee termination by ignoring backward jumps (more or less),
3799 so that `p' is monotonically increasing. More to the point, we
3800 never set `p' (or push) anything `<= p1'. */
3804 /* `p1' is used as a marker of how far back a `on_failure_jump'
3805 can go without being ignored. It is normally equal to `p'
3806 (which prevents any backward `on_failure_jump') except right
3807 after a plain `jump', to allow patterns such as:
3810 10: on_failure_jump 3
3811 as used for the *? operator. */
3814 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
3821 /* If the first character has to match a backreference, that means
3822 that the group was empty (since it already matched). Since this
3823 is the only case that interests us here, we can assume that the
3824 backreference must match the empty string. */
3829 /* Following are the cases which match a character. These end
3835 int c
= RE_STRING_CHAR (p
+ 1, pend
- p
);
3837 if (SINGLE_BYTE_CHAR_P (c
))
3846 /* We could put all the chars except for \n (and maybe \0)
3847 but we don't bother since it is generally not worth it. */
3848 if (!fastmap
) break;
3853 /* Chars beyond end of bitmap are possible matches.
3854 All the single-byte codes can occur in multibyte buffers.
3855 So any that are not listed in the charset
3856 are possible matches, even in multibyte buffers. */
3857 if (!fastmap
) break;
3858 for (j
= CHARSET_BITMAP_SIZE (&p
[-1]) * BYTEWIDTH
;
3859 j
< (1 << BYTEWIDTH
); j
++)
3863 if (!fastmap
) break;
3864 not = (re_opcode_t
) *(p
- 1) == charset_not
;
3865 for (j
= CHARSET_BITMAP_SIZE (&p
[-1]) * BYTEWIDTH
- 1, p
++;
3867 if (!!(p
[j
/ BYTEWIDTH
] & (1 << (j
% BYTEWIDTH
))) ^ not)
3870 if ((not && multibyte
)
3871 /* Any character set can possibly contain a character
3872 which doesn't match the specified set of characters. */
3873 || (CHARSET_RANGE_TABLE_EXISTS_P (&p
[-2])
3874 && CHARSET_RANGE_TABLE_BITS (&p
[-2]) != 0))
3875 /* If we can match a character class, we can match
3876 any character set. */
3878 set_fastmap_for_multibyte_characters
:
3879 if (match_any_multibyte_characters
== false)
3881 for (j
= 0x80; j
< 0xA0; j
++) /* XXX */
3882 if (BASE_LEADING_CODE_P (j
))
3884 match_any_multibyte_characters
= true;
3888 else if (!not && CHARSET_RANGE_TABLE_EXISTS_P (&p
[-2])
3889 && match_any_multibyte_characters
== false)
3891 /* Set fastmap[I] 1 where I is a base leading code of each
3892 multibyte character in the range table. */
3895 /* Make P points the range table. `+ 2' is to skip flag
3896 bits for a character class. */
3897 p
+= CHARSET_BITMAP_SIZE (&p
[-2]) + 2;
3899 /* Extract the number of ranges in range table into COUNT. */
3900 EXTRACT_NUMBER_AND_INCR (count
, p
);
3901 for (; count
> 0; count
--, p
+= 2 * 3) /* XXX */
3903 /* Extract the start of each range. */
3904 EXTRACT_CHARACTER (c
, p
);
3905 j
= CHAR_CHARSET (c
);
3906 fastmap
[CHARSET_LEADING_CODE_BASE (j
)] = 1;
3913 if (!fastmap
) break;
3915 not = (re_opcode_t
)p
[-1] == notsyntaxspec
;
3917 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3918 if ((SYNTAX (j
) == (enum syntaxcode
) k
) ^ not)
3922 /* This match depends on text properties. These end with
3923 aborting optimizations. */
3927 case notcategoryspec
:
3928 if (!fastmap
) break;
3929 not = (re_opcode_t
)p
[-1] == notcategoryspec
;
3931 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3932 if ((CHAR_HAS_CATEGORY (j
, k
)) ^ not)
3936 /* Any character set can possibly contain a character
3937 whose category is K (or not). */
3938 goto set_fastmap_for_multibyte_characters
;
3941 /* All cases after this match the empty string. These end with
3963 EXTRACT_NUMBER_AND_INCR (j
, p
);
3965 /* Backward jumps can only go back to code that we've already
3966 visited. `re_compile' should make sure this is true. */
3969 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
))
3971 case on_failure_jump
:
3972 case on_failure_keep_string_jump
:
3973 case on_failure_jump_loop
:
3974 case on_failure_jump_nastyloop
:
3975 case on_failure_jump_smart
:
3981 /* Keep `p1' to allow the `on_failure_jump' we are jumping to
3982 to jump back to "just after here". */
3985 case on_failure_jump
:
3986 case on_failure_keep_string_jump
:
3987 case on_failure_jump_nastyloop
:
3988 case on_failure_jump_loop
:
3989 case on_failure_jump_smart
:
3990 EXTRACT_NUMBER_AND_INCR (j
, p
);
3992 ; /* Backward jump to be ignored. */
3994 { /* We have to look down both arms.
3995 We first go down the "straight" path so as to minimize
3996 stack usage when going through alternatives. */
3997 int r
= analyse_first (p
, pend
, fastmap
, multibyte
);
4005 /* This code simply does not properly handle forward jump_n. */
4006 DEBUG_STATEMENT (EXTRACT_NUMBER (j
, p
); assert (j
< 0));
4008 /* jump_n can either jump or fall through. The (backward) jump
4009 case has already been handled, so we only need to look at the
4010 fallthrough case. */
4014 /* If N == 0, it should be an on_failure_jump_loop instead. */
4015 DEBUG_STATEMENT (EXTRACT_NUMBER (j
, p
+ 2); assert (j
> 0));
4017 /* We only care about one iteration of the loop, so we don't
4018 need to consider the case where this behaves like an
4035 abort (); /* We have listed all the cases. */
4038 /* Getting here means we have found the possible starting
4039 characters for one path of the pattern -- and that the empty
4040 string does not match. We need not follow this path further. */
4044 /* We reached the end without matching anything. */
4047 } /* analyse_first */
4049 /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
4050 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
4051 characters can start a string that matches the pattern. This fastmap
4052 is used by re_search to skip quickly over impossible starting points.
4054 Character codes above (1 << BYTEWIDTH) are not represented in the
4055 fastmap, but the leading codes are represented. Thus, the fastmap
4056 indicates which character sets could start a match.
4058 The caller must supply the address of a (1 << BYTEWIDTH)-byte data
4059 area as BUFP->fastmap.
4061 We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
4064 Returns 0 if we succeed, -2 if an internal error. */
4067 re_compile_fastmap (bufp
)
4068 struct re_pattern_buffer
*bufp
;
4070 char *fastmap
= bufp
->fastmap
;
4073 assert (fastmap
&& bufp
->buffer
);
4075 bzero (fastmap
, 1 << BYTEWIDTH
); /* Assume nothing's valid. */
4076 bufp
->fastmap_accurate
= 1; /* It will be when we're done. */
4078 analysis
= analyse_first (bufp
->buffer
, bufp
->buffer
+ bufp
->used
,
4079 fastmap
, RE_MULTIBYTE_P (bufp
));
4080 bufp
->can_be_null
= (analysis
!= 0);
4082 } /* re_compile_fastmap */
4084 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
4085 ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use
4086 this memory for recording register information. STARTS and ENDS
4087 must be allocated using the malloc library routine, and must each
4088 be at least NUM_REGS * sizeof (regoff_t) bytes long.
4090 If NUM_REGS == 0, then subsequent matches should allocate their own
4093 Unless this function is called, the first search or match using
4094 PATTERN_BUFFER will allocate its own register data, without
4095 freeing the old data. */
4098 re_set_registers (bufp
, regs
, num_regs
, starts
, ends
)
4099 struct re_pattern_buffer
*bufp
;
4100 struct re_registers
*regs
;
4102 regoff_t
*starts
, *ends
;
4106 bufp
->regs_allocated
= REGS_REALLOCATE
;
4107 regs
->num_regs
= num_regs
;
4108 regs
->start
= starts
;
4113 bufp
->regs_allocated
= REGS_UNALLOCATED
;
4115 regs
->start
= regs
->end
= (regoff_t
*) 0;
4118 WEAK_ALIAS (__re_set_registers
, re_set_registers
)
4120 /* Searching routines. */
4122 /* Like re_search_2, below, but only one string is specified, and
4123 doesn't let you say where to stop matching. */
4126 re_search (bufp
, string
, size
, startpos
, range
, regs
)
4127 struct re_pattern_buffer
*bufp
;
4129 int size
, startpos
, range
;
4130 struct re_registers
*regs
;
4132 return re_search_2 (bufp
, NULL
, 0, string
, size
, startpos
, range
,
4135 WEAK_ALIAS (__re_search
, re_search
)
4137 /* Head address of virtual concatenation of string. */
4138 #define HEAD_ADDR_VSTRING(P) \
4139 (((P) >= size1 ? string2 : string1))
4141 /* End address of virtual concatenation of string. */
4142 #define STOP_ADDR_VSTRING(P) \
4143 (((P) >= size1 ? string2 + size2 : string1 + size1))
4145 /* Address of POS in the concatenation of virtual string. */
4146 #define POS_ADDR_VSTRING(POS) \
4147 (((POS) >= size1 ? string2 - size1 : string1) + (POS))
4149 /* Using the compiled pattern in BUFP->buffer, first tries to match the
4150 virtual concatenation of STRING1 and STRING2, starting first at index
4151 STARTPOS, then at STARTPOS + 1, and so on.
4153 STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
4155 RANGE is how far to scan while trying to match. RANGE = 0 means try
4156 only at STARTPOS; in general, the last start tried is STARTPOS +
4159 In REGS, return the indices of the virtual concatenation of STRING1
4160 and STRING2 that matched the entire BUFP->buffer and its contained
4163 Do not consider matching one past the index STOP in the virtual
4164 concatenation of STRING1 and STRING2.
4166 We return either the position in the strings at which the match was
4167 found, -1 if no match, or -2 if error (such as failure
4171 re_search_2 (bufp
, str1
, size1
, str2
, size2
, startpos
, range
, regs
, stop
)
4172 struct re_pattern_buffer
*bufp
;
4173 const char *str1
, *str2
;
4177 struct re_registers
*regs
;
4181 re_char
*string1
= (re_char
*) str1
;
4182 re_char
*string2
= (re_char
*) str2
;
4183 register char *fastmap
= bufp
->fastmap
;
4184 register RE_TRANSLATE_TYPE translate
= bufp
->translate
;
4185 int total_size
= size1
+ size2
;
4186 int endpos
= startpos
+ range
;
4187 boolean anchored_start
;
4189 /* Nonzero if we have to concern multibyte character. */
4190 const boolean multibyte
= RE_MULTIBYTE_P (bufp
);
4192 /* Check for out-of-range STARTPOS. */
4193 if (startpos
< 0 || startpos
> total_size
)
4196 /* Fix up RANGE if it might eventually take us outside
4197 the virtual concatenation of STRING1 and STRING2.
4198 Make sure we won't move STARTPOS below 0 or above TOTAL_SIZE. */
4200 range
= 0 - startpos
;
4201 else if (endpos
> total_size
)
4202 range
= total_size
- startpos
;
4204 /* If the search isn't to be a backwards one, don't waste time in a
4205 search for a pattern anchored at beginning of buffer. */
4206 if (bufp
->used
> 0 && (re_opcode_t
) bufp
->buffer
[0] == begbuf
&& range
> 0)
4215 /* In a forward search for something that starts with \=.
4216 don't keep searching past point. */
4217 if (bufp
->used
> 0 && (re_opcode_t
) bufp
->buffer
[0] == at_dot
&& range
> 0)
4219 range
= PT_BYTE
- BEGV_BYTE
- startpos
;
4225 /* Update the fastmap now if not correct already. */
4226 if (fastmap
&& !bufp
->fastmap_accurate
)
4227 re_compile_fastmap (bufp
);
4229 /* See whether the pattern is anchored. */
4230 anchored_start
= (bufp
->buffer
[0] == begline
);
4233 gl_state
.object
= re_match_object
;
4235 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (POS_AS_IN_BUFFER (startpos
));
4237 SETUP_SYNTAX_TABLE_FOR_OBJECT (re_match_object
, charpos
, 1);
4241 /* Loop through the string, looking for a place to start matching. */
4244 /* If the pattern is anchored,
4245 skip quickly past places we cannot match.
4246 We don't bother to treat startpos == 0 specially
4247 because that case doesn't repeat. */
4248 if (anchored_start
&& startpos
> 0)
4250 if (! ((startpos
<= size1
? string1
[startpos
- 1]
4251 : string2
[startpos
- size1
- 1])
4256 /* If a fastmap is supplied, skip quickly over characters that
4257 cannot be the start of a match. If the pattern can match the
4258 null string, however, we don't need to skip characters; we want
4259 the first null string. */
4260 if (fastmap
&& startpos
< total_size
&& !bufp
->can_be_null
)
4262 register re_char
*d
;
4263 register re_wchar_t buf_ch
;
4265 d
= POS_ADDR_VSTRING (startpos
);
4267 if (range
> 0) /* Searching forwards. */
4269 register int lim
= 0;
4272 if (startpos
< size1
&& startpos
+ range
>= size1
)
4273 lim
= range
- (size1
- startpos
);
4275 /* Written out as an if-else to avoid testing `translate'
4277 if (RE_TRANSLATE_P (translate
))
4284 buf_ch
= STRING_CHAR_AND_LENGTH (d
, range
- lim
,
4287 buf_ch
= RE_TRANSLATE (translate
, buf_ch
);
4292 range
-= buf_charlen
;
4297 && !fastmap
[RE_TRANSLATE (translate
, *d
)])
4304 while (range
> lim
&& !fastmap
[*d
])
4310 startpos
+= irange
- range
;
4312 else /* Searching backwards. */
4314 int room
= (startpos
>= size1
4315 ? size2
+ size1
- startpos
4316 : size1
- startpos
);
4317 buf_ch
= RE_STRING_CHAR (d
, room
);
4318 buf_ch
= TRANSLATE (buf_ch
);
4320 if (! (buf_ch
>= 0400
4321 || fastmap
[buf_ch
]))
4326 /* If can't match the null string, and that's all we have left, fail. */
4327 if (range
>= 0 && startpos
== total_size
&& fastmap
4328 && !bufp
->can_be_null
)
4331 val
= re_match_2_internal (bufp
, string1
, size1
, string2
, size2
,
4332 startpos
, regs
, stop
);
4333 #ifndef REGEX_MALLOC
4350 /* Update STARTPOS to the next character boundary. */
4353 re_char
*p
= POS_ADDR_VSTRING (startpos
);
4354 re_char
*pend
= STOP_ADDR_VSTRING (startpos
);
4355 int len
= MULTIBYTE_FORM_LENGTH (p
, pend
- p
);
4373 /* Update STARTPOS to the previous character boundary. */
4376 re_char
*p
= POS_ADDR_VSTRING (startpos
) + 1;
4378 re_char
*phead
= HEAD_ADDR_VSTRING (startpos
);
4380 /* Find the head of multibyte form. */
4381 PREV_CHAR_BOUNDARY (p
, phead
);
4382 range
+= p0
- 1 - p
;
4386 startpos
-= p0
- 1 - p
;
4392 WEAK_ALIAS (__re_search_2
, re_search_2
)
4394 /* Declarations and macros for re_match_2. */
4396 static int bcmp_translate
_RE_ARGS((re_char
*s1
, re_char
*s2
,
4398 RE_TRANSLATE_TYPE translate
,
4399 const int multibyte
));
4401 /* This converts PTR, a pointer into one of the search strings `string1'
4402 and `string2' into an offset from the beginning of that string. */
4403 #define POINTER_TO_OFFSET(ptr) \
4404 (FIRST_STRING_P (ptr) \
4405 ? ((regoff_t) ((ptr) - string1)) \
4406 : ((regoff_t) ((ptr) - string2 + size1)))
4408 /* Call before fetching a character with *d. This switches over to
4409 string2 if necessary.
4410 Check re_match_2_internal for a discussion of why end_match_2 might
4411 not be within string2 (but be equal to end_match_1 instead). */
4412 #define PREFETCH() \
4415 /* End of string2 => fail. */ \
4416 if (dend == end_match_2) \
4418 /* End of string1 => advance to string2. */ \
4420 dend = end_match_2; \
4423 /* Call before fetching a char with *d if you already checked other limits.
4424 This is meant for use in lookahead operations like wordend, etc..
4425 where we might need to look at parts of the string that might be
4426 outside of the LIMITs (i.e past `stop'). */
4427 #define PREFETCH_NOLIMIT() \
4431 dend = end_match_2; \
4434 /* Test if at very beginning or at very end of the virtual concatenation
4435 of `string1' and `string2'. If only one string, it's `string2'. */
4436 #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
4437 #define AT_STRINGS_END(d) ((d) == end2)
4440 /* Test if D points to a character which is word-constituent. We have
4441 two special cases to check for: if past the end of string1, look at
4442 the first character in string2; and if before the beginning of
4443 string2, look at the last character in string1. */
4444 #define WORDCHAR_P(d) \
4445 (SYNTAX ((d) == end1 ? *string2 \
4446 : (d) == string2 - 1 ? *(end1 - 1) : *(d)) \
4449 /* Disabled due to a compiler bug -- see comment at case wordbound */
4451 /* The comment at case wordbound is following one, but we don't use
4452 AT_WORD_BOUNDARY anymore to support multibyte form.
4454 The DEC Alpha C compiler 3.x generates incorrect code for the
4455 test WORDCHAR_P (d - 1) != WORDCHAR_P (d) in the expansion of
4456 AT_WORD_BOUNDARY, so this code is disabled. Expanding the
4457 macro and introducing temporary variables works around the bug. */
4460 /* Test if the character before D and the one at D differ with respect
4461 to being word-constituent. */
4462 #define AT_WORD_BOUNDARY(d) \
4463 (AT_STRINGS_BEG (d) || AT_STRINGS_END (d) \
4464 || WORDCHAR_P (d - 1) != WORDCHAR_P (d))
4467 /* Free everything we malloc. */
4468 #ifdef MATCH_MAY_ALLOCATE
4469 # define FREE_VAR(var) if (var) { REGEX_FREE (var); var = NULL; } else
4470 # define FREE_VARIABLES() \
4472 REGEX_FREE_STACK (fail_stack.stack); \
4473 FREE_VAR (regstart); \
4474 FREE_VAR (regend); \
4475 FREE_VAR (best_regstart); \
4476 FREE_VAR (best_regend); \
4479 # define FREE_VARIABLES() ((void)0) /* Do nothing! But inhibit gcc warning. */
4480 #endif /* not MATCH_MAY_ALLOCATE */
4483 /* Optimization routines. */
4485 /* If the operation is a match against one or more chars,
4486 return a pointer to the next operation, else return NULL. */
4491 switch (SWITCH_ENUM_CAST (*p
++))
4502 if (CHARSET_RANGE_TABLE_EXISTS_P (p
- 1))
4505 p
= CHARSET_RANGE_TABLE (p
- 1);
4506 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4507 p
= CHARSET_RANGE_TABLE_END (p
, mcnt
);
4510 p
+= 1 + CHARSET_BITMAP_SIZE (p
- 1);
4517 case notcategoryspec
:
4529 /* Jump over non-matching operations. */
4531 skip_noops (p
, pend
)
4537 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
))
4546 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4557 /* Non-zero if "p1 matches something" implies "p2 fails". */
4559 mutually_exclusive_p (bufp
, p1
, p2
)
4560 struct re_pattern_buffer
*bufp
;
4564 const boolean multibyte
= RE_MULTIBYTE_P (bufp
);
4565 unsigned char *pend
= bufp
->buffer
+ bufp
->used
;
4567 assert (p1
>= bufp
->buffer
&& p1
< pend
4568 && p2
>= bufp
->buffer
&& p2
<= pend
);
4570 /* Skip over open/close-group commands.
4571 If what follows this loop is a ...+ construct,
4572 look at what begins its body, since we will have to
4573 match at least one of that. */
4574 p2
= skip_noops (p2
, pend
);
4575 /* The same skip can be done for p1, except that this function
4576 is only used in the case where p1 is a simple match operator. */
4577 /* p1 = skip_noops (p1, pend); */
4579 assert (p1
>= bufp
->buffer
&& p1
< pend
4580 && p2
>= bufp
->buffer
&& p2
<= pend
);
4582 op2
= p2
== pend
? succeed
: *p2
;
4584 switch (SWITCH_ENUM_CAST (op2
))
4588 /* If we're at the end of the pattern, we can change. */
4589 if (skip_one_char (p1
))
4591 DEBUG_PRINT1 (" End of pattern: fast loop.\n");
4599 register re_wchar_t c
4600 = (re_opcode_t
) *p2
== endline
? '\n'
4601 : RE_STRING_CHAR (p2
+ 2, pend
- p2
- 2);
4603 if ((re_opcode_t
) *p1
== exactn
)
4605 if (c
!= RE_STRING_CHAR (p1
+ 2, pend
- p1
- 2))
4607 DEBUG_PRINT3 (" '%c' != '%c' => fast loop.\n", c
, p1
[2]);
4612 else if ((re_opcode_t
) *p1
== charset
4613 || (re_opcode_t
) *p1
== charset_not
)
4615 int not = (re_opcode_t
) *p1
== charset_not
;
4617 /* Test if C is listed in charset (or charset_not)
4619 if (SINGLE_BYTE_CHAR_P (c
))
4621 if (c
< CHARSET_BITMAP_SIZE (p1
) * BYTEWIDTH
4622 && p1
[2 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
4625 else if (CHARSET_RANGE_TABLE_EXISTS_P (p1
))
4626 CHARSET_LOOKUP_RANGE_TABLE (not, c
, p1
);
4628 /* `not' is equal to 1 if c would match, which means
4629 that we can't change to pop_failure_jump. */
4632 DEBUG_PRINT1 (" No match => fast loop.\n");
4636 else if ((re_opcode_t
) *p1
== anychar
4639 DEBUG_PRINT1 (" . != \\n => fast loop.\n");
4647 if ((re_opcode_t
) *p1
== exactn
)
4648 /* Reuse the code above. */
4649 return mutually_exclusive_p (bufp
, p2
, p1
);
4651 /* It is hard to list up all the character in charset
4652 P2 if it includes multibyte character. Give up in
4654 else if (!multibyte
|| !CHARSET_RANGE_TABLE_EXISTS_P (p2
))
4656 /* Now, we are sure that P2 has no range table.
4657 So, for the size of bitmap in P2, `p2[1]' is
4658 enough. But P1 may have range table, so the
4659 size of bitmap table of P1 is extracted by
4660 using macro `CHARSET_BITMAP_SIZE'.
4662 Since we know that all the character listed in
4663 P2 is ASCII, it is enough to test only bitmap
4666 if ((re_opcode_t
) *p1
== charset
)
4669 /* We win if the charset inside the loop
4670 has no overlap with the one after the loop. */
4673 && idx
< CHARSET_BITMAP_SIZE (p1
));
4675 if ((p2
[2 + idx
] & p1
[2 + idx
]) != 0)
4679 || idx
== CHARSET_BITMAP_SIZE (p1
))
4681 DEBUG_PRINT1 (" No match => fast loop.\n");
4685 else if ((re_opcode_t
) *p1
== charset_not
)
4688 /* We win if the charset_not inside the loop lists
4689 every character listed in the charset after. */
4690 for (idx
= 0; idx
< (int) p2
[1]; idx
++)
4691 if (! (p2
[2 + idx
] == 0
4692 || (idx
< CHARSET_BITMAP_SIZE (p1
)
4693 && ((p2
[2 + idx
] & ~ p1
[2 + idx
]) == 0))))
4698 DEBUG_PRINT1 (" No match => fast loop.\n");
4707 switch (SWITCH_ENUM_CAST (*p1
))
4711 /* Reuse the code above. */
4712 return mutually_exclusive_p (bufp
, p2
, p1
);
4714 /* When we have two charset_not, it's very unlikely that
4715 they don't overlap. The union of the two sets of excluded
4716 chars should cover all possible chars, which, as a matter of
4717 fact, is virtually impossible in multibyte buffers. */
4723 return ((re_opcode_t
) *p1
== syntaxspec
&& p1
[1] == Sword
);
4725 return ((re_opcode_t
) *p1
== syntaxspec
4726 && (p1
[1] == Ssymbol
|| p1
[1] == Sword
));
4728 return ((re_opcode_t
) *p1
== syntaxspec
&& p1
[1] == p2
[1]);
4731 return ((re_opcode_t
) *p1
== notsyntaxspec
&& p1
[1] == Sword
);
4733 return ((re_opcode_t
) *p1
== notsyntaxspec
4734 && (p1
[1] == Ssymbol
|| p1
[1] == Sword
));
4736 return ((re_opcode_t
) *p1
== notsyntaxspec
&& p1
[1] == p2
[1]);
4739 return (((re_opcode_t
) *p1
== notsyntaxspec
4740 || (re_opcode_t
) *p1
== syntaxspec
)
4745 return ((re_opcode_t
) *p1
== notcategoryspec
&& p1
[1] == p2
[1]);
4746 case notcategoryspec
:
4747 return ((re_opcode_t
) *p1
== categoryspec
&& p1
[1] == p2
[1]);
4759 /* Matching routines. */
4761 #ifndef emacs /* Emacs never uses this. */
4762 /* re_match is like re_match_2 except it takes only a single string. */
4765 re_match (bufp
, string
, size
, pos
, regs
)
4766 struct re_pattern_buffer
*bufp
;
4769 struct re_registers
*regs
;
4771 int result
= re_match_2_internal (bufp
, NULL
, 0, (re_char
*) string
, size
,
4773 # if defined C_ALLOCA && !defined REGEX_MALLOC
4778 WEAK_ALIAS (__re_match
, re_match
)
4779 #endif /* not emacs */
4782 /* In Emacs, this is the string or buffer in which we
4783 are matching. It is used for looking up syntax properties. */
4784 Lisp_Object re_match_object
;
4787 /* re_match_2 matches the compiled pattern in BUFP against the
4788 the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1
4789 and SIZE2, respectively). We start matching at POS, and stop
4792 If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
4793 store offsets for the substring each group matched in REGS. See the
4794 documentation for exactly how many groups we fill.
4796 We return -1 if no match, -2 if an internal error (such as the
4797 failure stack overflowing). Otherwise, we return the length of the
4798 matched substring. */
4801 re_match_2 (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
4802 struct re_pattern_buffer
*bufp
;
4803 const char *string1
, *string2
;
4806 struct re_registers
*regs
;
4813 gl_state
.object
= re_match_object
;
4814 charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (POS_AS_IN_BUFFER (pos
));
4815 SETUP_SYNTAX_TABLE_FOR_OBJECT (re_match_object
, charpos
, 1);
4818 result
= re_match_2_internal (bufp
, (re_char
*) string1
, size1
,
4819 (re_char
*) string2
, size2
,
4821 #if defined C_ALLOCA && !defined REGEX_MALLOC
4826 WEAK_ALIAS (__re_match_2
, re_match_2
)
4828 /* This is a separate function so that we can force an alloca cleanup
4831 re_match_2_internal (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
4832 struct re_pattern_buffer
*bufp
;
4833 re_char
*string1
, *string2
;
4836 struct re_registers
*regs
;
4839 /* General temporaries. */
4844 /* Just past the end of the corresponding string. */
4845 re_char
*end1
, *end2
;
4847 /* Pointers into string1 and string2, just past the last characters in
4848 each to consider matching. */
4849 re_char
*end_match_1
, *end_match_2
;
4851 /* Where we are in the data, and the end of the current string. */
4854 /* Used sometimes to remember where we were before starting matching
4855 an operator so that we can go back in case of failure. This "atomic"
4856 behavior of matching opcodes is indispensable to the correctness
4857 of the on_failure_keep_string_jump optimization. */
4860 /* Where we are in the pattern, and the end of the pattern. */
4861 re_char
*p
= bufp
->buffer
;
4862 re_char
*pend
= p
+ bufp
->used
;
4864 /* We use this to map every character in the string. */
4865 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
4867 /* Nonzero if we have to concern multibyte character. */
4868 const boolean multibyte
= RE_MULTIBYTE_P (bufp
);
4870 /* Failure point stack. Each place that can handle a failure further
4871 down the line pushes a failure point on this stack. It consists of
4872 regstart, and regend for all registers corresponding to
4873 the subexpressions we're currently inside, plus the number of such
4874 registers, and, finally, two char *'s. The first char * is where
4875 to resume scanning the pattern; the second one is where to resume
4876 scanning the strings. */
4877 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
4878 fail_stack_type fail_stack
;
4881 unsigned nfailure_points_pushed
= 0, nfailure_points_popped
= 0;
4884 #if defined REL_ALLOC && defined REGEX_MALLOC
4885 /* This holds the pointer to the failure stack, when
4886 it is allocated relocatably. */
4887 fail_stack_elt_t
*failure_stack_ptr
;
4890 /* We fill all the registers internally, independent of what we
4891 return, for use in backreferences. The number here includes
4892 an element for register zero. */
4893 size_t num_regs
= bufp
->re_nsub
+ 1;
4895 /* Information on the contents of registers. These are pointers into
4896 the input strings; they record just what was matched (on this
4897 attempt) by a subexpression part of the pattern, that is, the
4898 regnum-th regstart pointer points to where in the pattern we began
4899 matching and the regnum-th regend points to right after where we
4900 stopped matching the regnum-th subexpression. (The zeroth register
4901 keeps track of what the whole pattern matches.) */
4902 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
4903 re_char
**regstart
, **regend
;
4906 /* The following record the register info as found in the above
4907 variables when we find a match better than any we've seen before.
4908 This happens as we backtrack through the failure points, which in
4909 turn happens only if we have not yet matched the entire string. */
4910 unsigned best_regs_set
= false;
4911 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
4912 re_char
**best_regstart
, **best_regend
;
4915 /* Logically, this is `best_regend[0]'. But we don't want to have to
4916 allocate space for that if we're not allocating space for anything
4917 else (see below). Also, we never need info about register 0 for
4918 any of the other register vectors, and it seems rather a kludge to
4919 treat `best_regend' differently than the rest. So we keep track of
4920 the end of the best match so far in a separate variable. We
4921 initialize this to NULL so that when we backtrack the first time
4922 and need to test it, it's not garbage. */
4923 re_char
*match_end
= NULL
;
4926 /* Counts the total number of registers pushed. */
4927 unsigned num_regs_pushed
= 0;
4930 DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
4934 #ifdef MATCH_MAY_ALLOCATE
4935 /* Do not bother to initialize all the register variables if there are
4936 no groups in the pattern, as it takes a fair amount of time. If
4937 there are groups, we include space for register 0 (the whole
4938 pattern), even though we never use it, since it simplifies the
4939 array indexing. We should fix this. */
4942 regstart
= REGEX_TALLOC (num_regs
, re_char
*);
4943 regend
= REGEX_TALLOC (num_regs
, re_char
*);
4944 best_regstart
= REGEX_TALLOC (num_regs
, re_char
*);
4945 best_regend
= REGEX_TALLOC (num_regs
, re_char
*);
4947 if (!(regstart
&& regend
&& best_regstart
&& best_regend
))
4955 /* We must initialize all our variables to NULL, so that
4956 `FREE_VARIABLES' doesn't try to free them. */
4957 regstart
= regend
= best_regstart
= best_regend
= NULL
;
4959 #endif /* MATCH_MAY_ALLOCATE */
4961 /* The starting position is bogus. */
4962 if (pos
< 0 || pos
> size1
+ size2
)
4968 /* Initialize subexpression text positions to -1 to mark ones that no
4969 start_memory/stop_memory has been seen for. Also initialize the
4970 register information struct. */
4971 for (reg
= 1; reg
< num_regs
; reg
++)
4972 regstart
[reg
] = regend
[reg
] = NULL
;
4974 /* We move `string1' into `string2' if the latter's empty -- but not if
4975 `string1' is null. */
4976 if (size2
== 0 && string1
!= NULL
)
4983 end1
= string1
+ size1
;
4984 end2
= string2
+ size2
;
4986 /* `p' scans through the pattern as `d' scans through the data.
4987 `dend' is the end of the input string that `d' points within. `d'
4988 is advanced into the following input string whenever necessary, but
4989 this happens before fetching; therefore, at the beginning of the
4990 loop, `d' can be pointing at the end of a string, but it cannot
4994 /* Only match within string2. */
4995 d
= string2
+ pos
- size1
;
4996 dend
= end_match_2
= string2
+ stop
- size1
;
4997 end_match_1
= end1
; /* Just to give it a value. */
5003 /* Only match within string1. */
5004 end_match_1
= string1
+ stop
;
5006 When we reach end_match_1, PREFETCH normally switches to string2.
5007 But in the present case, this means that just doing a PREFETCH
5008 makes us jump from `stop' to `gap' within the string.
5009 What we really want here is for the search to stop as
5010 soon as we hit end_match_1. That's why we set end_match_2
5011 to end_match_1 (since PREFETCH fails as soon as we hit
5013 end_match_2
= end_match_1
;
5016 { /* It's important to use this code when stop == size so that
5017 moving `d' from end1 to string2 will not prevent the d == dend
5018 check from catching the end of string. */
5020 end_match_2
= string2
+ stop
- size1
;
5026 DEBUG_PRINT1 ("The compiled pattern is: ");
5027 DEBUG_PRINT_COMPILED_PATTERN (bufp
, p
, pend
);
5028 DEBUG_PRINT1 ("The string to match is: `");
5029 DEBUG_PRINT_DOUBLE_STRING (d
, string1
, size1
, string2
, size2
);
5030 DEBUG_PRINT1 ("'\n");
5032 /* This loops over pattern commands. It exits by returning from the
5033 function if the match is complete, or it drops through if the match
5034 fails at this starting point in the input data. */
5037 DEBUG_PRINT2 ("\n%p: ", p
);
5040 { /* End of pattern means we might have succeeded. */
5041 DEBUG_PRINT1 ("end of pattern ... ");
5043 /* If we haven't matched the entire string, and we want the
5044 longest match, try backtracking. */
5045 if (d
!= end_match_2
)
5047 /* 1 if this match ends in the same string (string1 or string2)
5048 as the best previous match. */
5049 boolean same_str_p
= (FIRST_STRING_P (match_end
)
5050 == FIRST_STRING_P (d
));
5051 /* 1 if this match is the best seen so far. */
5052 boolean best_match_p
;
5054 /* AIX compiler got confused when this was combined
5055 with the previous declaration. */
5057 best_match_p
= d
> match_end
;
5059 best_match_p
= !FIRST_STRING_P (d
);
5061 DEBUG_PRINT1 ("backtracking.\n");
5063 if (!FAIL_STACK_EMPTY ())
5064 { /* More failure points to try. */
5066 /* If exceeds best match so far, save it. */
5067 if (!best_regs_set
|| best_match_p
)
5069 best_regs_set
= true;
5072 DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
5074 for (reg
= 1; reg
< num_regs
; reg
++)
5076 best_regstart
[reg
] = regstart
[reg
];
5077 best_regend
[reg
] = regend
[reg
];
5083 /* If no failure points, don't restore garbage. And if
5084 last match is real best match, don't restore second
5086 else if (best_regs_set
&& !best_match_p
)
5089 /* Restore best match. It may happen that `dend ==
5090 end_match_1' while the restored d is in string2.
5091 For example, the pattern `x.*y.*z' against the
5092 strings `x-' and `y-z-', if the two strings are
5093 not consecutive in memory. */
5094 DEBUG_PRINT1 ("Restoring best registers.\n");
5097 dend
= ((d
>= string1
&& d
<= end1
)
5098 ? end_match_1
: end_match_2
);
5100 for (reg
= 1; reg
< num_regs
; reg
++)
5102 regstart
[reg
] = best_regstart
[reg
];
5103 regend
[reg
] = best_regend
[reg
];
5106 } /* d != end_match_2 */
5109 DEBUG_PRINT1 ("Accepting match.\n");
5111 /* If caller wants register contents data back, do it. */
5112 if (regs
&& !bufp
->no_sub
)
5114 /* Have the register data arrays been allocated? */
5115 if (bufp
->regs_allocated
== REGS_UNALLOCATED
)
5116 { /* No. So allocate them with malloc. We need one
5117 extra element beyond `num_regs' for the `-1' marker
5119 regs
->num_regs
= MAX (RE_NREGS
, num_regs
+ 1);
5120 regs
->start
= TALLOC (regs
->num_regs
, regoff_t
);
5121 regs
->end
= TALLOC (regs
->num_regs
, regoff_t
);
5122 if (regs
->start
== NULL
|| regs
->end
== NULL
)
5127 bufp
->regs_allocated
= REGS_REALLOCATE
;
5129 else if (bufp
->regs_allocated
== REGS_REALLOCATE
)
5130 { /* Yes. If we need more elements than were already
5131 allocated, reallocate them. If we need fewer, just
5133 if (regs
->num_regs
< num_regs
+ 1)
5135 regs
->num_regs
= num_regs
+ 1;
5136 RETALLOC (regs
->start
, regs
->num_regs
, regoff_t
);
5137 RETALLOC (regs
->end
, regs
->num_regs
, regoff_t
);
5138 if (regs
->start
== NULL
|| regs
->end
== NULL
)
5147 /* These braces fend off a "empty body in an else-statement"
5148 warning under GCC when assert expands to nothing. */
5149 assert (bufp
->regs_allocated
== REGS_FIXED
);
5152 /* Convert the pointer data in `regstart' and `regend' to
5153 indices. Register zero has to be set differently,
5154 since we haven't kept track of any info for it. */
5155 if (regs
->num_regs
> 0)
5157 regs
->start
[0] = pos
;
5158 regs
->end
[0] = POINTER_TO_OFFSET (d
);
5161 /* Go through the first `min (num_regs, regs->num_regs)'
5162 registers, since that is all we initialized. */
5163 for (reg
= 1; reg
< MIN (num_regs
, regs
->num_regs
); reg
++)
5165 if (REG_UNSET (regstart
[reg
]) || REG_UNSET (regend
[reg
]))
5166 regs
->start
[reg
] = regs
->end
[reg
] = -1;
5170 = (regoff_t
) POINTER_TO_OFFSET (regstart
[reg
]);
5172 = (regoff_t
) POINTER_TO_OFFSET (regend
[reg
]);
5176 /* If the regs structure we return has more elements than
5177 were in the pattern, set the extra elements to -1. If
5178 we (re)allocated the registers, this is the case,
5179 because we always allocate enough to have at least one
5181 for (reg
= num_regs
; reg
< regs
->num_regs
; reg
++)
5182 regs
->start
[reg
] = regs
->end
[reg
] = -1;
5183 } /* regs && !bufp->no_sub */
5185 DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
5186 nfailure_points_pushed
, nfailure_points_popped
,
5187 nfailure_points_pushed
- nfailure_points_popped
);
5188 DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed
);
5190 mcnt
= POINTER_TO_OFFSET (d
) - pos
;
5192 DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt
);
5198 /* Otherwise match next pattern command. */
5199 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
5201 /* Ignore these. Used to ignore the n of succeed_n's which
5202 currently have n == 0. */
5204 DEBUG_PRINT1 ("EXECUTING no_op.\n");
5208 DEBUG_PRINT1 ("EXECUTING succeed.\n");
5211 /* Match the next n pattern characters exactly. The following
5212 byte in the pattern defines n, and the n bytes after that
5213 are the characters to match. */
5216 DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt
);
5218 /* Remember the start point to rollback upon failure. */
5221 /* This is written out as an if-else so we don't waste time
5222 testing `translate' inside the loop. */
5223 if (RE_TRANSLATE_P (translate
))
5228 int pat_charlen
, buf_charlen
;
5229 unsigned int pat_ch
, buf_ch
;
5232 pat_ch
= STRING_CHAR_AND_LENGTH (p
, pend
- p
, pat_charlen
);
5233 buf_ch
= STRING_CHAR_AND_LENGTH (d
, dend
- d
, buf_charlen
);
5235 if (RE_TRANSLATE (translate
, buf_ch
)
5244 mcnt
-= pat_charlen
;
5251 if (RE_TRANSLATE (translate
, *d
) != *p
++)
5276 /* Match any character except possibly a newline or a null. */
5282 DEBUG_PRINT1 ("EXECUTING anychar.\n");
5285 buf_ch
= RE_STRING_CHAR_AND_LENGTH (d
, dend
- d
, buf_charlen
);
5286 buf_ch
= TRANSLATE (buf_ch
);
5288 if ((!(bufp
->syntax
& RE_DOT_NEWLINE
)
5290 || ((bufp
->syntax
& RE_DOT_NOT_NULL
)
5291 && buf_ch
== '\000'))
5294 DEBUG_PRINT2 (" Matched `%d'.\n", *d
);
5303 register unsigned int c
;
5304 boolean
not = (re_opcode_t
) *(p
- 1) == charset_not
;
5307 /* Start of actual range_table, or end of bitmap if there is no
5309 re_char
*range_table
;
5311 /* Nonzero if there is a range table. */
5312 int range_table_exists
;
5314 /* Number of ranges of range table. This is not included
5315 in the initial byte-length of the command. */
5318 DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : "");
5320 range_table_exists
= CHARSET_RANGE_TABLE_EXISTS_P (&p
[-1]);
5322 if (range_table_exists
)
5324 range_table
= CHARSET_RANGE_TABLE (&p
[-1]); /* Past the bitmap. */
5325 EXTRACT_NUMBER_AND_INCR (count
, range_table
);
5329 c
= RE_STRING_CHAR_AND_LENGTH (d
, dend
- d
, len
);
5330 c
= TRANSLATE (c
); /* The character to match. */
5332 if (SINGLE_BYTE_CHAR_P (c
))
5333 { /* Lookup bitmap. */
5334 /* Cast to `unsigned' instead of `unsigned char' in
5335 case the bit list is a full 32 bytes long. */
5336 if (c
< (unsigned) (CHARSET_BITMAP_SIZE (&p
[-1]) * BYTEWIDTH
)
5337 && p
[1 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
5341 else if (range_table_exists
)
5343 int class_bits
= CHARSET_RANGE_TABLE_BITS (&p
[-1]);
5345 if ( (class_bits
& BIT_LOWER
&& ISLOWER (c
))
5346 | (class_bits
& BIT_MULTIBYTE
)
5347 | (class_bits
& BIT_PUNCT
&& ISPUNCT (c
))
5348 | (class_bits
& BIT_SPACE
&& ISSPACE (c
))
5349 | (class_bits
& BIT_UPPER
&& ISUPPER (c
))
5350 | (class_bits
& BIT_WORD
&& ISWORD (c
)))
5353 CHARSET_LOOKUP_RANGE_TABLE_RAW (not, c
, range_table
, count
);
5357 if (range_table_exists
)
5358 p
= CHARSET_RANGE_TABLE_END (range_table
, count
);
5360 p
+= CHARSET_BITMAP_SIZE (&p
[-1]) + 1;
5362 if (!not) goto fail
;
5369 /* The beginning of a group is represented by start_memory.
5370 The argument is the register number. The text
5371 matched within the group is recorded (in the internal
5372 registers data structure) under the register number. */
5374 DEBUG_PRINT2 ("EXECUTING start_memory %d:\n", *p
);
5376 /* In case we need to undo this operation (via backtracking). */
5377 PUSH_FAILURE_REG ((unsigned int)*p
);
5380 regend
[*p
] = NULL
; /* probably unnecessary. -sm */
5381 DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart
[*p
]));
5383 /* Move past the register number and inner group count. */
5388 /* The stop_memory opcode represents the end of a group. Its
5389 argument is the same as start_memory's: the register number. */
5391 DEBUG_PRINT2 ("EXECUTING stop_memory %d:\n", *p
);
5393 assert (!REG_UNSET (regstart
[*p
]));
5394 /* Strictly speaking, there should be code such as:
5396 assert (REG_UNSET (regend[*p]));
5397 PUSH_FAILURE_REGSTOP ((unsigned int)*p);
5399 But the only info to be pushed is regend[*p] and it is known to
5400 be UNSET, so there really isn't anything to push.
5401 Not pushing anything, on the other hand deprives us from the
5402 guarantee that regend[*p] is UNSET since undoing this operation
5403 will not reset its value properly. This is not important since
5404 the value will only be read on the next start_memory or at
5405 the very end and both events can only happen if this stop_memory
5409 DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend
[*p
]));
5411 /* Move past the register number and the inner group count. */
5416 /* \<digit> has been turned into a `duplicate' command which is
5417 followed by the numeric value of <digit> as the register number. */
5420 register re_char
*d2
, *dend2
;
5421 int regno
= *p
++; /* Get which register to match against. */
5422 DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno
);
5424 /* Can't back reference a group which we've never matched. */
5425 if (REG_UNSET (regstart
[regno
]) || REG_UNSET (regend
[regno
]))
5428 /* Where in input to try to start matching. */
5429 d2
= regstart
[regno
];
5431 /* Remember the start point to rollback upon failure. */
5434 /* Where to stop matching; if both the place to start and
5435 the place to stop matching are in the same string, then
5436 set to the place to stop, otherwise, for now have to use
5437 the end of the first string. */
5439 dend2
= ((FIRST_STRING_P (regstart
[regno
])
5440 == FIRST_STRING_P (regend
[regno
]))
5441 ? regend
[regno
] : end_match_1
);
5444 /* If necessary, advance to next segment in register
5448 if (dend2
== end_match_2
) break;
5449 if (dend2
== regend
[regno
]) break;
5451 /* End of string1 => advance to string2. */
5453 dend2
= regend
[regno
];
5455 /* At end of register contents => success */
5456 if (d2
== dend2
) break;
5458 /* If necessary, advance to next segment in data. */
5461 /* How many characters left in this segment to match. */
5464 /* Want how many consecutive characters we can match in
5465 one shot, so, if necessary, adjust the count. */
5466 if (mcnt
> dend2
- d2
)
5469 /* Compare that many; failure if mismatch, else move
5471 if (RE_TRANSLATE_P (translate
)
5472 ? bcmp_translate (d
, d2
, mcnt
, translate
, multibyte
)
5473 : memcmp (d
, d2
, mcnt
))
5478 d
+= mcnt
, d2
+= mcnt
;
5484 /* begline matches the empty string at the beginning of the string
5485 (unless `not_bol' is set in `bufp'), and after newlines. */
5487 DEBUG_PRINT1 ("EXECUTING begline.\n");
5489 if (AT_STRINGS_BEG (d
))
5491 if (!bufp
->not_bol
) break;
5496 GET_CHAR_BEFORE_2 (c
, d
, string1
, end1
, string2
, end2
);
5500 /* In all other cases, we fail. */
5504 /* endline is the dual of begline. */
5506 DEBUG_PRINT1 ("EXECUTING endline.\n");
5508 if (AT_STRINGS_END (d
))
5510 if (!bufp
->not_eol
) break;
5514 PREFETCH_NOLIMIT ();
5521 /* Match at the very beginning of the data. */
5523 DEBUG_PRINT1 ("EXECUTING begbuf.\n");
5524 if (AT_STRINGS_BEG (d
))
5529 /* Match at the very end of the data. */
5531 DEBUG_PRINT1 ("EXECUTING endbuf.\n");
5532 if (AT_STRINGS_END (d
))
5537 /* on_failure_keep_string_jump is used to optimize `.*\n'. It
5538 pushes NULL as the value for the string on the stack. Then
5539 `POP_FAILURE_POINT' will keep the current value for the
5540 string, instead of restoring it. To see why, consider
5541 matching `foo\nbar' against `.*\n'. The .* matches the foo;
5542 then the . fails against the \n. But the next thing we want
5543 to do is match the \n against the \n; if we restored the
5544 string value, we would be back at the foo.
5546 Because this is used only in specific cases, we don't need to
5547 check all the things that `on_failure_jump' does, to make
5548 sure the right things get saved on the stack. Hence we don't
5549 share its code. The only reason to push anything on the
5550 stack at all is that otherwise we would have to change
5551 `anychar's code to do something besides goto fail in this
5552 case; that seems worse than this. */
5553 case on_failure_keep_string_jump
:
5554 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5555 DEBUG_PRINT3 ("EXECUTING on_failure_keep_string_jump %d (to %p):\n",
5558 PUSH_FAILURE_POINT (p
- 3, NULL
);
5561 /* A nasty loop is introduced by the non-greedy *? and +?.
5562 With such loops, the stack only ever contains one failure point
5563 at a time, so that a plain on_failure_jump_loop kind of
5564 cycle detection cannot work. Worse yet, such a detection
5565 can not only fail to detect a cycle, but it can also wrongly
5566 detect a cycle (between different instantiations of the same
5568 So the method used for those nasty loops is a little different:
5569 We use a special cycle-detection-stack-frame which is pushed
5570 when the on_failure_jump_nastyloop failure-point is *popped*.
5571 This special frame thus marks the beginning of one iteration
5572 through the loop and we can hence easily check right here
5573 whether something matched between the beginning and the end of
5575 case on_failure_jump_nastyloop
:
5576 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5577 DEBUG_PRINT3 ("EXECUTING on_failure_jump_nastyloop %d (to %p):\n",
5580 assert ((re_opcode_t
)p
[-4] == no_op
);
5583 CHECK_INFINITE_LOOP (p
- 4, d
);
5585 /* If there's a cycle, just continue without pushing
5586 this failure point. The failure point is the "try again"
5587 option, which shouldn't be tried.
5588 We want (x?)*?y\1z to match both xxyz and xxyxz. */
5589 PUSH_FAILURE_POINT (p
- 3, d
);
5593 /* Simple loop detecting on_failure_jump: just check on the
5594 failure stack if the same spot was already hit earlier. */
5595 case on_failure_jump_loop
:
5597 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5598 DEBUG_PRINT3 ("EXECUTING on_failure_jump_loop %d (to %p):\n",
5602 CHECK_INFINITE_LOOP (p
- 3, d
);
5604 /* If there's a cycle, get out of the loop, as if the matching
5605 had failed. We used to just `goto fail' here, but that was
5606 aborting the search a bit too early: we want to keep the
5607 empty-loop-match and keep matching after the loop.
5608 We want (x?)*y\1z to match both xxyz and xxyxz. */
5611 PUSH_FAILURE_POINT (p
- 3, d
);
5616 /* Uses of on_failure_jump:
5618 Each alternative starts with an on_failure_jump that points
5619 to the beginning of the next alternative. Each alternative
5620 except the last ends with a jump that in effect jumps past
5621 the rest of the alternatives. (They really jump to the
5622 ending jump of the following alternative, because tensioning
5623 these jumps is a hassle.)
5625 Repeats start with an on_failure_jump that points past both
5626 the repetition text and either the following jump or
5627 pop_failure_jump back to this on_failure_jump. */
5628 case on_failure_jump
:
5629 IMMEDIATE_QUIT_CHECK
;
5630 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5631 DEBUG_PRINT3 ("EXECUTING on_failure_jump %d (to %p):\n",
5634 PUSH_FAILURE_POINT (p
-3, d
);
5637 /* This operation is used for greedy *.
5638 Compare the beginning of the repeat with what in the
5639 pattern follows its end. If we can establish that there
5640 is nothing that they would both match, i.e., that we
5641 would have to backtrack because of (as in, e.g., `a*a')
5642 then we can use a non-backtracking loop based on
5643 on_failure_keep_string_jump instead of on_failure_jump. */
5644 case on_failure_jump_smart
:
5645 IMMEDIATE_QUIT_CHECK
;
5646 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5647 DEBUG_PRINT3 ("EXECUTING on_failure_jump_smart %d (to %p).\n",
5650 re_char
*p1
= p
; /* Next operation. */
5651 /* Here, we discard `const', making re_match non-reentrant. */
5652 unsigned char *p2
= (unsigned char*) p
+ mcnt
; /* Jump dest. */
5653 unsigned char *p3
= (unsigned char*) p
- 3; /* opcode location. */
5655 p
-= 3; /* Reset so that we will re-execute the
5656 instruction once it's been changed. */
5658 EXTRACT_NUMBER (mcnt
, p2
- 2);
5660 /* Ensure this is a indeed the trivial kind of loop
5661 we are expecting. */
5662 assert (skip_one_char (p1
) == p2
- 3);
5663 assert ((re_opcode_t
) p2
[-3] == jump
&& p2
+ mcnt
== p
);
5664 DEBUG_STATEMENT (debug
+= 2);
5665 if (mutually_exclusive_p (bufp
, p1
, p2
))
5667 /* Use a fast `on_failure_keep_string_jump' loop. */
5668 DEBUG_PRINT1 (" smart exclusive => fast loop.\n");
5669 *p3
= (unsigned char) on_failure_keep_string_jump
;
5670 STORE_NUMBER (p2
- 2, mcnt
+ 3);
5674 /* Default to a safe `on_failure_jump' loop. */
5675 DEBUG_PRINT1 (" smart default => slow loop.\n");
5676 *p3
= (unsigned char) on_failure_jump
;
5678 DEBUG_STATEMENT (debug
-= 2);
5682 /* Unconditionally jump (without popping any failure points). */
5685 IMMEDIATE_QUIT_CHECK
;
5686 EXTRACT_NUMBER_AND_INCR (mcnt
, p
); /* Get the amount to jump. */
5687 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt
);
5688 p
+= mcnt
; /* Do the jump. */
5689 DEBUG_PRINT2 ("(to %p).\n", p
);
5693 /* Have to succeed matching what follows at least n times.
5694 After that, handle like `on_failure_jump'. */
5696 /* Signedness doesn't matter since we only compare MCNT to 0. */
5697 EXTRACT_NUMBER (mcnt
, p
+ 2);
5698 DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt
);
5700 /* Originally, mcnt is how many times we HAVE to succeed. */
5703 /* Here, we discard `const', making re_match non-reentrant. */
5704 unsigned char *p2
= (unsigned char*) p
+ 2; /* counter loc. */
5707 PUSH_NUMBER (p2
, mcnt
);
5710 /* The two bytes encoding mcnt == 0 are two no_op opcodes. */
5715 /* Signedness doesn't matter since we only compare MCNT to 0. */
5716 EXTRACT_NUMBER (mcnt
, p
+ 2);
5717 DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt
);
5719 /* Originally, this is how many times we CAN jump. */
5722 /* Here, we discard `const', making re_match non-reentrant. */
5723 unsigned char *p2
= (unsigned char*) p
+ 2; /* counter loc. */
5725 PUSH_NUMBER (p2
, mcnt
);
5726 goto unconditional_jump
;
5728 /* If don't have to jump any more, skip over the rest of command. */
5735 unsigned char *p2
; /* Location of the counter. */
5736 DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
5738 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5739 /* Here, we discard `const', making re_match non-reentrant. */
5740 p2
= (unsigned char*) p
+ mcnt
;
5741 /* Signedness doesn't matter since we only copy MCNT's bits . */
5742 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5743 DEBUG_PRINT3 (" Setting %p to %d.\n", p2
, mcnt
);
5744 PUSH_NUMBER (p2
, mcnt
);
5750 not = (re_opcode_t
) *(p
- 1) == notwordbound
;
5751 DEBUG_PRINT2 ("EXECUTING %swordbound.\n", not?"not":"");
5753 /* We SUCCEED (or FAIL) in one of the following cases: */
5755 /* Case 1: D is at the beginning or the end of string. */
5756 if (AT_STRINGS_BEG (d
) || AT_STRINGS_END (d
))
5760 /* C1 is the character before D, S1 is the syntax of C1, C2
5761 is the character at D, and S2 is the syntax of C2. */
5765 int offset
= PTR_TO_OFFSET (d
- 1);
5766 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5767 UPDATE_SYNTAX_TABLE (charpos
);
5769 GET_CHAR_BEFORE_2 (c1
, d
, string1
, end1
, string2
, end2
);
5772 UPDATE_SYNTAX_TABLE_FORWARD (charpos
+ 1);
5774 PREFETCH_NOLIMIT ();
5775 c2
= RE_STRING_CHAR (d
, dend
- d
);
5778 if (/* Case 2: Only one of S1 and S2 is Sword. */
5779 ((s1
== Sword
) != (s2
== Sword
))
5780 /* Case 3: Both of S1 and S2 are Sword, and macro
5781 WORD_BOUNDARY_P (C1, C2) returns nonzero. */
5782 || ((s1
== Sword
) && WORD_BOUNDARY_P (c1
, c2
)))
5791 DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
5793 /* We FAIL in one of the following cases: */
5795 /* Case 1: D is at the end of string. */
5796 if (AT_STRINGS_END (d
))
5800 /* C1 is the character before D, S1 is the syntax of C1, C2
5801 is the character at D, and S2 is the syntax of C2. */
5805 int offset
= PTR_TO_OFFSET (d
);
5806 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5807 UPDATE_SYNTAX_TABLE (charpos
);
5810 c2
= RE_STRING_CHAR (d
, dend
- d
);
5813 /* Case 2: S2 is not Sword. */
5817 /* Case 3: D is not at the beginning of string ... */
5818 if (!AT_STRINGS_BEG (d
))
5820 GET_CHAR_BEFORE_2 (c1
, d
, string1
, end1
, string2
, end2
);
5822 UPDATE_SYNTAX_TABLE_BACKWARD (charpos
- 1);
5826 /* ... and S1 is Sword, and WORD_BOUNDARY_P (C1, C2)
5828 if ((s1
== Sword
) && !WORD_BOUNDARY_P (c1
, c2
))
5835 DEBUG_PRINT1 ("EXECUTING wordend.\n");
5837 /* We FAIL in one of the following cases: */
5839 /* Case 1: D is at the beginning of string. */
5840 if (AT_STRINGS_BEG (d
))
5844 /* C1 is the character before D, S1 is the syntax of C1, C2
5845 is the character at D, and S2 is the syntax of C2. */
5849 int offset
= PTR_TO_OFFSET (d
) - 1;
5850 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5851 UPDATE_SYNTAX_TABLE (charpos
);
5853 GET_CHAR_BEFORE_2 (c1
, d
, string1
, end1
, string2
, end2
);
5856 /* Case 2: S1 is not Sword. */
5860 /* Case 3: D is not at the end of string ... */
5861 if (!AT_STRINGS_END (d
))
5863 PREFETCH_NOLIMIT ();
5864 c2
= RE_STRING_CHAR (d
, dend
- d
);
5866 UPDATE_SYNTAX_TABLE_FORWARD (charpos
);
5870 /* ... and S2 is Sword, and WORD_BOUNDARY_P (C1, C2)
5872 if ((s2
== Sword
) && !WORD_BOUNDARY_P (c1
, c2
))
5879 DEBUG_PRINT1 ("EXECUTING symbeg.\n");
5881 /* We FAIL in one of the following cases: */
5883 /* Case 1: D is at the end of string. */
5884 if (AT_STRINGS_END (d
))
5888 /* C1 is the character before D, S1 is the syntax of C1, C2
5889 is the character at D, and S2 is the syntax of C2. */
5893 int offset
= PTR_TO_OFFSET (d
);
5894 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5895 UPDATE_SYNTAX_TABLE (charpos
);
5898 c2
= RE_STRING_CHAR (d
, dend
- d
);
5901 /* Case 2: S2 is neither Sword nor Ssymbol. */
5902 if (s2
!= Sword
&& s2
!= Ssymbol
)
5905 /* Case 3: D is not at the beginning of string ... */
5906 if (!AT_STRINGS_BEG (d
))
5908 GET_CHAR_BEFORE_2 (c1
, d
, string1
, end1
, string2
, end2
);
5910 UPDATE_SYNTAX_TABLE_BACKWARD (charpos
- 1);
5914 /* ... and S1 is Sword or Ssymbol. */
5915 if (s1
== Sword
|| s1
== Ssymbol
)
5922 DEBUG_PRINT1 ("EXECUTING symend.\n");
5924 /* We FAIL in one of the following cases: */
5926 /* Case 1: D is at the beginning of string. */
5927 if (AT_STRINGS_BEG (d
))
5931 /* C1 is the character before D, S1 is the syntax of C1, C2
5932 is the character at D, and S2 is the syntax of C2. */
5936 int offset
= PTR_TO_OFFSET (d
) - 1;
5937 int charpos
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5938 UPDATE_SYNTAX_TABLE (charpos
);
5940 GET_CHAR_BEFORE_2 (c1
, d
, string1
, end1
, string2
, end2
);
5943 /* Case 2: S1 is neither Ssymbol nor Sword. */
5944 if (s1
!= Sword
&& s1
!= Ssymbol
)
5947 /* Case 3: D is not at the end of string ... */
5948 if (!AT_STRINGS_END (d
))
5950 PREFETCH_NOLIMIT ();
5951 c2
= RE_STRING_CHAR (d
, dend
- d
);
5953 UPDATE_SYNTAX_TABLE_FORWARD (charpos
);
5957 /* ... and S2 is Sword or Ssymbol. */
5958 if (s2
== Sword
|| s2
== Ssymbol
)
5966 not = (re_opcode_t
) *(p
- 1) == notsyntaxspec
;
5968 DEBUG_PRINT3 ("EXECUTING %ssyntaxspec %d.\n", not?"not":"", mcnt
);
5972 int offset
= PTR_TO_OFFSET (d
);
5973 int pos1
= SYNTAX_TABLE_BYTE_TO_CHAR (offset
);
5974 UPDATE_SYNTAX_TABLE (pos1
);
5981 c
= RE_STRING_CHAR_AND_LENGTH (d
, dend
- d
, len
);
5983 if ((SYNTAX (c
) != (enum syntaxcode
) mcnt
) ^ not)
5991 DEBUG_PRINT1 ("EXECUTING before_dot.\n");
5992 if (PTR_BYTE_POS (d
) >= PT_BYTE
)
5997 DEBUG_PRINT1 ("EXECUTING at_dot.\n");
5998 if (PTR_BYTE_POS (d
) != PT_BYTE
)
6003 DEBUG_PRINT1 ("EXECUTING after_dot.\n");
6004 if (PTR_BYTE_POS (d
) <= PT_BYTE
)
6009 case notcategoryspec
:
6010 not = (re_opcode_t
) *(p
- 1) == notcategoryspec
;
6012 DEBUG_PRINT3 ("EXECUTING %scategoryspec %d.\n", not?"not":"", mcnt
);
6018 c
= RE_STRING_CHAR_AND_LENGTH (d
, dend
- d
, len
);
6020 if ((!CHAR_HAS_CATEGORY (c
, mcnt
)) ^ not)
6031 continue; /* Successfully executed one pattern command; keep going. */
6034 /* We goto here if a matching operation fails. */
6036 IMMEDIATE_QUIT_CHECK
;
6037 if (!FAIL_STACK_EMPTY ())
6040 /* A restart point is known. Restore to that state. */
6041 DEBUG_PRINT1 ("\nFAIL:\n");
6042 POP_FAILURE_POINT (str
, pat
);
6043 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *pat
++))
6045 case on_failure_keep_string_jump
:
6046 assert (str
== NULL
);
6047 goto continue_failure_jump
;
6049 case on_failure_jump_nastyloop
:
6050 assert ((re_opcode_t
)pat
[-2] == no_op
);
6051 PUSH_FAILURE_POINT (pat
- 2, str
);
6054 case on_failure_jump_loop
:
6055 case on_failure_jump
:
6058 continue_failure_jump
:
6059 EXTRACT_NUMBER_AND_INCR (mcnt
, pat
);
6064 /* A special frame used for nastyloops. */
6071 assert (p
>= bufp
->buffer
&& p
<= pend
);
6073 if (d
>= string1
&& d
<= end1
)
6077 break; /* Matching at this starting point really fails. */
6081 goto restore_best_regs
;
6085 return -1; /* Failure to match. */
6088 /* Subroutine definitions for re_match_2. */
6090 /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
6091 bytes; nonzero otherwise. */
6094 bcmp_translate (s1
, s2
, len
, translate
, multibyte
)
6097 RE_TRANSLATE_TYPE translate
;
6098 const int multibyte
;
6100 register re_char
*p1
= s1
, *p2
= s2
;
6101 re_char
*p1_end
= s1
+ len
;
6102 re_char
*p2_end
= s2
+ len
;
6104 /* FIXME: Checking both p1 and p2 presumes that the two strings might have
6105 different lengths, but relying on a single `len' would break this. -sm */
6106 while (p1
< p1_end
&& p2
< p2_end
)
6108 int p1_charlen
, p2_charlen
;
6109 re_wchar_t p1_ch
, p2_ch
;
6111 p1_ch
= RE_STRING_CHAR_AND_LENGTH (p1
, p1_end
- p1
, p1_charlen
);
6112 p2_ch
= RE_STRING_CHAR_AND_LENGTH (p2
, p2_end
- p2
, p2_charlen
);
6114 if (RE_TRANSLATE (translate
, p1_ch
)
6115 != RE_TRANSLATE (translate
, p2_ch
))
6118 p1
+= p1_charlen
, p2
+= p2_charlen
;
6121 if (p1
!= p1_end
|| p2
!= p2_end
)
6127 /* Entry points for GNU code. */
6129 /* re_compile_pattern is the GNU regular expression compiler: it
6130 compiles PATTERN (of length SIZE) and puts the result in BUFP.
6131 Returns 0 if the pattern was valid, otherwise an error string.
6133 Assumes the `allocated' (and perhaps `buffer') and `translate' fields
6134 are set in BUFP on entry.
6136 We call regex_compile to do the actual compilation. */
6139 re_compile_pattern (pattern
, length
, bufp
)
6140 const char *pattern
;
6142 struct re_pattern_buffer
*bufp
;
6146 /* GNU code is written to assume at least RE_NREGS registers will be set
6147 (and at least one extra will be -1). */
6148 bufp
->regs_allocated
= REGS_UNALLOCATED
;
6150 /* And GNU code determines whether or not to get register information
6151 by passing null for the REGS argument to re_match, etc., not by
6155 ret
= regex_compile ((re_char
*) pattern
, length
, re_syntax_options
, bufp
);
6159 return gettext (re_error_msgid
[(int) ret
]);
6161 WEAK_ALIAS (__re_compile_pattern
, re_compile_pattern
)
6163 /* Entry points compatible with 4.2 BSD regex library. We don't define
6164 them unless specifically requested. */
6166 #if defined _REGEX_RE_COMP || defined _LIBC
6168 /* BSD has one and only one pattern buffer. */
6169 static struct re_pattern_buffer re_comp_buf
;
6173 /* Make these definitions weak in libc, so POSIX programs can redefine
6174 these names if they don't use our functions, and still use
6175 regcomp/regexec below without link errors. */
6185 if (!re_comp_buf
.buffer
)
6186 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
6187 return (char *) gettext ("No previous regular expression");
6191 if (!re_comp_buf
.buffer
)
6193 re_comp_buf
.buffer
= (unsigned char *) malloc (200);
6194 if (re_comp_buf
.buffer
== NULL
)
6195 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
6196 return (char *) gettext (re_error_msgid
[(int) REG_ESPACE
]);
6197 re_comp_buf
.allocated
= 200;
6199 re_comp_buf
.fastmap
= (char *) malloc (1 << BYTEWIDTH
);
6200 if (re_comp_buf
.fastmap
== NULL
)
6201 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
6202 return (char *) gettext (re_error_msgid
[(int) REG_ESPACE
]);
6205 /* Since `re_exec' always passes NULL for the `regs' argument, we
6206 don't need to initialize the pattern buffer fields which affect it. */
6208 ret
= regex_compile (s
, strlen (s
), re_syntax_options
, &re_comp_buf
);
6213 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
6214 return (char *) gettext (re_error_msgid
[(int) ret
]);
6225 const int len
= strlen (s
);
6227 0 <= re_search (&re_comp_buf
, s
, len
, 0, len
, (struct re_registers
*) 0);
6229 #endif /* _REGEX_RE_COMP */
6231 /* POSIX.2 functions. Don't define these for Emacs. */
6235 /* regcomp takes a regular expression as a string and compiles it.
6237 PREG is a regex_t *. We do not expect any fields to be initialized,
6238 since POSIX says we shouldn't. Thus, we set
6240 `buffer' to the compiled pattern;
6241 `used' to the length of the compiled pattern;
6242 `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
6243 REG_EXTENDED bit in CFLAGS is set; otherwise, to
6244 RE_SYNTAX_POSIX_BASIC;
6245 `fastmap' to an allocated space for the fastmap;
6246 `fastmap_accurate' to zero;
6247 `re_nsub' to the number of subexpressions in PATTERN.
6249 PATTERN is the address of the pattern string.
6251 CFLAGS is a series of bits which affect compilation.
6253 If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
6254 use POSIX basic syntax.
6256 If REG_NEWLINE is set, then . and [^...] don't match newline.
6257 Also, regexec will try a match beginning after every newline.
6259 If REG_ICASE is set, then we considers upper- and lowercase
6260 versions of letters to be equivalent when matching.
6262 If REG_NOSUB is set, then when PREG is passed to regexec, that
6263 routine will report only success or failure, and nothing about the
6266 It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for
6267 the return codes and their meanings.) */
6270 regcomp (preg
, pattern
, cflags
)
6271 regex_t
*__restrict preg
;
6272 const char *__restrict pattern
;
6277 = (cflags
& REG_EXTENDED
) ?
6278 RE_SYNTAX_POSIX_EXTENDED
: RE_SYNTAX_POSIX_BASIC
;
6280 /* regex_compile will allocate the space for the compiled pattern. */
6282 preg
->allocated
= 0;
6285 /* Try to allocate space for the fastmap. */
6286 preg
->fastmap
= (char *) malloc (1 << BYTEWIDTH
);
6288 if (cflags
& REG_ICASE
)
6293 = (RE_TRANSLATE_TYPE
) malloc (CHAR_SET_SIZE
6294 * sizeof (*(RE_TRANSLATE_TYPE
)0));
6295 if (preg
->translate
== NULL
)
6296 return (int) REG_ESPACE
;
6298 /* Map uppercase characters to corresponding lowercase ones. */
6299 for (i
= 0; i
< CHAR_SET_SIZE
; i
++)
6300 preg
->translate
[i
] = ISUPPER (i
) ? TOLOWER (i
) : i
;
6303 preg
->translate
= NULL
;
6305 /* If REG_NEWLINE is set, newlines are treated differently. */
6306 if (cflags
& REG_NEWLINE
)
6307 { /* REG_NEWLINE implies neither . nor [^...] match newline. */
6308 syntax
&= ~RE_DOT_NEWLINE
;
6309 syntax
|= RE_HAT_LISTS_NOT_NEWLINE
;
6312 syntax
|= RE_NO_NEWLINE_ANCHOR
;
6314 preg
->no_sub
= !!(cflags
& REG_NOSUB
);
6316 /* POSIX says a null character in the pattern terminates it, so we
6317 can use strlen here in compiling the pattern. */
6318 ret
= regex_compile ((re_char
*) pattern
, strlen (pattern
), syntax
, preg
);
6320 /* POSIX doesn't distinguish between an unmatched open-group and an
6321 unmatched close-group: both are REG_EPAREN. */
6322 if (ret
== REG_ERPAREN
)
6325 if (ret
== REG_NOERROR
&& preg
->fastmap
)
6326 { /* Compute the fastmap now, since regexec cannot modify the pattern
6328 re_compile_fastmap (preg
);
6329 if (preg
->can_be_null
)
6330 { /* The fastmap can't be used anyway. */
6331 free (preg
->fastmap
);
6332 preg
->fastmap
= NULL
;
6337 WEAK_ALIAS (__regcomp
, regcomp
)
6340 /* regexec searches for a given pattern, specified by PREG, in the
6343 If NMATCH is zero or REG_NOSUB was set in the cflags argument to
6344 `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at
6345 least NMATCH elements, and we set them to the offsets of the
6346 corresponding matched substrings.
6348 EFLAGS specifies `execution flags' which affect matching: if
6349 REG_NOTBOL is set, then ^ does not match at the beginning of the
6350 string; if REG_NOTEOL is set, then $ does not match at the end.
6352 We return 0 if we find a match and REG_NOMATCH if not. */
6355 regexec (preg
, string
, nmatch
, pmatch
, eflags
)
6356 const regex_t
*__restrict preg
;
6357 const char *__restrict string
;
6359 regmatch_t pmatch
[__restrict_arr
];
6363 struct re_registers regs
;
6364 regex_t private_preg
;
6365 int len
= strlen (string
);
6366 boolean want_reg_info
= !preg
->no_sub
&& nmatch
> 0 && pmatch
;
6368 private_preg
= *preg
;
6370 private_preg
.not_bol
= !!(eflags
& REG_NOTBOL
);
6371 private_preg
.not_eol
= !!(eflags
& REG_NOTEOL
);
6373 /* The user has told us exactly how many registers to return
6374 information about, via `nmatch'. We have to pass that on to the
6375 matching routines. */
6376 private_preg
.regs_allocated
= REGS_FIXED
;
6380 regs
.num_regs
= nmatch
;
6381 regs
.start
= TALLOC (nmatch
* 2, regoff_t
);
6382 if (regs
.start
== NULL
)
6383 return (int) REG_NOMATCH
;
6384 regs
.end
= regs
.start
+ nmatch
;
6387 /* Instead of using not_eol to implement REG_NOTEOL, we could simply
6388 pass (&private_preg, string, len + 1, 0, len, ...) pretending the string
6389 was a little bit longer but still only matching the real part.
6390 This works because the `endline' will check for a '\n' and will find a
6391 '\0', correctly deciding that this is not the end of a line.
6392 But it doesn't work out so nicely for REG_NOTBOL, since we don't have
6393 a convenient '\0' there. For all we know, the string could be preceded
6394 by '\n' which would throw things off. */
6396 /* Perform the searching operation. */
6397 ret
= re_search (&private_preg
, string
, len
,
6398 /* start: */ 0, /* range: */ len
,
6399 want_reg_info
? ®s
: (struct re_registers
*) 0);
6401 /* Copy the register information to the POSIX structure. */
6408 for (r
= 0; r
< nmatch
; r
++)
6410 pmatch
[r
].rm_so
= regs
.start
[r
];
6411 pmatch
[r
].rm_eo
= regs
.end
[r
];
6415 /* If we needed the temporary register info, free the space now. */
6419 /* We want zero return to mean success, unlike `re_search'. */
6420 return ret
>= 0 ? (int) REG_NOERROR
: (int) REG_NOMATCH
;
6422 WEAK_ALIAS (__regexec
, regexec
)
6425 /* Returns a message corresponding to an error code, ERRCODE, returned
6426 from either regcomp or regexec. We don't use PREG here. */
6429 regerror (errcode
, preg
, errbuf
, errbuf_size
)
6431 const regex_t
*preg
;
6439 || errcode
>= (sizeof (re_error_msgid
) / sizeof (re_error_msgid
[0])))
6440 /* Only error codes returned by the rest of the code should be passed
6441 to this routine. If we are given anything else, or if other regex
6442 code generates an invalid error code, then the program has a bug.
6443 Dump core so we can fix it. */
6446 msg
= gettext (re_error_msgid
[errcode
]);
6448 msg_size
= strlen (msg
) + 1; /* Includes the null. */
6450 if (errbuf_size
!= 0)
6452 if (msg_size
> errbuf_size
)
6454 strncpy (errbuf
, msg
, errbuf_size
- 1);
6455 errbuf
[errbuf_size
- 1] = 0;
6458 strcpy (errbuf
, msg
);
6463 WEAK_ALIAS (__regerror
, regerror
)
6466 /* Free dynamically allocated space used by PREG. */
6472 if (preg
->buffer
!= NULL
)
6473 free (preg
->buffer
);
6474 preg
->buffer
= NULL
;
6476 preg
->allocated
= 0;
6479 if (preg
->fastmap
!= NULL
)
6480 free (preg
->fastmap
);
6481 preg
->fastmap
= NULL
;
6482 preg
->fastmap_accurate
= 0;
6484 if (preg
->translate
!= NULL
)
6485 free (preg
->translate
);
6486 preg
->translate
= NULL
;
6488 WEAK_ALIAS (__regfree
, regfree
)
6490 #endif /* not emacs */
6492 /* arch-tag: 4ffd68ba-2a9e-435b-a21a-018990f9eeb2
6493 (do not change this comment) */