Struct CountersBuilder

struct CountersBuilder<'a> {
    counters: CoverageCounters,
    graph: &'a CoverageGraph,
    bcb_needs_counter: &'a BitSet<BasicCoverageBlock>,
}

Helper struct that allows counter creation to inspect the BCB graph, and the set of nodes that need counters.

Fields

counters: CoverageCounters

graph: &'a CoverageGraph

bcb_needs_counter: &'a BitSet<BasicCoverageBlock>

Implementations

impl<'a> CountersBuilder<'a>

fn new( graph: &'a CoverageGraph, bcb_needs_counter: &'a BitSet<BasicCoverageBlock>, ) -> Self

fn make_bcb_counters(&mut self)

fn make_node_counter_and_out_edge_counters( &mut self, traversal: &TraverseCoverageGraphWithLoops<'_>, from_bcb: BasicCoverageBlock, )

Make sure the given node has a node counter, and then make sure each of its out-edges has an edge counter (if appropriate).

fn get_or_make_node_counter(&mut self, bcb: BasicCoverageBlock) -> BcbCounter

fn make_node_counter_inner(&mut self, bcb: BasicCoverageBlock) -> BcbCounter

fn get_or_make_edge_counter( &mut self, from_bcb: BasicCoverageBlock, to_bcb: BasicCoverageBlock, ) -> BcbCounter

fn make_edge_counter_inner( &mut self, from_bcb: BasicCoverageBlock, to_bcb: BasicCoverageBlock, ) -> BcbCounter

fn choose_out_edge_for_expression( &self, traversal: &TraverseCoverageGraphWithLoops<'_>, candidate_successors: &[BasicCoverageBlock], ) -> Option<BasicCoverageBlock>

Given a set of candidate out-edges (represented by their successor node), choose one to be given a counter expression instead of a physical counter.

fn find_good_reloop_edge( &self, traversal: &TraverseCoverageGraphWithLoops<'_>, candidate_successors: &[BasicCoverageBlock], ) -> Option<BasicCoverageBlock>

Given a set of candidate out-edges (represented by their successor node), tries to find one that leads back to the top of a loop.

Reloop edges are good candidates for counter expressions, because they will tend to be executed more times than a loop-exit edge, so it’s nice for them to be able to avoid a physical counter increment.

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