Struct rustc_mir_transform::coverage::graph::CoverageGraph

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

A coverage-specific simplification of the MIR control flow graph (CFG). The CoverageGraphs nodes are BasicCoverageBlocks, which encompass one or more MIR BasicBlocks, plus a CoverageKind counter (to be added by CoverageCounters::make_bcb_counters), and an optional set of additional counters–if needed–to count incoming edges, if there are more than one. (These “edge counters” are eventually converted into new 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>>

Implementations

impl CoverageGraph

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

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

fn add_basic_coverage_block(
    bcbs: &mut IndexVec<BasicCoverageBlock, BasicCoverageBlockData>,
    bb_to_bcb: &mut IndexVec<BasicBlock, Option<BasicCoverageBlock>>,
    basic_blocks: Vec<BasicBlock>
)

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

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

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

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

pub fn dominators(&self) -> &Dominators<BasicCoverageBlock>

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

impl<'graph> GraphPredecessors<'graph> for CoverageGraph

type Item = BasicCoverageBlock

type Iter = Copied<Iter<'graph, BasicCoverageBlock>>

impl<'graph> GraphSuccessors<'graph> for CoverageGraph

type Item = BasicCoverageBlock

type Iter = Cloned<Iter<'graph, BasicCoverageBlock>>

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 WithNumNodes for CoverageGraph

fn num_nodes(&self) -> usize

impl WithPredecessors for CoverageGraph

fn predecessors(&self, node: Self::Node) -> Copied<Iter<'_, BasicCoverageBlock>>

impl WithStartNode for CoverageGraph

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

impl WithSuccessors for CoverageGraph

fn successors(&self, node: Self::Node) -> Cloned<Iter<'_, BasicCoverageBlock>>

fn depth_first_search(&self, from: Self::Node) -> DepthFirstSearch<'_, Self> where
    Self: WithNumNodes, 

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