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 org.mockito.asm.Label;
33 import org.mockito.asm.MethodVisitor;
34 import org.mockito.asm.Opcodes;
35 
36 import java.util.ArrayList;
37 import java.util.Arrays;
38 import java.util.List;
39 import java.util.Map;
40 
41 /**
42  * A node that represents a TABLESWITCH instruction.
43  *
44  * @author Eric Bruneton
45  */
46 public class TableSwitchInsnNode extends AbstractInsnNode {
47 
48     /**
49      * The minimum key value.
50      */
51     public int min;
52 
53     /**
54      * The maximum key value.
55      */
56     public int max;
57 
58     /**
59      * Beginning of the default handler block.
60      */
61     public LabelNode dflt;
62 
63     /**
64      * Beginnings of the handler blocks. This list is a list of
65      * {@link LabelNode} objects.
66      */
67     public List labels;
68 
69     /**
70      * Constructs a new {@link TableSwitchInsnNode}.
71      *
72      * @param min the minimum key value.
73      * @param max the maximum key value.
74      * @param dflt beginning of the default handler block.
75      * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is
76      *        the beginning of the handler block for the <tt>min + i</tt> key.
77      */
TableSwitchInsnNode( final int min, final int max, final LabelNode dflt, final LabelNode[] labels)78     public TableSwitchInsnNode(
79         final int min,
80         final int max,
81         final LabelNode dflt,
82         final LabelNode[] labels)
83     {
84         super(Opcodes.TABLESWITCH);
85         this.min = min;
86         this.max = max;
87         this.dflt = dflt;
88         this.labels = new ArrayList();
89         if (labels != null) {
90             this.labels.addAll(Arrays.asList(labels));
91         }
92     }
93 
getType()94     public int getType() {
95         return TABLESWITCH_INSN;
96     }
97 
accept(final MethodVisitor mv)98     public void accept(final MethodVisitor mv) {
99         Label[] labels = new Label[this.labels.size()];
100         for (int i = 0; i < labels.length; ++i) {
101             labels[i] = ((LabelNode) this.labels.get(i)).getLabel();
102         }
103         mv.visitTableSwitchInsn(min, max, dflt.getLabel(), labels);
104     }
105 
clone(final Map labels)106     public AbstractInsnNode clone(final Map labels) {
107         return new TableSwitchInsnNode(min,
108                 max,
109                 clone(dflt, labels),
110                 clone(this.labels, labels));
111     }
112 }