Struct DMEAlgorithm 

pub struct DMEAlgorithm { /* private fields */ }

The DME (Deferred Merge Embedding) algorithm for clock tree synthesis.

Builds a prescribed-skew clock tree using a bottom-up merging phase and a top-down embedding phase. Uses an arena-allocated node representation (Tree) for cache efficiency. The constructed tree can be queried via get_tree().

Supports both linear and Elmore delay models via the DelayCalculator trait.

Implementations

impl DMEAlgorithm

pub fn new(sinks: Vec<Sink>, calculator: Box<dyn DelayCalculator>) -> Self

Creates a new DME algorithm instance with the given sinks and delay model.

Panics

Panics if sinks is empty.

pub fn with_source( sinks: Vec<Sink>, calculator: Box<dyn DelayCalculator>, source: Point<i32, i32>, ) -> Self

Creates a new DME algorithm with a specified clock source position.

Panics

Panics if sinks is empty.

pub fn get_tree(&self) -> &Tree

Returns a reference to the constructed tree.

pub fn get_tree_mut(&mut self) -> &mut Tree

Returns a mutable reference to the constructed tree.

pub fn build_clock_tree(&mut self) -> NodeIdx

Builds the clock tree and returns the root index.

pub fn analyze_skew(&self, root: NodeIdx) -> SkewAnalysis

Analyze clock skew from the constructed tree.