diff options
| author | Karl Williamson <khw@cpan.org> | 2015-09-12 11:39:37 -0600 |
|---|---|---|
| committer | Karl Williamson <khw@cpan.org> | 2015-09-12 20:50:16 -0600 |
| commit | 8736d1c336efff364daa33d27d0381c4de4771d0 (patch) | |
| tree | 284fffa17089eaba562b812f2b9281622d77d10f /proto.h | |
| parent | a229ea8f086a14af7afbad5fa40d1f71e6e48a34 (diff) | |
| download | perl-8736d1c336efff364daa33d27d0381c4de4771d0.tar.gz | |
regcomp.c: Simplify some code
Commit 2d3d6e6e7c2d50b1cc47032cf089151823fb20a6 introduced the
'optimizable' variable which if FALSE prevents the [...] node from being
optimized, if otherwise possible, into something simpler. It turns out
that several of the conditions which prevent such optimization can just
clear this flag when they are found, rather than having to test for the
conditions again later when the optimization is actually done.
Diffstat (limited to 'proto.h')
| -rw-r--r-- | proto.h | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -4774,7 +4774,7 @@ STATIC regnode* S_regatom(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth STATIC regnode* S_regbranch(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, I32 first, U32 depth); #define PERL_ARGS_ASSERT_REGBRANCH \ assert(pRExC_state); assert(flagp) -STATIC regnode* S_regclass(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth, const bool stop_at_1, bool allow_multi_fold, const bool silence_non_portable, const bool strict, const bool optimizable, SV** ret_invlist); +STATIC regnode* S_regclass(pTHX_ RExC_state_t *pRExC_state, I32 *flagp, U32 depth, const bool stop_at_1, bool allow_multi_fold, const bool silence_non_portable, const bool strict, bool optimizable, SV** ret_invlist); #define PERL_ARGS_ASSERT_REGCLASS \ assert(pRExC_state); assert(flagp) STATIC unsigned int S_regex_set_precedence(const U8 my_operator) |