mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 21:07:18 +00:00
5aac06f04e
* begin move * use same import path * imports * regen protos * regen * no rename * generate ssz * gaz * fmt * edit build file * imports * modify * remove generated files * remove protos * edit imports in prysm * beacon chain all builds * edit script * add generated pbs * add replace rules * license for ethereumapis protos * change visibility * fmt * update build files to gaz ignore * use proper form * edit imports * wrap block * revert scripts * revert go mod
82 lines
2.5 KiB
Go
82 lines
2.5 KiB
Go
package cache
|
|
|
|
import (
|
|
"sync"
|
|
|
|
lru "github.com/hashicorp/golang-lru"
|
|
"github.com/prometheus/client_golang/prometheus"
|
|
"github.com/prometheus/client_golang/prometheus/promauto"
|
|
iface "github.com/prysmaticlabs/prysm/beacon-chain/state/interface"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
)
|
|
|
|
var (
|
|
// maxCheckpointStateSize defines the max number of entries check point to state cache can contain.
|
|
// Choosing 10 to account for multiple forks, this allows 5 forks per epoch boundary with 2 epochs
|
|
// window to accept attestation based on latest spec.
|
|
maxCheckpointStateSize = 10
|
|
|
|
// Metrics.
|
|
checkpointStateMiss = promauto.NewCounter(prometheus.CounterOpts{
|
|
Name: "check_point_state_cache_miss",
|
|
Help: "The number of check point state requests that aren't present in the cache.",
|
|
})
|
|
checkpointStateHit = promauto.NewCounter(prometheus.CounterOpts{
|
|
Name: "check_point_state_cache_hit",
|
|
Help: "The number of check point state requests that are present in the cache.",
|
|
})
|
|
)
|
|
|
|
// CheckpointStateCache is a struct with 1 queue for looking up state by checkpoint.
|
|
type CheckpointStateCache struct {
|
|
cache *lru.Cache
|
|
lock sync.RWMutex
|
|
}
|
|
|
|
// NewCheckpointStateCache creates a new checkpoint state cache for storing/accessing processed state.
|
|
func NewCheckpointStateCache() *CheckpointStateCache {
|
|
cache, err := lru.New(maxCheckpointStateSize)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return &CheckpointStateCache{
|
|
cache: cache,
|
|
}
|
|
}
|
|
|
|
// StateByCheckpoint fetches state by checkpoint. Returns true with a
|
|
// reference to the CheckpointState info, if exists. Otherwise returns false, nil.
|
|
func (c *CheckpointStateCache) StateByCheckpoint(cp *ethpb.Checkpoint) (iface.BeaconState, error) {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
h, err := hashutil.HashProto(cp)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
item, exists := c.cache.Get(h)
|
|
|
|
if exists && item != nil {
|
|
checkpointStateHit.Inc()
|
|
// Copy here is unnecessary since the return will only be used to verify attestation signature.
|
|
return item.(iface.BeaconState), nil
|
|
}
|
|
|
|
checkpointStateMiss.Inc()
|
|
return nil, nil
|
|
}
|
|
|
|
// AddCheckpointState adds CheckpointState object to the cache. This method also trims the least
|
|
// recently added CheckpointState object if the cache size has ready the max cache size limit.
|
|
func (c *CheckpointStateCache) AddCheckpointState(cp *ethpb.Checkpoint, s iface.ReadOnlyBeaconState) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
h, err := hashutil.HashProto(cp)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
c.cache.Add(h, s)
|
|
return nil
|
|
}
|