blob: da50e46e829ad6ff6d83f3ddd07b96446a3363f9 (
plain)
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// SHA1 hash algorithm. See RFC 3174.
package sha1
import "os"
package const (
Chunk = 64;
)
const (
H0 = 0x67452301;
H1 = 0xEFCDAB89;
H2 = 0x98BADCFE;
H3 = 0x10325476;
H4 = 0xC3D2E1F0;
)
export type Digest struct {
h [5]uint32;
x [Chunk]byte;
nx int;
len uint64;
}
export func NewDigest() *Digest {
d := new(Digest);
d.h[0] = H0;
d.h[1] = H1;
d.h[2] = H2;
d.h[3] = H3;
d.h[4] = H4;
return d;
}
package func Block(dig *Digest, p []byte) int
func (d *Digest) Write(p []byte) (nn int, err *os.Error) {
nn = len(p);
d.len += uint64(nn);
if d.nx > 0 {
n := len(p);
if n > Chunk-d.nx {
n = Chunk-d.nx;
}
for i := 0; i < n; i++ {
d.x[d.nx+i] = p[i];
}
d.nx += n;
if d.nx == Chunk {
Block(d, d.x);
d.nx = 0;
}
p = p[n:len(p)];
}
n := Block(d, p);
p = p[n:len(p)];
if len(p) > 0 {
for i := 0; i < len(p); i++ {
d.x[i] = p[i];
}
d.nx = len(p);
}
return;
}
func (d *Digest) Sum() []byte {
// Padding. Add a 1 bit and 0 bits until 56 bytes mod 64.
len := d.len;
var tmp [64]byte;
tmp[0] = 0x80;
if len%64 < 56 {
d.Write(tmp[0:56-len%64]);
} else {
d.Write(tmp[0:64+56-len%64]);
}
// Length in bits.
len <<= 3;
for i := uint(0); i < 8; i++ {
tmp[i] = byte(len>>(56-8*i));
}
d.Write(tmp[0:8]);
if d.nx != 0 {
panicln("oops");
}
p := make([]byte, 20);
j := 0;
for i := 0; i < 5; i++ {
s := d.h[i];
p[j] = byte(s>>24); j++;
p[j] = byte(s>>16); j++;
p[j] = byte(s>>8); j++;
p[j] = byte(s); j++;
}
return p;
}
|
