pub struct WpeProfile {
pub nreg: usize,
pub maxblk: usize,
pub maxcell: usize,
pub maxwr: usize,
pub maxarg: usize,
pub maxliv: usize,
pub maxk: usize,
pub heap: usize,
pub depth: usize,
pub maxv: usize,
}Expand description
The engine’s cap profile — the ten numbers that size every memory in it.
Fields§
§nreg: usize§maxblk: usize§maxcell: usize§maxwr: usize§maxarg: usize§maxliv: usize§maxk: usize§heap: usize§depth: usize§maxv: usizeImplementations§
Source§impl WpeProfile
impl WpeProfile
Sourcepub fn shortfalls(&self, d: &WpeDemands) -> Vec<(&'static str, usize, usize)>
pub fn shortfalls(&self, d: &WpeDemands) -> Vec<(&'static str, usize, usize)>
Every dimension of d this profile does not cover, as (the engine parameter, the demand, the cap). Empty
exactly when a program with those demands loads and runs without a refusal or a trap.
Sourcepub fn from_caps(c: [usize; 10]) -> Self
pub fn from_caps(c: [usize; 10]) -> Self
The [usize; 10] order emit_wprog_engine_soc_verilog_backend expects.
pub fn caps(&self) -> [usize; 10]
Sourcepub fn eval_depth(&self, expr: &str) -> Option<u32>
pub fn eval_depth(&self, expr: &str) -> Option<u32>
Evaluate an RTL array bound ([0:<expr>]) to a WORD COUNT — so MAXBLK-1 yields MAXBLK.
Supports the forms the template actually uses: an identifier, a product of two, and a
trailing -1. Returns None for anything it does not understand, so a new declaration
shape fails the lock loudly rather than being silently skipped.
Sourcepub fn arrays(&self, config_bram: bool) -> Vec<WpeArray>
pub fn arrays(&self, config_bram: bool) -> Vec<WpeArray>
Every addressed array the engine declares, mirroring wpe_soc_template.v.
config_bram selects the streamed (MemBackend::ConfigBram) build, which is the one that
would be taped out: it EXCISES file0 (the block-entry register snapshot) in favour of the
read-before-write buffer. Charging a dead array against the die would inflate the estimate.
pub fn total_bits(&self, config_bram: bool) -> u64
Trait Implementations§
Source§impl Clone for WpeProfile
impl Clone for WpeProfile
Source§fn clone(&self) -> WpeProfile
fn clone(&self) -> WpeProfile
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for WpeProfile
impl Debug for WpeProfile
Source§impl PartialEq for WpeProfile
impl PartialEq for WpeProfile
impl Copy for WpeProfile
impl Eq for WpeProfile
impl StructuralPartialEq for WpeProfile
Auto Trait Implementations§
impl Freeze for WpeProfile
impl RefUnwindSafe for WpeProfile
impl Send for WpeProfile
impl Sync for WpeProfile
impl Unpin for WpeProfile
impl UnsafeUnpin for WpeProfile
impl UnwindSafe for WpeProfile
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.