mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-25 04:17:25 +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>
60 lines
1.6 KiB
Go
60 lines
1.6 KiB
Go
package pubsub
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus"
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus/models"
|
|
)
|
|
|
|
// ProposalViolationDistributor ingests notifications about HotStuff-protocol
|
|
// violations and distributes them to consumers. Such notifications are produced
|
|
// by the active consensus participants and the consensus follower. Concurrently
|
|
// safe.
|
|
type ProposalViolationDistributor[
|
|
StateT models.Unique,
|
|
VoteT models.Unique,
|
|
] struct {
|
|
consumers []consensus.ProposalViolationConsumer[StateT, VoteT]
|
|
lock sync.RWMutex
|
|
}
|
|
|
|
var _ consensus.ProposalViolationConsumer[*nilUnique, *nilUnique] = (*ProposalViolationDistributor[*nilUnique, *nilUnique])(nil)
|
|
|
|
func NewProposalViolationDistributor[
|
|
StateT models.Unique,
|
|
VoteT models.Unique,
|
|
]() *ProposalViolationDistributor[StateT, VoteT] {
|
|
return &ProposalViolationDistributor[StateT, VoteT]{}
|
|
}
|
|
|
|
func (
|
|
d *ProposalViolationDistributor[StateT, VoteT],
|
|
) AddProposalViolationConsumer(
|
|
consumer consensus.ProposalViolationConsumer[StateT, VoteT],
|
|
) {
|
|
d.lock.Lock()
|
|
defer d.lock.Unlock()
|
|
d.consumers = append(d.consumers, consumer)
|
|
}
|
|
|
|
func (
|
|
d *ProposalViolationDistributor[StateT, VoteT],
|
|
) OnInvalidStateDetected(err *models.InvalidProposalError[StateT, VoteT]) {
|
|
d.lock.RLock()
|
|
defer d.lock.RUnlock()
|
|
for _, subscriber := range d.consumers {
|
|
subscriber.OnInvalidStateDetected(err)
|
|
}
|
|
}
|
|
|
|
func (
|
|
d *ProposalViolationDistributor[StateT, VoteT],
|
|
) OnDoubleProposeDetected(state1, state2 *models.State[StateT]) {
|
|
d.lock.RLock()
|
|
defer d.lock.RUnlock()
|
|
for _, subscriber := range d.consumers {
|
|
subscriber.OnDoubleProposeDetected(state1, state2)
|
|
}
|
|
}
|