CLaSH.Prelude.DataFlow

Self-synchronising circuits based on data-flow principles.

Data types

type DataFlow iEn oEn i o = DataFlow' SystemClock iEn oEn i o

Dataflow circuit synchronised to the SystemClock.

newtype DataFlow' clk iEn oEn i o

Dataflow circuit with bidirectional synchronisation channels.

In the forward direction we assert validity of the data. In the backward direction we assert that the circuit is ready to receive new data. A circuit adhering to the DataFlow type should:

• Not consume data when validity is deasserted.
• Only update its output when readiness is asserted.

The DataFlow' type is defined as:

newtype DataFlow' clk iEn oEn i o
  = DF
  { df :: Signal' clk i     -- Incoming data
       -> Signal' clk iEn   -- Flagged with valid bits iEn.
       -> Signal' clk oEn   -- Incoming back-pressure, ready edge.
       -> ( Signal' clk o   -- Outgoing data.
          , Signal' clk oEn -- Flagged with valid bits oEn.
          , Signal' clk iEn -- Outgoing back-pressure, ready edge.
          )
  }

where:

• clk is the clock to which the circuit is synchronised.
• iEn is the type of the bidirectional incoming synchronisation channel.
• oEn is the type of the bidirectional outgoing synchronisation channel.
• i is the incoming data type.
• o is the outgoing data type.

We define several composition operators for our DataFlow circuits:

• seqDF sequential composition.
• parDF parallel composition.
• loopDF add a feedback arc.
• lockStep proceed in lock-step.

When you look at the types of the above operators it becomes clear why we parametrise in the types of the synchronisation channels.

Constructors

DF

Fields

df :: Signal' clk i -> Signal' clk iEn -> Signal' clk oEn -> (Signal' clk o, Signal' clk oEn, Signal' clk iEn)

Create an ordinary circuit from a DataFlow circuit

Creating DataFlow circuits

liftDF :: (Signal' clk i -> Signal' clk Bool -> Signal' clk Bool -> (Signal' clk o, Signal' clk Bool, Signal' clk Bool)) -> DataFlow' clk Bool Bool i o

Create a DataFlow circuit from a circuit description with the appropriate type:

Signal' clk i        -- Incoming data.
-> Signal' clk Bool  -- Flagged with a single valid bit.
-> Signal' clk Bool  -- Incoming back-pressure, ready bit.
-> ( Signal' clk o   -- Outgoing data.
   , Signal' clk oEn -- Flagged with a single valid bit.
   , Signal' clk iEn -- Outgoing back-pressure, ready bit.
   )

A circuit adhering to the DataFlow type should:

• Not consume data when validity is deasserted.
• Only update its output when readiness is asserted.

pureDF :: (i -> o) -> DataFlow' clk Bool Bool i o

Create a DataFlow circuit where the given function f operates on the data, and the synchronisation channels are passed unaltered.

mealyDF :: (s -> i -> (s, o)) -> s -> DataFlow Bool Bool i o

Create a DataFlow circuit from a Mealy machine description as those of CLaSH.Prelude.Mealy

mooreDF :: (s -> i -> s) -> (s -> o) -> s -> DataFlow Bool Bool i o

Create a DataFlow circuit from a Moore machine description as those of CLaSH.Prelude.Moore

fifoDF

Arguments

:: (KnownNat addrSize, KnownNat n, KnownNat m, KnownNat (2 ^ addrSize), KnownNat (addrSize + 1), (m + n) ~ (2 ^ addrSize), KnownSymbol nm, KnownNat rate)

=> SNat (m + n)

Depth of the FIFO buffer. Must be a power of two.

-> Vec m a

Initial content. Can be smaller than the size of the FIFO. Empty spaces are initialised with undefined.

-> DataFlow' (Clk nm rate) Bool Bool a a

Create a FIFO buffer adhering to the DataFlow protocol. Can be filled with initial content.

To create a FIFO of size 4, with two initial values 2 and 3 you would write:

fifo4 = fifoDF d4 (2 :> 3 :> Nil)

