com.ibm.wala.demandpa.flowgraph

Class SimpleDemandPointerFlowGraph

java.lang.Object

com.ibm.wala.util.graph.AbstractGraph<T>

com.ibm.wala.util.graph.AbstractNumberedGraph<T>

com.ibm.wala.util.graph.impl.SlowSparseNumberedGraph<Object>

com.ibm.wala.demandpa.flowgraph.SimpleDemandPointerFlowGraph

All Implemented Interfaces:

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>, Serializable, Iterable<Object>

public class SimpleDemandPointerFlowGraph
extends com.ibm.wala.util.graph.impl.SlowSparseNumberedGraph<Object>

The nodes in this graph are PointerKeys corresponding to local variables and static fields, InstanceKeys, and FieldRefs (see below). This graph is constructed on-demand during a traversal. The edges represent

• flow from local -> local representing assignment (i.e. phi,pi)
• flow from instancekey -> local for news
• flow from formal -> actual parameter
• flow from return value -> local
• match edges
• local -> local edges representing loads/stores (e.g. x = y.f will have a edge x->y, labelled with f) for a getstatic x = Y.f, we have an edge from x -> Y.f.

N.B: Edges go OPPOSITE the flow of values. Edges carry labels if they arise from loads/stores, or calls

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
protected class	SimpleDemandPointerFlowGraph.StatementVisitor A visitor that generates graph nodes and edges for an IR.

Constructor Summary

Constructors

Constructor and Description
SimpleDemandPointerFlowGraph(CallGraph cg, HeapModel heapModel, MemoryAccessMap fam, IClassHierarchy cha)

Method Summary

Methods

Modifier and Type	Method and Description
protected void	addBlockInstructionConstraints(CGNode node, ControlFlowGraph<SSAInstruction,ISSABasicBlock> cfg, ISSABasicBlock b, SimpleDemandPointerFlowGraph.StatementVisitor v) Add constraints for a particular basic block.
protected void	addNodeInstructionConstraints(CGNode node, IR ir, DefUse du) Add pointer flow constraints based on instructions in a given node
protected void	addNodePassthruExceptionConstraints(CGNode node, IR ir) Add constraints to represent the flow of exceptions to the exceptional return value for this node
void	addSubgraphForNode(CGNode node)
protected HeapModel	getHeapModel()
int	getPredNodeCount(Object N)
com.ibm.wala.util.intset.IntSet	getPredNodeNumbers(Object node)
Iterator<Object>	getPredNodes(Object N)
int	getSuccNodeCount(Object N)
com.ibm.wala.util.intset.IntSet	getSuccNodeNumbers(Object node)
Iterator<Object>	getSuccNodes(Object N)
boolean	hasEdge(PointerKey src, PointerKey dst)
protected SimpleDemandPointerFlowGraph.StatementVisitor	makeVisitor(ExplicitCallGraph.ExplicitNode node, IR ir, DefUse du)
protected void	unconditionallyAddConstraintsFromNode(CGNode node)

Methods inherited from class com.ibm.wala.util.graph.impl.SlowSparseNumberedGraph

copyInto, duplicate, getEdgeManager, getNodeManager, make

Methods inherited from class com.ibm.wala.util.graph.AbstractNumberedGraph

getMaxNumber, getNode, getNumber, iterateNodes

Methods inherited from class com.ibm.wala.util.graph.AbstractGraph

addEdge, addNode, containsNode, getNumberOfNodes, hasEdge, iterator, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, toString

Methods inherited from class java.lang.Object

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

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

removeNodeAndEdges

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

addNode, containsNode, getNumberOfNodes, iterator, removeNode

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

addEdge, hasEdge, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeOutgoingEdges

Constructor Detail

SimpleDemandPointerFlowGraph

public SimpleDemandPointerFlowGraph(CallGraph cg,
                            HeapModel heapModel,
                            MemoryAccessMap fam,
                            IClassHierarchy cha)

Method Detail

addSubgraphForNode

public void addSubgraphForNode(CGNode node)

getHeapModel

protected HeapModel getHeapModel()

Returns:

Returns the heapModel.

getPredNodeNumbers

public com.ibm.wala.util.intset.IntSet getPredNodeNumbers(Object node)
                                                   throws com.ibm.wala.util.debug.UnimplementedError

Specified by:

getPredNodeNumbers in interface com.ibm.wala.util.graph.NumberedEdgeManager<Object>

Overrides:

getPredNodeNumbers in class com.ibm.wala.util.graph.AbstractNumberedGraph<Object>

Throws:

com.ibm.wala.util.debug.UnimplementedError

getSuccNodeNumbers

public com.ibm.wala.util.intset.IntSet getSuccNodeNumbers(Object node)
                                                   throws IllegalArgumentException

Specified by:

getSuccNodeNumbers in interface com.ibm.wala.util.graph.NumberedEdgeManager<Object>

Overrides:

getSuccNodeNumbers in class com.ibm.wala.util.graph.AbstractNumberedGraph<Object>

Throws:

IllegalArgumentException

getPredNodeCount

public int getPredNodeCount(Object N)
                     throws com.ibm.wala.util.debug.UnimplementedError

Specified by:

getPredNodeCount in interface com.ibm.wala.util.graph.EdgeManager<Object>

Overrides:

getPredNodeCount in class com.ibm.wala.util.graph.AbstractGraph<Object>

Throws:

com.ibm.wala.util.debug.UnimplementedError

getPredNodes

public Iterator<Object> getPredNodes(Object N)
                              throws IllegalArgumentException

Specified by:

getPredNodes in interface com.ibm.wala.util.graph.EdgeManager<Object>

Overrides:

getPredNodes in class com.ibm.wala.util.graph.AbstractGraph<Object>

Throws:

IllegalArgumentException

getSuccNodeCount

public int getSuccNodeCount(Object N)
                     throws com.ibm.wala.util.debug.UnimplementedError

Specified by:

getSuccNodeCount in interface com.ibm.wala.util.graph.EdgeManager<Object>

Overrides:

getSuccNodeCount in class com.ibm.wala.util.graph.AbstractGraph<Object>

Throws:

com.ibm.wala.util.debug.UnimplementedError

getSuccNodes

public Iterator<Object> getSuccNodes(Object N)

Specified by:

getSuccNodes in interface com.ibm.wala.util.graph.EdgeManager<Object>

Overrides:

getSuccNodes in class com.ibm.wala.util.graph.AbstractGraph<Object>

hasEdge

public boolean hasEdge(PointerKey src,
              PointerKey dst)

unconditionallyAddConstraintsFromNode

protected void unconditionallyAddConstraintsFromNode(CGNode node)

addNodePassthruExceptionConstraints

protected void addNodePassthruExceptionConstraints(CGNode node,
                                       IR ir)

Add constraints to represent the flow of exceptions to the exceptional return value for this node

addNodeInstructionConstraints

protected void addNodeInstructionConstraints(CGNode node,
                                 IR ir,
                                 DefUse du)

Add pointer flow constraints based on instructions in a given node

addBlockInstructionConstraints

protected void addBlockInstructionConstraints(CGNode node,
                                  ControlFlowGraph<SSAInstruction,ISSABasicBlock> cfg,
                                  ISSABasicBlock b,
                                  SimpleDemandPointerFlowGraph.StatementVisitor v)

Add constraints for a particular basic block.

makeVisitor

protected SimpleDemandPointerFlowGraph.StatementVisitor makeVisitor(ExplicitCallGraph.ExplicitNode node,
                                                        IR ir,
                                                        DefUse du)