public class DominanceFrontier
extends java.lang.Object
The dominance frontier of a node x is the set of all nodes w such that x dominates a predacessor of w, but does not strictly dominate w. Basically, nodes in the dominance frontier have one parent that is dominated by x and at least one parent that is not dominated by x.
DominanceFrontier can be used to calculate both the dominance (forward) and the postdominance (reverse) frontiers for a control flow graph.
FlowGraph| Constructor and Description |
|---|
DominanceFrontier() |
| Modifier and Type | Method and Description |
|---|---|
static void |
buildFrontier(FlowGraph graph,
boolean reverse)
Calculates the dominance frontier for a cfg and notifies the blocks in it
appropriately.
|
public static void buildFrontier(FlowGraph graph, boolean reverse)
graph - The cfg to operate onreverse - Do we calculate the postdominance frontier?