KickJava   Java API By Example, From Geeks To Geeks.

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


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.List JavaDoc;
38 import java.util.ArrayList JavaDoc;
39 import java.util.Arrays JavaDoc;
40
41 /**
42  * A node that represents a LOOKUPSWITCH instruction.
43  *
44  * @author Eric Bruneton
45  */
46
47 public class LookupSwitchInsnNode extends AbstractInsnNode {
48
49   /**
50    * Beginning of the default handler block.
51    */
52
53   public Label dflt;
54
55   /**
56    * The values of the keys. This list is a list a {@link java.lang.Integer
57    * Integer} objects.
58    */
59
60   public final List JavaDoc keys;
61
62   /**
63    * Beginnings of the handler blocks. This list is a list of {@link Label
64    * Label} objects.
65    */
66
67   public final List JavaDoc labels;
68
69   /**
70    * Constructs a new {@link LookupSwitchInsnNode LookupSwitchInsnNode} object.
71    *
72    * @param dflt beginning of the default handler block.
73    * @param keys the values of the keys.
74    * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is the
75    * beginning of the handler block for the <tt>keys[i]</tt> key.
76    */
77
78   public LookupSwitchInsnNode (
79     final Label dflt,
80     final int[] keys,
81     final Label[] labels)
82   {
83     super(Constants.LOOKUPSWITCH);
84     this.dflt = dflt;
85     this.keys = new ArrayList JavaDoc();
86     this.labels = new ArrayList JavaDoc();
87     if (keys != null) {
88       for (int i = 0; i < keys.length; ++i) {
89         this.keys.add(new Integer JavaDoc(keys[i]));
90       }
91     }
92     if (labels != null) {
93       this.labels.addAll(Arrays.asList(labels));
94     }
95   }
96
97   public void accept (final CodeVisitor cv) {
98     int[] keys = new int[this.keys.size()];
99     for (int i = 0; i < keys.length; ++i) {
100       keys[i] = ((Integer JavaDoc)this.keys.get(i)).intValue();
101     }
102     Label[] labels = new Label[this.labels.size()];
103     this.labels.toArray(labels);
104     cv.visitLookupSwitchInsn(dflt, keys, labels);
105   }
106 }
107
Popular Tags