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