Struct CompressionFarm 

pub struct CompressionFarm<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize>
where
    W<ROUNDS>: BitWidth,
    W<ADDRESS_BITS>: BitWidth,
{ /* private fields */ }

Structural farm of independent SHA-256 compression lanes.

The farm accepts one input vector on every rising edge. Each element is handled exclusively by the same-index lane and emerges at the same index exactly ROUNDS cycles later when not invalidated by reset. A bubble in one lane does not consume capacity in or alter the valid stream of another lane. There is no ready signal and no input backpressure.

ROUNDS and ADDRESS_BITS inherit CompressionLane’s constraints: ROUNDS must equal 2^ADDRESS_BITS, be at least two, and not exceed 64.

Trait Implementations

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> Clone for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

fn clone(&self) -> CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> Debug for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

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

Formats the value using the given formatter.

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> Default for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

fn default() -> Self

Returns the “default value” for a type.

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> Synchronous for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

type S = (<CompressionFarm<LANES, ROUNDS, ADDRESS_BITS> as SynchronousDQ>::Q, <[CompressionLane<ROUNDS, ADDRESS_BITS>; LANES] as Synchronous>::S)

The simulation state type. This type is used to represent the internal state of the circuit during simulation. It must be PartialEq and Clone. It holds whatever state is needed to compute the output of the circuit given it’s input. This state is typically auto-derived by the Synchronous derive macro, and it’s typically a struct containing the states of all the subcircuits, along with their last know outputs.

fn init(&self) -> Self::S

Initialize the simulation state. This method returns the initial state of the circuit for simulation. This is typically auto-derived by the Synchronous derive macro, and it typically initializes the states of all the subcircuits to their initial states.

fn children( &self, parent_scope: &ScopedName, ) -> impl Iterator<Item = Result<Descriptor<SyncKind>, RHDLError>>

Iterate over the child circuits of this circuit.

fn sim( &self, clock_reset: ClockReset, input: <Self as SynchronousIO>::I, state: &mut Self::S, ) -> <Self as SynchronousIO>::O

Simulate the circuit given it’s input, clock reset, and current state.

fn descriptor( &self, scoped_name: ScopedName, ) -> Result<Descriptor<SyncKind>, RHDLError>

Provides run time reflection of the circuit.

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> SynchronousDQ for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

type Q = Q<LANES, ROUNDS, ADDRESS_BITS>

The type of the internal data output from the children of the circuit.

type D = D<LANES, ROUNDS, ADDRESS_BITS>

The type of the internal data input to the children of the circuit.

impl<const LANES: usize, const ROUNDS: usize, const ADDRESS_BITS: usize> SynchronousIO for CompressionFarm<LANES, ROUNDS, ADDRESS_BITS>

where W<ROUNDS>: BitWidth, W<ADDRESS_BITS>: BitWidth,

type I = [CompressionInput; LANES]

The type of the input to the circuit.

type O = [CompressionOutput; LANES]

The type of the output from the circuit.

type Kernel = compression_farm_kernel<LANES, ROUNDS, ADDRESS_BITS>

The type of the kernel function used to compute the output and feedback. The kernel function must be a synthesizable function that takes a clock and reset signal, the input signal, and the feedback signal Q, and produces the output signal and feedback signal D.