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.List;
036: import java.util.ArrayList;
037: import java.util.Arrays;
038: import java.util.Map;
039:
040: /**
041: * A node that represents a LOOKUPSWITCH instruction.
042: *
043: * @author Eric Bruneton
044: */
045: public class LookupSwitchInsnNode extends AbstractInsnNode {
046:
047: /**
048: * Beginning of the default handler block.
049: */
050: public LabelNode dflt;
051:
052: /**
053: * The values of the keys. This list is a list of {@link Integer} objects.
054: */
055: public List keys;
056:
057: /**
058: * Beginnings of the handler blocks. This list is a list of
059: * {@link LabelNode} objects.
060: */
061: public List labels;
062:
063: /**
064: * Constructs a new {@link LookupSwitchInsnNode}.
065: *
066: * @param dflt beginning of the default handler block.
067: * @param keys the values of the keys.
068: * @param labels beginnings of the handler blocks. <tt>labels[i]</tt> is
069: * the beginning of the handler block for the <tt>keys[i]</tt> key.
070: */
071: public LookupSwitchInsnNode(final LabelNode dflt, final int[] keys,
072: final LabelNode[] labels) {
073: super (Opcodes.LOOKUPSWITCH);
074: this .dflt = dflt;
075: this .keys = new ArrayList(keys == null ? 0 : keys.length);
076: this .labels = new ArrayList(labels == null ? 0 : labels.length);
077: if (keys != null) {
078: for (int i = 0; i < keys.length; ++i) {
079: this .keys.add(new Integer(keys[i]));
080: }
081: }
082: if (labels != null) {
083: this .labels.addAll(Arrays.asList(labels));
084: }
085: }
086:
087: public int getType() {
088: return LOOKUPSWITCH_INSN;
089: }
090:
091: public void accept(final MethodVisitor mv) {
092: int[] keys = new int[this .keys.size()];
093: for (int i = 0; i < keys.length; ++i) {
094: keys[i] = ((Integer) this .keys.get(i)).intValue();
095: }
096: Label[] labels = new Label[this .labels.size()];
097: for (int i = 0; i < labels.length; ++i) {
098: labels[i] = ((LabelNode) this .labels.get(i)).getLabel();
099: }
100: mv.visitLookupSwitchInsn(dflt.getLabel(), keys, labels);
101: }
102:
103: public AbstractInsnNode clone(final Map labels) {
104: LookupSwitchInsnNode clone = new LookupSwitchInsnNode(clone(
105: dflt, labels), null, clone(this.labels, labels));
106: clone.keys.addAll(keys);
107: return clone;
108: }
109: }
|