Struct Counts 

pub struct Counts { /* private fields */ }

What the queries did, which is the only way to find out that this is not working.

A range that came back knowing nothing produces correct code that is slower, with no test failing and no warning printed. Section 10.7 says the defence is a counter and section 10.8 says -ftime-report prints it.

Implementations

impl Counts

pub const fn queries(&self) -> u64

How many times a range was asked for.

pub const fn hits(&self) -> u64

How many of those the cache answered.

pub const fn fallbacks(&self) -> u64

How many were answered with the range at the definition because the cache was full.

pub const fn full(&self) -> u64

How many came back knowing nothing at all.

pub const fn assumed(&self) -> u64

How many ranges were narrower because an instruction promised not to overflow.

These are the ranges section 10.7 calls correct and surprising: they are true only because the program would be undefined otherwise.

pub fn losses(&self) -> Vec<(Opcode, u64)>

Which opcodes lost the information, most often first.

Trait Implementations

impl Clone for Counts

fn clone(&self) -> Counts

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Counts

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

Formats the value using the given formatter.

impl Default for Counts

fn default() -> Counts

Returns the “default value” for a type.

impl Eq for Counts

impl PartialEq for Counts

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Counts