1/* 2 * Copyright (c) 2011, 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; 24 25import static org.graalvm.compiler.nodeinfo.InputType.Condition; 26import static org.graalvm.compiler.nodeinfo.NodeSize.SIZE_1; 27 28import org.graalvm.compiler.core.common.type.StampFactory; 29import org.graalvm.compiler.graph.Node.IndirectCanonicalization; 30import org.graalvm.compiler.graph.NodeClass; 31import org.graalvm.compiler.nodeinfo.NodeInfo; 32import org.graalvm.compiler.nodes.calc.FloatingNode; 33 34@NodeInfo(allowedUsageTypes = {Condition}, size = SIZE_1) 35public abstract class LogicNode extends FloatingNode implements IndirectCanonicalization { 36 37 public static final NodeClass<LogicNode> TYPE = NodeClass.create(LogicNode.class); 38 39 public LogicNode(NodeClass<? extends LogicNode> c) { 40 super(c, StampFactory.forVoid()); 41 } 42 43 public static LogicNode and(LogicNode a, LogicNode b, double shortCircuitProbability) { 44 return and(a, false, b, false, shortCircuitProbability); 45 } 46 47 public static LogicNode and(LogicNode a, boolean negateA, LogicNode b, boolean negateB, double shortCircuitProbability) { 48 StructuredGraph graph = a.graph(); 49 ShortCircuitOrNode notAorNotB = graph.unique(new ShortCircuitOrNode(a, !negateA, b, !negateB, shortCircuitProbability)); 50 return graph.unique(new LogicNegationNode(notAorNotB)); 51 } 52 53 public static LogicNode or(LogicNode a, LogicNode b, double shortCircuitProbability) { 54 return or(a, false, b, false, shortCircuitProbability); 55 } 56 57 public static LogicNode or(LogicNode a, boolean negateA, LogicNode b, boolean negateB, double shortCircuitProbability) { 58 return a.graph().unique(new ShortCircuitOrNode(a, negateA, b, negateB, shortCircuitProbability)); 59 } 60 61 public final boolean isTautology() { 62 if (this instanceof LogicConstantNode) { 63 LogicConstantNode logicConstantNode = (LogicConstantNode) this; 64 return logicConstantNode.getValue(); 65 } 66 67 return false; 68 } 69 70 public final boolean isContradiction() { 71 if (this instanceof LogicConstantNode) { 72 LogicConstantNode logicConstantNode = (LogicConstantNode) this; 73 return !logicConstantNode.getValue(); 74 } 75 76 return false; 77 } 78} 79