| java.lang.Object EDU.purdue.cs.bloat.cfg.DominatorTree
DominatorTree | public class DominatorTree (Code) | | DominatorTree finds the dominator tree of a FlowGraph.
The algorithm used is Purdum-Moore. It isn't as fast as Lengauer-Tarjan, but
it's a lot simpler.
See Also: FlowGraph See Also: Block |
Field Summary | |
public static boolean | DEBUG |
Method Summary | |
public static void | buildTree(FlowGraph graph, boolean reverse) Calculates what vertices dominate other verices and notify the basic
Blocks as to who their dominator is. |
DEBUG | public static boolean DEBUG(Code) | | |
buildTree | public static void buildTree(FlowGraph graph, boolean reverse)(Code) | | Calculates what vertices dominate other verices and notify the basic
Blocks as to who their dominator is.
Parameters: graph - The cfg that is used to find the dominator tree. Parameters: reverse - Do we go in revsers? That is, are we computing the dominatance(false) or postdominance (true) tree. See Also: Block |
|
|