Composition combinators

idDF :: DataFlow' clk en en a a

Identity circuit

seqDF :: DataFlow' clk aEn bEn a b -> DataFlow' clk bEn cEn b c -> DataFlow' clk aEn cEn a c

Sequential composition of two DataFlow circuits.

firstDF :: (KnownSymbol nm, KnownNat rate) => DataFlow' (Clk nm rate) aEn bEn a b -> DataFlow' (Clk nm rate) (aEn, cEn) (bEn, cEn) (a, c) (b, c)

Apply the circuit to the first halve of the communication channels, leave the second halve unchanged.

swapDF :: DataFlow' (Clk nm rate) (aEn, bEn) (bEn, aEn) (a, b) (b, a)

Swap the two communication channels.

secondDF :: (KnownSymbol nm, KnownNat rate) => DataFlow' (Clk nm rate) aEn bEn a b -> DataFlow' (Clk nm rate) (cEn, aEn) (cEn, bEn) (c, a) (c, b)

Apply the circuit to the second halve of the communication channels, leave the first halve unchanged.

parDF :: (KnownSymbol nm, KnownNat rate) => DataFlow' (Clk nm rate) aEn bEn a b -> DataFlow' (Clk nm rate) cEn dEn c d -> DataFlow' (Clk nm rate) (aEn, cEn) (bEn, dEn) (a, c) (b, d)

Compose two DataFlow circuits in parallel.

