/*
* Copyright (c) 2011, 2012, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
package sun.jvm.hotspot.oops;
import java.io.*;
import java.util.*;
import sun.jvm.hotspot.debugger.*;
import sun.jvm.hotspot.runtime.*;
import sun.jvm.hotspot.types.*;
import sun.jvm.hotspot.utilities.*;
// MultiBranchData
//
// A MultiBranchData is used to access profiling information for
// a multi-way branch (*switch bytecodes). It consists of a series
// of (count, displacement) pairs, which count the number of times each
// case was taken and specify the data displacment for each branch target.
public class MultiBranchData extends ArrayData {
static final int defaultCountOffSet = 0;
static final int defaultDisaplacementOffSet = 1;
static final int caseArrayStart = 2;
static final int relativeCountOffSet = 0;
static final int relativeDisplacementOffSet = 1;
static final int perCaseCellCount = 2;
public MultiBranchData(DataLayout layout) {
super(layout);
//assert(layout.tag() == DataLayout.multiBranchDataTag, "wrong type");
}
// static int computeCellCount(BytecodeStream stream);
int numberOfCases() {
int alen = arrayLen() - 2; // get rid of default case here.
//assert(alen % perCaseCellCount == 0, "must be even");
return (alen / perCaseCellCount);
}
int defaultCount() {
return arrayUintAt(defaultCountOffSet);
}
int defaultDisplacement() {
return arrayIntAt(defaultDisaplacementOffSet);
}
int countAt(int index) {
return arrayUintAt(caseArrayStart +
index * perCaseCellCount +
relativeCountOffSet);
}
int displacementAt(int index) {
return arrayIntAt(caseArrayStart +
index * perCaseCellCount +
relativeDisplacementOffSet);
}
// Code generation support
static int defaultCountOffset() {
return arrayElementOffset(defaultCountOffSet);
}
static int defaultDisplacementOffset() {
return arrayElementOffset(defaultDisaplacementOffSet);
}
static int caseCountOffset(int index) {
return caseArrayOffset() +
(perCaseSize() * index) +
relativeCountOffset();
}
static int caseArrayOffset() {
return arrayElementOffset(caseArrayStart);
}
static int perCaseSize() {
return (perCaseCellCount) * MethodData.cellSize;
}
static int relativeCountOffset() {
return (relativeCountOffSet) * MethodData.cellSize;
}
static int relativeDisplacementOffset() {
/**代码未完, 请加载全部代码(NowJava.com).**/