1 // Copyright 2003 Adam Megacz, see the COPYING file for licensing [GPL]
7 /** a JavaScript function, compiled into bytecode */
8 class CompiledFunctionImpl extends JS.Obj implements ByteCodes, Tokens {
10 // Fields and Accessors ///////////////////////////////////////////////
12 /** the number of formal arguments */
13 int numFormalArgs = 20;
15 /** the source code file that this block was drawn from */
17 public String getSourceName() throws JS.Exn { return sourceName; }
19 /** the line numbers */
20 int[] line = new int[10];
22 /** the first line of this script */
23 private int firstLine = -1;
25 /** the instructions */
26 int[] op = new int[10];
28 /** the arguments to the instructions */
29 Object[] arg = new Object[10];
31 /** the number of instruction/argument pairs */
33 int size() { return size; }
35 /** the scope in which this function was declared; by default this function is called in a fresh subscope of the parentScope */
38 // Constructors ////////////////////////////////////////////////////////
40 private CompiledFunctionImpl cloneWithNewParentScope(JS.Scope s) throws IOException {
41 CompiledFunctionImpl ret = new JS.CompiledFunction(sourceName, firstLine, null, s);
42 // Reuse the same op, arg, line, and size variables for the new "instance" of the function
43 // NOTE: Neither *this* function nor the new function should be modified after this call
48 ret.numFormalArgs = this.numFormalArgs;
52 protected CompiledFunctionImpl(String sourceName, int firstLine, Reader sourceCode, JS.Scope parentScope) throws IOException {
53 this.sourceName = sourceName;
54 this.firstLine = firstLine;
55 this.parentScope = parentScope;
56 if (sourceCode == null) return;
57 Parser p = new Parser(sourceCode, sourceName, firstLine);
60 p.parseStatement(this, null);
61 if (s == size()) break;
63 add(-1, LITERAL, null);
69 // Adding and Altering Bytecodes ///////////////////////////////////////////////////
71 int get(int pos) { return op[pos]; }
72 Object getArg(int pos) { return arg[pos]; }
73 void set(int pos, int op_, Object arg_) { op[pos] = op_; arg[pos] = arg_; }
74 void set(int pos, Object arg_) { arg[pos] = arg_; }
75 int pop() { size--; arg[size] = null; return op[size]; }
76 void paste(CompiledFunctionImpl other) { for(int i=0; i<other.size; i++) add(other.line[i], other.op[i], other.arg[i]); }
77 CompiledFunctionImpl add(int line, int op_) { return add(line, op_, null); }
78 CompiledFunctionImpl add(int line, int op_, Object arg_) {
79 if (size == op.length - 1) {
80 int[] line2 = new int[op.length * 2]; System.arraycopy(this.line, 0, line2, 0, op.length); this.line = line2;
81 Object[] arg2 = new Object[op.length * 2]; System.arraycopy(arg, 0, arg2, 0, arg.length); arg = arg2;
82 int[] op2 = new int[op.length * 2]; System.arraycopy(op, 0, op2, 0, op.length); op = op2;
84 this.line[size] = line;
91 public static int getLine(Context cx) {
92 if(cx.pc < 0 || cx.pc >= ((CompiledFunctionImpl)cx.f).size) return -1;
93 return ((CompiledFunctionImpl)cx.f).line[cx.pc];
97 // Invoking the Bytecode ///////////////////////////////////////////////////////
99 /** returns false if the thread has been paused */
100 static Object eval(final Context cx, Object pushFirst) throws JS.Exn {
101 cx.stack.push(pushFirst);
102 OUTER: for(;; cx.pc++) {
104 if (cx.f == null) return cx.stack.pop();
105 if (cx.pc >= ((CompiledFunctionImpl)cx.f).size) return cx.stack.pop();
107 int curOP = cx.f.op[cx.pc];
108 Object curArg = cx.f.arg[cx.pc];
109 Object returnedFromJava = null;
110 boolean checkReturnedFromJava = false;
111 if(curOP == FINALLY_DONE) {
112 FinallyData fd = (FinallyData) cx.stack.pop();
113 if(fd == null) continue OUTER; // NOP
118 case LITERAL: cx.stack.push(curArg); break;
119 case OBJECT: cx.stack.push(new JS.Obj()); break;
120 case ARRAY: cx.stack.push(new JS.Array(JS.toNumber(curArg).intValue())); break;
121 case DECLARE: cx.scope.declare((String)(curArg==null ? cx.stack.peek() : curArg)); if(curArg != null) cx.stack.push(curArg); break;
122 case TOPSCOPE: cx.stack.push(cx.scope); break;
123 case JT: if (JS.toBoolean(cx.stack.pop())) cx.pc += JS.toNumber(curArg).intValue() - 1; break;
124 case JF: if (!JS.toBoolean(cx.stack.pop())) cx.pc += JS.toNumber(curArg).intValue() - 1; break;
125 case JMP: cx.pc += JS.toNumber(curArg).intValue() - 1; break;
126 case POP: cx.stack.pop(); break;
127 case SWAP: { Object o1 = cx.stack.pop(); Object o2 = cx.stack.pop(); cx.stack.push(o1); cx.stack.push(o2); break; }
128 case DUP: cx.stack.push(cx.stack.peek()); break;
129 case NEWSCOPE: cx.scope = new JS.Scope(cx.scope); break;
130 case OLDSCOPE: cx.scope = cx.scope.getParentScope(); break;
131 case ASSERT: if (!JS.toBoolean(cx.stack.pop())) throw je("assertion failed"); break;
132 case BITNOT: cx.stack.push(new Long(~JS.toLong(cx.stack.pop()))); break;
133 case BANG: cx.stack.push(new Boolean(!JS.toBoolean(cx.stack.pop()))); break;
136 Object o = cx.stack.pop();
137 if (o == null) cx.stack.push(null);
138 else if (o instanceof JS) cx.stack.push(((JS)o).typeName());
139 else if (o instanceof String) cx.stack.push("string");
140 else if (o instanceof Number) cx.stack.push("number");
141 else if (o instanceof Boolean) cx.stack.push("boolean");
142 else cx.stack.push("unknown");
148 cx.stack.push(((CompiledFunctionImpl)curArg).cloneWithNewParentScope(cx.scope));
149 } catch (IOException e) {
150 throw new Error("this should never happen");
156 Object o = cx.stack.peek();
157 Object[] keys = ((JS)o).keys();
158 JS.Array a = new JS.Array();
159 a.setSize(keys.length);
160 for(int j=0; j<keys.length; j++) a.setElementAt(keys[j], j);
167 cx.stack.push(new LoopMarker(cx.pc, cx.pc > 0 && cx.f.op[cx.pc - 1] == LABEL ? (String)cx.f.arg[cx.pc - 1] : (String)null, cx.scope));
168 cx.stack.push(Boolean.TRUE);
174 while(cx.stack.size() > 0) {
175 Object o = cx.stack.pop();
176 if (o instanceof CallMarker) ee("break or continue not within a loop");
177 if (o instanceof TryMarker) {
178 if(((TryMarker)o).finallyLoc < 0) continue; // no finally block, keep going
179 cx.stack.push(new FinallyData(curOP, curArg));
180 cx.scope = ((TryMarker)o).scope;
181 cx.pc = ((TryMarker)o).finallyLoc - 1;
184 if (o instanceof LoopMarker) {
185 if (curArg == null || curArg.equals(((LoopMarker)o).label)) {
186 int loopInstructionLocation = ((LoopMarker)o).location;
187 int endOfLoop = ((Integer)cx.f.arg[loopInstructionLocation]).intValue() + loopInstructionLocation;
188 cx.scope = ((LoopMarker)o).scope;
189 if (curOP == CONTINUE) { cx.stack.push(o); cx.stack.push(Boolean.FALSE); }
190 cx.pc = curOP == BREAK ? endOfLoop - 1 : loopInstructionLocation;
195 throw new Error("CONTINUE/BREAK invoked but couldn't find a LoopMarker at " + ((CompiledFunctionImpl)cx.f).sourceName + ":" + getLine(cx));
198 int[] jmps = (int[]) curArg;
199 // jmps[0] is how far away the catch block is, jmps[1] is how far away the finally block is
200 // each can be < 0 if the specified block does not exist
201 cx.stack.push(new TryMarker(jmps[0] < 0 ? -1 : cx.pc + jmps[0], jmps[1] < 0 ? -1 : cx.pc + jmps[1], cx.scope));
206 Object retval = cx.stack.pop();
207 while(cx.stack.size() > 0) {
208 Object o = cx.stack.pop();
209 if (o instanceof TryMarker) {
210 if(((TryMarker)o).finallyLoc < 0) continue;
211 cx.stack.push(retval);
212 cx.stack.push(new FinallyData(RETURN));
213 cx.scope = ((TryMarker)o).scope;
214 cx.pc = ((TryMarker)o).finallyLoc - 1;
217 if (o instanceof CallMarker) {
218 cx.scope = ((CallMarker)o).scope;
219 cx.pc = ((CallMarker)o).pc;
220 cx.f = (CompiledFunction)((CallMarker)o).f;
221 cx.stack.push(retval);
225 throw new Error("error: RETURN invoked but couldn't find a CallMarker!");
229 Object val = cx.stack.pop();
230 Object key = cx.stack.pop();
231 Object target = cx.stack.peek();
233 throw je("tried to put a value to the " + key + " property on the null value");
234 if (!(target instanceof JS))
235 throw je("tried to put a value to the " + key + " property on a " + target.getClass().getName());
237 throw je("tried to assign \"" + (val==null?"(null)":val.toString()) + "\" to the null key");
238 returnedFromJava = ((JS)target).put(key, val);
239 if (returnedFromJava != null) {
240 checkReturnedFromJava = true;
251 v = curArg == null ? cx.stack.pop() : curArg;
259 if (o == null) throw je("tried to get property \"" + v + "\" from the null value");
260 if (v == null) throw je("tried to get the null key from " + o);
261 if (o instanceof String || o instanceof Number || o instanceof Boolean)
262 ret = Internal.getFromPrimitive(o,v);
263 else if (o instanceof JS) {
264 returnedFromJava = ((JS)o).get(v);
265 checkReturnedFromJava = true;
268 throw je("tried to get property " + v + " from a " + o.getClass().getName());
277 JS.Array arguments = new JS.Array();
278 int numArgs = JS.toNumber(curArg).intValue();
279 arguments.setSize(numArgs);
281 if (curOP == CALL_REVERSED) o = cx.stack.pop();
282 for(int j=numArgs - 1; j >= 0; j--) arguments.setElementAt(cx.stack.pop(), j);
283 if (curOP != CALL_REVERSED) o = cx.stack.pop();
284 if(o == null) throw je("attempted to call null");
287 if(curOP == CALLMETHOD) {
290 if(o instanceof String || o instanceof Number || o instanceof Boolean) {
291 ret = Internal.callMethodOnPrimitive(o,method,arguments);
293 cx.pc += 2; // skip the GET and CALL
295 } else if (o instanceof JS && ((JS)o).callMethod(method, arguments, true) == Boolean.TRUE) {
296 returnedFromJava = ((JS)o).callMethod(method, arguments, false);
297 checkReturnedFromJava = true;
298 cx.pc += 2; // skip the GET and CALL
301 // put the args back on the stack and let the GET followed by CALL happen
302 for(int j=0; j<numArgs; j++) cx.stack.push(arguments.elementAt(j));
304 cx.stack.push(method);
309 if (o instanceof CompiledFunctionImpl) {
310 cx.stack.push(new CallMarker(cx));
311 cx.stack.push(arguments);
312 cx.f = (CompiledFunction)o;
313 cx.scope = new FunctionScope("unknown", cx.f.parentScope);
318 returnedFromJava = ((JS.Callable)o).call(arguments);
319 checkReturnedFromJava = true;
325 Object o = cx.stack.pop();
326 if(o instanceof JS.Exn) throw (JS.Exn)o;
330 case INC: case DEC: {
331 boolean isPrefix = JS.toBoolean(curArg);
332 Object key = cx.stack.pop();
333 JS obj = (JS)cx.stack.pop();
334 Number num = JS.toNumber(obj.get(key));
335 Number val = new Double(curOP == INC ? num.doubleValue() + 1.0 : num.doubleValue() - 1.0);
337 cx.stack.push(isPrefix ? val : num);
341 case ASSIGN_SUB: case ASSIGN_ADD: {
342 Object val = cx.stack.pop();
343 Object old = cx.stack.pop();
344 Object key = cx.stack.pop();
345 Object obj = cx.stack.peek();
346 if (val instanceof CompiledFunction) {
347 if (obj instanceof JS.Scope) {
348 JS.Scope parent = (JS.Scope)obj;
349 while(parent.getParentScope() != null) parent = parent.getParentScope();
350 if (parent instanceof org.xwt.Box) {
351 if (curOP == ASSIGN_ADD) {
352 ((org.xwt.Box)parent).addTrap(key, val);
354 ((org.xwt.Box)parent).delTrap(key, val);
356 // skip over the "normal" implementation of +=/-=
357 cx.pc += ((Integer)curArg).intValue() - 1;
362 // use the "normal" implementation
370 int count = ((Number)curArg).intValue();
371 if(count < 2) throw new Error("this should never happen");
374 Object right = cx.stack.pop();
375 Object left = cx.stack.pop();
376 if(left instanceof String || right instanceof String) cx.stack.push(JS.toString(left).concat(JS.toString(right)));
377 else cx.stack.push(new Double(JS.toDouble(left) + JS.toDouble(right)));
379 Object[] args = new Object[count];
380 while(--count >= 0) args[count] = cx.stack.pop();
381 if(args[0] instanceof String) {
382 StringBuffer sb = new StringBuffer(64);
383 for(int i=0;i<args.length;i++) sb.append(JS.toString(args[i]));
384 cx.stack.push(sb.toString());
387 for(int i=0;i<args.length;i++) if(args[i] instanceof String) numStrings++;
388 if(numStrings == 0) {
390 for(int i=0;i<args.length;i++) d += JS.toDouble(args[i]);
391 cx.stack.push(new Double(d));
394 StringBuffer sb = new StringBuffer(64);
395 if(!(args[0] instanceof String || args[1] instanceof String)) {
398 d += JS.toDouble(args[i++]);
399 } while(!(args[i] instanceof String));
400 sb.append(JS.toString(new Double(d)));
402 while(i < args.length) sb.append(JS.toString(args[i++]));
403 cx.stack.push(sb.toString());
411 Object right = cx.stack.pop();
412 Object left = cx.stack.pop();
415 case BITOR: cx.stack.push(new Long(JS.toLong(left) | JS.toLong(right))); break;
416 case BITXOR: cx.stack.push(new Long(JS.toLong(left) ^ JS.toLong(right))); break;
417 case BITAND: cx.stack.push(new Long(JS.toLong(left) & JS.toLong(right))); break;
419 case SUB: cx.stack.push(new Double(JS.toDouble(left) - JS.toDouble(right))); break;
420 case MUL: cx.stack.push(new Double(JS.toDouble(left) * JS.toDouble(right))); break;
421 case DIV: cx.stack.push(new Double(JS.toDouble(left) / JS.toDouble(right))); break;
422 case MOD: cx.stack.push(new Double(JS.toDouble(left) % JS.toDouble(right))); break;
424 case LSH: cx.stack.push(new Long(JS.toLong(left) << JS.toLong(right))); break;
425 case RSH: cx.stack.push(new Long(JS.toLong(left) >> JS.toLong(right))); break;
426 case URSH: cx.stack.push(new Long(JS.toLong(left) >>> JS.toLong(right))); break;
428 case LT: case LE: case GT: case GE: {
429 if (left == null) left = new Integer(0);
430 if (right == null) right = new Integer(0);
432 if (left instanceof String || right instanceof String) {
433 result = left.toString().compareTo(right.toString());
435 result = (int)java.lang.Math.ceil(JS.toDouble(left) - JS.toDouble(right));
437 cx.stack.push(new Boolean((curOP == LT && result < 0) || (curOP == LE && result <= 0) ||
438 (curOP == GT && result > 0) || (curOP == GE && result >= 0)));
447 if (l == null) { Object tmp = r; r = l; l = tmp; }
448 if (l == null && r == null) ret = true;
449 else if (r == null) ret = false; // l != null, so its false
450 else if (l instanceof Boolean) ret = new Boolean(JS.toBoolean(r)).equals(l);
451 else if (l instanceof Number) ret = JS.toNumber(r).doubleValue() == JS.toNumber(l).doubleValue();
452 else if (l instanceof String) ret = r != null && l.equals(r.toString());
453 else ret = l.equals(r);
454 cx.stack.push(new Boolean(curOP == EQ ? ret : !ret)); break;
457 default: throw new Error("unknown opcode " + curOP);
461 // handle special directions returned from Java callouts
462 // ideally we would do this with exceptions, but they're *very* slow in gcj
463 if (checkReturnedFromJava) {
464 checkReturnedFromJava = false;
465 if (returnedFromJava == Context.pause) {
467 return Context.pause;
468 } else if (returnedFromJava instanceof TailCall) {
469 cx.stack.push(new CallMarker(cx));
470 cx.stack.push(((JS.TailCall)returnedFromJava).args);
471 cx.f = ((JS.TailCall)returnedFromJava).func;
472 cx.scope = new CompiledFunctionImpl.FunctionScope("unknown", cx.f.parentScope);
475 cx.stack.push(returnedFromJava);
482 while(cx.stack.size() > 0) {
483 Object o = cx.stack.pop();
484 if (o instanceof CatchMarker || o instanceof TryMarker) {
485 boolean inCatch = o instanceof CatchMarker;
488 if(((TryMarker)o).finallyLoc < 0) continue; // no finally block, keep going
490 if(!inCatch && ((TryMarker)o).catchLoc >= 0) {
491 // run the catch block, this will implicitly run the finally block, if it exists
493 cx.stack.push(catchMarker);
494 cx.stack.push(e.getObject());
495 cx.scope = ((TryMarker)o).scope;
496 cx.pc = ((TryMarker)o).catchLoc - 1;
500 cx.stack.push(new FinallyData(THROW));
501 cx.scope = ((TryMarker)o).scope;
502 cx.pc = ((TryMarker)o).finallyLoc - 1;
506 // no handler found within this func
507 if(o instanceof CallMarker) throw e;
514 // Debugging //////////////////////////////////////////////////////////////////////
516 public String toString() {
517 StringBuffer sb = new StringBuffer(1024);
518 sb.append("\n" + sourceName + ": " + firstLine + "\n");
519 for (int i=0; i < size; i++) {
523 sb.append(bytecodeToString[-op[i]]);
525 sb.append(codeToString[op[i]]);
527 sb.append(arg[i] == null ? "(no arg)" : arg[i]);
528 if((op[i] == JF || op[i] == JT || op[i] == JMP) && arg[i] != null && arg[i] instanceof Number) {
529 sb.append(" jump to ").append(i+((Number) arg[i]).intValue());
530 } else if(op[i] == TRY) {
531 int[] jmps = (int[]) arg[i];
532 sb.append(" catch: ").append(jmps[0] < 0 ? "No catch block" : ""+(i+jmps[0]));
533 sb.append(" finally: ").append(jmps[1] < 0 ? "No finally block" : ""+(i+jmps[1]));
537 return sb.toString();
540 // Exception Stuff ////////////////////////////////////////////////////////////////
542 static class EvaluatorException extends RuntimeException { public EvaluatorException(String s) { super(s); } }
543 static EvaluatorException ee(String s) {
544 throw new EvaluatorException(JS.Context.getSourceName() + ":" + JS.Context.getLine() + " " + s);
546 static JS.Exn je(String s) {
547 throw new JS.Exn(JS.Context.getSourceName() + ":" + JS.Context.getLine() + " " + s);
550 // FunctionScope /////////////////////////////////////////////////////////////////
552 static class FunctionScope extends JS.Scope {
554 public FunctionScope(String sourceName, Scope parentScope) { super(parentScope); this.sourceName = sourceName; }
555 public String getSourceName() { return sourceName; }
559 // Markers //////////////////////////////////////////////////////////////////////
561 public static class CallMarker {
564 CompiledFunctionImpl f;
565 public CallMarker(Context cx) { pc = cx.pc + 1; scope = cx.scope; f = cx.f; }
568 public static class CatchMarker { public CatchMarker() { } }
569 private static CatchMarker catchMarker = new CatchMarker();
571 public static class LoopMarker {
574 public JS.Scope scope;
575 public LoopMarker(int location, String label, JS.Scope scope) {
576 this.location = location;
581 public static class TryMarker {
583 public int finallyLoc;
584 public JS.Scope scope;
585 public TryMarker(int catchLoc, int finallyLoc, JS.Scope scope) {
586 this.catchLoc = catchLoc;
587 this.finallyLoc = finallyLoc;
591 public static class FinallyData {
594 public FinallyData(int op, Object arg) { this.op = op; this.arg = arg; }
595 public FinallyData(int op) { this(op,null); }
599 /** this class exists solely to work around a GCJ bug */
600 abstract class JSCallable extends JS.Callable {
601 public abstract Object call(JS.Array args) throws JS.Exn;