public final class UnsignedMulHighNode extends BinaryNode implements ArithmeticLIRLowerable
Node.ConstantNodeParameter, Node.InjectedNodeParameter, Node.Input, Node.NodeIntrinsic, Node.OptionalInput, Node.Successor, Node.ValueNumberableCanonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Unary<T extends Node>| Modifier and Type | Field and Description |
|---|---|
static NodeClass<UnsignedMulHighNode> |
TYPE |
x, yNODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Constructor and Description |
|---|
UnsignedMulHighNode(IntegerStamp stamp,
ValueNode x,
ValueNode y) |
UnsignedMulHighNode(ValueNode x,
ValueNode y) |
| Modifier and Type | Method and Description |
|---|---|
ValueNode |
canonical(CanonicalizerTool tool,
ValueNode forX,
ValueNode forY)
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. |
void |
generate(NodeValueMap nodeValueMap,
ArithmeticLIRGenerator gen) |
boolean |
inferStamp()
This method can be overridden by subclasses of
ValueNode if they need to recompute
their stamp if their inputs change. |
static int |
multiplyHighUnsigned(int x,
int y) |
static long |
multiplyHighUnsigned(long x,
long y) |
private <T> T |
processExtremes(ValueNode forX,
ValueNode forY,
BiFunction<Long,Long,T> op)
Determines the minimum and maximum result of this node for the given inputs and returns the
result of the given BiFunction on the minimum and maximum values.
|
getX, getY, setX, setYasNodeasConstant, asJavaConstant, getKind, graph, isAllowedUsageType, isConstant, isConstantPredicate, isNullConstant, setStamp, stamp, updateStampacceptInputs, acceptSuccessors, afterClone, assertFalse, assertTrue, cfgPredecessors, cfgSuccessors, clearInputs, clearSuccessors, copyWithInputs, copyWithInputs, equals, fail, formatTo, getDebugProperties, getDebugProperties, getId, getNodeClass, getUsageAt, getUsageCount, hashCode, hasNoUsages, hasUsages, inputs, isAlive, isDeleted, markDeleted, modCount, newIdentityMap, newIdentityMap, newIdentityMap, newMap, newMap, newMap, newSet, newSet, predecessor, pushInputs, removeUsage, replaceAndDelete, replaceAtMatchingUsages, replaceAtPredecessor, replaceAtUsages, replaceAtUsages, replaceAtUsages, replaceFirstInput, replaceFirstSuccessor, safeDelete, simplify, successors, toString, toString, updatePredecessor, updateUsages, updateUsagesInterface, usages, valueEquals, verify, verifyEdges, verifyInputsclone, finalize, getClass, notify, notifyAll, wait, wait, waitcanonicalpublic static final NodeClass<UnsignedMulHighNode> TYPE
public UnsignedMulHighNode(ValueNode x, ValueNode y)
public UnsignedMulHighNode(IntegerStamp stamp, ValueNode x, ValueNode y)
private <T> T processExtremes(ValueNode forX, ValueNode forY, BiFunction<Long,Long,T> op)
public boolean inferStamp()
ValueNodeValueNode if they need to recompute
their stamp if their inputs change. A typical implementation will compute the stamp and pass
it to ValueNode.updateStamp(Stamp), whose return value can be used as the result of this
method.inferStamp in class ValueNodepublic ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY)
Canonicalizable.BinaryCanonicalizable.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.Binary<ValueNode>public void generate(NodeValueMap nodeValueMap, ArithmeticLIRGenerator gen)
generate in interface ArithmeticLIRLowerablepublic static int multiplyHighUnsigned(int x, int y)
public static long multiplyHighUnsigned(long x, long y)