dlls/jscript/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 <math.h>
  20 #include <assert.h>
  21
  22 #include "jscript.h"
  23 #include "engine.h"
  24 #include "parser.h"
  25
  26 #include "wine/rbtree.h"
  27 #include "wine/debug.h"
  28
  29 WINE_DEFAULT_DEBUG_CHANNEL(jscript);
  30 WINE_DECLARE_DEBUG_CHANNEL(jscript_disas);
  31
  32 typedef struct _statement_ctx_t {
  33     unsigned stack_use;
  34     BOOL using_scope;
  35     BOOL using_except;
  36
  37     unsigned break_label;
  38     unsigned continue_label;
  39
  40     const labelled_statement_t *labelled_stat;
  41
  42     struct _statement_ctx_t *next;
  43 } statement_ctx_t;
  44
  45 typedef struct {
  46     struct wine_rb_entry entry;
  47     BSTR name;
  48     int ref;
  49 } function_local_t;
  50
  51 typedef struct {
  52     parser_ctx_t *parser;
  53     bytecode_t *code;
  54
  55     BOOL from_eval;
  56
  57     unsigned code_off;
  58     unsigned code_size;
  59
  60     unsigned *labels;
  61     unsigned labels_size;
  62     unsigned labels_cnt;
  63
  64     struct wine_rb_tree locals;
  65     unsigned locals_cnt;
  66
  67     statement_ctx_t *stat_ctx;
  68     function_code_t *func;
  69
  70     function_expression_t *func_head;
  71     function_expression_t *func_tail;
  72
  73     heap_pool_t heap;
  74 } compiler_ctx_t;
  75
  76 static const struct {
  77     const char *op_str;
  78     instr_arg_type_t arg1_type;
  79     instr_arg_type_t arg2_type;
  80 } instr_info[] = {
  81 #define X(n,a,b,c) {#n,b,c},
  82 OP_LIST
  83 #undef X
  84 };
  85
  86 static void dump_instr_arg(instr_arg_type_t type, instr_arg_t *arg)
  87 {
  88     switch(type) {
  89     case ARG_STR:
  90         TRACE_(jscript_disas)("\t%s", debugstr_jsstr(arg->str));
  91         break;
  92     case ARG_BSTR:
  93         TRACE_(jscript_disas)("\t%s", debugstr_wn(arg->bstr, SysStringLen(arg->bstr)));
  94         break;
  95     case ARG_INT:
  96         TRACE_(jscript_disas)("\t%d", arg->uint);
  97         break;
  98     case ARG_UINT:
  99     case ARG_ADDR:
 100         TRACE_(jscript_disas)("\t%u", arg->uint);
 101         break;
 102     case ARG_FUNC:
 103     case ARG_NONE:
 104         break;
 105     DEFAULT_UNREACHABLE;
 106     }
 107 }
 108
 109 static void dump_code(compiler_ctx_t *ctx, unsigned off)
 110 {
 111     instr_t *instr;
 112
 113     for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
 114         TRACE_(jscript_disas)("%d:\t%s", (int)(instr-ctx->code->instrs), instr_info[instr->op].op_str);
 115         if(instr_info[instr->op].arg1_type == ARG_DBL) {
 116             TRACE_(jscript_disas)("\t%lf", instr->u.dbl);
 117         }else {
 118             dump_instr_arg(instr_info[instr->op].arg1_type, instr->u.arg);
 119             dump_instr_arg(instr_info[instr->op].arg2_type, instr->u.arg+1);
 120         }
 121         TRACE_(jscript_disas)("\n");
 122     }
 123 }
 124
 125 static HRESULT compile_expression(compiler_ctx_t*,expression_t*,BOOL);
 126 static HRESULT compile_statement(compiler_ctx_t*,statement_ctx_t*,statement_t*);
 127
 128 static inline void *compiler_alloc(bytecode_t *code, size_t size)
 129 {
 130     return heap_pool_alloc(&code->heap, size);
 131 }
 132
 133 static jsstr_t *compiler_alloc_string_len(compiler_ctx_t *ctx, const WCHAR *str, unsigned len)
 134 {
 135     jsstr_t *new_str;
 136
 137     if(!ctx->code->str_pool_size) {
 138         ctx->code->str_pool = heap_alloc(8 * sizeof(jsstr_t*));
 139         if(!ctx->code->str_pool)
 140             return NULL;
 141         ctx->code->str_pool_size = 8;
 142     }else if(ctx->code->str_pool_size == ctx->code->str_cnt) {
 143         jsstr_t **new_pool;
 144
 145         new_pool = heap_realloc(ctx->code->str_pool, ctx->code->str_pool_size*2*sizeof(jsstr_t*));
 146         if(!new_pool)
 147             return NULL;
 148
 149         ctx->code->str_pool = new_pool;
 150         ctx->code->str_pool_size *= 2;
 151     }
 152
 153     new_str = jsstr_alloc_len(str, len);
 154     if(!new_str)
 155         return NULL;
 156
 157     ctx->code->str_pool[ctx->code->str_cnt++] = new_str;
 158     return new_str;
 159 }
 160
 161 static jsstr_t *compiler_alloc_string(compiler_ctx_t *ctx, const WCHAR *str)
 162 {
 163     return compiler_alloc_string_len(ctx, str, strlenW(str));
 164 }
 165
 166 static BOOL ensure_bstr_slot(compiler_ctx_t *ctx)
 167 {
 168     if(!ctx->code->bstr_pool_size) {
 169         ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
 170         if(!ctx->code->bstr_pool)
 171             return FALSE;
 172         ctx->code->bstr_pool_size = 8;
 173     }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
 174         BSTR *new_pool;
 175
 176         new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
 177         if(!new_pool)
 178             return FALSE;
 179
 180         ctx->code->bstr_pool = new_pool;
 181         ctx->code->bstr_pool_size *= 2;
 182     }
 183
 184     return TRUE;
 185 }
 186
 187 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
 188 {
 189     if(!ensure_bstr_slot(ctx))
 190         return NULL;
 191
 192     ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
 193     if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
 194         return NULL;
 195
 196     return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
 197 }
 198
 199 static BSTR compiler_alloc_bstr_len(compiler_ctx_t *ctx, const WCHAR *str, size_t len)
 200 {
 201     if(!ensure_bstr_slot(ctx))
 202         return NULL;
 203
 204     ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocStringLen(str, len);
 205     if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
 206         return NULL;
 207
 208     return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
 209 }
 210
 211 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
 212 {
 213     assert(ctx->code_size >= ctx->code_off);
 214
 215     if(ctx->code_size == ctx->code_off) {
 216         instr_t *new_instrs;
 217
 218         new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
 219         if(!new_instrs)
 220             return 0;
 221
 222         ctx->code->instrs = new_instrs;
 223         ctx->code_size *= 2;
 224     }
 225
 226     ctx->code->instrs[ctx->code_off].op = op;
 227     return ctx->code_off++;
 228 }
 229
 230 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
 231 {
 232     assert(off < ctx->code_off);
 233     return ctx->code->instrs + off;
 234 }
 235
 236 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
 237 {
 238     unsigned instr;
 239
 240     instr = push_instr(ctx, op);
 241     if(!instr)
 242         return E_OUTOFMEMORY;
 243
 244     instr_ptr(ctx, instr)->u.arg->lng = arg;
 245     return S_OK;
 246 }
 247
 248 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
 249 {
 250     unsigned instr;
 251     jsstr_t *str;
 252
 253     str = compiler_alloc_string(ctx, arg);
 254     if(!str)
 255         return E_OUTOFMEMORY;
 256
 257     instr = push_instr(ctx, op);
 258     if(!instr)
 259         return E_OUTOFMEMORY;
 260
 261     instr_ptr(ctx, instr)->u.arg->str = str;
 262     return S_OK;
 263 }
 264
 265 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
 266 {
 267     unsigned instr;
 268     WCHAR *str;
 269
 270     str = compiler_alloc_bstr(ctx, arg);
 271     if(!str)
 272         return E_OUTOFMEMORY;
 273
 274     instr = push_instr(ctx, op);
 275     if(!instr)
 276         return E_OUTOFMEMORY;
 277
 278     instr_ptr(ctx, instr)->u.arg->bstr = str;
 279     return S_OK;
 280 }
 281
 282 static HRESULT push_instr_bstr_uint(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg1, unsigned arg2)
 283 {
 284     unsigned instr;
 285     WCHAR *str;
 286
 287     str = compiler_alloc_bstr(ctx, arg1);
 288     if(!str)
 289         return E_OUTOFMEMORY;
 290
 291     instr = push_instr(ctx, op);
 292     if(!instr)
 293         return E_OUTOFMEMORY;
 294
 295     instr_ptr(ctx, instr)->u.arg[0].bstr = str;
 296     instr_ptr(ctx, instr)->u.arg[1].uint = arg2;
 297     return S_OK;
 298 }
 299
 300 static HRESULT push_instr_uint_str(compiler_ctx_t *ctx, jsop_t op, unsigned arg1, const WCHAR *arg2)
 301 {
 302     unsigned instr;
 303     jsstr_t *str;
 304
 305     str = compiler_alloc_string(ctx, arg2);
 306     if(!str)
 307         return E_OUTOFMEMORY;
 308
 309     instr = push_instr(ctx, op);
 310     if(!instr)
 311         return E_OUTOFMEMORY;
 312
 313     instr_ptr(ctx, instr)->u.arg[0].uint = arg1;
 314     instr_ptr(ctx, instr)->u.arg[1].str = str;
 315     return S_OK;
 316 }
 317
 318 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
 319 {
 320     unsigned instr;
 321
 322     instr = push_instr(ctx, op);
 323     if(!instr)
 324         return E_OUTOFMEMORY;
 325
 326     instr_ptr(ctx, instr)->u.dbl = arg;
 327     return S_OK;
 328 }
 329
 330 static inline void set_arg_uint(compiler_ctx_t *ctx, unsigned instr, unsigned arg)
 331 {
 332     instr_ptr(ctx, instr)->u.arg->uint = arg;
 333 }
 334
 335 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
 336 {
 337     unsigned instr;
 338
 339     instr = push_instr(ctx, op);
 340     if(!instr)
 341         return E_OUTOFMEMORY;
 342
 343     set_arg_uint(ctx, instr, arg);
 344     return S_OK;
 345 }
 346
 347 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 348 {
 349     HRESULT hres;
 350
 351     hres = compile_expression(ctx, expr->expression1, TRUE);
 352     if(FAILED(hres))
 353         return hres;
 354
 355     hres = compile_expression(ctx, expr->expression2, TRUE);
 356     if(FAILED(hres))
 357         return hres;
 358
 359     return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
 360 }
 361
 362 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
 363 {
 364     HRESULT hres;
 365
 366     hres = compile_expression(ctx, expr->expression, TRUE);
 367     if(FAILED(hres))
 368         return hres;
 369
 370     return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
 371 }
 372
 373 /* ECMA-262 3rd Edition    11.2.1 */
 374 static HRESULT compile_member_expression(compiler_ctx_t *ctx, member_expression_t *expr)
 375 {
 376     HRESULT hres;
 377
 378     hres = compile_expression(ctx, expr->expression, TRUE);
 379     if(FAILED(hres))
 380         return hres;
 381
 382     return push_instr_bstr(ctx, OP_member, expr->identifier);
 383 }
 384
 385 #define LABEL_FLAG 0x80000000
 386
 387 static unsigned alloc_label(compiler_ctx_t *ctx)
 388 {
 389     if(!ctx->labels_size) {
 390         ctx->labels = heap_alloc(8 * sizeof(*ctx->labels));
 391         if(!ctx->labels)
 392             return 0;
 393         ctx->labels_size = 8;
 394     }else if(ctx->labels_size == ctx->labels_cnt) {
 395         unsigned *new_labels;
 396
 397         new_labels = heap_realloc(ctx->labels, 2*ctx->labels_size*sizeof(*ctx->labels));
 398         if(!new_labels)
 399             return 0;
 400
 401         ctx->labels = new_labels;
 402         ctx->labels_size *= 2;
 403     }
 404
 405     return ctx->labels_cnt++ | LABEL_FLAG;
 406 }
 407
 408 static void label_set_addr(compiler_ctx_t *ctx, unsigned label)
 409 {
 410     assert(label & LABEL_FLAG);
 411     ctx->labels[label & ~LABEL_FLAG] = ctx->code_off;
 412 }
 413
 414 static inline BOOL is_memberid_expr(expression_type_t type)
 415 {
 416     return type == EXPR_IDENT || type == EXPR_MEMBER || type == EXPR_ARRAY;
 417 }
 418
 419 static BOOL bind_local(compiler_ctx_t *ctx, const WCHAR *identifier, int *ret_ref)
 420 {
 421     statement_ctx_t *iter;
 422     local_ref_t *ref;
 423
 424     for(iter = ctx->stat_ctx; iter; iter = iter->next) {
 425         if(iter->using_scope)
 426             return FALSE;
 427     }
 428
 429     ref = lookup_local(ctx->func, identifier);
 430     if(!ref)
 431         return FALSE;
 432
 433     *ret_ref = ref->ref;
 434     return TRUE;
 435 }
 436
 437 static HRESULT emit_identifier_ref(compiler_ctx_t *ctx, const WCHAR *identifier, unsigned flags)
 438 {
 439     int local_ref;
 440     if(bind_local(ctx, identifier, &local_ref))
 441         return push_instr_int(ctx, OP_local_ref, local_ref);
 442     return push_instr_bstr_uint(ctx, OP_identid, identifier, flags);
 443 }
 444
 445 static HRESULT emit_identifier(compiler_ctx_t *ctx, const WCHAR *identifier)
 446 {
 447     int local_ref;
 448     if(bind_local(ctx, identifier, &local_ref))
 449         return push_instr_int(ctx, OP_local, local_ref);
 450     return push_instr_bstr(ctx, OP_ident, identifier);
 451 }
 452
 453 static HRESULT compile_memberid_expression(compiler_ctx_t *ctx, expression_t *expr, unsigned flags)
 454 {
 455     HRESULT hres = S_OK;
 456
 457     switch(expr->type) {
 458     case EXPR_IDENT: {
 459         identifier_expression_t *ident_expr = (identifier_expression_t*)expr;
 460
 461         hres = emit_identifier_ref(ctx, ident_expr->identifier, flags);
 462         break;
 463     }
 464     case EXPR_ARRAY: {
 465         binary_expression_t *array_expr = (binary_expression_t*)expr;
 466
 467         hres = compile_expression(ctx, array_expr->expression1, TRUE);
 468         if(FAILED(hres))
 469             return hres;
 470
 471         hres = compile_expression(ctx, array_expr->expression2, TRUE);
 472         if(FAILED(hres))
 473             return hres;
 474
 475         hres = push_instr_uint(ctx, OP_memberid, flags);
 476         break;
 477     }
 478     case EXPR_MEMBER: {
 479         member_expression_t *member_expr = (member_expression_t*)expr;
 480
 481         hres = compile_expression(ctx, member_expr->expression, TRUE);
 482         if(FAILED(hres))
 483             return hres;
 484
 485         /* FIXME: Potential optimization */
 486         hres = push_instr_str(ctx, OP_str, member_expr->identifier);
 487         if(FAILED(hres))
 488             return hres;
 489
 490         hres = push_instr_uint(ctx, OP_memberid, flags);
 491         break;
 492     }
 493     DEFAULT_UNREACHABLE;
 494     }
 495
 496     return hres;
 497 }
 498
 499 static HRESULT compile_increment_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op, int n)
 500 {
 501     HRESULT hres;
 502
 503     if(!is_memberid_expr(expr->expression->type)) {
 504         hres = compile_expression(ctx, expr->expression, TRUE);
 505         if(FAILED(hres))
 506             return hres;
 507
 508         return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
 509     }
 510
 511     hres = compile_memberid_expression(ctx, expr->expression, fdexNameEnsure);
 512     if(FAILED(hres))
 513         return hres;
 514
 515     return push_instr_int(ctx, op, n);
 516 }
 517
 518 /* ECMA-262 3rd Edition    11.14 */
 519 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr, BOOL emit_ret)
 520 {
 521     HRESULT hres;
 522
 523     hres = compile_expression(ctx, expr->expression1, FALSE);
 524     if(FAILED(hres))
 525         return hres;
 526
 527     return compile_expression(ctx, expr->expression2, emit_ret);
 528 }
 529
 530 /* ECMA-262 3rd Edition    11.11 */
 531 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 532 {
 533     unsigned instr;
 534     HRESULT hres;
 535
 536     hres = compile_expression(ctx, expr->expression1, TRUE);
 537     if(FAILED(hres))
 538         return hres;
 539
 540     instr = push_instr(ctx, op);
 541     if(!instr)
 542         return E_OUTOFMEMORY;
 543
 544     hres = compile_expression(ctx, expr->expression2, TRUE);
 545     if(FAILED(hres))
 546         return hres;
 547
 548     set_arg_uint(ctx, instr, ctx->code_off);
 549     return S_OK;
 550 }
 551
 552 /* ECMA-262 3rd Edition    11.12 */
 553 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
 554 {
 555     unsigned jmp_false, jmp_end;
 556     HRESULT hres;
 557
 558     hres = compile_expression(ctx, expr->expression, TRUE);
 559     if(FAILED(hres))
 560         return hres;
 561
 562     jmp_false = push_instr(ctx, OP_cnd_z);
 563     if(!jmp_false)
 564         return E_OUTOFMEMORY;
 565
 566     hres = compile_expression(ctx, expr->true_expression, TRUE);
 567     if(FAILED(hres))
 568         return hres;
 569
 570     jmp_end = push_instr(ctx, OP_jmp);
 571     if(!jmp_end)
 572         return E_OUTOFMEMORY;
 573
 574     set_arg_uint(ctx, jmp_false, ctx->code_off);
 575     hres = push_instr_uint(ctx, OP_pop, 1);
 576     if(FAILED(hres))
 577         return hres;
 578
 579     hres = compile_expression(ctx, expr->false_expression, TRUE);
 580     if(FAILED(hres))
 581         return hres;
 582
 583     set_arg_uint(ctx, jmp_end, ctx->code_off);
 584     return S_OK;
 585 }
 586
 587 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
 588 {
 589     unsigned arg_cnt = 0;
 590     argument_t *arg;
 591     HRESULT hres;
 592
 593     hres = compile_expression(ctx, expr->expression, TRUE);
 594     if(FAILED(hres))
 595         return hres;
 596
 597     for(arg = expr->argument_list; arg; arg = arg->next) {
 598         hres = compile_expression(ctx, arg->expr, TRUE);
 599         if(FAILED(hres))
 600             return hres;
 601         arg_cnt++;
 602     }
 603
 604     hres = push_instr_uint(ctx, OP_new, arg_cnt);
 605     if(FAILED(hres))
 606         return hres;
 607
 608     hres = push_instr_uint(ctx, OP_pop, arg_cnt+1);
 609     if(FAILED(hres))
 610         return hres;
 611
 612     return push_instr(ctx, OP_push_ret) ? S_OK : E_OUTOFMEMORY;
 613 }
 614
 615 static HRESULT compile_call_expression(compiler_ctx_t *ctx, call_expression_t *expr, BOOL emit_ret)
 616 {
 617     unsigned arg_cnt = 0, extra_args;
 618     argument_t *arg;
 619     unsigned instr;
 620     jsop_t op;
 621     HRESULT hres;
 622
 623     if(is_memberid_expr(expr->expression->type)) {
 624         op = OP_call_member;
 625         extra_args = 2;
 626         hres = compile_memberid_expression(ctx, expr->expression, 0);
 627     }else {
 628         op = OP_call;
 629         extra_args = 1;
 630         hres = compile_expression(ctx, expr->expression, TRUE);
 631     }
 632
 633     if(FAILED(hres))
 634         return hres;
 635
 636     for(arg = expr->argument_list; arg; arg = arg->next) {
 637         hres = compile_expression(ctx, arg->expr, TRUE);
 638         if(FAILED(hres))
 639             return hres;
 640         arg_cnt++;
 641     }
 642
 643     instr = push_instr(ctx, op);
 644     if(!instr)
 645         return E_OUTOFMEMORY;
 646
 647     instr_ptr(ctx, instr)->u.arg[0].uint = arg_cnt;
 648     instr_ptr(ctx, instr)->u.arg[1].lng = emit_ret;
 649
 650     hres = push_instr_uint(ctx, OP_pop, arg_cnt + extra_args);
 651     if(FAILED(hres))
 652         return hres;
 653
 654     return !emit_ret || push_instr(ctx, OP_push_ret) ? S_OK : E_OUTOFMEMORY;
 655 }
 656
 657 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
 658 {
 659     HRESULT hres;
 660
 661     switch(expr->expression->type) {
 662     case EXPR_ARRAY: {
 663         binary_expression_t *array_expr = (binary_expression_t*)expr->expression;
 664
 665         hres = compile_expression(ctx, array_expr->expression1, TRUE);
 666         if(FAILED(hres))
 667             return hres;
 668
 669         hres = compile_expression(ctx, array_expr->expression2, TRUE);
 670         if(FAILED(hres))
 671             return hres;
 672
 673         if(!push_instr(ctx, OP_delete))
 674             return E_OUTOFMEMORY;
 675         break;
 676     }
 677     case EXPR_MEMBER: {
 678         member_expression_t *member_expr = (member_expression_t*)expr->expression;
 679
 680         hres = compile_expression(ctx, member_expr->expression, TRUE);
 681         if(FAILED(hres))
 682             return hres;
 683
 684         /* FIXME: Potential optimization */
 685         hres = push_instr_str(ctx, OP_str, member_expr->identifier);
 686         if(FAILED(hres))
 687             return hres;
 688
 689         if(!push_instr(ctx, OP_delete))
 690             return E_OUTOFMEMORY;
 691         break;
 692     }
 693     case EXPR_IDENT:
 694         return push_instr_bstr(ctx, OP_delete_ident, ((identifier_expression_t*)expr->expression)->identifier);
 695     default: {
 696         const WCHAR fixmeW[] = {'F','I','X','M','E',0};
 697
 698         WARN("invalid delete, unimplemented exception message\n");
 699
 700         hres = compile_expression(ctx, expr->expression, TRUE);
 701         if(FAILED(hres))
 702             return hres;
 703
 704         return push_instr_uint_str(ctx, OP_throw_type, JS_E_INVALID_DELETE, fixmeW);
 705     }
 706     }
 707
 708     return S_OK;
 709 }
 710
 711 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 712 {
 713     BOOL use_throw_path = FALSE;
 714     unsigned arg_cnt = 0;
 715     HRESULT hres;
 716
 717     if(expr->expression1->type == EXPR_CALL) {
 718         call_expression_t *call_expr = (call_expression_t*)expr->expression1;
 719         argument_t *arg;
 720
 721         if(op != OP_LAST) {
 722             FIXME("op %d not supported on parametrized assign expressions\n", op);
 723             return E_NOTIMPL;
 724         }
 725
 726         if(is_memberid_expr(call_expr->expression->type) && call_expr->argument_list) {
 727             hres = compile_memberid_expression(ctx, call_expr->expression, fdexNameEnsure);
 728             if(FAILED(hres))
 729                 return hres;
 730
 731             for(arg = call_expr->argument_list; arg; arg = arg->next) {
 732                 hres = compile_expression(ctx, arg->expr, TRUE);
 733                 if(FAILED(hres))
 734                     return hres;
 735                 arg_cnt++;
 736             }
 737         }else {
 738             use_throw_path = TRUE;
 739         }
 740     }else if(is_memberid_expr(expr->expression1->type)) {
 741         hres = compile_memberid_expression(ctx, expr->expression1, fdexNameEnsure);
 742         if(FAILED(hres))
 743             return hres;
 744     }else {
 745         use_throw_path = TRUE;
 746     }
 747
 748     if(use_throw_path) {
 749         /* Illegal assignment: evaluate and throw */
 750         hres = compile_expression(ctx, expr->expression1, TRUE);
 751         if(FAILED(hres))
 752             return hres;
 753
 754         hres = compile_expression(ctx, expr->expression2, TRUE);
 755         if(FAILED(hres))
 756             return hres;
 757
 758         if(op != OP_LAST && !push_instr(ctx, op))
 759             return E_OUTOFMEMORY;
 760
 761         return push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
 762     }
 763
 764     if(op != OP_LAST && !push_instr(ctx, OP_refval))
 765         return E_OUTOFMEMORY;
 766
 767     hres = compile_expression(ctx, expr->expression2, TRUE);
 768     if(FAILED(hres))
 769         return hres;
 770
 771     if(op != OP_LAST && !push_instr(ctx, op))
 772         return E_OUTOFMEMORY;
 773
 774     if(arg_cnt)
 775         return push_instr_uint(ctx, OP_assign_call, arg_cnt);
 776
 777     if(!push_instr(ctx, OP_assign))
 778         return E_OUTOFMEMORY;
 779
 780     return S_OK;
 781 }
 782
 783 static HRESULT compile_typeof_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
 784 {
 785     jsop_t op;
 786     HRESULT hres;
 787
 788     if(is_memberid_expr(expr->expression->type)) {
 789         if(expr->expression->type == EXPR_IDENT)
 790             return push_instr_bstr(ctx, OP_typeofident, ((identifier_expression_t*)expr->expression)->identifier);
 791
 792         op = OP_typeofid;
 793         hres = compile_memberid_expression(ctx, expr->expression, 0);
 794     }else {
 795         op = OP_typeof;
 796         hres = compile_expression(ctx, expr->expression, TRUE);
 797     }
 798     if(FAILED(hres))
 799         return hres;
 800
 801     return push_instr(ctx, op) ? S_OK : E_OUTOFMEMORY;
 802 }
 803
 804 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
 805 {
 806     switch(literal->type) {
 807     case LT_BOOL:
 808         return push_instr_int(ctx, OP_bool, literal->u.bval);
 809     case LT_DOUBLE:
 810         return push_instr_double(ctx, OP_double, literal->u.dval);
 811     case LT_NULL:
 812         return push_instr(ctx, OP_null) ? S_OK : E_OUTOFMEMORY;
 813     case LT_STRING:
 814         return push_instr_str(ctx, OP_str, literal->u.wstr);
 815     case LT_REGEXP: {
 816         unsigned instr;
 817         jsstr_t *str;
 818
 819         str = compiler_alloc_string_len(ctx, literal->u.regexp.str, literal->u.regexp.str_len);
 820         if(!str)
 821             return E_OUTOFMEMORY;
 822
 823         instr = push_instr(ctx, OP_regexp);
 824         if(!instr)
 825             return E_OUTOFMEMORY;
 826
 827         instr_ptr(ctx, instr)->u.arg[0].str = str;
 828         instr_ptr(ctx, instr)->u.arg[1].uint = literal->u.regexp.flags;
 829         return S_OK;
 830     }
 831     DEFAULT_UNREACHABLE;
 832     }
 833     return E_FAIL;
 834 }
 835
 836 static HRESULT literal_as_bstr(compiler_ctx_t *ctx, literal_t *literal, BSTR *str)
 837 {
 838     switch(literal->type) {
 839     case LT_STRING:
 840         *str = compiler_alloc_bstr(ctx, literal->u.wstr);
 841         break;
 842     case LT_DOUBLE: {
 843         jsstr_t *jsstr;
 844         HRESULT hres;
 845
 846         hres = double_to_string(literal->u.dval, &jsstr);
 847         if(FAILED(hres))
 848             return hres;
 849
 850         *str = compiler_alloc_bstr_len(ctx, NULL, jsstr_length(jsstr));
 851         if(*str)
 852             jsstr_flush(jsstr, *str);
 853         jsstr_release(jsstr);
 854         break;
 855     }
 856     DEFAULT_UNREACHABLE;
 857     }
 858
 859     return *str ? S_OK : E_OUTOFMEMORY;
 860 }
 861
 862 static HRESULT compile_array_literal(compiler_ctx_t *ctx, array_literal_expression_t *expr)
 863 {
 864     unsigned i, elem_cnt = expr->length;
 865     array_element_t *iter;
 866     HRESULT hres;
 867
 868     for(iter = expr->element_list; iter; iter = iter->next) {
 869         elem_cnt += iter->elision+1;
 870
 871         for(i=0; i < iter->elision; i++) {
 872             if(!push_instr(ctx, OP_undefined))
 873                 return E_OUTOFMEMORY;
 874         }
 875
 876         hres = compile_expression(ctx, iter->expr, TRUE);
 877         if(FAILED(hres))
 878             return hres;
 879     }
 880
 881     for(i=0; i < expr->length; i++) {
 882         if(!push_instr(ctx, OP_undefined))
 883             return E_OUTOFMEMORY;
 884     }
 885
 886     return push_instr_uint(ctx, OP_carray, elem_cnt);
 887 }
 888
 889 static HRESULT compile_object_literal(compiler_ctx_t *ctx, property_value_expression_t *expr)
 890 {
 891     prop_val_t *iter;
 892     unsigned instr;
 893     BSTR name;
 894     HRESULT hres;
 895
 896     if(!push_instr(ctx, OP_new_obj))
 897         return E_OUTOFMEMORY;
 898
 899     for(iter = expr->property_list; iter; iter = iter->next) {
 900         hres = literal_as_bstr(ctx, iter->name, &name);
 901         if(FAILED(hres))
 902             return hres;
 903
 904         hres = compile_expression(ctx, iter->value, TRUE);
 905         if(FAILED(hres))
 906             return hres;
 907
 908         instr = push_instr(ctx, OP_obj_prop);
 909         if(!instr)
 910             return E_OUTOFMEMORY;
 911
 912         instr_ptr(ctx, instr)->u.arg->bstr = name;
 913     }
 914
 915     return S_OK;
 916 }
 917
 918 static HRESULT compile_function_expression(compiler_ctx_t *ctx, function_expression_t *expr, BOOL emit_ret)
 919 {
 920     return emit_ret ? push_instr_uint(ctx, OP_func, expr->func_id) : S_OK;
 921 }
 922
 923 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr, BOOL emit_ret)
 924 {
 925     HRESULT hres;
 926
 927     switch(expr->type) {
 928     case EXPR_ADD:
 929         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
 930         break;
 931     case EXPR_AND:
 932         hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_z);
 933         break;
 934     case EXPR_ARRAY:
 935         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_array);
 936         break;
 937     case EXPR_ARRAYLIT:
 938         hres = compile_array_literal(ctx, (array_literal_expression_t*)expr);
 939         break;
 940     case EXPR_ASSIGN:
 941         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
 942         break;
 943     case EXPR_ASSIGNADD:
 944         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
 945         break;
 946     case EXPR_ASSIGNAND:
 947         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_and);
 948         break;
 949     case EXPR_ASSIGNSUB:
 950         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
 951         break;
 952     case EXPR_ASSIGNMUL:
 953         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
 954         break;
 955     case EXPR_ASSIGNDIV:
 956         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_div);
 957         break;
 958     case EXPR_ASSIGNMOD:
 959         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mod);
 960         break;
 961     case EXPR_ASSIGNOR:
 962         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_or);
 963         break;
 964     case EXPR_ASSIGNLSHIFT:
 965         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_lshift);
 966         break;
 967     case EXPR_ASSIGNRSHIFT:
 968         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift);
 969         break;
 970     case EXPR_ASSIGNRRSHIFT:
 971         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
 972         break;
 973     case EXPR_ASSIGNXOR:
 974         hres = compile_assign_expression(ctx, (binary_expression_t*)expr, OP_xor);
 975         break;
 976     case EXPR_BAND:
 977         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_and);
 978         break;
 979     case EXPR_BITNEG:
 980         hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
 981         break;
 982     case EXPR_BOR:
 983         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
 984         break;
 985     case EXPR_CALL:
 986         return compile_call_expression(ctx, (call_expression_t*)expr, emit_ret);
 987     case EXPR_COMMA:
 988         return compile_comma_expression(ctx, (binary_expression_t*)expr, emit_ret);
 989     case EXPR_COND:
 990         hres = compile_conditional_expression(ctx, (conditional_expression_t*)expr);
 991         break;
 992     case EXPR_DELETE:
 993         hres = compile_delete_expression(ctx, (unary_expression_t*)expr);
 994         break;
 995     case EXPR_DIV:
 996         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
 997         break;
 998     case EXPR_EQ:
 999         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
