HeapGraph (API Reference for wala 1.3.9)

All Superinterfaces:

EdgeManager<Object>, Graph<Object>, Iterable<Object>, NodeManager<Object>, NumberedEdgeManager<Object>, NumberedGraph<Object>, NumberedNodeManager<Object>

All Known Implementing Classes:

BasicHeapGraph, HeapGraphImpl
```
public interface HeapGraph<T extends InstanceKey>
extends NumberedGraph<Object>
```
A 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.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`HeapModel`	`getHeapModel()`
`PointerAnalysis<T>`	`getPointerAnalysis()`
`Collection<Object>`	`getReachableInstances(Set<Object> roots)`

Methods inherited from interface com.ibm.wala.util.graph.EdgeManager
addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Methods inherited from interface com.ibm.wala.util.graph.Graph
removeNodeAndEdges

Methods inherited from interface java.lang.Iterable
forEach, spliterator

Methods inherited from interface com.ibm.wala.util.graph.NodeManager
addNode, containsNode, getNumberOfNodes, iterator, removeNode

Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager
getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager
getMaxNumber, getNode, getNumber, iterateNodes

Method Detail

getReachableInstances

Collection<Object> getReachableInstances(Set<Object> roots)

getHeapModel
```
HeapModel getHeapModel()
```

getPointerAnalysis

PointerAnalysis<T> getPointerAnalysis()