001/* 002 * Copyright (c) 2013, 2015, Oracle and/or its affiliates. All rights reserved. 003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 004 * 005 * This code is free software; you can redistribute it and/or modify it 006 * under the terms of the GNU General Public License version 2 only, as 007 * published by the Free Software Foundation. 008 * 009 * This code is distributed in the hope that it will be useful, but WITHOUT 010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 011 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 012 * version 2 for more details (a copy is included in the LICENSE file that 013 * accompanied this code). 014 * 015 * You should have received a copy of the GNU General Public License version 016 * 2 along with this work; if not, write to the Free Software Foundation, 017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 018 * 019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 020 * or visit www.oracle.com if you need additional information or have any 021 * questions. 022 */ 023package com.oracle.graal.replacements.nodes.arithmetic; 024 025import jdk.internal.jvmci.meta.*; 026 027import com.oracle.graal.compiler.common.type.*; 028import com.oracle.graal.graph.*; 029import com.oracle.graal.nodeinfo.*; 030import com.oracle.graal.nodes.*; 031import com.oracle.graal.nodes.calc.*; 032import com.oracle.graal.nodes.spi.*; 033 034@NodeInfo 035public abstract class IntegerExactArithmeticSplitNode extends ControlSplitNode implements LIRLowerable { 036 public static final NodeClass<IntegerExactArithmeticSplitNode> TYPE = NodeClass.create(IntegerExactArithmeticSplitNode.class); 037 038 @Successor AbstractBeginNode next; 039 @Successor AbstractBeginNode overflowSuccessor; 040 @Input ValueNode x; 041 @Input ValueNode y; 042 043 protected IntegerExactArithmeticSplitNode(NodeClass<? extends IntegerExactArithmeticSplitNode> c, Stamp stamp, ValueNode x, ValueNode y, AbstractBeginNode next, AbstractBeginNode overflowSuccessor) { 044 super(c, stamp); 045 this.x = x; 046 this.y = y; 047 this.overflowSuccessor = overflowSuccessor; 048 this.next = next; 049 } 050 051 @Override 052 public AbstractBeginNode getPrimarySuccessor() { 053 return next; 054 } 055 056 @Override 057 public double probability(AbstractBeginNode successor) { 058 return successor == next ? 1 : 0; 059 } 060 061 public AbstractBeginNode getNext() { 062 return next; 063 } 064 065 public AbstractBeginNode getOverflowSuccessor() { 066 return overflowSuccessor; 067 } 068 069 public ValueNode getX() { 070 return x; 071 } 072 073 public ValueNode getY() { 074 return y; 075 } 076 077 @Override 078 public void generate(NodeLIRBuilderTool generator) { 079 generator.setResult(this, generateArithmetic(generator)); 080 generator.emitOverflowCheckBranch(getOverflowSuccessor(), getNext(), stamp, probability(getOverflowSuccessor())); 081 } 082 083 protected abstract Value generateArithmetic(NodeLIRBuilderTool generator); 084 085 static void lower(LoweringTool tool, IntegerExactArithmeticNode node) { 086 if (node.asNode().graph().getGuardsStage() == StructuredGraph.GuardsStage.FIXED_DEOPTS) { 087 FloatingNode floatingNode = (FloatingNode) node; 088 FixedWithNextNode previous = tool.lastFixedNode(); 089 FixedNode next = previous.next(); 090 previous.setNext(null); 091 DeoptimizeNode deopt = floatingNode.graph().add(new DeoptimizeNode(DeoptimizationAction.InvalidateReprofile, DeoptimizationReason.ArithmeticException)); 092 AbstractBeginNode normalBegin = floatingNode.graph().add(new BeginNode()); 093 normalBegin.setNext(next); 094 IntegerExactArithmeticSplitNode split = node.createSplit(normalBegin, BeginNode.begin(deopt)); 095 previous.setNext(split); 096 floatingNode.replaceAndDelete(split); 097 } 098 } 099}