com.oracle.graal.phases.graph

Class PostOrderNodeIterator<T extends MergeableState<T>>

java.lang.Object

com.oracle.graal.phases.graph.PostOrderNodeIterator<T>

Type Parameters:

T - the type of MergeableState handled by this PostOrderNodeIterator

public abstract class PostOrderNodeIterator<T extends MergeableState<T>>
extends Object

A PostOrderNodeIterator iterates the fixed nodes of the graph in post order starting from a specified fixed node.

For this iterator the CFG is defined by the classical CFG nodes (ControlSplitNode, AbstractMergeNode...) and the next pointers of FixedWithNextNode.

While iterating it maintains a user-defined state by calling the methods available in MergeableState.

Field Summary

Fields

Modifier and Type	Field and Description
private Deque<AbstractBeginNode>	nodeQueue
private Map<FixedNode,T>	nodeStates
private FixedNode	start
protected T	state
private NodeBitMap	visitedEnds

Constructor Summary

Constructors

Constructor and Description
PostOrderNodeIterator(FixedNode start, T initialState)

Method Summary

Modifier and Type	Method and Description
void	apply()
protected Set<Node>	controlSplit(ControlSplitNode controlSplit)
protected void	end(EndNode endNode)
protected void	finished()
private void	finishLoopEnds(LoopEndNode end)
protected void	invoke(Invoke invoke)
protected void	loopBegin(LoopBeginNode loopBegin)
protected void	loopEnd(LoopEndNode loopEnd)
protected void	merge(AbstractMergeNode merge)
private FixedNode	nextQueuedNode()
protected abstract void	node(FixedNode node)
private void	queueMerge(EndNode end)
private void	queueSuccessors(FixedNode x, Set<Node> successors)

Methods inherited from class java.lang.Object

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

Field Detail

visitedEnds

private final NodeBitMap visitedEnds

nodeQueue

private final Deque<AbstractBeginNode> nodeQueue

nodeStates

private final Map<FixedNode,T extends MergeableState<T>> nodeStates

start

private final FixedNode start

state

protected T extends MergeableState<T> state

Constructor Detail

PostOrderNodeIterator

public PostOrderNodeIterator(FixedNode start,
                             T initialState)

Method Detail

apply

public void apply()

queueSuccessors

private void queueSuccessors(FixedNode x,
                             Set<Node> successors)

nextQueuedNode

private FixedNode nextQueuedNode()

finishLoopEnds

private void finishLoopEnds(LoopEndNode end)

queueMerge

private void queueMerge(EndNode end)

node

protected abstract void node(FixedNode node)

end

protected void end(EndNode endNode)

merge

protected void merge(AbstractMergeNode merge)

loopBegin

protected void loopBegin(LoopBeginNode loopBegin)

loopEnd

protected void loopEnd(LoopEndNode loopEnd)

controlSplit

protected Set<Node> controlSplit(ControlSplitNode controlSplit)

invoke

protected void invoke(Invoke invoke)

finished

protected void finished()