lbcd/wire/shahash.go

112 lines
3.2 KiB
Go
Raw Normal View History

// Copyright (c) 2013-2015 The btcsuite developers
2013-05-08 21:31:00 +02:00
// Use of this source code is governed by an ISC
// license that can be found in the LICENSE file.
package wire
2013-05-08 21:31:00 +02:00
import (
"encoding/hex"
"fmt"
)
// HashSize is the array size used to store sha hashes. See ShaHash.
2013-05-08 21:31:00 +02:00
const HashSize = 32
// MaxHashStringSize is the maximum length of a ShaHash hash string.
2013-05-08 21:31:00 +02:00
const MaxHashStringSize = HashSize * 2
// ErrHashStrSize describes an error that indicates the caller specified a hash
// string that has too many characters.
var ErrHashStrSize = fmt.Errorf("max hash string length is %v bytes", MaxHashStringSize)
2013-05-08 21:31:00 +02:00
// ShaHash is used in several of the bitcoin messages and common structures. It
// typically represents the double sha256 of data.
type ShaHash [HashSize]byte
2015-01-06 01:46:52 +01:00
// String returns the ShaHash as the hexadecimal string of the byte-reversed
// hash.
func (hash ShaHash) String() string {
for i := 0; i < HashSize/2; i++ {
hash[i], hash[HashSize-1-i] = hash[HashSize-1-i], hash[i]
2013-05-08 21:31:00 +02:00
}
return hex.EncodeToString(hash[:])
2013-05-08 21:31:00 +02:00
}
// Bytes returns the bytes which represent the hash as a byte slice.
//
// NOTE: This makes a copy of the bytes and should have probably been named
// CloneBytes. It is generally cheaper to just slice the hash directly thereby
// reusing the same bytes rather than calling this method.
2013-05-08 21:31:00 +02:00
func (hash *ShaHash) Bytes() []byte {
newHash := make([]byte, HashSize)
copy(newHash, hash[:])
return newHash
}
// SetBytes sets the bytes which represent the hash. An error is returned if
// the number of bytes passed in is not HashSize.
func (hash *ShaHash) SetBytes(newHash []byte) error {
nhlen := len(newHash)
if nhlen != HashSize {
return fmt.Errorf("invalid sha length of %v, want %v", nhlen,
HashSize)
2013-05-08 21:31:00 +02:00
}
copy(hash[:], newHash)
2013-05-08 21:31:00 +02:00
return nil
}
// IsEqual returns true if target is the same as hash.
func (hash *ShaHash) IsEqual(target *ShaHash) bool {
return *hash == *target
2013-05-08 21:31:00 +02:00
}
// NewShaHash returns a new ShaHash from a byte slice. An error is returned if
// the number of bytes passed in is not HashSize.
func NewShaHash(newHash []byte) (*ShaHash, error) {
var sh ShaHash
err := sh.SetBytes(newHash)
if err != nil {
return nil, err
}
return &sh, err
}
2015-01-06 01:46:52 +01:00
// NewShaHashFromStr creates a ShaHash from a hash string. The string should be
// the hexadecimal string of a byte-reversed hash, but any missing characters
// result in zero padding at the end of the ShaHash.
2013-05-08 21:31:00 +02:00
func NewShaHashFromStr(hash string) (*ShaHash, error) {
2013-05-10 01:12:11 +02:00
// Return error if hash string is too long.
2013-05-08 21:31:00 +02:00
if len(hash) > MaxHashStringSize {
return nil, ErrHashStrSize
}
// Hex decoder expects the hash to be a multiple of two.
if len(hash)%2 != 0 {
hash = "0" + hash
}
// Convert string hash to bytes.
buf, err := hex.DecodeString(hash)
if err != nil {
return nil, err
}
2015-01-06 01:46:52 +01:00
// Un-reverse the decoded bytes, copying into in leading bytes of a
// ShaHash. There is no need to explicitly pad the result as any
// missing (when len(buf) < HashSize) bytes from the decoded hex string
// will remain zeros at the end of the ShaHash.
var ret ShaHash
2013-05-08 21:31:00 +02:00
blen := len(buf)
2015-01-06 01:46:52 +01:00
mid := blen / 2
if blen%2 != 0 {
mid++
2013-05-08 21:31:00 +02:00
}
2015-01-06 01:46:52 +01:00
blen--
for i, b := range buf[:mid] {
ret[i], ret[blen-i] = buf[blen-i], b
2013-05-08 21:31:00 +02:00
}
2015-01-06 01:46:52 +01:00
return &ret, nil
2013-05-08 21:31:00 +02:00
}