soot.jimple.toolkits.ide.icfg.BackwardsInterproceduralCFG Maven / Gradle / Ivy
package soot.jimple.toolkits.ide.icfg;
/*-
* #%L
* Soot - a J*va Optimization Framework
* %%
* Copyright (C) 1997 - 2013 Eric Bodden and others
* %%
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 2.1 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Lesser Public License for more details.
*
* You should have received a copy of the GNU General Lesser Public
* License along with this program. If not, see
* .
* #L%
*/
import java.util.Collection;
import java.util.List;
import java.util.Set;
import soot.SootMethod;
import soot.Unit;
import soot.Value;
import soot.toolkits.graph.DirectedGraph;
/**
* Same as {@link JimpleBasedInterproceduralCFG} but based on inverted unit graphs. This should be used for backward
* analyses.
*/
public class BackwardsInterproceduralCFG implements BiDiInterproceduralCFG {
protected final BiDiInterproceduralCFG delegate;
public BackwardsInterproceduralCFG(BiDiInterproceduralCFG fwICFG) {
delegate = fwICFG;
}
// swapped
@Override
public List getSuccsOf(Unit n) {
return delegate.getPredsOf(n);
}
// swapped
@Override
public Collection getStartPointsOf(SootMethod m) {
return delegate.getEndPointsOf(m);
}
// swapped
@Override
public List getReturnSitesOfCallAt(Unit n) {
return delegate.getPredsOfCallAt(n);
}
// swapped
@Override
public boolean isExitStmt(Unit stmt) {
return delegate.isStartPoint(stmt);
}
// swapped
@Override
public boolean isStartPoint(Unit stmt) {
return delegate.isExitStmt(stmt);
}
// swapped
@Override
public Set allNonCallStartNodes() {
return delegate.allNonCallEndNodes();
}
// swapped
@Override
public List getPredsOf(Unit u) {
return delegate.getSuccsOf(u);
}
// swapped
@Override
public Collection getEndPointsOf(SootMethod m) {
return delegate.getStartPointsOf(m);
}
// swapped
@Override
public List getPredsOfCallAt(Unit u) {
return delegate.getSuccsOf(u);
}
// swapped
@Override
public Set allNonCallEndNodes() {
return delegate.allNonCallStartNodes();
}
// same
@Override
public SootMethod getMethodOf(Unit n) {
return delegate.getMethodOf(n);
}
// same
@Override
public Collection getCalleesOfCallAt(Unit n) {
return delegate.getCalleesOfCallAt(n);
}
// same
@Override
public Collection getCallersOf(SootMethod m) {
return delegate.getCallersOf(m);
}
// same
@Override
public Set getCallsFromWithin(SootMethod m) {
return delegate.getCallsFromWithin(m);
}
// same
@Override
public boolean isCallStmt(Unit stmt) {
return delegate.isCallStmt(stmt);
}
// same
@Override
public DirectedGraph getOrCreateUnitGraph(SootMethod m) {
return delegate.getOrCreateUnitGraph(m);
}
// same
@Override
public List getParameterRefs(SootMethod m) {
return delegate.getParameterRefs(m);
}
@Override
public boolean isFallThroughSuccessor(Unit stmt, Unit succ) {
throw new UnsupportedOperationException("not implemented because semantics unclear");
}
@Override
public boolean isBranchTarget(Unit stmt, Unit succ) {
throw new UnsupportedOperationException("not implemented because semantics unclear");
}
// swapped
@Override
public boolean isReturnSite(Unit n) {
for (Unit pred : getSuccsOf(n)) {
if (isCallStmt(pred)) {
return true;
}
}
return false;
}
// same
@Override
public boolean isReachable(Unit u) {
return delegate.isReachable(u);
}
}