alicedhaha/moonrcinspect/src/reduction

src

alicedhaha/moonrcinspect/src/reduction does not have a README file

DesignReduction

pub(all) struct DesignReduction {
  nets : Array[NetReduction]
  exact_tree_count : Int
  approximate_count : Int
  unavailable_count : Int
  total_near_capacitance : Double
  total_far_capacitance : Double
} derive(@moonbitlang/core/debug.Debug
Debug)

NetReduction

source

pub(all) struct NetReduction {
  status : ReductionStatus
  net_name : String
  driver_node : String?
  pi : PiModel
  critical_path : @alicedhaha/moonrcinspect/src/path.PathResult
PathResult?
  sinks : Array[SinkEstimate]
  local_node_count : Int
  reachable_node_count : Int
  coupling_policy : String
} derive(@moonbitlang/core/debug.Debug
Debug)

NetReduction::worst_sink

source

fn NetReduction::worst_sink(self : NetReduction) -> SinkEstimate?

PiModel

source

pub(all) struct PiModel {
  near_capacitance : Double
  far_capacitance : Double
  series_resistance : Double
  total_capacitance : Double
  first_moment : Double
} derive(@moonbitlang/core/debug.Debug
Debug)

ReductionStatus

source

pub(all) enum ReductionStatus {
  ExactTree
  ApproximateGraph
  EmptyNetwork
  NoDriver
  MultipleDrivers
  Disconnected
  InvalidElectricalValue
} derive(Eq, @moonbitlang/core/debug.Debug
Debug)

ReductionStatus::label

source

fn ReductionStatus::label(self : ReductionStatus) -> String

SinkEstimate

source

pub(all) struct SinkEstimate {
  node_id : Int
  node_name : String
  direction : @alicedhaha/moonrcinspect/src/model.Direction
Direction
  pin_load_capacitance : Double
  local_parasitic_capacitance : Double
  path_resistance : Double
  elmore_delay : Double?
  reachable : Bool
} derive(@moonbitlang/core/debug.Debug
Debug)

reduce_design

source

fn reduce_design(network : @alicedhaha/moonrcinspect/src/model.RCNetwork
RCNetwork) -> DesignReduction

reduce_net

source

fn reduce_net(net : @alicedhaha/moonrcinspect/src/model.Net
Net) -> NetReduction

Produces a first-moment-preserving two-capacitance RC approximation.

For a tree, shortest resistance paths are unique and the model is marked exact-tree. Cyclic graphs are accepted as a screening approximation using minimum-resistance paths. Disconnected and invalid networks are explicit.