mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 04:47:18 +00:00
77d3ccb9ad
* Clean up state types * rename package
84 lines
2.6 KiB
Go
84 lines
2.6 KiB
Go
package cache
|
|
|
|
import (
|
|
"bytes"
|
|
"sync"
|
|
|
|
"github.com/prysmaticlabs/prysm/v3/consensus-types/primitives"
|
|
"github.com/prysmaticlabs/prysm/v3/encoding/bytesutil"
|
|
)
|
|
|
|
const vIdLength = 8
|
|
const pIdLength = 8
|
|
const vpIdsLength = vIdLength + pIdLength
|
|
|
|
// ProposerPayloadIDsCache is a cache of proposer payload IDs.
|
|
// The key is the slot. The value is the concatenation of the proposer and payload IDs. 8 bytes each.
|
|
type ProposerPayloadIDsCache struct {
|
|
slotToProposerAndPayloadIDs map[[40]byte][vpIdsLength]byte
|
|
sync.RWMutex
|
|
}
|
|
|
|
// NewProposerPayloadIDsCache creates a new proposer payload IDs cache.
|
|
func NewProposerPayloadIDsCache() *ProposerPayloadIDsCache {
|
|
return &ProposerPayloadIDsCache{
|
|
slotToProposerAndPayloadIDs: make(map[[40]byte][vpIdsLength]byte),
|
|
}
|
|
}
|
|
|
|
// GetProposerPayloadIDs returns the proposer and payload IDs for the given slot.
|
|
func (f *ProposerPayloadIDsCache) GetProposerPayloadIDs(slot primitives.Slot, r [32]byte) (primitives.ValidatorIndex, [8]byte, bool) {
|
|
f.RLock()
|
|
defer f.RUnlock()
|
|
ids, ok := f.slotToProposerAndPayloadIDs[idKey(slot, r)]
|
|
if !ok {
|
|
return 0, [8]byte{}, false
|
|
}
|
|
vId := ids[:vIdLength]
|
|
|
|
b := ids[vIdLength:]
|
|
var pId [pIdLength]byte
|
|
copy(pId[:], b)
|
|
|
|
return primitives.ValidatorIndex(bytesutil.BytesToUint64BigEndian(vId)), pId, true
|
|
}
|
|
|
|
// SetProposerAndPayloadIDs sets the proposer and payload IDs for the given slot.
|
|
func (f *ProposerPayloadIDsCache) SetProposerAndPayloadIDs(slot primitives.Slot, vId primitives.ValidatorIndex, pId [8]byte, r [32]byte) {
|
|
f.Lock()
|
|
defer f.Unlock()
|
|
var vIdBytes [vIdLength]byte
|
|
copy(vIdBytes[:], bytesutil.Uint64ToBytesBigEndian(uint64(vId)))
|
|
|
|
var bs [vpIdsLength]byte
|
|
copy(bs[:], append(vIdBytes[:], pId[:]...))
|
|
|
|
k := idKey(slot, r)
|
|
ids, ok := f.slotToProposerAndPayloadIDs[k]
|
|
// Ok to overwrite if the slot is already set but the cached payload ID is not set.
|
|
// This combats the re-org case where payload assignment could change at the start of the epoch.
|
|
var byte8 [vIdLength]byte
|
|
if !ok || (ok && bytes.Equal(ids[vIdLength:], byte8[:])) {
|
|
f.slotToProposerAndPayloadIDs[k] = bs
|
|
}
|
|
}
|
|
|
|
// PrunePayloadIDs removes the payload id entries that's current than input slot.
|
|
func (f *ProposerPayloadIDsCache) PrunePayloadIDs(slot primitives.Slot) {
|
|
f.Lock()
|
|
defer f.Unlock()
|
|
|
|
for k := range f.slotToProposerAndPayloadIDs {
|
|
s := primitives.Slot(bytesutil.BytesToUint64BigEndian(k[:8]))
|
|
if slot > s {
|
|
delete(f.slotToProposerAndPayloadIDs, k)
|
|
}
|
|
}
|
|
}
|
|
|
|
func idKey(slot primitives.Slot, r [32]byte) [40]byte {
|
|
var k [40]byte
|
|
copy(k[:], append(bytesutil.Uint64ToBytesBigEndian(uint64(slot)), r[:]...))
|
|
return k
|
|
}
|