Class InterproceduralCFG

java.lang.Object

com.ibm.wala.ipa.cfg.AbstractInterproceduralCFG<ISSABasicBlock>

com.ibm.wala.ipa.cfg.InterproceduralCFG

All Implemented Interfaces:

EdgeManager<BasicBlockInContext<ISSABasicBlock>>, Graph<BasicBlockInContext<ISSABasicBlock>>, NodeManager<BasicBlockInContext<ISSABasicBlock>>, NumberedEdgeManager<BasicBlockInContext<ISSABasicBlock>>, NumberedGraph<BasicBlockInContext<ISSABasicBlock>>, NumberedNodeManager<BasicBlockInContext<ISSABasicBlock>>, Iterable<BasicBlockInContext<ISSABasicBlock>>

public class InterproceduralCFG
extends AbstractInterproceduralCFG<ISSABasicBlock>

Interprocedural control-flow graph.

TODO: think about a better implementation; perhaps a lazy view of the constituent CFGs Lots of ways this can be optimized?

Constructor Summary

Constructors

Constructor	Description
InterproceduralCFG(CallGraph CG)
InterproceduralCFG(CallGraph cg, Predicate<CGNode> filtersection)

Method Summary

Modifier and Type	Method	Description
ControlFlowGraph<SSAInstruction, ISSABasicBlock>	getCFG(CGNode n)

Methods inherited from class AbstractInterproceduralCFG

addEdge, addEdgesToNonEntryBlock, addNode, callGraphUpdated, containsNode, getCallGraph, getCallSiteForCallBlock, getCallSites, getCallTargets, getCFG, getCGNode, getEntry, getExit, getLastInstructionForBlock, getMaxNumber, getNode, getNumber, getNumberOfNodes, getPredNodeCount, getPredNodeNumbers, getPredNodes, getReturnSites, getSuccNodeCount, getSuccNodeNumbers, getSuccNodes, hasCall, hasCall, hasEdge, isReturn, iterateNodes, iterator, removeAllIncidentEdges, removeEdge, removeIncomingEdges, removeNode, removeNodeAndEdges, removeOutgoingEdges, stream, toString

Modifier and Type	Method	Description
void	addEdge(BasicBlockInContext<ISSABasicBlock> src, BasicBlockInContext<ISSABasicBlock> dst)
protected void	addEdgesToNonEntryBlock(CGNode n, ControlFlowGraph<?, ISSABasicBlock> cfg, SSAInstruction[] instrs, ISSABasicBlock bb)	Add edges to the IPCFG for the incoming edges incident on a basic block bb.
void	addNode(BasicBlockInContext<ISSABasicBlock> n)	add a node to this graph
void	callGraphUpdated()	Should be invoked when the underlying call graph has changed.
boolean	containsNode(BasicBlockInContext<ISSABasicBlock> N)
CallGraph	getCallGraph()
protected CallSiteReference	getCallSiteForCallBlock(IBasicBlock<SSAInstruction> B, ControlFlowGraph<SSAInstruction, ISSABasicBlock> cfg)	get the CallSiteReference corresponding to the last instruction in B (assumed to be a call)
Iterator<BasicBlockInContext<ISSABasicBlock>>	getCallSites(BasicBlockInContext<ISSABasicBlock> returnBlock, CGNode callee)	get the basic blocks which are call sites that may call callee and return to returnBlock if callee is null, answer return sites for which no callee was found.
Set<CGNode>	getCallTargets(BasicBlockInContext<ISSABasicBlock> B)
ControlFlowGraph<SSAInstruction, ISSABasicBlock>	getCFG(BasicBlockInContext<ISSABasicBlock> B)
CGNode	getCGNode(BasicBlockInContext<ISSABasicBlock> B)
BasicBlockInContext<ISSABasicBlock>	getEntry(CGNode n)
BasicBlockInContext<ISSABasicBlock>	getExit(CGNode n)
protected SSAInstruction	getLastInstructionForBlock(ISSABasicBlock pb, SSAInstruction[] instrs)
int	getMaxNumber()
BasicBlockInContext<ISSABasicBlock>	getNode(int number)
int	getNumber(BasicBlockInContext<ISSABasicBlock> N)
int	getNumberOfNodes()
int	getPredNodeCount(BasicBlockInContext<ISSABasicBlock> N)	Return the number of immediate predecessor nodes of n
IntSet	getPredNodeNumbers(BasicBlockInContext<ISSABasicBlock> node)
Iterator<BasicBlockInContext<ISSABasicBlock>>	getPredNodes(BasicBlockInContext<ISSABasicBlock> N)	Return an Iterator over the immediate predecessor nodes of n
Iterator<BasicBlockInContext<ISSABasicBlock>>	getReturnSites(BasicBlockInContext<ISSABasicBlock> callBlock)
int	getSuccNodeCount(BasicBlockInContext<ISSABasicBlock> N)	Return the number of immediate successor nodes of this Node in the Graph
IntSet	getSuccNodeNumbers(BasicBlockInContext<ISSABasicBlock> node)
Iterator<BasicBlockInContext<ISSABasicBlock>>	getSuccNodes(BasicBlockInContext<ISSABasicBlock> N)	Return an Iterator over the immediate successor nodes of n
boolean	hasCall(BasicBlockInContext<ISSABasicBlock> B)
protected boolean	hasCall(BasicBlockInContext<ISSABasicBlock> B, ControlFlowGraph<SSAInstruction, ISSABasicBlock> cfg)
boolean	hasEdge(BasicBlockInContext<ISSABasicBlock> src, BasicBlockInContext<ISSABasicBlock> dst)
boolean	isReturn(BasicBlockInContext<ISSABasicBlock> bb)
Iterator<BasicBlockInContext<ISSABasicBlock>>	iterateNodes(IntSet s)
Iterator<BasicBlockInContext<ISSABasicBlock>>	iterator()
void	removeAllIncidentEdges(BasicBlockInContext<ISSABasicBlock> node)
void	removeEdge(BasicBlockInContext<ISSABasicBlock> src, BasicBlockInContext<ISSABasicBlock> dst)
void	removeIncomingEdges(BasicBlockInContext<ISSABasicBlock> node)
void	removeNode(BasicBlockInContext<ISSABasicBlock> n)	remove a node from this graph
void	removeNodeAndEdges(BasicBlockInContext<ISSABasicBlock> N)	remove a node and all its incident edges
void	removeOutgoingEdges(BasicBlockInContext<ISSABasicBlock> node)
Stream<BasicBlockInContext<ISSABasicBlock>>	stream()
String	toString()

Methods inherited from class Object

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

Methods inherited from interface Iterable

forEach, spliterator

Constructor Details

InterproceduralCFG

public InterproceduralCFG(CallGraph CG)

InterproceduralCFG

public InterproceduralCFG(CallGraph cg,
 Predicate<CGNode> filtersection)

Method Details

getCFG

public ControlFlowGraph<SSAInstruction, ISSABasicBlock> getCFG(CGNode n)
                                                        throws IllegalArgumentException

Specified by:

getCFG in class AbstractInterproceduralCFG<ISSABasicBlock>

Returns:

the cfg for n, or null if none found

Throws:

IllegalArgumentException - if n == null