org.graalvm.compiler.nodes.calc

Class ZeroExtendNode

java.lang.Object

org.graalvm.compiler.graph.Node

org.graalvm.compiler.nodes.ValueNode

org.graalvm.compiler.nodes.calc.FloatingNode

org.graalvm.compiler.nodes.calc.UnaryNode

org.graalvm.compiler.nodes.calc.IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>

org.graalvm.compiler.nodes.calc.ZeroExtendNode

All Implemented Interfaces:

Cloneable, Formattable, Node.IndirectCanonicalization, Node.ValueNumberable, CanonicalizableMarker, ArithmeticOperation, ConvertNode, ArithmeticLIRLowerable, Canonicalizable, Canonicalizable.Unary<ValueNode>, LIRLowerable, StampInverter, ValueNodeInterface

public final class ZeroExtendNode
extends IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>

The ZeroExtendNode converts an integer to a wider integer using zero extension. On all supported architectures, sub-word (<32 bit) operations generally do not yield performance improvements. They can even be slower than 32 bit operations. Thus, nodes extending <32 bit values to 32 bit or more should usually not be removed.

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<ZeroExtendNode>	TYPE

Fields inherited from class org.graalvm.compiler.nodes.calc.IntegerConvertNode

inputBits, resultBits

Fields inherited from class org.graalvm.compiler.nodes.calc.UnaryNode

value

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

Constructor and Description
ZeroExtendNode(ValueNode input, int resultBits)
ZeroExtendNode(ValueNode input, int inputBits, int resultBits, boolean inputAlwaysPositive)

Method Summary

Modifier and Type	Method and Description
ValueNode	canonical(CanonicalizerTool tool, ValueNode forValue) Similar to Canonicalizable.canonical(CanonicalizerTool), except that implementations should act as if the current input of the node was the given one, i.e., they should never look at the inputs via the this pointer.
static ValueNode	create(ValueNode input, int inputBits, int resultBits, NodeView view)
static ValueNode	create(ValueNode input, int inputBits, int resultBits, NodeView view, boolean alwaysPositive)
static ValueNode	create(ValueNode input, int resultBits, NodeView view)
void	generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)
protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>	getOp(ArithmeticOpTable table)
protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.Narrow>	getReverseOp(ArithmeticOpTable table)
boolean	isInputAlwaysPositive()
boolean	isLossless() Check whether a conversion is lossless.
boolean	mayNullCheckSkipConversion() Checks whether a null check may skip the conversion.
boolean	preservesOrder(CanonicalCondition cond) Check whether a conversion preserves comparison order.

Methods inherited from class org.graalvm.compiler.nodes.calc.IntegerConvertNode

convert, convert, convert, convert, convert, convert, convertUnsigned, convertUnsigned, findSynonym, foldStamp, getArithmeticOp, getInputBits, getResultBits, invertStamp, reverse

Methods inherited from class org.graalvm.compiler.nodes.calc.UnaryNode

getValue, inferStamp, setValue

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

asConstant, asJavaConstant, asNode, asSerializableConstant, checkReplaceAtUsagesInvariants, getStackKind, graph, hasUsagesOtherThan, 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, verify, 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.calc.ConvertNode

getValue, preservesOrder

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

asNode

Methods inherited from interface org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable

generate

Methods inherited from interface org.graalvm.compiler.nodes.spi.StampInverter

getValue

Methods inherited from interface org.graalvm.compiler.nodes.spi.Canonicalizable.Unary

canonical

Field Detail

TYPE

public static final NodeClass<ZeroExtendNode> TYPE

Constructor Detail

ZeroExtendNode

public ZeroExtendNode(ValueNode input,
                      int resultBits)

ZeroExtendNode

public ZeroExtendNode(ValueNode input,
                      int inputBits,
                      int resultBits,
                      boolean inputAlwaysPositive)

Method Detail

create

public static ValueNode create(ValueNode input,
                               int resultBits,
                               NodeView view)

create

public static ValueNode create(ValueNode input,
                               int inputBits,
                               int resultBits,
                               NodeView view)

create

public static ValueNode create(ValueNode input,
                               int inputBits,
                               int resultBits,
                               NodeView view,
                               boolean alwaysPositive)

getOp

protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.ZeroExtend> getOp(ArithmeticOpTable table)

Specified by:

getOp in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>

getReverseOp

protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.Narrow> getReverseOp(ArithmeticOpTable table)

Specified by:

getReverseOp in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>

isLossless

public boolean isLossless()

Description copied from interface: ConvertNode

Check whether a conversion is lossless.

Returns:

true iff reverse(convert(c)) == c for all c

isInputAlwaysPositive

public boolean isInputAlwaysPositive()

preservesOrder

public boolean preservesOrder(CanonicalCondition cond)

Description copied from interface: ConvertNode

Check whether a conversion preserves comparison order.

Parameters:

cond - a comparison operator

Returns:

true iff (c1 op c2) == (convert(c1) op convert(c2)) for all c1, c2

canonical

public ValueNode canonical(CanonicalizerTool tool,
                           ValueNode forValue)

Description copied from interface: Canonicalizable.Unary

Similar to Canonicalizable.canonical(CanonicalizerTool), except that implementations should act as if the current input of the node was the given one, i.e., they should never look at the inputs via the this pointer.

Specified by:

canonical in interface Canonicalizable.Unary<ValueNode>

Overrides:

canonical in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.ZeroExtend>

generate

public void generate(NodeLIRBuilderTool nodeValueMap,
                     ArithmeticLIRGeneratorTool gen)

mayNullCheckSkipConversion

public boolean mayNullCheckSkipConversion()

Description copied from interface: ConvertNode

Checks whether a null check may skip the conversion. This is true if in the conversion NULL is converted to NULL and if it is the only value converted to NULL.

Returns:

whether a null check may skip the conversion