1 package org.ibex.classgen;
6 * a highly streamlined SSA-form intermediate representation of a
7 * sequence of JVM instructions; all stack manipulation is factored
10 public class JSSA extends MethodGen implements CGConst {
12 // Constructor //////////////////////////////////////////////////////////////////////////////
14 public JSSA(Type.Class c, DataInput in, ConstantPool cp) throws IOException {
16 local = new Expr[maxLocals];
17 stack = new Expr[maxStack];
18 for(int i=0; i<this.method.getNumArgs(); i++)
19 local[i] = new Argument("arg"+i, this.method.getArgType(i));
20 for(int i=0; i<size(); i++) {
22 Object arg = getArg(i);
24 Object o = addOp(op, arg);
29 } catch(RuntimeException e) {
30 System.err.println("Had a problem at PC: " + i + " of " + method);
32 throw new IOException("invalid class file");
37 public void debugBodyToString(StringBuffer sb) {
38 StringBuffer sb0 = new StringBuffer();
39 super.debugBodyToString(sb0);
40 StringTokenizer st = new StringTokenizer(sb0.toString(), "\n");
41 String[] lines = new String[st.countTokens()];
42 for(int i=0; i<lines.length; i++) lines[i] = st.nextToken();
43 for(int j=0; j<ofs[0]; j++) {
44 String s = " /* " + lines[j].trim();
45 while(s.length() < 50) s += " ";
50 for(int i=0; i<numOps; i++) {
51 String s = " /* " + lines[ofs[i]].trim();
52 while(s.length() < 50) s += " ";
54 s += ops[i].toString();
57 for(int j=ofs[i]+1; j<(i==numOps-1?size():ofs[i+1]); j++) {
58 s = " /* " + lines[j].trim();
59 while(s.length() < 50) s += " ";
67 private Object[] ops = new Object[65535];
68 private int[] ofs = new int[65535];
69 private int numOps = 0;
71 // Instance Data; used ONLY during constructor; then thrown away /////////////////////////////////////////////////
73 /** this models the JVM locals; it is only used for unwinding stack-ops into an SSA-tree, then thrown away */
74 private final Expr[] local;
76 /** this models the JVM stack; it is only used for unwinding stack-ops into an SSA-tree, then thrown away */
77 private final Expr[] stack;
79 /** JVM stack pointer */
82 private Expr push(Expr e) {
83 if(sp == stack.length) {
84 for(int i=0;i<stack.length;i++) System.err.println("Stack " + i + ": " + stack[i]);
85 throw new IllegalStateException("stack overflow (" + stack.length + ")");
87 if(e.getType() == Type.VOID) throw new IllegalArgumentException("can't push a void");
88 return stack[sp++] = e;
91 if(sp == 0) throw new IllegalStateException("stack underflow");
96 // SSA-node classes /////////////////////////////////////////////////////////////////////////////////////////
98 public final Expr VOID_EXPR = new Expr() {
99 public Type getType() { return Type.VOID; }
102 /** an purely imperative operation which does not generate data */
103 public abstract class Op {
104 //public abstract Op[] predecessors(); // not implemented yet
105 //public abstract Op[] successors(); // not implemented yet
106 public String toString() { return name(); }
108 String name = this.getClass().getName();
109 if (name.indexOf('$') != -1) name = name.substring(name.lastIndexOf('$')+1);
110 if (name.indexOf('.') != -1) name = name.substring(name.lastIndexOf('.')+1);
115 /** an operation which generates data */
116 public abstract class Expr extends Op {
117 //public abstract Expr[] contributors(); // not implemented yet
118 //public abstract Expr[] dependents(); // not implemented yet
120 /** every JSSA.Expr either remembers its type _OR_ knows how to figure it out (the latter is preferred to eliminate
121 * redundant information that could possibly "disagree" with itself -- this happened a LOT in Soot) */
122 public abstract Type getType();
126 * A "nondeterministic merge" -- for example when the first instruction in a loop reads from a local which could have been
127 * written to either by some instruction at the end of the previous iteration of the loop or by some instruction before
128 * the loop (on the first iteration).
130 public class Phi extends Expr {
131 private final Expr[] inputs;
132 public Phi(Expr[] inputs) {
133 this.inputs = new Expr[inputs.length];
134 System.arraycopy(inputs, 0, this.inputs, 0, inputs.length);
136 public Type getType() {
138 Type t = inputs[0].getType();
140 // FIXME: actually this should check type-unifiability... fe, the "type of null" unifies with any Type.Ref
141 for(int i=1; i<inputs.length; i++)
142 if (inputs[i].getType() != t)
143 throw new Error("Phi node with disagreeing types! Crisis!");
148 public class Argument extends Expr {
149 public final String name;
151 public Argument(String name, Type t) { this.name = name; this.t = t; }
152 public String toString() { return name; }
153 public Type getType() { return t; }
157 public class Not extends Expr {
160 if(e.getType() != Type.BOOLEAN) throw new IllegalArgumentException("not needs a boolean expression");
163 public Type getType() { return Type.BOOLEAN; }
164 public String toString() { return "!(" + e + ")"; }
167 public class Neg extends Expr {
170 if(!e.getType().isPrimitive()) throw new IllegalArgumentException("can only negate a primitive");
173 public Type getType() { return e.getType(); }
174 public String toString() { return "- (" + e + ")"; }
177 // Binary Operations //////////////////////////////////////////////////////////////////////////////
179 public abstract class BinExpr extends Expr {
180 public final Expr e1;
181 public final Expr e2;
182 private final String show;
183 public BinExpr(Expr e1, Expr e2, String show) { this.e1 = e1; this.e2 = e2; this.show = show; }
184 public String toString() {
185 // FEATURE: should we be doing some precedence stuff here? probably no worth it for debugging output
186 return "(" + e1 + show + e2 + ")";
190 public class Comparison extends BinExpr {
191 public Comparison(Expr e1, Expr e2, String show) { super(e1, e2, show); }
192 public Type getType() { return Type.BOOLEAN; }
195 public class Eq extends Comparison {
196 public Eq(Expr e1, Expr e2) {
198 if(e1.getType().isPrimitive() != e2.getType().isPrimitive())
199 throw new IllegalArgumentException("type mismatch");
200 if(e1.getType().isPrimitive() && e1.getType() != e2.getType())
201 throw new IllegalArgumentException("type mismatch");
202 // FEATURE: Check if we can compare these classes
207 public class PrimitiveComparison extends Comparison {
208 public PrimitiveComparison(Expr e1, Expr e2, String show) {
210 if(!e1.getType().isPrimitive() || e1.getType() != e2.getType()) throw new IllegalArgumentException("type mismatch");
214 public class Gt extends PrimitiveComparison { public Gt(Expr e1, Expr e2) { super(e1, e2, ">"); } }
215 public class Lt extends PrimitiveComparison { public Lt(Expr e1, Expr e2) { super(e1, e2, "<"); } }
216 public class Ge extends PrimitiveComparison { public Ge(Expr e1, Expr e2) { super(e1, e2, ">="); } }
217 public class Le extends PrimitiveComparison { public Le(Expr e1, Expr e2) { super(e1, e2, "<="); } }
219 // Math Operations //////////////////////////////////////////////////////////////////////////////
221 public class BinMath extends BinExpr {
222 public BinMath(Expr e1, Expr e2, String show) {
224 if(e1.getType() != e2.getType()) throw new IllegalArgumentException("types disagree");
226 public Type getType() { return e1.getType(); }
229 public class Add extends BinMath { public Add(Expr e, Expr e2) { super(e, e2, "+"); } }
230 public class Sub extends BinMath { public Sub(Expr e, Expr e2) { super(e, e2, "-"); } }
231 public class Mul extends BinMath { public Mul(Expr e, Expr e2) { super(e, e2, "*"); } }
232 public class Rem extends BinMath { public Rem(Expr e, Expr e2) { super(e, e2, "%"); } }
233 public class Div extends BinMath { public Div(Expr e, Expr e2) { super(e, e2, "/"); } }
234 public class And extends BinMath { public And(Expr e, Expr e2) { super(e, e2, "&"); } }
235 public class Or extends BinMath { public Or(Expr e, Expr e2) { super(e, e2, "|"); } }
236 public class Xor extends BinMath { public Xor(Expr e, Expr e2) { super(e, e2, "^"); } }
238 public class BitShiftExpr extends BinExpr {
239 public BitShiftExpr(Expr e1, Expr e2, String show) {
241 Type t = e1.getType();
242 if(t != Type.INT && t != Type.LONG) throw new IllegalArgumentException("type mismatch");
243 if(e2.getType() != Type.INT) throw new IllegalArgumentException("type mismatch");
245 public Type getType() { return e1.getType(); }
247 public class Shl extends BitShiftExpr { public Shl(Expr e, Expr e2) { super(e, e2, "<<"); } }
248 public class Shr extends BitShiftExpr { public Shr(Expr e, Expr e2) { super(e, e2, ">>"); } }
249 public class Ushr extends BitShiftExpr { public Ushr(Expr e, Expr e2) { super(e, e2, ">>>"); } }
251 // Other operations //////////////////////////////////////////////////////////////////////////////
253 public class Cast extends Expr {
256 public Cast(Expr e, Type t) {
257 if(e.getType().isRef() != t.isRef()) throw new IllegalArgumentException("invalid cast");
258 // FEATURE: Check that one is a subclass of the other if it is a ref
262 public Type getType() { return t; }
265 public class InstanceOf extends Expr {
268 public InstanceOf(Expr e, Type.Ref t) {
269 if(!e.getType().isRef()) throw new IllegalArgumentException("can't do an instanceof check on a non-ref");
273 public Type getType() { return Type.BOOLEAN; }
276 public class Throw extends Op {
278 public Throw(Expr e) {
279 if(!e.getType().isRef()) throw new IllegalArgumentException("can't throw a non ref");
280 // FEATURE: CHeck that it is a subclass of Throwable
285 public class Branch extends Op {
286 public Branch(Expr condition, Object destination) { }
287 public Branch(Label destination) { }
288 public Branch(MethodGen.Switch s) { }
291 public class Goto extends Branch { }
292 public class RET extends Branch { }
293 public class JSR extends Branch { public JSR(Label l) { super(l); } }
294 public class If extends Branch { }
296 /** represents a "returnaddr" pushed onto the stack */
297 public class Label extends Expr {
299 public Type getType() { throw new Error("attempted to call getType() on a Label"); }
300 public Label(Op op) { this.op = op; }
301 public Label(int i) { this.op = null; /* FIXME */ }
304 public class New extends Expr {
305 public final Type.Class t;
306 public Type getType() { return t; }
307 public New(Type.Class t) { this.t = t; }
310 public class NewArray extends Expr {
311 public final Type.Array t;
312 public final Expr[] dims;
313 public NewArray(Type.Array t, Expr[] dims) { this.t = t; this.dims = dims; }
314 public NewArray(Type.Array t, Expr dim) { this(t,new Expr[]{dim}); }
315 public Type getType() { return t; }
318 public class Return extends Op {
320 public Return() { this(VOID_EXPR); }
321 public Return(Expr e) { this.e = e; }
322 public String toString() { return e.getType() == Type.VOID ? "return" : ("return "+e.toString()); }
325 /** GETFIELD and GETSTATIC */
326 public class Get extends Expr {
327 final Type.Class.Field f;
329 public Type getType() { return f.getType(); }
330 public Get(Type.Class.Field f) { this(f, null); }
331 public Get(Type.Class.Field f, Expr e) { this.f = f; this.e = e; }
332 public String toString() {
336 : f.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
342 /** PUTFIELD and PUTSTATIC */
343 public class Put extends Op {
344 final Type.Class.Field f;
347 public Put(Type.Class.Field f, Expr v) { this(f, v, null); }
348 public Put(Type.Class.Field f, Expr v, Expr e) { this.f = f; this.v = v; this.e = e; }
349 public String toString() {
353 : f.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
355 : f.toString()) + " = " + v;
359 public class ArrayPut extends Op {
361 public ArrayPut(Expr e, Expr i, Expr v) { this.e = e; this.i = i; this.v = v; }
364 public class ArrayGet extends Expr {
366 public ArrayGet(Expr e, Expr i) { this.e = e; this.i = i; }
367 public Type getType() { return e.getType().asArray().getElementType(); }
370 public class ArrayLength extends Expr {
372 public ArrayLength(Expr e) { this.e = e; }
373 public Type getType() { return Type.INT; }
376 public abstract class Invoke extends Expr {
377 public final Expr[] arguments;
378 public final Type.Class.Method method;
379 protected Invoke(Type.Class.Method m, Expr[] a) { this.arguments = a; this.method = m; }
381 public Type getType() { return method.getReturnType(); }
382 protected void args(StringBuffer sb) {
384 for(int i=0; i<arguments.length; i++) {
385 if (i>0) sb.append(", ");
386 sb.append(arguments[i]+"");
391 public String toString() {
392 StringBuffer sb = new StringBuffer();
393 sb.append(method.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
395 : (method.getDeclaringClass() + "." + method.name));
397 return sb.toString();
400 public class InvokeStatic extends Invoke { public InvokeStatic(Type.Class.Method m, Expr[] a) { super(m,a); } }
401 public class InvokeSpecial extends InvokeVirtual {
402 public InvokeSpecial(Type.Class.Method m, Expr[] a, Expr e) { super(m,a,e); }
403 public String toString() {
404 StringBuffer sb = new StringBuffer();
405 sb.append(method.name.equals("<init>") ? "super" : method.name);
407 return sb.toString();
410 public class InvokeInterface extends InvokeVirtual{public InvokeInterface(Type.Class.Method m, Expr[] a, Expr e){super(m,a,e);}}
411 public class InvokeVirtual extends Invoke {
412 public final Expr instance;
413 public InvokeVirtual(Type.Class.Method m, Expr[] a, Expr e) { super(m, a); instance = e; }
414 public String toString() {
415 StringBuffer sb = new StringBuffer();
416 sb.append(method.name);
418 return sb.toString();
422 public class Constant extends Expr {
423 private final Object o;
424 public Constant(int i) { this(new Integer(i)); }
425 public Constant(Object o) { this.o = o; }
426 public String toString() { return o.toString(); }
427 public Type getType() {
428 if (o instanceof Byte) return Type.BYTE;
429 if (o instanceof Short) return Type.SHORT;
430 if (o instanceof Character) return Type.CHAR;
431 if (o instanceof Boolean) return Type.BOOLEAN;
432 if (o instanceof Long) return Type.LONG;
433 if (o instanceof Double) return Type.DOUBLE;
434 if (o instanceof Float) return Type.FLOAT;
435 if (o instanceof ConstantPool.Ent) throw new Error("unimplemented");
436 throw new Error("this should not happen");
441 // Implementation //////////////////////////////////////////////////////////////////////////////
443 private Object addOp(int op, Object arg) {
447 MethodGen.Wide w = (MethodGen.Wide)arg;
454 MethodGen.Pair p = (MethodGen.Pair)arg;
461 case NOP: return null;
463 // Stack manipulations //////////////////////////////////////////////////////////////////////////////
465 case ACONST_NULL: return stack[sp++] = new Constant(null);
466 case ICONST_M1: return stack[sp++] = new Constant(-1);
467 case ICONST_0: case LCONST_0: case FCONST_0: case DCONST_0: push(new Constant(0)); return null;
468 case ICONST_1: case LCONST_1: case FCONST_1: case DCONST_1: push(new Constant(1)); return null;
469 case ICONST_2: case FCONST_2: push(new Constant(2)); return null;
470 case ICONST_3: push(new Constant(3)); return null;
471 case ICONST_4: push(new Constant(4)); return null;
472 case ICONST_5: push(new Constant(5)); return null;
473 case ILOAD: case LLOAD: case FLOAD: case DLOAD: case ALOAD: return push(local[i1]);
474 case ILOAD_0: case LLOAD_0: case FLOAD_0: case DLOAD_0: case ALOAD_0: return push(local[0]);
475 case ILOAD_1: case LLOAD_1: case FLOAD_1: case DLOAD_1: case ALOAD_1: return push(local[1]);
476 case ALOAD_2: case DLOAD_2: case FLOAD_2: case LLOAD_2: case ILOAD_2: return push(local[2]);
477 case ILOAD_3: case LLOAD_3: case FLOAD_3: case DLOAD_3: case ALOAD_3: return push(local[3]);
478 case ISTORE: case LSTORE: case FSTORE: case DSTORE: case ASTORE: local[i1] = pop(); return null;
479 case ISTORE_0: case LSTORE_0: case FSTORE_0: case DSTORE_0: case ASTORE_0: local[0] = pop(); return null;
480 case ISTORE_1: case LSTORE_1: case FSTORE_1: case DSTORE_1: case ASTORE_1: local[1] = pop(); return null;
481 case ASTORE_2: case DSTORE_2: case FSTORE_2: case LSTORE_2: case ISTORE_2: local[2] = pop(); return null;
482 case ISTORE_3: case LSTORE_3: case FSTORE_3: case DSTORE_3: case ASTORE_3: local[3] = pop(); return null;
483 case POP: stack[--sp] = null;
484 case POP2: stack[--sp] = null; stack[--sp] = null; /** fixme: pops a WORD, not an item */
485 case DUP: stack[sp] = stack[sp-1]; sp++;
486 case DUP2: stack[sp] = stack[sp-2]; stack[sp+1] = stack[sp-1]; sp+=2;
488 // Conversions //////////////////////////////////////////////////////////////////////////////
490 // coercions are added as-needed when converting from JSSA back to bytecode, so we can
491 // simply discard them here (assuming the bytecode we're reading in was valid in the first place)
493 case I2L: case F2L: case D2L: push(new Cast(pop(), Type.LONG)); return null;
494 case I2F: case L2F: case D2F: push(new Cast(pop(), Type.FLOAT)); return null;
495 case I2D: case L2D: case F2D: push(new Cast(pop(), Type.DOUBLE)); return null;
496 case L2I: case F2I: case D2I: push(new Cast(pop(), Type.INT)); return null;
497 case I2B: push(new Cast(pop(), Type.BYTE)); return null;
498 case I2C: push(new Cast(pop(), Type.CHAR)); return null;
499 case I2S: push(new Cast(pop(), Type.SHORT)); return null;
500 case SWAP: { Expr e1 = pop(), e2 = pop(); push(e2); push(e1); return null; }
502 // Math //////////////////////////////////////////////////////////////////////////////
504 case IADD: case LADD: case FADD: case DADD: push(new Add(pop(), pop())); return null;
505 case ISUB: case LSUB: case FSUB: case DSUB: push(new Sub(pop(), pop())); return null;
506 case IMUL: case LMUL: case FMUL: case DMUL: push(new Mul(pop(), pop())); return null;
507 case IREM: case LREM: case FREM: case DREM: push(new Rem(pop(), pop())); return null;
508 //case INEG: case LNEG: case FNEG: case DNEG: push(new Neg(pop())); return null;
509 case IDIV: case LDIV: case FDIV: case DDIV: push(new Div(pop(), pop())); return null;
510 case ISHL: case LSHL: push(new Shl(pop(), pop())); return null;
511 case ISHR: case LSHR: push(new Shr(pop(), pop())); return null;
512 case IUSHR: case LUSHR: push(new Ushr(pop(), pop())); return null;
513 case IAND: case LAND: push(new And(pop(), pop())); return null;
514 case IOR: case LOR: push(new Or(pop(), pop())); return null;
515 case IXOR: case LXOR: push(new Xor(pop(), pop())); return null;
516 case IINC: return local[i1] = new Add(local[i1], new Constant(i2));
518 // Control and branching //////////////////////////////////////////////////////////////////////////////
520 case IFNULL: return new Branch(new Eq(pop(), new Constant(null)), new Label(i1));
521 case IFNONNULL: return new Branch(new Not(new Eq(pop(),new Constant(null))),new Label(i1));
522 case IFEQ: return new Branch( new Eq(new Constant(0), pop()), arg);
523 case IFNE: return new Branch(new Not(new Eq(new Constant(0), pop())), arg);
524 case IFLT: return new Branch( new Lt(new Constant(0), pop()), arg);
525 case IFGE: return new Branch(new Not(new Lt(new Constant(0), pop())), arg);
526 case IFGT: return new Branch( new Gt(new Constant(0), pop()), arg);
527 case IFLE: return new Branch(new Not(new Gt(new Constant(0), pop())), arg);
528 case IF_ICMPEQ: return new Branch( new Eq(pop(), pop()), arg);
529 case IF_ICMPNE: return new Branch(new Not(new Eq(pop(), pop())), arg);
530 case IF_ICMPLT: return new Branch( new Lt(pop(), pop()), arg);
531 case IF_ICMPGE: return new Branch(new Not(new Lt(pop(), pop())), arg);
532 case IF_ICMPGT: return new Branch( new Gt(pop(), pop()), arg);
533 case IF_ICMPLE: return new Branch(new Not(new Gt(pop(), pop())), arg);
534 case IF_ACMPEQ: return new Branch( new Eq(pop(), pop()), arg);
535 case IF_ACMPNE: return new Branch(new Not(new Eq(pop(), pop())), arg);
536 case ATHROW: return new Throw(pop());
537 case GOTO: return new Branch(new Label(i1));
538 case JSR: return new JSR(new Label(i1));
539 case RET: return new RET();
540 case RETURN: return new Return();
541 case IRETURN: case LRETURN: case FRETURN: case DRETURN: case ARETURN:
542 return new Return(pop());
544 // Array manipulations //////////////////////////////////////////////////////////////////////////////
546 case IALOAD: case LALOAD: case FALOAD: case DALOAD: case AALOAD:
547 case BALOAD: case CALOAD: case SALOAD: push(new ArrayGet(pop(), pop())); return null;
548 case IASTORE: case LASTORE: case FASTORE: case DASTORE: case AASTORE:
549 case BASTORE: case CASTORE: case SASTORE: return new ArrayPut(pop(), pop(), pop());
551 // Invocation //////////////////////////////////////////////////////////////////////////////
553 case INVOKEVIRTUAL: case INVOKESPECIAL: case INVOKESTATIC: case INVOKEINTERFACE: {
554 Type.Class.Method method = (Type.Class.Method)arg;
555 Expr args[] = new Expr[method.getNumArgs()];
556 for(int i=0; i<args.length; i++) args[args.length-i-1] = pop();
558 case INVOKEVIRTUAL: return push(new InvokeVirtual(method, args, pop()));
559 case INVOKEINTERFACE: return push(new InvokeInterface(method, args, pop()));
560 case INVOKESPECIAL: return push(new InvokeSpecial(method, args, pop()));
561 case INVOKESTATIC: return push(new InvokeStatic(method, args));
565 // Field Access //////////////////////////////////////////////////////////////////////////////
567 case GETSTATIC: push(new Get((Type.Class.Field)arg, null)); return null;
568 case PUTSTATIC: return new Put((Type.Class.Field)arg, pop(), null);
569 case GETFIELD: push(new Get((Type.Class.Field)arg, pop())); return null;
570 case PUTFIELD: return new Put((Type.Class.Field)arg, pop(), pop());
572 // Allocation //////////////////////////////////////////////////////////////////////////////
574 case NEW: push(new New((Type.Class)arg)); return null;
577 switch(((Integer)arg).intValue()) {
578 case 4: base = Type.BOOLEAN; break;
579 case 5: base = Type.CHAR; break;
580 case 6: base = Type.FLOAT; break;
581 case 7: base = Type.DOUBLE; break;
582 case 8: base = Type.BYTE; break;
583 case 9: base = Type.SHORT; break;
584 case 10: base = Type.INT; break;
585 case 11: base = Type.LONG; break;
586 default: throw new IllegalStateException("invalid array type");
588 push(new NewArray(base.makeArray(),pop()));
591 case ANEWARRAY: push(new NewArray(((Type.Ref)arg).makeArray(), pop())); return null;
592 case MULTIANEWARRAY: {
593 MethodGen.MultiANewArray mana = (MethodGen.MultiANewArray) arg;
594 Expr[] dims = new Expr[mana.dims];
595 for(int i=0;i<dims.length;i++) dims[i] = pop();
596 push(new NewArray(mana.type, dims));
599 case ARRAYLENGTH: push(new ArrayLength(pop())); return null;
601 // Runtime Type information //////////////////////////////////////////////////////////////////////////////
603 case CHECKCAST: push(new Cast(pop(), (Type.Ref)arg)); return null;
604 case INSTANCEOF: push(new InstanceOf(pop(), (Type.Ref)arg)); return null;
606 case LDC: case LDC_W: case LDC2_W: push(new Constant(arg)); return null;
608 case BIPUSH: push(new Constant(i1)); // FIXME return null;
609 case SIPUSH: push(new Constant(i1)); // FIXME return null;
611 case TABLESWITCH: new Branch((MethodGen.Switch)arg);
612 case LOOKUPSWITCH: new Branch((MethodGen.Switch)arg);
615 case MONITORENTER: Op.monitorEnter(pop());
616 case MONITOREXIT: Op.monitorExit(pop());
619 case DUP_X1: throw new Error("unimplemented");
620 case DUP_X2: throw new Error("unimplemented");
621 case DUP2_X1: throw new Error("unimplemented");
622 case DUP2_X2: throw new Error("unimplemented");
623 case LCMP: throw new Error("unimplemented");
624 case FCMPL: throw new Error("unimplemented");
625 case FCMPG: throw new Error("unimplemented");
626 case DCMPL: throw new Error("unimplemented");
627 case DCMPG: throw new Error("unimplemented");
628 case GOTO_W: throw new Error("unimplemented");
629 case JSR_W: throw new Error("unimplemented");
630 default: throw new Error("unhandled");
634 public static void main(String[] args) throws Exception {
635 InputStream is = Class.forName(args[0]).getClassLoader().getResourceAsStream(args[0].replace('.', '/')+".class");
636 System.out.println(new ClassFile(new DataInputStream(is), true).toString());