com.oracle.graal.nodes.cfg

Class ControlFlowGraph

java.lang.Object

com.oracle.graal.nodes.cfg.ControlFlowGraph

All Implemented Interfaces:

AbstractControlFlowGraph<Block>

public class ControlFlowGraph
extends Object
implements AbstractControlFlowGraph<Block>

Field Summary

Fields

Modifier and Type	Field and Description
StructuredGraph	graph
private List<Loop<Block>>	loops
static double	MIN_PROBABILITY Don't allow probability values to be become too small as this makes frequency calculations large enough that they can overflow the range of a double.
private NodeMap<Block>	nodeToBlock
private List<Block>	reversePostOrder

Fields inherited from interface com.oracle.graal.compiler.common.cfg.AbstractControlFlowGraph

BLOCK_ID_INITIAL, BLOCK_ID_VISITED

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	ControlFlowGraph(StructuredGraph graph)

Method Summary

Modifier and Type	Method and Description
private static void	addBranchToLoop(Loop<Block> l, Block b)
Block	blockFor(Node node)
private static Block	commonPostdominator(Block a, Block b)
static ControlFlowGraph	compute(StructuredGraph graph, boolean connectBlocks, boolean computeLoops, boolean computeDominators, boolean computePostdominators)
private static void	computeLoopBlocks(Block ablock, Loop<Block> aloop)
private void	computeLoopInformation()
void	computePostdominators()
private void	connectBlocks()
double	frequencyFor(FixedNode node)
List<Block>	getBlocks() Returns the list blocks contained in this control flow graph.
List<Loop<Block>>	getLoops()
NodeMap<Block>	getNodeToBlock()
Block	getStartBlock()
private void	identifyBlock(Block block)
private void	identifyBlocks()
Iterable<Block>	postOrder()
Iterable<Block>	reversePostOrder()
void	setNodeToBlock(NodeMap<Block> nodeMap)

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.oracle.graal.compiler.common.cfg.AbstractControlFlowGraph

calcDominatorRanges, commonDominator, commonDominatorHelper, commonDominatorRaw, commonDominatorRawSameDepth, commonDominatorTyped, computeDominators, dominates, isDominatedBy, strictlyDominates

Field Detail

MIN_PROBABILITY

public static final double MIN_PROBABILITY

Don't allow probability values to be become too small as this makes frequency calculations large enough that they can overflow the range of a double. This commonly happens with infinite loops within infinite loops.

See Also:

Constant Field Values

graph

public final StructuredGraph graph

nodeToBlock

private NodeMap<Block> nodeToBlock

reversePostOrder

private List<Block> reversePostOrder

loops

private List<Loop<Block>> loops

Constructor Detail

ControlFlowGraph

protected ControlFlowGraph(StructuredGraph graph)

Method Detail

compute

public static ControlFlowGraph compute(StructuredGraph graph,
                                       boolean connectBlocks,
                                       boolean computeLoops,
                                       boolean computeDominators,
                                       boolean computePostdominators)

getBlocks

public List<Block> getBlocks()

Description copied from interface: AbstractControlFlowGraph

Returns the list blocks contained in this control flow graph. It is guaranteed that the blocks are numbered and ordered according to a reverse post order traversal of the control flow graph.

Specified by:

getBlocks in interface AbstractControlFlowGraph<Block>

See Also:

CFGVerifier

getStartBlock

public Block getStartBlock()

Specified by:

getStartBlock in interface AbstractControlFlowGraph<Block>

reversePostOrder

public Iterable<Block> reversePostOrder()

postOrder

public Iterable<Block> postOrder()

getNodeToBlock

public NodeMap<Block> getNodeToBlock()

blockFor

public Block blockFor(Node node)

frequencyFor

public double frequencyFor(FixedNode node)

getLoops

public List<Loop<Block>> getLoops()

Specified by:

getLoops in interface AbstractControlFlowGraph<Block>

identifyBlock

private void identifyBlock(Block block)

identifyBlocks

private void identifyBlocks()

connectBlocks

private void connectBlocks()

computeLoopInformation

private void computeLoopInformation()

addBranchToLoop

private static void addBranchToLoop(Loop<Block> l,
                                    Block b)

computeLoopBlocks

private static void computeLoopBlocks(Block ablock,
                                      Loop<Block> aloop)

computePostdominators

public void computePostdominators()

commonPostdominator

private static Block commonPostdominator(Block a,
                                         Block b)

setNodeToBlock

public void setNodeToBlock(NodeMap<Block> nodeMap)