Class AbstractDemandFlowGraph

java.lang.Object

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

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

com.ibm.wala.util.graph.labeled.AbstractNumberedLabeledGraph<Object, IFlowLabel>

com.ibm.wala.util.graph.labeled.SlowSparseNumberedLabeledGraph<Object, IFlowLabel>

com.ibm.wala.demandpa.flowgraph.AbstractFlowGraph

com.ibm.wala.demandpa.flowgraph.AbstractDemandFlowGraph

All Implemented Interfaces:

IFlowGraph, EdgeManager<Object>, Graph<Object>, LabeledEdgeManager<Object, IFlowLabel>, LabeledGraph<Object, IFlowLabel>, NumberedLabeledEdgeManager<Object, IFlowLabel>, NumberedLabeledGraph<Object, IFlowLabel>, NodeManager<Object>, NumberedEdgeManager<Object>, NumberedGraph<Object>, NumberedNodeManager<Object>, Serializable, Iterable<Object>

Direct Known Subclasses:

DemandPointerFlowGraph, DemandValueFlowGraph

public abstract class AbstractDemandFlowGraph
extends AbstractFlowGraph

A graph representing program flow, constructed method-by-method on demand

See Also:

• Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
protected static interface	AbstractDemandFlowGraph.FlowStatementVisitor

Field Summary

Fields inherited from class AbstractFlowGraph

callDefs, callParams, cg, cha, heapModel, mam, params, returns

Constructor Summary

Constructors

Constructor	Description
AbstractDemandFlowGraph(CallGraph cg, HeapModel heapModel, MemoryAccessMap mam, IClassHierarchy cha)

Method Summary

Modifier and Type	Method	Description
protected void	addBlockInstructionConstraints(CGNode node, ControlFlowGraph<SSAInstruction, ISSABasicBlock> cfg, ISSABasicBlock b, AbstractDemandFlowGraph.FlowStatementVisitor v)	Add constraints for a particular basic block.
protected void	addNodeInstructionConstraints(CGNode node, IR ir)	Add pointer flow constraints based on instructions in a given node
protected abstract void	addNodesForParameters(CGNode node, IR ir)
void	addSubgraphForNode(CGNode node)	add representation of flow for a node, if not already present
Iterator<PointerKeyAndCallSite>	getParamPreds(LocalPointerKey pk)
Iterator<PointerKeyAndCallSite>	getParamSuccs(LocalPointerKey pk)
Set<CGNode>	getPossibleTargets(CGNode node, CallSiteReference site, LocalPointerKey actualPk)	get the callees that should be considered at a particular call site
Set<CallerSiteContext>	getPotentialCallers(PointerKey formalPk)
Iterator<PointerKeyAndCallSite>	getReturnPreds(LocalPointerKey pk)
Iterator<PointerKeyAndCallSite>	getReturnSuccs(LocalPointerKey pk)
boolean	hasSubgraphForNode(CGNode node)
protected abstract AbstractDemandFlowGraph.FlowStatementVisitor	makeVisitor(CGNode node)
protected void	unconditionallyAddConstraintsFromNode(CGNode node, IR ir)

Methods inherited from class AbstractFlowGraph

addExceptionDefConstraints, addNodeConstantConstraints, addNodePassthruExceptionConstraints, addNodesForInvocations, convertPointerKeyToHeapModel, getArrayReads, getInstrReturningTo, getInstrsPassingParam, getReadsOfInstanceField, getReadsOfStaticField, getWritesToInstanceField, getWritesToStaticField, isParam, visitPreds, visitSuccs

Methods inherited from class SlowSparseNumberedLabeledGraph

copyInto, duplicate, getEdgeManager, getNodeManager

Methods inherited from class AbstractNumberedLabeledGraph

addEdge, edgeString, getDefaultLabel, getEdgeLabels, getPredLabels, getPredNodeCount, getPredNodeNumbers, getPredNodes, getSuccLabels, getSuccNodeCount, getSuccNodeNumbers, getSuccNodes, hasEdge, removeEdge

Methods inherited from class AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

Methods inherited from class AbstractGraph

addEdge, addNode, containsNode, getNumberOfNodes, getPredNodeCount, getPredNodes, getSuccNodeCount, getSuccNodes, hasEdge, iterator, nodeString, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toString

Methods inherited from class Object

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

Methods inherited from interface EdgeManager

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

Methods inherited from interface Graph

removeNodeAndEdges

Methods inherited from interface Iterable

forEach, spliterator

Methods inherited from interface LabeledEdgeManager

addEdge, getDefaultLabel, getEdgeLabels, getPredLabels, getPredNodeCount, getPredNodes, getPredNodes, getSuccLabels, getSuccNodeCount, getSuccNodes, hasEdge, removeEdge

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Constructor Details

AbstractDemandFlowGraph

public AbstractDemandFlowGraph(CallGraph cg,
 HeapModel heapModel,
 MemoryAccessMap mam,
 IClassHierarchy cha)

Method Details

addSubgraphForNode

public void addSubgraphForNode(CGNode node)
                        throws IllegalArgumentException

Description copied from interface: IFlowGraph

add representation of flow for a node, if not already present

Throws:

IllegalArgumentException - if node == null

See Also:

• IFlowGraph.addSubgraphForNode(com.ibm.wala.ipa.callgraph.CGNode)

hasSubgraphForNode

public boolean hasSubgraphForNode(CGNode node)

See Also:

• IFlowGraph.hasSubgraphForNode(com.ibm.wala.ipa.callgraph.CGNode)

getParamSuccs

public Iterator<PointerKeyAndCallSite> getParamSuccs(LocalPointerKey pk)

See Also:

• IFlowGraph.getInstrsPassingParam(LocalPointerKey)

getParamPreds

public Iterator<PointerKeyAndCallSite> getParamPreds(LocalPointerKey pk)

See Also:

• IFlowGraph.getInstrsPassingParam(LocalPointerKey)

getReturnSuccs

public Iterator<PointerKeyAndCallSite> getReturnSuccs(LocalPointerKey pk)

See Also:

• IFlowGraph.getInstrReturningTo(LocalPointerKey)

getReturnPreds

public Iterator<PointerKeyAndCallSite> getReturnPreds(LocalPointerKey pk)

See Also:

• IFlowGraph.getInstrReturningTo(LocalPointerKey)

addNodesForParameters

protected abstract void addNodesForParameters(CGNode node,
 IR ir)

unconditionallyAddConstraintsFromNode

protected void unconditionallyAddConstraintsFromNode(CGNode node,
 IR ir)

addNodeInstructionConstraints

protected void addNodeInstructionConstraints(CGNode node,
 IR ir)

Add pointer flow constraints based on instructions in a given node

addBlockInstructionConstraints

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

Add constraints for a particular basic block.

makeVisitor

protected abstract AbstractDemandFlowGraph.FlowStatementVisitor makeVisitor(CGNode node)

getPotentialCallers

public Set<CallerSiteContext> getPotentialCallers(PointerKey formalPk)

Parameters:

formalPk - a PointerKey representing either a formal parameter or return value

Returns:

the CallerSiteContexts representing pointer callers of formalPk's method

getPossibleTargets

public Set<CGNode> getPossibleTargets(CGNode node,
 CallSiteReference site,
 LocalPointerKey actualPk)

Description copied from interface: IFlowGraph

get the callees that should be considered at a particular call site

Parameters:

node - the caller

site - the call site

actualPk - a LocalPointerKey corresponding to the actual parameter or return value of interest. This may be used to filter out certain callees.

Returns:

the callees of interest