require './test.pl';
}
-plan tests => 5825;
+plan tests => 13679;
use strict;
use warnings;
my $Is_EBCDIC = (defined $Config{ebcdic} && $Config{ebcdic} eq 'define');
my $Perl = which_perl();
+my @valid_errors = (qr/^Invalid type '\w'/);
+
+my $ByteOrder = 'unknown';
+my $maybe_not_avail = '(?:hto[bl]e|[bl]etoh)';
+if ($Config{byteorder} =~ /^1234(?:5678)?$/) {
+ $ByteOrder = 'little';
+ $maybe_not_avail = '(?:htobe|betoh)';
+}
+elsif ($Config{byteorder} =~ /^(?:8765)?4321$/) {
+ $ByteOrder = 'big';
+ $maybe_not_avail = '(?:htole|letoh)';
+}
+else {
+ push @valid_errors, qr/^Can't (?:un)?pack (?:big|little)-endian .*? on this platform/;
+}
+
+for my $size ( 16, 32, 64 ) {
+ if (exists $Config{"u${size}size"} and $Config{"u${size}size"} != ($size >> 3)) {
+ push @valid_errors, qr/^Perl_my_$maybe_not_avail$size\(\) not available/;
+ }
+}
+
+my $IsTwosComplement = pack('i', -1) eq "\xFF" x $Config{intsize};
+print "# \$IsTwosComplement = $IsTwosComplement\n";
+
+sub is_valid_error
+{
+ my $err = shift;
+
+ for my $e (@valid_errors) {
+ $err =~ $e and return 1;
+ }
+
+ return 0;
+}
sub encode_list {
my @result = map {_qq($_)} @_;
{
- # test exceptions
+ print "# test exceptions\n";
my $x;
eval { $x = unpack 'w', pack 'C*', 0xff, 0xff};
like($@, qr/^Unterminated compressed integer/);
eval { $x = pack 'w', '1'x(1 + length ~0) . 'e0' };
like ($@, qr/^Can only compress unsigned integers/);
+ for my $mod (qw( ! < > )) {
+ eval { $x = pack "a$mod", 42 };
+ like ($@, qr/^'$mod' allowed only after types \S+ in pack/);
+
+ eval { $x = unpack "a$mod", 'x'x8 };
+ like ($@, qr/^'$mod' allowed only after types \S+ in unpack/);
+ }
+
+ for my $mod (qw( <> >< !<> !>< <!> >!< <>! ><! )) {
+ eval { $x = pack "sI${mod}s", 42, 47, 11 };
+ like ($@, qr/^Can't use both '<' and '>' after type 'I' in pack/);
+
+ eval { $x = unpack "sI${mod}s", 'x'x16 };
+ like ($@, qr/^Can't use both '<' and '>' after type 'I' in unpack/);
+ }
+
SKIP: {
# Is this a stupid thing to do on VMS, VOS and other unusual platforms?
- my $inf = eval '2**10000';
- skip "Couldn't generate infinity - got error '$@'"
+ skip("-- the IEEE infinity model is unavailable in this configuration.", 1)
+ if (($^O eq 'VMS') && !defined($Config{useieee}));
+
+ skip("-- $^O has serious fp indigestion on w-packed infinities", 1)
+ if (
+ ($^O eq 'mpeix')
+ ||
+ ($^O eq 'ultrix')
+ ||
+ ($^O =~ /^svr4/ && -f "/etc/issue" && -f "/etc/.relid") # NCR MP-RAS
+ );
+
+ my $inf = eval '2**1000000';
+
+ skip("Couldn't generate infinity - got error '$@'", 1)
unless defined $inf and $inf == $inf / 2 and $inf + 1 == $inf;
+ local our $TODO;
+ $TODO = "VOS needs a fix for posix-1022 to pass this test."
+ if ($^O eq 'vos');
+
eval { $x = pack 'w', $inf };
- like ($@, qr/^Cannot compress integer/);
+ like ($@, qr/^Cannot compress integer/, "Cannot compress integer");
}
SKIP: {
+
+ skip("-- the full range of an IEEE double may not be available in this configuration.", 3)
+ if (($^O eq 'VMS') && !defined($Config{useieee}));
+
+ skip("-- $^O does not like 2**1023", 3)
+ if (($^O eq 'ultrix'));
+
# This should be about the biggest thing possible on an IEEE double
my $big = eval '2**1023';
- skip "Couldn't generate 2**1023 - got error '$@'"
+ skip("Couldn't generate 2**1023 - got error '$@'", 3)
unless defined $big and $big != $big / 2;
eval { $x = pack 'w', $big };
# I'm getting about 1e-16 on FreeBSD
my $quotient = int (100 * ($y - $big) / $big);
ok($quotient < 2 && $quotient > -2,
- "Round trip pack, unpack 'w' of $big is withing 1% ($quotient%)");
+ "Round trip pack, unpack 'w' of $big is within 1% ($quotient%)");
}
}
-#
-# test the "p" template
+print "# test the 'p' template\n";
# literals
is(unpack("p",pack("p","foo")), "foo");
+is(unpack("p<",pack("p<","foo")), "foo");
+is(unpack("p>",pack("p>","foo")), "foo");
# scalars
is(unpack("p",pack("p",239)), 239);
+is(unpack("p<",pack("p<",239)), 239);
+is(unpack("p>",pack("p>",239)), 239);
# temps
sub foo { my $a = "a"; return $a . $a++ . $a++ }
}
# undef should give null pointer
-like(pack("p", undef), qr/^\0+/);
+like(pack("p", undef), qr/^\0+$/);
+like(pack("p<", undef), qr/^\0+$/);
+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
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";
+print "# test the pack lengths of s S i I l L n N v V + modifiers\n";
+
+my @lengths = (
+ qw(s 2 S 2 i -4 I -4 l 4 L 4 n 2 N 4 v 2 V 4 n! 2 N! 4 v! 2 V! 4),
+ 's!' => $Config{shortsize}, 'S!' => $Config{shortsize},
+ 'i!' => $Config{intsize}, 'I!' => $Config{intsize},
+ 'l!' => $Config{longsize}, 'L!' => $Config{longsize},
+);
+
+while (my ($base, $expect) = splice @lengths, 0, 2) {
+ my @formats = ($base);
+ $base =~ /^[nv]/i or push @formats, "$base>", "$base<";
+ for my $format (@formats) {
+ 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";
+ }
}
}
-# test unpack-pack lengths
-my @templates = qw(c C i I s S l L n N v V f d q Q);
+print "# test unpack-pack lengths\n";
-foreach my $t (@templates) {
- SKIP: {
- my @t = eval { unpack("$t*", pack("$t*", 12, 34)) };
+my @templates = qw(c C i I s S l L n N v V f d q Q);
- # quads not supported everywhere
- skip "Quads not supported", 4 if $@ =~ /Invalid type in pack/;
- is( $@, '' );
+foreach my $base (@templates) {
+ my @tmpl = ($base);
+ $base =~ /^[cnv]/i or push @tmpl, "$base>", "$base<";
+ foreach my $t (@tmpl) {
+ SKIP: {
+ my @t = eval { unpack("$t*", pack("$t*", 12, 34)) };
- is(scalar @t, 2);
+ skip "cannot pack '$t' on this perl", 4
+ if is_valid_error($@);
- SKIP: {
- skip "$t not expected to work for some reason", 2 if $t =~ /[nv]/i;
+ is( $@, '' );
+ is(scalar @t, 2);
is($t[0], 12);
is($t[1], 34);
}
}
-# packing native shorts/ints/longs
+print "# packing native shorts/ints/longs\n";
is(length(pack("s!", 0)), $Config{shortsize});
is(length(pack("i!", 0)), $Config{intsize});
is(length(pack("i!", 0)), length(pack("i", 0)));
sub numbers {
- my $format = shift;
- return numbers_with_total ($format, undef, @_);
+ my $base = shift;
+ my @formats = ($base);
+ $base =~ /^[silqjfdp]/i and push @formats, "$base>", "$base<";
+ for my $format (@formats) {
+ numbers_with_total ($format, undef, @_);
+ }
}
sub numbers_with_total {
$total += $_;
}
}
+ print "# numbers test for $format\n";
foreach (@_) {
SKIP: {
my $out = eval {unpack($format, pack($format, $_))};
- skip "cannot pack '$format' on this perl", 2 if
- $@ =~ /Invalid type in pack: '$format'/;
+ skip "cannot pack '$format' on this perl", 2
+ if is_valid_error($@);
is($@, '');
is($out, $_);
SKIP: {
my $sum = eval {unpack "%$_$format*", pack "$format*", @_};
skip "cannot pack '$format' on this perl", 3
- if $@ =~ /Invalid type in pack: '$format'/;
+ if is_valid_error($@);
is($@, '');
ok(defined $sum);
} else {
$calc_sum = $total;
# Shift into range by some multiple of the total
- my $mult = int ($total / $max_p1);
+ my $mult = $max_p1 ? int ($total / $max_p1) : undef;
# Need this to make sure that -1 + (~0+1) is ~0 (ie still integer)
$calc_sum = $total - $mult;
$calc_sum -= $mult * $max;
numbers ('v', 0, 1, 32767, 32768, 65535);
numbers ('N', 0, 1, 2147483647, 2147483648, 4294967295);
numbers ('V', 0, 1, 2147483647, 2147483648, 4294967295);
+numbers ('n!', -32768, -1, 0, 1, 32767);
+numbers ('v!', -32768, -1, 0, 1, 32767);
+numbers ('N!', -2147483648, -1, 0, 1, 2147483647);
+numbers ('V!', -2147483648, -1, 0, 1, 2147483647);
# 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);
0, 1,9223372036854775807, 9223372036854775808,
18446744073709551615);
-# pack nvNV byteorders
+print "# pack nvNV byteorders\n";
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");
+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 "# test big-/little-endian conversion\n";
+
+sub byteorder
+{
+ my $format = shift;
+ print "# byteorder test for $format\n";
+ for my $value (@_) {
+ SKIP: {
+ my($nat,$be,$le) = eval { map { pack $format.$_, $value } '', '>', '<' };
+ skip "cannot pack '$format' on this perl", 5
+ if is_valid_error($@);
+
+ print "# [$value][$nat][$be][$le][$@]\n";
+
+ SKIP: {
+ skip "cannot compare native byteorder with big-/little-endian", 1
+ if $ByteOrder eq 'unknown';
+
+ is($nat, $ByteOrder eq 'big' ? $be : $le);
+ }
+ is($be, reverse($le));
+ my @x = eval { unpack "$format$format>$format<", $nat.$be.$le };
+
+ print "# [$value][", join('][', @x), "][$@]\n";
+
+ is($@, '');
+ is($x[0], $x[1]);
+ is($x[0], $x[2]);
+ }
+ }
+}
+
+byteorder('s', -32768, -1, 0, 1, 32767);
+byteorder('S', 0, 1, 32767, 32768, 65535);
+byteorder('i', -2147483648, -1, 0, 1, 2147483647);
+byteorder('I', 0, 1, 2147483647, 2147483648, 4294967295);
+byteorder('l', -2147483648, -1, 0, 1, 2147483647);
+byteorder('L', 0, 1, 2147483647, 2147483648, 4294967295);
+byteorder('j', -2147483648, -1, 0, 1, 2147483647);
+byteorder('J', 0, 1, 2147483647, 2147483648, 4294967295);
+byteorder('s!', -32768, -1, 0, 1, 32767);
+byteorder('S!', 0, 1, 32767, 32768, 65535);
+byteorder('i!', -2147483648, -1, 0, 1, 2147483647);
+byteorder('I!', 0, 1, 2147483647, 2147483648, 4294967295);
+byteorder('l!', -2147483648, -1, 0, 1, 2147483647);
+byteorder('L!', 0, 1, 2147483647, 2147483648, 4294967295);
+byteorder('q', -9223372036854775808, -1, 0, 1, 9223372036854775807);
+byteorder('Q', 0, 1, 9223372036854775807, 9223372036854775808, 18446744073709551615);
+byteorder('f', -1, 0, 0.5, 42, 2**34);
+byteorder('F', -1, 0, 0.5, 42, 2**34);
+byteorder('d', -(2**34), -1, 0, 1, 2**34);
+byteorder('D', -(2**34), -1, 0, 1, 2**34);
+
+print "# test negative numbers\n";
+
+SKIP: {
+ skip "platform is not using two's complement for negative integers", 120
+ unless $IsTwosComplement;
+
+ for my $format (qw(s i l j s! i! l! q)) {
+ SKIP: {
+ my($nat,$be,$le) = eval { map { pack $format.$_, -1 } '', '>', '<' };
+ skip "cannot pack '$format' on this perl", 15
+ if is_valid_error($@);
+
+ my $len = length $nat;
+ is($_, "\xFF"x$len) for $nat, $be, $le;
+
+ my(@val,@ref);
+ if ($len >= 8) {
+ @val = (-2, -81985529216486896, -9223372036854775808);
+ @ref = ("\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFE",
+ "\xFE\xDC\xBA\x98\x76\x54\x32\x10",
+ "\x80\x00\x00\x00\x00\x00\x00\x00");
+ }
+ elsif ($len >= 4) {
+ @val = (-2, -19088744, -2147483648);
+ @ref = ("\xFF\xFF\xFF\xFE",
+ "\xFE\xDC\xBA\x98",
+ "\x80\x00\x00\x00");
+ }
+ else {
+ @val = (-2, -292, -32768);
+ @ref = ("\xFF\xFE",
+ "\xFE\xDC",
+ "\x80\x00");
+ }
+ for my $x (@ref) {
+ if ($len > length $x) {
+ $x = $x . "\xFF" x ($len - length $x);
+ }
+ }
+
+ for my $i (0 .. $#val) {
+ my($nat,$be,$le) = eval { map { pack $format.$_, $val[$i] } '', '>', '<' };
+ is($@, '');
+
+ SKIP: {
+ skip "cannot compare native byteorder with big-/little-endian", 1
+ if $ByteOrder eq 'unknown';
+
+ is($nat, $ByteOrder eq 'big' ? $be : $le);
+ }
+
+ is($be, $ref[$i]);
+ is($be, reverse($le));
+ }
+ }
+ }
+}
+
{
# /
my ($x, $y, $z);
eval { ($x) = unpack '/a*','hello' };
- like($@, qr!/ must follow a numeric type!);
+ like($@, qr!'/' must follow a numeric type!);
undef $x;
eval { $x = unpack '/a*','hello' };
- like($@, qr!/ must follow a numeric type!);
+ like($@, qr!'/' must follow a numeric type!);
undef $x;
eval { ($z,$x,$y) = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
undef $x;
eval { ($x) = pack '/a*','hello' };
- like($@, qr!Invalid type in pack: '/'!);
+ like($@, qr!Invalid type '/'!);
undef $x;
eval { $x = pack '/a*','hello' };
- like($@, qr!Invalid type in pack: '/'!);
+ like($@, qr!Invalid type '/'!);
$z = pack 'n/a* N/Z* w/A*','string','hi there ','etc';
my $expect = "\000\006string\0\0\0\012hi there \000\003etc";
{
local $SIG{__WARN__} = sub { $@ = "@_" };
my @null = unpack('U0U', chr(255));
- like($@, /^Malformed UTF-8 character /);
+ like($@, qr/^Malformed UTF-8 character /);
}
}
}
{
+ print "# group modifiers\n";
+
+ for my $t (qw{ (s<)< (sl>s)> (s(l(sl)<l)s)< }) {
+ print "# testing pattern '$t'\n";
+ eval { ($_) = unpack($t, 'x'x18); };
+ is($@, '');
+ eval { $_ = pack($t, (0)x6); };
+ is($@, '');
+ }
+
+ for my $t (qw{ (s<)> (sl>s)< (s(l(sl)<l)s)> }) {
+ print "# testing pattern '$t'\n";
+ eval { ($_) = unpack($t, 'x'x18); };
+ like($@, qr/Can't use '[<>]' in a group with different byte-order in unpack/);
+ eval { $_ = pack($t, (0)x6); };
+ like($@, qr/Can't use '[<>]' in a group with different byte-order in pack/);
+ }
+
+ sub compress_template {
+ my $t = shift;
+ for my $mod (qw( < > )) {
+ $t =~ s/((?:(?:[SILQJFDP]!?$mod|[^SILQJFDP\W]!?)(?:\d+|\*|\[(?:[^]]+)\])?\/?){2,})/
+ my $x = $1; $x =~ s!$mod!!g ? "($x)$mod" : $x /ieg;
+ }
+ return $t;
+ }
+
+ is(pack('L<L>', (0x12345678)x2),
+ pack('(((L1)1)<)(((L)1)1)>1', (0x12345678)x2));
+
+ my %templates = (
+ 's<' => [-42],
+ 's<c2x![S]S<' => [-42, -11, 12, 4711],
+ '(i<j<[s]l<)3' => [-11, -22, -33, 1000000, 1100, 2201, 3302,
+ -1000000, 32767, -32768, 1, -123456789 ],
+ '(I!<4(J<2L<)3)5' => [1 .. 65],
+ 'q<Q<' => [-50000000005, 60000000006],
+ 'f<F<d<' => [3.14159, 111.11, 2222.22],
+ 'D<cCD<' => [1e42, -128, 255, 1e-42],
+ 'n/a*' => ['/usr/bin/perl'],
+ 'C/a*S</A*L</Z*I</a*' => [qw(Just another Perl hacker)],
+ );
+
+ for my $tle (sort keys %templates) {
+ my @d = @{$templates{$tle}};
+ my $tbe = $tle;
+ $tbe =~ y/</>/;
+ for my $t ($tbe, $tle) {
+ my $c = compress_template($t);
+ print "# '$t' -> '$c'\n";
+ SKIP: {
+ my $p1 = eval { pack $t, @d };
+ skip "cannot pack '$t' on this perl", 5 if is_valid_error($@);
+ my $p2 = eval { pack $c, @d };
+ is($@, '');
+ is($p1, $p2);
+ s!(/[aAZ])\*!$1!g for $t, $c;
+ my @u1 = eval { unpack $t, $p1 };
+ is($@, '');
+ my @u2 = eval { unpack $c, $p2 };
+ is($@, '');
+ is(join('!', @u1), join('!', @u2));
+ }
+ }
+ }
+}
+
+{
# from Wolfgang Laun: fix in change #13163
my $s = 'ABC' x 10;
# from Wolfgang Laun: fix in change #13288
eval { my $t=unpack("P*", "abc") };
- like($@, qr/P must have an explicit size/);
+ like($@, qr/'P' must have an explicit size/);
}
{ # Grouping constructs
is("@a", "@b");
}
+{ # more on grouping (W.Laun)
+ use warnings;
+ my $warning;
+ local $SIG{__WARN__} = sub {
+ $warning = $_[0];
+ };
+ # @ absolute within ()-group
+ my $badc = pack( '(a)*', unpack( '(@1a @0a @2)*', 'abcd' ) );
+ is( $badc, 'badc' );
+ my @b = ( 1, 2, 3 );
+ my $buf = pack( '(@1c)((@2C)@3c)', @b );
+ is( $buf, "\0\1\0\0\2\3" );
+ my @a = unpack( '(@1c)((@2c)@3c)', $buf );
+ is( "@a", "@b" );
+
+ # various unpack count/code scenarios
+ my @Env = ( a => 'AAA', b => 'BBB' );
+ my $env = pack( 'S(S/A*S/A*)*', @Env/2, @Env );
+
+ # unpack full length - ok
+ my @pup = unpack( 'S/(S/A* S/A*)', $env );
+ is( "@pup", "@Env" );
+
+ # warn when count/code goes beyond end of string
+ # \0002 \0001 a \0003 AAA \0001 b \0003 BBB
+ # 2 4 5 7 10 1213
+ eval { @pup = unpack( 'S/(S/A* S/A*)', substr( $env, 0, 13 ) ) };
+ like( $@, qr{length/code after end of string} );
+
+ # postfix repeat count
+ $env = pack( '(S/A* S/A*)' . @Env/2, @Env );
+
+ # warn when count/code goes beyond end of string
+ # \0001 a \0003 AAA \0001 b \0003 BBB
+ # 2 3c 5 8 10 11 13 16
+ eval { @pup = unpack( '(S/A* S/A*)' . @Env/2, substr( $env, 0, 11 ) ) };
+ like( $@, qr{length/code after end of string} );
+
+ # catch stack overflow/segfault
+ eval { $_ = pack( ('(' x 105) . 'A' . (')' x 105) ); };
+ like( $@, qr{Too deeply nested \(\)-groups} );
+}
+
+{ # syntax checks (W.Laun)
+ use warnings;
+ my @warning;
+ local $SIG{__WARN__} = sub {
+ push( @warning, $_[0] );
+ };
+ eval { my $s = pack( 'Ax![4c]A', 1..5 ); };
+ like( $@, qr{Malformed integer in \[\]} );
+
+ eval { my $buf = pack( '(c/*a*)', 'AAA', 'BB' ); };
+ like( $@, qr{'/' does not take a repeat count} );
+
+ eval { my @inf = unpack( 'c/1a', "\x03AAA\x02BB" ); };
+ like( $@, qr{'/' does not take a repeat count} );
+
+ eval { my @inf = unpack( 'c/*a', "\x03AAA\x02BB" ); };
+ like( $@, qr{'/' does not take a repeat count} );
+
+ # white space where possible
+ my @Env = ( a => 'AAA', b => 'BBB' );
+ my $env = pack( ' S ( S / A* S / A* )* ', @Env/2, @Env );
+ my @pup = unpack( ' S / ( S / A* S / A* ) ', $env );
+ is( "@pup", "@Env" );
+
+ # white space in 4 wrong places
+ for my $temp ( 'A ![4]', 'A [4]', 'A *', 'A 4' ){
+ eval { my $s = pack( $temp, 'B' ); };
+ like( $@, qr{Invalid type } );
+ }
+
+ # warning for commas
+ @warning = ();
+ my $x = pack( 'I,A', 4, 'X' );
+ like( $warning[0], qr{Invalid type ','} );
+
+ # comma warning only once
+ @warning = ();
+ $x = pack( 'C(C,C)C,C', 65..71 );
+ like( scalar @warning, 1 );
+
+ # forbidden code in []
+ eval { my $x = pack( 'A[@4]', 'XXXX' ); };
+ like( $@, qr{Within \[\]-length '\@' not allowed} );
+
+ # @ repeat default 1
+ my $s = pack( 'AA@A', 'A', 'B', 'C' );
+ my @c = unpack( 'AA@A', $s );
+ is( $s, 'AC' );
+ is( "@c", "A C C" );
+
+ # no unpack code after /
+ eval { my @a = unpack( "C/", "\3" ); };
+ like( $@, qr{Code missing after '/'} );
+
+ # modifier warnings
+ @warning = ();
+ $x = pack "I>>s!!", 47, 11;
+ ($x) = unpack "I<<l!>!>", 'x'x20;
+ is(scalar @warning, 5);
+ like($warning[0], qr/Duplicate modifier '>' after 'I' in pack/);
+ like($warning[1], qr/Duplicate modifier '!' after 's' in pack/);
+ like($warning[2], qr/Duplicate modifier '<' after 'I' in unpack/);
+ like($warning[3], qr/Duplicate modifier '!' after 'l' in unpack/);
+ like($warning[4], qr/Duplicate modifier '>' after 'l' in unpack/);
+}
+
{ # Repeat count [SUBEXPR]
my @codes = qw( x A Z a c C B b H h s v n S i I l V N L p P f F d
s! S! i! I! l! L! j J);
if (eval { pack 'q', 1 } ) {
push @codes, qw(q Q);
} else {
- push @codes, qw(c C); # Keep the count the same
+ push @codes, qw(s S); # Keep the count the same
}
if (eval { pack 'D', 1 } ) {
push @codes, 'D';
push @codes, 'd'; # Keep the count the same
}
+ push @codes, map { /^[silqjfdp]/i ? ("$_<", "$_>") : () } @codes;
+
my %val;
@val{@codes} = map { / [Xx] (?{ undef })
| [AZa] (?{ 'something' })
$c = $1 if $groupend =~ /(\d+)/;
my @list2 = (@list1) x $c;
- my $junk1 = "$groupbegin $type$count $groupend";
- # print "# junk1=$junk1\n";
- my $p = pack $junk1, @list2;
- my $half = int( (length $p)/2 );
- for my $move ('', "X$half", "X!$half", 'x1', 'x!8', "x$half") {
- my $junk = "$junk1 $move";
- # print "# junk='$junk', list=(@list2)\n";
- $p = pack "$junk $end", @list2, @end;
- my @l = unpack "x[$junk] $end", $p;
- is(scalar @l, scalar @end);
- is("@l", "@end", "skipping x[$junk]");
- }
+ SKIP: {
+ my $junk1 = "$groupbegin $type$count $groupend";
+ # print "# junk1=$junk1\n";
+ my $p = eval { pack $junk1, @list2 };
+ skip "cannot pack '$type' on this perl", 12
+ if is_valid_error($@);
+
+ my $half = int( (length $p)/2 );
+ for my $move ('', "X$half", "X!$half", 'x1', 'x!8', "x$half") {
+ my $junk = "$junk1 $move";
+ # print "# junk='$junk', list=(@list2)\n";
+ $p = pack "$junk $end", @list2, @end;
+ my @l = unpack "x[$junk] $end", $p;
+ is(scalar @l, scalar @end);
+ is("@l", "@end", "skipping x[$junk]");
+ }
+ }
}
}
}
SKIP: {
my $t = eval { unpack("D*", pack("D", 12.34)) };
- skip "Long doubles not in use", 56 if $@ =~ /Invalid type in pack/;
+ skip "Long doubles not in use", 166 if $@ =~ /Invalid type/;
is(length(pack("D", 0)), $Config{longdblsize});
numbers ('D', -(2**34), -1, 0, 1, 2**34);
SKIP: {
my $packed = eval {pack "${template}4", 1, 4, 9, 16};
if ($@) {
- die unless $@ =~ /Invalid type in pack: '$template'/;
+ die unless $@ =~ /Invalid type '$template'/;
skip ("$template not supported on this perl",
$cant_checksum{$template} ? 4 : 8);
}
}
}
}
+
+ok(pack('u2', 'AA'), "[perl #8026]"); # used to hang and eat RAM in perl 5.7.2
+
+$_ = pack('c', 65); # 'A' would not be EBCDIC-friendly
+is(unpack('c'), 65, "one-arg unpack (change #18751)"); # defaulting to $_
+
+{
+ my $a = "X\t01234567\n" x 100;
+ my @a = unpack("(a1 c/a)*", $a);
+ is(scalar @a, 200, "[perl #15288]");
+ is($a[-1], "01234567\n", "[perl #15288]");
+ is($a[-2], "X", "[perl #15288]");
+}
projects / p5sagit/p5-mst-13.2.git / blobdiff