org.graalvm.compiler.nodes.loop

Class LoopFragmentInside

java.lang.Object

org.graalvm.compiler.nodes.loop.LoopFragment

org.graalvm.compiler.nodes.loop.LoopFragmentInside

Direct Known Subclasses:

LoopFragmentInsideBefore, LoopFragmentInsideFrom

public class LoopFragmentInside
extends LoopFragment

Field Summary

Fields inherited from class org.graalvm.compiler.nodes.loop.LoopFragment

nodes, nodesReady

Constructor Summary

Constructors

Constructor and Description
LoopFragmentInside(LoopEx loop)
LoopFragmentInside(LoopFragmentInside original)

Method Summary

Modifier and Type	Method and Description
void	appendInside(LoopEx loop)
protected void	beforeDuplication()
LoopFragmentInside	duplicate()
NodeIterable<LoopExitNode>	exits()
protected static EndNode	getBlockEnd(FixedNode node)
protected Graph.DuplicationReplacement	getDuplicationReplacement()
org.graalvm.collections.EconomicMap<PhiNode,PhiNode>	getOld2NewPhi()
void	insertBefore(LoopEx loop)
void	insertWithinAfter(LoopEx loop, org.graalvm.collections.EconomicMap<LoopBeginNode,OpaqueNode> opaqueUnrolledStrides) Duplicate the body within the loop after the current copy copy of the body, updating the iteration limit to account for the duplication.
LoopEx	loop() Return the original LoopEx for this fragment.
protected void	mergeEarlyLoopExits(StructuredGraph graph, LoopBeginNode mainLoopBegin, CountedLoopInfo mainCounted, org.graalvm.collections.EconomicMap<Node,Node> new2OldPhis, LoopEx loop) For counted loops we have a special nomenclature regarding loop exits, the counted loop exit is the regular loop exit after all iterations finished, all other loop exits exit the loop earlier, thus we call them early exits.
NodeBitMap	nodes()
LoopFragmentInside	original()
static ValueNode	partialUnrollOverflowCheck(OpaqueNode opaque, ValueNode limit, CountedLoopInfo counted)
static ValueNode	patchProxyAtPhi(PhiNode phi, LoopExitNode lex, ValueNode proxyInput)
protected CompareNode	placeNewSegmentAndCleanup(LoopEx loop, org.graalvm.collections.EconomicMap<Node,Node> new2OldPhis, org.graalvm.collections.EconomicMap<Node,Node> originalPhi2Backedges)
protected ValueNode	prim(ValueNode b) Gets the corresponding value in this fragment.
protected ValueNode	primAfter(ValueNode b)

Methods inherited from class org.graalvm.compiler.nodes.loop.LoopFragment

computeNodes, contains, disconnect, finishDuplication, getDuplicatedNode, graph, isDuplicate, mergeEarlyExits, patchNodes, putDuplicatedNode, reverseDuplicationMap, toHirBlocks

Methods inherited from class java.lang.Object

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

Constructor Detail

LoopFragmentInside

public LoopFragmentInside(LoopEx loop)

LoopFragmentInside

public LoopFragmentInside(LoopFragmentInside original)

Method Detail

duplicate

public LoopFragmentInside duplicate()

Specified by:

duplicate in class LoopFragment

original

public LoopFragmentInside original()

Overrides:

original in class LoopFragment

appendInside

public void appendInside(LoopEx loop)

loop

public LoopEx loop()

Description copied from class: LoopFragment

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

Overrides:

loop in class LoopFragment

insertBefore

public void insertBefore(LoopEx loop)

Specified by:

insertBefore in class LoopFragment

insertWithinAfter

public void insertWithinAfter(LoopEx loop,
                              org.graalvm.collections.EconomicMap<LoopBeginNode,OpaqueNode> opaqueUnrolledStrides)

Duplicate the body within the loop after the current copy copy of the body, updating the iteration limit to account for the duplication.

partialUnrollOverflowCheck

public static ValueNode partialUnrollOverflowCheck(OpaqueNode opaque,
                                                   ValueNode limit,
                                                   CountedLoopInfo counted)

placeNewSegmentAndCleanup

protected CompareNode placeNewSegmentAndCleanup(LoopEx loop,
                                                org.graalvm.collections.EconomicMap<Node,Node> new2OldPhis,
                                                org.graalvm.collections.EconomicMap<Node,Node> originalPhi2Backedges)

mergeEarlyLoopExits

protected void mergeEarlyLoopExits(StructuredGraph graph,
                                   LoopBeginNode mainLoopBegin,
                                   CountedLoopInfo mainCounted,
                                   org.graalvm.collections.EconomicMap<Node,Node> new2OldPhis,
                                   LoopEx loop)

For counted loops we have a special nomenclature regarding loop exits, the counted loop exit is the regular loop exit after all iterations finished, all other loop exits exit the loop earlier, thus we call them early exits. Merge early, non-counted, loop exits of the loop for unrolling, this currently requires value proxies to properly proxy all values along the way. Unrolling loops with multiple exits is special in the way the exits are handled. Pre-Main-Post creation will merge them.

patchProxyAtPhi

public static ValueNode patchProxyAtPhi(PhiNode phi,
                                        LoopExitNode lex,
                                        ValueNode proxyInput)

getBlockEnd

protected static EndNode getBlockEnd(FixedNode node)

nodes

public NodeBitMap nodes()

Specified by:

nodes in class LoopFragment

exits

public NodeIterable<LoopExitNode> exits()

getDuplicationReplacement

protected Graph.DuplicationReplacement getDuplicationReplacement()

Specified by:

getDuplicationReplacement in class LoopFragment

beforeDuplication

protected void beforeDuplication()

Specified by:

beforeDuplication in class LoopFragment

getOld2NewPhi

public org.graalvm.collections.EconomicMap<PhiNode,PhiNode> getOld2NewPhi()

prim

protected ValueNode prim(ValueNode b)

Gets the corresponding value in this fragment.

Specified by:

prim in class LoopFragment

Parameters:

b - original value

Returns:

corresponding value in the peel

primAfter

protected ValueNode primAfter(ValueNode b)