3 # This file has been placed in t/opbasic to indicate that it should not use
4 # functions imported from t/test.pl or Test::More, as those programs/libraries
5 # use operators which are what is being tested in this file.
7 # 2s complement assumption. Will not break test, just makes the internals of
8 # the SVs less interesting if were not on 2s complement system.
10 my $uv_maxm1 = ~0 ^ 1;
12 $uv_big = ($uv_big - 20000) | 1;
13 my ($iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big, $iv_small);
14 $iv_max = $uv_max; # Do copy, *then* divide
24 $iv_big = $iv_max - 3;
25 $iv_small = $iv_min + 2;
27 my $uv_bigi = $iv_big;
30 my @array = qw(perl rules);
32 my @raw, @upgraded, @utf8;
33 foreach ("\0", "\x{1F4A9}", chr(163), 'N') {
35 my $temp = $_ . chr 256;
37 push @upgraded, $temp;
39 next if utf8::upgrade($utf8) == length $_;
44 # Seems one needs to perform the maths on 'Inf' to get the NV correctly primed.
45 @FOO = ('s', 'N/A', 'a', 'NaN', -1, undef, 0, 1, 3.14, 1e37, 0.632120558, -.5,
46 'Inf'+1, '-Inf'-1, 0x0, 0x1, 0x5, 0xFFFFFFFF, $uv_max, $uv_maxm1,
47 $uv_big, $uv_bigi, $iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big,
48 $iv_small, \$array[0], \$array[0], \$array[1], \$^X, @raw, @upgraded,
51 $expect = 7 * ($#FOO+2) * ($#FOO+1) + 6 * @raw + 6 * @utf8;
57 # gcc -ffast-math option may stop NaNs working correctly
59 my $ccflags = $Config{ccflags} // '';
60 $bad_NaN = 1 if $ccflags =~ /-ffast-math\b/;
64 my ($test, $left, $threeway, $right, $result, $i, $j, $boolean) = @_;
65 $result = defined $result ? "'$result'" : 'undef';
66 if ($bad_NaN && ($left eq 'NaN' || $right eq 'NaN')) {
67 print "ok $test # skipping failed NaN test under -ffast-math\n";
70 print "not ok $test # ($left $threeway $right) gives: $result \$i=$i \$j=$j, $boolean disagrees\n";
75 for my $i (0..$#FOO) {
76 for my $j ($i..$#FOO) {
78 # Comparison routines may convert these internally, which would change
79 # what is used to determine the comparison on later runs. Hence copy
80 my ($i1, $i2, $i3, $i4, $i5, $i6, $i7, $i8, $i9, $i10,
81 $i11, $i12, $i13, $i14, $i15, $i16, $i17) =
82 ($FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
83 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
84 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i]);
85 my ($j1, $j2, $j3, $j4, $j5, $j6, $j7, $j8, $j9, $j10,
86 $j11, $j12, $j13, $j14, $j15, $j16, $j17) =
87 ($FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
88 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
89 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j]);
90 my $cmp = $i1 <=> $j1;
91 if (!defined($cmp) ? !($i2 < $j2)
92 : ($cmp == -1 && $i2 < $j2 ||
93 $cmp == 0 && !($i2 < $j2) ||
94 $cmp == 1 && !($i2 < $j2)))
99 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<');
102 if (!defined($cmp) ? !($i4 == $j4)
103 : ($cmp == -1 && !($i4 == $j4) ||
104 $cmp == 0 && $i4 == $j4 ||
105 $cmp == 1 && !($i4 == $j4)))
110 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '==');
113 if (!defined($cmp) ? !($i5 > $j5)
114 : ($cmp == -1 && !($i5 > $j5) ||
115 $cmp == 0 && !($i5 > $j5) ||
116 $cmp == 1 && ($i5 > $j5)))
121 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>');
124 if (!defined($cmp) ? !($i6 >= $j6)
125 : ($cmp == -1 && !($i6 >= $j6) ||
126 $cmp == 0 && $i6 >= $j6 ||
127 $cmp == 1 && $i6 >= $j6))
132 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>=');
135 # OK, so the docs are wrong it seems. NaN != NaN
136 if (!defined($cmp) ? ($i7 != $j7)
137 : ($cmp == -1 && $i7 != $j7 ||
138 $cmp == 0 && !($i7 != $j7) ||
139 $cmp == 1 && $i7 != $j7))
144 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '!=');
147 if (!defined($cmp) ? !($i8 <= $j8)
148 : ($cmp == -1 && $i8 <= $j8 ||
149 $cmp == 0 && $i8 <= $j8 ||
150 $cmp == 1 && !($i8 <= $j8)))
155 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=');
158 my $pmc = $j16 <=> $i16; # cmp it in reverse
159 # Should give -ve of other answer, or undef for NaNs
160 # a + -a should be zero. not zero is truth. which avoids using ==
161 if (defined($cmp) ? !($cmp + $pmc) : !defined $pmc)
166 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=> transposed');
173 if ($cmp == -1 && $i10 lt $j10 ||
174 $cmp == 0 && !($i10 lt $j10) ||
175 $cmp == 1 && !($i10 lt $j10))
180 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'lt');
183 if ($cmp == -1 && !($i11 eq $j11) ||
184 $cmp == 0 && ($i11 eq $j11) ||
185 $cmp == 1 && !($i11 eq $j11))
190 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'eq');
193 if ($cmp == -1 && !($i12 gt $j12) ||
194 $cmp == 0 && !($i12 gt $j12) ||
195 $cmp == 1 && ($i12 gt $j12))
200 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'gt');
203 if ($cmp == -1 && $i13 le $j13 ||
204 $cmp == 0 && ($i13 le $j13) ||
205 $cmp == 1 && !($i13 le $j13))
210 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'le');
213 if ($cmp == -1 && ($i14 ne $j14) ||
214 $cmp == 0 && !($i14 ne $j14) ||
215 $cmp == 1 && ($i14 ne $j14))
220 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ne');
223 if ($cmp == -1 && !($i15 ge $j15) ||
224 $cmp == 0 && ($i15 ge $j15) ||
225 $cmp == 1 && ($i15 ge $j15))
230 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ge');
233 $pmc = $j17 cmp $i17; # cmp it in reverse
234 # Should give -ve of other answer
235 # a + -a should be zero. not zero is truth. which avoids using ==
241 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'cmp transposed');
246 # We know the answers for these. We can rely on the consistency checks above
247 # to test the other string comparisons.
249 while (my ($i, $v) = each @raw) {
250 # Copy, to avoid any inadvertent conversion
251 my ($raw, $cooked, $not);
253 $cooked = $upgraded[$i];
254 $not = $raw eq $cooked ? '' : 'not ';
255 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
258 $cooked = $upgraded[$i];
259 $not = $raw ne $cooked ? 'not ' : '';
260 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
263 $cooked = $upgraded[$i];
264 $not = (($raw cmp $cooked) == 0) ? '' : 'not ';
265 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
267 # And now, transposed.
269 $cooked = $upgraded[$i];
270 $not = $cooked eq $raw ? '' : 'not ';
271 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
274 $cooked = $upgraded[$i];
275 $not = $cooked ne $raw ? 'not ' : '';
276 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
279 $cooked = $upgraded[$i];
280 $not = (($cooked cmp $raw) == 0) ? '' : 'not ';
281 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
284 while (my ($i, $v) = each @utf8) {
285 # Copy, to avoid any inadvertent conversion
286 my ($raw, $cooked, $not);
289 $not = $raw eq $cooked ? 'not ' : '';
290 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
294 $not = $raw ne $cooked ? '' : 'not ';
295 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
299 $not = (($raw cmp $cooked) == 0) ? 'not ' : '';
300 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;
302 # And now, transposed.
305 $not = $cooked eq $raw ? 'not ' : '';
306 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
310 $not = $cooked ne $raw? '' : 'not ';
311 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
315 $not = (($cooked cmp $raw) == 0) ? 'not ' : '';
316 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;