org.graalvm.compiler.nodes

Class ProxyNode

java.lang.Object

org.graalvm.compiler.graph.Node

org.graalvm.compiler.nodes.ValueNode

org.graalvm.compiler.nodes.calc.FloatingNode

org.graalvm.compiler.nodes.ProxyNode

All Implemented Interfaces:

Cloneable, Formattable, Node.ValueNumberable, CanonicalizableMarker, Canonicalizable, Proxy, ValueNodeInterface

Direct Known Subclasses:

GuardProxyNode, MemoryProxyNode, ValueProxyNode

public abstract class ProxyNode
extends FloatingNode
implements Proxy, Node.ValueNumberable, Canonicalizable

A proxy is inserted at loop exits for any value that is created inside the loop (i.e. was not live on entry to the loop) and is (potentially) used after the loop.

Nested Class Summary

Nested classes/interfaces inherited from class org.graalvm.compiler.graph.Node

Node.ConstantNodeParameter, Node.EdgeVisitor, Node.IndirectCanonicalization, Node.InjectedNodeParameter, Node.Input, Node.NodeInsertionStackTrace, Node.NodeIntrinsic, Node.NodeIntrinsicFactory, Node.OptionalInput, Node.Successor, Node.ValueNumberable

Nested classes/interfaces inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable

Canonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Ternary<T extends Node>, Canonicalizable.Unary<T extends Node>

Field Summary

Fields

Modifier and Type	Field and Description
static NodeClass<ProxyNode>	TYPE

Fields inherited from class org.graalvm.compiler.nodes.ValueNode

EMPTY_ARRAY, stamp

Fields inherited from class org.graalvm.compiler.graph.Node

NODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	ProxyNode(NodeClass<? extends ProxyNode> c, Stamp stamp, LoopExitNode proxyPoint)

Method Summary

Modifier and Type	Method and Description
Node	canonical(CanonicalizerTool tool) Implementations of this method can provide local optimizations like constant folding and strength reduction.
abstract PhiNode	createPhi(AbstractMergeNode merge)
abstract ProxyNode	duplicateOn(LoopExitNode newProxyPoint, ValueNode newOriginalNode)
static GuardProxyNode	forGuard(GuardingNode value, LoopExitNode exit)
static MemoryProxyNode	forMemory(MemoryKill value, LoopExitNode exit, org.graalvm.word.LocationIdentity locationIdentity)
static ValueProxyNode	forValue(ValueNode value, LoopExitNode exit)
ValueNode	getOriginalNode()
LoopExitNode	proxyPoint()
void	setProxyPoint(LoopExitNode newProxyPoint)
abstract ValueNode	value()
boolean	verify()

Methods inherited from class org.graalvm.compiler.nodes.ValueNode

asConstant, asJavaConstant, asNode, asSerializableConstant, checkReplaceAtUsagesInvariants, getStackKind, graph, hasUsagesOtherThan, inferStamp, isAllowedUsageType, isConstant, isConstantPredicate, isDefaultConstant, isIllegalConstant, isJavaConstant, isNullConstant, isSerializableConstant, recursivelyDataFlowEqualsUpTo, setStamp, stamp, updateStamp, updateUsagesInterface

Methods inherited from class org.graalvm.compiler.graph.Node

afterClone, applyInputs, applySuccessors, assertFalse, assertTrue, cfgPredecessors, cfgSuccessors, clearInputs, clearNodeSourcePosition, clearSuccessors, copyWithInputs, copyWithInputs, dataFlowEquals, dynamicNodeSizeEstimate, estimatedNodeCycles, estimatedNodeSize, fail, formatTo, getCreationPosition, getDebug, getDebugProperties, getDebugProperties, getInsertionPosition, getNodeClass, getNodeSourcePosition, getOptions, getUsageCount, hasExactlyOneUsage, hashCode, hasMoreThanOneUsage, hasNoUsages, hasOnlyUsagesOfType, hasUsages, hasUsagesOfType, inputPositions, inputs, isAlive, isDeleted, isUnregistered, markDeleted, maybeNotifyZeroUsages, modCount, predecessor, pushInputs, removeUsage, replaceAllInputs, replaceAndDelete, replaceAtAllUsages, replaceAtMatchingUsages, replaceAtPredecessor, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceAtUsagesAndDelete, replaceAtUsagesAndDelete, replaceFirstInput, replaceFirstSuccessor, safeDelete, setCreationPosition, setInsertionPosition, setNodeSourcePosition, singleUsage, successorPositions, successors, toString, toString, updateNodeSourcePosition, updatePredecessor, updateUsages, usages, valueEquals, verifyEdges, verifyInputs, verifySourcePosition, withNodeSourcePosition

Methods inherited from class java.lang.Object

clone, equals, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface org.graalvm.compiler.nodes.ValueNodeInterface

asNode

Field Detail

TYPE

public static final NodeClass<ProxyNode> TYPE

Constructor Detail

ProxyNode

protected ProxyNode(NodeClass<? extends ProxyNode> c,
                    Stamp stamp,
                    LoopExitNode proxyPoint)

Method Detail

value

public abstract ValueNode value()

setProxyPoint

public void setProxyPoint(LoopExitNode newProxyPoint)

proxyPoint

public LoopExitNode proxyPoint()

getOriginalNode

public ValueNode getOriginalNode()

Specified by:

getOriginalNode in interface Proxy

verify

public boolean verify()

Overrides:

verify in class Node

forValue

public static ValueProxyNode forValue(ValueNode value,
                                      LoopExitNode exit)

forGuard

public static GuardProxyNode forGuard(GuardingNode value,
                                      LoopExitNode exit)

forMemory

public static MemoryProxyNode forMemory(MemoryKill value,
                                        LoopExitNode exit,
                                        org.graalvm.word.LocationIdentity locationIdentity)

canonical

public Node canonical(CanonicalizerTool tool)

Description copied from interface: Canonicalizable

Implementations of this method can provide local optimizations like constant folding and strength reduction. Implementations should look at the properties and inputs of the current node and determine if there is a more optimal and always semantically correct replacement.
The return value determines the effect that the canonicalization will have:

• Returning an pre-existing node will replace the current node with the given one.
• Returning a newly created node (that was not yet added to the graph) will replace the current node with the given one, after adding it to the graph. If both the replacement and the replacee are anchored in control flow (fixed nodes), the replacement will be added to the control flow. It is invalid to replace a non-fixed node with a newly created fixed node (because its placement in the control flow cannot be determined without scheduling).
• Returning null will delete the current node and replace it with null at all usages. Note that it is not necessary to delete floating nodes that have no more usages this way - they will be deleted automatically.

Specified by:

canonical in interface Canonicalizable

Parameters:

tool - provides access to runtime interfaces like MetaAccessProvider

createPhi

public abstract PhiNode createPhi(AbstractMergeNode merge)

duplicateOn

public abstract ProxyNode duplicateOn(LoopExitNode newProxyPoint,
                                      ValueNode newOriginalNode)