public class ControlDependenceGraph<T>
extends com.ibm.wala.util.graph.AbstractNumberedGraph<T>
| Constructor and Description |
|---|
ControlDependenceGraph(MinimalCFG<T> cfg) |
ControlDependenceGraph(MinimalCFG<T> cfg,
boolean wantEdgeLabels) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
controlEquivalent(T bb1,
T bb2) |
MinimalCFG<T> |
getControlFlowGraph() |
java.util.Set<? extends java.lang.Object> |
getEdgeLabels(T from,
T to)
Return the set of edge labels for the control flow edges that cause the given edge in the CDG.
|
com.ibm.wala.util.graph.NumberedEdgeManager<T> |
getEdgeManager() |
com.ibm.wala.util.graph.NumberedNodeManager<T> |
getNodeManager() |
protected java.lang.Object |
makeEdgeLabel(T from,
T to,
T s) |
java.lang.String |
toString() |
getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodesaddEdge, addNode, containsNode, edgeString, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, streamclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitpublic ControlDependenceGraph(MinimalCFG<T> cfg, boolean wantEdgeLabels)
cfg - governing control flow graphwantEdgeLabels - whether to compute edge labels for CDG edgespublic ControlDependenceGraph(MinimalCFG<T> cfg)
cfg - governing control flow graphpublic java.lang.String toString()
toString in class com.ibm.wala.util.graph.AbstractGraph<T>public MinimalCFG<T> getControlFlowGraph()
public java.util.Set<? extends java.lang.Object> getEdgeLabels(T from, T to)
public com.ibm.wala.util.graph.NumberedNodeManager<T> getNodeManager()
getNodeManager in class com.ibm.wala.util.graph.AbstractNumberedGraph<T>public com.ibm.wala.util.graph.NumberedEdgeManager<T> getEdgeManager()
getEdgeManager in class com.ibm.wala.util.graph.AbstractNumberedGraph<T>