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
  25 #include "wine/debug.h"
  26
  27 WINE_DEFAULT_DEBUG_CHANNEL(jscript);
  28
  29 struct _compiler_ctx_t {
  30     parser_ctx_t *parser;
  31     bytecode_t *code;
  32
  33     unsigned code_off;
  34     unsigned code_size;
  35 };
  36
  37 static HRESULT compile_expression(compiler_ctx_t*,expression_t*);
  38
  39 static inline void *compiler_alloc(bytecode_t *code, size_t size)
  40 {
  41     return jsheap_alloc(&code->heap, size);
  42 }
  43
  44 static WCHAR *compiler_alloc_string(bytecode_t *code, const WCHAR *str)
  45 {
  46     size_t size;
  47     WCHAR *ret;
  48
  49     size = (strlenW(str)+1)*sizeof(WCHAR);
  50     ret = compiler_alloc(code, size);
  51     if(ret)
  52         memcpy(ret, str, size);
  53     return ret;
  54 }
  55
  56 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
  57 {
  58     if(!ctx->code->bstr_pool_size) {
  59         ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
  60         if(!ctx->code->bstr_pool)
  61             return NULL;
  62         ctx->code->bstr_pool_size = 8;
  63     }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
  64         BSTR *new_pool;
  65
  66         new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
  67         if(!new_pool)
  68             return NULL;
  69
  70         ctx->code->bstr_pool = new_pool;
  71         ctx->code->bstr_pool_size *= 2;
  72     }
  73
  74     ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
  75     if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
  76         return NULL;
  77
  78     return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
  79 }
  80
  81 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
  82 {
  83     assert(ctx->code_size >= ctx->code_off);
  84
  85     if(!ctx->code_size) {
  86         ctx->code->instrs = heap_alloc(64 * sizeof(instr_t));
  87         if(!ctx->code->instrs)
  88             return -1;
  89         ctx->code_size = 64;
  90     }else if(ctx->code_size == ctx->code_off) {
  91         instr_t *new_instrs;
  92
  93         new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
  94         if(!new_instrs)
  95             return -1;
  96
  97         ctx->code->instrs = new_instrs;
  98         ctx->code_size *= 2;
  99     }
 100
 101     ctx->code->instrs[ctx->code_off].op = op;
 102     return ctx->code_off++;
 103 }
 104
 105 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
 106 {
 107     assert(off < ctx->code_off);
 108     return ctx->code->instrs + off;
 109 }
 110
 111 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
 112 {
 113     unsigned instr;
 114
 115     instr = push_instr(ctx, op);
 116     if(instr == -1)
 117         return E_OUTOFMEMORY;
 118
 119     instr_ptr(ctx, instr)->arg1.lng = arg;
 120     return S_OK;
 121 }
 122
 123 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
 124 {
 125     unsigned instr;
 126     WCHAR *str;
 127
 128     str = compiler_alloc_string(ctx->code, arg);
 129     if(!str)
 130         return E_OUTOFMEMORY;
 131
 132     instr = push_instr(ctx, op);
 133     if(instr == -1)
 134         return E_OUTOFMEMORY;
 135
 136     instr_ptr(ctx, instr)->arg1.str = str;
 137     return S_OK;
 138 }
 139
 140 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
 141 {
 142     unsigned instr;
 143     WCHAR *str;
 144
 145     str = compiler_alloc_bstr(ctx, arg);
 146     if(!str)
 147         return E_OUTOFMEMORY;
 148
 149     instr = push_instr(ctx, op);
 150     if(instr == -1)
 151         return E_OUTOFMEMORY;
 152
 153     instr_ptr(ctx, instr)->arg1.bstr = str;
 154     return S_OK;
 155 }
 156
 157 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
 158 {
 159     unsigned instr;
 160     DOUBLE *dbl;
 161
 162     dbl = compiler_alloc(ctx->code, sizeof(arg));
 163     if(!dbl)
 164         return E_OUTOFMEMORY;
 165     *dbl = arg;
 166
 167     instr = push_instr(ctx, op);
 168     if(instr == -1)
 169         return E_OUTOFMEMORY;
 170
 171     instr_ptr(ctx, instr)->arg1.dbl = dbl;
 172     return S_OK;
 173 }
 174
 175 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
 176 {
 177     unsigned instr;
 178
 179     instr = push_instr(ctx, op);
 180     if(instr == -1)
 181         return E_OUTOFMEMORY;
 182
 183     instr_ptr(ctx, instr)->arg1.uint = arg;
 184     return S_OK;
 185 }
 186
 187 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 188 {
 189     HRESULT hres;
 190
 191     hres = compile_expression(ctx, expr->expression1);
 192     if(FAILED(hres))
 193         return hres;
 194
 195     hres = compile_expression(ctx, expr->expression2);
 196     if(FAILED(hres))
 197         return hres;
 198
 199     return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
 200 }
 201
 202 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
 203 {
 204     HRESULT hres;
 205
 206     hres = compile_expression(ctx, expr->expression);
 207     if(FAILED(hres))
 208         return hres;
 209
 210     return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
 211 }
 212
 213 /* ECMA-262 3rd Edition    11.14 */
 214 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr)
 215 {
 216     HRESULT hres;
 217
 218     hres = compile_expression(ctx, expr->expression1);
 219     if(FAILED(hres))
 220         return hres;
 221
 222     if(push_instr(ctx, OP_pop) == -1)
 223         return E_OUTOFMEMORY;
 224
 225     return compile_expression(ctx, expr->expression2);
 226 }
 227
 228 /* ECMA-262 3rd Edition    11.11 */
 229 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 230 {
 231     unsigned instr;
 232     HRESULT hres;
 233
 234     hres = compile_expression(ctx, expr->expression1);
 235     if(FAILED(hres))
 236         return hres;
 237
 238     instr = push_instr(ctx, op);
 239     if(instr == -1)
 240         return E_OUTOFMEMORY;
 241
 242     hres = compile_expression(ctx, expr->expression2);
 243     if(FAILED(hres))
 244         return hres;
 245
 246     instr_ptr(ctx, instr)->arg1.uint = ctx->code_off;
 247     return S_OK;
 248 }
 249
 250 /* ECMA-262 3rd Edition    11.12 */
 251 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
 252 {
 253     unsigned jmp_false, jmp_end;
 254     HRESULT hres;
 255
 256     hres = compile_expression(ctx, expr->expression);
 257     if(FAILED(hres))
 258         return hres;
 259
 260     jmp_false = push_instr(ctx, OP_jmp_z);
 261     if(jmp_false == -1)
 262         return E_OUTOFMEMORY;
 263
 264     hres = compile_expression(ctx, expr->true_expression);
 265     if(FAILED(hres))
 266         return hres;
 267
 268     jmp_end = push_instr(ctx, OP_jmp);
 269     if(jmp_end == -1)
 270         return E_OUTOFMEMORY;
 271
 272     instr_ptr(ctx, jmp_false)->arg1.uint = ctx->code_off;
 273     if(push_instr(ctx, OP_pop) == -1)
 274         return E_OUTOFMEMORY;
 275
 276     hres = compile_expression(ctx, expr->false_expression);
 277     if(FAILED(hres))
 278         return hres;
 279
 280     instr_ptr(ctx, jmp_end)->arg1.uint = ctx->code_off;
 281     return S_OK;
 282 }
 283
 284 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
 285 {
 286     unsigned arg_cnt = 0;
 287     argument_t *arg;
 288     HRESULT hres;
 289
 290     hres = compile_expression(ctx, expr->expression);
 291     if(FAILED(hres))
 292         return hres;
 293
 294     for(arg = expr->argument_list; arg; arg = arg->next) {
 295         hres = compile_expression(ctx, arg->expr);
 296         if(FAILED(hres))
 297             return hres;
 298         arg_cnt++;
 299     }
 300
 301     return push_instr_int(ctx, OP_new, arg_cnt);
 302 }
 303
 304 static HRESULT compile_interp_fallback(compiler_ctx_t *ctx, expression_t *expr)
 305 {
 306     unsigned instr;
 307
 308     instr = push_instr(ctx, OP_tree);
 309     if(instr == -1)
 310         return E_OUTOFMEMORY;
 311
 312     instr_ptr(ctx, instr)->arg1.expr = expr;
 313     return S_OK;
 314 }
 315
 316 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
 317 {
 318     HRESULT hres;
 319
 320     switch(expr->expression->type) {
 321     case EXPR_ARRAY: {
 322         array_expression_t *array_expr = (array_expression_t*)expr->expression;
 323
 324         hres = compile_expression(ctx, array_expr->member_expr);
 325         if(FAILED(hres))
 326             return hres;
 327
 328         hres = compile_expression(ctx, array_expr->expression);
 329         if(FAILED(hres))
 330             return hres;
 331
 332         if(push_instr(ctx, OP_delete) == -1)
 333             return E_OUTOFMEMORY;
 334         break;
 335     }
 336     case EXPR_MEMBER: {
 337         member_expression_t *member_expr = (member_expression_t*)expr->expression;
 338
 339         hres = compile_expression(ctx, member_expr->expression);
 340         if(FAILED(hres))
 341             return hres;
 342
 343         /* FIXME: Potential optimization */
 344         hres = push_instr_str(ctx, OP_str, member_expr->identifier);
 345         if(FAILED(hres))
 346             return hres;
 347
 348         if(push_instr(ctx, OP_delete) == -1)
 349             return E_OUTOFMEMORY;
 350         break;
 351     }
 352     default:
 353         expr->expr.eval = delete_expression_eval;
 354         return compile_interp_fallback(ctx, &expr->expr);
 355     }
 356
 357     return S_OK;
 358 }
 359
 360 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
 361 {
 362     HRESULT hres;
 363
 364     switch(expr->expression1->type) {
 365     case EXPR_IDENT: {
 366         identifier_expression_t *ident_expr = (identifier_expression_t*)expr->expression1;
 367
 368         hres = push_instr_bstr(ctx, OP_identid, ident_expr->identifier);
 369         if(FAILED(hres))
 370             return hres;
 371         break;
 372     }
 373     case EXPR_ARRAY: {
 374         array_expression_t *array_expr = (array_expression_t*)expr->expression1;
 375
 376         hres = compile_expression(ctx, array_expr->member_expr);
 377         if(FAILED(hres))
 378             return hres;
 379
 380         hres = compile_expression(ctx, array_expr->expression);
 381         if(FAILED(hres))
 382             return hres;
 383
 384         if(push_instr(ctx, OP_memberid) == -1)
 385             return E_OUTOFMEMORY;
 386         break;
 387     }
 388     case EXPR_MEMBER: {
 389         member_expression_t *member_expr = (member_expression_t*)expr->expression1;
 390
 391         hres = compile_expression(ctx, member_expr->expression);
 392         if(FAILED(hres))
 393             return hres;
 394
 395         /* FIXME: Potential optimization */
 396         hres = push_instr_str(ctx, OP_str, member_expr->identifier);
 397         if(FAILED(hres))
 398             return hres;
 399
 400         if(push_instr(ctx, OP_memberid) == -1)
 401             return E_OUTOFMEMORY;
 402         break;
 403     }
 404     default:
 405         hres = compile_expression(ctx, expr->expression1);
 406         if(FAILED(hres))
 407             return hres;
 408
 409         hres = compile_expression(ctx, expr->expression2);
 410         if(FAILED(hres))
 411             return hres;
 412
 413         if(op != OP_LAST && push_instr(ctx, op) == -1)
 414             return E_OUTOFMEMORY;
 415
 416         return push_instr_uint(ctx, OP_throw, JS_E_ILLEGAL_ASSIGN);
 417     }
 418
 419     if(op != OP_LAST && push_instr(ctx, OP_refval) == -1)
 420         return E_OUTOFMEMORY;
 421
 422     hres = compile_expression(ctx, expr->expression2);
 423     if(FAILED(hres))
 424         return hres;
 425
 426     if(op != OP_LAST && push_instr(ctx, op) == -1)
 427         return E_OUTOFMEMORY;
 428
 429     if(push_instr(ctx, OP_assign) == -1)
 430         return E_OUTOFMEMORY;
 431
 432     return S_OK;
 433 }
 434
 435 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
 436 {
 437     switch(literal->type) {
 438     case LT_BOOL:
 439         return push_instr_int(ctx, OP_bool, literal->u.bval);
 440     case LT_DOUBLE:
 441         return push_instr_double(ctx, OP_double, literal->u.dval);
 442     case LT_INT:
 443         return push_instr_int(ctx, OP_int, literal->u.lval);
 444     case LT_NULL:
 445         return push_instr(ctx, OP_null);
 446     case LT_STRING:
 447         return push_instr_str(ctx, OP_str, literal->u.wstr);
 448     case LT_REGEXP: {
 449         unsigned instr;
 450         WCHAR *str;
 451
 452         str = compiler_alloc(ctx->code, (literal->u.regexp.str_len+1)*sizeof(WCHAR));
 453         if(!str)
 454             return E_OUTOFMEMORY;
 455         memcpy(str, literal->u.regexp.str, literal->u.regexp.str_len*sizeof(WCHAR));
 456         str[literal->u.regexp.str_len] = 0;
 457
 458         instr = push_instr(ctx, OP_regexp);
 459         if(instr == -1)
 460             return E_OUTOFMEMORY;
 461
 462         instr_ptr(ctx, instr)->arg1.str = str;
 463         instr_ptr(ctx, instr)->arg2.lng = literal->u.regexp.flags;
 464         return S_OK;
 465     }
 466     default:
 467         assert(0);
 468     }
 469 }
 470
 471 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr)
 472 {
 473     switch(expr->type) {
 474     case EXPR_ADD:
 475         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
 476     case EXPR_AND:
 477         return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_z);
 478     case EXPR_ASSIGN:
 479         return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
 480     case EXPR_ASSIGNADD:
 481         return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
 482     case EXPR_ASSIGNSUB:
 483         return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
 484     case EXPR_ASSIGNMUL:
 485         return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
 486     case EXPR_BITNEG:
 487         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
 488     case EXPR_BOR:
 489         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
 490     case EXPR_COMMA:
 491         return compile_comma_expression(ctx, (binary_expression_t*)expr);
 492     case EXPR_COND:
 493         return compile_conditional_expression(ctx, (conditional_expression_t*)expr);
 494     case EXPR_DELETE:
 495         return compile_delete_expression(ctx, (unary_expression_t*)expr);
 496     case EXPR_DIV:
 497         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
 498     case EXPR_EQ:
 499         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
 500     case EXPR_EQEQ:
 501         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
 502     case EXPR_GREATER:
 503         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
 504     case EXPR_GREATEREQ:
 505         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
 506     case EXPR_IDENT:
 507         return push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
 508     case EXPR_IN:
 509         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
 510     case EXPR_LESS:
 511         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
 512     case EXPR_LESSEQ:
 513         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
 514     case EXPR_LITERAL:
 515         return compile_literal(ctx, ((literal_expression_t*)expr)->literal);
 516     case EXPR_LOGNEG:
 517         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
 518     case EXPR_MINUS:
 519         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
 520     case EXPR_MOD:
 521         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
 522     case EXPR_MUL:
 523         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
 524     case EXPR_NEW:
 525         return compile_new_expression(ctx, (call_expression_t*)expr);
 526     case EXPR_NOTEQ:
 527         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
 528     case EXPR_NOTEQEQ:
 529         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
 530     case EXPR_OR:
 531         return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_nz);
 532     case EXPR_PLUS:
 533         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
 534     case EXPR_SUB:
 535         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
 536     case EXPR_THIS:
 537         return push_instr(ctx, OP_this) == -1 ? E_OUTOFMEMORY : S_OK;
 538     case EXPR_VOID:
 539         return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
 540     case EXPR_BXOR:
 541         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
 542     default:
 543         assert(expr->eval != compiled_expression_eval);
 544         return compile_interp_fallback(ctx, expr);
 545     }
 546
 547     return S_OK;
 548 }
 549
 550 void release_bytecode(bytecode_t *code)
 551 {
 552     unsigned i;
 553
 554     for(i=0; i < code->bstr_cnt; i++)
 555         SysFreeString(code->bstr_pool[i]);
 556
 557     jsheap_free(&code->heap);
 558     heap_free(code->bstr_pool);
 559     heap_free(code->instrs);
 560     heap_free(code);
 561 }
 562
 563 void release_compiler(compiler_ctx_t *ctx)
 564 {
 565     heap_free(ctx);
 566 }
 567
 568 HRESULT compile_subscript(parser_ctx_t *parser, expression_t *expr, unsigned *ret_off)
 569 {
 570     HRESULT hres;
 571
 572     if(!parser->code) {
 573         parser->code = heap_alloc_zero(sizeof(bytecode_t));
 574         if(!parser->code)
 575             return E_OUTOFMEMORY;
 576         jsheap_init(&parser->code->heap);
 577     }
 578
 579     if(!parser->compiler) {
 580         parser->compiler = heap_alloc_zero(sizeof(compiler_ctx_t));
 581         if(!parser->compiler)
 582             return E_OUTOFMEMORY;
 583
 584         parser->compiler->parser = parser;
 585         parser->compiler->code = parser->code;
 586     }
 587
 588     *ret_off = parser->compiler->code_off;
 589     hres = compile_expression(parser->compiler, expr);
 590     if(FAILED(hres))
 591         return hres;
 592
 593     return push_instr(parser->compiler, OP_ret) == -1 ? E_OUTOFMEMORY : S_OK;
 594 }