mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-22 19:40:37 +00:00
b7e0819f00
* init - getLocalPayload does not use the proposer ID from the cache but takes it from the block - Fixed tests in blockchain package - Fixed tests in the RPC package - Fixed spectests EpochProposers takes 256 bytes that can be avoided to be copied, but this optimization is not clear to be worth it. assginmentStatus can be optimized to use the cached version from the TrackedValidatorsCache We shouldn't cache the proposer duties when calling getDuties but when we update the epoch boundary instead * track validators on prepare proposers * more rpc tests * more rpc tests * initialize grpc caches * Add back fcu log Also fix two existing bugs wrong parent hash on pre Capella and wrong blockhashes on altair * use beacon default fee recipient if there is none in the vc * fix validator test * radek's review * push always proposer settings even if no flag is specified in the VC * Only register with the builder if the VC flag is set Great find by @terencechain * add regression test * Radek's review * change signature of registration builder
64 lines
1.7 KiB
Go
64 lines
1.7 KiB
Go
package cache
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/prysmaticlabs/prysm/v4/consensus-types/primitives"
|
|
)
|
|
|
|
// RootToPayloadIDMap is a map with keys the head root and values the
|
|
// corresponding PayloadID
|
|
type RootToPayloadIDMap map[[32]byte]primitives.PayloadID
|
|
|
|
// PayloadIDCache is a cache that keeps track of the prepared payload ID for the
|
|
// given slot and with the given head root.
|
|
type PayloadIDCache struct {
|
|
slotToPayloadID map[primitives.Slot]RootToPayloadIDMap
|
|
sync.Mutex
|
|
}
|
|
|
|
// NewPayloadIDCache returns a new payload ID cache
|
|
func NewPayloadIDCache() *PayloadIDCache {
|
|
return &PayloadIDCache{slotToPayloadID: make(map[primitives.Slot]RootToPayloadIDMap)}
|
|
}
|
|
|
|
// PayloadID returns the payload ID for the given slot and parent block root
|
|
func (p *PayloadIDCache) PayloadID(slot primitives.Slot, root [32]byte) (primitives.PayloadID, bool) {
|
|
p.Lock()
|
|
defer p.Unlock()
|
|
inner, ok := p.slotToPayloadID[slot]
|
|
if !ok {
|
|
return primitives.PayloadID{}, false
|
|
}
|
|
pid, ok := inner[root]
|
|
if !ok {
|
|
return primitives.PayloadID{}, false
|
|
}
|
|
return pid, true
|
|
}
|
|
|
|
// SetPayloadID updates the payload ID for the given slot and head root
|
|
// it also prunes older entries in the cache
|
|
func (p *PayloadIDCache) Set(slot primitives.Slot, root [32]byte, pid primitives.PayloadID) {
|
|
p.Lock()
|
|
defer p.Unlock()
|
|
if slot > 1 {
|
|
p.prune(slot - 2)
|
|
}
|
|
inner, ok := p.slotToPayloadID[slot]
|
|
if !ok {
|
|
inner = make(RootToPayloadIDMap)
|
|
p.slotToPayloadID[slot] = inner
|
|
}
|
|
inner[root] = pid
|
|
}
|
|
|
|
// Prune prunes old payload IDs. Requires a Lock in the cache
|
|
func (p *PayloadIDCache) prune(slot primitives.Slot) {
|
|
for key := range p.slotToPayloadID {
|
|
if key < slot {
|
|
delete(p.slotToPayloadID, key)
|
|
}
|
|
}
|
|
}
|