dlls/vbscript/compile.c

   1 /*
   2  * Copyright 2011 Jacek Caban for CodeWeavers
   3  *
   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.
   8  *
   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.
  13  *
  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
  17  */
  18
  19 #include <assert.h>
  20
  21 #include "vbscript.h"
  22 #include "parse.h"
  23 #include "parser.tab.h"
  24
  25 #include "wine/debug.h"
  26
  27 WINE_DEFAULT_DEBUG_CHANNEL(vbscript);
  28 WINE_DECLARE_DEBUG_CHANNEL(vbscript_disas);
  29
  30 typedef struct _statement_ctx_t {
  31     unsigned stack_use;
  32
  33     unsigned while_end_label;
  34     unsigned for_end_label;
  35
  36     struct _statement_ctx_t *next;
  37 } statement_ctx_t;
  38
  39 typedef struct {
  40     parser_ctx_t parser;
  41
  42     unsigned instr_cnt;
  43     unsigned instr_size;
  44     vbscode_t *code;
  45
  46     statement_ctx_t *stat_ctx;
  47
  48     unsigned *labels;
  49     unsigned labels_size;
  50     unsigned labels_cnt;
  51
  52     unsigned sub_end_label;
  53     unsigned func_end_label;
  54     unsigned prop_end_label;
  55
  56     dim_decl_t *dim_decls;
  57     dim_decl_t *dim_decls_tail;
  58     dynamic_var_t *global_vars;
  59
  60     const_decl_t *const_decls;
  61     const_decl_t *global_consts;
  62
  63     function_t *func;
  64     function_t *funcs;
  65     function_decl_t *func_decls;
  66
  67     class_desc_t *classes;
  68 } compile_ctx_t;
  69
  70 static HRESULT compile_expression(compile_ctx_t*,expression_t*);
  71 static HRESULT compile_statement(compile_ctx_t*,statement_ctx_t*,statement_t*);
  72
  73 static const struct {
  74     const char *op_str;
  75     instr_arg_type_t arg1_type;
  76     instr_arg_type_t arg2_type;
  77 } instr_info[] = {
  78 #define X(n,a,b,c) {#n,b,c},
  79 OP_LIST
  80 #undef X
  81 };
  82
  83 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
  84 {
  85     switch(type) {
  86     case ARG_STR:
  87     case ARG_BSTR:
  88         TRACE_(vbscript_disas)("\t%s", debugstr_w(arg->str));
  89         break;
  90     case ARG_INT:
  91         TRACE_(vbscript_disas)("\t%d", arg->uint);
  92         break;
  93     case ARG_UINT:
  94     case ARG_ADDR:
  95         TRACE_(vbscript_disas)("\t%u", arg->uint);
  96         break;
  97     case ARG_DOUBLE:
  98         TRACE_(vbscript_disas)("\t%lf", *arg->dbl);
  99         break;
 100     case ARG_NONE:
 101         break;
 102     DEFAULT_UNREACHABLE;
 103     }
 104 }
 105
 106 static void dump_code(compile_ctx_t *ctx)
 107 {
 108     instr_t *instr;
 109
 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");
 116     }
 117 }
 118
 119 static inline void *compiler_alloc(vbscode_t *vbscode, size_t size)
 120 {
 121     return heap_pool_alloc(&vbscode->heap, size);
 122 }
 123
 124 static inline void *compiler_alloc_zero(vbscode_t *vbscode, size_t size)
 125 {
 126     void *ret;
 127
 128     ret = heap_pool_alloc(&vbscode->heap, size);
 129     if(ret)
 130         memset(ret, 0, size);
 131     return ret;
 132 }
 133
 134 static WCHAR *compiler_alloc_string(vbscode_t *vbscode, const WCHAR *str)
 135 {
 136     size_t size;
 137     WCHAR *ret;
 138
 139     size = (strlenW(str)+1)*sizeof(WCHAR);
 140     ret = compiler_alloc(vbscode, size);
 141     if(ret)
 142         memcpy(ret, str, size);
 143     return ret;
 144 }
 145
 146 static inline instr_t *instr_ptr(compile_ctx_t *ctx, unsigned id)
 147 {
 148     assert(id < ctx->instr_cnt);
 149     return ctx->code->instrs + id;
 150 }
 151
 152 static unsigned push_instr(compile_ctx_t *ctx, vbsop_t op)
 153 {
 154     assert(ctx->instr_size && ctx->instr_size >= ctx->instr_cnt);
 155
 156     if(ctx->instr_size == ctx->instr_cnt) {
 157         instr_t *new_instr;
 158
 159         new_instr = heap_realloc(ctx->code->instrs, ctx->instr_size*2*sizeof(instr_t));
 160         if(!new_instr)
 161             return 0;
 162
 163         ctx->code->instrs = new_instr;
 164         ctx->instr_size *= 2;
 165     }
 166
 167     ctx->code->instrs[ctx->instr_cnt].op = op;
 168     return ctx->instr_cnt++;
 169 }
 170
 171 static HRESULT push_instr_int(compile_ctx_t *ctx, vbsop_t op, LONG arg)
 172 {
 173     unsigned ret;
 174
 175     ret = push_instr(ctx, op);
 176     if(!ret)
 177         return E_OUTOFMEMORY;
 178
 179     instr_ptr(ctx, ret)->arg1.lng = arg;
 180     return S_OK;
 181 }
 182
 183 static HRESULT push_instr_uint(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
 184 {
 185     unsigned ret;
 186
 187     ret = push_instr(ctx, op);
 188     if(!ret)
 189         return E_OUTOFMEMORY;
 190
 191     instr_ptr(ctx, ret)->arg1.uint = arg;
 192     return S_OK;
 193 }
 194
 195 static HRESULT push_instr_addr(compile_ctx_t *ctx, vbsop_t op, unsigned arg)
 196 {
 197     unsigned ret;
 198
 199     ret = push_instr(ctx, op);
 200     if(!ret)
 201         return E_OUTOFMEMORY;
 202
 203     instr_ptr(ctx, ret)->arg1.uint = arg;
 204     return S_OK;
 205 }
 206
 207 static HRESULT push_instr_str(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
 208 {
 209     unsigned instr;
 210     WCHAR *str;
 211
 212     str = compiler_alloc_string(ctx->code, arg);
 213     if(!str)
 214         return E_OUTOFMEMORY;
 215
 216     instr = push_instr(ctx, op);
 217     if(!instr)
 218         return E_OUTOFMEMORY;
 219
 220     instr_ptr(ctx, instr)->arg1.str = str;
 221     return S_OK;
 222 }
 223
 224 static HRESULT push_instr_double(compile_ctx_t *ctx, vbsop_t op, double arg)
 225 {
 226     unsigned instr;
 227     double *d;
 228
 229     d = compiler_alloc(ctx->code, sizeof(double));
 230     if(!d)
 231         return E_OUTOFMEMORY;
 232
 233     instr = push_instr(ctx, op);
 234     if(!instr)
 235         return E_OUTOFMEMORY;
 236
 237     *d = arg;
 238     instr_ptr(ctx, instr)->arg1.dbl = d;
 239     return S_OK;
 240 }
 241
 242 static BSTR alloc_bstr_arg(compile_ctx_t *ctx, const WCHAR *str)
 243 {
 244     if(!ctx->code->bstr_pool_size) {
 245         ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
 246         if(!ctx->code->bstr_pool)
 247             return NULL;
 248         ctx->code->bstr_pool_size = 8;
 249     }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
 250         BSTR *new_pool;
 251
 252         new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
 253         if(!new_pool)
 254             return NULL;
 255
 256         ctx->code->bstr_pool = new_pool;
 257         ctx->code->bstr_pool_size *= 2;
 258     }
 259
 260     ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
 261     if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
 262         return NULL;
 263
 264     return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
 265 }
 266
 267 static HRESULT push_instr_bstr(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg)
 268 {
 269     unsigned instr;
 270     BSTR bstr;
 271
 272     bstr = alloc_bstr_arg(ctx, arg);
 273     if(!bstr)
 274         return E_OUTOFMEMORY;
 275
 276     instr = push_instr(ctx, op);
 277     if(!instr)
 278         return E_OUTOFMEMORY;
 279
 280     instr_ptr(ctx, instr)->arg1.bstr = bstr;
 281     return S_OK;
 282 }
 283
 284 static HRESULT push_instr_bstr_uint(compile_ctx_t *ctx, vbsop_t op, const WCHAR *arg1, unsigned arg2)
 285 {
 286     unsigned instr;
 287     BSTR bstr;
 288
 289     bstr = alloc_bstr_arg(ctx, arg1);
 290     if(!bstr)
 291         return E_OUTOFMEMORY;
 292
 293     instr = push_instr(ctx, op);
 294     if(!instr)
 295         return E_OUTOFMEMORY;
 296
 297     instr_ptr(ctx, instr)->arg1.bstr = bstr;
 298     instr_ptr(ctx, instr)->arg2.uint = arg2;
 299     return S_OK;
 300 }
 301
 302 static HRESULT push_instr_uint_bstr(compile_ctx_t *ctx, vbsop_t op, unsigned arg1, const WCHAR *arg2)
 303 {
 304     unsigned instr;
 305     BSTR bstr;
 306
 307     bstr = alloc_bstr_arg(ctx, arg2);
 308     if(!bstr)
 309         return E_OUTOFMEMORY;
 310
 311     instr = push_instr(ctx, op);
 312     if(!instr)
 313         return E_OUTOFMEMORY;
 314
 315     instr_ptr(ctx, instr)->arg1.uint = arg1;
 316     instr_ptr(ctx, instr)->arg2.bstr = bstr;
 317     return S_OK;
 318 }
 319
 320 #define LABEL_FLAG 0x80000000
 321
 322 static unsigned alloc_label(compile_ctx_t *ctx)
 323 {
 324     if(!ctx->labels_size) {
 325         ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
 326         if(!ctx->labels)
 327             return 0;
 328         ctx->labels_size = 8;
 329     }else if(ctx->labels_size == ctx->labels_cnt) {
 330         unsigned *new_labels;
 331
 332         new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
 333         if(!new_labels)
 334             return 0;
 335
 336         ctx->labels = new_labels;
 337         ctx->labels_size *= 2;
 338     }
 339
 340     return ctx->labels_cnt++ | LABEL_FLAG;
 341 }
 342
 343 static inline void label_set_addr(compile_ctx_t *ctx, unsigned label)
 344 {
 345     assert(label & LABEL_FLAG);
 346     ctx->labels[label & ~LABEL_FLAG] = ctx->instr_cnt;
 347 }
 348
 349 static expression_t *lookup_const_decls(compile_ctx_t *ctx, const WCHAR *name, BOOL lookup_global)
 350 {
 351     const_decl_t *decl;
 352
 353     for(decl = ctx->const_decls; decl; decl = decl->next) {
 354         if(!strcmpiW(decl->name, name))
 355             return decl->value_expr;
 356     }
 357
 358     if(!lookup_global)
 359         return NULL;
 360
 361     for(decl = ctx->global_consts; decl; decl = decl->next) {
 362         if(!strcmpiW(decl->name, name))
 363             return decl->value_expr;
 364     }
 365
 366     return NULL;
 367 }
 368
 369 static HRESULT compile_args(compile_ctx_t *ctx, expression_t *args, unsigned *ret)
 370 {
 371     unsigned arg_cnt = 0;
 372     HRESULT hres;
 373
 374     while(args) {
 375         hres = compile_expression(ctx, args);
 376         if(FAILED(hres))
 377             return hres;
 378
 379         arg_cnt++;
 380         args = args->next;
 381     }
 382
 383     *ret = arg_cnt;
 384     return S_OK;
 385 }
 386
 387 static HRESULT compile_member_expression(compile_ctx_t *ctx, member_expression_t *expr, BOOL ret_val)
 388 {
 389     unsigned arg_cnt = 0;
 390     HRESULT hres;
 391
 392     if(ret_val && !expr->args) {
 393         expression_t *const_expr;
 394
 395         const_expr = lookup_const_decls(ctx, expr->identifier, TRUE);
 396         if(const_expr)
 397             return compile_expression(ctx, const_expr);
 398     }
 399
 400     hres = compile_args(ctx, expr->args, &arg_cnt);
 401     if(FAILED(hres))
 402         return hres;
 403
 404     if(expr->obj_expr) {
 405         hres = compile_expression(ctx, expr->obj_expr);
 406         if(FAILED(hres))
 407             return hres;
 408
 409         hres = push_instr_bstr_uint(ctx, ret_val ? OP_mcall : OP_mcallv, expr->identifier, arg_cnt);
 410     }else {
 411         hres = push_instr_bstr_uint(ctx, ret_val ? OP_icall : OP_icallv, expr->identifier, arg_cnt);
 412     }
 413
 414     return hres;
 415 }
 416
 417 static HRESULT compile_unary_expression(compile_ctx_t *ctx, unary_expression_t *expr, vbsop_t op)
 418 {
 419     HRESULT hres;
 420
 421     hres = compile_expression(ctx, expr->subexpr);
 422     if(FAILED(hres))
 423         return hres;
 424
 425     return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
 426 }
 427
 428 static HRESULT compile_binary_expression(compile_ctx_t *ctx, binary_expression_t *expr, vbsop_t op)
 429 {
 430     HRESULT hres;
 431
 432     hres = compile_expression(ctx, expr->left);
 433     if(FAILED(hres))
 434         return hres;
 435
 436     hres = compile_expression(ctx, expr->right);
 437     if(FAILED(hres))
 438         return hres;
 439
 440     return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
 441 }
 442
 443 static HRESULT compile_expression(compile_ctx_t *ctx, expression_t *expr)
 444 {
 445     switch(expr->type) {
 446     case EXPR_ADD:
 447         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
 448     case EXPR_AND:
 449         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
 450     case EXPR_BOOL:
 451         return push_instr_int(ctx, OP_bool, ((bool_expression_t*)expr)->value);
 452     case EXPR_BRACKETS:
 453         return compile_expression(ctx, ((unary_expression_t*)expr)->subexpr);
 454     case EXPR_CONCAT:
 455         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_concat);
 456     case EXPR_DIV:
 457         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
 458     case EXPR_DOUBLE:
 459         return push_instr_double(ctx, OP_double, ((double_expression_t*)expr)->value);
 460     case EXPR_EMPTY:
 461         return push_instr(ctx, OP_empty) ? S_OK : E_OUTOFMEMORY;
 462     case EXPR_EQUAL:
 463         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_equal);
 464     case EXPR_EQV:
 465         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eqv);
 466     case EXPR_EXP:
 467         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_exp);
 468     case EXPR_GT:
 469         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
 470     case EXPR_GTEQ:
 471         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
 472     case EXPR_IDIV:
 473         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_idiv);
 474     case EXPR_IS:
 475         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_is);
 476     case EXPR_IMP:
 477         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_imp);
 478     case EXPR_LT:
 479         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
 480     case EXPR_LTEQ:
 481         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
 482     case EXPR_ME:
 483         return push_instr(ctx, OP_me) ? S_OK : E_OUTOFMEMORY;
 484     case EXPR_MEMBER:
 485         return compile_member_expression(ctx, (member_expression_t*)expr, TRUE);
 486     case EXPR_MOD:
 487         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
 488     case EXPR_MUL:
 489         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
 490     case EXPR_NEG:
 491         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
 492     case EXPR_NEQUAL:
 493         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_nequal);
 494     case EXPR_NEW:
 495         return push_instr_str(ctx, OP_new, ((string_expression_t*)expr)->value);
 496     case EXPR_NOT:
 497         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_not);
 498     case EXPR_NOTHING:
 499         return push_instr(ctx, OP_nothing) ? S_OK : E_OUTOFMEMORY;
 500     case EXPR_NULL:
 501         return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
 502     case EXPR_OR:
 503         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
 504     case EXPR_STRING:
 505         return push_instr_str(ctx, OP_string, ((string_expression_t*)expr)->value);
 506     case EXPR_SUB:
 507         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
 508     case EXPR_USHORT:
 509         return push_instr_int(ctx, OP_short, ((int_expression_t*)expr)->value);
 510     case EXPR_ULONG:
 511         return push_instr_int(ctx, OP_long, ((int_expression_t*)expr)->value);
 512     case EXPR_XOR:
 513         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
 514     default:
 515         FIXME("Unimplemented expression type %d\n", expr->type);
 516         return E_NOTIMPL;
 517     }
 518
 519     return S_OK;
 520 }
 521
 522 static HRESULT compile_if_statement(compile_ctx_t *ctx, if_statement_t *stat)
 523 {
 524     unsigned cnd_jmp, endif_label = 0;
 525     elseif_decl_t *elseif_decl;
 526     HRESULT hres;
 527
 528     hres = compile_expression(ctx, stat->expr);
 529     if(FAILED(hres))
 530         return hres;
 531
 532     cnd_jmp = push_instr(ctx, OP_jmp_false);
 533     if(!cnd_jmp)
 534         return E_OUTOFMEMORY;
 535
 536     hres = compile_statement(ctx, NULL, stat->if_stat);
 537     if(FAILED(hres))
 538         return hres;
 539
 540     if(stat->else_stat || stat->elseifs) {
 541         endif_label = alloc_label(ctx);
 542         if(!endif_label)
 543             return E_OUTOFMEMORY;
 544
 545         hres = push_instr_addr(ctx, OP_jmp, endif_label);
 546         if(FAILED(hres))
 547             return hres;
 548     }
 549
 550     for(elseif_decl = stat->elseifs; elseif_decl; elseif_decl = elseif_decl->next) {
 551         instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
 552
 553         hres = compile_expression(ctx, elseif_decl->expr);
 554         if(FAILED(hres))
 555             return hres;
 556
 557         cnd_jmp = push_instr(ctx, OP_jmp_false);
 558         if(!cnd_jmp)
 559             return E_OUTOFMEMORY;
 560
 561         hres = compile_statement(ctx, NULL, elseif_decl->stat);
 562         if(FAILED(hres))
 563             return hres;
 564
 565         hres = push_instr_addr(ctx, OP_jmp, endif_label);
 566         if(FAILED(hres))
 567             return hres;
 568     }
 569
 570     instr_ptr(ctx, cnd_jmp)->arg1.uint = ctx->instr_cnt;
 571
 572     if(stat->else_stat) {
 573         hres = compile_statement(ctx, NULL, stat->else_stat);
 574         if(FAILED(hres))
 575             return hres;
 576     }
 577
 578     if(endif_label)
 579         label_set_addr(ctx, endif_label);
 580     return S_OK;
 581 }
 582
 583 static HRESULT compile_while_statement(compile_ctx_t *ctx, while_statement_t *stat)
 584 {
 585     statement_ctx_t stat_ctx = {0}, *loop_ctx;
 586     unsigned start_addr;
 587     unsigned jmp_end;
 588     HRESULT hres;
 589
 590     start_addr = ctx->instr_cnt;
 591
 592     hres = compile_expression(ctx, stat->expr);
 593     if(FAILED(hres))
 594         return hres;
 595
 596     jmp_end = push_instr(ctx, stat->stat.type == STAT_UNTIL ? OP_jmp_true : OP_jmp_false);
 597     if(!jmp_end)
 598         return E_OUTOFMEMORY;
 599
 600     if(stat->stat.type == STAT_WHILE) {
 601         loop_ctx = NULL;
 602     }else {
 603         if(!(stat_ctx.while_end_label = alloc_label(ctx)))
 604             return E_OUTOFMEMORY;
 605         loop_ctx = &stat_ctx;
 606     }
 607
 608     hres = compile_statement(ctx, loop_ctx, stat->body);
 609     if(FAILED(hres))
 610         return hres;
 611
 612     hres = push_instr_addr(ctx, OP_jmp, start_addr);
 613     if(FAILED(hres))
 614         return hres;
 615
 616     instr_ptr(ctx, jmp_end)->arg1.uint = ctx->instr_cnt;
 617
 618     if(loop_ctx)
 619         label_set_addr(ctx, stat_ctx.while_end_label);
 620
 621     return S_OK;
 622 }
 623
 624 static HRESULT compile_dowhile_statement(compile_ctx_t *ctx, while_statement_t *stat)
 625 {
 626     statement_ctx_t loop_ctx = {0};
 627     unsigned start_addr;
 628     vbsop_t jmp_op;
 629     HRESULT hres;
 630
 631     start_addr = ctx->instr_cnt;
 632
 633     if(!(loop_ctx.while_end_label = alloc_label(ctx)))
 634         return E_OUTOFMEMORY;
 635
 636     hres = compile_statement(ctx, &loop_ctx, stat->body);
 637     if(FAILED(hres))
 638         return hres;
 639
 640     if(stat->expr) {
 641         hres = compile_expression(ctx, stat->expr);
 642         if(FAILED(hres))
 643             return hres;
 644
 645         jmp_op = stat->stat.type == STAT_DOUNTIL ? OP_jmp_false : OP_jmp_true;
 646     }else {
 647         jmp_op = OP_jmp;
 648     }
 649
 650     hres = push_instr_addr(ctx, jmp_op, start_addr);
 651     if(FAILED(hres))
 652         return hres;
 653
 654     label_set_addr(ctx, loop_ctx.while_end_label);
 655     return S_OK;
 656 }
 657
 658 static HRESULT compile_foreach_statement(compile_ctx_t *ctx, foreach_statement_t *stat)
 659 {
 660     statement_ctx_t loop_ctx = {1};
 661     unsigned loop_start;
 662     HRESULT hres;
 663
 664     hres = compile_expression(ctx, stat->group_expr);
 665     if(FAILED(hres))
 666         return hres;
 667
 668     if(!push_instr(ctx, OP_newenum))
 669         return E_OUTOFMEMORY;
 670
 671     loop_start = ctx->instr_cnt;
 672     if(!(loop_ctx.for_end_label = alloc_label(ctx)))
 673         return E_OUTOFMEMORY;
 674
 675     hres = push_instr_uint_bstr(ctx, OP_enumnext, loop_ctx.for_end_label, stat->identifier);
 676     if(FAILED(hres))
 677         return hres;
 678
 679     hres = compile_statement(ctx, &loop_ctx, stat->body);
 680     if(FAILED(hres))
 681         return hres;
 682
 683     hres = push_instr_addr(ctx, OP_jmp, loop_start);
 684     if(FAILED(hres))
 685         return hres;
 686
 687     label_set_addr(ctx, loop_ctx.for_end_label);
 688     return S_OK;
 689 }
 690
 691 static HRESULT compile_forto_statement(compile_ctx_t *ctx, forto_statement_t *stat)
 692 {
 693     statement_ctx_t loop_ctx = {2};
 694     unsigned step_instr, instr;
 695     BSTR identifier;
 696     HRESULT hres;
 697
 698     identifier = alloc_bstr_arg(ctx, stat->identifier);
 699     if(!identifier)
 700         return E_OUTOFMEMORY;
 701
 702     hres = compile_expression(ctx, stat->from_expr);
 703     if(FAILED(hres))
 704         return hres;
 705
 706     instr = push_instr(ctx, OP_assign_ident);
 707     if(!instr)
 708         return E_OUTOFMEMORY;
 709     instr_ptr(ctx, instr)->arg1.bstr = identifier;
 710     instr_ptr(ctx, instr)->arg2.uint = 0;
 711
 712     hres = compile_expression(ctx, stat->to_expr);
 713     if(FAILED(hres))
 714         return hres;
 715
 716     if(!push_instr(ctx, OP_val))
 717         return E_OUTOFMEMORY;
 718
 719     if(stat->step_expr) {
 720         hres = compile_expression(ctx, stat->step_expr);
 721         if(FAILED(hres))
 722             return hres;
 723
 724         if(!push_instr(ctx, OP_val))
 725             return E_OUTOFMEMORY;
 726     }else {
 727         hres = push_instr_int(ctx, OP_short, 1);
 728         if(FAILED(hres))
 729             return hres;
 730     }
 731
 732     loop_ctx.for_end_label = alloc_label(ctx);
 733     if(!loop_ctx.for_end_label)
 734         return E_OUTOFMEMORY;
 735
 736     step_instr = push_instr(ctx, OP_step);
 737     if(!step_instr)
 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;
 741
 742     hres = compile_statement(ctx, &loop_ctx, stat->body);
 743     if(FAILED(hres))
 744         return hres;
 745
 746     instr = push_instr(ctx, OP_incc);
 747     if(!instr)
 748         return E_OUTOFMEMORY;
 749     instr_ptr(ctx, instr)->arg1.bstr = identifier;
 750
 751     hres = push_instr_addr(ctx, OP_jmp, step_instr);
 752     if(FAILED(hres))
 753         return hres;
 754
 755     hres = push_instr_uint(ctx, OP_pop, 2);
 756     if(FAILED(hres))
 757         return hres;
 758
 759     label_set_addr(ctx, loop_ctx.for_end_label);
 760     return S_OK;
 761 }
 762
 763 static HRESULT compile_select_statement(compile_ctx_t *ctx, select_statement_t *stat)
 764 {
 765     unsigned end_label, case_cnt = 0, *case_labels = NULL, i;
 766     case_clausule_t *case_iter;
 767     expression_t *expr_iter;
 768     HRESULT hres;
 769
 770     hres = compile_expression(ctx, stat->expr);
 771     if(FAILED(hres))
 772         return hres;
 773
 774     if(!push_instr(ctx, OP_val))
 775         return E_OUTOFMEMORY;
 776
 777     end_label = alloc_label(ctx);
 778     if(!end_label)
 779         return E_OUTOFMEMORY;
 780
 781     for(case_iter = stat->case_clausules; case_iter; case_iter = case_iter->next)
 782         case_cnt++;
 783
 784     if(case_cnt) {
 785         case_labels = heap_alloc(case_cnt*sizeof(*case_labels));
 786         if(!case_labels)
 787             return E_OUTOFMEMORY;
 788     }
 789
 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;
 794             break;
 795         }
 796
 797         if(!case_iter->expr)
 798             break;
 799
 800         for(expr_iter = case_iter->expr; expr_iter; expr_iter = expr_iter->next) {
 801             hres = compile_expression(ctx, expr_iter);
 802             if(FAILED(hres))
 803                 break;
 804
 805             hres = push_instr_addr(ctx, OP_case, case_labels[i]);
 806             if(FAILED(hres))
 807                 break;
 808         }
 809     }
 810
 811     if(FAILED(hres)) {
 812         heap_free(case_labels);
 813         return hres;
 814     }
 815
 816     hres = push_instr_uint(ctx, OP_pop, 1);
 817     if(FAILED(hres)) {
 818         heap_free(case_labels);
 819         return hres;
 820     }
 821
 822     hres = push_instr_addr(ctx, OP_jmp, case_iter ? case_labels[i] : end_label);
 823     if(FAILED(hres)) {
 824         heap_free(case_labels);
 825         return hres;
 826     }
 827
 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);
 831         if(FAILED(hres))
 832             break;
 833
 834         if(!case_iter->next)
 835             break;
 836
 837         hres = push_instr_addr(ctx, OP_jmp, end_label);
 838         if(FAILED(hres))
 839             break;
 840     }
 841
 842     heap_free(case_labels);
 843     if(FAILED(hres))
 844         return hres;
 845
 846     label_set_addr(ctx, end_label);
 847     return S_OK;
 848 }
 849
 850 static HRESULT compile_assignment(compile_ctx_t *ctx, member_expression_t *member_expr, expression_t *value_expr, BOOL is_set)
 851 {
 852     unsigned args_cnt;
 853     vbsop_t op;
 854     HRESULT hres;
 855
 856     if(member_expr->obj_expr) {
 857         hres = compile_expression(ctx, member_expr->obj_expr);
 858         if(FAILED(hres))
 859             return hres;
 860
 861         op = is_set ? OP_set_member : OP_assign_member;
 862     }else {
 863         op = is_set ? OP_set_ident : OP_assign_ident;
 864     }
 865
 866     hres = compile_expression(ctx, value_expr);
 867     if(FAILED(hres))
 868         return hres;
 869
 870     hres = compile_args(ctx, member_expr->args, &args_cnt);
 871     if(FAILED(hres))
 872         return hres;
 873
 874     return push_instr_bstr_uint(ctx, op, member_expr->identifier, args_cnt);
 875 }
 876
 877 static HRESULT compile_assign_statement(compile_ctx_t *ctx, assign_statement_t *stat, BOOL is_set)
 878 {
 879     return compile_assignment(ctx, stat->member_expr, stat->value_expr, is_set);
 880 }
 881
 882 static HRESULT compile_call_statement(compile_ctx_t *ctx, call_statement_t *stat)
 883 {
 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;
 888
 889         if(eqexpr->left->type == EXPR_BRACKETS) {
 890             member_expression_t new_member = *stat->expr;
 891
 892             WARN("converting call expr to assign expr\n");
 893
 894             new_member.args = ((unary_expression_t*)eqexpr->left)->subexpr;
 895             return compile_assignment(ctx, &new_member, eqexpr->right, FALSE);
 896         }
 897     }
 898
 899     return compile_member_expression(ctx, stat->expr, FALSE);
 900 }
 901
 902 static BOOL lookup_dim_decls(compile_ctx_t *ctx, const WCHAR *name)
 903 {
 904     dim_decl_t *dim_decl;
 905
 906     for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
 907         if(!strcmpiW(dim_decl->name, name))
 908             return TRUE;
 909     }
 910
 911     return FALSE;
 912 }
 913
 914 static BOOL lookup_args_name(compile_ctx_t *ctx, const WCHAR *name)
 915 {
 916     unsigned i;
 917
 918     for(i = 0; i < ctx->func->arg_cnt; i++) {
 919         if(!strcmpiW(ctx->func->args[i].name, name))
 920             return TRUE;
 921     }
 922
 923     return FALSE;
 924 }
 925
 926 static HRESULT compile_dim_statement(compile_ctx_t *ctx, dim_statement_t *stat)
 927 {
 928     dim_decl_t *dim_decl = stat->dim_decls;
 929
 930     while(1) {
 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));
 934             return E_FAIL;
 935         }
 936
 937         ctx->func->var_cnt++;
 938
 939         if(dim_decl->is_array) {
 940             HRESULT hres = push_instr_bstr_uint(ctx, OP_dim, dim_decl->name, ctx->func->array_cnt++);
 941             if(FAILED(hres))
 942                 return hres;
 943         }
 944
 945         if(!dim_decl->next)
 946             break;
 947         dim_decl = dim_decl->next;
 948     }
 949
 950     if(ctx->dim_decls_tail)
 951         ctx->dim_decls_tail->next = stat->dim_decls;
 952     else
 953         ctx->dim_decls = stat->dim_decls;
 954     ctx->dim_decls_tail = dim_decl;
 955     return S_OK;
 956 }
 957
 958 static HRESULT compile_const_statement(compile_ctx_t *ctx, const_statement_t *stat)
 959 {
 960     const_decl_t *decl, *next_decl = stat->decls;
 961
 962     do {
 963         decl = next_decl;
 964
 965         if(lookup_const_decls(ctx, decl->name, FALSE) || lookup_args_name(ctx, decl->name)
 966                 || lookup_dim_decls(ctx, decl->name)) {
 967             FIXME("%s redefined\n", debugstr_w(decl->name));
 968             return E_FAIL;
 969         }
 970
 971         if(ctx->func->type == FUNC_GLOBAL) {
 972             HRESULT hres;
 973
 974             hres = compile_expression(ctx, decl->value_expr);
 975             if(FAILED(hres))
 976                 return hres;
 977
 978             hres = push_instr_bstr(ctx, OP_const, decl->name);
 979             if(FAILED(hres))
 980                 return hres;
 981         }
 982
 983         next_decl = decl->next;
 984         decl->next = ctx->const_decls;
 985         ctx->const_decls = decl;
 986     } while(next_decl);
 987
 988     return S_OK;
 989 }
 990
 991 static HRESULT compile_function_statement(compile_ctx_t *ctx, function_statement_t *stat)
 992 {
 993     if(ctx->func != &ctx->code->main_code) {
 994         FIXME("Function is not in the global code\n");
 995         return E_FAIL;
 996     }
 997
 998     stat->func_decl->next = ctx->func_decls;
 999     ctx->func_decls = stat->func_decl;
1000     return S_OK;
1001 }
1002
1003 static HRESULT compile_exitdo_statement(compile_ctx_t *ctx)
1004 {
1005     statement_ctx_t *iter;
1006     unsigned pop_cnt = 0;
1007
1008     for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1009         pop_cnt += iter->stack_use;
1010         if(iter->while_end_label)
1011             break;
1012     }
1013     if(!iter) {
1014         FIXME("Exit Do outside Do Loop\n");
1015         return E_FAIL;
1016     }
1017
1018     if(pop_cnt) {
1019         HRESULT hres;
1020
1021         hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1022         if(FAILED(hres))
1023             return hres;
1024     }
1025
1026     return push_instr_addr(ctx, OP_jmp, iter->while_end_label);
1027 }
1028
1029 static HRESULT compile_exitfor_statement(compile_ctx_t *ctx)
1030 {
1031     statement_ctx_t *iter;
1032     unsigned pop_cnt = 0;
1033
1034     for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1035         pop_cnt += iter->stack_use;
1036         if(iter->for_end_label)
1037             break;
1038     }
1039     if(!iter) {
1040         FIXME("Exit For outside For loop\n");
1041         return E_FAIL;
1042     }
1043
1044     if(pop_cnt) {
1045         HRESULT hres;
1046
1047         hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1048         if(FAILED(hres))
1049             return hres;
1050     }
1051
1052     return push_instr_addr(ctx, OP_jmp, iter->for_end_label);
1053 }
1054
1055 static HRESULT exit_label(compile_ctx_t *ctx, unsigned jmp_label)
1056 {
1057     statement_ctx_t *iter;
1058     unsigned pop_cnt = 0;
1059
1060     for(iter = ctx->stat_ctx; iter; iter = iter->next)
1061         pop_cnt += iter->stack_use;
1062
1063     if(pop_cnt) {
1064         HRESULT hres;
1065
1066         hres = push_instr_uint(ctx, OP_pop, pop_cnt);
1067         if(FAILED(hres))
1068             return hres;
1069     }
1070
1071     return push_instr_addr(ctx, OP_jmp, jmp_label);
1072 }
1073
1074 static HRESULT compile_exitsub_statement(compile_ctx_t *ctx)
1075 {
1076     if(!ctx->sub_end_label) {
1077         FIXME("Exit Sub outside Sub?\n");
1078         return E_FAIL;
1079     }
1080
1081     return exit_label(ctx, ctx->sub_end_label);
1082 }
1083
1084 static HRESULT compile_exitfunc_statement(compile_ctx_t *ctx)
1085 {
1086     if(!ctx->func_end_label) {
1087         FIXME("Exit Function outside Function?\n");
1088         return E_FAIL;
1089     }
1090
1091     return exit_label(ctx, ctx->func_end_label);
1092 }
1093
1094 static HRESULT compile_exitprop_statement(compile_ctx_t *ctx)
1095 {
1096     if(!ctx->prop_end_label) {
1097         FIXME("Exit Property outside Property?\n");
1098         return E_FAIL;
1099     }
1100
1101     return exit_label(ctx, ctx->prop_end_label);
1102 }
1103
1104 static HRESULT compile_onerror_statement(compile_ctx_t *ctx, onerror_statement_t *stat)
1105 {
1106     return push_instr_int(ctx, OP_errmode, stat->resume_next);
1107 }
1108
1109 static HRESULT compile_statement(compile_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1110 {
1111     HRESULT hres;
1112
1113     if(stat_ctx) {
1114         stat_ctx->next = ctx->stat_ctx;
1115         ctx->stat_ctx = stat_ctx;
1116     }
1117
1118     while(stat) {
1119         switch(stat->type) {
1120         case STAT_ASSIGN:
1121             hres = compile_assign_statement(ctx, (assign_statement_t*)stat, FALSE);
1122             break;
1123         case STAT_CALL:
1124             hres = compile_call_statement(ctx, (call_statement_t*)stat);
1125             break;
1126         case STAT_CONST:
1127             hres = compile_const_statement(ctx, (const_statement_t*)stat);
1128             break;
1129         case STAT_DIM:
1130             hres = compile_dim_statement(ctx, (dim_statement_t*)stat);
1131             break;
1132         case STAT_DOWHILE:
1133         case STAT_DOUNTIL:
1134             hres = compile_dowhile_statement(ctx, (while_statement_t*)stat);
1135             break;
1136         case STAT_EXITDO:
1137             hres = compile_exitdo_statement(ctx);
1138             break;
1139         case STAT_EXITFOR:
1140             hres = compile_exitfor_statement(ctx);
1141             break;
1142         case STAT_EXITFUNC:
1143             hres = compile_exitfunc_statement(ctx);
1144             break;
1145         case STAT_EXITPROP:
1146             hres = compile_exitprop_statement(ctx);
1147             break;
1148         case STAT_EXITSUB:
1149             hres = compile_exitsub_statement(ctx);
1150             break;
1151         case STAT_FOREACH:
1152             hres = compile_foreach_statement(ctx, (foreach_statement_t*)stat);
1153             break;
1154         case STAT_FORTO:
1155             hres = compile_forto_statement(ctx, (forto_statement_t*)stat);
1156             break;
1157         case STAT_FUNC:
1158             hres = compile_function_statement(ctx, (function_statement_t*)stat);
1159             break;
1160         case STAT_IF:
1161             hres = compile_if_statement(ctx, (if_statement_t*)stat);
1162             break;
1163         case STAT_ONERROR:
1164             hres = compile_onerror_statement(ctx, (onerror_statement_t*)stat);
1165             break;
1166         case STAT_SELECT:
1167             hres = compile_select_statement(ctx, (select_statement_t*)stat);
1168             break;
1169         case STAT_SET:
1170             hres = compile_assign_statement(ctx, (assign_statement_t*)stat, TRUE);
1171             break;
1172         case STAT_STOP:
1173             hres = push_instr(ctx, OP_stop) ? S_OK : E_OUTOFMEMORY;
1174             break;
1175         case STAT_UNTIL:
1176         case STAT_WHILE:
1177         case STAT_WHILELOOP:
1178             hres = compile_while_statement(ctx, (while_statement_t*)stat);
1179             break;
1180         default:
1181             FIXME("Unimplemented statement type %d\n", stat->type);
1182             hres = E_NOTIMPL;
1183         }
1184
1185         if(FAILED(hres))
1186             return hres;
1187         stat = stat->next;
1188     }
1189
1190     if(stat_ctx) {
1191         assert(ctx->stat_ctx == stat_ctx);
1192         ctx->stat_ctx = stat_ctx->next;
1193     }
1194
1195     return S_OK;
1196 }
1197
1198 static void resolve_labels(compile_ctx_t *ctx, unsigned off)
1199 {
1200     instr_t *instr;
1201
1202     for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->instr_cnt; instr++) {
1203         if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->arg1.uint & LABEL_FLAG)) {
1204             assert((instr->arg1.uint & ~LABEL_FLAG) < ctx->labels_cnt);
1205             instr->arg1.uint = ctx->labels[instr->arg1.uint & ~LABEL_FLAG];
1206         }
1207         assert(instr_info[instr->op].arg2_type != ARG_ADDR);
1208     }
1209
1210     ctx->labels_cnt = 0;
1211 }
1212
1213 static HRESULT compile_func(compile_ctx_t *ctx, statement_t *stat, function_t *func)
1214 {
1215     HRESULT hres;
1216
1217     func->code_off = ctx->instr_cnt;
1218
1219     ctx->sub_end_label = 0;
1220     ctx->func_end_label = 0;
1221     ctx->prop_end_label = 0;
1222
1223     switch(func->type) {
1224     case FUNC_FUNCTION:
1225         ctx->func_end_label = alloc_label(ctx);
1226         if(!ctx->func_end_label)
1227             return E_OUTOFMEMORY;
1228         break;
1229     case FUNC_SUB:
1230         ctx->sub_end_label = alloc_label(ctx);
1231         if(!ctx->sub_end_label)
1232             return E_OUTOFMEMORY;
1233         break;
1234     case FUNC_PROPGET:
1235     case FUNC_PROPLET:
1236     case FUNC_PROPSET:
1237     case FUNC_DEFGET:
1238         ctx->prop_end_label = alloc_label(ctx);
1239         if(!ctx->prop_end_label)
1240             return E_OUTOFMEMORY;
1241         break;
1242     case FUNC_GLOBAL:
1243         break;
1244     }
1245
1246     ctx->func = func;
1247     ctx->dim_decls = ctx->dim_decls_tail = NULL;
1248     ctx->const_decls = NULL;
1249     hres = compile_statement(ctx, NULL, stat);
1250     ctx->func = NULL;
1251     if(FAILED(hres))
1252         return hres;
1253
1254     if(ctx->sub_end_label)
1255         label_set_addr(ctx, ctx->sub_end_label);
1256     if(ctx->func_end_label)
1257         label_set_addr(ctx, ctx->func_end_label);
1258     if(ctx->prop_end_label)
1259         label_set_addr(ctx, ctx->prop_end_label);
1260
1261     if(!push_instr(ctx, OP_ret))
1262         return E_OUTOFMEMORY;
1263
1264     resolve_labels(ctx, func->code_off);
1265
1266     if(func->var_cnt) {
1267         dim_decl_t *dim_decl;
1268
1269         if(func->type == FUNC_GLOBAL) {
1270             dynamic_var_t *new_var;
1271
1272             func->var_cnt = 0;
1273
1274             for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
1275                 new_var = compiler_alloc(ctx->code, sizeof(*new_var));
1276                 if(!new_var)
1277                     return E_OUTOFMEMORY;
1278
1279                 new_var->name = compiler_alloc_string(ctx->code, dim_decl->name);
1280                 if(!new_var->name)
1281                     return E_OUTOFMEMORY;
1282
1283                 V_VT(&new_var->v) = VT_EMPTY;
1284                 new_var->is_const = FALSE;
1285
1286                 new_var->next = ctx->global_vars;
1287                 ctx->global_vars = new_var;
1288             }
1289         }else {
1290             unsigned i;
1291
1292             func->vars = compiler_alloc(ctx->code, func->var_cnt * sizeof(var_desc_t));
1293             if(!func->vars)
1294                 return E_OUTOFMEMORY;
1295
1296             for(dim_decl = ctx->dim_decls, i=0; dim_decl; dim_decl = dim_decl->next, i++) {
1297                 func->vars[i].name = compiler_alloc_string(ctx->code, dim_decl->name);
1298                 if(!func->vars[i].name)
1299                     return E_OUTOFMEMORY;
1300             }
1301
1302             assert(i == func->var_cnt);
1303         }
1304     }
1305
1306     if(func->array_cnt) {
1307         unsigned dim_cnt, array_id = 0;
1308         dim_decl_t *dim_decl;
1309         dim_list_t *iter;
1310
1311         func->array_descs = compiler_alloc(ctx->code, func->array_cnt * sizeof(array_desc_t));
1312         if(!func->array_descs)
1313             return E_OUTOFMEMORY;
1314
1315         for(dim_decl = ctx->dim_decls; dim_decl; dim_decl = dim_decl->next) {
1316             if(!dim_decl->is_array)
1317                 continue;
1318
1319             dim_cnt = 0;
1320             for(iter = dim_decl->dims; iter; iter = iter->next)
1321                 dim_cnt++;
1322
1323             func->array_descs[array_id].bounds = compiler_alloc(ctx->code, dim_cnt * sizeof(SAFEARRAYBOUND));
1324             if(!func->array_descs[array_id].bounds)
1325                 return E_OUTOFMEMORY;
1326
1327             func->array_descs[array_id].dim_cnt = dim_cnt;
1328
1329             dim_cnt = 0;
1330             for(iter = dim_decl->dims; iter; iter = iter->next) {
1331                 func->array_descs[array_id].bounds[dim_cnt].cElements = iter->val+1;
1332                 func->array_descs[array_id].bounds[dim_cnt++].lLbound = 0;
1333             }
1334
1335             array_id++;
1336         }
1337
1338         assert(array_id == func->array_cnt);
1339     }
1340
1341     return S_OK;
1342 }
1343
1344 static BOOL lookup_funcs_name(compile_ctx_t *ctx, const WCHAR *name)
1345 {
1346     function_t *iter;
1347
1348     for(iter = ctx->funcs; iter; iter = iter->next) {
1349         if(!strcmpiW(iter->name, name))
1350             return TRUE;
1351     }
1352
1353     return FALSE;
1354 }
1355
1356 static HRESULT create_function(compile_ctx_t *ctx, function_decl_t *decl, function_t **ret)
1357 {
1358     function_t *func;
1359     HRESULT hres;
1360
1361     if(lookup_dim_decls(ctx, decl->name) || lookup_funcs_name(ctx, decl->name) || lookup_const_decls(ctx, decl->name, FALSE)) {
1362         FIXME("%s: redefinition\n", debugstr_w(decl->name));
1363         return E_FAIL;
1364     }
1365
1366     func = compiler_alloc(ctx->code, sizeof(*func));
1367     if(!func)
1368         return E_OUTOFMEMORY;
1369
1370     func->name = compiler_alloc_string(ctx->code, decl->name);
1371     if(!func->name)
1372         return E_OUTOFMEMORY;
1373
1374     func->vars = NULL;
1375     func->var_cnt = 0;
1376     func->array_cnt = 0;
1377     func->code_ctx = ctx->code;
1378     func->type = decl->type;
1379     func->is_public = decl->is_public;
1380
1381     func->arg_cnt = 0;
1382     if(decl->args) {
1383         arg_decl_t *arg;
1384         unsigned i;
1385
1386         for(arg = decl->args; arg; arg = arg->next)
1387             func->arg_cnt++;
1388
1389         func->args = compiler_alloc(ctx->code, func->arg_cnt * sizeof(arg_desc_t));
1390         if(!func->args)
1391             return E_OUTOFMEMORY;
1392
1393         for(i = 0, arg = decl->args; arg; arg = arg->next, i++) {
1394             func->args[i].name = compiler_alloc_string(ctx->code, arg->name);
1395             if(!func->args[i].name)
1396                 return E_OUTOFMEMORY;
1397             func->args[i].by_ref = arg->by_ref;
1398         }
1399     }else {
1400         func->args = NULL;
1401     }
1402
1403     hres = compile_func(ctx, decl->body, func);
1404     if(FAILED(hres))
1405         return hres;
1406
1407     *ret = func;
1408     return S_OK;
1409 }
1410
1411 static BOOL lookup_class_name(compile_ctx_t *ctx, const WCHAR *name)
1412 {
1413     class_desc_t *iter;
1414
1415     for(iter = ctx->classes; iter; iter = iter->next) {
1416         if(!strcmpiW(iter->name, name))
1417             return TRUE;
1418     }
1419
1420     return FALSE;
1421 }
1422
1423 static HRESULT create_class_funcprop(compile_ctx_t *ctx, function_decl_t *func_decl, vbdisp_funcprop_desc_t *desc)
1424 {
1425     vbdisp_invoke_type_t invoke_type;
1426     function_decl_t *funcprop_decl;
1427     HRESULT hres;
1428
1429     desc->name = compiler_alloc_string(ctx->code, func_decl->name);
1430     if(!desc->name)
1431         return E_OUTOFMEMORY;
1432
1433     for(funcprop_decl = func_decl; funcprop_decl; funcprop_decl = funcprop_decl->next_prop_func) {
1434         switch(funcprop_decl->type) {
1435         case FUNC_FUNCTION:
1436         case FUNC_SUB:
1437         case FUNC_PROPGET:
1438         case FUNC_DEFGET:
1439             invoke_type = VBDISP_CALLGET;
1440             break;
1441         case FUNC_PROPLET:
1442             invoke_type = VBDISP_LET;
1443             break;
1444         case FUNC_PROPSET:
1445             invoke_type = VBDISP_SET;
1446             break;
1447         DEFAULT_UNREACHABLE;
1448         }
1449
1450         assert(!desc->entries[invoke_type]);
1451
1452         if(funcprop_decl->is_public)
1453             desc->is_public = TRUE;
1454
1455         hres = create_function(ctx, funcprop_decl, desc->entries+invoke_type);
1456         if(FAILED(hres))
1457             return hres;
1458     }
1459
1460     return S_OK;
1461 }
1462
1463 static BOOL lookup_class_funcs(class_desc_t *class_desc, const WCHAR *name)
1464 {
1465     unsigned i;
1466
1467     for(i=0; i < class_desc->func_cnt; i++) {
1468         if(class_desc->funcs[i].name && !strcmpiW(class_desc->funcs[i].name, name))
1469             return TRUE;
1470     }
1471
1472     return FALSE;
1473 }
1474
1475 static HRESULT compile_class(compile_ctx_t *ctx, class_decl_t *class_decl)
1476 {
1477     function_decl_t *func_decl, *func_prop_decl;
1478     class_prop_decl_t *prop_decl;
1479     class_desc_t *class_desc;
1480     unsigned i;
1481     HRESULT hres;
1482
1483     static const WCHAR class_initializeW[] = {'c','l','a','s','s','_','i','n','i','t','i','a','l','i','z','e',0};
1484     static const WCHAR class_terminateW[] = {'c','l','a','s','s','_','t','e','r','m','i','n','a','t','e',0};
1485
1486     if(lookup_dim_decls(ctx, class_decl->name) || lookup_funcs_name(ctx, class_decl->name)
1487             || lookup_const_decls(ctx, class_decl->name, FALSE) || lookup_class_name(ctx, class_decl->name)) {
1488         FIXME("%s: redefinition\n", debugstr_w(class_decl->name));
1489         return E_FAIL;
1490     }
1491
1492     class_desc = compiler_alloc_zero(ctx->code, sizeof(*class_desc));
1493     if(!class_desc)
1494         return E_OUTOFMEMORY;
1495
1496     class_desc->name = compiler_alloc_string(ctx->code, class_decl->name);
1497     if(!class_desc->name)
1498         return E_OUTOFMEMORY;
1499
1500     class_desc->func_cnt = 1; /* always allocate slot for default getter */
1501
1502     for(func_decl = class_decl->funcs; func_decl; func_decl = func_decl->next) {
1503         for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
1504             if(func_prop_decl->type == FUNC_DEFGET)
1505                 break;
1506         }
1507         if(!func_prop_decl)
1508             class_desc->func_cnt++;
1509     }
1510
1511     class_desc->funcs = compiler_alloc(ctx->code, class_desc->func_cnt*sizeof(*class_desc->funcs));
1512     if(!class_desc->funcs)
1513         return E_OUTOFMEMORY;
1514     memset(class_desc->funcs, 0, class_desc->func_cnt*sizeof(*class_desc->funcs));
1515
1516     for(func_decl = class_decl->funcs, i=1; func_decl; func_decl = func_decl->next, i++) {
1517         for(func_prop_decl = func_decl; func_prop_decl; func_prop_decl = func_prop_decl->next_prop_func) {
1518             if(func_prop_decl->type == FUNC_DEFGET) {
1519                 i--;
1520                 break;
1521             }
1522         }
1523
1524         if(!strcmpiW(class_initializeW, func_decl->name)) {
1525             if(func_decl->type != FUNC_SUB) {
1526                 FIXME("class initializer is not sub\n");
1527                 return E_FAIL;
1528             }
1529
1530             class_desc->class_initialize_id = i;
1531         }else  if(!strcmpiW(class_terminateW, func_decl->name)) {
1532             if(func_decl->type != FUNC_SUB) {
1533                 FIXME("class terminator is not sub\n");
1534                 return E_FAIL;
1535             }
1536
1537             class_desc->class_terminate_id = i;
1538         }
1539
1540         hres = create_class_funcprop(ctx, func_decl, class_desc->funcs + (func_prop_decl ? 0 : i));
1541         if(FAILED(hres))
1542             return hres;
1543     }
1544
1545     for(prop_decl = class_decl->props; prop_decl; prop_decl = prop_decl->next)
1546         class_desc->prop_cnt++;
1547
1548     class_desc->props = compiler_alloc(ctx->code, class_desc->prop_cnt*sizeof(*class_desc->props));
1549     if(!class_desc->props)
1550         return E_OUTOFMEMORY;
1551
1552     for(prop_decl = class_decl->props, i=0; prop_decl; prop_decl = prop_decl->next, i++) {
1553         if(lookup_class_funcs(class_desc, prop_decl->name)) {
1554             FIXME("Property %s redefined\n", debugstr_w(prop_decl->name));
1555             return E_FAIL;
1556         }
1557
1558         class_desc->props[i].name = compiler_alloc_string(ctx->code, prop_decl->name);
1559         if(!class_desc->props[i].name)
1560             return E_OUTOFMEMORY;
1561
1562         class_desc->props[i].is_public = prop_decl->is_public;
1563     }
1564
1565     class_desc->next = ctx->classes;
1566     ctx->classes = class_desc;
1567     return S_OK;
1568 }
1569
1570 static BOOL lookup_script_identifier(script_ctx_t *script, const WCHAR *identifier)
1571 {
1572     class_desc_t *class;
1573     dynamic_var_t *var;
1574     function_t *func;
1575
1576     for(var = script->global_vars; var; var = var->next) {
1577         if(!strcmpiW(var->name, identifier))
1578             return TRUE;
1579     }
1580
1581     for(func = script->global_funcs; func; func = func->next) {
1582         if(!strcmpiW(func->name, identifier))
1583             return TRUE;
1584     }
1585
1586     for(class = script->classes; class; class = class->next) {
1587         if(!strcmpiW(class->name, identifier))
1588             return TRUE;
1589     }
1590
1591     return FALSE;
1592 }
1593
1594 static HRESULT check_script_collisions(compile_ctx_t *ctx, script_ctx_t *script)
1595 {
1596     class_desc_t *class;
1597     dynamic_var_t *var;
1598     function_t *func;
1599
1600     for(var = ctx->global_vars; var; var = var->next) {
1601         if(lookup_script_identifier(script, var->name)) {
1602             FIXME("%s: redefined\n", debugstr_w(var->name));
1603             return E_FAIL;
1604         }
1605     }
1606
1607     for(func = ctx->funcs; func; func = func->next) {
1608         if(lookup_script_identifier(script, func->name)) {
1609             FIXME("%s: redefined\n", debugstr_w(func->name));
1610             return E_FAIL;
1611         }
1612     }
1613
1614     for(class = ctx->classes; class; class = class->next) {
1615         if(lookup_script_identifier(script, class->name)) {
1616             FIXME("%s: redefined\n", debugstr_w(class->name));
1617             return E_FAIL;
1618         }
1619     }
1620
1621     return S_OK;
1622 }
1623
1624 void release_vbscode(vbscode_t *code)
1625 {
1626     unsigned i;
1627
1628     list_remove(&code->entry);
1629
1630     for(i=0; i < code->bstr_cnt; i++)
1631         SysFreeString(code->bstr_pool[i]);
1632
1633     heap_pool_free(&code->heap);
1634
1635     heap_free(code->bstr_pool);
1636     heap_free(code->source);
1637     heap_free(code->instrs);
1638     heap_free(code);
1639 }
1640
1641 static vbscode_t *alloc_vbscode(compile_ctx_t *ctx, const WCHAR *source)
1642 {
1643     vbscode_t *ret;
1644
1645     ret = heap_alloc(sizeof(*ret));
1646     if(!ret)
1647         return NULL;
1648
1649     ret->source = heap_strdupW(source);
1650     if(!ret->source) {
1651         heap_free(ret);
1652         return NULL;
1653     }
1654
1655     ret->instrs = heap_alloc(32*sizeof(instr_t));
1656     if(!ret->instrs) {
1657         release_vbscode(ret);
1658         return NULL;
1659     }
1660
1661     ctx->instr_cnt = 1;
1662     ctx->instr_size = 32;
1663     heap_pool_init(&ret->heap);
1664
1665     ret->option_explicit = ctx->parser.option_explicit;
1666
1667     ret->bstr_pool = NULL;
1668     ret->bstr_pool_size = 0;
1669     ret->bstr_cnt = 0;
1670     ret->pending_exec = FALSE;
1671
1672     ret->main_code.type = FUNC_GLOBAL;
1673     ret->main_code.name = NULL;
1674     ret->main_code.code_ctx = ret;
1675     ret->main_code.vars = NULL;
1676     ret->main_code.var_cnt = 0;
1677     ret->main_code.array_cnt = 0;
1678     ret->main_code.arg_cnt = 0;
1679     ret->main_code.args = NULL;
1680
1681     list_init(&ret->entry);
1682     return ret;
1683 }
1684
1685 static void release_compiler(compile_ctx_t *ctx)
1686 {
1687     parser_release(&ctx->parser);
1688     heap_free(ctx->labels);
1689     if(ctx->code)
1690         release_vbscode(ctx->code);
1691 }
1692
1693 HRESULT compile_script(script_ctx_t *script, const WCHAR *src, const WCHAR *delimiter, vbscode_t **ret)
1694 {
1695     function_t *new_func;
1696     function_decl_t *func_decl;
1697     class_decl_t *class_decl;
1698     compile_ctx_t ctx;
1699     vbscode_t *code;
1700     HRESULT hres;
1701
1702     hres = parse_script(&ctx.parser, src, delimiter);
1703     if(FAILED(hres))
1704         return hres;
1705
1706     code = ctx.code = alloc_vbscode(&ctx, src);
1707     if(!ctx.code)
1708         return E_OUTOFMEMORY;
1709
1710     ctx.funcs = NULL;
1711     ctx.func_decls = NULL;
1712     ctx.global_vars = NULL;
1713     ctx.classes = NULL;
1714     ctx.labels = NULL;
1715     ctx.global_consts = NULL;
1716     ctx.stat_ctx = NULL;
1717     ctx.labels_cnt = ctx.labels_size = 0;
1718
1719     hres = compile_func(&ctx, ctx.parser.stats, &ctx.code->main_code);
1720     if(FAILED(hres)) {
1721         release_compiler(&ctx);
1722         return hres;
1723     }
1724
1725     ctx.global_consts = ctx.const_decls;
1726
1727     for(func_decl = ctx.func_decls; func_decl; func_decl = func_decl->next) {
1728         hres = create_function(&ctx, func_decl, &new_func);
1729         if(FAILED(hres)) {
1730             release_compiler(&ctx);
1731             return hres;
1732         }
1733
1734         new_func->next = ctx.funcs;
1735         ctx.funcs = new_func;
1736     }
1737
1738     for(class_decl = ctx.parser.class_decls; class_decl; class_decl = class_decl->next) {
1739         hres = compile_class(&ctx, class_decl);
1740         if(FAILED(hres)) {
1741             release_compiler(&ctx);
1742             return hres;
1743         }
1744     }
1745
1746     hres = check_script_collisions(&ctx, script);
1747     if(FAILED(hres)) {
1748         release_compiler(&ctx);
1749         return hres;
1750     }
1751
1752     if(ctx.global_vars) {
1753         dynamic_var_t *var;
1754
1755         for(var = ctx.global_vars; var->next; var = var->next);
1756
1757         var->next = script->global_vars;
1758         script->global_vars = ctx.global_vars;
1759     }
1760
1761     if(ctx.funcs) {
1762         for(new_func = ctx.funcs; new_func->next; new_func = new_func->next);
1763
1764         new_func->next = script->global_funcs;
1765         script->global_funcs = ctx.funcs;
1766     }
1767
1768     if(ctx.classes) {
1769         class_desc_t *class = ctx.classes;
1770
1771         while(1) {
1772             class->ctx = script;
1773             if(!class->next)
1774                 break;
1775             class = class->next;
1776         }
1777
1778         class->next = script->classes;
1779         script->classes = ctx.classes;
1780     }
1781
1782     if(TRACE_ON(vbscript_disas))
1783         dump_code(&ctx);
1784
1785     ctx.code = NULL;
1786     release_compiler(&ctx);
1787
1788     list_add_tail(&script->code_list, &code->entry);
1789     *ret = code;
1790     return S_OK;
1791 }