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 # Seems one needs to perform the maths on 'Inf' to get the NV correctly primed.
32 @FOO = ('s', 'N/A', 'a', 'NaN', -1, undef, 0, 1, 3.14, 1e37, 0.632120558, -.5,
33 'Inf'+1, '-Inf'-1, 0x0, 0x1, 0x5, 0xFFFFFFFF, $uv_max, $uv_maxm1,
34 $uv_big, $uv_bigi, $iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big,
37 $expect = 6 * ($#FOO+2) * ($#FOO+1);
41 for my $i (0..$#FOO) {
42 for my $j ($i..$#FOO) {
44 # Comparison routines may convert these internally, which would change
45 # what is used to determine the comparison on later runs. Hence copy
46 my ($i1, $i2, $i3, $i4, $i5, $i6, $i7, $i8, $i9, $i10,
47 $i11, $i12, $i13, $i14, $i15) =
48 ($FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
49 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
50 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i]);
51 my ($j1, $j2, $j3, $j4, $j5, $j6, $j7, $j8, $j9, $j10,
52 $j11, $j12, $j13, $j14, $j15) =
53 ($FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
54 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
55 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j]);
56 my $cmp = $i1 <=> $j1;
57 if (!defined($cmp) ? !($i2 < $j2)
58 : ($cmp == -1 && $i2 < $j2 ||
59 $cmp == 0 && !($i2 < $j2) ||
60 $cmp == 1 && !($i2 < $j2)))
65 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, < disagrees\n";
68 if (!defined($cmp) ? !($i4 == $j4)
69 : ($cmp == -1 && !($i4 == $j4) ||
70 $cmp == 0 && $i4 == $j4 ||
71 $cmp == 1 && !($i4 == $j4)))
76 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, == disagrees\n";
79 if (!defined($cmp) ? !($i5 > $j5)
80 : ($cmp == -1 && !($i5 > $j5) ||
81 $cmp == 0 && !($i5 > $j5) ||
82 $cmp == 1 && ($i5 > $j5)))
87 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, > disagrees\n";
90 if (!defined($cmp) ? !($i6 >= $j6)
91 : ($cmp == -1 && !($i6 >= $j6) ||
92 $cmp == 0 && $i6 >= $j6 ||
93 $cmp == 1 && $i6 >= $j6))
98 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, >= disagrees\n";
101 # OK, so the docs are wrong it seems. NaN != NaN
102 if (!defined($cmp) ? ($i7 != $j7)
103 : ($cmp == -1 && $i7 != $j7 ||
104 $cmp == 0 && !($i7 != $j7) ||
105 $cmp == 1 && $i7 != $j7))
110 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, != disagrees\n";
113 if (!defined($cmp) ? !($i8 <= $j8)
114 : ($cmp == -1 && $i8 <= $j8 ||
115 $cmp == 0 && $i8 <= $j8 ||
116 $cmp == 1 && !($i8 <= $j8)))
121 print "not ok $ok # ($i3 <=> $j3) gives: '$cmp' \$i=$i \$j=$j, <= disagrees\n";
125 if ($cmp == -1 && $i10 lt $j10 ||
126 $cmp == 0 && !($i10 lt $j10) ||
127 $cmp == 1 && !($i10 lt $j10))
132 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, lt disagrees\n";
135 if ($cmp == -1 && !($i11 eq $j11) ||
136 $cmp == 0 && ($i11 eq $j11) ||
137 $cmp == 1 && !($i11 eq $j11))
142 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, eq disagrees\n";
145 if ($cmp == -1 && !($i12 gt $j12) ||
146 $cmp == 0 && !($i12 gt $j12) ||
147 $cmp == 1 && ($i12 gt $j12))
152 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, gt disagrees\n";
155 if ($cmp == -1 && $i13 le $j13 ||
156 $cmp == 0 && ($i13 le $j13) ||
157 $cmp == 1 && !($i13 le $j13))
162 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, le disagrees\n";
165 if ($cmp == -1 && ($i14 ne $j14) ||
166 $cmp == 0 && !($i14 ne $j14) ||
167 $cmp == 1 && ($i14 ne $j14))
172 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, ne disagrees\n";
175 if ($cmp == -1 && !($i15 ge $j15) ||
176 $cmp == 0 && ($i15 ge $j15) ||
177 $cmp == 1 && ($i15 ge $j15))
182 print "not ok $ok # ($i3 cmp $j3) gives '$cmp' \$i=$i \$j=$j, ge disagrees\n";