com.ibm.wala.cfg

Interface MinimalCFG<T>

All Superinterfaces:

com.ibm.wala.util.graph.EdgeManager<T>, com.ibm.wala.util.graph.Graph<T>, java.lang.Iterable<T>, com.ibm.wala.util.graph.NodeManager<T>, com.ibm.wala.util.graph.NumberedEdgeManager<T>, com.ibm.wala.util.graph.NumberedGraph<T>, com.ibm.wala.util.graph.NumberedNodeManager<T>

All Known Subinterfaces:

ControlFlowGraph<I,T>

All Known Implementing Classes:

AbstractCFG, ExplodedControlFlowGraph, InducedCFG, MutableCFG, PrunedCFG, ShrikeCFG, SSACFG

public interface MinimalCFG<T>
extends com.ibm.wala.util.graph.NumberedGraph<T>

Method Summary

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

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

removeNodeAndEdges

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

getMaxNumber, getNode, getNumber, iterateNodes

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

addNode, containsNode, getNumberOfNodes, iterator, removeNode, stream

Methods inherited from interface java.lang.Iterable

forEach, spliterator

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

getPredNodeNumbers, getSuccNodeNumbers

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

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

Method Detail

entry

T entry()

Return the entry basic block in the CFG

exit

T exit()

Returns:

the synthetic exit block for the cfg

getExceptionalSuccessors

java.util.List<T> getExceptionalSuccessors(T b)

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.

Returns:

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

getNormalSuccessors

java.util.Collection<T> getNormalSuccessors(T b)

The order of blocks returned should be arbitrary but deterministic.

Returns:

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

getExceptionalPredecessors

java.util.Collection<T> getExceptionalPredecessors(T b)

The order of blocks returned should be arbitrary but deterministic.

Returns:

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

getNormalPredecessors

java.util.Collection<T> getNormalPredecessors(T b)

The order of blocks returned should be arbitrary but deterministic.

Returns:

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