#!./perl -w
-print "1..130\n";
+BEGIN {
+ chdir 't' if -d 't';
+ @INC = '../lib';
+}
+
+print "1..134\n";
sub try ($$) {
print +($_[1] ? "ok" : "not ok"), " $_[0]\n";
print "not ok $_[0] # $_[1] != $_[2]\n";
}
}
+sub tryeq_sloppy ($$$) {
+ if ($_[1] == $_[2]) {
+ print "ok $_[0]\n";
+ } else {
+ my $error = abs ($_[1] - $_[2]) / $_[1];
+ if ($error < 1e-10) {
+ print "ok $_[0] # $_[1] is close to $_[2], \$^O eq $^O\n";
+ } else {
+ print "not ok $_[0] # $_[1] != $_[2]\n";
+ }
+ }
+}
tryeq 1, 13 % 4, 1;
tryeq 2, -13 % 4, 3;
tryeq 126, -5.5 / -2, 2.75;
# Bluuurg if your floating point can't accurately cope with powers of 2
-tryeq 127, 18446744073709551616/1, 18446744073709551616;
+# [I suspect this is parsing string->float problems, not actual arith]
+tryeq_sloppy 127, 18446744073709551616/1, 18446744073709551616; # Bluuurg
tryeq 128, 18446744073709551616/2, 9223372036854775808;
tryeq 129, 18446744073709551616/4294967296, 4294967296;
tryeq 130, 18446744073709551616/9223372036854775808, 2;
+
+{
+ # The peephole optimiser is wrong to think that it can substitute intops
+ # in place of regular ops, because i_multiply can overflow.
+ # Bug reported by "Sisyphus" <kalinabears@hdc.com.au>
+ my $n = 1127;
+
+ my $float = ($n % 1000) * 167772160.0;
+ tryeq 131, $float, 21307064320;
+
+ # On a 32 bit machine, if the i_multiply op is used, you will probably get
+ # -167772160. It's actually undefined behaviour, so anything may happen.
+ my $int = ($n % 1000) * 167772160;
+ tryeq 132, $int, 21307064320;
+
+ my $t = time;
+ my $t1000 = time() * 1000;
+ try 133, abs($t1000 -1000 * $t) <= 2000;
+}
+
+if ($^O eq 'vos') {
+ print "not ok 134 # TODO VOS raises SIGFPE instead of producing infinity.\n";
+} else {
+ # The computation of $v should overflow and produce "infinity"
+ # on any system whose max exponent is less than 10**1506.
+ # The exact string used to represent infinity varies by OS,
+ # so we don't test for it; all we care is that we don't die.
+ #
+ # Perl considers it to be an error if SIGFPE is raised.
+ # Chances are the interpreter will die, since it doesn't set
+ # up a handler for SIGFPE. That's why this test is last; to
+ # minimize the number of test failures. --PG
+
+ my $n = 5000;
+ my $v = 2;
+ while (--$n)
+ {
+ $v *= 2;
+ }
+ print "ok 134\n";
+}