Struct c2rust_transpile::cfg::loops::LoopInfo

pub struct LoopInfo<Lbl: Hash + Eq> { /* fields omitted */ }

Stores information about loops in a CFG.

Methods

impl<Lbl: Hash + Eq + Clone> LoopInfo<Lbl>

pub fn new() -> Self

pub fn absorb(&mut self, other: LoopInfo<Lbl>)

Merge the information from another LoopInfo into this LoopInfo

pub fn tightest_common_loop<E: Iterator<Item = Lbl>>(
    &self,
    entries: E
) -> Option<LoopId>

Find the smallest possible loop that contains all of the items

pub fn filter_unreachable(&mut self, reachable: &IndexSet<Lbl>)

Filter out any nodes which need to be pruned from the entire CFG due to being unreachable.

pub fn rewrite_blocks(&mut self, rewrites: &IndexMap<Lbl, Lbl>)

Rewrite nodes to take into account a node remapping. Note that the remapping is usually going to be very much not injective - the whole point of remapping is to merge some nodes.

pub fn add_loop(
    &mut self,
    id: LoopId,
    contents: IndexSet<Lbl>,
    outer_id: Option<LoopId>
)

Add in information about a new loop

pub fn enclosing_loops(&self, lbl: &Lbl) -> Vec<LoopId>

Get all of the LoopId's corresponding to loops of increasing size around the given label

pub fn get_loop_contents<'a>(&'a self, id: LoopId) -> &'a IndexSet<Lbl>

Get all of the nodes contained in a given loop

Trait Implementations

impl<Lbl: Clone + Hash + Eq> Clone for LoopInfo<Lbl>

fn clone(&self) -> LoopInfo<Lbl>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Lbl: Debug + Hash + Eq> Debug for LoopInfo<Lbl>

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

Formats the value using the given formatter.