| 1 |
root |
1.1 |
BEGIN { $| = 1; print "1..806\n"; } |
| 2 |
|
|
|
| 3 |
|
|
use common::sense; |
| 4 |
|
|
use Convert::BER::XS ':all'; |
| 5 |
|
|
|
| 6 |
|
|
our $test; |
| 7 |
|
|
sub ok($;$) { |
| 8 |
|
|
print $_[0] ? "" : "not ", "ok ", ++$test, " # $_[1]\n"; |
| 9 |
|
|
} |
| 10 |
|
|
|
| 11 |
|
|
my $uvsize = length pack "J", 0; |
| 12 |
|
|
|
| 13 |
|
|
for (1..4) { |
| 14 |
|
|
for my $bit (0 .. 199) { |
| 15 |
|
|
# I wrote this at 4 in the morning. I am sure there must be a more |
| 16 |
|
|
# elegant way than this shit. |
| 17 |
|
|
my $c = "1" . join "", map int 2 * rand, 1 .. $bit; |
| 18 |
|
|
$c = "0$c" while (length $c) % 7; |
| 19 |
|
|
$c = "1" . join "1", unpack "(a7)*", $c; |
| 20 |
|
|
substr $c, -8, 1, "0"; |
| 21 |
|
|
$c = "\x06" . chr ((length $c) / 8) . pack "B*", $c; |
| 22 |
|
|
|
| 23 |
|
|
my $ok = eval { ber_decode $c } || $@ !~ "overflow"; |
| 24 |
|
|
|
| 25 |
|
|
ok ($ok ^ ($bit >= $uvsize * 8), unpack "H*", $c); |
| 26 |
|
|
|
| 27 |
|
|
# my $asn = "\x02" . (chr 1 + @c) . pack "B*", join "1" |
| 28 |
|
|
} |
| 29 |
|
|
} |
| 30 |
|
|
|
| 31 |
|
|
ok ( eval { ber_decode pack "CCa*a*", 2, $uvsize , "\x00\x80", "\x00" x ($uvsize - 2) }); |
| 32 |
|
|
ok ( eval { ber_decode pack "CCa*a*", 2, $uvsize + 1, "\x00\x80", "\x00" x ($uvsize - 1) }); |
| 33 |
|
|
ok ( eval { ber_decode pack "CCa*a*", 2, $uvsize , "\x01\x00", "\x00" x ($uvsize - 2) }); |
| 34 |
|
|
ok (!eval { ber_decode pack "CCa*a*", 2, $uvsize + 1, "\x01\x00", "\x00" x ($uvsize - 1) }); |
| 35 |
|
|
ok ( eval { ber_decode pack "CCa*a*", 2, $uvsize , "\x80\x00", "\x00" x ($uvsize - 2) }); |
| 36 |
|
|
ok (!eval { ber_decode pack "CCa*a*", 2, $uvsize + 1, "\x80\x00", "\x00" x ($uvsize - 1) }); |
