2 * Copyright 2011 Jacek Caban for CodeWeavers
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
25 #include "wine/debug.h"
27 WINE_DEFAULT_DEBUG_CHANNEL(jscript);
29 struct _compiler_ctx_t {
37 static HRESULT compile_expression(compiler_ctx_t*,expression_t*);
39 static inline void *compiler_alloc(bytecode_t *code, size_t size)
41 return jsheap_alloc(&code->heap, size);
44 static WCHAR *compiler_alloc_string(bytecode_t *code, const WCHAR *str)
49 size = (strlenW(str)+1)*sizeof(WCHAR);
50 ret = compiler_alloc(code, size);
52 memcpy(ret, str, size);
56 static BSTR compiler_alloc_bstr(compiler_ctx_t *ctx, const WCHAR *str)
58 if(!ctx->code->bstr_pool_size) {
59 ctx->code->bstr_pool = heap_alloc(8 * sizeof(BSTR));
60 if(!ctx->code->bstr_pool)
62 ctx->code->bstr_pool_size = 8;
63 }else if(ctx->code->bstr_pool_size == ctx->code->bstr_cnt) {
66 new_pool = heap_realloc(ctx->code->bstr_pool, ctx->code->bstr_pool_size*2*sizeof(BSTR));
70 ctx->code->bstr_pool = new_pool;
71 ctx->code->bstr_pool_size *= 2;
74 ctx->code->bstr_pool[ctx->code->bstr_cnt] = SysAllocString(str);
75 if(!ctx->code->bstr_pool[ctx->code->bstr_cnt])
78 return ctx->code->bstr_pool[ctx->code->bstr_cnt++];
81 static unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
83 assert(ctx->code_size >= ctx->code_off);
86 ctx->code->instrs = heap_alloc(64 * sizeof(instr_t));
87 if(!ctx->code->instrs)
90 }else if(ctx->code_size == ctx->code_off) {
93 new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
97 ctx->code->instrs = new_instrs;
101 ctx->code->instrs[ctx->code_off].op = op;
102 return ctx->code_off++;
105 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
107 assert(off < ctx->code_off);
108 return ctx->code->instrs + off;
111 static HRESULT push_instr_int(compiler_ctx_t *ctx, jsop_t op, LONG arg)
115 instr = push_instr(ctx, op);
117 return E_OUTOFMEMORY;
119 instr_ptr(ctx, instr)->arg1.lng = arg;
123 static HRESULT push_instr_str(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
128 str = compiler_alloc_string(ctx->code, arg);
130 return E_OUTOFMEMORY;
132 instr = push_instr(ctx, op);
134 return E_OUTOFMEMORY;
136 instr_ptr(ctx, instr)->arg1.str = str;
140 static HRESULT push_instr_bstr(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg)
145 str = compiler_alloc_bstr(ctx, arg);
147 return E_OUTOFMEMORY;
149 instr = push_instr(ctx, op);
151 return E_OUTOFMEMORY;
153 instr_ptr(ctx, instr)->arg1.bstr = str;
157 static HRESULT push_instr_bstr_uint(compiler_ctx_t *ctx, jsop_t op, const WCHAR *arg1, unsigned arg2)
162 str = compiler_alloc_bstr(ctx, arg1);
164 return E_OUTOFMEMORY;
166 instr = push_instr(ctx, op);
168 return E_OUTOFMEMORY;
170 instr_ptr(ctx, instr)->arg1.bstr = str;
171 instr_ptr(ctx, instr)->arg2.uint = arg2;
175 static HRESULT push_instr_double(compiler_ctx_t *ctx, jsop_t op, double arg)
180 dbl = compiler_alloc(ctx->code, sizeof(arg));
182 return E_OUTOFMEMORY;
185 instr = push_instr(ctx, op);
187 return E_OUTOFMEMORY;
189 instr_ptr(ctx, instr)->arg1.dbl = dbl;
193 static HRESULT push_instr_uint(compiler_ctx_t *ctx, jsop_t op, unsigned arg)
197 instr = push_instr(ctx, op);
199 return E_OUTOFMEMORY;
201 instr_ptr(ctx, instr)->arg1.uint = arg;
205 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
209 hres = compile_expression(ctx, expr->expression1);
213 hres = compile_expression(ctx, expr->expression2);
217 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
220 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
224 hres = compile_expression(ctx, expr->expression);
228 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
231 /* ECMA-262 3rd Edition 11.2.1 */
232 static HRESULT compile_member_expression(compiler_ctx_t *ctx, member_expression_t *expr)
236 hres = compile_expression(ctx, expr->expression);
240 return push_instr_bstr(ctx, OP_member, expr->identifier);
243 static inline BOOL is_memberid_expr(expression_type_t type)
245 return type == EXPR_IDENT || type == EXPR_MEMBER || type == EXPR_ARRAY;
248 static HRESULT compile_memberid_expression(compiler_ctx_t *ctx, expression_t *expr, unsigned flags)
254 identifier_expression_t *ident_expr = (identifier_expression_t*)expr;
256 hres = push_instr_bstr_uint(ctx, OP_identid, ident_expr->identifier, flags);
260 binary_expression_t *array_expr = (binary_expression_t*)expr;
262 hres = compile_expression(ctx, array_expr->expression1);
266 hres = compile_expression(ctx, array_expr->expression2);
270 hres = push_instr_uint(ctx, OP_memberid, flags);
274 member_expression_t *member_expr = (member_expression_t*)expr;
276 hres = compile_expression(ctx, member_expr->expression);
280 /* FIXME: Potential optimization */
281 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
285 hres = push_instr_uint(ctx, OP_memberid, flags);
295 static HRESULT compile_increment_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op, int n)
299 if(!is_memberid_expr(expr->expression->type)) {
300 hres = compile_expression(ctx, expr->expression);
304 return push_instr_uint(ctx, OP_throw, JS_E_ILLEGAL_ASSIGN);
307 hres = compile_memberid_expression(ctx, expr->expression, fdexNameEnsure);
311 return push_instr_int(ctx, op, n);
314 /* ECMA-262 3rd Edition 11.14 */
315 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr)
319 hres = compile_expression(ctx, expr->expression1);
323 if(push_instr(ctx, OP_pop) == -1)
324 return E_OUTOFMEMORY;
326 return compile_expression(ctx, expr->expression2);
329 /* ECMA-262 3rd Edition 11.11 */
330 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
335 hres = compile_expression(ctx, expr->expression1);
339 instr = push_instr(ctx, op);
341 return E_OUTOFMEMORY;
343 hres = compile_expression(ctx, expr->expression2);
347 instr_ptr(ctx, instr)->arg1.uint = ctx->code_off;
351 /* ECMA-262 3rd Edition 11.12 */
352 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
354 unsigned jmp_false, jmp_end;
357 hres = compile_expression(ctx, expr->expression);
361 jmp_false = push_instr(ctx, OP_jmp_z);
363 return E_OUTOFMEMORY;
365 hres = compile_expression(ctx, expr->true_expression);
369 jmp_end = push_instr(ctx, OP_jmp);
371 return E_OUTOFMEMORY;
373 instr_ptr(ctx, jmp_false)->arg1.uint = ctx->code_off;
374 if(push_instr(ctx, OP_pop) == -1)
375 return E_OUTOFMEMORY;
377 hres = compile_expression(ctx, expr->false_expression);
381 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->code_off;
385 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
387 unsigned arg_cnt = 0;
391 hres = compile_expression(ctx, expr->expression);
395 for(arg = expr->argument_list; arg; arg = arg->next) {
396 hres = compile_expression(ctx, arg->expr);
402 return push_instr_int(ctx, OP_new, arg_cnt);
405 static HRESULT compile_interp_fallback(compiler_ctx_t *ctx, expression_t *expr)
409 instr = push_instr(ctx, OP_tree);
411 return E_OUTOFMEMORY;
413 instr_ptr(ctx, instr)->arg1.expr = expr;
417 static HRESULT compile_call_expression(compiler_ctx_t *ctx, call_expression_t *expr, BOOL *no_ret)
419 unsigned arg_cnt = 0;
425 if(is_memberid_expr(expr->expression->type)) {
427 hres = compile_memberid_expression(ctx, expr->expression, 0);
430 hres = compile_expression(ctx, expr->expression);
436 for(arg = expr->argument_list; arg; arg = arg->next) {
437 hres = compile_expression(ctx, arg->expr);
443 instr = push_instr(ctx, op);
445 return E_OUTOFMEMORY;
447 instr_ptr(ctx, instr)->arg1.uint = arg_cnt;
448 instr_ptr(ctx, instr)->arg2.lng = no_ret == NULL;
454 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
458 switch(expr->expression->type) {
460 binary_expression_t *array_expr = (binary_expression_t*)expr->expression;
462 hres = compile_expression(ctx, array_expr->expression1);
466 hres = compile_expression(ctx, array_expr->expression2);
470 if(push_instr(ctx, OP_delete) == -1)
471 return E_OUTOFMEMORY;
475 member_expression_t *member_expr = (member_expression_t*)expr->expression;
477 hres = compile_expression(ctx, member_expr->expression);
481 /* FIXME: Potential optimization */
482 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
486 if(push_instr(ctx, OP_delete) == -1)
487 return E_OUTOFMEMORY;
491 expr->expr.eval = delete_expression_eval;
492 return compile_interp_fallback(ctx, &expr->expr);
498 static HRESULT compile_assign_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
502 if(!is_memberid_expr(expr->expression1->type)) {
503 hres = compile_expression(ctx, expr->expression1);
507 hres = compile_expression(ctx, expr->expression2);
511 if(op != OP_LAST && push_instr(ctx, op) == -1)
512 return E_OUTOFMEMORY;
514 return push_instr_uint(ctx, OP_throw, JS_E_ILLEGAL_ASSIGN);
517 hres = compile_memberid_expression(ctx, expr->expression1, fdexNameEnsure);
521 if(op != OP_LAST && push_instr(ctx, OP_refval) == -1)
522 return E_OUTOFMEMORY;
524 hres = compile_expression(ctx, expr->expression2);
528 if(op != OP_LAST && push_instr(ctx, op) == -1)
529 return E_OUTOFMEMORY;
531 if(push_instr(ctx, OP_assign) == -1)
532 return E_OUTOFMEMORY;
537 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
539 switch(literal->type) {
541 return push_instr_int(ctx, OP_bool, literal->u.bval);
543 return push_instr_double(ctx, OP_double, literal->u.dval);
545 return push_instr_int(ctx, OP_int, literal->u.lval);
547 return push_instr(ctx, OP_null);
549 return push_instr_str(ctx, OP_str, literal->u.wstr);
554 str = compiler_alloc(ctx->code, (literal->u.regexp.str_len+1)*sizeof(WCHAR));
556 return E_OUTOFMEMORY;
557 memcpy(str, literal->u.regexp.str, literal->u.regexp.str_len*sizeof(WCHAR));
558 str[literal->u.regexp.str_len] = 0;
560 instr = push_instr(ctx, OP_regexp);
562 return E_OUTOFMEMORY;
564 instr_ptr(ctx, instr)->arg1.str = str;
565 instr_ptr(ctx, instr)->arg2.lng = literal->u.regexp.flags;
573 static HRESULT compile_expression_noret(compiler_ctx_t *ctx, expression_t *expr, BOOL *no_ret)
577 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
579 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_z);
581 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_array);
583 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_LAST);
585 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_add);
587 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_sub);
589 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mul);
591 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_div);
593 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_mod);
595 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_or);
597 return compile_assign_expression(ctx, (binary_expression_t*)expr, OP_xor);
599 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
601 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
603 return compile_call_expression(ctx, (call_expression_t*)expr, no_ret);
605 return compile_comma_expression(ctx, (binary_expression_t*)expr);
607 return compile_conditional_expression(ctx, (conditional_expression_t*)expr);
609 return compile_delete_expression(ctx, (unary_expression_t*)expr);
611 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
613 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
615 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
617 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gt);
619 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_gteq);
621 return push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
623 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
625 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
627 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lteq);
629 return compile_literal(ctx, ((literal_expression_t*)expr)->literal);
631 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
633 return compile_member_expression(ctx, (member_expression_t*)expr);
635 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
637 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
639 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
641 return compile_new_expression(ctx, (call_expression_t*)expr);
643 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
645 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
647 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_nz);
649 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
651 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, -1);
653 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_postinc, 1);
655 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, -1);
657 return compile_increment_expression(ctx, (unary_expression_t*)expr, OP_preinc, 1);
659 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
661 return push_instr(ctx, OP_this) == -1 ? E_OUTOFMEMORY : S_OK;
663 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
665 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
667 assert(expr->eval != compiled_expression_eval);
668 return compile_interp_fallback(ctx, expr);
674 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr)
676 return compile_expression_noret(ctx, expr, NULL);
679 void release_bytecode(bytecode_t *code)
683 for(i=0; i < code->bstr_cnt; i++)
684 SysFreeString(code->bstr_pool[i]);
686 jsheap_free(&code->heap);
687 heap_free(code->bstr_pool);
688 heap_free(code->instrs);
692 void release_compiler(compiler_ctx_t *ctx)
697 HRESULT compile_subscript(parser_ctx_t *parser, expression_t *expr, BOOL do_ret, unsigned *ret_off)
703 parser->code = heap_alloc_zero(sizeof(bytecode_t));
705 return E_OUTOFMEMORY;
706 jsheap_init(&parser->code->heap);
709 if(!parser->compiler) {
710 parser->compiler = heap_alloc_zero(sizeof(compiler_ctx_t));
711 if(!parser->compiler)
712 return E_OUTOFMEMORY;
714 parser->compiler->parser = parser;
715 parser->compiler->code = parser->code;
718 *ret_off = parser->compiler->code_off;
719 hres = compile_expression_noret(parser->compiler, expr, do_ret ? NULL : &no_ret);
723 return push_instr(parser->compiler, OP_ret) == -1 ? E_OUTOFMEMORY : S_OK;