mirror of
https://github.com/OffchainLabs/prysm.git
synced 2026-01-08 21:08:10 -05:00
2aa52fb56a
* Implement static analysis to prevent panics * Add nopanic to nogo * Fix violations and add exclusions Fix violations and add exclusions for all * Changelog fragment * Use pass.Report instead of pass.Reportf * Remove strings.ToLower for checking init method name * Add exclusion for herumi init * Move api/client/beacon template function to init and its own file * Fix nopanic testcase
48 lines
1.3 KiB
Go
48 lines
1.3 KiB
Go
package htr
|
|
|
|
import (
|
|
"runtime"
|
|
"sync"
|
|
|
|
"github.com/prysmaticlabs/gohashtree"
|
|
)
|
|
|
|
const minSliceSizeToParallelize = 5000
|
|
|
|
func hashParallel(inputList [][32]byte, outputList [][32]byte, wg *sync.WaitGroup) {
|
|
defer wg.Done()
|
|
err := gohashtree.Hash(outputList, inputList)
|
|
if err != nil {
|
|
panic(err) // lint:nopanic -- This should never panic.
|
|
}
|
|
}
|
|
|
|
// VectorizedSha256 takes a list of roots and hashes them using CPU
|
|
// specific vector instructions. Depending on host machine's specific
|
|
// hardware configuration, using this routine can lead to a significant
|
|
// performance improvement compared to the default method of hashing
|
|
// lists.
|
|
func VectorizedSha256(inputList [][32]byte) [][32]byte {
|
|
outputList := make([][32]byte, len(inputList)/2)
|
|
if len(inputList) < minSliceSizeToParallelize {
|
|
err := gohashtree.Hash(outputList, inputList)
|
|
if err != nil {
|
|
panic(err) // lint:nopanic -- This should never panic.
|
|
}
|
|
return outputList
|
|
}
|
|
n := runtime.GOMAXPROCS(0) - 1
|
|
wg := sync.WaitGroup{}
|
|
wg.Add(n)
|
|
groupSize := len(inputList) / (2 * (n + 1))
|
|
for j := 0; j < n; j++ {
|
|
go hashParallel(inputList[j*2*groupSize:(j+1)*2*groupSize], outputList[j*groupSize:], &wg)
|
|
}
|
|
err := gohashtree.Hash(outputList[n*groupSize:], inputList[n*2*groupSize:])
|
|
if err != nil {
|
|
panic(err) // lint:nopanic -- This should never panic.
|
|
}
|
|
wg.Wait()
|
|
return outputList
|
|
}
|