Sound.DF.Uniform.UDF

Untyped DF.

Documentation

data R_Id

Recursion identifier.

Constructors

R_Id Id

Instances

Eq R_Id

Show R_Id

data UDF

Un-typed data-flow node.

Constructors

UDF_K

Fields

udf_k :: K

UDF_A

Fields

udf_a :: Vec Float

UDF_R R_Id (Either K (UDF, UDF))

UDF_P String TypeRep [UDF]

UDF_M UDF UDF

Instances

Eq UDF

Show UDF

udf_concise :: UDF -> String

Concise pretty printer for UDF.

udf_k' :: UDF -> Maybe K

Maybe variant of udf_k.

udf_elem :: UDF -> [UDF]

List elements in left biased order.

udf_typeOf :: UDF -> TypeRep

Output type of UDF.

udf_traverse :: (st -> UDF -> (st, UDF)) -> st -> UDF -> (st, UDF)

Traversal with state, signature as mapAccumL.

Graph

type Port_Index = Int

Index for input port.

type Node = (Id, UDF)

A node is a UDF with associated Id.

data Edge_Ty

Enumeration of Edge types.

Constructors

Normal_Edge

Rec_Wr_Edge Id

Edge to recWr node

Rec_Rd_Edge Id

Edge from recRd node

Implicit_Edge Int

Edge to recRd node (from recWr)

Instances

Show Edge_Ty

edge_ty_concise :: Edge_Ty -> String

Pretty printer for Edge_Ty, and Show instance.

type Edge = (Id, Id, (Port_Index, Edge_Ty))

Edge from left hand side node to right hand side port.

type Graph = ([Node], [Edge])

A graph is a list of Nodes and Edges.

type Analysis = [(Node, [Edge])]

A variant graph form associating the list of in edges with each Node.

node_id :: Node -> Id

Id of Node.

node_udf :: Node -> UDF

UDF of Node.

label :: [Node] -> UDF -> Id

Read label of node.

source :: [Node] -> UDF -> Id

Transform node to source, see through UDF_R (rec) and UDF_M (mrg).

udf_edge_ty :: UDF -> Edge_Ty

Type of out edge of UDF.

edges :: [Node] -> UDF -> [Edge]

List incoming node edges.

match_rec :: R_Id -> Node -> Bool

True if Node is Right form of UDF_R with indicated R_Id.

implicit_edge :: [Node] -> Node -> Maybe Edge

Implicit edge from wR to rW.

is_k_node :: Node -> Bool

Is Node UDF_K.

is_orphan_edge :: [Node] -> Edge -> Bool

An Edge is orphaned if it refers to a Node that is not in the node list.

vgraph_impl :: Graph -> Graph

Transform the actual graph into a viewing graph by adding implicit edges from recWr to recRd nodes.

find_in_edge_m :: [Edge] -> (Id, Port_Index) -> Maybe Edge

Find edge with indicated right hand side port.

find_in_edge :: [Edge] -> (Id, Port_Index) -> Edge

Variant of find_in_edge_m that errors.

solve_rec_edge :: Int -> [Edge] -> (Id, Port_Index) -> (Int, Id)

Trace in edges until arrival at a Rec_Wr_Edge that is not proceeded by an Implicit_Edge. This traces the depth of the chain, however that is not currently drawn.

implicit_edge' :: [Edge] -> Edge -> Maybe Edge

Transform Rec_Rd_Edge to resolved Implicit_Edge.

is_rec_node :: Node -> Bool

Is Node UDF_R.

vgraph_direct :: Graph -> Graph

Transform the actual graph into a viewing graph by deleting recWr and recRd nodes and drawing a direct backward edge.

analyse :: [UDF] -> Analysis

Label nodes and list incoming edges. Multiple-root nodes are erased.

 analyse (udf_elem c)

graph :: UDF -> Graph

Generate graph (node list and edge list).

 import Sound.DF.Uniform.GADT
 import qualified Sound.DF.Uniform.UDF as U

 let g = iir1 (0.0::Float) (+) 1
 let c = df_erase g

 map U.udf_concise (U.udf_elem c)
 > [recWr,df_add:Float,1.0,recRd:0.0,df_add:Float,1.0,recRd:0.0]

 U.vgraph_direct (U.graph c)
 > ([(1,wR_1),(2,df_add:Float),(3,1.0),(4,rR_1:0.0)]
 > ,[(2,1,0),(3,2,0),(4,2,1)])

 U.draw c

FGL Graph

type Gr = Gr UDF (Port_Index, Edge_Ty)

FGL graph with UDF label.

type Gr' = Gr String (Port_Index, Edge_Ty)

FGL graph with pretty-printed UDF label.

udf_gr :: Graph -> Gr

Generate Gr.

udf_gr' :: Graph -> Gr'

Generate Gr'.

tsort :: UDF -> [UDF]

Topological sort of nodes (via udf_gr).

Code Gen

node_vars :: Node -> [Var]

List of required variable declarations.

node_c_call :: (Node, [Edge]) -> Maybe C_Call

Possible c-call code statement.

k_nodes :: [Node] -> [(Id, K)]

Constant nodes.

udf_instructions :: UDF -> Instructions

Generate Instructions from UDF.

udf_dl_gen :: FilePath -> (Host, FilePath) -> UDF -> IO ()

dl_gen of udf_instructions.

Graph Drawing

dot_ar :: [UDF] -> [Either Int K]

Make dot_rec arguments input.

dot_node :: Node -> String

Dot notation of Node.

edge_ty_colour :: Edge_Ty -> String

Edges are coloured according to their type.

dot_edge :: Edge -> String

Dot notation of Edge.

dot_graph :: Graph -> [String]

Dot notation of Graph.

dot_draw :: String -> IO ()

View dot graph.

draw :: UDF -> IO ()

Draw graph, transformed by vgraph_direct.

draw' :: UDF -> IO ()

Draw graph, transformed by vgraph_impl.

Gr Drawing

gr_dot :: UDF -> String

Make dot rendering of graph at Node, via vgraph_direct.

gr_dot' :: UDF -> String

Make dot rendering of graph at Node, via vgraph_impl.

gr_draw :: UDF -> IO ()

Draw graph, via gr_dot.

gr_draw' :: UDF -> IO ()

Draw graph, via gr_dot'.

Audition

audition :: [Message] -> UDF -> IO ()

Audition graph after sending initialisation messages.

audition_sc3 :: [Message] -> UDF -> IO ()

Audition graph after sending initialisation messages.

audition_text :: Int -> UDF -> IO ()

Audition at text-dl.