Struct PsramCache 

pub struct PsramCache {
    pub index_bits: u32,
    pub offset_bits: u32,
}

The heap cache in front of the edge: direct-mapped, write-back and write-allocate, 2^index_bits lines of 2^offset_bits words, each line filled and written back as one burst.

Fields

index_bits: u32

offset_bits: u32

Implementations

impl PsramCache

pub fn new( edge: &PsramEdge, index_bits: u32, offset_bits: u32, ) -> Result<Self, PsramUnplaceable>

pub fn lines(&self) -> u32

pub fn line_words(&self) -> u32

pub fn words(&self) -> u32

pub fn miss_stall_cycles(&self, edge: &PsramEdge) -> u64

Cycles busy holds for a miss whose victim is dirty: the request’s own cycle, then for the write-back and for the fill the cycle the edge accepts it, its burst, and the cycle that sees req_ready again.

pub fn worst_stall_cycles(&self, edge: &PsramEdge) -> u64

The longest stall: a write and a read issued together, each missing with a dirty victim.

Trait Implementations

impl Clone for PsramCache

fn clone(&self) -> PsramCache

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PsramCache

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

Formats the value using the given formatter.

impl PartialEq for PsramCache

fn eq(&self, other: &PsramCache) -> 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 Copy for PsramCache

impl Eq for PsramCache

impl StructuralPartialEq for PsramCache