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);
99 static void dump_code(compiler_ctx_t *ctx, unsigned off)
103 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
104 TRACE_(jscript_disas)("%d:\t%s", (int)(instr-ctx->code->instrs), instr_info[instr->op].op_str);
105 if(instr_info[instr->op].arg1_type == ARG_DBL) {
106 TRACE_(jscript_disas)("\t%lf", instr->u.dbl);
108 dump_instr_arg(instr_info[instr->op].arg1_type, instr->u.arg);
109 dump_instr_arg(instr_info[instr->op].arg2_type, instr->u.arg+1);
111 TRACE_(jscript_disas)("\n");
115 static HRESULT compile_expression(compiler_ctx_t*,expression_t*,BOOL);
116 static HRESULT compile_statement(compiler_ctx_t*,statement_ctx_t*,statement_t*);
118 static inline void *compiler_alloc(bytecode_t *code, size_t size)
120 return heap_pool_alloc(&code->heap, size);
123 static jsstr_t *compiler_alloc_string_len(compiler_ctx_t *ctx, const WCHAR *str, unsigned len)
127 if(!ctx->code->str_pool_size) {
128 ctx->code->str_pool = heap_alloc(8 * sizeof(jsstr_t*));
129 if(!ctx->code->str_pool)
131 ctx->code->str_pool_size = 8;
132 }else if(ctx->code->str_pool_size == ctx->code->str_cnt) {
135 new_pool = heap_realloc(ctx->code->str_pool, ctx->code->str_pool_size*2*sizeof(jsstr_t*));
139 ctx->code->str_pool = new_pool;
140 ctx->code->str_pool_size *= 2;
143 new_str = jsstr_alloc_len(str, len);
147 ctx->code->str_pool[ctx->code->str_cnt++] = new_str;
151 static jsstr_t *compiler_alloc_string(compiler_ctx_t *ctx, const WCHAR *str)
153 return compiler_alloc_string_len(ctx, str, strlenW(str));
156 static BOOL ensure_bstr_slot(compiler_ctx_t *ctx)
158 if(!ctx->code->bstr_pool_size) {
159 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
160 if(!ctx->code->bstr_pool)
162 ctx->code->bstr_pool_size = 8;
163 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
166 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
170 ctx->code->bstr_pool = new_pool;
171 ctx->code->bstr_pool_size *= 2;
177 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
179 if(!ensure_bstr_slot(ctx))
182 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
183 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
186 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
189 static BSTR compiler_alloc_bstr_len(compiler_ctx_t *ctx, const WCHAR *str, size_t len)
191 if(!ensure_bstr_slot(ctx))
194 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocStringLen(str, len);
195 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
198 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
201 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
203 assert(ctx->code_size >= ctx->code_off);
205 if(ctx->code_size == ctx->code_off) {
208 new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
212 ctx->code->instrs = new_instrs;
216 ctx->code->instrs[ctx->code_off].op = op;
217 return ctx->code_off++;
220 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
222 assert(off < ctx->code_off);
223 return ctx->code->instrs + off;
226 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
230 instr = push_instr(ctx, op);
232 return E_OUTOFMEMORY;
234 instr_ptr(ctx, instr)->u.arg->lng = arg;
238 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
243 str = compiler_alloc_string(ctx, arg);
245 return E_OUTOFMEMORY;
247 instr = push_instr(ctx, op);
249 return E_OUTOFMEMORY;
251 instr_ptr(ctx, instr)->u.arg->str = str;
255 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
260 str = compiler_alloc_bstr(ctx, arg);
262 return E_OUTOFMEMORY;
264 instr = push_instr(ctx, op);
266 return E_OUTOFMEMORY;
268 instr_ptr(ctx, instr)->u.arg->bstr = str;
272 static HRESULT push_instr_bstr_uint(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg1, unsigned arg2)
277 str = compiler_alloc_bstr(ctx, arg1);
279 return E_OUTOFMEMORY;
281 instr = push_instr(ctx, op);
283 return E_OUTOFMEMORY;
285 instr_ptr(ctx, instr)->u.arg[0].bstr = str;
286 instr_ptr(ctx, instr)->u.arg[1].uint = arg2;
290 static HRESULT push_instr_uint_str(compiler_ctx_t *ctx, jsop_t op, unsigned arg1, const WCHAR *arg2)
295 str = compiler_alloc_string(ctx, arg2);
297 return E_OUTOFMEMORY;
299 instr = push_instr(ctx, op);
301 return E_OUTOFMEMORY;
303 instr_ptr(ctx, instr)->u.arg[0].uint = arg1;
304 instr_ptr(ctx, instr)->u.arg[1].str = str;
308 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
312 instr = push_instr(ctx, op);
314 return E_OUTOFMEMORY;
316 instr_ptr(ctx, instr)->u.dbl = arg;
320 static inline void set_arg_uint(compiler_ctx_t *ctx, unsigned instr, unsigned arg)
322 instr_ptr(ctx, instr)->u.arg->uint = arg;
325 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
329 instr = push_instr(ctx, op);
331 return E_OUTOFMEMORY;
333 set_arg_uint(ctx, instr, arg);
337 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
341 hres = compile_expression(ctx, expr->expression1, TRUE);
345 hres = compile_expression(ctx, expr->expression2, TRUE);
349 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
352 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
356 hres = compile_expression(ctx, expr->expression, TRUE);
360 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
363 /* ECMA-262 3rd Edition 11.2.1 */
364 static HRESULT compile_member_expression(compiler_ctx_t *ctx, member_expression_t *expr)
368 hres = compile_expression(ctx, expr->expression, TRUE);
372 return push_instr_bstr(ctx, OP_member, expr->identifier);
375 #define LABEL_FLAG 0x80000000
377 static unsigned alloc_label(compiler_ctx_t *ctx)
379 if(!ctx->labels_size) {
380 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
383 ctx->labels_size = 8;
384 }else if(ctx->labels_size == ctx->labels_cnt) {
385 unsigned *new_labels;
387 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
391 ctx->labels = new_labels;
392 ctx->labels_size *= 2;
395 return ctx->labels_cnt++ | LABEL_FLAG;
398 static void label_set_addr(compiler_ctx_t *ctx, unsigned label)
400 assert(label & LABEL_FLAG);
401 ctx->labels[label & ~LABEL_FLAG] = ctx->code_off;
404 static inline BOOL is_memberid_expr(expression_type_t type)
406 return type == EXPR_IDENT || type == EXPR_MEMBER || type == EXPR_ARRAY;
409 static HRESULT compile_memberid_expression(compiler_ctx_t *ctx, expression_t *expr, unsigned flags)
415 identifier_expression_t *ident_expr = (identifier_expression_t*)expr;
417 hres = push_instr_bstr_uint(ctx, OP_identid, ident_expr->identifier, flags);
421 binary_expression_t *array_expr = (binary_expression_t*)expr;
423 hres = compile_expression(ctx, array_expr->expression1, TRUE);
427 hres = compile_expression(ctx, array_expr->expression2, TRUE);
431 hres = push_instr_uint(ctx, OP_memberid, flags);
435 member_expression_t *member_expr = (member_expression_t*)expr;
437 hres = compile_expression(ctx, member_expr->expression, TRUE);
441 /* FIXME: Potential optimization */
442 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
446 hres = push_instr_uint(ctx, OP_memberid, flags);
455 static HRESULT compile_increment_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op, int n)
459 if(!is_memberid_expr(expr->expression->type)) {
460 hres = compile_expression(ctx, expr->expression, TRUE);
464 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
467 hres = compile_memberid_expression(ctx, expr->expression, fdexNameEnsure);
471 return push_instr_int(ctx, op, n);
474 /* ECMA-262 3rd Edition 11.14 */
475 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr, BOOL emit_ret)
479 hres = compile_expression(ctx, expr->expression1, FALSE);
483 return compile_expression(ctx, expr->expression2, emit_ret);
486 /* ECMA-262 3rd Edition 11.11 */
487 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
492 hres = compile_expression(ctx, expr->expression1, TRUE);
496 instr = push_instr(ctx, op);
498 return E_OUTOFMEMORY;
500 hres = compile_expression(ctx, expr->expression2, TRUE);
504 set_arg_uint(ctx, instr, ctx->code_off);
508 /* ECMA-262 3rd Edition 11.12 */
509 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
511 unsigned jmp_false, jmp_end;
514 hres = compile_expression(ctx, expr->expression, TRUE);
518 jmp_false = push_instr(ctx, OP_cnd_z);
520 return E_OUTOFMEMORY;
522 hres = compile_expression(ctx, expr->true_expression, TRUE);
526 jmp_end = push_instr(ctx, OP_jmp);
528 return E_OUTOFMEMORY;
530 set_arg_uint(ctx, jmp_false, ctx->code_off);
531 hres = push_instr_uint(ctx, OP_pop, 1);
535 hres = compile_expression(ctx, expr->false_expression, TRUE);
539 set_arg_uint(ctx, jmp_end, ctx->code_off);
543 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
545 unsigned arg_cnt = 0;
549 hres = compile_expression(ctx, expr->expression, TRUE);
553 for(arg = expr->argument_list; arg; arg = arg->next) {
554 hres = compile_expression(ctx, arg->expr, TRUE);
560 return push_instr_uint(ctx, OP_new, arg_cnt);
563 static HRESULT compile_call_expression(compiler_ctx_t *ctx, call_expression_t *expr, BOOL emit_ret)
565 unsigned arg_cnt = 0;
571 if(is_memberid_expr(expr->expression->type)) {
573 hres = compile_memberid_expression(ctx, expr->expression, 0);
576 hres = compile_expression(ctx, expr->expression, TRUE);
582 for(arg = expr->argument_list; arg; arg = arg->next) {
583 hres = compile_expression(ctx, arg->expr, TRUE);
589 instr = push_instr(ctx, op);
591 return E_OUTOFMEMORY;
593 instr_ptr(ctx, instr)->u.arg[0].uint = arg_cnt;
594 instr_ptr(ctx, instr)->u.arg[1].lng = emit_ret;
598 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
602 switch(expr->expression->type) {
604 binary_expression_t *array_expr = (binary_expression_t*)expr->expression;
606 hres = compile_expression(ctx, array_expr->expression1, TRUE);
610 hres = compile_expression(ctx, array_expr->expression2, TRUE);
614 if(!push_instr(ctx, OP_delete))
615 return E_OUTOFMEMORY;
619 member_expression_t *member_expr = (member_expression_t*)expr->expression;
621 hres = compile_expression(ctx, member_expr->expression, TRUE);
625 /* FIXME: Potential optimization */
626 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
630 if(!push_instr(ctx, OP_delete))
631 return E_OUTOFMEMORY;
635 return push_instr_bstr(ctx, OP_delete_ident, ((identifier_expression_t*)expr->expression)->identifier);
637 const WCHAR fixmeW[] = {'F','I','X','M','E',0};
639 WARN("invalid delete, unimplemented exception message\n");
641 hres = compile_expression(ctx, expr->expression, TRUE);
645 return push_instr_uint_str(ctx, OP_throw_type, JS_E_INVALID_DELETE, fixmeW);
652 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
654 BOOL use_throw_path = FALSE;
655 unsigned arg_cnt = 0;
658 if(expr->expression1->type == EXPR_CALL) {
659 call_expression_t *call_expr = (call_expression_t*)expr->expression1;
663 FIXME("op %d not supported on parametrized assign expressions\n", op);
667 if(is_memberid_expr(call_expr->expression->type) && call_expr->argument_list) {
668 hres = compile_memberid_expression(ctx, call_expr->expression, fdexNameEnsure);
672 for(arg = call_expr->argument_list; arg; arg = arg->next) {
673 hres = compile_expression(ctx, arg->expr, TRUE);
679 use_throw_path = TRUE;
681 }else if(is_memberid_expr(expr->expression1->type)) {
682 hres = compile_memberid_expression(ctx, expr->expression1, fdexNameEnsure);
686 use_throw_path = TRUE;
690 /* Illegal assignment: evaluate and throw */
691 hres = compile_expression(ctx, expr->expression1, TRUE);
695 hres = compile_expression(ctx, expr->expression2, TRUE);
699 if(op != OP_LAST && !push_instr(ctx, op))
700 return E_OUTOFMEMORY;
702 return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
705 if(op != OP_LAST && !push_instr(ctx, OP_refval))
706 return E_OUTOFMEMORY;
708 hres = compile_expression(ctx, expr->expression2, TRUE);
712 if(op != OP_LAST && !push_instr(ctx, op))
713 return E_OUTOFMEMORY;
716 return push_instr_uint(ctx, OP_assign_call, arg_cnt);
718 if(!push_instr(ctx, OP_assign))
719 return E_OUTOFMEMORY;
724 static HRESULT compile_typeof_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
729 if(is_memberid_expr(expr->expression->type)) {
730 if(expr->expression->type == EXPR_IDENT)
731 return push_instr_bstr(ctx, OP_typeofident, ((identifier_expression_t*)expr->expression)->identifier);
734 hres = compile_memberid_expression(ctx, expr->expression, 0);
737 hres = compile_expression(ctx, expr->expression, TRUE);
742 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
745 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
747 switch(literal->type) {
749 return push_instr_int(ctx, OP_bool, literal->u.bval);
751 return push_instr_double(ctx, OP_double, literal->u.dval);
753 return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
755 return push_instr_str(ctx, OP_str, literal->u.wstr);
760 str = compiler_alloc_string_len(ctx, literal->u.regexp.str, literal->u.regexp.str_len);
762 return E_OUTOFMEMORY;
764 instr = push_instr(ctx, OP_regexp);
766 return E_OUTOFMEMORY;
768 instr_ptr(ctx, instr)->u.arg[0].str = str;
769 instr_ptr(ctx, instr)->u.arg[1].uint = literal->u.regexp.flags;
777 static HRESULT literal_as_bstr(compiler_ctx_t *ctx, literal_t *literal, BSTR *str)
779 switch(literal->type) {
781 *str = compiler_alloc_bstr(ctx, literal->u.wstr);
787 hres = double_to_string(literal->u.dval, &jsstr);
791 *str = compiler_alloc_bstr_len(ctx, NULL, jsstr_length(jsstr));
793 jsstr_flush(jsstr, *str);
794 jsstr_release(jsstr);
800 return *str ? S_OK : E_OUTOFMEMORY;
803 static HRESULT compile_array_literal(compiler_ctx_t *ctx, array_literal_expression_t *expr)
805 unsigned i, elem_cnt = expr->length;
806 array_element_t *iter;
809 for(iter = expr->element_list; iter; iter = iter->next) {
810 elem_cnt += iter->elision+1;
812 for(i=0; i < iter->elision; i++) {
813 if(!push_instr(ctx, OP_undefined))
814 return E_OUTOFMEMORY;
817 hres = compile_expression(ctx, iter->expr, TRUE);
822 for(i=0; i < expr->length; i++) {
823 if(!push_instr(ctx, OP_undefined))
824 return E_OUTOFMEMORY;
827 return push_instr_uint(ctx, OP_carray, elem_cnt);
830 static HRESULT compile_object_literal(compiler_ctx_t *ctx, property_value_expression_t *expr)
837 if(!push_instr(ctx, OP_new_obj))
838 return E_OUTOFMEMORY;
840 for(iter = expr->property_list; iter; iter = iter->next) {
841 hres = literal_as_bstr(ctx, iter->name, &name);
845 hres = compile_expression(ctx, iter->value, TRUE);
849 instr = push_instr(ctx, OP_obj_prop);
851 return E_OUTOFMEMORY;
853 instr_ptr(ctx, instr)->u.arg->bstr = name;
859 static HRESULT compile_function_expression(compiler_ctx_t *ctx, function_expression_t *expr)
861 ctx->func_tail = ctx->func_tail ? (ctx->func_tail->next = expr) : (ctx->func_head = expr);
863 /* FIXME: not exactly right */
864 if(expr->identifier) {
865 ctx->func->func_cnt++;
866 return push_instr_bstr(ctx, OP_ident, expr->identifier);
869 return push_instr_uint(ctx, OP_func, ctx->func->func_cnt++);
872 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr, BOOL emit_ret)
878 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
881 hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_z);
884 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_array);
887 hres = compile_array_literal(ctx, (array_literal_expression_t*)expr);
890 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
893 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
896 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_and);
899 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
902 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
905 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_div);
908 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mod);
911 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_or);
913 case EXPR_ASSIGNLSHIFT:
914 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_lshift);
916 case EXPR_ASSIGNRSHIFT:
917 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift);
919 case EXPR_ASSIGNRRSHIFT:
920 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
923 hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_xor);
926 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
929 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
932 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
935 return compile_call_expression(ctx, (call_expression_t*)expr, emit_ret);
937 return compile_comma_expression(ctx, (binary_expression_t*)expr, emit_ret);
939 hres = compile_conditional_expression(ctx, (conditional_expression_t*)expr);
942 hres = compile_delete_expression(ctx, (unary_expression_t*)expr);
945 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
948 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
951 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
954 hres = compile_function_expression(ctx, (function_expression_t*)expr);
957 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
960 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
963 hres = push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
966 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
968 case EXPR_INSTANCEOF:
969 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_instanceof);
972 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
975 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
978 hres = compile_literal(ctx, ((literal_expression_t*)expr)->literal);
981 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
984 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lshift);
987 hres = compile_member_expression(ctx, (member_expression_t*)expr);
990 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
993 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
996 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
999 hres = compile_new_expression(ctx, (call_expression_t*)expr);
1002 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
1005 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
1008 hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_nz);
1011 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
1014 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, -1);
1017 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, 1);
1020 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, -1);
1023 hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, 1);
1026 hres = compile_object_literal(ctx, (property_value_expression_t*)expr);
1029 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift);
1032 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
1035 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
1038 return !emit_ret || push_instr(ctx, OP_this) ? S_OK : E_OUTOFMEMORY;
1040 hres = compile_typeof_expression(ctx, (unary_expression_t*)expr);
1043 hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
1046 hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
1048 DEFAULT_UNREACHABLE;
1054 return emit_ret ? S_OK : push_instr_uint(ctx, OP_pop, 1);
1057 static inline BOOL is_loop_statement(statement_type_t type)
1059 return type == STAT_FOR || type == STAT_FORIN || type == STAT_WHILE;
1062 /* ECMA-262 3rd Edition 12.1 */
1063 static HRESULT compile_block_statement(compiler_ctx_t *ctx, statement_t *iter)
1068 hres = compile_statement(ctx, NULL, iter);
1078 /* ECMA-262 3rd Edition 12.2 */
1079 static HRESULT compile_variable_list(compiler_ctx_t *ctx, variable_declaration_t *list)
1081 variable_declaration_t *iter;
1084 assert(list != NULL);
1087 ctx->var_tail->global_next = list;
1089 ctx->var_head = list;
1091 for(iter = list; iter; iter = iter->next) {
1092 ctx->func->var_cnt++;
1093 iter->global_next = iter->next;
1095 ctx->var_tail = iter;
1100 hres = compile_expression(ctx, iter->expr, TRUE);
1104 hres = push_instr_bstr(ctx, OP_var_set, iter->identifier);
1112 /* ECMA-262 3rd Edition 12.2 */
1113 static HRESULT compile_var_statement(compiler_ctx_t *ctx, var_statement_t *stat)
1115 return compile_variable_list(ctx, stat->variable_list);
1118 /* ECMA-262 3rd Edition 12.4 */
1119 static HRESULT compile_expression_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1123 hres = compile_expression(ctx, stat->expr, ctx->from_eval);
1127 return !ctx->from_eval || push_instr(ctx, OP_setret) ? S_OK : E_OUTOFMEMORY;
1130 /* ECMA-262 3rd Edition 12.5 */
1131 static HRESULT compile_if_statement(compiler_ctx_t *ctx, if_statement_t *stat)
1136 hres = compile_expression(ctx, stat->expr, TRUE);
1140 jmp_else = push_instr(ctx, OP_jmp_z);
1142 return E_OUTOFMEMORY;
1144 hres = compile_statement(ctx, NULL, stat->if_stat);
1148 if(stat->else_stat) {
1151 jmp_end = push_instr(ctx, OP_jmp);
1153 return E_OUTOFMEMORY;
1155 set_arg_uint(ctx, jmp_else, ctx->code_off);
1157 hres = compile_statement(ctx, NULL, stat->else_stat);
1161 set_arg_uint(ctx, jmp_end, ctx->code_off);
1163 set_arg_uint(ctx, jmp_else, ctx->code_off);
1169 /* ECMA-262 3rd Edition 12.6.2 */
1170 static HRESULT compile_while_statement(compiler_ctx_t *ctx, while_statement_t *stat)
1172 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1176 stat_ctx.break_label = alloc_label(ctx);
1177 if(!stat_ctx.break_label)
1178 return E_OUTOFMEMORY;
1180 stat_ctx.continue_label = alloc_label(ctx);
1181 if(!stat_ctx.continue_label)
1182 return E_OUTOFMEMORY;
1184 jmp_off = ctx->code_off;
1186 if(!stat->do_while) {
1187 label_set_addr(ctx, stat_ctx.continue_label);
1188 hres = compile_expression(ctx, stat->expr, TRUE);
1192 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1197 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1201 if(stat->do_while) {
1202 label_set_addr(ctx, stat_ctx.continue_label);
1203 hres = compile_expression(ctx, stat->expr, TRUE);
1207 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1212 hres = push_instr_uint(ctx, OP_jmp, jmp_off);
1216 label_set_addr(ctx, stat_ctx.break_label);
1220 /* ECMA-262 3rd Edition 12.6.3 */
1221 static HRESULT compile_for_statement(compiler_ctx_t *ctx, for_statement_t *stat)
1223 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1227 if(stat->variable_list) {
1228 hres = compile_variable_list(ctx, stat->variable_list);
1231 }else if(stat->begin_expr) {
1232 hres = compile_expression(ctx, stat->begin_expr, FALSE);
1237 stat_ctx.break_label = alloc_label(ctx);
1238 if(!stat_ctx.break_label)
1239 return E_OUTOFMEMORY;
1241 stat_ctx.continue_label = alloc_label(ctx);
1242 if(!stat_ctx.continue_label)
1243 return E_OUTOFMEMORY;
1245 expr_off = ctx->code_off;
1248 hres = compile_expression(ctx, stat->expr, TRUE);
1252 hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1257 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1261 label_set_addr(ctx, stat_ctx.continue_label);
1263 if(stat->end_expr) {
1264 hres = compile_expression(ctx, stat->end_expr, FALSE);
1269 hres = push_instr_uint(ctx, OP_jmp, expr_off);
1273 label_set_addr(ctx, stat_ctx.break_label);
1277 /* ECMA-262 3rd Edition 12.6.4 */
1278 static HRESULT compile_forin_statement(compiler_ctx_t *ctx, forin_statement_t *stat)
1280 statement_ctx_t stat_ctx = {4, FALSE, FALSE};
1283 if(stat->variable) {
1284 hres = compile_variable_list(ctx, stat->variable);
1289 stat_ctx.break_label = alloc_label(ctx);
1290 if(!stat_ctx.break_label)
1291 return E_OUTOFMEMORY;
1293 stat_ctx.continue_label = alloc_label(ctx);
1294 if(!stat_ctx.continue_label)
1295 return E_OUTOFMEMORY;
1297 hres = compile_expression(ctx, stat->in_expr, TRUE);
1301 if(stat->variable) {
1302 hres = push_instr_bstr_uint(ctx, OP_identid, stat->variable->identifier, fdexNameEnsure);
1305 }else if(is_memberid_expr(stat->expr->type)) {
1306 hres = compile_memberid_expression(ctx, stat->expr, fdexNameEnsure);
1310 hres = push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
1314 /* FIXME: compile statement anyways when we depend on compiler to check errors */
1318 hres = push_instr_int(ctx, OP_int, DISPID_STARTENUM);
1322 label_set_addr(ctx, stat_ctx.continue_label);
1323 hres = push_instr_uint(ctx, OP_forin, stat_ctx.break_label);
1325 return E_OUTOFMEMORY;
1327 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1331 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.continue_label);
1335 label_set_addr(ctx, stat_ctx.break_label);
1339 static HRESULT pop_to_stat(compiler_ctx_t *ctx, BOOL var_stack, BOOL scope_stack, statement_ctx_t *stat_ctx)
1341 unsigned stack_pop = 0;
1342 statement_ctx_t *iter;
1344 for(iter = ctx->stat_ctx; iter != stat_ctx; iter = iter->next) {
1346 if(iter->using_scope && !push_instr(ctx, OP_pop_scope))
1347 return E_OUTOFMEMORY;
1348 if(iter->using_except && !push_instr(ctx, OP_pop_except))
1349 return E_OUTOFMEMORY;
1351 stack_pop += iter->stack_use;
1354 if(var_stack && stack_pop) {
1357 hres = push_instr_uint(ctx, OP_pop, stack_pop);
1365 /* ECMA-262 3rd Edition 12.7 */
1366 static HRESULT compile_continue_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1368 statement_ctx_t *pop_ctx;
1371 if(stat->identifier) {
1372 statement_t *label_stat;
1373 statement_ctx_t *iter;
1377 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1378 if(iter->continue_label)
1380 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier))
1385 WARN("Label not found\n");
1386 return JS_E_LABEL_NOT_FOUND;
1389 /* Labelled continue are allowed only on loops */
1390 for(label_stat = iter->labelled_stat->statement;
1391 label_stat->type == STAT_LABEL;
1392 label_stat = ((labelled_statement_t*)label_stat)->statement);
1393 if(!is_loop_statement(label_stat->type)) {
1394 WARN("Label is not a loop\n");
1395 return JS_E_INVALID_CONTINUE;
1398 assert(pop_ctx != NULL);
1400 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1401 if(pop_ctx->continue_label)
1406 WARN("continue outside loop\n");
1407 return JS_E_INVALID_CONTINUE;
1411 hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx);
1415 return push_instr_uint(ctx, OP_jmp, pop_ctx->continue_label);
1418 /* ECMA-262 3rd Edition 12.8 */
1419 static HRESULT compile_break_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1421 statement_ctx_t *pop_ctx;
1424 if(stat->identifier) {
1425 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1426 if(pop_ctx->labelled_stat && !strcmpW(pop_ctx->labelled_stat->identifier, stat->identifier)) {
1427 assert(pop_ctx->break_label);
1433 WARN("Label not found\n");
1434 return JS_E_LABEL_NOT_FOUND;
1437 for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1438 if(pop_ctx->break_label && !pop_ctx->labelled_stat)
1443 WARN("Break outside loop\n");
1444 return JS_E_INVALID_BREAK;
1448 hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx->next);
1452 return push_instr_uint(ctx, OP_jmp, pop_ctx->break_label);
1455 /* ECMA-262 3rd Edition 12.9 */
1456 static HRESULT compile_return_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1460 if(ctx->from_eval) {
1461 WARN("misplaced return statement\n");
1462 return JS_E_MISPLACED_RETURN;
1465 hres = pop_to_stat(ctx, TRUE, FALSE, NULL);
1470 hres = compile_expression(ctx, stat->expr, TRUE);
1473 if(!push_instr(ctx, OP_setret))
1474 return E_OUTOFMEMORY;
1477 hres = pop_to_stat(ctx, FALSE, TRUE, NULL);
1481 return push_instr(ctx, OP_ret) ? S_OK : E_OUTOFMEMORY;
1484 /* ECMA-262 3rd Edition 12.10 */
1485 static HRESULT compile_with_statement(compiler_ctx_t *ctx, with_statement_t *stat)
1487 statement_ctx_t stat_ctx = {0, TRUE, FALSE};
1490 hres = compile_expression(ctx, stat->expr, TRUE);
1494 if(!push_instr(ctx, OP_push_scope))
1495 return E_OUTOFMEMORY;
1497 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1501 if(!push_instr(ctx, OP_pop_scope))
1502 return E_OUTOFMEMORY;
1507 /* ECMA-262 3rd Edition 12.10 */
1508 static HRESULT compile_labelled_statement(compiler_ctx_t *ctx, labelled_statement_t *stat)
1510 statement_ctx_t stat_ctx = {0, FALSE, FALSE, 0, 0, stat}, *iter;
1513 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1514 if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier)) {
1515 WARN("Label %s redefined\n", debugstr_w(stat->identifier));
1516 return JS_E_LABEL_REDEFINED;
1520 /* Labelled breaks are allowed for any labelled statements, not only loops (violating spec) */
1521 stat_ctx.break_label = alloc_label(ctx);
1522 if(!stat_ctx.break_label)
1523 return E_OUTOFMEMORY;
1525 hres = compile_statement(ctx, &stat_ctx, stat->statement);
1529 label_set_addr(ctx, stat_ctx.break_label);
1533 /* ECMA-262 3rd Edition 12.13 */
1534 static HRESULT compile_switch_statement(compiler_ctx_t *ctx, switch_statement_t *stat)
1536 statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1537 unsigned case_cnt = 0, *case_jmps, i, default_jmp;
1538 BOOL have_default = FALSE;
1539 statement_t *stat_iter;
1540 case_clausule_t *iter;
1543 hres = compile_expression(ctx, stat->expr, TRUE);
1547 stat_ctx.break_label = alloc_label(ctx);
1548 if(!stat_ctx.break_label)
1549 return E_OUTOFMEMORY;
1551 for(iter = stat->case_list; iter; iter = iter->next) {
1556 case_jmps = heap_alloc(case_cnt * sizeof(*case_jmps));
1558 return E_OUTOFMEMORY;
1561 for(iter = stat->case_list; iter; iter = iter->next) {
1563 have_default = TRUE;
1567 hres = compile_expression(ctx, iter->expr, TRUE);
1571 case_jmps[i] = push_instr(ctx, OP_case);
1573 hres = E_OUTOFMEMORY;
1579 if(SUCCEEDED(hres)) {
1580 hres = push_instr_uint(ctx, OP_pop, 1);
1581 if(SUCCEEDED(hres)) {
1582 default_jmp = push_instr(ctx, OP_jmp);
1584 hres = E_OUTOFMEMORY;
1589 heap_free(case_jmps);
1594 for(iter = stat->case_list; iter; iter = iter->next) {
1595 while(iter->next && iter->next->stat == iter->stat) {
1596 set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1600 set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1602 for(stat_iter = iter->stat; stat_iter && (!iter->next || iter->next->stat != stat_iter);
1603 stat_iter = stat_iter->next) {
1604 hres = compile_statement(ctx, &stat_ctx, stat_iter);
1612 heap_free(case_jmps);
1615 assert(i == case_cnt);
1618 hres = push_instr_uint(ctx, OP_jmp, stat_ctx.break_label);
1621 set_arg_uint(ctx, default_jmp, ctx->code_off);
1624 label_set_addr(ctx, stat_ctx.break_label);
1628 /* ECMA-262 3rd Edition 12.13 */
1629 static HRESULT compile_throw_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1633 hres = compile_expression(ctx, stat->expr, TRUE);
1637 return push_instr(ctx, OP_throw) ? S_OK : E_OUTOFMEMORY;
1640 /* ECMA-262 3rd Edition 12.14 */
1641 static HRESULT compile_try_statement(compiler_ctx_t *ctx, try_statement_t *stat)
1643 statement_ctx_t try_ctx = {0, FALSE, TRUE}, catch_ctx = {0, TRUE, FALSE};
1644 statement_ctx_t finally_ctx = {2, FALSE, FALSE};
1645 unsigned push_except;
1649 push_except = push_instr(ctx, OP_push_except);
1651 return E_OUTOFMEMORY;
1653 if(stat->catch_block) {
1654 ident = compiler_alloc_bstr(ctx, stat->catch_block->identifier);
1656 return E_OUTOFMEMORY;
1661 instr_ptr(ctx, push_except)->u.arg[1].bstr = ident;
1663 if(!stat->catch_block)
1664 try_ctx.stack_use = 2;
1666 hres = compile_statement(ctx, &try_ctx, stat->try_statement);
1670 if(!push_instr(ctx, OP_pop_except))
1671 return E_OUTOFMEMORY;
1673 if(stat->catch_block) {
1674 unsigned jmp_finally;
1676 jmp_finally = push_instr(ctx, OP_jmp);
1678 return E_OUTOFMEMORY;
1680 instr_ptr(ctx, push_except)->u.arg[0].uint = ctx->code_off;
1682 hres = compile_statement(ctx, &catch_ctx, stat->catch_block->statement);
1686 if(!push_instr(ctx, OP_pop_scope))
1687 return E_OUTOFMEMORY;
1689 set_arg_uint(ctx, jmp_finally, ctx->code_off);
1691 set_arg_uint(ctx, push_except, ctx->code_off);
1694 if(stat->finally_statement) {
1695 hres = compile_statement(ctx, stat->catch_block ? NULL : &finally_ctx, stat->finally_statement);
1699 if(!stat->catch_block && !push_instr(ctx, OP_end_finally))
1700 return E_OUTOFMEMORY;
1706 static HRESULT compile_statement(compiler_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1711 stat_ctx->next = ctx->stat_ctx;
1712 ctx->stat_ctx = stat_ctx;
1715 switch(stat->type) {
1717 hres = compile_block_statement(ctx, ((block_statement_t*)stat)->stat_list);
1720 hres = compile_break_statement(ctx, (branch_statement_t*)stat);
1723 hres = compile_continue_statement(ctx, (branch_statement_t*)stat);
1730 hres = compile_expression_statement(ctx, (expression_statement_t*)stat);
1733 hres = compile_for_statement(ctx, (for_statement_t*)stat);
1736 hres = compile_forin_statement(ctx, (forin_statement_t*)stat);
1739 hres = compile_if_statement(ctx, (if_statement_t*)stat);
1742 hres = compile_labelled_statement(ctx, (labelled_statement_t*)stat);
1745 hres = compile_return_statement(ctx, (expression_statement_t*)stat);
1748 hres = compile_switch_statement(ctx, (switch_statement_t*)stat);
1751 hres = compile_throw_statement(ctx, (expression_statement_t*)stat);
1754 hres = compile_try_statement(ctx, (try_statement_t*)stat);
1757 hres = compile_var_statement(ctx, (var_statement_t*)stat);
1760 hres = compile_while_statement(ctx, (while_statement_t*)stat);
1763 hres = compile_with_statement(ctx, (with_statement_t*)stat);
1765 DEFAULT_UNREACHABLE;
1769 assert(ctx->stat_ctx == stat_ctx);
1770 ctx->stat_ctx = stat_ctx->next;
1776 static void resolve_labels(compiler_ctx_t *ctx, unsigned off)
1780 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
1781 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->u.arg->uint & LABEL_FLAG)) {
1782 assert((instr->u.arg->uint & ~LABEL_FLAG) < ctx->labels_cnt);
1783 instr->u.arg->uint = ctx->labels[instr->u.arg->uint & ~LABEL_FLAG];
1785 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
1788 ctx->labels_cnt = 0;
1791 void release_bytecode(bytecode_t *code)
1798 for(i=0; i < code->bstr_cnt; i++)
1799 SysFreeString(code->bstr_pool[i]);
1800 for(i=0; i < code->str_cnt; i++)
1801 jsstr_release(code->str_pool[i]);
1803 heap_free(code->source);
1804 heap_pool_free(&code->heap);
1805 heap_free(code->bstr_pool);
1806 heap_free(code->str_pool);
1807 heap_free(code->instrs);
1811 static HRESULT init_code(compiler_ctx_t *compiler, const WCHAR *source)
1813 compiler->code = heap_alloc_zero(sizeof(bytecode_t));
1815 return E_OUTOFMEMORY;
1817 compiler->code->ref = 1;
1818 heap_pool_init(&compiler->code->heap);
1820 compiler->code->source = heap_strdupW(source);
1821 if(!compiler->code->source) {
1822 release_bytecode(compiler->code);
1823 return E_OUTOFMEMORY;
1826 compiler->code->instrs = heap_alloc(64 * sizeof(instr_t));
1827 if(!compiler->code->instrs) {
1828 release_bytecode(compiler->code);
1829 return E_OUTOFMEMORY;
1832 compiler->code_size = 64;
1833 compiler->code_off = 1;
1837 static HRESULT compile_function(compiler_ctx_t *ctx, source_elements_t *source, function_expression_t *func_expr,
1838 BOOL from_eval, function_code_t *func)
1840 variable_declaration_t *var_iter;
1841 function_expression_t *iter;
1847 ctx->var_head = ctx->var_tail = NULL;
1848 ctx->func_head = ctx->func_tail = NULL;
1849 ctx->from_eval = from_eval;
1851 off = ctx->code_off;
1853 hres = compile_block_statement(ctx, source->statement);
1857 resolve_labels(ctx, off);
1859 if(!push_instr(ctx, OP_ret))
1860 return E_OUTOFMEMORY;
1862 if(TRACE_ON(jscript_disas))
1863 dump_code(ctx, off);
1865 func->instr_off = off;
1867 if(func_expr && func_expr->identifier) {
1868 func->name = compiler_alloc_bstr(ctx, func_expr->identifier);
1870 return E_OUTOFMEMORY;
1874 parameter_t *param_iter;
1876 func->source = func_expr->src_str;
1877 func->source_len = func_expr->src_len;
1879 for(param_iter = func_expr->parameter_list; param_iter; param_iter = param_iter->next)
1882 func->params = compiler_alloc(ctx->code, func->param_cnt * sizeof(*func->params));
1884 return E_OUTOFMEMORY;
1886 for(param_iter = func_expr->parameter_list, i=0; param_iter; param_iter = param_iter->next, i++) {
1887 func->params[i] = compiler_alloc_bstr(ctx, param_iter->identifier);
1888 if(!func->params[i])
1889 return E_OUTOFMEMORY;
1893 func->variables = compiler_alloc(ctx->code, func->var_cnt * sizeof(*func->variables));
1894 if(!func->variables)
1895 return E_OUTOFMEMORY;
1897 for(var_iter = ctx->var_head, i=0; var_iter; var_iter = var_iter->global_next, i++) {
1898 func->variables[i] = compiler_alloc_bstr(ctx, var_iter->identifier);
1899 if(!func->variables[i])
1900 return E_OUTOFMEMORY;
1903 assert(i == func->var_cnt);
1905 func->funcs = compiler_alloc(ctx->code, func->func_cnt * sizeof(*func->funcs));
1907 return E_OUTOFMEMORY;
1908 memset(func->funcs, 0, func->func_cnt * sizeof(*func->funcs));
1910 for(iter = ctx->func_head, i=0; iter; iter = iter->next, i++) {
1911 hres = compile_function(ctx, iter->source_elements, iter, FALSE, func->funcs+i);
1916 assert(i == func->func_cnt);
1921 static HRESULT parse_arguments(compiler_ctx_t *ctx, const WCHAR *args, BSTR *arg_array, unsigned *args_size)
1923 const WCHAR *ptr = args, *ptr2;
1924 unsigned arg_cnt = 0;
1926 while(isspaceW(*ptr))
1935 if(!isalphaW(*ptr) && *ptr != '_') {
1936 FIXME("expected alpha or '_': %s\n", debugstr_w(ptr));
1941 while(isalnumW(*ptr) || *ptr == '_')
1944 if(*ptr && *ptr != ',' && !isspaceW(*ptr)) {
1945 FIXME("unexpected har %s\n", debugstr_w(ptr));
1950 arg_array[arg_cnt] = compiler_alloc_bstr_len(ctx, ptr2, ptr-ptr2);
1951 if(!arg_array[arg_cnt])
1952 return E_OUTOFMEMORY;
1956 while(isspaceW(*ptr))
1961 FIXME("expected ',': %s\n", debugstr_w(ptr));
1966 while(isspaceW(*ptr))
1971 *args_size = arg_cnt;
1975 static HRESULT compile_arguments(compiler_ctx_t *ctx, const WCHAR *args)
1979 hres = parse_arguments(ctx, args, NULL, &ctx->code->global_code.param_cnt);
1983 ctx->code->global_code.params = compiler_alloc(ctx->code,
1984 ctx->code->global_code.param_cnt * sizeof(*ctx->code->global_code.params));
1985 if(!ctx->code->global_code.params)
1986 return E_OUTOFMEMORY;
1988 return parse_arguments(ctx, args, ctx->code->global_code.params, NULL);
1991 HRESULT compile_script(script_ctx_t *ctx, const WCHAR *code, const WCHAR *args, const WCHAR *delimiter,
1992 BOOL from_eval, BOOL use_decode, bytecode_t **ret)
1994 compiler_ctx_t compiler = {0};
1997 hres = init_code(&compiler, code);
2002 hres = compile_arguments(&compiler, args);
2008 hres = decode_source(compiler.code->source);
2010 WARN("Decoding failed\n");
2015 hres = script_parse(ctx, compiler.code->source, delimiter, from_eval, &compiler.parser);
2017 release_bytecode(compiler.code);
2021 hres = compile_function(&compiler, compiler.parser->source, NULL, from_eval, &compiler.code->global_code);
2022 parser_release(compiler.parser);
2024 release_bytecode(compiler.code);
2028 *ret = compiler.code;