mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-21 10:27:26 +08:00
* wip: conversion of hotstuff from flow into Q-oriented model * bulk of tests * remaining non-integration tests * add integration test, adjust log interface, small tweaks * further adjustments, restore full pacemaker shape * add component lifecycle management+supervisor * further refinements * resolve timeout hanging * mostly finalized state for consensus * bulk of engine swap out * lifecycle-ify most types * wiring nearly complete, missing needed hooks for proposals * plugged in, vetting message validation paths * global consensus, plugged in and verified * app shard now wired in too * do not decode empty keys.yml (#456) * remove obsolete engine.maxFrames config parameter (#454) * default to Info log level unless debug is enabled (#453) * respect config's "logging" section params, remove obsolete single-file logging (#452) * Trivial code cleanup aiming to reduce Go compiler warnings (#451) * simplify range traversal * simplify channel read for single select case * delete rand.Seed() deprecated in Go 1.20 and no-op as of Go 1.24 * simplify range traversal * simplify channel read for single select case * remove redundant type from array * simplify range traversal * simplify channel read for single select case * RC slate * finalize 2.1.0.5 * Update comments in StrictMonotonicCounter Fix comment formatting and clarify description. --------- Co-authored-by: Black Swan <3999712+blacks1ne@users.noreply.github.com>
115 lines
3.4 KiB
Go
115 lines
3.4 KiB
Go
package integration
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/mock"
|
|
"github.com/stretchr/testify/require"
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus/helper"
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus/models"
|
|
)
|
|
|
|
func Connect(t *testing.T, instances []*Instance) {
|
|
|
|
// first, create a map of all instances and a queue for each
|
|
lookup := make(map[models.Identity]*Instance)
|
|
for _, in := range instances {
|
|
lookup[in.localID] = in
|
|
}
|
|
|
|
// then, for each instance, initialize a wired up communicator
|
|
for _, sender := range instances {
|
|
sender := sender // avoid capturing loop variable in closure
|
|
|
|
*sender.notifier = *NewMockedCommunicatorConsumer()
|
|
sender.notifier.CommunicatorConsumer.On("OnOwnProposal", mock.Anything, mock.Anything).Run(
|
|
func(args mock.Arguments) {
|
|
proposal, ok := args[0].(*models.SignedProposal[*helper.TestState, *helper.TestVote])
|
|
require.True(t, ok)
|
|
// sender should always have the parent
|
|
sender.updatingStates.RLock()
|
|
_, exists := sender.headers[proposal.State.ParentQuorumCertificate.Identity()]
|
|
sender.updatingStates.RUnlock()
|
|
if !exists {
|
|
t.Fatalf("parent for proposal not found (sender: %x, parent: %x)", sender.localID, proposal.State.ParentQuorumCertificate.Identity())
|
|
}
|
|
|
|
// store locally and loop back to engine for processing
|
|
sender.ProcessState(proposal)
|
|
|
|
// check if we should drop the outgoing proposal
|
|
if sender.dropPropOut(proposal) {
|
|
return
|
|
}
|
|
|
|
// iterate through potential receivers
|
|
for _, receiver := range instances {
|
|
// we should skip ourselves always
|
|
if receiver.localID == sender.localID {
|
|
continue
|
|
}
|
|
|
|
// check if we should drop the incoming proposal
|
|
if receiver.dropPropIn(proposal) {
|
|
continue
|
|
}
|
|
|
|
receiver.ProcessState(proposal)
|
|
}
|
|
},
|
|
)
|
|
sender.notifier.CommunicatorConsumer.On("OnOwnVote", mock.Anything, mock.Anything).Run(
|
|
func(args mock.Arguments) {
|
|
vote, ok := args[0].(**helper.TestVote)
|
|
require.True(t, ok)
|
|
recipientID, ok := args[1].(models.Identity)
|
|
require.True(t, ok)
|
|
// get the receiver
|
|
receiver, exists := lookup[recipientID]
|
|
if !exists {
|
|
t.Fatalf("recipient doesn't exist (sender: %x, receiver: %x)", sender.localID, recipientID)
|
|
}
|
|
// if we are next leader we should be receiving our own vote
|
|
if recipientID != sender.localID {
|
|
// check if we should drop the outgoing vote
|
|
if sender.dropVoteOut(*vote) {
|
|
return
|
|
}
|
|
// check if we should drop the incoming vote
|
|
if receiver.dropVoteIn(*vote) {
|
|
return
|
|
}
|
|
}
|
|
|
|
// submit the vote to the receiving event loop (non-dropping)
|
|
receiver.queue <- *vote
|
|
},
|
|
)
|
|
sender.notifier.CommunicatorConsumer.On("OnOwnTimeout", mock.Anything).Run(
|
|
func(args mock.Arguments) {
|
|
timeoutState, ok := args[0].(*models.TimeoutState[*helper.TestVote])
|
|
require.True(t, ok)
|
|
// iterate through potential receivers
|
|
for _, receiver := range instances {
|
|
|
|
// we should skip ourselves always
|
|
if receiver.localID == sender.localID {
|
|
continue
|
|
}
|
|
|
|
// check if we should drop the outgoing value
|
|
if sender.dropTimeoutStateOut(timeoutState) {
|
|
continue
|
|
}
|
|
|
|
// check if we should drop the incoming value
|
|
if receiver.dropTimeoutStateIn(timeoutState) {
|
|
continue
|
|
}
|
|
|
|
receiver.queue <- timeoutState
|
|
}
|
|
})
|
|
}
|
|
}
|