mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-07-16 01:40:44 +00:00
crypto: fix unknown linters (#1488)
Co-authored-by: wit <wit765765346@gmail>
This commit is contained in:
parent
1da1b58e7e
commit
e4fd044fa0
3 changed files with 4 additions and 4 deletions
|
|
@ -302,7 +302,7 @@ func appendUint64(b []byte, x uint64) []byte {
|
||||||
return append(b, a[:]...)
|
return append(b, a[:]...)
|
||||||
}
|
}
|
||||||
|
|
||||||
//nolint:unused,deadcode
|
//nolint:unused
|
||||||
func appendUint32(b []byte, x uint32) []byte {
|
func appendUint32(b []byte, x uint32) []byte {
|
||||||
var a [4]byte
|
var a [4]byte
|
||||||
binary.BigEndian.PutUint32(a[:], x)
|
binary.BigEndian.PutUint32(a[:], x)
|
||||||
|
|
@ -314,7 +314,7 @@ func consumeUint64(b []byte) ([]byte, uint64) {
|
||||||
return b[8:], x
|
return b[8:], x
|
||||||
}
|
}
|
||||||
|
|
||||||
//nolint:unused,deadcode
|
//nolint:unused
|
||||||
func consumeUint32(b []byte) ([]byte, uint32) {
|
func consumeUint32(b []byte) ([]byte, uint32) {
|
||||||
x := binary.BigEndian.Uint32(b)
|
x := binary.BigEndian.Uint32(b)
|
||||||
return b[4:], x
|
return b[4:], x
|
||||||
|
|
|
||||||
|
|
@ -25,7 +25,7 @@ var precomputed = [10][16]byte{
|
||||||
{10, 8, 7, 1, 2, 4, 6, 5, 15, 9, 3, 13, 11, 14, 12, 0},
|
{10, 8, 7, 1, 2, 4, 6, 5, 15, 9, 3, 13, 11, 14, 12, 0},
|
||||||
}
|
}
|
||||||
|
|
||||||
// nolint:unused,deadcode
|
// nolint:unused
|
||||||
func hashBlocksGeneric(h *[8]uint64, c *[2]uint64, flag uint64, blocks []byte) {
|
func hashBlocksGeneric(h *[8]uint64, c *[2]uint64, flag uint64, blocks []byte) {
|
||||||
var m [16]uint64
|
var m [16]uint64
|
||||||
c0, c1 := c[0], c[1]
|
c0, c1 := c[0], c[1]
|
||||||
|
|
|
||||||
|
|
@ -10,7 +10,7 @@ import (
|
||||||
"golang.org/x/sys/cpu"
|
"golang.org/x/sys/cpu"
|
||||||
)
|
)
|
||||||
|
|
||||||
//nolint:varcheck,unused,deadcode
|
//nolint:unused
|
||||||
var hasBMI2 = cpu.X86.HasBMI2
|
var hasBMI2 = cpu.X86.HasBMI2
|
||||||
|
|
||||||
//go:noescape
|
//go:noescape
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue