< prev index next >
src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/nodes/arithmetic/IntegerAddExactNode.java
Print this page
@@ -1,7 +1,7 @@
/*
- * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 2013, 2019, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
@@ -35,39 +35,36 @@
import org.graalvm.compiler.core.common.type.StampFactory;
import org.graalvm.compiler.graph.NodeClass;
import org.graalvm.compiler.graph.spi.CanonicalizerTool;
import org.graalvm.compiler.nodeinfo.InputType;
import org.graalvm.compiler.nodeinfo.NodeInfo;
-import org.graalvm.compiler.nodes.AbstractBeginNode;
import org.graalvm.compiler.nodes.ConstantNode;
import org.graalvm.compiler.nodes.NodeView;
import org.graalvm.compiler.nodes.ValueNode;
import org.graalvm.compiler.nodes.calc.AddNode;
-import org.graalvm.compiler.nodes.extended.AnchoringNode;
-import org.graalvm.compiler.nodes.spi.LoweringTool;
import jdk.vm.ci.code.CodeUtil;
import jdk.vm.ci.meta.JavaConstant;
import jdk.vm.ci.meta.JavaKind;
-import jdk.vm.ci.meta.SpeculationLog.SpeculationReason;
+import org.graalvm.compiler.nodes.extended.GuardedNode;
+import org.graalvm.compiler.nodes.extended.GuardingNode;
/**
* Node representing an exact integer addition that will throw an {@link ArithmeticException} in
* case the addition would overflow the 32 bit range.
*/
@NodeInfo(cycles = CYCLES_2, size = SIZE_2)
-public final class IntegerAddExactNode extends AddNode implements IntegerExactArithmeticNode {
+public final class IntegerAddExactNode extends AddNode implements GuardedNode, IntegerExactArithmeticNode {
public static final NodeClass<IntegerAddExactNode> TYPE = NodeClass.create(IntegerAddExactNode.class);
- @OptionalInput(InputType.Anchor) protected AnchoringNode anchor;
- protected final SpeculationReason speculation;
+ @Input(InputType.Guard) protected GuardingNode guard;
- public IntegerAddExactNode(ValueNode x, ValueNode y, SpeculationReason speculation) {
+ public IntegerAddExactNode(ValueNode x, ValueNode y, GuardingNode guard) {
super(TYPE, x, y);
setStamp(x.stamp(NodeView.DEFAULT).unrestricted());
assert x.stamp(NodeView.DEFAULT).isCompatible(y.stamp(NodeView.DEFAULT)) && x.stamp(NodeView.DEFAULT) instanceof IntegerStamp;
- this.speculation = speculation;
+ this.guard = guard;
}
@Override
public boolean inferStamp() {
/*
@@ -127,17 +124,14 @@
}
@Override
public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) {
if (forX.isConstant() && !forY.isConstant()) {
- return new IntegerAddExactNode(forY, forX, speculation).canonical(tool);
+ return new IntegerAddExactNode(forY, forX, guard).canonical(tool);
}
- if (forX.isConstant()) {
- ConstantNode constantNode = canonicalXconstant(forX, forY);
- if (constantNode != null) {
- return constantNode;
- }
+ if (forX.isConstant() && forY.isConstant()) {
+ return canonicalXYconstant(forX, forY);
} else if (forY.isConstant()) {
long c = forY.asJavaConstant().asLong();
if (c == 0) {
return forX;
}
@@ -146,50 +140,33 @@
return new AddNode(forX, forY).canonical(tool);
}
return this;
}
- private static ConstantNode canonicalXconstant(ValueNode forX, ValueNode forY) {
+ private ValueNode canonicalXYconstant(ValueNode forX, ValueNode forY) {
JavaConstant xConst = forX.asJavaConstant();
JavaConstant yConst = forY.asJavaConstant();
- if (xConst != null && yConst != null) {
- assert xConst.getJavaKind() == yConst.getJavaKind();
- try {
- if (xConst.getJavaKind() == JavaKind.Int) {
- return ConstantNode.forInt(Math.addExact(xConst.asInt(), yConst.asInt()));
- } else {
- assert xConst.getJavaKind() == JavaKind.Long;
- return ConstantNode.forLong(Math.addExact(xConst.asLong(), yConst.asLong()));
- }
- } catch (ArithmeticException ex) {
- // The operation will result in an overflow exception, so do not canonicalize.
+ assert xConst.getJavaKind() == yConst.getJavaKind();
+ try {
+ if (xConst.getJavaKind() == JavaKind.Int) {
+ return ConstantNode.forInt(Math.addExact(xConst.asInt(), yConst.asInt()));
+ } else {
+ assert xConst.getJavaKind() == JavaKind.Long;
+ return ConstantNode.forLong(Math.addExact(xConst.asLong(), yConst.asLong()));
}
+ } catch (ArithmeticException ex) {
+ // The operation will result in an overflow exception, so do not canonicalize.
}
- return null;
- }
-
- @Override
- public IntegerExactArithmeticSplitNode createSplit(AbstractBeginNode next, AbstractBeginNode deopt) {
- return graph().add(new IntegerAddExactSplitNode(stamp(NodeView.DEFAULT), getX(), getY(), next, deopt));
- }
-
- @Override
- public SpeculationReason getSpeculation() {
- return speculation;
- }
-
- @Override
- public AnchoringNode getAnchor() {
- return anchor;
+ return this;
}
@Override
- public void setAnchor(AnchoringNode x) {
- updateUsagesInterface(this.anchor, x);
- this.anchor = x;
+ public GuardingNode getGuard() {
+ return guard;
}
@Override
- public void lower(LoweringTool tool) {
- IntegerExactArithmeticSplitNode.lower(tool, this);
+ public void setGuard(GuardingNode guard) {
+ updateUsagesInterface(this.guard, guard);
+ this.guard = guard;
}
}
< prev index next >