/***
* ASM: a very small and fast Java bytecode manipulation framework
* Copyright (c) 2000,2002,2003 INRIA, France Telecom
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
package oracle.toplink.libraries.asm.util;
import oracle.toplink.libraries.asm.CodeVisitor;
import oracle.toplink.libraries.asm.Label;
import oracle.toplink.libraries.asm.Attribute;
import oracle.toplink.libraries.asm.Type;
import java.util.HashMap;
/**
* A {@link PrintCodeVisitor PrintCodeVisitor} that prints a disassembled view
* of the code it visits.
*
* @author Eric Bruneton
*/
public class TraceCodeVisitor extends PrintCodeVisitor {
/**
* The {@link CodeVisitor CodeVisitor} to which this visitor delegates calls.
* May be <tt>null</tt>.
*/
protected final CodeVisitor cv;
/**
* The label names. This map associate String values to Label keys.
*/
private final HashMap labelNames;
/**
* Constructs a new {@link TraceCodeVisitor TraceCodeVisitor} object.
*
* @param cv the code visitor to which this adapter must delegate calls. May
* be <tt>null</tt>.
*/
public TraceCodeVisitor (final CodeVisitor cv) {
this.cv = cv;
this.labelNames = new HashMap();
}
public void printInsn (final int opcode) {
buf.append(" ")
.append(OPCODES[opcode])
.append("\n");
if (cv != null) {
cv.visitInsn(opcode);
}
}
public void printIntInsn (final int opcode, final int operand) {
buf.append(" ")
.append(OPCODES[opcode])
.append(" ").append(operand)
.append("\n");
if (cv != null) {
cv.visitIntInsn(opcode, operand);
}
}
public void printVarInsn (final int opcode, final int var) {
buf.append(" ")
.append(OPCODES[opcode])
.append(" ")
.append(var)
.append("\n");
if (cv != null) {
cv.visitVarInsn(opcode, var);
}
}
public void printTypeInsn (final int opcode, final String desc) {
buf.append(" ")
.append(OPCODES[opcode])
.append(" ")
.append(desc)
.append("\n");
if (cv != null) {
cv.visitTypeInsn(opcode, desc);
}
}
public void printFieldInsn (
final int opcode,
final String owner,
final String name,
final String desc)
{
buf.append(" ")
.append(OPCODES[opcode])
.append(" ")
.append(owner)
.append(" ")
.append(name)
.append(" ")
.append(desc)
.append("\n");
if (cv != null) {
cv.visitFieldInsn(opcode, owner, name, desc);
}
}
public void printMethodInsn (
final int opcode,
final String owner,
final String name,
final String desc)
{
buf.append(" ")
.append(OPCODES[opcode])
.append(" ")
.append(owner)
.append(" ")
.append(name)
.append(" ")
.append(desc)
.append("\n");
if (cv != null) {
cv.visitMethodInsn(opcode, owner, name, desc);
}
}
public void printJumpInsn (final int opcode, final Label label) {
buf.append(" ")
.append(OPCODES[opcode]).
append(" ");
appendLabel(label);
buf.append("\n");
if (cv != null) {
cv.visitJumpInsn(opcode, label);
}
}
public void printLabel (final Label label) {
buf.append(" ");
appendLabel(label);
// buf.append(": // ").append(label).append("\n");
buf.append("\n");
if (cv != null) {
cv.visitLabel(label);
}
}
public void printLdcInsn (final Object cst) {
buf.append(" LDC ");
if (cst instanceof String) {
buf.append("\"").append(cst).append("\"");
} else if (cst instanceof Type) {
buf.append(((Type)cst).getDescriptor() + ".class");
} else {
buf.append(cst);
}
buf.append("\n");
if (cv != null) {
cv.visitLdcInsn(cst);
}
}
public void printIincInsn (final int var, final int increment) {
buf.append(" IINC ")
.append(var)
.append(" ")
.append(increment)
.append("\n");
if (cv != null) {
cv.visitIincInsn(var, increment);
}
}
public void printTableSwitchInsn (
final int min,
final int max,
final Label dflt,
final Label labels[])
{
buf.append(" TABLESWITCH\n");
for (int i = 0; i < labels.length; ++i) {
buf.append(" ")
.append(min + i)
.append(": ");
appendLabel(labels[i]);
buf.append("\n");
}
buf.append(" default: ");
appendLabel(dflt);
buf.append("\n");
if (cv != null) {
cv.visitTableSwitchInsn(min, max, dflt, labels);
}
}
public void printLookupSwitchInsn (
final Label dflt,
final int keys[],
final Label labels[])
{
buf.append(" LOOKUPSWITCH\n");
for (int i = 0; i < labels.length; ++i) {
buf.append(" ")
.append(keys[i])
.append(": ");
appendLabel(labels[i]);
buf.append("\n");
}
buf.append(" default: ");
appendLabel(dflt);
buf.append("\n");
if (cv != null) {
cv.visitLookupSwitchInsn(dflt, keys, labels);
}
}
public void printMultiANewArrayInsn (final String desc, final int dims) {
buf.append(" MULTIANEWARRAY ")
.append(desc)
.append(" ")
.append(dims)
.append("\n");
if (cv != null) {
cv.visitMultiANewArrayInsn(desc, dims);
}
}
public void printTryCatchBlock (
final Label start,
final Label end,
final Label handler,
final String type)
{
buf.append(" TRYCATCHBLOCK ");
appendLabel(start);
buf.append(" ");
appendLabel(end);
buf.append(" ");
appendLabel(handler);
buf.append(" ")
.append(type)
.append("\n");
if (cv != null) {
cv.visitTryCatchBlock(start, end, handler, type);
}
}
public void printMaxs (final int maxStack, final int maxLocals) {
buf.append(" MAXSTACK = ")
.append(maxStack)
.append("\n MAXLOCALS = ")
.append(maxLocals)
.append("\n\n");
if (cv != null) {
cv.visitMaxs(maxStack, maxLocals);
}
}
public void printLocalVariable (
final String name,
final String desc,
final Label start,
final Label end,
final int index)
{
buf.append(" LOCALVARIABLE ")
.append(name)
.append(" ")
.append(desc)
.append(" ");
appendLabel(start);
buf.append(" ");
appendLabel(end);
buf.append(" ")
.append(index)
.append("\n");
if (cv != null) {
cv.visitLocalVariable(name, desc, start, end, index);
}
}
public void printLineNumber (final int line, final Label start) {
buf.append(" LINENUMBER ")
.append(line)
.append(" ");
appendLabel(start);
buf.append("\n");
if (cv != null) {
cv.visitLineNumber(line, start);
}
}
public void printAttribute (final Attribute attr) {
buf.append(" CODE ATTRIBUTE ").append(attr.type).append(" : ")
.append(attr.toString()).append("\n");
if (cv != null) {
cv.visitAttribute(attr);
}
}
/**
* Appends the name of the given label to {@link #buf buf}. Creates a new
* label name if the given label does not yet have one.
*
* @param l a label.
*/
private void appendLabel (final Label l) {
String name = (String)labelNames.get(l);
if (name == null) {
name = "L" + labelNames.size();
labelNames.put(l, name);
}
buf.append(name);
}
}
|
