1 // ASM: a very small and fast Java bytecode manipulation framework 2 // Copyright (c) 2000-2011 INRIA, France Telecom 3 // All rights reserved. 4 // 5 // Redistribution and use in source and binary forms, with or without 6 // modification, are permitted provided that the following conditions 7 // are met: 8 // 1. Redistributions of source code must retain the above copyright 9 // notice, this list of conditions and the following disclaimer. 10 // 2. Redistributions in binary form must reproduce the above copyright 11 // notice, this list of conditions and the following disclaimer in the 12 // documentation and/or other materials provided with the distribution. 13 // 3. Neither the name of the copyright holders nor the names of its 14 // contributors may be used to endorse or promote products derived from 15 // this software without specific prior written permission. 16 // 17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 18 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 21 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 25 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 26 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF 27 // THE POSSIBILITY OF SUCH DAMAGE. 28 package org.objectweb.asm.tree; 29 30 import java.util.Map; 31 import org.objectweb.asm.MethodVisitor; 32 33 /** 34 * A node that represents an instruction with a single int operand. 35 * 36 * @author Eric Bruneton 37 */ 38 public class IntInsnNode extends AbstractInsnNode { 39 40 /** The operand of this instruction. */ 41 public int operand; 42 43 /** 44 * Constructs a new {@link IntInsnNode}. 45 * 46 * @param opcode the opcode of the instruction to be constructed. This opcode must be BIPUSH, 47 * SIPUSH or NEWARRAY. 48 * @param operand the operand of the instruction to be constructed. 49 */ IntInsnNode(final int opcode, final int operand)50 public IntInsnNode(final int opcode, final int operand) { 51 super(opcode); 52 this.operand = operand; 53 } 54 55 /** 56 * Sets the opcode of this instruction. 57 * 58 * @param opcode the new instruction opcode. This opcode must be BIPUSH, SIPUSH or NEWARRAY. 59 */ setOpcode(final int opcode)60 public void setOpcode(final int opcode) { 61 this.opcode = opcode; 62 } 63 64 @Override getType()65 public int getType() { 66 return INT_INSN; 67 } 68 69 @Override accept(final MethodVisitor methodVisitor)70 public void accept(final MethodVisitor methodVisitor) { 71 methodVisitor.visitIntInsn(opcode, operand); 72 acceptAnnotations(methodVisitor); 73 } 74 75 @Override clone(final Map<LabelNode, LabelNode> clonedLabels)76 public AbstractInsnNode clone(final Map<LabelNode, LabelNode> clonedLabels) { 77 return new IntInsnNode(opcode, operand).cloneAnnotations(this); 78 } 79 } 80