Enum Implementation 

pub enum Implementation {
    Flops {
        cells: u64,
    },
    Macros {
        macro_name: &'static str,
        depth_banks: u32,
        width_banks: u32,
        instances: u32,
    },
}

How a MemoryRequest is best built. NOT always a macro — and getting this wrong is expensive in both directions.

An SRAM macro has a MINIMUM depth (256 words on sky130’s smallest), so a shallow array pays for a whole macro to store a fraction of one. The WPE’s blk_* arrays are 13 x 160 words: as macros that is 13 instances and 2.18 mm^2 to hold 66 kbit, which is worse than flops AND drags in port constraints the flops would not have. Conversely the heap at 2.1 Mbit would be ~36 mm^2 of flops and has to be a macro. The planner must pick, not assume.

Variants

Flops

Flip-flops and their access logic — no macro, no port limit, no corner problem.

Fields

cells: u64

Macros

One or more SRAM macro instances.

Fields

macro_name: &'static str

depth_banks: u32

width_banks: u32

instances: u32

Trait Implementations

impl Clone for Implementation

fn clone(&self) -> Implementation

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Implementation

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Implementation

fn eq(&self, other: &Implementation) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Implementation