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
23 #include "wine/debug.h"
25 WINE_DEFAULT_DEBUG_CHANNEL(vbscript);
39 typedef HRESULT (*instr_func_t)(exec_ctx_t*);
62 static HRESULT lookup_identifier(exec_ctx_t *ctx, BSTR name, ref_t *ref)
68 LIST_FOR_EACH_ENTRY(item, &ctx->script->named_items, named_item_t, entry) {
69 if(item->flags & SCRIPTITEM_GLOBALMEMBERS) {
70 hres = disp_get_id(item->disp, name, &id);
73 ref->u.d.disp = item->disp;
80 if(!ctx->func->code_ctx->option_explicit)
81 FIXME("create an attempt to set\n");
87 static inline VARIANT *stack_pop(exec_ctx_t *ctx)
90 return ctx->stack + --ctx->top;
93 static HRESULT stack_push(exec_ctx_t *ctx, VARIANT *v)
95 if(ctx->stack_size == ctx->top) {
98 new_stack = heap_realloc(ctx->stack, ctx->stack_size*2);
101 return E_OUTOFMEMORY;
104 ctx->stack = new_stack;
105 ctx->stack_size *= 2;
108 ctx->stack[ctx->top++] = *v;
112 static void stack_popn(exec_ctx_t *ctx, unsigned n)
115 VariantClear(stack_pop(ctx));
118 static HRESULT stack_pop_val(exec_ctx_t *ctx, variant_val_t *v)
122 var = stack_pop(ctx);
124 if(V_VT(var) == (VT_BYREF|VT_VARIANT)) {
126 var = V_VARIANTREF(var);
131 if(V_VT(var) == VT_DISPATCH) {
132 FIXME("got dispatch - get its default value\n");
141 static inline void release_val(variant_val_t *v)
147 static void vbstack_to_dp(exec_ctx_t *ctx, unsigned arg_cnt, DISPPARAMS *dp)
150 dp->rgdispidNamedArgs = NULL;
157 assert(ctx->top >= arg_cnt);
159 for(i=1; i*2 <= arg_cnt; i++) {
160 tmp = ctx->stack[ctx->top-i];
161 ctx->stack[ctx->top-i] = ctx->stack[ctx->top-arg_cnt+i-1];
162 ctx->stack[ctx->top-arg_cnt+i-1] = tmp;
165 dp->rgvarg = ctx->stack + ctx->top-arg_cnt;
171 static HRESULT do_icall(exec_ctx_t *ctx, VARIANT *res)
173 BSTR identifier = ctx->instr->arg1.bstr;
174 const unsigned arg_cnt = ctx->instr->arg2.uint;
179 hres = lookup_identifier(ctx, identifier, &ref);
183 vbstack_to_dp(ctx, arg_cnt, &dp);
187 hres = disp_call(ctx->script, ref.u.d.disp, ref.u.d.id, &dp, res);
192 FIXME("%s not found\n", debugstr_w(identifier));
193 return DISP_E_UNKNOWNNAME;
196 stack_popn(ctx, arg_cnt);
200 static HRESULT interp_icall(exec_ctx_t *ctx)
207 hres = do_icall(ctx, &v);
211 return stack_push(ctx, &v);
214 static HRESULT interp_icallv(exec_ctx_t *ctx)
217 return do_icall(ctx, NULL);
220 static HRESULT assign_ident(exec_ctx_t *ctx, BSTR name, VARIANT *val, BOOL own_val)
225 hres = lookup_identifier(ctx, name, &ref);
231 hres = disp_propput(ctx->script, ref.u.d.disp, ref.u.d.id, val);
236 FIXME("%s not found\n", debugstr_w(name));
239 return DISP_E_UNKNOWNNAME;
245 static HRESULT interp_assign_ident(exec_ctx_t *ctx)
247 const BSTR arg = ctx->instr->arg1.bstr;
251 TRACE("%s\n", debugstr_w(arg));
253 hres = stack_pop_val(ctx, &v);
257 return assign_ident(ctx, arg, v.v, v.owned);
260 static HRESULT interp_ret(exec_ctx_t *ctx)
268 static HRESULT interp_bool(exec_ctx_t *ctx)
270 const VARIANT_BOOL arg = ctx->instr->arg1.lng;
273 TRACE("%s\n", arg ? "true" : "false");
277 return stack_push(ctx, &v);
280 static HRESULT interp_string(exec_ctx_t *ctx)
287 V_BSTR(&v) = SysAllocString(ctx->instr->arg1.str);
289 return E_OUTOFMEMORY;
291 return stack_push(ctx, &v);
294 static HRESULT interp_long(exec_ctx_t *ctx)
296 const LONG arg = ctx->instr->arg1.lng;
303 return stack_push(ctx, &v);
306 static HRESULT interp_short(exec_ctx_t *ctx)
308 const LONG arg = ctx->instr->arg1.lng;
315 return stack_push(ctx, &v);
318 static HRESULT interp_double(exec_ctx_t *ctx)
320 const DOUBLE *arg = ctx->instr->arg1.dbl;
323 TRACE("%lf\n", *arg);
327 return stack_push(ctx, &v);
330 static HRESULT interp_empty(exec_ctx_t *ctx)
337 return stack_push(ctx, &v);
340 static HRESULT interp_null(exec_ctx_t *ctx)
347 return stack_push(ctx, &v);
350 static HRESULT interp_not(exec_ctx_t *ctx)
358 hres = stack_pop_val(ctx, &val);
362 hres = VarNot(val.v, &v);
367 return stack_push(ctx, &v);
370 static HRESULT cmp_oper(exec_ctx_t *ctx)
375 hres = stack_pop_val(ctx, &r);
379 hres = stack_pop_val(ctx, &l);
380 if(SUCCEEDED(hres)) {
381 if(V_VT(l.v) == VT_NULL || V_VT(r.v) == VT_NULL) {
382 FIXME("comparing nulls is not implemented\n");
385 hres = VarCmp(l.v, r.v, ctx->script->lcid, 0);
394 static HRESULT interp_equal(exec_ctx_t *ctx)
401 hres = cmp_oper(ctx);
406 V_BOOL(&v) = hres == VARCMP_EQ ? VARIANT_TRUE : VARIANT_FALSE;
407 return stack_push(ctx, &v);
410 static HRESULT interp_nequal(exec_ctx_t *ctx)
417 hres = cmp_oper(ctx);
422 V_BOOL(&v) = hres != VARCMP_EQ ? VARIANT_TRUE : VARIANT_FALSE;
423 return stack_push(ctx, &v);
426 static HRESULT interp_concat(exec_ctx_t *ctx)
434 hres = stack_pop_val(ctx, &r);
438 hres = stack_pop_val(ctx, &l);
439 if(SUCCEEDED(hres)) {
440 hres = VarCat(l.v, r.v, &v);
447 return stack_push(ctx, &v);
450 static HRESULT interp_add(exec_ctx_t *ctx)
458 hres = stack_pop_val(ctx, &r);
462 hres = stack_pop_val(ctx, &l);
463 if(SUCCEEDED(hres)) {
464 hres = VarAdd(l.v, r.v, &v);
471 return stack_push(ctx, &v);
474 static HRESULT interp_sub(exec_ctx_t *ctx)
482 hres = stack_pop_val(ctx, &r);
486 hres = stack_pop_val(ctx, &l);
487 if(SUCCEEDED(hres)) {
488 hres = VarSub(l.v, r.v, &v);
495 return stack_push(ctx, &v);
498 static HRESULT interp_neg(exec_ctx_t *ctx)
504 hres = stack_pop_val(ctx, &val);
508 hres = VarNeg(val.v, &v);
513 return stack_push(ctx, &v);
516 static const instr_func_t op_funcs[] = {
517 #define X(x,n,a,b) interp_ ## x,
522 static const unsigned op_move[] = {
523 #define X(x,n,a,b) n,
528 HRESULT exec_script(script_ctx_t *ctx, function_t *func)
534 exec.stack_size = 16;
536 exec.stack = heap_alloc(exec.stack_size * sizeof(VARIANT));
538 return E_OUTOFMEMORY;
540 exec.code = func->code_ctx;
541 exec.instr = exec.code->instrs + func->code_off;
547 hres = op_funcs[op](&exec);
549 FIXME("Failed %08x\n", hres);
550 stack_popn(&exec, exec.top);
554 exec.instr += op_move[op];
558 heap_free(exec.stack);