Struct Frontiers 

pub struct Frontiers { /* private fields */ }

Where each block stops dominating, by block number.

The lists are sorted by block number and hold no duplicates, so two of these compare equal when they say the same thing, which is what the analysis cache needs of them.

Implementations

impl Frontiers

pub fn new(cfg: &Cfg, doms: &Dominators) -> Self

Builds the frontier of every block.

The cost is the size of the answer plus the size of the graph, because the walk from a predecessor stops at the immediate dominator of the block it started for, and every step it takes writes one entry.

pub fn of(&self, block: Block) -> &[Block]

The blocks control can first arrive at without having gone through this one.

Empty for a block the entry does not reach, and for one whose influence covers everything below it, which is every block on a path with no branches.

Trait Implementations

impl Clone for Frontiers

fn clone(&self) -> Frontiers

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Frontiers

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

Formats the value using the given formatter.

impl Default for Frontiers

fn default() -> Frontiers

Returns the “default value” for a type.

impl Eq for Frontiers

impl PartialEq for Frontiers

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Frontiers