X-Git-Url: https://perl5.git.perl.org/perl5.git/blobdiff_plain/3018b823898645e44b8c37c70ac5c6302b031381..395e49858e6cabdc5c8ecc0647e256452bd20f64:/regcomp.sym?ds=sidebyside diff --git a/regcomp.sym b/regcomp.sym index 2a49d20..bea2a8e 100644 --- a/regcomp.sym +++ b/regcomp.sym @@ -2,7 +2,9 @@ # # File has two sections, divided by a line of dashes '-'. # -# Empty rows after #-comment are removed from input are ignored +# Lines beginning with # are ignored, except for those that start with #* +# which are included in pod/perldebguts.pod. # within a line may be part +# of a description. # # First section is for regops, second section is for regmatch-states # @@ -14,7 +16,6 @@ # # # run perl regen.pl after editing this file -# Also update perlredebguts.pod @@ -37,15 +38,15 @@ SEOL EOL, no ; Same, assuming singleline. # in regcomp.c uses the enum value of the modifier as an offset from the /d # version. The complements must come after the non-complements. # BOUND, POSIX and their complements are affected, as well as EXACTF. -BOUND BOUND, no ; Match "" at any word boundary using native charset semantics for non-utf8 +BOUND BOUND, no ; Match "" at any word boundary using native charset rules for non-utf8 BOUNDL BOUND, no ; Match "" at any locale word boundary -BOUNDU BOUND, no ; Match "" at any word boundary using Unicode semantics -BOUNDA BOUND, no ; Match "" at any word boundary using ASCII semantics +BOUNDU BOUND, no ; Match "" at any word boundary using Unicode rules +BOUNDA BOUND, no ; Match "" at any word boundary using ASCII rules # All NBOUND nodes are required by code in regexec.c to be greater than all BOUND ones -NBOUND NBOUND, no ; Match "" at any word non-boundary using native charset semantics for non-utf8 +NBOUND NBOUND, no ; Match "" at any word non-boundary using native charset rules for non-utf8 NBOUNDL NBOUND, no ; Match "" at any locale word non-boundary -NBOUNDU NBOUND, no ; Match "" at any word non-boundary using Unicode semantics -NBOUNDA NBOUND, no ; Match "" at any word non-boundary using ASCII semantics +NBOUNDU NBOUND, no ; Match "" at any word non-boundary using Unicode rules +NBOUNDA NBOUND, no ; Match "" at any word non-boundary using ASCII rules GPOS GPOS, no ; Matches where last m//g left off. #* [Special] alternatives: @@ -70,24 +71,26 @@ CLUMP CLUMP, no 0 V ; Match any extended grapheme cluster sequence #* Alternation -# BRANCH The set of branches constituting a single choice are hooked -# together with their "next" pointers, since precedence prevents -# anything being concatenated to any individual branch. The -# "next" pointer of the last BRANCH in a choice points to the -# thing following the whole choice. This is also where the -# final "next" pointer of each individual branch points; each -# branch starts with the operand node of a BRANCH node. -# +#* BRANCH The set of branches constituting a single choice are +#* hooked together with their "next" pointers, since +#* precedence prevents anything being concatenated to +#* any individual branch. The "next" pointer of the last +#* BRANCH in a choice points to the thing following the +#* whole choice. This is also where the final "next" +#* pointer of each individual branch points; each branch +#* starts with the operand node of a BRANCH node. +#* BRANCH BRANCH, node 0 V ; Match this alternative, or the next... #*Back pointer -# BACK Normal "next" pointers all implicitly point forward; BACK -# exists to make loop structures possible. -# not used +#* BACK Normal "next" pointers all implicitly point forward; +#* BACK exists to make loop structures possible. +#* not used BACK BACK, no 0 V ; Match "", "next" ptr points backward. -#*Literals - NOTE the relative ordering of these types is important do not change it +#*Literals +# NOTE: the relative ordering of these types is important do not change it EXACT EXACT, str ; Match this string (preceded by length). EXACTF EXACT, str ; Match this non-UTF-8 string (not guaranteed to be folded) using /id rules (w/len). @@ -95,21 +98,21 @@ EXACTFL EXACT, str ; Match this string (not guaranteed to be fold EXACTFU EXACT, str ; Match this string (folded iff in UTF-8, length in folding doesn't change if not in UTF-8) using /iu rules (w/len). EXACTFA EXACT, str ; Match this string (not guaranteed to be folded) using /iaa rules (w/len). EXACTFU_SS EXACT, str ; Match this string (folded iff in UTF-8, length in folding may change even if not in UTF-8) using /iu rules (w/len). -EXACTFU_TRICKYFOLD EXACT, str ; Match this folded UTF-8 string using /iu rules +EXACTFA_NO_TRIE EXACT, str ; Match this string (which is not trie-able; not guaranteed to be folded) using /iaa rules (w/len). #*Do nothing types NOTHING NOTHING, no ; Match empty string. -# A variant of above which delimits a group, thus stops optimizations +#*A variant of above which delimits a group, thus stops optimizations TAIL NOTHING, no ; Match empty string. Can jump here from outside. #*Loops -# STAR,PLUS '?', and complex '*' and '+', are implemented as circular -# BRANCH structures using BACK. Simple cases (one character -# per match) are implemented with STAR and PLUS for speed -# and to minimize recursive plunges. -# +#* STAR,PLUS '?', and complex '*' and '+', are implemented as +#* circular BRANCH structures using BACK. Simple cases +#* (one character per match) are implemented with STAR +#* and PLUS for speed and to minimize recursive plunges. +#* STAR STAR, node 0 V ; Match this (simple) thing 0 or more times. PLUS PLUS, node 0 V ; Match this (simple) thing 1 or more times. @@ -118,35 +121,36 @@ CURLYN CURLY, no 2 V ; Capture next-after-this simple thing CURLYM CURLY, no 2 V ; Capture this medium-complex thing {n,m} times. CURLYX CURLY, sv 2 V ; Match this complex thing {n,m} times. -# This terminator creates a loop structure for CURLYX +#*This terminator creates a loop structure for CURLYX WHILEM WHILEM, no 0 V ; Do curly processing and see if rest matches. #*Buffer related -# OPEN,CLOSE,GROUPP ...are numbered at compile time. +#*OPEN,CLOSE,GROUPP ...are numbered at compile time. OPEN OPEN, num 1 ; Mark this point in input as start of #n. CLOSE CLOSE, num 1 ; Analogous to OPEN. REF REF, num 1 V ; Match some already matched string -REFF REF, num 1 V ; Match already matched string, folded using native charset semantics for non-utf8 +REFF REF, num 1 V ; Match already matched string, folded using native charset rules for non-utf8 REFFL REF, num 1 V ; Match already matched string, folded in loc. # N?REFF[AU] could have been implemented using the FLAGS field of the # regnode, but by having a separate node type, we can use the existing switch # statement to avoid some tests -REFFU REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8 -REFFA REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII +REFFU REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8 +REFFA REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII -#*Named references. Code in regcomp.c assumes that these all are after the numbered references +#*Named references. Code in regcomp.c assumes that these all are after +#*the numbered references NREF REF, no-sv 1 V ; Match some already matched string -NREFF REF, no-sv 1 V ; Match already matched string, folded using native charset semantics for non-utf8 +NREFF REF, no-sv 1 V ; Match already matched string, folded using native charset rules for non-utf8 NREFFL REF, no-sv 1 V ; Match already matched string, folded in loc. -NREFFU REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8 -NREFFA REF, num 1 V ; Match already matched string, folded using unicode semantics for non-utf8, no mixing ASCII, non-ASCII +NREFFU REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8 +NREFFA REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII IFMATCH BRANCHJ, off 1 . 2 ; Succeeds if the following matches. UNLESSM BRANCHJ, off 1 . 2 ; Fails if the following matches. SUSPEND BRANCHJ, off 1 V 1 ; "Independent" sub-RE. -IFTHEN BRANCHJ, off 1 V 1 ; Switch, should be preceded by switcher . +IFTHEN BRANCHJ, off 1 V 1 ; Switch, should be preceded by switcher. GROUPP GROUPP, num 1 ; Whether the group matched. #*Support for long RE @@ -163,13 +167,14 @@ EVAL EVAL, evl 1 ; Execute some Perl code. MINMOD MINMOD, no ; Next operator is not greedy. LOGICAL LOGICAL, no ; Next opcode should set the flag only. -# This is not used yet +#*This is not used yet RENUM BRANCHJ, off 1 . 1 ; Group with independently numbered parens. #*Trie Related -# Behave the same as A|LIST|OF|WORDS would. The '..C' variants have -# inline charclass data (ascii only), the 'C' store it in the structure. +#* Behave the same as A|LIST|OF|WORDS would. The '..C' variants +#* have inline charclass data (ascii only), the 'C' store it in the +#* structure. # NOTE: the relative order of the TRIE-like regops is significant TRIE TRIE, trie 1 ; Match many EXACT(F[ALU]?)? at once. flags==type @@ -214,20 +219,20 @@ LNBREAK LNBREAK, none ; generic newline pattern #*SPECIAL REGOPS -# This is not really a node, but an optimized away piece of a "long" node. -# To simplify debugging output, we mark it as if it were a node +#* This is not really a node, but an optimized away piece of a "long" +#* node. To simplify debugging output, we mark it as if it were a node OPTIMIZED NOTHING, off ; Placeholder for dump. -# Special opcode with the property that no opcode in a compiled program -# will ever be of this type. Thus it can be used as a flag value that -# no other opcode has been seen. END is used similarly, in that an END -# node cant be optimized. So END implies "unoptimizable" and PSEUDO mean -# "not seen anything to optimize yet". +#* Special opcode with the property that no opcode in a compiled program +#* will ever be of this type. Thus it can be used as a flag value that +#* no other opcode has been seen. END is used similarly, in that an END +#* node cant be optimized. So END implies "unoptimizable" and PSEUDO +#* mean "not seen anything to optimize yet". PSEUDO PSEUDO, off ; Pseudo opcode for internal use. ------------------------------------------------------------------------------- # Format for second section: -# REGOP \t typelist [ \t typelist] [# Comment] +# REGOP \t typelist [ \t typelist] # typelist= namelist # = namelist:FAIL # = name:count