001/*
002 * Copyright (c) 2011, 2015, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.nodes;
024
025import static com.oracle.graal.nodeinfo.InputType.*;
026
027import com.oracle.graal.compiler.common.type.*;
028import com.oracle.graal.graph.*;
029import com.oracle.graal.nodeinfo.*;
030import com.oracle.graal.nodes.calc.*;
031
032@NodeInfo(allowedUsageTypes = {Condition})
033public abstract class LogicNode extends FloatingNode {
034
035    public static final NodeClass<LogicNode> TYPE = NodeClass.create(LogicNode.class);
036
037    public LogicNode(NodeClass<? extends LogicNode> c) {
038        super(c, StampFactory.forVoid());
039    }
040
041    public static LogicNode and(LogicNode a, LogicNode b, double shortCircuitProbability) {
042        return and(a, false, b, false, shortCircuitProbability);
043    }
044
045    public static LogicNode and(LogicNode a, boolean negateA, LogicNode b, boolean negateB, double shortCircuitProbability) {
046        StructuredGraph graph = a.graph();
047        ShortCircuitOrNode notAorNotB = graph.unique(new ShortCircuitOrNode(a, !negateA, b, !negateB, shortCircuitProbability));
048        return graph.unique(new LogicNegationNode(notAorNotB));
049    }
050
051    public static LogicNode or(LogicNode a, LogicNode b, double shortCircuitProbability) {
052        return or(a, false, b, false, shortCircuitProbability);
053    }
054
055    public static LogicNode or(LogicNode a, boolean negateA, LogicNode b, boolean negateB, double shortCircuitProbability) {
056        return a.graph().unique(new ShortCircuitOrNode(a, negateA, b, negateB, shortCircuitProbability));
057    }
058
059    public final boolean isTautology() {
060        if (this instanceof LogicConstantNode) {
061            LogicConstantNode logicConstantNode = (LogicConstantNode) this;
062            return logicConstantNode.getValue();
063        }
064
065        return false;
066    }
067
068    public final boolean isContradiction() {
069        if (this instanceof LogicConstantNode) {
070            LogicConstantNode logicConstantNode = (LogicConstantNode) this;
071            return !logicConstantNode.getValue();
072        }
073
074        return false;
075    }
076}