15 my $Is_EBCDIC = (defined $Config{ebcdic} && $Config{ebcdic} eq 'define');
16 my $Perl = which_perl();
19 my @result = map {_qq($_)} @_;
23 return '(' . join (', ', @result) . ')';
29 return 0 unless @$l == @$r;
31 if (defined $l->[$i]) {
32 return 0 unless defined ($r->[$i]) && $l->[$i] eq $r->[$i];
34 return 0 if defined $r->[$i]
40 ##############################################################################
42 # Here starteth the tests
46 my $format = "c2 x5 C C x s d i l a6";
47 # Need the expression in here to force ary[5] to be numeric. This avoids
48 # test2 failing because ary2 goes str->numeric->str and ary doesn't.
49 my @ary = (1,-100,127,128,32767,987.654321098 / 100.0,12345,123456,
51 my $foo = pack($format,@ary);
52 my @ary2 = unpack($format,$foo);
56 my $out1=join(':',@ary);
57 my $out2=join(':',@ary2);
58 # Using long double NVs may introduce greater accuracy than wanted.
59 $out1 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
60 $out2 =~ s/:9\.87654321097999\d*:/:9.87654321098:/;
65 # How about counting bits?
69 is( ($x = unpack("%32B*", "\001\002\004\010\020\040\100\200\377")), 16 );
71 is( ($x = unpack("%32b69", "\001\002\004\010\020\040\100\200\017")), 12 );
73 is( ($x = unpack("%32B69", "\001\002\004\010\020\040\100\200\017")), 9 );
77 my $sum = 129; # ASCII
78 $sum = 103 if $Is_EBCDIC;
81 is( ($x = unpack("%32B*", "Now is the time for all good blurfl")), $sum );
84 open(BIN, $Perl) || die "Can't open $Perl: $!\n";
85 sysread BIN, $foo, 8192;
88 $sum = unpack("%32b*", $foo);
89 my $longway = unpack("b*", $foo);
90 is( $sum, $longway =~ tr/1/1/ );
95 is( ($x = unpack("I",pack("I", 0xFFFFFFFF))), 0xFFFFFFFF );
100 my @x = (5,130,256,560,32000,3097152,268435455,1073741844, 2**33,
101 '4503599627365785','23728385234614992549757750638446');
102 my $x = pack('w*', @x);
103 my $y = pack 'H*', '0581028200843081fa0081bd8440ffffff7f8480808014A0808'.
104 '0800087ffffffffffdb19caefe8e1eeeea0c2e1e3e8ede1ee6e';
108 my @y = unpack('w*', $y);
110 while ($a = pop @x) {
115 @y = unpack('w2', $x);
119 $x = pack('w*', 5000000000); $y = '';
122 $y = pack('w*', Math::BigInt::->new(5000000000));
127 $y = pack 'w', (~0).'';
129 is(unpack ('w',$x), ~0);
130 is(unpack ('w',$y), ~0);
132 $x = pack 'w', ~0 - 1;
133 $y = pack 'w', (~0) - 2;
135 if (~0 - 1 == (~0) - 2) {
136 is($x, $y, "NV arithmetic");
138 isnt($x, $y, "IV/NV arithmetic");
140 cmp_ok(unpack ('w',$x), '==', ~0 - 1);
141 cmp_ok(unpack ('w',$y), '==', ~0 - 2);
143 # These should spot that pack 'w' is using NV, not double, on platforms
144 # where IVs are smaller than doubles, and harmlessly pass elsewhere.
145 # (tests for change 16861)
153 is($x, $y, "NV arithmetic");
155 isnt($x, $y, "IV/NV arithmetic");
157 cmp_ok(unpack ('w',$x), '==', $x0);
158 cmp_ok(unpack ('w',$y), '==', $y0);
165 eval { $x = unpack 'w', pack 'C*', 0xff, 0xff};
166 like($@, qr/^Unterminated compressed integer/);
168 eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff};
169 like($@, qr/^Unterminated compressed integer/);
171 eval { $x = unpack 'w', pack 'C*', 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff};
172 like($@, qr/^Unterminated compressed integer/);
174 eval { $x = pack 'w', -1 };
175 like ($@, qr/^Cannot compress negative numbers/);
177 eval { $x = pack 'w', '1'x(1 + length ~0) . 'e0' };
178 like ($@, qr/^Can only compress unsigned integers/);
181 # Is this a stupid thing to do on VMS, VOS and other unusual platforms?
182 my $inf = eval '2**10000';
184 skip "Couldn't generate infinity - got error '$@'"
185 unless defined $inf and $inf == $inf / 2 and $inf + 1 == $inf;
188 $TODO = "VOS needs a fix for posix-1022 to pass this test."
191 eval { $x = pack 'w', $inf };
192 like ($@, qr/^Cannot compress integer/, "Cannot compress integer");
196 # This should be about the biggest thing possible on an IEEE double
197 my $big = eval '2**1023';
199 skip "Couldn't generate 2**1023 - got error '$@'", 3
200 unless defined $big and $big != $big / 2;
202 eval { $x = pack 'w', $big };
203 is ($@, '', "Should be able to pack 'w', $big # 2**1023");
205 my $y = eval {unpack 'w', $x};
207 "Should be able to unpack 'w' the result of pack 'w', $big # 2**1023");
209 # I'm getting about 1e-16 on FreeBSD
210 my $quotient = int (100 * ($y - $big) / $big);
211 ok($quotient < 2 && $quotient > -2,
212 "Round trip pack, unpack 'w' of $big is withing 1% ($quotient%)");
218 # test the "p" template
221 is(unpack("p",pack("p","foo")), "foo");
224 is(unpack("p",pack("p",239)), 239);
227 sub foo { my $a = "a"; return $a . $a++ . $a++ }
231 local $SIG{__WARN__} = sub {
234 my $junk = pack("p", &foo);
236 like($warning, qr/temporary val/);
239 # undef should give null pointer
240 like(pack("p", undef), qr/^\0+/);
242 # Check for optimizer bug (e.g. Digital Unix GEM cc with -O4 on DU V4.0B gives
243 # 4294967295 instead of -1)
244 # see #ifdef __osf__ in pp.c pp_unpack
245 is((unpack("i",pack("i",-1))), -1);
247 # test the pack lengths of s S i I l L
248 # test the pack lengths of n N v V
249 my @lengths = qw(s 2 S 2 i -4 I -4 l 4 L 4 n 2 N 4 v 2 V 4);
250 while (my ($format, $expect) = splice @lengths, 0, 2) {
251 my $len = length(pack($format, 0));
253 is($expect, $len, "format '$format'");
256 ok ($len >= $expect, "format '$format'") ||
257 print "# format '$format' has length $len, expected >= $expect\n";
262 # test unpack-pack lengths
263 my @templates = qw(c C i I s S l L n N v V f d q Q);
265 foreach my $t (@templates) {
267 my @t = eval { unpack("$t*", pack("$t*", 12, 34)) };
269 # quads not supported everywhere
270 skip "Quads not supported", 4 if $@ =~ /Invalid type/;
276 skip "$t not expected to work for some reason", 2 if $t =~ /[nv]/i;
287 # Note that first uuencoding known 'text' data and then checking the
288 # binary values of the uuencoded version would not be portable between
289 # character sets. Uuencoding is meant for encoding binary data, not
292 my $in = pack 'C*', 0 .. 255;
294 # just to be anal, we do some random tr/`/ /
296 M` $"`P0%!@<("0H+# T.#Q`1$A,4%187&!D:&QP='A\@(2(C)"4F)R@I*BLL
297 M+2XO,#$R,S0U-C<X.3H[/#T^/T!!0D-$149'2$E*2TQ-3D]045)35%565UA9
298 M6EM<75Y?8&%B8V1E9F=H:6IK;&UN;W!Q<G-T=79W>'EZ>WQ]?G^`@8*#A(6&
299 MAXB)BHN,C8Z/D)&2DY25EI>8F9J;G)V>GZ"AHJ.DI::GJ*FJJZRMKJ^PL;*S
300 MM+6VM[BYNKN\O;Z_P,'"P\3%QL?(R<K+S,W.S]#1TM/4U=;7V-G:V]S=WM_@
301 ?X>+CY.7FY^CIZNOL[>[O\/'R\_3U]O?X^?K[_/W^_P `
307 is(pack('u', $in), $_);
309 is(unpack('u', $uu), $in);
311 $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";
313 M'XL("%C<Q#4"`TI!4%4`\RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>("`&1F
317 is(unpack('u', $uu), $in);
319 # This is identical to the above except that backquotes have been
323 M'XL("%C<Q#4" TI!4%4 \RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>(" &1F
328 is(unpack('u', $uu), $in);
332 # test the ascii template types (A, a, Z)
335 ['p', 'A*', "foo\0bar\0 ", "foo\0bar\0 "],
336 ['p', 'A11', "foo\0bar\0 ", "foo\0bar\0 "],
337 ['u', 'A*', "foo\0bar \0", "foo\0bar"],
338 ['u', 'A8', "foo\0bar \0", "foo\0bar"],
339 ['p', 'a*', "foo\0bar\0 ", "foo\0bar\0 "],
340 ['p', 'a11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
341 ['u', 'a*', "foo\0bar \0", "foo\0bar \0"],
342 ['u', 'a8', "foo\0bar \0", "foo\0bar "],
343 ['p', 'Z*', "foo\0bar\0 ", "foo\0bar\0 \0"],
344 ['p', 'Z11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
345 ['p', 'Z3', "foo", "fo\0"],
346 ['u', 'Z*', "foo\0bar \0", "foo"],
347 ['u', 'Z8', "foo\0bar \0", "foo"],
350 my ($what, $template, $in, $out) = @$_;
351 my $got = $what eq 'u' ? (unpack $template, $in) : (pack $template, $in);
352 unless (is($got, $out)) {
353 my $un = $what eq 'u' ? 'un' : '';
354 print "# ${un}pack ('$template', "._qq($in).') gave '._qq($out).
355 ' not '._qq($got)."\n";
359 # packing native shorts/ints/longs
361 is(length(pack("s!", 0)), $Config{shortsize});
362 is(length(pack("i!", 0)), $Config{intsize});
363 is(length(pack("l!", 0)), $Config{longsize});
364 ok(length(pack("s!", 0)) <= length(pack("i!", 0)));
365 ok(length(pack("i!", 0)) <= length(pack("l!", 0)));
366 is(length(pack("i!", 0)), length(pack("i", 0)));
370 return numbers_with_total ($format, undef, @_);
373 sub numbers_with_total {
376 if (!defined $total) {
383 my $out = eval {unpack($format, pack($format, $_))};
384 skip "cannot pack '$format' on this perl", 2 if
385 $@ =~ /Invalid type '$format'/;
392 my $skip_if_longer_than = ~0; # "Infinity"
394 # If we're running with -DNO_PERLPRESERVE_IVUV and NVs don't preserve all
395 # UVs (in which case ~0 is NV, ~0-1 will be the same NV) then we can't
396 # correctly in perl calculate UV totals for long checksums, as pp_unpack
397 # is using UV maths, and we've only got NVs.
398 $skip_if_longer_than = $Config{nv_preserves_uv_bits};
401 foreach ('', 1, 2, 3, 15, 16, 17, 31, 32, 33, 53, 54, 63, 64, 65) {
403 my $sum = eval {unpack "%$_$format*", pack "$format*", @_};
404 skip "cannot pack '$format' on this perl", 3
405 if $@ =~ /Invalid type '$format'/;
410 my $len = $_; # Copy, so that we can reassign ''
411 $len = 16 unless length $len;
414 skip "cannot test checksums over $skip_if_longer_than bits", 1
415 if $len > $skip_if_longer_than;
417 # Our problem with testing this portably is that the checksum code in
418 # pp_unpack is able to cast signed to unsigned, and do modulo 2**n
419 # arithmetic in unsigned ints, which perl has no operators to do.
420 # (use integer; does signed ints, which won't wrap on UTS, which is just
421 # fine with ANSI, but not with most people's assumptions.
422 # This is why we need to supply the totals for 'Q' as there's no way in
423 # perl to calculate them, short of unpack '%0Q' (is that documented?)
424 # ** returns NVs; make sure it's IV.
425 my $max = 1 + 2 * (int (2 ** ($len-1))-1); # The max possible checksum
426 my $max_p1 = $max + 1;
427 my ($max_is_integer, $max_p1_is_integer);
428 $max_p1_is_integer = 1 unless $max_p1 + 1 == $max_p1;
429 $max_is_integer = 1 if $max - 1 < ~0;
433 $calc_sum = &$total($len);
436 # Shift into range by some multiple of the total
437 my $mult = int ($total / $max_p1);
438 # Need this to make sure that -1 + (~0+1) is ~0 (ie still integer)
439 $calc_sum = $total - $mult;
440 $calc_sum -= $mult * $max;
446 if ($calc_sum == $calc_sum - 1 && $calc_sum == $max_p1) {
447 # we're into floating point (either by getting out of the range of
448 # UV arithmetic, or because we're doing a floating point checksum)
449 # and our calculation of the checksum has become rounded up to
454 if ($calc_sum == $sum) { # HAS to be ==, not eq (so no is()).
455 ok ("unpack '%$_$format' gave $sum");
457 my $delta = 1.000001;
458 if ($format =~ tr /dDfF//
459 && ($calc_sum <= $sum * $delta && $calc_sum >= $sum / $delta)) {
460 pass ("unpack '%$_$format' gave $sum, expected $calc_sum");
462 my $text = ref $total ? &$total($len) : $total;
464 print "# For list (" . join (", ", @_) . ") (total $text)"
465 . " packed with $format unpack '%$_$format' gave $sum,"
466 . " expected $calc_sum\n";
474 numbers ('c', -128, -1, 0, 1, 127);
475 numbers ('C', 0, 1, 127, 128, 255);
476 numbers ('s', -32768, -1, 0, 1, 32767);
477 numbers ('S', 0, 1, 32767, 32768, 65535);
478 numbers ('i', -2147483648, -1, 0, 1, 2147483647);
479 numbers ('I', 0, 1, 2147483647, 2147483648, 4294967295);
480 numbers ('l', -2147483648, -1, 0, 1, 2147483647);
481 numbers ('L', 0, 1, 2147483647, 2147483648, 4294967295);
482 numbers ('s!', -32768, -1, 0, 1, 32767);
483 numbers ('S!', 0, 1, 32767, 32768, 65535);
484 numbers ('i!', -2147483648, -1, 0, 1, 2147483647);
485 numbers ('I!', 0, 1, 2147483647, 2147483648, 4294967295);
486 numbers ('l!', -2147483648, -1, 0, 1, 2147483647);
487 numbers ('L!', 0, 1, 2147483647, 2147483648, 4294967295);
488 numbers ('n', 0, 1, 32767, 32768, 65535);
489 numbers ('v', 0, 1, 32767, 32768, 65535);
490 numbers ('N', 0, 1, 2147483647, 2147483648, 4294967295);
491 numbers ('V', 0, 1, 2147483647, 2147483648, 4294967295);
492 # All these should have exact binary representations:
493 numbers ('f', -1, 0, 0.5, 42, 2**34);
494 numbers ('d', -(2**34), -1, 0, 1, 2**34);
495 ## These don't, but 'd' is NV. XXX wrong, it's double
496 #numbers ('d', -1, 0, 1, 1-exp(-1), -exp(1));
498 numbers_with_total ('q', -1,
499 -9223372036854775808, -1, 0, 1,9223372036854775807);
500 # This total is icky, but the true total is 2**65-1, and need a way to generate
501 # the epxected checksum on any system including those where NVs can preserve
502 # 65 bits. (long double is 128 bits on sparc, so they certainly can)
503 # or where rounding is down not up on binary conversion (crays)
504 numbers_with_total ('Q', sub {
506 $len = 65 if $len > 65; # unmasked total is 2**65-1 here
507 my $total = 1 + 2 * (int (2**($len - 1)) - 1);
508 return 0 if $total == $total - 1; # Overflowed integers
509 return $total; # NVs still accurate to nearest integer
511 0, 1,9223372036854775807, 9223372036854775808,
512 18446744073709551615);
514 # pack nvNV byteorders
516 is(pack("n", 0xdead), "\xde\xad");
517 is(pack("v", 0xdead), "\xad\xde");
518 is(pack("N", 0xdeadbeef), "\xde\xad\xbe\xef");
519 is(pack("V", 0xdeadbeef), "\xef\xbe\xad\xde");
525 eval { ($x) = unpack '/a*','hello' };
526 like($@, qr!'/' must follow a numeric type!);
528 eval { $x = unpack '/a*','hello' };
529 like($@, qr!'/' must follow a numeric type!);
532 eval { ($z,$x,$y) = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
538 eval { $z = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
544 eval { ($x) = pack '/a*','hello' };
545 like($@, qr!Invalid type '/'!);
547 eval { $x = pack '/a*','hello' };
548 like($@, qr!Invalid type '/'!);
550 $z = pack 'n/a* N/Z* w/A*','string','hi there ','etc';
551 my $expect = "\000\006string\0\0\0\012hi there \000\003etc";
555 $expect = 'hello world';
556 eval { ($x) = unpack ("w/a", chr (11) . "hello world!")};
561 # Doing this in scalar context used to fail.
562 eval { $x = unpack ("w/a", chr (11) . "hello world!")};
567 ['a/a*/a*', '212ab345678901234567','ab3456789012'],
568 ['a/a*/a*', '3012ab345678901234567', 'ab3456789012'],
569 ['a/a*/b*', '212ab', $Is_EBCDIC ? '100000010100' : '100001100100'],
572 my ($pat, $in, $expect) = @$_;
574 eval { ($x) = unpack $pat, $in };
577 printf "# list unpack ('$pat', '$in') gave %s, expected '$expect'\n",
581 eval { $x = unpack $pat, $in };
584 printf "# scalar unpack ('$pat', '$in') gave %s, expected '$expect'\n",
590 my $pattern = <<'EOU';
591 a3/A # Count in ASCII
592 C/a* # Count in a C char
593 C/Z # Count in a C char but skip after \0
597 eval { ($z,$x,$y) = unpack $pattern, "003ok \003yes\004z\000abc" };
603 eval { $z = unpack $pattern, "003ok \003yes\004z\000abc" };
608 n/a* # Count as network short
609 w/A* # Count a BER integer
611 $expect = "\000\006string\003etc";
612 $z = pack $pattern,'string','etc';
618 skip("(EBCDIC and) version strings are bad idea", 2) if $Is_EBCDIC;
620 is("1.20.300.4000", sprintf "%vd", pack("U*",1,20,300,4000));
621 is("1.20.300.4000", sprintf "%vd", pack(" U*",1,20,300,4000));
623 isnt(v1.20.300.4000, sprintf "%vd", pack("C0U*",1,20,300,4000));
625 my $rslt = $Is_EBCDIC ? "156 67" : "199 162";
626 is(join(" ", unpack("C*", chr(0x1e2))), $rslt);
628 # does pack U create Unicode?
629 is(ord(pack('U', 300)), 300);
631 # does unpack U deref Unicode?
632 is((unpack('U', chr(300)))[0], 300);
634 # is unpack U the reverse of pack U for Unicode string?
635 is("@{[unpack('U*', pack('U*', 100, 200, 300))]}", "100 200 300");
637 # is unpack U the reverse of pack U for byte string?
638 is("@{[unpack('U*', pack('U*', 100, 200))]}", "100 200");
642 skip "Not for EBCDIC", 4 if $Is_EBCDIC;
644 # does unpack C unravel pack U?
645 is("@{[unpack('C*', pack('U*', 100, 200))]}", "100 195 136");
647 # does pack U0C create Unicode?
648 is("@{[pack('U0C*', 100, 195, 136)]}", v100.v200);
650 # does pack C0U create characters?
651 is("@{[pack('C0U*', 100, 200)]}", pack("C*", 100, 195, 136));
653 # does unpack U0U on byte data warn?
655 local $SIG{__WARN__} = sub { $@ = "@_" };
656 my @null = unpack('U0U', chr(255));
657 like($@, /^Malformed UTF-8 character /);
662 my $p = pack 'i*', -2147483648, ~0, 0, 1, 2147483647;
664 # bug - % had to be at the start of the pattern, no leading whitespace or
665 # comments. %i! didn't work at all.
666 foreach my $pat ('%32i*', ' %32i*', "# Muhahahaha\n%32i*", '%32i* ',
667 '%32i!*', ' %32i!*', "\n#\n#\n\r \t\f%32i!*", '%32i!*#') {
668 @a = unpack $pat, $p;
669 is($a[0], 0xFFFFFFFF) || print "# $pat\n";
670 @a = scalar unpack $pat, $p;
671 is($a[0], 0xFFFFFFFF) || print "# $pat\n";
675 $p = pack 'I*', 42, 12;
676 # Multiline patterns in scalar context failed.
677 foreach my $pat ('I', <<EOPOEMSNIPPET, 'I#I', 'I # I', 'I # !!!') {
678 # On the Ning Nang Nong
679 # Where the Cows go Bong!
680 # And the Monkeys all say Boo!
683 @a = unpack $pat, $p;
686 @a = scalar unpack $pat, $p;
691 # shorts (of all flavours) didn't calculate checksums > 32 bits with floating
692 # point, so a pathologically long pattern would wrap at 32 bits.
693 my $pat = "\xff\xff"x65538; # Start with it long, to save any copying.
694 foreach (4,3,2,1,0) {
695 my $len = 65534 + $_;
696 is(unpack ("%33n$len", $pat), 65535 * $len);
706 ['xXa*', "Nick", "Nick"],
707 ['a5Xa5', "cameL", "llama", "camellama"],
709 ['a*@8a*', 'Camel', 'Dromedary', "Camel\0\0\0Dromedary"],
710 ['a*@4a', 'Perl rules', '!', 'Perl!'],
713 my ($template, @in) = @$_;
715 my $got = eval {pack $template, @in};
718 printf "# pack ('$template', %s) gave %s expected %s\n",
719 encode_list (@in), encode_list ($got), encode_list ($out);
726 ['xXa*', "Nick", "Nick"],
727 ['a5Xa5', "camellama", "camel", "llama"],
729 ['@2a2', "water", "te"],
730 ['a*@1a3', "steam", "steam", "tea"],
733 my ($template, $in, @out) = @$_;
734 my @got = eval {unpack $template, $in};
736 ok (list_eq (\@got, \@out)) ||
737 printf "# list unpack ('$template', %s) gave %s expected %s\n",
738 _qq($in), encode_list (@got), encode_list (@out);
740 my $got = eval {unpack $template, $in};
742 @out ? is( $got, $out[0] ) # 1 or more items; should get first
743 : ok( !defined $got ) # 0 items; should get undef
744 or printf "# scalar unpack ('$template', %s) gave %s expected %s\n",
745 _qq($in), encode_list ($got), encode_list ($out[0]);
750 my ($u, $v) = qw(foo xyzzy);
751 my $p = pack($t, $u, $v);
752 my @u = unpack($t, $p);
759 is((unpack("w/a*", "\x02abc"))[0], "ab");
761 # "w/a*" should be seen as one unit
763 is(scalar unpack("w/a*", "\x02abc"), "ab");
767 # from Wolfgang Laun: fix in change #13163
772 my $buf = pack( 'Z*/A* C', $s, $x );
776 $h =~ s/[^[:print:]]/./g;
777 ( $s, $y ) = unpack( "Z*/A* C", $buf );
778 is($h, "30.ABCABCABCABCABCABCABCABCABCABC$t");
780 is($s, "ABCABCABCABCABCABCABCABCABCABC");
785 # from Wolfgang Laun: fix in change #13288
787 eval { my $t=unpack("P*", "abc") };
788 like($@, qr/'P' must have an explicit size/);
791 { # Grouping constructs
793 @a = unpack '(SL)', pack 'SLSLSL', 67..90;
795 @a = unpack '(SL)3', pack 'SLSLSL', 67..90;
798 @a = unpack '(SL)3', pack 'SLSLSLSL', 67..90;
800 @a = unpack '(SL)[3]', pack 'SLSLSLSL', 67..90;
802 @a = unpack '(SL)[2] SL', pack 'SLSLSLSL', 67..90;
804 @a = unpack 'A/(SL)', pack 'ASLSLSLSL', 3, 67..90;
806 @a = unpack 'A/(SL)SL', pack 'ASLSLSLSL', 2, 67..90;
808 @a = unpack '(SL)*', pack 'SLSLSLSL', 67..90;
811 @a = unpack '(SL)*SL', pack 'SLSLSLSL', 67..90;
813 eval { @a = unpack '(*SL)', '' };
814 like($@, qr/\(\)-group starts with a count/);
815 eval { @a = unpack '(3SL)', '' };
816 like($@, qr/\(\)-group starts with a count/);
817 eval { @a = unpack '([3]SL)', '' };
818 like($@, qr/\(\)-group starts with a count/);
819 eval { @a = pack '(*SL)' };
820 like($@, qr/\(\)-group starts with a count/);
821 @a = unpack '(SL)3 SL', pack '(SL)4', 67..74;
823 @a = unpack '(SL)3 SL', pack '(SL)[4]', 67..74;
825 @a = unpack '(SL)3 SL', pack '(SL)*', 67..74;
829 { # more on grouping (W.Laun)
832 local $SIG{__WARN__} = sub {
835 # @ absolute within ()-group
836 my $badc = pack( '(a)*', unpack( '(@1a @0a @2)*', 'abcd' ) );
839 my $buf = pack( '(@1c)((@2C)@3c)', @b );
840 is( $buf, "\0\1\0\0\2\3" );
841 my @a = unpack( '(@1c)((@2c)@3c)', $buf );
844 # various unpack count/code scenarios
845 my @Env = ( a => 'AAA', b => 'BBB' );
846 my $env = pack( 'S(S/A*S/A*)*', @Env/2, @Env );
848 # unpack full length - ok
849 my @pup = unpack( 'S/(S/A* S/A*)', $env );
850 is( "@pup", "@Env" );
852 # warn when count/code goes beyond end of string
853 # \0002 \0001 a \0003 AAA \0001 b \0003 BBB
855 eval { @pup = unpack( 'S/(S/A* S/A*)', substr( $env, 0, 13 ) ) };
856 like( $@, qr{length/code after end of string} );
858 # postfix repeat count
859 $env = pack( '(S/A* S/A*)' . @Env/2, @Env );
861 # warn when count/code goes beyond end of string
862 # \0001 a \0003 AAA \0001 b \0003 BBB
863 # 2 3c 5 8 10 11 13 16
864 eval { @pup = unpack( '(S/A* S/A*)' . @Env/2, substr( $env, 0, 11 ) ) };
865 like( $@, qr{length/code after end of string} );
867 # catch stack overflow/segfault
868 eval { $_ = pack( ('(' x 105) . 'A' . (')' x 105) ); };
869 like( $@, qr{Too deeply nested \(\)-groups} );
872 { # syntax checks (W.Laun)
875 local $SIG{__WARN__} = sub {
876 push( @warning, $_[0] );
878 eval { my $s = pack( 'Ax![4c]A', 1..5 ); };
879 like( $@, qr{Malformed integer in \[\]} );
881 eval { my $buf = pack( '(c/*a*)', 'AAA', 'BB' ); };
882 like( $@, qr{'/' does not take a repeat count} );
884 eval { my @inf = unpack( 'c/1a', "\x03AAA\x02BB" ); };
885 like( $@, qr{'/' does not take a repeat count} );
887 eval { my @inf = unpack( 'c/*a', "\x03AAA\x02BB" ); };
888 like( $@, qr{'/' does not take a repeat count} );
890 # white space where possible
891 my @Env = ( a => 'AAA', b => 'BBB' );
892 my $env = pack( ' S ( S / A* S / A* )* ', @Env/2, @Env );
893 my @pup = unpack( ' S / ( S / A* S / A* ) ', $env );
894 is( "@pup", "@Env" );
896 # white space in 4 wrong places
897 for my $temp ( 'A ![4]', 'A [4]', 'A *', 'A 4' ){
898 eval { my $s = pack( $temp, 'B' ); };
899 like( $@, qr{Invalid type } );
904 my $x = pack( 'I,A', 4, 'X' );
905 like( $warning[0], qr{Invalid type ','} );
907 # comma warning only once
909 $x = pack( 'C(C,C)C,C', 65..71 );
910 like( scalar @warning, 1 );
912 # forbidden code in []
913 eval { my $x = pack( 'A[@4]', 'XXXX' ); };
914 like( $@, qr{Within \[\]-length '\@' not allowed} );
917 my $s = pack( 'AA@A', 'A', 'B', 'C' );
918 my @c = unpack( 'AA@A', $s );
922 # no unpack code after /
923 eval { my @a = unpack( "C/", "\3" ); };
924 like( $@, qr{Code missing after '/'} );
928 { # Repeat count [SUBEXPR]
929 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
930 s! S! i! I! l! L! j J);
932 if (eval { pack 'q', 1 } ) {
933 push @codes, qw(q Q);
935 push @codes, qw(c C); # Keep the count the same
937 if (eval { pack 'D', 1 } ) {
940 push @codes, 'd'; # Keep the count the same
944 @val{@codes} = map { / [Xx] (?{ undef })
945 | [AZa] (?{ 'something' })
950 | [svnSiIlVNLqQjJ] (?{ 10111 })
951 | [FfDd] (?{ 1.36514538e67 })
952 | [pP] (?{ "try this buffer" })
954 my @end = (0x12345678, 0x23456781, 0x35465768, 0x15263748);
957 for my $type (@codes) {
958 my @list = $val{$type};
959 @list = () unless defined $list[0];
960 for my $count ('', '3', '[11]') {
962 $c = $1 if $count =~ /(\d+)/;
964 @list1 = (@list1) x $c unless $type =~ /[XxAaZBbHhP]/;
965 for my $groupend ('', ')2', ')[8]') {
966 my $groupbegin = ($groupend ? '(' : '');
968 $c = $1 if $groupend =~ /(\d+)/;
969 my @list2 = (@list1) x $c;
971 my $junk1 = "$groupbegin $type$count $groupend";
972 # print "# junk1=$junk1\n";
973 my $p = pack $junk1, @list2;
974 my $half = int( (length $p)/2 );
975 for my $move ('', "X$half", "X!$half", 'x1', 'x!8', "x$half") {
976 my $junk = "$junk1 $move";
977 # print "# junk='$junk', list=(@list2)\n";
978 $p = pack "$junk $end", @list2, @end;
979 my @l = unpack "x[$junk] $end", $p;
980 is(scalar @l, scalar @end);
981 is("@l", "@end", "skipping x[$junk]");
988 # / is recognized after spaces in scalar context
989 # XXXX no spaces are allowed in pack... In pack only before the slash...
990 is(scalar unpack('A /A Z20', pack 'A/A* Z20', 'bcde', 'xxxxx'), 'bcde');
991 is(scalar unpack('A /A /A Z20', '3004bcde'), 'bcde');
994 my $t = 'C[3] x!8 C[2]';
995 my @a = (0x73..0x77);
996 my $p = pack($t, @a);
997 is($p, "\x73\x74\x75\0\0\0\0\0\x76\x77");
998 my @b = unpack $t, $p;
999 is(scalar @b, scalar @a);
1000 is("@b", "@a", 'x!8');
1001 $t = 'x[5] C[6] X!8 C[2]';
1004 is($p, "\0\0\0\0\0\x73\x74\x75\x79\x7a");
1006 @a = (0x73..0x75, 0x79, 0x7a, 0x79, 0x7a);
1007 is(scalar @b, scalar @a);
1011 { # struct {char c1; double d; char cc[2];}
1012 my $t = 'C x![d] d C[2]';
1013 my @a = (173, 1.283476517e-45, 42, 215);
1014 my $p = pack $t, @a;
1016 my @b = unpack "$t X[$t] $t", $p; # Extract, step back, extract again
1017 is(scalar @b, 2 * scalar @a);
1019 $b =~ s/(?:17000+|16999+)\d+(e-45) /17$1 /gi; # stringification is gamble
1023 local $SIG{__WARN__} = sub {
1026 @b = unpack "x[C] x[$t] X[$t] X[C] $t", "$p\0";
1028 is($warning, undef);
1029 is(scalar @b, scalar @a);
1031 $b =~ s/(?:17000+|16999+)\d+(e-45) /17$1 /gi; # stringification is gamble
1035 is(length(pack("j", 0)), $Config{ivsize});
1036 is(length(pack("J", 0)), $Config{uvsize});
1037 is(length(pack("F", 0)), $Config{nvsize});
1039 numbers ('j', -2147483648, -1, 0, 1, 2147483647);
1040 numbers ('J', 0, 1, 2147483647, 2147483648, 4294967295);
1041 numbers ('F', -(2**34), -1, 0, 1, 2**34);
1043 my $t = eval { unpack("D*", pack("D", 12.34)) };
1045 skip "Long doubles not in use", 56 if $@ =~ /Invalid type/;
1047 is(length(pack("D", 0)), $Config{longdblsize});
1048 numbers ('D', -(2**34), -1, 0, 1, 2**34);
1051 # Maybe this knowledge needs to be "global" for all of pack.t
1052 # Or a "can checksum" which would effectively be all the number types"
1053 my %cant_checksum = map {$_=> 1} qw(A Z u w);
1055 foreach my $template (qw(A Z c C s S i I l L n N v V q Q j J f d F D u U w)) {
1057 my $packed = eval {pack "${template}4", 1, 4, 9, 16};
1059 die unless $@ =~ /Invalid type '$template'/;
1060 skip ("$template not supported on this perl",
1061 $cant_checksum{$template} ? 4 : 8);
1063 my @unpack4 = unpack "${template}4", $packed;
1064 my @unpack = unpack "${template}*", $packed;
1065 my @unpack1 = unpack "${template}", $packed;
1066 my @unpack1s = scalar unpack "${template}", $packed;
1067 my @unpack4s = scalar unpack "${template}4", $packed;
1068 my @unpacks = scalar unpack "${template}*", $packed;
1070 my @tests = ( ["${template}4 vs ${template}*", \@unpack4, \@unpack],
1071 ["scalar ${template} ${template}", \@unpack1s, \@unpack1],
1072 ["scalar ${template}4 vs ${template}", \@unpack4s, \@unpack1],
1073 ["scalar ${template}* vs ${template}", \@unpacks, \@unpack1],
1076 unless ($cant_checksum{$template}) {
1077 my @unpack4_c = unpack "\%${template}4", $packed;
1078 my @unpack_c = unpack "\%${template}*", $packed;
1079 my @unpack1_c = unpack "\%${template}", $packed;
1080 my @unpack1s_c = scalar unpack "\%${template}", $packed;
1081 my @unpack4s_c = scalar unpack "\%${template}4", $packed;
1082 my @unpacks_c = scalar unpack "\%${template}*", $packed;
1085 ( ["% ${template}4 vs ${template}*", \@unpack4_c, \@unpack_c],
1086 ["% scalar ${template} ${template}", \@unpack1s_c, \@unpack1_c],
1087 ["% scalar ${template}4 vs ${template}*", \@unpack4s_c, \@unpack_c],
1088 ["% scalar ${template}* vs ${template}*", \@unpacks_c, \@unpack_c],
1091 foreach my $test (@tests) {
1092 ok (list_eq ($test->[1], $test->[2]), $test->[0]) ||
1093 printf "# unpack gave %s expected %s\n",
1094 encode_list (@{$test->[1]}), encode_list (@{$test->[2]});
1099 ok(pack('u2', 'AA'), "[perl #8026]"); # used to hang and eat RAM in perl 5.7.2
1101 $_ = pack('c', 65); # 'A' would not be EBCDIC-friendly
1102 is(unpack('c'), 65, "one-arg unpack (change #18751)"); # defaulting to $_