/*

 * 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 org.graalvm.compiler.nodes.calc;

import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2;

import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_1;

import org.graalvm.compiler.core.common.type.ArithmeticOpTable;

import org.graalvm.compiler.core.common.type.ArithmeticOpTable.UnaryOp.Abs;

import org.graalvm.compiler.graph.NodeClass;

import org.graalvm.compiler.graph.spi.CanonicalizerTool;

import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;

import org.graalvm.compiler.nodeinfo.NodeInfo;

import org.graalvm.compiler.nodes.NodeView;

import org.graalvm.compiler.nodes.ValueNode;

import org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable;

import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;

/**

 * Absolute value.

 */

@NodeInfo(cycles = CYCLES_2, size = SIZE_1)

public final class AbsNode extends UnaryArithmeticNode<Abs> implements ArithmeticLIRLowerable, NarrowableArithmeticNode {

    public static final NodeClass<AbsNode> TYPE = NodeClass.create(AbsNode.class);

    public AbsNode(ValueNode x) {

    }

    public static ValueNode create(ValueNode value, NodeView view) {

        ValueNode synonym = findSynonym(value, view);

        if (synonym != null) {

            return synonym;

        }

        return new NegateNode(value);

    }

    protected static ValueNode findSynonym(ValueNode forValue, NodeView view) {

        ArithmeticOpTable.UnaryOp<Abs> absOp = ArithmeticOpTable.forStamp(forValue.stamp(view)).getAbs();

        ValueNode synonym = UnaryArithmeticNode.findSynonym(forValue, absOp);

        if (synonym != null) {

            return synonym;

        }

        return null;

    }

    @Override

    public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue) {

        ValueNode ret = super.canonical(tool, forValue);

        if (ret != this) {

            return ret;

        }

        if (forValue instanceof AbsNode) {

            return forValue;

        }

        return this;

    }

    @Override

    public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {

        nodeValueMap.setResult(this, gen.emitMathAbs(nodeValueMap.operand(getValue())));

    }

}