2 * Copyright 2011 Jacek Caban for CodeWeavers
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
25 #include "wine/debug.h"
27 WINE_DEFAULT_DEBUG_CHANNEL(jscript);
28 WINE_DECLARE_DEBUG_CHANNEL(jscript_disas);
30 typedef struct _statement_ctx_t {
36 unsigned continue_label;
38 const labelled_statement_t *labelled_stat;
40 struct _statement_ctx_t *next;
54 statement_ctx_t *stat_ctx;
59 instr_arg_type_t arg1_type;
60 instr_arg_type_t arg2_type;
62 #define X(n,a,b,c) {#n,b,c},
67 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
71 TRACE_(jscript_disas)("\t%s", debugstr_w(arg->str));
74 TRACE_(jscript_disas)("\t%s", debugstr_wn(arg->bstr, SysStringLen(arg->bstr)));
77 TRACE_(jscript_disas)("\t%d", arg->uint);
81 TRACE_(jscript_disas)("\t%u", arg->uint);
84 TRACE_(jscript_disas)("\t%lf", *arg->dbl);
94 static void dump_code(compiler_ctx_t *ctx, unsigned off)
98 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
99 TRACE_(jscript_disas)("%d:\t%s", (int)(instr-ctx->code->instrs), instr_info[instr->op].op_str);
100 dump_instr_arg(instr_info[instr->op].arg1_type, &instr->arg1);
101 dump_instr_arg(instr_info[instr->op].arg2_type, &instr->arg2);
102 TRACE_(jscript_disas)("\n");
106 static HRESULT compile_expression(compiler_ctx_t*,expression_t*);
107 static HRESULT compile_statement(compiler_ctx_t*,statement_ctx_t*,statement_t*);
109 static inline void *compiler_alloc(bytecode_t *code, size_t size)
111 return jsheap_alloc(&code->heap, size);
114 static WCHAR *compiler_alloc_string(bytecode_t *code, const WCHAR *str)
119 size = (strlenW(str)+1)*sizeof(WCHAR);
120 ret = compiler_alloc(code, size);
122 memcpy(ret, str, size);
126 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
128 if(!ctx->code->bstr_pool_size) {
129 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
130 if(!ctx->code->bstr_pool)
132 ctx->code->bstr_pool_size = 8;
133 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
136 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
140 ctx->code->bstr_pool = new_pool;
141 ctx->code->bstr_pool_size *= 2;
144 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
145 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
148 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
151 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
153 assert(ctx->code_size >= ctx->code_off);
155 if(ctx->code_size == ctx->code_off) {
158 new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
162 ctx->code->instrs = new_instrs;
166 ctx->code->instrs[ctx->code_off].op = op;
167 return ctx->code_off++;
170 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
172 assert(off < ctx->code_off);
173 return ctx->code->instrs + off;
176 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
180 instr = push_instr(ctx, op);
182 return E_OUTOFMEMORY;
184 instr_ptr(ctx, instr)->arg1.lng = arg;
188 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
193 str = compiler_alloc_string(ctx->code, arg);
195 return E_OUTOFMEMORY;
197 instr = push_instr(ctx, op);
199 return E_OUTOFMEMORY;
201 instr_ptr(ctx, instr)->arg1.str = str;
205 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
210 str = compiler_alloc_bstr(ctx, arg);
212 return E_OUTOFMEMORY;
214 instr = push_instr(ctx, op);
216 return E_OUTOFMEMORY;
218 instr_ptr(ctx, instr)->arg1.bstr = str;
222 static HRESULT push_instr_bstr_uint(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg1, unsigned arg2)
227 str = compiler_alloc_bstr(ctx, arg1);
229 return E_OUTOFMEMORY;
231 instr = push_instr(ctx, op);
233 return E_OUTOFMEMORY;
235 instr_ptr(ctx, instr)->arg1.bstr = str;
236 instr_ptr(ctx, instr)->arg2.uint = arg2;
240 static HRESULT push_instr_uint_str(compiler_ctx_t *ctx, jsop_t op, unsigned arg1, const WCHAR *arg2)
245 str = compiler_alloc_string(ctx->code, arg2);
247 return E_OUTOFMEMORY;
249 instr = push_instr(ctx, op);
251 return E_OUTOFMEMORY;
253 instr_ptr(ctx, instr)->arg1.uint = arg1;
254 instr_ptr(ctx, instr)->arg2.str = str;
258 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
263 dbl = compiler_alloc(ctx->code, sizeof(arg));
265 return E_OUTOFMEMORY;
268 instr = push_instr(ctx, op);
270 return E_OUTOFMEMORY;
272 instr_ptr(ctx, instr)->arg1.dbl = dbl;
276 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
280 instr = push_instr(ctx, op);
282 return E_OUTOFMEMORY;
284 instr_ptr(ctx, instr)->arg1.uint = arg;
288 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
292 hres = compile_expression(ctx, expr->expression1);
296 hres = compile_expression(ctx, expr->expression2);
300 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
303 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
307 hres = compile_expression(ctx, expr->expression);
311 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
314 /* ECMA-262 3rd Edition 11.2.1 */
315 static HRESULT compile_member_expression(compiler_ctx_t *ctx, member_expression_t *expr)
319 hres = compile_expression(ctx, expr->expression);
323 return push_instr_bstr(ctx, OP_member, expr->identifier);
326 #define LABEL_FLAG 0x80000000
328 static unsigned alloc_label(compiler_ctx_t *ctx)
330 if(!ctx->labels_size) {
331 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
334 ctx->labels_size = 8;
335 }else if(ctx->labels_size == ctx->labels_cnt) {
336 unsigned *new_labels;
338 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
342 ctx->labels = new_labels;
343 ctx->labels_size *= 2;
346 return ctx->labels_cnt++ | LABEL_FLAG;
349 static void label_set_addr(compiler_ctx_t *ctx, unsigned label)
351 assert(label & LABEL_FLAG);
352 ctx->labels[label & ~LABEL_FLAG] = ctx->code_off;
355 static inline BOOL is_memberid_expr(expression_type_t type)
357 return type == EXPR_IDENT || type == EXPR_MEMBER || type == EXPR_ARRAY;
360 static HRESULT compile_memberid_expression(compiler_ctx_t *ctx, expression_t *expr, unsigned flags)
366 identifier_expression_t *ident_expr = (identifier_expression_t*)expr;
368 hres = push_instr_bstr_uint(ctx, OP_identid, ident_expr->identifier, flags);
372 binary_expression_t *array_expr = (binary_expression_t*)expr;
374 hres = compile_expression(ctx, array_expr->expression1);
378 hres = compile_expression(ctx, array_expr->expression2);
382 hres = push_instr_uint(ctx, OP_memberid, flags);
386 member_expression_t *member_expr = (member_expression_t*)expr;
388 hres = compile_expression(ctx, member_expr->expression);
392 /* FIXME: Potential optimization */
393 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
397 hres = push_instr_uint(ctx, OP_memberid, flags);
407 static HRESULT compile_increment_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op, int n)
411 if(!is_memberid_expr(expr->expression->type)) {
412 hres = compile_expression(ctx, expr->expression);
416 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
419 hres = compile_memberid_expression(ctx, expr->expression, fdexNameEnsure);
423 return push_instr_int(ctx, op, n);
426 /* ECMA-262 3rd Edition 11.14 */
427 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr)
431 hres = compile_expression(ctx, expr->expression1);
435 if(!push_instr(ctx, OP_pop))
436 return E_OUTOFMEMORY;
438 return compile_expression(ctx, expr->expression2);
441 /* ECMA-262 3rd Edition 11.11 */
442 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
447 hres = compile_expression(ctx, expr->expression1);
451 instr = push_instr(ctx, op);
453 return E_OUTOFMEMORY;
455 hres = compile_expression(ctx, expr->expression2);
459 instr_ptr(ctx, instr)->arg1.uint = ctx->code_off;
463 /* ECMA-262 3rd Edition 11.12 */
464 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
466 unsigned jmp_false, jmp_end;
469 hres = compile_expression(ctx, expr->expression);
473 jmp_false = push_instr(ctx, OP_cnd_z);
475 return E_OUTOFMEMORY;
477 hres = compile_expression(ctx, expr->true_expression);
481 jmp_end = push_instr(ctx, OP_jmp);
483 return E_OUTOFMEMORY;
485 instr_ptr(ctx, jmp_false)->arg1.uint = ctx->code_off;
486 if(!push_instr(ctx, OP_pop))
487 return E_OUTOFMEMORY;
489 hres = compile_expression(ctx, expr->false_expression);
493 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->code_off;
497 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
499 unsigned arg_cnt = 0;
503 hres = compile_expression(ctx, expr->expression);
507 for(arg = expr->argument_list; arg; arg = arg->next) {
508 hres = compile_expression(ctx, arg->expr);
514 return push_instr_int(ctx, OP_new, arg_cnt);
517 static HRESULT compile_call_expression(compiler_ctx_t *ctx, call_expression_t *expr, BOOL *no_ret)
519 unsigned arg_cnt = 0;
525 if(is_memberid_expr(expr->expression->type)) {
527 hres = compile_memberid_expression(ctx, expr->expression, 0);
530 hres = compile_expression(ctx, expr->expression);
536 for(arg = expr->argument_list; arg; arg = arg->next) {
537 hres = compile_expression(ctx, arg->expr);
543 instr = push_instr(ctx, op);
545 return E_OUTOFMEMORY;
547 instr_ptr(ctx, instr)->arg1.uint = arg_cnt;
548 instr_ptr(ctx, instr)->arg2.lng = no_ret == NULL;
554 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
558 switch(expr->expression->type) {
560 binary_expression_t *array_expr = (binary_expression_t*)expr->expression;
562 hres = compile_expression(ctx, array_expr->expression1);
566 hres = compile_expression(ctx, array_expr->expression2);
570 if(!push_instr(ctx, OP_delete))
571 return E_OUTOFMEMORY;
575 member_expression_t *member_expr = (member_expression_t*)expr->expression;
577 hres = compile_expression(ctx, member_expr->expression);
581 /* FIXME: Potential optimization */
582 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
586 if(!push_instr(ctx, OP_delete))
587 return E_OUTOFMEMORY;
591 return push_instr_bstr(ctx, OP_delete_ident, ((identifier_expression_t*)expr->expression)->identifier);
593 const WCHAR fixmeW[] = {'F','I','X','M','E',0};
595 WARN("invalid delete, unimplemented exception message\n");
597 hres = compile_expression(ctx, expr->expression);
601 return push_instr_uint_str(ctx, OP_throw_type, JS_E_INVALID_DELETE, fixmeW);
608 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
610 BOOL use_throw_path = FALSE;
611 unsigned arg_cnt = 0;
614 if(expr->expression1->type == EXPR_CALL) {
615 call_expression_t *call_expr = (call_expression_t*)expr->expression1;
619 FIXME("op %d not supported on parametrized assign expressions\n", op);
623 if(is_memberid_expr(call_expr->expression->type) && call_expr->argument_list) {
624 hres = compile_memberid_expression(ctx, call_expr->expression, fdexNameEnsure);
628 for(arg = call_expr->argument_list; arg; arg = arg->next) {
629 hres = compile_expression(ctx, arg->expr);
635 use_throw_path = TRUE;
637 }else if(is_memberid_expr(expr->expression1->type)) {
638 hres = compile_memberid_expression(ctx, expr->expression1, fdexNameEnsure);
642 use_throw_path = TRUE;
646 /* Illegal assignment: evaluate and throw */
647 hres = compile_expression(ctx, expr->expression1);
651 hres = compile_expression(ctx, expr->expression2);
655 if(op != OP_LAST && !push_instr(ctx, op))
656 return E_OUTOFMEMORY;
658 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
661 if(op != OP_LAST && !push_instr(ctx, OP_refval))
662 return E_OUTOFMEMORY;
664 hres = compile_expression(ctx, expr->expression2);
668 if(op != OP_LAST && !push_instr(ctx, op))
669 return E_OUTOFMEMORY;
672 return push_instr_uint(ctx, OP_assign_call, arg_cnt);
674 if(!push_instr(ctx, OP_assign))
675 return E_OUTOFMEMORY;
680 static HRESULT compile_typeof_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
685 if(is_memberid_expr(expr->expression->type)) {
686 if(expr->expression->type == EXPR_IDENT)
687 return push_instr_str(ctx, OP_typeofident, ((identifier_expression_t*)expr->expression)->identifier);
690 hres = compile_memberid_expression(ctx, expr->expression, 0);
693 hres = compile_expression(ctx, expr->expression);
698 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
701 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
703 switch(literal->type) {
705 return push_instr_int(ctx, OP_bool, literal->u.bval);
707 return push_instr_double(ctx, OP_double, literal->u.dval);
709 return push_instr_int(ctx, OP_int, literal->u.lval);
711 return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
713 return push_instr_str(ctx, OP_str, literal->u.wstr);
718 str = compiler_alloc(ctx->code, (literal->u.regexp.str_len+1)*sizeof(WCHAR));
720 return E_OUTOFMEMORY;
721 memcpy(str, literal->u.regexp.str, literal->u.regexp.str_len*sizeof(WCHAR));
722 str[literal->u.regexp.str_len] = 0;
724 instr = push_instr(ctx, OP_regexp);
726 return E_OUTOFMEMORY;
728 instr_ptr(ctx, instr)->arg1.str = str;
729 instr_ptr(ctx, instr)->arg2.lng = literal->u.regexp.flags;
738 static HRESULT literal_as_bstr(compiler_ctx_t *ctx, literal_t *literal, BSTR *str)
740 switch(literal->type) {
742 *str = compiler_alloc_bstr(ctx, literal->u.wstr);
745 *str = int_to_bstr(literal->u.lval);
748 return double_to_bstr(literal->u.dval, str);
753 return *str ? S_OK : E_OUTOFMEMORY;
756 static HRESULT compile_array_literal(compiler_ctx_t *ctx, array_literal_expression_t *expr)
758 unsigned i, elem_cnt = expr->length;
759 array_element_t *iter;
762 for(iter = expr->element_list; iter; iter = iter->next) {
763 elem_cnt += iter->elision+1;
765 for(i=0; i < iter->elision; i++) {
766 if(!push_instr(ctx, OP_undefined))
767 return E_OUTOFMEMORY;
770 hres = compile_expression(ctx, iter->expr);
775 for(i=0; i < expr->length; i++) {
776 if(!push_instr(ctx, OP_undefined))
777 return E_OUTOFMEMORY;
780 return push_instr_uint(ctx, OP_carray, elem_cnt);
783 static HRESULT compile_object_literal(compiler_ctx_t *ctx, property_value_expression_t *expr)
790 if(!push_instr(ctx, OP_new_obj))
791 return E_OUTOFMEMORY;
793 for(iter = expr->property_list; iter; iter = iter->next) {
794 hres = literal_as_bstr(ctx, iter->name, &name);
798 hres = compile_expression(ctx, iter->value);
802 instr = push_instr(ctx, OP_obj_prop);
804 return E_OUTOFMEMORY;
806 instr_ptr(ctx, instr)->arg1.bstr = name;
812 static HRESULT compile_function_expression(compiler_ctx_t *ctx, function_expression_t *expr)
816 /* FIXME: not exactly right */
818 return push_instr_bstr(ctx, OP_ident, expr->identifier);
820 instr = push_instr(ctx, OP_func);
822 return E_OUTOFMEMORY;
824 instr_ptr(ctx, instr)->arg1.func = expr;
828 static HRESULT compile_expression_noret(compiler_ctx_t *ctx, expression_t *expr, BOOL *no_ret)
832 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
834 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_z);
836 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_array);
838 return compile_array_literal(ctx, (array_literal_expression_t*)expr);
840 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
842 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
844 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_and);
846 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
848 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
850 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_div);
852 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mod);
854 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_or);
855 case EXPR_ASSIGNLSHIFT:
856 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_lshift);
857 case EXPR_ASSIGNRSHIFT:
858 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift);
859 case EXPR_ASSIGNRRSHIFT:
860 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
862 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_xor);
864 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
866 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
868 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
870 return compile_call_expression(ctx, (call_expression_t*)expr, no_ret);
872 return compile_comma_expression(ctx, (binary_expression_t*)expr);
874 return compile_conditional_expression(ctx, (conditional_expression_t*)expr);
876 return compile_delete_expression(ctx, (unary_expression_t*)expr);
878 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
880 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
882 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
884 return compile_function_expression(ctx, (function_expression_t*)expr);
886 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
888 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
890 return push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
892 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
893 case EXPR_INSTANCEOF:
894 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_instanceof);
896 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
898 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
900 return compile_literal(ctx, ((literal_expression_t*)expr)->literal);
902 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
904 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lshift);
906 return compile_member_expression(ctx, (member_expression_t*)expr);
908 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
910 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
912 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
914 return compile_new_expression(ctx, (call_expression_t*)expr);
916 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
918 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
920 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_nz);
922 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
924 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, -1);
926 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, 1);
928 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, -1);
930 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, 1);
932 return compile_object_literal(ctx, (property_value_expression_t*)expr);
934 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift);
936 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
938 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
940 return push_instr(ctx, OP_this) ? S_OK : E_OUTOFMEMORY;
942 return compile_typeof_expression(ctx, (unary_expression_t*)expr);
944 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
946 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
954 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr)
956 return compile_expression_noret(ctx, expr, NULL);
959 static inline BOOL is_loop_statement(statement_type_t type)
961 return type == STAT_FOR || type == STAT_FORIN || type == STAT_WHILE;
964 /* ECMA-262 3rd Edition 12.1 */
965 static HRESULT compile_block_statement(compiler_ctx_t *ctx, statement_t *iter)
969 /* FIXME: do it only if needed */
971 return push_instr(ctx, OP_undefined) ? S_OK : E_OUTOFMEMORY;
974 hres = compile_statement(ctx, NULL, iter);
982 if(!push_instr(ctx, OP_pop))
983 return E_OUTOFMEMORY;
989 /* ECMA-262 3rd Edition 12.2 */
990 static HRESULT compile_variable_list(compiler_ctx_t *ctx, variable_declaration_t *list)
992 variable_declaration_t *iter;
995 for(iter = list; iter; iter = iter->next) {
999 hres = compile_expression(ctx, iter->expr);
1003 hres = push_instr_bstr(ctx, OP_var_set, iter->identifier);
1011 /* ECMA-262 3rd Edition 12.2 */
1012 static HRESULT compile_var_statement(compiler_ctx_t *ctx, var_statement_t *stat)
1016 hres = compile_variable_list(ctx, stat->variable_list);
1020 return push_instr(ctx, OP_undefined) ? S_OK : E_OUTOFMEMORY;
1023 /* ECMA-262 3rd Edition 12.4 */
1024 static HRESULT compile_expression_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1026 BOOL no_ret = FALSE;
1029 hres = compile_expression_noret(ctx, stat->expr, &no_ret);
1033 /* FIXME: that's a big potential optimization */
1034 if(no_ret && !push_instr(ctx, OP_undefined))
1035 return E_OUTOFMEMORY;
1040 /* ECMA-262 3rd Edition 12.5 */
1041 static HRESULT compile_if_statement(compiler_ctx_t *ctx, if_statement_t *stat)
1043 unsigned jmp_else, jmp_end;
1046 hres = compile_expression(ctx, stat->expr);
1050 jmp_else = push_instr(ctx, OP_jmp_z);
1052 return E_OUTOFMEMORY;
1054 hres = compile_statement(ctx, NULL, stat->if_stat);
1058 jmp_end = push_instr(ctx, OP_jmp);
1060 return E_OUTOFMEMORY;
1062 instr_ptr(ctx, jmp_else)->arg1.uint = ctx->code_off;
1064 if(stat->else_stat) {
1065 hres = compile_statement(ctx, NULL, stat->else_stat);
1069 /* FIXME: We could sometimes avoid it */
1070 if(!push_instr(ctx, OP_undefined))
1071 return E_OUTOFMEMORY;
1074 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->code_off;
1078 /* ECMA-262 3rd Edition 12.6.2 */
1079 static HRESULT compile_while_statement(compiler_ctx_t *ctx, while_statement_t *stat)
1081 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1085 stat_ctx.break_label = alloc_label(ctx);
1086 if(!stat_ctx.break_label)
1087 return E_OUTOFMEMORY;
1089 stat_ctx.continue_label = alloc_label(ctx);
1090 if(!stat_ctx.continue_label)
1091 return E_OUTOFMEMORY;
1093 if(!stat->do_while) {
1095 if(!push_instr(ctx, OP_undefined))
1096 return E_OUTOFMEMORY;
1098 jmp_off = ctx->code_off;
1099 label_set_addr(ctx, stat_ctx.continue_label);
1100 hres = compile_expression(ctx, stat->expr);
1104 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1108 if(!push_instr(ctx, OP_pop))
1109 return E_OUTOFMEMORY;
1111 jmp_off = ctx->code_off;
1114 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1118 if(stat->do_while) {
1119 label_set_addr(ctx, stat_ctx.continue_label);
1120 hres = compile_expression(ctx, stat->expr);
1124 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1128 if(!push_instr(ctx, OP_pop))
1129 return E_OUTOFMEMORY;
1132 hres = push_instr_uint(ctx, OP_jmp, jmp_off);
1136 label_set_addr(ctx, stat_ctx.break_label);
1140 /* ECMA-262 3rd Edition 12.6.3 */
1141 static HRESULT compile_for_statement(compiler_ctx_t *ctx, for_statement_t *stat)
1143 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1147 if(stat->variable_list) {
1148 hres = compile_variable_list(ctx, stat->variable_list);
1151 }else if(stat->begin_expr) {
1152 BOOL no_ret = FALSE;
1154 hres = compile_expression_noret(ctx, stat->begin_expr, &no_ret);
1157 if(!no_ret && !push_instr(ctx, OP_pop))
1158 return E_OUTOFMEMORY;
1161 stat_ctx.break_label = alloc_label(ctx);
1162 if(!stat_ctx.break_label)
1163 return E_OUTOFMEMORY;
1165 stat_ctx.continue_label = alloc_label(ctx);
1166 if(!stat_ctx.continue_label)
1167 return E_OUTOFMEMORY;
1170 if(!push_instr(ctx, OP_undefined))
1171 return E_OUTOFMEMORY;
1173 expr_off = ctx->code_off;
1176 hres = compile_expression(ctx, stat->expr);
1180 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1185 if(!push_instr(ctx, OP_pop))
1186 return E_OUTOFMEMORY;
1188 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1192 label_set_addr(ctx, stat_ctx.continue_label);
1194 if(stat->end_expr) {
1195 BOOL no_ret = FALSE;
1197 hres = compile_expression_noret(ctx, stat->end_expr, &no_ret);
1201 if(!no_ret && !push_instr(ctx, OP_pop))
1202 return E_OUTOFMEMORY;
1205 hres = push_instr_uint(ctx, OP_jmp, expr_off);
1209 label_set_addr(ctx, stat_ctx.break_label);
1213 /* ECMA-262 3rd Edition 12.6.4 */
1214 static HRESULT compile_forin_statement(compiler_ctx_t *ctx, forin_statement_t *stat)
1216 statement_ctx_t stat_ctx = {4, FALSE, FALSE};
1219 if(stat->variable) {
1220 hres = compile_variable_list(ctx, stat->variable);
1225 stat_ctx.break_label = alloc_label(ctx);
1226 if(!stat_ctx.break_label)
1227 return E_OUTOFMEMORY;
1229 stat_ctx.continue_label = alloc_label(ctx);
1230 if(!stat_ctx.continue_label)
1231 return E_OUTOFMEMORY;
1233 hres = compile_expression(ctx, stat->in_expr);
1237 if(stat->variable) {
1238 hres = push_instr_bstr_uint(ctx, OP_identid, stat->variable->identifier, fdexNameEnsure);
1241 }else if(is_memberid_expr(stat->expr->type)) {
1242 hres = compile_memberid_expression(ctx, stat->expr, fdexNameEnsure);
1246 hres = push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
1250 /* FIXME: compile statement anyways when we depend on compiler to check errors */
1254 hres = push_instr_int(ctx, OP_int, DISPID_STARTENUM);
1259 if(!push_instr(ctx, OP_undefined))
1260 return E_OUTOFMEMORY;
1262 label_set_addr(ctx, stat_ctx.continue_label);
1263 hres = push_instr_uint(ctx, OP_forin, stat_ctx.break_label);
1265 return E_OUTOFMEMORY;
1267 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1271 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.continue_label);
1275 label_set_addr(ctx, stat_ctx.break_label);
1279 static HRESULT pop_to_stat(compiler_ctx_t *ctx, statement_ctx_t *stat_ctx)
1281 unsigned stack_pop = 0;
1282 statement_ctx_t *iter;
1284 for(iter = ctx->stat_ctx; iter != stat_ctx; iter = iter->next) {
1285 if(iter->using_scope && !push_instr(ctx, OP_pop_scope))
1286 return E_OUTOFMEMORY;
1287 if(iter->using_except && !push_instr(ctx, OP_pop_except))
1288 return E_OUTOFMEMORY;
1289 stack_pop += iter->stack_use;
1292 /* FIXME: optimize */
1293 while(stack_pop--) {
1294 if(!push_instr(ctx, OP_pop))
1295 return E_OUTOFMEMORY;
1301 /* ECMA-262 3rd Edition 12.7 */
1302 static HRESULT compile_continue_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1304 statement_ctx_t *pop_ctx;
1307 if(stat->identifier) {
1308 statement_t *label_stat;
1309 statement_ctx_t *iter;
1313 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1314 if(iter->continue_label)
1316 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier))
1321 WARN("Label not found\n");
1322 return JS_E_LABEL_NOT_FOUND;
1325 /* Labelled continue are allowed only on loops */
1326 for(label_stat = iter->labelled_stat->statement;
1327 label_stat->type == STAT_LABEL;
1328 label_stat = ((labelled_statement_t*)label_stat)->statement);
1329 if(!is_loop_statement(label_stat->type)) {
1330 WARN("Label is not a loop\n");
1331 return JS_E_INVALID_CONTINUE;
1334 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1335 if(pop_ctx->continue_label)
1340 WARN("continue outside loop\n");
1341 return JS_E_INVALID_CONTINUE;
1345 hres = pop_to_stat(ctx, pop_ctx);
1349 if(!push_instr(ctx, OP_undefined))
1350 return E_OUTOFMEMORY;
1352 return push_instr_uint(ctx, OP_jmp, pop_ctx->continue_label);
1355 /* ECMA-262 3rd Edition 12.8 */
1356 static HRESULT compile_break_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1358 statement_ctx_t *pop_ctx;
1361 if(stat->identifier) {
1362 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1363 if(pop_ctx->labelled_stat && !strcmpW(pop_ctx->labelled_stat->identifier, stat->identifier)) {
1364 assert(pop_ctx->break_label);
1370 WARN("Label not found\n");
1371 return JS_E_LABEL_NOT_FOUND;
1374 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1375 if(pop_ctx->break_label && !pop_ctx->labelled_stat)
1380 WARN("Break outside loop\n");
1381 return JS_E_INVALID_BREAK;
1385 hres = pop_to_stat(ctx, pop_ctx->next);
1389 if(!push_instr(ctx, OP_undefined))
1390 return E_OUTOFMEMORY;
1392 return push_instr_uint(ctx, OP_jmp, pop_ctx->break_label);
1395 /* ECMA-262 3rd Edition 12.9 */
1396 static HRESULT compile_return_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1400 hres = pop_to_stat(ctx, NULL);
1405 hres = compile_expression(ctx, stat->expr);
1410 return push_instr(ctx, OP_ret) ? S_OK : E_OUTOFMEMORY;
1413 /* ECMA-262 3rd Edition 12.10 */
1414 static HRESULT compile_with_statement(compiler_ctx_t *ctx, with_statement_t *stat)
1416 statement_ctx_t stat_ctx = {0, TRUE, FALSE};
1419 hres = compile_expression(ctx, stat->expr);
1423 if(!push_instr(ctx, OP_push_scope))
1424 return E_OUTOFMEMORY;
1426 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1430 if(!push_instr(ctx, OP_pop_scope))
1431 return E_OUTOFMEMORY;
1436 /* ECMA-262 3rd Edition 12.10 */
1437 static HRESULT compile_labelled_statement(compiler_ctx_t *ctx, labelled_statement_t *stat)
1439 statement_ctx_t stat_ctx = {0, FALSE, FALSE, 0, 0, stat}, *iter;
1442 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1443 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier)) {
1444 WARN("Label %s redefined\n", debugstr_w(stat->identifier));
1445 return JS_E_LABEL_REDEFINED;
1449 /* Labelled breaks are allowed for any labelled statements, not only loops (violating spec) */
1450 stat_ctx.break_label = alloc_label(ctx);
1451 if(!stat_ctx.break_label)
1452 return E_OUTOFMEMORY;
1454 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1458 label_set_addr(ctx, stat_ctx.break_label);
1462 /* ECMA-262 3rd Edition 12.13 */
1463 static HRESULT compile_switch_statement(compiler_ctx_t *ctx, switch_statement_t *stat)
1465 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1466 unsigned case_cnt = 0, *case_jmps, i, default_jmp;
1467 BOOL have_default = FALSE;
1468 statement_t *stat_iter;
1469 case_clausule_t *iter;
1472 hres = compile_expression(ctx, stat->expr);
1476 stat_ctx.break_label = alloc_label(ctx);
1477 if(!stat_ctx.break_label)
1478 return E_OUTOFMEMORY;
1480 for(iter = stat->case_list; iter; iter = iter->next) {
1485 case_jmps = heap_alloc(case_cnt * sizeof(*case_jmps));
1487 return E_OUTOFMEMORY;
1490 for(iter = stat->case_list; iter; iter = iter->next) {
1492 have_default = TRUE;
1496 hres = compile_expression(ctx, iter->expr);
1500 case_jmps[i] = push_instr(ctx, OP_case);
1502 hres = E_OUTOFMEMORY;
1508 if(SUCCEEDED(hres)) {
1509 if(push_instr(ctx, OP_pop)) {
1510 default_jmp = push_instr(ctx, OP_jmp);
1512 hres = E_OUTOFMEMORY;
1514 hres = E_OUTOFMEMORY;
1519 heap_free(case_jmps);
1524 for(iter = stat->case_list; iter; iter = iter->next) {
1525 while(iter->next && iter->next->stat == iter->stat) {
1526 instr_ptr(ctx, iter->expr ? case_jmps[i++] : default_jmp)->arg1.uint = ctx->code_off;
1530 instr_ptr(ctx, iter->expr ? case_jmps[i++] : default_jmp)->arg1.uint = ctx->code_off;
1532 for(stat_iter = iter->stat; stat_iter && (!iter->next || iter->next->stat != stat_iter); stat_iter = stat_iter->next) {
1533 hres = compile_statement(ctx, &stat_ctx, stat_iter);
1537 if(stat_iter->next && !push_instr(ctx, OP_pop)) {
1538 hres = E_OUTOFMEMORY;
1546 heap_free(case_jmps);
1549 assert(i == case_cnt);
1552 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.break_label);
1555 instr_ptr(ctx, default_jmp)->arg1.uint = ctx->code_off;
1556 if(!push_instr(ctx, OP_undefined))
1557 return E_OUTOFMEMORY;
1560 label_set_addr(ctx, stat_ctx.break_label);
1564 /* ECMA-262 3rd Edition 12.13 */
1565 static HRESULT compile_throw_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1569 hres = compile_expression(ctx, stat->expr);
1573 return push_instr(ctx, OP_throw) ? S_OK : E_OUTOFMEMORY;
1576 /* ECMA-262 3rd Edition 12.14 */
1577 static HRESULT compile_try_statement(compiler_ctx_t *ctx, try_statement_t *stat)
1579 statement_ctx_t try_ctx = {0, FALSE, TRUE}, catch_ctx = {0, TRUE, FALSE};
1580 statement_ctx_t finally_ctx = {2, FALSE, FALSE};
1581 unsigned push_except;
1585 push_except = push_instr(ctx, OP_push_except);
1587 return E_OUTOFMEMORY;
1589 if(stat->catch_block) {
1590 ident = compiler_alloc_bstr(ctx, stat->catch_block->identifier);
1592 return E_OUTOFMEMORY;
1597 instr_ptr(ctx, push_except)->arg2.bstr = ident;
1599 if(!stat->catch_block)
1600 try_ctx.stack_use = 2;
1602 hres = compile_statement(ctx, &try_ctx, stat->try_statement);
1606 if(!push_instr(ctx, OP_pop_except))
1607 return E_OUTOFMEMORY;
1609 if(stat->catch_block) {
1610 unsigned jmp_finally;
1612 jmp_finally = push_instr(ctx, OP_jmp);
1614 return E_OUTOFMEMORY;
1616 instr_ptr(ctx, push_except)->arg1.uint = ctx->code_off;
1618 hres = compile_statement(ctx, &catch_ctx, stat->catch_block->statement);
1622 if(!push_instr(ctx, OP_pop_scope))
1623 return E_OUTOFMEMORY;
1625 instr_ptr(ctx, jmp_finally)->arg1.uint = ctx->code_off;
1627 instr_ptr(ctx, push_except)->arg1.uint = ctx->code_off;
1630 if(stat->finally_statement) {
1632 if(!push_instr(ctx, OP_pop))
1633 return E_OUTOFMEMORY;
1635 hres = compile_statement(ctx, stat->catch_block ? NULL : &finally_ctx, stat->finally_statement);
1639 if(!stat->catch_block && !push_instr(ctx, OP_end_finally))
1640 return E_OUTOFMEMORY;
1646 static HRESULT compile_statement(compiler_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1651 stat_ctx->next = ctx->stat_ctx;
1652 ctx->stat_ctx = stat_ctx;
1655 switch(stat->type) {
1657 hres = compile_block_statement(ctx, ((block_statement_t*)stat)->stat_list);
1660 hres = compile_break_statement(ctx, (branch_statement_t*)stat);
1663 hres = compile_continue_statement(ctx, (branch_statement_t*)stat);
1666 hres = push_instr(ctx, OP_undefined) ? S_OK : E_OUTOFMEMORY; /* FIXME */
1669 hres = compile_expression_statement(ctx, (expression_statement_t*)stat);
1672 hres = compile_for_statement(ctx, (for_statement_t*)stat);
1675 hres = compile_forin_statement(ctx, (forin_statement_t*)stat);
1678 hres = compile_if_statement(ctx, (if_statement_t*)stat);
1681 hres = compile_labelled_statement(ctx, (labelled_statement_t*)stat);
1684 hres = compile_return_statement(ctx, (expression_statement_t*)stat);
1687 hres = compile_switch_statement(ctx, (switch_statement_t*)stat);
1690 hres = compile_throw_statement(ctx, (expression_statement_t*)stat);
1693 hres = compile_try_statement(ctx, (try_statement_t*)stat);
1696 hres = compile_var_statement(ctx, (var_statement_t*)stat);
1699 hres = compile_while_statement(ctx, (while_statement_t*)stat);
1702 hres = compile_with_statement(ctx, (with_statement_t*)stat);
1710 assert(ctx->stat_ctx == stat_ctx);
1711 ctx->stat_ctx = stat_ctx->next;
1717 static void resolve_labels(compiler_ctx_t *ctx, unsigned off)
1721 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
1722 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->arg1.uint & LABEL_FLAG)) {
1723 assert((instr->arg1.uint & ~LABEL_FLAG) < ctx->labels_cnt);
1724 instr->arg1.uint = ctx->labels[instr->arg1.uint & ~LABEL_FLAG];
1726 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
1729 ctx->labels_cnt = 0;
1732 void release_bytecode(bytecode_t *code)
1740 parser_release(code->parser);
1742 for(i=0; i < code->bstr_cnt; i++)
1743 SysFreeString(code->bstr_pool[i]);
1745 heap_free(code->source);
1746 jsheap_free(&code->heap);
1747 heap_free(code->bstr_pool);
1748 heap_free(code->instrs);
1752 static HRESULT init_code(compiler_ctx_t *compiler, const WCHAR *source)
1754 compiler->code = heap_alloc_zero(sizeof(bytecode_t));
1756 return E_OUTOFMEMORY;
1758 compiler->code->ref = 1;
1759 jsheap_init(&compiler->code->heap);
1761 compiler->code->source = heap_strdupW(source);
1762 if(!compiler->code->source) {
1763 release_bytecode(compiler->code);
1764 return E_OUTOFMEMORY;
1767 compiler->code->instrs = heap_alloc(64 * sizeof(instr_t));
1768 if(!compiler->code->instrs) {
1769 release_bytecode(compiler->code);
1770 return E_OUTOFMEMORY;
1773 compiler->code_size = 64;
1774 compiler->code_off = 1;
1778 static HRESULT compile_function(compiler_ctx_t *ctx, source_elements_t *source, BOOL from_eval)
1780 function_declaration_t *iter;
1786 off = ctx->code_off;
1787 hres = compile_block_statement(ctx, source->statement);
1791 resolve_labels(ctx, off);
1793 if(!from_eval && !push_instr(ctx, OP_pop))
1794 return E_OUTOFMEMORY;
1795 if(!push_instr(ctx, OP_ret))
1796 return E_OUTOFMEMORY;
1798 if(TRACE_ON(jscript_disas))
1799 dump_code(ctx, off);
1801 source->instr_off = off;
1803 for(iter = source->functions; iter; iter = iter->next) {
1804 hres = compile_function(ctx, iter->expr->source_elements, FALSE);
1812 HRESULT compile_script(script_ctx_t *ctx, const WCHAR *code, const WCHAR *delimiter, BOOL from_eval, BOOL use_decode,
1815 compiler_ctx_t compiler = {0};
1818 hres = init_code(&compiler, code);
1823 hres = decode_source(compiler.code->source);
1825 WARN("Decoding failed\n");
1830 hres = script_parse(ctx, compiler.code->source, delimiter, from_eval, &compiler.parser);
1832 release_bytecode(compiler.code);
1836 compiler.code->parser = compiler.parser;
1838 hres = compile_function(&compiler, compiler.parser->source, from_eval);
1840 release_bytecode(compiler.code);
1844 *ret = compiler.code;