Home
last modified time | relevance | path

Searched refs:ANYOFM (Results 1 – 8 of 8) sorted by relevance

/openbsd-src/gnu/usr.bin/perl/dist/Devel-PPPort/parts/base/
H A D50270092 ANYOFM # Z added by devel/scanprov
/openbsd-src/gnu/usr.bin/perl/
H A Dregnodes.h450 #define ANYOFM 29 /* 0x1d Like ANYOF, but matches macro
1969 .type = ANYOFM,
1976 .type = ANYOFM,
2950 ANYOFHr, ANYOFHs, ANYOFR, ANYOFRb, ANYOFHbbm, ANYOFM, NANYOFM, POSIXD,
H A Dregcomp.sym115 ANYOFM ANYOFM, byte 1 S ; Like ANYOF, but matches an invariant byte as determined by the …
116 NANYOFM ANYOFM, byte 1 S ; complement of ANYOFM
H A Dregcomp_study.c2305 /* Replace a length 1 ASCII fold pair node with an ANYOFM node, in Perl_study_chunk()
2318 OP(scan) = ANYOFM; in Perl_study_chunk()
2440 /* Then replace it by an ANYOFM node, with in Perl_study_chunk()
2445 OP(next) = ANYOFM; in Perl_study_chunk()
3006 case ANYOFM: in Perl_study_chunk()
H A Dregcomp_debug.c973 else if (k == ANYOFM) { in S_put_range()
H A Dregexec.c7572 case ANYOFM: in S_regmatch()
7579 locinput++; /* ANYOFM is always single byte */ in S_regmatch()
H A Dregcomp.c11770 /* See if this can be turned into an ANYOFM node. Think about the bit in S_optimize_regclass()
11786 * So [01], which is a common usage, is optimizable into ANYOFM, and in S_optimize_regclass()
11797 /* If doesn't fit the criteria for ANYOFM, invert and try again. If in S_optimize_regclass()
11862 op = ANYOFM + inverted; in S_optimize_regclass()
13110 * ANYOFM/NANYOFM node 'n' */ in Perl_pregfree2()
/openbsd-src/gnu/usr.bin/perl/pod/
H A Dperldebguts.pod639 ANYOFM byte 1 Like ANYOF, but matches an invariant byte
641 NANYOFM byte 1 complement of ANYOFM