public class DelegatingCFG<I,T extends com.ibm.wala.cfg.IBasicBlock<I>>
extends com.ibm.wala.util.graph.AbstractNumberedGraph<T>
implements com.ibm.wala.cfg.ControlFlowGraph<I,T>
| Modifier and Type | Field and Description |
|---|---|
protected com.ibm.wala.cfg.ControlFlowGraph<I,T> |
parent |
| Constructor and Description |
|---|
DelegatingCFG(com.ibm.wala.cfg.ControlFlowGraph<I,T> parent) |
| Modifier and Type | Method and Description |
|---|---|
T |
entry() |
T |
exit() |
T |
getBlockForInstruction(int index) |
com.ibm.wala.util.intset.BitVector |
getCatchBlocks() |
protected com.ibm.wala.util.graph.NumberedEdgeManager<T> |
getEdgeManager() |
java.util.Collection<T> |
getExceptionalPredecessors(T b) |
java.util.List<T> |
getExceptionalSuccessors(T b) |
I[] |
getInstructions() |
com.ibm.wala.classLoader.IMethod |
getMethod() |
protected com.ibm.wala.util.graph.NumberedNodeManager<T> |
getNodeManager() |
java.util.Collection<T> |
getNormalPredecessors(T b) |
java.util.Collection<T> |
getNormalSuccessors(T b) |
int |
getProgramCounter(int index) |
getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodesaddEdge, addNode, containsNode, edgeString, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetMaxNumber, getNode, getNumber, iterateNodesaddNode, containsNode, getNumberOfNodes, iterator, removeNode, streamprotected com.ibm.wala.util.graph.NumberedNodeManager<T> getNodeManager()
protected com.ibm.wala.util.graph.NumberedEdgeManager<T> getEdgeManager()
public T entry()
public T exit()
public com.ibm.wala.util.intset.BitVector getCatchBlocks()
public T getBlockForInstruction(int index)
public I[] getInstructions()
public int getProgramCounter(int index)
public com.ibm.wala.classLoader.IMethod getMethod()