|
public static dec ( |
||
| ptr | ||
| return | ||
private static void callhook (lua_State L, CallInfo ci) {
int hook = LUA_HOOKCALL;
InstructionPtr.inc(ref ci.u.l.savedpc); /* hooks assume 'pc' is already incremented */
if (isLua(ci.previous) != 0 &&
GET_OPCODE(ci.previous.u.l.savedpc[- 1]) == OpCode.OP_TAILCALL) {
ci.callstatus |= CIST_TAIL;
hook = LUA_HOOKTAILCALL;
}
luaD_hook(L, hook, -1);
InstructionPtr.dec(ref ci.u.l.savedpc); /* correct 'pc' */
}
public static void luaG_traceexec(lua_State L)
{
CallInfo ci = L.ci;
lu_byte mask = L.hookmask;
int counthook = (--L.hookcount == 0 && (mask & LUA_MASKCOUNT) != 0)?1:0;
if (counthook != 0)
{
resethookcount(L); /* reset count */
}
else if (0 == (mask & LUA_MASKLINE))
{
return; /* no line hook and count != 0; nothing to be done */
}
if ((ci.callstatus & CIST_HOOKYIELD) != 0) /* called hook last time? */
{
ci.callstatus &= (byte)((~CIST_HOOKYIELD) & 0xff); /* erase mark */
return; /* do not call hook again (VM yielded, so it did not move) */
}
if (counthook != 0)
{
luaD_hook(L, LUA_HOOKCOUNT, -1); /* call count hook */
}
if ((mask & LUA_MASKLINE) != 0)
{
Proto p = ci_func(ci).p;
int npc = pcRel(ci.u.l.savedpc, p);
int newline = getfuncline(p, npc);
if (npc == 0 || /* call linehook when enter a new function, */
ci.u.l.savedpc <= L.oldpc || /* when jump back (loop), or when */
newline != getfuncline(p, pcRel(L.oldpc, p))) /* enter a new line */
{
luaD_hook(L, LUA_HOOKLINE, newline); /* call line hook */
}
}
L.oldpc = ci.u.l.savedpc;
if (L.status == LUA_YIELD) /* did hook yield? */
{
if (counthook != 0)
{
L.hookcount = 1; /* undo decrement to zero */
}
InstructionPtr.dec(ref ci.u.l.savedpc); /* undo increment (resume will increment it again) */
ci.callstatus |= CIST_HOOKYIELD; /* mark that it yielded */
ci.func = L.top - 1; /* protect stack below results */
luaD_throw(L, LUA_YIELD);
}
}
public static int luaD_precall(lua_State L, StkId func, int nresults)
{
LClosure cl;
ptrdiff_t funcr;
if (!ttisfunction(func)) /* `func' is not a function? */
{
func = tryfuncTM(L, func); /* check the `function' tag method */
}
funcr = savestack(L, func);
cl = clvalue(func).l;
InstructionPtr.Assign(L.savedpc, ref L.ci.savedpc);
if (cl.isC == 0) /* Lua function? prepare its call */
{
CallInfo ci;
StkId st, base_;
Proto p = cl.p;
luaD_checkstack(L, p.maxstacksize);
func = restorestack(L, funcr);
if (p.is_vararg == 0) /* no varargs? */
{
base_ = L.stack[func + 1];
if (L.top > base_ + p.numparams)
{
L.top = base_ + p.numparams;
}
}
else /* vararg function */
{
int nargs = L.top - func - 1;
base_ = adjust_varargs(L, p, nargs);
func = restorestack(L, funcr); /* previous call may change the stack */
}
ci = inc_ci(L); /* now `enter' new function */
ci.func = func;
L.base_ = ci.base_ = base_;
ci.top = L.base_ + p.maxstacksize;
lua_assert(ci.top <= L.stack_last);
L.savedpc = new InstructionPtr(p.code, 0); /* starting point */
ci.tailcalls = 0;
ci.nresults = nresults;
for (st = L.top; st < ci.top; StkId.inc(ref st))
{
setnilvalue(st);
}
L.top = ci.top;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
InstructionPtr.inc(ref L.savedpc); /* hooks assume 'pc' is already incremented */
luaD_callhook(L, LUA_HOOKCALL, -1);
InstructionPtr.dec(ref L.savedpc); /* correct 'pc' */
}
return(PCRLUA);
}
else /* if is a C function, call it */
{
CallInfo ci;
int n;
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
ci = inc_ci(L); /* now `enter' new function */
ci.func = restorestack(L, funcr);
L.base_ = ci.base_ = ci.func + 1;
ci.top = L.top + LUA_MINSTACK;
lua_assert(ci.top <= L.stack_last);
ci.nresults = nresults;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
luaD_callhook(L, LUA_HOOKCALL, -1);
}
lua_unlock(L);
n = curr_func(L).c.f(L); /* do the actual call */
lua_lock(L);
if (n < 0) /* yielding? */
{
return(PCRYIELD);
}
else
{
luaD_poscall(L, L.top - n);
return(PCRC);
}
}
}
public static void luaV_execute(lua_State L)
{
CallInfo ci = L.ci;
LClosure cl = clvalue(ci.func).l;
TValue[] k = cl.p.k;
StkId base_ = ci.u.l.base_;
lua_assert(isLua(ci));
/* main loop of interpreter */
for (;;)
{
Instruction i = ci.u.l.savedpc[0]; InstructionPtr.inc(ref ci.u.l.savedpc); //FIXME:++
StkId ra;
if (((L.hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) != 0) &&
(((--L.hookcount) == 0) || ((L.hookmask & LUA_MASKLINE) != 0)))
{
traceexec(L);
if (L.status == LUA_YIELD) /* did hook yield? */
{
InstructionPtr.dec(ref ci.u.l.savedpc); /* undo increment */
luaD_throw(L, LUA_YIELD);
}
base_ = ci.u.l.base_;
}
/* warning!! several calls may realloc the stack and invalidate `ra' */
ra = RA(L, base_, i);
lua_assert(base_ == ci.u.l.base_);
lua_assert(base_ <= L.top && ((L.top - L.stack) <= L.stacksize));
//Dump(L.ci.u.l.savedpc.pc, i); //FIXME:added, only for debugging
switch (GET_OPCODE(i))
{
case OpCode.OP_MOVE: {
setobjs2s(L, ra, RB(L, base_, i));
continue;
}
case OpCode.OP_LOADK: {
setobj2s(L, ra, KBx(L, i, k));
continue;
}
case OpCode.OP_LOADBOOL: {
setbvalue(ra, GETARG_B(i));
if (GETARG_C(i) != 0)
{
InstructionPtr.inc(ref ci.u.l.savedpc); /* skip next instruction (if C) */
}
continue;
}
case OpCode.OP_LOADNIL: {
TValue rb = RB(L, base_, i);
do
{
setnilvalue(StkId.dec(ref rb));
} while (rb >= ra);
continue;
}
case OpCode.OP_GETUPVAL: {
int b = GETARG_B(i);
setobj2s(L, ra, cl.upvals[b].v);
continue;
}
case OpCode.OP_GETGLOBAL: {
TValue g = new TValue();
TValue rb = KBx(L, i, k);
sethvalue(L, g, cl.env);
lua_assert(ttisstring(rb));
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, g, rb, ra);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_GETTABLE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, RB(L, base_, i), RKC(L, base_, i, k), ra);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:???
continue;
}
case OpCode.OP_SETGLOBAL: {
TValue g = new TValue();
sethvalue(L, g, cl.env);
lua_assert(ttisstring(KBx(L, i, k)));
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_settable(L, g, KBx(L, i, k), ra);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_SETUPVAL: {
UpVal uv = cl.upvals[GETARG_B(i)];
setobj(L, uv.v, ra);
luaC_barrier(L, uv, ra);
continue;
}
case OpCode.OP_SETTABLE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_settable(L, ra, RKB(L, base_, i, k), RKC(L, base_, i, k));
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_NEWTABLE: {
int b = GETARG_B(i);
int c = GETARG_C(i);
Table t = luaH_new(L);
sethvalue(L, ra, t);
if (b != 0 || c != 0)
{
luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));
}
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaC_checkGC(L);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_SELF: {
StkId rb = RB(L, base_, i);
setobjs2s(L, ra + 1, rb);
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, rb, RKC(L, base_, i, k), ra);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_ADD: {
arith_op(L, luai_numadd, TMS.TM_ADD, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_SUB: {
arith_op(L, luai_numsub, TMS.TM_SUB, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_MUL: {
arith_op(L, luai_nummul, TMS.TM_MUL, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_DIV: {
arith_op(L, luai_numdiv, TMS.TM_DIV, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_MOD: {
arith_op(L, luai_nummod, TMS.TM_MOD, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_POW: {
arith_op(L, luai_numpow, TMS.TM_POW, base_, i, k, ra, ci);
continue;
}
case OpCode.OP_UNM: {
TValue rb = RB(L, base_, i);
if (ttisnumber(rb))
{
lua_Number nb = nvalue(rb);
setnvalue(ra, luai_numunm(L, nb));
}
else
{
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_arith(L, ra, rb, rb, TMS.TM_UNM);
base_ = ci.u.l.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:???
}
continue;
}
case OpCode.OP_NOT: {
int res = l_isfalse(RB(L, base_, i)) == 0 ? 0 : 1; /* next assignment may change this value */
setbvalue(ra, res);
continue;
}
case OpCode.OP_LEN: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
objlen(L, ra, RB(L, base_, i));
base_ = ci.u.l.base_; //FIXME:???
//)
continue;
}
case OpCode.OP_CONCAT: {
int b = GETARG_B(i);
int c = GETARG_C(i);
L.top = base_ + c + 1; /* mark the end of concat operands */
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_concat(L, c - b + 1); luaC_checkGC(L);
base_ = ci.u.l.base_;
//);
L.top = ci.top; /* restore top */
setobjs2s(L, RA(L, base_, i), base_ + b);
continue;
}
case OpCode.OP_JMP: {
dojump(GETARG_sBx(i), ci, L);
continue;
}
case OpCode.OP_EQ: {
TValue rb = RKB(L, base_, i, k);
TValue rc = RKC(L, base_, i, k);
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (equalobj(L, rb, rc) == GETARG_A(i))
{
dojump(GETARG_sBx(ci.u.l.savedpc[0]), ci, L);
}
base_ = ci.u.l.base_;
//);
InstructionPtr.inc(ref ci.u.l.savedpc);
continue;
}
case OpCode.OP_LT: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (luaV_lessthan(L, RKB(L, base_, i, k), RKC(L, base_, i, k)) == GETARG_A(i))
{
dojump(GETARG_sBx(ci.u.l.savedpc[0]), ci, L);
}
base_ = ci.u.l.base_;
//);
InstructionPtr.inc(ref ci.u.l.savedpc);
continue;
}
case OpCode.OP_LE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (luaV_lessequal(L, RKB(L, base_, i, k), RKC(L, base_, i, k)) == GETARG_A(i))
{
dojump(GETARG_sBx(ci.u.l.savedpc[0]), ci, L);
}
base_ = ci.u.l.base_;
//);
InstructionPtr.inc(ref ci.u.l.savedpc);
continue;
}
case OpCode.OP_TEST: {
if (GETARG_C(i) != 0 ? l_isfalse(ra) == 0 : l_isfalse(ra) != 0)
{
dojump(GETARG_sBx(ci.u.l.savedpc[0]), ci, L);
}
InstructionPtr.inc(ref ci.u.l.savedpc);
continue;
}
case OpCode.OP_TESTSET: {
TValue rb = RB(L, base_, i);
if (GETARG_C(i) != 0 ? l_isfalse(rb) == 0 : l_isfalse(rb) != 0)
{
setobjs2s(L, ra, rb);
dojump(GETARG_sBx(ci.u.l.savedpc[0]), ci, L);
}
InstructionPtr.inc(ref ci.u.l.savedpc);
continue;
}
case OpCode.OP_CALL: {
int b = GETARG_B(i);
int nresults = GETARG_C(i) - 1;
if (b != 0)
{
L.top = ra + b; /* else previous instruction set top */
}
if (luaD_precall(L, ra, nresults) != 0) /* C function? */
{
if (nresults >= 0)
{
L.top = ci.top; /* adjust results */
}
base_ = ci.u.l.base_;
continue;
}
else /* Lua function */
{
ci = L.ci;
ci.callstatus |= CIST_REENTRY;
break; /* restart luaV_execute over new Lua function */
}
}
case OpCode.OP_TAILCALL: {
int b = GETARG_B(i);
if (b != 0)
{
L.top = ra + b; /* else previous instruction set top */
}
lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
if (luaD_precall(L, ra, LUA_MULTRET) != 0) /* C function? */
{
base_ = ci.u.l.base_;
continue;
}
else
{
/* tail call: put called frame (n) in place of caller one (o) */
CallInfo nci = L.ci; /* called frame */
CallInfo oci = nci.previous; /* caller frame */
StkId nfunc = nci.func; /* called function index */
StkId ofunc = oci.func;
int aux;
if (cl.p.sizep > 0)
{
luaF_close(L, oci.u.l.base_);
}
oci.u.l.base_ = ofunc + (nci.u.l.base_ - nfunc);
for (aux = 0; nfunc + aux < L.top; aux++) /* move frame down */
{
setobjs2s(L, ofunc + aux, nfunc + aux);
}
oci.top = L.top = ofunc + aux; /* correct top */
lua_assert(L.top == oci.u.l.base_ + clvalue(ofunc).l.p.maxstacksize);
oci.u.l.savedpc = nci.u.l.savedpc;
oci.u.l.tailcalls++; /* one more call lost */
ci = L.ci = oci; /* remove new frame */
break; /* restart luaV_execute over new Lua function */
}
}
case OpCode.OP_RETURN: {
int b = GETARG_B(i);
if (b != 0)
{
L.top = ra + b - 1;
}
if (cl.p.sizep > 0)
{
luaF_close(L, base_);
}
b = luaD_poscall(L, ra);
if ((ci.callstatus & CIST_REENTRY) == 0) /* 'ci' still the called one */
{
return; /* external invocation: return */
}
else /* invocation via reentry: continue execution */
{
ci = L.ci;
if (b != 0)
{
L.top = ci.top;
}
lua_assert(isLua(ci));
lua_assert(GET_OPCODE(ci.u.l.savedpc[-1]) == OpCode.OP_CALL);
break; /* restart luaV_execute over new Lua function */
}
}
case OpCode.OP_FORLOOP: {
lua_Number step = nvalue(ra + 2);
lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */
lua_Number limit = nvalue(ra + 1);
if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit)
: luai_numle(L, limit, idx))
{
dojump(GETARG_sBx(i), ci, L); /* jump back */
setnvalue(ra, idx); /* update internal index... */
setnvalue(ra + 3, idx); /* ...and external index */
}
continue;
}
case OpCode.OP_FORPREP: {
TValue init = ra;
TValue plimit = ra + 1;
TValue pstep = ra + 2;
if (tonumber(ref init, ra) == 0)
{
luaG_runerror(L, LUA_QL("for") + " initial value must be a number");
}
else if (tonumber(ref plimit, ra + 1) == 0)
{
luaG_runerror(L, LUA_QL("for") + " limit must be a number");
}
else if (tonumber(ref pstep, ra + 2) == 0)
{
luaG_runerror(L, LUA_QL("for") + " step must be a number");
}
setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));
dojump(GETARG_sBx(i), ci, L);
continue;
}
case OpCode.OP_TFORCALL: {
StkId cb = ra + 3; /* call base */
setobjs2s(L, cb + 2, ra + 2);
setobjs2s(L, cb + 1, ra + 1);
setobjs2s(L, cb, ra);
L.top = cb + 3; /* func. + 2 args (state and index) */
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaD_call(L, cb, GETARG_C(i), 1);
base_ = ci.u.l.base_;
//);
L.top = ci.top;
i = ci.u.l.savedpc[0]; InstructionPtr.inc(ref ci.u.l.savedpc); /* go to next instruction */ //FIXME:++
ra = RA(L, base_, i);
lua_assert(GET_OPCODE(i) == OpCode.OP_TFORLOOP);
/* go through */
goto case OpCode.OP_TFORLOOP; //FIXME:added
}
case OpCode.OP_TFORLOOP: {
if (!ttisnil(ra + 1)) /* continue loop? */
{
setobjs2s(L, ra, ra + 1); /* save control variable */
dojump(GETARG_sBx(i), ci, L); /* jump back */
}
continue;
}
case OpCode.OP_SETLIST: {
int n = GETARG_B(i);
int c = GETARG_C(i);
int last;
Table h;
if (n == 0)
{
n = cast_int(L.top - ra) - 1;
}
if (c == 0)
{
lua_assert(GET_OPCODE(ci.u.l.savedpc[0]) == OpCode.OP_EXTRAARG);
c = GETARG_Ax(ci.u.l.savedpc[0]); InstructionPtr.inc(ref ci.u.l.savedpc); //FIXME:++
}
h = hvalue(ra);
last = ((c - 1) * LFIELDS_PER_FLUSH) + n;
if (last > h.sizearray) /* needs more space? */
{
luaH_resizearray(L, h, last); /* pre-alloc it at once */
}
for (; n > 0; n--)
{
TValue val = ra + n;
setobj2t(L, luaH_setnum(L, h, last--), val);
luaC_barriert(L, h, val);
}
L.top = ci.top; /* correct top (in case of previous open call) */
continue;
}
case OpCode.OP_CLOSE: {
luaF_close(L, ra);
continue;
}
case OpCode.OP_CLOSURE: {
Proto p;
Closure ncl;
int nup, j;
p = cl.p.p[GETARG_Bx(i)];
nup = p.nups;
ncl = luaF_newLclosure(L, nup, cl.env);
ncl.l.p = p;
setclvalue(L, ra, ncl);
for (j = 0; j < nup; j++)
{
Instruction u = ci.u.l.savedpc[0]; InstructionPtr.inc(ref ci.u.l.savedpc);
if (GET_OPCODE(u) == OpCode.OP_GETUPVAL)
{
ncl.l.upvals[j] = cl.upvals[GETARG_B(u)];
}
else
{
lua_assert(GET_OPCODE(u) == OpCode.OP_MOVE);
ncl.l.upvals[j] = luaF_findupval(L, base_ + GETARG_B(u));
}
}
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaC_checkGC(L);
base_ = ci.u.l.base_;
//);
continue;
}
case OpCode.OP_VARARG: {
int b = GETARG_B(i) - 1;
int j;
int n = cast_int(base_ - ci.func) - cl.p.numparams - 1;
if (b == LUA_MULTRET)
{
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaD_checkstack(L, n);
base_ = ci.u.l.base_;
//);
ra = RA(L, base_, i); /* previous call may change the stack */
b = n;
L.top = ra + n;
}
for (j = 0; j < b; j++)
{
if (j < n)
{
setobjs2s(L, ra + j, base_ - n + j);
}
else
{
setnilvalue(ra + j);
}
}
continue;
}
case OpCode.OP_EXTRAARG: {
luaG_runerror(L, "bad opcode");
return;
}
}
/* function changed (call/return): update pointers */
lua_assert(ci == L.ci);
cl = clvalue(ci.func).l;
k = cl.p.k;
base_ = ci.u.l.base_;
}
}
public static int LuaDPreCall(LuaState L, StkId func, int nresults)
{
LClosure cl;
ptrdiff_t funcr;
if (!TTIsFunction(func)) /* `func' is not a function? */
{
func = TryFuncTM(L, func); /* check the `function' tag method */
}
funcr = SaveStack(L, func);
cl = CLValue(func).l;
L.ci.savedpc = InstructionPtr.Assign(L.savedpc);
if (cl.isC == 0) /* Lua function? prepare its call */
{
CallInfo ci;
StkId st, base_;
Proto p = cl.p;
LuaDCheckStack(L, p.maxstacksize);
func = RestoreStack(L, funcr);
if (p.is_vararg == 0) /* no varargs? */
{
base_ = L.stack[func + 1];
if (L.top > base_ + p.numparams)
{
L.top = base_ + p.numparams;
}
}
else /* vararg function */
{
int nargs = L.top - func - 1;
base_ = AdjustVarArgs(L, p, nargs);
func = RestoreStack(L, funcr); /* previous call may change the stack */
}
ci = IncCI(L); /* now `enter' new function */
ci.func = func;
L.base_ = ci.base_ = base_;
ci.top = L.base_ + p.maxstacksize;
LuaAssert(ci.top <= L.stack_last);
L.savedpc = new InstructionPtr(p.code, 0); /* starting point */
ci.tailcalls = 0;
ci.nresults = nresults;
for (st = L.top; st < ci.top; StkId.Inc(ref st))
{
SetNilValue(st);
}
L.top = ci.top;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
InstructionPtr.inc(ref L.savedpc); /* hooks assume 'pc' is already incremented */
LuaDCallHook(L, LUA_HOOKCALL, -1);
InstructionPtr.dec(ref L.savedpc); /* correct 'pc' */
}
return(PCRLUA);
}
else /* if is a C function, call it */
{
CallInfo ci;
int n;
LuaDCheckStack(L, LUA_MINSTACK); /* ensure minimum stack size */
ci = IncCI(L); /* now `enter' new function */
ci.func = RestoreStack(L, funcr);
L.base_ = ci.base_ = ci.func + 1;
ci.top = L.top + LUA_MINSTACK;
LuaAssert(ci.top <= L.stack_last);
ci.nresults = nresults;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
LuaDCallHook(L, LUA_HOOKCALL, -1);
}
LuaUnlock(L);
n = CurrFunc(L).c.f(L); /* do the actual call */
LuaLock(L);
if (n < 0) /* yielding? */
{
return(PCRYIELD);
}
else
{
LuaDPosCall(L, L.top - n);
return(PCRC);
}
}
}
public static void luaV_execute(lua_State L, int nexeccalls)
{
LClosure cl;
StkId base_;
TValue[] k;
reentry: /* entry point */
lua_assert(isLua(L.ci));
cl = clvalue(L.ci.func).l;
base_ = L.base_;
k = cl.p.k;
/* main loop of interpreter */
for (;;)
{
/*const*/ Instruction i = InstructionPtr.inc(ref L.savedpc)[0];
StkId ra;
if (((L.hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) != 0) &&
(((--L.hookcount) == 0) || ((L.hookmask & LUA_MASKLINE) != 0)))
{
traceexec(L);
if (L.status == LUA_YIELD) /* did hook yield? */
{
InstructionPtr.dec(ref L.savedpc); /* undo increment */
return;
}
base_ = L.base_;
}
/* warning!! several calls may realloc the stack and invalidate `ra' */
ra = RA(L, base_, i);
lua_assert(base_ == L.base_ && L.base_ == L.ci.base_);
lua_assert(base_ <= L.top && ((L.top - L.stack) <= L.stacksize));
lua_assert(L.top == L.ci.top || (luaG_checkopenop(i) != 0));
//Dump(L.savedpc.pc, i); //FIXME:added, only for debugging
switch (GET_OPCODE(i))
{
case OpCode.OP_MOVE: {
setobjs2s(L, ra, RB(L, base_, i));
continue;
}
case OpCode.OP_LOADK: {
setobj2s(L, ra, KBx(L, i, k));
continue;
}
case OpCode.OP_LOADBOOL: {
setbvalue(ra, GETARG_B(i));
if (GETARG_C(i) != 0)
{
InstructionPtr.inc(ref L.savedpc); /* skip next instruction (if C) */
}
continue;
}
case OpCode.OP_LOADNIL: {
TValue rb = RB(L, base_, i);
do
{
setnilvalue(StkId.dec(ref rb));
} while (rb >= ra);
continue;
}
case OpCode.OP_GETUPVAL: {
int b = GETARG_B(i);
setobj2s(L, ra, cl.upvals[b].v);
continue;
}
case OpCode.OP_GETGLOBAL: {
TValue g = new TValue();
TValue rb = KBx(L, i, k);
sethvalue(L, g, cl.env);
lua_assert(ttisstring(rb));
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, g, rb, ra);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_GETTABLE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, RB(L, base_, i), RKC(L, base_, i, k), ra);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:???
continue;
}
case OpCode.OP_SETGLOBAL: {
TValue g = new TValue();
sethvalue(L, g, cl.env);
lua_assert(ttisstring(KBx(L, i, k)));
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_settable(L, g, KBx(L, i, k), ra);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_SETUPVAL: {
UpVal uv = cl.upvals[GETARG_B(i)];
setobj(L, uv.v, ra);
luaC_barrier(L, uv, ra);
continue;
}
case OpCode.OP_SETTABLE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_settable(L, ra, RKB(L, base_, i, k), RKC(L, base_, i, k));
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_NEWTABLE: {
int b = GETARG_B(i);
int c = GETARG_C(i);
Table t = luaH_new(L);
sethvalue(L, ra, t);
if (b != 0 || c != 0)
{
luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));
}
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaC_checkGC(L);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_SELF: {
StkId rb = RB(L, base_, i);
setobjs2s(L, ra + 1, rb);
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_gettable(L, rb, RKC(L, base_, i, k), ra);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:???
continue;
}
case OpCode.OP_ADD: {
arith_op(L, luai_numadd, TMS.TM_ADD, base_, i, k, ra);
continue;
}
case OpCode.OP_SUB: {
arith_op(L, luai_numsub, TMS.TM_SUB, base_, i, k, ra);
continue;
}
case OpCode.OP_MUL: {
arith_op(L, luai_nummul, TMS.TM_MUL, base_, i, k, ra);
continue;
}
case OpCode.OP_DIV: {
arith_op(L, luai_numdiv, TMS.TM_DIV, base_, i, k, ra);
continue;
}
case OpCode.OP_MOD: {
arith_op(L, luai_nummod, TMS.TM_MOD, base_, i, k, ra);
continue;
}
case OpCode.OP_POW: {
arith_op(L, luai_numpow, TMS.TM_POW, base_, i, k, ra);
continue;
}
case OpCode.OP_UNM: {
TValue rb = RB(L, base_, i);
if (ttisnumber(rb))
{
lua_Number nb = nvalue(rb);
setnvalue(ra, luai_numunm(L, nb));
}
else
{
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
Arith(L, ra, rb, rb, TMS.TM_UNM);
base_ = L.base_;
//);
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:???
}
continue;
}
case OpCode.OP_NOT: {
int res = l_isfalse(RB(L, base_, i)) == 0 ? 0 : 1; /* next assignment may change this value */
setbvalue(ra, res);
continue;
}
case OpCode.OP_LEN: {
TValue rb = RB(L, base_, i);
switch (ttype(rb))
{
case LUA_TTABLE: {
setnvalue(ra, (lua_Number)luaH_getn(hvalue(rb)));
break;
}
case LUA_TSTRING: {
setnvalue(ra, (lua_Number)tsvalue(rb).len);
break;
}
default: { /* try metamethod */
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (call_binTM(L, rb, rb, ra, TMS.TM_LEN) == 0)
{
luaG_typeerror(L, rb, "get length of");
}
base_ = L.base_;
//)
break;
}
}
continue;
}
case OpCode.OP_CONCAT: {
int b = GETARG_B(i);
int c = GETARG_C(i);
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
luaV_concat(L, c - b + 1, c); luaC_checkGC(L);
base_ = L.base_;
//);
setobjs2s(L, RA(L, base_, i), base_ + b);
continue;
}
case OpCode.OP_JMP: {
dojump(L, GETARG_sBx(i));
continue;
}
case OpCode.OP_EQ: {
TValue rb = RKB(L, base_, i, k);
TValue rc = RKC(L, base_, i, k);
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (equalobj(L, rb, rc) == GETARG_A(i))
{
dojump(L, GETARG_sBx(L.savedpc[0]));
}
base_ = L.base_;
//);
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_LT: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (luaV_lessthan(L, RKB(L, base_, i, k), RKC(L, base_, i, k)) == GETARG_A(i))
{
dojump(L, GETARG_sBx(L.savedpc[0]));
}
base_ = L.base_;
//);
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_LE: {
//Protect(
//L.savedpc = InstructionPtr.Assign(pc); //FIXME:
if (lessequal(L, RKB(L, base_, i, k), RKC(L, base_, i, k)) == GETARG_A(i))
{
dojump(L, GETARG_sBx(L.savedpc[0]));
}
base_ = L.base_;
//);
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_TEST: {
if (l_isfalse(ra) != GETARG_C(i))
{
dojump(L, GETARG_sBx(L.savedpc[0]));
}
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_TESTSET: {
TValue rb = RB(L, base_, i);
if (l_isfalse(rb) != GETARG_C(i))
{
setobjs2s(L, ra, rb);
dojump(L, GETARG_sBx(L.savedpc[0]));
}
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_CALL: {
int b = GETARG_B(i);
int nresults = GETARG_C(i) - 1;
if (b != 0)
{
L.top = ra + b; /* else previous instruction set top */
}
switch (luaD_precall(L, ra, nresults))
{
case PCRLUA: {
nexeccalls++;
goto reentry; /* restart luaV_execute over new Lua function */
}
case PCRC: {
/* it was a C function (`precall' called it); adjust results */
if (nresults >= 0)
{
L.top = L.ci.top;
}
base_ = L.base_;
continue;
}
default: {
return; /* yield */
}
}
}
case OpCode.OP_TAILCALL: {
int b = GETARG_B(i);
if (b != 0)
{
L.top = ra + b; /* else previous instruction set top */
}
lua_assert(GETARG_C(i) - 1 == LUA_MULTRET);
switch (luaD_precall(L, ra, LUA_MULTRET))
{
case PCRLUA: {
/* tail call: put new frame in place of previous one */
CallInfo ci = L.ci - 1; /* previous frame */
int aux;
StkId func = ci.func;
StkId pfunc = (ci + 1).func; /* previous function index */
if (L.openupval != null)
{
luaF_close(L, ci.base_);
}
L.base_ = ci.base_ = ci.func + (ci[1].base_ - pfunc);
for (aux = 0; pfunc + aux < L.top; aux++) /* move frame down */
{
setobjs2s(L, func + aux, pfunc + aux);
}
ci.top = L.top = func + aux; /* correct top */
lua_assert(L.top == L.base_ + clvalue(func).l.p.maxstacksize);
InstructionPtr.Assign(L.savedpc, ref ci.savedpc);
ci.tailcalls++; /* one more call lost */
CallInfo.dec(ref L.ci); /* remove new frame */
goto reentry;
}
case PCRC: { /* it was a C function (`precall' called it) */
base_ = L.base_;
continue;
}
default: {
return; /* yield */
}
}
}
case OpCode.OP_RETURN: {
int b = GETARG_B(i);
if (b != 0)
{
L.top = ra + b - 1;
}
if (L.openupval != null)
{
luaF_close(L, base_);
}
b = luaD_poscall(L, ra);
if (--nexeccalls == 0) /* was previous function running `here'? */
{
return; /* no: return */
}
else /* yes: continue its execution */
{
if (b != 0)
{
L.top = L.ci.top;
}
lua_assert(isLua(L.ci));
lua_assert(GET_OPCODE(L.ci.savedpc[-1]) == OpCode.OP_CALL);
goto reentry;
}
}
case OpCode.OP_FORLOOP: {
lua_Number step = nvalue(ra + 2);
lua_Number idx = luai_numadd(L, nvalue(ra), step); /* increment index */
lua_Number limit = nvalue(ra + 1);
if (luai_numlt(L, 0, step) ? luai_numle(L, idx, limit)
: luai_numle(L, limit, idx))
{
dojump(L, GETARG_sBx(i)); /* jump back */
setnvalue(ra, idx); /* update internal index... */
setnvalue(ra + 3, idx); /* ...and external index */
}
continue;
}
case OpCode.OP_FORPREP: {
TValue init = ra;
TValue plimit = ra + 1;
TValue pstep = ra + 2;
if (tonumber(ref init, ra) == 0)
{
luaG_runerror(L, LUA_QL("for") + " initial value must be a number");
}
else if (tonumber(ref plimit, ra + 1) == 0)
{
luaG_runerror(L, LUA_QL("for") + " limit must be a number");
}
else if (tonumber(ref pstep, ra + 2) == 0)
{
luaG_runerror(L, LUA_QL("for") + " step must be a number");
}
setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));
dojump(L, GETARG_sBx(i));
continue;
}
case OpCode.OP_TFORLOOP: {
StkId cb = ra + 3; /* call base */
setobjs2s(L, cb + 2, ra + 2);
setobjs2s(L, cb + 1, ra + 1);
setobjs2s(L, cb, ra);
L.top = cb + 3; /* func. + 2 args (state and index) */
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaD_call(L, cb, GETARG_C(i));
base_ = L.base_;
//);
L.top = L.ci.top;
cb = RA(L, base_, i) + 3; /* previous call may change the stack */
if (!ttisnil(cb)) /* continue loop? */
{
setobjs2s(L, cb - 1, cb); /* save control variable */
dojump(L, GETARG_sBx(L.savedpc[0])); /* jump back */
}
InstructionPtr.inc(ref L.savedpc);
continue;
}
case OpCode.OP_SETLIST: {
int n = GETARG_B(i);
int c = GETARG_C(i);
int last;
Table h;
if (n == 0)
{
n = cast_int(L.top - ra) - 1;
}
if (c == 0)
{
c = cast_int(L.savedpc[0]);
InstructionPtr.inc(ref L.savedpc);
}
runtime_check(L, ttistable(ra));
h = hvalue(ra);
last = ((c - 1) * LFIELDS_PER_FLUSH) + n;
if (last > h.sizearray) /* needs more space? */
{
luaH_resizearray(L, h, last); /* pre-alloc it at once */
}
for (; n > 0; n--)
{
TValue val = ra + n;
setobj2t(L, luaH_setnum(L, h, last--), val);
luaC_barriert(L, h, val);
}
L.top = L.ci.top; /* correct top (in case of previous open call) */
continue;
}
case OpCode.OP_CLOSE: {
luaF_close(L, ra);
continue;
}
case OpCode.OP_CLOSURE: {
Proto p;
Closure ncl;
int nup, j;
p = cl.p.p[GETARG_Bx(i)];
nup = p.nups;
ncl = luaF_newLclosure(L, nup, cl.env);
ncl.l.p = p;
setclvalue(L, ra, ncl);
for (j = 0; j < nup; j++, InstructionPtr.inc(ref L.savedpc))
{
Instruction u = L.savedpc[0];
if (GET_OPCODE(u) == OpCode.OP_GETUPVAL)
{
ncl.l.upvals[j] = cl.upvals[GETARG_B(u)];
}
else
{
lua_assert(GET_OPCODE(u) == OpCode.OP_MOVE);
ncl.l.upvals[j] = luaF_findupval(L, base_ + GETARG_B(u));
}
}
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaC_checkGC(L);
base_ = L.base_;
//);
continue;
}
case OpCode.OP_VARARG: {
int b = GETARG_B(i) - 1;
int j;
CallInfo ci = L.ci;
int n = cast_int(ci.base_ - ci.func) - cl.p.numparams - 1;
if (b == LUA_MULTRET)
{
//Protect(
//L.savedpc = InstructionPtr.Assign(pc);//FIXME:
luaD_checkstack(L, n);
base_ = L.base_;
//);
ra = RA(L, base_, i); /* previous call may change the stack */
b = n;
L.top = ra + n;
}
for (j = 0; j < b; j++)
{
if (j < n)
{
setobjs2s(L, ra + j, ci.base_ - n + j);
}
else
{
setnilvalue(ra + j);
}
}
continue;
}
}
}
}
/*
** returns true if function has been executed (C function)
*/
public static int luaD_precall(lua_State L, StkId func, int nresults)
{
LClosure cl;
ptrdiff_t funcr;
if (!ttisfunction(func)) /* `func' is not a function? */
{
func = tryfuncTM(L, func); /* check the `function' tag method */
}
funcr = savestack(L, func);
cl = clvalue(func).l;
L.ci.nresults = (short)nresults; //FIXME:???
if (cl.isC == 0) /* Lua function? prepare its call */
{
CallInfo ci;
int nparams, nargs;
StkId base_;
Proto p = cl.p;
luaD_checkstack(L, p.maxstacksize);
func = restorestack(L, funcr);
nargs = cast_int(L.top - func) - 1; /* number of real arguments */
nparams = p.numparams; /* number of expected parameters */
for (; nargs < nparams; nargs++)
{
setnilvalue(lua_TValue.inc(ref L.top)); /* complete missing arguments */
}
if (p.is_vararg == 0) /* no varargs? */
{
base_ = L.stack[func + 1];
}
else /* vararg function */
{
base_ = adjust_varargs(L, p, nargs);
}
ci = next_ci(L); /* now `enter' new function */
ci.func = func;
ci.u.l.base_ = base_;
ci.top = base_ + p.maxstacksize;
lua_assert(ci.top <= L.stack_last);
ci.u.l.savedpc = new InstructionPtr(p.code, 0); /* starting point */ //FIXME:??? //FIXME:???
ci.u.l.tailcalls = 0;
ci.callstatus = CIST_LUA;
L.top = ci.top;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
InstructionPtr.inc(ref ci.u.l.savedpc); /* hooks assume 'pc' is already incremented */
luaD_callhook(L, LUA_HOOKCALL, -1);
InstructionPtr.dec(ref ci.u.l.savedpc); /* correct 'pc' */
}
return(0);
}
else /* if is a C function, call it */
{
CallInfo ci;
int n;
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
ci = next_ci(L); /* now `enter' new function */
ci.func = restorestack(L, funcr);
ci.top = L.top + LUA_MINSTACK;
lua_assert(ci.top <= L.stack_last);
ci.callstatus = 0;
if ((L.hookmask & LUA_MASKCALL) != 0)
{
luaD_callhook(L, LUA_HOOKCALL, -1);
}
lua_unlock(L);
n = curr_func(L).c.f(L); /* do the actual call */
lua_lock(L);
luaD_poscall(L, L.top - n);
return(1);
}
}
