public final class IntegerMulExactNode extends MulNode implements IntegerExactArithmeticNode
ArithmeticException
in case the addition would overflow the 32 bit range.BinaryArithmeticNode.SerializableBinaryFunction<T>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<IntegerMulExactNode> |
TYPE |
getOpx, yNODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges| Constructor and Description |
|---|
IntegerMulExactNode(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. |
private ValueNode |
canonicalXconstant(ValueNode forX,
ValueNode forY) |
IntegerExactArithmeticSplitNode |
createSplit(AbstractBeginNode next,
AbstractBeginNode deopt) |
boolean |
inferStamp()
This method can be overridden by subclasses of
ValueNode if they need to recompute
their stamp if their inputs change. |
void |
lower(LoweringTool tool)
Expand this node into lower level nodes expressing the same semantics.
|
add, add, getOp, isAssociative, livesLonger, maybeCommuteInputs, mul, mul, reassociate, sub, sub, tryConstantFoldgetX, 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, waitisNarrowablemaybeCommuteInputscanonical, getX, getYpublic static final NodeClass<IntegerMulExactNode> TYPE
public IntegerMulExactNode(ValueNode x, ValueNode y)
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 BinaryArithmeticNode<ArithmeticOpTable.BinaryOp.Mul>public 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>canonical in class MulNodeprivate ValueNode canonicalXconstant(ValueNode forX, ValueNode forY)
public IntegerExactArithmeticSplitNode createSplit(AbstractBeginNode next, AbstractBeginNode deopt)
createSplit in interface IntegerExactArithmeticNodepublic void lower(LoweringTool tool)
Lowerable