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];
20 local[n++] = new Argument("this",method.getDeclaringClass());
21 for(int i=0;i<this.method.getNumArgs(); i++)
22 local[n++] = new Argument("arg"+i, this.method.getArgType(i));
23 for(int i=0; i<size(); i++) {
25 Object arg = getArg(i);
27 Object o = addOp(op, arg);
32 } catch(RuntimeException e) {
33 System.err.println("Had a problem at PC: " + i + " of " + method);
35 throw new IOException("invalid class file");
40 public void debugBodyToString(StringBuffer sb) {
41 StringBuffer sb0 = new StringBuffer();
42 super.debugBodyToString(sb0);
43 StringTokenizer st = new StringTokenizer(sb0.toString(), "\n");
44 String[] lines = new String[st.countTokens()];
45 for(int i=0; i<lines.length; i++) lines[i] = st.nextToken();
46 for(int j=0; j<ofs[0]; j++) {
47 String s = " /* " + lines[j].trim();
48 while(s.length() < 50) s += " ";
53 for(int i=0; i<numOps; i++) {
54 String s = " /* " + lines[ofs[i]].trim();
55 while(s.length() < 50) s += " ";
57 s += ops[i].toString();
60 for(int j=ofs[i]+1; j<(i==numOps-1?size():ofs[i+1]); j++) {
61 s = " /* " + lines[j].trim();
62 while(s.length() < 50) s += " ";
70 private Object[] ops = new Object[65535];
71 private int[] ofs = new int[65535];
72 private int numOps = 0;
74 // Instance Data; used ONLY during constructor; then thrown away /////////////////////////////////////////////////
76 /** this models the JVM locals; it is only used for unwinding stack-ops into an SSA-tree, then thrown away */
77 private final Expr[] local;
79 /** this models the JVM stack; it is only used for unwinding stack-ops into an SSA-tree, then thrown away */
80 private final Expr[] stack;
82 /** JVM stack pointer */
85 private Expr push(Expr e) {
86 if(sp == stack.length) {
87 for(int i=0;i<stack.length;i++) System.err.println("Stack " + i + ": " + stack[i]);
88 throw new IllegalStateException("stack overflow (" + stack.length + ")");
90 if(e.getType() == Type.VOID) throw new IllegalArgumentException("can't push a void");
91 return stack[sp++] = e;
94 if(sp == 0) throw new IllegalStateException("stack underflow");
99 // SSA-node classes /////////////////////////////////////////////////////////////////////////////////////////
101 public final Expr VOID_EXPR = new Expr() {
102 public Type getType() { return Type.VOID; }
105 /** an purely imperative operation which does not generate data */
106 public abstract class Op {
107 //public abstract Op[] predecessors(); // not implemented yet
108 //public abstract Op[] successors(); // not implemented yet
109 public String toString() { return name(); }
111 String name = this.getClass().getName();
112 if (name.indexOf('$') != -1) name = name.substring(name.lastIndexOf('$')+1);
113 if (name.indexOf('.') != -1) name = name.substring(name.lastIndexOf('.')+1);
118 /** an operation which generates data */
119 public abstract class Expr extends Op {
120 //public abstract Expr[] contributors(); // not implemented yet
121 //public abstract Expr[] dependents(); // not implemented yet
123 /** every JSSA.Expr either remembers its type _OR_ knows how to figure it out (the latter is preferred to eliminate
124 * redundant information that could possibly "disagree" with itself -- this happened a LOT in Soot) */
125 public abstract Type getType();
129 * A "nondeterministic merge" -- for example when the first instruction in a loop reads from a local which could have been
130 * written to either by some instruction at the end of the previous iteration of the loop or by some instruction before
131 * the loop (on the first iteration).
133 public class Phi extends Expr {
134 private final Expr[] inputs;
135 public Phi(Expr[] inputs) {
136 this.inputs = new Expr[inputs.length];
137 System.arraycopy(inputs, 0, this.inputs, 0, inputs.length);
139 public Type getType() {
141 Type t = inputs[0].getType();
143 // FIXME: actually this should check type-unifiability... fe, the "type of null" unifies with any Type.Ref
144 for(int i=1; i<inputs.length; i++)
145 if (inputs[i].getType() != t)
146 throw new Error("Phi node with disagreeing types! Crisis!");
151 public class Argument extends Expr {
152 public final String name;
154 public Argument(String name, Type t) { this.name = name; this.t = t; }
155 public String toString() { return name; }
156 public Type getType() { return t; }
160 public class Not extends Expr {
163 if(e.getType() != Type.BOOLEAN) throw new IllegalArgumentException("not needs a boolean expression");
166 public Type getType() { return Type.BOOLEAN; }
167 public String toString() { return "!(" + e + ")"; }
170 public class Neg extends Expr {
173 if(!e.getType().isPrimitive()) throw new IllegalArgumentException("can only negate a primitive");
176 public Type getType() { return e.getType(); }
177 public String toString() { return "- (" + e + ")"; }
180 // Binary Operations //////////////////////////////////////////////////////////////////////////////
182 public abstract class BinExpr extends Expr {
183 public final Expr e1;
184 public final Expr e2;
185 private final String show;
186 public BinExpr(Expr e1, Expr e2, String show) { this.e1 = e1; this.e2 = e2; this.show = show; }
187 public String toString() {
188 // FEATURE: should we be doing some precedence stuff here? probably no worth it for debugging output
189 return "(" + e1 + show + e2 + ")";
193 public class Comparison extends BinExpr {
194 public Comparison(Expr e1, Expr e2, String show) { super(e1, e2, show); }
195 public Type getType() { return Type.BOOLEAN; }
198 public class Eq extends Comparison {
199 public Eq(Expr e1, Expr e2) {
201 if(e1.getType().isPrimitive() != e2.getType().isPrimitive())
202 throw new IllegalArgumentException("type mismatch");
203 if(e1.getType().isPrimitive() && e1.getType() != e2.getType())
204 throw new IllegalArgumentException("type mismatch");
205 // FEATURE: Check if we can compare these classes
210 public class PrimitiveComparison extends Comparison {
211 public PrimitiveComparison(Expr e1, Expr e2, String show) {
213 if(!e1.getType().isPrimitive() || e1.getType() != e2.getType()) throw new IllegalArgumentException("type mismatch");
217 public class Gt extends PrimitiveComparison { public Gt(Expr e1, Expr e2) { super(e1, e2, ">"); } }
218 public class Lt extends PrimitiveComparison { public Lt(Expr e1, Expr e2) { super(e1, e2, "<"); } }
219 public class Ge extends PrimitiveComparison { public Ge(Expr e1, Expr e2) { super(e1, e2, ">="); } }
220 public class Le extends PrimitiveComparison { public Le(Expr e1, Expr e2) { super(e1, e2, "<="); } }
222 // Math Operations //////////////////////////////////////////////////////////////////////////////
224 public class BinMath extends BinExpr {
225 public BinMath(Expr e1, Expr e2, String show) {
227 if(e1.getType() != e2.getType()) throw new IllegalArgumentException("types disagree");
229 public Type getType() { return e1.getType(); }
232 public class Add extends BinMath { public Add(Expr e, Expr e2) { super(e, e2, "+"); } }
233 public class Sub extends BinMath { public Sub(Expr e, Expr e2) { super(e, e2, "-"); } }
234 public class Mul extends BinMath { public Mul(Expr e, Expr e2) { super(e, e2, "*"); } }
235 public class Rem extends BinMath { public Rem(Expr e, Expr e2) { super(e, e2, "%"); } }
236 public class Div extends BinMath { public Div(Expr e, Expr e2) { super(e, e2, "/"); } }
237 public class And extends BinMath { public And(Expr e, Expr e2) { super(e, e2, "&"); } }
238 public class Or extends BinMath { public Or(Expr e, Expr e2) { super(e, e2, "|"); } }
239 public class Xor extends BinMath { public Xor(Expr e, Expr e2) { super(e, e2, "^"); } }
241 public class BitShiftExpr extends BinExpr {
242 public BitShiftExpr(Expr e1, Expr e2, String show) {
244 Type t = e1.getType();
245 if(t != Type.INT && t != Type.LONG) throw new IllegalArgumentException("type mismatch");
246 if(e2.getType() != Type.INT) throw new IllegalArgumentException("type mismatch");
248 public Type getType() { return e1.getType(); }
250 public class Shl extends BitShiftExpr { public Shl(Expr e, Expr e2) { super(e, e2, "<<"); } }
251 public class Shr extends BitShiftExpr { public Shr(Expr e, Expr e2) { super(e, e2, ">>"); } }
252 public class Ushr extends BitShiftExpr { public Ushr(Expr e, Expr e2) { super(e, e2, ">>>"); } }
254 // Other operations //////////////////////////////////////////////////////////////////////////////
256 public class Cast extends Expr {
259 public Cast(Expr e, Type t) {
260 if(e.getType().isRef() != t.isRef()) throw new IllegalArgumentException("invalid cast");
261 // FEATURE: Check that one is a subclass of the other if it is a ref
265 public Type getType() { return t; }
268 public class InstanceOf extends Expr {
271 public InstanceOf(Expr e, Type.Ref t) {
272 if(!e.getType().isRef()) throw new IllegalArgumentException("can't do an instanceof check on a non-ref");
276 public Type getType() { return Type.BOOLEAN; }
279 public class Throw extends Op {
281 public Throw(Expr e) {
282 if(!e.getType().isRef()) throw new IllegalArgumentException("can't throw a non ref");
283 // FEATURE: CHeck that it is a subclass of Throwable
288 public class Branch extends Op {
289 public Branch(Expr condition, Object destination) { }
290 public Branch(Label destination) { }
291 public Branch(MethodGen.Switch s) { }
294 public class Goto extends Branch { }
295 public class RET extends Branch { }
296 public class JSR extends Branch { public JSR(Label l) { super(l); } }
297 public class If extends Branch { }
299 /** represents a "returnaddr" pushed onto the stack */
300 public class Label extends Expr {
302 public Type getType() { throw new Error("attempted to call getType() on a Label"); }
303 public Label(Op op) { this.op = op; }
304 public Label(int i) { this.op = null; /* FIXME */ }
307 public class New extends Expr {
308 public final Type.Class t;
309 public Type getType() { return t; }
310 public New(Type.Class t) { this.t = t; }
313 public class NewArray extends Expr {
314 public final Type.Array t;
315 public final Expr[] dims;
316 public NewArray(Type.Array t, Expr[] dims) { this.t = t; this.dims = dims; }
317 public NewArray(Type.Array t, Expr dim) { this(t,new Expr[]{dim}); }
318 public Type getType() { return t; }
321 public class Return extends Op {
323 public Return() { this(VOID_EXPR); }
324 public Return(Expr e) { this.e = e; }
325 public String toString() { return e.getType() == Type.VOID ? "return" : ("return "+e.toString()); }
328 /** GETFIELD and GETSTATIC */
329 public class Get extends Expr {
330 final Type.Class.Field f;
332 public Type getType() { return f.getType(); }
333 public Get(Type.Class.Field f) { this(f, null); }
334 public Get(Type.Class.Field f, Expr e) { this.f = f; this.e = e; }
335 public String toString() {
339 : f.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
345 /** PUTFIELD and PUTSTATIC */
346 public class Put extends Op {
347 final Type.Class.Field f;
350 public Put(Type.Class.Field f, Expr v) { this(f, v, null); }
351 public Put(Type.Class.Field f, Expr v, Expr e) { this.f = f; this.v = v; this.e = e; }
352 public String toString() {
356 : f.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
358 : f.toString()) + " = " + v;
362 public class ArrayPut extends Op {
364 public ArrayPut(Expr e, Expr i, Expr v) { this.e = e; this.i = i; this.v = v; }
367 public class ArrayGet extends Expr {
369 public ArrayGet(Expr e, Expr i) { this.e = e; this.i = i; }
370 public Type getType() { return e.getType().asArray().getElementType(); }
373 public class ArrayLength extends Expr {
375 public ArrayLength(Expr e) { this.e = e; }
376 public Type getType() { return Type.INT; }
379 public abstract class Invoke extends Expr {
380 public final Expr[] arguments;
381 public final Type.Class.Method method;
382 protected Invoke(Type.Class.Method m, Expr[] a) { this.arguments = a; this.method = m; }
384 public Type getType() { return method.getReturnType(); }
385 protected void args(StringBuffer sb) {
387 for(int i=0; i<arguments.length; i++) {
388 if (i>0) sb.append(", ");
389 sb.append(arguments[i]+"");
394 public String toString() {
395 StringBuffer sb = new StringBuffer();
396 sb.append(method.getDeclaringClass() == JSSA.this.method.getDeclaringClass()
398 : (method.getDeclaringClass() + "." + method.name));
400 return sb.toString();
403 public class InvokeStatic extends Invoke { public InvokeStatic(Type.Class.Method m, Expr[] a) { super(m,a); } }
404 public class InvokeSpecial extends InvokeVirtual {
405 public InvokeSpecial(Type.Class.Method m, Expr[] a, Expr e) { super(m,a,e); }
406 public String toString() {
407 StringBuffer sb = new StringBuffer();
408 sb.append(method.name.equals("<init>") ? "super" : method.name);
410 return sb.toString();
413 public class InvokeInterface extends InvokeVirtual{public InvokeInterface(Type.Class.Method m, Expr[] a, Expr e){super(m,a,e);}}
414 public class InvokeVirtual extends Invoke {
415 public final Expr instance;
416 public InvokeVirtual(Type.Class.Method m, Expr[] a, Expr e) { super(m, a); instance = e; }
417 public String toString() {
418 StringBuffer sb = new StringBuffer();
419 sb.append(method.name);
421 return sb.toString();
425 public class Constant extends Expr {
426 private final Object o;
427 public Constant(int i) { this(new Integer(i)); }
428 public Constant(Object o) { this.o = o; }
429 public String toString() { return o.toString(); }
430 public Type getType() {
431 if (o instanceof Byte) return Type.BYTE;
432 if (o instanceof Short) return Type.SHORT;
433 if (o instanceof Character) return Type.CHAR;
434 if (o instanceof Boolean) return Type.BOOLEAN;
435 if (o instanceof Long) return Type.LONG;
436 if (o instanceof Double) return Type.DOUBLE;
437 if (o instanceof Float) return Type.FLOAT;
438 if (o instanceof Integer) return Type.INT;
439 throw new IllegalStateException("unknown constant type");
444 // Implementation //////////////////////////////////////////////////////////////////////////////
446 private Object addOp(int op, Object arg) {
450 MethodGen.Wide w = (MethodGen.Wide)arg;
457 MethodGen.Pair p = (MethodGen.Pair)arg;
464 case NOP: return null;
466 // Stack manipulations //////////////////////////////////////////////////////////////////////////////
468 case ACONST_NULL: return stack[sp++] = new Constant(null);
469 case ICONST_M1: return stack[sp++] = new Constant(-1);
470 case ICONST_0: case LCONST_0: case FCONST_0: case DCONST_0: push(new Constant(0)); return null;
471 case ICONST_1: case LCONST_1: case FCONST_1: case DCONST_1: push(new Constant(1)); return null;
472 case ICONST_2: case FCONST_2: push(new Constant(2)); return null;
473 case ICONST_3: push(new Constant(3)); return null;
474 case ICONST_4: push(new Constant(4)); return null;
475 case ICONST_5: push(new Constant(5)); return null;
476 case ILOAD: case LLOAD: case FLOAD: case DLOAD: case ALOAD: return push(local[i1]);
477 case ILOAD_0: case LLOAD_0: case FLOAD_0: case DLOAD_0: case ALOAD_0: return push(local[0]);
478 case ILOAD_1: case LLOAD_1: case FLOAD_1: case DLOAD_1: case ALOAD_1: return push(local[1]);
479 case ALOAD_2: case DLOAD_2: case FLOAD_2: case LLOAD_2: case ILOAD_2: return push(local[2]);
480 case ILOAD_3: case LLOAD_3: case FLOAD_3: case DLOAD_3: case ALOAD_3: return push(local[3]);
481 case ISTORE: case LSTORE: case FSTORE: case DSTORE: case ASTORE: local[i1] = pop(); return null;
482 case ISTORE_0: case LSTORE_0: case FSTORE_0: case DSTORE_0: case ASTORE_0: local[0] = pop(); return null;
483 case ISTORE_1: case LSTORE_1: case FSTORE_1: case DSTORE_1: case ASTORE_1: local[1] = pop(); return null;
484 case ASTORE_2: case DSTORE_2: case FSTORE_2: case LSTORE_2: case ISTORE_2: local[2] = pop(); return null;
485 case ISTORE_3: case LSTORE_3: case FSTORE_3: case DSTORE_3: case ASTORE_3: local[3] = pop(); return null;
486 case POP: stack[--sp] = null;
487 case POP2: stack[--sp] = null; stack[--sp] = null; /** fixme: pops a WORD, not an item */
488 case DUP: stack[sp] = stack[sp-1]; sp++;
489 case DUP2: stack[sp] = stack[sp-2]; stack[sp+1] = stack[sp-1]; sp+=2;
491 // Conversions //////////////////////////////////////////////////////////////////////////////
493 // coercions are added as-needed when converting from JSSA back to bytecode, so we can
494 // simply discard them here (assuming the bytecode we're reading in was valid in the first place)
496 case I2L: case F2L: case D2L: push(new Cast(pop(), Type.LONG)); return null;
497 case I2F: case L2F: case D2F: push(new Cast(pop(), Type.FLOAT)); return null;
498 case I2D: case L2D: case F2D: push(new Cast(pop(), Type.DOUBLE)); return null;
499 case L2I: case F2I: case D2I: push(new Cast(pop(), Type.INT)); return null;
500 case I2B: push(new Cast(pop(), Type.BYTE)); return null;
501 case I2C: push(new Cast(pop(), Type.CHAR)); return null;
502 case I2S: push(new Cast(pop(), Type.SHORT)); return null;
503 case SWAP: { Expr e1 = pop(), e2 = pop(); push(e2); push(e1); return null; }
505 // Math //////////////////////////////////////////////////////////////////////////////
507 case IADD: case LADD: case FADD: case DADD: push(new Add(pop(), pop())); return null;
508 case ISUB: case LSUB: case FSUB: case DSUB: push(new Sub(pop(), pop())); return null;
509 case IMUL: case LMUL: case FMUL: case DMUL: push(new Mul(pop(), pop())); return null;
510 case IREM: case LREM: case FREM: case DREM: push(new Rem(pop(), pop())); return null;
511 //case INEG: case LNEG: case FNEG: case DNEG: push(new Neg(pop())); return null;
512 case IDIV: case LDIV: case FDIV: case DDIV: push(new Div(pop(), pop())); return null;
513 case ISHL: case LSHL: push(new Shl(pop(), pop())); return null;
514 case ISHR: case LSHR: push(new Shr(pop(), pop())); return null;
515 case IUSHR: case LUSHR: push(new Ushr(pop(), pop())); return null;
516 case IAND: case LAND: push(new And(pop(), pop())); return null;
517 case IOR: case LOR: push(new Or(pop(), pop())); return null;
518 case IXOR: case LXOR: push(new Xor(pop(), pop())); return null;
519 case IINC: return local[i1] = new Add(local[i1], new Constant(i2));
521 // Control and branching //////////////////////////////////////////////////////////////////////////////
523 case IFNULL: return new Branch(new Eq(pop(), new Constant(null)), new Label(i1));
524 case IFNONNULL: return new Branch(new Not(new Eq(pop(),new Constant(null))),new Label(i1));
525 case IFEQ: return new Branch( new Eq(new Constant(0), pop()), arg);
526 case IFNE: return new Branch(new Not(new Eq(new Constant(0), pop())), arg);
527 case IFLT: return new Branch( new Lt(new Constant(0), pop()), arg);
528 case IFGE: return new Branch(new Not(new Lt(new Constant(0), pop())), arg);
529 case IFGT: return new Branch( new Gt(new Constant(0), pop()), arg);
530 case IFLE: return new Branch(new Not(new Gt(new Constant(0), pop())), arg);
531 case IF_ICMPEQ: return new Branch( new Eq(pop(), pop()), arg);
532 case IF_ICMPNE: return new Branch(new Not(new Eq(pop(), pop())), arg);
533 case IF_ICMPLT: return new Branch( new Lt(pop(), pop()), arg);
534 case IF_ICMPGE: return new Branch(new Not(new Lt(pop(), pop())), arg);
535 case IF_ICMPGT: return new Branch( new Gt(pop(), pop()), arg);
536 case IF_ICMPLE: return new Branch(new Not(new Gt(pop(), pop())), arg);
537 case IF_ACMPEQ: return new Branch( new Eq(pop(), pop()), arg);
538 case IF_ACMPNE: return new Branch(new Not(new Eq(pop(), pop())), arg);
539 case ATHROW: return new Throw(pop());
540 case GOTO: return new Branch(new Label(i1));
541 case JSR: return new JSR(new Label(i1));
542 case RET: return new RET();
543 case RETURN: return new Return();
544 case IRETURN: case LRETURN: case FRETURN: case DRETURN: case ARETURN:
545 return new Return(pop());
547 // Array manipulations //////////////////////////////////////////////////////////////////////////////
549 case IALOAD: case LALOAD: case FALOAD: case DALOAD: case AALOAD:
550 case BALOAD: case CALOAD: case SALOAD: push(new ArrayGet(pop(), pop())); return null;
551 case IASTORE: case LASTORE: case FASTORE: case DASTORE: case AASTORE:
552 case BASTORE: case CASTORE: case SASTORE: return new ArrayPut(pop(), pop(), pop());
554 // Invocation //////////////////////////////////////////////////////////////////////////////
556 case INVOKEVIRTUAL: case INVOKESPECIAL: case INVOKESTATIC: case INVOKEINTERFACE: {
557 Type.Class.Method method = (Type.Class.Method)arg;
558 Expr args[] = new Expr[method.getNumArgs()];
559 for(int i=0; i<args.length; i++) args[args.length-i-1] = pop();
562 case INVOKEVIRTUAL: ret = new InvokeVirtual(method, args, pop()); break;
563 case INVOKEINTERFACE: ret = new InvokeInterface(method, args, pop()); break;
564 case INVOKESPECIAL: ret = new InvokeSpecial(method, args, pop()); break;
565 case INVOKESTATIC: ret = new InvokeStatic(method, args); break;
566 default: throw new Error("should never happen");
568 if(ret.getType() != Type.VOID) push(ret);
572 // Field Access //////////////////////////////////////////////////////////////////////////////
574 case GETSTATIC: push(new Get((Type.Class.Field)arg, null)); return null;
575 case PUTSTATIC: return new Put((Type.Class.Field)arg, pop(), null);
576 case GETFIELD: push(new Get((Type.Class.Field)arg, pop())); return null;
577 case PUTFIELD: return new Put((Type.Class.Field)arg, pop(), pop());
579 // Allocation //////////////////////////////////////////////////////////////////////////////
581 case NEW: push(new New((Type.Class)arg)); return null;
584 switch(((Integer)arg).intValue()) {
585 case 4: base = Type.BOOLEAN; break;
586 case 5: base = Type.CHAR; break;
587 case 6: base = Type.FLOAT; break;
588 case 7: base = Type.DOUBLE; break;
589 case 8: base = Type.BYTE; break;
590 case 9: base = Type.SHORT; break;
591 case 10: base = Type.INT; break;
592 case 11: base = Type.LONG; break;
593 default: throw new IllegalStateException("invalid array type");
595 push(new NewArray(base.makeArray(),pop()));
598 case ANEWARRAY: push(new NewArray(((Type.Ref)arg).makeArray(), pop())); return null;
599 case MULTIANEWARRAY: {
600 MethodGen.MultiANewArray mana = (MethodGen.MultiANewArray) arg;
601 Expr[] dims = new Expr[mana.dims];
602 for(int i=0;i<dims.length;i++) dims[i] = pop();
603 push(new NewArray(mana.type, dims));
606 case ARRAYLENGTH: push(new ArrayLength(pop())); return null;
608 // Runtime Type information //////////////////////////////////////////////////////////////////////////////
610 case CHECKCAST: push(new Cast(pop(), (Type.Ref)arg)); return null;
611 case INSTANCEOF: push(new InstanceOf(pop(), (Type.Ref)arg)); return null;
613 case LDC: case LDC_W: case LDC2_W: push(new Constant(arg)); return null;
615 case BIPUSH: push(new Constant(i1)); // FIXME return null;
616 case SIPUSH: push(new Constant(i1)); // FIXME return null;
618 case TABLESWITCH: new Branch((MethodGen.Switch)arg);
619 case LOOKUPSWITCH: new Branch((MethodGen.Switch)arg);
622 case MONITORENTER: Op.monitorEnter(pop());
623 case MONITOREXIT: Op.monitorExit(pop());
626 case DUP_X1: throw new Error("unimplemented");
627 case DUP_X2: throw new Error("unimplemented");
628 case DUP2_X1: throw new Error("unimplemented");
629 case DUP2_X2: throw new Error("unimplemented");
630 case LCMP: throw new Error("unimplemented");
631 case FCMPL: throw new Error("unimplemented");
632 case FCMPG: throw new Error("unimplemented");
633 case DCMPL: throw new Error("unimplemented");
634 case DCMPG: throw new Error("unimplemented");
635 case GOTO_W: throw new Error("unimplemented");
636 case JSR_W: throw new Error("unimplemented");
637 default: throw new Error("unhandled");
641 public static void main(String[] args) throws Exception {
642 InputStream is = Class.forName(args[0]).getClassLoader().getResourceAsStream(args[0].replace('.', '/')+".class");
643 System.out.println(new ClassFile(new DataInputStream(is), true).toString());