/*
 * Copyright (c) 2009, 2014, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */
package com.oracle.graal.nodes.calc;

import com.oracle.graal.compiler.common.type.*;
import com.oracle.graal.graph.*;
import com.oracle.graal.nodes.*;
import com.oracle.graal.nodes.spi.*;

/**
 * The {@code LogicNode} class definition.
 */
@NodeInfo
public abstract class BitLogicNode extends BinaryNode implements ArithmeticLIRLowerable, NarrowableArithmeticNode {

    /**
     * Constructs a new logic operation node.
     *
     * @param x the first input into this node
     * @param y the second input into this node
     */
    public BitLogicNode(Stamp stamp, ValueNode x, ValueNode y) {
        super(stamp, x, y);
        assert stamp instanceof IntegerStamp;
    }

    public static BitLogicNode and(StructuredGraph graph, ValueNode v1, ValueNode v2) {
        return graph.unique(new AndNode(v1, v2));
    }

    public static BitLogicNode and(ValueNode v1, ValueNode v2) {
        return new AndNode(v1, v2);
    }

    public static BitLogicNode or(StructuredGraph graph, ValueNode v1, ValueNode v2) {
        return graph.unique(new OrNode(v1, v2));
    }

    public static BitLogicNode or(ValueNode v1, ValueNode v2) {
        return new OrNode(v1, v2);
    }

    public static BitLogicNode xor(StructuredGraph graph, ValueNode v1, ValueNode v2) {
        return graph.unique(new XorNode(v1, v2));
    }

    public static BitLogicNode xor(ValueNode v1, ValueNode v2) {
        return new XorNode(v1, v2);
    }
}