Examples of MHGDominatorsFinder

soot.toolkits.graph.MHGDominatorsFinder

Calculate dominators for basic blocks.

Uses the algorithm contained in Dragon book, pg. 670-1.

 D(n0) := { n0 } for n in N - { n0 } do D(n) := N; while changes to any D(n) occur do for n in N - {n0} do D(n) := {n} U (intersect of D(p) over all predecessors p of n)

2007/07/03 - updated to use {@link BitSet}s instead of {@link HashSet}s, as the most expensive operation in this algorithm used to be cloning of the fullSet, which is very cheap for {@link BitSet}s. @author Navindra Umanee @author Eric Bodden

    else
      throw new RuntimeException("Unsupported CFG passed into the RegionAnalyis constructor!");
    
  
    
    this.m_dom = new MHGDominatorTree(new MHGDominatorsFinder(this.m_blockCFG));
          
    
    String s = dominatorTreeToString(this.m_dom, this.m_dom.getHead());


    if(Options.v().verbose())

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of MHGDominatorsFinder

Examples of soot.toolkits.graph.MHGDominatorsFinder