perl -d: test for 'T'.

[perl5.git] / regcomp.sym

diff --git a/regcomp.sym b/regcomp.sym
index 001acf6..c33b792 100644 (file)
--- a/regcomp.sym
+++ b/regcomp.sym
@@ -13,6 +13,7 @@
 #
 #
 # run perl regen.pl after editing this file
+# Also update perlredebguts.pod
 
 
 
@@ -94,10 +95,10 @@ BACK        BACK,       no 0 V    ; Match "", "next" ptr points backward.
 #*Literals
 
 EXACT       EXACT,      str       ; Match this string (preceded by length).
-EXACTF      EXACT,      str       ; Match this string, folded, native charset semantics for non-utf8 (prec. by length).
-EXACTFL     EXACT,      str       ; Match this string, folded in locale (w/len).
-EXACTFU     EXACT,      str      ; Match this string, folded, Unicode semantics for non-utf8 (prec. by length).
-EXACTFA     EXACT,      str      ; Match this string, folded, Unicode semantics for non-utf8, but no ASCII-range character matches outside ASCII (prec. by length),.
+EXACTF      EXACT,      str       ; Match this (folded if in UTF-8) string, folded, native charset semantics for non-utf8 (prec. by length).
+EXACTFL     EXACT,      str       ; Match this (not guaranteed to be folded) string, folded in locale (w/len).
+EXACTFU     EXACT,      str      ; Match this (folded if in UTF-8) string, folded, Unicode semantics for non-utf8 (prec. by length).
+EXACTFA     EXACT,      str      ; Match this (not guaranteed to be folded) string, folded, Unicode semantics for non-utf8, but no ASCII-range character matches outside ASCII (prec. by length),.
 
 #*Do nothing types
 
@@ -132,16 +133,18 @@ 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
 REFFL       REF,        num 1 V   ; Match already matched string, folded in loc.
-# REFFU and NREFFU could have been implemented using the FLAGS field of the
+# 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
 
 #*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
 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
 
 IFMATCH     BRANCHJ,    off 1 . 2 ; Succeeds if the following matches.
 UNLESSM     BRANCHJ,    off 1 . 2 ; Fails if the following matches.