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