/*

 * Copyright (c) 2011, 2019, 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 org.graalvm.compiler.nodes.calc;

import org.graalvm.compiler.core.common.type.ArithmeticOpTable;

import org.graalvm.compiler.core.common.type.ArithmeticOpTable.BinaryOp;

import org.graalvm.compiler.core.common.type.ArithmeticOpTable.BinaryOp.And;

import org.graalvm.compiler.core.common.type.IntegerStamp;

import org.graalvm.compiler.core.common.type.Stamp;

import org.graalvm.compiler.graph.NodeClass;

import org.graalvm.compiler.graph.spi.Canonicalizable.BinaryCommutative;

import org.graalvm.compiler.graph.spi.CanonicalizerTool;

import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;

import org.graalvm.compiler.nodeinfo.NodeInfo;

import org.graalvm.compiler.nodes.ConstantNode;

import org.graalvm.compiler.nodes.NodeView;

import org.graalvm.compiler.nodes.ValueNode;

import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;

import org.graalvm.compiler.nodes.util.GraphUtil;

import jdk.vm.ci.meta.Constant;

import jdk.vm.ci.meta.PrimitiveConstant;

@NodeInfo(shortName = "&")

public final class AndNode extends BinaryArithmeticNode<And> implements NarrowableArithmeticNode, BinaryCommutative<ValueNode> {

    public static final NodeClass<AndNode> TYPE = NodeClass.create(AndNode.class);

    public AndNode(ValueNode x, ValueNode y) {

        super(TYPE, getArithmeticOpTable(x).getAnd(), x, y);

    }

    public static ValueNode create(ValueNode x, ValueNode y, NodeView view) {

        BinaryOp<And> op = ArithmeticOpTable.forStamp(x.stamp(view)).getAnd();

        Stamp stamp = op.foldStamp(x.stamp(view), y.stamp(view));

        ConstantNode tryConstantFold = tryConstantFold(op, x, y, stamp, view);

        if (tryConstantFold != null) {

            return tryConstantFold;

        }

    }

    @Override

    protected BinaryOp<And> getOp(ArithmeticOpTable table) {

        return table.getAnd();

    }

    @Override

    public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) {

        ValueNode ret = super.canonical(tool, forX, forY);

        if (ret != this) {

            return ret;

        }

        NodeView view = NodeView.from(tool);

    }

        if (GraphUtil.unproxify(forX) == GraphUtil.unproxify(forY)) {

            return forX;

        }

        if (forX.isConstant() && !forY.isConstant()) {

            return new AndNode(forY, forX);

        }

        if (forY.isConstant()) {

            Constant c = forY.asConstant();

            if (op.isNeutral(c)) {

                return forX;

            }

            if (c instanceof PrimitiveConstant && ((PrimitiveConstant) c).getJavaKind().isNumericInteger()) {

                long rawY = ((PrimitiveConstant) c).asLong();

                if (forX instanceof SignExtendNode) {

                    SignExtendNode ext = (SignExtendNode) forX;

                    if (rawY == ((1L << ext.getInputBits()) - 1)) {

                        return new ZeroExtendNode(ext.getValue(), ext.getResultBits());

                    }

                }

            }

            return reassociate(self != null ? self : (AndNode) new AndNode(forX, forY).maybeCommuteInputs(), ValueNode.isConstantPredicate(), forX, forY, view);

        }

        if (forX instanceof NotNode && forY instanceof NotNode) {

            return new NotNode(OrNode.create(((NotNode) forX).getValue(), ((NotNode) forY).getValue(), view));

        }

        return self != null ? self : new AndNode(forX, forY).maybeCommuteInputs();

    }

    @Override

    public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {

        nodeValueMap.setResult(this, gen.emitAnd(nodeValueMap.operand(getX()), nodeValueMap.operand(getY())));

    }

}