|
|
@ -261,7 +261,7 @@ func TestStateFullRound1(t *testing.T) { |
|
|
|
|
|
|
|
// grab proposal
|
|
|
|
re := <-propCh |
|
|
|
propBlockHash := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState).ProposalBlock.Hash() |
|
|
|
propBlockHash := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState).ProposalBlock.Hash() |
|
|
|
|
|
|
|
<-voteCh // wait for prevote
|
|
|
|
validatePrevote(t, cs, round, vss[0], propBlockHash) |
|
|
@ -356,7 +356,7 @@ func TestStateLockNoPOL(t *testing.T) { |
|
|
|
cs1.startRoutines(0) |
|
|
|
|
|
|
|
re := <-proposalCh |
|
|
|
rs := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
theBlockHash := rs.ProposalBlock.Hash() |
|
|
|
|
|
|
|
<-voteCh // prevote
|
|
|
@ -396,7 +396,7 @@ func TestStateLockNoPOL(t *testing.T) { |
|
|
|
|
|
|
|
// now we're on a new round and not the proposer, so wait for timeout
|
|
|
|
re = <-timeoutProposeCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
|
|
|
|
if rs.ProposalBlock != nil { |
|
|
|
panic("Expected proposal block to be nil") |
|
|
@ -440,7 +440,7 @@ func TestStateLockNoPOL(t *testing.T) { |
|
|
|
incrementRound(vs2) |
|
|
|
|
|
|
|
re = <-proposalCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
|
|
|
|
// now we're on a new round and are the proposer
|
|
|
|
if !bytes.Equal(rs.ProposalBlock.Hash(), rs.LockedBlock.Hash()) { |
|
|
@ -529,7 +529,7 @@ func TestStateLockPOLRelock(t *testing.T) { |
|
|
|
|
|
|
|
<-newRoundCh |
|
|
|
re := <-proposalCh |
|
|
|
rs := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
theBlockHash := rs.ProposalBlock.Hash() |
|
|
|
|
|
|
|
<-voteCh // prevote
|
|
|
@ -605,9 +605,9 @@ func TestStateLockPOLRelock(t *testing.T) { |
|
|
|
discardFromChan(voteCh, 2) |
|
|
|
|
|
|
|
be := <-newBlockCh |
|
|
|
b := be.(types.TMEventData).Unwrap().(types.EventDataNewBlockHeader) |
|
|
|
b := be.(types.EventDataNewBlockHeader) |
|
|
|
re = <-newRoundCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
if rs.Height != 2 { |
|
|
|
panic("Expected height to increment") |
|
|
|
} |
|
|
@ -643,7 +643,7 @@ func TestStateLockPOLUnlock(t *testing.T) { |
|
|
|
startTestRound(cs1, cs1.Height, 0) |
|
|
|
<-newRoundCh |
|
|
|
re := <-proposalCh |
|
|
|
rs := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
theBlockHash := rs.ProposalBlock.Hash() |
|
|
|
|
|
|
|
<-voteCh // prevote
|
|
|
@ -669,7 +669,7 @@ func TestStateLockPOLUnlock(t *testing.T) { |
|
|
|
|
|
|
|
// timeout to new round
|
|
|
|
re = <-timeoutWaitCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
lockedBlockHash := rs.LockedBlock.Hash() |
|
|
|
|
|
|
|
//XXX: this isnt guaranteed to get there before the timeoutPropose ...
|
|
|
@ -731,7 +731,7 @@ func TestStateLockPOLSafety1(t *testing.T) { |
|
|
|
startTestRound(cs1, cs1.Height, 0) |
|
|
|
<-newRoundCh |
|
|
|
re := <-proposalCh |
|
|
|
rs := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
propBlock := rs.ProposalBlock |
|
|
|
|
|
|
|
<-voteCh // prevote
|
|
|
@ -781,7 +781,7 @@ func TestStateLockPOLSafety1(t *testing.T) { |
|
|
|
re = <-proposalCh |
|
|
|
} |
|
|
|
|
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
|
|
|
|
if rs.LockedBlock != nil { |
|
|
|
panic("we should not be locked!") |
|
|
@ -1033,7 +1033,7 @@ func TestStateHalt1(t *testing.T) { |
|
|
|
startTestRound(cs1, cs1.Height, 0) |
|
|
|
<-newRoundCh |
|
|
|
re := <-proposalCh |
|
|
|
rs := re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs := re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
propBlock := rs.ProposalBlock |
|
|
|
propBlockParts := propBlock.MakePartSet(partSize) |
|
|
|
|
|
|
@ -1056,7 +1056,7 @@ func TestStateHalt1(t *testing.T) { |
|
|
|
// timeout to new round
|
|
|
|
<-timeoutWaitCh |
|
|
|
re = <-newRoundCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
|
|
|
|
t.Log("### ONTO ROUND 1") |
|
|
|
/*Round2 |
|
|
@ -1074,7 +1074,7 @@ func TestStateHalt1(t *testing.T) { |
|
|
|
// receiving that precommit should take us straight to commit
|
|
|
|
<-newBlockCh |
|
|
|
re = <-newRoundCh |
|
|
|
rs = re.(types.TMEventData).Unwrap().(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
rs = re.(types.EventDataRoundState).RoundState.(*cstypes.RoundState) |
|
|
|
|
|
|
|
if rs.Height != 2 { |
|
|
|
panic("expected height to increment") |
|
|
|