Struct TraverseCoverageGraphWithLoops

pub(crate) struct TraverseCoverageGraphWithLoops<'a> {
    basic_coverage_blocks: &'a CoverageGraph,
    backedges: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>,
    context_stack: Vec<TraversalContext>,
    visited: BitSet<BasicCoverageBlock>,
}

Fields

basic_coverage_blocks: &'a CoverageGraph

backedges: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>

context_stack: Vec<TraversalContext>

visited: BitSet<BasicCoverageBlock>

Implementations

impl<'a> TraverseCoverageGraphWithLoops<'a>

pub(crate) fn new(basic_coverage_blocks: &'a CoverageGraph) -> Self

pub(crate) fn reloop_bcbs_per_loop( &self, ) -> impl Iterator<Item = &[BasicCoverageBlock]>

For each loop on the loop context stack (top-down), yields a list of BCBs within that loop that have an outgoing edge back to the loop header.

pub(crate) fn next(&mut self) -> Option<BasicCoverageBlock>

fn add_successors_to_worklists(&mut self, bcb: BasicCoverageBlock)

pub(crate) fn is_complete(&self) -> bool

pub(crate) fn unvisited(&self) -> Vec<BasicCoverageBlock>

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 88 bytes