/*

 * 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.  Oracle designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Oracle in the LICENSE file that accompanied this code.

 *

 * 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.

 */

/*

 * This file is available under and governed by the GNU General Public

 * License version 2 only, as published by the Free Software Foundation.

 * However, the following notice accompanied the original version of this

 * file:

 *

 * ASM: a very small and fast Java bytecode manipulation framework

 * Copyright (c) 2000-2011 INRIA, France Telecom

 * All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the copyright holders nor the names of its

 *    contributors may be used to endorse or promote products derived from

 *    this software without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"

 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE

 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR

 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF

 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS

 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN

 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)

 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF

 * THE POSSIBILITY OF SUCH DAMAGE.

 */

package jdk.internal.org.objectweb.asm.tree;

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

import java.util.Map;

import jdk.internal.org.objectweb.asm.Label;

import jdk.internal.org.objectweb.asm.MethodVisitor;

import jdk.internal.org.objectweb.asm.Opcodes;

/**

 * A node that represents a LOOKUPSWITCH instruction.

 *

 * @author Eric Bruneton

 */

public class LookupSwitchInsnNode extends AbstractInsnNode {

    /**

     * Beginning of the default handler block.

     */

    public LabelNode dflt;

    /**

     * The values of the keys. This list is a list of {@link Integer} objects.

     */

    public List<Integer> keys;

    /**

     * Beginnings of the handler blocks. This list is a list of

     * {@link LabelNode} objects.

     */

    public List<LabelNode> labels;

    /**

     * Constructs a new {@link LookupSwitchInsnNode}.

     *

     * @param dflt

     *            beginning of the default handler block.

     * @param keys

     *            the values of the keys.

     * @param labels

     *            beginnings of the handler blocks. <tt>labels[i]</tt> is the

     *            beginning of the handler block for the <tt>keys[i]</tt> key.

     */

    public LookupSwitchInsnNode(final LabelNode dflt, final int[] keys,

            final LabelNode[] labels) {

        super(Opcodes.LOOKUPSWITCH);

        this.dflt = dflt;

        this.keys = new ArrayList<Integer>(keys == null ? 0 : keys.length);

        this.labels = new ArrayList<LabelNode>(labels == null ? 0

                : labels.length);

        if (keys != null) {

            for (int i = 0; i < keys.length; ++i) {

                this.keys.add(keys[i]);

            }

        }

        if (labels != null) {

            this.labels.addAll(Arrays.asList(labels));

        }

    }

    @Override

    public int getType() {

        return LOOKUPSWITCH_INSN;

    }

    @Override

    public void accept(final MethodVisitor mv) {

        int[] keys = new int[this.keys.size()];

        for (int i = 0; i < keys.length; ++i) {

            keys[i] = this.keys.get(i).intValue();

        }

        Label[] labels = new Label[this.labels.size()];

        for (int i = 0; i < labels.length; ++i) {

            labels[i] = this.labels.get(i).getLabel();

        }

        mv.visitLookupSwitchInsn(dflt.getLabel(), keys, labels);

        acceptAnnotations(mv);

    }

    @Override

    public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) {

        LookupSwitchInsnNode clone = new LookupSwitchInsnNode(clone(dflt,

                labels), null, clone(this.labels, labels));

        clone.keys.addAll(keys);

        return clone.cloneAnnotations(this);

    }

}