Struct CoverageGraph

pub(crate) struct CoverageGraph {
    bcbs: IndexVec<BasicCoverageBlock, BasicCoverageBlockData>,
    bb_to_bcb: IndexVec<BasicBlock, Option<BasicCoverageBlock>>,
    pub(crate) successors: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>,
    pub(crate) predecessors: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>,
    dominators: Option<Dominators<BasicCoverageBlock>>,
    dominator_order_rank: IndexVec<BasicCoverageBlock, u32>,
}

A coverage-specific simplification of the MIR control flow graph (CFG). The CoverageGraphs nodes are BasicCoverageBlocks, which encompass one or more MIR BasicBlocks.

Fields

bcbs: IndexVec<BasicCoverageBlock, BasicCoverageBlockData>

bb_to_bcb: IndexVec<BasicBlock, Option<BasicCoverageBlock>>

successors: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>

predecessors: IndexVec<BasicCoverageBlock, Vec<BasicCoverageBlock>>

dominators: Option<Dominators<BasicCoverageBlock>>

dominator_order_rank: IndexVec<BasicCoverageBlock, u32>

Allows nodes to be compared in some total order such that if a dominates b, then a < b. If neither node dominates the other, their relative order is consistent but arbitrary.

Implementations

impl CoverageGraph

pub(crate) fn from_mir(mir_body: &Body<'_>) -> Self

fn compute_basic_coverage_blocks( mir_body: &Body<'_>, ) -> (IndexVec<BasicCoverageBlock, BasicCoverageBlockData>, IndexVec<BasicBlock, Option<BasicCoverageBlock>>)

pub(crate) fn iter_enumerated( &self, ) -> impl Iterator<Item = (BasicCoverageBlock, &BasicCoverageBlockData)>

pub(crate) fn bcb_from_bb(&self, bb: BasicBlock) -> Option<BasicCoverageBlock>

pub(crate) fn dominates( &self, dom: BasicCoverageBlock, node: BasicCoverageBlock, ) -> bool

pub(crate) fn cmp_in_dominator_order( &self, a: BasicCoverageBlock, b: BasicCoverageBlock, ) -> Ordering

pub(crate) fn sole_predecessor( &self, to_bcb: BasicCoverageBlock, ) -> Option<BasicCoverageBlock>

Returns the source of this node’s sole in-edge, if it has exactly one. That edge can be assumed to have the same execution count as the node itself (in the absence of panics).

pub(crate) fn simple_successor( &self, from_bcb: BasicCoverageBlock, ) -> Option<BasicCoverageBlock>

Returns the target of this node’s sole out-edge, if it has exactly one, but only if that edge can be assumed to have the same execution count as the node itself (in the absence of panics).

Trait Implementations

impl Debug for CoverageGraph

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

Formats the value using the given formatter.

impl DirectedGraph for CoverageGraph

type Node = BasicCoverageBlock

fn num_nodes(&self) -> usize

impl Index<BasicCoverageBlock> for CoverageGraph

type Output = BasicCoverageBlockData

The returned type after indexing.

fn index(&self, index: BasicCoverageBlock) -> &BasicCoverageBlockData

Performs the indexing (container[index]) operation.

impl IndexMut<BasicCoverageBlock> for CoverageGraph

fn index_mut( &mut self, index: BasicCoverageBlock, ) -> &mut BasicCoverageBlockData

Performs the mutable indexing (container[index]) operation.

impl Predecessors for CoverageGraph

fn predecessors(&self, node: Self::Node) -> impl Iterator<Item = Self::Node>

impl StartNode for CoverageGraph

fn start_node(&self) -> Self::Node

impl Successors for CoverageGraph

fn successors(&self, node: Self::Node) -> impl Iterator<Item = Self::Node>

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: 168 bytes