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 unsigned push_instr(compiler_ctx_t *ctx, jsop_t op)
  40 {
  41     assert(ctx->code_size >= ctx->code_off);
  42
  43     if(!ctx->code_size) {
  44         ctx->code->instrs = heap_alloc(64 * sizeof(instr_t));
  45         if(!ctx->code->instrs)
  46             return -1;
  47         ctx->code_size = 64;
  48     }else if(ctx->code_size == ctx->code_off) {
  49         instr_t *new_instrs;
  50
  51         new_instrs = heap_realloc(ctx->code->instrs, ctx->code_size*2*sizeof(instr_t));
  52         if(!new_instrs)
  53             return -1;
  54
  55         ctx->code->instrs = new_instrs;
  56         ctx->code_size *= 2;
  57     }
  58
  59     ctx->code->instrs[ctx->code_off].op = op;
  60     return ctx->code_off++;
  61 }
  62
  63 static inline instr_t *instr_ptr(compiler_ctx_t *ctx, unsigned off)
  64 {
  65     assert(off < ctx->code_off);
  66     return ctx->code->instrs + off;
  67 }
  68
  69 static HRESULT compile_binary_expression(compiler_ctx_t *ctx, binary_expression_t *expr, jsop_t op)
  70 {
  71     HRESULT hres;
  72
  73     hres = compile_expression(ctx, expr->expression1);
  74     if(FAILED(hres))
  75         return hres;
  76
  77     hres = compile_expression(ctx, expr->expression2);
  78     if(FAILED(hres))
  79         return hres;
  80
  81     return push_instr(ctx, op) == -1 ? E_OUTOFMEMORY : S_OK;
  82 }
  83
  84 static HRESULT compile_interp_fallback(compiler_ctx_t *ctx, expression_t *expr)
  85 {
  86     unsigned instr;
  87
  88     instr = push_instr(ctx, OP_tree);
  89     if(instr == -1)
  90         return E_OUTOFMEMORY;
  91
  92     instr_ptr(ctx, instr)->arg1.expr = expr;
  93     return S_OK;
  94 }
  95
  96 static HRESULT compile_expression(compiler_ctx_t *ctx, expression_t *expr)
  97 {
  98     switch(expr->type) {
  99     case EXPR_EQEQ:
 100         return compile_binary_expression(ctx, (binary_expression_t*)expr, OP_eq2);
 101     default:
 102         return compile_interp_fallback(ctx, expr);
 103     }
 104
 105     return S_OK;
 106 }
 107
 108 void release_bytecode(bytecode_t *code)
 109 {
 110     heap_free(code->instrs);
 111     heap_free(code);
 112 }
 113
 114 void release_compiler(compiler_ctx_t *ctx)
 115 {
 116     heap_free(ctx);
 117 }
 118
 119 HRESULT compile_subscript(parser_ctx_t *parser, expression_t *expr, unsigned *ret_off)
 120 {
 121     HRESULT hres;
 122
 123     if(!parser->code) {
 124         parser->code = heap_alloc_zero(sizeof(bytecode_t));
 125         if(!parser->code)
 126             return E_OUTOFMEMORY;
 127     }
 128
 129     if(!parser->compiler) {
 130         parser->compiler = heap_alloc_zero(sizeof(compiler_ctx_t));
 131         if(!parser->compiler)
 132             return E_OUTOFMEMORY;
 133
 134         parser->compiler->parser = parser;
 135         parser->compiler->code = parser->code;
 136     }
 137
 138     *ret_off = parser->compiler->code_off;
 139     hres = compile_expression(parser->compiler, expr);
 140     if(FAILED(hres))
 141         return hres;
 142
 143     return push_instr(parser->compiler, OP_ret) == -1 ? E_OUTOFMEMORY : S_OK;
 144 }