001: /***
002: * ASM: a very small and fast Java bytecode manipulation framework
003: * Copyright (c) 2000-2005 INRIA, France Telecom
004: * All rights reserved.
005: *
006: * Redistribution and use in source and binary forms, with or without
007: * modification, are permitted provided that the following conditions
008: * are met:
009: * 1. Redistributions of source code must retain the above copyright
010: * notice, this list of conditions and the following disclaimer.
011: * 2. Redistributions in binary form must reproduce the above copyright
012: * notice, this list of conditions and the following disclaimer in the
013: * documentation and/or other materials provided with the distribution.
014: * 3. Neither the name of the copyright holders nor the names of its
015: * contributors may be used to endorse or promote products derived from
016: * this software without specific prior written permission.
017: *
018: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
019: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
020: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
021: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
022: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
023: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
024: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
025: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
026: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
027: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
028: * THE POSSIBILITY OF SUCH DAMAGE.
029: */package com.tc.asm.tree;
030:
031: import com.tc.asm.Label;
032: import com.tc.asm.MethodVisitor;
033: import com.tc.asm.Opcodes;
034:
035: import java.util.ArrayList;
036: import java.util.Arrays;
037: import java.util.List;
038: import java.util.Map;
039:
040: /**
041: * A node that represents a TABLESWITCH instruction.
042: *
043: * @author Eric Bruneton
044: */
045: public class TableSwitchInsnNode extends AbstractInsnNode {
046:
047: /**
048: * The minimum key value.
049: */
050: public int min;
051:
052: /**
053: * The maximum key value.
054: */
055: public int max;
056:
057: /**
058: * Beginning of the default handler block.
059: */
060: public LabelNode dflt;
061:
062: /**
063: * Beginnings of the handler blocks. This list is a list of
064: * {@link LabelNode} objects.
065: */
066: public List labels;
067:
068: /**
069: * Constructs a new {@link TableSwitchInsnNode}.
070: *
071: * @param min the minimum key value.
072: * @param max the maximum key value.
073: * @param dflt beginning of the default handler block.
074: * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is
075: * the beginning of the handler block for the <tt>min + i</tt> key.
076: */
077: public TableSwitchInsnNode(final int min, final int max,
078: final LabelNode dflt, final LabelNode[] labels) {
079: super (Opcodes.TABLESWITCH);
080: this .min = min;
081: this .max = max;
082: this .dflt = dflt;
083: this .labels = new ArrayList();
084: if (labels != null) {
085: this .labels.addAll(Arrays.asList(labels));
086: }
087: }
088:
089: public int getType() {
090: return TABLESWITCH_INSN;
091: }
092:
093: public void accept(final MethodVisitor mv) {
094: Label[] labels = new Label[this .labels.size()];
095: for (int i = 0; i < labels.length; ++i) {
096: labels[i] = ((LabelNode) this .labels.get(i)).getLabel();
097: }
098: mv.visitTableSwitchInsn(min, max, dflt.getLabel(), labels);
099: }
100:
101: public AbstractInsnNode clone(final Map labels) {
102: return new TableSwitchInsnNode(min, max, clone(dflt, labels),
103: clone(this.labels, labels));
104: }
105: }
|