public interface HeapGraph<T extends InstanceKey>
extends com.ibm.wala.util.graph.NumberedGraph<java.lang.Object>
Graph view of a pointer analysis solution.
Nodes in the Graph are PointerKeys and InstanceKeys.
There is an edge from a PointerKey P to an InstanceKey I iff the PointerAnalysis indicates that P may point to I.
There is an edge from an InstanceKey I to a PointerKey P iff - P represents a field of an object instance modeled by I, or - P represents the array contents of array instance I.
| Modifier and Type | Method and Description |
|---|---|
HeapModel |
getHeapModel() |
PointerAnalysis<T> |
getPointerAnalysis() |
java.util.Collection<java.lang.Object> |
getReachableInstances(java.util.Set<java.lang.Object> roots) |
getMaxNumber, getNode, getNumber, iterateNodesaddNode, containsNode, getNumberOfNodes, iterator, removeNode, streamjava.util.Collection<java.lang.Object> getReachableInstances(java.util.Set<java.lang.Object> roots)
HeapModel getHeapModel()
PointerAnalysis<T> getPointerAnalysis()