1 /*
   2  * Copyright (c) 2013, 2015, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  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 package org.graalvm.compiler.replacements.nodes.arithmetic;
  24 
  25 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2;
  26 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_2;
  27 
  28 import org.graalvm.compiler.core.common.type.Stamp;
  29 import org.graalvm.compiler.graph.NodeClass;
  30 import org.graalvm.compiler.nodeinfo.NodeInfo;
  31 import org.graalvm.compiler.nodes.AbstractBeginNode;
  32 import org.graalvm.compiler.nodes.BeginNode;
  33 import org.graalvm.compiler.nodes.ControlSplitNode;
  34 import org.graalvm.compiler.nodes.DeoptimizeNode;
  35 import org.graalvm.compiler.nodes.FixedNode;
  36 import org.graalvm.compiler.nodes.FixedWithNextNode;
  37 import org.graalvm.compiler.nodes.StructuredGraph;
  38 import org.graalvm.compiler.nodes.ValueNode;
  39 import org.graalvm.compiler.nodes.calc.FloatingNode;
  40 import org.graalvm.compiler.nodes.spi.LIRLowerable;
  41 import org.graalvm.compiler.nodes.spi.LoweringTool;
  42 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
  43 
  44 import jdk.vm.ci.meta.DeoptimizationAction;
  45 import jdk.vm.ci.meta.DeoptimizationReason;
  46 import jdk.vm.ci.meta.Value;
  47 
  48 @NodeInfo(cycles = CYCLES_2, cyclesRationale = "add+cmp", size = SIZE_2)
  49 public abstract class IntegerExactArithmeticSplitNode extends ControlSplitNode implements LIRLowerable {
  50     public static final NodeClass<IntegerExactArithmeticSplitNode> TYPE = NodeClass.create(IntegerExactArithmeticSplitNode.class);
  51 
  52     @Successor AbstractBeginNode next;
  53     @Successor AbstractBeginNode overflowSuccessor;
  54     @Input ValueNode x;
  55     @Input ValueNode y;
  56 
  57     protected IntegerExactArithmeticSplitNode(NodeClass<? extends IntegerExactArithmeticSplitNode> c, Stamp stamp, ValueNode x, ValueNode y, AbstractBeginNode next,
  58                     AbstractBeginNode overflowSuccessor) {
  59         super(c, stamp);
  60         this.x = x;
  61         this.y = y;
  62         this.overflowSuccessor = overflowSuccessor;
  63         this.next = next;
  64     }
  65 
  66     @Override
  67     public AbstractBeginNode getPrimarySuccessor() {
  68         return next;
  69     }
  70 
  71     @Override
  72     public double probability(AbstractBeginNode successor) {
  73         return successor == next ? 1 : 0;
  74     }
  75 
  76     public AbstractBeginNode getNext() {
  77         return next;
  78     }
  79 
  80     public AbstractBeginNode getOverflowSuccessor() {
  81         return overflowSuccessor;
  82     }
  83 
  84     public ValueNode getX() {
  85         return x;
  86     }
  87 
  88     public ValueNode getY() {
  89         return y;
  90     }
  91 
  92     @Override
  93     public void generate(NodeLIRBuilderTool generator) {
  94         generator.setResult(this, generateArithmetic(generator));
  95         generator.emitOverflowCheckBranch(getOverflowSuccessor(), getNext(), stamp, probability(getOverflowSuccessor()));
  96     }
  97 
  98     protected abstract Value generateArithmetic(NodeLIRBuilderTool generator);
  99 
 100     static void lower(LoweringTool tool, IntegerExactArithmeticNode node) {
 101         if (node.asNode().graph().getGuardsStage() == StructuredGraph.GuardsStage.FIXED_DEOPTS) {
 102             FloatingNode floatingNode = (FloatingNode) node;
 103             FixedWithNextNode previous = tool.lastFixedNode();
 104             FixedNode next = previous.next();
 105             previous.setNext(null);
 106             DeoptimizeNode deopt = floatingNode.graph().add(new DeoptimizeNode(DeoptimizationAction.InvalidateReprofile, DeoptimizationReason.ArithmeticException));
 107             AbstractBeginNode normalBegin = floatingNode.graph().add(new BeginNode());
 108             normalBegin.setNext(next);
 109             IntegerExactArithmeticSplitNode split = node.createSplit(normalBegin, BeginNode.begin(deopt));
 110             previous.setNext(split);
 111             floatingNode.replaceAndDelete(split);
 112         }
 113     }
 114 }