Skip to main content

Note

Enum Note 

Source
pub enum Note {
    EpochRefused {
        from: NodeId,
        ts: u64,
        why: Refusal,
    },
    ReportIgnored {
        from: NodeId,
        nts: u64,
        why: Refusal,
    },
    ReachReported {
        leader: NodeId,
        nts: u64,
    },
    LeadershipYielded {
        to: NodeId,
        round: u64,
    },
    ProposalIgnored {
        slot: u64,
    },
    WindowFull {
        slot_in: u64,
        slot_out: u64,
    },
    SlotReproposed {
        slot: u64,
    },
    ProposalDisplaced {
        slot: u64,
    },
    CollectedBelow {
        slot: u64,
    },
    CaughtUpFrom {
        slot: u64,
    },
}
Expand description

A decision a protocol took, in the vocabulary this stack narrates in.

Variants§

§

EpochRefused

An announcement of a new epoch was refused. The trace holds the refusal that went back on the wire; it does not hold what was wrong with the announcement.

Fields

§from: NodeId
§ts: u64
§

ReportIgnored

A peer’s report of how far it had reached was not acted on. Nothing at all reaches the trace from this decision — it is the shape of silence that cost the most to diagnose.

Fields

§from: NodeId
§nts: u64
§

ReachReported

This process volunteered how far it had reached to a leader that may never have been told it had become one. The same NACK as a refusal goes on the wire, so the trace cannot tell the two decisions apart; this says which it was.

Fields

§leader: NodeId
§nts: u64
§

LeadershipYielded

A leader was preempted by a higher ballot and did not take up another, because Ω no longer trusts it. Nothing at all reaches the trace from this decision — a leader that stops competing sends no message, sets no timer and raises no indication, so a run in which it correctly stood down and one in which it was never told apart look identical.

Fields

§to: NodeId
§round: u64
§

ProposalIgnored

A proposal was dropped because this leader already had one for the slot — Figure 7’s if ∄c' : ⟨s, c'⟩ ∈ proposals, which is what keeps at most one commander per slot. The decision produces no effect whatever.

Fields

§slot: u64
§

WindowFull

A replica held requests it was not allowed to propose for, because slot_in had reached slot_out + WINDOW — Invariant R5. Nothing at all reaches the trace from this decision: a replica whose window is full sends nothing and looks exactly like one with nothing to do, which is the shape the fourth liveness violation wears.

Fields

§slot_in: u64
§slot_out: u64
§

SlotReproposed

A proposal outstanding past its threshold was proposed again for the same slot — the replica’s half of Liu et al.’s fourth liveness fix. Where the leader is on this machine the proposal is a function call, so the repeat can reach the trace as nothing whatever; this says it happened, and the trace cannot tell it from a first proposal in any case.

Fields

§slot: u64
§

ProposalDisplaced

A replica’s own command lost its slot to somebody else’s and went back into requests — Figure 1’s if c'' ≠ c' then requests := requests ∪ {c''}. The decision produces no effect until the command is proposed again at a later slot, and a replica that dropped it instead would lose an append in silence.

Fields

§slot: u64
§

CollectedBelow

State for every slot below slot was discarded, because enough replicas have applied it — the source’s §4.2. Nothing at all reaches the trace from this decision: collecting sends no message, sets no timer and raises no indication, so a run that collects and one that has stopped collecting look identical from outside. Which matters, because stopping is the specified behaviour when too few replicas remain to report.

Fields

§slot: u64
§

CaughtUpFrom

A replica asked a peer for the decisions from slot onwards, because the consensus beneath it has collected them and can no longer answer. Nothing at all reaches the trace from the decision itself, and the request that follows is indistinguishable on the wire from any other; this says why it was made.

Fields

§slot: u64

Trait Implementations§

Source§

impl Clone for Note

Source§

fn clone(&self) -> Note

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Note

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Eq for Note

Source§

impl PartialEq for Note

Source§

fn eq(&self, other: &Note) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for Note

Auto Trait Implementations§

§

impl Freeze for Note

§

impl RefUnwindSafe for Note

§

impl Send for Note

§

impl Sync for Note

§

impl Unpin for Note

§

impl UnsafeUnpin for Note

§

impl UnwindSafe for Note

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V