org.graalvm.compiler.nodes.loop

Class LoopFragment

java.lang.Object

org.graalvm.compiler.nodes.loop.LoopFragment

Direct Known Subclasses:

LoopFragmentInside, LoopFragmentWhole

public abstract class LoopFragment
extends Object

Field Summary

Fields

Modifier and Type	Field and Description
protected NodeBitMap	nodes
protected boolean	nodesReady

Constructor Summary

Constructors

Constructor and Description
LoopFragment(LoopEx loop)
LoopFragment(LoopEx loop, LoopFragment original)

Method Summary

Modifier and Type	Method and Description
protected abstract void	beforeDuplication()
protected static void	computeNodes(NodeBitMap nodes, Graph graph, LoopEx loop, Iterable<AbstractBeginNode> blocks, Iterable<AbstractBeginNode> earlyExits)
boolean	contains(Node n)
void	disconnect()
abstract LoopFragment	duplicate()
protected void	finishDuplication()
<New extends Node,Old extends New> New	getDuplicatedNode(Old n)
protected abstract Graph.DuplicationReplacement	getDuplicationReplacement()
StructuredGraph	graph()
abstract void	insertBefore(LoopEx l)
boolean	isDuplicate()
LoopEx	loop() Return the original LoopEx for this fragment.
protected void	mergeEarlyExits() Merges the early exits (i.e.
abstract NodeBitMap	nodes()
LoopFragment	original()
protected void	patchNodes(Graph.DuplicationReplacement dataFix)
protected abstract ValueNode	prim(ValueNode b) Gets the corresponding value in this fragment.
protected <New extends Node,Old extends New> void	putDuplicatedNode(Old oldNode, New newNode)
org.graalvm.collections.EconomicMap<Node,Node>	reverseDuplicationMap()
static NodeIterable<AbstractBeginNode>	toHirBlocks(Iterable<Block> blocks)

Methods inherited from class java.lang.Object

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

Field Detail

nodes

protected NodeBitMap nodes

nodesReady

protected boolean nodesReady

Constructor Detail

LoopFragment

public LoopFragment(LoopEx loop)

LoopFragment

public LoopFragment(LoopEx loop,
                    LoopFragment original)

Method Detail

loop

public LoopEx loop()

Return the original LoopEx for this fragment. For duplicated fragments this returns null.

duplicate

public abstract LoopFragment duplicate()

insertBefore

public abstract void insertBefore(LoopEx l)

disconnect

public void disconnect()

contains

public boolean contains(Node n)

getDuplicatedNode

public <New extends Node,Old extends New> New getDuplicatedNode(Old n)

putDuplicatedNode

protected <New extends Node,Old extends New> void putDuplicatedNode(Old oldNode,
                                                                    New newNode)

reverseDuplicationMap

public org.graalvm.collections.EconomicMap<Node,Node> reverseDuplicationMap()

prim

protected abstract ValueNode prim(ValueNode b)

Gets the corresponding value in this fragment. Should be called on duplicate fragments with a node from the original fragment as argument.

Parameters:

b - original value

Returns:

corresponding value in the peel

isDuplicate

public boolean isDuplicate()

original

public LoopFragment original()

nodes

public abstract NodeBitMap nodes()

graph

public StructuredGraph graph()

getDuplicationReplacement

protected abstract Graph.DuplicationReplacement getDuplicationReplacement()

beforeDuplication

protected abstract void beforeDuplication()

finishDuplication

protected void finishDuplication()

patchNodes

protected void patchNodes(Graph.DuplicationReplacement dataFix)

computeNodes

protected static void computeNodes(NodeBitMap nodes,
                                   Graph graph,
                                   LoopEx loop,
                                   Iterable<AbstractBeginNode> blocks,
                                   Iterable<AbstractBeginNode> earlyExits)

toHirBlocks

public static NodeIterable<AbstractBeginNode> toHirBlocks(Iterable<Block> blocks)

mergeEarlyExits

protected void mergeEarlyExits()

Merges the early exits (i.e. loop exits) that were duplicated as part of this fragment, with the original fragment's exits.