org.graalvm.compiler.replacements.nodes.arithmetic.IntegerSubExactOverflowNode Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of compiler Show documentation
Show all versions of compiler Show documentation
The GraalVM compiler and the Graal-truffle optimizer.
/*
* Copyright (c) 2019, 2022, 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. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* 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 org.graalvm.compiler.replacements.nodes.arithmetic;
import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2;
import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_2;
import org.graalvm.compiler.core.common.type.IntegerStamp;
import org.graalvm.compiler.core.common.type.Stamp;
import org.graalvm.compiler.graph.NodeClass;
import org.graalvm.compiler.nodeinfo.NodeInfo;
import org.graalvm.compiler.nodes.AbstractBeginNode;
import org.graalvm.compiler.nodes.LogicConstantNode;
import org.graalvm.compiler.nodes.NodeView;
import org.graalvm.compiler.nodes.ValueNode;
import org.graalvm.compiler.nodes.calc.BinaryNode;
import org.graalvm.compiler.nodes.spi.CanonicalizerTool;
import org.graalvm.compiler.nodes.util.GraphUtil;
import jdk.vm.ci.meta.JavaConstant;
import jdk.vm.ci.meta.JavaKind;
@NodeInfo(cycles = CYCLES_2, size = SIZE_2)
public class IntegerSubExactOverflowNode extends IntegerExactOverflowNode {
public static final NodeClass TYPE = NodeClass.create(IntegerSubExactOverflowNode.class);
public IntegerSubExactOverflowNode(ValueNode x, ValueNode y) {
super(TYPE, x, y);
}
@Override
public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) {
if (GraphUtil.unproxify(forX) == GraphUtil.unproxify(forY)) {
return LogicConstantNode.forBoolean(false);
}
if (forX.isConstant() && forY.isConstant()) {
return canonicalXYconstant(forX, forY);
} else if (forY.isConstant()) {
long c = forY.asJavaConstant().asLong();
if (c == 0) {
return LogicConstantNode.forBoolean(false);
}
}
if (!IntegerStamp.subtractionCanOverflow((IntegerStamp) x.stamp(NodeView.DEFAULT), (IntegerStamp) y.stamp(NodeView.DEFAULT))) {
return LogicConstantNode.forBoolean(false);
}
return this;
}
private static LogicConstantNode canonicalXYconstant(ValueNode forX, ValueNode forY) {
JavaConstant xConst = forX.asJavaConstant();
JavaConstant yConst = forY.asJavaConstant();
assert xConst.getJavaKind() == yConst.getJavaKind();
try {
if (xConst.getJavaKind() == JavaKind.Int) {
Math.subtractExact(xConst.asInt(), yConst.asInt());
} else {
assert xConst.getJavaKind() == JavaKind.Long;
Math.subtractExact(xConst.asLong(), yConst.asLong());
}
} catch (ArithmeticException ex) {
// Always overflows
return LogicConstantNode.forBoolean(true);
}
// Never overflows
return LogicConstantNode.forBoolean(false);
}
@Override
protected IntegerExactArithmeticSplitNode createSplit(Stamp splitStamp, AbstractBeginNode next, AbstractBeginNode overflow) {
return new IntegerSubExactSplitNode(splitStamp, x, y, next, overflow);
}
@Override
protected Class extends BinaryNode> getCoupledType() {
return IntegerSubExactNode.class;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy