public final class ReinterpretNode extends UnaryNode implements ArithmeticOperation, ArithmeticLIRLowerable
ReinterpretNode class represents a reinterpreting conversion that changes the stamp
of a primitive value to some other incompatible stamp. The new stamp must have the same width as
the old stamp.Node.ConstantNodeParameter, Node.EdgeVisitor, Node.IndirectCanonicalization, Node.InjectedNodeParameter, Node.Input, Node.NodeInsertionStackTrace, Node.NodeIntrinsic, Node.NodeIntrinsicFactory, Node.OptionalInput, Node.Successor, Node.ValueNumberableCanonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Ternary<T extends Node>, Canonicalizable.Unary<T extends Node>| Modifier and Type | Field and Description |
|---|---|
static NodeClass<ReinterpretNode> |
TYPE |
EMPTY_ARRAY, stampNODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Constructor and Description |
|---|
ReinterpretNode(JavaKind to,
ValueNode value) |
| 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 |
canonical(ReinterpretNode node,
Stamp forStamp,
ValueNode forValue,
NodeView view) |
static ValueNode |
create(JavaKind to,
ValueNode value,
NodeView view) |
Stamp |
foldStamp(Stamp newStamp)
Compute an improved for this node using the passed in stamp.
|
void |
generate(NodeLIRBuilderTool builder,
ArithmeticLIRGeneratorTool gen) |
ArithmeticOpTable.ReinterpretOp |
getArithmeticOp() |
static ValueNode |
reinterpret(JavaKind toKind,
ValueNode value) |
getValue, inferStamp, setValueasConstant, asJavaConstant, asNode, asSerializableConstant, checkReplaceAtUsagesInvariants, getStackKind, graph, hasUsagesOtherThan, isAllowedUsageType, isConstant, isConstantPredicate, isDefaultConstant, isIllegalConstant, isJavaConstant, isNullConstant, isSerializableConstant, recursivelyDataFlowEqualsUpTo, setStamp, stamp, updateStamp, updateUsagesInterfaceafterClone, 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, withNodeSourcePositionclone, equals, getClass, notify, notifyAll, wait, wait, waitgeneratecanonicalpublic static final NodeClass<ReinterpretNode> TYPE
public ReinterpretNode(JavaKind to,
ValueNode value)
public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue)
Canonicalizable.UnaryCanonicalizable.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.canonical in interface Canonicalizable.Unary<ValueNode>public static ValueNode canonical(ReinterpretNode node, Stamp forStamp, ValueNode forValue, NodeView view)
public Stamp foldStamp(Stamp newStamp)
UnaryNodeUnaryNode.value. This code is used to provide the default
implementation of UnaryNode.inferStamp() and may be used by external optimizations.public void generate(NodeLIRBuilderTool builder, ArithmeticLIRGeneratorTool gen)
generate in interface ArithmeticLIRLowerablepublic ArithmeticOpTable.ReinterpretOp getArithmeticOp()
getArithmeticOp in interface ArithmeticOperation