Mercurial > hg > graal-compiler
view graal/com.oracle.graal.replacements/src/com/oracle/graal/replacements/nodes/arithmetic/IntegerAddExactNode.java @ 22604:b00cc0475f31
Update jvmci import: Refactoring: Rename Kind to JavaKind.
author | Roland Schatz <roland.schatz@oracle.com> |
---|---|
date | Tue, 08 Sep 2015 19:57:39 +0200 |
parents | 0e095e2c24e2 |
children | 05183a084a08 |
line wrap: on
line source
/* * Copyright (c) 2013, 2015, 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. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.replacements.nodes.arithmetic; import jdk.internal.jvmci.code.*; import jdk.internal.jvmci.meta.*; import com.oracle.graal.compiler.common.type.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.spi.*; import com.oracle.graal.nodeinfo.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.calc.*; import com.oracle.graal.nodes.spi.*; import static com.oracle.graal.compiler.common.type.IntegerStamp.*; /** * Node representing an exact integer addition that will throw an {@link ArithmeticException} in * case the addition would overflow the 32 bit range. */ @NodeInfo public final class IntegerAddExactNode extends AddNode implements IntegerExactArithmeticNode { public static final NodeClass<IntegerAddExactNode> TYPE = NodeClass.create(IntegerAddExactNode.class); public IntegerAddExactNode(ValueNode x, ValueNode y) { super(TYPE, x, y); setStamp(foldStamp(x.stamp(), y.stamp())); assert x.stamp().isCompatible(y.stamp()) && x.stamp() instanceof IntegerStamp; } @Override public boolean inferStamp() { return updateStamp(foldStamp(x.stamp(), y.stamp())); } private static Stamp foldStamp(Stamp stamp1, Stamp stamp2) { IntegerStamp a = (IntegerStamp) stamp1; IntegerStamp b = (IntegerStamp) stamp2; int bits = a.getBits(); assert bits == b.getBits(); long defaultMask = CodeUtil.mask(bits); long variableBits = (a.downMask() ^ a.upMask()) | (b.downMask() ^ b.upMask()); long variableBitsWithCarry = variableBits | (carryBits(a.downMask(), b.downMask()) ^ carryBits(a.upMask(), b.upMask())); long newDownMask = (a.downMask() + b.downMask()) & ~variableBitsWithCarry; long newUpMask = (a.downMask() + b.downMask()) | variableBitsWithCarry; newDownMask &= defaultMask; newUpMask &= defaultMask; long newLowerBound; long newUpperBound; boolean lowerOverflowsPositively = addOverflowsPositively(a.lowerBound(), b.lowerBound(), bits); boolean upperOverflowsPositively = addOverflowsPositively(a.upperBound(), b.upperBound(), bits); boolean lowerOverflowsNegatively = addOverflowsNegatively(a.lowerBound(), b.lowerBound(), bits); boolean upperOverflowsNegatively = addOverflowsNegatively(a.upperBound(), b.upperBound(), bits); if (lowerOverflowsPositively) { newLowerBound = CodeUtil.maxValue(bits); } else if (lowerOverflowsNegatively) { newLowerBound = CodeUtil.minValue(bits); } else { newLowerBound = CodeUtil.signExtend((a.lowerBound() + b.lowerBound()) & defaultMask, bits); } if (upperOverflowsPositively) { newUpperBound = CodeUtil.maxValue(bits); } else if (upperOverflowsNegatively) { newUpperBound = CodeUtil.minValue(bits); } else { newUpperBound = CodeUtil.signExtend((a.upperBound() + b.upperBound()) & defaultMask, bits); } IntegerStamp limit = StampFactory.forInteger(bits, newLowerBound, newUpperBound); newUpMask &= limit.upMask(); newUpperBound = CodeUtil.signExtend(newUpperBound & newUpMask, bits); newDownMask |= limit.downMask(); newLowerBound |= newDownMask; return new IntegerStamp(bits, newLowerBound, newUpperBound, newDownMask, newUpMask); } @Override public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) { ValueNode result = findSynonym(forX, forY); if (result == null) { return this; } else { return result; } } private static ValueNode findSynonym(ValueNode forX, ValueNode forY) { if (forX.isConstant() && !forY.isConstant()) { return new IntegerAddExactNode(forY, forX); } if (forX.isConstant()) { ConstantNode constantNode = canonicalXconstant(forX, forY); if (constantNode != null) { return constantNode; } } else if (forY.isConstant()) { long c = forY.asJavaConstant().asLong(); if (c == 0) { return forX; } } return null; } private static ConstantNode canonicalXconstant(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. } } return null; } @Override public IntegerExactArithmeticSplitNode createSplit(AbstractBeginNode next, AbstractBeginNode deopt) { return graph().add(new IntegerAddExactSplitNode(stamp(), getX(), getY(), next, deopt)); } @Override public void lower(LoweringTool tool) { IntegerExactArithmeticSplitNode.lower(tool, this); } }