8 # 2s complement assumption. Won't break test, just makes the internals of
9 # the SVs less interesting if were not on 2s complement system.
11 my $uv_maxm1 = ~0 ^ 1;
13 $uv_big = ($uv_big - 20000) | 1;
14 my ($iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big, $iv_small);
15 $iv_max = $uv_max; # Do copy, *then* divide
25 $iv_big = $iv_max - 3;
26 $iv_small = $iv_min + 2;
28 my $uv_bigi = $iv_big;
31 my @array = qw(perl rules);
33 my @raw, @upgraded, @utf8;
34 foreach ("\x{1F4A9}", chr(163), 'N') {
36 my $temp = $_ . chr 256;
38 push @upgraded, $temp;
40 next if utf8::upgrade($utf8) == length $_;
45 # Seems one needs to perform the maths on 'Inf' to get the NV correctly primed.
46 @FOO = ('s', 'N/A', 'a', 'NaN', -1, undef, 0, 1, 3.14, 1e37, 0.632120558, -.5,
47 'Inf'+1, '-Inf'-1, 0x0, 0x1, 0x5, 0xFFFFFFFF, $uv_max, $uv_maxm1,
48 $uv_big, $uv_bigi, $iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big,
49 $iv_small, \$array[0], \$array[0], \$array[1], \$^X, @raw, @upgraded,
52 $expect = 7 * ($#FOO+2) * ($#FOO+1) + 6 * @raw + 6 * @utf8;
58 # gcc's -ffast-math option may stop NaNs working correctly
60 my $ccflags = $Config{ccflags} // '';
61 $bad_NaN = 1 if $ccflags =~ /-ffast-math\b/;
65 my ($test, $left, $threeway, $right, $result, $i, $j, $boolean) = @_;
66 $result = defined $result ? "'$result'" : 'undef';
67 if ($bad_NaN && ($left eq 'NaN' || $right eq 'NaN')) {
68 print "ok $test # skipping failed NaN test under -ffast-math\n";
71 print "not ok $test # ($left $threeway $right) gives: $result \$i=$i \$j=$j, $boolean disagrees\n";
76 for my $i (0..$#FOO) {
77 for my $j ($i..$#FOO) {
79 # Comparison routines may convert these internally, which would change
80 # what is used to determine the comparison on later runs. Hence copy
81 my ($i1, $i2, $i3, $i4, $i5, $i6, $i7, $i8, $i9, $i10,
82 $i11, $i12, $i13, $i14, $i15, $i16, $i17) =
83 ($FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
84 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
85 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i]);
86 my ($j1, $j2, $j3, $j4, $j5, $j6, $j7, $j8, $j9, $j10,
87 $j11, $j12, $j13, $j14, $j15, $j16, $j17) =
88 ($FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
89 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
90 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j]);
91 my $cmp = $i1 <=> $j1;
92 if (!defined($cmp) ? !($i2 < $j2)
93 : ($cmp == -1 && $i2 < $j2 ||
94 $cmp == 0 && !($i2 < $j2) ||
95 $cmp == 1 && !($i2 < $j2)))
100 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<');
103 if (!defined($cmp) ? !($i4 == $j4)
104 : ($cmp == -1 && !($i4 == $j4) ||
105 $cmp == 0 && $i4 == $j4 ||
106 $cmp == 1 && !($i4 == $j4)))
111 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '==');
114 if (!defined($cmp) ? !($i5 > $j5)
115 : ($cmp == -1 && !($i5 > $j5) ||
116 $cmp == 0 && !($i5 > $j5) ||
117 $cmp == 1 && ($i5 > $j5)))
122 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>');
125 if (!defined($cmp) ? !($i6 >= $j6)
126 : ($cmp == -1 && !($i6 >= $j6) ||
127 $cmp == 0 && $i6 >= $j6 ||
128 $cmp == 1 && $i6 >= $j6))
133 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>=');
136 # OK, so the docs are wrong it seems. NaN != NaN
137 if (!defined($cmp) ? ($i7 != $j7)
138 : ($cmp == -1 && $i7 != $j7 ||
139 $cmp == 0 && !($i7 != $j7) ||
140 $cmp == 1 && $i7 != $j7))
145 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '!=');
148 if (!defined($cmp) ? !($i8 <= $j8)
149 : ($cmp == -1 && $i8 <= $j8 ||
150 $cmp == 0 && $i8 <= $j8 ||
151 $cmp == 1 && !($i8 <= $j8)))
156 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=');
159 my $pmc = $j16 <=> $i16; # cmp it in reverse
160 # Should give -ve of other answer, or undef for NaNs
161 # a + -a should be zero. not zero is truth. which avoids using ==
162 if (defined($cmp) ? !($cmp + $pmc) : !defined $pmc)
167 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=> transposed');
174 if ($cmp == -1 && $i10 lt $j10 ||
175 $cmp == 0 && !($i10 lt $j10) ||
176 $cmp == 1 && !($i10 lt $j10))
181 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'lt');
184 if ($cmp == -1 && !($i11 eq $j11) ||
185 $cmp == 0 && ($i11 eq $j11) ||
186 $cmp == 1 && !($i11 eq $j11))
191 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'eq');
194 if ($cmp == -1 && !($i12 gt $j12) ||
195 $cmp == 0 && !($i12 gt $j12) ||
196 $cmp == 1 && ($i12 gt $j12))
201 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'gt');
204 if ($cmp == -1 && $i13 le $j13 ||
205 $cmp == 0 && ($i13 le $j13) ||
206 $cmp == 1 && !($i13 le $j13))
211 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'le');
214 if ($cmp == -1 && ($i14 ne $j14) ||
215 $cmp == 0 && !($i14 ne $j14) ||
216 $cmp == 1 && ($i14 ne $j14))
221 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ne');
224 if ($cmp == -1 && !($i15 ge $j15) ||
225 $cmp == 0 && ($i15 ge $j15) ||
226 $cmp == 1 && ($i15 ge $j15))
231 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ge');
234 $pmc = $j17 cmp $i17; # cmp it in reverse
235 # Should give -ve of other answer
236 # a + -a should be zero. not zero is truth. which avoids using ==
242 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'cmp transposed');
247 # We know the answers for these. We can rely on the consistency checks above
248 # to test the other string comparisons.
250 while (my ($i, $v) = each @raw) {
251 # Copy, to avoid any inadvertent conversion
252 my ($raw, $cooked, $not);
254 $cooked = $upgraded[$i];
255 $not = $raw eq $cooked ? '' : 'not ';
256 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
259 $cooked = $upgraded[$i];
260 $not = $raw ne $cooked ? 'not ' : '';
261 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
264 $cooked = $upgraded[$i];
265 $not = (($raw cmp $cooked) == 0) ? '' : 'not ';
266 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
268 # And now, transposed.
270 $cooked = $upgraded[$i];
271 $not = $cooked eq $raw ? '' : 'not ';
272 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
275 $cooked = $upgraded[$i];
276 $not = $cooked ne $raw ? 'not ' : '';
277 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
280 $cooked = $upgraded[$i];
281 $not = (($cooked cmp $raw) == 0) ? '' : 'not ';
282 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
285 while (my ($i, $v) = each @utf8) {
286 # Copy, to avoid any inadvertent conversion
287 my ($raw, $cooked, $not);
290 $not = $raw eq $cooked ? 'not ' : '';
291 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
295 $not = $raw ne $cooked ? '' : 'not ';
296 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
300 $not = (($raw cmp $cooked) == 0) ? 'not ' : '';
301 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;
303 # And now, transposed.
306 $not = $cooked eq $raw ? 'not ' : '';
307 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
311 $not = $cooked ne $raw? '' : 'not ';
312 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
316 $not = (($cooked cmp $raw) == 0) ? 'not ' : '';
317 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;