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
23 #include "parser.tab.h"
25 #include "wine/debug.h"
27 WINE_DEFAULT_DEBUG_CHANNEL(vbscript);
28 WINE_DECLARE_DEBUG_CHANNEL(vbscript_disas);
30 typedef struct _statement_ctx_t {
33 unsigned while_end_label;
34 unsigned for_end_label;
36 struct _statement_ctx_t *next;
46 statement_ctx_t *stat_ctx;
52 unsigned sub_end_label;
53 unsigned func_end_label;
54 unsigned prop_end_label;
56 dim_decl_t *dim_decls;
57 dynamic_var_t *global_vars;
59 const_decl_t *const_decls;
60 const_decl_t *global_consts;
64 function_decl_t *func_decls;
66 class_desc_t *classes;
69 static HRESULT compile_expression(compile_ctx_t*,expression_t*);
70 static HRESULT compile_statement(compile_ctx_t*,statement_ctx_t*,statement_t*);
74 instr_arg_type_t arg1_type;
75 instr_arg_type_t arg2_type;
77 #define X(n,a,b,c) {#n,b,c},
82 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
87 TRACE_(vbscript_disas)("\t%s", debugstr_w(arg->str));
90 TRACE_(vbscript_disas)("\t%d", arg->uint);
94 TRACE_(vbscript_disas)("\t%u", arg->uint);
97 TRACE_(vbscript_disas)("\t%lf", *arg->dbl);
106 static void dump_code(compile_ctx_t *ctx)
110 for(instr = ctx->code->instrs+1; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
111 assert(instr->op < OP_LAST);
112 TRACE_(vbscript_disas)("%d:\t%s", (int)(instr-ctx->code->instrs), instr_info[instr->op].op_str);
113 dump_instr_arg(instr_info[instr->op].arg1_type, &instr->arg1);
114 dump_instr_arg(instr_info[instr->op].arg2_type, &instr->arg2);
115 TRACE_(vbscript_disas)("\n");
119 static inline void *compiler_alloc(vbscode_t *vbscode, size_t size)
121 return vbsheap_alloc(&vbscode->heap, size);
124 static inline void *compiler_alloc_zero(vbscode_t *vbscode, size_t size)
128 ret = vbsheap_alloc(&vbscode->heap, size);
130 memset(ret, 0, size);
134 static WCHAR *compiler_alloc_string(vbscode_t *vbscode, const WCHAR *str)
139 size = (strlenW(str)+1)*sizeof(WCHAR);
140 ret = compiler_alloc(vbscode, size);
142 memcpy(ret, str, size);
146 static inline instr_t *instr_ptr(compile_ctx_t *ctx, unsigned id)
148 assert(id < ctx->instr_cnt);
149 return ctx->code->instrs + id;
152 static unsigned push_instr(compile_ctx_t *ctx, vbsop_t op)
154 assert(ctx->instr_size && ctx->instr_size >= ctx->instr_cnt);
156 if(ctx->instr_size == ctx->instr_cnt) {
159 new_instr = heap_realloc(ctx->code->instrs, ctx->instr_size*2*sizeof(instr_t));
163 ctx->code->instrs = new_instr;
164 ctx->instr_size *= 2;
167 ctx->code->instrs[ctx->instr_cnt].op = op;
168 return ctx->instr_cnt++;
171 static HRESULT push_instr_int(compile_ctx_t *ctx, vbsop_t op, LONG arg)
175 ret = push_instr(ctx, op);
177 return E_OUTOFMEMORY;
179 instr_ptr(ctx, ret)->arg1.lng = arg;
183 static HRESULT push_instr_uint(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
187 ret = push_instr(ctx, op);
189 return E_OUTOFMEMORY;
191 instr_ptr(ctx, ret)->arg1.uint = arg;
195 static HRESULT push_instr_addr(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
199 ret = push_instr(ctx, op);
201 return E_OUTOFMEMORY;
203 instr_ptr(ctx, ret)->arg1.uint = arg;
207 static HRESULT push_instr_str(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
212 str = compiler_alloc_string(ctx->code, arg);
214 return E_OUTOFMEMORY;
216 instr = push_instr(ctx, op);
218 return E_OUTOFMEMORY;
220 instr_ptr(ctx, instr)->arg1.str = str;
224 static HRESULT push_instr_double(compile_ctx_t *ctx, vbsop_t op, double arg)
229 d = compiler_alloc(ctx->code, sizeof(double));
231 return E_OUTOFMEMORY;
233 instr = push_instr(ctx, op);
235 return E_OUTOFMEMORY;
238 instr_ptr(ctx, instr)->arg1.dbl = d;
242 static BSTR alloc_bstr_arg(compile_ctx_t *ctx, const WCHAR *str)
244 if(!ctx->code->bstr_pool_size) {
245 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
246 if(!ctx->code->bstr_pool)
248 ctx->code->bstr_pool_size = 8;
249 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
252 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
256 ctx->code->bstr_pool = new_pool;
257 ctx->code->bstr_pool_size *= 2;
260 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
261 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
264 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
267 static HRESULT push_instr_bstr(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
272 bstr = alloc_bstr_arg(ctx, arg);
274 return E_OUTOFMEMORY;
276 instr = push_instr(ctx, op);
278 return E_OUTOFMEMORY;
280 instr_ptr(ctx, instr)->arg1.bstr = bstr;
284 static HRESULT push_instr_bstr_uint(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg1, unsigned arg2)
289 bstr = alloc_bstr_arg(ctx, arg1);
291 return E_OUTOFMEMORY;
293 instr = push_instr(ctx, op);
295 return E_OUTOFMEMORY;
297 instr_ptr(ctx, instr)->arg1.bstr = bstr;
298 instr_ptr(ctx, instr)->arg2.uint = arg2;
302 static HRESULT push_instr_uint_bstr(compile_ctx_t *ctx, vbsop_t op, unsigned arg1, const WCHAR *arg2)
307 bstr = alloc_bstr_arg(ctx, arg2);
309 return E_OUTOFMEMORY;
311 instr = push_instr(ctx, op);
313 return E_OUTOFMEMORY;
315 instr_ptr(ctx, instr)->arg1.uint = arg1;
316 instr_ptr(ctx, instr)->arg2.bstr = bstr;
320 #define LABEL_FLAG 0x80000000
322 static unsigned alloc_label(compile_ctx_t *ctx)
324 if(!ctx->labels_size) {
325 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
328 ctx->labels_size = 8;
329 }else if(ctx->labels_size == ctx->labels_cnt) {
330 unsigned *new_labels;
332 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
336 ctx->labels = new_labels;
337 ctx->labels_size *= 2;
340 return ctx->labels_cnt++ | LABEL_FLAG;
343 static inline void label_set_addr(compile_ctx_t *ctx, unsigned label)
345 assert(label & LABEL_FLAG);
346 ctx->labels[label & ~LABEL_FLAG] = ctx->instr_cnt;
349 static expression_t *lookup_const_decls(compile_ctx_t *ctx, const WCHAR *name, BOOL lookup_global)
353 for(decl = ctx->const_decls; decl; decl = decl->next) {
354 if(!strcmpiW(decl->name, name))
355 return decl->value_expr;
361 for(decl = ctx->global_consts; decl; decl = decl->next) {
362 if(!strcmpiW(decl->name, name))
363 return decl->value_expr;
369 static HRESULT compile_args(compile_ctx_t *ctx, expression_t *args, unsigned *ret)
371 unsigned arg_cnt = 0;
375 hres = compile_expression(ctx, args);
387 static HRESULT compile_member_expression(compile_ctx_t *ctx, member_expression_t *expr, BOOL ret_val)
389 unsigned arg_cnt = 0;
392 if(ret_val && !expr->args) {
393 expression_t *const_expr;
395 const_expr = lookup_const_decls(ctx, expr->identifier, TRUE);
397 return compile_expression(ctx, const_expr);
400 hres = compile_args(ctx, expr->args, &arg_cnt);
405 hres = compile_expression(ctx, expr->obj_expr);
409 hres = push_instr_bstr_uint(ctx, ret_val ? OP_mcall : OP_mcallv, expr->identifier, arg_cnt);
411 hres = push_instr_bstr_uint(ctx, ret_val ? OP_icall : OP_icallv, expr->identifier, arg_cnt);
417 static HRESULT compile_unary_expression(compile_ctx_t *ctx, unary_expression_t *expr, vbsop_t op)
421 hres = compile_expression(ctx, expr->subexpr);
425 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
428 static HRESULT compile_binary_expression(compile_ctx_t *ctx, binary_expression_t *expr, vbsop_t op)
432 hres = compile_expression(ctx, expr->left);
436 hres = compile_expression(ctx, expr->right);
440 return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
443 static HRESULT compile_expression(compile_ctx_t *ctx, expression_t *expr)
447 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
449 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
451 return push_instr_int(ctx, OP_bool, ((bool_expression_t*)expr)->value);
453 return compile_expression(ctx, ((unary_expression_t*)expr)->subexpr);
455 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_concat);
457 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
459 return push_instr_double(ctx, OP_double, ((double_expression_t*)expr)->value);
461 return push_instr(ctx, OP_empty) ? S_OK : E_OUTOFMEMORY;
463 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_equal);
465 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eqv);
467 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_exp);
469 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
471 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
473 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_idiv);
475 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_is);
477 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_imp);
479 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
481 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
483 return push_instr(ctx, OP_me) ? S_OK : E_OUTOFMEMORY;
485 return compile_member_expression(ctx, (member_expression_t*)expr, TRUE);
487 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
489 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
491 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
493 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_nequal);
495 return push_instr_str(ctx, OP_new, ((string_expression_t*)expr)->value);
497 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_not);
499 return push_instr(ctx, OP_nothing) ? S_OK : E_OUTOFMEMORY;
501 return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
503 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
505 return push_instr_str(ctx, OP_string, ((string_expression_t*)expr)->value);
507 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
509 return push_instr_int(ctx, OP_short, ((int_expression_t*)expr)->value);
511 return push_instr_int(ctx, OP_long, ((int_expression_t*)expr)->value);
513 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
515 FIXME("Unimplemented expression type %d\n", expr->type);
522 static HRESULT compile_if_statement(compile_ctx_t *ctx, if_statement_t *stat)
524 unsigned cnd_jmp, endif_label = 0;
525 elseif_decl_t *elseif_decl;
528 hres = compile_expression(ctx, stat->expr);
532 cnd_jmp = push_instr(ctx, OP_jmp_false);
534 return E_OUTOFMEMORY;
536 hres = compile_statement(ctx, NULL, stat->if_stat);
540 if(stat->else_stat || stat->elseifs) {
541 endif_label = alloc_label(ctx);
543 return E_OUTOFMEMORY;
545 hres = push_instr_addr(ctx, OP_jmp, endif_label);
550 for(elseif_decl = stat->elseifs; elseif_decl; elseif_decl = elseif_decl->next) {
551 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
553 hres = compile_expression(ctx, elseif_decl->expr);
557 cnd_jmp = push_instr(ctx, OP_jmp_false);
559 return E_OUTOFMEMORY;
561 hres = compile_statement(ctx, NULL, elseif_decl->stat);
565 hres = push_instr_addr(ctx, OP_jmp, endif_label);
570 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
572 if(stat->else_stat) {
573 hres = compile_statement(ctx, NULL, stat->else_stat);
579 label_set_addr(ctx, endif_label);
583 static HRESULT compile_while_statement(compile_ctx_t *ctx, while_statement_t *stat)
585 statement_ctx_t stat_ctx = {0}, *loop_ctx;
590 start_addr = ctx->instr_cnt;
592 hres = compile_expression(ctx, stat->expr);
596 jmp_end = push_instr(ctx, stat->stat.type == STAT_UNTIL ? OP_jmp_true : OP_jmp_false);
598 return E_OUTOFMEMORY;
600 if(stat->stat.type == STAT_WHILE) {
603 if(!(stat_ctx.while_end_label = alloc_label(ctx)))
604 return E_OUTOFMEMORY;
605 loop_ctx = &stat_ctx;
608 hres = compile_statement(ctx, loop_ctx, stat->body);
612 hres = push_instr_addr(ctx, OP_jmp, start_addr);
616 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->instr_cnt;
619 label_set_addr(ctx, stat_ctx.while_end_label);
624 static HRESULT compile_dowhile_statement(compile_ctx_t *ctx, while_statement_t *stat)
626 statement_ctx_t loop_ctx = {0};
631 start_addr = ctx->instr_cnt;
633 if(!(loop_ctx.while_end_label = alloc_label(ctx)))
634 return E_OUTOFMEMORY;
636 hres = compile_statement(ctx, &loop_ctx, stat->body);
641 hres = compile_expression(ctx, stat->expr);
645 jmp_op = stat->stat.type == STAT_DOUNTIL ? OP_jmp_false : OP_jmp_true;
650 hres = push_instr_addr(ctx, jmp_op, start_addr);
654 label_set_addr(ctx, loop_ctx.while_end_label);
658 static HRESULT compile_foreach_statement(compile_ctx_t *ctx, foreach_statement_t *stat)
660 statement_ctx_t loop_ctx = {1};
664 hres = compile_expression(ctx, stat->group_expr);
668 if(!push_instr(ctx, OP_newenum))
669 return E_OUTOFMEMORY;
671 loop_start = ctx->instr_cnt;
672 if(!(loop_ctx.for_end_label = alloc_label(ctx)))
673 return E_OUTOFMEMORY;
675 hres = push_instr_uint_bstr(ctx, OP_enumnext, loop_ctx.for_end_label, stat->identifier);
679 hres = compile_statement(ctx, &loop_ctx, stat->body);
683 hres = push_instr_addr(ctx, OP_jmp, loop_start);
687 label_set_addr(ctx, loop_ctx.for_end_label);
691 static HRESULT compile_forto_statement(compile_ctx_t *ctx, forto_statement_t *stat)
693 statement_ctx_t loop_ctx = {2};
694 unsigned step_instr, instr;
698 identifier = alloc_bstr_arg(ctx, stat->identifier);
700 return E_OUTOFMEMORY;
702 hres = compile_expression(ctx, stat->from_expr);
706 instr = push_instr(ctx, OP_assign_ident);
708 return E_OUTOFMEMORY;
709 instr_ptr(ctx, instr)->arg1.bstr = identifier;
710 instr_ptr(ctx, instr)->arg2.uint = 0;
712 hres = compile_expression(ctx, stat->to_expr);
716 if(!push_instr(ctx, OP_val))
717 return E_OUTOFMEMORY;
719 if(stat->step_expr) {
720 hres = compile_expression(ctx, stat->step_expr);
724 if(!push_instr(ctx, OP_val))
725 return E_OUTOFMEMORY;
727 hres = push_instr_int(ctx, OP_short, 1);
732 loop_ctx.for_end_label = alloc_label(ctx);
733 if(!loop_ctx.for_end_label)
734 return E_OUTOFMEMORY;
736 step_instr = push_instr(ctx, OP_step);
738 return E_OUTOFMEMORY;
739 instr_ptr(ctx, step_instr)->arg2.bstr = identifier;
740 instr_ptr(ctx, step_instr)->arg1.uint = loop_ctx.for_end_label;
742 hres = compile_statement(ctx, &loop_ctx, stat->body);
746 instr = push_instr(ctx, OP_incc);
748 return E_OUTOFMEMORY;
749 instr_ptr(ctx, instr)->arg1.bstr = identifier;
751 hres = push_instr_addr(ctx, OP_jmp, step_instr);
755 hres = push_instr_uint(ctx, OP_pop, 2);
759 label_set_addr(ctx, loop_ctx.for_end_label);
763 static HRESULT compile_select_statement(compile_ctx_t *ctx, select_statement_t *stat)
765 unsigned end_label, case_cnt = 0, *case_labels = NULL, i;
766 case_clausule_t *case_iter;
767 expression_t *expr_iter;
770 hres = compile_expression(ctx, stat->expr);
774 if(!push_instr(ctx, OP_val))
775 return E_OUTOFMEMORY;
777 end_label = alloc_label(ctx);
779 return E_OUTOFMEMORY;
781 for(case_iter = stat->case_clausules; case_iter; case_iter = case_iter->next)
785 case_labels = heap_alloc(case_cnt*sizeof(*case_labels));
787 return E_OUTOFMEMORY;
790 for(case_iter = stat->case_clausules, i=0; case_iter; case_iter = case_iter->next, i++) {
791 case_labels[i] = alloc_label(ctx);
792 if(!case_labels[i]) {
793 hres = E_OUTOFMEMORY;
800 for(expr_iter = case_iter->expr; expr_iter; expr_iter = expr_iter->next) {
801 hres = compile_expression(ctx, expr_iter);
805 hres = push_instr_addr(ctx, OP_case, case_labels[i]);
812 heap_free(case_labels);
816 hres = push_instr_uint(ctx, OP_pop, 1);
818 heap_free(case_labels);
822 hres = push_instr_addr(ctx, OP_jmp, case_iter ? case_labels[i] : end_label);
824 heap_free(case_labels);
828 for(case_iter = stat->case_clausules, i=0; case_iter; case_iter = case_iter->next, i++) {
829 label_set_addr(ctx, case_labels[i]);
830 hres = compile_statement(ctx, NULL, case_iter->stat);
837 hres = push_instr_addr(ctx, OP_jmp, end_label);
842 heap_free(case_labels);
846 label_set_addr(ctx, end_label);
850 static HRESULT compile_assignment(compile_ctx_t *ctx, member_expression_t *member_expr, expression_t *value_expr, BOOL is_set)
856 if(member_expr->obj_expr) {
857 hres = compile_expression(ctx, member_expr->obj_expr);
861 op = is_set ? OP_set_member : OP_assign_member;
863 op = is_set ? OP_set_ident : OP_assign_ident;
866 hres = compile_expression(ctx, value_expr);
870 hres = compile_args(ctx, member_expr->args, &args_cnt);
874 return push_instr_bstr_uint(ctx, op, member_expr->identifier, args_cnt);
877 static HRESULT compile_assign_statement(compile_ctx_t *ctx, assign_statement_t *stat, BOOL is_set)
879 return compile_assignment(ctx, stat->member_expr, stat->value_expr, is_set);
882 static HRESULT compile_call_statement(compile_ctx_t *ctx, call_statement_t *stat)
884 /* It's challenging for parser to distinguish parameterized assignment with one argument from call
885 * with equality expression argument, so we do it in compiler. */
886 if(!stat->is_strict && stat->expr->args && !stat->expr->args->next && stat->expr->args->type == EXPR_EQUAL) {
887 binary_expression_t *eqexpr = (binary_expression_t*)stat->expr->args;
889 if(eqexpr->left->type == EXPR_BRACKETS) {
890 member_expression_t new_member = *stat->expr;
892 WARN("converting call expr to assign expr\n");
894 new_member.args = ((unary_expression_t*)eqexpr->left)->subexpr;
895 return compile_assignment(ctx, &new_member, eqexpr->right, FALSE);
899 return compile_member_expression(ctx, stat->expr, FALSE);
902 static BOOL lookup_dim_decls(compile_ctx_t *ctx, const WCHAR *name)
904 dim_decl_t *dim_decl;
906 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
907 if(!strcmpiW(dim_decl->name, name))
914 static BOOL lookup_args_name(compile_ctx_t *ctx, const WCHAR *name)
918 for(i = 0; i < ctx->func->arg_cnt; i++) {
919 if(!strcmpiW(ctx->func->args[i].name, name))
926 static HRESULT compile_dim_statement(compile_ctx_t *ctx, dim_statement_t *stat)
928 dim_decl_t *dim_decl = stat->dim_decls;
931 if(lookup_dim_decls(ctx, dim_decl->name) || lookup_args_name(ctx, dim_decl->name)
932 || lookup_const_decls(ctx, dim_decl->name, FALSE)) {
933 FIXME("dim %s name redefined\n", debugstr_w(dim_decl->name));
937 ctx->func->var_cnt++;
940 dim_decl = dim_decl->next;
943 dim_decl->next = ctx->dim_decls;
944 ctx->dim_decls = stat->dim_decls;
948 static HRESULT compile_const_statement(compile_ctx_t *ctx, const_statement_t *stat)
950 const_decl_t *decl, *next_decl = stat->decls;
955 if(lookup_const_decls(ctx, decl->name, FALSE) || lookup_args_name(ctx, decl->name)
956 || lookup_dim_decls(ctx, decl->name)) {
957 FIXME("%s redefined\n", debugstr_w(decl->name));
961 if(ctx->func->type == FUNC_GLOBAL) {
964 hres = compile_expression(ctx, decl->value_expr);
968 hres = push_instr_bstr(ctx, OP_const, decl->name);
973 next_decl = decl->next;
974 decl->next = ctx->const_decls;
975 ctx->const_decls = decl;
981 static HRESULT compile_function_statement(compile_ctx_t *ctx, function_statement_t *stat)
983 if(ctx->func != &ctx->code->main_code) {
984 FIXME("Function is not in the global code\n");
988 stat->func_decl->next = ctx->func_decls;
989 ctx->func_decls = stat->func_decl;
993 static HRESULT compile_exitdo_statement(compile_ctx_t *ctx)
995 statement_ctx_t *iter;
996 unsigned pop_cnt = 0;
998 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
999 pop_cnt += iter->stack_use;
1000 if(iter->while_end_label)
1004 FIXME("Exit Do outside Do Loop\n");
1011 hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1016 return push_instr_addr(ctx, OP_jmp, iter->while_end_label);
1019 static HRESULT compile_exitfor_statement(compile_ctx_t *ctx)
1021 statement_ctx_t *iter;
1022 unsigned pop_cnt = 0;
1024 for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1025 pop_cnt += iter->stack_use;
1026 if(iter->for_end_label)
1030 FIXME("Exit For outside For loop\n");
1037 hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1042 return push_instr_addr(ctx, OP_jmp, iter->for_end_label);
1045 static HRESULT exit_label(compile_ctx_t *ctx, unsigned jmp_label)
1047 statement_ctx_t *iter;
1048 unsigned pop_cnt = 0;
1050 for(iter = ctx->stat_ctx; iter; iter = iter->next)
1051 pop_cnt += iter->stack_use;
1056 hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1061 return push_instr_addr(ctx, OP_jmp, jmp_label);
1064 static HRESULT compile_exitsub_statement(compile_ctx_t *ctx)
1066 if(!ctx->sub_end_label) {
1067 FIXME("Exit Sub outside Sub?\n");
1071 return exit_label(ctx, ctx->sub_end_label);
1074 static HRESULT compile_exitfunc_statement(compile_ctx_t *ctx)
1076 if(!ctx->func_end_label) {
1077 FIXME("Exit Function outside Function?\n");
1081 return exit_label(ctx, ctx->func_end_label);
1084 static HRESULT compile_exitprop_statement(compile_ctx_t *ctx)
1086 if(!ctx->prop_end_label) {
1087 FIXME("Exit Property outside Property?\n");
1091 return exit_label(ctx, ctx->prop_end_label);
1094 static HRESULT compile_onerror_statement(compile_ctx_t *ctx, onerror_statement_t *stat)
1096 return push_instr_int(ctx, OP_errmode, stat->resume_next);
1099 static HRESULT compile_statement(compile_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1104 stat_ctx->next = ctx->stat_ctx;
1105 ctx->stat_ctx = stat_ctx;
1109 switch(stat->type) {
1111 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, FALSE);
1114 hres = compile_call_statement(ctx, (call_statement_t*)stat);
1117 hres = compile_const_statement(ctx, (const_statement_t*)stat);
1120 hres = compile_dim_statement(ctx, (dim_statement_t*)stat);
1124 hres = compile_dowhile_statement(ctx, (while_statement_t*)stat);
1127 hres = compile_exitdo_statement(ctx);
1130 hres = compile_exitfor_statement(ctx);
1133 hres = compile_exitfunc_statement(ctx);
1136 hres = compile_exitprop_statement(ctx);
1139 hres = compile_exitsub_statement(ctx);
1142 hres = compile_foreach_statement(ctx, (foreach_statement_t*)stat);
1145 hres = compile_forto_statement(ctx, (forto_statement_t*)stat);
1148 hres = compile_function_statement(ctx, (function_statement_t*)stat);
1151 hres = compile_if_statement(ctx, (if_statement_t*)stat);
1154 hres = compile_onerror_statement(ctx, (onerror_statement_t*)stat);
1157 hres = compile_select_statement(ctx, (select_statement_t*)stat);
1160 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, TRUE);
1163 hres = push_instr(ctx, OP_stop) ? S_OK : E_OUTOFMEMORY;
1167 case STAT_WHILELOOP:
1168 hres = compile_while_statement(ctx, (while_statement_t*)stat);
1171 FIXME("Unimplemented statement type %d\n", stat->type);
1181 assert(ctx->stat_ctx == stat_ctx);
1182 ctx->stat_ctx = stat_ctx->next;
1188 static void resolve_labels(compile_ctx_t *ctx, unsigned off)
1192 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
1193 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->arg1.uint & LABEL_FLAG)) {
1194 assert((instr->arg1.uint & ~LABEL_FLAG) < ctx->labels_cnt);
1195 instr->arg1.uint = ctx->labels[instr->arg1.uint & ~LABEL_FLAG];
1197 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
1200 ctx->labels_cnt = 0;
1203 static HRESULT compile_func(compile_ctx_t *ctx, statement_t *stat, function_t *func)
1207 func->code_off = ctx->instr_cnt;
1209 ctx->sub_end_label = 0;
1210 ctx->func_end_label = 0;
1211 ctx->prop_end_label = 0;
1213 switch(func->type) {
1215 ctx->func_end_label = alloc_label(ctx);
1216 if(!ctx->func_end_label)
1217 return E_OUTOFMEMORY;
1220 ctx->sub_end_label = alloc_label(ctx);
1221 if(!ctx->sub_end_label)
1222 return E_OUTOFMEMORY;
1228 ctx->prop_end_label = alloc_label(ctx);
1229 if(!ctx->prop_end_label)
1230 return E_OUTOFMEMORY;
1237 ctx->dim_decls = NULL;
1238 ctx->const_decls = NULL;
1239 hres = compile_statement(ctx, NULL, stat);
1244 if(ctx->sub_end_label)
1245 label_set_addr(ctx, ctx->sub_end_label);
1246 if(ctx->func_end_label)
1247 label_set_addr(ctx, ctx->func_end_label);
1248 if(ctx->prop_end_label)
1249 label_set_addr(ctx, ctx->prop_end_label);
1251 if(!push_instr(ctx, OP_ret))
1252 return E_OUTOFMEMORY;
1254 resolve_labels(ctx, func->code_off);
1257 dim_decl_t *dim_decl;
1259 if(func->type == FUNC_GLOBAL) {
1260 dynamic_var_t *new_var;
1264 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
1265 new_var = compiler_alloc(ctx->code, sizeof(*new_var));
1267 return E_OUTOFMEMORY;
1269 new_var->name = compiler_alloc_string(ctx->code, dim_decl->name);
1271 return E_OUTOFMEMORY;
1273 V_VT(&new_var->v) = VT_EMPTY;
1274 new_var->is_const = FALSE;
1276 new_var->next = ctx->global_vars;
1277 ctx->global_vars = new_var;
1282 func->vars = compiler_alloc(ctx->code, func->var_cnt * sizeof(var_desc_t));
1284 return E_OUTOFMEMORY;
1286 for(dim_decl = ctx->dim_decls, i=0; dim_decl; dim_decl = dim_decl->next, i++) {
1287 func->vars[i].name = compiler_alloc_string(ctx->code, dim_decl->name);
1288 if(!func->vars[i].name)
1289 return E_OUTOFMEMORY;
1292 assert(i == func->var_cnt);
1299 static BOOL lookup_funcs_name(compile_ctx_t *ctx, const WCHAR *name)
1303 for(iter = ctx->funcs; iter; iter = iter->next) {
1304 if(!strcmpiW(iter->name, name))
1311 static HRESULT create_function(compile_ctx_t *ctx, function_decl_t *decl, function_t **ret)
1316 if(lookup_dim_decls(ctx, decl->name) || lookup_funcs_name(ctx, decl->name) || lookup_const_decls(ctx, decl->name, FALSE)) {
1317 FIXME("%s: redefinition\n", debugstr_w(decl->name));
1321 func = compiler_alloc(ctx->code, sizeof(*func));
1323 return E_OUTOFMEMORY;
1325 func->name = compiler_alloc_string(ctx->code, decl->name);
1327 return E_OUTOFMEMORY;
1331 func->code_ctx = ctx->code;
1332 func->type = decl->type;
1333 func->is_public = decl->is_public;
1340 for(arg = decl->args; arg; arg = arg->next)
1343 func->args = compiler_alloc(ctx->code, func->arg_cnt * sizeof(arg_desc_t));
1345 return E_OUTOFMEMORY;
1347 for(i = 0, arg = decl->args; arg; arg = arg->next, i++) {
1348 func->args[i].name = compiler_alloc_string(ctx->code, arg->name);
1349 if(!func->args[i].name)
1350 return E_OUTOFMEMORY;
1351 func->args[i].by_ref = arg->by_ref;
1357 hres = compile_func(ctx, decl->body, func);
1365 static BOOL lookup_class_name(compile_ctx_t *ctx, const WCHAR *name)
1369 for(iter = ctx->classes; iter; iter = iter->next) {
1370 if(!strcmpiW(iter->name, name))
1377 static HRESULT create_class_funcprop(compile_ctx_t *ctx, function_decl_t *func_decl, vbdisp_funcprop_desc_t *desc)
1379 vbdisp_invoke_type_t invoke_type;
1380 function_decl_t *funcprop_decl;
1383 desc->name = compiler_alloc_string(ctx->code, func_decl->name);
1385 return E_OUTOFMEMORY;
1387 for(funcprop_decl = func_decl; funcprop_decl; funcprop_decl = funcprop_decl->next_prop_func) {
1388 switch(funcprop_decl->type) {
1393 invoke_type = VBDISP_CALLGET;
1396 invoke_type = VBDISP_LET;
1399 invoke_type = VBDISP_SET;
1405 assert(!desc->entries[invoke_type]);
1407 if(funcprop_decl->is_public)
1408 desc->is_public = TRUE;
1410 hres = create_function(ctx, funcprop_decl, desc->entries+invoke_type);
1418 static BOOL lookup_class_funcs(class_desc_t *class_desc, const WCHAR *name)
1422 for(i=0; i < class_desc->func_cnt; i++) {
1423 if(class_desc->funcs[i].name && !strcmpiW(class_desc->funcs[i].name, name))
1430 static HRESULT compile_class(compile_ctx_t *ctx, class_decl_t *class_decl)
1432 function_decl_t *func_decl, *func_prop_decl;
1433 class_prop_decl_t *prop_decl;
1434 class_desc_t *class_desc;
1438 static const WCHAR class_initializeW[] = {'c','l','a','s','s','_','i','n','i','t','i','a','l','i','z','e',0};
1439 static const WCHAR class_terminateW[] = {'c','l','a','s','s','_','t','e','r','m','i','n','a','t','e',0};
1441 if(lookup_dim_decls(ctx, class_decl->name) || lookup_funcs_name(ctx, class_decl->name)
1442 || lookup_const_decls(ctx, class_decl->name, FALSE) || lookup_class_name(ctx, class_decl->name)) {
1443 FIXME("%s: redefinition\n", debugstr_w(class_decl->name));
1447 class_desc = compiler_alloc_zero(ctx->code, sizeof(*class_desc));
1449 return E_OUTOFMEMORY;
1451 class_desc->name = compiler_alloc_string(ctx->code, class_decl->name);
1452 if(!class_desc->name)
1453 return E_OUTOFMEMORY;
1455 class_desc->func_cnt = 1; /* always allocate slot for default getter */
1457 for(func_decl = class_decl->funcs; func_decl; func_decl = func_decl->next) {
1458 for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
1459 if(func_prop_decl->type == FUNC_DEFGET)
1463 class_desc->func_cnt++;
1466 class_desc->funcs = compiler_alloc(ctx->code, class_desc->func_cnt*sizeof(*class_desc->funcs));
1467 if(!class_desc->funcs)
1468 return E_OUTOFMEMORY;
1469 memset(class_desc->funcs, 0, class_desc->func_cnt*sizeof(*class_desc->funcs));
1471 for(func_decl = class_decl->funcs, i=1; func_decl; func_decl = func_decl->next, i++) {
1472 for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
1473 if(func_prop_decl->type == FUNC_DEFGET) {
1479 if(!strcmpiW(class_initializeW, func_decl->name)) {
1480 if(func_decl->type != FUNC_SUB) {
1481 FIXME("class initializer is not sub\n");
1485 class_desc->class_initialize_id = i;
1486 }else if(!strcmpiW(class_terminateW, func_decl->name)) {
1487 if(func_decl->type != FUNC_SUB) {
1488 FIXME("class terminator is not sub\n");
1492 class_desc->class_terminate_id = i;
1495 hres = create_class_funcprop(ctx, func_decl, class_desc->funcs + (func_prop_decl ? 0 : i));
1500 for(prop_decl = class_decl->props; prop_decl; prop_decl = prop_decl->next)
1501 class_desc->prop_cnt++;
1503 class_desc->props = compiler_alloc(ctx->code, class_desc->prop_cnt*sizeof(*class_desc->props));
1504 if(!class_desc->props)
1505 return E_OUTOFMEMORY;
1507 for(prop_decl = class_decl->props, i=0; prop_decl; prop_decl = prop_decl->next, i++) {
1508 if(lookup_class_funcs(class_desc, prop_decl->name)) {
1509 FIXME("Property %s redefined\n", debugstr_w(prop_decl->name));
1513 class_desc->props[i].name = compiler_alloc_string(ctx->code, prop_decl->name);
1514 if(!class_desc->props[i].name)
1515 return E_OUTOFMEMORY;
1517 class_desc->props[i].is_public = prop_decl->is_public;
1520 class_desc->next = ctx->classes;
1521 ctx->classes = class_desc;
1525 static BOOL lookup_script_identifier(script_ctx_t *script, const WCHAR *identifier)
1527 class_desc_t *class;
1531 for(var = script->global_vars; var; var = var->next) {
1532 if(!strcmpiW(var->name, identifier))
1536 for(func = script->global_funcs; func; func = func->next) {
1537 if(!strcmpiW(func->name, identifier))
1541 for(class = script->classes; class; class = class->next) {
1542 if(!strcmpiW(class->name, identifier))
1549 static HRESULT check_script_collisions(compile_ctx_t *ctx, script_ctx_t *script)
1551 class_desc_t *class;
1555 for(var = ctx->global_vars; var; var = var->next) {
1556 if(lookup_script_identifier(script, var->name)) {
1557 FIXME("%s: redefined\n", debugstr_w(var->name));
1562 for(func = ctx->funcs; func; func = func->next) {
1563 if(lookup_script_identifier(script, func->name)) {
1564 FIXME("%s: redefined\n", debugstr_w(func->name));
1569 for(class = ctx->classes; class; class = class->next) {
1570 if(lookup_script_identifier(script, class->name)) {
1571 FIXME("%s: redefined\n", debugstr_w(class->name));
1579 void release_vbscode(vbscode_t *code)
1583 list_remove(&code->entry);
1585 for(i=0; i < code->bstr_cnt; i++)
1586 SysFreeString(code->bstr_pool[i]);
1588 vbsheap_free(&code->heap);
1590 heap_free(code->bstr_pool);
1591 heap_free(code->source);
1592 heap_free(code->instrs);
1596 static vbscode_t *alloc_vbscode(compile_ctx_t *ctx, const WCHAR *source)
1600 ret = heap_alloc(sizeof(*ret));
1604 ret->source = heap_strdupW(source);
1610 ret->instrs = heap_alloc(32*sizeof(instr_t));
1612 release_vbscode(ret);
1617 ctx->instr_size = 32;
1618 vbsheap_init(&ret->heap);
1620 ret->option_explicit = ctx->parser.option_explicit;
1622 ret->bstr_pool = NULL;
1623 ret->bstr_pool_size = 0;
1625 ret->pending_exec = FALSE;
1627 ret->main_code.type = FUNC_GLOBAL;
1628 ret->main_code.name = NULL;
1629 ret->main_code.code_ctx = ret;
1630 ret->main_code.vars = NULL;
1631 ret->main_code.var_cnt = 0;
1632 ret->main_code.arg_cnt = 0;
1633 ret->main_code.args = NULL;
1635 list_init(&ret->entry);
1639 static void release_compiler(compile_ctx_t *ctx)
1641 parser_release(&ctx->parser);
1642 heap_free(ctx->labels);
1644 release_vbscode(ctx->code);
1647 HRESULT compile_script(script_ctx_t *script, const WCHAR *src, const WCHAR *delimiter, vbscode_t **ret)
1649 function_t *new_func;
1650 function_decl_t *func_decl;
1651 class_decl_t *class_decl;
1656 hres = parse_script(&ctx.parser, src, delimiter);
1660 code = ctx.code = alloc_vbscode(&ctx, src);
1662 return E_OUTOFMEMORY;
1665 ctx.func_decls = NULL;
1666 ctx.global_vars = NULL;
1667 ctx.dim_decls = NULL;
1670 ctx.global_consts = NULL;
1671 ctx.stat_ctx = NULL;
1672 ctx.labels_cnt = ctx.labels_size = 0;
1674 hres = compile_func(&ctx, ctx.parser.stats, &ctx.code->main_code);
1676 release_compiler(&ctx);
1680 ctx.global_consts = ctx.const_decls;
1682 for(func_decl = ctx.func_decls; func_decl; func_decl = func_decl->next) {
1683 hres = create_function(&ctx, func_decl, &new_func);
1685 release_compiler(&ctx);
1689 new_func->next = ctx.funcs;
1690 ctx.funcs = new_func;
1693 for(class_decl = ctx.parser.class_decls; class_decl; class_decl = class_decl->next) {
1694 hres = compile_class(&ctx, class_decl);
1696 release_compiler(&ctx);
1701 hres = check_script_collisions(&ctx, script);
1703 release_compiler(&ctx);
1707 if(ctx.global_vars) {
1710 for(var = ctx.global_vars; var->next; var = var->next);
1712 var->next = script->global_vars;
1713 script->global_vars = ctx.global_vars;
1717 for(new_func = ctx.funcs; new_func->next; new_func = new_func->next);
1719 new_func->next = script->global_funcs;
1720 script->global_funcs = ctx.funcs;
1724 class_desc_t *class = ctx.classes;
1727 class->ctx = script;
1730 class = class->next;
1733 class->next = script->classes;
1734 script->classes = ctx.classes;
1737 if(TRACE_ON(vbscript_disas))
1741 release_compiler(&ctx);
1743 list_add_tail(&script->code_list, &code->entry);