4 # test the conversion operators
8 # "N p i N vs N N": Apply op-N, then op-p, then op-i, then reporter-N
9 # Compare with application of op-N, then reporter-N
10 # Right below are descriptions of different ops and reporters.
12 # We do not use these subroutines any more, sub overhead makes a "switch"
15 # obviously, 0, 1 and 2, 3 are destructive. (XXXX 64-bit? 4 destructive too)
17 # *0 = sub {--$_[0]}; # -
18 # *1 = sub {++$_[0]}; # +
21 # *2 = sub { $_[0] = $max_uv & $_[0]}; # U
22 # *3 = sub { use integer; $_[0] += $zero}; # I
23 # *4 = sub { $_[0] += $zero}; # N
24 # *5 = sub { $_[0] = "$_[0]" }; # P
27 # *6 = sub { $max_uv & $_[0]}; # u
28 # *7 = sub { use integer; $_[0] + $zero}; # i
29 # *8 = sub { $_[0] + $zero}; # n
30 # *9 = sub { $_[0] . "" }; # p
33 # sub a2 { sprintf "%u", $_[0] } # U
34 # sub a3 { sprintf "%d", $_[0] } # I
35 # sub a4 { sprintf "%g", $_[0] } # N
36 # sub a5 { "$_[0]" } # P
45 my $max_chain = $ENV{PERL_TEST_NUMCONVERTS} || 2;
47 # Bulk out if unsigned type is hopelessly wrong:
49 my $max_uv2 = sprintf "%u", $max_uv1 ** 6; # 6 is an arbitrary number here
50 my $big_iv = do {use integer; $max_uv1 * 16}; # 16 is an arbitrary number here
52 if ($max_uv1 ne $max_uv2 or $big_iv > $max_uv1) {
53 # see perldelta.pod section 64-bit support
54 print "1..0\n# Unsigned arithmetic is not sane\n";
58 my $st_t = 4*4; # We try 4 initializers and 4 reporters
61 $num += 10**$_ - 4**$_ for 1.. $max_chain;
63 print "1..$num\n"; # In fact 15 times more subsubtests...
66 my $max_iv = int($max_uv/2);
69 my $l_uv = length $max_uv;
70 my $l_iv = length $max_iv;
72 # Hope: the first digits are good
73 my $larger_than_uv = substr 97 x 100, 0, $l_uv;
74 my $smaller_than_iv = substr 12 x 100, 0, $l_iv;
75 my $yet_smaller_than_iv = substr 97 x 100, 0, ($l_iv - 1);
77 my @list = (1, $yet_smaller_than_iv, $smaller_than_iv, $max_iv, $max_iv + 1,
78 $max_uv, $max_uv + 1);
79 unshift @list, (reverse map -$_, @list), 0; # 15 elts
80 @list = map "$_", @list; # Normalize
85 my @opnames = split //, "-+UINPuinp";
87 # @list = map { 2->($_), 3->($_), 4->($_), 5->($_), } @list; # Prepare input
94 for my $num_chain (1..$max_chain) {
95 my @ops = map [split //], grep /[4-9]/,
96 map { sprintf "%0${num_chain}d", $_ } 0 .. 10**$num_chain - 1;
98 #@ops = ([]) unless $num_chain;
103 for my $first (2..5) {
104 for my $last (2..5) {
106 my @otherops = grep $_ <= 3, @$op;
107 my @curops = ($op,\@otherops);
109 for my $num (@list) {
113 for my $short (0, 1) {
114 # undef $inpt; # Forget all we had - some bugs were masked
116 $inpt = $num; # Try to not contaminate $num...
119 $inpt = $max_uv & $inpt; # U 2
120 } elsif ($first == 3) {
121 use integer; $inpt += $zero; # I 3
122 } elsif ($first == 4) {
123 $inpt += $zero; # N 4
125 $inpt = "$inpt"; # P 5
128 # Saves 20% of time - not with this logic:
131 #next if $num_chain > 1
132 # and "$tmp" ne "$tmp1"; # Already the coercion gives problems...
134 for my $curop (@{$curops[$short]}) {
139 } elsif ($curop == 1) {
142 $inpt = $max_uv & $inpt; # U 2
144 } elsif ($curop == 3) {
145 use integer; $inpt += $zero;
147 $inpt += $zero; # N 4
149 } elsif ($curop < 8) {
151 $inpt = "$inpt"; # P 5
152 } elsif ($curop == 6) {
153 $max_uv & $inpt; # u 6
155 use integer; $inpt + $zero;
157 } elsif ($curop == 8) {
165 $inpt = sprintf "%u", $inpt; # U 2
166 } elsif ($last == 3) {
167 $inpt = sprintf "%d", $inpt; # I 3
168 } elsif ($last == 4) {
169 $inpt = sprintf "%g", $inpt; # N 4
171 $inpt = "$inpt"; # P 5
176 print "# '$ans[0]' ne '$ans[1]',\t$num\t=> @opnames[$first,@{$curops[0]},$last] vs @opnames[$first,@{$curops[1]},$last]\n"
177 if $ans[0] ne $ans[1];
179 print "not " if $nok;