public interface BiDiInterproceduralCFG<N,M> extends InterproceduralCFG<N,M>
InterproceduralCFG
which supports the computation of predecessors.Modifier and Type | Method and Description |
---|---|
java.util.Set<N> |
allNonCallEndNodes() |
java.util.Collection<N> |
getEndPointsOf(M m) |
DirectedGraph<N> |
getOrCreateUnitGraph(M body) |
java.util.List<Value> |
getParameterRefs(M m) |
java.util.List<N> |
getPredsOf(N u) |
java.util.List<N> |
getPredsOfCallAt(N u) |
boolean |
isReachable(N u)
Checks whether the given statement is rachable from the entry point
|
boolean |
isReturnSite(N n)
Gets whether the given statement is a return site of at least one call
|
allNonCallStartNodes, getCalleesOfCallAt, getCallersOf, getCallsFromWithin, getMethodOf, getReturnSitesOfCallAt, getStartPointsOf, getSuccsOf, isBranchTarget, isCallStmt, isExitStmt, isFallThroughSuccessor, isStartPoint
java.util.List<N> getPredsOf(N u)
getPredsOf
in interface InterproceduralCFG<N,M>
java.util.Set<N> allNonCallEndNodes()
DirectedGraph<N> getOrCreateUnitGraph(M body)
boolean isReturnSite(N n)
n
- The statement to checkboolean isReachable(N u)
u
- The statement to check