Struct llhd::analysis::PredecessorTable

pub struct PredecessorTable { /* fields omitted */ }

A table of basic block predecessors.

Methods

impl PredecessorTable

pub fn new(unit: &Unit) -> Self

Deprecated since 0.13.0:

use unit.predtbl() instead

Compute the predecessor table for a function or process.

pub fn new_temporal(unit: &Unit) -> Self

Deprecated since 0.13.0:

use unit.temporal_predtbl() instead

Compute the temporal predecessor table for a process.

This is a special form of predecessor table which ignores edges in the CFG that cross a temporal instruction. As such all connected blocks in the table are guaranteed to execute within the same instant of time.

pub fn all_pred_sets(&self) -> &HashMap<Block, HashSet<Block>>

Get a map of blocks to predecessor sets in this table.

pub fn all_succs_sets(&self) -> &HashMap<Block, HashSet<Block>>

Get a map of blocks to successor sets in this table.

pub fn pred_set(&self, bb: Block) -> &HashSet<Block>

Get the predecessors of a block.

pub fn succ_set(&self, bb: Block) -> &HashSet<Block>

Get the successors of a block.

pub fn pred(&self, bb: Block) -> impl Iterator<Item = Block> + Clone + '_

Get the predecessors of a block.

pub fn succ(&self, bb: Block) -> impl Iterator<Item = Block> + Clone + '_

Get the successors of a block.

pub fn is_sole_pred(&self, bb: Block, pred_of: Block) -> bool

Check if a block is the sole predecessor of another block.

pub fn is_sole_succ(&self, bb: Block, succ_of: Block) -> bool

Check if a block is the sole successor of another block.

Trait Implementations

impl Clone for PredecessorTable

fn clone(&self) -> PredecessorTable

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PredecessorTable

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

Formats the value using the given formatter.