001/*
002 * Copyright (c) 2009, 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 com.oracle.graal.graph.*;
026import com.oracle.graal.nodeinfo.*;
027import com.oracle.graal.nodes.spi.*;
028
029/**
030 * The {@code LogicConstantNode} represents a boolean constant.
031 */
032@NodeInfo(nameTemplate = "{p#value}")
033public final class LogicConstantNode extends LogicNode implements LIRLowerable {
034
035    public static final NodeClass<LogicConstantNode> TYPE = NodeClass.create(LogicConstantNode.class);
036    protected final boolean value;
037
038    public LogicConstantNode(boolean value) {
039        super(TYPE);
040        this.value = value;
041    }
042
043    /**
044     * Returns a node for a boolean constant.
045     *
046     * @param v the boolean value for which to create the instruction
047     * @param graph
048     * @return a node representing the boolean
049     */
050    public static LogicConstantNode forBoolean(boolean v, Graph graph) {
051        return graph.unique(new LogicConstantNode(v));
052    }
053
054    /**
055     * Returns a node for a boolean constant.
056     *
057     * @param v the boolean value for which to create the instruction
058     * @return a node representing the boolean
059     */
060    public static LogicConstantNode forBoolean(boolean v) {
061        return new LogicConstantNode(v);
062    }
063
064    /**
065     * Gets a constant for {@code true}.
066     */
067    public static LogicConstantNode tautology(Graph graph) {
068        return forBoolean(true, graph);
069    }
070
071    /**
072     * Gets a constant for {@code false}.
073     */
074    public static LogicConstantNode contradiction(Graph graph) {
075        return forBoolean(false, graph);
076    }
077
078    /**
079     * Gets a constant for {@code true}.
080     */
081    public static LogicConstantNode tautology() {
082        return forBoolean(true);
083    }
084
085    /**
086     * Gets a constant for {@code false}.
087     */
088    public static LogicConstantNode contradiction() {
089        return forBoolean(false);
090    }
091
092    public boolean getValue() {
093        return value;
094    }
095
096    @Override
097    public void generate(NodeLIRBuilderTool generator) {
098        // nothing to do
099    }
100}