<commit_before>/*
 * Copyright (c) 2009, 2011, 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.nodes.*;
import com.oracle.graal.nodes.spi.*;
import com.oracle.graal.nodes.type.*;

/**
 * The {@code LogicNode} class definition.
 */
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) {
        assert v1.stamp().isCompatible(v2.stamp());
        return graph.unique(new AndNode(StampTool.and(v1.stamp(), v2.stamp()), v1, v2));
    }

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

    public static BitLogicNode xor(StructuredGraph graph, ValueNode v1, ValueNode v2) {
        assert v1.stamp().isCompatible(v2.stamp());
        return graph.unique(new XorNode(StampTool.xor(v1.stamp(), v2.stamp()), v1, v2));
    }
}
<commit_msg>non-adding factory methods in BitLogicNode<commit_after>/*
 * Copyright (c) 2009, 2011, 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.nodes.*;
import com.oracle.graal.nodes.spi.*;
import com.oracle.graal.nodes.type.*;

/**
 * The {@code LogicNode} class definition.
 */
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) {
        assert v1.stamp().isCompatible(v2.stamp());
        return graph.unique(new AndNode(StampTool.and(v1.stamp(), v2.stamp()), v1, v2));
    }

    public static BitLogicNode and(ValueNode v1, ValueNode v2) {
        assert v1.stamp().isCompatible(v2.stamp());
        return new AndNode(StampTool.and(v1.stamp(), v2.stamp()), v1, v2);
    }

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

    public static BitLogicNode or(ValueNode v1, ValueNode v2) {
        assert v1.stamp().isCompatible(v2.stamp());
        return new OrNode(StampTool.or(v1.stamp(), v2.stamp()), v1, v2);
    }

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

    public static BitLogicNode xor(ValueNode v1, ValueNode v2) {
        assert v1.stamp().isCompatible(v2.stamp());
        return new XorNode(StampTool.xor(v1.stamp(), v2.stamp()), v1, v2);
    }
}

{'fraction_non_alphanumeric': 0.10036036036036036, 'fraction_numerical': 0.023783783783783784, 'mean_word_length': 3.524042379788101, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '985404', 'n_tokens_mistral': 1747, 'n_tokens_neox': 1659, 'n_words': 601}