org.graalvm.compiler.replacements.nodes

Class ArrayEqualsNode

java.lang.Object

org.graalvm.compiler.graph.Node

org.graalvm.compiler.nodes.ValueNode

org.graalvm.compiler.nodes.FixedNode

org.graalvm.compiler.nodes.FixedWithNextNode

org.graalvm.compiler.replacements.nodes.ArrayEqualsNode

All Implemented Interfaces:

Cloneable, Formattable, CanonicalizableMarker, FixedNodeInterface, FixedWithNextNodeInterface, MemoryAccess, Canonicalizable, LIRLowerable, Virtualizable, ValueNodeInterface

public class ArrayEqualsNode
extends FixedWithNextNode
implements LIRLowerable, Canonicalizable, Virtualizable, MemoryAccess

Compares two arrays with the same length.

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
protected ValueNode	array1 One array to be tested for equality.
protected ValueNode	array2 The other array to be tested for equality.
protected JavaKind	kind JavaKind of the arrays to compare.
protected ValueNode	length Length of both arrays.
static NodeClass<ArrayEqualsNode>	TYPE

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

next

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	ArrayEqualsNode(NodeClass<? extends ArrayEqualsNode> c, ValueNode array1, ValueNode array2, ValueNode length, JavaKind kind)
	ArrayEqualsNode(ValueNode array1, ValueNode array2, ValueNode length, JavaKind kind)

Method Summary

Modifier and Type	Method and Description
protected static boolean	arrayEquals(ConstantReflectionProvider constantReflection, JavaConstant a, int startIndexA, JavaConstant b, int startIndexB, int len)
Node	canonical(CanonicalizerTool tool) Implementations of this method can provide local optimizations like constant folding and strength reduction.
static boolean	equals(Object array1, Object array2, int length, JavaKind kind)
void	generate(NodeLIRBuilderTool gen)
protected void	generateArrayEquals(NodeLIRBuilderTool gen)
ValueNode	getArray1()
ValueNode	getArray2()
JavaKind	getKind()
MemoryKill	getLastLocationAccess()
ValueNode	getLength()
org.graalvm.word.LocationIdentity	getLocationIdentity()
void	setLastLocationAccess(MemoryKill lla)
void	virtualize(VirtualizerTool tool) A node class can implement this method to convey information about what its effect would be if some of its inputs were virtualized.

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

asFixedWithNextNode, next, setNext

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

asFixedNode, 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

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

asFixedNode

Field Detail

TYPE

public static final NodeClass<ArrayEqualsNode> TYPE

kind

protected final JavaKind kind

JavaKind of the arrays to compare. The arrays are guaranteed to always have the same kind because the signature of Arrays.equals(long[], long[]) only allows arrays of the same kind.

array1

protected ValueNode array1

One array to be tested for equality.

array2

protected ValueNode array2

The other array to be tested for equality.

length

protected ValueNode length

Length of both arrays.

Constructor Detail

ArrayEqualsNode

public ArrayEqualsNode(ValueNode array1,
                       ValueNode array2,
                       ValueNode length,
                       JavaKind kind)

ArrayEqualsNode

protected ArrayEqualsNode(NodeClass<? extends ArrayEqualsNode> c,
                          ValueNode array1,
                          ValueNode array2,
                          ValueNode length,
                          JavaKind kind)

Method Detail

arrayEquals

protected static boolean arrayEquals(ConstantReflectionProvider constantReflection,
                                     JavaConstant a,
                                     int startIndexA,
                                     JavaConstant b,
                                     int startIndexB,
                                     int len)

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

virtualize

public void virtualize(VirtualizerTool tool)

Description copied from interface: Virtualizable

A node class can implement this method to convey information about what its effect would be if some of its inputs were virtualized. All modifications must be made through the supplied tool, and not directly on the node, because by the time this method is called the virtualized/non-virtualized state is still speculative and might not hold because of loops, etc.

Specified by:

virtualize in interface Virtualizable

Parameters:

tool - the tool used to describe the effects of this node

equals

public static boolean equals(Object array1,
                             Object array2,
                             int length,
                             JavaKind kind)

getArray1

public ValueNode getArray1()

getArray2

public ValueNode getArray2()

getLength

public ValueNode getLength()

getKind

public JavaKind getKind()

generate

public void generate(NodeLIRBuilderTool gen)

Specified by:

generate in interface LIRLowerable

generateArrayEquals

protected void generateArrayEquals(NodeLIRBuilderTool gen)

getLocationIdentity

public org.graalvm.word.LocationIdentity getLocationIdentity()

Specified by:

getLocationIdentity in interface MemoryAccess

getLastLocationAccess

public MemoryKill getLastLocationAccess()

Specified by:

getLastLocationAccess in interface MemoryAccess

Returns:

a MemoryKill that represents the last memory state in the memory graph for the LocationIdentity returned by MemoryAccess.getLocationIdentity()

setLastLocationAccess

public void setLastLocationAccess(MemoryKill lla)

Specified by:

setLastLocationAccess in interface MemoryAccess

Parameters:

lla - the MemoryKill that represents the last kill of the LocationIdentity returned by MemoryAccess.getLocationIdentity()