Struct Traffic 

pub struct Traffic {
    pub pattern: Pattern,
    pub words: u32,
}

The stream: words words written in order, then read back in the same order, each read presented as soon as the controller took the one before, or for the probe PROBE_EVERY clocks after it was presented.

Fields

pattern: Pattern

words: u32

Implementations

impl Traffic

pub fn order(&self) -> Vec<u32>

The words in request order.

pub fn every(&self) -> u64

The DRAM clocks between read presentations: PROBE_EVERY for the probe, 0 (as soon as taken) otherwise.

pub fn rows(&self) -> BTreeSet<(u8, u16)>

Every (bank, row) the stream touches.

pub fn row_bits(&self) -> u32

The row-address bits a device must store for this stream: enough for its highest row.

pub fn rom(&self) -> String

The testbench’s ROM: per word in order, its index (6 hex digits) and value (16).

Trait Implementations

impl Clone for Traffic

fn clone(&self) -> Traffic

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Traffic

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

Formats the value using the given formatter.

impl PartialEq for Traffic

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

impl Eq for Traffic

impl StructuralPartialEq for Traffic