Struct calyx_opt::analysis::ControlOrder

pub struct ControlOrder<const BETTER_ERR: bool>;

Extract the dependency order of a list of control programs. Dependencies are defined using read/write sets used in the control program. The read/write sets ignore ports on constants and ThisComponent.

For example, if we have control programs C1 and C2 with read sets R1 and R2 and write sets W1 and W2 respectively, we can define an order relationship:

C1 < C2 if (R1 subset of W2) and (R2 disjoint W1) C1 > C2 if (R2 subset of W1) and (R1 disjoint W2) C1 =!= if (R1 subset of W2) and (R2 subset of W1)

Setting BETTER_ERR turns on additional machinery to generate an explanation for what caused the error but may require expensive computations. Turn on when cycles should be a hard error.

Implementations

impl<const BETTER_ERR: bool> ControlOrder<BETTER_ERR>

pub fn get_total_order(
    stmts: impl Iterator<Item = Control>
) -> CalyxResult<Vec<Control>>

Return a total order for the control programs. Returns an error if there is a cycle

pub fn get_dependency_graph_seq(
    stmts: impl Iterator<Item = Control>,
    (cont_reads, cont_writes): (&Vec<RRC<Cell>>, &Vec<RRC<Cell>>),
    dependency: &mut HashMap<NodeIndex, Vec<NodeIndex>>,
    latency_map: &mut HashMap<NodeIndex, u64>
) -> DiGraph<Option<Control>, ()>