[perl5.git] / t / op / numconvert.t

#!./perl

#
# test the conversion operators
#
# Notations:
#
# "N p i N vs N N":  Apply op-N, then op-p, then op-i, then reporter-N
# Compare with application of op-N, then reporter-N
# Right below are descriptions of different ops and reporters.

# We do not use these subroutines any more, sub overhead makes a "switch"
# solution better:

# obviously, 0, 1 and 2, 3 are destructive.  (XXXX 64-bit? 4 destructive too)

# *0 = sub {--$_[0]};		# -
# *1 = sub {++$_[0]};		# +

# # Converters
# *2 = sub { $_[0] = $max_uv & $_[0]}; # U
# *3 = sub { use integer; $_[0] += $zero}; # I
# *4 = sub { $_[0] += $zero};	# N
# *5 = sub { $_[0] = "$_[0]" };	# P

# # Side effects
# *6 = sub { $max_uv & $_[0]};	# u
# *7 = sub { use integer; $_[0] + $zero};	# i
# *8 = sub { $_[0] + $zero};	# n
# *9 = sub { $_[0] . "" };	# p

# # Reporters
# sub a2 { sprintf "%u", $_[0] }	# U
# sub a3 { sprintf "%d", $_[0] }	# I
# sub a4 { sprintf "%g", $_[0] }	# N
# sub a5 { "$_[0]" }		# P

BEGIN {
    chdir 't' if -d 't';
    @INC = '../lib';
}

use strict 'vars';

my $max_chain = $ENV{PERL_TEST_NUMCONVERTS} || 2;

# Bulk out if unsigned type is hopelessly wrong:
my $max_uv1 = ~0;
my $max_uv2 = sprintf "%u", $max_uv1 ** 6; # 6 is an arbitrary number here
my $big_iv = do {use integer; $max_uv1 * 16}; # 16 is an arbitrary number here

print "# max_uv1 = $max_uv1, max_uv2 = $max_uv2, big_iv = $big_iv\n";
if ($max_uv1 ne $max_uv2 or $big_iv > $max_uv1) {
  print "1..0 # skipped: unsigned perl arithmetic is not sane";
  eval { require Config; import Config };
  use vars qw(%Config);
  if ($Config{d_quad} eq 'define') {
      print " (common in 64-bit platforms)";
  }
  print "\n";
  exit 0;
}

my $st_t = 4*4;			# We try 4 initializers and 4 reporters

my $num = 0;
$num += 10**$_ - 4**$_ for 1.. $max_chain;
$num *= $st_t;
print "1..$num\n";		# In fact 15 times more subsubtests...

my $max_uv = ~0;
my $max_iv = int($max_uv/2);
my $zero = 0;

my $l_uv = length $max_uv;
my $l_iv = length $max_iv;

# Hope: the first digits are good
my $larger_than_uv = substr 97 x 100, 0, $l_uv;
my $smaller_than_iv = substr 12 x 100, 0, $l_iv;
my $yet_smaller_than_iv = substr 97 x 100, 0, ($l_iv - 1);

my @list = (1, $yet_smaller_than_iv, $smaller_than_iv, $max_iv, $max_iv + 1,
	    $max_uv, $max_uv + 1);
unshift @list, (reverse map -$_, @list), 0; # 15 elts
@list = map "$_", @list; # Normalize

print "# @list\n";

# need to special case ++ for max_uv, as ++ "magic" on a string gives
# another string, whereas ++ magic on a string used as a number gives
# a number. Not a problem when NV preserves UV, but if it doesn't then
# stringification of the latter gives something in e notation.

my $max_uv_pp = "$max_uv"; $max_uv_pp++;
my $max_uv_p1 = "$max_uv"; $max_uv_p1+=0; $max_uv_p1++;

# Also need to cope with %g notation for max_uv_p1 that actually gives an
# integer less than max_uv because of correct rounding for the limited
# precisision. This bites for 12 byte long doubles and 8 byte UVs

my $temp = $max_uv_p1;
my $max_uv_p1_as_iv;
{use integer; $max_uv_p1_as_iv = 0 + sprintf "%s", $temp}
my $max_uv_p1_as_uv = 0 | sprintf "%s", $temp;

my @opnames = split //, "-+UINPuinp";

# @list = map { 2->($_), 3->($_), 4->($_), 5->($_),  } @list; # Prepare input

#print "@list\n";
#print "'@ops'\n";

