Struct Timing 

pub struct Timing {
    pub setup_spins: u32,
    pub byte_spins: u32,
    pub ack_spins: u32,
}

Spin budgets for one transaction. Each spin is one bounded STAT read, so the budgets bound the time a missing or wedged device can cost.

Fields

setup_spins: u32

Delay after selecting the socket, before the first byte. The original SCPH-1200 gives no answer without it; fast clones do not care.

byte_spins: u32

Bound on the byte shift itself (TX ready, then RX filled).

ack_spins: u32

Bound on each wait for the device’s /ACK to assert, and again to release.

Implementations

impl Timing

pub const PAD: Timing

The pad’s timing, measured on silicon: 1,024 setup spins (the SCPH-1200 floor sits between 384 and 768), and a 2,048-spin /ACK wait, which exceeds the BIOS’s own 100 microsecond DSR timeout.

pub const CARD: Timing

The memory card’s timing: the pad’s setup and byte budgets, and a long /ACK budget because a card can hold /ACK back while a frame’s flash write commits.

Trait Implementations

impl Clone for Timing

fn clone(&self) -> Timing

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Timing

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

Formats the value using the given formatter.

impl PartialEq for Timing

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

impl Eq for Timing

impl StructuralPartialEq for Timing