pdh: Add more Pdh macros and prototypes to the headers.
[wine/multimedia.git] / dlls / vbscript / compile.c
blob10b2a9dbd1c7a4618f6f440a0dc3ecd0129913bf
1 /*
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
19 #include <assert.h>
21 #include "vbscript.h"
22 #include "parse.h"
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 {
31 parser_ctx_t parser;
33 unsigned instr_cnt;
34 unsigned instr_size;
35 vbscode_t *code;
37 unsigned *labels;
38 unsigned labels_size;
39 unsigned labels_cnt;
41 unsigned sub_end_label;
42 unsigned func_end_label;
44 dim_decl_t *dim_decls;
45 dynamic_var_t *global_vars;
47 function_t *func;
48 function_t *funcs;
49 function_decl_t *func_decls;
51 class_desc_t *classes;
52 } compile_ctx_t;
54 static HRESULT compile_expression(compile_ctx_t*,expression_t*);
55 static HRESULT compile_statement(compile_ctx_t*,statement_t*);
57 static const struct {
58 const char *op_str;
59 instr_arg_type_t arg1_type;
60 instr_arg_type_t arg2_type;
61 } instr_info[] = {
62 #define X(n,a,b,c) {#n,b,c},
63 OP_LIST
64 #undef X
67 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
69 switch(type) {
70 case ARG_STR:
71 case ARG_BSTR:
72 TRACE_(vbscript_disas)("\t%s", debugstr_w(arg->str));
73 break;
74 case ARG_INT:
75 TRACE_(vbscript_disas)("\t%d", arg->uint);
76 break;
77 case ARG_UINT:
78 case ARG_ADDR:
79 TRACE_(vbscript_disas)("\t%u", arg->uint);
80 break;
81 case ARG_DOUBLE:
82 TRACE_(vbscript_disas)("\t%lf", *arg->dbl);
83 break;
84 case ARG_NONE:
85 break;
86 default:
87 assert(0);
91 static void dump_code(compile_ctx_t *ctx)
93 instr_t *instr;
95 for(instr = ctx->code->instrs; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
96 TRACE_(vbscript_disas)("%d:\t%s", instr-ctx->code->instrs, instr_info[instr->op].op_str);
97 dump_instr_arg(instr_info[instr->op].arg1_type, &instr->arg1);
98 dump_instr_arg(instr_info[instr->op].arg2_type, &instr->arg2);
99 TRACE_(vbscript_disas)("\n");
103 static inline void *compiler_alloc(vbscode_t *vbscode, size_t size)
105 return vbsheap_alloc(&vbscode->heap, size);
108 static WCHAR *compiler_alloc_string(vbscode_t *vbscode, const WCHAR *str)
110 size_t size;
111 WCHAR *ret;
113 size = (strlenW(str)+1)*sizeof(WCHAR);
114 ret = compiler_alloc(vbscode, size);
115 if(ret)
116 memcpy(ret, str, size);
117 return ret;
120 static inline instr_t *instr_ptr(compile_ctx_t *ctx, unsigned id)
122 assert(id < ctx->instr_cnt);
123 return ctx->code->instrs + id;
126 static unsigned push_instr(compile_ctx_t *ctx, vbsop_t op)
128 assert(ctx->instr_size && ctx->instr_size >= ctx->instr_cnt);
130 if(ctx->instr_size == ctx->instr_cnt) {
131 instr_t *new_instr;
133 new_instr = heap_realloc(ctx->code->instrs, ctx->instr_size*2*sizeof(instr_t));
134 if(!new_instr)
135 return -1;
137 ctx->code->instrs = new_instr;
138 ctx->instr_size *= 2;
141 ctx->code->instrs[ctx->instr_cnt].op = op;
142 return ctx->instr_cnt++;
145 static HRESULT push_instr_int(compile_ctx_t *ctx, vbsop_t op, LONG arg)
147 unsigned ret;
149 ret = push_instr(ctx, op);
150 if(ret == -1)
151 return E_OUTOFMEMORY;
153 instr_ptr(ctx, ret)->arg1.lng = arg;
154 return S_OK;
157 static HRESULT push_instr_addr(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
159 unsigned ret;
161 ret = push_instr(ctx, op);
162 if(ret == -1)
163 return E_OUTOFMEMORY;
165 instr_ptr(ctx, ret)->arg1.uint = arg;
166 return S_OK;
169 static HRESULT push_instr_str(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
171 unsigned instr;
172 WCHAR *str;
174 str = compiler_alloc_string(ctx->code, arg);
175 if(!str)
176 return E_OUTOFMEMORY;
178 instr = push_instr(ctx, op);
179 if(instr == -1)
180 return E_OUTOFMEMORY;
182 instr_ptr(ctx, instr)->arg1.str = str;
183 return S_OK;
186 static HRESULT push_instr_double(compile_ctx_t *ctx, vbsop_t op, double arg)
188 unsigned instr;
189 double *d;
191 d = compiler_alloc(ctx->code, sizeof(double));
192 if(!d)
193 return E_OUTOFMEMORY;
195 instr = push_instr(ctx, op);
196 if(instr == -1)
197 return E_OUTOFMEMORY;
199 *d = arg;
200 instr_ptr(ctx, instr)->arg1.dbl = d;
201 return S_OK;
204 static BSTR alloc_bstr_arg(compile_ctx_t *ctx, const WCHAR *str)
206 if(!ctx->code->bstr_pool_size) {
207 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
208 if(!ctx->code->bstr_pool)
209 return NULL;
210 ctx->code->bstr_pool_size = 8;
211 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
212 BSTR *new_pool;
214 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
215 if(!new_pool)
216 return NULL;
218 ctx->code->bstr_pool = new_pool;
219 ctx->code->bstr_pool_size *= 2;
222 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
223 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
224 return NULL;
226 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
229 static HRESULT push_instr_bstr(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
231 unsigned instr;
232 BSTR bstr;
234 bstr = alloc_bstr_arg(ctx, arg);
235 if(!bstr)
236 return E_OUTOFMEMORY;
238 instr = push_instr(ctx, op);
239 if(instr == -1)
240 return E_OUTOFMEMORY;
242 instr_ptr(ctx, instr)->arg1.bstr = bstr;
243 return S_OK;
246 static HRESULT push_instr_bstr_uint(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg1, unsigned arg2)
248 unsigned instr;
249 BSTR bstr;
251 bstr = alloc_bstr_arg(ctx, arg1);
252 if(!bstr)
253 return E_OUTOFMEMORY;
255 instr = push_instr(ctx, op);
256 if(instr == -1)
257 return E_OUTOFMEMORY;
259 instr_ptr(ctx, instr)->arg1.bstr = bstr;
260 instr_ptr(ctx, instr)->arg2.uint = arg2;
261 return S_OK;
264 #define LABEL_FLAG 0x80000000
266 static unsigned alloc_label(compile_ctx_t *ctx)
268 if(!ctx->labels_size) {
269 ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
270 if(!ctx->labels)
271 return -1;
272 ctx->labels_size = 8;
273 }else if(ctx->labels_size == ctx->labels_cnt) {
274 unsigned *new_labels;
276 new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
277 if(!new_labels)
278 return -1;
280 ctx->labels = new_labels;
281 ctx->labels_size *= 2;
284 return ctx->labels_cnt++ | LABEL_FLAG;
287 static inline void label_set_addr(compile_ctx_t *ctx, unsigned label)
289 assert(label & LABEL_FLAG);
290 ctx->labels[label & ~LABEL_FLAG] = ctx->instr_cnt;
293 static HRESULT compile_args(compile_ctx_t *ctx, expression_t *args, unsigned *ret)
295 unsigned arg_cnt = 0;
296 HRESULT hres;
298 while(args) {
299 hres = compile_expression(ctx, args);
300 if(FAILED(hres))
301 return hres;
303 arg_cnt++;
304 args = args->next;
307 *ret = arg_cnt;
308 return S_OK;
311 static HRESULT compile_member_expression(compile_ctx_t *ctx, member_expression_t *expr, BOOL ret_val)
313 unsigned arg_cnt = 0;
314 HRESULT hres;
316 hres = compile_args(ctx, expr->args, &arg_cnt);
317 if(FAILED(hres))
318 return hres;
320 if(expr->obj_expr) {
321 hres = compile_expression(ctx, expr->obj_expr);
322 if(FAILED(hres))
323 return hres;
325 hres = push_instr_bstr_uint(ctx, ret_val ? OP_mcall : OP_mcallv, expr->identifier, arg_cnt);
326 }else {
327 hres = push_instr_bstr_uint(ctx, ret_val ? OP_icall : OP_icallv, expr->identifier, arg_cnt);
330 return hres;
333 static HRESULT compile_unary_expression(compile_ctx_t *ctx, unary_expression_t *expr, vbsop_t op)
335 HRESULT hres;
337 hres = compile_expression(ctx, expr->subexpr);
338 if(FAILED(hres))
339 return hres;
341 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
344 static HRESULT compile_binary_expression(compile_ctx_t *ctx, binary_expression_t *expr, vbsop_t op)
346 HRESULT hres;
348 hres = compile_expression(ctx, expr->left);
349 if(FAILED(hres))
350 return hres;
352 hres = compile_expression(ctx, expr->right);
353 if(FAILED(hres))
354 return hres;
356 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
359 static HRESULT compile_expression(compile_ctx_t *ctx, expression_t *expr)
361 switch(expr->type) {
362 case EXPR_ADD:
363 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
364 case EXPR_AND:
365 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
366 case EXPR_BOOL:
367 return push_instr_int(ctx, OP_bool, ((bool_expression_t*)expr)->value);
368 case EXPR_CONCAT:
369 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_concat);
370 case EXPR_DIV:
371 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
372 case EXPR_DOUBLE:
373 return push_instr_double(ctx, OP_double, ((double_expression_t*)expr)->value);
374 case EXPR_EMPTY:
375 return push_instr(ctx, OP_empty) != -1 ? S_OK : E_OUTOFMEMORY;
376 case EXPR_EQUAL:
377 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_equal);
378 case EXPR_EQV:
379 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eqv);
380 case EXPR_EXP:
381 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_exp);
382 case EXPR_IDIV:
383 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_idiv);
384 case EXPR_IMP:
385 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_imp);
386 case EXPR_MEMBER:
387 return compile_member_expression(ctx, (member_expression_t*)expr, TRUE);
388 case EXPR_MOD:
389 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
390 case EXPR_MUL:
391 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
392 case EXPR_NEG:
393 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
394 case EXPR_NEQUAL:
395 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_nequal);
396 case EXPR_NEW:
397 return push_instr_str(ctx, OP_new, ((string_expression_t*)expr)->value);
398 case EXPR_NOT:
399 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_not);
400 case EXPR_NOTHING:
401 return push_instr(ctx, OP_nothing) != -1 ? S_OK : E_OUTOFMEMORY;
402 case EXPR_NULL:
403 return push_instr(ctx, OP_null) != -1 ? S_OK : E_OUTOFMEMORY;
404 case EXPR_OR:
405 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
406 case EXPR_STRING:
407 return push_instr_str(ctx, OP_string, ((string_expression_t*)expr)->value);
408 case EXPR_SUB:
409 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
410 case EXPR_USHORT:
411 return push_instr_int(ctx, OP_short, ((int_expression_t*)expr)->value);
412 case EXPR_ULONG:
413 return push_instr_int(ctx, OP_long, ((int_expression_t*)expr)->value);
414 case EXPR_XOR:
415 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
416 default:
417 FIXME("Unimplemented expression type %d\n", expr->type);
418 return E_NOTIMPL;
421 return S_OK;
424 static HRESULT compile_if_statement(compile_ctx_t *ctx, if_statement_t *stat)
426 unsigned cnd_jmp, endif_label = -1;
427 elseif_decl_t *elseif_decl;
428 HRESULT hres;
430 hres = compile_expression(ctx, stat->expr);
431 if(FAILED(hres))
432 return hres;
434 cnd_jmp = push_instr(ctx, OP_jmp_false);
435 if(cnd_jmp == -1)
436 return E_OUTOFMEMORY;
438 hres = compile_statement(ctx, stat->if_stat);
439 if(FAILED(hres))
440 return hres;
442 if(stat->else_stat || stat->elseifs) {
443 endif_label = alloc_label(ctx);
444 if(endif_label == -1)
445 return E_OUTOFMEMORY;
447 hres = push_instr_addr(ctx, OP_jmp, endif_label);
448 if(FAILED(hres))
449 return hres;
452 for(elseif_decl = stat->elseifs; elseif_decl; elseif_decl = elseif_decl->next) {
453 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
455 hres = compile_expression(ctx, elseif_decl->expr);
456 if(FAILED(hres))
457 return hres;
459 cnd_jmp = push_instr(ctx, OP_jmp_false);
460 if(cnd_jmp == -1)
461 return E_OUTOFMEMORY;
463 hres = compile_statement(ctx, elseif_decl->stat);
464 if(FAILED(hres))
465 return hres;
467 hres = push_instr_addr(ctx, OP_jmp, endif_label);
468 if(FAILED(hres))
469 return hres;
472 instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
474 if(stat->else_stat) {
475 hres = compile_statement(ctx, stat->else_stat);
476 if(FAILED(hres))
477 return hres;
480 if(endif_label != -1)
481 label_set_addr(ctx, endif_label);
482 return S_OK;
485 static HRESULT compile_assign_statement(compile_ctx_t *ctx, assign_statement_t *stat, BOOL is_set)
487 HRESULT hres;
489 hres = compile_expression(ctx, stat->value_expr);
490 if(FAILED(hres))
491 return hres;
493 if(stat->member_expr->args) {
494 FIXME("arguments support not implemented\n");
495 return E_NOTIMPL;
498 if(stat->member_expr->obj_expr) {
499 hres = compile_expression(ctx, stat->member_expr->obj_expr);
500 if(FAILED(hres))
501 return hres;
503 hres = push_instr_bstr(ctx, is_set ? OP_set_member : OP_assign_member, stat->member_expr->identifier);
504 }else {
505 hres = push_instr_bstr(ctx, is_set ? OP_set_ident : OP_assign_ident, stat->member_expr->identifier);
508 return hres;
511 static BOOL lookup_dim_decls(compile_ctx_t *ctx, const WCHAR *name)
513 dim_decl_t *dim_decl;
515 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
516 if(!strcmpiW(dim_decl->name, name))
517 return TRUE;
520 return FALSE;
523 static BOOL lookup_args_name(compile_ctx_t *ctx, const WCHAR *name)
525 unsigned i;
527 for(i = 0; i < ctx->func->arg_cnt; i++) {
528 if(!strcmpiW(ctx->func->args[i].name, name))
529 return TRUE;
532 return FALSE;
535 static HRESULT compile_dim_statement(compile_ctx_t *ctx, dim_statement_t *stat)
537 dim_decl_t *dim_decl = stat->dim_decls;
539 while(1) {
540 if(lookup_dim_decls(ctx, dim_decl->name) || lookup_args_name(ctx, dim_decl->name)) {
541 FIXME("dim %s name redefined\n", debugstr_w(dim_decl->name));
542 return E_FAIL;
545 if(!dim_decl->next)
546 break;
547 dim_decl = dim_decl->next;
550 dim_decl->next = ctx->dim_decls;
551 ctx->dim_decls = stat->dim_decls;
552 ctx->func->var_cnt++;
553 return S_OK;
556 static HRESULT compile_function_statement(compile_ctx_t *ctx, function_statement_t *stat)
558 if(ctx->func != &ctx->code->global_code) {
559 FIXME("Function is not in the global code\n");
560 return E_FAIL;
563 stat->func_decl->next = ctx->func_decls;
564 ctx->func_decls = stat->func_decl;
565 return S_OK;
568 static HRESULT compile_exitsub_statement(compile_ctx_t *ctx)
570 if(ctx->sub_end_label == -1) {
571 FIXME("Exit Sub outside Sub?\n");
572 return E_FAIL;
575 return push_instr_addr(ctx, OP_jmp, ctx->sub_end_label);
578 static HRESULT compile_exitfunc_statement(compile_ctx_t *ctx)
580 if(ctx->func_end_label == -1) {
581 FIXME("Exit Function outside Function?\n");
582 return E_FAIL;
585 return push_instr_addr(ctx, OP_jmp, ctx->func_end_label);
588 static HRESULT compile_statement(compile_ctx_t *ctx, statement_t *stat)
590 HRESULT hres;
592 while(stat) {
593 switch(stat->type) {
594 case STAT_ASSIGN:
595 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, FALSE);
596 break;
597 case STAT_CALL:
598 hres = compile_member_expression(ctx, ((call_statement_t*)stat)->expr, FALSE);
599 break;
600 case STAT_DIM:
601 hres = compile_dim_statement(ctx, (dim_statement_t*)stat);
602 break;
603 case STAT_EXITFUNC:
604 hres = compile_exitfunc_statement(ctx);
605 break;
606 case STAT_EXITSUB:
607 hres = compile_exitsub_statement(ctx);
608 break;
609 case STAT_FUNC:
610 hres = compile_function_statement(ctx, (function_statement_t*)stat);
611 break;
612 case STAT_IF:
613 hres = compile_if_statement(ctx, (if_statement_t*)stat);
614 break;
615 case STAT_SET:
616 hres = compile_assign_statement(ctx, (assign_statement_t*)stat, TRUE);
617 break;
618 case STAT_STOP:
619 hres = push_instr(ctx, OP_stop) == -1 ? E_OUTOFMEMORY : S_OK;
620 break;
621 default:
622 FIXME("Unimplemented statement type %d\n", stat->type);
623 hres = E_NOTIMPL;
626 if(FAILED(hres))
627 return hres;
628 stat = stat->next;
631 return S_OK;
634 static void resolve_labels(compile_ctx_t *ctx, unsigned off)
636 instr_t *instr;
638 for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
639 if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->arg1.uint & LABEL_FLAG)) {
640 assert((instr->arg1.uint & ~LABEL_FLAG) < ctx->labels_cnt);
641 instr->arg1.uint = ctx->labels[instr->arg1.uint & ~LABEL_FLAG];
643 assert(instr_info[instr->op].arg2_type != ARG_ADDR);
646 ctx->labels_cnt = 0;
649 static HRESULT compile_func(compile_ctx_t *ctx, statement_t *stat, function_t *func)
651 HRESULT hres;
653 func->code_off = ctx->instr_cnt;
655 ctx->sub_end_label = -1;
656 ctx->func_end_label = -1;
658 switch(func->type) {
659 case FUNC_FUNCTION:
660 ctx->func_end_label = alloc_label(ctx);
661 if(ctx->func_end_label == -1)
662 return E_OUTOFMEMORY; /* FIXME ! */
663 break;
664 case FUNC_SUB:
665 ctx->sub_end_label = alloc_label(ctx);
666 if(ctx->sub_end_label == -1)
667 return E_OUTOFMEMORY;
668 break;
669 case FUNC_GLOBAL:
670 break;
673 ctx->func = func;
674 ctx->dim_decls = NULL;
675 hres = compile_statement(ctx, stat);
676 ctx->func = NULL;
677 if(FAILED(hres))
678 return hres;
680 if(ctx->sub_end_label != -1)
681 label_set_addr(ctx, ctx->sub_end_label);
682 if(ctx->func_end_label != -1)
683 label_set_addr(ctx, ctx->func_end_label);
685 if(push_instr(ctx, OP_ret) == -1)
686 return E_OUTOFMEMORY;
688 resolve_labels(ctx, func->code_off);
690 if(func->var_cnt) {
691 dim_decl_t *dim_decl;
693 if(func->type == FUNC_GLOBAL) {
694 dynamic_var_t *new_var;
696 func->var_cnt = 0;
698 for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
699 new_var = compiler_alloc(ctx->code, sizeof(*new_var));
700 if(!new_var)
701 return E_OUTOFMEMORY;
703 new_var->name = compiler_alloc_string(ctx->code, dim_decl->name);
704 if(!new_var->name)
705 return E_OUTOFMEMORY;
707 V_VT(&new_var->v) = VT_EMPTY;
709 new_var->next = ctx->global_vars;
710 ctx->global_vars = new_var;
712 }else {
713 unsigned i;
715 func->vars = compiler_alloc(ctx->code, func->var_cnt * sizeof(var_desc_t));
716 if(!func->vars)
717 return E_OUTOFMEMORY;
719 for(dim_decl = ctx->dim_decls, i=0; dim_decl; dim_decl = dim_decl->next, i++) {
720 func->vars[i].name = compiler_alloc_string(ctx->code, dim_decl->name);
721 if(!func->vars[i].name)
722 return E_OUTOFMEMORY;
725 assert(i == func->var_cnt);
729 return S_OK;
732 static BOOL lookup_funcs_name(compile_ctx_t *ctx, const WCHAR *name)
734 function_t *iter;
736 for(iter = ctx->funcs; iter; iter = iter->next) {
737 if(!strcmpiW(iter->name, name))
738 return TRUE;
741 return FALSE;
744 static HRESULT create_function(compile_ctx_t *ctx, function_decl_t *decl, function_t **ret)
746 function_t *func;
747 HRESULT hres;
749 if(lookup_dim_decls(ctx, decl->name) || lookup_funcs_name(ctx, decl->name)) {
750 FIXME("%s: redefinition\n", debugstr_w(decl->name));
751 return E_FAIL;
754 func = compiler_alloc(ctx->code, sizeof(*func));
755 if(!func)
756 return E_OUTOFMEMORY;
758 func->name = compiler_alloc_string(ctx->code, decl->name);
759 if(!func->name)
760 return E_OUTOFMEMORY;
762 func->vars = NULL;
763 func->var_cnt = 0;
764 func->code_ctx = ctx->code;
765 func->type = decl->type;
766 func->is_public = decl->is_public;
768 func->arg_cnt = 0;
769 if(decl->args) {
770 arg_decl_t *arg;
771 unsigned i;
773 for(arg = decl->args; arg; arg = arg->next)
774 func->arg_cnt++;
776 func->args = compiler_alloc(ctx->code, func->arg_cnt * sizeof(arg_desc_t));
777 if(!func->args)
778 return E_OUTOFMEMORY;
780 for(i = 0, arg = decl->args; arg; arg = arg->next, i++) {
781 func->args[i].name = compiler_alloc_string(ctx->code, arg->name);
782 if(!func->args[i].name)
783 return E_OUTOFMEMORY;
784 func->args[i].by_ref = arg->by_ref;
786 }else {
787 func->args = NULL;
790 hres = compile_func(ctx, decl->body, func);
791 if(FAILED(hres))
792 return hres;
794 *ret = func;
795 return S_OK;
798 static BOOL lookup_class_name(compile_ctx_t *ctx, const WCHAR *name)
800 class_desc_t *iter;
802 for(iter = ctx->classes; iter; iter = iter->next) {
803 if(!strcmpiW(iter->name, name))
804 return TRUE;
807 return FALSE;
810 static HRESULT create_class_funcprop(compile_ctx_t *ctx, function_decl_t *func_decl, vbdisp_funcprop_desc_t *desc)
812 desc->name = compiler_alloc_string(ctx->code, func_decl->name);
813 if(!desc->name)
814 return E_OUTOFMEMORY;
816 assert(!desc->entries[0]);
818 if(func_decl->is_public)
819 desc->is_public = TRUE;
821 return create_function(ctx, func_decl, desc->entries);
824 static HRESULT compile_class(compile_ctx_t *ctx, class_decl_t *class_decl)
826 function_decl_t *func_decl;
827 class_desc_t *class_desc;
828 unsigned i;
829 HRESULT hres;
831 if(lookup_dim_decls(ctx, class_decl->name) || lookup_funcs_name(ctx, class_decl->name)
832 || lookup_class_name(ctx, class_decl->name)) {
833 FIXME("%s: redefinition\n", debugstr_w(class_decl->name));
834 return E_FAIL;
837 class_desc = compiler_alloc(ctx->code, sizeof(*class_desc));
838 if(!class_desc)
839 return E_OUTOFMEMORY;
841 class_desc->name = compiler_alloc_string(ctx->code, class_decl->name);
842 if(!class_desc->name)
843 return E_OUTOFMEMORY;
845 class_desc->func_cnt = 1; /* always allocate slot for default getter */
847 for(func_decl = class_decl->funcs; func_decl; func_decl = func_decl->next)
848 class_desc->func_cnt++;
850 class_desc->funcs = compiler_alloc(ctx->code, class_desc->func_cnt*sizeof(*class_desc->funcs));
851 if(!class_desc->funcs)
852 return E_OUTOFMEMORY;
853 memset(class_desc->funcs, 0, class_desc->func_cnt*sizeof(*class_desc->funcs));
855 for(func_decl = class_decl->funcs, i=1; func_decl; func_decl = func_decl->next, i++) {
856 hres = create_class_funcprop(ctx, func_decl, class_desc->funcs + i);
857 if(FAILED(hres))
858 return hres;
861 class_desc->next = ctx->classes;
862 ctx->classes = class_desc;
863 return S_OK;
866 static BOOL lookup_script_identifier(script_ctx_t *script, const WCHAR *identifier)
868 class_desc_t *class;
869 dynamic_var_t *var;
870 function_t *func;
872 for(var = script->global_vars; var; var = var->next) {
873 if(!strcmpiW(var->name, identifier))
874 return TRUE;
877 for(func = script->global_funcs; func; func = func->next) {
878 if(!strcmpiW(func->name, identifier))
879 return TRUE;
882 for(class = script->classes; class; class = class->next) {
883 if(!strcmpiW(class->name, identifier))
884 return TRUE;
887 return FALSE;
890 static HRESULT check_script_collisions(compile_ctx_t *ctx, script_ctx_t *script)
892 class_desc_t *class;
893 dynamic_var_t *var;
894 function_t *func;
896 for(var = ctx->global_vars; var; var = var->next) {
897 if(lookup_script_identifier(script, var->name)) {
898 FIXME("%s: redefined\n", debugstr_w(var->name));
899 return E_FAIL;
903 for(func = ctx->funcs; func; func = func->next) {
904 if(lookup_script_identifier(script, func->name)) {
905 FIXME("%s: redefined\n", debugstr_w(func->name));
906 return E_FAIL;
910 for(class = ctx->classes; class; class = class->next) {
911 if(lookup_script_identifier(script, class->name)) {
912 FIXME("%s: redefined\n", debugstr_w(class->name));
913 return E_FAIL;
917 return S_OK;
920 void release_vbscode(vbscode_t *code)
922 unsigned i;
924 list_remove(&code->entry);
926 for(i=0; i < code->bstr_cnt; i++)
927 SysFreeString(code->bstr_pool[i]);
929 vbsheap_free(&code->heap);
931 heap_free(code->bstr_pool);
932 heap_free(code->source);
933 heap_free(code->instrs);
934 heap_free(code);
937 static vbscode_t *alloc_vbscode(compile_ctx_t *ctx, const WCHAR *source)
939 vbscode_t *ret;
941 ret = heap_alloc(sizeof(*ret));
942 if(!ret)
943 return NULL;
945 ret->source = heap_strdupW(source);
946 if(!ret->source) {
947 heap_free(ret);
948 return NULL;
951 ret->instrs = heap_alloc(32*sizeof(instr_t));
952 if(!ret->instrs) {
953 release_vbscode(ret);
954 return NULL;
957 ctx->instr_cnt = 0;
958 ctx->instr_size = 32;
959 vbsheap_init(&ret->heap);
961 ret->option_explicit = ctx->parser.option_explicit;
963 ret->bstr_pool = NULL;
964 ret->bstr_pool_size = 0;
965 ret->bstr_cnt = 0;
966 ret->global_executed = FALSE;
968 ret->global_code.type = FUNC_GLOBAL;
969 ret->global_code.name = NULL;
970 ret->global_code.code_ctx = ret;
971 ret->global_code.vars = NULL;
972 ret->global_code.var_cnt = 0;
973 ret->global_code.arg_cnt = 0;
974 ret->global_code.args = NULL;
976 list_init(&ret->entry);
977 return ret;
980 static void release_compiler(compile_ctx_t *ctx)
982 parser_release(&ctx->parser);
983 heap_free(ctx->labels);
984 if(ctx->code)
985 release_vbscode(ctx->code);
988 HRESULT compile_script(script_ctx_t *script, const WCHAR *src, vbscode_t **ret)
990 function_t *new_func;
991 function_decl_t *func_decl;
992 class_decl_t *class_decl;
993 compile_ctx_t ctx;
994 vbscode_t *code;
995 HRESULT hres;
997 hres = parse_script(&ctx.parser, src);
998 if(FAILED(hres))
999 return hres;
1001 code = ctx.code = alloc_vbscode(&ctx, src);
1002 if(!ctx.code)
1003 return E_OUTOFMEMORY;
1005 ctx.funcs = NULL;
1006 ctx.func_decls = NULL;
1007 ctx.global_vars = NULL;
1008 ctx.dim_decls = NULL;
1009 ctx.classes = NULL;
1010 ctx.labels = NULL;
1011 ctx.labels_cnt = ctx.labels_size = 0;
1013 hres = compile_func(&ctx, ctx.parser.stats, &ctx.code->global_code);
1014 if(FAILED(hres)) {
1015 release_compiler(&ctx);
1016 return hres;
1019 for(func_decl = ctx.func_decls; func_decl; func_decl = func_decl->next) {
1020 hres = create_function(&ctx, func_decl, &new_func);
1021 if(FAILED(hres)) {
1022 release_compiler(&ctx);
1023 return hres;
1026 new_func->next = ctx.funcs;
1027 ctx.funcs = new_func;
1030 for(class_decl = ctx.parser.class_decls; class_decl; class_decl = class_decl->next) {
1031 hres = compile_class(&ctx, class_decl);
1032 if(FAILED(hres)) {
1033 release_compiler(&ctx);
1034 return hres;
1038 hres = check_script_collisions(&ctx, script);
1039 if(FAILED(hres)) {
1040 release_compiler(&ctx);
1041 return hres;
1044 if(ctx.global_vars) {
1045 dynamic_var_t *var;
1047 for(var = ctx.global_vars; var->next; var = var->next);
1049 var->next = script->global_vars;
1050 script->global_vars = ctx.global_vars;
1053 if(ctx.funcs) {
1054 for(new_func = ctx.funcs; new_func->next; new_func = new_func->next);
1056 new_func->next = script->global_funcs;
1057 script->global_funcs = ctx.funcs;
1060 if(ctx.classes) {
1061 class_desc_t *class = ctx.classes;
1063 while(1) {
1064 class->ctx = script;
1065 if(!class->next)
1066 break;
1067 class = class->next;
1070 class->next = script->classes;
1071 script->classes = ctx.classes;
1074 if(TRACE_ON(vbscript_disas))
1075 dump_code(&ctx);
1077 ctx.code = NULL;
1078 release_compiler(&ctx);
1080 list_add_tail(&script->code_list, &code->entry);
1081 *ret = code;
1082 return S_OK;