my $test = 1;
my $nok;
for my $num_chain (1..$max_chain) {
  my @ops = map [split //], grep /[4-9]/,
    map { sprintf "%0${num_chain}d", $_ }  0 .. 10**$num_chain - 1;

  #@ops = ([]) unless $num_chain;
  #@ops = ([6, 4]);

  # print "'@ops'\n";
  for my $op (@ops) {
    for my $first (2..5) {
      for my $last (2..5) {
	$nok = 0;
	my @otherops = grep $_ <= 3, @$op;
	my @curops = ($op,\@otherops);

	for my $num (@list) {
	  my $inpt;
	  my @ans;

	  for my $short (0, 1) {
	    # undef $inpt;	# Forget all we had - some bugs were masked

	    $inpt = $num;	# Try to not contaminate $num...
	    $inpt = "$inpt";
	    if ($first == 2) {
	      $inpt = $max_uv & $inpt; # U 2
	    } elsif ($first == 3) {
	      use integer; $inpt += $zero; # I 3
	    } elsif ($first == 4) {
	      $inpt += $zero;	# N 4
	    } else {
	      $inpt = "$inpt";	# P 5
	    }

	    # Saves 20% of time - not with this logic:
	    #my $tmp = $inpt;
	    #my $tmp1 = $num;
	    #next if $num_chain > 1
	    #  and "$tmp" ne "$tmp1"; # Already the coercion gives problems...

	    for my $curop (@{$curops[$short]}) {
	      if ($curop < 5) {
		if ($curop < 3) {
		  if ($curop == 0) {
		    --$inpt;	# - 0
		  } elsif ($curop == 1) {
		    ++$inpt;	# + 1
		  } else {
		    $inpt = $max_uv & $inpt; # U 2
		  }
		} elsif ($curop == 3) {
		  use integer; $inpt += $zero;
		} else {
		  $inpt += $zero; # N 4
		}
	      } elsif ($curop < 8) {
		if ($curop == 5) {
		  $inpt = "$inpt"; # P 5
		} elsif ($curop == 6) {
		  $max_uv & $inpt; # u 6
		} else {
		  use integer; $inpt + $zero;
		}
	      } elsif ($curop == 8) {
		$inpt + $zero;	# n 8
	      } else {
		$inpt . "";	# p 9
	      }
	    }

	    if ($last == 2) {
	      $inpt = sprintf "%u", $inpt; # U 2
	    } elsif ($last == 3) {
	      $inpt = sprintf "%d", $inpt; # I 3
	    } elsif ($last == 4) {
	      $inpt = sprintf "%g", $inpt; # N 4
	    } else {
	      $inpt = "$inpt";	# P 5
	    }
	    push @ans, $inpt;
	  }
	  if ($ans[0] ne $ans[1]) {
	    print "# '$ans[0]' ne '$ans[1]',\t$num\t=> @opnames[$first,@{$curops[0]},$last] vs @opnames[$first,@{$curops[1]},$last]\n";
	    # XXX ought to check that "+" was in the list of opnames
	    if ((($ans[0] eq $max_uv_pp) and ($ans[1] eq $max_uv_p1))
		or (($ans[1] eq $max_uv_pp) and ($ans[0] eq $max_uv_p1))) {
	      # string ++ versus numeric ++. Tolerate this little
	      # bit of insanity
	      print "# ok, as string ++ of max_uv is \"$max_uv_pp\", numeric is $max_uv_p1\n"
	    } elsif ($opnames[$last] eq 'I' and $ans[1] eq "-1"
		     and $ans[0] eq $max_uv_p1_as_iv) {
	      print "# ok, \"$max_uv_p1\" correctly converts to IV \"$max_uv_p1_as_iv\"\n";
	    } elsif ($opnames[$last] eq 'U' and $ans[1] eq ~0
		     and $ans[0] eq $max_uv_p1_as_uv) {
	      print "# ok, \"$max_uv_p1\" correctly converts to UV \"$max_uv_p1_as_uv\"\n";
	    } elsif (grep {/^N$/} @opnames[@{$curops[0]}]
		     and $ans[0] == $ans[1] and $ans[0] <= ~0) {
	      print "# ok, numerically equal - notation changed due to adding zero\n";
	    } else {
	      $nok++,
	    }
	  }
	}
	print "not " if $nok;
	print "ok $test\n";
	#print $txt if $nok;
	$test++;
      }
    }
  }
}
Commit	Line	Data
25da4f38 IZ	1	#!./perl
	2
	3	#
	4	# test the conversion operators
	5	#
	6	# Notations:
	7	#
	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.
	11
	12	# We do not use these subroutines any more, sub overhead makes a "switch"
	13	# solution better:
	14
	15	# obviously, 0, 1 and 2, 3 are destructive. (XXXX 64-bit? 4 destructive too)
	16
	17	# *0 = sub {--$_[0]}; # -
	18	# *1 = sub {++$_[0]}; # +
	19
	20	# # Converters
	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
	25
	26	# # Side effects
	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
	31
	32	# # Reporters
	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
	37
	38	BEGIN {
	39	chdir 't' if -d 't';
	40	@INC = '../lib';
	41	}
	42
	43	use strict 'vars';
	44
45c0de28	45	my $max_chain = $ENV{PERL_TEST_NUMCONVERTS} \|\| 2;
25da4f38 IZ	46
	47	# Bulk out if unsigned type is hopelessly wrong:
	48	my $max_uv1 = ~0;
	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
	51
972b05a9	52	print "# max_uv1 = $max_uv1, max_uv2 = $max_uv2, big_iv = $big_iv\n";
25da4f38	53	if ($max_uv1 ne $max_uv2 or $big_iv > $max_uv1) {
0be093c9 LC	54	print "1..0 # skipped: unsigned perl arithmetic is not sane";
	55	eval { require Config; import Config };
	56	use vars qw(%Config);
	57	if ($Config{d_quad} eq 'define') {
	58	print " (common in 64-bit platforms)";
	59	}
	60	print "\n";
25da4f38 IZ	61	exit 0;
	62	}
	63
	64	my $st_t = 4*4; # We try 4 initializers and 4 reporters
	65
	66	my $num = 0;
	67	$num += 10$_ - 4$_ for 1.. $max_chain;
	68	$num *= $st_t;
	69	print "1..$num\n"; # In fact 15 times more subsubtests...
	70
	71	my $max_uv = ~0;
	72	my $max_iv = int($max_uv/2);
	73	my $zero = 0;
	74
	75	my $l_uv = length $max_uv;
	76	my $l_iv = length $max_iv;
	77
	78	# Hope: the first digits are good
	79	my $larger_than_uv = substr 97 x 100, 0, $l_uv;
	80	my $smaller_than_iv = substr 12 x 100, 0, $l_iv;
	81	my $yet_smaller_than_iv = substr 97 x 100, 0, ($l_iv - 1);
	82
	83	my @list = (1, $yet_smaller_than_iv, $smaller_than_iv, $max_iv, $max_iv + 1,
	84	$max_uv, $max_uv + 1);
	85	unshift @list, (reverse map -$_, @list), 0; # 15 elts
	86	@list = map "$_", @list; # Normalize
	87
28e5dec8	88	print "# @list\n";
25da4f38	89
28e5dec8 JH	90	# need to special case ++ for max_uv, as ++ "magic" on a string gives
	91	# another string, whereas ++ magic on a string used as a number gives
	92	# a number. Not a problem when NV preserves UV, but if it doesn't then
	93	# stringification of the latter gives something in e notation.
	94
	95	my $max_uv_pp = "$max_uv"; $max_uv_pp++;
	96	my $max_uv_p1 = "$max_uv"; $max_uv_p1+=0; $max_uv_p1++;
25da4f38	97
bd658be6 NC	98	# Also need to cope with %g notation for max_uv_p1 that actually gives an
	99	# integer less than max_uv because of correct rounding for the limited
	100	# precisision. This bites for 12 byte long doubles and 8 byte UVs
	101
	102	my $temp = $max_uv_p1;
	103	my $max_uv_p1_as_iv;
	104	{use integer; $max_uv_p1_as_iv = 0 + sprintf "%s", $temp}
	105	my $max_uv_p1_as_uv = 0 \| sprintf "%s", $temp;
	106
25da4f38 IZ	107	my @opnames = split //, "-+UINPuinp";
	108
	109	# @list = map { 2->($_), 3->($_), 4->($_), 5->($_), } @list; # Prepare input
	110
	111	#print "@list\n";
	112	#print "'@ops'\n";
	113
	114	my $test = 1;
	115	my $nok;
	116	for my $num_chain (1..$max_chain) {
	117	my @ops = map [split //], grep /[4-9]/,
	118	map { sprintf "%0${num_chain}d", $_ } 0 .. 10**$num_chain - 1;
	119
	120	#@ops = ([]) unless $num_chain;
	121	#@ops = ([6, 4]);
	122
	123	# print "'@ops'\n";
	124	for my $op (@ops) {
	125	for my $first (2..5) {
	126	for my $last (2..5) {
	127	$nok = 0;
	128	my @otherops = grep $_ <= 3, @$op;
	129	my @curops = ($op,\@otherops);
	130
	131	for my $num (@list) {
	132	my $inpt;
	133	my @ans;
	134
	135	for my $short (0, 1) {
	136	# undef $inpt; # Forget all we had - some bugs were masked
	137
	138	$inpt = $num; # Try to not contaminate $num...
	139	$inpt = "$inpt";
	140	if ($first == 2) {
	141	$inpt = $max_uv & $inpt; # U 2
	142	} elsif ($first == 3) {
	143	use integer; $inpt += $zero; # I 3
	144	} elsif ($first == 4) {
	145	$inpt += $zero; # N 4
	146	} else {
	147	$inpt = "$inpt"; # P 5
	148	}
	149
	150	# Saves 20% of time - not with this logic:
	151	#my $tmp = $inpt;
	152	#my $tmp1 = $num;
	153	#next if $num_chain > 1
	154	# and "$tmp" ne "$tmp1"; # Already the coercion gives problems...
	155
	156	for my $curop (@{$curops[$short]}) {
	157	if ($curop < 5) {
	158	if ($curop < 3) {
	159	if ($curop == 0) {
	160	--$inpt; # - 0
	161	} elsif ($curop == 1) {
	162	++$inpt; # + 1
	163	} else {
	164	$inpt = $max_uv & $inpt; # U 2
	165	}
	166	} elsif ($curop == 3) {
	167	use integer; $inpt += $zero;
	168	} else {
	169	$inpt += $zero; # N 4
	170	}
171	} elsif ($curop < 8) {
172	if ($curop == 5) {
173	$inpt = "$inpt"; # P 5
174	} elsif ($curop == 6) {
175	$max_uv & $inpt; # u 6
176	} else {
177	use integer; $inpt + $zero;
178	}
179	} elsif ($curop == 8) {
180	$inpt + $zero; # n 8
181	} else {
182	$inpt . ""; # p 9
183	}
184	}
185
186	if ($last == 2) {
187	$inpt = sprintf "%u", $inpt; # U 2
188	} elsif ($last == 3) {
189	$inpt = sprintf "%d", $inpt; # I 3
190	} elsif ($last == 4) {
191	$inpt = sprintf "%g", $inpt; # N 4
192	} else {
193	$inpt = "$inpt"; # P 5
194	}
195	push @ans, $inpt;
196	}
28e5dec8 JH	197	if ($ans[0] ne $ans[1]) {
	198	print "# '$ans[0]' ne '$ans[1]',\t$num\t=> @opnames[$first,@{$curops[0]},$last] vs @opnames[$first,@{$curops[1]},$last]\n";
	199	# XXX ought to check that "+" was in the list of opnames
	200	if ((($ans[0] eq $max_uv_pp) and ($ans[1] eq $max_uv_p1))
	201	or (($ans[1] eq $max_uv_pp) and ($ans[0] eq $max_uv_p1))) {
	202	# string ++ versus numeric ++. Tolerate this little
	203	# bit of insanity
	204	print "# ok, as string ++ of max_uv is \"$max_uv_pp\", numeric is $max_uv_p1\n"
bd658be6 NC	205	} elsif ($opnames[$last] eq 'I' and $ans[1] eq "-1"
	206	and $ans[0] eq $max_uv_p1_as_iv) {
	207	print "# ok, \"$max_uv_p1\" correctly converts to IV \"$max_uv_p1_as_iv\"\n";
	208	} elsif ($opnames[$last] eq 'U' and $ans[1] eq ~0
	209	and $ans[0] eq $max_uv_p1_as_uv) {
	210	print "# ok, \"$max_uv_p1\" correctly converts to UV \"$max_uv_p1_as_uv\"\n";
	211	} elsif (grep {/^N$/} @opnames[@{$curops[0]}]
	212	and $ans[0] == $ans[1] and $ans[0] <= ~0) {
	213	print "# ok, numerically equal - notation changed due to adding zero\n";
28e5dec8 JH	214	} else {
	215	$nok++,
	216	}
	217	}
25da4f38 IZ	218	}
	219	print "not " if $nok;
	220	print "ok $test\n";
	221	#print $txt if $nok;
	222	$test++;
	223	}
	224	}
	225	}
	226	}