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