com.ibm.wala.analysis.pointers

Class HeapGraphImpl<T extends InstanceKey>

java.lang.Object

com.ibm.wala.analysis.pointers.HeapGraphImpl<T>

All Implemented Interfaces:

HeapGraph<T>, com.ibm.wala.util.graph.EdgeManager<Object>, com.ibm.wala.util.graph.Graph<Object>, com.ibm.wala.util.graph.NodeManager<Object>, com.ibm.wala.util.graph.NumberedEdgeManager<Object>, com.ibm.wala.util.graph.NumberedGraph<Object>, com.ibm.wala.util.graph.NumberedNodeManager<Object>, Iterable<Object>

Direct Known Subclasses:

BasicHeapGraph

public abstract class HeapGraphImpl<T extends InstanceKey>
extends Object
implements HeapGraph<T>

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.

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	HeapGraphImpl(PointerAnalysis<T> pa)

Method Summary

Modifier and Type	Method and Description
HeapModel	getHeapModel()
PointerAnalysis<T>	getPointerAnalysis()
Collection<Object>	getReachableInstances(Set<Object> roots)
Iterator<Object>	iterateNodes(com.ibm.wala.util.intset.IntSet s)
void	removeNodeAndEdges(Object N)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.ibm.wala.util.graph.NumberedNodeManager

getMaxNumber, getNode, getNumber

Methods inherited from interface com.ibm.wala.util.graph.NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface com.ibm.wala.util.graph.NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface com.ibm.wala.util.graph.EdgeManager

addEdge, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Constructor Detail

HeapGraphImpl

protected HeapGraphImpl(PointerAnalysis<T> pa)

Method Detail

iterateNodes

public Iterator<Object> iterateNodes(com.ibm.wala.util.intset.IntSet s)

Specified by:

iterateNodes in interface com.ibm.wala.util.graph.NumberedNodeManager<Object>

getReachableInstances

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

Specified by:

getReachableInstances in interface HeapGraph<T extends InstanceKey>

removeNodeAndEdges

public void removeNodeAndEdges(Object N)
                        throws UnsupportedOperationException

Specified by:

removeNodeAndEdges in interface com.ibm.wala.util.graph.Graph<Object>

Throws:

UnsupportedOperationException

getHeapModel

public HeapModel getHeapModel()

Specified by:

getHeapModel in interface HeapGraph<T extends InstanceKey>

Returns:

the heap model used in this pointer analysis.

getPointerAnalysis

public PointerAnalysis<T> getPointerAnalysis()

Specified by:

getPointerAnalysis in interface HeapGraph<T extends InstanceKey>