| /*** |
| * ASM: a very small and fast Java bytecode manipulation framework |
| * Copyright (c) 2000-2007 INRIA, France Telecom |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * 3. Neither the name of the copyright holders nor the names of its |
| * contributors may be used to endorse or promote products derived from |
| * this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| * THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| package org.eclipse.persistence.internal.libraries.asm.tree; |
| |
| import java.util.Map; |
| |
| import org.eclipse.persistence.internal.libraries.asm.MethodVisitor; |
| |
| /** |
| * A node that represents a zero operand instruction. |
| * |
| * @author Eric Bruneton |
| */ |
| public class InsnNode extends AbstractInsnNode { |
| |
| /** |
| * Constructs a new {@link InsnNode}. |
| * |
| * @param opcode the opcode of the instruction to be constructed. This |
| * opcode must be NOP, ACONST_NULL, ICONST_M1, ICONST_0, ICONST_1, |
| * ICONST_2, ICONST_3, ICONST_4, ICONST_5, LCONST_0, LCONST_1, |
| * FCONST_0, FCONST_1, FCONST_2, DCONST_0, DCONST_1, IALOAD, LALOAD, |
| * FALOAD, DALOAD, AALOAD, BALOAD, CALOAD, SALOAD, IASTORE, LASTORE, |
| * FASTORE, DASTORE, AASTORE, BASTORE, CASTORE, SASTORE, POP, POP2, |
| * DUP, DUP_X1, DUP_X2, DUP2, DUP2_X1, DUP2_X2, SWAP, IADD, LADD, |
| * FADD, DADD, ISUB, LSUB, FSUB, DSUB, IMUL, LMUL, FMUL, DMUL, IDIV, |
| * LDIV, FDIV, DDIV, IREM, LREM, FREM, DREM, INEG, LNEG, FNEG, DNEG, |
| * ISHL, LSHL, ISHR, LSHR, IUSHR, LUSHR, IAND, LAND, IOR, LOR, IXOR, |
| * LXOR, I2L, I2F, I2D, L2I, L2F, L2D, F2I, F2L, F2D, D2I, D2L, D2F, |
| * I2B, I2C, I2S, LCMP, FCMPL, FCMPG, DCMPL, DCMPG, IRETURN, LRETURN, |
| * FRETURN, DRETURN, ARETURN, RETURN, ARRAYLENGTH, ATHROW, |
| * MONITORENTER, or MONITOREXIT. |
| */ |
| public InsnNode(final int opcode) { |
| super(opcode); |
| } |
| |
| public int getType() { |
| return INSN; |
| } |
| |
| /** |
| * Makes the given visitor visit this instruction. |
| * |
| * @param mv a method visitor. |
| */ |
| public void accept(final MethodVisitor mv) { |
| mv.visitInsn(opcode); |
| } |
| |
| public AbstractInsnNode clone(final Map labels) { |
| return new InsnNode(opcode); |
| } |
| } |