KickJava   Java API By Example, From Geeks To Geeks.

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