Interface ControlFlowGraph<I, T extends IBasicBlock<I>>

All Superinterfaces:

EdgeManager<T>, Graph<T>, Iterable<T>, MinimalCFG<T>, NodeManager<T>, NumberedEdgeManager<T>, NumberedGraph<T>, NumberedNodeManager<T>

All Known Implementing Classes:

AbstractCFG, AstInducedCFG, AstTranslator.AstCFG, DelegatingCFG, DexCFG, ExplodedControlFlowGraph, InducedCFG, JSInducedCFG, MutableCFG, PrunedCFG, ShrikeCFG, SSACFG

public interface ControlFlowGraph<I, T extends IBasicBlock<I>>
extends NumberedGraph<T>, MinimalCFG<T>

An interface that is common to the Shrike and SSA CFG implementations.

Method Summary

Modifier and Type	Method	Description
T	getBlockForInstruction(int index)
BitVector	getCatchBlocks()
I[]	getInstructions()
IMethod	getMethod()
int	getProgramCounter(int index)	TODO: move this into IR?

Methods inherited from interface EdgeManager

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

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
int	getPredNodeCount(T n)	Return the number of immediate predecessor nodes of n
Iterator<T>	getPredNodes(T n)	Return an Iterator over the immediate predecessor nodes of n
int	getSuccNodeCount(T N)	Return the number of immediate successor nodes of this Node in the Graph
Iterator<T>	getSuccNodes(T n)	Return an Iterator over the immediate successor nodes of n
boolean	hasEdge(T src, T dst)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeOutgoingEdges(T node)

Methods inherited from interface Graph

removeNodeAndEdges

Modifier and Type	Method	Description
void	removeNodeAndEdges(T n)	remove a node and all its incident edges

Methods inherited from interface Iterable

forEach, spliterator

Methods inherited from interface MinimalCFG

entry, exit, getExceptionalPredecessors, getExceptionalSuccessors, getNormalPredecessors, getNormalSuccessors

Modifier and Type	Method	Description
T	entry()	Return the entry basic block in the CFG
T	exit()
Collection<T>	getExceptionalPredecessors(T b)	The order of blocks returned should be arbitrary but deterministic.
List<T>	getExceptionalSuccessors(T b)	The order of blocks returned must indicate the exception-handling scope.
Collection<T>	getNormalPredecessors(T b)	The order of blocks returned should be arbitrary but deterministic.
Collection<T>	getNormalSuccessors(T b)	The order of blocks returned should be arbitrary but deterministic.

Methods inherited from interface NodeManager

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Modifier and Type	Method	Description
void	addNode(T n)	add a node to this graph
boolean	containsNode(T n)
int	getNumberOfNodes()
default Iterator<T>	iterator()
void	removeNode(T n)	remove a node from this graph
Stream<T>	stream()

Methods inherited from interface NumberedEdgeManager

getPredNodeNumbers, getSuccNodeNumbers

Modifier and Type	Method	Description
IntSet	getPredNodeNumbers(T node)
IntSet	getSuccNodeNumbers(T node)

Methods inherited from interface NumberedNodeManager

getMaxNumber, getNode, getNumber, iterateNodes

Modifier and Type	Method	Description
int	getMaxNumber()
T	getNode(int number)
int	getNumber(T N)
Iterator<T>	iterateNodes(IntSet s)

Method Details

getCatchBlocks

BitVector getCatchBlocks()

Returns:

the indices of the catch blocks, as a bit vector

getBlockForInstruction

T getBlockForInstruction(int index)

Parameters:

index - an instruction index

Returns:

the basic block which contains this instruction.

getInstructions

I[] getInstructions()

Returns:

the instructions of this CFG, as an array.

getProgramCounter

int getProgramCounter(int index)

TODO: move this into IR?

Parameters:

index - an instruction index

Returns:

the program counter (bytecode index) corresponding to that instruction

getMethod

IMethod getMethod()

Returns:

the Method this CFG represents