/** Add pointer flow constraints based on instructions in a given node */
 protected void addNodeInstructionConstraints(CGNode node, IR ir, DefUse du) {
   StatementVisitor v = makeVisitor((ExplicitCallGraph.ExplicitNode) node, ir, du);
   ControlFlowGraph<SSAInstruction, ISSABasicBlock> cfg = ir.getControlFlowGraph();
   for (ISSABasicBlock b : cfg) {
     addBlockInstructionConstraints(node, cfg, b, v);
   }
 }
예제 #2
0
  private Set<CGNode> findLoopingMethods(IProgressMonitor progress) throws CancelException {
    CallGraph cg = sdg.getCallGraph();
    Set<CGNode> loops = HashSetFactory.make();

    progress.subTask("Searching methods with potential endless loops");

    for (CGNode node : cg) {
      IR ir = node.getIR();
      if (ir != null) {
        ControlFlowGraph<SSAInstruction, ISSABasicBlock> cfg = ir.getControlFlowGraph();
        final boolean ac = Acyclic.isAcyclic(cfg, cfg.entry());
        if (!ac && !loopsAreSimple(ir)) {
          loops.add(node);
        }
      } else {
        // Conservatively assume that methods may not terminate, iff we dont
        // have their code
        loops.add(node);
      }

      progress.worked(1);
    }

    progress.done();

    return loops;
  }