mirror of
https://github.com/nspcc-dev/neo-go.git
synced 2024-11-23 03:38:35 +00:00
2245fedbb1
commit methods duplicated putSmthIntoStore functions, but have MemCachedStore now that can easily substitute for a Batch, especially given that interop needs something like that for its storage purposes anyway.
103 lines
2.5 KiB
Go
103 lines
2.5 KiB
Go
package core
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/CityOfZion/neo-go/pkg/core/storage"
|
|
"github.com/CityOfZion/neo-go/pkg/io"
|
|
"github.com/CityOfZion/neo-go/pkg/util"
|
|
)
|
|
|
|
// SpentCoins is mapping between transactions and their spent
|
|
// coin state.
|
|
type SpentCoins map[util.Uint256]*SpentCoinState
|
|
|
|
func (s SpentCoins) getAndUpdate(store storage.Store, hash util.Uint256) (*SpentCoinState, error) {
|
|
if spent, ok := s[hash]; ok {
|
|
return spent, nil
|
|
}
|
|
|
|
spent := &SpentCoinState{}
|
|
key := storage.AppendPrefix(storage.STSpentCoin, hash.BytesReverse())
|
|
if b, err := store.Get(key); err == nil {
|
|
r := io.NewBinReaderFromBuf(b)
|
|
spent.DecodeBinary(r)
|
|
if r.Err != nil {
|
|
return nil, fmt.Errorf("failed to decode (UnspentCoinState): %s", r.Err)
|
|
}
|
|
} else {
|
|
spent = &SpentCoinState{
|
|
items: make(map[uint16]uint32),
|
|
}
|
|
}
|
|
|
|
s[hash] = spent
|
|
return spent, nil
|
|
}
|
|
|
|
// putSpentCoinStateIntoStore puts given SpentCoinState into the given store.
|
|
func putSpentCoinStateIntoStore(store storage.Store, hash util.Uint256, scs *SpentCoinState) error {
|
|
buf := io.NewBufBinWriter()
|
|
scs.EncodeBinary(buf.BinWriter)
|
|
if buf.Err != nil {
|
|
return buf.Err
|
|
}
|
|
key := storage.AppendPrefix(storage.STSpentCoin, hash.BytesReverse())
|
|
return store.Put(key, buf.Bytes())
|
|
}
|
|
|
|
func (s SpentCoins) commit(store storage.Store) error {
|
|
for hash, state := range s {
|
|
if err := putSpentCoinStateIntoStore(store, hash, state); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// SpentCoinState represents the state of a spent coin.
|
|
type SpentCoinState struct {
|
|
txHash util.Uint256
|
|
txHeight uint32
|
|
|
|
// A mapping between the index of the prevIndex and block height.
|
|
items map[uint16]uint32
|
|
}
|
|
|
|
// NewSpentCoinState returns a new SpentCoinState object.
|
|
func NewSpentCoinState(hash util.Uint256, height uint32) *SpentCoinState {
|
|
return &SpentCoinState{
|
|
txHash: hash,
|
|
txHeight: height,
|
|
items: make(map[uint16]uint32),
|
|
}
|
|
}
|
|
|
|
// DecodeBinary implements Serializable interface.
|
|
func (s *SpentCoinState) DecodeBinary(br *io.BinReader) {
|
|
br.ReadLE(&s.txHash)
|
|
br.ReadLE(&s.txHeight)
|
|
|
|
s.items = make(map[uint16]uint32)
|
|
lenItems := br.ReadVarUint()
|
|
for i := 0; i < int(lenItems); i++ {
|
|
var (
|
|
key uint16
|
|
value uint32
|
|
)
|
|
br.ReadLE(&key)
|
|
br.ReadLE(&value)
|
|
s.items[key] = value
|
|
}
|
|
}
|
|
|
|
// EncodeBinary implements Serializable interface.
|
|
func (s *SpentCoinState) EncodeBinary(bw *io.BinWriter) {
|
|
bw.WriteLE(s.txHash)
|
|
bw.WriteLE(s.txHeight)
|
|
bw.WriteVarUint(uint64(len(s.items)))
|
|
for k, v := range s.items {
|
|
bw.WriteLE(k)
|
|
bw.WriteLE(v)
|
|
}
|
|
}
|