1000         break;
1001     case EXPR_EQEQ:
1002         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
1003         break;
1004     case EXPR_FUNC:
1005         return compile_function_expression(ctx, (function_expression_t*)expr, emit_ret);
1006     case EXPR_GREATER:
1007         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
1008         break;
1009     case EXPR_GREATEREQ:
1010         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
1011         break;
1012     case EXPR_IDENT:
1013         hres = emit_identifier(ctx, ((identifier_expression_t*)expr)->identifier);
1014         break;
1015     case EXPR_IN:
1016         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
1017         break;
1018     case EXPR_INSTANCEOF:
1019         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_instanceof);
1020         break;
1021     case EXPR_LESS:
1022         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
1023         break;
1024     case EXPR_LESSEQ:
1025         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
1026         break;
1027     case EXPR_LITERAL:
1028         hres = compile_literal(ctx, ((literal_expression_t*)expr)->literal);
1029         break;
1030     case EXPR_LOGNEG:
1031         hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
1032         break;
1033     case EXPR_LSHIFT:
1034         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lshift);
1035         break;
1036     case EXPR_MEMBER:
1037         hres = compile_member_expression(ctx, (member_expression_t*)expr);
1038         break;
1039     case EXPR_MINUS:
1040         hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
1041         break;
1042     case EXPR_MOD:
1043         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
1044         break;
1045     case EXPR_MUL:
1046         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
1047         break;
1048     case EXPR_NEW:
1049         hres = compile_new_expression(ctx, (call_expression_t*)expr);
1050         break;
1051     case EXPR_NOTEQ:
1052         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
1053         break;
1054     case EXPR_NOTEQEQ:
1055         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
1056         break;
1057     case EXPR_OR:
1058         hres = compile_logical_expression(ctx, (binary_expression_t*)expr, OP_cnd_nz);
1059         break;
1060     case EXPR_PLUS:
1061         hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
1062         break;
1063     case EXPR_POSTDEC:
1064         hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, -1);
1065         break;
1066     case EXPR_POSTINC:
1067         hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, 1);
1068         break;
1069     case EXPR_PREDEC:
1070         hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, -1);
1071         break;
1072     case EXPR_PREINC:
1073         hres = compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, 1);
1074         break;
1075     case EXPR_PROPVAL:
1076         hres = compile_object_literal(ctx, (property_value_expression_t*)expr);
1077         break;
1078     case EXPR_RSHIFT:
1079         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift);
1080         break;
1081     case EXPR_RRSHIFT:
1082         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_rshift2);
1083         break;
1084     case EXPR_SUB:
1085         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
1086         break;
1087     case EXPR_THIS:
1088         return !emit_ret || push_instr(ctx, OP_this) ? S_OK : E_OUTOFMEMORY;
1089     case EXPR_TYPEOF:
1090         hres = compile_typeof_expression(ctx, (unary_expression_t*)expr);
1091         break;
1092     case EXPR_VOID:
1093         hres = compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
1094         break;
1095     case EXPR_BXOR:
1096         hres = compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
1097         break;
1098     DEFAULT_UNREACHABLE;
1099     }
1100
1101     if(FAILED(hres))
1102         return hres;
1103
1104     return emit_ret ? S_OK : push_instr_uint(ctx, OP_pop, 1);
1105 }
1106
1107 static inline BOOL is_loop_statement(statement_type_t type)
1108 {
1109     return type == STAT_FOR || type == STAT_FORIN || type == STAT_WHILE;
1110 }
1111
1112 /* ECMA-262 3rd Edition    12.1 */
1113 static HRESULT compile_block_statement(compiler_ctx_t *ctx, statement_t *iter)
1114 {
1115     HRESULT hres;
1116
1117     while(iter) {
1118         hres = compile_statement(ctx, NULL, iter);
1119         if(FAILED(hres))
1120             return hres;
1121
1122         iter = iter->next;
1123     }
1124
1125     return S_OK;
1126 }
1127
1128 /* ECMA-262 3rd Edition    12.2 */
1129 static HRESULT compile_variable_list(compiler_ctx_t *ctx, variable_declaration_t *list)
1130 {
1131     variable_declaration_t *iter;
1132     HRESULT hres;
1133
1134     assert(list != NULL);
1135
1136     for(iter = list; iter; iter = iter->next) {
1137         if(!iter->expr)
1138             continue;
1139
1140         hres = emit_identifier_ref(ctx, iter->identifier, 0);
1141         if(FAILED(hres))
1142             return hres;
1143
1144         hres = compile_expression(ctx, iter->expr, TRUE);
1145         if(FAILED(hres))
1146             return hres;
1147
1148         if(!push_instr(ctx, OP_assign))
1149             return E_OUTOFMEMORY;
1150
1151         hres = push_instr_uint(ctx, OP_pop, 1);
1152         if(FAILED(hres))
1153             return hres;
1154     }
1155
1156     return S_OK;
1157 }
1158
1159 /* ECMA-262 3rd Edition    12.2 */
1160 static HRESULT compile_var_statement(compiler_ctx_t *ctx, var_statement_t *stat)
1161 {
1162     return compile_variable_list(ctx, stat->variable_list);
1163 }
1164
1165 /* ECMA-262 3rd Edition    12.4 */
1166 static HRESULT compile_expression_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1167 {
1168     HRESULT hres;
1169
1170     hres = compile_expression(ctx, stat->expr, ctx->from_eval);
1171     if(FAILED(hres))
1172         return hres;
1173
1174     return !ctx->from_eval || push_instr(ctx, OP_setret) ? S_OK : E_OUTOFMEMORY;
1175 }
1176
1177 /* ECMA-262 3rd Edition    12.5 */
1178 static HRESULT compile_if_statement(compiler_ctx_t *ctx, if_statement_t *stat)
1179 {
1180     unsigned jmp_else;
1181     HRESULT hres;
1182
1183     hres = compile_expression(ctx, stat->expr, TRUE);
1184     if(FAILED(hres))
1185         return hres;
1186
1187     jmp_else = push_instr(ctx, OP_jmp_z);
1188     if(!jmp_else)
1189         return E_OUTOFMEMORY;
1190
1191     hres = compile_statement(ctx, NULL, stat->if_stat);
1192     if(FAILED(hres))
1193         return hres;
1194
1195     if(stat->else_stat) {
1196         unsigned jmp_end;
1197
1198         jmp_end = push_instr(ctx, OP_jmp);
1199         if(!jmp_end)
1200             return E_OUTOFMEMORY;
1201
1202         set_arg_uint(ctx, jmp_else, ctx->code_off);
1203
1204         hres = compile_statement(ctx, NULL, stat->else_stat);
1205         if(FAILED(hres))
1206             return hres;
1207
1208         set_arg_uint(ctx, jmp_end, ctx->code_off);
1209     }else {
1210         set_arg_uint(ctx, jmp_else, ctx->code_off);
1211     }
1212
1213     return S_OK;
1214 }
1215
1216 /* ECMA-262 3rd Edition    12.6.2 */
1217 static HRESULT compile_while_statement(compiler_ctx_t *ctx, while_statement_t *stat)
1218 {
1219     statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1220     unsigned jmp_off;
1221     HRESULT hres;
1222
1223     stat_ctx.break_label = alloc_label(ctx);
1224     if(!stat_ctx.break_label)
1225         return E_OUTOFMEMORY;
1226
1227     stat_ctx.continue_label = alloc_label(ctx);
1228     if(!stat_ctx.continue_label)
1229         return E_OUTOFMEMORY;
1230
1231     jmp_off = ctx->code_off;
1232
1233     if(!stat->do_while) {
1234         label_set_addr(ctx, stat_ctx.continue_label);
1235         hres = compile_expression(ctx, stat->expr, TRUE);
1236         if(FAILED(hres))
1237             return hres;
1238
1239         hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1240         if(FAILED(hres))
1241             return hres;
1242     }
1243
1244     hres = compile_statement(ctx, &stat_ctx, stat->statement);
1245     if(FAILED(hres))
1246         return hres;
1247
1248     if(stat->do_while) {
1249         label_set_addr(ctx, stat_ctx.continue_label);
1250         hres = compile_expression(ctx, stat->expr, TRUE);
1251         if(FAILED(hres))
1252             return hres;
1253
1254         hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1255         if(FAILED(hres))
1256             return hres;
1257     }
1258
1259     hres = push_instr_uint(ctx, OP_jmp, jmp_off);
1260     if(FAILED(hres))
1261         return hres;
1262
1263     label_set_addr(ctx, stat_ctx.break_label);
1264     return S_OK;
1265 }
1266
1267 /* ECMA-262 3rd Edition    12.6.3 */
1268 static HRESULT compile_for_statement(compiler_ctx_t *ctx, for_statement_t *stat)
1269 {
1270     statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1271     unsigned expr_off;
1272     HRESULT hres;
1273
1274     if(stat->variable_list) {
1275         hres = compile_variable_list(ctx, stat->variable_list);
1276         if(FAILED(hres))
1277             return hres;
1278     }else if(stat->begin_expr) {
1279         hres = compile_expression(ctx, stat->begin_expr, FALSE);
1280         if(FAILED(hres))
1281             return hres;
1282     }
1283
1284     stat_ctx.break_label = alloc_label(ctx);
1285     if(!stat_ctx.break_label)
1286         return E_OUTOFMEMORY;
1287
1288     stat_ctx.continue_label = alloc_label(ctx);
1289     if(!stat_ctx.continue_label)
1290         return E_OUTOFMEMORY;
1291
1292     expr_off = ctx->code_off;
1293
1294     if(stat->expr) {
1295         hres = compile_expression(ctx, stat->expr, TRUE);
1296         if(FAILED(hres))
1297             return hres;
1298
1299         hres = push_instr_uint(ctx, OP_jmp_z, stat_ctx.break_label);
1300         if(FAILED(hres))
1301             return hres;
1302     }
1303
1304     hres = compile_statement(ctx, &stat_ctx, stat->statement);
1305     if(FAILED(hres))
1306         return hres;
1307
1308     label_set_addr(ctx, stat_ctx.continue_label);
1309
1310     if(stat->end_expr) {
1311         hres = compile_expression(ctx, stat->end_expr, FALSE);
1312         if(FAILED(hres))
1313             return hres;
1314     }
1315
1316     hres = push_instr_uint(ctx, OP_jmp, expr_off);
1317     if(FAILED(hres))
1318         return hres;
1319
1320     label_set_addr(ctx, stat_ctx.break_label);
1321     return S_OK;
1322 }
1323
1324 /* ECMA-262 3rd Edition    12.6.4 */
1325 static HRESULT compile_forin_statement(compiler_ctx_t *ctx, forin_statement_t *stat)
1326 {
1327     statement_ctx_t stat_ctx = {4, FALSE, FALSE};
1328     HRESULT hres;
1329
1330     if(stat->variable) {
1331         hres = compile_variable_list(ctx, stat->variable);
1332         if(FAILED(hres))
1333             return hres;
1334     }
1335
1336     stat_ctx.break_label = alloc_label(ctx);
1337     if(!stat_ctx.break_label)
1338         return E_OUTOFMEMORY;
1339
1340     stat_ctx.continue_label = alloc_label(ctx);
1341     if(!stat_ctx.continue_label)
1342         return E_OUTOFMEMORY;
1343
1344     hres = compile_expression(ctx, stat->in_expr, TRUE);
1345     if(FAILED(hres))
1346         return hres;
1347
1348     if(stat->variable) {
1349         hres = emit_identifier_ref(ctx, stat->variable->identifier, fdexNameEnsure);
1350         if(FAILED(hres))
1351             return hres;
1352     }else if(is_memberid_expr(stat->expr->type)) {
1353         hres = compile_memberid_expression(ctx, stat->expr, fdexNameEnsure);
1354         if(FAILED(hres))
1355             return hres;
1356     }else {
1357         hres = push_instr_uint(ctx, OP_throw_ref, JS_E_ILLEGAL_ASSIGN);
1358         if(FAILED(hres))
1359             return hres;
1360
1361         /* FIXME: compile statement anyways when we depend on compiler to check errors */
1362         return S_OK;
1363     }
1364
1365     hres = push_instr_int(ctx, OP_int, DISPID_STARTENUM);
1366     if(FAILED(hres))
1367         return hres;
1368
1369     label_set_addr(ctx, stat_ctx.continue_label);
1370     hres = push_instr_uint(ctx, OP_forin, stat_ctx.break_label);
1371     if(FAILED(hres))
1372         return E_OUTOFMEMORY;
1373
1374     hres = compile_statement(ctx, &stat_ctx, stat->statement);
1375     if(FAILED(hres))
1376         return hres;
1377
1378     hres = push_instr_uint(ctx, OP_jmp, stat_ctx.continue_label);
1379     if(FAILED(hres))
1380         return hres;
1381
1382     label_set_addr(ctx, stat_ctx.break_label);
1383     return S_OK;
1384 }
1385
1386 static HRESULT pop_to_stat(compiler_ctx_t *ctx, BOOL var_stack, BOOL scope_stack, statement_ctx_t *stat_ctx)
1387 {
1388     unsigned stack_pop = 0;
1389     statement_ctx_t *iter;
1390
1391     for(iter = ctx->stat_ctx; iter != stat_ctx; iter = iter->next) {
1392         if(scope_stack) {
1393             if(iter->using_scope && !push_instr(ctx, OP_pop_scope))
1394                 return E_OUTOFMEMORY;
1395             if(iter->using_except && !push_instr(ctx, OP_pop_except))
1396                 return E_OUTOFMEMORY;
1397         }
1398         stack_pop += iter->stack_use;
1399     }
1400
1401     if(var_stack && stack_pop) {
1402         HRESULT hres;
1403
1404         hres = push_instr_uint(ctx, OP_pop, stack_pop);
1405         if(FAILED(hres))
1406             return hres;
1407     }
1408
1409     return S_OK;
1410 }
1411
1412 /* ECMA-262 3rd Edition    12.7 */
1413 static HRESULT compile_continue_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1414 {
1415     statement_ctx_t *pop_ctx;
1416     HRESULT hres;
1417
1418     if(stat->identifier) {
1419         statement_t *label_stat;
1420         statement_ctx_t *iter;
1421
1422         pop_ctx = NULL;
1423
1424         for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1425             if(iter->continue_label)
1426                 pop_ctx = iter;
1427             if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier))
1428                 break;
1429         }
1430
1431         if(!iter) {
1432             WARN("Label not found\n");
1433             return JS_E_LABEL_NOT_FOUND;
1434         }
1435
1436         /* Labelled continue are allowed only on loops */
1437         for(label_stat = iter->labelled_stat->statement;
1438             label_stat->type == STAT_LABEL;
1439             label_stat = ((labelled_statement_t*)label_stat)->statement);
1440         if(!is_loop_statement(label_stat->type)) {
1441             WARN("Label is not a loop\n");
1442             return JS_E_INVALID_CONTINUE;
1443         }
1444
1445         assert(pop_ctx != NULL);
1446     }else {
1447         for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1448             if(pop_ctx->continue_label)
1449                 break;
1450         }
1451
1452         if(!pop_ctx) {
1453             WARN("continue outside loop\n");
1454             return JS_E_INVALID_CONTINUE;
1455         }
1456     }
1457
1458     hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx);
1459     if(FAILED(hres))
1460         return hres;
1461
1462     return push_instr_uint(ctx, OP_jmp, pop_ctx->continue_label);
1463 }
1464
1465 /* ECMA-262 3rd Edition    12.8 */
1466 static HRESULT compile_break_statement(compiler_ctx_t *ctx, branch_statement_t *stat)
1467 {
1468     statement_ctx_t *pop_ctx;
1469     HRESULT hres;
1470
1471     if(stat->identifier) {
1472         for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1473             if(pop_ctx->labelled_stat && !strcmpW(pop_ctx->labelled_stat->identifier, stat->identifier)) {
1474                 assert(pop_ctx->break_label);
1475                 break;
1476             }
1477         }
1478
1479         if(!pop_ctx) {
1480             WARN("Label not found\n");
1481             return JS_E_LABEL_NOT_FOUND;
1482         }
1483     }else {
1484         for(pop_ctx = ctx->stat_ctx; pop_ctx; pop_ctx = pop_ctx->next) {
1485             if(pop_ctx->break_label && !pop_ctx->labelled_stat)
1486                 break;
1487         }
1488
1489         if(!pop_ctx) {
1490             WARN("Break outside loop\n");
1491             return JS_E_INVALID_BREAK;
1492         }
1493     }
1494
1495     hres = pop_to_stat(ctx, TRUE, TRUE, pop_ctx->next);
1496     if(FAILED(hres))
1497         return hres;
1498
1499     return push_instr_uint(ctx, OP_jmp, pop_ctx->break_label);
1500 }
1501
1502 /* ECMA-262 3rd Edition    12.9 */
1503 static HRESULT compile_return_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1504 {
1505     HRESULT hres;
1506
1507     if(ctx->from_eval) {
1508         WARN("misplaced return statement\n");
1509         return JS_E_MISPLACED_RETURN;
1510     }
1511
1512     hres = pop_to_stat(ctx, TRUE, FALSE, NULL);
1513     if(FAILED(hres))
1514         return hres;
1515
1516     if(stat->expr) {
1517         hres = compile_expression(ctx, stat->expr, TRUE);
1518         if(FAILED(hres))
1519             return hres;
1520         if(!push_instr(ctx, OP_setret))
1521             return E_OUTOFMEMORY;
1522     }
1523
1524     hres = pop_to_stat(ctx, FALSE, TRUE, NULL);
1525     if(FAILED(hres))
1526         return hres;
1527
1528     return push_instr_uint(ctx, OP_ret, !stat->expr);
1529 }
1530
1531 /* ECMA-262 3rd Edition    12.10 */
1532 static HRESULT compile_with_statement(compiler_ctx_t *ctx, with_statement_t *stat)
1533 {
1534     statement_ctx_t stat_ctx = {0, TRUE, FALSE};
1535     HRESULT hres;
1536
1537     hres = compile_expression(ctx, stat->expr, TRUE);
1538     if(FAILED(hres))
1539         return hres;
1540
1541     if(!push_instr(ctx, OP_push_scope))
1542         return E_OUTOFMEMORY;
1543
1544     hres = compile_statement(ctx, &stat_ctx, stat->statement);
1545     if(FAILED(hres))
1546         return hres;
1547
1548     if(!push_instr(ctx, OP_pop_scope))
1549         return E_OUTOFMEMORY;
1550
1551     return S_OK;
1552 }
1553
1554 /* ECMA-262 3rd Edition    12.10 */
1555 static HRESULT compile_labelled_statement(compiler_ctx_t *ctx, labelled_statement_t *stat)
1556 {
1557     statement_ctx_t stat_ctx = {0, FALSE, FALSE, 0, 0, stat}, *iter;
1558     HRESULT hres;
1559
1560     for(iter = ctx->stat_ctx; iter; iter = iter->next) {
1561         if(iter->labelled_stat && !strcmpW(iter->labelled_stat->identifier, stat->identifier)) {
1562             WARN("Label %s redefined\n", debugstr_w(stat->identifier));
1563             return JS_E_LABEL_REDEFINED;
1564         }
1565     }
1566
1567     /* Labelled breaks are allowed for any labelled statements, not only loops (violating spec) */
1568     stat_ctx.break_label = alloc_label(ctx);
1569     if(!stat_ctx.break_label)
1570         return E_OUTOFMEMORY;
1571
1572     hres = compile_statement(ctx, &stat_ctx, stat->statement);
1573     if(FAILED(hres))
1574         return hres;
1575
1576     label_set_addr(ctx, stat_ctx.break_label);
1577     return S_OK;
1578 }
1579
1580 /* ECMA-262 3rd Edition    12.13 */
1581 static HRESULT compile_switch_statement(compiler_ctx_t *ctx, switch_statement_t *stat)
1582 {
1583     statement_ctx_t stat_ctx = {0, FALSE, FALSE};
1584     unsigned case_cnt = 0, *case_jmps, i, default_jmp;
1585     BOOL have_default = FALSE;
1586     statement_t *stat_iter;
1587     case_clausule_t *iter;
1588     HRESULT hres;
1589
1590     hres = compile_expression(ctx, stat->expr, TRUE);
1591     if(FAILED(hres))
1592         return hres;
1593
1594     stat_ctx.break_label = alloc_label(ctx);
1595     if(!stat_ctx.break_label)
1596         return E_OUTOFMEMORY;
1597
1598     for(iter = stat->case_list; iter; iter = iter->next) {
1599         if(iter->expr)
1600             case_cnt++;
1601     }
1602
1603     case_jmps = heap_alloc(case_cnt * sizeof(*case_jmps));
1604     if(!case_jmps)
1605         return E_OUTOFMEMORY;
1606
1607     i = 0;
1608     for(iter = stat->case_list; iter; iter = iter->next) {
1609         if(!iter->expr) {
1610             have_default = TRUE;
1611             continue;
1612         }
1613
1614         hres = compile_expression(ctx, iter->expr, TRUE);
1615         if(FAILED(hres))
1616             break;
1617
1618         case_jmps[i] = push_instr(ctx, OP_case);
1619         if(!case_jmps[i]) {
1620             hres = E_OUTOFMEMORY;
1621             break;
1622         }
1623         i++;
1624     }
1625
1626     if(SUCCEEDED(hres)) {
1627         hres = push_instr_uint(ctx, OP_pop, 1);
1628         if(SUCCEEDED(hres)) {
1629             default_jmp = push_instr(ctx, OP_jmp);
1630             if(!default_jmp)
1631                 hres = E_OUTOFMEMORY;
1632         }
1633     }
1634
1635     if(FAILED(hres)) {
1636         heap_free(case_jmps);
1637         return hres;
1638     }
1639
1640     i = 0;
1641     for(iter = stat->case_list; iter; iter = iter->next) {
1642         while(iter->next && iter->next->stat == iter->stat) {
1643             set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1644             iter = iter->next;
1645         }
1646
1647         set_arg_uint(ctx, iter->expr ? case_jmps[i++] : default_jmp, ctx->code_off);
1648
1649         for(stat_iter = iter->stat; stat_iter && (!iter->next || iter->next->stat != stat_iter);
1650             stat_iter = stat_iter->next) {
1651             hres = compile_statement(ctx, &stat_ctx, stat_iter);
1652             if(FAILED(hres))
1653                 break;
1654         }
1655         if(FAILED(hres))
1656             break;
1657     }
1658
1659     heap_free(case_jmps);
1660     if(FAILED(hres))
1661         return hres;
1662     assert(i == case_cnt);
1663
1664     if(!have_default) {
1665         hres = push_instr_uint(ctx, OP_jmp, stat_ctx.break_label);
1666         if(FAILED(hres))
1667             return hres;
1668         set_arg_uint(ctx, default_jmp, ctx->code_off);
1669     }
1670
1671     label_set_addr(ctx, stat_ctx.break_label);
1672     return S_OK;
1673 }
1674
1675 /* ECMA-262 3rd Edition    12.13 */
1676 static HRESULT compile_throw_statement(compiler_ctx_t *ctx, expression_statement_t *stat)
1677 {
1678     HRESULT hres;
1679
1680     hres = compile_expression(ctx, stat->expr, TRUE);
1681     if(FAILED(hres))
1682         return hres;
1683
1684     return push_instr(ctx, OP_throw) ? S_OK : E_OUTOFMEMORY;
1685 }
1686
1687 /* ECMA-262 3rd Edition    12.14 */
1688 static HRESULT compile_try_statement(compiler_ctx_t *ctx, try_statement_t *stat)
1689 {
1690     statement_ctx_t try_ctx = {0, FALSE, TRUE}, catch_ctx = {0, TRUE, FALSE};
1691     statement_ctx_t finally_ctx = {2, FALSE, FALSE};
1692     unsigned push_except;
1693     BSTR ident;
1694     HRESULT hres;
1695
1696     push_except = push_instr(ctx, OP_push_except);
1697     if(!push_except)
1698         return E_OUTOFMEMORY;
1699
1700     if(stat->catch_block) {
1701         ident = compiler_alloc_bstr(ctx, stat->catch_block->identifier);
1702         if(!ident)
1703             return E_OUTOFMEMORY;
1704     }else {
1705         ident = NULL;
1706     }
1707
1708     instr_ptr(ctx, push_except)->u.arg[1].bstr = ident;
1709
1710     if(!stat->catch_block)
1711         try_ctx.stack_use = 2;
1712
1713     hres = compile_statement(ctx, &try_ctx, stat->try_statement);
1714     if(FAILED(hres))
1715         return hres;
1716
1717     if(!push_instr(ctx, OP_pop_except))
1718         return E_OUTOFMEMORY;
1719
1720     if(stat->catch_block) {
1721         unsigned jmp_finally;
1722
1723         jmp_finally = push_instr(ctx, OP_jmp);
1724         if(!jmp_finally)
1725             return E_OUTOFMEMORY;
1726
1727         instr_ptr(ctx, push_except)->u.arg[0].uint = ctx->code_off;
1728
1729         hres = compile_statement(ctx, &catch_ctx, stat->catch_block->statement);
1730         if(FAILED(hres))
1731             return hres;
1732
1733         if(!push_instr(ctx, OP_pop_scope))
1734             return E_OUTOFMEMORY;
1735
1736         set_arg_uint(ctx, jmp_finally, ctx->code_off);
1737     }else {
1738         set_arg_uint(ctx, push_except, ctx->code_off);
1739     }
1740
1741     if(stat->finally_statement) {
1742         hres = compile_statement(ctx, stat->catch_block ? NULL : &finally_ctx, stat->finally_statement);
1743         if(FAILED(hres))
1744             return hres;
1745
1746         if(!stat->catch_block && !push_instr(ctx, OP_end_finally))
1747             return E_OUTOFMEMORY;
1748     }
1749
1750     return S_OK;
1751 }
1752
1753 static HRESULT compile_statement(compiler_ctx_t *ctx, statement_ctx_t *stat_ctx, statement_t *stat)
1754 {
1755     HRESULT hres;
1756
1757     if(stat_ctx) {
1758         stat_ctx->next = ctx->stat_ctx;
1759         ctx->stat_ctx = stat_ctx;
1760     }
1761
1762     switch(stat->type) {
1763     case STAT_BLOCK:
1764         hres = compile_block_statement(ctx, ((block_statement_t*)stat)->stat_list);
1765         break;
1766     case STAT_BREAK:
1767         hres = compile_break_statement(ctx, (branch_statement_t*)stat);
1768         break;
1769     case STAT_CONTINUE:
1770         hres = compile_continue_statement(ctx, (branch_statement_t*)stat);
1771         break;
1772     case STAT_EMPTY:
1773         /* nothing to do */
1774         hres = S_OK;
1775         break;
1776     case STAT_EXPR:
1777         hres = compile_expression_statement(ctx, (expression_statement_t*)stat);
1778         break;
1779     case STAT_FOR:
1780         hres = compile_for_statement(ctx, (for_statement_t*)stat);
1781         break;
1782     case STAT_FORIN:
1783         hres = compile_forin_statement(ctx, (forin_statement_t*)stat);
1784         break;
1785     case STAT_IF:
1786         hres = compile_if_statement(ctx, (if_statement_t*)stat);
1787         break;
1788     case STAT_LABEL:
1789         hres = compile_labelled_statement(ctx, (labelled_statement_t*)stat);
1790         break;
1791     case STAT_RETURN:
1792         hres = compile_return_statement(ctx, (expression_statement_t*)stat);
1793         break;
1794     case STAT_SWITCH:
1795         hres = compile_switch_statement(ctx, (switch_statement_t*)stat);
1796         break;
1797     case STAT_THROW:
1798         hres = compile_throw_statement(ctx, (expression_statement_t*)stat);
1799         break;
1800     case STAT_TRY:
1801         hres = compile_try_statement(ctx, (try_statement_t*)stat);
1802         break;
1803     case STAT_VAR:
1804         hres = compile_var_statement(ctx, (var_statement_t*)stat);
1805         break;
1806     case STAT_WHILE:
1807         hres = compile_while_statement(ctx, (while_statement_t*)stat);
1808         break;
1809     case STAT_WITH:
1810         hres = compile_with_statement(ctx, (with_statement_t*)stat);
1811         break;
1812     DEFAULT_UNREACHABLE;
1813     }
1814
1815     if(stat_ctx) {
1816         assert(ctx->stat_ctx == stat_ctx);
1817         ctx->stat_ctx = stat_ctx->next;
1818     }
1819
1820     return hres;
1821 }
1822
1823 static int function_local_cmp(const void *key, const struct wine_rb_entry *entry)
1824 {
1825     function_local_t *local = WINE_RB_ENTRY_VALUE(entry, function_local_t, entry);
1826     return strcmpW(key, local->name);
1827 }
1828
1829 static inline function_local_t *find_local(compiler_ctx_t *ctx, const WCHAR *name)
1830 {
1831     struct wine_rb_entry *entry = wine_rb_get(&ctx->locals, name);
1832     return entry ? WINE_RB_ENTRY_VALUE(entry, function_local_t, entry) : NULL;
1833 }
1834
1835 static BOOL alloc_local(compiler_ctx_t *ctx, BSTR name, int ref)
1836 {
1837     function_local_t *local;
1838
1839     local = heap_pool_alloc(&ctx->heap, sizeof(*local));
1840     if(!local)
1841         return FALSE;
1842
1843     local->name = name;
1844     local->ref = ref;
1845     wine_rb_put(&ctx->locals, name, &local->entry);
1846     ctx->locals_cnt++;
1847     return TRUE;
1848 }
1849
1850 static BOOL alloc_variable(compiler_ctx_t *ctx, const WCHAR *name)
1851 {
1852     BSTR ident;
1853
1854     if(find_local(ctx, name))
1855         return TRUE;
1856
1857     ident = compiler_alloc_bstr(ctx, name);
1858     if(!ident)
1859         return FALSE;
1860
1861     return alloc_local(ctx, ident, ctx->func->var_cnt++);
1862 }
1863
1864 static BOOL visit_function_expression(compiler_ctx_t *ctx, function_expression_t *expr)
1865 {
1866     expr->func_id = ctx->func->func_cnt++;
1867     ctx->func_tail = ctx->func_tail ? (ctx->func_tail->next = expr) : (ctx->func_head = expr);
1868
1869     return !expr->identifier || expr->event_target || alloc_variable(ctx, expr->identifier);
1870 }
1871
1872 static HRESULT visit_expression(compiler_ctx_t *ctx, expression_t *expr)
1873 {
1874     HRESULT hres = S_OK;
1875
1876     switch(expr->type) {
1877     case EXPR_ADD:
1878     case EXPR_AND:
1879     case EXPR_ARRAY:
1880     case EXPR_ASSIGN:
1881     case EXPR_ASSIGNADD:
1882     case EXPR_ASSIGNAND:
1883     case EXPR_ASSIGNSUB:
1884     case EXPR_ASSIGNMUL:
1885     case EXPR_ASSIGNDIV:
1886     case EXPR_ASSIGNMOD:
1887     case EXPR_ASSIGNOR:
1888     case EXPR_ASSIGNLSHIFT:
1889     case EXPR_ASSIGNRSHIFT:
1890     case EXPR_ASSIGNRRSHIFT:
1891     case EXPR_ASSIGNXOR:
1892     case EXPR_BAND:
1893     case EXPR_BOR:
1894     case EXPR_COMMA:
1895     case EXPR_DIV:
1896     case EXPR_EQ:
1897     case EXPR_EQEQ:
1898     case EXPR_GREATER:
1899     case EXPR_GREATEREQ:
1900     case EXPR_IN:
1901     case EXPR_INSTANCEOF:
1902     case EXPR_LESS:
1903     case EXPR_LESSEQ:
1904     case EXPR_LSHIFT:
1905     case EXPR_MOD:
1906     case EXPR_MUL:
1907     case EXPR_NOTEQ:
1908     case EXPR_NOTEQEQ:
1909     case EXPR_OR:
1910     case EXPR_RSHIFT:
1911     case EXPR_RRSHIFT:
1912     case EXPR_SUB:
1913     case EXPR_BXOR: {
1914         binary_expression_t *binary_expr = (binary_expression_t*)expr;
1915
1916         hres = visit_expression(ctx, binary_expr->expression1);
1917         if(FAILED(hres))
1918             return hres;
1919
1920         hres = visit_expression(ctx, binary_expr->expression2);
1921         break;
1922     }
1923     case EXPR_BITNEG:
1924     case EXPR_DELETE:
1925     case EXPR_LOGNEG:
1926     case EXPR_MINUS:
1927     case EXPR_PLUS:
1928     case EXPR_POSTDEC:
1929     case EXPR_POSTINC:
1930     case EXPR_PREDEC:
1931     case EXPR_PREINC:
1932     case EXPR_TYPEOF:
1933     case EXPR_VOID:
1934         hres = visit_expression(ctx, ((unary_expression_t*)expr)->expression);
1935         break;
1936     case EXPR_IDENT:
1937     case EXPR_LITERAL:
1938     case EXPR_THIS:
1939         break;
1940     case EXPR_ARRAYLIT: {
1941         array_literal_expression_t *array_expr = (array_literal_expression_t*)expr;
1942         array_element_t *iter;
1943
1944         for(iter = array_expr->element_list; iter; iter = iter->next) {
1945             hres = visit_expression(ctx, iter->expr);
1946             if(FAILED(hres))
1947                 return hres;
1948         }
1949         break;
1950     }
1951     case EXPR_CALL:
1952     case EXPR_NEW: {
1953         call_expression_t *call_expr = (call_expression_t*)expr;
1954         argument_t *arg;
1955
1956         hres = visit_expression(ctx, call_expr->expression);
1957         if(FAILED(hres))
1958             return hres;
1959
1960         for(arg = call_expr->argument_list; arg; arg = arg->next) {
1961             hres = visit_expression(ctx, arg->expr);
1962             if(FAILED(hres))
1963                 return hres;
1964         }
1965         break;
1966     }
1967     case EXPR_COND: {
1968         conditional_expression_t *cond_expr = (conditional_expression_t*)expr;
1969
1970         hres = visit_expression(ctx, cond_expr->expression);
1971         if(FAILED(hres))
1972             return hres;
1973
1974         hres = visit_expression(ctx, cond_expr->true_expression);
1975         if(FAILED(hres))
1976             return hres;
1977
1978         hres = visit_expression(ctx, cond_expr->false_expression);
1979         break;
1980     }
1981     case EXPR_FUNC:
1982         visit_function_expression(ctx, (function_expression_t*)expr);
1983         break;
1984     case EXPR_MEMBER:
1985         hres = visit_expression(ctx, ((member_expression_t*)expr)->expression);
1986         break;
1987     case EXPR_PROPVAL: {
1988         prop_val_t *iter;
1989         for(iter = ((property_value_expression_t*)expr)->property_list; iter; iter = iter->next) {
1990             hres = visit_expression(ctx, iter->value);
1991             if(FAILED(hres))
1992                 return hres;
1993         }
1994         break;
1995     }
1996     DEFAULT_UNREACHABLE;
1997     }
1998
1999     return hres;
2000 }
2001
2002 static HRESULT visit_variable_list(compiler_ctx_t *ctx, variable_declaration_t *list)
2003 {
2004     variable_declaration_t *iter;
2005     HRESULT hres;
2006
2007     for(iter = list; iter; iter = iter->next) {
2008         if(!alloc_variable(ctx, iter->identifier))
2009             return E_OUTOFMEMORY;
2010
2011         if(iter->expr) {
2012             hres = visit_expression(ctx, iter->expr);
2013             if(FAILED(hres))
2014                 return hres;
2015         }
2016     }
2017
2018     return S_OK;
2019 }
2020
2021 static HRESULT visit_statement(compiler_ctx_t*,statement_t*);
2022
2023 static HRESULT visit_block_statement(compiler_ctx_t *ctx, statement_t *iter)
2024 {
2025     HRESULT hres;
2026
2027     while(iter) {
2028         hres = visit_statement(ctx, iter);
2029         if(FAILED(hres))
2030             return hres;
2031
2032         iter = iter->next;
2033     }
2034
2035     return S_OK;
2036 }
2037
2038 static HRESULT visit_statement(compiler_ctx_t *ctx, statement_t *stat)
2039 {
2040     HRESULT hres = S_OK;
2041
2042     switch(stat->type) {
2043     case STAT_BLOCK:
2044         hres = visit_block_statement(ctx, ((block_statement_t*)stat)->stat_list);
2045         break;
2046     case STAT_BREAK:
2047     case STAT_CONTINUE:
2048     case STAT_EMPTY:
2049         break;
2050     case STAT_EXPR:
2051     case STAT_RETURN:
2052     case STAT_THROW: {
2053         expression_statement_t *expr_stat = (expression_statement_t*)stat;
2054         if(expr_stat->expr)
2055             hres = visit_expression(ctx, expr_stat->expr);
2056         break;
2057     }
2058     case STAT_FOR: {
2059         for_statement_t *for_stat = (for_statement_t*)stat;
2060
2061         if(for_stat->variable_list)
2062             hres = visit_variable_list(ctx, for_stat->variable_list);
2063         else if(for_stat->begin_expr)
2064             hres = visit_expression(ctx, for_stat->begin_expr);
2065         if(FAILED(hres))
2066             break;
2067
2068         if(for_stat->expr) {
2069             hres = visit_expression(ctx, for_stat->expr);
2070             if(FAILED(hres))
2071                 break;
2072         }
2073
2074         hres = visit_statement(ctx, for_stat->statement);
2075         if(FAILED(hres))
2076             break;
2077
2078         if(for_stat->end_expr)
2079             hres = visit_expression(ctx, for_stat->end_expr);
2080         break;
2081     }
2082     case STAT_FORIN:  {
2083         forin_statement_t *forin_stat = (forin_statement_t*)stat;
2084
2085         if(forin_stat->variable) {
2086             hres = visit_variable_list(ctx, forin_stat->variable);
2087             if(FAILED(hres))
2088                 break;
2089         }
2090
2091         hres = visit_expression(ctx, forin_stat->in_expr);
2092         if(FAILED(hres))
2093             return hres;
2094
2095         if(forin_stat->expr) {
2096             hres = visit_expression(ctx, forin_stat->expr);
2097             if(FAILED(hres))
2098                 return hres;
2099         }
2100
2101         hres = visit_statement(ctx, forin_stat->statement);
2102         break;
2103     }
2104     case STAT_IF: {
2105         if_statement_t *if_stat = (if_statement_t*)stat;
2106
2107         hres = visit_expression(ctx, if_stat->expr);
2108         if(FAILED(hres))
2109             return hres;
2110
2111         hres = visit_statement(ctx, if_stat->if_stat);
2112         if(FAILED(hres))
2113             return hres;
2114
2115         if(if_stat->else_stat)
2116             hres = visit_statement(ctx, if_stat->else_stat);
2117         break;
2118     }
2119     case STAT_LABEL:
2120         hres = visit_statement(ctx, ((labelled_statement_t*)stat)->statement);
2121         break;
2122     case STAT_SWITCH: {
2123         switch_statement_t *switch_stat = (switch_statement_t*)stat;
2124         statement_t *stat_iter;
2125         case_clausule_t *iter;
2126
2127         hres = visit_expression(ctx, switch_stat->expr);
2128         if(FAILED(hres))
2129             return hres;
2130
2131         for(iter = switch_stat->case_list; iter; iter = iter->next) {
2132             if(!iter->expr)
2133                 continue;
2134             hres = visit_expression(ctx, iter->expr);
2135             if(FAILED(hres))
2136                 return hres;
2137         }
2138
2139         for(iter = switch_stat->case_list; iter; iter = iter->next) {
2140             while(iter->next && iter->next->stat == iter->stat)
2141                 iter = iter->next;
2142             for(stat_iter = iter->stat; stat_iter && (!iter->next || iter->next->stat != stat_iter);
2143                 stat_iter = stat_iter->next) {
2144                 hres = visit_statement(ctx, stat_iter);
2145                 if(FAILED(hres))
2146                     return hres;
2147             }
2148         }
2149         break;
2150     }
2151     case STAT_TRY: {
2152         try_statement_t *try_stat = (try_statement_t*)stat;
2153
2154         hres = visit_statement(ctx, try_stat->try_statement);
2155         if(FAILED(hres))
2156             return hres;
2157
2158         if(try_stat->catch_block) {
2159             hres = visit_statement(ctx, try_stat->catch_block->statement);
2160             if(FAILED(hres))
2161                 return hres;
2162         }
2163
2164         if(try_stat->finally_statement)
2165             hres = visit_statement(ctx, try_stat->finally_statement);
2166         break;
2167     }
2168     case STAT_VAR:
2169         hres = visit_variable_list(ctx, ((var_statement_t*)stat)->variable_list);
2170         break;
2171     case STAT_WHILE: {
2172         while_statement_t *while_stat = (while_statement_t*)stat;
2173
2174         hres = visit_expression(ctx, while_stat->expr);
2175         if(FAILED(hres))
2176             return hres;
2177
2178         hres = visit_statement(ctx, while_stat->statement);
2179         break;
2180     }
2181     case STAT_WITH: {
2182         with_statement_t *with_stat = (with_statement_t*)stat;
2183
2184         hres = visit_expression(ctx, with_stat->expr);
2185         if(FAILED(hres))
2186             return hres;
2187
2188         hres = visit_statement(ctx, with_stat->statement);
2189         break;
2190     }
2191     DEFAULT_UNREACHABLE;
2192     }
2193
2194     return hres;
2195 }
2196
2197 static void resolve_labels(compiler_ctx_t *ctx, unsigned off)
2198 {
2199     instr_t *instr;
2200
2201     for(instr = ctx->code->instrs+off; instr < ctx->code->instrs+ctx->code_off; instr++) {
2202         if(instr_info[instr->op].arg1_type == ARG_ADDR && (instr->u.arg->uint & LABEL_FLAG)) {
2203             assert((instr->u.arg->uint & ~LABEL_FLAG) < ctx->labels_cnt);
2204             instr->u.arg->uint = ctx->labels[instr->u.arg->uint & ~LABEL_FLAG];
2205         }
2206         assert(instr_info[instr->op].arg2_type != ARG_ADDR);
2207     }
2208
2209     ctx->labels_cnt = 0;
2210 }
2211
2212 void release_bytecode(bytecode_t *code)
2213 {
2214     unsigned i;
2215
2216     if(--code->ref)
2217         return;
2218
2219     for(i=0; i < code->bstr_cnt; i++)
2220         SysFreeString(code->bstr_pool[i]);
2221     for(i=0; i < code->str_cnt; i++)
2222         jsstr_release(code->str_pool[i]);
2223
2224     heap_free(code->source);
2225     heap_pool_free(&code->heap);
2226     heap_free(code->bstr_pool);
2227     heap_free(code->str_pool);
2228     heap_free(code->instrs);
2229     heap_free(code);
2230 }
2231
2232 static HRESULT init_code(compiler_ctx_t *compiler, const WCHAR *source)
2233 {
2234     compiler->code = heap_alloc_zero(sizeof(bytecode_t));
2235     if(!compiler->code)
2236         return E_OUTOFMEMORY;
2237
2238     compiler->code->ref = 1;
2239     heap_pool_init(&compiler->code->heap);
2240
2241     compiler->code->source = heap_strdupW(source);
2242     if(!compiler->code->source) {
2243         release_bytecode(compiler->code);
2244         return E_OUTOFMEMORY;
2245     }
2246
2247     compiler->code->instrs = heap_alloc(64 * sizeof(instr_t));
2248     if(!compiler->code->instrs) {
2249         release_bytecode(compiler->code);
2250         return E_OUTOFMEMORY;
2251     }
2252
2253     compiler->code_size = 64;
2254     compiler->code_off = 1;
2255     return S_OK;
2256 }
2257
2258 static HRESULT compile_function(compiler_ctx_t *ctx, source_elements_t *source, function_expression_t *func_expr,
2259         BOOL from_eval, function_code_t *func)
2260 {
2261     function_expression_t *iter;
2262     function_local_t *local;
2263     unsigned off, i;
2264     HRESULT hres;
2265
2266     TRACE("\n");
2267
2268     ctx->func_head = ctx->func_tail = NULL;
2269     ctx->from_eval = from_eval;
2270     ctx->func = func;
2271     ctx->locals_cnt = 0;
2272     wine_rb_init(&ctx->locals, function_local_cmp);
2273
2274     if(func_expr) {
2275         parameter_t *param_iter;
2276
2277         if(func_expr->identifier) {
2278             func->name = compiler_alloc_bstr(ctx, func_expr->identifier);
2279             if(!func->name)
2280                 return E_OUTOFMEMORY;
2281         }
2282
2283         if(func_expr->event_target) {
2284             func->event_target = compiler_alloc_bstr(ctx, func_expr->event_target);
2285             if(!func->event_target)
2286                 return E_OUTOFMEMORY;
2287         }
2288
2289         func->source = func_expr->src_str;
2290         func->source_len = func_expr->src_len;
2291
2292         for(param_iter = func_expr->parameter_list; param_iter; param_iter = param_iter->next)
2293             func->param_cnt++;
2294
2295         func->params = compiler_alloc(ctx->code, func->param_cnt * sizeof(*func->params));
2296         if(!func->params)
2297             return E_OUTOFMEMORY;
2298
2299         for(param_iter = func_expr->parameter_list, i=0; param_iter; param_iter = param_iter->next, i++) {
2300             func->params[i] = compiler_alloc_bstr(ctx, param_iter->identifier);
2301             if(!func->params[i])
2302                 return E_OUTOFMEMORY;
2303         }
2304     }
2305
2306     for(i = 0; i < func->param_cnt; i++) {
2307         if(!find_local(ctx, func->params[i]) && !alloc_local(ctx, func->params[i], -i-1))
2308             return E_OUTOFMEMORY;
2309     }
2310
2311     hres = visit_block_statement(ctx, source->statement);
2312     if(FAILED(hres))
2313         return hres;
2314
2315     func->locals = compiler_alloc(ctx->code, ctx->locals_cnt * sizeof(*func->locals));
2316     if(!func->locals)
2317         return E_OUTOFMEMORY;
2318     func->locals_cnt = ctx->locals_cnt;
2319
2320     func->variables = compiler_alloc(ctx->code, func->var_cnt * sizeof(*func->variables));
2321     if(!func->variables)
2322         return E_OUTOFMEMORY;
2323
2324     i = 0;
2325     WINE_RB_FOR_EACH_ENTRY(local, &ctx->locals, function_local_t, entry) {
2326         func->locals[i].name = local->name;
2327         func->locals[i].ref = local->ref;
2328         if(local->ref >= 0) {
2329             func->variables[local->ref].name = local->name;
2330             func->variables[local->ref].func_id = -1;
2331         }
2332         i++;
2333     }
2334     assert(i == ctx->locals_cnt);
2335
2336     func->funcs = compiler_alloc(ctx->code, func->func_cnt * sizeof(*func->funcs));
2337     if(!func->funcs)
2338         return E_OUTOFMEMORY;
2339     memset(func->funcs, 0, func->func_cnt * sizeof(*func->funcs));
2340
2341     off = ctx->code_off;
2342     hres = compile_block_statement(ctx, source->statement);
2343     if(FAILED(hres))
2344         return hres;
2345
2346     resolve_labels(ctx, off);
2347
2348     hres = push_instr_uint(ctx, OP_ret, !from_eval);
2349     if(FAILED(hres))
2350         return hres;
2351
2352     if(TRACE_ON(jscript_disas))
2353         dump_code(ctx, off);
2354
2355     func->instr_off = off;
2356
2357     for(iter = ctx->func_head, i=0; iter; iter = iter->next, i++) {
2358         hres = compile_function(ctx, iter->source_elements, iter, FALSE, func->funcs+i);
2359         if(FAILED(hres))
2360             return hres;
2361
2362         TRACE("[%d] func %s\n", i, debugstr_w(func->funcs[i].name));
2363         if(func->funcs[i].name && !func->funcs[i].event_target) {
2364             local_ref_t *local_ref = lookup_local(func, func->funcs[i].name);
2365             func->funcs[i].local_ref = local_ref->ref;
2366             TRACE("found ref %s %d for %s\n", debugstr_w(local_ref->name), local_ref->ref, debugstr_w(func->funcs[i].name));
2367             if(local_ref->ref >= 0)
2368                 func->variables[local_ref->ref].func_id = i;
2369         }
2370     }
2371
2372     assert(i == func->func_cnt);
2373
2374     return S_OK;
2375 }
2376
2377 static HRESULT parse_arguments(compiler_ctx_t *ctx, const WCHAR *args, BSTR *arg_array, unsigned *args_size)
2378 {
2379     const WCHAR *ptr = args, *ptr2;
2380     unsigned arg_cnt = 0;
2381
2382     while(isspaceW(*ptr))
2383         ptr++;
2384     if(!*ptr) {
2385         if(args_size)
2386             *args_size = 0;
2387         return S_OK;
2388     }
2389
2390     while(1) {
2391         if(!isalphaW(*ptr) && *ptr != '_') {
2392             FIXME("expected alpha or '_': %s\n", debugstr_w(ptr));
2393             return E_FAIL;
2394         }
2395
2396         ptr2 = ptr;
2397         while(isalnumW(*ptr) || *ptr == '_')
2398             ptr++;
2399
2400         if(*ptr && *ptr != ',' && !isspaceW(*ptr)) {
2401             FIXME("unexpected har %s\n", debugstr_w(ptr));
2402             return E_FAIL;
2403         }
2404
2405         if(arg_array) {
2406             arg_array[arg_cnt] = compiler_alloc_bstr_len(ctx, ptr2, ptr-ptr2);
2407             if(!arg_array[arg_cnt])
2408                 return E_OUTOFMEMORY;
2409         }
2410         arg_cnt++;
2411
2412         while(isspaceW(*ptr))
2413             ptr++;
2414         if(!*ptr)
2415             break;
2416         if(*ptr != ',') {
2417             FIXME("expected ',': %s\n", debugstr_w(ptr));
2418             return E_FAIL;
2419         }
2420
2421         ptr++;
2422         while(isspaceW(*ptr))
2423             ptr++;
2424     }
2425
2426     if(args_size)
2427         *args_size = arg_cnt;
2428     return S_OK;
2429 }
2430
2431 static HRESULT compile_arguments(compiler_ctx_t *ctx, const WCHAR *args)
2432 {
2433     HRESULT hres;
2434
2435     hres = parse_arguments(ctx, args, NULL, &ctx->code->global_code.param_cnt);
2436     if(FAILED(hres))
2437         return hres;
2438
2439     ctx->code->global_code.params = compiler_alloc(ctx->code,
2440             ctx->code->global_code.param_cnt * sizeof(*ctx->code->global_code.params));
2441     if(!ctx->code->global_code.params)
2442         return E_OUTOFMEMORY;
2443
2444     return parse_arguments(ctx, args, ctx->code->global_code.params, NULL);
2445 }
2446
2447 HRESULT compile_script(script_ctx_t *ctx, const WCHAR *code, const WCHAR *args, const WCHAR *delimiter,
2448         BOOL from_eval, BOOL use_decode, bytecode_t **ret)
2449 {
2450     compiler_ctx_t compiler = {0};
2451     HRESULT hres;
2452
2453     hres = init_code(&compiler, code);
2454     if(FAILED(hres))
2455         return hres;
2456
2457     if(args) {
2458         hres = compile_arguments(&compiler, args);
2459         if(FAILED(hres))
2460             return hres;
2461     }
2462
2463     if(use_decode) {
2464         hres = decode_source(compiler.code->source);
2465         if(FAILED(hres)) {
2466             WARN("Decoding failed\n");
2467             return hres;
2468         }
2469     }
2470
2471     hres = script_parse(ctx, compiler.code->source, delimiter, from_eval, &compiler.parser);
2472     if(FAILED(hres)) {
2473         release_bytecode(compiler.code);
2474         return hres;
2475     }
2476
2477     heap_pool_init(&compiler.heap);
2478     hres = compile_function(&compiler, compiler.parser->source, NULL, from_eval, &compiler.code->global_code);
2479     heap_pool_free(&compiler.heap);
2480     parser_release(compiler.parser);
2481     if(FAILED(hres)) {
2482         release_bytecode(compiler.code);
2483         return hres;
2484     }
2485
2486     *ret = compiler.code;
2487     return S_OK;
2488 }