-#!./perl
+#!./perl -T
BEGIN {
chdir 't' if -d 't';
package main;
$| = 1;
-use Test::More tests => 535;
+BEGIN { require './test.pl' }
+plan tests => 4982;
+use Scalar::Util qw(tainted);
$a = new Oscalar "087";
$b= "$a";
}
is($int, 9);
is($out, 1024);
+is($int, 9);
+{
+ BEGIN { overload::constant 'integer' => sub {$int++; shift()+1}; }
+ eval q{$out = 42};
+}
+is($int, 10);
+is($out, 43);
$foo = 'foo';
$foo1 = 'f\'o\\o';
sub iter { my ($x) = @_; return undef if $$x < 0; return $$x--; }
}
-# XXX iterator overload not intended to work with CORE::GLOBAL?
-if (defined &CORE::GLOBAL::glob) {
- is('1', '1');
- is('1', '1');
- is('1', '1');
-}
-else {
+{
my $iter = iterator->new(5);
my $acc = '';
my $out;
like(overload::StrVal(sub{1}), qr/^CODE\(0x[0-9a-f]+\)$/);
like(overload::StrVal(\*GLOB), qr/^GLOB\(0x[0-9a-f]+\)$/);
like(overload::StrVal(\$o), qr/^REF\(0x[0-9a-f]+\)$/);
- like(overload::StrVal(qr/a/), qr/^Regexp=SCALAR\(0x[0-9a-f]+\)$/);
+ like(overload::StrVal(qr/a/), qr/^Regexp=REGEXP\(0x[0-9a-f]+\)$/);
like(overload::StrVal($o), qr/^perl31793=ARRAY\(0x[0-9a-f]+\)$/);
like(overload::StrVal($of), qr/^perl31793_fb=ARRAY\(0x[0-9a-f]+\)$/);
like(overload::StrVal($no), qr/^no_overload=ARRAY\(0x[0-9a-f]+\)$/);
}
{
+ {
+ package QRonly;
+ use overload qr => sub { qr/x/ }, fallback => 1;
+ }
+ {
+ my $x = bless [], "QRonly";
+
+ # like tries to be too clever, and decides that $x-stringified
+ # doesn't look like a regex
+ ok("x" =~ $x, "qr-only matches");
+ ok("y" !~ $x, "qr-only doesn't match what it shouldn't");
+ ok("xx" =~ /x$x/, "qr-only matches with concat");
+ like("$x", qr/^QRonly=ARRAY/, "qr-only doesn't have string overload");
+
+ my $qr = bless qr/y/, "QRonly";
+ ok("x" =~ $qr, "qr with qr-overload uses overload");
+ ok("y" !~ $qr, "qr with qr-overload uses overload");
+ is("$qr", "".qr/y/, "qr with qr-overload stringify");
+
+ my $rx = $$qr;
+ ok("y" =~ $rx, "bare rx with qr-overload doesn't overload match");
+ ok("x" !~ $rx, "bare rx with qr-overload doesn't overload match");
+ is("$rx", "".qr/y/, "bare rx with qr-overload stringify");
+ }
+ {
+ package QRandSTR;
+ use overload qr => sub { qr/x/ }, q/""/ => sub { "y" };
+ }
+ {
+ my $x = bless [], "QRandSTR";
+ ok("x" =~ $x, "qr+str uses qr for match");
+ ok("y" !~ $x, "qr+str uses qr for match");
+ ok("xx" =~ /x$x/, "qr+str uses qr for match with concat");
+ is("$x", "y", "qr+str uses str for stringify");
+
+ my $qr = bless qr/z/, "QRandSTR";
+ is("$qr", "y", "qr with qr+str uses str for stringify");
+ ok("xx" =~ /x$x/, "qr with qr+str uses qr for match");
+
+ my $rx = $$qr;
+ ok("z" =~ $rx, "bare rx with qr+str doesn't overload match");
+ is("$rx", "".qr/z/, "bare rx with qr+str doesn't overload stringify");
+ }
+ {
+ package QRany;
+ use overload qr => sub { $_[0]->(@_) };
+
+ package QRself;
+ use overload qr => sub { $_[0] };
+ }
+ {
+ my $rx = bless sub { ${ qr/x/ } }, "QRany";
+ ok("x" =~ $rx, "qr overload accepts a bare rx");
+ ok("y" !~ $rx, "qr overload accepts a bare rx");
+
+ my $str = bless sub { "x" }, "QRany";
+ ok(!eval { "x" =~ $str }, "qr overload doesn't accept a string");
+ like($@, qr/^Overloaded qr did not return a REGEXP/, "correct error");
+
+ my $oqr = bless qr/z/, "QRandSTR";
+ my $oqro = bless sub { $oqr }, "QRany";
+ ok("z" =~ $oqro, "qr overload doesn't recurse");
+
+ my $qrs = bless qr/z/, "QRself";
+ ok("z" =~ $qrs, "qr overload can return self");
+ }
+ {
+ package STRonly;
+ use overload q/""/ => sub { "x" };
+
+ package STRonlyFB;
+ use overload q/""/ => sub { "x" }, fallback => 1;
+ }
+ {
+ my $fb = bless [], "STRonlyFB";
+ ok("x" =~ $fb, "qr falls back to \"\"");
+ ok("y" !~ $fb, "qr falls back to \"\"");
+
+ my $nofb = bless [], "STRonly";
+ ok("x" =~ $nofb, "qr falls back even without fallback");
+ ok("y" !~ $nofb, "qr falls back even without fallback");
+ }
+}
+
+{
my $twenty_three = 23;
# Check that constant overloading propagates into evals
BEGIN { overload::constant integer => sub { 23 } }
ok(!$b, "Expect overloaded boolean");
ok(!$a, "Expect overloaded boolean");
}
+
+{
+ package Flrbbbbb;
+ use overload
+ bool => sub { shift->{truth} eq 'yes' },
+ '0+' => sub { shift->{truth} eq 'yes' ? '1' : '0' },
+ '!' => sub { shift->{truth} eq 'no' },
+ fallback => 1;
+
+ sub new { my $class = shift; bless { truth => shift }, $class }
+
+ package main;
+
+ my $yes = Flrbbbbb->new('yes');
+ my $x;
+ $x = 1 if $yes; is($x, 1);
+ $x = 2 unless $yes; is($x, 1);
+ $x = 3 if !$yes; is($x, 1);
+ $x = 4 unless !$yes; is($x, 4);
+
+ my $no = Flrbbbbb->new('no');
+ $x = 0;
+ $x = 1 if $no; is($x, 0);
+ $x = 2 unless $no; is($x, 2);
+ $x = 3 if !$no; is($x, 3);
+ $x = 4 unless !$no; is($x, 3);
+
+ $x = 0;
+ $x = 1 if !$no && $yes; is($x, 1);
+ $x = 2 unless !$no && $yes; is($x, 1);
+ $x = 3 if $no || !$yes; is($x, 1);
+ $x = 4 unless $no || !$yes; is($x, 4);
+
+ $x = 0;
+ $x = 1 if !$no || !$yes; is($x, 1);
+ $x = 2 unless !$no || !$yes; is($x, 1);
+ $x = 3 if !$no && !$yes; is($x, 1);
+ $x = 4 unless !$no && !$yes; is($x, 4);
+}
+
{
use Scalar::Util 'weaken';
$obj = bless do {my $a; \$a}, 'Shklitza';
$ref = $obj;
- is ($obj, "CLiK KLAK");
- is ($ref, "CLiK KLAK");
+ is ("$obj", "CLiK KLAK");
+ is ("$ref", "CLiK KLAK");
weaken $ref;
- is ($ref, "CLiK KLAK");
+ is ("$ref", "CLiK KLAK");
bless $obj, 'Ksshfwoom';
}
{
- # comparison operators with nomethod
+ # comparison operators with nomethod (bug 41546)
my $warning = "";
my $method;
}
{
+ # nomethod called for '!' after attempted fallback
+ my $nomethod_called = 0;
+
+ package nomethod_not;
+ use overload nomethod => sub { $nomethod_called = 'yes'; };
+
+ package main;
+ my $o = bless [], 'nomethod_not';
+ my $res = ! $o;
+
+ is($nomethod_called, 'yes', "nomethod() is called for '!'");
+ is($res, 'yes', "nomethod(..., '!') return value propagates");
+}
+
+{
# Subtle bug pre 5.10, as a side effect of the overloading flag being
# stored on the reference rather than the referent. Despite the fact that
# objects can only be accessed via references (even internally), the
use overload "0+" => sub { $_[0][0]++; $_[0] };
package numify_other;
use overload "0+" => sub { $_[0][0]++; $_[0][1] = bless [], 'numify_int' };
+ package numify_by_fallback;
+ use overload fallback => 1;
package main;
my $o = bless [], 'numify_int';
is($o->[0], 1, 'int() numifies only once');
my $aref = [];
- my $num_val = 0 + $aref;
+ my $num_val = int($aref);
my $r = bless $aref, 'numify_self';
is(int($r), $num_val, 'numifies to self');
is($r->[0], 1, 'int() numifies once when returning self');
is(int($s), 42, 'numifies to numification of other object');
is($s->[0], 1, 'int() numifies once when returning other object');
is($s->[1][0], 1, 'returned object numifies too');
+
+ my $m = bless $aref, 'numify_by_fallback';
+ is(int($m), $num_val, 'numifies to usual reference value');
+ is(abs($m), $num_val, 'numifies to usual reference value');
+ is(-$m, -$num_val, 'numifies to usual reference value');
+ is(0+$m, $num_val, 'numifies to usual reference value');
+ is($m+0, $num_val, 'numifies to usual reference value');
+ is($m+$m, 2*$num_val, 'numifies to usual reference value');
+ is(0-$m, -$num_val, 'numifies to usual reference value');
+ is(1*$m, $num_val, 'numifies to usual reference value');
+ is(int($m/1), $num_val, 'numifies to usual reference value');
+ is($m%100, $num_val%100, 'numifies to usual reference value');
+ is($m**1, $num_val, 'numifies to usual reference value');
+
+ is(abs($aref), $num_val, 'abs() of ref');
+ is(-$aref, -$num_val, 'negative of ref');
+ is(0+$aref, $num_val, 'ref addition');
+ is($aref+0, $num_val, 'ref addition');
+ is($aref+$aref, 2*$num_val, 'ref addition');
+ is(0-$aref, -$num_val, 'subtraction of ref');
+ is(1*$aref, $num_val, 'multiplicaton of ref');
+ is(int($aref/1), $num_val, 'division of ref');
+ is($aref%100, $num_val%100, 'modulo of ref');
+ is($aref**1, $num_val, 'exponentiation of ref');
+}
+
+{
+ package CopyConstructorFallback;
+ use overload
+ '++' => sub { "$_[0]"; $_[0] },
+ fallback => 1;
+ sub new { bless {} => shift }
+
+ package main;
+
+ my $o = CopyConstructorFallback->new;
+ my $x = $o++; # would segfault
+ my $y = ++$o;
+ is($x, $o, "copy constructor falls back to assignment (postinc)");
+ is($y, $o, "copy constructor falls back to assignment (preinc)");
+}
+
+# only scalar 'x' should currently overload
+
+{
+ package REPEAT;
+
+ my ($x,$n, $nm);
+
+ use overload
+ 'x' => sub { $x++; 1 },
+ '0+' => sub { $n++; 1 },
+ 'nomethod' => sub { $nm++; 1 },
+ 'fallback' => 0,
+ ;
+
+ my $s = bless {};
+
+ package main;
+
+ my @a;
+ my $count = 3;
+
+ ($x,$n,$nm) = (0,0,0);
+ @a = ((1,2,$s) x $count);
+ is("$x-$n-$nm", "0-0-0", 'repeat 1');
+
+ ($x,$n,$nm) = (0,0,0);
+ @a = ((1,$s,3) x $count);
+ is("$x-$n-$nm", "0-0-0", 'repeat 2');
+
+ ($x,$n,$nm) = (0,0,0);
+ @a = ((1,2,3) x $s);
+ is("$x-$n-$nm", "0-1-0", 'repeat 3');
+}
+
+
+
+# RT #57012: magic items need to have mg_get() called before testing for
+# overload. Lack of this means that overloaded values returned by eg a
+# tied array didn't call overload methods.
+# We test here both a tied array and scalar, since the implementation of
+# tied arrays (and hashes) is such that in rvalue context, mg_get is
+# called prior to executing the op, while it isn't for a tied scalar.
+# We also check that return values are correctly tainted.
+# We try against two overload packages; one has all expected methods, the
+# other uses only fallback methods.
+
+{
+
+ # @tests holds a list of test cases. Each elem is an array ref with
+ # the following entries:
+ #
+ # * the value that the overload method should return
+ #
+ # * the expression to be evaled. %s is replaced with the
+ # variable being tested ($ta[0], $ts, or $plain)
+ #
+ # * a string listing what functions we expect to be called.
+ # Each method appends its name in parentheses, so "(=)(+)" means
+ # we expect the copy constructor and then the add method to be
+ # called.
+ #
+ # * like above, but what should be called for the fallback-only test
+ # (in this case, nomethod() identifies itself as "(NM:*)" where *
+ # is the op). If this value is undef, fallback tests are skipped.
+ #
+ # * An array ref of expected counts of calls to FETCH/STORE.
+ # The first three values are:
+ # 1. the expected number of FETCHs for a tied array
+ # 2. the expected number of FETCHs for a tied scalar
+ # 3. the expected number of STOREs
+ # If there are a further three elements present, then
+ # these represent the expected counts for the fallback
+ # version of the tests. If absent, they are assumed to
+ # be the same as for the full method test
+ #
+ # * Under the taint version of the tests, whether we expect
+ # the result to be tainted (for example comparison ops
+ # like '==' don't return a tainted value, even if their
+ # args are.
+ my @tests;
+
+ my %subs;
+ my $funcs;
+ my $use_int;
+
+ BEGIN {
+ # A note on what methods to expect to be called, and
+ # how many times FETCH/STORE is called:
+ #
+ # Mutating ops (+=, ++ etc) trigger a copy ('='), since
+ # the code can't distinguish between something that's been copied:
+ # $a = foo->new(0); $b = $a; refcnt($$b) == 2
+ # and overloaded objects stored in ties which will have extra
+ # refcounts due to the tied_obj magic and entries on the tmps
+ # stack when returning from FETCH etc. So we always copy.
+
+ # This accounts for a '=', and an extra STORE.
+ # We also have a FETCH returning the final value from the eval,
+ # plus a FETCH in the overload subs themselves: ($_[0][0])
+ # triggers one. However, tied aggregates have a mechanism to prevent
+ # multiple fetches between STOREs, which means that the tied
+ # hash skips doing a FETCH during '='.
+
+ for (qw(+ - * / % ** << >> & | ^)) {
+ my $op = $_;
+ $op = '%%' if $op eq '%';
+ my $e = "%s $op= 3";
+ $subs{"$_="} = $e;
+ # ARRAY FETCH: initial, sub+=, eval-return,
+ # SCALAR FETCH: initial, sub=, sub+=, eval-return,
+ # STORE: copy, mutator
+ push @tests, [ 18, $e, "(=)($_=)", "(=)(NM:$_=)", [ 3, 4, 2 ], 1 ];
+
+ $subs{$_} =
+ "do { my \$arg = %s; \$_[2] ? (3 $op \$arg) : (\$arg $op 3) }";
+ # ARRAY FETCH: initial
+ # SCALAR FETCH: initial eval-return,
+ push @tests, [ 18, "%s $op 3", "($_)", "(NM:$_)", [ 1, 2, 0 ], 1 ];
+ push @tests, [ 18, "3 $op %s", "($_)", "(NM:$_)", [ 1, 2, 0 ], 1 ];
+ }
+
+ # these use string fallback rather than nomethod
+ for (qw(x .)) {
+ my $op = $_;
+ my $e = "%s $op= 3";
+ $subs{"$_="} = $e;
+ # For normal case:
+ # ARRAY FETCH: initial, sub+=, eval-return,
+ # SCALAR FETCH: initial, sub=, sub+=, eval-return,
+ # STORE: copy, mutator
+ # for fallback, we just stringify, so eval-return and copy skipped
+
+ push @tests, [ 18, $e, "(=)($_=)", '("")',
+ [ 3, 4, 2, 2, 3, 1 ], 1 ];
+
+ $subs{$_} =
+ "do { my \$arg = %s; \$_[2] ? (3 $op \$arg) : (\$arg $op 3) }";
+ # ARRAY FETCH: initial
+ # SCALAR FETCH: initial eval-return,
+ # with fallback, we just stringify, so eval-return skipped,
+ # but an extra FETCH happens in sub"", except for 'x',
+ # which passes a copy of the RV to sub"", avoiding the
+ # second FETCH
+
+ push @tests, [ 18, "%s $op 3", "($_)", '("")',
+ [ 1, 2, 0, 1, ($_ eq '.' ? 2 : 1), 0 ], 1 ];
+ next if $_ eq 'x'; # repeat only overloads on LHS
+ push @tests, [ 18, "3 $op %s", "($_)", '("")',
+ [ 1, 2, 0, 1, 2, 0 ], 1 ];
+ }
+
+ for (qw(++ --)) {
+ my $pre = "$_%s";
+ my $post = "%s$_";
+ $subs{$_} = $pre;
+ push @tests,
+ # ARRAY FETCH: initial, sub+=, eval-return,
+ # SCALAR FETCH: initial, sub=, sub+=, eval-return,
+ # STORE: copy, mutator
+ [ 18, $pre, "(=)($_)(\"\")", "(=)(NM:$_)(\"\")", [ 3, 4, 2 ], 1 ],
+ # ARRAY FETCH: initial, sub+=
+ # SCALAR FETCH: initial, sub=, sub+=
+ # STORE: copy, mutator
+ [ 18, $post, "(=)($_)(\"\")", "(=)(NM:$_)(\"\")", [ 2, 3, 2 ], 1 ];
+ }
+
+ # For the non-mutator ops, we have a initial FETCH,
+ # an extra FETCH within the sub itself for the scalar option,
+ # and no STOREs
+
+ for (qw(< <= > >= == != lt le gt ge eq ne)) {
+ my $e = "%s $_ 3";
+ $subs{$_} = $e;
+ push @tests, [ 3, $e, "($_)", "(NM:$_)", [ 1, 2, 0 ], 0 ];
+ }
+ for (qw(<=> cmp)) {
+ my $e = "%s $_ 3";
+ $subs{$_} = $e;
+ push @tests, [ 3, $e, "($_)", "(NM:$_)", [ 1, 2, 0 ], 1 ];
+ }
+ for (qw(atan2)) {
+ my $e = "$_ %s, 3";
+ $subs{$_} = $e;
+ push @tests, [ 18, $e, "($_)", "(NM:$_)", [ 1, 2, 0 ], 1 ];
+ }
+ for (qw(cos sin exp abs log sqrt int ~)) {
+ my $e = "$_(%s)";
+ $subs{$_} = $e;
+ push @tests, [ 1.23, $e, "($_)",
+ ($_ eq 'int' ? '(0+)' : "(NM:$_)") , [ 1, 2, 0 ], 1 ];
+ }
+ for (qw(!)) {
+ my $e = "$_(%s)";
+ $subs{$_} = $e;
+ push @tests, [ 1.23, $e, "($_)", '(0+)', [ 1, 2, 0 ], 0 ];
+ }
+ for (qw(-)) {
+ my $e = "$_(%s)";
+ $subs{neg} = $e;
+ push @tests, [ 18, $e, '(neg)', '(NM:neg)', [ 1, 2, 0 ], 1 ];
+ }
+ my $e = '(%s) ? 1 : 0';
+ $subs{bool} = $e;
+ push @tests, [ 18, $e, '(bool)', '(0+)', [ 1, 2, 0 ], 0 ];
+
+ # note: this is testing unary qr, not binary =~
+ $subs{qr} = '(qr/%s/)';
+ push @tests, [ "abc", '"abc" =~ (%s)', '(qr)', '("")', [ 1, 2, 0 ], 0 ];
+
+ $e = '"abc" ~~ (%s)';
+ $subs{'~~'} = $e;
+ push @tests, [ "abc", $e, '(~~)', '(NM:~~)', [ 1, 1, 0 ], 0 ];
+
+ $subs{'-X'} = 'do { my $f = (%s);'
+ . '$_[1] eq "r" ? (-r ($f)) :'
+ . '$_[1] eq "e" ? (-e ($f)) :'
+ . '$_[1] eq "f" ? (-f ($f)) :'
+ . '$_[1] eq "l" ? (-l ($f)) :'
+ . '$_[1] eq "t" ? (-t ($f)) :'
+ . '$_[1] eq "T" ? (-T ($f)) : 0;}';
+ # Note - we don't care what these file tests return, as
+ # long as the tied and untied versions return the same value.
+ # The flags below are chosen to test all uses of tryAMAGICftest_MG
+ for (qw(r e f l t T)) {
+ push @tests, [ 'TEST', "-$_ (%s)", '(-X)', '("")', [ 1, 2, 0 ], 0 ];
+ }
+
+ $subs{'${}'} = '%s';
+ push @tests, [ do {my $s=99; \$s}, '${%s}', '(${})', undef, [ 1, 1, 0 ], 0 ];
+
+ # we skip testing '@{}' here because too much of this test
+ # framework involves array dereferences!
+
+ $subs{'%{}'} = '%s';
+ push @tests, [ {qw(a 1 b 2 c 3)}, 'join "", sort keys %%{%s}',
+ '(%{})', undef, [ 1, 2, 0 ], 0 ];
+
+ $subs{'&{}'} = '%s';
+ push @tests, [ sub {99}, 'do {&{%s} for 1,2}',
+ '(&{})(&{})', undef, [ 2, 2, 0 ], 0 ];
+
+ our $RT57012A = 88;
+ our $RT57012B;
+ $subs{'*{}'} = '%s';
+ push @tests, [ \*RT57012A, '*RT57012B = *{%s}; our $RT57012B',
+ '(*{})', undef, [ 1, 1, 0 ], 0 ];
+
+ my $iter_text = ("some random text\n" x 100) . $^X;
+ open my $iter_fh, '<', \$iter_text
+ or die "open of \$iter_text gave ($!)\n";
+ $subs{'<>'} = '<$iter_fh>';
+ push @tests, [ $iter_fh, '<%s>', '(<>)', undef, [ 1, 1, 0 ], 1 ];
+
+ # eval should do tie, overload on its arg before checking taint */
+ push @tests, [ '1;', 'eval q(eval %s); $@ =~ /Insecure/',
+ '("")', '("")', [ 1, 2, 0 ], 0 ];
+
+
+ for my $sub (keys %subs) {
+ my $term = $subs{$sub};
+ my $t = sprintf $term, '$_[0][0]';
+ my $e ="sub { \$funcs .= '($sub)'; my \$r; if (\$use_int) {"
+ . "use integer; \$r = ($t) } else { \$r = ($t) } \$r }";
+ $subs{$sub} = eval $e;
+ die "Compiling sub gave error:\n<$e>\n<$@>\n" if $@;
+ }
+ }
+
+ my $fetches;
+ my $stores;
+
+ package RT57012_OV;
+
+ use overload
+ %subs,
+ "=" => sub { $funcs .= '(=)'; bless [ $_[0][0] ] },
+ '0+' => sub { $funcs .= '(0+)'; 0 + $_[0][0] },
+ '""' => sub { $funcs .= '("")'; "$_[0][0]" },
+ ;
+
+ package RT57012_OV_FB; # only contains fallback conversion functions
+
+ use overload
+ "=" => sub { $funcs .= '(=)'; bless [ $_[0][0] ] },
+ '0+' => sub { $funcs .= '(0+)'; 0 + $_[0][0] },
+ '""' => sub { $funcs .= '("")'; "$_[0][0]" },
+ "nomethod" => sub {
+ $funcs .= "(NM:$_[3])";
+ my $e = defined($_[1])
+ ? $_[3] eq 'atan2'
+ ? $_[2]
+ ? "atan2(\$_[1],\$_[0][0])"
+ : "atan2(\$_[0][0],\$_[1])"
+ : $_[2]
+ ? "\$_[1] $_[3] \$_[0][0]"
+ : "\$_[0][0] $_[3] \$_[1]"
+ : $_[3] eq 'neg'
+ ? "-\$_[0][0]"
+ : "$_[3](\$_[0][0])";
+ my $r;
+ if ($use_int) {
+ use integer; $r = eval $e;
+ }
+ else {
+ $r = eval $e;
+ }
+ ::diag("eval of nomethod <$e> gave <$@>") if $@;
+ $r;
+ }
+
+ ;
+
+ package RT57012_TIE_S;
+
+ my $tie_val;
+ sub TIESCALAR { bless [ bless [ $tie_val ], $_[1] ] }
+ sub FETCH { $fetches++; $_[0][0] }
+ sub STORE { $stores++; $_[0][0] = $_[1] }
+
+ package RT57012_TIE_A;
+
+ sub TIEARRAY { bless [] }
+ sub FETCH { $fetches++; $_[0][0] }
+ sub STORE { $stores++; $_[0][$_[1]] = $_[2] }
+
+ package main;
+
+ for my $test (@tests) {
+ my ($val, $sub_term, $exp_funcs, $exp_fb_funcs,
+ $exp_counts, $exp_taint) = @$test;
+
+ my $tainted_val;
+ {
+ # create tainted version of $val (unless its a ref)
+ my $t = substr($^X,0,0);
+ my $t0 = $t."0";
+ my $val1 = $val; # use a copy to avoid stringifying original
+ $tainted_val = ref($val1) ? $val :
+ ($val1 =~ /^[\d\.]+$/) ? $val+$t0 : $val.$t;
+ }
+ $tie_val = $tainted_val;
+
+ for my $int ('', 'use integer; ') {
+ $use_int = ($int ne '');
+ my $plain = $tainted_val;
+ my $plain_term = $int . sprintf $sub_term, '$plain';
+ my $exp = eval $plain_term;
+ diag("eval of plain_term <$plain_term> gave <$@>") if $@;
+ is(tainted($exp), $exp_taint,
+ "<$plain_term> taint of expected return");
+
+ for my $ov_pkg (qw(RT57012_OV RT57012_OV_FB)) {
+ next if $ov_pkg eq 'RT57012_OV_FB'
+ and not defined $exp_fb_funcs;
+ my ($exp_fetch_a, $exp_fetch_s, $exp_store) =
+ ($ov_pkg eq 'RT57012_OV' || @$exp_counts < 4)
+ ? @$exp_counts[0,1,2]
+ : @$exp_counts[3,4,5];
+
+ tie my $ts, 'RT57012_TIE_S', $ov_pkg;
+ tie my @ta, 'RT57012_TIE_A';
+ $ta[0] = bless [ $tainted_val ], $ov_pkg;
+ my $oload = bless [ $tainted_val ], $ov_pkg;
+
+ for my $var ('$ta[0]', '$ts', '$oload',
+ ($sub_term eq '<%s>' ? '${ts}' : ())
+ ) {
+
+ $funcs = '';
+ $fetches = 0;
+ $stores = 0;
+
+ my $res_term = $int . sprintf $sub_term, $var;
+ my $desc = "<$res_term> $ov_pkg" ;
+ my $res = eval $res_term;
+ diag("eval of res_term $desc gave <$@>") if $@;
+ # uniquely, the inc/dec ops return the original
+ # ref rather than a copy, so stringify it to
+ # find out if its tainted
+ $res = "$res" if $res_term =~ /\+\+|--/;
+ is(tainted($res), $exp_taint,
+ "$desc taint of result return");
+ is($res, $exp, "$desc return value");
+ my $fns =($ov_pkg eq 'RT57012_OV_FB')
+ ? $exp_fb_funcs : $exp_funcs;
+ if ($var eq '$oload' && $res_term !~ /oload(\+\+|--)/) {
+ # non-tied overloading doesn't trigger a copy
+ # except for post inc/dec
+ $fns =~ s/^\(=\)//;
+ }
+ is($funcs, $fns, "$desc methods called");
+ next if $var eq '$oload';
+ my $exp_fetch = ($var eq '$ts') ?
+ $exp_fetch_s : $exp_fetch_a;
+ is($fetches, $exp_fetch, "$desc FETCH count");
+ is($stores, $exp_store, "$desc STORE count");
+
+ }
+
+ }
+ }
+ }
+}
+
+# Test overload from the main package
+fresh_perl_is
+ '$^W = 1; use overload q\""\ => sub {"ning"}; print bless []',
+ 'ning',
+ { switches => ['-wl'], stderr => 1 },
+ 'use overload from the main package'
+;
+
+{
+ package blessed_methods;
+ use overload '+' => sub {};
+ bless overload::Method __PACKAGE__,'+';
+ eval { overload::Method __PACKAGE__,'+' };
+ ::is($@, '', 'overload::Method and blessed overload methods');
+}
+
+{
+ # fallback to 'cmp' and '<=>' with heterogeneous operands
+ # [perl #71286]
+ my $not_found = 'no method found';
+ my $used = 0;
+ package CmpBase;
+ sub new {
+ my $n = $_[1] || 0;
+ bless \$n, ref $_[0] || $_[0];
+ }
+ sub cmp {
+ $used = \$_[0];
+ (${$_[0]} <=> ${$_[1]}) * ($_[2] ? -1 : 1);
+ }
+
+ package NCmp;
+ use base 'CmpBase';
+ use overload '<=>' => 'cmp';
+
+ package SCmp;
+ use base 'CmpBase';
+ use overload 'cmp' => 'cmp';
+
+ package main;
+ my $n = NCmp->new(5);
+ my $s = SCmp->new(3);
+ my $res;
+
+ eval { $res = $n > $s; };
+ $res = $not_found if $@ =~ /$not_found/;
+ is($res, 1, 'A>B using A<=> when B overloaded, no B<=>');
+
+ eval { $res = $s < $n; };
+ $res = $not_found if $@ =~ /$not_found/;
+ is($res, 1, 'A<B using B<=> when A overloaded, no A<=>');
+
+ eval { $res = $s lt $n; };
+ $res = $not_found if $@ =~ /$not_found/;
+ is($res, 1, 'A lt B using A:cmp when B overloaded, no B:cmp');
+
+ eval { $res = $n gt $s; };
+ $res = $not_found if $@ =~ /$not_found/;
+ is($res, 1, 'A gt B using B:cmp when A overloaded, no A:cmp');
+
+ my $o = NCmp->new(9);
+ $res = $n < $o;
+ is($used, \$n, 'A < B uses <=> from A in preference to B');
+
+ my $t = SCmp->new(7);
+ $res = $s lt $t;
+ is($used, \$s, 'A lt B uses cmp from A in preference to B');
}
+
+{
+ # Combinatorial testing of 'fallback' and 'nomethod'
+ # [perl #71286]
+ package NuMB;
+ use overload '0+' => sub { ${$_[0]}; },
+ '""' => 'str';
+ sub new {
+ my $self = shift;
+ my $n = @_ ? shift : 0;
+ bless my $obj = \$n, ref $self || $self;
+ }
+ sub str {
+ no strict qw/refs/;
+ my $s = "(${$_[0]} ";
+ $s .= "nomethod, " if defined ${ref($_[0]).'::(nomethod'};
+ my $fb = ${ref($_[0]).'::()'};
+ $s .= "fb=" . (defined $fb ? 0 + $fb : 'undef') . ")";
+ }
+ sub nomethod { "${$_[0]}.nomethod"; }
+
+ # create classes for tests
+ package main;
+ my @falls = (0, 'undef', 1);
+ my @nomethods = ('', 'nomethod');
+ my $not_found = 'no method found';
+ for my $fall (@falls) {
+ for my $nomethod (@nomethods) {
+ my $nomethod_decl = $nomethod
+ ? $nomethod . "=>'nomethod'," : '';
+ eval qq{
+ package NuMB$fall$nomethod;
+ use base qw/NuMB/;
+ use overload $nomethod_decl
+ fallback => $fall;
+ };
+ }
+ }
+
+ # operation and precedence of 'fallback' and 'nomethod'
+ # for all combinations with 2 overloaded operands
+ for my $nomethod2 (@nomethods) {
+ for my $nomethod1 (@nomethods) {
+ for my $fall2 (@falls) {
+ my $pack2 = "NuMB$fall2$nomethod2";
+ for my $fall1 (@falls) {
+ my $pack1 = "NuMB$fall1$nomethod1";
+ my ($test, $out, $exp);
+ eval qq{
+ my \$x = $pack1->new(2);
+ my \$y = $pack2->new(3);
+ \$test = "\$x" . ' * ' . "\$y";
+ \$out = \$x * \$y;
+ };
+ $out = $not_found if $@ =~ /$not_found/;
+ $exp = $nomethod1 ? '2.nomethod' :
+ $nomethod2 ? '3.nomethod' :
+ $fall1 eq '1' && $fall2 eq '1' ? 6
+ : $not_found;
+ is($out, $exp, "$test --> $exp");
+ }
+ }
+ }
+ }
+
+ # operation of 'fallback' and 'nomethod'
+ # where the other operand is not overloaded
+ for my $nomethod (@nomethods) {
+ for my $fall (@falls) {
+ my ($test, $out, $exp);
+ eval qq{
+ my \$x = NuMB$fall$nomethod->new(2);
+ \$test = "\$x" . ' * 3';
+ \$out = \$x * 3;
+ };
+ $out = $not_found if $@ =~ /$not_found/;
+ $exp = $nomethod ? '2.nomethod' :
+ $fall eq '1' ? 6
+ : $not_found;
+ is($out, $exp, "$test --> $exp");
+
+ eval qq{
+ my \$x = NuMB$fall$nomethod->new(2);
+ \$test = '3 * ' . "\$x";
+ \$out = 3 * \$x;
+ };
+ $out = $not_found if $@ =~ /$not_found/;
+ is($out, $exp, "$test --> $exp");
+ }
+ }
+}
+
+# since 5.6 overloaded <> was leaving an extra arg on the stack!
+
+{
+ package Iter1;
+ use overload '<>' => sub { 11 };
+ package main;
+ my $a = bless [], 'Iter1';
+ my $x;
+ my @a = (10, ($x = <$a>), 12);
+ is ($a[0], 10, 'Iter1: a[0]');
+ is ($a[1], 11, 'Iter1: a[1]');
+ is ($a[2], 12, 'Iter1: a[2]');
+ @a = (10, ($x .= <$a>), 12);
+ is ($a[0], 10, 'Iter1: a[0] concat');
+ is ($a[1], 1111, 'Iter1: a[1] concat');
+ is ($a[2], 12, 'Iter1: a[2] concat');
+}
+
+# Some tests for error messages
+{
+ package Justus;
+ use overload '+' => 'justice';
+ eval {bless[]};
+ ::like $@, qr/^Can't resolve method "justice" overloading "\+" in p(?x:
+ )ackage "overload" at /,
+ 'Error message when explicitly named overload method does not exist';
+
+ package JustUs;
+ our @ISA = 'JustYou';
+ package JustYou { use overload '+' => 'injustice'; }
+ "JustUs"->${\"(+"};
+ eval {bless []};
+ ::like $@, qr/^Stub found while resolving method "\?{3}" overloadin(?x:
+ )g "\+" in package "overload" at /,
+ 'Error message when sub stub is encountered';
+}
+
+# EOF
https://perl5.git.perl.org / perl5.git / blobdiff