1 /* 2 * Copyright (c) 2009, 2014, 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 package org.graalvm.compiler.nodes.calc; 24 25 import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_1; 26 import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_1; 27 28 import org.graalvm.compiler.core.common.type.ArithmeticOpTable; 29 import org.graalvm.compiler.core.common.type.ArithmeticOpTable.UnaryOp.Not; 30 import org.graalvm.compiler.graph.NodeClass; 31 import org.graalvm.compiler.graph.spi.CanonicalizerTool; 32 import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool; 33 import org.graalvm.compiler.nodeinfo.NodeInfo; 34 import org.graalvm.compiler.nodes.ValueNode; 35 import org.graalvm.compiler.nodes.spi.ArithmeticLIRLowerable; 36 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool; 37 38 /** 39 * Binary negation of long or integer values. 40 */ 41 @NodeInfo(cycles = CYCLES_1, size = SIZE_1) 42 public final class NotNode extends UnaryArithmeticNode<Not> implements ArithmeticLIRLowerable, NarrowableArithmeticNode { 43 44 public static final NodeClass<NotNode> TYPE = NodeClass.create(NotNode.class); 45 46 public NotNode(ValueNode x) { 47 super(TYPE, ArithmeticOpTable::getNot, x); 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 NotNode) { 57 return ((NotNode) forValue).getValue(); 58 } 59 return this; 60 } 61 62 @Override 63 public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) { 64 nodeValueMap.setResult(this, gen.emitNot(nodeValueMap.operand(getValue()))); 65 } 66 }