NegateNode.java revision 12651:6ef01bd40ce2
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.graph.NodeClass;
32import org.graalvm.compiler.graph.spi.CanonicalizerTool;
33import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;
34import org.graalvm.compiler.nodeinfo.NodeInfo;
35import org.graalvm.compiler.nodes.ValueNode;
36import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
37
38/**
39 * The {@code NegateNode} node negates its operand.
40 */
41@NodeInfo(cycles = CYCLES_2, size = SIZE_1)
42public final class NegateNode extends UnaryArithmeticNode<Neg> implements NarrowableArithmeticNode {
43
44    public static final NodeClass<NegateNode> TYPE = NodeClass.create(NegateNode.class);
45
46    public NegateNode(ValueNode value) {
47        super(TYPE, ArithmeticOpTable::getNeg, value);
48    }
49
50    @Override
51    public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue) {
52        ValueNode ret = super.canonical(tool, forValue);
53        if (ret != this) {
54            return ret;
55        }
56        if (forValue instanceof NegateNode) {
57            return ((NegateNode) forValue).getValue();
58        }
59        if (forValue instanceof SubNode && !(forValue.stamp() instanceof FloatStamp)) {
60            SubNode sub = (SubNode) forValue;
61            return new SubNode(sub.getY(), sub.getX());
62        }
63        return this;
64    }
65
66    @Override
67    public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {
68        nodeValueMap.setResult(this, gen.emitNegate(nodeValueMap.operand(getValue())));
69    }
70}
71