1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
3 *
4 * This code is free software; you can redistribute it and/or modify it
5 * under the terms of the GNU General Public License version 2 only, as
6 * published by the Free Software Foundation. Oracle designates this
7 * particular file as subject to the "Classpath" exception as provided
8 * by Oracle in the LICENSE file that accompanied this code.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 */
24
25 /*
26 * This file is available under and governed by the GNU General Public
27 * License version 2 only, as published by the Free Software Foundation.
28 * However, the following notice accompanied the original version of this
29 * file:
30 *
31 * ASM: a very small and fast Java bytecode manipulation framework
32 * Copyright (c) 2000-2011 INRIA, France Telecom
33 * All rights reserved.
34 *
35 * Redistribution and use in source and binary forms, with or without
36 * modification, are permitted provided that the following conditions
37 * are met:
38 * 1. Redistributions of source code must retain the above copyright
39 * notice, this list of conditions and the following disclaimer.
40 * 2. Redistributions in binary form must reproduce the above copyright
41 * notice, this list of conditions and the following disclaimer in the
42 * documentation and/or other materials provided with the distribution.
43 * 3. Neither the name of the copyright holders nor the names of its
44 * contributors may be used to endorse or promote products derived from
45 * this software without specific prior written permission.
46 *
47 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
48 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
49 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
50 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
51 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
52 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
53 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
54 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
55 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
56 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
57 * THE POSSIBILITY OF SUCH DAMAGE.
58 */
59 package jdk.internal.org.objectweb.asm.tree;
60
61 import java.util.ArrayList;
62 import java.util.Arrays;
63 import java.util.List;
64 import java.util.Map;
65
66 import jdk.internal.org.objectweb.asm.Label;
67 import jdk.internal.org.objectweb.asm.MethodVisitor;
68 import jdk.internal.org.objectweb.asm.Opcodes;
69
70 /**
71 * A node that represents a TABLESWITCH instruction.
72 *
73 * @author Eric Bruneton
74 */
75 public class TableSwitchInsnNode extends AbstractInsnNode {
76
77 /**
78 * The minimum key value.
79 */
80 public int min;
81
82 /**
83 * The maximum key value.
84 */
85 public int max;
86
87 /**
88 * Beginning of the default handler block.
89 */
90 public LabelNode dflt;
91
92 /**
93 * Beginnings of the handler blocks. This list is a list of
94 * {@link LabelNode} objects.
95 */
96 public List<LabelNode> labels;
97
98 /**
99 * Constructs a new {@link TableSwitchInsnNode}.
100 *
101 * @param min the minimum key value.
102 * @param max the maximum key value.
103 * @param dflt beginning of the default handler block.
104 * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is
105 * the beginning of the handler block for the <tt>min + i</tt> key.
106 */
107 public TableSwitchInsnNode(
108 final int min,
109 final int max,
110 final LabelNode dflt,
111 final LabelNode... labels)
112 {
113 super(Opcodes.TABLESWITCH);
114 this.min = min;
115 this.max = max;
116 this.dflt = dflt;
117 this.labels = new ArrayList<LabelNode>();
118 if (labels != null) {
119 this.labels.addAll(Arrays.asList(labels));
120 }
121 }
122
123 @Override
124 public int getType() {
125 return TABLESWITCH_INSN;
126 }
127
128 @Override
129 public void accept(final MethodVisitor mv) {
130 Label[] labels = new Label[this.labels.size()];
131 for (int i = 0; i < labels.length; ++i) {
132 labels[i] = this.labels.get(i).getLabel();
133 }
134 mv.visitTableSwitchInsn(min, max, dflt.getLabel(), labels);
135 }
136
137 @Override
138 public AbstractInsnNode clone(final Map<LabelNode, LabelNode> labels) {
139 return new TableSwitchInsnNode(min,
140 max,
141 clone(dflt, labels),
142 clone(this.labels, labels));
143 }
144 }