public void removeAll(Stmt s) { for (Local var : stmtToVar.get(s)) { varToStmt.remove(var); } stmtToVar.remove(s); }
/** Utility function to remove a node & all adjacent edges */ protected final void removeNode(PurityNode n) { Iterator it = edges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge) it.next(); backEdges.remove(e.getTarget(), e); } it = backEdges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge) it.next(); edges.remove(e.getSource(), e); } it = backLocals.get(n).iterator(); while (it.hasNext()) { Local l = (Local) it.next(); locals.remove(l, n); } ret.remove(n); edges.remove(n); backEdges.remove(n); backLocals.remove(n); nodes.remove(n); paramNodes.remove(n); globEscape.remove(n); mutated.remove(n); }
edges.remove(src, e); edges.put(dst, ee); backEdges.remove(n, e); backEdges.put(n, ee); edges.remove(n, e); edges.put(n, ee); backEdges.remove(src, e); backEdges.put(dst, ee); while (it.hasNext()) { Local l = (Local) it.next(); locals.remove(l, src); backLocals.remove(src, l); locals.put(l, dst); backLocals.put(dst, l); mutated.remove(src); mutated.putAll(dst, m);
trackedPhiToBoxes.remove(u);
public void removeAll(Stmt s) { for(Iterator it = stmtToVar.get(s).iterator(); it.hasNext();) { final Local var = (Local) it.next(); varToStmt.remove(var); } stmtToVar.remove(s); } public void copyFrom(Fact in) {
/** Removes the edge e from the call graph. Returns true iff the edge * was originally present in the call graph. */ public boolean removeEdge( Edge e ) { if( !edges.remove( e ) ) return false; srcMap.remove(e.getSrc(), e); tgtMap.remove(e.getTgt(), e); unitMap.remove(e.srcUnit(), e); return true; }
/** Removes the edge e from the call graph. Returns true iff the edge * was originally present in the call graph. */ public boolean removeEdge( Edge e ) { if( !edges.remove( e ) ) return false; srcMap.remove(e.getSrc(), e); tgtMap.remove(e.getTgt(), e); unitMap.remove(e.srcUnit(), e); return true; }
public void removeAll(Stmt s) { for(Iterator it = stmtToVar.get(s).iterator(); it.hasNext();) { final Local var = (Local) it.next(); varToStmt.remove(var); } stmtToVar.remove(s); } public void copyFrom(Fact in) {
/** Utility function to remove a node & all adjacent edges */ protected final void removeNode(PurityNode n) { Iterator it = edges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge)it.next(); backEdges.remove(e.getTarget(),e); } it = backEdges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge)it.next(); edges.remove(e.getSource(),e); } it = backLocals.get(n).iterator(); while (it.hasNext()) { Local l = (Local)it.next(); locals.remove(l,n); } ret.remove(n); edges.remove(n); backEdges.remove(n); backLocals.remove(n); nodes.remove(n); paramNodes.remove(n); globEscape.remove(n); mutated.remove(n); }
/** Utility function to remove a node & all adjacent edges */ protected final void removeNode(PurityNode n) { Iterator it = edges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge)it.next(); backEdges.remove(e.getTarget(),e); } it = backEdges.get(n).iterator(); while (it.hasNext()) { PurityEdge e = (PurityEdge)it.next(); edges.remove(e.getSource(),e); } it = backLocals.get(n).iterator(); while (it.hasNext()) { Local l = (Local)it.next(); locals.remove(l,n); } ret.remove(n); edges.remove(n); backEdges.remove(n); backLocals.remove(n); nodes.remove(n); paramNodes.remove(n); globEscape.remove(n); mutated.remove(n); }
@Override public void remove() { flows.remove(curPair.getO1(), curPair.getO2()); }
/** * Removes the given flow summary from this set * * @param toRemove The flow summary to remove */ public void remove(MethodFlow toRemove) { Set<MethodFlow> flowsForMethod = flows.get(toRemove.methodSig()); if (flowsForMethod != null) { flowsForMethod.remove(toRemove); if (flowsForMethod.isEmpty()) flows.remove(toRemove.methodSig()); } }
PurityEdge ee = cacheEdge(new PurityEdge(dst, e.getField(), n, e.isInside())); edges.remove(src, e); edges.put(dst, ee); backEdges.remove(n, e); backEdges.put(n, ee); PurityEdge ee = cacheEdge(new PurityEdge(n, e.getField(), dst, e.isInside())); edges.remove(n, e); edges.put(n, ee); backEdges.remove(src, e); backEdges.put(dst, ee); while (it.hasNext()) { Local l = (Local)it.next(); locals.remove(l, src); backLocals.remove(src, l); locals.put(l,dst); backLocals.put(dst, l); mutated.remove(src); mutated.putAll(dst,m);
PurityEdge ee = cacheEdge(new PurityEdge(dst, e.getField(), n, e.isInside())); edges.remove(src, e); edges.put(dst, ee); backEdges.remove(n, e); backEdges.put(n, ee); PurityEdge ee = cacheEdge(new PurityEdge(n, e.getField(), dst, e.isInside())); edges.remove(n, e); edges.put(n, ee); backEdges.remove(src, e); backEdges.put(dst, ee); while (it.hasNext()) { Local l = (Local)it.next(); locals.remove(l, src); backLocals.remove(src, l); locals.put(l,dst); backLocals.put(dst, l); mutated.remove(src); mutated.putAll(dst,m);