mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-22 19:40:37 +00:00
5a66807989
* First take at updating everything to v5 * Patch gRPC gateway to use prysm v5 Fix patch * Update go ssz --------- Co-authored-by: Preston Van Loon <pvanloon@offchainlabs.com>
508 lines
17 KiB
Go
508 lines
17 KiB
Go
package stategen
|
|
|
|
import (
|
|
"context"
|
|
"testing"
|
|
|
|
"github.com/prysmaticlabs/prysm/v5/beacon-chain/core/blocks"
|
|
testDB "github.com/prysmaticlabs/prysm/v5/beacon-chain/db/testing"
|
|
doublylinkedtree "github.com/prysmaticlabs/prysm/v5/beacon-chain/forkchoice/doubly-linked-tree"
|
|
"github.com/prysmaticlabs/prysm/v5/config/params"
|
|
"github.com/prysmaticlabs/prysm/v5/consensus-types/primitives"
|
|
"github.com/prysmaticlabs/prysm/v5/encoding/bytesutil"
|
|
ethpb "github.com/prysmaticlabs/prysm/v5/proto/prysm/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/v5/testing/assert"
|
|
"github.com/prysmaticlabs/prysm/v5/testing/require"
|
|
"github.com/prysmaticlabs/prysm/v5/testing/util"
|
|
)
|
|
|
|
func TestStateByRoot_GenesisState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
b := util.NewBeaconBlock()
|
|
bRoot, err := b.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, beaconState, bRoot))
|
|
util.SaveBlock(t, ctx, service.beaconDB, b)
|
|
require.NoError(t, service.beaconDB.SaveGenesisBlockRoot(ctx, bRoot))
|
|
loadedState, err := service.StateByRoot(ctx, params.BeaconConfig().ZeroHash) // Zero hash is genesis state root.
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestStateByRoot_ColdState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
service.finalizedInfo.slot = 2
|
|
service.slotsPerArchivedPoint = 1
|
|
|
|
b := util.NewBeaconBlock()
|
|
b.Block.Slot = 1
|
|
util.SaveBlock(t, ctx, beaconDB, b)
|
|
bRoot, err := b.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
require.NoError(t, beaconState.SetSlot(1))
|
|
val, err := beaconState.ValidatorAtIndex(0)
|
|
require.NoError(t, err)
|
|
val.Slashed = true
|
|
require.NoError(t, beaconState.UpdateValidatorAtIndex(0, val))
|
|
roval, err := beaconState.ValidatorAtIndexReadOnly(0)
|
|
require.NoError(t, err)
|
|
require.Equal(t, true, roval.Slashed())
|
|
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, beaconState, bRoot))
|
|
util.SaveBlock(t, ctx, service.beaconDB, b)
|
|
require.NoError(t, service.beaconDB.SaveGenesisBlockRoot(ctx, bRoot))
|
|
loadedState, err := service.StateByRoot(ctx, bRoot)
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
|
|
bal, err := service.ActiveNonSlashedBalancesByRoot(ctx, bRoot)
|
|
require.NoError(t, err)
|
|
require.Equal(t, 32, len(bal))
|
|
for _, balance := range bal[1:] {
|
|
require.Equal(t, params.BeaconConfig().MaxEffectiveBalance, balance)
|
|
}
|
|
require.Equal(t, uint64(0), bal[0])
|
|
}
|
|
|
|
func TestStateByRootIfCachedNoCopy_HotState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
r := [32]byte{'A'}
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Root: r[:]}))
|
|
service.hotStateCache.put(r, beaconState)
|
|
|
|
loadedState := service.StateByRootIfCachedNoCopy(r)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestStateByRootIfCachedNoCopy_ColdState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
service.finalizedInfo.slot = 2
|
|
service.slotsPerArchivedPoint = 1
|
|
|
|
b := util.NewBeaconBlock()
|
|
b.Block.Slot = 1
|
|
util.SaveBlock(t, ctx, beaconDB, b)
|
|
bRoot, err := b.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
require.NoError(t, beaconState.SetSlot(1))
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, beaconState, bRoot))
|
|
util.SaveBlock(t, ctx, service.beaconDB, b)
|
|
require.NoError(t, service.beaconDB.SaveGenesisBlockRoot(ctx, bRoot))
|
|
loadedState := service.StateByRootIfCachedNoCopy(bRoot)
|
|
require.NoError(t, err)
|
|
require.Equal(t, loadedState, nil)
|
|
}
|
|
|
|
func TestStateByRoot_HotStateUsingEpochBoundaryCacheNoReplay(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
require.NoError(t, beaconState.SetSlot(10))
|
|
blk := util.NewBeaconBlock()
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Root: blkRoot[:]}))
|
|
require.NoError(t, service.epochBoundaryStateCache.put(blkRoot, beaconState))
|
|
loadedState, err := service.StateByRoot(ctx, blkRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, primitives.Slot(10), loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestStateByRoot_HotStateUsingEpochBoundaryCacheWithReplay(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
blk := util.NewBeaconBlock()
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(blkRoot, beaconState))
|
|
targetSlot := primitives.Slot(10)
|
|
targetBlock := util.NewBeaconBlock()
|
|
targetBlock.Block.Slot = 11
|
|
targetBlock.Block.ParentRoot = blkRoot[:]
|
|
targetBlock.Block.ProposerIndex = 8
|
|
util.SaveBlock(t, ctx, service.beaconDB, targetBlock)
|
|
targetRoot, err := targetBlock.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Slot: targetSlot, Root: targetRoot[:]}))
|
|
loadedState, err := service.StateByRoot(ctx, targetRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, targetSlot, loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestStateByRoot_HotStateCached(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
r := [32]byte{'A'}
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Root: r[:]}))
|
|
service.hotStateCache.put(r, beaconState)
|
|
|
|
loadedState, err := service.StateByRoot(ctx, r)
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestDeleteStateFromCaches(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
r := [32]byte{'A'}
|
|
|
|
require.Equal(t, false, service.hotStateCache.has(r))
|
|
_, has, err := service.epochBoundaryStateCache.getByBlockRoot(r)
|
|
require.NoError(t, err)
|
|
require.Equal(t, false, has)
|
|
|
|
service.hotStateCache.put(r, beaconState)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(r, beaconState))
|
|
|
|
require.Equal(t, true, service.hotStateCache.has(r))
|
|
_, has, err = service.epochBoundaryStateCache.getByBlockRoot(r)
|
|
require.NoError(t, err)
|
|
require.Equal(t, true, has)
|
|
|
|
require.NoError(t, service.DeleteStateFromCaches(ctx, r))
|
|
|
|
require.Equal(t, false, service.hotStateCache.has(r))
|
|
_, has, err = service.epochBoundaryStateCache.getByBlockRoot(r)
|
|
require.NoError(t, err)
|
|
require.Equal(t, false, has)
|
|
}
|
|
|
|
func TestStateByRoot_StateByRootInitialSync(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
b := util.NewBeaconBlock()
|
|
bRoot, err := b.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, beaconState, bRoot))
|
|
util.SaveBlock(t, ctx, service.beaconDB, b)
|
|
require.NoError(t, service.beaconDB.SaveGenesisBlockRoot(ctx, bRoot))
|
|
loadedState, err := service.StateByRootInitialSync(ctx, params.BeaconConfig().ZeroHash) // Zero hash is genesis state root.
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestStateByRootInitialSync_UseEpochStateCache(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
targetSlot := primitives.Slot(10)
|
|
require.NoError(t, beaconState.SetSlot(targetSlot))
|
|
blk := util.NewBeaconBlock()
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(blkRoot, beaconState))
|
|
loadedState, err := service.StateByRootInitialSync(ctx, blkRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, targetSlot, loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestStateByRootInitialSync_UseCache(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
r := [32]byte{'A'}
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Root: r[:]}))
|
|
service.hotStateCache.put(r, beaconState)
|
|
|
|
loadedState, err := service.StateByRootInitialSync(ctx, r)
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
if service.hotStateCache.has(r) {
|
|
t.Error("Hot state cache was not invalidated")
|
|
}
|
|
}
|
|
|
|
func TestStateByRootInitialSync_CanProcessUpTo(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
blk := util.NewBeaconBlock()
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(blkRoot, beaconState))
|
|
targetSlot := primitives.Slot(10)
|
|
targetBlk := util.NewBeaconBlock()
|
|
targetBlk.Block.Slot = 11
|
|
targetBlk.Block.ParentRoot = blkRoot[:]
|
|
targetRoot, err := targetBlk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
util.SaveBlock(t, ctx, service.beaconDB, targetBlk)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Slot: targetSlot, Root: targetRoot[:]}))
|
|
|
|
loadedState, err := service.StateByRootInitialSync(ctx, targetRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, targetSlot, loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestLoadeStateByRoot_Cached(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
r := [32]byte{'A'}
|
|
service.hotStateCache.put(r, beaconState)
|
|
|
|
// This tests where hot state was already cached.
|
|
loadedState, err := service.loadStateByRoot(ctx, r)
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestLoadeStateByRoot_FinalizedState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
genesisStateRoot, err := beaconState.HashTreeRoot(ctx)
|
|
require.NoError(t, err)
|
|
genesis := blocks.NewGenesisBlock(genesisStateRoot[:])
|
|
util.SaveBlock(t, ctx, beaconDB, genesis)
|
|
gRoot, err := genesis.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Slot: 0, Root: gRoot[:]}))
|
|
|
|
service.finalizedInfo.state = beaconState
|
|
service.finalizedInfo.slot = beaconState.Slot()
|
|
service.finalizedInfo.root = gRoot
|
|
|
|
// This tests where hot state was already cached.
|
|
loadedState, err := service.loadStateByRoot(ctx, gRoot)
|
|
require.NoError(t, err)
|
|
require.DeepSSZEqual(t, loadedState.ToProtoUnsafe(), beaconState.ToProtoUnsafe())
|
|
}
|
|
|
|
func TestLoadeStateByRoot_EpochBoundaryStateCanProcess(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
gBlk := util.NewBeaconBlock()
|
|
gBlkRoot, err := gBlk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(gBlkRoot, beaconState))
|
|
|
|
blk := util.NewBeaconBlock()
|
|
blk.Block.Slot = 11
|
|
blk.Block.ProposerIndex = 8
|
|
blk.Block.ParentRoot = gBlkRoot[:]
|
|
util.SaveBlock(t, ctx, service.beaconDB, blk)
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Slot: 10, Root: blkRoot[:]}))
|
|
|
|
// This tests where hot state was not cached and needs processing.
|
|
loadedState, err := service.loadStateByRoot(ctx, blkRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, primitives.Slot(10), loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestLoadeStateByRoot_FromDBBoundaryCase(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
beaconState, _ := util.DeterministicGenesisState(t, 32)
|
|
gBlk := util.NewBeaconBlock()
|
|
gBlkRoot, err := gBlk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(gBlkRoot, beaconState))
|
|
|
|
blk := util.NewBeaconBlock()
|
|
blk.Block.Slot = 11
|
|
blk.Block.ProposerIndex = 8
|
|
blk.Block.ParentRoot = gBlkRoot[:]
|
|
util.SaveBlock(t, ctx, service.beaconDB, blk)
|
|
blkRoot, err := blk.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveStateSummary(ctx, ðpb.StateSummary{Slot: 10, Root: blkRoot[:]}))
|
|
|
|
// This tests where hot state was not cached and needs processing.
|
|
loadedState, err := service.loadStateByRoot(ctx, blkRoot)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, primitives.Slot(10), loadedState.Slot(), "Did not correctly load state")
|
|
}
|
|
|
|
func TestLastAncestorState_CanGetUsingDB(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
b0 := util.NewBeaconBlock()
|
|
b0.Block.ParentRoot = bytesutil.PadTo([]byte{'a'}, 32)
|
|
r0, err := b0.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b1 := util.NewBeaconBlock()
|
|
b1.Block.Slot = 1
|
|
b1.Block.ParentRoot = bytesutil.PadTo(r0[:], 32)
|
|
r1, err := b1.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b2 := util.NewBeaconBlock()
|
|
b2.Block.Slot = 2
|
|
b2.Block.ParentRoot = bytesutil.PadTo(r1[:], 32)
|
|
r2, err := b2.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b3 := util.NewBeaconBlock()
|
|
b3.Block.Slot = 3
|
|
b3.Block.ParentRoot = bytesutil.PadTo(r2[:], 32)
|
|
r3, err := b3.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
|
|
b1State, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
require.NoError(t, b1State.SetSlot(1))
|
|
|
|
util.SaveBlock(t, ctx, service.beaconDB, b0)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b1)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b2)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b3)
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, b1State, r1))
|
|
|
|
lastState, err := service.latestAncestor(ctx, r3)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, b1State.Slot(), lastState.Slot(), "Did not get wanted state")
|
|
}
|
|
|
|
func TestLastAncestorState_CanGetUsingCache(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
|
|
b0 := util.NewBeaconBlock()
|
|
b0.Block.ParentRoot = bytesutil.PadTo([]byte{'a'}, 32)
|
|
r0, err := b0.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b1 := util.NewBeaconBlock()
|
|
b1.Block.Slot = 1
|
|
b1.Block.ParentRoot = bytesutil.PadTo(r0[:], 32)
|
|
r1, err := b1.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b2 := util.NewBeaconBlock()
|
|
b2.Block.Slot = 2
|
|
b2.Block.ParentRoot = bytesutil.PadTo(r1[:], 32)
|
|
r2, err := b2.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
b3 := util.NewBeaconBlock()
|
|
b3.Block.Slot = 3
|
|
b3.Block.ParentRoot = bytesutil.PadTo(r2[:], 32)
|
|
r3, err := b3.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
|
|
b1State, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
require.NoError(t, b1State.SetSlot(1))
|
|
|
|
util.SaveBlock(t, ctx, service.beaconDB, b0)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b1)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b2)
|
|
util.SaveBlock(t, ctx, service.beaconDB, b3)
|
|
service.hotStateCache.put(r1, b1State)
|
|
|
|
lastState, err := service.latestAncestor(ctx, r3)
|
|
require.NoError(t, err)
|
|
assert.Equal(t, b1State.Slot(), lastState.Slot(), "Did not get wanted state")
|
|
}
|
|
|
|
func TestState_HasState(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
s, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
rHit1 := [32]byte{1}
|
|
rHit2 := [32]byte{2}
|
|
rMiss := [32]byte{3}
|
|
service.hotStateCache.put(rHit1, s)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(rHit2, s))
|
|
|
|
b := util.NewBeaconBlock()
|
|
rHit3, err := b.Block.HashTreeRoot()
|
|
require.NoError(t, err)
|
|
require.NoError(t, service.beaconDB.SaveState(ctx, s, rHit3))
|
|
tt := []struct {
|
|
root [32]byte
|
|
want bool
|
|
}{
|
|
{rHit1, true},
|
|
{rHit2, true},
|
|
{rMiss, false},
|
|
{rHit3, true},
|
|
}
|
|
for _, tc := range tt {
|
|
got, err := service.HasState(ctx, tc.root)
|
|
require.NoError(t, err)
|
|
require.Equal(t, tc.want, got)
|
|
}
|
|
}
|
|
|
|
func TestState_HasStateInCache(t *testing.T) {
|
|
ctx := context.Background()
|
|
beaconDB := testDB.SetupDB(t)
|
|
service := New(beaconDB, doublylinkedtree.New())
|
|
s, err := util.NewBeaconState()
|
|
require.NoError(t, err)
|
|
rHit1 := [32]byte{1}
|
|
rHit2 := [32]byte{2}
|
|
rMiss := [32]byte{3}
|
|
service.hotStateCache.put(rHit1, s)
|
|
require.NoError(t, service.epochBoundaryStateCache.put(rHit2, s))
|
|
|
|
tt := []struct {
|
|
root [32]byte
|
|
want bool
|
|
}{
|
|
{rHit1, true},
|
|
{rHit2, true},
|
|
{rMiss, false},
|
|
}
|
|
for _, tc := range tt {
|
|
got, err := service.hasStateInCache(ctx, tc.root)
|
|
require.NoError(t, err)
|
|
require.Equal(t, tc.want, got)
|
|
}
|
|
}
|