final Stack stack = new Stack(); ///< the object stack
int pc = 0; ///< the program counter
- Interpreter(JSFunction f, boolean pauseable, JSArray args) {
+ Interpreter(JSFunction f, boolean pauseable, JSArgs args) {
this.f = f;
this.pausecount = pauseable ? 0 : -1;
this.scope = new JSScope(f.parentScope);
case JF: if (!JS.toBoolean(stack.pop())) pc += JS.toInt((JS)arg) - 1; break;
case JMP: pc += JS.toInt((JS)arg) - 1; break;
case POP: stack.pop(); break;
- case SWAP: {
- int depth = (arg == null ? 1 : JS.toInt((JS)arg));
- JS save = stack.elementAt(stack.size() - 1);
- for(int i=stack.size() - 1; i > stack.size() - 1 - depth; i--)
- stack.setElementAt(stack.elementAt(i-1), i);
- stack.setElementAt(save, stack.size() - depth - 1);
- break;
- }
+ case SWAP: stack.swap(); break;
case DUP: stack.push(stack.peek()); break;
case NEWSCOPE: scope = new JSScope(scope); break;
case OLDSCOPE: scope = scope.getParentScope(); break;
case PUSHKEYS: {
JS o = stack.peek();
- Enumeration e = o.keys();
- JSArray a = new JSArray();
- // FEATURE: Take advantage of the Enumeration, don't create a JSArray
- while(e.hasMoreElements()) a.addElement((JS)e.nextElement());
- stack.push(a);
+ stack.push(o == null ? null : o.keys());
break;
}
case BREAK:
case CONTINUE:
- while(stack.size() > 0) {
+ while(!stack.empty()) {
JS o = stack.pop();
if (o instanceof CallMarker) je("break or continue not within a loop");
if (o instanceof TryMarker) {
case RETURN: {
JS retval = stack.pop();
- while(stack.size() > 0) {
+ while(!stack.empty()) {
Object o = stack.pop();
if (o instanceof TryMarker) {
if(((TryMarker)o).finallyLoc < 0) continue;
if(t != null) {
tm.t = t;
stack.push(tm);
- JSArray args = new JSArray();
- args.addElement(tm.val);
- stack.push(args);
+ stack.push(new JSArgs(tm.val,t.f));
f = t.f;
scope = new JSScope(f.parentScope);
pc = -1;
Trap t = null;
TrapMarker tm = null;
if(target instanceof JSScope && key.jsequals(CASCADE)) {
- Object o=null;
- int i;
- for(i=stack.size()-1;i>=0;i--) if((o = stack.elementAt(i)) instanceof CallMarker) break;
- if(i==0) throw new Error("didn't find a call marker while doing cascade");
+ CallMarker o = stack.findCall();
if(o instanceof TrapMarker) {
tm = (TrapMarker) o;
target = tm.trapee;
t = target instanceof JSScope ? t = ((JSScope)target).top().getTrap(key) : ((JS)target).getTrap(key);
while(t != null && t.readTrap()) t = t.next;
}
-
+
stack.push(val);
if(t != null) {
stack.push(new TrapMarker(this,t,target,key,val));
- JSArray args = new JSArray();
- args.addElement(val);
- stack.push(args);
+ stack.push(new JSArgs(val,t.f));
f = t.f;
scope = new TrapScope(f.parentScope,target,f,key);
pc = -1;
Trap t = null;
TrapMarker tm = null;
if(target instanceof JSScope && key.jsequals(CASCADE)) {
- JS o=null;
- int i;
- for(i=stack.size()-1;i>=0;i--) if((o = stack.elementAt(i)) instanceof CallMarker) break;
- if(i==0) throw new Error("didn't find a call marker while doing cascade");
+ CallMarker o = stack.findCall();
if(o instanceof TrapMarker) {
tm = (TrapMarker) o;
target = tm.trapee;
if(t != null) {
stack.push(new TrapMarker(this,t,(JS)target,key,null));
- stack.push(new JSArray());
+ stack.push(new JSArgs(t.f));
f = t.f;
scope = new TrapScope(f.parentScope,target,f,key);
pc = -1;
case CALL: case CALLMETHOD: {
int numArgs = JS.toInt((JS)arg);
+
+ JS[] rest = numArgs > 3 ? new JS[numArgs - 3] : null;
+ for(int i=numArgs - 1; i>2; i--) rest[i-3] = stack.pop();
+ JS a2 = numArgs <= 2 ? null : stack.pop();
+ JS a1 = numArgs <= 1 ? null : stack.pop();
+ JS a0 = numArgs <= 0 ? null : stack.pop();
+
JS method = null;
JS ret = null;
JS object = stack.pop();
stack.pop();
}
}
- JS[] rest = numArgs > 3 ? new JS[numArgs - 3] : null;
- for(int i=numArgs - 1; i>2; i--) rest[i-3] = stack.pop();
- JS a2 = numArgs <= 2 ? null : stack.pop();
- JS a1 = numArgs <= 1 ? null : stack.pop();
- JS a0 = numArgs <= 0 ? null : stack.pop();
-
if (object instanceof JSFunction) {
- // FIXME: use something similar to call0/call1/call2 here
- JSArray arguments = new JSArray();
- for(int i=0; i<numArgs; i++) arguments.addElement(i==0?a0:i==1?a1:i==2?a2:rest[i-3]);
stack.push(new CallMarker(this));
- stack.push(arguments);
+ stack.push(new JSArgs(a0,a1,a2,rest,numArgs,object));
f = (JSFunction)object;
scope = new JSScope(f.parentScope);
pc = -1;
}
case THROW:
- throw new JSExn(stack.pop(), stack, f, pc, scope);
+ throw new JSExn(stack.pop(), this);
/* FIXME GRAMMAR
case MAKE_GRAMMAR: {
if a handler is not found the exception is thrown
*/
void catchException(JSExn e) throws JSExn {
- while(stack.size() > 0) {
+ while(!stack.empty()) {
JS o = stack.pop();
if (o instanceof CatchMarker || o instanceof TryMarker) {
boolean inCatch = o instanceof CatchMarker;
return super.get(key);
}
}
+
+ static class JSArgs extends JS {
+ private final JS a0;
+ private final JS a1;
+ private final JS a2;
+ private final JS[] rest;
+ private final int nargs;
+ private final JS callee;
+
+ public JSArgs(JS callee) { this(null,null,null,null,0,callee); }
+ public JSArgs(JS a0, JS callee) { this(a0,null,null,null,1,callee); }
+ public JSArgs(JS a0, JS a1, JS a2, JS[] rest, int nargs, JS callee) {
+ this.a0 = a0; this.a1 = a1; this.a2 = a2;
+ this.rest = rest; this.nargs = nargs;
+ this.callee = callee;
+ }
+
+ public JS get(JS key) throws JSExn {
+ if(JS.isInt(key)) {
+ int n = JS.toInt(key);
+ switch(n) {
+ case 0: return a0;
+ case 1: return a1;
+ case 2: return a2;
+ default: return n>= 0 && n < nargs ? rest[n-3] : null;
+ }
+ }
+ //#switch(JS.toString(key))
+ case "callee": return callee;
+ case "length": return JS.N(nargs);
+ //#end
+ return super.get(key);
+ }
+ }
static class Stub extends JS {
private JS method;
private static final int MAX_STACK_SIZE = 512;
private JS[] stack = new JS[64];
private int sp = 0;
- public final void push(JS o) throws JSExn {
- if(sp == stack.length) grow();
- stack[sp++] = o;
+
+ boolean empty() { return sp == 0; }
+ void push(JS o) throws JSExn { if(sp == stack.length) grow(); stack[sp++] = o; }
+ JS peek() { if(sp == 0) throw new RuntimeException("Stack underflow"); return stack[sp-1]; }
+ final JS pop() { if(sp == 0) throw new RuntimeException("Stack underflow"); return stack[--sp]; }
+ void swap() throws JSExn {
+ if(sp < 2) throw new JSExn("stack overflow");
+ JS tmp = stack[sp-2];
+ stack[sp-2] = stack[sp-1];
+ stack[sp-1] = tmp;
}
- public final JS peek() {
- if(sp == 0) throw new RuntimeException("Stack underflow");
- return stack[sp-1];
+ CallMarker findCall() {
+ for(int i=sp-1;i>=0;i--) if(stack[i] instanceof CallMarker) return (CallMarker) stack[i];
+ return null;
}
- public final JS pop() {
- if(sp == 0) throw new RuntimeException("Stack underflow");
- return stack[--sp];
- }
- private void grow() throws JSExn {
+ void grow() throws JSExn {
if(stack.length >= MAX_STACK_SIZE) throw new JSExn("Stack overflow");
JS[] stack2 = new JS[stack.length * 2];
System.arraycopy(stack,0,stack2,0,stack.length);
+ }
+
+ void backtrace(JSExn e) {
+ for(int i=sp-1;i>=0;i--) {
+ if (stack[i] instanceof CallMarker) {
+ CallMarker cm = (CallMarker)stack[i];
+ if(cm.f == null) break;
+ String s = cm.f.sourceName + ":" + cm.f.line[cm.pc-1];
+ if(cm instanceof Interpreter.TrapMarker)
+ s += " (trap on " + JS.debugToString(((Interpreter.TrapMarker)cm).key) + ")";
+ e.addBacktrace(s);
+ }
+ }
}
- // FIXME: Eliminate all uses of SWAP n>1 so we don't need this
- public int size() { return sp; }
- public void setElementAt(JS o, int i) { stack[i] = o; }
- public JS elementAt(int i) { return stack[i]; }
}
}
projects / org.ibex.core.git / blobdiff