001/***
002 * ASM: a very small and fast Java bytecode manipulation framework
003 * Copyright (c) 2000-2011 INRIA, France Telecom
004 * All rights reserved.
005 *
006 * Redistribution and use in source and binary forms, with or without
007 * modification, are permitted provided that the following conditions
008 * are met:
009 * 1. Redistributions of source code must retain the above copyright
010 *    notice, this list of conditions and the following disclaimer.
011 * 2. Redistributions in binary form must reproduce the above copyright
012 *    notice, this list of conditions and the following disclaimer in the
013 *    documentation and/or other materials provided with the distribution.
014 * 3. Neither the name of the copyright holders nor the names of its
015 *    contributors may be used to endorse or promote products derived from
016 *    this software without specific prior written permission.
017 *
018 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
019 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
020 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
021 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
022 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
023 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
024 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
025 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
026 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
027 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
028 * THE POSSIBILITY OF SUCH DAMAGE.
029 */
030package io.ebean.enhance.asm.tree;
031
032import io.ebean.enhance.asm.MethodVisitor;
033
034import java.util.Map;
035
036/**
037 * A node that represents an instruction with a single int operand.
038 * 
039 * @author Eric Bruneton
040 */
041public class IntInsnNode extends AbstractInsnNode {
042
043    /**
044     * The operand of this instruction.
045     */
046    public int operand;
047
048    /**
049     * Constructs a new {@link IntInsnNode}.
050     * 
051     * @param opcode
052     *            the opcode of the instruction to be constructed. This opcode
053     *            must be BIPUSH, SIPUSH or NEWARRAY.
054     * @param operand
055     *            the operand of the instruction to be constructed.
056     */
057    public IntInsnNode(final int opcode, final int operand) {
058        super(opcode);
059        this.operand = operand;
060    }
061
062    /**
063     * Sets the opcode of this instruction.
064     * 
065     * @param opcode
066     *            the new instruction opcode. This opcode must be BIPUSH, SIPUSH
067     *            or NEWARRAY.
068     */
069    public void setOpcode(final int opcode) {
070        this.opcode = opcode;
071    }
072
073    @Override
074    public int getType() {
075        return INT_INSN;
076    }
077
078    @Override
079    public void accept(final MethodVisitor mv) {
080        mv.visitIntInsn(opcode, operand);
081        acceptAnnotations(mv);
082    }
083
084    @Override
085    public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) {
086        return new IntInsnNode(opcode, operand).cloneAnnotations(this);
087    }
088}