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

Based on the algorithm given in “Optimal measurement points for program frequency counts” (Knuth & Stevenson, 1973).

Structs

CounterTerm 🔒

Part of a node’s counter expression, which is a sum of counter terms.

MergedNodeFlowGraph 🔒

View of some underlying graph, in which each node’s successors have been merged into a single “supernode”.

NodeCounters 🔒

End result of allocating physical counters and counter expressions for the nodes of a graph.

SpantreeBuilder 🔒

SpantreeEdge 🔒

Type Aliases

CounterExprVec 🔒

Stores the list of counter terms that make up a node’s counter expression.