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 zero operand instruction.
37: *
38: * @author Eric Bruneton
39: */
40: public class InsnNode extends AbstractInsnNode {
41:
42: private final static InsnNode[] INSNS;
43:
44: static {
45: INSNS = new InsnNode[255];
46: for (int i = 0; i < INSNS.length; ++i) {
47: INSNS[i] = new InsnNode(i);
48: }
49: }
50:
51: /**
52: * Constructs a new {@link InsnNode}.
53: *
54: * @param opcode the opcode of the instruction to be constructed. This
55: * opcode must be NOP, ACONST_NULL, ICONST_M1, ICONST_0, ICONST_1,
56: * ICONST_2, ICONST_3, ICONST_4, ICONST_5, LCONST_0, LCONST_1,
57: * FCONST_0, FCONST_1, FCONST_2, DCONST_0, DCONST_1, IALOAD, LALOAD,
58: * FALOAD, DALOAD, AALOAD, BALOAD, CALOAD, SALOAD, IASTORE, LASTORE,
59: * FASTORE, DASTORE, AASTORE, BASTORE, CASTORE, SASTORE, POP, POP2,
60: * DUP, DUP_X1, DUP_X2, DUP2, DUP2_X1, DUP2_X2, SWAP, IADD, LADD,
61: * FADD, DADD, ISUB, LSUB, FSUB, DSUB, IMUL, LMUL, FMUL, DMUL, IDIV,
62: * LDIV, FDIV, DDIV, IREM, LREM, FREM, DREM, INEG, LNEG, FNEG, DNEG,
63: * ISHL, LSHL, ISHR, LSHR, IUSHR, LUSHR, IAND, LAND, IOR, LOR, IXOR,
64: * LXOR, I2L, I2F, I2D, L2I, L2F, L2D, F2I, F2L, F2D, D2I, D2L, D2F,
65: * I2B, I2C, I2S, LCMP, FCMPL, FCMPG, DCMPL, DCMPG, IRETURN, LRETURN,
66: * FRETURN, DRETURN, ARETURN, RETURN, ARRAYLENGTH, ATHROW,
67: * MONITORENTER, or MONITOREXIT.
68: */
69: public InsnNode(final int opcode) {
70: super (opcode);
71: }
72:
73: public int getType() {
74: return INSN;
75: }
76:
77: /**
78: * Makes the given visitor visit this instruction.
79: *
80: * @param mv a method visitor.
81: */
82: public void accept(final MethodVisitor mv) {
83: mv.visitInsn(opcode);
84: }
85:
86: public AbstractInsnNode clone(final Map labels) {
87: return new InsnNode(opcode);
88: }
89: }
|