# Struct rustc_mir_transform::coverage::graph::CoverageGraph

source ·

    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 `CoverageGraph`s nodes are `BasicCoverageBlock`s, which encompass one or more MIR `BasicBlock`s.

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

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

§

#### type Node = BasicCoverageBlock

source§

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

§

#### type Item = BasicCoverageBlock

§

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

source§

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

§

#### type Item = BasicCoverageBlock

§

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

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§

#### fn num_nodes(&self) -> usize

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

source§

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

## Auto Trait Implementations§

§

### impl DynSend for CoverageGraph

§

### impl DynSync for CoverageGraph

§

### impl Freeze for CoverageGraph

§

### impl RefUnwindSafe for CoverageGraph

§

### impl Send for CoverageGraph

§

### impl Sync for CoverageGraph

§

### impl Unpin for CoverageGraph

§

### impl UnwindSafe for CoverageGraph

## Blanket Implementations§

source§

### impl<T> Aligned for T

source§

#### const ALIGN: Alignment = _

Alignment of `Self`.
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, R> CollectAndApply<T, R> for T

source§

#### fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to `f(&iter.collect::<Vec<_>>())`.

§

#### type Output = R

§

### impl<T> Filterable for T

§

#### fn filterable( self, filter_name: &'static str ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>

Creates a filterable data provider with the given name for debugging. Read more
source§

### impl<T> From<T> for T

source§

#### fn from(t: T) -> T

Returns the argument unchanged.

source§

### impl<T> Instrument for T

source§

#### fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided `Span`, returning an `Instrumented` wrapper. Read more
source§

#### fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current `Span`, returning an `Instrumented` wrapper. Read more
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<P> IntoQueryParam<P> for P

source§

#### fn into_query_param(self) -> P

source§

### impl<T> MaybeResult<T> for T

§

#### type Error = !

source§

#### fn from(_: Result<T, <T as MaybeResult<T>>::Error>) -> T

source§

#### fn to_result(self) -> Result<T, <T as MaybeResult<T>>::Error>

§

### impl<T> Pointable for T

§

#### const ALIGN: usize = _

The alignment of pointer.
§

#### type Init = T

The type for initializers.
§

#### unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

#### unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

#### unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

#### unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

### impl<T> Same for T

§

#### type Output = T

Should always be `Self`
source§

### impl<'tcx, T> ToPredicate<'tcx, T> for T

source§

#### fn to_predicate(self, _tcx: TyCtxt<'tcx>) -> T

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

### impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

#### fn vzip(self) -> V

source§

### impl<Tcx, T> Value<Tcx> for T
where Tcx: DepContext,

source§

#### default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed ) -> T

source§

### impl<T> WithSubscriber for T

source§

#### fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
source§

#### fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default `Subscriber` to this type, returning a `WithDispatch` wrapper. Read more
source§

### impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

### impl<'a, T> Captures<'a> for T
where T: ?Sized,

source§

### impl<T> ControlFlowGraph for T
where T: DirectedGraph + WithStartNode + WithPredecessors + WithSuccessors + WithNumNodes,

§

### impl<T> ErasedDestructor for T
where T: 'static,

§

### impl<T> MaybeSendSync for T
where T: Send + Sync,

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