Searched refs:OPTIMIZED (Results 1 – 10 of 10) sorted by relevance
1548 OP(n) = OPTIMIZED; in Perl_join_exact()2194 OP(opt)= OPTIMIZED; in Perl_study_chunk()2737 OP(nxt1 + 1) = OPTIMIZED; /* was count. */ in Perl_study_chunk()2740 OP(nxt) = OPTIMIZED; /* was CLOSE. */ in Perl_study_chunk()2741 OP(nxt + 1) = OPTIMIZED; /* was count. */ in Perl_study_chunk()2790 OP(nxt1) = OPTIMIZED; /* was OPEN. */ in Perl_study_chunk()2791 OP(nxt) = OPTIMIZED; /* was CLOSE. */ in Perl_study_chunk()2794 OP(nxt1 + 1) = OPTIMIZED; /* was count. */ in Perl_study_chunk()2795 OP(nxt + 1) = OPTIMIZED; /* was count. */ in Perl_study_chunk()
1552 if (op == OPTIMIZED) { in Perl_dumpuntil()1564 if (op != OPTIMIZED) { in Perl_dumpuntil()
1536 OP( optimize ) = OPTIMIZED; in Perl_make_trie()
1226 #define OPTIMIZED 109 /* 0x6d Placeholder for dump. macro
313 OPTIMIZED NOTHING, off ; Placeholder for dump.
4315 OP(opt)= OPTIMIZED; in S_reg()
289 gap with OPTIMIZED regnodes. Thus we might start with something like301 OPTIMIZED302 OPTIMIZED303 OPTIMIZED306 the C<REGNODE_AFTER> for the C<TRIE> node would be an C<OPTIMIZED>308 C<REGNODE_AFTER>. But it would be inefficient to execute the OPTIMIZED663 12: OPTIMIZED (2 nodes)671 30: OPTIMIZED (4 nodes)
62 C<OPTIMIZED>, it could treat blocks of exact text as if they were nodes,
865 OPTIMIZED off Placeholder for dump.
251 OPTIMIZED # Z added by devel/scanprov