public final class NarrowNode extends IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.Narrow>
NarrowNode converts an integer to a narrower integer.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<NarrowNode> |
TYPE |
inputBits, resultBitsEMPTY_ARRAY, stampNODE_LIST, NOT_ITERABLE, TRACK_CREATION_POSITION, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Constructor and Description |
|---|
NarrowNode(ValueNode input,
int resultBits) |
NarrowNode(ValueNode input,
int inputBits,
int resultBits) |
| 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 resultBits,
NodeView view) |
void |
generate(NodeLIRBuilderTool nodeValueMap,
ArithmeticLIRGeneratorTool gen) |
protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.Narrow> |
getOp(ArithmeticOpTable table) |
protected ArithmeticOpTable.IntegerConvertOp<?> |
getReverseOp(ArithmeticOpTable table) |
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.
|
convert, convert, convert, convert, convert, convert, convertUnsigned, convertUnsigned, findSynonym, foldStamp, getArithmeticOp, getInputBits, getResultBits, invertStamp, reversegetValue, 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, waitgetValue, preservesOrderasNodegenerategetValuecanonicalpublic static final NodeClass<NarrowNode> TYPE
public NarrowNode(ValueNode input, int resultBits)
public NarrowNode(ValueNode input, int inputBits, int resultBits)
public static ValueNode create(ValueNode input, int inputBits, int resultBits, NodeView view)
protected ArithmeticOpTable.IntegerConvertOp<ArithmeticOpTable.IntegerConvertOp.Narrow> getOp(ArithmeticOpTable table)
getOp in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.Narrow>protected ArithmeticOpTable.IntegerConvertOp<?> getReverseOp(ArithmeticOpTable table)
getReverseOp in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.Narrow>public boolean isLossless()
ConvertNodepublic boolean preservesOrder(CanonicalCondition cond)
ConvertNodecond - a comparison operatorpublic 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>canonical in class IntegerConvertNode<ArithmeticOpTable.IntegerConvertOp.Narrow>public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)
public boolean mayNullCheckSkipConversion()
ConvertNode