Module counters

Modules

balanced_flow 🔒

A control-flow graph can be said to have “balanced flow” if the flow (execution count) of each node is equal to the sum of its in-edge flows, and also equal to the sum of its out-edge flows.

iter_nodes 🔒

node_flow 🔒

For each node in a control-flow graph, determines whether that node should have a physical counter, or a counter expression that is derived from the physical counters of other nodes.

union_find 🔒

Structs

CoverageCounters 🔒

Generates and stores coverage counter and coverage expression information associated with nodes in the coverage graph.

Functions

make_bcb_counters 🔒

Ensures that each BCB node needing a counter has one, by creating physical counters or counter expressions for nodes as required.

make_node_counter_priority_list 🔒

Arranges the nodes in balanced_graph into a list, such that earlier nodes take priority in being given a counter expression instead of a physical counter.

transcribe_counters 🔒