view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/FloatAddNode.java @ 11881:da9db8331658

moved Canonicalizable and Simplifiable to the com.oracle.graal.graph project (GRAAL-506)
author Doug Simon <doug.simon@oracle.com>
date Tue, 01 Oct 2013 20:38:25 +0200
parents 9a747d8e0d0f
children 673f93db4adc
line wrap: on
line source

/*
 * Copyright (c) 2011, 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.nodes.*;
import com.oracle.graal.nodes.spi.*;

@NodeInfo(shortName = "+")
public final class FloatAddNode extends FloatArithmeticNode implements Canonicalizable {

    public FloatAddNode(Kind kind, ValueNode x, ValueNode y, boolean isStrictFP) {
        super(kind, x, y, isStrictFP);
    }

    @Override
    public Node canonical(CanonicalizerTool tool) {
        if (x().isConstant() && !y().isConstant()) {
            return graph().unique(new FloatAddNode(kind(), y(), x(), isStrictFP()));
        }
        if (x().isConstant()) {
            if (kind() == Kind.Float) {
                return ConstantNode.forFloat(x().asConstant().asFloat() + y().asConstant().asFloat(), graph());
            } else {
                assert kind() == Kind.Double;
                return ConstantNode.forDouble(x().asConstant().asDouble() + y().asConstant().asDouble(), graph());
            }
        } else if (y().isConstant()) {
            if (kind() == Kind.Float) {
                float c = y().asConstant().asFloat();
                if (c == 0.0f) {
                    return x();
                }
            } else {
                assert kind() == Kind.Double;
                double c = y().asConstant().asDouble();
                if (c == 0.0) {
                    return x();
                }
            }
        }
        return this;
    }

    @Override
    public void generate(ArithmeticLIRGenerator gen) {
        Value op1 = gen.operand(x());
        Value op2 = gen.operand(y());
        if (!y().isConstant() && !livesLonger(this, y(), gen)) {
            Value op = op1;
            op1 = op2;
            op2 = op;
        }
        gen.setResult(this, gen.emitAdd(op1, op2));
    }

    public static boolean livesLonger(ValueNode after, ValueNode value, ArithmeticLIRGenerator gen) {
        for (Node usage : value.usages()) {
            if (usage != after && usage instanceof ValueNode && gen.operand(((ValueNode) usage)) != null) {
                return true;
            }
        }
        return false;
    }
}