Class NumberedDominators<T>
java.lang.Object
com.ibm.wala.util.graph.dominators.Dominators<T>
com.ibm.wala.util.graph.dominators.NumberedDominators<T>
Calculate dominators using Lengauer and Tarjan's fastest algorithm. TOPLAS 1(1), July 1979. This
implementation uses path compression and results in a O(e * alpha(e,n)) complexity, where e is
the number of edges in the CFG and n is the number of nodes.
Sources: TOPLAS article, Muchnick book
-
Nested Class Summary
Nested classes/interfaces inherited from class Dominators
Dominators.DominatorInfoModifier and TypeClassDescriptionprotected final classLOOK-ASIDE TABLE FOR PER-NODE STATE AND ITS ACCESSORS -
Field Summary
Fields inherited from class Dominators
G, reachableNodeCount, root -
Constructor Summary
Constructors -
Method Summary
Methods inherited from class Dominators
analyze, dominators, dominatorTree, getIdom, isDominatedBy, make, toStringModifier and TypeMethodDescriptionprotected voidanalyze()analyze dominatorsdominators(T node) return an Iterator over all nodes that dominate nodereturn the dominator tree, which has an edge from n to n' if n dominates n'return the immediate dominator of nodebooleanisDominatedBy(T node, T master) is node dominated by master?static <T> Dominators<T> toString()
-
Constructor Details
-
NumberedDominators
- Throws:
IllegalArgumentException
-
-
Method Details
-
getInfo
- Specified by:
getInfoin classDominators<T>
-