Module libreda_sta::timing_graph

Construct timing graphs (delay graph, constraint graph) from a netlist.

Structs

• DependencyCounter 🔒
  Atomic counter unresolved dependencies of graph nodes.
• EdgeData 🔒
• NodeData 🔒
  Data of a node in the timing graph. Holds timing information such as actual and required arrival times but also data used for concurrent graph operations.
• SyncEdgeData 🔒
  Edge data which we can access during parallel graph operations. Access to this data is synchronized by a lock in the DataCell struct.
• SyncNodeData 🔒
  Node data which we can access during parallel graph operations. Access to this data is synchronized by a lock in the DataCell struct.
• TimingGraph 🔒

Enums

• GraphEdgeType 🔒
• GraphNodeType 🔒
  Node in the timing graph. Most nodes represent a pin in the netlist. There are also a few virtual nodes (source nodes) which simplify the implementation of the delay propagation algorithms.

Functions

• get_primary_inputs 🔒
  Get input pins of a cell.