parNDF :: (KnownSymbol nm, KnownNat rate, KnownNat n) => Vec n (DataFlow' (Clk nm rate) aEn bEn a b) -> DataFlow' (Clk nm rate) (Vec n aEn) (Vec n bEn) (Vec n a) (Vec n b)

Compose n DataFlow circuits in parallel.

loopDF

Arguments

:: (KnownNat m, KnownNat n, KnownNat rate, KnownNat addrSize, KnownNat (2 ^ addrSize), KnownNat (addrSize + 1), KnownSymbol nm, (m + n) ~ (2 ^ addrSize))

=> SNat (m + n)

Depth of the FIFO buffer. Must be a power of two

-> Vec m d

Initial content of the FIFO buffer. Can be smaller than the size of the FIFO. Empty spaces are initialised with undefined.

-> DataFlow' (Clk nm rate) (Bool, Bool) (Bool, Bool) (a, d) (b, d)

-> DataFlow' (Clk nm rate) Bool Bool a b

Feed back the second halve of the communication channel. The feedback loop is buffered by a fifoDF circuit.

So given a circuit h with two synchronisation channels:

h :: DataFlow (Bool,Bool) (Bool,Bool) (a,d) (b,d)

Feeding back the d part (including its synchronisation channels) results in:

loopDF d4 Nil h

When you have a circuit h', with only a single synchronisation channel:

h' :: DataFlow Bool Bool (a,d) (b,d)

and you want to compose h' in a feedback loop, the following will not work:

f `seqDF` (loopDF d4 Nil h') `seqDF` g

The circuits f, h, and g, must operate in lock-step because the h' circuit only has a single synchronisation channel. Consequently, there should only be progress when all three circuits are producing valid data and all three circuits are ready to receive new data. We need to compose h' with the lockStep and stepLock functions to achieve the lock-step operation.

f `seqDF` (lockStep `seqDF` loopDF d4 Nil h' `seqDF` stepLock) `seqDF` g

loopDF_nobuf :: (KnownSymbol nm, KnownNat rate) => DataFlow' (Clk nm rate) (Bool, Bool) (Bool, Bool) (a, d) (b, d) -> DataFlow' (Clk nm rate) Bool Bool a b

Feed back the second halve of the communication channel. Unlike loopDF, the feedback loop is not buffered.

Lock-Step operation

class LockStep a b where

Reduce or extend the synchronisation granularity of parallel compositions.

Methods

lockStep :: (KnownNat rate, KnownSymbol nm) => DataFlow' (Clk nm rate) a Bool b b

Reduce the synchronisation granularity to a single Boolean value.

Given:

f :: DataFlow Bool Bool a b
g :: DataFlow Bool Bool c d
h :: DataFlow Bool Bool (b,d) (p,q)

We cannot simply write:

(f `parDF` g) `seqDF` h

because, f `parDF` g, has type, DataFlow (Bool,Bool) (Bool,Bool) (a,c) (b,d), which does not match the expected synchronisation granularity of h. We need a circuit in between that has the type:

DataFlow (Bool,Bool) Bool (b,d) (b,d)

Simply &&-ing the valid signals in the forward direction, and duplicating the ready signal in the backward direction is however not enough. We also need to make sure that f does not update its output when g's output is invalid and visa versa, as h can only consume its input when both f and g are producing valid data. g's ready port is hence only asserted when h is ready and f is producing valid data. And f's ready port is only asserted when h is ready and g is producing valid data. f and g will hence be proceeding in lock-step.

The lockStep function ensures that all synchronisation signals are properly connected:

(f `parDF` g) `seqDF` lockStep `seqDF` h

Note 1: ensure that the components that you are synchronising have buffered/delayed ready and valid signals, or lockStep has the potential to introduce combinational loops. You can do this by placing fifoDFs on the parallel channels. Extending the above example, you would write:

((f `seqDF` fifoDF d4 Nil) `parDF` (g `seqDF` fifoDF d4 Nil)) `seqDF` lockStep `seqDF` h

Note 2: lockStep works for arbitrarily nested tuples. That is:

p :: DataFlow Bool Bool ((b,d),d) z

q :: DataFlow ((Bool,Bool),Bool) ((Bool,Bool),Bool) ((a,c),c) ((b,d),d)
q = f `parDF` g `parDF` g

r = q `seqDF` lockStep `seqDF` p

Does the right thing.

stepLock :: (KnownNat rate, KnownSymbol nm) => DataFlow' (Clk nm rate) Bool a b b

Extend the synchronisation granularity from a single Boolean value.

Given:

f :: DataFlow Bool Bool a b
g :: DataFlow Bool Bool c d
h :: DataFlow Bool Bool (p,q) (a,c)

We cannot simply write:

h `seqDF` (f `parDF` g)

because, f `parDF` g, has type, DataFlow (Bool,Bool) (Bool,Bool) (a,c) (b,d), which does not match the expected synchronisation granularity of h. We need a circuit in between that has the type:

DataFlow Bool (Bool,Bool) (a,c) (a,c)

Simply &&-ing the ready signals in the backward direction, and duplicating the valid signal in the forward direction is however not enough. We need to make sure that f does not consume values when g is not ready and visa versa, because h cannot update the values of its output tuple independently. f's valid port is hence only asserted when h is valid and g is ready to receive new values. g's valid port is only asserted when h is valid and f is ready to receive new values. f and g will hence be proceeding in lock-step.

The stepLock function ensures that all synchronisation signals are properly connected:

h `seqDF` stepLock `seqDF` (f `parDF` g)

Note 1: ensure that the components that you are synchronising have buffered/delayed ready and valid signals, or stepLock has the potential to introduce combinational loops. You can do this by placing fifoDFs on the parallel channels. Extending the above example, you would write:

h `seqDF` stepLock `seqDF` ((fifoDF d4 Nil `seqDF` f) `parDF` (fifoDF d4 Nil `seqDF` g))

Note 2: stepLock works for arbitrarily nested tuples. That is:

p :: DataFlow Bool Bool z ((a,c),c)

q :: DataFlow ((Bool,Bool),Bool) ((Bool,Bool),Bool) ((a,c),c) ((b,d),d)
q = f `parDF` g `parDF` g

r = p `seqDF` stepLock `seqDF` q

Does the right thing.

Instances

LockStep Bool c

(LockStep a x, LockStep b y) => LockStep (a, b) (x, y)

(LockStep en a, KnownNat m, (~) Nat m ((+) n 1), KnownNat ((+) n 1)) => LockStep (Vec m en) (Vec m a)