1 // Copyright 2003 Adam Megacz, see the COPYING file for licensing [GPL]
8 /** Encapsulates a single JS interpreter (ie call stack) */
9 class Interpreter implements ByteCodes, Tokens {
12 // Thread-Interpreter Mapping /////////////////////////////////////////////////////////////////////////
14 static Interpreter current() { return (Interpreter)threadToInterpreter.get(Thread.currentThread()); }
15 private static Hashtable threadToInterpreter = new Hashtable();
18 // Instance members and methods //////////////////////////////////////////////////////////////////////
20 int pausecount; ///< the number of times pause() has been invoked; -1 indicates unpauseable
21 JSFunction f = null; ///< the currently-executing JSFunction
22 JSScope scope; ///< the current top-level scope (LIFO stack via NEWSCOPE/OLDSCOPE)
23 Vec stack = new Vec(); ///< the object stack
24 int pc = 0; ///< the program counter
26 Interpreter(JSFunction f, boolean pauseable, JSArray args) {
27 stack.push(new Interpreter.CallMarker(this)); // the "root function returned" marker -- f==null
29 this.pausecount = pauseable ? 0 : -1;
30 this.scope = new JSScope(f.parentScope);
34 /** this is the only synchronization point we need in order to be threadsafe */
35 synchronized Object resume() {
36 Thread t = Thread.currentThread();
37 Interpreter old = (Interpreter)threadToInterpreter.get(t);
38 threadToInterpreter.put(t, this);
42 if (old == null) threadToInterpreter.remove(t);
43 else threadToInterpreter.put(t, old);
47 private static JSExn je(String s) { return new JSExn(JS.getSourceName() + ":" + JS.getLine() + " " + s); }
49 // FIXME: double check the trap logic
50 private Object run() throws JSExn {
52 // if pausecount changes after a get/put/call, we know we've been paused
53 final int initialPauseCount = pausecount;
57 if (f == null) return stack.pop();
59 Object arg = f.arg[pc];
60 if(op == FINALLY_DONE) {
61 FinallyData fd = (FinallyData) stack.pop();
62 if(fd == null) continue OUTER; // NOP
67 case LITERAL: stack.push(arg); break;
68 case OBJECT: stack.push(new JS()); break;
69 case ARRAY: stack.push(new JSArray(JS.toNumber(arg).intValue())); break;
70 case DECLARE: scope.declare((String)(arg==null ? stack.peek() : arg)); if(arg != null) stack.push(arg); break;
71 case TOPSCOPE: stack.push(scope); break;
72 case JT: if (JS.toBoolean(stack.pop())) pc += JS.toNumber(arg).intValue() - 1; break;
73 case JF: if (!JS.toBoolean(stack.pop())) pc += JS.toNumber(arg).intValue() - 1; break;
74 case JMP: pc += JS.toNumber(arg).intValue() - 1; break;
75 case POP: stack.pop(); break;
77 int depth = (arg == null ? 1 : JS.toInt(arg));
78 Object save = stack.elementAt(stack.size() - 1);
79 for(int i=stack.size() - 1; i > stack.size() - 1 - depth; i--)
80 stack.setElementAt(stack.elementAt(i-1), i);
81 stack.setElementAt(save, stack.size() - depth - 1);
83 case DUP: stack.push(stack.peek()); break;
84 case NEWSCOPE: scope = new JSScope(scope); break;
85 case OLDSCOPE: scope = scope.getParentScope(); break;
86 case ASSERT: if (!JS.toBoolean(stack.pop())) throw je("assertion failed"); break;
87 case BITNOT: stack.push(JS.N(~JS.toLong(stack.pop()))); break;
88 case BANG: stack.push(JS.B(!JS.toBoolean(stack.pop()))); break;
89 case NEWFUNCTION: stack.push(((JSFunction)arg).cloneWithNewParentScope(scope)); break;
93 Object o = stack.pop();
94 if (o == null) stack.push(null);
95 else if (o instanceof JS) stack.push(((JS)o).typeName());
96 else if (o instanceof String) stack.push("string");
97 else if (o instanceof Number) stack.push("number");
98 else if (o instanceof Boolean) stack.push("boolean");
99 else stack.push("unknown");
104 Object o = stack.peek();
105 Enumeration e = ((JS)o).keys();
106 JSArray a = new JSArray();
107 while(e.hasMoreElements()) a.addElement(e.nextElement());
113 stack.push(new LoopMarker(pc, pc > 0 && f.op[pc - 1] == LABEL ? (String)f.arg[pc - 1] : (String)null, scope));
114 stack.push(Boolean.TRUE);
119 while(stack.size() > 0) {
120 Object o = stack.pop();
121 if (o instanceof CallMarker) je("break or continue not within a loop");
122 if (o instanceof TryMarker) {
123 if(((TryMarker)o).finallyLoc < 0) continue; // no finally block, keep going
124 stack.push(new FinallyData(op, arg));
125 scope = ((TryMarker)o).scope;
126 pc = ((TryMarker)o).finallyLoc - 1;
129 if (o instanceof LoopMarker) {
130 if (arg == null || arg.equals(((LoopMarker)o).label)) {
131 int loopInstructionLocation = ((LoopMarker)o).location;
132 int endOfLoop = ((Integer)f.arg[loopInstructionLocation]).intValue() + loopInstructionLocation;
133 scope = ((LoopMarker)o).scope;
134 if (op == CONTINUE) { stack.push(o); stack.push(Boolean.FALSE); }
135 pc = op == BREAK ? endOfLoop - 1 : loopInstructionLocation;
140 throw new Error("CONTINUE/BREAK invoked but couldn't find LoopMarker at " +
141 JS.getSourceName() + ":" + JS.getLine());
144 int[] jmps = (int[]) arg;
145 // jmps[0] is how far away the catch block is, jmps[1] is how far away the finally block is
146 // each can be < 0 if the specified block does not exist
147 stack.push(new TryMarker(jmps[0] < 0 ? -1 : pc + jmps[0], jmps[1] < 0 ? -1 : pc + jmps[1], scope));
152 Object retval = stack.pop();
153 while(stack.size() > 0) {
154 Object o = stack.pop();
155 if (o instanceof TryMarker) {
156 if(((TryMarker)o).finallyLoc < 0) continue;
158 stack.push(new FinallyData(RETURN));
159 scope = ((TryMarker)o).scope;
160 pc = ((TryMarker)o).finallyLoc - 1;
162 } else if (o instanceof CallMarker) {
163 if (scope instanceof Trap.TrapScope) {
164 Trap.TrapScope ts = (Trap.TrapScope)scope;
165 if (!ts.cascadeHappened) {
166 ts.cascadeHappened = true;
168 while (t != null && t.f.numFormalArgs == 0) t = t.next;
170 ((JS)ts.t.trapee).put(ts.t.name, ts.val);
171 if (pausecount > initialPauseCount) { pc++; return null; } // we were paused
174 JSArray args = new JSArray();
175 args.addElement(ts.val);
178 scope = new Trap.TrapScope(f.parentScope, t, ts.val);
184 scope = ((CallMarker)o).scope;
185 pc = ((CallMarker)o).pc - 1;
186 f = (JSFunction)((CallMarker)o).f;
191 throw new Error("error: RETURN invoked but couldn't find a CallMarker!");
195 Object val = stack.pop();
196 Object key = stack.pop();
197 Object target = stack.peek();
199 throw je("tried to put a value to the " + key + " property on the null value");
200 if (!(target instanceof JS))
201 throw je("tried to put a value to the " + key + " property on a " + target.getClass().getName());
203 throw je("tried to assign \"" + (val==null?"(null)":val.toString()) + "\" to the null key");
205 if (target instanceof JS) {
206 t = ((JS)target).getTrap(key);
207 while (t != null && t.f.numFormalArgs == 0) t = t.next;
208 } else if (target instanceof Trap.TrapScope && key.equals("cascade")) {
209 Trap.TrapScope ts = (Trap.TrapScope)target;
211 ts.cascadeHappened = true;
212 while (t != null && t.f.numFormalArgs == 0) t = t.next;
213 if (t == null) target = ts.t.trapee;
216 stack.push(new CallMarker(this));
217 JSArray args = new JSArray();
218 args.addElement(val);
221 scope = new Trap.TrapScope(f.parentScope, t, val);
225 ((JS)target).put(key, val);
226 if (pausecount > initialPauseCount) { pc++; return null; } // we were paused
235 v = arg == null ? stack.pop() : arg;
243 if (v == null) throw je("tried to get the null key from " + o);
244 if (o == null) throw je("tried to get property \"" + v + "\" from the null object");
245 if (o instanceof String || o instanceof Number || o instanceof Boolean) {
246 ret = getFromPrimitive(o,v);
249 } else if (o instanceof JS) {
251 if (o instanceof JS) {
252 t = ((JS)o).getTrap(v);
253 while (t != null && t.f.numFormalArgs != 0) t = t.next;
254 } else if (o instanceof Trap.TrapScope && v.equals("cascade")) {
255 t = ((Trap.TrapScope)o).t.next;
256 while (t != null && t.f.numFormalArgs != 0) t = t.next;
257 if (t == null) o = ((Trap.TrapScope)o).t.trapee;
260 stack.push(new CallMarker(this));
261 JSArray args = new JSArray();
264 scope = new Trap.TrapScope(f.parentScope, t, null);
265 ((Trap.TrapScope)scope).cascadeHappened = true;
269 ret = ((JS)o).get(v);
270 if (ret == JS.METHOD) ret = new Stub((JS)o, v);
271 if (pausecount > initialPauseCount) { pc++; return null; } // we were paused
275 throw je("tried to get property " + v + " from a " + o.getClass().getName());
278 case CALL: case CALLMETHOD: {
279 int numArgs = JS.toInt(arg);
280 Object method = null;
282 Object object = stack.pop();
284 if (op == CALLMETHOD) {
285 if (object == JS.METHOD) {
286 method = stack.pop();
287 object = stack.pop();
293 Object[] rest = numArgs > 3 ? new Object[numArgs - 3] : null;
294 for(int i=numArgs - 1; i>2; i--) rest[i-3] = stack.pop();
295 Object a2 = numArgs <= 2 ? null : stack.pop();
296 Object a1 = numArgs <= 1 ? null : stack.pop();
297 Object a0 = numArgs <= 0 ? null : stack.pop();
299 if (object instanceof String || object instanceof Number || object instanceof Boolean) {
300 ret = callMethodOnPrimitive(object, method, a0, a1, a2, null, numArgs);
302 } else if (object instanceof JSFunction) {
303 // FIXME: use something similar to call0/call1/call2 here
304 JSArray arguments = new JSArray();
305 for(int i=0; i<numArgs; i++) arguments.addElement(i==0?a0:i==1?a1:i==2?a2:rest[i-3]);
306 stack.push(new CallMarker(this));
307 stack.push(arguments);
308 f = (JSFunction)object;
309 scope = new JSScope(f.parentScope);
313 } else if (object instanceof JS) {
315 ret = method == null ? c.call(a0, a1, a2, rest, numArgs) : c.callMethod(method, a0, a1, a2, rest, numArgs);
318 throw new JSExn("can't call a " + object + " @" + pc + "\n" + f.dump());
321 if (pausecount > initialPauseCount) { pc++; return null; }
327 Object o = stack.pop();
328 if(o instanceof JSExn) throw (JSExn)o;
332 case ASSIGN_SUB: case ASSIGN_ADD: {
333 Object val = stack.pop();
334 Object old = stack.pop();
335 Object key = stack.pop();
336 Object obj = stack.peek();
337 if (val instanceof JSFunction && obj instanceof JSScope) {
338 JSScope parent = (JSScope)obj;
339 while(parent.getParentScope() != null) parent = parent.getParentScope();
340 if (parent instanceof JS) {
342 if (op == ASSIGN_ADD) b.addTrap(key, (JSFunction)val);
343 else b.delTrap(key, (JSFunction)val);
344 // skip over the "normal" implementation of +=/-=
345 pc += ((Integer)arg).intValue() - 1;
349 // use the "normal" implementation
357 int count = ((Number)arg).intValue();
358 if(count < 2) throw new Error("this should never happen");
361 Object right = stack.pop();
362 Object left = stack.pop();
363 if(left instanceof String || right instanceof String)
364 stack.push(JS.toString(left).concat(JS.toString(right)));
365 else stack.push(JS.N(JS.toDouble(left) + JS.toDouble(right)));
367 Object[] args = new Object[count];
368 while(--count >= 0) args[count] = stack.pop();
369 if(args[0] instanceof String) {
370 StringBuffer sb = new StringBuffer(64);
371 for(int i=0;i<args.length;i++) sb.append(JS.toString(args[i]));
372 stack.push(sb.toString());
375 for(int i=0;i<args.length;i++) if(args[i] instanceof String) numStrings++;
376 if(numStrings == 0) {
378 for(int i=0;i<args.length;i++) d += JS.toDouble(args[i]);
382 StringBuffer sb = new StringBuffer(64);
383 if(!(args[0] instanceof String || args[1] instanceof String)) {
386 d += JS.toDouble(args[i++]);
387 } while(!(args[i] instanceof String));
388 sb.append(JS.toString(JS.N(d)));
390 while(i < args.length) sb.append(JS.toString(args[i++]));
391 stack.push(sb.toString());
399 Object right = stack.pop();
400 Object left = stack.pop();
403 case BITOR: stack.push(JS.N(JS.toLong(left) | JS.toLong(right))); break;
404 case BITXOR: stack.push(JS.N(JS.toLong(left) ^ JS.toLong(right))); break;
405 case BITAND: stack.push(JS.N(JS.toLong(left) & JS.toLong(right))); break;
407 case SUB: stack.push(JS.N(JS.toDouble(left) - JS.toDouble(right))); break;
408 case MUL: stack.push(JS.N(JS.toDouble(left) * JS.toDouble(right))); break;
409 case DIV: stack.push(JS.N(JS.toDouble(left) / JS.toDouble(right))); break;
410 case MOD: stack.push(JS.N(JS.toDouble(left) % JS.toDouble(right))); break;
412 case LSH: stack.push(JS.N(JS.toLong(left) << JS.toLong(right))); break;
413 case RSH: stack.push(JS.N(JS.toLong(left) >> JS.toLong(right))); break;
414 case URSH: stack.push(JS.N(JS.toLong(left) >>> JS.toLong(right))); break;
416 case LT: case LE: case GT: case GE: {
417 if (left == null) left = JS.N(0);
418 if (right == null) right = JS.N(0);
420 if (left instanceof String || right instanceof String) {
421 result = left.toString().compareTo(right.toString());
423 result = (int)java.lang.Math.ceil(JS.toDouble(left) - JS.toDouble(right));
425 stack.push(JS.B((op == LT && result < 0) || (op == LE && result <= 0) ||
426 (op == GT && result > 0) || (op == GE && result >= 0)));
435 if (l == null) { Object tmp = r; r = l; l = tmp; }
436 if (l == null && r == null) ret = true;
437 else if (r == null) ret = false; // l != null, so its false
438 else if (l instanceof Boolean) ret = JS.B(JS.toBoolean(r)).equals(l);
439 else if (l instanceof Number) ret = JS.toNumber(r).doubleValue() == JS.toNumber(l).doubleValue();
440 else if (l instanceof String) ret = r != null && l.equals(r.toString());
441 else ret = l.equals(r);
442 stack.push(JS.B(op == EQ ? ret : !ret)); break;
445 default: throw new Error("unknown opcode " + op);
450 while(stack.size() > 0) {
451 Object o = stack.pop();
452 if (o instanceof CatchMarker || o instanceof TryMarker) {
453 boolean inCatch = o instanceof CatchMarker;
456 if(((TryMarker)o).finallyLoc < 0) continue; // no finally block, keep going
458 if(!inCatch && ((TryMarker)o).catchLoc >= 0) {
459 // run the catch block, this will implicitly run the finally block, if it exists
461 stack.push(catchMarker);
462 stack.push(e.getObject());
463 scope = ((TryMarker)o).scope;
464 pc = ((TryMarker)o).catchLoc - 1;
468 stack.push(new FinallyData(THROW));
469 scope = ((TryMarker)o).scope;
470 pc = ((TryMarker)o).finallyLoc - 1;
474 // no handler found within this func
475 if(o instanceof CallMarker) throw e;
484 // Markers //////////////////////////////////////////////////////////////////////
486 public static class CallMarker {
490 public CallMarker(Interpreter cx) { pc = cx.pc + 1; scope = cx.scope; f = cx.f; }
493 public static class CatchMarker { public CatchMarker() { } }
494 private static CatchMarker catchMarker = new CatchMarker();
496 public static class LoopMarker {
499 public JSScope scope;
500 public LoopMarker(int location, String label, JSScope scope) {
501 this.location = location;
506 public static class TryMarker {
508 public int finallyLoc;
509 public JSScope scope;
510 public TryMarker(int catchLoc, int finallyLoc, JSScope scope) {
511 this.catchLoc = catchLoc;
512 this.finallyLoc = finallyLoc;
516 public static class FinallyData {
519 public FinallyData(int op, Object arg) { this.op = op; this.arg = arg; }
520 public FinallyData(int op) { this(op,null); }
524 // Operations on Primitives //////////////////////////////////////////////////////////////////////
526 static Object callMethodOnPrimitive(Object o, Object method, Object arg0, Object arg1, Object arg2, Object[] rest, int alength) {
527 if (o instanceof Number) {
529 case "toFixed": throw new JSExn("toFixed() not implemented");
530 case "toExponential": throw new JSExn("toExponential() not implemented");
531 case "toPrecision": throw new JSExn("toPrecision() not implemented");
533 int radix = alength >= 1 ? JS.toInt(arg0) : 10;
534 return Long.toString(((Number)o).longValue(),radix);
537 } else if (o instanceof Boolean) {
538 // No methods for Booleans
539 throw new JSExn("attempt to call a method on a Boolean");
542 String s = JS.toString(o);
543 int slength = s.length();
546 int a = alength >= 1 ? JS.toInt(arg0) : 0;
547 int b = alength >= 2 ? JS.toInt(arg1) : slength;
548 if (a > slength) a = slength;
549 if (b > slength) b = slength;
552 if (a > b) { int tmp = a; a = b; b = tmp; }
553 return s.substring(a,b);
556 int start = alength >= 1 ? JS.toInt(arg0) : 0;
557 int len = alength >= 2 ? JS.toInt(arg1) : Integer.MAX_VALUE;
558 if (start < 0) start = slength + start;
559 if (start < 0) start = 0;
560 if (len < 0) len = 0;
561 if (len > slength - start) len = slength - start;
562 if (len <= 0) return "";
563 return s.substring(start,start+len);
566 int p = alength >= 1 ? JS.toInt(arg0) : 0;
567 if (p < 0 || p >= slength) return "";
568 return s.substring(p,p+1);
571 int p = alength >= 1 ? JS.toInt(arg0) : 0;
572 if (p < 0 || p >= slength) return JS.N(Double.NaN);
573 return JS.N(s.charAt(p));
576 StringBuffer sb = new StringBuffer(slength*2).append(s);
577 for(int i=0;i<alength;i++) sb.append(i==0?arg0:i==1?arg1:i==2?arg2:rest[i-3]);
578 return sb.toString();
581 String search = alength >= 1 ? arg0.toString() : "null";
582 int start = alength >= 2 ? JS.toInt(arg1) : 0;
583 // Java's indexOf handles an out of bounds start index, it'll return -1
584 return JS.N(s.indexOf(search,start));
586 case "lastIndexOf": {
587 String search = alength >= 1 ? arg0.toString() : "null";
588 int start = alength >= 2 ? JS.toInt(arg1) : 0;
589 // Java's indexOf handles an out of bounds start index, it'll return -1
590 return JS.N(s.lastIndexOf(search,start));
592 case "match": return JSRegexp.stringMatch(s,arg0);
593 case "replace": return JSRegexp.stringReplace(s,(String)arg0,arg1);
594 case "search": return JSRegexp.stringSearch(s,arg0);
595 case "split": return JSRegexp.stringSplit(s,arg0,arg1,alength);
596 case "toLowerCase": return s.toLowerCase();
597 case "toUpperCase": return s.toUpperCase();
598 case "toString": return s;
600 int a = alength >= 1 ? JS.toInt(arg0) : 0;
601 int b = alength >= 2 ? JS.toInt(arg1) : slength;
602 if (a < 0) a = slength + a;
603 if (b < 0) b = slength + b;
606 if (a > slength) a = slength;
607 if (b > slength) b = slength;
608 if (a > b) return "";
609 return s.substring(a,b);
612 throw new JSExn("Attempted to call non-existent method: " + method);
615 static Object getFromPrimitive(Object o, Object key) {
616 boolean returnJS = false;
617 if (o instanceof Boolean) {
618 throw new JSExn("cannot call methods on Booleans");
619 } else if (o instanceof Number) {
620 if (key.equals("toPrecision") || key.equals("toExponential") || key.equals("toFixed"))
624 // the string stuff applies to everything
625 String s = o.toString();
627 // this is sort of ugly, but this list should never change
628 // These should provide a complete (enough) implementation of the ECMA-262 String object
631 case "length": return JS.N(s.length());
632 case "substring": returnJS = true; break;
633 case "charAt": returnJS = true; break;
634 case "charCodeAt": returnJS = true; break;
635 case "concat": returnJS = true; break;
636 case "indexOf": returnJS = true; break;
637 case "lastIndexOf": returnJS = true; break;
638 case "match": returnJS = true; break;
639 case "replace": returnJS = true; break;
640 case "seatch": returnJS = true; break;
641 case "slice": returnJS = true; break;
642 case "split": returnJS = true; break;
643 case "toLowerCase": returnJS = true; break;
644 case "toUpperCase": returnJS = true; break;
645 case "toString": returnJS = true; break;
646 case "substr": returnJS = true; break;
650 final Object target = o;
651 final String method = key.toString();
653 public Object call(Object a0, Object a1, Object a2, Object[] rest, int nargs) {
654 if (nargs > 2) throw new JSExn("cannot call that method with that many arguments");
655 return callMethodOnPrimitive(target, method, a0, a1, a2, rest, nargs);
662 private static class Stub extends JS {
663 private Object method;
665 public Stub(JS obj, Object method) { this.obj = obj; this.method = method; }
666 public Object call(Object a0, Object a1, Object a2, Object[] rest, int nargs) {
667 return ((JS)obj).callMethod(method, a0, a1, a2, rest, nargs);