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>>,
}
Expand description

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>>

Implementations§

source§

impl CoverageGraph

source

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

source

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

source

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

source

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

source

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

source

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

source

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

source

pub(super) fn bcb_has_multiple_in_edges(&self, bcb: BasicCoverageBlock) -> bool

Returns true if the given node has 2 or more in-edges, i.e. 2 or more predecessors.

This property is interesting to code that assigns counters to nodes and edges, because if a node doesn’t have multiple in-edges, then there’s no benefit in having a separate counter for its in-edge, because it would have the same value as the node’s own counter.

FIXME: That assumption might not be true for TerminatorKind::Yield?

Trait Implementations§

source§

impl Debug for CoverageGraph

source§

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

Formats the value using the given formatter. Read more
source§

impl DirectedGraph for CoverageGraph

source§

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

source§

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

source§

impl Index<BasicCoverageBlock> for CoverageGraph

§

type Output = BasicCoverageBlockData

The returned type after indexing.
source§

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

Performs the indexing (container[index]) operation. Read more
source§

impl IndexMut<BasicCoverageBlock> for CoverageGraph

source§

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

Performs the mutable indexing (container[index]) operation. Read more
source§

impl WithNumNodes for CoverageGraph

source§

impl WithPredecessors for CoverageGraph

source§

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

source§

impl WithStartNode for CoverageGraph

source§

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

source§

impl WithSuccessors for CoverageGraph

source§

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

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

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