Module libreda_sta::signal_propagation

Graph levelization based on an operator formulation. Compute the level of all graph nodes in a directed acyclic graph. The level of a node is the minimum distance to a node without incoming edges with each edge having a distance of 1.

Structs

• PropagationOp 🔒
  Propagate actual signals, constraints and required signals on the full (!) netlist. Requires that all (!) primary inputs of the delay graph are present in the initial worklist. Otherwise the algorithm will miss parts of the graph.
• WorkItem 🔒
  Work item associated with a propagation direction.

Functions

• propagate_signals_incremental 🔒
  Incrementally propagate actual and required signals in the full timing graph.