1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405
|
#!./perl
# The tests are in a separate file 't/re/re_tests'.
# Each line in that file is a separate test.
# There are five columns, separated by tabs.
#
# Column 1 contains the pattern, optionally enclosed in C<''>.
# Modifiers can be put after the closing C<'>.
#
# Column 2 contains the string to be matched.
#
# Column 3 contains the expected result:
# y expect a match
# n expect no match
# c expect an error
# T the test is a TODO (can be combined with y/n/c)
# M skip test on miniperl (combine with y/n/c/T)
# B test exposes a known bug in Perl, should be skipped
# b test exposes a known bug in Perl, should be skipped if noamp
# t test exposes a bug with threading, TODO if qr_embed_thr
# s test should only be run for regex_sets_compat.t
# S test should not be run for regex_sets_compat.t
#
# Columns 4 and 5 are used only if column 3 contains C<y> or C<c>.
#
# Column 4 contains a string, usually C<$&>.
#
# Column 5 contains the expected result of double-quote
# interpolating that string after the match, or start of error message.
#
# Column 6, if present, contains a reason why the test is skipped.
# This is printed with "skipped", for harness to pick up.
#
# Column 7 can be used for comments
#
# \n in the tests are interpolated, as are variables of the form ${\w+}.
#
# Blanks lines are treated as PASSING tests to keep the line numbers
# linked to the test number.
#
# If you want to add a regular expression test that can't be expressed
# in this format, don't add it here: put it in re/pat.t instead.
#
# Note that the inputs get passed on as "m're'", so the re bypasses the lexer.
# This means this file cannot be used for testing anything that the lexer
# handles; in 5.12 this means just \N{NAME} and \N{U+...}.
#
# Note that columns 2,3 and 5 are all enclosed in double quotes and then
# evalled; so something like a\"\x{100}$1 has length 3+length($1).
my ($file, $iters);
BEGIN {
$iters = shift || 1; # Poor man performance suite, 10000 is OK.
# Do this open before any chdir
$file = shift;
if (defined $file) {
open TESTS, $file or die "Can't open $file";
}
chdir 't' if -d 't';
@INC = '../lib';
}
sub _comment {
return map { /^#/ ? "$_\n" : "# $_\n" }
map { split /\n/ } @_;
}
use strict;
use warnings FATAL=>"all";
use vars qw($bang $ffff $nulnul); # used by the tests
use vars qw($qr $skip_amp $qr_embed $qr_embed_thr $regex_sets); # set by our callers
if (!defined $file) {
open TESTS, 're/re_tests' or die "Can't open re/re_tests: $!";
}
my @tests = <TESTS>;
close TESTS;
$bang = sprintf "\\%03o", ord "!"; # \41 would not be portable.
$ffff = chr(0xff) x 2;
$nulnul = "\0" x 2;
my $OP = $qr ? 'qr' : 'm';
$| = 1;
printf "1..%d\n# $iters iterations\n", scalar @tests;
my $test;
TEST:
foreach (@tests) {
$test++;
if (!/\S/ || /^\s*#/ || /^__END__$/) {
print "ok $test # (Blank line or comment)\n";
if (/#/) { print $_ };
next;
}
chomp;
s/\\n/\n/g unless $regex_sets;
my ($pat, $subject, $result, $repl, $expect, $reason) = split(/\t/,$_,6);
if (!defined $subject) {
die "Bad test definition on line $test: $_\n";
}
$reason = '' unless defined $reason;
my $input = join(':',$pat,$subject,$result,$repl,$expect);
# the double '' below keeps simple syntax highlighters from going crazy
$pat = "'$pat'" unless $pat =~ /^[:''\/]/;
$pat =~ s/(\$\{\w+\})/$1/eeg;
$pat =~ s/\\n/\n/g unless $regex_sets;
$subject = eval qq("$subject"); die $@ if $@;
$expect = eval qq("$expect"); die $@ if $@;
$expect = $repl = '-' if $skip_amp and $input =~ /\$[&\`\']/;
my $todo_qr = $qr_embed_thr && ($result =~ s/t//);
my $skip = ($skip_amp ? ($result =~ s/B//i) : ($result =~ s/B//));
++$skip if $result =~ s/M// && !defined &DynaLoader::boot_DynaLoader;
if ($result =~ s/ ( [Ss] ) //x) {
if (($1 eq 'S' && $regex_sets) || ($1 eq 's' && ! $regex_sets)) {
$skip++;
$reason = "Test not valid for $0";
}
}
$reason = 'skipping $&' if $reason eq '' && $skip_amp;
$result =~ s/B//i unless $skip;
my $todo= $result =~ s/T// ? " # TODO" : "";
if (! $skip && $regex_sets) {
# If testing regex sets, change the [bracketed] classes into
# (?[bracketed]).
if ($pat !~ / \[ /x) {
$skip++;
$reason = "Pattern doesn't contain [brackets]";
}
else { # Use non-regex features of Perl to accomplish this.
my $modified = "";
my $in_brackets = 0;
# Go through the pattern character-by-character. We also add
# blanks around each token to test the /x parts of (?[ ])
my $pat_len = length($pat);
CHAR: for (my $i = 0; $i < $pat_len; $i++) {
my $curchar = substr($pat, $i, 1);
if ($curchar eq '\\') {
$modified .= " " if $in_brackets;
$modified .= $curchar;
$i++;
# Get the character the backslash is escaping
$curchar = substr($pat, $i, 1);
$modified .= $curchar;
# If the character following that is a '{}', treat the
# entire amount as a single token
if ($i < $pat_len -1 && substr($pat, $i+1, 1) eq '{') {
my $j = index($pat, '}', $i+2);
if ($j < 0) {
last unless $in_brackets;
if ($result eq 'c') {
$skip++;
$reason = "Can't handle compilation errors with unmatched '{'";
}
else {
print "not ok $test # Problem in $0; original = '$pat'; mod = '$modified'\n";
next TEST;
}
}
$modified .= substr($pat, $i+1, $j - $i);
$i = $j;
}
elsif ($curchar eq 'x') {
# \x without brackets is supposed to be followed by 2
# hex digits. Take up to 2, and then add a blank
# after the last one. This avoids getting errors from
# (?[ ]) for run-ons, like \xabc
my $j = $i + 1;
for (; $j < $i + 3 && $j < $pat_len; $j++) {
my $curord = ord(substr($pat, $j, 1));
if (!(($curord >= ord("A") && $curord <= ord("F"))
|| ($curord >= ord("a") && $curord <= ord("f"))
|| ($curord >= ord("0") && $curord <= ord("9"))))
{
$j++;
last;
}
}
$j--;
$modified .= substr($pat, $i + 1, $j - $i) . " ";
$i = $j;
}
elsif (ord($curchar) >= ord('0')
&& (ord($curchar) <= ord('7')))
{
# Similarly, octal constants have up to 3 digits.
my $j = $i + 1;
for (; $j < $i + 3 && $j < $pat_len; $j++) {
my $curord = ord(substr($pat, $j, 1));
if (! ($curord >= ord("0") && $curord <= ord("7"))) {
$j++;
last;
}
}
$j--;
$modified .= substr($pat, $i + 1, $j - $i);
$i = $j;
}
next;
} # End of processing a backslash sequence
if (! $in_brackets # Skip (?{ })
&& $curchar eq '('
&& $i < $pat_len - 2
&& substr($pat, $i+1, 1) eq '?'
&& substr($pat, $i+2, 1) eq '{')
{
$skip++;
$reason = "Pattern contains '(?{'";
last;
}
# Closing ']'
if ($curchar eq ']' && $in_brackets) {
$modified .= " ] ])";
$in_brackets = 0;
next;
}
# A regular character.
if ($curchar ne '[') {
if (! $in_brackets) {
$modified .= $curchar;
}
else {
$modified .= " $curchar ";
}
next;
}
# Here is a '['; If not in a bracketed class, treat as the
# beginning of one.
if (! $in_brackets) {
$in_brackets = 1;
$modified .= "(?[ [ ";
# An immediately following ']' or '^]' is not the ending
# of the class, but is to be treated literally.
if ($i < $pat_len - 1
&& substr($pat, $i+1, 1) eq ']')
{
$i ++;
$modified .= " ] ";
}
elsif ($i < $pat_len - 2
&& substr($pat, $i+1, 1) eq '^'
&& substr($pat, $i+2, 1) eq ']')
{
$i += 2;
$modified .= " ^ ] ";
}
next;
}
# Here is a plain '[' within [ ]. Could mean wants to
# match a '[', or it could be a posix class that has a
# corresponding ']'. Absorb either
$modified .= ' [';
last if $i >= $pat_len - 1;
$i++;
$curchar = substr($pat, $i, 1);
if ($curchar =~ /[:=.]/) {
for (my $j = $i + 1; $j < $pat_len; $j++) {
next unless substr($pat, $j, 1) eq ']';
last if $j - $i < 2;
if (substr($pat, $j - 1, 1) eq $curchar) {
# Here, is a posix class
$modified .= substr($pat, $i, $j - $i + 1) . " ";
$i = $j;
next CHAR;
}
}
}
# Here wasn't a posix class, just process normally
$modified .= " $curchar ";
}
if ($in_brackets && ! $skip) {
if ($result eq 'c') {
$skip++;
$reason = "Can't figure out where to put the (?[ and ]) since is a compilation error";
}
else {
print "not ok $test # Problem in $0; original = '$pat'; mod = '$modified'\n";
next TEST;
}
}
# Use our modified pattern instead of the original
$pat = $modified;
}
}
for my $study ('', 'study $subject', 'utf8::upgrade($subject)',
'utf8::upgrade($subject); study $subject') {
# Need to make a copy, else the utf8::upgrade of an already studied
# scalar confuses things.
my $subject = $subject;
my $c = $iters;
my ($code, $match, $got);
if ($repl eq 'pos') {
$code= <<EOFCODE;
$study;
pos(\$subject)=0;
\$match = ( \$subject =~ m${pat}g );
\$got = pos(\$subject);
EOFCODE
}
elsif ($qr_embed) {
$code= <<EOFCODE;
my \$RE = qr$pat;
$study;
\$match = (\$subject =~ /(?:)\$RE(?:)/) while \$c--;
\$got = "$repl";
EOFCODE
}
elsif ($qr_embed_thr) {
$code= <<EOFCODE;
# Can't run the match in a subthread, but can do this and
# clone the pattern the other way.
my \$RE = threads->new(sub {qr$pat})->join();
$study;
\$match = (\$subject =~ /(?:)\$RE(?:)/) while \$c--;
\$got = "$repl";
EOFCODE
}
else {
$code= <<EOFCODE;
$study;
\$match = (\$subject =~ $OP$pat) while \$c--;
\$got = "$repl";
EOFCODE
}
$code = "no warnings 'experimental::regex_sets';$code" if $regex_sets;
#$code.=qq[\n\$expect="$expect";\n];
#use Devel::Peek;
#die Dump($code) if $pat=~/\\h/ and $subject=~/\x{A0}/;
{
# Probably we should annotate specific tests with which warnings
# categories they're known to trigger, and hence should be
# disabled just for that test
no warnings qw(uninitialized regexp);
eval $code;
}
chomp( my $err = $@ );
if ( $skip ) {
print "ok $test # skipped", length($reason) ? ". $reason" : '', "\n";
next TEST;
}
elsif ($result eq 'c') {
if ($err !~ m!^\Q$expect!) { print "not ok $test$todo (compile) $input => '$err'\n"; next TEST }
last; # no need to study a syntax error
}
elsif ( $todo_qr ) {
print "not ok $test # TODO", length($reason) ? " - $reason" : '', "\n";
next TEST;
}
elsif ($@) {
print "not ok $test$todo $input => error '$err'\n", _comment("$code\n$@\n"); next TEST;
}
elsif ($result =~ /^n/) {
if ($match) { print "not ok $test$todo ($study) $input => false positive\n"; next TEST }
}
else {
if (!$match || $got ne $expect) {
eval { require Data::Dumper };
no warnings "utf8"; # But handle should be utf8
if ($@ || !defined &DynaLoader::boot_DynaLoader) {
# Data::Dumper will load on miniperl, but fail when used in
# anger as it tries to load B. I'd prefer to keep the
# regular calls below outside of an eval so that real
# (unknown) failures get spotted, not ignored.
print "not ok $test$todo ($study) $input => '$got', match=$match\n", _comment("$code\n");
}
else { # better diagnostics
my $s = Data::Dumper->new([$subject],['subject'])->Useqq(1)->Dump;
my $g = Data::Dumper->new([$got],['got'])->Useqq(1)->Dump;
print "not ok $test$todo ($study) $input => '$got', match=$match\n", _comment("$s\n$g\n$code\n");
}
next TEST;
}
}
}
print "ok $test$todo\n";
}
1;
|