@@ -128,17+128,17 @@ public class MethodGen implements CGConst {
/** Adds a bytecode, <i>op</i>, with argument <i>arg</i> to the method
@return The position of the new bytecode
*/
/** Adds a bytecode, <i>op</i>, with argument <i>arg</i> 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
@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
@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 <i>pos</i>
@exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size()
/** Gets the bytecode at position <i>pos</i>
@exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size()
@@ -153,24+153,24 @@ public class MethodGen implements CGConst {
*/
public final Object getArg(int pos) { return arg[pos]; }
*/
public final Object getArg(int pos) { return arg[pos]; }
- /** Sets the argument for <i>pos</i> to <i>arg</i>. This is equivalent to set(pos,op,new Integer(arg)), but optimized to prevent the allocation when possible.
+ /** Sets the argument for <i>pos</i> to <i>arg</i>. 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()
@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 <i>pos</i> to <i>arg</i>.
@exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size()
*/
/** Sets the argument for <i>pos</i> to <i>arg</i>.
@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 <i>pos</i> to <i>op</i> and <i>arg</i> respectivly.
/** Sets the bytecode and argument at <i>pos</i> to <i>op</i> and <i>arg</i> 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()
*/
@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 <i>pos</i> to <i>op</i> and <i>n</i> respectivly.
/** Sets the bytecode and argument at <i>pos</i> to <i>op</i> and <i>n</i> 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) {
@exception ArrayIndexOutOfBoundException if pos < 0 || pos >= size()
*/
public final void set(int pos, byte op, int n) {
@@ -213,7+213,7 @@ public class MethodGen implements CGConst {
}
break;
default:
}
break;
default:
- set(pos,op,N(n));
+ set(pos, op, N(n));
return;
}
this.op[pos] = op;
return;
}
this.op[pos] = op;
@@ -227,13+227,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:
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:
return;
case LDC:
- // set(int,byte,int) always handles these opts itself
projects / org.ibex.classgen.git / commitdiff