pub struct CreditLatency {
pub fetch_tile: u32,
pub credit_return: u32,
pub service_page: u32,
}Expand description
The latencies a bounded buffer’s credit loop is sized against, in cycles.
These are ARCHITECTURAL facts about a part, not fitted ones, and the distinction is the whole point of the
type. A FIFO depth is a resource decision — too shallow stalls the producer every round, too deep spends
local memory another buffer needed — and deriving it from a regression against a cycle counter makes it
only as trustworthy as that counter. Ours turned out not to track work at all, which would have made every
depth a function of noise. A target that cannot cite these numbers declares None and gets the vendor’s
double-buffering discipline instead of an invented rate.
Fields§
§fetch_tile: u32Cycles to fetch one tile into local memory.
credit_return: u32Cycles for a consumer’s credit to travel back to the producer.
service_page: u32Cycles the consumer spends draining one page.
Trait Implementations§
Source§impl Clone for CreditLatency
impl Clone for CreditLatency
Source§fn clone(&self) -> CreditLatency
fn clone(&self) -> CreditLatency
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for CreditLatency
impl Debug for CreditLatency
Source§impl<'de> Deserialize<'de> for CreditLatency
impl<'de> Deserialize<'de> for CreditLatency
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl PartialEq for CreditLatency
impl PartialEq for CreditLatency
Source§impl Serialize for CreditLatency
impl Serialize for CreditLatency
impl Copy for CreditLatency
impl Eq for CreditLatency
impl StructuralPartialEq for CreditLatency
Auto Trait Implementations§
impl Freeze for CreditLatency
impl RefUnwindSafe for CreditLatency
impl Send for CreditLatency
impl Sync for CreditLatency
impl Unpin for CreditLatency
impl UnsafeUnpin for CreditLatency
impl UnwindSafe for CreditLatency
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.