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 jump instruction. A jump instruction is an
37: * instruction that may jump to another instruction.
38: *
39: * @author Eric Bruneton
40: */
41: public class JumpInsnNode extends AbstractInsnNode {
42:
43: /**
44: * The operand of this instruction. This operand is a label that designates
45: * the instruction to which this instruction may jump.
46: */
47: public LabelNode label;
48:
49: /**
50: * Constructs a new {@link JumpInsnNode}.
51: *
52: * @param opcode the opcode of the type instruction to be constructed. This
53: * opcode must be IFEQ, IFNE, IFLT, IFGE, IFGT, IFLE, IF_ICMPEQ,
54: * IF_ICMPNE, IF_ICMPLT, IF_ICMPGE, IF_ICMPGT, IF_ICMPLE, IF_ACMPEQ,
55: * IF_ACMPNE, GOTO, JSR, IFNULL or IFNONNULL.
56: * @param label the operand of the instruction to be constructed. This
57: * operand is a label that designates the instruction to which the
58: * jump instruction may jump.
59: */
60: public JumpInsnNode(final int opcode, final LabelNode label) {
61: super (opcode);
62: this .label = label;
63: }
64:
65: /**
66: * Sets the opcode of this instruction.
67: *
68: * @param opcode the new instruction opcode. This opcode must be IFEQ, IFNE,
69: * IFLT, IFGE, IFGT, IFLE, IF_ICMPEQ, IF_ICMPNE, IF_ICMPLT,
70: * IF_ICMPGE, IF_ICMPGT, IF_ICMPLE, IF_ACMPEQ, IF_ACMPNE, GOTO, JSR,
71: * IFNULL or IFNONNULL.
72: */
73: public void setOpcode(final int opcode) {
74: this .opcode = opcode;
75: }
76:
77: public int getType() {
78: return JUMP_INSN;
79: }
80:
81: public void accept(final MethodVisitor mv) {
82: mv.visitJumpInsn(opcode, label.getLabel());
83: }
84:
85: public AbstractInsnNode clone(final Map labels) {
86: return new JumpInsnNode(opcode, clone(label, labels));
87: }
88: }
|