-#!./perl
+#!./perl -w
BEGIN {
chdir 't' if -d 't';
@INC = '../lib';
- require Config; import Config;
+ require './test.pl';
}
-print "1..165\n";
-
-$format = "c2 x5 C C x s d i l a6";
-# Need the expression in here to force ary[5] to be numeric. This avoids
-# test2 failing because ary2 goes str->numeric->str and ary doesn't.
-@ary = (1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,"abcdef");
-$foo = pack($format,@ary);
-@ary2 = unpack($format,$foo);
-
-print ($#ary == $#ary2 ? "ok 1\n" : "not ok 1\n");
-
-$out1=join(':',@ary);
-$out2=join(':',@ary2);
-# Using long double NVs may introduce greater accuracy than wanted.
-$out1 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
-$out2 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
-if ($out1 eq $out2) {
- print "ok 2\n";
-} else {
- print "# out1: $out1\n";
- print "# out2: $out2\n";
- print "not ok 2\n";
+plan tests => 1470;
+
+use strict;
+use warnings;
+use Config;
+
+my $Is_EBCDIC = (defined $Config{ebcdic} && $Config{ebcdic} eq 'define');
+my $Perl = which_perl();
+
+sub encode {
+ my @result = @_;
+ foreach (@result) {
+ s/([[:cntrl:]\177 ])/sprintf "\\%03o", ord $1/ge if defined;
+ }
+ @result;
}
-print ($foo =~ /def/ ? "ok 3\n" : "not ok 3\n");
+sub encode_list {
+ my @result = @_;
+ foreach (@result) {
+ if (defined) {
+ s/([[:cntrl:]\177])/sprintf "\\%03o", ord $1/ge;
+ $_ = qq("$_");
+ } else {
+ $_ = 'undef';
+ }
+ }
+ if (@result == 1) {
+ return @result;
+ }
+ return '(' . join (', ', @result) . ')';
+}
-# How about counting bits?
-print +($x = unpack("%32B*", "\001\002\004\010\020\040\100\200\377")) == 16
- ? "ok 4\n" : "not ok 4 $x\n";
+sub list_eq ($$) {
+ my ($l, $r) = @_;
+ return unless @$l == @$r;
+ for my $i (0..$#$l) {
+ if (defined $l->[$i]) {
+ return unless defined ($r->[$i]) && $l->[$i] eq $r->[$i];
+ } else {
+ return if defined $r->[$i]
+ }
+ }
+ return 1;
+}
-print +($x = unpack("%32b69", "\001\002\004\010\020\040\100\200\017")) == 12
- ? "ok 5\n" : "not ok 5 $x\n";
+##############################################################################
+#
+# Here starteth the tests
+#
-print +($x = unpack("%32B69", "\001\002\004\010\020\040\100\200\017")) == 9
- ? "ok 6\n" : "not ok 6 $x\n";
+{
+ my $format = "c2 x5 C C x s d i l a6";
+ # Need the expression in here to force ary[5] to be numeric. This avoids
+ # test2 failing because ary2 goes str->numeric->str and ary doesn't.
+ my @ary = (1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,
+ "abcdef");
+ my $foo = pack($format,@ary);
+ my @ary2 = unpack($format,$foo);
+
+ is($#ary, $#ary2);
+
+ my $out1=join(':',@ary);
+ my $out2=join(':',@ary2);
+ # Using long double NVs may introduce greater accuracy than wanted.
+ $out1 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
+ $out2 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
+ is($out1, $out2);
+
+ like($foo, qr/def/);
+}
+# How about counting bits?
-my $sum = 129; # ASCII
-$sum = 103 if ($Config{ebcdic} eq 'define');
+{
+ my $x;
+ is( ($x = unpack("%32B*", "\001\002\004\010\020\040\100\200\377")), 16 );
-print +($x = unpack("%32B*", "Now is the time for all good blurfl")) == $sum
- ? "ok 7\n" : "not ok 7 $x\n";
+ is( ($x = unpack("%32b69", "\001\002\004\010\020\040\100\200\017")), 12 );
-open(BIN, "./perl") || open(BIN, "./perl.exe")
- || die "Can't open ../perl or ../perl.exe: $!\n";
-sysread BIN, $foo, 8192;
-close BIN;
+ is( ($x = unpack("%32B69", "\001\002\004\010\020\040\100\200\017")), 9 );
+}
-$sum = unpack("%32b*", $foo);
-$longway = unpack("b*", $foo);
-print $sum == $longway =~ tr/1/1/ ? "ok 8\n" : "not ok 8\n";
+{
+ my $sum = 129; # ASCII
+ $sum = 103 if $Is_EBCDIC;
-print +($x = unpack("I",pack("I", 0xFFFFFFFF))) == 0xFFFFFFFF
- ? "ok 9\n" : "not ok 9 $x\n";
+ my $x;
+ is( ($x = unpack("%32B*", "Now is the time for all good blurfl")), $sum );
-# check 'w'
-my $test=10;
-my @x = (5,130,256,560,32000,3097152,268435455,1073741844,
- '4503599627365785','23728385234614992549757750638446');
-my $x = pack('w*', @x);
-my $y = pack 'H*', '0581028200843081fa0081bd8440ffffff7f848080801487ffffffffffdb19caefe8e1eeeea0c2e1e3e8ede1ee6e';
+ my $foo;
+ open(BIN, $Perl) || die "Can't open $Perl: $!\n";
+ sysread BIN, $foo, 8192;
+ close BIN;
-print $x eq $y ? "ok $test\n" : "not ok $test\n"; $test++;
+ $sum = unpack("%32b*", $foo);
+ my $longway = unpack("b*", $foo);
+ is( $sum, $longway =~ tr/1/1/ );
+}
-@y = unpack('w*', $y);
-my $a;
-while ($a = pop @x) {
- my $b = pop @y;
- print $a eq $b ? "ok $test\n" : "not ok $test\n$a\n$b\n"; $test++;
+{
+ my $x;
+ is( ($x = unpack("I",pack("I", 0xFFFFFFFF))), 0xFFFFFFFF );
}
-@y = unpack('w2', $x);
+{
+ # check 'w'
+ my @x = (5,130,256,560,32000,3097152,268435455,1073741844, 2**33,
+ '4503599627365785','23728385234614992549757750638446');
+ my $x = pack('w*', @x);
+ my $y = pack 'H*', '0581028200843081fa0081bd8440ffffff7f8480808014A0808'.
+ '0800087ffffffffffdb19caefe8e1eeeea0c2e1e3e8ede1ee6e';
+
+ is($x, $y);
+
+ my @y = unpack('w*', $y);
+ my $a;
+ while ($a = pop @x) {
+ my $b = pop @y;
+ is($a, $b);
+ }
+
+ @y = unpack('w2', $x);
+
+ is(scalar(@y), 2);
+ is($y[1], 130);
+}
-print scalar(@y) == 2 ? "ok $test\n" : "not ok $test\n"; $test++;
-print $y[1] == 130 ? "ok $test\n" : "not ok $test\n"; $test++;
-# test exeptions
-eval { $x = unpack 'w', pack 'C*', 0xff, 0xff};
-print $@ ne '' ? "ok $test\n" : "not ok $test\n"; $test++;
+{
+ # test exeptions
+ my $x;
+ eval { $x = unpack 'w', pack 'C*', 0xff, 0xff};
+ like($@, qr/^Unterminated compressed integer/);
-eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff};
-print $@ ne '' ? "ok $test\n" : "not ok $test\n"; $test++;
+ eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff};
+ like($@, qr/^Unterminated compressed integer/);
-eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
-print $@ ne '' ? "ok $test\n" : "not ok $test\n"; $test++;
+ eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
+ like($@, qr/^Unterminated compressed integer/);
+}
#
# test the "p" template
# literals
-print((unpack("p",pack("p","foo")) eq "foo" ? "ok " : "not ok "),$test++,"\n");
+is(unpack("p",pack("p","foo")), "foo");
# scalars
-print((unpack("p",pack("p",$test)) == $test ? "ok " : "not ok "),$test++,"\n");
+is(unpack("p",pack("p",239)), 239);
# temps
sub foo { my $a = "a"; return $a . $a++ . $a++ }
{
use warnings;
- my $last = $test;
+ my $warning;
local $SIG{__WARN__} = sub {
- print "ok ",$test++,"\n" if $_[0] =~ /temporary val/
+ $warning = $_[0];
};
my $junk = pack("p", &foo);
- print "not ok ", $test++, "\n" if $last == $test;
+
+ like($warning, qr/temporary val/);
}
# undef should give null pointer
-print((pack("p", undef) =~ /^\0+/ ? "ok " : "not ok "),$test++,"\n");
+like(pack("p", undef), qr/^\0+/);
# Check for optimizer bug (e.g. Digital Unix GEM cc with -O4 on DU V4.0B gives
# 4294967295 instead of -1)
# see #ifdef __osf__ in pp.c pp_unpack
-# Test 30:
-print( ((unpack("i",pack("i",-1))) == -1 ? "ok " : "not ok "),$test++,"\n");
-
-# 31..36: test the pack lengths of s S i I l L
-print "not " unless length(pack("s", 0)) == 2;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("S", 0)) == 2;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("i", 0)) >= 4;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("I", 0)) >= 4;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("l", 0)) == 4;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("L", 0)) == 4;
-print "ok ", $test++, "\n";
-
-# 37..40: test the pack lengths of n N v V
-
-print "not " unless length(pack("n", 0)) == 2;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("N", 0)) == 4;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("v", 0)) == 2;
-print "ok ", $test++, "\n";
-
-print "not " unless length(pack("V", 0)) == 4;
-print "ok ", $test++, "\n";
-
-# 41..56: test unpack-pack lengths
+is((unpack("i",pack("i",-1))), -1);
+
+# test the pack lengths of s S i I l L
+# test the pack lengths of n N v V
+my @lengths = qw(s 2 S 2 i -4 I -4 l 4 L 4 n 2 N 4 v 2 V 4);
+while (my ($format, $expect) = splice @lengths, 0, 2) {
+ my $len = length(pack($format, 0));
+ if ($expect > 0) {
+ is($expect, $len, "format '$format'");
+ } else {
+ $expect = -$expect;
+ ok ($len >= $expect, "format '$format'") ||
+ print "# format '$format' has length $len, expected >= $expect\n";
+ }
+}
-my @templates = qw(c C i I s S l L n N v V f d);
-# quads not supported everywhere: if not, retest floats/doubles
-# to preserve the test count...
-eval { my $q = pack("q",0) };
-push @templates, $@ !~ /Invalid type in pack/ ? qw(q Q) : qw(f d);
+# test unpack-pack lengths
+my @templates = qw(c C i I s S l L n N v V f d q Q);
foreach my $t (@templates) {
- my @t = unpack("$t*", pack("$t*", 12, 34));
- print "not "
- unless @t == 2 and (($t[0] == 12 and $t[1] == 34) or ($t =~ /[nv]/i));
- print "ok ", $test++, "\n";
+ SKIP: {
+ my @t = eval { unpack("$t*", pack("$t*", 12, 34)) };
+
+ # quads not supported everywhere
+ skip "Quads not supported", 4 if $@ =~ /Invalid type in pack/;
+ is( $@, '' );
+
+ is(scalar @t, 2);
+ if( $t =~ /[nv]/i ) {
+ is($t[0], 12);
+ is($t[1], 34);
+ }
+ else {
+ pass() for 1..2;
+ }
+ }
}
-# 57..60: uuencode/decode
+{
+ # uuencode/decode
+
+ # Note that first uuencoding known 'text' data and then checking the
+ # binary values of the uuencoded version would not be portable between
+ # character sets. Uuencoding is meant for encoding binary data, not
+ # text data.
-# Note that first uuencoding known 'text' data and then checking the
-# binary values of the uuencoded version would not be portable between
-# character sets. Uuencoding is meant for encoding binary data, not
-# text data.
-
-$in = pack 'C*', 0 .. 255;
+ my $in = pack 'C*', 0 .. 255;
-# just to be anal, we do some random tr/`/ /
-$uu = <<'EOUU';
+ # just to be anal, we do some random tr/`/ /
+ my $uu = <<'EOUU';
M` $"`P0%!@<("0H+# T.#Q`1$A,4%187&!D:&QP='A\@(2(C)"4F)R@I*BLL
M+2XO,#$R,S0U-C<X.3H[/#T^/T!!0D-$149'2$E*2TQ-3D]045)35%565UA9
M6EM<75Y?8&%B8V1E9F=H:6IK;&UN;W!Q<G-T=79W>'EZ>WQ]?G^`@8*#A(6&
?X>+CY.7FY^CIZNOL[>[O\/'R\_3U]O?X^?K[_/W^_P `
EOUU
-$_ = $uu;
-tr/ /`/;
-print "not " unless pack('u', $in) eq $_;
-print "ok ", $test++, "\n";
+ $_ = $uu;
+ tr/ /`/;
-print "not " unless unpack('u', $uu) eq $in;
-print "ok ", $test++, "\n";
+ is(pack('u', $in), $_);
-$in = "\x1f\x8b\x08\x08\x58\xdc\xc4\x35\x02\x03\x4a\x41\x50\x55\x00\xf3\x2a\x2d\x2e\x51\x48\xcc\xcb\x2f\xc9\x48\x2d\x52\x08\x48\x2d\xca\x51\x28\x2d\x4d\xce\x4f\x49\x2d\xe2\x02\x00\x64\x66\x60\x5c\x1a\x00\x00\x00";
-$uu = <<'EOUU';
+ is(unpack('u', $uu), $in);
+
+ $in = "\x1f\x8b\x08\x08\x58\xdc\xc4\x35\x02\x03\x4a\x41\x50\x55\x00\xf3\x2a\x2d\x2e\x51\x48\xcc\xcb\x2f\xc9\x48\x2d\x52\x08\x48\x2d\xca\x51\x28\x2d\x4d\xce\x4f\x49\x2d\xe2\x02\x00\x64\x66\x60\x5c\x1a\x00\x00\x00";
+ $uu = <<'EOUU';
M'XL("%C<Q#4"`TI!4%4`\RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>("`&1F
&8%P:````
EOUU
-print "not " unless unpack('u', $uu) eq $in;
-print "ok ", $test++, "\n";
+ is(unpack('u', $uu), $in);
-# 60 identical to 59 except that backquotes have been changed to spaces
+# This is identical to the above except that backquotes have been
+# changed to spaces
-$uu = <<'EOUU';
+ $uu = <<'EOUU';
M'XL("%C<Q#4" TI!4%4 \RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>(" &1F
-&8%P:
+&8%P:
EOUU
-print "not " unless unpack('u', $uu) eq $in;
-print "ok ", $test++, "\n";
-
-# 61..73: test the ascii template types (A, a, Z)
-
-print "not " unless pack('A*', "foo\0bar\0 ") eq "foo\0bar\0 ";
-print "ok ", $test++, "\n";
+ # ' # Grr
+ is(unpack('u', $uu), $in);
-print "not " unless pack('A11', "foo\0bar\0 ") eq "foo\0bar\0 ";
-print "ok ", $test++, "\n";
-
-print "not " unless unpack('A*', "foo\0bar \0") eq "foo\0bar";
-print "ok ", $test++, "\n";
+}
-print "not " unless unpack('A8', "foo\0bar \0") eq "foo\0bar";
-print "ok ", $test++, "\n";
+# test the ascii template types (A, a, Z)
+
+foreach (
+['p', 'A*', "foo\0bar\0 ", "foo\0bar\0 "],
+['p', 'A11', "foo\0bar\0 ", "foo\0bar\0 "],
+['u', 'A*', "foo\0bar \0", "foo\0bar"],
+['u', 'A8', "foo\0bar \0", "foo\0bar"],
+['p', 'a*', "foo\0bar\0 ", "foo\0bar\0 "],
+['p', 'a11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
+['u', 'a*', "foo\0bar \0", "foo\0bar \0"],
+['u', 'a8', "foo\0bar \0", "foo\0bar "],
+['p', 'Z*', "foo\0bar\0 ", "foo\0bar\0 \0"],
+['p', 'Z11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
+['p', 'Z3', "foo", "fo\0"],
+['u', 'Z*', "foo\0bar \0", "foo"],
+['u', 'Z8', "foo\0bar \0", "foo"],
+)
+{
+ my ($what, $template, $in, $out) = @$_;
+ my $got = $what eq 'u' ? (unpack $template, $in) : (pack $template, $in);
+ unless (is($got, $out)) {
+ ($in, $out, $got) = encode ($in, $out, $got);
+ my $un = $what eq 'u' ? 'un' : '';
+ print "# ${un}pack ('$template', \"$in\") gave $out not $got\n";
+ }
+}
-print "not " unless pack('a*', "foo\0bar\0 ") eq "foo\0bar\0 ";
-print "ok ", $test++, "\n";
+# packing native shorts/ints/longs
-print "not " unless pack('a11', "foo\0bar\0 ") eq "foo\0bar\0 \0\0";
-print "ok ", $test++, "\n";
+is(length(pack("s!", 0)), $Config{shortsize});
+is(length(pack("i!", 0)), $Config{intsize});
+is(length(pack("l!", 0)), $Config{longsize});
+ok(length(pack("s!", 0)) <= length(pack("i!", 0)));
+ok(length(pack("i!", 0)) <= length(pack("l!", 0)));
+is(length(pack("i!", 0)), length(pack("i", 0)));
-print "not " unless unpack('a*', "foo\0bar \0") eq "foo\0bar \0";
-print "ok ", $test++, "\n";
+sub numbers {
+ my $format = shift;
+ return numbers_with_total ($format, undef, @_);
+}
-print "not " unless unpack('a8', "foo\0bar \0") eq "foo\0bar ";
-print "ok ", $test++, "\n";
+sub numbers_with_total {
+ my $format = shift;
+ my $total = shift;
+ if (!defined $total) {
+ foreach (@_) {
+ $total += $_;
+ }
+ }
+ foreach (@_) {
+ SKIP: {
+ my $out = eval {unpack($format, pack($format, $_))};
+ skip "cannot pack '$format' on this perl", 2 if
+ $@ =~ /Invalid type in pack: '$format'/;
+
+ is($@, '');
+ is($out, $_);
+ }
+ }
+
+ my $skip_if_longer_than = ~0; # "Infinity"
+ if (~0 - 1 == ~0) {
+ # If we're running with -DNO_PERLPRESERVE_IVUV and NVs don't preserve all
+ # UVs (in which case ~0 is NV, ~0-1 will be the same NV) then we can't
+ # correctly in perl calculate UV totals for long checksums, as pp_unpack
+ # is using UV maths, and we've only got NVs.
+ $skip_if_longer_than = $Config{d_nv_preserves_uv_bits};
+ }
+
+ foreach ('', 1, 2, 3, 15, 16, 17, 31, 32, 33, 53, 54, 63, 64, 65) {
+ SKIP: {
+ my $sum = eval {unpack "%$_$format*", pack "$format*", @_};
+ skip "cannot pack '$format' on this perl", 3
+ if $@ =~ /Invalid type in pack: '$format'/;
+
+ is($@, '');
+ ok(defined $sum);
+
+ my $len = $_; # Copy, so that we can reassign ''
+ $len = 16 unless length $len;
+
+ SKIP: {
+ skip "cannot test checksums over $skip_if_longer_than bits", 1
+ if $len > $skip_if_longer_than;
+
+ # Our problem with testing this portably is that the checksum code in
+ # pp_unpack is able to cast signed to unsigned, and do modulo 2**n
+ # arithmetic in unsigned ints, which perl has no operators to do.
+ # (use integer; does signed ints, which won't wrap on UTS, which is just
+ # fine with ANSI, but not with most people's assumptions.
+ # This is why we need to supply the totals for 'Q' as there's no way in
+ # perl to calculate them, short of unpack '%0Q' (is that documented?)
+ # ** returns NVs; make sure it's IV.
+ my $max = 1 + 2 * (int (2 ** ($len-1))-1); # The max possible checksum
+ my $max_p1 = $max + 1;
+ my ($max_is_integer, $max_p1_is_integer);
+ $max_p1_is_integer = 1 unless $max_p1 + 1 == $max_p1;
+ $max_is_integer = 1 if $max - 1 < ~0;
+
+ my $calc_sum;
+ if (ref $total) {
+ $calc_sum = &$total($len);
+ } else {
+ $calc_sum = $total;
+ # Shift into range by some multiple of the total
+ my $mult = int ($total / $max_p1);
+ # Need this to make sure that -1 + (~0+1) is ~0 (ie still integer)
+ $calc_sum = $total - $mult;
+ $calc_sum -= $mult * $max;
+ if ($calc_sum < 0) {
+ $calc_sum += 1;
+ $calc_sum += $max;
+ }
+ }
+ if ($calc_sum == $calc_sum - 1 && $calc_sum == $max_p1) {
+ # we're into floating point (either by getting out of the range of
+ # UV arithmetic, or because we're doing a floating point checksum)
+ # and our calculation of the checksum has become rounded up to
+ # max_checksum + 1
+ $calc_sum = 0;
+ }
+
+ if (is( $calc_sum, $sum)) {
+ print "# unpack '%$_$format' gave $sum\n";
+ } else {
+ my $delta = 1.000001;
+ if ($format =~ tr /dDfF//
+ && ($calc_sum <= $sum * $delta && $calc_sum >= $sum / $delta)) {
+ pass;
+ print "# unpack '%$_$format' gave $sum, expected $calc_sum\n";
+ } else {
+ my $text = ref $total ? &$total($len) : $total;
+ fail;
+ print "# For list (" . join (", ", @_) . ") (total $text)"
+ . " packed with $format unpack '%$_$format' gave $sum,"
+ . " expected $calc_sum\n";
+ }
+ }
+ }
+ }
+ }
+}
-print "not " unless pack('Z*', "foo\0bar\0 ") eq "foo\0bar\0 \0";
-print "ok ", $test++, "\n";
+numbers ('c', -128, -1, 0, 1, 127);
+numbers ('C', 0, 1, 127, 128, 255);
+numbers ('s', -32768, -1, 0, 1, 32767);
+numbers ('S', 0, 1, 32767, 32768, 65535);
+numbers ('i', -2147483648, -1, 0, 1, 2147483647);
+numbers ('I', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('l', -2147483648, -1, 0, 1, 2147483647);
+numbers ('L', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('s!', -32768, -1, 0, 1, 32767);
+numbers ('S!', 0, 1, 32767, 32768, 65535);
+numbers ('i!', -2147483648, -1, 0, 1, 2147483647);
+numbers ('I!', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('l!', -2147483648, -1, 0, 1, 2147483647);
+numbers ('L!', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('n', 0, 1, 32767, 32768, 65535);
+numbers ('v', 0, 1, 32767, 32768, 65535);
+numbers ('N', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('V', 0, 1, 2147483647, 2147483648, 4294967295);
+# All these should have exact binary representations:
+numbers ('f', -1, 0, 0.5, 42, 2**34);
+numbers ('d', -(2**34), -1, 0, 1, 2**34);
+## These don't, but 'd' is NV. XXX wrong, it's double
+#numbers ('d', -1, 0, 1, 1-exp(-1), -exp(1));
+
+numbers_with_total ('q', -1,
+ -9223372036854775808, -1, 0, 1,9223372036854775807);
+# This total is icky, but the true total is 2**65-1, and need a way to generate
+# the epxected checksum on any system including those where NVs can preserve
+# 65 bits. (long double is 128 bits on sparc, so they certainly can)
+# or where rounding is down not up on binary conversion (crays)
+numbers_with_total ('Q', sub {
+ my $len = shift;
+ $len = 65 if $len > 65; # unmasked total is 2**65-1 here
+ my $total = 1 + 2 * (int (2**($len - 1)) - 1);
+ return 0 if $total == $total - 1; # Overflowed integers
+ return $total; # NVs still accurate to nearest integer
+ },
+ 0, 1,9223372036854775807, 9223372036854775808,
+ 18446744073709551615);
+
+# pack nvNV byteorders
+
+is(pack("n", 0xdead), "\xde\xad");
+is(pack("v", 0xdead), "\xad\xde");
+is(pack("N", 0xdeadbeef), "\xde\xad\xbe\xef");
+is(pack("V", 0xdeadbeef), "\xef\xbe\xad\xde");
-print "not " unless pack('Z11', "foo\0bar\0 ") eq "foo\0bar\0 \0\0";
-print "ok ", $test++, "\n";
+{
+ # /
+
+ my ($x, $y, $z);
+ eval { ($x) = unpack '/a*','hello' };
+ like($@, qr!/ must follow a numeric type!);
+
+ eval { ($z,$x,$y) = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
+ is($@, '');
+ is($z, 'ok');
+ is($x, 'yes');
+ is($y, 'z');
+
+ eval { ($x) = pack '/a*','hello' };
+ like($@, qr!Invalid type in pack: '/'!);
+
+ $z = pack 'n/a* N/Z* w/A*','string','hi there ','etc';
+ my $expect = "\000\006string\0\0\0\012hi there \000\003etc";
+ is($z, $expect);
+
+ $expect = 'hello world';
+ eval { ($x) = unpack ("w/a", chr (11) . "hello world!")};
+ is($x, $expect);
+ is($@, '');
+
+ # Doing this in scalar context used to fail.
+ eval { $x = unpack ("w/a", chr (11) . "hello world!")};
+ is($@, '');
+ is($x, $expect);
+
+ foreach (
+ ['a/a*/a*', '212ab345678901234567','ab3456789012'],
+ ['a/a*/a*', '3012ab345678901234567', 'ab3456789012'],
+ ['a/a*/b*', '212ab', $Is_EBCDIC ? '100000010100' : '100001100100'],
+ )
+ {
+ my ($pat, $in, $expect) = @$_;
+ eval { ($x) = unpack $pat, $in };
+ is($@, '');
+ is($x, $expect) ||
+ printf "# list unpack ('$pat', '$in') gave %s, expected '$expect'\n",
+ encode_list ($x);
+
+ eval { $x = unpack $pat, $in };
+ is($@, '');
+ is($x, $expect) ||
+ printf "# scalar unpack ('$pat', '$in') gave %s, expected '$expect'\n",
+ encode_list ($x);
+ }
+
+ # / with #
+
+ eval { ($z,$x,$y) = unpack <<EOU, "003ok \003yes\004z\000abc" };
+ a3/A # Count in ASCII
+ C/a* # Count in a C char
+ C/Z # Count in a C char but skip after \0
+EOU
-print "not " unless pack('Z3', "foo") eq "fo\0";
-print "ok ", $test++, "\n";
+ is($@, '');
+ is($z, 'ok');
+ is($x, 'yes');
+ is($y, 'z');
-print "not " unless unpack('Z*', "foo\0bar \0") eq "foo";
-print "ok ", $test++, "\n";
+ $z = pack <<EOP,'string','etc';
+ n/a* # Count as network short
+ w/A* # Count a BER integer
+EOP
+ $expect = "\000\006string\003etc";
-print "not " unless unpack('Z8', "foo\0bar \0") eq "foo";
-print "ok ", $test++, "\n";
+ is($z, $expect) ||
+ printf "# got '%s', expected '$expect'\n", encode $z;
+}
-# 74..79: packing native shorts/ints/longs
+is("1.20.300.4000", sprintf "%vd", pack("U*",1,20,300,4000));
+is("1.20.300.4000", sprintf "%vd", pack(" U*",1,20,300,4000));
+isnt(v1.20.300.4000, sprintf "%vd", pack("C0U*",1,20,300,4000));
-print "not " unless length(pack("s!", 0)) == $Config{shortsize};
-print "ok ", $test++, "\n";
+my $rslt = $Is_EBCDIC ? "156 67" : "199 162";
+is(join(" ", unpack("C*", chr(0x1e2))), $rslt);
-print "not " unless length(pack("i!", 0)) == $Config{intsize};
-print "ok ", $test++, "\n";
+# does pack U create Unicode?
+is(ord(pack('U', 300)), 300);
-print "not " unless length(pack("l!", 0)) == $Config{longsize};
-print "ok ", $test++, "\n";
+# does unpack U deref Unicode?
+is((unpack('U', chr(300)))[0], 300);
-print "not " unless length(pack("s!", 0)) <= length(pack("i!", 0));
-print "ok ", $test++, "\n";
+# is unpack U the reverse of pack U for Unicode string?
+is("@{[unpack('U*', pack('U*', 100, 200, 300))]}", "100 200 300");
-print "not " unless length(pack("i!", 0)) <= length(pack("l!", 0));
-print "ok ", $test++, "\n";
+# is unpack U the reverse of pack U for byte string?
+is("@{[unpack('U*', pack('U*', 100, 200))]}", "100 200");
-print "not " unless length(pack("i!", 0)) == length(pack("i", 0));
-print "ok ", $test++, "\n";
-# 80..139: pack <-> unpack bijectionism
+SKIP: {
+ skip "Not for EBCDIC", 4 if $Is_EBCDIC;
-# 80.. 84 c
-foreach my $c (-128, -1, 0, 1, 127) {
- print "not " unless unpack("c", pack("c", $c)) == $c;
- print "ok ", $test++, "\n";
-}
+ # does unpack C unravel pack U?
+ is("@{[unpack('C*', pack('U*', 100, 200))]}", "100 195 136");
-# 85.. 89: C
-foreach my $C (0, 1, 127, 128, 255) {
- print "not " unless unpack("C", pack("C", $C)) == $C;
- print "ok ", $test++, "\n";
-}
+ # does pack U0C create Unicode?
+ is("@{[pack('U0C*', 100, 195, 136)]}", v100.v200);
-# 90.. 94: s
-foreach my $s (-32768, -1, 0, 1, 32767) {
- print "not " unless unpack("s", pack("s", $s)) == $s;
- print "ok ", $test++, "\n";
-}
+ # does pack C0U create characters?
+ is("@{[pack('C0U*', 100, 200)]}", pack("C*", 100, 195, 136));
-# 95.. 99: S
-foreach my $S (0, 1, 32767, 32768, 65535) {
- print "not " unless unpack("S", pack("S", $S)) == $S;
- print "ok ", $test++, "\n";
+ # does unpack U0U on byte data warn?
+ {
+ local $SIG{__WARN__} = sub { $@ = "@_" };
+ my @null = unpack('U0U', chr(255));
+ like($@, /^Malformed UTF-8 character /);
+ }
}
-# 100..104: i
-foreach my $i (-2147483648, -1, 0, 1, 2147483647) {
- print "not " unless unpack("i", pack("i", $i)) == $i;
- print "ok ", $test++, "\n";
+{
+ my $p = pack 'i*', -2147483648, ~0, 0, 1, 2147483647;
+ my (@a);
+ # bug - % had to be at the start of the pattern, no leading whitespace or
+ # comments. %i! didn't work at all.
+ foreach my $pat ('%32i*', ' %32i*', "# Muhahahaha\n%32i*", '%32i* ',
+ '%32i!*', ' %32i!*', "\n#\n#\n\r \t\f%32i!*", '%32i!*#') {
+ @a = unpack $pat, $p;
+ is($a[0], 0xFFFFFFFF) || print "# $pat\n";
+ @a = scalar unpack $pat, $p;
+ is($a[0], 0xFFFFFFFF) || print "# $pat\n";
+ }
+
+
+ $p = pack 'I*', 42, 12;
+ # Multiline patterns in scalar context failed.
+ foreach my $pat ('I', <<EOPOEMSNIPPET, 'I#I', 'I # I', 'I # !!!') {
+# On the Ning Nang Nong
+# Where the Cows go Bong!
+# And the Monkeys all say Boo!
+I
+EOPOEMSNIPPET
+ @a = unpack $pat, $p;
+ is(scalar @a, 1);
+ is($a[0], 42);
+ @a = scalar unpack $pat, $p;
+ is(scalar @a, 1);
+ is($a[0], 42);
+ }
+
+ # shorts (of all flavours) didn't calculate checksums > 32 bits with floating
+ # point, so a pathologically long pattern would wrap at 32 bits.
+ my $pat = "\xff\xff"x65538; # Start with it long, to save any copying.
+ foreach (4,3,2,1,0) {
+ my $len = 65534 + $_;
+ is(unpack ("%33n$len", $pat), 65535 * $len);
+ }
}
-# 105..109: I
-foreach my $I (0, 1, 2147483647, 2147483648, 4294967295) {
- print "not " unless unpack("I", pack("I", $I)) == $I;
- print "ok ", $test++, "\n";
-}
-# 110..114: l
-foreach my $l (-2147483648, -1, 0, 1, 2147483647) {
- print "not " unless unpack("l", pack("l", $l)) == $l;
- print "ok ", $test++, "\n";
+# pack x X @
+foreach (
+ ['x', "N", "\0"],
+ ['x4', "N", "\0"x4],
+ ['xX', "N", ""],
+ ['xXa*', "Nick", "Nick"],
+ ['a5Xa5', "cameL", "llama", "camellama"],
+ ['@4', 'N', "\0"x4],
+ ['a*@8a*', 'Camel', 'Dromedary', "Camel\0\0\0Dromedary"],
+ ['a*@4a', 'Perl rules', '!', 'Perl!'],
+)
+{
+ my ($template, @in) = @$_;
+ my $out = pop @in;
+ my $got = eval {pack $template, @in};
+ is($@, '');
+ is($out, $got) ||
+ printf "# pack ('$template', %s) gave %s expected %s\n",
+ encode_list (@in), encode_list ($got), encode_list ($out);
}
-# 115..119: L
-foreach my $L (0, 1, 2147483647, 2147483648, 4294967295) {
- print "not " unless unpack("L", pack("L", $L)) == $L;
- print "ok ", $test++, "\n";
+# unpack x X @
+foreach (
+ ['x', "N"],
+ ['xX', "N"],
+ ['xXa*', "Nick", "Nick"],
+ ['a5Xa5', "camellama", "camel", "llama"],
+ ['@3', "ice"],
+ ['@2a2', "water", "te"],
+ ['a*@1a3', "steam", "steam", "tea"],
+)
+{
+ my ($template, $in, @out) = @$_;
+ my @got = eval {unpack $template, $in};
+ is($@, '');
+ list_eq (\@got, \@out) ||
+ printf "# list unpack ('$template', \"%s\") gave %s expected %s\n",
+ encode ($in), encode_list (@got), encode_list (@out);
+
+ my $got = eval {unpack $template, $in};
+ is($@, '');
+ @out ? is( $got, $out[0] ) # 1 or more items; should get first
+ : ok( !defined $got ) # 0 items; should get undef
+ or printf "# scalar unpack ('$template', \"%s\") gave %s expected %s\n",
+ encode ($in), encode_list ($got), encode_list ($out[0]);
}
-# 120..124: n
-foreach my $n (0, 1, 32767, 32768, 65535) {
- print "not " unless unpack("n", pack("n", $n)) == $n;
- print "ok ", $test++, "\n";
+{
+ my $t = 'Z*Z*';
+ my ($u, $v) = qw(foo xyzzy);
+ my $p = pack($t, $u, $v);
+ my @u = unpack($t, $p);
+ is(scalar @u, 2);
+ is($u[0], $u);
+ is($u[1], $v);
}
-# 125..129: v
-foreach my $v (0, 1, 32767, 32768, 65535) {
- print "not " unless unpack("v", pack("v", $v)) == $v;
- print "ok ", $test++, "\n";
-}
+{
+ is((unpack("w/a*", "\x02abc"))[0], "ab");
-# 130..134: N
-foreach my $N (0, 1, 2147483647, 2147483648, 4294967295) {
- print "not " unless unpack("N", pack("N", $N)) == $N;
- print "ok ", $test++, "\n";
-}
+ # "w/a*" should be seen as one unit
-# 135..139: V
-foreach my $V (0, 1, 2147483647, 2147483648, 4294967295) {
- print "not " unless unpack("V", pack("V", $V)) == $V;
- print "ok ", $test++, "\n";
+ is(scalar unpack("w/a*", "\x02abc"), "ab");
}
-# 140..143: pack nvNV byteorders
-
-print "not " unless pack("n", 0xdead) eq "\xde\xad";
-print "ok ", $test++, "\n";
-
-print "not " unless pack("v", 0xdead) eq "\xad\xde";
-print "ok ", $test++, "\n";
-
-print "not " unless pack("N", 0xdeadbeef) eq "\xde\xad\xbe\xef";
-print "ok ", $test++, "\n";
-
-print "not " unless pack("V", 0xdeadbeef) eq "\xef\xbe\xad\xde";
-print "ok ", $test++, "\n";
-
-# 144..152: /
-
-my $z;
-eval { ($x) = unpack '/a*','hello' };
-print 'not ' unless $@; print "ok $test\n"; $test++;
-eval { ($z,$x,$y) = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
-print $@ eq '' && $z eq 'ok' ? "ok $test\n" : "not ok $test\n"; $test++;
-print $@ eq '' && $x eq 'yes' ? "ok $test\n" : "not ok $test\n"; $test++;
-print $@ eq '' && $y eq 'z' ? "ok $test\n" : "not ok $test\n"; $test++;
-
-eval { ($x) = pack '/a*','hello' };
-print 'not ' unless $@; print "ok $test\n"; $test++;
-$z = pack 'n/a* N/Z* w/A*','string','hi there ','etc';
-print 'not ' unless $z eq "\000\006string\0\0\0\012hi there \000\003etc";
-print "ok $test\n"; $test++;
-
-eval { ($x) = unpack 'a/a*/a*', '212ab345678901234567' };
-print $@ eq '' && $x eq 'ab3456789012' ? "ok $test\n" : "#$x,$@\nnot ok $test\n";
-$test++;
-
-eval { ($x) = unpack 'a/a*/a*', '3012ab345678901234567' };
-print $@ eq '' && $x eq 'ab3456789012' ? "ok $test\n" : "not ok $test\n";
-$test++;
-
-eval { ($x) = unpack 'a/a*/b*', '212ab' };
-my $expected_x = '100001100100';
-if ($Config{ebcdic} eq 'define') { $expected_x = '100000010100'; }
-print $@ eq '' && $x eq $expected_x ? "ok $test\n" : "#$x,$@\nnot ok $test\n";
-$test++;
-
-# 153..156: / with #
-
-eval { ($z,$x,$y) = unpack <<EOU, "003ok \003yes\004z\000abc" };
- a3/A # Count in ASCII
- C/a* # Count in a C char
- C/Z # Count in a C char but skip after \0
-EOU
-print $@ eq '' && $z eq 'ok' ? "ok $test\n" : "not ok $test\n"; $test++;
-print $@ eq '' && $x eq 'yes' ? "ok $test\n" : "not ok $test\n"; $test++;
-print $@ eq '' && $y eq 'z' ? "ok $test\n" : "not ok $test\n"; $test++;
-
-$z = pack <<EOP,'string','etc';
- n/a* # Count as network short
- w/A* # Count a BER integer
-EOP
-print 'not ' unless $z eq "\000\006string\003etc"; print "ok $test\n"; $test++;
-
-# 157..169: ???
-
-print 'not ' unless "1.20.300.4000" eq sprintf "%vd", pack("U*",1,20,300,4000);
-print "ok $test\n"; $test++;
-print 'not ' unless "1.20.300.4000" eq
- sprintf "%vd", pack(" U*",1,20,300,4000);
-print "ok $test\n"; $test++;
-print 'not ' unless v1.20.300.4000 ne
- sprintf "%vd", pack("C0U*",1,20,300,4000);
-print "ok $test\n"; $test++;
-
-# 160: unpack("C") and ord() equivalence for Unicode
-
-print "not " unless unpack("C", chr(0x100)) eq ord(chr(0x100)) &&
- ord(chr(0x100)) == 0x100;
-print "ok $test\n"; $test++;
-
-# 161: use bytes + unpack C == UTF-8 unraveling
-
{
- use bytes;
- my @bytes = unpack("C*", pack("U", 0x100));
- print "not " unless "@bytes" eq "196 128";
- print "ok $test\n"; $test++;
+ # from Wolfgang Laun: fix in change #13163
+
+ my $s = 'ABC' x 10;
+ my $x = 42;
+ my $buf = pack( 'Z*/A* C', $s, $x );
+ my $y;
+
+ my $h = $buf;
+ $h =~ s/[^[:print:]]/./g;
+ ( $s, $y ) = unpack( "Z*/A* C", $buf );
+ is($h, "30.ABCABCABCABCABCABCABCABCABCABC*");
+ is(length $buf, 34);
+ is($s, "ABCABCABCABCABCABCABCABCABCABC");
+ is($y, 42);
}
-# 162: pack C > 255
-
-print "not " unless ord(pack("C", 0x100)) == 0x100;
-print "ok $test\n"; $test++;
-
-# 163: pack C > 255 + use bytes == wraparound
-
{
- use bytes;
+ # from Wolfgang Laun: fix in change #13288
- print "not " unless ord(pack("C", 0x100 + 0xab)) == 0xab;
- print "ok $test\n"; $test++;
+ eval { my $t=unpack("P*", "abc") };
+ like($@, qr/P must have an explicit size/);
}
-
-# 164: pack C and pack U equivalence
-
-print "not " unless pack("C", 0x100) eq pack("U", 0x100) &&
- chr(0x100) eq pack("U", 0x100);
-print "ok $test\n"; $test++;
-
-# 165: unpack C and unpack U equivalence
-
-print "not " unless "@{[unpack('C*', chr(0x100) . chr(0x200))]}" eq
- "@{[unpack('U*', chr(0x100) . chr(0x200))]}" &&
- "@{[unpack('U*', chr(0x100) . chr(0x200))]}" eq "256 512";
-print "ok $test\n"; $test++;
-
https://perl5.git.perl.org / perl5.git / blobdiff