mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-26 21:27:19 +00:00
6a5589f99e
* Check if cache is empty before update * Add tests * Fix tests Co-authored-by: Raul Jordan <raul@prysmaticlabs.com> Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
30 lines
1.1 KiB
Go
30 lines
1.1 KiB
Go
// +build libfuzzer
|
|
|
|
// This file is used in fuzzer builds to bypass proposer indices caches.
|
|
package cache
|
|
|
|
// FakeProposerIndicesCache is a struct with 1 queue for looking up proposer indices by root.
|
|
type FakeProposerIndicesCache struct {
|
|
}
|
|
|
|
// NewProposerIndicesCache creates a new proposer indices cache for storing/accessing proposer index assignments of an epoch.
|
|
func NewProposerIndicesCache() *FakeProposerIndicesCache {
|
|
return &FakeProposerIndicesCache{}
|
|
}
|
|
|
|
// AddProposerIndices adds ProposerIndices object to the cache.
|
|
// This method also trims the least recently list if the cache size has ready the max cache size limit.
|
|
func (c *FakeProposerIndicesCache) AddProposerIndices(p *ProposerIndices) error {
|
|
return nil
|
|
}
|
|
|
|
// ProposerIndices returns the proposer indices of a block root seed.
|
|
func (c *FakeProposerIndicesCache) ProposerIndices(r [32]byte) ([]uint64, error) {
|
|
return nil, nil
|
|
}
|
|
|
|
// HasProposerIndices returns the proposer indices of a block root seed.
|
|
func (c *FakeProposerIndicesCache) HasProposerIndices(r [32]byte) (bool, error) {
|
|
return false, nil
|
|
}
|