List<Local> localList = (List<Local>) mProductions.removeLast(); jBody.getLocals().addAll(localList);
locals.addAll(sortedLocals);
body.getLocals().addAll(keep);
break; processedClasses.addAll(unprocessedClasses); for (SootClass s : unprocessedClasses) { if (s.isPhantom()) {
public HashReversibleGraph(DirectedGraph dg) { this(); for(Iterator i = dg.iterator(); i.hasNext();){ Object s = i.next(); addNode(s); } for(Iterator i = dg.iterator(); i.hasNext();){ Object s = i.next(); List succs = dg.getSuccsOf(s); for(Iterator succsIt = succs.iterator(); succsIt.hasNext();){ Object t = succsIt.next(); addEdge(s, t); } } /* use the same heads and tails as the original graph */ heads.clear(); heads.addAll(dg.getHeads()); tails.clear(); tails.addAll(dg.getTails()); }
public HashReversibleGraph(DirectedGraph dg) { this(); for(Iterator i = dg.iterator(); i.hasNext();){ Object s = i.next(); addNode(s); } for(Iterator i = dg.iterator(); i.hasNext();){ Object s = i.next(); List succs = dg.getSuccsOf(s); for(Iterator succsIt = succs.iterator(); succsIt.hasNext();){ Object t = succsIt.next(); addEdge(s, t); } } /* use the same heads and tails as the original graph */ heads.clear(); heads.addAll(dg.getHeads()); tails.clear(); tails.addAll(dg.getTails()); }
unprocessedClasses.removeAll(processedClasses); if( unprocessedClasses.isEmpty() ) break; processedClasses.addAll(unprocessedClasses); for (SootClass s : unprocessedClasses) { if( s.isPhantom() ) continue;
unprocessedClasses.removeAll(processedClasses); if( unprocessedClasses.isEmpty() ) break; processedClasses.addAll(unprocessedClasses); for (SootClass s : unprocessedClasses) { if( s.isPhantom() ) continue;