-
Notifications
You must be signed in to change notification settings - Fork 9
/
hash.go
92 lines (78 loc) · 2.83 KB
/
hash.go
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
/*
MIT License
# Copyright (c) 2021 Prysmatic Labs
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
package gohashtree
import (
"fmt"
"unsafe"
)
func _hash(digests *byte, p [][32]byte, count uint32)
// Hash hashes the chunks two at the time and outputs the digests on the first
// argument. It does check for lengths on the inputs.
func Hash(digests [][32]byte, chunks [][32]byte) error {
if len(chunks) == 0 {
return nil
}
if len(chunks)%2 == 1 {
return ErrOddChunks
}
if len(digests) < len(chunks)/2 {
return fmt.Errorf("%w: need at least %v, got %v", ErrNotEnoughDigests, len(chunks)/2, len(digests))
}
if supportedCPU {
_hash(&digests[0][0], chunks, uint32(len(chunks)/2))
} else {
sha256_1_generic(digests, chunks)
}
return nil
}
// HashChunks is the same as Hash, but does not do error checking on the lengths of the slices
func HashChunks(digests [][32]byte, chunks [][32]byte) {
if supportedCPU {
_hash(&digests[0][0], chunks, uint32(len(chunks)/2))
} else {
sha256_1_generic(digests, chunks)
}
}
func HashByteSlice(digests []byte, chunks []byte) error {
if len(chunks) == 0 {
return nil
}
if len(chunks)%64 != 0 {
return ErrChunksNotMultipleOf64
}
if len(digests)%32 != 0 {
return ErrDigestsNotMultipleOf32
}
if len(digests) < len(chunks)/2 {
return fmt.Errorf("%w: need at least %v, got %v", ErrNotEnoughDigests, len(chunks)/2, len(digests))
}
// We use an unsafe pointer to cast []byte to [][32]byte. The length and
// capacity of the slice need to be divided accordingly by 32.
sizeChunks := (len(chunks) >> 5)
chunkedChunks := unsafe.Slice((*[32]byte)(unsafe.Pointer(&chunks[0])), sizeChunks)
sizeDigests := (len(digests) >> 5)
chunkedDigest := unsafe.Slice((*[32]byte)(unsafe.Pointer(&digests[0])), sizeDigests)
if supportedCPU {
Hash(chunkedDigest, chunkedChunks)
} else {
sha256_1_generic(chunkedDigest, chunkedChunks)
}
return nil
}