KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > oracle > toplink > libraries > asm > tree > TableSwitchInsnNode


1 /***
2  * ASM: a very small and fast Java bytecode manipulation framework
3  * Copyright (c) 2000,2002,2003 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
31 package oracle.toplink.libraries.asm.tree;
32
33 import oracle.toplink.libraries.asm.Label;
34 import oracle.toplink.libraries.asm.Constants;
35 import oracle.toplink.libraries.asm.CodeVisitor;
36
37 import java.util.ArrayList JavaDoc;
38 import java.util.Arrays JavaDoc;
39 import java.util.List JavaDoc;
40
41 /**
42  * A node that represents a TABLESWITCH instruction.
43  *
44  * @author Eric Bruneton
45  */
46
47 public class TableSwitchInsnNode extends AbstractInsnNode {
48
49   /**
50    * The minimum key value.
51    */
52
53   public int min;
54
55   /**
56    * The maximum key value.
57    */
58
59   public int max;
60
61   /**
62    * Beginning of the default handler block.
63    */
64
65   public Label dflt;
66
67   /**
68    * Beginnings of the handler blocks. This list is a list of {@link Label
69    * Label} objects.
70    */
71
72   public final List JavaDoc labels;
73
74   /**
75    * Constructs a new {@link TableSwitchInsnNode TableSwitchInsnNode}.
76    *
77    * @param min the minimum key value.
78    * @param max the maximum key value.
79    * @param dflt beginning of the default handler block.
80    * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is the
81    * beginning of the handler block for the <tt>min + i</tt> key.
82    */
83
84   public TableSwitchInsnNode (
85     final int min,
86     final int max,
87     final Label dflt,
88     final Label[] labels)
89   {
90     super(Constants.TABLESWITCH);
91     this.min = min;
92     this.max = max;
93     this.dflt = dflt;
94     this.labels = new ArrayList JavaDoc();
95     if (labels != null) {
96       this.labels.addAll(Arrays.asList(labels));
97     }
98   }
99
100   public void accept (final CodeVisitor cv) {
101     Label[] labels = new Label[this.labels.size()];
102     this.labels.toArray(labels);
103     cv.visitTableSwitchInsn(min, max, dflt, labels);
104   }
105 }
106
Popular Tags