Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/FloatSubNode.java @ 16897:f90dcdbbb75e
switched to using new NodeFieldIterator and NodeFieldIterable for traversing Node inputs and successors
changed Node fields to be protected or package-private (they can no longer be private)
generate isLeafNode() and isOptionalInput()
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Fri, 22 Aug 2014 15:56:51 +0200 |
parents | 06c15e88d383 |
children | 0fe4732e5181 |
line wrap: on
line source
/* * Copyright (c) 2011, 2014, 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.nodes.calc; import com.oracle.graal.api.meta.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.spi.*; import com.oracle.graal.lir.gen.*; import com.oracle.graal.nodeinfo.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.util.*; @NodeInfo(shortName = "-") public class FloatSubNode extends FloatArithmeticNode { public static FloatSubNode create(ValueNode x, ValueNode y, boolean isStrictFP) { return new FloatSubNodeGen(x, y, isStrictFP); } public static Class<? extends FloatSubNode> getGenClass() { return FloatSubNodeGen.class; } protected FloatSubNode(ValueNode x, ValueNode y, boolean isStrictFP) { super(x.stamp().unrestricted(), x, y, isStrictFP); } public Constant evalConst(Constant... inputs) { assert inputs.length == 2; assert inputs[0].getKind() == inputs[1].getKind(); if (inputs[0].getKind() == Kind.Float) { return Constant.forFloat(inputs[0].asFloat() - inputs[1].asFloat()); } else { assert inputs[0].getKind() == Kind.Double; return Constant.forDouble(inputs[0].asDouble() - inputs[1].asDouble()); } } @Override public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) { if (GraphUtil.unproxify(forX) == GraphUtil.unproxify(forY)) { return ConstantNode.forFloatingStamp(stamp(), 0.0f); } if (forX.isConstant() && forY.isConstant()) { return ConstantNode.forPrimitive(evalConst(forX.asConstant(), forY.asConstant())); } // Constant -0.0 is an additive identity, so (-0.0) - x == (-0.0) + (-x) == -x. if (forX.isConstant()) { @SuppressWarnings("hiding") Constant x = forX.asConstant(); switch (x.getKind()) { case Float: if (Float.compare(x.asFloat(), -0.0f) == 0) { return NegateNode.create(forY); } break; case Double: if (Double.compare(x.asDouble(), -0.0) == 0) { return NegateNode.create(forY); } break; default: throw GraalGraphInternalError.shouldNotReachHere(); } } // Constant -0.0 can't be eliminated since it can affect the sign of the result. // Constant 0.0 is a subtractive identity. if (forY.isConstant()) { @SuppressWarnings("hiding") Constant y = forY.asConstant(); switch (y.getKind()) { case Float: // use Float.compare because -0.0f == 0.0f if (Float.compare(y.asFloat(), 0.0f) == 0) { return forX; } break; case Double: // use Double.compare because -0.0 == 0.0 if (Double.compare(y.asDouble(), 0.0) == 0) { return forX; } break; default: throw GraalGraphInternalError.shouldNotReachHere(); } } /* * JVM spec, Chapter 6, dsub/fsub bytecode: For double subtraction, it is always the case * that a-b produces the same result as a+(-b). */ if (forY instanceof NegateNode) { return FloatAddNode.create(forX, ((NegateNode) forY).getValue(), isStrictFP()); } return this; } @Override public void generate(NodeMappableLIRBuilder builder, ArithmeticLIRGenerator gen) { builder.setResult(this, gen.emitSub(builder.operand(getX()), builder.operand(getY()))); } }