X-Git-Url: http://git.megacz.com/?p=org.ibex.classgen.git;a=blobdiff_plain;f=src%2Forg%2Fibex%2Fclassgen%2FMethodGen.java;h=4dd05479711754e2a26aa5c5b001a0b9246a3086;hp=703ab970977b9e26638b15461d1d5d9bc3f03ea5;hb=d4d0c4d937a3c18d559e335a84aed3eb4e406723;hpb=161a72a3b197b7f1c84954475aac89a7b191745d diff --git a/src/org/ibex/classgen/MethodGen.java b/src/org/ibex/classgen/MethodGen.java index 703ab97..4dd0547 100644 --- a/src/org/ibex/classgen/MethodGen.java +++ b/src/org/ibex/classgen/MethodGen.java @@ -29,6 +29,39 @@ public class MethodGen implements CGConst { private byte[] op; private Object[] arg; + public String toString() { StringBuffer sb = new StringBuffer(); toString(sb, ""); return sb.toString(); } + public void toString(StringBuffer sb, String constructorName) { + sb.append(ClassGen.flagsToString(flags)); + sb.append(ret.humanReadable()); + sb.append(" "); + + if (name.equals("")) sb.append("static "); + else { + if (name.equals("")) sb.append(constructorName); + else sb.append(name); + sb.append("("); + for(int i=0; istart,end) pointing to handler + /** Adds an exception handler for the range [start, end) pointing to handler @param start The instruction to start at (inclusive) @param end The instruction to end at (exclusive) @param handler The instruction of the excepton handler @param type The type of exception that is to be handled (MUST inherit from Throwable) */ public final void addExceptionHandler(int start, int end, int handler, Type.Object type) { - exnTable.put(type, new ExnTableEnt(start,end,handler,cp.add(type))); + exnTable.put(type, new ExnTableEnt(start, end, handler, cp.add(type))); } /** Adds a exception type that can be thrown from this method @@ -86,7 +119,7 @@ public class MethodGen implements CGConst { @param type The type of exception that can be thrown */ public final void addThrow(Type.Object type) { - thrownExceptions.put(type,cp.add(type)); + thrownExceptions.put(type, cp.add(type)); } private final void grow() { if(size == capacity) grow(size+1); } @@ -94,14 +127,14 @@ public class MethodGen implements CGConst { if(capacity == NO_CODE) throw new IllegalStateException("method can't have code"); if(capacity == FINISHED) throw new IllegalStateException("method has been finished"); if(newCap <= capacity) return; - newCap = Math.max(newCap,capacity == 0 ? 256 : capacity*2); + newCap = Math.max(newCap, capacity == 0 ? 256 : capacity*2); byte[] op2 = new byte[newCap]; - if(capacity != 0) System.arraycopy(op,0,op2,0,size); + if(capacity != 0) System.arraycopy(op, 0, op2, 0, size); op = op2; Object[] arg2 = new Object[newCap]; - if(capacity != 0) System.arraycopy(arg,0,arg2,0,size); + if(capacity != 0) System.arraycopy(arg, 0, arg2, 0, size); arg = arg2; capacity = newCap; @@ -127,17 +160,17 @@ public class MethodGen implements CGConst { /** Adds a bytecode, op, with argument arg to the method @return The position of the new bytecode */ - public final int add(byte op, Object arg) { if(capacity == size) grow(); set(size,op,arg); return size++; } - /** Adds a bytecode with a boolean argument - equivalent to add(op,arg?1:0); + public final int add(byte op, Object arg) { if(capacity == size) grow(); set(size, op, arg); return size++; } + /** Adds a bytecode with a boolean argument - equivalent to add(op, arg?1:0); @return The position of the new bytecode - @see #add(byte,int) + @see #add(byte, int) */ - public final int add(byte op, boolean arg) { if(capacity == size) grow(); set(size,op,arg); return size++; } - /** Adds a bytecode with an integer argument. This is equivalent to add(op,new Integer(arg)), but optimized to prevent the allocation when possible + public final int add(byte op, boolean arg) { if(capacity == size) grow(); set(size, op, arg); return size++; } + /** Adds a bytecode with an integer argument. This is equivalent to add(op, new Integer(arg)), but optimized to prevent the allocation when possible @return The position of the new bytecode - @see #add(byte,Object) + @see #add(byte, Object) */ - public final int add(byte op, int arg) { if(capacity == size) grow(); set(size,op,arg); return size++; } + public final int add(byte op, int arg) { if(capacity == size) grow(); set(size, op, arg); return size++; } /** Gets the bytecode at position pos @exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size() @@ -152,24 +185,24 @@ public class MethodGen implements CGConst { */ public final Object getArg(int pos) { return arg[pos]; } - /** Sets the argument for pos to arg. This is equivalent to set(pos,op,new Integer(arg)), but optimized to prevent the allocation when possible. + /** Sets the argument for pos to arg. This is equivalent to set(pos, op, new Integer(arg)), but optimized to prevent the allocation when possible. @exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size() - @see #setArg(int,Object) */ - public final void setArg(int pos, int arg) { set(pos,op[pos],N(arg)); } + @see #setArg(int, Object) */ + public final void setArg(int pos, int arg) { set(pos, op[pos], N(arg)); } /** Sets the argument for pos to arg. @exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size() */ - public final void setArg(int pos, Object arg) { set(pos,op[pos],arg); } + public final void setArg(int pos, Object arg) { set(pos, op[pos], arg); } /** Sets the bytecode and argument at pos to op and arg respectivly. - This is equivalent to set(pos,op,arg?1:0) + This is equivalent to set(pos, op, arg?1:0) @exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size() */ - public final void set(int pos, byte op, boolean arg) { set(pos,op,arg?1:0); } + public final void set(int pos, byte op, boolean arg) { set(pos, op, arg?1:0); } - // This MUST handle x{LOAD,STORE} and LDC with an int arg WITHOUT falling back to set(int,byte,Object) + // This MUST handle x{LOAD, STORE} and LDC with an int arg WITHOUT falling back to set(int, byte, Object) /** Sets the bytecode and argument at pos to op and n respectivly. - This is equivalent to set(pos,op, new Integer(n)), but optimized to prevent the allocation when possible. + This is equivalent to set(pos, op, new Integer(n)), but optimized to prevent the allocation when possible. @exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size() */ public final void set(int pos, byte op, int n) { @@ -212,7 +245,7 @@ public class MethodGen implements CGConst { } break; default: - set(pos,op,N(n)); + set(pos, op, N(n)); return; } this.op[pos] = op; @@ -226,13 +259,13 @@ public class MethodGen implements CGConst { switch(op) { case ILOAD: case ISTORE: case LLOAD: case LSTORE: case FLOAD: case FSTORE: case DLOAD: case DSTORE: case ALOAD: case ASTORE: - // set(int,byte,int) always handles these ops itself - set(pos,op,((Integer)arg).intValue()); + // set(int, byte, int) always handles these ops itself + set(pos, op, ((Integer)arg).intValue()); return; case LDC: - // set(int,byte,int) always handles these opts itself - if(arg instanceof Integer) { set(pos,op,((Integer)arg).intValue()); return; } - if(arg instanceof Boolean) { set(pos,op,((Boolean)arg).booleanValue()); return; } + // set(int, byte, int) always handles these opts itself + if(arg instanceof Integer) { set(pos, op, ((Integer)arg).intValue()); return; } + if(arg instanceof Boolean) { set(pos, op, ((Boolean)arg).booleanValue()); return; } if(arg instanceof Long) { long l = ((Long)arg).longValue(); @@ -285,8 +318,8 @@ public class MethodGen implements CGConst { this.lo = lo; this.hi = hi; } - public void setTargetForVal(int val, Object o) { setTarget(val-lo,o); } - public void setTargetForVal(int val, int n) { setTarget(val-lo,n); } + public void setTargetForVal(int val, Object o) { setTarget(val-lo, o); } + public void setTargetForVal(int val, int n) { setTarget(val-lo, n); } int length() { return 12 + targets.length * 4; } // 4bytes/target, hi, lo, default } @@ -314,7 +347,7 @@ public class MethodGen implements CGConst { public final byte op; public final int varNum; public final int n; - Wide(byte op, int varNum) { this(op,varNum,0); } + Wide(byte op, int varNum) { this(op, varNum, 0); } Wide(byte op, int varNum, int n) { this.op = op; this.varNum = varNum; this.n = n; } } @@ -360,10 +393,10 @@ public class MethodGen implements CGConst { int[] pc = new int[size]; int[] maxpc = pc; - int p,i; + int p, i; // Pass1 - Calculate maximum pc of each bytecode, widen some insns, resolve any unresolved jumps, etc - for(i=0,p=0;i 255) { this.op[i] = WIDE; - this.arg[i] = new Wide(op,arg); + this.arg[i] = new Wide(op, arg); } break; } @@ -420,7 +453,7 @@ public class MethodGen implements CGConst { Pair pair = (Pair) this.arg[i]; if(pair.i1 > 255 || pair.i2 < -128 || pair.i2 > 127) { this.op[i] = WIDE; - this.arg[i] = new Wide(IINC,pair.i1,pair.i2); + this.arg[i] = new Wide(IINC, pair.i1, pair.i2); } break; } @@ -449,7 +482,7 @@ public class MethodGen implements CGConst { } // Pass3 - Calculate actual pc - for(i=0,p=0;i