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);
41 unsigned sub_end_label;
42 unsigned func_end_label;
43 unsigned prop_end_label;
45 dim_decl_t *dim_decls;
46 dynamic_var_t *global_vars;
50 function_decl_t *func_decls;
52 class_desc_t *classes;
55 static HRESULT compile_expression(compile_ctx_t*,expression_t*);
56 static HRESULT compile_statement(compile_ctx_t*,statement_t*);
60 instr_arg_type_t arg1_type;
61 instr_arg_type_t arg2_type;
63 #define X(n,a,b,c) {#n,b,c},
68 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
73 TRACE_(vbscript_disas)("\t%s", debugstr_w(arg->str));
76 TRACE_(vbscript_disas)("\t%d", arg->uint);
80 TRACE_(vbscript_disas)("\t%u", arg->uint);
83 TRACE_(vbscript_disas)("\t%lf", *arg->dbl);
92 static void dump_code(compile_ctx_t *ctx)
96 for(instr = ctx->code->instrs; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
97 TRACE_(vbscript_disas)("%d:\t%s", instr-ctx->code->instrs, instr_info[instr->op].op_str);
98 dump_instr_arg(instr_info[instr->op].arg1_type, &instr->arg1);
99 dump_instr_arg(instr_info[instr->op].arg2_type, &instr->arg2);
100 TRACE_(vbscript_disas)("\n");
104 static inline void *compiler_alloc(vbscode_t *vbscode, size_t size)
106 return vbsheap_alloc(&vbscode->heap, size);
109 static WCHAR *compiler_alloc_string(vbscode_t *vbscode, const WCHAR *str)
114 size = (strlenW(str)+1)*sizeof(WCHAR);
115 ret = compiler_alloc(vbscode, size);
117 memcpy(ret, str, size);
121 static inline instr_t *instr_ptr(compile_ctx_t *ctx, unsigned id)
123 assert(id < ctx->instr_cnt);
124 return ctx->code->instrs + id;
127 static unsigned push_instr(compile_ctx_t *ctx, vbsop_t op)
129 assert(ctx->instr_size && ctx->instr_size >= ctx->instr_cnt);
131 if(ctx->instr_size == ctx->instr_cnt) {
134 new_instr = heap_realloc(ctx->code->instrs, ctx->instr_size*2*sizeof(instr_t));
138 ctx->code->instrs = new_instr;
139 ctx->instr_size *= 2;
142 ctx->code->instrs[ctx->instr_cnt].op = op;
143 return ctx->instr_cnt++;
146 static HRESULT push_instr_int(compile_ctx_t *ctx, vbsop_t op, LONG arg)
150 ret = push_instr(ctx, op);
152 return E_OUTOFMEMORY;
154 instr_ptr(ctx, ret)->arg1.lng = arg;
158 static HRESULT push_instr_addr(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
162 ret = push_instr(ctx, op);
164 return E_OUTOFMEMORY;
166 instr_ptr(ctx, ret)->arg1.uint = arg;
170 static HRESULT push_instr_str(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
175 str = compiler_alloc_string(ctx->code, arg);
177 return E_OUTOFMEMORY;
179 instr = push_instr(ctx, op);
181 return E_OUTOFMEMORY;
183 instr_ptr(ctx, instr)->arg1.str = str;
187 static HRESULT push_instr_double(compile_ctx_t *ctx, vbsop_t op, double arg)
192 d = compiler_alloc(ctx->code, sizeof(double));
194 return E_OUTOFMEMORY;
196 instr = push_instr(ctx, op);
198 return E_OUTOFMEMORY;
201 instr_ptr(ctx, instr)->arg1.dbl = d;
205 static BSTR alloc_bstr_arg(compile_ctx_t *ctx, const WCHAR *str)
207 if(!ctx->code->bstr_pool_size) {
208 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
209 if(!ctx->code->bstr_pool)
211 ctx->code->bstr_pool_size = 8;
212 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
215 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
219 ctx->code->bstr_pool = new_pool;
220 ctx->code->bstr_pool_size *= 2;
223 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
224 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
227 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
230 static HRESULT push_instr_bstr(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
235 bstr = alloc_bstr_arg(ctx, arg);
237 return E_OUTOFMEMORY;
239 instr = push_instr(ctx, op);
241 return E_OUTOFMEMORY;
243 instr_ptr(ctx, instr)->arg1.bstr = bstr;
247 static HRESULT push_instr_bstr_uint(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg1, unsigned arg2)
252 bstr = alloc_bstr_arg(ctx, arg1);
254 return E_OUTOFMEMORY;
256 instr = push_instr(ctx, op);
258 return E_OUTOFMEMORY;
260 instr_ptr(ctx, instr)->arg1.bstr = bstr;
261 instr_ptr(ctx, instr)->arg2.uint = arg2;
265 #define LABEL_FLAG 0x80000000
267 static unsigned alloc_label(compile_ctx_t *ctx)
269 if(!ctx->labels_size) {
270 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
273 ctx->labels_size = 8;
274 }else if(ctx->labels_size == ctx->labels_cnt) {
275 unsigned *new_labels;
277 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
281 ctx->labels = new_labels;
282 ctx->labels_size *= 2;
285 return ctx->labels_cnt++ | LABEL_FLAG;
288 static inline void label_set_addr(compile_ctx_t *ctx, unsigned label)
290 assert(label & LABEL_FLAG);
291 ctx->labels[label & ~LABEL_FLAG] = ctx->instr_cnt;
294 static HRESULT compile_args(compile_ctx_t *ctx, expression_t *args, unsigned *ret)
296 unsigned arg_cnt = 0;
300 hres = compile_expression(ctx, args);
312 static HRESULT compile_member_expression(compile_ctx_t *ctx, member_expression_t *expr, BOOL ret_val)
314 unsigned arg_cnt = 0;
317 hres = compile_args(ctx, expr->args, &arg_cnt);
322 hres = compile_expression(ctx, expr->obj_expr);
326 hres = push_instr_bstr_uint(ctx, ret_val ? OP_mcall : OP_mcallv, expr->identifier, arg_cnt);
328 hres = push_instr_bstr_uint(ctx, ret_val ? OP_icall : OP_icallv, expr->identifier, arg_cnt);
334 static HRESULT compile_unary_expression(compile_ctx_t *ctx, unary_expression_t *expr, vbsop_t op)
338 hres = compile_expression(ctx, expr->subexpr);
342 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
345 static HRESULT compile_binary_expression(compile_ctx_t *ctx, binary_expression_t *expr, vbsop_t op)
349 hres = compile_expression(ctx, expr->left);
353 hres = compile_expression(ctx, expr->right);
357 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
360 static HRESULT compile_expression(compile_ctx_t *ctx, expression_t *expr)
364 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
366 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
368 return push_instr_int(ctx, OP_bool, ((bool_expression_t*)expr)->value);
370 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_concat);
372 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
374 return push_instr_double(ctx, OP_double, ((double_expression_t*)expr)->value);
376 return push_instr(ctx, OP_empty) != -1 ? S_OK : E_OUTOFMEMORY;
378 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_equal);
380 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eqv);
382 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_exp);
384 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_idiv);
386 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_imp);
388 return compile_member_expression(ctx, (member_expression_t*)expr, TRUE);
390 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
392 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
394 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
396 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_nequal);
398 return push_instr_str(ctx, OP_new, ((string_expression_t*)expr)->value);
400 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_not);
402 return push_instr(ctx, OP_nothing) != -1 ? S_OK : E_OUTOFMEMORY;
404 return push_instr(ctx, OP_null) != -1 ? S_OK : E_OUTOFMEMORY;
406 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
408 return push_instr_str(ctx, OP_string, ((string_expression_t*)expr)->value);
410 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
412 return push_instr_int(ctx, OP_short, ((int_expression_t*)expr)->value);
414 return push_instr_int(ctx, OP_long, ((int_expression_t*)expr)->value);
416 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
418 FIXME("Unimplemented expression type %d\n", expr->type);
425 static HRESULT compile_if_statement(compile_ctx_t *ctx, if_statement_t *stat)
427 unsigned cnd_jmp, endif_label = -1;
428 elseif_decl_t *elseif_decl;
431 hres = compile_expression(ctx, stat->expr);
435 cnd_jmp = push_instr(ctx, OP_jmp_false);
437 return E_OUTOFMEMORY;
439 hres = compile_statement(ctx, stat->if_stat);
443 if(stat->else_stat || stat->elseifs) {
444 endif_label = alloc_label(ctx);
445 if(endif_label == -1)
446 return E_OUTOFMEMORY;
448 hres = push_instr_addr(ctx, OP_jmp, endif_label);
453 for(elseif_decl = stat->elseifs; elseif_decl; elseif_decl = elseif_decl->next) {
454 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
456 hres = compile_expression(ctx, elseif_decl->expr);
460 cnd_jmp = push_instr(ctx, OP_jmp_false);
462 return E_OUTOFMEMORY;
464 hres = compile_statement(ctx, elseif_decl->stat);
468 hres = push_instr_addr(ctx, OP_jmp, endif_label);
473 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
475 if(stat->else_stat) {
476 hres = compile_statement(ctx, stat->else_stat);
481 if(endif_label != -1)
482 label_set_addr(ctx, endif_label);
486 static HRESULT compile_while_statement(compile_ctx_t *ctx, while_statement_t *stat)
492 start_addr = ctx->instr_cnt;
494 hres = compile_expression(ctx, stat->expr);
498 jmp_end = push_instr(ctx, OP_jmp_false);
500 return E_OUTOFMEMORY;
502 hres = compile_statement(ctx, stat->body);
506 hres = push_instr_addr(ctx, OP_jmp, start_addr);
510 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->instr_cnt;
514 static HRESULT compile_assign_statement(compile_ctx_t *ctx, assign_statement_t *stat, BOOL is_set)
518 hres = compile_expression(ctx, stat->value_expr);
522 if(stat->member_expr->args) {
523 FIXME("arguments support not implemented\n");
527 if(stat->member_expr->obj_expr) {
528 hres = compile_expression(ctx, stat->member_expr->obj_expr);
532 hres = push_instr_bstr(ctx, is_set ? OP_set_member : OP_assign_member, stat->member_expr->identifier);
534 hres = push_instr_bstr(ctx, is_set ? OP_set_ident : OP_assign_ident, stat->member_expr->identifier);
540 static BOOL lookup_dim_decls(compile_ctx_t *ctx, const WCHAR *name)
542 dim_decl_t *dim_decl;
544 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
545 if(!strcmpiW(dim_decl->name, name))
552 static BOOL lookup_args_name(compile_ctx_t *ctx, const WCHAR *name)
556 for(i = 0; i < ctx->func->arg_cnt; i++) {
557 if(!strcmpiW(ctx->func->args[i].name, name))
564 static HRESULT compile_dim_statement(compile_ctx_t *ctx, dim_statement_t *stat)
566 dim_decl_t *dim_decl = stat->dim_decls;
569 if(lookup_dim_decls(ctx, dim_decl->name) || lookup_args_name(ctx, dim_decl->name)) {
570 FIXME("dim %s name redefined\n", debugstr_w(dim_decl->name));
576 dim_decl = dim_decl->next;
579 dim_decl->next = ctx->dim_decls;
580 ctx->dim_decls = stat->dim_decls;
581 ctx->func->var_cnt++;
585 static HRESULT compile_function_statement(compile_ctx_t *ctx, function_statement_t *stat)
587 if(ctx->func != &ctx->code->global_code) {
588 FIXME("Function is not in the global code\n");
592 stat->func_decl->next = ctx->func_decls;
593 ctx->func_decls = stat->func_decl;
597 static HRESULT compile_exitsub_statement(compile_ctx_t *ctx)
599 if(ctx->sub_end_label == -1) {
600 FIXME("Exit Sub outside Sub?\n");
604 return push_instr_addr(ctx, OP_jmp, ctx->sub_end_label);
607 static HRESULT compile_exitfunc_statement(compile_ctx_t *ctx)
609 if(ctx->func_end_label == -1) {
610 FIXME("Exit Function outside Function?\n");
614 return push_instr_addr(ctx, OP_jmp, ctx->func_end_label);
617 static HRESULT compile_exitprop_statement(compile_ctx_t *ctx)
619 if(ctx->prop_end_label == -1) {
620 FIXME("Exit Property outside Property?\n");
624 return push_instr_addr(ctx, OP_jmp, ctx->prop_end_label);
627 static HRESULT compile_statement(compile_ctx_t *ctx, statement_t *stat)
634 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, FALSE);
637 hres = compile_member_expression(ctx, ((call_statement_t*)stat)->expr, FALSE);
640 hres = compile_dim_statement(ctx, (dim_statement_t*)stat);
643 hres = compile_exitfunc_statement(ctx);
646 hres = compile_exitprop_statement(ctx);
649 hres = compile_exitsub_statement(ctx);
652 hres = compile_function_statement(ctx, (function_statement_t*)stat);
655 hres = compile_if_statement(ctx, (if_statement_t*)stat);
658 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, TRUE);
661 hres = push_instr(ctx, OP_stop) == -1 ? E_OUTOFMEMORY : S_OK;
664 hres = compile_while_statement(ctx, (while_statement_t*)stat);
667 FIXME("Unimplemented statement type %d\n", stat->type);
679 static void resolve_labels(compile_ctx_t *ctx, unsigned off)
683 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
684 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->arg1.uint & LABEL_FLAG)) {
685 assert((instr->arg1.uint & ~LABEL_FLAG) < ctx->labels_cnt);
686 instr->arg1.uint = ctx->labels[instr->arg1.uint & ~LABEL_FLAG];
688 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
694 static HRESULT compile_func(compile_ctx_t *ctx, statement_t *stat, function_t *func)
698 func->code_off = ctx->instr_cnt;
700 ctx->sub_end_label = -1;
701 ctx->func_end_label = -1;
702 ctx->prop_end_label = -1;
706 ctx->func_end_label = alloc_label(ctx);
707 if(ctx->func_end_label == -1)
708 return E_OUTOFMEMORY; /* FIXME ! */
711 ctx->sub_end_label = alloc_label(ctx);
712 if(ctx->sub_end_label == -1)
713 return E_OUTOFMEMORY;
719 ctx->prop_end_label = alloc_label(ctx);
720 if(ctx->prop_end_label == -1)
721 return E_OUTOFMEMORY;
728 ctx->dim_decls = NULL;
729 hres = compile_statement(ctx, stat);
734 if(ctx->sub_end_label != -1)
735 label_set_addr(ctx, ctx->sub_end_label);
736 if(ctx->func_end_label != -1)
737 label_set_addr(ctx, ctx->func_end_label);
738 if(ctx->prop_end_label != -1)
739 label_set_addr(ctx, ctx->prop_end_label);
741 if(push_instr(ctx, OP_ret) == -1)
742 return E_OUTOFMEMORY;
744 resolve_labels(ctx, func->code_off);
747 dim_decl_t *dim_decl;
749 if(func->type == FUNC_GLOBAL) {
750 dynamic_var_t *new_var;
754 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
755 new_var = compiler_alloc(ctx->code, sizeof(*new_var));
757 return E_OUTOFMEMORY;
759 new_var->name = compiler_alloc_string(ctx->code, dim_decl->name);
761 return E_OUTOFMEMORY;
763 V_VT(&new_var->v) = VT_EMPTY;
765 new_var->next = ctx->global_vars;
766 ctx->global_vars = new_var;
771 func->vars = compiler_alloc(ctx->code, func->var_cnt * sizeof(var_desc_t));
773 return E_OUTOFMEMORY;
775 for(dim_decl = ctx->dim_decls, i=0; dim_decl; dim_decl = dim_decl->next, i++) {
776 func->vars[i].name = compiler_alloc_string(ctx->code, dim_decl->name);
777 if(!func->vars[i].name)
778 return E_OUTOFMEMORY;
781 assert(i == func->var_cnt);
788 static BOOL lookup_funcs_name(compile_ctx_t *ctx, const WCHAR *name)
792 for(iter = ctx->funcs; iter; iter = iter->next) {
793 if(!strcmpiW(iter->name, name))
800 static HRESULT create_function(compile_ctx_t *ctx, function_decl_t *decl, function_t **ret)
805 if(lookup_dim_decls(ctx, decl->name) || lookup_funcs_name(ctx, decl->name)) {
806 FIXME("%s: redefinition\n", debugstr_w(decl->name));
810 func = compiler_alloc(ctx->code, sizeof(*func));
812 return E_OUTOFMEMORY;
814 func->name = compiler_alloc_string(ctx->code, decl->name);
816 return E_OUTOFMEMORY;
820 func->code_ctx = ctx->code;
821 func->type = decl->type;
822 func->is_public = decl->is_public;
829 for(arg = decl->args; arg; arg = arg->next)
832 func->args = compiler_alloc(ctx->code, func->arg_cnt * sizeof(arg_desc_t));
834 return E_OUTOFMEMORY;
836 for(i = 0, arg = decl->args; arg; arg = arg->next, i++) {
837 func->args[i].name = compiler_alloc_string(ctx->code, arg->name);
838 if(!func->args[i].name)
839 return E_OUTOFMEMORY;
840 func->args[i].by_ref = arg->by_ref;
846 hres = compile_func(ctx, decl->body, func);
854 static BOOL lookup_class_name(compile_ctx_t *ctx, const WCHAR *name)
858 for(iter = ctx->classes; iter; iter = iter->next) {
859 if(!strcmpiW(iter->name, name))
866 static HRESULT create_class_funcprop(compile_ctx_t *ctx, function_decl_t *func_decl, vbdisp_funcprop_desc_t *desc)
868 vbdisp_invoke_type_t invoke_type;
869 function_decl_t *funcprop_decl;
872 desc->name = compiler_alloc_string(ctx->code, func_decl->name);
874 return E_OUTOFMEMORY;
876 for(funcprop_decl = func_decl; funcprop_decl; funcprop_decl = funcprop_decl->next_prop_func) {
877 switch(funcprop_decl->type) {
882 invoke_type = VBDISP_CALLGET;
885 invoke_type = VBDISP_LET;
888 invoke_type = VBDISP_SET;
894 assert(!desc->entries[invoke_type]);
896 if(funcprop_decl->is_public)
897 desc->is_public = TRUE;
899 hres = create_function(ctx, funcprop_decl, desc->entries+invoke_type);
907 static BOOL lookup_class_funcs(class_desc_t *class_desc, const WCHAR *name)
911 for(i=0; i < class_desc->func_cnt; i++) {
912 if(class_desc->funcs[i].name && !strcmpiW(class_desc->funcs[i].name, name))
919 static HRESULT compile_class(compile_ctx_t *ctx, class_decl_t *class_decl)
921 function_decl_t *func_decl, *func_prop_decl;
922 class_prop_decl_t *prop_decl;
923 class_desc_t *class_desc;
927 static const WCHAR class_initializeW[] = {'c','l','a','s','s','_','i','n','i','t','i','a','l','i','z','e',0};
928 static const WCHAR class_terminateW[] = {'c','l','a','s','s','_','t','e','r','m','i','n','a','t','e',0};
930 if(lookup_dim_decls(ctx, class_decl->name) || lookup_funcs_name(ctx, class_decl->name)
931 || lookup_class_name(ctx, class_decl->name)) {
932 FIXME("%s: redefinition\n", debugstr_w(class_decl->name));
936 class_desc = compiler_alloc(ctx->code, sizeof(*class_desc));
938 return E_OUTOFMEMORY;
940 class_desc->name = compiler_alloc_string(ctx->code, class_decl->name);
941 if(!class_desc->name)
942 return E_OUTOFMEMORY;
944 class_desc->func_cnt = 1; /* always allocate slot for default getter */
945 class_desc->prop_cnt = 0;
946 class_desc->class_initialize_id = 0;
947 class_desc->class_terminate_id = 0;
949 for(func_decl = class_decl->funcs; func_decl; func_decl = func_decl->next) {
950 for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
951 if(func_prop_decl->type == FUNC_DEFGET)
955 class_desc->func_cnt++;
958 class_desc->funcs = compiler_alloc(ctx->code, class_desc->func_cnt*sizeof(*class_desc->funcs));
959 if(!class_desc->funcs)
960 return E_OUTOFMEMORY;
961 memset(class_desc->funcs, 0, class_desc->func_cnt*sizeof(*class_desc->funcs));
963 for(func_decl = class_decl->funcs, i=1; func_decl; func_decl = func_decl->next, i++) {
964 for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
965 if(func_prop_decl->type == FUNC_DEFGET) {
971 if(!strcmpiW(class_initializeW, func_decl->name)) {
972 if(func_decl->type != FUNC_SUB) {
973 FIXME("class initializer is not sub\n");
977 class_desc->class_initialize_id = i;
978 }else if(!strcmpiW(class_terminateW, func_decl->name)) {
979 if(func_decl->type != FUNC_SUB) {
980 FIXME("class terminator is not sub\n");
984 class_desc->class_terminate_id = i;
987 hres = create_class_funcprop(ctx, func_decl, class_desc->funcs + (func_prop_decl ? 0 : i));
992 for(prop_decl = class_decl->props; prop_decl; prop_decl = prop_decl->next)
993 class_desc->prop_cnt++;
995 class_desc->props = compiler_alloc(ctx->code, class_desc->prop_cnt*sizeof(*class_desc->props));
996 if(!class_desc->props)
997 return E_OUTOFMEMORY;
999 for(prop_decl = class_decl->props, i=0; prop_decl; prop_decl = prop_decl->next, i++) {
1000 if(lookup_class_funcs(class_desc, prop_decl->name)) {
1001 FIXME("Property %s redefined\n", debugstr_w(prop_decl->name));
1005 class_desc->props[i].name = compiler_alloc_string(ctx->code, prop_decl->name);
1006 if(!class_desc->props[i].name)
1007 return E_OUTOFMEMORY;
1009 class_desc->props[i].is_public = prop_decl->is_public;
1012 class_desc->next = ctx->classes;
1013 ctx->classes = class_desc;
1017 static BOOL lookup_script_identifier(script_ctx_t *script, const WCHAR *identifier)
1019 class_desc_t *class;
1023 for(var = script->global_vars; var; var = var->next) {
1024 if(!strcmpiW(var->name, identifier))
1028 for(func = script->global_funcs; func; func = func->next) {
1029 if(!strcmpiW(func->name, identifier))
1033 for(class = script->classes; class; class = class->next) {
1034 if(!strcmpiW(class->name, identifier))
1041 static HRESULT check_script_collisions(compile_ctx_t *ctx, script_ctx_t *script)
1043 class_desc_t *class;
1047 for(var = ctx->global_vars; var; var = var->next) {
1048 if(lookup_script_identifier(script, var->name)) {
1049 FIXME("%s: redefined\n", debugstr_w(var->name));
1054 for(func = ctx->funcs; func; func = func->next) {
1055 if(lookup_script_identifier(script, func->name)) {
1056 FIXME("%s: redefined\n", debugstr_w(func->name));
1061 for(class = ctx->classes; class; class = class->next) {
1062 if(lookup_script_identifier(script, class->name)) {
1063 FIXME("%s: redefined\n", debugstr_w(class->name));
1071 void release_vbscode(vbscode_t *code)
1075 list_remove(&code->entry);
1077 for(i=0; i < code->bstr_cnt; i++)
1078 SysFreeString(code->bstr_pool[i]);
1080 vbsheap_free(&code->heap);
1082 heap_free(code->bstr_pool);
1083 heap_free(code->source);
1084 heap_free(code->instrs);
1088 static vbscode_t *alloc_vbscode(compile_ctx_t *ctx, const WCHAR *source)
1092 ret = heap_alloc(sizeof(*ret));
1096 ret->source = heap_strdupW(source);
1102 ret->instrs = heap_alloc(32*sizeof(instr_t));
1104 release_vbscode(ret);
1109 ctx->instr_size = 32;
1110 vbsheap_init(&ret->heap);
1112 ret->option_explicit = ctx->parser.option_explicit;
1114 ret->bstr_pool = NULL;
1115 ret->bstr_pool_size = 0;
1117 ret->global_executed = FALSE;
1119 ret->global_code.type = FUNC_GLOBAL;
1120 ret->global_code.name = NULL;
1121 ret->global_code.code_ctx = ret;
1122 ret->global_code.vars = NULL;
1123 ret->global_code.var_cnt = 0;
1124 ret->global_code.arg_cnt = 0;
1125 ret->global_code.args = NULL;
1127 list_init(&ret->entry);
1131 static void release_compiler(compile_ctx_t *ctx)
1133 parser_release(&ctx->parser);
1134 heap_free(ctx->labels);
1136 release_vbscode(ctx->code);
1139 HRESULT compile_script(script_ctx_t *script, const WCHAR *src, vbscode_t **ret)
1141 function_t *new_func;
1142 function_decl_t *func_decl;
1143 class_decl_t *class_decl;
1148 hres = parse_script(&ctx.parser, src);
1152 code = ctx.code = alloc_vbscode(&ctx, src);
1154 return E_OUTOFMEMORY;
1157 ctx.func_decls = NULL;
1158 ctx.global_vars = NULL;
1159 ctx.dim_decls = NULL;
1162 ctx.labels_cnt = ctx.labels_size = 0;
1164 hres = compile_func(&ctx, ctx.parser.stats, &ctx.code->global_code);
1166 release_compiler(&ctx);
1170 for(func_decl = ctx.func_decls; func_decl; func_decl = func_decl->next) {
1171 hres = create_function(&ctx, func_decl, &new_func);
1173 release_compiler(&ctx);
1177 new_func->next = ctx.funcs;
1178 ctx.funcs = new_func;
1181 for(class_decl = ctx.parser.class_decls; class_decl; class_decl = class_decl->next) {
1182 hres = compile_class(&ctx, class_decl);
1184 release_compiler(&ctx);
1189 hres = check_script_collisions(&ctx, script);
1191 release_compiler(&ctx);
1195 if(ctx.global_vars) {
1198 for(var = ctx.global_vars; var->next; var = var->next);
1200 var->next = script->global_vars;
1201 script->global_vars = ctx.global_vars;
1205 for(new_func = ctx.funcs; new_func->next; new_func = new_func->next);
1207 new_func->next = script->global_funcs;
1208 script->global_funcs = ctx.funcs;
1212 class_desc_t *class = ctx.classes;
1215 class->ctx = script;
1218 class = class->next;
1221 class->next = script->classes;
1222 script->classes = ctx.classes;
1225 if(TRACE_ON(vbscript_disas))
1229 release_compiler(&ctx);
1231 list_add_tail(&script->code_list, &code->entry);