public final class IntegerAddExactNode extends AddNode 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.ValueNumberable
Canonicalizable.Binary<T extends Node>, Canonicalizable.BinaryCommutative<T extends Node>, Canonicalizable.Unary<T extends Node>
Modifier and Type | Field and Description |
---|---|
static NodeClass<IntegerAddExactNode> |
TYPE |
getOp
x, y
NODE_LIST, NOT_ITERABLE, USE_UNSAFE_TO_CLONE, WithAllEdges, WithNoEdges, WithOnlyInputEdges, WithOnlySucessorEdges
Constructor and Description |
---|
IntegerAddExactNode(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 static ConstantNode |
canonicalXconstant(ValueNode forX,
ValueNode forY) |
IntegerExactArithmeticSplitNode |
createSplit(AbstractBeginNode next,
AbstractBeginNode deopt) |
private static ValueNode |
findSynonym(ValueNode forX,
ValueNode forY) |
private static Stamp |
foldStamp(Stamp stamp1,
Stamp stamp2) |
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, tryConstantFold
getX, getY, setX, setY
asNode
asConstant, asJavaConstant, getKind, graph, isAllowedUsageType, isConstant, isConstantPredicate, isNullConstant, setStamp, stamp, updateStamp
acceptInputs, 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, verifyInputs
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
isNarrowable
maybeCommuteInputs
canonical, getX, getY
public static final NodeClass<IntegerAddExactNode> TYPE
public IntegerAddExactNode(ValueNode x, ValueNode y)
public boolean inferStamp()
ValueNode
ValueNode
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.Add>
public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY)
Canonicalizable.Binary
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.canonical
in interface Canonicalizable.Binary<ValueNode>
canonical
in class AddNode
private static ValueNode findSynonym(ValueNode forX, ValueNode forY)
private static ConstantNode canonicalXconstant(ValueNode forX, ValueNode forY)
public IntegerExactArithmeticSplitNode createSplit(AbstractBeginNode next, AbstractBeginNode deopt)
createSplit
in interface IntegerExactArithmeticNode
public void lower(LoweringTool tool)
Lowerable