1 /* This is a modified version of the GNU C Library regular expression
2 matching library. It is modified to meet the requirements the NGS
3 JS interpreter has for its extension functions (re-entrancy, etc.).
4 All modifications are isolated with `JS' defines. You can enable
5 the original features by defining the pre-processor constant JS to
9 /* Extended regular expression matching and search library,
11 (Implements POSIX draft P1003.2/D11.2, except for some of the
12 internationalization features.)
13 Copyright (C) 1993, 94, 95, 96, 97, 98 Free Software Foundation, Inc.
15 The GNU C Library is free software; you can redistribute it and/or
16 modify it under the terms of the GNU Library General Public License as
17 published by the Free Software Foundation; either version 2 of the
18 License, or (at your option) any later version.
20 The GNU C Library is distributed in the hope that it will be useful,
21 but WITHOUT ANY WARRANTY; without even the implied warranty of
22 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
23 Library General Public License for more details.
25 You should have received a copy of the GNU Library General Public
26 License along with the GNU C Library; see the file COPYING.LIB. If not,
27 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
28 Boston, MA 02111-1307, USA. */
30 /* AIX requires this to be the first thing in the file. */
31 #if defined _AIX && !defined REGEX_MALLOC
39 //#include <jsconfig.h>
47 # if defined __GNUC__ || (defined __STDC__ && __STDC__)
48 # define PARAMS(args) args
50 # define PARAMS(args) ()
52 #endif /* Not PARAMS. */
54 #if defined STDC_HEADERS && !defined emacs
57 /* We need this for `regex.h', and perhaps for the Emacs include files. */
58 # include <sys/types.h>
61 #define WIDE_CHAR_SUPPORT (HAVE_WCTYPE_H && HAVE_WCHAR_H && HAVE_BTOWC)
63 /* For platform which support the ISO C amendement 1 functionality we
64 support user defined character classes. */
65 #if defined _LIBC || WIDE_CHAR_SUPPORT
66 /* Solaris 2.5 has a bug: <wchar.h> must be included before <wctype.h>. */
72 /* We have to keep the namespace clean. */
73 # define regfree(preg) __regfree (preg)
74 # define regexec(pr, st, nm, pm, ef) __regexec (pr, st, nm, pm, ef)
75 # define regcomp(preg, pattern, cflags) __regcomp (preg, pattern, cflags)
76 # define regerror(errcode, preg, errbuf, errbuf_size) \
77 __regerror(errcode, preg, errbuf, errbuf_size)
78 # define re_set_registers(bu, re, nu, st, en) \
79 __re_set_registers (bu, re, nu, st, en)
80 # define re_match_2(bufp, string1, size1, string2, size2, pos, regs, stop) \
81 __re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop)
82 # define re_match(bufp, string, size, pos, regs) \
83 __re_match (bufp, string, size, pos, regs)
84 # define re_search(bufp, string, size, startpos, range, regs) \
85 __re_search (bufp, string, size, startpos, range, regs)
86 # define re_compile_pattern(pattern, length, bufp) \
87 __re_compile_pattern (pattern, length, bufp)
88 # define re_set_syntax(syntax) __re_set_syntax (syntax)
89 # define re_search_2(bufp, st1, s1, st2, s2, startpos, range, regs, stop) \
90 __re_search_2 (bufp, st1, s1, st2, s2, startpos, range, regs, stop)
91 # define re_compile_fastmap(bufp) __re_compile_fastmap (bufp)
96 /* This is for other GNU distributions with internationalized messages. */
97 #if HAVE_LIBINTL_H || defined _LIBC
100 # define gettext(msgid) (msgid)
104 /* This define is so xgettext can find the internationalizable
106 # define gettext_noop(String) String
109 /* The `emacs' switch turns on certain matching commands
110 that make sense only in Emacs. */
117 #else /* not emacs */
119 /* If we are not linking with Emacs proper,
120 we can't use the relocating allocator
121 even if config.h says that we can. */
124 # if defined STDC_HEADERS || defined _LIBC || defined _WIN32
131 /* When used in Emacs's lib-src, we need to get bzero and bcopy somehow.
132 If nothing else has been done, use the method below. */
133 # ifdef INHIBIT_STRING_HEADER
134 # if !(defined HAVE_BZERO && defined HAVE_BCOPY)
135 # if !defined bzero && !defined bcopy
136 # undef INHIBIT_STRING_HEADER
141 /* This is the normal way of making sure we have a bcopy and a bzero.
142 This is used in most programs--a few other programs avoid this
143 by defining INHIBIT_STRING_HEADER. */
144 # ifndef INHIBIT_STRING_HEADER
145 # if defined HAVE_STRING_H || defined STDC_HEADERS || defined _LIBC
149 //# define bzero(s, n) (memset (s, '\0', n), (s))
151 //# define bzero(s, n) __bzero (s, n)
155 # include <strings.h>
157 //# define memcmp(s1, s2, n) bcmp (s1, s2, n)
160 //# define memcpy(d, s, n) (bcopy (s, d, n), (d))
162 #define bzero(d,l) memset(d,0,l)
166 /* Define the syntax stuff for \<, \>, etc. */
168 /* This must be nonzero for the wordchar and notwordchar pattern
169 commands in re_match_2. */
174 # ifdef SWITCH_ENUM_BUG
175 # define SWITCH_ENUM_CAST(x) ((int)(x))
177 # define SWITCH_ENUM_CAST(x) (x)
180 /* How many characters in the character set. */
181 # define CHAR_SET_SIZE 256
185 extern char *re_syntax_table
;
187 # else /* not SYNTAX_TABLE */
190 static char re_syntax_table
[CHAR_SET_SIZE
] =
193 0 1 2 3 4 5 6 7 8 9 a b c d e f */
194 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x00 - 0x0f */
195 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x10 - 0x1f */
196 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x20 - 0x2f */
197 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, /* 0x30 - 0x3f */
198 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x40 - 0x4f */
199 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, /* 0x50 - 0x5f */
200 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x60 - 0x6f */
201 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, /* 0x70 - 0x7f */
202 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80 - 0x8f */
203 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90 - 0x9f */
204 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0 - 0xaf */
205 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0 - 0xbf */
206 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xc0 - 0xcf */
207 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xd0 - 0xdf */
208 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xe0 - 0xef */
209 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xf0 - 0xff */
218 static char re_syntax_table
[CHAR_SET_SIZE
];
229 bzero (re_syntax_table
, sizeof re_syntax_table
);
231 for (c
= 'a'; c
<= 'z'; c
++)
232 re_syntax_table
[c
] = Sword
;
234 for (c
= 'A'; c
<= 'Z'; c
++)
235 re_syntax_table
[c
] = Sword
;
237 for (c
= '0'; c
<= '9'; c
++)
238 re_syntax_table
[c
] = Sword
;
240 re_syntax_table
['_'] = Sword
;
246 # endif /* not SYNTAX_TABLE */
248 # define SYNTAX(c) re_syntax_table[c]
250 #endif /* not emacs */
252 /* Get the interface, including the syntax bits. */
255 /* isalpha etc. are used for the character classes. */
258 /* Jim Meyering writes:
260 "... Some ctype macros are valid only for character codes that
261 isascii says are ASCII (SGI's IRIX-4.0.5 is one such system --when
262 using /bin/cc or gcc but without giving an ansi option). So, all
263 ctype uses should be through macros like ISPRINT... If
264 STDC_HEADERS is defined, then autoconf has verified that the ctype
265 macros don't need to be guarded with references to isascii. ...
266 Defining isascii to 1 should let any compiler worth its salt
267 eliminate the && through constant folding."
268 Solaris defines some of these symbols so we must undefine them first. */
271 #if defined STDC_HEADERS || (!defined isascii && !defined HAVE_ISASCII)
272 # define ISASCII(c) 1
274 # define ISASCII(c) isascii(c)
278 # define ISBLANK(c) (ISASCII (c) && isblank (c))
280 # define ISBLANK(c) ((c) == ' ' || (c) == '\t')
283 # define ISGRAPH(c) (ISASCII (c) && isgraph (c))
285 # define ISGRAPH(c) (ISASCII (c) && isprint (c) && !isspace (c))
289 #define ISPRINT(c) (ISASCII (c) && isprint (c))
290 #define ISDIGIT(c) (ISASCII (c) && isdigit (c))
291 #define ISALNUM(c) (ISASCII (c) && isalnum (c))
292 #define ISALPHA(c) (ISASCII (c) && isalpha (c))
293 #define ISCNTRL(c) (ISASCII (c) && iscntrl (c))
294 #define ISLOWER(c) (ISASCII (c) && islower (c))
295 #define ISPUNCT(c) (ISASCII (c) && ispunct (c))
296 #define ISSPACE(c) (ISASCII (c) && isspace (c))
297 #define ISUPPER(c) (ISASCII (c) && isupper (c))
298 #define ISXDIGIT(c) (ISASCII (c) && isxdigit (c))
301 # define NULL (void *)0
304 /* We remove any previous definition of `SIGN_EXTEND_CHAR',
305 since ours (we hope) works properly with all combinations of
306 machines, compilers, `char' and `unsigned char' argument types.
307 (Per Bothner suggested the basic approach.) */
308 #undef SIGN_EXTEND_CHAR
310 # define SIGN_EXTEND_CHAR(c) ((signed char) (c))
311 #else /* not __STDC__ */
312 /* As in Harbison and Steele. */
313 # define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
316 /* Should we use malloc or alloca? If REGEX_MALLOC is not defined, we
317 use `alloca' instead of `malloc'. This is because using malloc in
318 re_search* or re_match* could cause memory leaks when C-g is used in
319 Emacs; also, malloc is slower and causes storage fragmentation. On
320 the other hand, malloc is more portable, and easier to debug.
322 Because we sometimes use alloca, some routines have to be macros,
323 not functions -- `alloca'-allocated space disappears at the end of the
324 function it is called in. */
328 # define REGEX_ALLOCATE malloc
329 # define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize)
330 # define REGEX_FREE free
332 #else /* not REGEX_MALLOC */
334 /* Emacs already defines alloca, sometimes. */
337 /* Make alloca work the best possible way. */
339 # define alloca __builtin_alloca
340 # else /* not __GNUC__ */
343 # endif /* HAVE_ALLOCA_H */
344 # endif /* not __GNUC__ */
346 # endif /* not alloca */
348 # define REGEX_ALLOCATE alloca
350 /* Assumes a `char *destination' variable. */
351 # define REGEX_REALLOCATE(source, osize, nsize) \
352 (destination = (char *) alloca (nsize), \
353 memcpy (destination, source, osize))
355 /* No need to do anything to free, after alloca. */
356 # define REGEX_FREE(arg) ((void)0) /* Do nothing! But inhibit gcc warning. */
358 #endif /* not REGEX_MALLOC */
360 /* Define how to allocate the failure stack. */
362 #if defined REL_ALLOC && defined REGEX_MALLOC
364 # define REGEX_ALLOCATE_STACK(size) \
365 r_alloc (&failure_stack_ptr, (size))
366 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
367 r_re_alloc (&failure_stack_ptr, (nsize))
368 # define REGEX_FREE_STACK(ptr) \
369 r_alloc_free (&failure_stack_ptr)
371 #else /* not using relocating allocator */
375 # define REGEX_ALLOCATE_STACK malloc
376 # define REGEX_REALLOCATE_STACK(source, osize, nsize) realloc (source, nsize)
377 # define REGEX_FREE_STACK free
379 # else /* not REGEX_MALLOC */
381 # define REGEX_ALLOCATE_STACK alloca
383 # define REGEX_REALLOCATE_STACK(source, osize, nsize) \
384 REGEX_REALLOCATE (source, osize, nsize)
385 /* No need to explicitly free anything. */
386 # define REGEX_FREE_STACK(arg)
388 # endif /* not REGEX_MALLOC */
389 #endif /* not using relocating allocator */
392 /* True if `size1' is non-NULL and PTR is pointing anywhere inside
393 `string1' or just past its end. This works if PTR is NULL, which is
395 #define FIRST_STRING_P(ptr) \
396 (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
398 /* (Re)Allocate N items of type T using malloc, or fail. */
399 #define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t)))
400 #define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t)))
401 #define RETALLOC_IF(addr, n, t) \
402 if (addr) RETALLOC((addr), (n), t); else (addr) = TALLOC ((n), t)
403 #define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
405 #define BYTEWIDTH 8 /* In bits. */
407 #define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
411 #define MAX(a, b) ((a) > (b) ? (a) : (b))
412 #define MIN(a, b) ((a) < (b) ? (a) : (b))
414 typedef char boolean
;
418 static int re_match_2_internal
PARAMS ((struct re_pattern_buffer
*bufp
,
419 const char *string1
, int size1
,
420 const char *string2
, int size2
,
422 struct re_registers
*regs
,
425 /* These are the command codes that appear in compiled regular
426 expressions. Some opcodes are followed by argument bytes. A
427 command code can specify any interpretation whatsoever for its
428 arguments. Zero bytes may appear in the compiled regular expression. */
434 /* Succeed right away--no more backtracking. */
437 /* Followed by one byte giving n, then by n literal bytes. */
440 /* Matches any (more or less) character. */
443 /* Matches any one char belonging to specified set. First
444 following byte is number of bitmap bytes. Then come bytes
445 for a bitmap saying which chars are in. Bits in each byte
446 are ordered low-bit-first. A character is in the set if its
447 bit is 1. A character too large to have a bit in the map is
448 automatically not in the set. */
451 /* Same parameters as charset, but match any character that is
452 not one of those specified. */
455 /* Start remembering the text that is matched, for storing in a
456 register. Followed by one byte with the register number, in
457 the range 0 to one less than the pattern buffer's re_nsub
458 field. Then followed by one byte with the number of groups
459 inner to this one. (This last has to be part of the
460 start_memory only because we need it in the on_failure_jump
464 /* Stop remembering the text that is matched and store it in a
465 memory register. Followed by one byte with the register
466 number, in the range 0 to one less than `re_nsub' in the
467 pattern buffer, and one byte with the number of inner groups,
468 just like `start_memory'. (We need the number of inner
469 groups here because we don't have any easy way of finding the
470 corresponding start_memory when we're at a stop_memory.) */
473 /* Match a duplicate of something remembered. Followed by one
474 byte containing the register number. */
477 /* Fail unless at beginning of line. */
480 /* Fail unless at end of line. */
483 /* Succeeds if at beginning of buffer (if emacs) or at beginning
484 of string to be matched (if not). */
487 /* Analogously, for end of buffer/string. */
490 /* Followed by two byte relative address to which to jump. */
493 /* Same as jump, but marks the end of an alternative. */
496 /* Followed by two-byte relative address of place to resume at
497 in case of failure. */
500 /* Like on_failure_jump, but pushes a placeholder instead of the
501 current string position when executed. */
502 on_failure_keep_string_jump
,
504 /* Throw away latest failure point and then jump to following
505 two-byte relative address. */
508 /* Change to pop_failure_jump if know won't have to backtrack to
509 match; otherwise change to jump. This is used to jump
510 back to the beginning of a repeat. If what follows this jump
511 clearly won't match what the repeat does, such that we can be
512 sure that there is no use backtracking out of repetitions
513 already matched, then we change it to a pop_failure_jump.
514 Followed by two-byte address. */
517 /* Jump to following two-byte address, and push a dummy failure
518 point. This failure point will be thrown away if an attempt
519 is made to use it for a failure. A `+' construct makes this
520 before the first repeat. Also used as an intermediary kind
521 of jump when compiling an alternative. */
524 /* Push a dummy failure point and continue. Used at the end of
528 /* Followed by two-byte relative address and two-byte number n.
529 After matching N times, jump to the address upon failure. */
532 /* Followed by two-byte relative address, and two-byte number n.
533 Jump to the address N times, then fail. */
536 /* Set the following two-byte relative address to the
537 subsequent two-byte number. The address *includes* the two
541 wordchar
, /* Matches any word-constituent character. */
542 notwordchar
, /* Matches any char that is not a word-constituent. */
544 wordbeg
, /* Succeeds if at word beginning. */
545 wordend
, /* Succeeds if at word end. */
547 wordbound
, /* Succeeds if at a word boundary. */
548 notwordbound
/* Succeeds if not at a word boundary. */
551 ,before_dot
, /* Succeeds if before point. */
552 at_dot
, /* Succeeds if at point. */
553 after_dot
, /* Succeeds if after point. */
555 /* Matches any character whose syntax is specified. Followed by
556 a byte which contains a syntax code, e.g., Sword. */
559 /* Matches any character whose syntax is not that specified. */
564 /* Common operations on the compiled pattern. */
566 /* Store NUMBER in two contiguous bytes starting at DESTINATION. */
568 #define STORE_NUMBER(destination, number) \
570 (destination)[0] = (number) & 0377; \
571 (destination)[1] = (number) >> 8; \
574 /* Same as STORE_NUMBER, except increment DESTINATION to
575 the byte after where the number is stored. Therefore, DESTINATION
576 must be an lvalue. */
578 #define STORE_NUMBER_AND_INCR(destination, number) \
580 STORE_NUMBER (destination, number); \
581 (destination) += 2; \
584 /* Put into DESTINATION a number stored in two contiguous bytes starting
587 #define EXTRACT_NUMBER(destination, source) \
589 (destination) = *(source) & 0377; \
590 (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8; \
594 static void extract_number
_RE_ARGS ((int *dest
, unsigned char *source
));
596 extract_number (dest
, source
)
598 unsigned char *source
;
600 int temp
= SIGN_EXTEND_CHAR (*(source
+ 1));
601 *dest
= *source
& 0377;
605 # ifndef EXTRACT_MACROS /* To debug the macros. */
606 # undef EXTRACT_NUMBER
607 # define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
608 # endif /* not EXTRACT_MACROS */
612 /* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
613 SOURCE must be an lvalue. */
615 #define EXTRACT_NUMBER_AND_INCR(destination, source) \
617 EXTRACT_NUMBER (destination, source); \
622 static void extract_number_and_incr
_RE_ARGS ((int *destination
,
623 unsigned char **source
));
625 extract_number_and_incr (destination
, source
)
627 unsigned char **source
;
629 extract_number (destination
, *source
);
633 # ifndef EXTRACT_MACROS
634 # undef EXTRACT_NUMBER_AND_INCR
635 # define EXTRACT_NUMBER_AND_INCR(dest, src) \
636 extract_number_and_incr (&dest, &src)
637 # endif /* not EXTRACT_MACROS */
641 /* If DEBUG is defined, Regex prints many voluminous messages about what
642 it is doing (if the variable `debug' is nonzero). If linked with the
643 main program in `iregex.c', you can enter patterns and strings
644 interactively. And if linked with the main program in `main.c' and
645 the other test files, you can run the already-written tests. */
649 /* We use standard I/O for debugging. */
652 /* It is useful to test things that ``must'' be true when debugging. */
655 static int debug
= 0;
657 # define DEBUG_STATEMENT(e) e
658 # define DEBUG_PRINT1(x) if (debug) printf (x)
659 # define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2)
660 # define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3)
661 # define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4)
662 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) \
663 if (debug) print_partial_compiled_pattern (s, e)
664 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2) \
665 if (debug) print_double_string (w, s1, sz1, s2, sz2)
668 /* Print the fastmap in human-readable form. */
671 print_fastmap (fastmap
)
674 unsigned was_a_range
= 0;
677 while (i
< (1 << BYTEWIDTH
))
683 while (i
< (1 << BYTEWIDTH
) && fastmap
[i
])
699 /* Print a compiled pattern string in human-readable form, starting at
700 the START pointer into it and ending just before the pointer END. */
703 print_partial_compiled_pattern (start
, end
)
704 unsigned char *start
;
709 unsigned char *p
= start
;
710 unsigned char *pend
= end
;
718 /* Loop over pattern commands. */
721 printf ("%d:\t", p
- start
);
723 switch ((re_opcode_t
) *p
++)
731 printf ("/exactn/%d", mcnt
);
742 printf ("/start_memory/%d/%d", mcnt
, *p
++);
747 printf ("/stop_memory/%d/%d", mcnt
, *p
++);
751 printf ("/duplicate/%d", *p
++);
761 register int c
, last
= -100;
762 register int in_range
= 0;
764 printf ("/charset [%s",
765 (re_opcode_t
) *(p
- 1) == charset_not
? "^" : "");
767 assert (p
+ *p
< pend
);
769 for (c
= 0; c
< 256; c
++)
771 && (p
[1 + (c
/8)] & (1 << (c
% 8))))
773 /* Are we starting a range? */
774 if (last
+ 1 == c
&& ! in_range
)
779 /* Have we broken a range? */
780 else if (last
+ 1 != c
&& in_range
)
809 case on_failure_jump
:
810 extract_number_and_incr (&mcnt
, &p
);
811 printf ("/on_failure_jump to %d", p
+ mcnt
- start
);
814 case on_failure_keep_string_jump
:
815 extract_number_and_incr (&mcnt
, &p
);
816 printf ("/on_failure_keep_string_jump to %d", p
+ mcnt
- start
);
819 case dummy_failure_jump
:
820 extract_number_and_incr (&mcnt
, &p
);
821 printf ("/dummy_failure_jump to %d", p
+ mcnt
- start
);
824 case push_dummy_failure
:
825 printf ("/push_dummy_failure");
829 extract_number_and_incr (&mcnt
, &p
);
830 printf ("/maybe_pop_jump to %d", p
+ mcnt
- start
);
833 case pop_failure_jump
:
834 extract_number_and_incr (&mcnt
, &p
);
835 printf ("/pop_failure_jump to %d", p
+ mcnt
- start
);
839 extract_number_and_incr (&mcnt
, &p
);
840 printf ("/jump_past_alt to %d", p
+ mcnt
- start
);
844 extract_number_and_incr (&mcnt
, &p
);
845 printf ("/jump to %d", p
+ mcnt
- start
);
849 extract_number_and_incr (&mcnt
, &p
);
851 extract_number_and_incr (&mcnt2
, &p
);
852 printf ("/succeed_n to %d, %d times", p1
- start
, mcnt2
);
856 extract_number_and_incr (&mcnt
, &p
);
858 extract_number_and_incr (&mcnt2
, &p
);
859 printf ("/jump_n to %d, %d times", p1
- start
, mcnt2
);
863 extract_number_and_incr (&mcnt
, &p
);
865 extract_number_and_incr (&mcnt2
, &p
);
866 printf ("/set_number_at location %d to %d", p1
- start
, mcnt2
);
870 printf ("/wordbound");
874 printf ("/notwordbound");
886 printf ("/before_dot");
894 printf ("/after_dot");
898 printf ("/syntaxspec");
900 printf ("/%d", mcnt
);
904 printf ("/notsyntaxspec");
906 printf ("/%d", mcnt
);
911 printf ("/wordchar");
915 printf ("/notwordchar");
927 printf ("?%d", *(p
-1));
933 printf ("%d:\tend of pattern.\n", p
- start
);
938 print_compiled_pattern (bufp
)
939 struct re_pattern_buffer
*bufp
;
941 unsigned char *buffer
= bufp
->buffer
;
943 print_partial_compiled_pattern (buffer
, buffer
+ bufp
->used
);
944 printf ("%ld bytes used/%ld bytes allocated.\n",
945 bufp
->used
, bufp
->allocated
);
947 if (bufp
->fastmap_accurate
&& bufp
->fastmap
)
949 printf ("fastmap: ");
950 print_fastmap (bufp
->fastmap
);
953 printf ("re_nsub: %d\t", bufp
->re_nsub
);
954 printf ("regs_alloc: %d\t", bufp
->regs_allocated
);
955 printf ("can_be_null: %d\t", bufp
->can_be_null
);
956 printf ("newline_anchor: %d\n", bufp
->newline_anchor
);
957 printf ("no_sub: %d\t", bufp
->no_sub
);
958 printf ("not_bol: %d\t", bufp
->not_bol
);
959 printf ("not_eol: %d\t", bufp
->not_eol
);
960 printf ("syntax: %lx\n", bufp
->syntax
);
961 /* Perhaps we should print the translate table? */
966 print_double_string (where
, string1
, size1
, string2
, size2
)
979 if (FIRST_STRING_P (where
))
981 for (this_char
= where
- string1
; this_char
< size1
; this_char
++)
982 putchar (string1
[this_char
]);
987 for (this_char
= where
- string2
; this_char
< size2
; this_char
++)
988 putchar (string2
[this_char
]);
999 #else /* not DEBUG */
1004 # define DEBUG_STATEMENT(e)
1005 # define DEBUG_PRINT1(x)
1006 # define DEBUG_PRINT2(x1, x2)
1007 # define DEBUG_PRINT3(x1, x2, x3)
1008 # define DEBUG_PRINT4(x1, x2, x3, x4)
1009 # define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
1010 # define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
1012 #endif /* not DEBUG */
1015 reg_syntax_t re_syntax_options
= RE_SYNTAX_GNU_AWK
;
1017 /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can
1018 also be assigned to arbitrarily: each pattern buffer stores its own
1019 syntax, so it can be changed between regex compilations. */
1020 /* This has no initializer because initialized variables in Emacs
1021 become read-only after dumping. */
1022 reg_syntax_t re_syntax_options
;
1026 /* Specify the precise syntax of regexps for compilation. This provides
1027 for compatibility for various utilities which historically have
1028 different, incompatible syntaxes.
1030 The argument SYNTAX is a bit mask comprised of the various bits
1031 defined in regex.h. We return the old syntax. */
1034 re_set_syntax (syntax
)
1035 reg_syntax_t syntax
;
1037 reg_syntax_t ret
= re_syntax_options
;
1039 re_syntax_options
= syntax
;
1041 if (syntax
& RE_DEBUG
)
1043 else if (debug
) /* was on but now is not */
1049 weak_alias (__re_set_syntax
, re_set_syntax
)
1052 /* This table gives an error message for each of the error codes listed
1053 in regex.h. Obviously the order here has to be same as there.
1054 POSIX doesn't require that we do anything for REG_NOERROR,
1055 but why not be nice? */
1057 static const char *re_error_msgid
[] =
1059 gettext_noop ("Success"), /* REG_NOERROR */
1060 gettext_noop ("No match"), /* REG_NOMATCH */
1061 gettext_noop ("Invalid regular expression"), /* REG_BADPAT */
1062 gettext_noop ("Invalid collation character"), /* REG_ECOLLATE */
1063 gettext_noop ("Invalid character class name"), /* REG_ECTYPE */
1064 gettext_noop ("Trailing backslash"), /* REG_EESCAPE */
1065 gettext_noop ("Invalid back reference"), /* REG_ESUBREG */
1066 gettext_noop ("Unmatched [ or [^"), /* REG_EBRACK */
1067 gettext_noop ("Unmatched ( or \\("), /* REG_EPAREN */
1068 gettext_noop ("Unmatched \\{"), /* REG_EBRACE */
1069 gettext_noop ("Invalid content of \\{\\}"), /* REG_BADBR */
1070 gettext_noop ("Invalid range end"), /* REG_ERANGE */
1071 gettext_noop ("Memory exhausted"), /* REG_ESPACE */
1072 gettext_noop ("Invalid preceding regular expression"), /* REG_BADRPT */
1073 gettext_noop ("Premature end of regular expression"), /* REG_EEND */
1074 gettext_noop ("Regular expression too big"), /* REG_ESIZE */
1075 gettext_noop ("Unmatched ) or \\)"), /* REG_ERPAREN */
1078 /* Avoiding alloca during matching, to placate r_alloc. */
1080 /* Define MATCH_MAY_ALLOCATE unless we need to make sure that the
1081 searching and matching functions should not call alloca. On some
1082 systems, alloca is implemented in terms of malloc, and if we're
1083 using the relocating allocator routines, then malloc could cause a
1084 relocation, which might (if the strings being searched are in the
1085 ralloc heap) shift the data out from underneath the regexp
1088 Here's another reason to avoid allocation: Emacs
1089 processes input from X in a signal handler; processing X input may
1090 call malloc; if input arrives while a matching routine is calling
1091 malloc, then we're scrod. But Emacs can't just block input while
1092 calling matching routines; then we don't notice interrupts when
1093 they come in. So, Emacs blocks input around all regexp calls
1094 except the matching calls, which it leaves unprotected, in the
1095 faith that they will not malloc. */
1097 /* Normally, this is fine. */
1098 #define MATCH_MAY_ALLOCATE
1100 /* When using GNU C, we are not REALLY using the C alloca, no matter
1101 what config.h may say. So don't take precautions for it. */
1106 /* The match routines may not allocate if (1) they would do it with malloc
1107 and (2) it's not safe for them to use malloc.
1108 Note that if REL_ALLOC is defined, matching would not use malloc for the
1109 failure stack, but we would still use it for the register vectors;
1110 so REL_ALLOC should not affect this. */
1111 #if (defined C_ALLOCA || defined REGEX_MALLOC) && defined emacs
1112 # undef MATCH_MAY_ALLOCATE
1116 /* Failure stack declarations and macros; both re_compile_fastmap and
1117 re_match_2 use a failure stack. These have to be macros because of
1118 REGEX_ALLOCATE_STACK. */
1121 /* Number of failure points for which to initially allocate space
1122 when matching. If this number is exceeded, we allocate more
1123 space, so it is not a hard limit. */
1124 #ifndef INIT_FAILURE_ALLOC
1125 # define INIT_FAILURE_ALLOC 5
1128 /* Roughly the maximum number of failure points on the stack. Would be
1129 exactly that if always used MAX_FAILURE_ITEMS items each time we failed.
1130 This is a variable only so users of regex can assign to it; we never
1131 change it ourselves. */
1135 # if defined MATCH_MAY_ALLOCATE
1136 /* 4400 was enough to cause a crash on Alpha OSF/1,
1137 whose default stack limit is 2mb. */
1138 long int re_max_failures
= 4000;
1140 long int re_max_failures
= 2000;
1143 union fail_stack_elt
1145 unsigned char *pointer
;
1149 typedef union fail_stack_elt fail_stack_elt_t
;
1153 fail_stack_elt_t
*stack
;
1154 unsigned long int size
;
1155 unsigned long int avail
; /* Offset of next open position. */
1158 #else /* not INT_IS_16BIT */
1160 # if defined MATCH_MAY_ALLOCATE
1161 /* 4400 was enough to cause a crash on Alpha OSF/1,
1162 whose default stack limit is 2mb. */
1163 int re_max_failures
= 20000;
1165 int re_max_failures
= 2000;
1168 union fail_stack_elt
1170 unsigned char *pointer
;
1174 typedef union fail_stack_elt fail_stack_elt_t
;
1178 fail_stack_elt_t
*stack
;
1180 unsigned avail
; /* Offset of next open position. */
1183 #endif /* INT_IS_16BIT */
1185 #define FAIL_STACK_EMPTY() (fail_stack.avail == 0)
1186 #define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
1187 #define FAIL_STACK_FULL() (fail_stack.avail == fail_stack.size)
1190 /* Define macros to initialize and free the failure stack.
1191 Do `return -2' if the alloc fails. */
1193 #ifdef MATCH_MAY_ALLOCATE
1194 # define INIT_FAIL_STACK() \
1196 fail_stack.stack = (fail_stack_elt_t *) \
1197 REGEX_ALLOCATE_STACK (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t)); \
1199 if (fail_stack.stack == NULL) \
1202 fail_stack.size = INIT_FAILURE_ALLOC; \
1203 fail_stack.avail = 0; \
1206 # define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
1208 # define INIT_FAIL_STACK() \
1210 fail_stack.avail = 0; \
1213 # define RESET_FAIL_STACK()
1217 /* Double the size of FAIL_STACK, up to approximately `re_max_failures' items.
1219 Return 1 if succeeds, and 0 if either ran out of memory
1220 allocating space for it or it was already too large.
1222 REGEX_REALLOCATE_STACK requires `destination' be declared. */
1224 #define DOUBLE_FAIL_STACK(fail_stack) \
1225 ((fail_stack).size > (unsigned) (re_max_failures * MAX_FAILURE_ITEMS) \
1227 : ((fail_stack).stack = (fail_stack_elt_t *) \
1228 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
1229 (fail_stack).size * sizeof (fail_stack_elt_t), \
1230 ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)), \
1232 (fail_stack).stack == NULL \
1234 : ((fail_stack).size <<= 1, \
1238 /* Push pointer POINTER on FAIL_STACK.
1239 Return 1 if was able to do so and 0 if ran out of memory allocating
1241 #define PUSH_PATTERN_OP(POINTER, FAIL_STACK) \
1242 ((FAIL_STACK_FULL () \
1243 && !DOUBLE_FAIL_STACK (FAIL_STACK)) \
1245 : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \
1248 /* Push a pointer value onto the failure stack.
1249 Assumes the variable `fail_stack'. Probably should only
1250 be called from within `PUSH_FAILURE_POINT'. */
1251 #define PUSH_FAILURE_POINTER(item) \
1252 fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
1254 /* This pushes an integer-valued item onto the failure stack.
1255 Assumes the variable `fail_stack'. Probably should only
1256 be called from within `PUSH_FAILURE_POINT'. */
1257 #define PUSH_FAILURE_INT(item) \
1258 fail_stack.stack[fail_stack.avail++].integer = (item)
1260 /* Push a fail_stack_elt_t value onto the failure stack.
1261 Assumes the variable `fail_stack'. Probably should only
1262 be called from within `PUSH_FAILURE_POINT'. */
1263 #define PUSH_FAILURE_ELT(item) \
1264 fail_stack.stack[fail_stack.avail++] = (item)
1266 /* These three POP... operations complement the three PUSH... operations.
1267 All assume that `fail_stack' is nonempty. */
1268 #define POP_FAILURE_POINTER() fail_stack.stack[--fail_stack.avail].pointer
1269 #define POP_FAILURE_INT() fail_stack.stack[--fail_stack.avail].integer
1270 #define POP_FAILURE_ELT() fail_stack.stack[--fail_stack.avail]
1272 /* Used to omit pushing failure point id's when we're not debugging. */
1274 # define DEBUG_PUSH PUSH_FAILURE_INT
1275 # define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_INT ()
1277 # define DEBUG_PUSH(item)
1278 # define DEBUG_POP(item_addr)
1282 /* Push the information about the state we will need
1283 if we ever fail back to it.
1285 Requires variables fail_stack, regstart, regend, reg_info, and
1286 num_regs_pushed be declared. DOUBLE_FAIL_STACK requires `destination'
1289 Does `return FAILURE_CODE' if runs out of memory. */
1291 #define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code) \
1293 char *destination; \
1294 /* Must be int, so when we don't save any registers, the arithmetic \
1295 of 0 + -1 isn't done as unsigned. */ \
1296 /* Can't be int, since there is not a shred of a guarantee that int \
1297 is wide enough to hold a value of something to which pointer can \
1299 active_reg_t this_reg; \
1301 DEBUG_STATEMENT (failure_id++); \
1302 DEBUG_STATEMENT (nfailure_points_pushed++); \
1303 DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id); \
1304 DEBUG_PRINT2 (" Before push, next avail: %d\n", (fail_stack).avail);\
1305 DEBUG_PRINT2 (" size: %d\n", (fail_stack).size);\
1307 DEBUG_PRINT2 (" slots needed: %ld\n", NUM_FAILURE_ITEMS); \
1308 DEBUG_PRINT2 (" available: %d\n", REMAINING_AVAIL_SLOTS); \
1310 /* Ensure we have enough space allocated for what we will push. */ \
1311 while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS) \
1313 if (!DOUBLE_FAIL_STACK (fail_stack)) \
1314 return failure_code; \
1316 DEBUG_PRINT2 ("\n Doubled stack; size now: %d\n", \
1317 (fail_stack).size); \
1318 DEBUG_PRINT2 (" slots available: %d\n", REMAINING_AVAIL_SLOTS);\
1321 /* Push the info, starting with the registers. */ \
1322 DEBUG_PRINT1 ("\n"); \
1325 for (this_reg = lowest_active_reg; this_reg <= highest_active_reg; \
1328 DEBUG_PRINT2 (" Pushing reg: %lu\n", this_reg); \
1329 DEBUG_STATEMENT (num_regs_pushed++); \
1331 DEBUG_PRINT2 (" start: %p\n", regstart[this_reg]); \
1332 PUSH_FAILURE_POINTER (regstart[this_reg]); \
1334 DEBUG_PRINT2 (" end: %p\n", regend[this_reg]); \
1335 PUSH_FAILURE_POINTER (regend[this_reg]); \
1337 DEBUG_PRINT2 (" info: %p\n ", \
1338 reg_info[this_reg].word.pointer); \
1339 DEBUG_PRINT2 (" match_null=%d", \
1340 REG_MATCH_NULL_STRING_P (reg_info[this_reg])); \
1341 DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg])); \
1342 DEBUG_PRINT2 (" matched_something=%d", \
1343 MATCHED_SOMETHING (reg_info[this_reg])); \
1344 DEBUG_PRINT2 (" ever_matched=%d", \
1345 EVER_MATCHED_SOMETHING (reg_info[this_reg])); \
1346 DEBUG_PRINT1 ("\n"); \
1347 PUSH_FAILURE_ELT (reg_info[this_reg].word); \
1350 DEBUG_PRINT2 (" Pushing low active reg: %ld\n", lowest_active_reg);\
1351 PUSH_FAILURE_INT (lowest_active_reg); \
1353 DEBUG_PRINT2 (" Pushing high active reg: %ld\n", highest_active_reg);\
1354 PUSH_FAILURE_INT (highest_active_reg); \
1356 DEBUG_PRINT2 (" Pushing pattern %p:\n", pattern_place); \
1357 DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend); \
1358 PUSH_FAILURE_POINTER (pattern_place); \
1360 DEBUG_PRINT2 (" Pushing string %p: `", string_place); \
1361 DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2, \
1363 DEBUG_PRINT1 ("'\n"); \
1364 PUSH_FAILURE_POINTER (string_place); \
1366 DEBUG_PRINT2 (" Pushing failure id: %u\n", failure_id); \
1367 DEBUG_PUSH (failure_id); \
1370 /* This is the number of items that are pushed and popped on the stack
1371 for each register. */
1372 #define NUM_REG_ITEMS 3
1374 /* Individual items aside from the registers. */
1376 # define NUM_NONREG_ITEMS 5 /* Includes failure point id. */
1378 # define NUM_NONREG_ITEMS 4
1381 /* We push at most this many items on the stack. */
1382 /* We used to use (num_regs - 1), which is the number of registers
1383 this regexp will save; but that was changed to 5
1384 to avoid stack overflow for a regexp with lots of parens. */
1385 #define MAX_FAILURE_ITEMS (5 * NUM_REG_ITEMS + NUM_NONREG_ITEMS)
1387 /* We actually push this many items. */
1388 #define NUM_FAILURE_ITEMS \
1390 ? 0 : highest_active_reg - lowest_active_reg + 1) \
1394 /* How many items can still be added to the stack without overflowing it. */
1395 #define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
1398 /* Pops what PUSH_FAIL_STACK pushes.
1400 We restore into the parameters, all of which should be lvalues:
1401 STR -- the saved data position.
1402 PAT -- the saved pattern position.
1403 LOW_REG, HIGH_REG -- the highest and lowest active registers.
1404 REGSTART, REGEND -- arrays of string positions.
1405 REG_INFO -- array of information about each subexpression.
1407 Also assumes the variables `fail_stack' and (if debugging), `bufp',
1408 `pend', `string1', `size1', `string2', and `size2'. */
1410 #define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\
1412 DEBUG_STATEMENT (unsigned failure_id;) \
1413 active_reg_t this_reg; \
1414 const unsigned char *string_temp; \
1416 assert (!FAIL_STACK_EMPTY ()); \
1418 /* Remove failure points and point to how many regs pushed. */ \
1419 DEBUG_PRINT1 ("POP_FAILURE_POINT:\n"); \
1420 DEBUG_PRINT2 (" Before pop, next avail: %d\n", fail_stack.avail); \
1421 DEBUG_PRINT2 (" size: %d\n", fail_stack.size); \
1423 assert (fail_stack.avail >= NUM_NONREG_ITEMS); \
1425 DEBUG_POP (&failure_id); \
1426 DEBUG_PRINT2 (" Popping failure id: %u\n", failure_id); \
1428 /* If the saved string location is NULL, it came from an \
1429 on_failure_keep_string_jump opcode, and we want to throw away the \
1430 saved NULL, thus retaining our current position in the string. */ \
1431 string_temp = POP_FAILURE_POINTER (); \
1432 if (string_temp != NULL) \
1433 str = (const char *) string_temp; \
1435 DEBUG_PRINT2 (" Popping string %p: `", str); \
1436 DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2); \
1437 DEBUG_PRINT1 ("'\n"); \
1439 pat = (unsigned char *) POP_FAILURE_POINTER (); \
1440 DEBUG_PRINT2 (" Popping pattern %p:\n", pat); \
1441 DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend); \
1443 /* Restore register info. */ \
1444 high_reg = (active_reg_t) POP_FAILURE_INT (); \
1445 DEBUG_PRINT2 (" Popping high active reg: %ld\n", high_reg); \
1447 low_reg = (active_reg_t) POP_FAILURE_INT (); \
1448 DEBUG_PRINT2 (" Popping low active reg: %ld\n", low_reg); \
1451 for (this_reg = high_reg; this_reg >= low_reg; this_reg--) \
1453 DEBUG_PRINT2 (" Popping reg: %ld\n", this_reg); \
1455 reg_info[this_reg].word = POP_FAILURE_ELT (); \
1456 DEBUG_PRINT2 (" info: %p\n", \
1457 reg_info[this_reg].word.pointer); \
1459 regend[this_reg] = (const char *) POP_FAILURE_POINTER (); \
1460 DEBUG_PRINT2 (" end: %p\n", regend[this_reg]); \
1462 regstart[this_reg] = (const char *) POP_FAILURE_POINTER (); \
1463 DEBUG_PRINT2 (" start: %p\n", regstart[this_reg]); \
1467 for (this_reg = highest_active_reg; this_reg > high_reg; this_reg--) \
1469 reg_info[this_reg].word.integer = 0; \
1470 regend[this_reg] = 0; \
1471 regstart[this_reg] = 0; \
1473 highest_active_reg = high_reg; \
1476 set_regs_matched_done = 0; \
1477 DEBUG_STATEMENT (nfailure_points_popped++); \
1478 } /* POP_FAILURE_POINT */
1482 /* Structure for per-register (a.k.a. per-group) information.
1483 Other register information, such as the
1484 starting and ending positions (which are addresses), and the list of
1485 inner groups (which is a bits list) are maintained in separate
1488 We are making a (strictly speaking) nonportable assumption here: that
1489 the compiler will pack our bit fields into something that fits into
1490 the type of `word', i.e., is something that fits into one item on the
1494 /* Declarations and macros for re_match_2. */
1498 fail_stack_elt_t word
;
1501 /* This field is one if this group can match the empty string,
1502 zero if not. If not yet determined, `MATCH_NULL_UNSET_VALUE'. */
1503 #define MATCH_NULL_UNSET_VALUE 3
1504 unsigned match_null_string_p
: 2;
1505 unsigned is_active
: 1;
1506 unsigned matched_something
: 1;
1507 unsigned ever_matched_something
: 1;
1509 } register_info_type
;
1511 #define REG_MATCH_NULL_STRING_P(R) ((R).bits.match_null_string_p)
1512 #define IS_ACTIVE(R) ((R).bits.is_active)
1513 #define MATCHED_SOMETHING(R) ((R).bits.matched_something)
1514 #define EVER_MATCHED_SOMETHING(R) ((R).bits.ever_matched_something)
1517 /* Call this when have matched a real character; it sets `matched' flags
1518 for the subexpressions which we are currently inside. Also records
1519 that those subexprs have matched. */
1520 #define SET_REGS_MATCHED() \
1523 if (!set_regs_matched_done) \
1526 set_regs_matched_done = 1; \
1527 for (r = lowest_active_reg; r <= highest_active_reg; r++) \
1529 MATCHED_SOMETHING (reg_info[r]) \
1530 = EVER_MATCHED_SOMETHING (reg_info[r]) \
1537 /* Registers are set to a sentinel when they haven't yet matched. */
1538 static char reg_unset_dummy
;
1539 #define REG_UNSET_VALUE (®_unset_dummy)
1540 #define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
1542 /* Subroutine declarations and macros for regex_compile. */
1544 static reg_errcode_t regex_compile
_RE_ARGS ((const char *pattern
, size_t size
,
1545 reg_syntax_t syntax
,
1546 struct re_pattern_buffer
*bufp
));
1547 static void store_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
, int arg
));
1548 static void store_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1549 int arg1
, int arg2
));
1550 static void insert_op1
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1551 int arg
, unsigned char *end
));
1552 static void insert_op2
_RE_ARGS ((re_opcode_t op
, unsigned char *loc
,
1553 int arg1
, int arg2
, unsigned char *end
));
1554 static boolean at_begline_loc_p
_RE_ARGS ((const char *pattern
, const char *p
,
1555 reg_syntax_t syntax
));
1556 static boolean at_endline_loc_p
_RE_ARGS ((const char *p
, const char *pend
,
1557 reg_syntax_t syntax
));
1558 static reg_errcode_t compile_range
_RE_ARGS ((const char **p_ptr
,
1561 reg_syntax_t syntax
,
1564 /* Fetch the next character in the uncompiled pattern---translating it
1565 if necessary. Also cast from a signed character in the constant
1566 string passed to us by the user to an unsigned char that we can use
1567 as an array index (in, e.g., `translate'). */
1569 # define PATFETCH(c) \
1570 do {if (p == pend) return REG_EEND; \
1571 c = (unsigned char) *p++; \
1572 if (translate) c = (unsigned char) translate[c]; \
1576 /* Fetch the next character in the uncompiled pattern, with no
1578 #define PATFETCH_RAW(c) \
1579 do {if (p == pend) return REG_EEND; \
1580 c = (unsigned char) *p++; \
1583 /* Go backwards one character in the pattern. */
1584 #define PATUNFETCH p--
1587 /* If `translate' is non-null, return translate[D], else just D. We
1588 cast the subscript to translate because some data is declared as
1589 `char *', to avoid warnings when a string constant is passed. But
1590 when we use a character as a subscript we must make it unsigned. */
1592 # define TRANSLATE(d) \
1593 (translate ? (char) translate[(unsigned char) (d)] : (d))
1597 /* Macros for outputting the compiled pattern into `buffer'. */
1599 /* If the buffer isn't allocated when it comes in, use this. */
1600 #define INIT_BUF_SIZE 32
1602 /* Make sure we have at least N more bytes of space in buffer. */
1603 #define GET_BUFFER_SPACE(n) \
1604 while ((unsigned long) (b - bufp->buffer + (n)) > bufp->allocated) \
1607 /* Make sure we have one more byte of buffer space and then add C to it. */
1608 #define BUF_PUSH(c) \
1610 GET_BUFFER_SPACE (1); \
1611 *b++ = (unsigned char) (c); \
1615 /* Ensure we have two more bytes of buffer space and then append C1 and C2. */
1616 #define BUF_PUSH_2(c1, c2) \
1618 GET_BUFFER_SPACE (2); \
1619 *b++ = (unsigned char) (c1); \
1620 *b++ = (unsigned char) (c2); \
1624 /* As with BUF_PUSH_2, except for three bytes. */
1625 #define BUF_PUSH_3(c1, c2, c3) \
1627 GET_BUFFER_SPACE (3); \
1628 *b++ = (unsigned char) (c1); \
1629 *b++ = (unsigned char) (c2); \
1630 *b++ = (unsigned char) (c3); \
1634 /* Store a jump with opcode OP at LOC to location TO. We store a
1635 relative address offset by the three bytes the jump itself occupies. */
1636 #define STORE_JUMP(op, loc, to) \
1637 store_op1 (op, loc, (int) ((to) - (loc) - 3))
1639 /* Likewise, for a two-argument jump. */
1640 #define STORE_JUMP2(op, loc, to, arg) \
1641 store_op2 (op, loc, (int) ((to) - (loc) - 3), arg)
1643 /* Like `STORE_JUMP', but for inserting. Assume `b' is the buffer end. */
1644 #define INSERT_JUMP(op, loc, to) \
1645 insert_op1 (op, loc, (int) ((to) - (loc) - 3), b)
1647 /* Like `STORE_JUMP2', but for inserting. Assume `b' is the buffer end. */
1648 #define INSERT_JUMP2(op, loc, to, arg) \
1649 insert_op2 (op, loc, (int) ((to) - (loc) - 3), arg, b)
1652 /* This is not an arbitrary limit: the arguments which represent offsets
1653 into the pattern are two bytes long. So if 2^16 bytes turns out to
1654 be too small, many things would have to change. */
1655 /* Any other compiler which, like MSC, has allocation limit below 2^16
1656 bytes will have to use approach similar to what was done below for
1657 MSC and drop MAX_BUF_SIZE a bit. Otherwise you may end up
1658 reallocating to 0 bytes. Such thing is not going to work too well.
1659 You have been warned!! */
1660 #if defined _MSC_VER && !defined WIN32
1661 /* Microsoft C 16-bit versions limit malloc to approx 65512 bytes.
1662 The REALLOC define eliminates a flurry of conversion warnings,
1663 but is not required. */
1664 # define MAX_BUF_SIZE 65500L
1665 # define REALLOC(p,s) realloc ((p), (size_t) (s))
1667 # define MAX_BUF_SIZE (1L << 16)
1668 # define REALLOC(p,s) realloc ((p), (s))
1671 /* Extend the buffer by twice its current size via realloc and
1672 reset the pointers that pointed into the old block to point to the
1673 correct places in the new one. If extending the buffer results in it
1674 being larger than MAX_BUF_SIZE, then flag memory exhausted. */
1675 #define EXTEND_BUFFER() \
1677 unsigned char *old_buffer = bufp->buffer; \
1678 if (bufp->allocated == MAX_BUF_SIZE) \
1680 bufp->allocated <<= 1; \
1681 if (bufp->allocated > MAX_BUF_SIZE) \
1682 bufp->allocated = MAX_BUF_SIZE; \
1683 bufp->buffer = (unsigned char *) REALLOC (bufp->buffer, bufp->allocated);\
1684 if (bufp->buffer == NULL) \
1685 return REG_ESPACE; \
1686 /* If the buffer moved, move all the pointers into it. */ \
1687 if (old_buffer != bufp->buffer) \
1689 b = (b - old_buffer) + bufp->buffer; \
1690 begalt = (begalt - old_buffer) + bufp->buffer; \
1691 if (fixup_alt_jump) \
1692 fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\
1694 laststart = (laststart - old_buffer) + bufp->buffer; \
1695 if (pending_exact) \
1696 pending_exact = (pending_exact - old_buffer) + bufp->buffer; \
1701 /* Since we have one byte reserved for the register number argument to
1702 {start,stop}_memory, the maximum number of groups we can report
1703 things about is what fits in that byte. */
1704 #define MAX_REGNUM 255
1706 /* But patterns can have more than `MAX_REGNUM' registers. We just
1707 ignore the excess. */
1708 typedef unsigned regnum_t
;
1711 /* Macros for the compile stack. */
1713 /* Since offsets can go either forwards or backwards, this type needs to
1714 be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1. */
1715 /* int may be not enough when sizeof(int) == 2. */
1716 typedef long pattern_offset_t
;
1720 pattern_offset_t begalt_offset
;
1721 pattern_offset_t fixup_alt_jump
;
1722 pattern_offset_t inner_group_offset
;
1723 pattern_offset_t laststart_offset
;
1725 } compile_stack_elt_t
;
1730 compile_stack_elt_t
*stack
;
1732 unsigned avail
; /* Offset of next open position. */
1733 } compile_stack_type
;
1736 #define INIT_COMPILE_STACK_SIZE 32
1738 #define COMPILE_STACK_EMPTY (compile_stack.avail == 0)
1739 #define COMPILE_STACK_FULL (compile_stack.avail == compile_stack.size)
1741 /* The next available element. */
1742 #define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
1745 /* Set the bit for character C in a list. */
1746 #define SET_LIST_BIT(c) \
1747 (b[((unsigned char) (c)) / BYTEWIDTH] \
1748 |= 1 << (((unsigned char) c) % BYTEWIDTH))
1751 /* Get the next unsigned number in the uncompiled pattern. */
1752 #define GET_UNSIGNED_NUMBER(num) \
1756 while (ISDIGIT (c)) \
1760 num = num * 10 + c - '0'; \
1768 #if defined _LIBC || WIDE_CHAR_SUPPORT
1769 /* The GNU C library provides support for user-defined character classes
1770 and the functions from ISO C amendement 1. */
1771 # ifdef CHARCLASS_NAME_MAX
1772 # define CHAR_CLASS_MAX_LENGTH CHARCLASS_NAME_MAX
1774 /* This shouldn't happen but some implementation might still have this
1775 problem. Use a reasonable default value. */
1776 # define CHAR_CLASS_MAX_LENGTH 256
1780 # define IS_CHAR_CLASS(string) __wctype (string)
1782 # define IS_CHAR_CLASS(string) wctype (string)
1785 # define CHAR_CLASS_MAX_LENGTH 6 /* Namely, `xdigit'. */
1787 # define IS_CHAR_CLASS(string) \
1788 (STREQ (string, "alpha") || STREQ (string, "upper") \
1789 || STREQ (string, "lower") || STREQ (string, "digit") \
1790 || STREQ (string, "alnum") || STREQ (string, "xdigit") \
1791 || STREQ (string, "space") || STREQ (string, "print") \
1792 || STREQ (string, "punct") || STREQ (string, "graph") \
1793 || STREQ (string, "cntrl") || STREQ (string, "blank"))
1796 #ifndef MATCH_MAY_ALLOCATE
1798 /* If we cannot allocate large objects within re_match_2_internal,
1799 we make the fail stack and register vectors global.
1800 The fail stack, we grow to the maximum size when a regexp
1802 The register vectors, we adjust in size each time we
1803 compile a regexp, according to the number of registers it needs. */
1805 static fail_stack_type fail_stack
;
1807 /* Size with which the following vectors are currently allocated.
1808 That is so we can make them bigger as needed,
1809 but never make them smaller. */
1810 static int regs_allocated_size
;
1812 static const char ** regstart
, ** regend
;
1813 static const char ** old_regstart
, ** old_regend
;
1814 static const char **best_regstart
, **best_regend
;
1815 static register_info_type
*reg_info
;
1816 static const char **reg_dummy
;
1817 static register_info_type
*reg_info_dummy
;
1819 /* Make the register vectors big enough for NUM_REGS registers,
1820 but don't make them smaller. */
1823 regex_grow_registers (num_regs
)
1826 if (num_regs
> regs_allocated_size
)
1828 RETALLOC_IF (regstart
, num_regs
, const char *);
1829 RETALLOC_IF (regend
, num_regs
, const char *);
1830 RETALLOC_IF (old_regstart
, num_regs
, const char *);
1831 RETALLOC_IF (old_regend
, num_regs
, const char *);
1832 RETALLOC_IF (best_regstart
, num_regs
, const char *);
1833 RETALLOC_IF (best_regend
, num_regs
, const char *);
1834 RETALLOC_IF (reg_info
, num_regs
, register_info_type
);
1835 RETALLOC_IF (reg_dummy
, num_regs
, const char *);
1836 RETALLOC_IF (reg_info_dummy
, num_regs
, register_info_type
);
1838 regs_allocated_size
= num_regs
;
1842 #endif /* not MATCH_MAY_ALLOCATE */
1844 static boolean group_in_compile_stack
_RE_ARGS ((compile_stack_type
1848 /* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
1849 Returns one of error codes defined in `regex.h', or zero for success.
1851 Assumes the `allocated' (and perhaps `buffer') and `translate'
1852 fields are set in BUFP on entry.
1854 If it succeeds, results are put in BUFP (if it returns an error, the
1855 contents of BUFP are undefined):
1856 `buffer' is the compiled pattern;
1857 `syntax' is set to SYNTAX;
1858 `used' is set to the length of the compiled pattern;
1859 `fastmap_accurate' is zero;
1860 `re_nsub' is the number of subexpressions in PATTERN;
1861 `not_bol' and `not_eol' are zero;
1863 The `fastmap' and `newline_anchor' fields are neither
1864 examined nor set. */
1866 /* Return, freeing storage we allocated. */
1867 #define FREE_STACK_RETURN(value) \
1868 return (free (compile_stack.stack), value)
1870 static reg_errcode_t
1871 regex_compile (pattern
, size
, syntax
, bufp
)
1872 const char *pattern
;
1874 reg_syntax_t syntax
;
1875 struct re_pattern_buffer
*bufp
;
1877 /* We fetch characters from PATTERN here. Even though PATTERN is
1878 `char *' (i.e., signed), we declare these variables as unsigned, so
1879 they can be reliably used as array indices. */
1880 register unsigned char c
, c1
;
1882 /* A random temporary spot in PATTERN. */
1885 /* Points to the end of the buffer, where we should append. */
1886 register unsigned char *b
;
1888 /* Keeps track of unclosed groups. */
1889 compile_stack_type compile_stack
;
1891 /* Points to the current (ending) position in the pattern. */
1892 const char *p
= pattern
;
1893 const char *pend
= pattern
+ size
;
1895 /* How to translate the characters in the pattern. */
1896 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
1898 /* Address of the count-byte of the most recently inserted `exactn'
1899 command. This makes it possible to tell if a new exact-match
1900 character can be added to that command or if the character requires
1901 a new `exactn' command. */
1902 unsigned char *pending_exact
= 0;
1904 /* Address of start of the most recently finished expression.
1905 This tells, e.g., postfix * where to find the start of its
1906 operand. Reset at the beginning of groups and alternatives. */
1907 unsigned char *laststart
= 0;
1909 /* Address of beginning of regexp, or inside of last group. */
1910 unsigned char *begalt
;
1912 /* Place in the uncompiled pattern (i.e., the {) to
1913 which to go back if the interval is invalid. */
1914 const char *beg_interval
;
1916 /* Address of the place where a forward jump should go to the end of
1917 the containing expression. Each alternative of an `or' -- except the
1918 last -- ends with a forward jump of this sort. */
1919 unsigned char *fixup_alt_jump
= 0;
1921 /* Counts open-groups as they are encountered. Remembered for the
1922 matching close-group on the compile stack, so the same register
1923 number is put in the stop_memory as the start_memory. */
1924 regnum_t regnum
= 0;
1927 DEBUG_PRINT1 ("\nCompiling pattern: ");
1930 unsigned debug_count
;
1932 for (debug_count
= 0; debug_count
< size
; debug_count
++)
1933 putchar (pattern
[debug_count
]);
1938 /* Initialize the compile stack. */
1939 compile_stack
.stack
= TALLOC (INIT_COMPILE_STACK_SIZE
, compile_stack_elt_t
);
1940 if (compile_stack
.stack
== NULL
)
1943 compile_stack
.size
= INIT_COMPILE_STACK_SIZE
;
1944 compile_stack
.avail
= 0;
1946 /* Initialize the pattern buffer. */
1947 bufp
->syntax
= syntax
;
1948 bufp
->fastmap_accurate
= 0;
1949 bufp
->not_bol
= bufp
->not_eol
= 0;
1951 /* Set `used' to zero, so that if we return an error, the pattern
1952 printer (for debugging) will think there's no pattern. We reset it
1956 /* Always count groups, whether or not bufp->no_sub is set. */
1959 #if !defined emacs && !defined SYNTAX_TABLE
1960 /* Initialize the syntax table. */
1961 init_syntax_once ();
1964 if (bufp
->allocated
== 0)
1967 { /* If zero allocated, but buffer is non-null, try to realloc
1968 enough space. This loses if buffer's address is bogus, but
1969 that is the user's responsibility. */
1970 RETALLOC (bufp
->buffer
, INIT_BUF_SIZE
, unsigned char);
1973 { /* Caller did not allocate a buffer. Do it for them. */
1974 bufp
->buffer
= TALLOC (INIT_BUF_SIZE
, unsigned char);
1976 if (!bufp
->buffer
) FREE_STACK_RETURN (REG_ESPACE
);
1978 bufp
->allocated
= INIT_BUF_SIZE
;
1981 begalt
= b
= bufp
->buffer
;
1983 /* Loop through the uncompiled pattern until we're at the end. */
1992 if ( /* If at start of pattern, it's an operator. */
1994 /* If context independent, it's an operator. */
1995 || syntax
& RE_CONTEXT_INDEP_ANCHORS
1996 /* Otherwise, depends on what's come before. */
1997 || at_begline_loc_p (pattern
, p
, syntax
))
2007 if ( /* If at end of pattern, it's an operator. */
2009 /* If context independent, it's an operator. */
2010 || syntax
& RE_CONTEXT_INDEP_ANCHORS
2011 /* Otherwise, depends on what's next. */
2012 || at_endline_loc_p (p
, pend
, syntax
))
2022 if ((syntax
& RE_BK_PLUS_QM
)
2023 || (syntax
& RE_LIMITED_OPS
))
2027 /* If there is no previous pattern... */
2030 if (syntax
& RE_CONTEXT_INVALID_OPS
)
2031 FREE_STACK_RETURN (REG_BADRPT
);
2032 else if (!(syntax
& RE_CONTEXT_INDEP_OPS
))
2037 /* Are we optimizing this jump? */
2038 boolean keep_string_p
= false;
2040 /* 1 means zero (many) matches is allowed. */
2041 char zero_times_ok
= 0, many_times_ok
= 0;
2043 /* If there is a sequence of repetition chars, collapse it
2044 down to just one (the right one). We can't combine
2045 interval operators with these because of, e.g., `a{2}*',
2046 which should only match an even number of `a's. */
2050 zero_times_ok
|= c
!= '+';
2051 many_times_ok
|= c
!= '?';
2059 || (!(syntax
& RE_BK_PLUS_QM
) && (c
== '+' || c
== '?')))
2062 else if (syntax
& RE_BK_PLUS_QM
&& c
== '\\')
2064 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2067 if (!(c1
== '+' || c1
== '?'))
2082 /* If we get here, we found another repeat character. */
2085 /* Star, etc. applied to an empty pattern is equivalent
2086 to an empty pattern. */
2090 /* Now we know whether or not zero matches is allowed
2091 and also whether or not two or more matches is allowed. */
2093 { /* More than one repetition is allowed, so put in at the
2094 end a backward relative jump from `b' to before the next
2095 jump we're going to put in below (which jumps from
2096 laststart to after this jump).
2098 But if we are at the `*' in the exact sequence `.*\n',
2099 insert an unconditional jump backwards to the .,
2100 instead of the beginning of the loop. This way we only
2101 push a failure point once, instead of every time
2102 through the loop. */
2103 assert (p
- 1 > pattern
);
2105 /* Allocate the space for the jump. */
2106 GET_BUFFER_SPACE (3);
2108 /* We know we are not at the first character of the pattern,
2109 because laststart was nonzero. And we've already
2110 incremented `p', by the way, to be the character after
2111 the `*'. Do we have to do something analogous here
2112 for null bytes, because of RE_DOT_NOT_NULL? */
2113 if (TRANSLATE (*(p
- 2)) == TRANSLATE ('.')
2115 && p
< pend
&& TRANSLATE (*p
) == TRANSLATE ('\n')
2116 && !(syntax
& RE_DOT_NEWLINE
))
2117 { /* We have .*\n. */
2118 STORE_JUMP (jump
, b
, laststart
);
2119 keep_string_p
= true;
2122 /* Anything else. */
2123 STORE_JUMP (maybe_pop_jump
, b
, laststart
- 3);
2125 /* We've added more stuff to the buffer. */
2129 /* On failure, jump from laststart to b + 3, which will be the
2130 end of the buffer after this jump is inserted. */
2131 GET_BUFFER_SPACE (3);
2132 INSERT_JUMP (keep_string_p
? on_failure_keep_string_jump
2140 /* At least one repetition is required, so insert a
2141 `dummy_failure_jump' before the initial
2142 `on_failure_jump' instruction of the loop. This
2143 effects a skip over that instruction the first time
2144 we hit that loop. */
2145 GET_BUFFER_SPACE (3);
2146 INSERT_JUMP (dummy_failure_jump
, laststart
, laststart
+ 6);
2161 boolean had_char_class
= false;
2163 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2165 /* Ensure that we have enough space to push a charset: the
2166 opcode, the length count, and the bitset; 34 bytes in all. */
2167 GET_BUFFER_SPACE (34);
2171 /* We test `*p == '^' twice, instead of using an if
2172 statement, so we only need one BUF_PUSH. */
2173 BUF_PUSH (*p
== '^' ? charset_not
: charset
);
2177 /* Remember the first position in the bracket expression. */
2180 /* Push the number of bytes in the bitmap. */
2181 BUF_PUSH ((1 << BYTEWIDTH
) / BYTEWIDTH
);
2183 /* Clear the whole map. */
2184 bzero (b
, (1 << BYTEWIDTH
) / BYTEWIDTH
);
2186 /* charset_not matches newline according to a syntax bit. */
2187 if ((re_opcode_t
) b
[-2] == charset_not
2188 && (syntax
& RE_HAT_LISTS_NOT_NEWLINE
))
2189 SET_LIST_BIT ('\n');
2191 /* Read in characters and ranges, setting map bits. */
2194 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2198 /* \ might escape characters inside [...] and [^...]. */
2199 if ((syntax
& RE_BACKSLASH_ESCAPE_IN_LISTS
) && c
== '\\')
2201 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2208 /* Could be the end of the bracket expression. If it's
2209 not (i.e., when the bracket expression is `[]' so
2210 far), the ']' character bit gets set way below. */
2211 if (c
== ']' && p
!= p1
+ 1)
2214 /* Look ahead to see if it's a range when the last thing
2215 was a character class. */
2216 if (had_char_class
&& c
== '-' && *p
!= ']')
2217 FREE_STACK_RETURN (REG_ERANGE
);
2219 /* Look ahead to see if it's a range when the last thing
2220 was a character: if this is a hyphen not at the
2221 beginning or the end of a list, then it's the range
2224 && !(p
- 2 >= pattern
&& p
[-2] == '[')
2225 && !(p
- 3 >= pattern
&& p
[-3] == '[' && p
[-2] == '^')
2229 = compile_range (&p
, pend
, translate
, syntax
, b
);
2230 if (ret
!= REG_NOERROR
) FREE_STACK_RETURN (ret
);
2233 else if (p
[0] == '-' && p
[1] != ']')
2234 { /* This handles ranges made up of characters only. */
2237 /* Move past the `-'. */
2240 ret
= compile_range (&p
, pend
, translate
, syntax
, b
);
2241 if (ret
!= REG_NOERROR
) FREE_STACK_RETURN (ret
);
2244 /* See if we're at the beginning of a possible character
2247 else if (syntax
& RE_CHAR_CLASSES
&& c
== '[' && *p
== ':')
2248 { /* Leave room for the null. */
2249 char str
[CHAR_CLASS_MAX_LENGTH
+ 1];
2254 /* If pattern is `[[:'. */
2255 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2260 if ((c
== ':' && *p
== ']') || p
== pend
2261 || c1
== CHAR_CLASS_MAX_LENGTH
)
2267 /* If isn't a word bracketed by `[:' and `:]':
2268 undo the ending character, the letters, and leave
2269 the leading `:' and `[' (but set bits for them). */
2270 if (c
== ':' && *p
== ']')
2272 #if defined _LIBC || WIDE_CHAR_SUPPORT
2273 boolean is_lower
= STREQ (str
, "lower");
2274 boolean is_upper
= STREQ (str
, "upper");
2278 wt
= IS_CHAR_CLASS (str
);
2280 FREE_STACK_RETURN (REG_ECTYPE
);
2282 /* Throw away the ] at the end of the character
2286 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2288 for (ch
= 0; ch
< 1 << BYTEWIDTH
; ++ch
)
2291 if (__iswctype (__btowc (ch
), wt
))
2294 if (iswctype (btowc (ch
), wt
))
2298 if (translate
&& (is_upper
|| is_lower
)
2299 && (ISUPPER (ch
) || ISLOWER (ch
)))
2303 had_char_class
= true;
2306 boolean is_alnum
= STREQ (str
, "alnum");
2307 boolean is_alpha
= STREQ (str
, "alpha");
2308 boolean is_blank
= STREQ (str
, "blank");
2309 boolean is_cntrl
= STREQ (str
, "cntrl");
2310 boolean is_digit
= STREQ (str
, "digit");
2311 boolean is_graph
= STREQ (str
, "graph");
2312 boolean is_lower
= STREQ (str
, "lower");
2313 boolean is_print
= STREQ (str
, "print");
2314 boolean is_punct
= STREQ (str
, "punct");
2315 boolean is_space
= STREQ (str
, "space");
2316 boolean is_upper
= STREQ (str
, "upper");
2317 boolean is_xdigit
= STREQ (str
, "xdigit");
2319 if (!IS_CHAR_CLASS (str
))
2320 FREE_STACK_RETURN (REG_ECTYPE
);
2322 /* Throw away the ] at the end of the character
2326 if (p
== pend
) FREE_STACK_RETURN (REG_EBRACK
);
2328 for (ch
= 0; ch
< 1 << BYTEWIDTH
; ch
++)
2330 /* This was split into 3 if's to
2331 avoid an arbitrary limit in some compiler. */
2332 if ( (is_alnum
&& ISALNUM (ch
))
2333 || (is_alpha
&& ISALPHA (ch
))
2334 || (is_blank
&& ISBLANK (ch
))
2335 || (is_cntrl
&& ISCNTRL (ch
)))
2337 if ( (is_digit
&& ISDIGIT (ch
))
2338 || (is_graph
&& ISGRAPH (ch
))
2339 || (is_lower
&& ISLOWER (ch
))
2340 || (is_print
&& ISPRINT (ch
)))
2342 if ( (is_punct
&& ISPUNCT (ch
))
2343 || (is_space
&& ISSPACE (ch
))
2344 || (is_upper
&& ISUPPER (ch
))
2345 || (is_xdigit
&& ISXDIGIT (ch
)))
2347 if ( translate
&& (is_upper
|| is_lower
)
2348 && (ISUPPER (ch
) || ISLOWER (ch
)))
2351 had_char_class
= true;
2352 #endif /* libc || wctype.h */
2361 had_char_class
= false;
2366 had_char_class
= false;
2371 /* Discard any (non)matching list bytes that are all 0 at the
2372 end of the map. Decrease the map-length byte too. */
2373 while ((int) b
[-1] > 0 && b
[b
[-1] - 1] == 0)
2381 if (syntax
& RE_NO_BK_PARENS
)
2388 if (syntax
& RE_NO_BK_PARENS
)
2395 if (syntax
& RE_NEWLINE_ALT
)
2402 if (syntax
& RE_NO_BK_VBAR
)
2409 if (syntax
& RE_INTERVALS
&& syntax
& RE_NO_BK_BRACES
)
2410 goto handle_interval
;
2416 if (p
== pend
) FREE_STACK_RETURN (REG_EESCAPE
);
2418 /* Do not translate the character after the \, so that we can
2419 distinguish, e.g., \B from \b, even if we normally would
2420 translate, e.g., B to b. */
2426 if (syntax
& RE_NO_BK_PARENS
)
2427 goto normal_backslash
;
2433 if (COMPILE_STACK_FULL
)
2435 RETALLOC (compile_stack
.stack
, compile_stack
.size
<< 1,
2436 compile_stack_elt_t
);
2437 if (compile_stack
.stack
== NULL
) return REG_ESPACE
;
2439 compile_stack
.size
<<= 1;
2442 /* These are the values to restore when we hit end of this
2443 group. They are all relative offsets, so that if the
2444 whole pattern moves because of realloc, they will still
2446 COMPILE_STACK_TOP
.begalt_offset
= begalt
- bufp
->buffer
;
2447 COMPILE_STACK_TOP
.fixup_alt_jump
2448 = fixup_alt_jump
? fixup_alt_jump
- bufp
->buffer
+ 1 : 0;
2449 COMPILE_STACK_TOP
.laststart_offset
= b
- bufp
->buffer
;
2450 COMPILE_STACK_TOP
.regnum
= regnum
;
2452 /* We will eventually replace the 0 with the number of
2453 groups inner to this one. But do not push a
2454 start_memory for groups beyond the last one we can
2455 represent in the compiled pattern. */
2456 if (regnum
<= MAX_REGNUM
)
2458 COMPILE_STACK_TOP
.inner_group_offset
= b
- bufp
->buffer
+ 2;
2459 BUF_PUSH_3 (start_memory
, regnum
, 0);
2462 compile_stack
.avail
++;
2467 /* If we've reached MAX_REGNUM groups, then this open
2468 won't actually generate any code, so we'll have to
2469 clear pending_exact explicitly. */
2475 if (syntax
& RE_NO_BK_PARENS
) goto normal_backslash
;
2477 if (COMPILE_STACK_EMPTY
)
2479 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
2480 goto normal_backslash
;
2482 FREE_STACK_RETURN (REG_ERPAREN
);
2487 { /* Push a dummy failure point at the end of the
2488 alternative for a possible future
2489 `pop_failure_jump' to pop. See comments at
2490 `push_dummy_failure' in `re_match_2'. */
2491 BUF_PUSH (push_dummy_failure
);
2493 /* We allocated space for this jump when we assigned
2494 to `fixup_alt_jump', in the `handle_alt' case below. */
2495 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
- 1);
2498 /* See similar code for backslashed left paren above. */
2499 if (COMPILE_STACK_EMPTY
)
2501 if (syntax
& RE_UNMATCHED_RIGHT_PAREN_ORD
)
2504 FREE_STACK_RETURN (REG_ERPAREN
);
2507 /* Since we just checked for an empty stack above, this
2508 ``can't happen''. */
2509 assert (compile_stack
.avail
!= 0);
2511 /* We don't just want to restore into `regnum', because
2512 later groups should continue to be numbered higher,
2513 as in `(ab)c(de)' -- the second group is #2. */
2514 regnum_t this_group_regnum
;
2516 compile_stack
.avail
--;
2517 begalt
= bufp
->buffer
+ COMPILE_STACK_TOP
.begalt_offset
;
2519 = COMPILE_STACK_TOP
.fixup_alt_jump
2520 ? bufp
->buffer
+ COMPILE_STACK_TOP
.fixup_alt_jump
- 1
2522 laststart
= bufp
->buffer
+ COMPILE_STACK_TOP
.laststart_offset
;
2523 this_group_regnum
= COMPILE_STACK_TOP
.regnum
;
2524 /* If we've reached MAX_REGNUM groups, then this open
2525 won't actually generate any code, so we'll have to
2526 clear pending_exact explicitly. */
2529 /* We're at the end of the group, so now we know how many
2530 groups were inside this one. */
2531 if (this_group_regnum
<= MAX_REGNUM
)
2533 unsigned char *inner_group_loc
2534 = bufp
->buffer
+ COMPILE_STACK_TOP
.inner_group_offset
;
2536 *inner_group_loc
= regnum
- this_group_regnum
;
2537 BUF_PUSH_3 (stop_memory
, this_group_regnum
,
2538 regnum
- this_group_regnum
);
2544 case '|': /* `\|'. */
2545 if (syntax
& RE_LIMITED_OPS
|| syntax
& RE_NO_BK_VBAR
)
2546 goto normal_backslash
;
2548 if (syntax
& RE_LIMITED_OPS
)
2551 /* Insert before the previous alternative a jump which
2552 jumps to this alternative if the former fails. */
2553 GET_BUFFER_SPACE (3);
2554 INSERT_JUMP (on_failure_jump
, begalt
, b
+ 6);
2558 /* The alternative before this one has a jump after it
2559 which gets executed if it gets matched. Adjust that
2560 jump so it will jump to this alternative's analogous
2561 jump (put in below, which in turn will jump to the next
2562 (if any) alternative's such jump, etc.). The last such
2563 jump jumps to the correct final destination. A picture:
2569 If we are at `b', then fixup_alt_jump right now points to a
2570 three-byte space after `a'. We'll put in the jump, set
2571 fixup_alt_jump to right after `b', and leave behind three
2572 bytes which we'll fill in when we get to after `c'. */
2575 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
);
2577 /* Mark and leave space for a jump after this alternative,
2578 to be filled in later either by next alternative or
2579 when know we're at the end of a series of alternatives. */
2581 GET_BUFFER_SPACE (3);
2590 /* If \{ is a literal. */
2591 if (!(syntax
& RE_INTERVALS
)
2592 /* If we're at `\{' and it's not the open-interval
2594 || ((syntax
& RE_INTERVALS
) && (syntax
& RE_NO_BK_BRACES
))
2595 || (p
- 2 == pattern
&& p
== pend
))
2596 goto normal_backslash
;
2600 /* If got here, then the syntax allows intervals. */
2602 /* At least (most) this many matches must be made. */
2603 int lower_bound
= -1, upper_bound
= -1;
2605 beg_interval
= p
- 1;
2609 if (syntax
& RE_NO_BK_BRACES
)
2610 goto unfetch_interval
;
2612 FREE_STACK_RETURN (REG_EBRACE
);
2615 GET_UNSIGNED_NUMBER (lower_bound
);
2619 GET_UNSIGNED_NUMBER (upper_bound
);
2620 if (upper_bound
< 0) upper_bound
= RE_DUP_MAX
;
2623 /* Interval such as `{1}' => match exactly once. */
2624 upper_bound
= lower_bound
;
2626 if (lower_bound
< 0 || upper_bound
> RE_DUP_MAX
2627 || lower_bound
> upper_bound
)
2629 if (syntax
& RE_NO_BK_BRACES
)
2630 goto unfetch_interval
;
2632 FREE_STACK_RETURN (REG_BADBR
);
2635 if (!(syntax
& RE_NO_BK_BRACES
))
2637 if (c
!= '\\') FREE_STACK_RETURN (REG_EBRACE
);
2644 if (syntax
& RE_NO_BK_BRACES
)
2645 goto unfetch_interval
;
2647 FREE_STACK_RETURN (REG_BADBR
);
2650 /* We just parsed a valid interval. */
2652 /* If it's invalid to have no preceding re. */
2655 if (syntax
& RE_CONTEXT_INVALID_OPS
)
2656 FREE_STACK_RETURN (REG_BADRPT
);
2657 else if (syntax
& RE_CONTEXT_INDEP_OPS
)
2660 goto unfetch_interval
;
2663 /* If the upper bound is zero, don't want to succeed at
2664 all; jump from `laststart' to `b + 3', which will be
2665 the end of the buffer after we insert the jump. */
2666 if (upper_bound
== 0)
2668 GET_BUFFER_SPACE (3);
2669 INSERT_JUMP (jump
, laststart
, b
+ 3);
2673 /* Otherwise, we have a nontrivial interval. When
2674 we're all done, the pattern will look like:
2675 set_number_at <jump count> <upper bound>
2676 set_number_at <succeed_n count> <lower bound>
2677 succeed_n <after jump addr> <succeed_n count>
2679 jump_n <succeed_n addr> <jump count>
2680 (The upper bound and `jump_n' are omitted if
2681 `upper_bound' is 1, though.) */
2683 { /* If the upper bound is > 1, we need to insert
2684 more at the end of the loop. */
2685 unsigned nbytes
= 10 + (upper_bound
> 1) * 10;
2687 GET_BUFFER_SPACE (nbytes
);
2689 /* Initialize lower bound of the `succeed_n', even
2690 though it will be set during matching by its
2691 attendant `set_number_at' (inserted next),
2692 because `re_compile_fastmap' needs to know.
2693 Jump to the `jump_n' we might insert below. */
2694 INSERT_JUMP2 (succeed_n
, laststart
,
2695 b
+ 5 + (upper_bound
> 1) * 5,
2699 /* Code to initialize the lower bound. Insert
2700 before the `succeed_n'. The `5' is the last two
2701 bytes of this `set_number_at', plus 3 bytes of
2702 the following `succeed_n'. */
2703 insert_op2 (set_number_at
, laststart
, 5, lower_bound
, b
);
2706 if (upper_bound
> 1)
2707 { /* More than one repetition is allowed, so
2708 append a backward jump to the `succeed_n'
2709 that starts this interval.
2711 When we've reached this during matching,
2712 we'll have matched the interval once, so
2713 jump back only `upper_bound - 1' times. */
2714 STORE_JUMP2 (jump_n
, b
, laststart
+ 5,
2718 /* The location we want to set is the second
2719 parameter of the `jump_n'; that is `b-2' as
2720 an absolute address. `laststart' will be
2721 the `set_number_at' we're about to insert;
2722 `laststart+3' the number to set, the source
2723 for the relative address. But we are
2724 inserting into the middle of the pattern --
2725 so everything is getting moved up by 5.
2726 Conclusion: (b - 2) - (laststart + 3) + 5,
2727 i.e., b - laststart.
2729 We insert this at the beginning of the loop
2730 so that if we fail during matching, we'll
2731 reinitialize the bounds. */
2732 insert_op2 (set_number_at
, laststart
, b
- laststart
,
2733 upper_bound
- 1, b
);
2738 beg_interval
= NULL
;
2743 /* If an invalid interval, match the characters as literals. */
2744 assert (beg_interval
);
2746 beg_interval
= NULL
;
2748 /* normal_char and normal_backslash need `c'. */
2751 if (!(syntax
& RE_NO_BK_BRACES
))
2753 if (p
> pattern
&& p
[-1] == '\\')
2754 goto normal_backslash
;
2759 /* There is no way to specify the before_dot and after_dot
2760 operators. rms says this is ok. --karl */
2768 BUF_PUSH_2 (syntaxspec
, syntax_spec_code
[c
]);
2774 BUF_PUSH_2 (notsyntaxspec
, syntax_spec_code
[c
]);
2780 if (syntax
& RE_NO_GNU_OPS
)
2783 BUF_PUSH (wordchar
);
2788 if (syntax
& RE_NO_GNU_OPS
)
2791 BUF_PUSH (notwordchar
);
2796 if (syntax
& RE_NO_GNU_OPS
)
2802 if (syntax
& RE_NO_GNU_OPS
)
2808 if (syntax
& RE_NO_GNU_OPS
)
2810 BUF_PUSH (wordbound
);
2814 if (syntax
& RE_NO_GNU_OPS
)
2816 BUF_PUSH (notwordbound
);
2820 if (syntax
& RE_NO_GNU_OPS
)
2826 if (syntax
& RE_NO_GNU_OPS
)
2831 case '1': case '2': case '3': case '4': case '5':
2832 case '6': case '7': case '8': case '9':
2833 if (syntax
& RE_NO_BK_REFS
)
2839 FREE_STACK_RETURN (REG_ESUBREG
);
2841 /* Can't back reference to a subexpression if inside of it. */
2842 if (group_in_compile_stack (compile_stack
, (regnum_t
) c1
))
2846 BUF_PUSH_2 (duplicate
, c1
);
2852 if (syntax
& RE_BK_PLUS_QM
)
2855 goto normal_backslash
;
2859 /* You might think it would be useful for \ to mean
2860 not to translate; but if we don't translate it
2861 it will never match anything. */
2869 /* Expects the character in `c'. */
2871 /* If no exactn currently being built. */
2874 /* If last exactn not at current position. */
2875 || pending_exact
+ *pending_exact
+ 1 != b
2877 /* We have only one byte following the exactn for the count. */
2878 || *pending_exact
== (1 << BYTEWIDTH
) - 1
2880 /* If followed by a repetition operator. */
2881 || *p
== '*' || *p
== '^'
2882 || ((syntax
& RE_BK_PLUS_QM
)
2883 ? *p
== '\\' && (p
[1] == '+' || p
[1] == '?')
2884 : (*p
== '+' || *p
== '?'))
2885 || ((syntax
& RE_INTERVALS
)
2886 && ((syntax
& RE_NO_BK_BRACES
)
2888 : (p
[0] == '\\' && p
[1] == '{'))))
2890 /* Start building a new exactn. */
2894 BUF_PUSH_2 (exactn
, 0);
2895 pending_exact
= b
- 1;
2902 } /* while p != pend */
2905 /* Through the pattern now. */
2908 STORE_JUMP (jump_past_alt
, fixup_alt_jump
, b
);
2910 if (!COMPILE_STACK_EMPTY
)
2911 FREE_STACK_RETURN (REG_EPAREN
);
2913 /* If we don't want backtracking, force success
2914 the first time we reach the end of the compiled pattern. */
2915 if (syntax
& RE_NO_POSIX_BACKTRACKING
)
2918 free (compile_stack
.stack
);
2920 /* We have succeeded; set the length of the buffer. */
2921 bufp
->used
= b
- bufp
->buffer
;
2926 DEBUG_PRINT1 ("\nCompiled pattern: \n");
2927 print_compiled_pattern (bufp
);
2931 #ifndef MATCH_MAY_ALLOCATE
2932 /* Initialize the failure stack to the largest possible stack. This
2933 isn't necessary unless we're trying to avoid calling alloca in
2934 the search and match routines. */
2936 int num_regs
= bufp
->re_nsub
+ 1;
2938 /* Since DOUBLE_FAIL_STACK refuses to double only if the current size
2939 is strictly greater than re_max_failures, the largest possible stack
2940 is 2 * re_max_failures failure points. */
2941 if (fail_stack
.size
< (2 * re_max_failures
* MAX_FAILURE_ITEMS
))
2943 fail_stack
.size
= (2 * re_max_failures
* MAX_FAILURE_ITEMS
);
2946 if (! fail_stack
.stack
)
2948 = (fail_stack_elt_t
*) xmalloc (fail_stack
.size
2949 * sizeof (fail_stack_elt_t
));
2952 = (fail_stack_elt_t
*) xrealloc (fail_stack
.stack
,
2954 * sizeof (fail_stack_elt_t
)));
2955 # else /* not emacs */
2956 if (! fail_stack
.stack
)
2958 = (fail_stack_elt_t
*) malloc (fail_stack
.size
2959 * sizeof (fail_stack_elt_t
));
2962 = (fail_stack_elt_t
*) realloc (fail_stack
.stack
,
2964 * sizeof (fail_stack_elt_t
)));
2965 # endif /* not emacs */
2968 regex_grow_registers (num_regs
);
2970 #endif /* not MATCH_MAY_ALLOCATE */
2973 } /* regex_compile */
2975 /* Subroutines for `regex_compile'. */
2977 /* Store OP at LOC followed by two-byte integer parameter ARG. */
2980 store_op1 (op
, loc
, arg
)
2985 *loc
= (unsigned char) op
;
2986 STORE_NUMBER (loc
+ 1, arg
);
2990 /* Like `store_op1', but for two two-byte parameters ARG1 and ARG2. */
2993 store_op2 (op
, loc
, arg1
, arg2
)
2998 *loc
= (unsigned char) op
;
2999 STORE_NUMBER (loc
+ 1, arg1
);
3000 STORE_NUMBER (loc
+ 3, arg2
);
3004 /* Copy the bytes from LOC to END to open up three bytes of space at LOC
3005 for OP followed by two-byte integer parameter ARG. */
3008 insert_op1 (op
, loc
, arg
, end
)
3014 register unsigned char *pfrom
= end
;
3015 register unsigned char *pto
= end
+ 3;
3017 while (pfrom
!= loc
)
3020 store_op1 (op
, loc
, arg
);
3024 /* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2. */
3027 insert_op2 (op
, loc
, arg1
, arg2
, end
)
3033 register unsigned char *pfrom
= end
;
3034 register unsigned char *pto
= end
+ 5;
3036 while (pfrom
!= loc
)
3039 store_op2 (op
, loc
, arg1
, arg2
);
3043 /* P points to just after a ^ in PATTERN. Return true if that ^ comes
3044 after an alternative or a begin-subexpression. We assume there is at
3045 least one character before the ^. */
3048 at_begline_loc_p (pattern
, p
, syntax
)
3049 const char *pattern
, *p
;
3050 reg_syntax_t syntax
;
3052 const char *prev
= p
- 2;
3053 boolean prev_prev_backslash
= prev
> pattern
&& prev
[-1] == '\\';
3056 /* After a subexpression? */
3057 (*prev
== '(' && (syntax
& RE_NO_BK_PARENS
|| prev_prev_backslash
))
3058 /* After an alternative? */
3059 || (*prev
== '|' && (syntax
& RE_NO_BK_VBAR
|| prev_prev_backslash
));
3063 /* The dual of at_begline_loc_p. This one is for $. We assume there is
3064 at least one character after the $, i.e., `P < PEND'. */
3067 at_endline_loc_p (p
, pend
, syntax
)
3068 const char *p
, *pend
;
3069 reg_syntax_t syntax
;
3071 const char *next
= p
;
3072 boolean next_backslash
= *next
== '\\';
3073 const char *next_next
= p
+ 1 < pend
? p
+ 1 : 0;
3076 /* Before a subexpression? */
3077 (syntax
& RE_NO_BK_PARENS
? *next
== ')'
3078 : next_backslash
&& next_next
&& *next_next
== ')')
3079 /* Before an alternative? */
3080 || (syntax
& RE_NO_BK_VBAR
? *next
== '|'
3081 : next_backslash
&& next_next
&& *next_next
== '|');
3085 /* Returns true if REGNUM is in one of COMPILE_STACK's elements and
3086 false if it's not. */
3089 group_in_compile_stack (compile_stack
, regnum
)
3090 compile_stack_type compile_stack
;
3095 for (this_element
= compile_stack
.avail
- 1;
3098 if (compile_stack
.stack
[this_element
].regnum
== regnum
)
3105 /* Read the ending character of a range (in a bracket expression) from the
3106 uncompiled pattern *P_PTR (which ends at PEND). We assume the
3107 starting character is in `P[-2]'. (`P[-1]' is the character `-'.)
3108 Then we set the translation of all bits between the starting and
3109 ending characters (inclusive) in the compiled pattern B.
3111 Return an error code.
3113 We use these short variable names so we can use the same macros as
3114 `regex_compile' itself. */
3116 static reg_errcode_t
3117 compile_range (p_ptr
, pend
, translate
, syntax
, b
)
3118 const char **p_ptr
, *pend
;
3119 RE_TRANSLATE_TYPE translate
;
3120 reg_syntax_t syntax
;
3125 const char *p
= *p_ptr
;
3126 unsigned int range_start
, range_end
;
3131 /* Even though the pattern is a signed `char *', we need to fetch
3132 with unsigned char *'s; if the high bit of the pattern character
3133 is set, the range endpoints will be negative if we fetch using a
3136 We also want to fetch the endpoints without translating them; the
3137 appropriate translation is done in the bit-setting loop below. */
3138 /* The SVR4 compiler on the 3B2 had trouble with unsigned const char *. */
3139 range_start
= ((const unsigned char *) p
)[-2];
3140 range_end
= ((const unsigned char *) p
)[0];
3142 /* Have to increment the pointer into the pattern string, so the
3143 caller isn't still at the ending character. */
3146 /* If the start is after the end, the range is empty. */
3147 if (range_start
> range_end
)
3148 return syntax
& RE_NO_EMPTY_RANGES
? REG_ERANGE
: REG_NOERROR
;
3150 /* Here we see why `this_char' has to be larger than an `unsigned
3151 char' -- the range is inclusive, so if `range_end' == 0xff
3152 (assuming 8-bit characters), we would otherwise go into an infinite
3153 loop, since all characters <= 0xff. */
3154 for (this_char
= range_start
; this_char
<= range_end
; this_char
++)
3156 SET_LIST_BIT (TRANSLATE (this_char
));
3162 /* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
3163 BUFP. A fastmap records which of the (1 << BYTEWIDTH) possible
3164 characters can start a string that matches the pattern. This fastmap
3165 is used by re_search to skip quickly over impossible starting points.
3167 The caller must supply the address of a (1 << BYTEWIDTH)-byte data
3168 area as BUFP->fastmap.
3170 We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
3173 Returns 0 if we succeed, -2 if an internal error. */
3176 re_compile_fastmap (bufp
)
3177 struct re_pattern_buffer
*bufp
;
3180 #ifdef MATCH_MAY_ALLOCATE
3181 fail_stack_type fail_stack
;
3183 #ifndef REGEX_MALLOC
3187 register char *fastmap
= bufp
->fastmap
;
3188 unsigned char *pattern
= bufp
->buffer
;
3189 unsigned char *p
= pattern
;
3190 register unsigned char *pend
= pattern
+ bufp
->used
;
3193 /* This holds the pointer to the failure stack, when
3194 it is allocated relocatably. */
3195 fail_stack_elt_t
*failure_stack_ptr
;
3198 /* Assume that each path through the pattern can be null until
3199 proven otherwise. We set this false at the bottom of switch
3200 statement, to which we get only if a particular path doesn't
3201 match the empty string. */
3202 boolean path_can_be_null
= true;
3204 /* We aren't doing a `succeed_n' to begin with. */
3205 boolean succeed_n_p
= false;
3207 assert (fastmap
!= NULL
&& p
!= NULL
);
3210 bzero (fastmap
, 1 << BYTEWIDTH
); /* Assume nothing's valid. */
3211 bufp
->fastmap_accurate
= 1; /* It will be when we're done. */
3212 bufp
->can_be_null
= 0;
3216 if (p
== pend
|| *p
== succeed
)
3218 /* We have reached the (effective) end of pattern. */
3219 if (!FAIL_STACK_EMPTY ())
3221 bufp
->can_be_null
|= path_can_be_null
;
3223 /* Reset for next path. */
3224 path_can_be_null
= true;
3226 p
= fail_stack
.stack
[--fail_stack
.avail
].pointer
;
3234 /* We should never be about to go beyond the end of the pattern. */
3237 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
3240 /* I guess the idea here is to simply not bother with a fastmap
3241 if a backreference is used, since it's too hard to figure out
3242 the fastmap for the corresponding group. Setting
3243 `can_be_null' stops `re_search_2' from using the fastmap, so
3244 that is all we do. */
3246 bufp
->can_be_null
= 1;
3250 /* Following are the cases which match a character. These end
3259 for (j
= *p
++ * BYTEWIDTH
- 1; j
>= 0; j
--)
3260 if (p
[j
/ BYTEWIDTH
] & (1 << (j
% BYTEWIDTH
)))
3266 /* Chars beyond end of map must be allowed. */
3267 for (j
= *p
* BYTEWIDTH
; j
< (1 << BYTEWIDTH
); j
++)
3270 for (j
= *p
++ * BYTEWIDTH
- 1; j
>= 0; j
--)
3271 if (!(p
[j
/ BYTEWIDTH
] & (1 << (j
% BYTEWIDTH
))))
3277 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3278 if (SYNTAX (j
) == Sword
)
3284 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3285 if (SYNTAX (j
) != Sword
)
3292 int fastmap_newline
= fastmap
['\n'];
3294 /* `.' matches anything ... */
3295 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3298 /* ... except perhaps newline. */
3299 if (!(bufp
->syntax
& RE_DOT_NEWLINE
))
3300 fastmap
['\n'] = fastmap_newline
;
3302 /* Return if we have already set `can_be_null'; if we have,
3303 then the fastmap is irrelevant. Something's wrong here. */
3304 else if (bufp
->can_be_null
)
3307 /* Otherwise, have to check alternative paths. */
3314 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3315 if (SYNTAX (j
) == (enum syntaxcode
) k
)
3322 for (j
= 0; j
< (1 << BYTEWIDTH
); j
++)
3323 if (SYNTAX (j
) != (enum syntaxcode
) k
)
3328 /* All cases after this match the empty string. These end with
3348 case push_dummy_failure
:
3353 case pop_failure_jump
:
3354 case maybe_pop_jump
:
3357 case dummy_failure_jump
:
3358 EXTRACT_NUMBER_AND_INCR (j
, p
);
3363 /* Jump backward implies we just went through the body of a
3364 loop and matched nothing. Opcode jumped to should be
3365 `on_failure_jump' or `succeed_n'. Just treat it like an
3366 ordinary jump. For a * loop, it has pushed its failure
3367 point already; if so, discard that as redundant. */
3368 if ((re_opcode_t
) *p
!= on_failure_jump
3369 && (re_opcode_t
) *p
!= succeed_n
)
3373 EXTRACT_NUMBER_AND_INCR (j
, p
);
3376 /* If what's on the stack is where we are now, pop it. */
3377 if (!FAIL_STACK_EMPTY ()
3378 && fail_stack
.stack
[fail_stack
.avail
- 1].pointer
== p
)
3384 case on_failure_jump
:
3385 case on_failure_keep_string_jump
:
3386 handle_on_failure_jump
:
3387 EXTRACT_NUMBER_AND_INCR (j
, p
);
3389 /* For some patterns, e.g., `(a?)?', `p+j' here points to the
3390 end of the pattern. We don't want to push such a point,
3391 since when we restore it above, entering the switch will
3392 increment `p' past the end of the pattern. We don't need
3393 to push such a point since we obviously won't find any more
3394 fastmap entries beyond `pend'. Such a pattern can match
3395 the null string, though. */
3398 if (!PUSH_PATTERN_OP (p
+ j
, fail_stack
))
3400 RESET_FAIL_STACK ();
3405 bufp
->can_be_null
= 1;
3409 EXTRACT_NUMBER_AND_INCR (k
, p
); /* Skip the n. */
3410 succeed_n_p
= false;
3417 /* Get to the number of times to succeed. */
3420 /* Increment p past the n for when k != 0. */
3421 EXTRACT_NUMBER_AND_INCR (k
, p
);
3425 succeed_n_p
= true; /* Spaghetti code alert. */
3426 goto handle_on_failure_jump
;
3443 abort (); /* We have listed all the cases. */
3446 /* Getting here means we have found the possible starting
3447 characters for one path of the pattern -- and that the empty
3448 string does not match. We need not follow this path further.
3449 Instead, look at the next alternative (remembered on the
3450 stack), or quit if no more. The test at the top of the loop
3451 does these things. */
3452 path_can_be_null
= false;
3456 /* Set `can_be_null' for the last path (also the first path, if the
3457 pattern is empty). */
3458 bufp
->can_be_null
|= path_can_be_null
;
3461 RESET_FAIL_STACK ();
3463 } /* re_compile_fastmap */
3465 weak_alias (__re_compile_fastmap
, re_compile_fastmap
)
3468 /* Set REGS to hold NUM_REGS registers, storing them in STARTS and
3469 ENDS. Subsequent matches using PATTERN_BUFFER and REGS will use
3470 this memory for recording register information. STARTS and ENDS
3471 must be allocated using the malloc library routine, and must each
3472 be at least NUM_REGS * sizeof (regoff_t) bytes long.
3474 If NUM_REGS == 0, then subsequent matches should allocate their own
3477 Unless this function is called, the first search or match using
3478 PATTERN_BUFFER will allocate its own register data, without
3479 freeing the old data. */
3482 re_set_registers (bufp
, regs
, num_regs
, starts
, ends
)
3483 struct re_pattern_buffer
*bufp
;
3484 struct re_registers
*regs
;
3486 regoff_t
*starts
, *ends
;
3490 bufp
->regs_allocated
= REGS_REALLOCATE
;
3491 regs
->num_regs
= num_regs
;
3492 regs
->start
= starts
;
3497 bufp
->regs_allocated
= REGS_UNALLOCATED
;
3499 regs
->start
= regs
->end
= (regoff_t
*) 0;
3503 weak_alias (__re_set_registers
, re_set_registers
)
3506 /* Searching routines. */
3508 /* Like re_search_2, below, but only one string is specified, and
3509 doesn't let you say where to stop matching. */
3512 re_search (bufp
, string
, size
, startpos
, range
, regs
)
3513 struct re_pattern_buffer
*bufp
;
3515 int size
, startpos
, range
;
3516 struct re_registers
*regs
;
3518 return re_search_2 (bufp
, NULL
, 0, string
, size
, startpos
, range
,
3522 weak_alias (__re_search
, re_search
)
3526 /* Using the compiled pattern in BUFP->buffer, first tries to match the
3527 virtual concatenation of STRING1 and STRING2, starting first at index
3528 STARTPOS, then at STARTPOS + 1, and so on.
3530 STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
3532 RANGE is how far to scan while trying to match. RANGE = 0 means try
3533 only at STARTPOS; in general, the last start tried is STARTPOS +
3536 In REGS, return the indices of the virtual concatenation of STRING1
3537 and STRING2 that matched the entire BUFP->buffer and its contained
3540 Do not consider matching one past the index STOP in the virtual
3541 concatenation of STRING1 and STRING2.
3543 We return either the position in the strings at which the match was
3544 found, -1 if no match, or -2 if error (such as failure
3548 re_search_2 (bufp
, string1
, size1
, string2
, size2
, startpos
, range
, regs
, stop
)
3549 struct re_pattern_buffer
*bufp
;
3550 const char *string1
, *string2
;
3554 struct re_registers
*regs
;
3558 register char *fastmap
= bufp
->fastmap
;
3559 register RE_TRANSLATE_TYPE translate
= bufp
->translate
;
3560 int total_size
= size1
+ size2
;
3561 int endpos
= startpos
+ range
;
3563 /* Check for out-of-range STARTPOS. */
3564 if (startpos
< 0 || startpos
> total_size
)
3567 /* Fix up RANGE if it might eventually take us outside
3568 the virtual concatenation of STRING1 and STRING2.
3569 Make sure we won't move STARTPOS below 0 or above TOTAL_SIZE. */
3571 range
= 0 - startpos
;
3572 else if (endpos
> total_size
)
3573 range
= total_size
- startpos
;
3575 /* If the search isn't to be a backwards one, don't waste time in a
3576 search for a pattern that must be anchored. */
3577 if (bufp
->used
> 0 && range
> 0
3578 && ((re_opcode_t
) bufp
->buffer
[0] == begbuf
3579 /* `begline' is like `begbuf' if it cannot match at newlines. */
3580 || ((re_opcode_t
) bufp
->buffer
[0] == begline
3581 && !bufp
->newline_anchor
)))
3590 /* In a forward search for something that starts with \=.
3591 don't keep searching past point. */
3592 if (bufp
->used
> 0 && (re_opcode_t
) bufp
->buffer
[0] == at_dot
&& range
> 0)
3594 range
= PT
- startpos
;
3600 /* Update the fastmap now if not correct already. */
3601 if (fastmap
&& !bufp
->fastmap_accurate
)
3602 if (re_compile_fastmap (bufp
) == -2)
3605 /* Loop through the string, looking for a place to start matching. */
3608 /* If a fastmap is supplied, skip quickly over characters that
3609 cannot be the start of a match. If the pattern can match the
3610 null string, however, we don't need to skip characters; we want
3611 the first null string. */
3612 if (fastmap
&& startpos
< total_size
&& !bufp
->can_be_null
)
3614 if (range
> 0) /* Searching forwards. */
3616 register const char *d
;
3617 register int lim
= 0;
3620 if (startpos
< size1
&& startpos
+ range
>= size1
)
3621 lim
= range
- (size1
- startpos
);
3623 d
= (startpos
>= size1
? string2
- size1
: string1
) + startpos
;
3625 /* Written out as an if-else to avoid testing `translate'
3629 && !fastmap
[(unsigned char)
3630 translate
[(unsigned char) *d
++]])
3633 while (range
> lim
&& !fastmap
[(unsigned char) *d
++])
3636 startpos
+= irange
- range
;
3638 else /* Searching backwards. */
3640 register char c
= (size1
== 0 || startpos
>= size1
3641 ? string2
[startpos
- size1
]
3642 : string1
[startpos
]);
3644 if (!fastmap
[(unsigned char) TRANSLATE (c
)])
3649 /* If can't match the null string, and that's all we have left, fail. */
3650 if (range
>= 0 && startpos
== total_size
&& fastmap
3651 && !bufp
->can_be_null
)
3654 val
= re_match_2_internal (bufp
, string1
, size1
, string2
, size2
,
3655 startpos
, regs
, stop
);
3656 #ifndef REGEX_MALLOC
3685 weak_alias (__re_search_2
, re_search_2
)
3688 /* This converts PTR, a pointer into one of the search strings `string1'
3689 and `string2' into an offset from the beginning of that string. */
3690 #define POINTER_TO_OFFSET(ptr) \
3691 (FIRST_STRING_P (ptr) \
3692 ? ((regoff_t) ((ptr) - string1)) \
3693 : ((regoff_t) ((ptr) - string2 + size1)))
3695 /* Macros for dealing with the split strings in re_match_2. */
3697 #define MATCHING_IN_FIRST_STRING (dend == end_match_1)
3699 /* Call before fetching a character with *d. This switches over to
3700 string2 if necessary. */
3701 #define PREFETCH() \
3704 /* End of string2 => fail. */ \
3705 if (dend == end_match_2) \
3707 /* End of string1 => advance to string2. */ \
3709 dend = end_match_2; \
3713 /* Test if at very beginning or at very end of the virtual concatenation
3714 of `string1' and `string2'. If only one string, it's `string2'. */
3715 #define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
3716 #define AT_STRINGS_END(d) ((d) == end2)
3719 /* Test if D points to a character which is word-constituent. We have
3720 two special cases to check for: if past the end of string1, look at
3721 the first character in string2; and if before the beginning of
3722 string2, look at the last character in string1. */
3723 #define WORDCHAR_P(d) \
3724 (SYNTAX ((d) == end1 ? *string2 \
3725 : (d) == string2 - 1 ? *(end1 - 1) : *(d)) \
3728 /* Disabled due to a compiler bug -- see comment at case wordbound */
3730 /* Test if the character before D and the one at D differ with respect
3731 to being word-constituent. */
3732 #define AT_WORD_BOUNDARY(d) \
3733 (AT_STRINGS_BEG (d) || AT_STRINGS_END (d) \
3734 || WORDCHAR_P (d - 1) != WORDCHAR_P (d))
3737 /* Free everything we malloc. */
3738 #ifdef MATCH_MAY_ALLOCATE
3739 # define FREE_VAR(var) if (var) REGEX_FREE (var); var = NULL
3740 # define FREE_VARIABLES() \
3742 REGEX_FREE_STACK (fail_stack.stack); \
3743 FREE_VAR (regstart); \
3744 FREE_VAR (regend); \
3745 FREE_VAR (old_regstart); \
3746 FREE_VAR (old_regend); \
3747 FREE_VAR (best_regstart); \
3748 FREE_VAR (best_regend); \
3749 FREE_VAR (reg_info); \
3750 FREE_VAR (reg_dummy); \
3751 FREE_VAR (reg_info_dummy); \
3754 # define FREE_VARIABLES() ((void)0) /* Do nothing! But inhibit gcc warning. */
3755 #endif /* not MATCH_MAY_ALLOCATE */
3757 /* These values must meet several constraints. They must not be valid
3758 register values; since we have a limit of 255 registers (because
3759 we use only one byte in the pattern for the register number), we can
3760 use numbers larger than 255. They must differ by 1, because of
3761 NUM_FAILURE_ITEMS above. And the value for the lowest register must
3762 be larger than the value for the highest register, so we do not try
3763 to actually save any registers when none are active. */
3764 #define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
3765 #define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
3767 /* Matching routines. */
3769 #ifndef emacs /* Emacs never uses this. */
3770 /* re_match is like re_match_2 except it takes only a single string. */
3773 re_match (bufp
, string
, size
, pos
, regs
)
3774 struct re_pattern_buffer
*bufp
;
3777 struct re_registers
*regs
;
3779 int result
= re_match_2_internal (bufp
, NULL
, 0, string
, size
,
3781 # ifndef REGEX_MALLOC
3789 weak_alias (__re_match
, re_match
)
3791 #endif /* not emacs */
3793 static boolean group_match_null_string_p
_RE_ARGS ((unsigned char **p
,
3795 register_info_type
*reg_info
));
3796 static boolean alt_match_null_string_p
_RE_ARGS ((unsigned char *p
,
3798 register_info_type
*reg_info
));
3799 static boolean common_op_match_null_string_p
_RE_ARGS ((unsigned char **p
,
3801 register_info_type
*reg_info
));
3802 static int bcmp_translate
_RE_ARGS ((const char *s1
, const char *s2
,
3803 int len
, char *translate
));
3805 /* re_match_2 matches the compiled pattern in BUFP against the
3806 the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1
3807 and SIZE2, respectively). We start matching at POS, and stop
3810 If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
3811 store offsets for the substring each group matched in REGS. See the
3812 documentation for exactly how many groups we fill.
3814 We return -1 if no match, -2 if an internal error (such as the
3815 failure stack overflowing). Otherwise, we return the length of the
3816 matched substring. */
3819 re_match_2 (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
3820 struct re_pattern_buffer
*bufp
;
3821 const char *string1
, *string2
;
3824 struct re_registers
*regs
;
3827 int result
= re_match_2_internal (bufp
, string1
, size1
, string2
, size2
,
3829 #ifndef REGEX_MALLOC
3837 weak_alias (__re_match_2
, re_match_2
)
3840 /* This is a separate function so that we can force an alloca cleanup
3843 re_match_2_internal (bufp
, string1
, size1
, string2
, size2
, pos
, regs
, stop
)
3844 struct re_pattern_buffer
*bufp
;
3845 const char *string1
, *string2
;
3848 struct re_registers
*regs
;
3851 /* General temporaries. */
3855 /* Just past the end of the corresponding string. */
3856 const char *end1
, *end2
;
3858 /* Pointers into string1 and string2, just past the last characters in
3859 each to consider matching. */
3860 const char *end_match_1
, *end_match_2
;
3862 /* Where we are in the data, and the end of the current string. */
3863 const char *d
, *dend
;
3865 /* Where we are in the pattern, and the end of the pattern. */
3866 unsigned char *p
= bufp
->buffer
;
3867 register unsigned char *pend
= p
+ bufp
->used
;
3869 /* Mark the opcode just after a start_memory, so we can test for an
3870 empty subpattern when we get to the stop_memory. */
3871 unsigned char *just_past_start_mem
= 0;
3873 /* We use this to map every character in the string. */
3874 RE_TRANSLATE_TYPE translate
= bufp
->translate
;
3876 /* Failure point stack. Each place that can handle a failure further
3877 down the line pushes a failure point on this stack. It consists of
3878 restart, regend, and reg_info for all registers corresponding to
3879 the subexpressions we're currently inside, plus the number of such
3880 registers, and, finally, two char *'s. The first char * is where
3881 to resume scanning the pattern; the second one is where to resume
3882 scanning the strings. If the latter is zero, the failure point is
3883 a ``dummy''; if a failure happens and the failure point is a dummy,
3884 it gets discarded and the next next one is tried. */
3885 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
3886 fail_stack_type fail_stack
;
3889 static unsigned failure_id
= 0;
3890 unsigned nfailure_points_pushed
= 0, nfailure_points_popped
= 0;
3894 /* This holds the pointer to the failure stack, when
3895 it is allocated relocatably. */
3896 fail_stack_elt_t
*failure_stack_ptr
;
3899 /* We fill all the registers internally, independent of what we
3900 return, for use in backreferences. The number here includes
3901 an element for register zero. */
3902 size_t num_regs
= bufp
->re_nsub
+ 1;
3904 /* The currently active registers. */
3905 active_reg_t lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
3906 active_reg_t highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
3908 /* Information on the contents of registers. These are pointers into
3909 the input strings; they record just what was matched (on this
3910 attempt) by a subexpression part of the pattern, that is, the
3911 regnum-th regstart pointer points to where in the pattern we began
3912 matching and the regnum-th regend points to right after where we
3913 stopped matching the regnum-th subexpression. (The zeroth register
3914 keeps track of what the whole pattern matches.) */
3915 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3916 const char **regstart
, **regend
;
3919 /* If a group that's operated upon by a repetition operator fails to
3920 match anything, then the register for its start will need to be
3921 restored because it will have been set to wherever in the string we
3922 are when we last see its open-group operator. Similarly for a
3924 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3925 const char **old_regstart
, **old_regend
;
3928 /* The is_active field of reg_info helps us keep track of which (possibly
3929 nested) subexpressions we are currently in. The matched_something
3930 field of reg_info[reg_num] helps us tell whether or not we have
3931 matched any of the pattern so far this time through the reg_num-th
3932 subexpression. These two fields get reset each time through any
3933 loop their register is in. */
3934 #ifdef MATCH_MAY_ALLOCATE /* otherwise, this is global. */
3935 register_info_type
*reg_info
;
3938 /* The following record the register info as found in the above
3939 variables when we find a match better than any we've seen before.
3940 This happens as we backtrack through the failure points, which in
3941 turn happens only if we have not yet matched the entire string. */
3942 unsigned best_regs_set
= false;
3943 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3944 const char **best_regstart
, **best_regend
;
3947 /* Logically, this is `best_regend[0]'. But we don't want to have to
3948 allocate space for that if we're not allocating space for anything
3949 else (see below). Also, we never need info about register 0 for
3950 any of the other register vectors, and it seems rather a kludge to
3951 treat `best_regend' differently than the rest. So we keep track of
3952 the end of the best match so far in a separate variable. We
3953 initialize this to NULL so that when we backtrack the first time
3954 and need to test it, it's not garbage. */
3955 const char *match_end
= NULL
;
3957 /* This helps SET_REGS_MATCHED avoid doing redundant work. */
3958 int set_regs_matched_done
= 0;
3960 /* Used when we pop values we don't care about. */
3961 #ifdef MATCH_MAY_ALLOCATE /* otherwise, these are global. */
3962 const char **reg_dummy
;
3963 register_info_type
*reg_info_dummy
;
3967 /* Counts the total number of registers pushed. */
3968 unsigned num_regs_pushed
= 0;
3971 DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
3975 #ifdef MATCH_MAY_ALLOCATE
3976 /* Do not bother to initialize all the register variables if there are
3977 no groups in the pattern, as it takes a fair amount of time. If
3978 there are groups, we include space for register 0 (the whole
3979 pattern), even though we never use it, since it simplifies the
3980 array indexing. We should fix this. */
3983 regstart
= REGEX_TALLOC (num_regs
, const char *);
3984 regend
= REGEX_TALLOC (num_regs
, const char *);
3985 old_regstart
= REGEX_TALLOC (num_regs
, const char *);
3986 old_regend
= REGEX_TALLOC (num_regs
, const char *);
3987 best_regstart
= REGEX_TALLOC (num_regs
, const char *);
3988 best_regend
= REGEX_TALLOC (num_regs
, const char *);
3989 reg_info
= REGEX_TALLOC (num_regs
, register_info_type
);
3990 reg_dummy
= REGEX_TALLOC (num_regs
, const char *);
3991 reg_info_dummy
= REGEX_TALLOC (num_regs
, register_info_type
);
3993 if (!(regstart
&& regend
&& old_regstart
&& old_regend
&& reg_info
3994 && best_regstart
&& best_regend
&& reg_dummy
&& reg_info_dummy
))
4002 /* We must initialize all our variables to NULL, so that
4003 `FREE_VARIABLES' doesn't try to free them. */
4004 regstart
= regend
= old_regstart
= old_regend
= best_regstart
4005 = best_regend
= reg_dummy
= NULL
;
4006 reg_info
= reg_info_dummy
= (register_info_type
*) NULL
;
4008 #endif /* MATCH_MAY_ALLOCATE */
4010 /* The starting position is bogus. */
4011 if (pos
< 0 || pos
> size1
+ size2
)
4017 /* Initialize subexpression text positions to -1 to mark ones that no
4018 start_memory/stop_memory has been seen for. Also initialize the
4019 register information struct. */
4020 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
4022 regstart
[mcnt
] = regend
[mcnt
]
4023 = old_regstart
[mcnt
] = old_regend
[mcnt
] = REG_UNSET_VALUE
;
4025 REG_MATCH_NULL_STRING_P (reg_info
[mcnt
]) = MATCH_NULL_UNSET_VALUE
;
4026 IS_ACTIVE (reg_info
[mcnt
]) = 0;
4027 MATCHED_SOMETHING (reg_info
[mcnt
]) = 0;
4028 EVER_MATCHED_SOMETHING (reg_info
[mcnt
]) = 0;
4031 /* We move `string1' into `string2' if the latter's empty -- but not if
4032 `string1' is null. */
4033 if (size2
== 0 && string1
!= NULL
)
4040 end1
= string1
+ size1
;
4041 end2
= string2
+ size2
;
4043 /* Compute where to stop matching, within the two strings. */
4046 end_match_1
= string1
+ stop
;
4047 end_match_2
= string2
;
4052 end_match_2
= string2
+ stop
- size1
;
4055 /* `p' scans through the pattern as `d' scans through the data.
4056 `dend' is the end of the input string that `d' points within. `d'
4057 is advanced into the following input string whenever necessary, but
4058 this happens before fetching; therefore, at the beginning of the
4059 loop, `d' can be pointing at the end of a string, but it cannot
4061 if (size1
> 0 && pos
<= size1
)
4068 d
= string2
+ pos
- size1
;
4072 DEBUG_PRINT1 ("The compiled pattern is:\n");
4073 DEBUG_PRINT_COMPILED_PATTERN (bufp
, p
, pend
);
4074 DEBUG_PRINT1 ("The string to match is: `");
4075 DEBUG_PRINT_DOUBLE_STRING (d
, string1
, size1
, string2
, size2
);
4076 DEBUG_PRINT1 ("'\n");
4078 /* This loops over pattern commands. It exits by returning from the
4079 function if the match is complete, or it drops through if the match
4080 fails at this starting point in the input data. */
4084 DEBUG_PRINT2 ("\n%p: ", p
);
4086 DEBUG_PRINT2 ("\n0x%x: ", p
);
4090 { /* End of pattern means we might have succeeded. */
4091 DEBUG_PRINT1 ("end of pattern ... ");
4093 /* If we haven't matched the entire string, and we want the
4094 longest match, try backtracking. */
4095 if (d
!= end_match_2
)
4097 /* 1 if this match ends in the same string (string1 or string2)
4098 as the best previous match. */
4099 boolean same_str_p
= (FIRST_STRING_P (match_end
)
4100 == MATCHING_IN_FIRST_STRING
);
4101 /* 1 if this match is the best seen so far. */
4102 boolean best_match_p
;
4104 /* AIX compiler got confused when this was combined
4105 with the previous declaration. */
4107 best_match_p
= d
> match_end
;
4109 best_match_p
= !MATCHING_IN_FIRST_STRING
;
4111 DEBUG_PRINT1 ("backtracking.\n");
4113 if (!FAIL_STACK_EMPTY ())
4114 { /* More failure points to try. */
4116 /* If exceeds best match so far, save it. */
4117 if (!best_regs_set
|| best_match_p
)
4119 best_regs_set
= true;
4122 DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
4124 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
4126 best_regstart
[mcnt
] = regstart
[mcnt
];
4127 best_regend
[mcnt
] = regend
[mcnt
];
4133 /* If no failure points, don't restore garbage. And if
4134 last match is real best match, don't restore second
4136 else if (best_regs_set
&& !best_match_p
)
4139 /* Restore best match. It may happen that `dend ==
4140 end_match_1' while the restored d is in string2.
4141 For example, the pattern `x.*y.*z' against the
4142 strings `x-' and `y-z-', if the two strings are
4143 not consecutive in memory. */
4144 DEBUG_PRINT1 ("Restoring best registers.\n");
4147 dend
= ((d
>= string1
&& d
<= end1
)
4148 ? end_match_1
: end_match_2
);
4150 for (mcnt
= 1; (unsigned) mcnt
< num_regs
; mcnt
++)
4152 regstart
[mcnt
] = best_regstart
[mcnt
];
4153 regend
[mcnt
] = best_regend
[mcnt
];
4156 } /* d != end_match_2 */
4159 DEBUG_PRINT1 ("Accepting match.\n");
4161 /* If caller wants register contents data back, do it. */
4162 if (regs
&& !bufp
->no_sub
)
4164 /* Have the register data arrays been allocated? */
4165 if (bufp
->regs_allocated
== REGS_UNALLOCATED
)
4166 { /* No. So allocate them with malloc. We need one
4167 extra element beyond `num_regs' for the `-1' marker
4169 regs
->num_regs
= MAX (RE_NREGS
, num_regs
+ 1);
4170 regs
->start
= TALLOC (regs
->num_regs
, regoff_t
);
4171 regs
->end
= TALLOC (regs
->num_regs
, regoff_t
);
4172 if (regs
->start
== NULL
|| regs
->end
== NULL
)
4177 bufp
->regs_allocated
= REGS_REALLOCATE
;
4179 else if (bufp
->regs_allocated
== REGS_REALLOCATE
)
4180 { /* Yes. If we need more elements than were already
4181 allocated, reallocate them. If we need fewer, just
4183 if (regs
->num_regs
< num_regs
+ 1)
4185 regs
->num_regs
= num_regs
+ 1;
4186 RETALLOC (regs
->start
, regs
->num_regs
, regoff_t
);
4187 RETALLOC (regs
->end
, regs
->num_regs
, regoff_t
);
4188 if (regs
->start
== NULL
|| regs
->end
== NULL
)
4197 /* These braces fend off a "empty body in an else-statement"
4198 warning under GCC when assert expands to nothing. */
4199 assert (bufp
->regs_allocated
== REGS_FIXED
);
4202 /* Convert the pointer data in `regstart' and `regend' to
4203 indices. Register zero has to be set differently,
4204 since we haven't kept track of any info for it. */
4205 if (regs
->num_regs
> 0)
4207 regs
->start
[0] = pos
;
4208 regs
->end
[0] = (MATCHING_IN_FIRST_STRING
4209 ? ((regoff_t
) (d
- string1
))
4210 : ((regoff_t
) (d
- string2
+ size1
)));
4213 /* Go through the first `min (num_regs, regs->num_regs)'
4214 registers, since that is all we initialized. */
4215 for (mcnt
= 1; (unsigned) mcnt
< MIN (num_regs
, regs
->num_regs
);
4218 if (REG_UNSET (regstart
[mcnt
]) || REG_UNSET (regend
[mcnt
]))
4219 regs
->start
[mcnt
] = regs
->end
[mcnt
] = -1;
4223 = (regoff_t
) POINTER_TO_OFFSET (regstart
[mcnt
]);
4225 = (regoff_t
) POINTER_TO_OFFSET (regend
[mcnt
]);
4229 /* If the regs structure we return has more elements than
4230 were in the pattern, set the extra elements to -1. If
4231 we (re)allocated the registers, this is the case,
4232 because we always allocate enough to have at least one
4234 for (mcnt
= num_regs
; (unsigned) mcnt
< regs
->num_regs
; mcnt
++)
4235 regs
->start
[mcnt
] = regs
->end
[mcnt
] = -1;
4236 } /* regs && !bufp->no_sub */
4238 DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
4239 nfailure_points_pushed
, nfailure_points_popped
,
4240 nfailure_points_pushed
- nfailure_points_popped
);
4241 DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed
);
4243 mcnt
= d
- pos
- (MATCHING_IN_FIRST_STRING
4247 DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt
);
4253 /* Otherwise match next pattern command. */
4254 switch (SWITCH_ENUM_CAST ((re_opcode_t
) *p
++))
4256 /* Ignore these. Used to ignore the n of succeed_n's which
4257 currently have n == 0. */
4259 DEBUG_PRINT1 ("EXECUTING no_op.\n");
4263 DEBUG_PRINT1 ("EXECUTING succeed.\n");
4266 /* Match the next n pattern characters exactly. The following
4267 byte in the pattern defines n, and the n bytes after that
4268 are the characters to match. */
4271 DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt
);
4273 /* This is written out as an if-else so we don't waste time
4274 testing `translate' inside the loop. */
4280 if ((unsigned char) translate
[(unsigned char) *d
++]
4281 != (unsigned char) *p
++)
4291 if (*d
++ != (char) *p
++) goto fail
;
4295 SET_REGS_MATCHED ();
4299 /* Match any character except possibly a newline or a null. */
4301 DEBUG_PRINT1 ("EXECUTING anychar.\n");
4305 if ((!(bufp
->syntax
& RE_DOT_NEWLINE
) && TRANSLATE (*d
) == '\n')
4306 || (bufp
->syntax
& RE_DOT_NOT_NULL
&& TRANSLATE (*d
) == '\000'))
4309 SET_REGS_MATCHED ();
4310 DEBUG_PRINT2 (" Matched `%d'.\n", *d
);
4318 register unsigned char c
;
4319 boolean
not = (re_opcode_t
) *(p
- 1) == charset_not
;
4321 DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : "");
4324 c
= TRANSLATE (*d
); /* The character to match. */
4326 /* Cast to `unsigned' instead of `unsigned char' in case the
4327 bit list is a full 32 bytes long. */
4328 if (c
< (unsigned) (*p
* BYTEWIDTH
)
4329 && p
[1 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
4334 if (!not) goto fail
;
4336 SET_REGS_MATCHED ();
4342 /* The beginning of a group is represented by start_memory.
4343 The arguments are the register number in the next byte, and the
4344 number of groups inner to this one in the next. The text
4345 matched within the group is recorded (in the internal
4346 registers data structure) under the register number. */
4348 DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p
, p
[1]);
4350 /* Find out if this group can match the empty string. */
4351 p1
= p
; /* To send to group_match_null_string_p. */
4353 if (REG_MATCH_NULL_STRING_P (reg_info
[*p
]) == MATCH_NULL_UNSET_VALUE
)
4354 REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4355 = group_match_null_string_p (&p1
, pend
, reg_info
);
4357 /* Save the position in the string where we were the last time
4358 we were at this open-group operator in case the group is
4359 operated upon by a repetition operator, e.g., with `(a*)*b'
4360 against `ab'; then we want to ignore where we are now in
4361 the string in case this attempt to match fails. */
4362 old_regstart
[*p
] = REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4363 ? REG_UNSET (regstart
[*p
]) ? d
: regstart
[*p
]
4365 DEBUG_PRINT2 (" old_regstart: %d\n",
4366 POINTER_TO_OFFSET (old_regstart
[*p
]));
4369 DEBUG_PRINT2 (" regstart: %d\n", POINTER_TO_OFFSET (regstart
[*p
]));
4371 IS_ACTIVE (reg_info
[*p
]) = 1;
4372 MATCHED_SOMETHING (reg_info
[*p
]) = 0;
4374 /* Clear this whenever we change the register activity status. */
4375 set_regs_matched_done
= 0;
4377 /* This is the new highest active register. */
4378 highest_active_reg
= *p
;
4380 /* If nothing was active before, this is the new lowest active
4382 if (lowest_active_reg
== NO_LOWEST_ACTIVE_REG
)
4383 lowest_active_reg
= *p
;
4385 /* Move past the register number and inner group count. */
4387 just_past_start_mem
= p
;
4392 /* The stop_memory opcode represents the end of a group. Its
4393 arguments are the same as start_memory's: the register
4394 number, and the number of inner groups. */
4396 DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p
, p
[1]);
4398 /* We need to save the string position the last time we were at
4399 this close-group operator in case the group is operated
4400 upon by a repetition operator, e.g., with `((a*)*(b*)*)*'
4401 against `aba'; then we want to ignore where we are now in
4402 the string in case this attempt to match fails. */
4403 old_regend
[*p
] = REG_MATCH_NULL_STRING_P (reg_info
[*p
])
4404 ? REG_UNSET (regend
[*p
]) ? d
: regend
[*p
]
4406 DEBUG_PRINT2 (" old_regend: %d\n",
4407 POINTER_TO_OFFSET (old_regend
[*p
]));
4410 DEBUG_PRINT2 (" regend: %d\n", POINTER_TO_OFFSET (regend
[*p
]));
4412 /* This register isn't active anymore. */
4413 IS_ACTIVE (reg_info
[*p
]) = 0;
4415 /* Clear this whenever we change the register activity status. */
4416 set_regs_matched_done
= 0;
4418 /* If this was the only register active, nothing is active
4420 if (lowest_active_reg
== highest_active_reg
)
4422 lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
4423 highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
4426 { /* We must scan for the new highest active register, since
4427 it isn't necessarily one less than now: consider
4428 (a(b)c(d(e)f)g). When group 3 ends, after the f), the
4429 new highest active register is 1. */
4430 unsigned char r
= *p
- 1;
4431 while (r
> 0 && !IS_ACTIVE (reg_info
[r
]))
4434 /* If we end up at register zero, that means that we saved
4435 the registers as the result of an `on_failure_jump', not
4436 a `start_memory', and we jumped to past the innermost
4437 `stop_memory'. For example, in ((.)*) we save
4438 registers 1 and 2 as a result of the *, but when we pop
4439 back to the second ), we are at the stop_memory 1.
4440 Thus, nothing is active. */
4443 lowest_active_reg
= NO_LOWEST_ACTIVE_REG
;
4444 highest_active_reg
= NO_HIGHEST_ACTIVE_REG
;
4447 highest_active_reg
= r
;
4450 /* If just failed to match something this time around with a
4451 group that's operated on by a repetition operator, try to
4452 force exit from the ``loop'', and restore the register
4453 information for this group that we had before trying this
4455 if ((!MATCHED_SOMETHING (reg_info
[*p
])
4456 || just_past_start_mem
== p
- 1)
4459 boolean is_a_jump_n
= false;
4463 switch ((re_opcode_t
) *p1
++)
4467 case pop_failure_jump
:
4468 case maybe_pop_jump
:
4470 case dummy_failure_jump
:
4471 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
4481 /* If the next operation is a jump backwards in the pattern
4482 to an on_failure_jump right before the start_memory
4483 corresponding to this stop_memory, exit from the loop
4484 by forcing a failure after pushing on the stack the
4485 on_failure_jump's jump in the pattern, and d. */
4486 if (mcnt
< 0 && (re_opcode_t
) *p1
== on_failure_jump
4487 && (re_opcode_t
) p1
[3] == start_memory
&& p1
[4] == *p
)
4489 /* If this group ever matched anything, then restore
4490 what its registers were before trying this last
4491 failed match, e.g., with `(a*)*b' against `ab' for
4492 regstart[1], and, e.g., with `((a*)*(b*)*)*'
4493 against `aba' for regend[3].
4495 Also restore the registers for inner groups for,
4496 e.g., `((a*)(b*))*' against `aba' (register 3 would
4497 otherwise get trashed). */
4499 if (EVER_MATCHED_SOMETHING (reg_info
[*p
]))
4503 EVER_MATCHED_SOMETHING (reg_info
[*p
]) = 0;
4505 /* Restore this and inner groups' (if any) registers. */
4506 for (r
= *p
; r
< (unsigned) *p
+ (unsigned) *(p
+ 1);
4509 regstart
[r
] = old_regstart
[r
];
4511 /* xx why this test? */
4512 if (old_regend
[r
] >= regstart
[r
])
4513 regend
[r
] = old_regend
[r
];
4517 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
4518 PUSH_FAILURE_POINT (p1
+ mcnt
, d
, -2);
4524 /* Move past the register number and the inner group count. */
4529 /* \<digit> has been turned into a `duplicate' command which is
4530 followed by the numeric value of <digit> as the register number. */
4533 register const char *d2
, *dend2
;
4534 int regno
= *p
++; /* Get which register to match against. */
4535 DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno
);
4537 /* Can't back reference a group which we've never matched. */
4538 if (REG_UNSET (regstart
[regno
]) || REG_UNSET (regend
[regno
]))
4541 /* Where in input to try to start matching. */
4542 d2
= regstart
[regno
];
4544 /* Where to stop matching; if both the place to start and
4545 the place to stop matching are in the same string, then
4546 set to the place to stop, otherwise, for now have to use
4547 the end of the first string. */
4549 dend2
= ((FIRST_STRING_P (regstart
[regno
])
4550 == FIRST_STRING_P (regend
[regno
]))
4551 ? regend
[regno
] : end_match_1
);
4554 /* If necessary, advance to next segment in register
4558 if (dend2
== end_match_2
) break;
4559 if (dend2
== regend
[regno
]) break;
4561 /* End of string1 => advance to string2. */
4563 dend2
= regend
[regno
];
4565 /* At end of register contents => success */
4566 if (d2
== dend2
) break;
4568 /* If necessary, advance to next segment in data. */
4571 /* How many characters left in this segment to match. */
4574 /* Want how many consecutive characters we can match in
4575 one shot, so, if necessary, adjust the count. */
4576 if (mcnt
> dend2
- d2
)
4579 /* Compare that many; failure if mismatch, else move
4582 ? bcmp_translate (d
, d2
, mcnt
, translate
)
4583 : memcmp (d
, d2
, mcnt
))
4585 d
+= mcnt
, d2
+= mcnt
;
4587 /* Do this because we've match some characters. */
4588 SET_REGS_MATCHED ();
4594 /* begline matches the empty string at the beginning of the string
4595 (unless `not_bol' is set in `bufp'), and, if
4596 `newline_anchor' is set, after newlines. */
4598 DEBUG_PRINT1 ("EXECUTING begline.\n");
4600 if (AT_STRINGS_BEG (d
))
4602 if (!bufp
->not_bol
) break;
4604 else if (d
[-1] == '\n' && bufp
->newline_anchor
)
4608 /* In all other cases, we fail. */
4612 /* endline is the dual of begline. */
4614 DEBUG_PRINT1 ("EXECUTING endline.\n");
4616 if (AT_STRINGS_END (d
))
4618 if (!bufp
->not_eol
) break;
4621 /* We have to ``prefetch'' the next character. */
4622 else if ((d
== end1
? *string2
: *d
) == '\n'
4623 && bufp
->newline_anchor
)
4630 /* Match at the very beginning of the data. */
4632 DEBUG_PRINT1 ("EXECUTING begbuf.\n");
4633 if (AT_STRINGS_BEG (d
))
4638 /* Match at the very end of the data. */
4640 DEBUG_PRINT1 ("EXECUTING endbuf.\n");
4641 if (AT_STRINGS_END (d
))
4646 /* on_failure_keep_string_jump is used to optimize `.*\n'. It
4647 pushes NULL as the value for the string on the stack. Then
4648 `pop_failure_point' will keep the current value for the
4649 string, instead of restoring it. To see why, consider
4650 matching `foo\nbar' against `.*\n'. The .* matches the foo;
4651 then the . fails against the \n. But the next thing we want
4652 to do is match the \n against the \n; if we restored the
4653 string value, we would be back at the foo.
4655 Because this is used only in specific cases, we don't need to
4656 check all the things that `on_failure_jump' does, to make
4657 sure the right things get saved on the stack. Hence we don't
4658 share its code. The only reason to push anything on the
4659 stack at all is that otherwise we would have to change
4660 `anychar's code to do something besides goto fail in this
4661 case; that seems worse than this. */
4662 case on_failure_keep_string_jump
:
4663 DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump");
4665 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4667 DEBUG_PRINT3 (" %d (to %p):\n", mcnt
, p
+ mcnt
);
4669 DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt
, p
+ mcnt
);
4672 PUSH_FAILURE_POINT (p
+ mcnt
, NULL
, -2);
4676 /* Uses of on_failure_jump:
4678 Each alternative starts with an on_failure_jump that points
4679 to the beginning of the next alternative. Each alternative
4680 except the last ends with a jump that in effect jumps past
4681 the rest of the alternatives. (They really jump to the
4682 ending jump of the following alternative, because tensioning
4683 these jumps is a hassle.)
4685 Repeats start with an on_failure_jump that points past both
4686 the repetition text and either the following jump or
4687 pop_failure_jump back to this on_failure_jump. */
4688 case on_failure_jump
:
4690 DEBUG_PRINT1 ("EXECUTING on_failure_jump");
4692 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4694 DEBUG_PRINT3 (" %d (to %p)", mcnt
, p
+ mcnt
);
4696 DEBUG_PRINT3 (" %d (to 0x%x)", mcnt
, p
+ mcnt
);
4699 /* If this on_failure_jump comes right before a group (i.e.,
4700 the original * applied to a group), save the information
4701 for that group and all inner ones, so that if we fail back
4702 to this point, the group's information will be correct.
4703 For example, in \(a*\)*\1, we need the preceding group,
4704 and in \(zz\(a*\)b*\)\2, we need the inner group. */
4706 /* We can't use `p' to check ahead because we push
4707 a failure point to `p + mcnt' after we do this. */
4710 /* We need to skip no_op's before we look for the
4711 start_memory in case this on_failure_jump is happening as
4712 the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
4714 while (p1
< pend
&& (re_opcode_t
) *p1
== no_op
)
4717 if (p1
< pend
&& (re_opcode_t
) *p1
== start_memory
)
4719 /* We have a new highest active register now. This will
4720 get reset at the start_memory we are about to get to,
4721 but we will have saved all the registers relevant to
4722 this repetition op, as described above. */
4723 highest_active_reg
= *(p1
+ 1) + *(p1
+ 2);
4724 if (lowest_active_reg
== NO_LOWEST_ACTIVE_REG
)
4725 lowest_active_reg
= *(p1
+ 1);
4728 DEBUG_PRINT1 (":\n");
4729 PUSH_FAILURE_POINT (p
+ mcnt
, d
, -2);
4733 /* A smart repeat ends with `maybe_pop_jump'.
4734 We change it to either `pop_failure_jump' or `jump'. */
4735 case maybe_pop_jump
:
4736 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
4737 DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt
);
4739 register unsigned char *p2
= p
;
4741 /* Compare the beginning of the repeat with what in the
4742 pattern follows its end. If we can establish that there
4743 is nothing that they would both match, i.e., that we
4744 would have to backtrack because of (as in, e.g., `a*a')
4745 then we can change to pop_failure_jump, because we'll
4746 never have to backtrack.
4748 This is not true in the case of alternatives: in
4749 `(a|ab)*' we do need to backtrack to the `ab' alternative
4750 (e.g., if the string was `ab'). But instead of trying to
4751 detect that here, the alternative has put on a dummy
4752 failure point which is what we will end up popping. */
4754 /* Skip over open/close-group commands.
4755 If what follows this loop is a ...+ construct,
4756 look at what begins its body, since we will have to
4757 match at least one of that. */
4761 && ((re_opcode_t
) *p2
== stop_memory
4762 || (re_opcode_t
) *p2
== start_memory
))
4764 else if (p2
+ 6 < pend
4765 && (re_opcode_t
) *p2
== dummy_failure_jump
)
4772 /* p1[0] ... p1[2] are the `on_failure_jump' corresponding
4773 to the `maybe_finalize_jump' of this case. Examine what
4776 /* If we're at the end of the pattern, we can change. */
4779 /* Consider what happens when matching ":\(.*\)"
4780 against ":/". I don't really understand this code
4782 p
[-3] = (unsigned char) pop_failure_jump
;
4784 (" End of pattern: change to `pop_failure_jump'.\n");
4787 else if ((re_opcode_t
) *p2
== exactn
4788 || (bufp
->newline_anchor
&& (re_opcode_t
) *p2
== endline
))
4790 register unsigned char c
4791 = *p2
== (unsigned char) endline
? '\n' : p2
[2];
4793 if ((re_opcode_t
) p1
[3] == exactn
&& p1
[5] != c
)
4795 p
[-3] = (unsigned char) pop_failure_jump
;
4796 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
4800 else if ((re_opcode_t
) p1
[3] == charset
4801 || (re_opcode_t
) p1
[3] == charset_not
)
4803 int not = (re_opcode_t
) p1
[3] == charset_not
;
4805 if (c
< (unsigned char) (p1
[4] * BYTEWIDTH
)
4806 && p1
[5 + c
/ BYTEWIDTH
] & (1 << (c
% BYTEWIDTH
)))
4809 /* `not' is equal to 1 if c would match, which means
4810 that we can't change to pop_failure_jump. */
4813 p
[-3] = (unsigned char) pop_failure_jump
;
4814 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4818 else if ((re_opcode_t
) *p2
== charset
)
4821 register unsigned char c
4822 = *p2
== (unsigned char) endline
? '\n' : p2
[2];
4826 if ((re_opcode_t
) p1
[3] == exactn
4827 && ! ((int) p2
[1] * BYTEWIDTH
> (int) p1
[5]
4828 && (p2
[2 + p1
[5] / BYTEWIDTH
]
4829 & (1 << (p1
[5] % BYTEWIDTH
)))))
4831 if ((re_opcode_t
) p1
[3] == exactn
4832 && ! ((int) p2
[1] * BYTEWIDTH
> (int) p1
[4]
4833 && (p2
[2 + p1
[4] / BYTEWIDTH
]
4834 & (1 << (p1
[4] % BYTEWIDTH
)))))
4837 p
[-3] = (unsigned char) pop_failure_jump
;
4838 DEBUG_PRINT3 (" %c != %c => pop_failure_jump.\n",
4842 else if ((re_opcode_t
) p1
[3] == charset_not
)
4845 /* We win if the charset_not inside the loop
4846 lists every character listed in the charset after. */
4847 for (idx
= 0; idx
< (int) p2
[1]; idx
++)
4848 if (! (p2
[2 + idx
] == 0
4849 || (idx
< (int) p1
[4]
4850 && ((p2
[2 + idx
] & ~ p1
[5 + idx
]) == 0))))
4855 p
[-3] = (unsigned char) pop_failure_jump
;
4856 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4859 else if ((re_opcode_t
) p1
[3] == charset
)
4862 /* We win if the charset inside the loop
4863 has no overlap with the one after the loop. */
4865 idx
< (int) p2
[1] && idx
< (int) p1
[4];
4867 if ((p2
[2 + idx
] & p1
[5 + idx
]) != 0)
4870 if (idx
== p2
[1] || idx
== p1
[4])
4872 p
[-3] = (unsigned char) pop_failure_jump
;
4873 DEBUG_PRINT1 (" No match => pop_failure_jump.\n");
4878 p
-= 2; /* Point at relative address again. */
4879 if ((re_opcode_t
) p
[-1] != pop_failure_jump
)
4881 p
[-1] = (unsigned char) jump
;
4882 DEBUG_PRINT1 (" Match => jump.\n");
4883 goto unconditional_jump
;
4885 /* Note fall through. */
4888 /* The end of a simple repeat has a pop_failure_jump back to
4889 its matching on_failure_jump, where the latter will push a
4890 failure point. The pop_failure_jump takes off failure
4891 points put on by this pop_failure_jump's matching
4892 on_failure_jump; we got through the pattern to here from the
4893 matching on_failure_jump, so didn't fail. */
4894 case pop_failure_jump
:
4896 /* We need to pass separate storage for the lowest and
4897 highest registers, even though we don't care about the
4898 actual values. Otherwise, we will restore only one
4899 register from the stack, since lowest will == highest in
4900 `pop_failure_point'. */
4901 active_reg_t dummy_low_reg
, dummy_high_reg
;
4902 unsigned char *pdummy
;
4905 DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n");
4906 POP_FAILURE_POINT (sdummy
, pdummy
,
4907 dummy_low_reg
, dummy_high_reg
,
4908 reg_dummy
, reg_dummy
, reg_info_dummy
);
4910 /* Note fall through. */
4914 DEBUG_PRINT2 ("\n%p: ", p
);
4916 DEBUG_PRINT2 ("\n0x%x: ", p
);
4918 /* Note fall through. */
4920 /* Unconditionally jump (without popping any failure points). */
4922 EXTRACT_NUMBER_AND_INCR (mcnt
, p
); /* Get the amount to jump. */
4923 DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt
);
4924 p
+= mcnt
; /* Do the jump. */
4926 DEBUG_PRINT2 ("(to %p).\n", p
);
4928 DEBUG_PRINT2 ("(to 0x%x).\n", p
);
4933 /* We need this opcode so we can detect where alternatives end
4934 in `group_match_null_string_p' et al. */
4936 DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n");
4937 goto unconditional_jump
;
4940 /* Normally, the on_failure_jump pushes a failure point, which
4941 then gets popped at pop_failure_jump. We will end up at
4942 pop_failure_jump, also, and with a pattern of, say, `a+', we
4943 are skipping over the on_failure_jump, so we have to push
4944 something meaningless for pop_failure_jump to pop. */
4945 case dummy_failure_jump
:
4946 DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n");
4947 /* It doesn't matter what we push for the string here. What
4948 the code at `fail' tests is the value for the pattern. */
4949 PUSH_FAILURE_POINT (NULL
, NULL
, -2);
4950 goto unconditional_jump
;
4953 /* At the end of an alternative, we need to push a dummy failure
4954 point in case we are followed by a `pop_failure_jump', because
4955 we don't want the failure point for the alternative to be
4956 popped. For example, matching `(a|ab)*' against `aab'
4957 requires that we match the `ab' alternative. */
4958 case push_dummy_failure
:
4959 DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n");
4960 /* See comments just above at `dummy_failure_jump' about the
4962 PUSH_FAILURE_POINT (NULL
, NULL
, -2);
4965 /* Have to succeed matching what follows at least n times.
4966 After that, handle like `on_failure_jump'. */
4968 EXTRACT_NUMBER (mcnt
, p
+ 2);
4969 DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt
);
4972 /* Originally, this is how many times we HAVE to succeed. */
4977 STORE_NUMBER_AND_INCR (p
, mcnt
);
4979 DEBUG_PRINT3 (" Setting %p to %d.\n", p
- 2, mcnt
);
4981 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p
- 2, mcnt
);
4987 DEBUG_PRINT2 (" Setting two bytes from %p to no_op.\n", p
+2);
4989 DEBUG_PRINT2 (" Setting two bytes from 0x%x to no_op.\n", p
+2);
4991 p
[2] = (unsigned char) no_op
;
4992 p
[3] = (unsigned char) no_op
;
4998 EXTRACT_NUMBER (mcnt
, p
+ 2);
4999 DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt
);
5001 /* Originally, this is how many times we CAN jump. */
5005 STORE_NUMBER (p
+ 2, mcnt
);
5007 DEBUG_PRINT3 (" Setting %p to %d.\n", p
+ 2, mcnt
);
5009 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p
+ 2, mcnt
);
5011 goto unconditional_jump
;
5013 /* If don't have to jump any more, skip over the rest of command. */
5020 DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
5022 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5024 EXTRACT_NUMBER_AND_INCR (mcnt
, p
);
5026 DEBUG_PRINT3 (" Setting %p to %d.\n", p1
, mcnt
);
5028 DEBUG_PRINT3 (" Setting 0x%x to %d.\n", p1
, mcnt
);
5030 STORE_NUMBER (p1
, mcnt
);
5035 /* The DEC Alpha C compiler 3.x generates incorrect code for the
5036 test WORDCHAR_P (d - 1) != WORDCHAR_P (d) in the expansion of
5037 AT_WORD_BOUNDARY, so this code is disabled. Expanding the
5038 macro and introducing temporary variables works around the bug. */
5041 DEBUG_PRINT1 ("EXECUTING wordbound.\n");
5042 if (AT_WORD_BOUNDARY (d
))
5047 DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
5048 if (AT_WORD_BOUNDARY (d
))
5054 boolean prevchar
, thischar
;
5056 DEBUG_PRINT1 ("EXECUTING wordbound.\n");
5057 if (AT_STRINGS_BEG (d
) || AT_STRINGS_END (d
))
5060 prevchar
= WORDCHAR_P (d
- 1);
5061 thischar
= WORDCHAR_P (d
);
5062 if (prevchar
!= thischar
)
5069 boolean prevchar
, thischar
;
5071 DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
5072 if (AT_STRINGS_BEG (d
) || AT_STRINGS_END (d
))
5075 prevchar
= WORDCHAR_P (d
- 1);
5076 thischar
= WORDCHAR_P (d
);
5077 if (prevchar
!= thischar
)
5084 DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
5085 if (WORDCHAR_P (d
) && (AT_STRINGS_BEG (d
) || !WORDCHAR_P (d
- 1)))
5090 DEBUG_PRINT1 ("EXECUTING wordend.\n");
5091 if (!AT_STRINGS_BEG (d
) && WORDCHAR_P (d
- 1)
5092 && (!WORDCHAR_P (d
) || AT_STRINGS_END (d
)))
5098 DEBUG_PRINT1 ("EXECUTING before_dot.\n");
5099 if (PTR_CHAR_POS ((unsigned char *) d
) >= point
)
5104 DEBUG_PRINT1 ("EXECUTING at_dot.\n");
5105 if (PTR_CHAR_POS ((unsigned char *) d
) != point
)
5110 DEBUG_PRINT1 ("EXECUTING after_dot.\n");
5111 if (PTR_CHAR_POS ((unsigned char *) d
) <= point
)
5116 DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt
);
5121 DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n");
5125 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */
5127 if (SYNTAX (d
[-1]) != (enum syntaxcode
) mcnt
)
5129 SET_REGS_MATCHED ();
5133 DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt
);
5135 goto matchnotsyntax
;
5138 DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n");
5142 /* Can't use *d++ here; SYNTAX may be an unsafe macro. */
5144 if (SYNTAX (d
[-1]) == (enum syntaxcode
) mcnt
)
5146 SET_REGS_MATCHED ();
5149 #else /* not emacs */
5151 DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n");
5153 if (!WORDCHAR_P (d
))
5155 SET_REGS_MATCHED ();
5160 DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n");
5164 SET_REGS_MATCHED ();
5167 #endif /* not emacs */
5172 continue; /* Successfully executed one pattern command; keep going. */
5175 /* We goto here if a matching operation fails. */
5177 if (!FAIL_STACK_EMPTY ())
5178 { /* A restart point is known. Restore to that state. */
5179 DEBUG_PRINT1 ("\nFAIL:\n");
5180 POP_FAILURE_POINT (d
, p
,
5181 lowest_active_reg
, highest_active_reg
,
5182 regstart
, regend
, reg_info
);
5184 /* If this failure point is a dummy, try the next one. */
5188 /* If we failed to the end of the pattern, don't examine *p. */
5192 boolean is_a_jump_n
= false;
5194 /* If failed to a backwards jump that's part of a repetition
5195 loop, need to pop this failure point and use the next one. */
5196 switch ((re_opcode_t
) *p
)
5200 case maybe_pop_jump
:
5201 case pop_failure_jump
:
5204 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5207 if ((is_a_jump_n
&& (re_opcode_t
) *p1
== succeed_n
)
5209 && (re_opcode_t
) *p1
== on_failure_jump
))
5217 if (d
>= string1
&& d
<= end1
)
5221 break; /* Matching at this starting point really fails. */
5225 goto restore_best_regs
;
5229 return -1; /* Failure to match. */
5232 /* Subroutine definitions for re_match_2. */
5235 /* We are passed P pointing to a register number after a start_memory.
5237 Return true if the pattern up to the corresponding stop_memory can
5238 match the empty string, and false otherwise.
5240 If we find the matching stop_memory, sets P to point to one past its number.
5241 Otherwise, sets P to an undefined byte less than or equal to END.
5243 We don't handle duplicates properly (yet). */
5246 group_match_null_string_p (p
, end
, reg_info
)
5247 unsigned char **p
, *end
;
5248 register_info_type
*reg_info
;
5251 /* Point to after the args to the start_memory. */
5252 unsigned char *p1
= *p
+ 2;
5256 /* Skip over opcodes that can match nothing, and return true or
5257 false, as appropriate, when we get to one that can't, or to the
5258 matching stop_memory. */
5260 switch ((re_opcode_t
) *p1
)
5262 /* Could be either a loop or a series of alternatives. */
5263 case on_failure_jump
:
5265 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5267 /* If the next operation is not a jump backwards in the
5272 /* Go through the on_failure_jumps of the alternatives,
5273 seeing if any of the alternatives cannot match nothing.
5274 The last alternative starts with only a jump,
5275 whereas the rest start with on_failure_jump and end
5276 with a jump, e.g., here is the pattern for `a|b|c':
5278 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6
5279 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3
5282 So, we have to first go through the first (n-1)
5283 alternatives and then deal with the last one separately. */
5286 /* Deal with the first (n-1) alternatives, which start
5287 with an on_failure_jump (see above) that jumps to right
5288 past a jump_past_alt. */
5290 while ((re_opcode_t
) p1
[mcnt
-3] == jump_past_alt
)
5292 /* `mcnt' holds how many bytes long the alternative
5293 is, including the ending `jump_past_alt' and
5296 if (!alt_match_null_string_p (p1
, p1
+ mcnt
- 3,
5300 /* Move to right after this alternative, including the
5304 /* Break if it's the beginning of an n-th alternative
5305 that doesn't begin with an on_failure_jump. */
5306 if ((re_opcode_t
) *p1
!= on_failure_jump
)
5309 /* Still have to check that it's not an n-th
5310 alternative that starts with an on_failure_jump. */
5312 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5313 if ((re_opcode_t
) p1
[mcnt
-3] != jump_past_alt
)
5315 /* Get to the beginning of the n-th alternative. */
5321 /* Deal with the last alternative: go back and get number
5322 of the `jump_past_alt' just before it. `mcnt' contains
5323 the length of the alternative. */
5324 EXTRACT_NUMBER (mcnt
, p1
- 2);
5326 if (!alt_match_null_string_p (p1
, p1
+ mcnt
, reg_info
))
5329 p1
+= mcnt
; /* Get past the n-th alternative. */
5335 assert (p1
[1] == **p
);
5341 if (!common_op_match_null_string_p (&p1
, end
, reg_info
))
5344 } /* while p1 < end */
5347 } /* group_match_null_string_p */
5350 /* Similar to group_match_null_string_p, but doesn't deal with alternatives:
5351 It expects P to be the first byte of a single alternative and END one
5352 byte past the last. The alternative can contain groups. */
5355 alt_match_null_string_p (p
, end
, reg_info
)
5356 unsigned char *p
, *end
;
5357 register_info_type
*reg_info
;
5360 unsigned char *p1
= p
;
5364 /* Skip over opcodes that can match nothing, and break when we get
5365 to one that can't. */
5367 switch ((re_opcode_t
) *p1
)
5370 case on_failure_jump
:
5372 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5377 if (!common_op_match_null_string_p (&p1
, end
, reg_info
))
5380 } /* while p1 < end */
5383 } /* alt_match_null_string_p */
5386 /* Deals with the ops common to group_match_null_string_p and
5387 alt_match_null_string_p.
5389 Sets P to one after the op and its arguments, if any. */
5392 common_op_match_null_string_p (p
, end
, reg_info
)
5393 unsigned char **p
, *end
;
5394 register_info_type
*reg_info
;
5399 unsigned char *p1
= *p
;
5401 switch ((re_opcode_t
) *p1
++)
5421 assert (reg_no
> 0 && reg_no
<= MAX_REGNUM
);
5422 ret
= group_match_null_string_p (&p1
, end
, reg_info
);
5424 /* Have to set this here in case we're checking a group which
5425 contains a group and a back reference to it. */
5427 if (REG_MATCH_NULL_STRING_P (reg_info
[reg_no
]) == MATCH_NULL_UNSET_VALUE
)
5428 REG_MATCH_NULL_STRING_P (reg_info
[reg_no
]) = ret
;
5434 /* If this is an optimized succeed_n for zero times, make the jump. */
5436 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5444 /* Get to the number of times to succeed. */
5446 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5451 EXTRACT_NUMBER_AND_INCR (mcnt
, p1
);
5459 if (!REG_MATCH_NULL_STRING_P (reg_info
[*p1
]))
5467 /* All other opcodes mean we cannot match the empty string. */
5473 } /* common_op_match_null_string_p */
5476 /* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
5477 bytes; nonzero otherwise. */
5480 bcmp_translate (s1
, s2
, len
, translate
)
5481 const char *s1
, *s2
;
5483 RE_TRANSLATE_TYPE translate
;
5485 register const unsigned char *p1
= (const unsigned char *) s1
;
5486 register const unsigned char *p2
= (const unsigned char *) s2
;
5489 if (translate
[*p1
++] != translate
[*p2
++]) return 1;
5495 /* Entry points for GNU code. */
5497 /* re_compile_pattern is the GNU regular expression compiler: it
5498 compiles PATTERN (of length SIZE) and puts the result in BUFP.
5499 Returns 0 if the pattern was valid, otherwise an error string.
5501 Assumes the `allocated' (and perhaps `buffer') and `translate' fields
5502 are set in BUFP on entry.
5504 We call regex_compile to do the actual compilation. */
5507 re_compile_pattern (pattern
, length
, bufp
)
5508 const char *pattern
;
5510 struct re_pattern_buffer
*bufp
;
5514 /* GNU code is written to assume at least RE_NREGS registers will be set
5515 (and at least one extra will be -1). */
5516 bufp
->regs_allocated
= REGS_UNALLOCATED
;
5518 /* And GNU code determines whether or not to get register information
5519 by passing null for the REGS argument to re_match, etc., not by
5523 /* Match anchors at newline. */
5524 bufp
->newline_anchor
= 1;
5526 ret
= regex_compile (pattern
, length
, re_syntax_options
, bufp
);
5530 return gettext (re_error_msgid
[(int) ret
]);
5533 weak_alias (__re_compile_pattern
, re_compile_pattern
)
5536 /* Entry points compatible with 4.2 BSD regex library. We don't define
5537 them unless specifically requested. */
5539 #if defined _REGEX_RE_COMP || defined _LIBC
5541 /* BSD has one and only one pattern buffer. */
5542 static struct re_pattern_buffer re_comp_buf
;
5546 /* Make these definitions weak in libc, so POSIX programs can redefine
5547 these names if they don't use our functions, and still use
5548 regcomp/regexec below without link errors. */
5558 if (!re_comp_buf
.buffer
)
5559 return gettext ("No previous regular expression");
5563 if (!re_comp_buf
.buffer
)
5565 re_comp_buf
.buffer
= (unsigned char *) malloc (200);
5566 if (re_comp_buf
.buffer
== NULL
)
5567 return (char *) gettext (re_error_msgid
[(int) REG_ESPACE
]);
5568 re_comp_buf
.allocated
= 200;
5570 re_comp_buf
.fastmap
= (char *) malloc (1 << BYTEWIDTH
);
5571 if (re_comp_buf
.fastmap
== NULL
)
5572 return (char *) gettext (re_error_msgid
[(int) REG_ESPACE
]);
5575 /* Since `re_exec' always passes NULL for the `regs' argument, we
5576 don't need to initialize the pattern buffer fields which affect it. */
5578 /* Match anchors at newlines. */
5579 re_comp_buf
.newline_anchor
= 1;
5581 ret
= regex_compile (s
, strlen (s
), re_syntax_options
, &re_comp_buf
);
5586 /* Yes, we're discarding `const' here if !HAVE_LIBINTL. */
5587 return (char *) gettext (re_error_msgid
[(int) ret
]);
5598 const int len
= strlen (s
);
5600 0 <= re_search (&re_comp_buf
, s
, len
, 0, len
, (struct re_registers
*) 0);
5603 #endif /* _REGEX_RE_COMP */
5605 /* POSIX.2 functions. Don't define these for Emacs. */
5609 /* regcomp takes a regular expression as a string and compiles it.
5611 PREG is a regex_t *. We do not expect any fields to be initialized,
5612 since POSIX says we shouldn't. Thus, we set
5614 `buffer' to the compiled pattern;
5615 `used' to the length of the compiled pattern;
5616 `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
5617 REG_EXTENDED bit in CFLAGS is set; otherwise, to
5618 RE_SYNTAX_POSIX_BASIC;
5619 `newline_anchor' to REG_NEWLINE being set in CFLAGS;
5620 `fastmap' and `fastmap_accurate' to zero;
5621 `re_nsub' to the number of subexpressions in PATTERN.
5623 PATTERN is the address of the pattern string.
5625 CFLAGS is a series of bits which affect compilation.
5627 If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
5628 use POSIX basic syntax.
5630 If REG_NEWLINE is set, then . and [^...] don't match newline.
5631 Also, regexec will try a match beginning after every newline.
5633 If REG_ICASE is set, then we considers upper- and lowercase
5634 versions of letters to be equivalent when matching.
5636 If REG_NOSUB is set, then when PREG is passed to regexec, that
5637 routine will report only success or failure, and nothing about the
5640 It returns 0 if it succeeds, nonzero if it doesn't. (See regex.h for
5641 the return codes and their meanings.) */
5644 regcomp (preg
, pattern
, cflags
)
5646 const char *pattern
;
5651 = (cflags
& REG_EXTENDED
) ?
5652 RE_SYNTAX_POSIX_EXTENDED
: RE_SYNTAX_POSIX_BASIC
;
5654 /* regex_compile will allocate the space for the compiled pattern. */
5656 preg
->allocated
= 0;
5659 /* Don't bother to use a fastmap when searching. This simplifies the
5660 REG_NEWLINE case: if we used a fastmap, we'd have to put all the
5661 characters after newlines into the fastmap. This way, we just try
5665 if (cflags
& REG_ICASE
)
5670 = (RE_TRANSLATE_TYPE
) malloc (CHAR_SET_SIZE
5671 * sizeof (*(RE_TRANSLATE_TYPE
)0));
5672 if (preg
->translate
== NULL
)
5673 return (int) REG_ESPACE
;
5675 /* Map uppercase characters to corresponding lowercase ones. */
5676 for (i
= 0; i
< CHAR_SET_SIZE
; i
++)
5677 preg
->translate
[i
] = ISUPPER (i
) ? tolower (i
) : i
;
5680 preg
->translate
= NULL
;
5682 /* If REG_NEWLINE is set, newlines are treated differently. */
5683 if (cflags
& REG_NEWLINE
)
5684 { /* REG_NEWLINE implies neither . nor [^...] match newline. */
5685 syntax
&= ~RE_DOT_NEWLINE
;
5686 syntax
|= RE_HAT_LISTS_NOT_NEWLINE
;
5687 /* It also changes the matching behavior. */
5688 preg
->newline_anchor
= 1;
5691 preg
->newline_anchor
= 0;
5693 preg
->no_sub
= !!(cflags
& REG_NOSUB
);
5695 /* POSIX says a null character in the pattern terminates it, so we
5696 can use strlen here in compiling the pattern. */
5697 ret
= regex_compile (pattern
, strlen (pattern
), syntax
, preg
);
5699 /* POSIX doesn't distinguish between an unmatched open-group and an
5700 unmatched close-group: both are REG_EPAREN. */
5701 if (ret
== REG_ERPAREN
) ret
= REG_EPAREN
;
5706 weak_alias (__regcomp
, regcomp
)
5710 /* regexec searches for a given pattern, specified by PREG, in the
5713 If NMATCH is zero or REG_NOSUB was set in the cflags argument to
5714 `regcomp', we ignore PMATCH. Otherwise, we assume PMATCH has at
5715 least NMATCH elements, and we set them to the offsets of the
5716 corresponding matched substrings.
5718 EFLAGS specifies `execution flags' which affect matching: if
5719 REG_NOTBOL is set, then ^ does not match at the beginning of the
5720 string; if REG_NOTEOL is set, then $ does not match at the end.
5722 We return 0 if we find a match and REG_NOMATCH if not. */
5725 regexec (preg
, string
, nmatch
, pmatch
, eflags
)
5726 const regex_t
*preg
;
5729 regmatch_t pmatch
[];
5733 struct re_registers regs
;
5734 regex_t private_preg
;
5735 int len
= strlen (string
);
5736 boolean want_reg_info
= !preg
->no_sub
&& nmatch
> 0;
5738 private_preg
= *preg
;
5740 private_preg
.not_bol
= !!(eflags
& REG_NOTBOL
);
5741 private_preg
.not_eol
= !!(eflags
& REG_NOTEOL
);
5743 /* The user has told us exactly how many registers to return
5744 information about, via `nmatch'. We have to pass that on to the
5745 matching routines. */
5746 private_preg
.regs_allocated
= REGS_FIXED
;
5750 regs
.num_regs
= nmatch
;
5751 regs
.start
= TALLOC (nmatch
, regoff_t
);
5752 regs
.end
= TALLOC (nmatch
, regoff_t
);
5753 if (regs
.start
== NULL
|| regs
.end
== NULL
)
5754 return (int) REG_NOMATCH
;
5757 /* Perform the searching operation. */
5758 ret
= re_search (&private_preg
, string
, len
,
5759 /* start: */ 0, /* range: */ len
,
5760 want_reg_info
? ®s
: (struct re_registers
*) 0);
5762 /* Copy the register information to the POSIX structure. */
5769 for (r
= 0; r
< nmatch
; r
++)
5771 pmatch
[r
].rm_so
= regs
.start
[r
];
5772 pmatch
[r
].rm_eo
= regs
.end
[r
];
5776 /* If we needed the temporary register info, free the space now. */
5781 /* We want zero return to mean success, unlike `re_search'. */
5782 return ret
>= 0 ? (int) REG_NOERROR
: (int) REG_NOMATCH
;
5785 weak_alias (__regexec
, regexec
)
5789 /* Returns a message corresponding to an error code, ERRCODE, returned
5790 from either regcomp or regexec. We don't use PREG here. */
5793 regerror (int errcode
, const regex_t
*preg
, char *errbuf
, size_t errbuf_size
)
5799 || errcode
>= (int) (sizeof (re_error_msgid
)
5800 / sizeof (re_error_msgid
[0])))
5801 /* Only error codes returned by the rest of the code should be passed
5802 to this routine. If we are given anything else, or if other regex
5803 code generates an invalid error code, then the program has a bug.
5804 Dump core so we can fix it. */
5807 msg
= gettext (re_error_msgid
[errcode
]);
5809 msg_size
= strlen (msg
) + 1; /* Includes the null. */
5811 if (errbuf_size
!= 0)
5813 if (msg_size
> errbuf_size
)
5815 #if defined HAVE_MEMPCPY || defined _LIBC
5816 *((char *) __mempcpy (errbuf
, msg
, errbuf_size
- 1)) = '\0';
5818 memcpy (errbuf
, msg
, errbuf_size
- 1);
5819 errbuf
[errbuf_size
- 1] = 0;
5823 memcpy (errbuf
, msg
, msg_size
);
5829 weak_alias (__regerror
, regerror
)
5833 /* Free dynamically allocated space used by PREG. */
5839 if (preg
->buffer
!= NULL
)
5840 free (preg
->buffer
);
5841 preg
->buffer
= NULL
;
5843 preg
->allocated
= 0;
5846 if (preg
->fastmap
!= NULL
)
5847 free (preg
->fastmap
);
5848 preg
->fastmap
= NULL
;
5849 preg
->fastmap_accurate
= 0;
5851 if (preg
->translate
!= NULL
)
5852 free (preg
->translate
);
5853 preg
->translate
= NULL
;
5856 weak_alias (__regfree
, regfree
)
5859 #endif /* not emacs */