mirror of
https://github.com/nspcc-dev/neo-go.git
synced 2024-11-23 03:38:35 +00:00
28908aa3cf
Signed-off-by: Elizaveta Chichindaeva <elizaveta@nspcc.ru>
139 lines
3.3 KiB
Go
139 lines
3.3 KiB
Go
package extpool
|
|
|
|
import (
|
|
"container/list"
|
|
"errors"
|
|
"sync"
|
|
|
|
"github.com/nspcc-dev/neo-go/pkg/core/transaction"
|
|
"github.com/nspcc-dev/neo-go/pkg/crypto/hash"
|
|
"github.com/nspcc-dev/neo-go/pkg/network/payload"
|
|
"github.com/nspcc-dev/neo-go/pkg/util"
|
|
)
|
|
|
|
// Ledger is enough of Blockchain to satisfy Pool.
|
|
type Ledger interface {
|
|
BlockHeight() uint32
|
|
IsExtensibleAllowed(util.Uint160) bool
|
|
VerifyWitness(util.Uint160, hash.Hashable, *transaction.Witness, int64) (int64, error)
|
|
}
|
|
|
|
// Pool represents a pool of extensible payloads.
|
|
type Pool struct {
|
|
lock sync.RWMutex
|
|
verified map[util.Uint256]*list.Element
|
|
senders map[util.Uint160]*list.List
|
|
// singleCap represents the maximum number of payloads from a single sender.
|
|
singleCap int
|
|
chain Ledger
|
|
}
|
|
|
|
// New returns a new payload pool using the provided chain.
|
|
func New(bc Ledger, capacity int) *Pool {
|
|
if capacity <= 0 {
|
|
panic("invalid capacity")
|
|
}
|
|
|
|
return &Pool{
|
|
verified: make(map[util.Uint256]*list.Element),
|
|
senders: make(map[util.Uint160]*list.List),
|
|
singleCap: capacity,
|
|
chain: bc,
|
|
}
|
|
}
|
|
|
|
var (
|
|
errDisallowedSender = errors.New("disallowed sender")
|
|
errInvalidHeight = errors.New("invalid height")
|
|
)
|
|
|
|
// Add adds an extensible payload to the pool.
|
|
// First return value specifies if the payload was new.
|
|
// Second one is nil if and only if the payload is valid.
|
|
func (p *Pool) Add(e *payload.Extensible) (bool, error) {
|
|
if ok, err := p.verify(e); err != nil || !ok {
|
|
return ok, err
|
|
}
|
|
|
|
p.lock.Lock()
|
|
defer p.lock.Unlock()
|
|
|
|
h := e.Hash()
|
|
if _, ok := p.verified[h]; ok {
|
|
return false, nil
|
|
}
|
|
|
|
lst, ok := p.senders[e.Sender]
|
|
if ok && lst.Len() >= p.singleCap {
|
|
value := lst.Remove(lst.Front())
|
|
delete(p.verified, value.(*payload.Extensible).Hash())
|
|
} else if !ok {
|
|
lst = list.New()
|
|
p.senders[e.Sender] = lst
|
|
}
|
|
|
|
p.verified[h] = lst.PushBack(e)
|
|
return true, nil
|
|
}
|
|
|
|
func (p *Pool) verify(e *payload.Extensible) (bool, error) {
|
|
if _, err := p.chain.VerifyWitness(e.Sender, e, &e.Witness, extensibleVerifyMaxGAS); err != nil {
|
|
return false, err
|
|
}
|
|
h := p.chain.BlockHeight()
|
|
if h < e.ValidBlockStart || e.ValidBlockEnd <= h {
|
|
// We can receive a consensus payload for the last or next block
|
|
// which leads to an unwanted node disconnect.
|
|
if e.ValidBlockEnd == h {
|
|
return false, nil
|
|
}
|
|
return false, errInvalidHeight
|
|
}
|
|
if !p.chain.IsExtensibleAllowed(e.Sender) {
|
|
return false, errDisallowedSender
|
|
}
|
|
return true, nil
|
|
}
|
|
|
|
// Get returns payload by hash.
|
|
func (p *Pool) Get(h util.Uint256) *payload.Extensible {
|
|
p.lock.RLock()
|
|
defer p.lock.RUnlock()
|
|
|
|
elem, ok := p.verified[h]
|
|
if !ok {
|
|
return nil
|
|
}
|
|
return elem.Value.(*payload.Extensible)
|
|
}
|
|
|
|
const extensibleVerifyMaxGAS = 6000000
|
|
|
|
// RemoveStale removes invalid payloads after block processing.
|
|
func (p *Pool) RemoveStale(index uint32) {
|
|
p.lock.Lock()
|
|
defer p.lock.Unlock()
|
|
|
|
for s, lst := range p.senders {
|
|
for elem := lst.Front(); elem != nil; {
|
|
e := elem.Value.(*payload.Extensible)
|
|
h := e.Hash()
|
|
old := elem
|
|
elem = elem.Next()
|
|
|
|
if e.ValidBlockEnd <= index || !p.chain.IsExtensibleAllowed(e.Sender) {
|
|
delete(p.verified, h)
|
|
lst.Remove(old)
|
|
continue
|
|
}
|
|
if _, err := p.chain.VerifyWitness(e.Sender, e, &e.Witness, extensibleVerifyMaxGAS); err != nil {
|
|
delete(p.verified, h)
|
|
lst.Remove(old)
|
|
continue
|
|
}
|
|
}
|
|
if lst.Len() == 0 {
|
|
delete(p.senders, s)
|
|
}
|
|
}
|
|
}
|