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_double(compiler_ctx_t *ctx, jsop_t op, double arg)
162 dbl = compiler_alloc(ctx->code, sizeof(arg));
164 return E_OUTOFMEMORY;
167 instr = push_instr(ctx, op);
169 return E_OUTOFMEMORY;
171 instr_ptr(ctx, instr)->arg1.dbl = dbl;
175 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
179 hres = compile_expression(ctx, expr->expression1);
183 hres = compile_expression(ctx, expr->expression2);
187 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
190 static HRESULT compile_unary_expression(compiler_ctx_t *ctx, unary_expression_t *expr, jsop_t op)
194 hres = compile_expression(ctx, expr->expression);
198 return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
201 /* ECMA-262 3rd Edition 11.14 */
202 static HRESULT compile_comma_expression(compiler_ctx_t *ctx, binary_expression_t *expr)
206 hres = compile_expression(ctx, expr->expression1);
210 if(push_instr(ctx, OP_pop) == -1)
211 return E_OUTOFMEMORY;
213 return compile_expression(ctx, expr->expression2);
216 /* ECMA-262 3rd Edition 11.11 */
217 static HRESULT compile_logical_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
222 hres = compile_expression(ctx, expr->expression1);
226 instr = push_instr(ctx, op);
228 return E_OUTOFMEMORY;
230 hres = compile_expression(ctx, expr->expression2);
234 instr_ptr(ctx, instr)->arg1.uint = ctx->code_off;
238 /* ECMA-262 3rd Edition 11.12 */
239 static HRESULT compile_conditional_expression(compiler_ctx_t *ctx, conditional_expression_t *expr)
241 unsigned jmp_false, jmp_end;
244 hres = compile_expression(ctx, expr->expression);
248 jmp_false = push_instr(ctx, OP_jmp_z);
250 return E_OUTOFMEMORY;
252 hres = compile_expression(ctx, expr->true_expression);
256 jmp_end = push_instr(ctx, OP_jmp);
258 return E_OUTOFMEMORY;
260 instr_ptr(ctx, jmp_false)->arg1.uint = ctx->code_off;
261 if(push_instr(ctx, OP_pop) == -1)
262 return E_OUTOFMEMORY;
264 hres = compile_expression(ctx, expr->false_expression);
268 instr_ptr(ctx, jmp_end)->arg1.uint = ctx->code_off;
272 static HRESULT compile_new_expression(compiler_ctx_t *ctx, call_expression_t *expr)
274 unsigned arg_cnt = 0;
278 hres = compile_expression(ctx, expr->expression);
282 for(arg = expr->argument_list; arg; arg = arg->next) {
283 hres = compile_expression(ctx, arg->expr);
289 return push_instr_int(ctx, OP_new, arg_cnt);
292 static HRESULT compile_interp_fallback(compiler_ctx_t *ctx, expression_t *expr)
296 instr = push_instr(ctx, OP_tree);
298 return E_OUTOFMEMORY;
300 instr_ptr(ctx, instr)->arg1.expr = expr;
304 static HRESULT compile_delete_expression(compiler_ctx_t *ctx, unary_expression_t *expr)
308 switch(expr->expression->type) {
310 array_expression_t *array_expr = (array_expression_t*)expr->expression;
312 hres = compile_expression(ctx, array_expr->member_expr);
316 hres = compile_expression(ctx, array_expr->expression);
320 if(push_instr(ctx, OP_delete) == -1)
321 return E_OUTOFMEMORY;
325 member_expression_t *member_expr = (member_expression_t*)expr->expression;
327 hres = compile_expression(ctx, member_expr->expression);
331 /* FIXME: Potential optimization */
332 hres = push_instr_str(ctx, OP_str, member_expr->identifier);
336 if(push_instr(ctx, OP_delete) == -1)
337 return E_OUTOFMEMORY;
341 expr->expr.eval = delete_expression_eval;
342 return compile_interp_fallback(ctx, &expr->expr);
348 static HRESULT compile_literal(compiler_ctx_t *ctx, literal_t *literal)
350 switch(literal->type) {
352 return push_instr_int(ctx, OP_bool, literal->u.bval);
354 return push_instr_double(ctx, OP_double, literal->u.dval);
356 return push_instr_int(ctx, OP_int, literal->u.lval);
358 return push_instr(ctx, OP_null);
360 return push_instr_str(ctx, OP_str, literal->u.wstr);
365 str = compiler_alloc(ctx->code, (literal->u.regexp.str_len+1)*sizeof(WCHAR));
367 return E_OUTOFMEMORY;
368 memcpy(str, literal->u.regexp.str, literal->u.regexp.str_len*sizeof(WCHAR));
369 str[literal->u.regexp.str_len] = 0;
371 instr = push_instr(ctx, OP_regexp);
373 return E_OUTOFMEMORY;
375 instr_ptr(ctx, instr)->arg1.str = str;
376 instr_ptr(ctx, instr)->arg2.lng = literal->u.regexp.flags;
384 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr)
388 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_z);
390 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_add);
392 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_bneg);
394 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_or);
396 return compile_comma_expression(ctx, (binary_expression_t*)expr);
398 return compile_conditional_expression(ctx, (conditional_expression_t*)expr);
400 return compile_delete_expression(ctx, (unary_expression_t*)expr);
402 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_div);
404 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq);
406 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
408 return push_instr_bstr(ctx, OP_ident, ((identifier_expression_t*)expr)->identifier);
410 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_in);
412 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_lt);
414 return compile_literal(ctx, ((literal_expression_t*)expr)->literal);
416 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_neg);
418 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_minus);
420 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mod);
422 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_mul);
424 return compile_new_expression(ctx, (call_expression_t*)expr);
426 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq);
428 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_neq2);
430 return compile_logical_expression(ctx, (binary_expression_t*)expr, OP_jmp_nz);
432 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_tonum);
434 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_sub);
436 return push_instr(ctx, OP_this) == -1 ? E_OUTOFMEMORY : S_OK;
438 return compile_unary_expression(ctx, (unary_expression_t*)expr, OP_void);
440 return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_xor);
442 assert(expr->eval != compiled_expression_eval);
443 return compile_interp_fallback(ctx, expr);
449 void release_bytecode(bytecode_t *code)
453 for(i=0; i < code->bstr_cnt; i++)
454 SysFreeString(code->bstr_pool[i]);
456 jsheap_free(&code->heap);
457 heap_free(code->bstr_pool);
458 heap_free(code->instrs);
462 void release_compiler(compiler_ctx_t *ctx)
467 HRESULT compile_subscript(parser_ctx_t *parser, expression_t *expr, unsigned *ret_off)
472 parser->code = heap_alloc_zero(sizeof(bytecode_t));
474 return E_OUTOFMEMORY;
475 jsheap_init(&parser->code->heap);
478 if(!parser->compiler) {
479 parser->compiler = heap_alloc_zero(sizeof(compiler_ctx_t));
480 if(!parser->compiler)
481 return E_OUTOFMEMORY;
483 parser->compiler->parser = parser;
484 parser->compiler->code = parser->code;
487 *ret_off = parser->compiler->code_off;
488 hres = compile_expression(parser->compiler, expr);
492 return push_instr(parser->compiler, OP_ret) == -1 ? E_OUTOFMEMORY : S_OK;