1 /* 2 * Copyright (c) 2009, 2018, 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 */ 23 24 25 package org.graalvm.compiler.nodes.calc; 26 27 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_1; 28 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_1; 29 30 import org.graalvm.compiler.core.common.type.ArithmeticOpTable; 31 import org.graalvm.compiler.core.common.type.ArithmeticOpTable.UnaryOp.Not; 32 import org.graalvm.compiler.core.common.type.Stamp; 33 import org.graalvm.compiler.graph.NodeClass; 34 import org.graalvm.compiler.graph.spi.CanonicalizerTool; 35 import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool; 36 import org.graalvm.compiler.nodeinfo.NodeInfo; 37 import org.graalvm.compiler.nodes.ValueNode; 38 import org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable; 39 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool; 40 import org.graalvm.compiler.nodes.spi.StampInverter; 41 42 /** 43 * Binary negation of long or integer values. 44 */ 45 @NodeInfo(cycles = CYCLES_1, size = SIZE_1) 46 public final class NotNode extends UnaryArithmeticNode<Not> implements ArithmeticLIRLowerable, NarrowableArithmeticNode, StampInverter { 47 48 public static final NodeClass<NotNode> TYPE = NodeClass.create(NotNode.class); 49 NotNode(ValueNode x)50 protected NotNode(ValueNode x) { 51 super(TYPE, ArithmeticOpTable::getNot, x); 52 } 53 create(ValueNode x)54 public static ValueNode create(ValueNode x) { 55 return canonicalize(null, x); 56 } 57 58 @Override canonical(CanonicalizerTool tool, ValueNode forValue)59 public ValueNode canonical(CanonicalizerTool tool, ValueNode forValue) { 60 ValueNode ret = super.canonical(tool, forValue); 61 if (ret != this) { 62 return ret; 63 } 64 return canonicalize(this, forValue); 65 } 66 canonicalize(NotNode node, ValueNode x)67 private static ValueNode canonicalize(NotNode node, ValueNode x) { 68 if (x instanceof NotNode) { 69 return ((NotNode) x).getValue(); 70 } 71 if (node != null) { 72 return node; 73 } 74 return new NotNode(x); 75 } 76 77 @Override generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen)78 public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) { 79 nodeValueMap.setResult(this, gen.emitNot(nodeValueMap.operand(getValue()))); 80 } 81 82 @Override invertStamp(Stamp outStamp)83 public Stamp invertStamp(Stamp outStamp) { 84 return getArithmeticOp().foldStamp(outStamp); 85 } 86 } 87