| /* |
| * reserved comment block |
| * DO NOT REMOVE OR ALTER! |
| */ |
| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You under the Apache License, Version 2.0 |
| * (the "License"); you may not use this file except in compliance with |
| * the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| package com.sun.org.apache.bcel.internal.generic; |
| |
| import java.io.DataOutputStream; |
| import java.io.IOException; |
| |
| import com.sun.org.apache.bcel.internal.util.ByteSequence; |
| |
| /** |
| * TABLESWITCH - Switch within given range of values, i.e., low..high |
| * |
| * @see SWITCH |
| */ |
| public class TABLESWITCH extends Select { |
| |
| /** |
| * Empty constructor needed for Instruction.readInstruction. |
| * Not to be used otherwise. |
| */ |
| TABLESWITCH() { |
| } |
| |
| |
| /** |
| * @param match sorted array of match values, match[0] must be low value, |
| * match[match_length - 1] high value |
| * @param targets where to branch for matched values |
| * @param defaultTarget default branch |
| */ |
| public TABLESWITCH(final int[] match, final InstructionHandle[] targets, final InstructionHandle defaultTarget) { |
| super(com.sun.org.apache.bcel.internal.Const.TABLESWITCH, match, targets, defaultTarget); |
| /* Alignment remainder assumed 0 here, until dump time */ |
| final short _length = (short) (13 + getMatch_length() * 4); |
| super.setLength(_length); |
| setFixed_length(_length); |
| } |
| |
| |
| /** |
| * Dump instruction as byte code to stream out. |
| * @param out Output stream |
| */ |
| @Override |
| public void dump( final DataOutputStream out ) throws IOException { |
| super.dump(out); |
| final int _match_length = getMatch_length(); |
| final int low = (_match_length > 0) ? super.getMatch(0) : 0; |
| out.writeInt(low); |
| final int high = (_match_length > 0) ? super.getMatch(_match_length - 1) : 0; |
| out.writeInt(high); |
| for (int i = 0; i < _match_length; i++) { |
| out.writeInt(setIndices(i, getTargetOffset(super.getTarget(i)))); |
| } |
| } |
| |
| |
| /** |
| * Read needed data (e.g. index) from file. |
| */ |
| @Override |
| protected void initFromFile( final ByteSequence bytes, final boolean wide ) throws IOException { |
| super.initFromFile(bytes, wide); |
| final int low = bytes.readInt(); |
| final int high = bytes.readInt(); |
| final int _match_length = high - low + 1; |
| setMatch_length(_match_length); |
| final short _fixed_length = (short) (13 + _match_length * 4); |
| setFixed_length(_fixed_length); |
| super.setLength((short) (_fixed_length + super.getPadding())); |
| super.setMatches(new int[_match_length]); |
| super.setIndices(new int[_match_length]); |
| super.setTargets(new InstructionHandle[_match_length]); |
| for (int i = 0; i < _match_length; i++) { |
| super.setMatch(i, low + i); |
| super.setIndices(i, bytes.readInt()); |
| } |
| } |
| |
| |
| /** |
| * Call corresponding visitor method(s). The order is: |
| * Call visitor methods of implemented interfaces first, then |
| * call methods according to the class hierarchy in descending order, |
| * i.e., the most specific visitXXX() call comes last. |
| * |
| * @param v Visitor object |
| */ |
| @Override |
| public void accept( final Visitor v ) { |
| v.visitVariableLengthInstruction(this); |
| v.visitStackConsumer(this); |
| v.visitBranchInstruction(this); |
| v.visitSelect(this); |
| v.visitTABLESWITCH(this); |
| } |
| } |