Struct PostDominators 

pub struct PostDominators { /* private fields */ }

Which block every path to the exit has to pass through after leaving another.

Implementations

impl PostDominators

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

Builds the tree over the reversed graph.

Panics

Panics if a block control reaches still has no path to the exit after the fake edges have been added, which would mean the answers below were arbitrary. Section 6.8 of the design asks for exactly this, on the grounds that a wrong answer here is worth turning into a crash.

pub fn post_dominates(&self, of: Block, block: Block) -> bool

Whether every path from block to the exit goes through of.

A block post-dominates itself. Both ends have to be blocks control reaches.

pub fn strictly_post_dominates(&self, of: Block, block: Block) -> bool

The same, without a block post-dominating itself.

pub fn immediate_post_dominator(&self, block: Block) -> Option<Block>

The nearest block that post-dominates this one and is not it.

None when the next thing on every path out is the end of the function, and for a block control does not reach.

pub fn fake_exits(&self) -> &[Block]

The blocks an edge to the exit was invented for, because nothing led there from them.

A block is in here when it is the far end of an infinite loop. The list is public because a pass that reasons about paths should be able to tell that one of them was added by this analysis and is not a path the program can take.

Trait Implementations

impl Clone for PostDominators

fn clone(&self) -> PostDominators

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PostDominators

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

Formats the value using the given formatter.

impl Eq for PostDominators

impl PartialEq for PostDominators

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PostDominators