1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
use strict;
my $MODULE;
BEGIN {
$MODULE = ($ENV{PERL_CORE} || -d "src") ? "Digest::SHA" : "Digest::SHA::PurePerl";
eval "require $MODULE" || die $@;
$MODULE->import(qw());
}
BEGIN {
if ($ENV{PERL_CORE}) {
chdir 't' if -d 't';
@INC = '../lib';
}
}
my $numtests = 4;
print "1..$numtests\n";
# Here's the bitstring to test against, and its SHA-1 digest
my $ONEBITS = pack("B*", "1" x 80000);
my $digest = "11003389959355c2773af6b0f36d842fe430ec49";
my $state = $MODULE->new("sHa1");
my $testnum = 1;
$state->add_bits($ONEBITS, 80000);
print "not " unless $state->hexdigest eq $digest;
print "ok ", $testnum++, "\n";
# buffer using a series of increasingly large bitstrings
# Note that (1 + 2 + ... + 399) + 200 = 80000
for (1 .. 399) {
$state->add_bits($ONEBITS, $_);
}
$state->add_bits($ONEBITS, 200);
print "not " unless $state->hexdigest eq $digest;
print "ok ", $testnum++, "\n";
# create a buffer-alignment nuisance
$state = $MODULE->new("1");
$state->add_bits($ONEBITS, 1);
for (1 .. 99) {
$state->add_bits($ONEBITS, 800);
}
$state->add_bits($ONEBITS, 799);
print "not " unless $state->hexdigest eq $digest;
print "ok ", $testnum++, "\n";
# buffer randomly-sized bitstrings
my $reps = 80000;
my $maxbits = 8 * 127;
$state = $MODULE->new(1);
while ($reps > $maxbits) {
my $num = int(rand($maxbits));
$state->add_bits($ONEBITS, $num);
$reps -= $num;
}
$state->add_bits($ONEBITS, $reps);
print "not " unless $state->hexdigest eq $digest;
print "ok ", $testnum++, "\n";
|
