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 a local variable instruction. A local variable
37: * instruction is an instruction that loads or stores the value of a local
38: * variable.
39: *
40: * @author Eric Bruneton
41: */
42: public class VarInsnNode extends AbstractInsnNode {
43:
44: /**
45: * The operand of this instruction. This operand is the index of a local
46: * variable.
47: */
48: public int var;
49:
50: /**
51: * Constructs a new {@link VarInsnNode}.
52: *
53: * @param opcode the opcode of the local variable instruction to be
54: * constructed. This opcode must be ILOAD, LLOAD, FLOAD, DLOAD,
55: * ALOAD, ISTORE, LSTORE, FSTORE, DSTORE, ASTORE or RET.
56: * @param var the operand of the instruction to be constructed. This operand
57: * is the index of a local variable.
58: */
59: public VarInsnNode(final int opcode, final int var) {
60: super (opcode);
61: this .var = var;
62: }
63:
64: /**
65: * Sets the opcode of this instruction.
66: *
67: * @param opcode the new instruction opcode. This opcode must be ILOAD,
68: * LLOAD, FLOAD, DLOAD, ALOAD, ISTORE, LSTORE, FSTORE, DSTORE, ASTORE
69: * or RET.
70: */
71: public void setOpcode(final int opcode) {
72: this .opcode = opcode;
73: }
74:
75: public int getType() {
76: return VAR_INSN;
77: }
78:
79: public void accept(final MethodVisitor mv) {
80: mv.visitVarInsn(opcode, var);
81: }
82:
83: public AbstractInsnNode clone(final Map labels) {
84: return new VarInsnNode(opcode, var);
85: }
86: }
|