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;
56 statement_ctx_t *stat_ctx;
57 function_code_t *func;
59 variable_declaration_t *var_head;
60 variable_declaration_t *var_tail;
62 function_expression_t *func_head;
63 function_expression_t *func_tail;
68 instr_arg_type_t arg1_type;
69 instr_arg_type_t arg2_type;
71 #define X(n,a,b,c) {#n,b,c},
76 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
80 TRACE_(jscript_disas)("\t%s", debugstr_jsstr(arg->str));
83 TRACE_(jscript_disas)("\t%s", debugstr_wn(arg->bstr, SysStringLen(arg->bstr)));
86 TRACE_(jscript_disas)("\t%d", arg->uint);
90 TRACE_(jscript_disas)("\t%u", arg->uint);
100 static void dump_code(compiler_ctx_t *ctx, unsigned off)
104 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
105 TRACE_(jscript_disas)("%d:\t%s", (int)(instr-ctx->code->instrs), instr_info[instr->op].op_str);
106 if(instr_info[instr->op].arg1_type == ARG_DBL) {
107 TRACE_(jscript_disas)("\t%lf", instr->u.dbl);
109 dump_instr_arg(instr_info[instr->op].arg1_type, instr->u.arg);
110 dump_instr_arg(instr_info[instr->op].arg2_type, instr->u.arg+1);
112 TRACE_(jscript_disas)("\n");
116 static HRESULT compile_expression(compiler_ctx_t*,expression_t*,BOOL);
117 static HRESULT compile_statement(compiler_ctx_t*,statement_ctx_t*,statement_t*);
119 static inline void *compiler_alloc(bytecode_t *code, size_t size)
121 return jsheap_alloc(&code->heap, size);
124 static jsstr_t *compiler_alloc_string_len(compiler_ctx_t *ctx, const WCHAR *str, unsigned len)
128 if(!ctx->code->str_pool_size) {
129 ctx->code->str_pool = heap_alloc(8 * sizeof(jsstr_t*));
130 if(!ctx->code->str_pool)
132 ctx->code->str_pool_size = 8;
133 }else if(ctx->code->str_pool_size == ctx->code->str_cnt) {
136 new_pool = heap_realloc(ctx->code->str_pool, ctx->code->str_pool_size*2*sizeof(jsstr_t*));
140 ctx->code->str_pool = new_pool;
141 ctx->code->str_pool_size *= 2;
144 new_str = jsstr_alloc_len(str, len);
148 ctx->code->str_pool[ctx->code->str_cnt++] = new_str;
152 static jsstr_t *compiler_alloc_string(compiler_ctx_t *ctx, const WCHAR *str)
154 return compiler_alloc_string_len(ctx, str, strlenW(str));
157 static BOOL ensure_bstr_slot(compiler_ctx_t *ctx)
159 if(!ctx->code->bstr_pool_size) {
160 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
161 if(!ctx->code->bstr_pool)
163 ctx->code->bstr_pool_size = 8;
164 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
167 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
171 ctx->code->bstr_pool = new_pool;
172 ctx->code->bstr_pool_size *= 2;
178 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
180 if(!ensure_bstr_slot(ctx))
183 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
184 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
187 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
190 static BSTR compiler_alloc_bstr_len(compiler_ctx_t *ctx, const WCHAR *str, size_t len)
192 if(!ensure_bstr_slot(ctx))
195 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocStringLen(str, len);
196 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
199 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
202 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
204 assert(ctx->code_size >= ctx->code_off);
206 if(ctx->code_size == ctx->code_off) {
209 new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
213 ctx->code->instrs = new_instrs;
217 ctx->code->instrs[ctx->code_off].op = op;
218 return ctx->code_off++;
221 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
223 assert(off < ctx->code_off);
224 return ctx->code->instrs + off;
227 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
231 instr = push_instr(ctx, op);
233 return E_OUTOFMEMORY;
235 instr_ptr(ctx, instr)->u.arg->lng = arg;
239 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
244 str = compiler_alloc_string(ctx, arg);
246 return E_OUTOFMEMORY;
248 instr = push_instr(ctx, op);
250 return E_OUTOFMEMORY;
252 instr_ptr(ctx, instr)->u.arg->str = str;
256 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
261 str = compiler_alloc_bstr(ctx, arg);
263 return E_OUTOFMEMORY;
265 instr = push_instr(ctx, op);
267 return E_OUTOFMEMORY;
269 instr_ptr(ctx, instr)->u.arg->bstr = str;
273 static HRESULT push_instr_bstr_uint(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg1, unsigned arg2)
278 str = compiler_alloc_bstr(ctx, arg1);
280 return E_OUTOFMEMORY;
282 instr = push_instr(ctx, op);
284 return E_OUTOFMEMORY;
286 instr_ptr(ctx, instr)->u.arg[0].bstr = str;
287 instr_ptr(ctx, instr)->u.arg[1].uint = arg2;
291 static HRESULT push_instr_uint_str(compiler_ctx_t *ctx, jsop_t op, unsigned arg1, const WCHAR *arg2)
296 str = compiler_alloc_string(ctx, arg2);
298 return E_OUTOFMEMORY;
300 instr = push_instr(ctx, op);
302 return E_OUTOFMEMORY;
304 instr_ptr(ctx, instr)->u.arg[0].uint = arg1;
305 instr_ptr(ctx, instr)->u.arg[1].str = str;
309 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
313 instr = push_instr(ctx, op);
315 return E_OUTOFMEMORY;
317 instr_ptr(ctx, instr)->u.dbl = arg;
321 static inline void set_arg_uint(compiler_ctx_t *ctx, unsigned instr, unsigned arg)
323 instr_ptr(ctx, instr)->u.arg->uint = arg;
326 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
330 instr = push_instr(ctx, op);
332 return E_OUTOFMEMORY;
334 set_arg_uint(ctx, instr, arg);
338 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
342 hres = compile_expression(ctx, expr->expression1, TRUE);
346 hres = compile_expression(ctx, expr->expression2, TRUE);
350 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
353 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
357 hres = compile_expression(ctx, expr->expression, TRUE);
361 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
364 /* ECMA-262 3rd Edition 11.2.1 */
365 static HRESULT compile_member_expression(compiler_ctx_t *ctx, member_expression_t *expr)
369 hres = compile_expression(ctx, expr->expression, TRUE);
373 return push_instr_bstr(ctx, OP_member, expr->identifier);
376 #define LABEL_FLAG 0x80000000
378 static unsigned alloc_label(compiler_ctx_t *ctx)
380 if(!ctx->labels_size) {
381 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
384 ctx->labels_size = 8;
385 }else if(ctx->labels_size == ctx->labels_cnt) {
386 unsigned *new_labels;
388 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
392 ctx->labels = new_labels;
393 ctx->labels_size *= 2;
396 return ctx->labels_cnt++ | LABEL_FLAG;
399 static void label_set_addr(compiler_ctx_t *ctx, unsigned label)
401 assert(label & LABEL_FLAG);
402 ctx->labels[label & ~LABEL_FLAG] = ctx->code_off;
405 static inline BOOL is_memberid_expr(expression_type_t type)
407 return type == EXPR_IDENT || type == EXPR_MEMBER || type == EXPR_ARRAY;
410 static HRESULT compile_memberid_expression(compiler_ctx_t *ctx, expression_t *expr, unsigned flags)
416 identifier_expression_t *ident_expr = (identifier_expression_t*)expr;
418 hres = push_instr_bstr_uint(ctx, OP_identid, ident_expr->identifier, flags);
422 binary_expression_t *array_expr = (binary_expression_t*)expr;
424 hres = compile_expression(ctx, array_expr->expression1, TRUE);
428 hres = compile_expression(ctx, array_expr->expression2, TRUE);
432 hres = push_instr_uint(ctx, OP_memberid, flags);
436 member_expression_t *member_expr = (member_expression_t*)expr;
438 hres = compile_expression(ctx, member_expr->expression, TRUE);
442 /* FIXME: Potential optimization */
443 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
447 hres = push_instr_uint(ctx, OP_memberid, flags);
457 static HRESULT compile_increment_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op, int n)
461 if(!is_memberid_expr(expr->expression->type)) {
462 hres = compile_expression(ctx, expr->expression, TRUE);
466 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
469 hres = compile_memberid_expression(ctx, expr->expression, fdexNameEnsure);
473 return push_instr_int(ctx, op, n);
476 /* ECMA-262 3rd Edition 11.14 */
477 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr)
481 hres = compile_expression(ctx, expr->expression1, TRUE);
485 if(!push_instr(ctx, OP_pop))
486 return E_OUTOFMEMORY;
488 return compile_expression(ctx, expr->expression2, TRUE);
491 /* ECMA-262 3rd Edition 11.11 */
492 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
497 hres = compile_expression(ctx, expr->expression1, TRUE);
501 instr = push_instr(ctx, op);
503 return E_OUTOFMEMORY;
505 hres = compile_expression(ctx, expr->expression2, TRUE);
509 set_arg_uint(ctx, instr, ctx->code_off);
513 /* ECMA-262 3rd Edition 11.12 */
514 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
516 unsigned jmp_false, jmp_end;
519 hres = compile_expression(ctx, expr->expression, TRUE);
523 jmp_false = push_instr(ctx, OP_cnd_z);
525 return E_OUTOFMEMORY;
527 hres = compile_expression(ctx, expr->true_expression, TRUE);
531 jmp_end = push_instr(ctx, OP_jmp);
533 return E_OUTOFMEMORY;
535 set_arg_uint(ctx, jmp_false, ctx->code_off);
536 if(!push_instr(ctx, OP_pop))
537 return E_OUTOFMEMORY;
539 hres = compile_expression(ctx, expr->false_expression, TRUE);
543 set_arg_uint(ctx, jmp_end, ctx->code_off);
547 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
549 unsigned arg_cnt = 0;
553 hres = compile_expression(ctx, expr->expression, TRUE);
557 for(arg = expr->argument_list; arg; arg = arg->next) {
558 hres = compile_expression(ctx, arg->expr, TRUE);
564 return push_instr_uint(ctx, OP_new, arg_cnt);
567 static HRESULT compile_call_expression(compiler_ctx_t *ctx, call_expression_t *expr, BOOL emit_ret)
569 unsigned arg_cnt = 0;
575 if(is_memberid_expr(expr->expression->type)) {
577 hres = compile_memberid_expression(ctx, expr->expression, 0);
580 hres = compile_expression(ctx, expr->expression, TRUE);
586 for(arg = expr->argument_list; arg; arg = arg->next) {
587 hres = compile_expression(ctx, arg->expr, TRUE);
593 instr = push_instr(ctx, op);
595 return E_OUTOFMEMORY;
597 instr_ptr(ctx, instr)->u.arg[0].uint = arg_cnt;
598 instr_ptr(ctx, instr)->u.arg[1].lng = emit_ret;
602 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
606 switch(expr->expression->type) {
608 binary_expression_t *array_expr = (binary_expression_t*)expr->expression;
610 hres = compile_expression(ctx, array_expr->expression1, TRUE);
614 hres = compile_expression(ctx, array_expr->expression2, TRUE);
618 if(!push_instr(ctx, OP_delete))
619 return E_OUTOFMEMORY;
623 member_expression_t *member_expr = (member_expression_t*)expr->expression;
625 hres = compile_expression(ctx, member_expr->expression, TRUE);
629 /* FIXME: Potential optimization */
630 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
634 if(!push_instr(ctx, OP_delete))
635 return E_OUTOFMEMORY;
639 return push_instr_bstr(ctx, OP_delete_ident, ((identifier_expression_t*)expr->expression)->identifier);
641 const WCHAR fixmeW[] = {'F','I','X','M','E',0};
643 WARN("invalid delete, unimplemented exception message\n");
645 hres = compile_expression(ctx, expr->expression, TRUE);
649 return push_instr_uint_str(ctx, OP_throw_type, JS_E_INVALID_DELETE, fixmeW);
656 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
658 BOOL use_throw_path = FALSE;
659 unsigned arg_cnt = 0;
662 if(expr->expression1->type == EXPR_CALL) {
663 call_expression_t *call_expr = (call_expression_t*)expr->expression1;
667 FIXME("op %d not supported on parametrized assign expressions\n", op);
671 if(is_memberid_expr(call_expr->expression->type) && call_expr->argument_list) {
672 hres = compile_memberid_expression(ctx, call_expr->expression, fdexNameEnsure);
676 for(arg = call_expr->argument_list; arg; arg = arg->next) {
677 hres = compile_expression(ctx, arg->expr, TRUE);
683 use_throw_path = TRUE;
685 }else if(is_memberid_expr(expr->expression1->type)) {
686 hres = compile_memberid_expression(ctx, expr->expression1, fdexNameEnsure);
690 use_throw_path = TRUE;
694 /* Illegal assignment: evaluate and throw */
695 hres = compile_expression(ctx, expr->expression1, TRUE);
699 hres = compile_expression(ctx, expr->expression2, TRUE);
703 if(op != OP_LAST && !push_instr(ctx, op))
704 return E_OUTOFMEMORY;
706 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
709 if(op != OP_LAST && !push_instr(ctx, OP_refval))
710 return E_OUTOFMEMORY;
712 hres = compile_expression(ctx, expr->expression2, TRUE);
716 if(op != OP_LAST && !push_instr(ctx, op))
717 return E_OUTOFMEMORY;
720 return push_instr_uint(ctx, OP_assign_call, arg_cnt);
722 if(!push_instr(ctx, OP_assign))
723 return E_OUTOFMEMORY;
728 static HRESULT compile_typeof_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
733 if(is_memberid_expr(expr->expression->type)) {
734 if(expr->expression->type == EXPR_IDENT)
735 return push_instr_bstr(ctx, OP_typeofident, ((identifier_expression_t*)expr->expression)->identifier);
738 hres = compile_memberid_expression(ctx, expr->expression, 0);
741 hres = compile_expression(ctx, expr->expression, TRUE);
746 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
749 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
751 switch(literal->type) {
753 return push_instr_int(ctx, OP_bool, literal->u.bval);
755 return push_instr_double(ctx, OP_double, literal->u.dval);
757 return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
759 return push_instr_str(ctx, OP_str, literal->u.wstr);
764 str = compiler_alloc_string_len(ctx, literal->u.regexp.str, literal->u.regexp.str_len);
766 return E_OUTOFMEMORY;
768 instr = push_instr(ctx, OP_regexp);
770 return E_OUTOFMEMORY;
772 instr_ptr(ctx, instr)->u.arg[0].str = str;
773 instr_ptr(ctx, instr)->u.arg[1].uint = literal->u.regexp.flags;
782 static HRESULT literal_as_bstr(compiler_ctx_t *ctx, literal_t *literal, BSTR *str)
784 switch(literal->type) {
786 *str = compiler_alloc_bstr(ctx, literal->u.wstr);
792 hres = double_to_string(literal->u.dval, &jsstr);
796 *str = SysAllocStringLen(jsstr->str, jsstr_length(jsstr));
797 jsstr_release(jsstr);
804 return *str ? S_OK : E_OUTOFMEMORY;
807 static HRESULT compile_array_literal(compiler_ctx_t *ctx, array_literal_expression_t *expr)
809 unsigned i, elem_cnt = expr->length;
810 array_element_t *iter;
813 for(iter = expr->element_list; iter; iter = iter->next) {
814 elem_cnt += iter->elision+1;
816 for(i=0; i < iter->elision; i++) {
817 if(!push_instr(ctx, OP_undefined))
818 return E_OUTOFMEMORY;
821 hres = compile_expression(ctx, iter->expr, TRUE);
826 for(i=0; i < expr->length; i++) {
827 if(!push_instr(ctx, OP_undefined))
828 return E_OUTOFMEMORY;
831 return push_instr_uint(ctx, OP_carray, elem_cnt);
834 static HRESULT compile_object_literal(compiler_ctx_t *ctx, property_value_expression_t *expr)
841 if(!push_instr(ctx, OP_new_obj))
842 return E_OUTOFMEMORY;
844 for(iter = expr->property_list; iter; iter = iter->next) {
845 hres = literal_as_bstr(ctx, iter->name, &name);
849 hres = compile_expression(ctx, iter->value, TRUE);
853 instr = push_instr(ctx, OP_obj_prop);
855 return E_OUTOFMEMORY;
857 instr_ptr(ctx, instr)->u.arg->bstr = name;
863 static HRESULT compile_function_expression(compiler_ctx_t *ctx, function_expression_t *expr)
865 ctx->func_tail = ctx->func_tail ? (ctx->func_tail->next = expr) : (ctx->func_head = expr);
867 /* FIXME: not exactly right */
868 if(expr->identifier) {
869 ctx->func->func_cnt++;
870 return push_instr_bstr(ctx, OP_ident, expr->identifier);
873 return push_instr_uint(ctx, OP_func, ctx->func->func_cnt++);
876 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr, BOOL emit_ret)
882 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
885 hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_z);
888 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_array);
891 hres = compile_array_literal(ctx, (array_literal_expression_t*)expr);
894 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
897 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
900 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_and);
903 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
906 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
909 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_div);
912 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mod);
915 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_or);
917 case EXPR_ASSIGNLSHIFT:
918 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_lshift);
920 case EXPR_ASSIGNRSHIFT:
921 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift);
923 case EXPR_ASSIGNRRSHIFT:
924 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
927 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_xor);
930 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
933 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
936 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
939 return compile_call_expression(ctx, (call_expression_t*)expr, emit_ret);
941 hres = compile_comma_expression(ctx, (binary_expression_t*)expr);
944 hres = compile_conditional_expression(ctx, (conditional_expression_t*)expr);
947 hres = compile_delete_expression(ctx, (unary_expression_t*)expr);
950 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
953 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
956 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
959 hres = compile_function_expression(ctx, (function_expression_t*)expr);
962 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
965 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
968 hres = push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
971 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
973 case EXPR_INSTANCEOF:
974 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_instanceof);
977 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
980 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
983 hres = compile_literal(ctx, ((literal_expression_t*)expr)->literal);
986 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
989 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lshift);
992 hres = compile_member_expression(ctx, (member_expression_t*)expr);
995 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
998 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
1001 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
1004 hres = compile_new_expression(ctx, (call_expression_t*)expr);
1007 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
1010 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
1013 hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_nz);
1016 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
1019 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, -1);
1022 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, 1);
1025 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, -1);
1028 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, 1);
1031 hres = compile_object_literal(ctx, (property_value_expression_t*)expr);
1034 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift);
1037 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
1040 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
1043 return !emit_ret || push_instr(ctx, OP_this) ? S_OK : E_OUTOFMEMORY;
1045 hres = compile_typeof_expression(ctx, (unary_expression_t*)expr);
1048 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
1051 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
1060 return emit_ret || push_instr(ctx, OP_pop) ? S_OK : E_OUTOFMEMORY;
1063 static inline BOOL is_loop_statement(statement_type_t type)
1065 return type == STAT_FOR || type == STAT_FORIN || type == STAT_WHILE;
1068 /* ECMA-262 3rd Edition 12.1 */
1069 static HRESULT compile_block_statement(compiler_ctx_t *ctx, statement_t *iter)
1074 hres = compile_statement(ctx, NULL, iter);
1084 /* ECMA-262 3rd Edition 12.2 */
1085 static HRESULT compile_variable_list(compiler_ctx_t *ctx, variable_declaration_t *list)
1087 variable_declaration_t *iter;
1090 assert(list != NULL);
1093 ctx->var_tail->global_next = list;
1095 ctx->var_head = list;
1097 for(iter = list; iter; iter = iter->next) {
1098 ctx->func->var_cnt++;
1099 iter->global_next = iter->next;
1101 ctx->var_tail = iter;
1106 hres = compile_expression(ctx, iter->expr, TRUE);
1110 hres = push_instr_bstr(ctx, OP_var_set, iter->identifier);
1118 /* ECMA-262 3rd Edition 12.2 */
1119 static HRESULT compile_var_statement(compiler_ctx_t *ctx, var_statement_t *stat)
1121 return compile_variable_list(ctx, stat->variable_list);
1124 /* ECMA-262 3rd Edition 12.4 */
1125 static HRESULT compile_expression_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1129 hres = compile_expression(ctx, stat->expr, ctx->from_eval);
1133 return !ctx->from_eval || push_instr(ctx, OP_setret) ? S_OK : E_OUTOFMEMORY;
1136 /* ECMA-262 3rd Edition 12.5 */
1137 static HRESULT compile_if_statement(compiler_ctx_t *ctx, if_statement_t *stat)
1142 hres = compile_expression(ctx, stat->expr, TRUE);
1146 jmp_else = push_instr(ctx, OP_jmp_z);
1148 return E_OUTOFMEMORY;
1150 hres = compile_statement(ctx, NULL, stat->if_stat);
1154 if(stat->else_stat) {
1157 jmp_end = push_instr(ctx, OP_jmp);
1159 return E_OUTOFMEMORY;
1161 set_arg_uint(ctx, jmp_else, ctx->code_off);
1163 hres = compile_statement(ctx, NULL, stat->else_stat);
1167 set_arg_uint(ctx, jmp_end, ctx->code_off);
1169 set_arg_uint(ctx, jmp_else, ctx->code_off);
1175 /* ECMA-262 3rd Edition 12.6.2 */
1176 static HRESULT compile_while_statement(compiler_ctx_t *ctx, while_statement_t *stat)
1178 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1182 stat_ctx.break_label = alloc_label(ctx);
1183 if(!stat_ctx.break_label)
1184 return E_OUTOFMEMORY;
1186 stat_ctx.continue_label = alloc_label(ctx);
1187 if(!stat_ctx.continue_label)
1188 return E_OUTOFMEMORY;
1190 jmp_off = ctx->code_off;
1192 if(!stat->do_while) {
1193 label_set_addr(ctx, stat_ctx.continue_label);
1194 hres = compile_expression(ctx, stat->expr, TRUE);
1198 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1203 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1207 if(stat->do_while) {
1208 label_set_addr(ctx, stat_ctx.continue_label);
1209 hres = compile_expression(ctx, stat->expr, TRUE);
1213 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1218 hres = push_instr_uint(ctx, OP_jmp, jmp_off);
1222 label_set_addr(ctx, stat_ctx.break_label);
1226 /* ECMA-262 3rd Edition 12.6.3 */
1227 static HRESULT compile_for_statement(compiler_ctx_t *ctx, for_statement_t *stat)
1229 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1233 if(stat->variable_list) {
1234 hres = compile_variable_list(ctx, stat->variable_list);
1237 }else if(stat->begin_expr) {
1238 hres = compile_expression(ctx, stat->begin_expr, FALSE);
1243 stat_ctx.break_label = alloc_label(ctx);
1244 if(!stat_ctx.break_label)
1245 return E_OUTOFMEMORY;
1247 stat_ctx.continue_label = alloc_label(ctx);
1248 if(!stat_ctx.continue_label)
1249 return E_OUTOFMEMORY;
1251 expr_off = ctx->code_off;
1254 hres = compile_expression(ctx, stat->expr, TRUE);
1258 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1263 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1267 label_set_addr(ctx, stat_ctx.continue_label);
1269 if(stat->end_expr) {
1270 hres = compile_expression(ctx, stat->end_expr, FALSE);
1275 hres = push_instr_uint(ctx, OP_jmp, expr_off);
1279 label_set_addr(ctx, stat_ctx.break_label);
1283 /* ECMA-262 3rd Edition 12.6.4 */
1284 static HRESULT compile_forin_statement(compiler_ctx_t *ctx, forin_statement_t *stat)
1286 statement_ctx_t stat_ctx = {4, FALSE, FALSE};
1289 if(stat->variable) {
1290 hres = compile_variable_list(ctx, stat->variable);
1295 stat_ctx.break_label = alloc_label(ctx);
1296 if(!stat_ctx.break_label)
1297 return E_OUTOFMEMORY;
1299 stat_ctx.continue_label = alloc_label(ctx);
1300 if(!stat_ctx.continue_label)
1301 return E_OUTOFMEMORY;
1303 hres = compile_expression(ctx, stat->in_expr, TRUE);
1307 if(stat->variable) {
1308 hres = push_instr_bstr_uint(ctx, OP_identid, stat->variable->identifier, fdexNameEnsure);
1311 }else if(is_memberid_expr(stat->expr->type)) {
1312 hres = compile_memberid_expression(ctx, stat->expr, fdexNameEnsure);
1316 hres = push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
1320 /* FIXME: compile statement anyways when we depend on compiler to check errors */
1324 hres = push_instr_int(ctx, OP_int, DISPID_STARTENUM);
1328 label_set_addr(ctx, stat_ctx.continue_label);
1329 hres = push_instr_uint(ctx, OP_forin, stat_ctx.break_label);
1331 return E_OUTOFMEMORY;
1333 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1337 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.continue_label);
1341 label_set_addr(ctx, stat_ctx.break_label);
1345 static HRESULT pop_to_stat(compiler_ctx_t *ctx, BOOL var_stack, BOOL scope_stack, statement_ctx_t *stat_ctx)
1347 unsigned stack_pop = 0;
1348 statement_ctx_t *iter;
1350 for(iter = ctx->stat_ctx; iter != stat_ctx; iter = iter->next) {
1352 if(iter->using_scope && !push_instr(ctx, OP_pop_scope))
1353 return E_OUTOFMEMORY;
1354 if(iter->using_except && !push_instr(ctx, OP_pop_except))
1355 return E_OUTOFMEMORY;
1357 stack_pop += iter->stack_use;
1361 /* FIXME: optimize */
1362 while(stack_pop--) {
1363 if(!push_instr(ctx, OP_pop))
1364 return E_OUTOFMEMORY;
1371 /* ECMA-262 3rd Edition 12.7 */
1372 static HRESULT compile_continue_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1374 statement_ctx_t *pop_ctx;
1377 if(stat->identifier) {
1378 statement_t *label_stat;
1379 statement_ctx_t *iter;
1383 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1384 if(iter->continue_label)
1386 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier))
1391 WARN("Label not found\n");
1392 return JS_E_LABEL_NOT_FOUND;
1395 /* Labelled continue are allowed only on loops */
1396 for(label_stat = iter->labelled_stat->statement;
1397 label_stat->type == STAT_LABEL;
1398 label_stat = ((labelled_statement_t*)label_stat)->statement);
1399 if(!is_loop_statement(label_stat->type)) {
1400 WARN("Label is not a loop\n");
1401 return JS_E_INVALID_CONTINUE;
1404 assert(pop_ctx != NULL);
1406 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1407 if(pop_ctx->continue_label)
1412 WARN("continue outside loop\n");
1413 return JS_E_INVALID_CONTINUE;
1417 hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx);
1421 return push_instr_uint(ctx, OP_jmp, pop_ctx->continue_label);
1424 /* ECMA-262 3rd Edition 12.8 */
1425 static HRESULT compile_break_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1427 statement_ctx_t *pop_ctx;
1430 if(stat->identifier) {
1431 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1432 if(pop_ctx->labelled_stat && !strcmpW(pop_ctx->labelled_stat->identifier, stat->identifier)) {
1433 assert(pop_ctx->break_label);
1439 WARN("Label not found\n");
1440 return JS_E_LABEL_NOT_FOUND;
1443 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1444 if(pop_ctx->break_label && !pop_ctx->labelled_stat)
1449 WARN("Break outside loop\n");
1450 return JS_E_INVALID_BREAK;
1454 hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx->next);
1458 return push_instr_uint(ctx, OP_jmp, pop_ctx->break_label);
1461 /* ECMA-262 3rd Edition 12.9 */
1462 static HRESULT compile_return_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1466 if(ctx->from_eval) {
1467 WARN("misplaced return statement\n");
1468 return JS_E_MISPLACED_RETURN;
1471 hres = pop_to_stat(ctx, TRUE, FALSE, NULL);
1476 hres = compile_expression(ctx, stat->expr, TRUE);
1479 if(!push_instr(ctx, OP_setret))
1480 return E_OUTOFMEMORY;
1483 hres = pop_to_stat(ctx, FALSE, TRUE, NULL);
1487 return push_instr(ctx, OP_ret) ? S_OK : E_OUTOFMEMORY;
1490 /* ECMA-262 3rd Edition 12.10 */
1491 static HRESULT compile_with_statement(compiler_ctx_t *ctx, with_statement_t *stat)
1493 statement_ctx_t stat_ctx = {0, TRUE, FALSE};
1496 hres = compile_expression(ctx, stat->expr, TRUE);
1500 if(!push_instr(ctx, OP_push_scope))
1501 return E_OUTOFMEMORY;
1503 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1507 if(!push_instr(ctx, OP_pop_scope))
1508 return E_OUTOFMEMORY;
1513 /* ECMA-262 3rd Edition 12.10 */
1514 static HRESULT compile_labelled_statement(compiler_ctx_t *ctx, labelled_statement_t *stat)
1516 statement_ctx_t stat_ctx = {0, FALSE, FALSE, 0, 0, stat}, *iter;
1519 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1520 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier)) {
1521 WARN("Label %s redefined\n", debugstr_w(stat->identifier));
1522 return JS_E_LABEL_REDEFINED;
1526 /* Labelled breaks are allowed for any labelled statements, not only loops (violating spec) */
1527 stat_ctx.break_label = alloc_label(ctx);
1528 if(!stat_ctx.break_label)
1529 return E_OUTOFMEMORY;
1531 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1535 label_set_addr(ctx, stat_ctx.break_label);
1539 /* ECMA-262 3rd Edition 12.13 */
1540 static HRESULT compile_switch_statement(compiler_ctx_t *ctx, switch_statement_t *stat)
1542 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1543 unsigned case_cnt = 0, *case_jmps, i, default_jmp;
1544 BOOL have_default = FALSE;
1545 statement_t *stat_iter;
1546 case_clausule_t *iter;
1549 hres = compile_expression(ctx, stat->expr, TRUE);
1553 stat_ctx.break_label = alloc_label(ctx);
1554 if(!stat_ctx.break_label)
1555 return E_OUTOFMEMORY;
1557 for(iter = stat->case_list; iter; iter = iter->next) {
1562 case_jmps = heap_alloc(case_cnt * sizeof(*case_jmps));
1564 return E_OUTOFMEMORY;
1567 for(iter = stat->case_list; iter; iter = iter->next) {
1569 have_default = TRUE;
1573 hres = compile_expression(ctx, iter->expr, TRUE);
1577 case_jmps[i] = push_instr(ctx, OP_case);
1579 hres = E_OUTOFMEMORY;
1585 if(SUCCEEDED(hres)) {
1586 if(push_instr(ctx, OP_pop)) {
1587 default_jmp = push_instr(ctx, OP_jmp);
1589 hres = E_OUTOFMEMORY;
1591 hres = E_OUTOFMEMORY;
1596 heap_free(case_jmps);
1601 for(iter = stat->case_list; iter; iter = iter->next) {
1602 while(iter->next && iter->next->stat == iter->stat) {
1603 set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1607 set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1609 for(stat_iter = iter->stat; stat_iter && (!iter->next || iter->next->stat != stat_iter);
1610 stat_iter = stat_iter->next) {
1611 hres = compile_statement(ctx, &stat_ctx, stat_iter);
1619 heap_free(case_jmps);
1622 assert(i == case_cnt);
1625 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.break_label);
1628 set_arg_uint(ctx, default_jmp, ctx->code_off);
1631 label_set_addr(ctx, stat_ctx.break_label);
1635 /* ECMA-262 3rd Edition 12.13 */
1636 static HRESULT compile_throw_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1640 hres = compile_expression(ctx, stat->expr, TRUE);
1644 return push_instr(ctx, OP_throw) ? S_OK : E_OUTOFMEMORY;
1647 /* ECMA-262 3rd Edition 12.14 */
1648 static HRESULT compile_try_statement(compiler_ctx_t *ctx, try_statement_t *stat)
1650 statement_ctx_t try_ctx = {0, FALSE, TRUE}, catch_ctx = {0, TRUE, FALSE};
1651 statement_ctx_t finally_ctx = {2, FALSE, FALSE};
1652 unsigned push_except;
1656 push_except = push_instr(ctx, OP_push_except);
1658 return E_OUTOFMEMORY;
1660 if(stat->catch_block) {
1661 ident = compiler_alloc_bstr(ctx, stat->catch_block->identifier);
1663 return E_OUTOFMEMORY;
1668 instr_ptr(ctx, push_except)->u.arg[1].bstr = ident;
1670 if(!stat->catch_block)
1671 try_ctx.stack_use = 2;
1673 hres = compile_statement(ctx, &try_ctx, stat->try_statement);
1677 if(!push_instr(ctx, OP_pop_except))
1678 return E_OUTOFMEMORY;
1680 if(stat->catch_block) {
1681 unsigned jmp_finally;
1683 jmp_finally = push_instr(ctx, OP_jmp);
1685 return E_OUTOFMEMORY;
1687 instr_ptr(ctx, push_except)->u.arg[0].uint = ctx->code_off;
1689 hres = compile_statement(ctx, &catch_ctx, stat->catch_block->statement);
1693 if(!push_instr(ctx, OP_pop_scope))
1694 return E_OUTOFMEMORY;
1696 set_arg_uint(ctx, jmp_finally, ctx->code_off);
1698 set_arg_uint(ctx, push_except, ctx->code_off);
1701 if(stat->finally_statement) {
1702 hres = compile_statement(ctx, stat->catch_block ? NULL : &finally_ctx, stat->finally_statement);
1706 if(!stat->catch_block && !push_instr(ctx, OP_end_finally))
1707 return E_OUTOFMEMORY;
1713 static HRESULT compile_statement(compiler_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1718 stat_ctx->next = ctx->stat_ctx;
1719 ctx->stat_ctx = stat_ctx;
1722 switch(stat->type) {
1724 hres = compile_block_statement(ctx, ((block_statement_t*)stat)->stat_list);
1727 hres = compile_break_statement(ctx, (branch_statement_t*)stat);
1730 hres = compile_continue_statement(ctx, (branch_statement_t*)stat);
1737 hres = compile_expression_statement(ctx, (expression_statement_t*)stat);
1740 hres = compile_for_statement(ctx, (for_statement_t*)stat);
1743 hres = compile_forin_statement(ctx, (forin_statement_t*)stat);
1746 hres = compile_if_statement(ctx, (if_statement_t*)stat);
1749 hres = compile_labelled_statement(ctx, (labelled_statement_t*)stat);
1752 hres = compile_return_statement(ctx, (expression_statement_t*)stat);
1755 hres = compile_switch_statement(ctx, (switch_statement_t*)stat);
1758 hres = compile_throw_statement(ctx, (expression_statement_t*)stat);
1761 hres = compile_try_statement(ctx, (try_statement_t*)stat);
1764 hres = compile_var_statement(ctx, (var_statement_t*)stat);
1767 hres = compile_while_statement(ctx, (while_statement_t*)stat);
1770 hres = compile_with_statement(ctx, (with_statement_t*)stat);
1778 assert(ctx->stat_ctx == stat_ctx);
1779 ctx->stat_ctx = stat_ctx->next;
1785 static void resolve_labels(compiler_ctx_t *ctx, unsigned off)
1789 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
1790 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->u.arg->uint & LABEL_FLAG)) {
1791 assert((instr->u.arg->uint & ~LABEL_FLAG) < ctx->labels_cnt);
1792 instr->u.arg->uint = ctx->labels[instr->u.arg->uint & ~LABEL_FLAG];
1794 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
1797 ctx->labels_cnt = 0;
1800 void release_bytecode(bytecode_t *code)
1807 for(i=0; i < code->bstr_cnt; i++)
1808 SysFreeString(code->bstr_pool[i]);
1809 for(i=0; i < code->str_cnt; i++)
1810 jsstr_release(code->str_pool[i]);
1812 heap_free(code->source);
1813 jsheap_free(&code->heap);
1814 heap_free(code->bstr_pool);
1815 heap_free(code->str_pool);
1816 heap_free(code->instrs);
1820 static HRESULT init_code(compiler_ctx_t *compiler, const WCHAR *source)
1822 compiler->code = heap_alloc_zero(sizeof(bytecode_t));
1824 return E_OUTOFMEMORY;
1826 compiler->code->ref = 1;
1827 jsheap_init(&compiler->code->heap);
1829 compiler->code->source = heap_strdupW(source);
1830 if(!compiler->code->source) {
1831 release_bytecode(compiler->code);
1832 return E_OUTOFMEMORY;
1835 compiler->code->instrs = heap_alloc(64 * sizeof(instr_t));
1836 if(!compiler->code->instrs) {
1837 release_bytecode(compiler->code);
1838 return E_OUTOFMEMORY;
1841 compiler->code_size = 64;
1842 compiler->code_off = 1;
1846 static HRESULT compile_function(compiler_ctx_t *ctx, source_elements_t *source, function_expression_t *func_expr,
1847 BOOL from_eval, function_code_t *func)
1849 variable_declaration_t *var_iter;
1850 function_expression_t *iter;
1856 ctx->var_head = ctx->var_tail = NULL;
1857 ctx->func_head = ctx->func_tail = NULL;
1858 ctx->from_eval = from_eval;
1860 off = ctx->code_off;
1862 hres = compile_block_statement(ctx, source->statement);
1866 resolve_labels(ctx, off);
1868 if(!push_instr(ctx, OP_ret))
1869 return E_OUTOFMEMORY;
1871 if(TRACE_ON(jscript_disas))
1872 dump_code(ctx, off);
1874 func->instr_off = off;
1876 if(func_expr && func_expr->identifier) {
1877 func->name = compiler_alloc_bstr(ctx, func_expr->identifier);
1879 return E_OUTOFMEMORY;
1883 parameter_t *param_iter;
1885 func->source = func_expr->src_str;
1886 func->source_len = func_expr->src_len;
1888 for(param_iter = func_expr->parameter_list; param_iter; param_iter = param_iter->next)
1891 func->params = compiler_alloc(ctx->code, func->param_cnt * sizeof(*func->params));
1893 return E_OUTOFMEMORY;
1895 for(param_iter = func_expr->parameter_list, i=0; param_iter; param_iter = param_iter->next, i++) {
1896 func->params[i] = compiler_alloc_bstr(ctx, param_iter->identifier);
1897 if(!func->params[i])
1898 return E_OUTOFMEMORY;
1902 func->variables = compiler_alloc(ctx->code, func->var_cnt * sizeof(*func->variables));
1903 if(!func->variables)
1904 return E_OUTOFMEMORY;
1906 for(var_iter = ctx->var_head, i=0; var_iter; var_iter = var_iter->global_next, i++) {
1907 func->variables[i] = compiler_alloc_bstr(ctx, var_iter->identifier);
1908 if(!func->variables[i])
1909 return E_OUTOFMEMORY;
1912 assert(i == func->var_cnt);
1914 func->funcs = compiler_alloc(ctx->code, func->func_cnt * sizeof(*func->funcs));
1916 return E_OUTOFMEMORY;
1917 memset(func->funcs, 0, func->func_cnt * sizeof(*func->funcs));
1919 for(iter = ctx->func_head, i=0; iter; iter = iter->next, i++) {
1920 hres = compile_function(ctx, iter->source_elements, iter, FALSE, func->funcs+i);
1925 assert(i == func->func_cnt);
1930 static HRESULT parse_arguments(compiler_ctx_t *ctx, const WCHAR *args, BSTR *arg_array, unsigned *args_size)
1932 const WCHAR *ptr = args, *ptr2;
1933 unsigned arg_cnt = 0;
1935 while(isspaceW(*ptr))
1944 if(!isalphaW(*ptr) && *ptr != '_') {
1945 FIXME("expected alpha or '_': %s\n", debugstr_w(ptr));
1950 while(isalnumW(*ptr) || *ptr == '_')
1953 if(*ptr && *ptr != ',' && !isspaceW(*ptr)) {
1954 FIXME("unexpected har %s\n", debugstr_w(ptr));
1959 arg_array[arg_cnt] = compiler_alloc_bstr_len(ctx, ptr2, ptr-ptr2);
1960 if(!arg_array[arg_cnt])
1961 return E_OUTOFMEMORY;
1965 while(isspaceW(*ptr))
1970 FIXME("expected ',': %s\n", debugstr_w(ptr));
1975 while(isspaceW(*ptr))
1980 *args_size = arg_cnt;
1984 static HRESULT compile_arguments(compiler_ctx_t *ctx, const WCHAR *args)
1988 hres = parse_arguments(ctx, args, NULL, &ctx->code->global_code.param_cnt);
1992 ctx->code->global_code.params = compiler_alloc(ctx->code,
1993 ctx->code->global_code.param_cnt * sizeof(*ctx->code->global_code.params));
1994 if(!ctx->code->global_code.params)
1995 return E_OUTOFMEMORY;
1997 return parse_arguments(ctx, args, ctx->code->global_code.params, NULL);
2000 HRESULT compile_script(script_ctx_t *ctx, const WCHAR *code, const WCHAR *args, const WCHAR *delimiter,
2001 BOOL from_eval, BOOL use_decode, bytecode_t **ret)
2003 compiler_ctx_t compiler = {0};
2006 hres = init_code(&compiler, code);
2011 hres = compile_arguments(&compiler, args);
2017 hres = decode_source(compiler.code->source);
2019 WARN("Decoding failed\n");
2024 hres = script_parse(ctx, compiler.code->source, delimiter, from_eval, &compiler.parser);
2026 release_bytecode(compiler.code);
2030 hres = compile_function(&compiler, compiler.parser->source, NULL, from_eval, &compiler.code->global_code);
2031 parser_release(compiler.parser);
2033 release_bytecode(compiler.code);
2037 *ret = compiler.code;