1/*
2 * Copyright (c) 2009, 2015, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 */
23package org.graalvm.compiler.nodes.calc;
24
25import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_2;
26import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_1;
27
28import org.graalvm.compiler.core.common.type.ArithmeticOpTable;
29import org.graalvm.compiler.core.common.type.ArithmeticOpTable.UnaryOp.Neg;
30import org.graalvm.compiler.core.common.type.FloatStamp;
31import org.graalvm.compiler.core.common.type.Stamp;
32import org.graalvm.compiler.graph.NodeClass;
33import org.graalvm.compiler.graph.spi.CanonicalizerTool;
34import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;
35import org.graalvm.compiler.nodeinfo.NodeInfo;
36import org.graalvm.compiler.nodes.ValueNode;
37import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
38import org.graalvm.compiler.nodes.spi.StampInverter;
39
40/**
41 * The {@code NegateNode} node negates its operand.
42 */
43@NodeInfo(cycles = CYCLES_2, size = SIZE_1)
44public final class NegateNode extends UnaryArithmeticNode<Neg> implements NarrowableArithmeticNode, StampInverter {
45
46    public static final NodeClass<NegateNode> TYPE = NodeClass.create(NegateNode.class);
47
48    public NegateNode(ValueNode value) {
49        super(TYPE, ArithmeticOpTable::getNeg, value);
50    }
51
52    public static ValueNode create(ValueNode value) {
53        ValueNode synonym = findSynonym(value);
54        if (synonym != null) {
55            return synonym;
56        }
57        return new NegateNode(value);
58    }
59
60    @Override
61    public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue) {
62        ValueNode synonym = findSynonym(forValue, getOp(forValue));
63        if (synonym != null) {
64            return synonym;
65        }
66        return this;
67    }
68
69    protected static ValueNode findSynonym(ValueNode forValue) {
70        ArithmeticOpTable.UnaryOp<Neg> negOp = ArithmeticOpTable.forStamp(forValue.stamp()).getNeg();
71        ValueNode synonym = UnaryArithmeticNode.findSynonym(forValue, negOp);
72        if (synonym != null) {
73            return synonym;
74        }
75        if (forValue instanceof NegateNode) {
76            return ((NegateNode) forValue).getValue();
77        }
78        if (forValue instanceof SubNode && !(forValue.stamp() instanceof FloatStamp)) {
79            SubNode sub = (SubNode) forValue;
80            return SubNode.create(sub.getY(), sub.getX());
81        }
82        return null;
83    }
84
85    @Override
86    public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {
87        nodeValueMap.setResult(this, gen.emitNegate(nodeValueMap.operand(getValue())));
88    }
89
90    @Override
91    public Stamp invertStamp(Stamp outStamp) {
92        return getArithmeticOp().foldStamp(outStamp);
93    }
94}
95