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;
187 eval { $x = pack 'w', $inf };
188 like ($@, qr/^Cannot compress integer/);
192 # This should be about the biggest thing possible on an IEEE double
193 my $big = eval '2**1023';
195 skip "Couldn't generate 2**1023 - got error '$@'"
196 unless defined $big and $big != $big / 2;
198 eval { $x = pack 'w', $big };
199 is ($@, '', "Should be able to pack 'w', $big # 2**1023");
201 my $y = eval {unpack 'w', $x};
203 "Should be able to unpack 'w' the result of pack 'w', $big # 2**1023");
205 # I'm getting about 1e-16 on FreeBSD
206 my $quotient = int (100 * ($y - $big) / $big);
207 ok($quotient < 2 && $quotient > -2,
208 "Round trip pack, unpack 'w' of $big is withing 1% ($quotient%)");
214 # test the "p" template
217 is(unpack("p",pack("p","foo")), "foo");
220 is(unpack("p",pack("p",239)), 239);
223 sub foo { my $a = "a"; return $a . $a++ . $a++ }
227 local $SIG{__WARN__} = sub {
230 my $junk = pack("p", &foo);
232 like($warning, qr/temporary val/);
235 # undef should give null pointer
236 like(pack("p", undef), qr/^\0+/);
238 # Check for optimizer bug (e.g. Digital Unix GEM cc with -O4 on DU V4.0B gives
239 # 4294967295 instead of -1)
240 # see #ifdef __osf__ in pp.c pp_unpack
241 is((unpack("i",pack("i",-1))), -1);
243 # test the pack lengths of s S i I l L
244 # test the pack lengths of n N v V
245 my @lengths = qw(s 2 S 2 i -4 I -4 l 4 L 4 n 2 N 4 v 2 V 4);
246 while (my ($format, $expect) = splice @lengths, 0, 2) {
247 my $len = length(pack($format, 0));
249 is($expect, $len, "format '$format'");
252 ok ($len >= $expect, "format '$format'") ||
253 print "# format '$format' has length $len, expected >= $expect\n";
258 # test unpack-pack lengths
259 my @templates = qw(c C i I s S l L n N v V f d q Q);
261 foreach my $t (@templates) {
263 my @t = eval { unpack("$t*", pack("$t*", 12, 34)) };
265 # quads not supported everywhere
266 skip "Quads not supported", 4 if $@ =~ /Invalid type in pack/;
272 skip "$t not expected to work for some reason", 2 if $t =~ /[nv]/i;
283 # Note that first uuencoding known 'text' data and then checking the
284 # binary values of the uuencoded version would not be portable between
285 # character sets. Uuencoding is meant for encoding binary data, not
288 my $in = pack 'C*', 0 .. 255;
290 # just to be anal, we do some random tr/`/ /
292 M` $"`P0%!@<("0H+# T.#Q`1$A,4%187&!D:&QP='A\@(2(C)"4F)R@I*BLL
293 M+2XO,#$R,S0U-C<X.3H[/#T^/T!!0D-$149'2$E*2TQ-3D]045)35%565UA9
294 M6EM<75Y?8&%B8V1E9F=H:6IK;&UN;W!Q<G-T=79W>'EZ>WQ]?G^`@8*#A(6&
295 MAXB)BHN,C8Z/D)&2DY25EI>8F9J;G)V>GZ"AHJ.DI::GJ*FJJZRMKJ^PL;*S
296 MM+6VM[BYNKN\O;Z_P,'"P\3%QL?(R<K+S,W.S]#1TM/4U=;7V-G:V]S=WM_@
297 ?X>+CY.7FY^CIZNOL[>[O\/'R\_3U]O?X^?K[_/W^_P `
303 is(pack('u', $in), $_);
305 is(unpack('u', $uu), $in);
307 $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";
309 M'XL("%C<Q#4"`TI!4%4`\RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>("`&1F
313 is(unpack('u', $uu), $in);
315 # This is identical to the above except that backquotes have been
319 M'XL("%C<Q#4" TI!4%4 \RHM+E%(S,LOR4@M4@A(+<I1*"U-SD])+>(" &1F
324 is(unpack('u', $uu), $in);
328 # test the ascii template types (A, a, Z)
331 ['p', 'A*', "foo\0bar\0 ", "foo\0bar\0 "],
332 ['p', 'A11', "foo\0bar\0 ", "foo\0bar\0 "],
333 ['u', 'A*', "foo\0bar \0", "foo\0bar"],
334 ['u', 'A8', "foo\0bar \0", "foo\0bar"],
335 ['p', 'a*', "foo\0bar\0 ", "foo\0bar\0 "],
336 ['p', 'a11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
337 ['u', 'a*', "foo\0bar \0", "foo\0bar \0"],
338 ['u', 'a8', "foo\0bar \0", "foo\0bar "],
339 ['p', 'Z*', "foo\0bar\0 ", "foo\0bar\0 \0"],
340 ['p', 'Z11', "foo\0bar\0 ", "foo\0bar\0 \0\0"],
341 ['p', 'Z3', "foo", "fo\0"],
342 ['u', 'Z*', "foo\0bar \0", "foo"],
343 ['u', 'Z8', "foo\0bar \0", "foo"],
346 my ($what, $template, $in, $out) = @$_;
347 my $got = $what eq 'u' ? (unpack $template, $in) : (pack $template, $in);
348 unless (is($got, $out)) {
349 my $un = $what eq 'u' ? 'un' : '';
350 print "# ${un}pack ('$template', "._qq($in).') gave '._qq($out).
351 ' not '._qq($got)."\n";
355 # packing native shorts/ints/longs
357 is(length(pack("s!", 0)), $Config{shortsize});
358 is(length(pack("i!", 0)), $Config{intsize});
359 is(length(pack("l!", 0)), $Config{longsize});
360 ok(length(pack("s!", 0)) <= length(pack("i!", 0)));
361 ok(length(pack("i!", 0)) <= length(pack("l!", 0)));
362 is(length(pack("i!", 0)), length(pack("i", 0)));
366 return numbers_with_total ($format, undef, @_);
369 sub numbers_with_total {
372 if (!defined $total) {
379 my $out = eval {unpack($format, pack($format, $_))};
380 skip "cannot pack '$format' on this perl", 2 if
381 $@ =~ /Invalid type in pack: '$format'/;
388 my $skip_if_longer_than = ~0; # "Infinity"
390 # If we're running with -DNO_PERLPRESERVE_IVUV and NVs don't preserve all
391 # UVs (in which case ~0 is NV, ~0-1 will be the same NV) then we can't
392 # correctly in perl calculate UV totals for long checksums, as pp_unpack
393 # is using UV maths, and we've only got NVs.
394 $skip_if_longer_than = $Config{nv_preserves_uv_bits};
397 foreach ('', 1, 2, 3, 15, 16, 17, 31, 32, 33, 53, 54, 63, 64, 65) {
399 my $sum = eval {unpack "%$_$format*", pack "$format*", @_};
400 skip "cannot pack '$format' on this perl", 3
401 if $@ =~ /Invalid type in pack: '$format'/;
406 my $len = $_; # Copy, so that we can reassign ''
407 $len = 16 unless length $len;
410 skip "cannot test checksums over $skip_if_longer_than bits", 1
411 if $len > $skip_if_longer_than;
413 # Our problem with testing this portably is that the checksum code in
414 # pp_unpack is able to cast signed to unsigned, and do modulo 2**n
415 # arithmetic in unsigned ints, which perl has no operators to do.
416 # (use integer; does signed ints, which won't wrap on UTS, which is just
417 # fine with ANSI, but not with most people's assumptions.
418 # This is why we need to supply the totals for 'Q' as there's no way in
419 # perl to calculate them, short of unpack '%0Q' (is that documented?)
420 # ** returns NVs; make sure it's IV.
421 my $max = 1 + 2 * (int (2 ** ($len-1))-1); # The max possible checksum
422 my $max_p1 = $max + 1;
423 my ($max_is_integer, $max_p1_is_integer);
424 $max_p1_is_integer = 1 unless $max_p1 + 1 == $max_p1;
425 $max_is_integer = 1 if $max - 1 < ~0;
429 $calc_sum = &$total($len);
432 # Shift into range by some multiple of the total
433 my $mult = int ($total / $max_p1);
434 # Need this to make sure that -1 + (~0+1) is ~0 (ie still integer)
435 $calc_sum = $total - $mult;
436 $calc_sum -= $mult * $max;
442 if ($calc_sum == $calc_sum - 1 && $calc_sum == $max_p1) {
443 # we're into floating point (either by getting out of the range of
444 # UV arithmetic, or because we're doing a floating point checksum)
445 # and our calculation of the checksum has become rounded up to
450 if ($calc_sum == $sum) { # HAS to be ==, not eq (so no is()).
451 ok ("unpack '%$_$format' gave $sum");
453 my $delta = 1.000001;
454 if ($format =~ tr /dDfF//
455 && ($calc_sum <= $sum * $delta && $calc_sum >= $sum / $delta)) {
456 pass ("unpack '%$_$format' gave $sum, expected $calc_sum");
458 my $text = ref $total ? &$total($len) : $total;
460 print "# For list (" . join (", ", @_) . ") (total $text)"
461 . " packed with $format unpack '%$_$format' gave $sum,"
462 . " expected $calc_sum\n";
470 numbers ('c', -128, -1, 0, 1, 127);
471 numbers ('C', 0, 1, 127, 128, 255);
472 numbers ('s', -32768, -1, 0, 1, 32767);
473 numbers ('S', 0, 1, 32767, 32768, 65535);
474 numbers ('i', -2147483648, -1, 0, 1, 2147483647);
475 numbers ('I', 0, 1, 2147483647, 2147483648, 4294967295);
476 numbers ('l', -2147483648, -1, 0, 1, 2147483647);
477 numbers ('L', 0, 1, 2147483647, 2147483648, 4294967295);
478 numbers ('s!', -32768, -1, 0, 1, 32767);
479 numbers ('S!', 0, 1, 32767, 32768, 65535);
480 numbers ('i!', -2147483648, -1, 0, 1, 2147483647);
481 numbers ('I!', 0, 1, 2147483647, 2147483648, 4294967295);
482 numbers ('l!', -2147483648, -1, 0, 1, 2147483647);
483 numbers ('L!', 0, 1, 2147483647, 2147483648, 4294967295);
484 numbers ('n', 0, 1, 32767, 32768, 65535);
485 numbers ('v', 0, 1, 32767, 32768, 65535);
486 numbers ('N', 0, 1, 2147483647, 2147483648, 4294967295);
487 numbers ('V', 0, 1, 2147483647, 2147483648, 4294967295);
488 # All these should have exact binary representations:
489 numbers ('f', -1, 0, 0.5, 42, 2**34);
490 numbers ('d', -(2**34), -1, 0, 1, 2**34);
491 ## These don't, but 'd' is NV. XXX wrong, it's double
492 #numbers ('d', -1, 0, 1, 1-exp(-1), -exp(1));
494 numbers_with_total ('q', -1,
495 -9223372036854775808, -1, 0, 1,9223372036854775807);
496 # This total is icky, but the true total is 2**65-1, and need a way to generate
497 # the epxected checksum on any system including those where NVs can preserve
498 # 65 bits. (long double is 128 bits on sparc, so they certainly can)
499 # or where rounding is down not up on binary conversion (crays)
500 numbers_with_total ('Q', sub {
502 $len = 65 if $len > 65; # unmasked total is 2**65-1 here
503 my $total = 1 + 2 * (int (2**($len - 1)) - 1);
504 return 0 if $total == $total - 1; # Overflowed integers
505 return $total; # NVs still accurate to nearest integer
507 0, 1,9223372036854775807, 9223372036854775808,
508 18446744073709551615);
510 # pack nvNV byteorders
512 is(pack("n", 0xdead), "\xde\xad");
513 is(pack("v", 0xdead), "\xad\xde");
514 is(pack("N", 0xdeadbeef), "\xde\xad\xbe\xef");
515 is(pack("V", 0xdeadbeef), "\xef\xbe\xad\xde");
521 eval { ($x) = unpack '/a*','hello' };
522 like($@, qr!/ must follow a numeric type!);
524 eval { $x = unpack '/a*','hello' };
525 like($@, qr!/ must follow a numeric type!);
528 eval { ($z,$x,$y) = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
534 eval { $z = unpack 'a3/A C/a* C/Z', "003ok \003yes\004z\000abc" };
540 eval { ($x) = pack '/a*','hello' };
541 like($@, qr!Invalid type in pack: '/'!);
543 eval { $x = pack '/a*','hello' };
544 like($@, qr!Invalid type in pack: '/'!);
546 $z = pack 'n/a* N/Z* w/A*','string','hi there ','etc';
547 my $expect = "\000\006string\0\0\0\012hi there \000\003etc";
551 $expect = 'hello world';
552 eval { ($x) = unpack ("w/a", chr (11) . "hello world!")};
557 # Doing this in scalar context used to fail.
558 eval { $x = unpack ("w/a", chr (11) . "hello world!")};
563 ['a/a*/a*', '212ab345678901234567','ab3456789012'],
564 ['a/a*/a*', '3012ab345678901234567', 'ab3456789012'],
565 ['a/a*/b*', '212ab', $Is_EBCDIC ? '100000010100' : '100001100100'],
568 my ($pat, $in, $expect) = @$_;
570 eval { ($x) = unpack $pat, $in };
573 printf "# list unpack ('$pat', '$in') gave %s, expected '$expect'\n",
577 eval { $x = unpack $pat, $in };
580 printf "# scalar unpack ('$pat', '$in') gave %s, expected '$expect'\n",
586 my $pattern = <<'EOU';
587 a3/A # Count in ASCII
588 C/a* # Count in a C char
589 C/Z # Count in a C char but skip after \0
593 eval { ($z,$x,$y) = unpack $pattern, "003ok \003yes\004z\000abc" };
599 eval { $z = unpack $pattern, "003ok \003yes\004z\000abc" };
604 n/a* # Count as network short
605 w/A* # Count a BER integer
607 $expect = "\000\006string\003etc";
608 $z = pack $pattern,'string','etc';
614 skip("(EBCDIC and) version strings are bad idea", 2) if $Is_EBCDIC;
616 is("1.20.300.4000", sprintf "%vd", pack("U*",1,20,300,4000));
617 is("1.20.300.4000", sprintf "%vd", pack(" U*",1,20,300,4000));
619 isnt(v1.20.300.4000, sprintf "%vd", pack("C0U*",1,20,300,4000));
621 my $rslt = $Is_EBCDIC ? "156 67" : "199 162";
622 is(join(" ", unpack("C*", chr(0x1e2))), $rslt);
624 # does pack U create Unicode?
625 is(ord(pack('U', 300)), 300);
627 # does unpack U deref Unicode?
628 is((unpack('U', chr(300)))[0], 300);
630 # is unpack U the reverse of pack U for Unicode string?
631 is("@{[unpack('U*', pack('U*', 100, 200, 300))]}", "100 200 300");
633 # is unpack U the reverse of pack U for byte string?
634 is("@{[unpack('U*', pack('U*', 100, 200))]}", "100 200");
638 skip "Not for EBCDIC", 4 if $Is_EBCDIC;
640 # does unpack C unravel pack U?
641 is("@{[unpack('C*', pack('U*', 100, 200))]}", "100 195 136");
643 # does pack U0C create Unicode?
644 is("@{[pack('U0C*', 100, 195, 136)]}", v100.v200);
646 # does pack C0U create characters?
647 is("@{[pack('C0U*', 100, 200)]}", pack("C*", 100, 195, 136));
649 # does unpack U0U on byte data warn?
651 local $SIG{__WARN__} = sub { $@ = "@_" };
652 my @null = unpack('U0U', chr(255));
653 like($@, /^Malformed UTF-8 character /);
658 my $p = pack 'i*', -2147483648, ~0, 0, 1, 2147483647;
660 # bug - % had to be at the start of the pattern, no leading whitespace or
661 # comments. %i! didn't work at all.
662 foreach my $pat ('%32i*', ' %32i*', "# Muhahahaha\n%32i*", '%32i* ',
663 '%32i!*', ' %32i!*', "\n#\n#\n\r \t\f%32i!*", '%32i!*#') {
664 @a = unpack $pat, $p;
665 is($a[0], 0xFFFFFFFF) || print "# $pat\n";
666 @a = scalar unpack $pat, $p;
667 is($a[0], 0xFFFFFFFF) || print "# $pat\n";
671 $p = pack 'I*', 42, 12;
672 # Multiline patterns in scalar context failed.
673 foreach my $pat ('I', <<EOPOEMSNIPPET, 'I#I', 'I # I', 'I # !!!') {
674 # On the Ning Nang Nong
675 # Where the Cows go Bong!
676 # And the Monkeys all say Boo!
679 @a = unpack $pat, $p;
682 @a = scalar unpack $pat, $p;
687 # shorts (of all flavours) didn't calculate checksums > 32 bits with floating
688 # point, so a pathologically long pattern would wrap at 32 bits.
689 my $pat = "\xff\xff"x65538; # Start with it long, to save any copying.
690 foreach (4,3,2,1,0) {
691 my $len = 65534 + $_;
692 is(unpack ("%33n$len", $pat), 65535 * $len);
702 ['xXa*', "Nick", "Nick"],
703 ['a5Xa5', "cameL", "llama", "camellama"],
705 ['a*@8a*', 'Camel', 'Dromedary', "Camel\0\0\0Dromedary"],
706 ['a*@4a', 'Perl rules', '!', 'Perl!'],
709 my ($template, @in) = @$_;
711 my $got = eval {pack $template, @in};
714 printf "# pack ('$template', %s) gave %s expected %s\n",
715 encode_list (@in), encode_list ($got), encode_list ($out);
722 ['xXa*', "Nick", "Nick"],
723 ['a5Xa5', "camellama", "camel", "llama"],
725 ['@2a2', "water", "te"],
726 ['a*@1a3', "steam", "steam", "tea"],
729 my ($template, $in, @out) = @$_;
730 my @got = eval {unpack $template, $in};
732 ok (list_eq (\@got, \@out)) ||
733 printf "# list unpack ('$template', %s) gave %s expected %s\n",
734 _qq($in), encode_list (@got), encode_list (@out);
736 my $got = eval {unpack $template, $in};
738 @out ? is( $got, $out[0] ) # 1 or more items; should get first
739 : ok( !defined $got ) # 0 items; should get undef
740 or printf "# scalar unpack ('$template', %s) gave %s expected %s\n",
741 _qq($in), encode_list ($got), encode_list ($out[0]);
746 my ($u, $v) = qw(foo xyzzy);
747 my $p = pack($t, $u, $v);
748 my @u = unpack($t, $p);
755 is((unpack("w/a*", "\x02abc"))[0], "ab");
757 # "w/a*" should be seen as one unit
759 is(scalar unpack("w/a*", "\x02abc"), "ab");
763 # from Wolfgang Laun: fix in change #13163
768 my $buf = pack( 'Z*/A* C', $s, $x );
772 $h =~ s/[^[:print:]]/./g;
773 ( $s, $y ) = unpack( "Z*/A* C", $buf );
774 is($h, "30.ABCABCABCABCABCABCABCABCABCABC$t");
776 is($s, "ABCABCABCABCABCABCABCABCABCABC");
781 # from Wolfgang Laun: fix in change #13288
783 eval { my $t=unpack("P*", "abc") };
784 like($@, qr/P must have an explicit size/);
787 { # Grouping constructs
789 @a = unpack '(SL)', pack 'SLSLSL', 67..90;
791 @a = unpack '(SL)3', pack 'SLSLSL', 67..90;
794 @a = unpack '(SL)3', pack 'SLSLSLSL', 67..90;
796 @a = unpack '(SL)[3]', pack 'SLSLSLSL', 67..90;
798 @a = unpack '(SL)[2] SL', pack 'SLSLSLSL', 67..90;
800 @a = unpack 'A/(SL)', pack 'ASLSLSLSL', 3, 67..90;
802 @a = unpack 'A/(SL)SL', pack 'ASLSLSLSL', 2, 67..90;
804 @a = unpack '(SL)*', pack 'SLSLSLSL', 67..90;
807 @a = unpack '(SL)*SL', pack 'SLSLSLSL', 67..90;
809 eval { @a = unpack '(*SL)', '' };
810 like($@, qr/\(\)-group starts with a count/);
811 eval { @a = unpack '(3SL)', '' };
812 like($@, qr/\(\)-group starts with a count/);
813 eval { @a = unpack '([3]SL)', '' };
814 like($@, qr/\(\)-group starts with a count/);
815 eval { @a = pack '(*SL)' };
816 like($@, qr/\(\)-group starts with a count/);
817 @a = unpack '(SL)3 SL', pack '(SL)4', 67..74;
819 @a = unpack '(SL)3 SL', pack '(SL)[4]', 67..74;
821 @a = unpack '(SL)3 SL', pack '(SL)*', 67..74;
825 { # Repeat count [SUBEXPR]
826 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
827 s! S! i! I! l! L! j J);
829 if (eval { pack 'q', 1 } ) {
830 push @codes, qw(q Q);
832 push @codes, qw(c C); # Keep the count the same
834 if (eval { pack 'D', 1 } ) {
837 push @codes, 'd'; # Keep the count the same
841 @val{@codes} = map { / [Xx] (?{ undef })
842 | [AZa] (?{ 'something' })
847 | [svnSiIlVNLqQjJ] (?{ 10111 })
848 | [FfDd] (?{ 1.36514538e67 })
849 | [pP] (?{ "try this buffer" })
851 my @end = (0x12345678, 0x23456781, 0x35465768, 0x15263748);
854 for my $type (@codes) {
855 my @list = $val{$type};
856 @list = () unless defined $list[0];
857 for my $count ('', '3', '[11]') {
859 $c = $1 if $count =~ /(\d+)/;
861 @list1 = (@list1) x $c unless $type =~ /[XxAaZBbHhP]/;
862 for my $groupend ('', ')2', ')[8]') {
863 my $groupbegin = ($groupend ? '(' : '');
865 $c = $1 if $groupend =~ /(\d+)/;
866 my @list2 = (@list1) x $c;
868 my $junk1 = "$groupbegin $type$count $groupend";
869 # print "# junk1=$junk1\n";
870 my $p = pack $junk1, @list2;
871 my $half = int( (length $p)/2 );
872 for my $move ('', "X$half", "X!$half", 'x1', 'x!8', "x$half") {
873 my $junk = "$junk1 $move";
874 # print "# junk='$junk', list=(@list2)\n";
875 $p = pack "$junk $end", @list2, @end;
876 my @l = unpack "x[$junk] $end", $p;
877 is(scalar @l, scalar @end);
878 is("@l", "@end", "skipping x[$junk]");
885 # / is recognized after spaces in scalar context
886 # XXXX no spaces are allowed in pack... In pack only before the slash...
887 is(scalar unpack('A /A Z20', pack 'A/A* Z20', 'bcde', 'xxxxx'), 'bcde');
888 is(scalar unpack('A /A /A Z20', '3004bcde'), 'bcde');
891 my $t = 'C[3] x!8 C[2]';
892 my @a = (0x73..0x77);
893 my $p = pack($t, @a);
894 is($p, "\x73\x74\x75\0\0\0\0\0\x76\x77");
895 my @b = unpack $t, $p;
896 is(scalar @b, scalar @a);
897 is("@b", "@a", 'x!8');
898 $t = 'x[5] C[6] X!8 C[2]';
901 is($p, "\0\0\0\0\0\x73\x74\x75\x79\x7a");
903 @a = (0x73..0x75, 0x79, 0x7a, 0x79, 0x7a);
904 is(scalar @b, scalar @a);
908 { # struct {char c1; double d; char cc[2];}
909 my $t = 'C x![d] d C[2]';
910 my @a = (173, 1.283476517e-45, 42, 215);
913 my @b = unpack "$t X[$t] $t", $p; # Extract, step back, extract again
914 is(scalar @b, 2 * scalar @a);
916 $b =~ s/(?:17000+|16999+)\d+(e-45) /17$1 /gi; # stringification is gamble
920 local $SIG{__WARN__} = sub {
923 @b = unpack "x[C] x[$t] X[$t] X[C] $t", "$p\0";
926 is(scalar @b, scalar @a);
928 $b =~ s/(?:17000+|16999+)\d+(e-45) /17$1 /gi; # stringification is gamble
932 is(length(pack("j", 0)), $Config{ivsize});
933 is(length(pack("J", 0)), $Config{uvsize});
934 is(length(pack("F", 0)), $Config{nvsize});
936 numbers ('j', -2147483648, -1, 0, 1, 2147483647);
937 numbers ('J', 0, 1, 2147483647, 2147483648, 4294967295);
938 numbers ('F', -(2**34), -1, 0, 1, 2**34);
940 my $t = eval { unpack("D*", pack("D", 12.34)) };
942 skip "Long doubles not in use", 56 if $@ =~ /Invalid type in pack/;
944 is(length(pack("D", 0)), $Config{longdblsize});
945 numbers ('D', -(2**34), -1, 0, 1, 2**34);
948 # Maybe this knowledge needs to be "global" for all of pack.t
949 # Or a "can checksum" which would effectively be all the number types"
950 my %cant_checksum = map {$_=> 1} qw(A Z u w);
952 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)) {
954 my $packed = eval {pack "${template}4", 1, 4, 9, 16};
956 die unless $@ =~ /Invalid type in pack: '$template'/;
957 skip ("$template not supported on this perl",
958 $cant_checksum{$template} ? 4 : 8);
960 my @unpack4 = unpack "${template}4", $packed;
961 my @unpack = unpack "${template}*", $packed;
962 my @unpack1 = unpack "${template}", $packed;
963 my @unpack1s = scalar unpack "${template}", $packed;
964 my @unpack4s = scalar unpack "${template}4", $packed;
965 my @unpacks = scalar unpack "${template}*", $packed;
967 my @tests = ( ["${template}4 vs ${template}*", \@unpack4, \@unpack],
968 ["scalar ${template} ${template}", \@unpack1s, \@unpack1],
969 ["scalar ${template}4 vs ${template}", \@unpack4s, \@unpack1],
970 ["scalar ${template}* vs ${template}", \@unpacks, \@unpack1],
973 unless ($cant_checksum{$template}) {
974 my @unpack4_c = unpack "\%${template}4", $packed;
975 my @unpack_c = unpack "\%${template}*", $packed;
976 my @unpack1_c = unpack "\%${template}", $packed;
977 my @unpack1s_c = scalar unpack "\%${template}", $packed;
978 my @unpack4s_c = scalar unpack "\%${template}4", $packed;
979 my @unpacks_c = scalar unpack "\%${template}*", $packed;
982 ( ["% ${template}4 vs ${template}*", \@unpack4_c, \@unpack_c],
983 ["% scalar ${template} ${template}", \@unpack1s_c, \@unpack1_c],
984 ["% scalar ${template}4 vs ${template}*", \@unpack4s_c, \@unpack_c],
985 ["% scalar ${template}* vs ${template}*", \@unpacks_c, \@unpack_c],
988 foreach my $test (@tests) {
989 ok (list_eq ($test->[1], $test->[2]), $test->[0]) ||
990 printf "# unpack gave %s expected %s\n",
991 encode_list (@{$test->[1]}), encode_list (@{$test->[2]});