private Set<CallNode> compute(IProgressMonitor progress) throws CancelException { Set<CallNode> calls = HashSetFactory.make(); Set<CGNode> recursive = findRecursiveMethods(progress); Set<CGNode> loop = findLoopingMethods(progress); CallGraph cg = sdg.getCallGraph(); Graph<CGNode> inverted = GraphInverter.invert(cg); GraphReachability<CGNode, CGNode> reach = new GraphReachability<CGNode, CGNode>(inverted, new TrueFilter()); progress.subTask("Searching potential non-returning calls"); reach.solve(progress); Set<CGNode> roots = HashSetFactory.make(loop); roots.addAll(recursive); OrdinalSet<CGNode> potential = OrdinalSet.empty(); for (CGNode root : roots) { OrdinalSet<CGNode> reached = reach.getReachableSet(root); potential = OrdinalSet.unify(potential, reached); } Set<CGNode> terminating = HashSetFactory.make(); Set<CGNode> nonTerminating = HashSetFactory.make(); for (CGNode node : cg) { if (potential.contains(node)) { nonTerminating.add(node); } else { terminating.add(node); } } for (Call call : sdg.getAllCalls()) { if (nonTerminating.contains(call.callee.getCallGraphNode())) { calls.add(call.node); } } progress.done(); computeControlDependence(calls, progress); return calls; }