This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
regcomp.c: Make sure /di nodes begining in 's' are EXACTF
[perl5.git] / regcomp.sym
CommitLineData
03363afd
YO
1# regcomp.sym
2#
3# File has two sections, divided by a line of dashes '-'.
4#
65aa4ca7
FC
5# Lines beginning with # are ignored, except for those that start with #*
6# which are included in pod/perldebguts.pod. # within a line may be part
7# of a description.
03363afd 8#
486ec47a 9# First section is for regops, second section is for regmatch-states
03363afd 10#
3dab1dad
YO
11# Note that the order in this file is important.
12#
03363afd 13# Format for first section:
46167d76
KW
14# NAME \s+ TYPE, arg-description [num-args] [flags] [longjump] ; DESCRIPTION
15# flag <S> means is REGNODE_SIMPLE; flag <V> means is REGNODE_VARIES; <.> is
16# a placeholder
17# longjump is 1 if the (first) argument holds the next offset.
03363afd 18#
3dab1dad 19#
c476f425 20# run perl regen.pl after editing this file
3dab1dad 21
03363afd
YO
22
23
381b57db 24#* Exit points
1de06328 25
f8abb37e
NC
26END END, no ; End of program.
27SUCCEED END, no ; Return from a subroutine, basically.
d09b2d29 28
d3d47aac 29#* Line Start Anchors:
1645b83c 30#Note flags field for SBOL indicates if it is a /^/ or a /\A/
d3d47aac
YO
31SBOL BOL, no ; Match "" at beginning of line: /^/, /\A/
32MBOL BOL, no ; Same, assuming multiline: /^/m
33
34#* Line End Anchors:
35SEOL EOL, no ; Match "" at end of line: /$/
36MEOL EOL, no ; Same, assuming multiline: /$/m
37EOS EOL, no ; Match "" at end of string: /\z/
38
39#* Match Start Anchors:
40GPOS GPOS, no ; Matches where last m//g left off.
41
42#* Word Boundary Opcodes:
693fefec
KW
43# The regops that have varieties that vary depending on the character set regex
44# modifiers have to ordered thusly: /d, /l, /u, /a, /aa. This is because code
45# in regcomp.c uses the enum value of the modifier as an offset from the /d
46# version. The complements must come after the non-complements.
3018b823 47# BOUND, POSIX and their complements are affected, as well as EXACTF.
c440a570
KW
48BOUND BOUND, no ; Like BOUNDA for non-utf8, otherwise match "" between any Unicode \w\W or \W\w
49BOUNDL BOUND, no ; Like BOUND/BOUNDU, but \w and \W are defined by current locale
64935bc6 50BOUNDU BOUND, no ; Match "" at any boundary of a given type using Unicode rules
c440a570 51BOUNDA BOUND, no ; Match "" at any boundary between \w\W or \W\w, where \w is [_a-zA-Z0-9]
693fefec 52# All NBOUND nodes are required by code in regexec.c to be greater than all BOUND ones
c440a570
KW
53NBOUND NBOUND, no ; Like NBOUNDA for non-utf8, otherwise match "" between any Unicode \w\w or \W\W
54NBOUNDL NBOUND, no ; Like NBOUND/NBOUNDU, but \w and \W are defined by current locale
55NBOUNDU NBOUND, no ; Match "" at any non-boundary of a given type using using Unicode rules
56NBOUNDA NBOUND, no ; Match "" betweeen any \w\w or \W\W, where \w is [_a-zA-Z0-9]
d09b2d29 57
381b57db 58#* [Special] alternatives:
f9ef50a7
NC
59REG_ANY REG_ANY, no 0 S ; Match any one character (except newline).
60SANY REG_ANY, no 0 S ; Match any one character.
46fc0c43
KW
61ANYOF ANYOF, sv charclass S ; Match character in (or not in) this class, single char match only
62ANYOFD ANYOF, sv charclass S ; Like ANYOF, but /d is in effect
63ANYOFL ANYOF, sv charclass S ; Like ANYOF, but /l is in effect
64ANYOFPOSIXL ANYOF, sv charclass_posixl S ; Like ANYOFL, but matches [[:posix:]] classes
67a1b5f9 65ANYOFM ANYOFM byte 1 S ; Like ANYOF, but matches an invariant byte as determined by the mask and arg
3db0bccc 66NANYOFM ANYOFM byte 1 S ; complement of ANYOFM
693fefec 67
d3d47aac 68#* POSIX Character Classes:
3018b823
KW
69# Order of the below is important. See ordering comment above.
70POSIXD POSIXD, none 0 S ; Some [[:class:]] under /d; the FLAGS field gives which one
71POSIXL POSIXD, none 0 S ; Some [[:class:]] under /l; the FLAGS field gives which one
72POSIXU POSIXD, none 0 S ; Some [[:class:]] under /u; the FLAGS field gives which one
3615ea58 73POSIXA POSIXD, none 0 S ; Some [[:class:]] under /a; the FLAGS field gives which one
3018b823
KW
74NPOSIXD NPOSIXD, none 0 S ; complement of POSIXD, [[:^class:]]
75NPOSIXL NPOSIXD, none 0 S ; complement of POSIXL, [[:^class:]]
76NPOSIXU NPOSIXD, none 0 S ; complement of POSIXU, [[:^class:]]
9e84774b 77NPOSIXA NPOSIXD, none 0 S ; complement of POSIXA, [[:^class:]]
3018b823 78# End of order is important
693fefec 79
39d24220
KW
80ASCII ASCII, none 0 S ; [[:ascii:]]
81NASCII ASCII, none 0 S ; [[:^ascii:]]
82
2448cf39 83CLUMP CLUMP, no 0 V ; Match any extended grapheme cluster sequence
d09b2d29 84
381b57db 85#* Alternation
1de06328 86
65aa4ca7
FC
87#* BRANCH The set of branches constituting a single choice are
88#* hooked together with their "next" pointers, since
89#* precedence prevents anything being concatenated to
90#* any individual branch. The "next" pointer of the last
91#* BRANCH in a choice points to the thing following the
92#* whole choice. This is also where the final "next"
93#* pointer of each individual branch points; each branch
94#* starts with the operand node of a BRANCH node.
95#*
f9ef50a7 96BRANCH BRANCH, node 0 V ; Match this alternative, or the next...
d09b2d29 97
65aa4ca7
FC
98#*Literals
99# NOTE: the relative ordering of these types is important do not change it
1de06328 100
f8abb37e 101EXACT EXACT, str ; Match this string (preceded by length).
b24abbc8 102EXACTL EXACT, str ; Like EXACT, but /l is in effect (used so locale-related warnings can be checked for).
4f4c2c24
KW
103EXACTF EXACT, str ; Match this string using /id rules (w/len); (string not UTF-8, not guaranteed to be folded).
104EXACTFL EXACT, str ; Match this string using /il rules (w/len); (string not guaranteed to be folded).
105EXACTFU EXACT, str ; Match this string using /iu rules (w/len); (string folded iff in UTF-8; non-UTF8 folded length <= unfolded).
106EXACTFAA EXACT, str ; Match this string using /iaa rules (w/len) (string folded iff in UTF-8; non-UTF8 folded length <= unfolded).
2f306ab9
KW
107
108# End of important relative ordering.
109
4f4c2c24
KW
110EXACTFU_SS EXACT, str ; Match this string using /iu rules (w/len); (string folded iff in UTF-8; non-UTF8 folded length > unfolded).
111EXACTFLU8 EXACT, str ; Like EXACTFU, but use /il, UTF-8, folded, and everything in it is above 255.
112EXACTFAA_NO_TRIE EXACT, str ; Match this string using /iaa rules (w/len) (string not UTF-8, not guaranteed to be folded, not currently trie-able).
d09b2d29 113
4f4c2c24
KW
114
115EXACT_ONLY8 EXACT, str ; Like EXACT, but only UTF-8 encoded targets can match
116EXACTFU_ONLY8 EXACT, str ; Like EXACTFU, but only UTF-8 encoded targets can match
a9f8c7ac
KW
117# One could add EXACTFAA8 and and something that has the same effect for /l,
118# but these would be extremely uncommon
f6b4b99d 119
381b57db 120#*Do nothing types
1de06328 121
f8abb37e 122NOTHING NOTHING, no ; Match empty string.
65aa4ca7 123#*A variant of above which delimits a group, thus stops optimizations
f8abb37e 124TAIL NOTHING, no ; Match empty string. Can jump here from outside.
d09b2d29 125
381b57db 126#*Loops
1de06328 127
65aa4ca7 128#* STAR,PLUS '?', and complex '*' and '+', are implemented as
62e6ef33 129#* circular BRANCH structures. Simple cases
65aa4ca7
FC
130#* (one character per match) are implemented with STAR
131#* and PLUS for speed and to minimize recursive plunges.
132#*
f9ef50a7
NC
133STAR STAR, node 0 V ; Match this (simple) thing 0 or more times.
134PLUS PLUS, node 0 V ; Match this (simple) thing 1 or more times.
d09b2d29 135
f9ef50a7
NC
136CURLY CURLY, sv 2 V ; Match this simple thing {n,m} times.
137CURLYN CURLY, no 2 V ; Capture next-after-this simple thing
138CURLYM CURLY, no 2 V ; Capture this medium-complex thing {n,m} times.
139CURLYX CURLY, sv 2 V ; Match this complex thing {n,m} times.
d09b2d29 140
65aa4ca7 141#*This terminator creates a loop structure for CURLYX
f9ef50a7 142WHILEM WHILEM, no 0 V ; Do curly processing and see if rest matches.
d09b2d29 143
381b57db 144#*Buffer related
1de06328 145
65aa4ca7 146#*OPEN,CLOSE,GROUPP ...are numbered at compile time.
f8abb37e 147OPEN OPEN, num 1 ; Mark this point in input as start of #n.
48e88d42 148CLOSE CLOSE, num 1 ; Close corresponding OPEN of #n.
07093db4
KW
149SROPEN SROPEN, none ; Same as OPEN, but for script run
150SRCLOSE SRCLOSE, none ; Close preceding SROPEN
d09b2d29 151
f9ef50a7 152REF REF, num 1 V ; Match some already matched string
850b7ec9 153REFF REF, num 1 V ; Match already matched string, folded using native charset rules for non-utf8
f9ef50a7 154REFFL REF, num 1 V ; Match already matched string, folded in loc.
781aab5c 155# N?REFF[AU] could have been implemented using the FLAGS field of the
01f98ec2
KW
156# regnode, but by having a separate node type, we can use the existing switch
157# statement to avoid some tests
850b7ec9
KW
158REFFU REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8
159REFFA REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII
d09b2d29 160
65aa4ca7
FC
161#*Named references. Code in regcomp.c assumes that these all are after
162#*the numbered references
01f98ec2 163NREF REF, no-sv 1 V ; Match some already matched string
850b7ec9 164NREFF REF, no-sv 1 V ; Match already matched string, folded using native charset rules for non-utf8
01f98ec2 165NREFFL REF, no-sv 1 V ; Match already matched string, folded in loc.
850b7ec9
KW
166NREFFU REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8
167NREFFA REF, num 1 V ; Match already matched string, folded using unicode rules for non-utf8, no mixing ASCII, non-ASCII
1de06328 168
d3d47aac
YO
169#*Support for long RE
170LONGJMP LONGJMP, off 1 . 1 ; Jump far away.
171BRANCHJ BRANCHJ, off 1 V 1 ; BRANCH with long offset.
172
173#*Special Case Regops
46167d76
KW
174IFMATCH BRANCHJ, off 1 . 1 ; Succeeds if the following matches.
175UNLESSM BRANCHJ, off 1 . 1 ; Fails if the following matches.
f9ef50a7 176SUSPEND BRANCHJ, off 1 V 1 ; "Independent" sub-RE.
65aa4ca7 177IFTHEN BRANCHJ, off 1 V 1 ; Switch, should be preceded by switcher.
f8abb37e 178GROUPP GROUPP, num 1 ; Whether the group matched.
d09b2d29 179
d09b2d29 180
381b57db 181#*The heavy worker
1de06328 182
13f27704 183EVAL EVAL, evl/flags 2L ; Execute some Perl code.
d09b2d29 184
381b57db 185#*Modifiers
1de06328 186
f8abb37e
NC
187MINMOD MINMOD, no ; Next operator is not greedy.
188LOGICAL LOGICAL, no ; Next opcode should set the flag only.
d09b2d29 189
65aa4ca7 190#*This is not used yet
f9ef50a7 191RENUM BRANCHJ, off 1 . 1 ; Group with independently numbered parens.
d09b2d29 192
381b57db 193#*Trie Related
1de06328 194
65aa4ca7
FC
195#* Behave the same as A|LIST|OF|WORDS would. The '..C' variants
196#* have inline charclass data (ascii only), the 'C' store it in the
197#* structure.
486ec47a 198# NOTE: the relative order of the TRIE-like regops is significant
ce5e9471 199
7986cb47 200TRIE TRIE, trie 1 ; Match many EXACT(F[ALU]?)? at once. flags==type
f8abb37e 201TRIEC TRIE,trie charclass ; Same as TRIE, but with embedded charclass data
3dab1dad 202
1de06328 203# For start classes, contains an added fail table.
f8abb37e
NC
204AHOCORASICK TRIE, trie 1 ; Aho Corasick stclass. flags==type
205AHOCORASICKC TRIE,trie charclass ; Same as AHOCORASICK, but with embedded charclass data
1de06328 206
381b57db 207#*Regex Subroutines
f8abb37e 208GOSUB GOSUB, num/ofs 2L ; recurse to paren arg1 at (signed) ofs arg2
03363afd 209
381b57db 210#*Special conditionals
f8abb37e
NC
211NGROUPP NGROUPP, no-sv 1 ; Whether the group matched.
212INSUBP INSUBP, num 1 ; Whether we are in a specific recurse.
213DEFINEP DEFINEP, none 1 ; Never execute directly.
0a4db386 214
486ec47a 215#*Backtracking Verbs
f8abb37e 216ENDLIKE ENDLIKE, none ; Used only for the type field of verbs
fee50582
YO
217OPFAIL ENDLIKE, no-sv 1 ; Same as (?!), but with verb arg
218ACCEPT ENDLIKE, no-sv/num 2L ; Accepts the current matched string, with verbar
5d458dd8
YO
219
220#*Verbs With Arguments
f8abb37e
NC
221VERB VERB, no-sv 1 ; Used only for the type field of verbs
222PRUNE VERB, no-sv 1 ; Pattern fails at this startpoint if no-backtracking through this
223MARKPOINT VERB, no-sv 1 ; Push the current location for rollback by cut.
224SKIP VERB, no-sv 1 ; On failure skip forward (to the mark) before retrying
225COMMIT VERB, no-sv 1 ; Pattern fails outright if backtracking through this
226CUTGROUP VERB, no-sv 1 ; On failure go to the next alternation in the group
e2e6a0f1 227
ee9b8eae 228#*Control what to keep in $&.
f8abb37e 229KEEPS KEEPS, no ; $& begins here.
ee9b8eae 230
e1d1eefb 231#*New charclass like patterns
f8abb37e 232LNBREAK LNBREAK, none ; generic newline pattern
3172e3fd 233
381b57db 234# NEW STUFF SOMEWHERE ABOVE THIS LINE
1de06328 235
03363afd
YO
236################################################################################
237
7f69552c 238#*SPECIAL REGOPS
1de06328 239
65aa4ca7
FC
240#* This is not really a node, but an optimized away piece of a "long"
241#* node. To simplify debugging output, we mark it as if it were a node
f8abb37e 242OPTIMIZED NOTHING, off ; Placeholder for dump.
1de06328 243
65aa4ca7
FC
244#* Special opcode with the property that no opcode in a compiled program
245#* will ever be of this type. Thus it can be used as a flag value that
246#* no other opcode has been seen. END is used similarly, in that an END
247#* node cant be optimized. So END implies "unoptimizable" and PSEUDO
248#* mean "not seen anything to optimize yet".
f8abb37e 249PSEUDO PSEUDO, off ; Pseudo opcode for internal use.
1de06328 250
03363afd
YO
251-------------------------------------------------------------------------------
252# Format for second section:
65aa4ca7 253# REGOP \t typelist [ \t typelist]
03363afd
YO
254# typelist= namelist
255# = namelist:FAIL
256# = name:count
257
258# Anything below is a state
259#
260#
f8abb37e 261TRIE next:FAIL
4ee16520 262EVAL B,postponed_AB:FAIL
f8abb37e
NC
263CURLYX end:FAIL
264WHILEM A_pre,A_min,A_max,B_min,B_max:FAIL
265BRANCH next:FAIL
266CURLYM A,B:FAIL
267IFMATCH A:FAIL
21cbe009 268CURLY B_min,B_max:FAIL
f8abb37e
NC
269COMMIT next:FAIL
270MARKPOINT next:FAIL
271SKIP next:FAIL
272CUTGROUP next:FAIL
273KEEPS next:FAIL