|
SandMark version 3.0 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--sandmark.obfuscate.boolsplitter.dcfg.DominatorTree
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.
FlowGraph
,
Block
Field Summary | |
static boolean |
DEBUG
|
Constructor Summary | |
DominatorTree()
|
Method Summary | |
static void |
buildTree(FlowGraph graph,
boolean reverse)
Calculates what vertices dominate other verices and notify the basic Blocks as to who their dominator is. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
public static boolean DEBUG
Constructor Detail |
public DominatorTree()
Method Detail |
public static void buildTree(FlowGraph graph, boolean reverse)
graph
- The cfg that is used to find the dominator tree.reverse
- Do we go in revsers? That is, are we computing the
dominatance (false) or postdominance (true) tree.Block
|
SandMark version 3.0 Wed Jan 29 10:30:05 MST 2003 |
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |