Class MutableCFG<X, T extends IBasicBlock<X>>

java.lang.Object

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

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

com.ibm.wala.util.graph.impl.SparseNumberedGraph<T>

com.ibm.wala.cfg.exc.intra.MutableCFG<X,T>

All Implemented Interfaces:

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

public class MutableCFG<X, T extends IBasicBlock<X>>
extends SparseNumberedGraph<T>
implements ControlFlowGraph<X,T>

A modifiable control flow graph.

Author:

Juergen Graf <graf@kit.edu>

Method Summary

Modifier and Type	Method	Description
static <I, T extends IBasicBlock<I>> MutableCFG<I,T>	copyFrom(ControlFlowGraph<I,T> cfg)
T	entry()	Return the entry basic block in the CFG
T	exit()
T	getBlockForInstruction(int index)
BitVector	getCatchBlocks()
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.
X[]	getInstructions()
IMethod	getMethod()
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.
int	getProgramCounter(int index)	TODO: move this into IR?

Methods inherited from class SparseNumberedGraph

getEdgeManager, getNodeManager

Modifier and Type	Method	Description
protected NumberedEdgeManager<T>	getEdgeManager()
protected NumberedNodeManager<T>	getNodeManager()

Methods inherited from class AbstractNumberedGraph

getMaxNumber, getNode, getNumber, getPredNodeNumbers, getSuccNodeNumbers, iterateNodes

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

Methods inherited from class AbstractGraph

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

Modifier and Type	Method	Description
void	addEdge(T src, T dst)
void	addNode(T n)	add a node to this graph
boolean	containsNode(T n)
protected String	edgeString(T from, T to)
int	getNumberOfNodes()
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)
Iterator<T>	iterator()
protected String	nodeString(T n, boolean forEdge)
void	removeAllIncidentEdges(T node)
void	removeEdge(T src, T dst)
void	removeIncomingEdges(T node)
void	removeNode(T n)	remove a node from this graph
void	removeNodeAndEdges(T N)	remove a node and all its incident edges
void	removeOutgoingEdges(T node)
Stream<T>	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

Method Details

copyFrom

public static <I, T extends IBasicBlock<I>>
MutableCFG<I,T> copyFrom(ControlFlowGraph<I,T> cfg)

entry

public T entry()

Description copied from interface: MinimalCFG

Return the entry basic block in the CFG

Specified by:

entry in interface MinimalCFG<X>

exit

public T exit()

Specified by:

exit in interface MinimalCFG<X>

Returns:

the synthetic exit block for the cfg

getCatchBlocks

public BitVector getCatchBlocks()

Specified by:

getCatchBlocks in interface ControlFlowGraph<X, T extends IBasicBlock<X>>

Returns:

the indices of the catch blocks, as a bit vector

getBlockForInstruction

public T getBlockForInstruction(int index)

Specified by:

getBlockForInstruction in interface ControlFlowGraph<X, T extends IBasicBlock<X>>

Parameters:

index - an instruction index

Returns:

the basic block which contains this instruction.

getInstructions

public X[] getInstructions()

Specified by:

getInstructions in interface ControlFlowGraph<X, T extends IBasicBlock<X>>

Returns:

the instructions of this CFG, as an array.

getProgramCounter

public int getProgramCounter(int index)

Description copied from interface: ControlFlowGraph

TODO: move this into IR?

Specified by:

getProgramCounter in interface ControlFlowGraph<X, T extends IBasicBlock<X>>

Parameters:

index - an instruction index

Returns:

the program counter (bytecode index) corresponding to that instruction

getMethod

public IMethod getMethod()

Specified by:

getMethod in interface ControlFlowGraph<X, T extends IBasicBlock<X>>

Returns:

the Method this CFG represents

getExceptionalSuccessors

public List<T> getExceptionalSuccessors(T b)

Description copied from interface: MinimalCFG

The order of blocks returned must indicate the exception-handling scope. So the first block is the first candidate catch block, and so on. With this invariant one can compute the exceptional control flow for a given exception type.

Specified by:

getExceptionalSuccessors in interface MinimalCFG<X>

Returns:

the basic blocks which may be reached from b via exceptional control flow

getNormalSuccessors

public Collection<T> getNormalSuccessors(T b)

Description copied from interface: MinimalCFG

The order of blocks returned should be arbitrary but deterministic.

Specified by:

getNormalSuccessors in interface MinimalCFG<X>

Returns:

the basic blocks which may be reached from b via normal control flow

getExceptionalPredecessors

public Collection<T> getExceptionalPredecessors(T b)

Description copied from interface: MinimalCFG

The order of blocks returned should be arbitrary but deterministic.

Specified by:

getExceptionalPredecessors in interface MinimalCFG<X>

Returns:

the basic blocks from which b may be reached via exceptional control flow

getNormalPredecessors

public Collection<T> getNormalPredecessors(T b)

Description copied from interface: MinimalCFG

The order of blocks returned should be arbitrary but deterministic.

Specified by:

getNormalPredecessors in interface MinimalCFG<X>

Returns:

the basic blocks from which b may be reached via normal control flow