public interface HeapGraph<T extends InstanceKey> extends com.ibm.wala.util.graph.NumberedGraph<Object>
Graph
view of a pointer analysis solution.
Nodes in the Graph are PointerKey
s and InstanceKey
s.
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() |
Collection<Object> |
getReachableInstances(Set<Object> roots) |
getMaxNumber, getNode, getNumber, iterateNodes
addNode, containsNode, getNumberOfNodes, iterator, removeNode
forEach, spliterator
Collection<Object> getReachableInstances(Set<Object> roots)
HeapModel getHeapModel()
PointerAnalysis<T> getPointerAnalysis()
Copyright © 2018. All rights reserved.