# HG changeset patch # User Richard M. Stallman # Date 785017779 0 # Node ID ef6e1637c777bf113dd0cc93502c525db4b7c646 # Parent 65d2d56726eaf31e4aac6cdfb2391efa93231782 (re_opcode_t): New opcode `succeed' (re_match_2_internal): Handle `succeed'. (regex_compile): Handle RE_NO_BACKTRACKING. (re_syntax_options): Delete initializer. diff -r 65d2d56726ea -r ef6e1637c777 src/regex.c --- a/src/regex.c Wed Nov 16 20:28:48 1994 +0000 +++ b/src/regex.c Wed Nov 16 20:29:39 1994 +0000 @@ -267,6 +267,9 @@ { no_op = 0, + /* Succeed right away--no more backtracking. */ + succeed, + /* Followed by one byte giving n, then by n literal bytes. */ exactn, @@ -834,7 +837,9 @@ /* Set by `re_set_syntax' to the current regexp syntax to recognize. Can also be assigned to arbitrarily: each pattern buffer stores its own syntax, so it can be changed between regex compilations. */ -reg_syntax_t re_syntax_options = RE_SYNTAX_EMACS; +/* This has no initializer because initialized variables in Emacs + become read-only after dumping. */ +reg_syntax_t re_syntax_options; /* Specify the precise syntax of regexps for compilation. This provides @@ -2470,6 +2475,11 @@ if (!COMPILE_STACK_EMPTY) FREE_STACK_RETURN (REG_EPAREN); + /* If we don't want backtracking, force success + the first time we reach the end of the compiled pattern. */ + if (syntax & RE_NO_POSIX_BACKTRACKING) + BUF_PUSH (succeed); + free (compile_stack.stack); /* We have succeeded; set the length of the buffer. */ @@ -3652,6 +3662,7 @@ } } /* d != end_match_2 */ + succeed: DEBUG_PRINT1 ("Accepting match.\n"); /* If caller wants register contents data back, do it. */ @@ -3752,6 +3763,9 @@ DEBUG_PRINT1 ("EXECUTING no_op.\n"); break; + case succeed: + DEBUG_PRINT1 ("EXECUTING succeed.\n"); + goto succeed; /* Match the next n pattern characters exactly. The following byte in the pattern defines n, and the n bytes after that