Searched refs:LEXACT (Results 1 – 8 of 8) sorted by relevance
491 #define STR_LENs(p) (__ASSERT_(OP(p) != LEXACT && OP(p) != LEXACT_REQ8) \493 #define STRINGs(p) (__ASSERT_(OP(p) != LEXACT && OP(p) != LEXACT_REQ8) \513 #define STR_LENl(p) (__ASSERT_(OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \515 #define STRINGl(p) (__ASSERT_(OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \519 #define STR_LEN(p) ((OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \521 #define STRING(p) ((OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \531 if (OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
155 LEXACT EXACT, len:str 1; Match this long string (preceded by length; flags unused).180 LEXACT_REQ8 EXACT, len:str 1 ; Like LEXACT, but only UTF-8 encoded targets can match
573 #define LEXACT 42 /* 0x2a Match this long string macro
6911 * LEXACT nodes. If the pattern is gigantic enough, though, in S_regatom() 6914 if (! LOC && (node_type == EXACT || node_type == LEXACT)) { in S_regatom() 6928 * instead to an LEXACT. The code below is structured so that in S_regatom() 6930 * or just increasing the LEXACT size. This means that we have in S_regatom() 6934 overhead_expansion = REGNODE_ARG_LEN(LEXACT) - REGNODE_ARG_LEN(EXACT); in S_regatom() 6964 * EXACT node now converted to LEXACT, and the string has to be in S_regatom() 6969 node_type = LEXACT; in S_regatom() 7421 else if (node_type == LEXACT) { in S_regatom()
1589 && OP(scan) != LEXACT in Perl_study_chunk()
7040 case LEXACT: in S_regmatch()
20 LEXACT # Z added by devel/scanprov
680 LEXACT len:str 1 Match this long string (preceded by length;709 LEXACT_REQ8 len:str 1 Like LEXACT, but only UTF-8 encoded targets