Home | History | Annotate | Download | only in tree 
      1 /***
      2  * ASM: a very small and fast Java bytecode manipulation framework
      3  * Copyright (c) 2000-2007 INRIA, France Telecom
      4  * All rights reserved.
      5  *
      6  * Redistribution and use in source and binary forms, with or without
      7  * modification, are permitted provided that the following conditions
      8  * are met:
      9  * 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  */
     30 package org.mockito.asm.tree;
     31 
     32 import java.util.Map;
     33 
     34 import org.mockito.asm.MethodVisitor;
     35 
     36 /**
     37  * A node that represents a jump instruction. A jump instruction is an
     38  * instruction that may jump to another instruction.
     39  *
     40  * @author Eric Bruneton
     41  */
     42 public class JumpInsnNode extends AbstractInsnNode {
     43 
     44     /**
     45      * The operand of this instruction. This operand is a label that designates
     46      * the instruction to which this instruction may jump.
     47      */
     48     public LabelNode label;
     49 
     50     /**
     51      * Constructs a new {@link JumpInsnNode}.
     52      *
     53      * @param opcode the opcode of the type instruction to be constructed. This
     54      *        opcode must be IFEQ, IFNE, IFLT, IFGE, IFGT, IFLE, IF_ICMPEQ,
     55      *        IF_ICMPNE, IF_ICMPLT, IF_ICMPGE, IF_ICMPGT, IF_ICMPLE, IF_ACMPEQ,
     56      *        IF_ACMPNE, GOTO, JSR, IFNULL or IFNONNULL.
     57      * @param label the operand of the instruction to be constructed. This
     58      *        operand is a label that designates the instruction to which the
     59      *        jump instruction may jump.
     60      */
     61     public JumpInsnNode(final int opcode, final LabelNode label) {
     62         super(opcode);
     63         this.label = label;
     64     }
     65 
     66     /**
     67      * Sets the opcode of this instruction.
     68      *
     69      * @param opcode the new instruction opcode. This opcode must be IFEQ, IFNE,
     70      *        IFLT, IFGE, IFGT, IFLE, IF_ICMPEQ, IF_ICMPNE, IF_ICMPLT,
     71      *        IF_ICMPGE, IF_ICMPGT, IF_ICMPLE, IF_ACMPEQ, IF_ACMPNE, GOTO, JSR,
     72      *        IFNULL or IFNONNULL.
     73      */
     74     public void setOpcode(final int opcode) {
     75         this.opcode = opcode;
     76     }
     77 
     78     public int getType() {
     79         return JUMP_INSN;
     80     }
     81 
     82     public void accept(final MethodVisitor mv) {
     83         mv.visitJumpInsn(opcode, label.getLabel());
     84     }
     85 
     86     public AbstractInsnNode clone(final Map labels) {
     87         return new JumpInsnNode(opcode, clone(label, labels));
     88     }
     89 }
     90