15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 25 package org.graalvm.compiler.replacements.nodes.arithmetic; 26 27 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2; 28 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_2; 29 30 import org.graalvm.compiler.core.common.type.Stamp; 31 import org.graalvm.compiler.graph.NodeClass; 32 import org.graalvm.compiler.graph.spi.Simplifiable; 33 import org.graalvm.compiler.nodeinfo.NodeInfo; 34 import org.graalvm.compiler.nodes.AbstractBeginNode; 35 import org.graalvm.compiler.nodes.BeginNode; 36 import org.graalvm.compiler.nodes.ControlSplitNode; 37 import org.graalvm.compiler.nodes.DeoptimizeNode; 38 import org.graalvm.compiler.nodes.FixedNode; 39 import org.graalvm.compiler.nodes.FixedWithNextNode; 40 import org.graalvm.compiler.nodes.StructuredGraph; 41 import org.graalvm.compiler.nodes.ValueNode; 42 import org.graalvm.compiler.nodes.calc.FloatingNode; 43 import org.graalvm.compiler.nodes.spi.LIRLowerable; 44 import org.graalvm.compiler.nodes.spi.LoweringTool; 45 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool; 46 47 import jdk.vm.ci.meta.DeoptimizationAction; 48 import jdk.vm.ci.meta.DeoptimizationReason; 49 import jdk.vm.ci.meta.SpeculationLog; 50 import jdk.vm.ci.meta.Value; 51 52 @NodeInfo(cycles = CYCLES_2, cyclesRationale = "add+cmp", size = SIZE_2) 53 public abstract class IntegerExactArithmeticSplitNode extends ControlSplitNode implements Simplifiable, LIRLowerable { 54 public static final NodeClass<IntegerExactArithmeticSplitNode> TYPE = NodeClass.create(IntegerExactArithmeticSplitNode.class); 55 56 @Successor AbstractBeginNode next; 57 @Successor AbstractBeginNode overflowSuccessor; 58 @Input ValueNode x; 59 @Input ValueNode y; 60 61 protected IntegerExactArithmeticSplitNode(NodeClass<? extends IntegerExactArithmeticSplitNode> c, Stamp stamp, ValueNode x, ValueNode y, AbstractBeginNode next, 62 AbstractBeginNode overflowSuccessor) { 63 super(c, stamp); 64 this.x = x; 65 this.y = y; 66 this.overflowSuccessor = overflowSuccessor; 67 this.next = next; 68 } 69 99 public void setOverflowSuccessor(AbstractBeginNode overflowSuccessor) { 100 updatePredecessor(this.overflowSuccessor, overflowSuccessor); 101 this.overflowSuccessor = overflowSuccessor; 102 } 103 104 public ValueNode getX() { 105 return x; 106 } 107 108 public ValueNode getY() { 109 return y; 110 } 111 112 @Override 113 public void generate(NodeLIRBuilderTool generator) { 114 generator.setResult(this, generateArithmetic(generator)); 115 generator.emitOverflowCheckBranch(getOverflowSuccessor(), getNext(), stamp, probability(getOverflowSuccessor())); 116 } 117 118 protected abstract Value generateArithmetic(NodeLIRBuilderTool generator); 119 120 static void lower(LoweringTool tool, IntegerExactArithmeticNode node) { 121 if (node.asNode().graph().getGuardsStage() == StructuredGraph.GuardsStage.FIXED_DEOPTS) { 122 FloatingNode floatingNode = (FloatingNode) node; 123 FixedWithNextNode previous = tool.lastFixedNode(); 124 FixedNode next = previous.next(); 125 previous.setNext(null); 126 StructuredGraph graph = floatingNode.graph(); 127 DeoptimizeNode deopt = graph.add(new DeoptimizeNode(DeoptimizationAction.InvalidateReprofile, DeoptimizationReason.ArithmeticException, 128 node.getSpeculation() == null ? SpeculationLog.NO_SPECULATION : graph.getSpeculationLog().speculate(node.getSpeculation()))); 129 AbstractBeginNode normalBegin = graph.add(new BeginNode()); 130 normalBegin.setNext(next); 131 IntegerExactArithmeticSplitNode split = node.createSplit(normalBegin, BeginNode.begin(deopt)); 132 previous.setNext(split); 133 floatingNode.replaceAndDelete(split); 134 } 135 } 136 137 @Override 138 public int getSuccessorCount() { 139 return 2; 140 } 141 } | 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 25 package org.graalvm.compiler.replacements.nodes.arithmetic; 26 27 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2; 28 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_2; 29 30 import org.graalvm.compiler.core.common.type.Stamp; 31 import org.graalvm.compiler.graph.NodeClass; 32 import org.graalvm.compiler.graph.spi.Simplifiable; 33 import org.graalvm.compiler.nodeinfo.NodeInfo; 34 import org.graalvm.compiler.nodes.AbstractBeginNode; 35 import org.graalvm.compiler.nodes.ControlSplitNode; 36 import org.graalvm.compiler.nodes.ValueNode; 37 import org.graalvm.compiler.nodes.spi.LIRLowerable; 38 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool; 39 40 import jdk.vm.ci.meta.Value; 41 42 @NodeInfo(cycles = CYCLES_2, cyclesRationale = "add+cmp", size = SIZE_2) 43 public abstract class IntegerExactArithmeticSplitNode extends ControlSplitNode implements Simplifiable, LIRLowerable { 44 public static final NodeClass<IntegerExactArithmeticSplitNode> TYPE = NodeClass.create(IntegerExactArithmeticSplitNode.class); 45 46 @Successor AbstractBeginNode next; 47 @Successor AbstractBeginNode overflowSuccessor; 48 @Input ValueNode x; 49 @Input ValueNode y; 50 51 protected IntegerExactArithmeticSplitNode(NodeClass<? extends IntegerExactArithmeticSplitNode> c, Stamp stamp, ValueNode x, ValueNode y, AbstractBeginNode next, 52 AbstractBeginNode overflowSuccessor) { 53 super(c, stamp); 54 this.x = x; 55 this.y = y; 56 this.overflowSuccessor = overflowSuccessor; 57 this.next = next; 58 } 59 89 public void setOverflowSuccessor(AbstractBeginNode overflowSuccessor) { 90 updatePredecessor(this.overflowSuccessor, overflowSuccessor); 91 this.overflowSuccessor = overflowSuccessor; 92 } 93 94 public ValueNode getX() { 95 return x; 96 } 97 98 public ValueNode getY() { 99 return y; 100 } 101 102 @Override 103 public void generate(NodeLIRBuilderTool generator) { 104 generator.setResult(this, generateArithmetic(generator)); 105 generator.emitOverflowCheckBranch(getOverflowSuccessor(), getNext(), stamp, probability(getOverflowSuccessor())); 106 } 107 108 protected abstract Value generateArithmetic(NodeLIRBuilderTool generator); 109 110 @Override 111 public int getSuccessorCount() { 112 return 2; 113 } 114 } |