Struct MemoryCurve 

pub struct MemoryCurve { /* private fields */ }

Memory throughput measured across a range of working sets.

Built by sweeping one probe over working_set_sweep; ask it for the ceiling of a given working set with ceiling_at.

Implementations

impl MemoryCurve

pub fn new( access: MemoryAccess, points: impl IntoIterator<Item = MemoryPoint>, ) -> Self

Assembles a curve from points measured with access.

A point with an empty working set, or a rate that isn’t finite and positive (an unsupported or failed probe), describes nothing and is dropped; duplicated working sets keep the first point.

pub fn points(&self) -> &[MemoryPoint]

The measured points, ascending by working set.

pub fn ceiling_at(&self, bytes: u64) -> Option<f64>

The ceiling for a kernel moving bytes, in bytes moved per second, interpolated between the two measured points that bracket it and clamped to the ends of the sweep. None if nothing was measured.

Interpolation is linear in log2(bytes), matching the geometric spacing the curve is sampled at; it is exact at the measured points.

Below the smallest measured working set the answer is that point’s rate, the least the sweep saw. Above the largest it is the bus figure — that part of the curve is flat, which is why the sweep stops there.

Trait Implementations

impl Clone for MemoryCurve

fn clone(&self) -> MemoryCurve

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemoryCurve

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

Formats the value using the given formatter.

impl PartialEq for MemoryCurve

fn eq(&self, other: &MemoryCurve) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for MemoryCurve