| 15204 | |
| 15205 | |
| 15206 | void luaV_execute (lua_State *L, int nexeccalls) { |
| 15207 | LClosure *cl; |
| 15208 | StkId base; |
| 15209 | TValue *k; |
| 15210 | const Instruction *pc; |
| 15211 | reentry: /* entry point */ |
| 15212 | lua_assert(isLua(L->ci)); |
| 15213 | pc = L->savedpc; |
| 15214 | cl = &clvalue(L->ci->func)->l; |
| 15215 | base = L->base; |
| 15216 | k = cl->p->k; |
| 15217 | /* main loop of interpreter */ |
| 15218 | for (;;) { |
| 15219 | const Instruction i = *pc++; |
| 15220 | StkId ra; |
| 15221 | if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) && |
| 15222 | (--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) { |
| 15223 | traceexec(L, pc); |
| 15224 | if (L->status == LUA_YIELD) { /* did hook yield? */ |
| 15225 | L->savedpc = pc - 1; |
| 15226 | return; |
| 15227 | } |
| 15228 | base = L->base; |
| 15229 | } |
| 15230 | /* warning!! several calls may realloc the stack and invalidate `ra' */ |
| 15231 | ra = RA(i); |
| 15232 | lua_assert(base == L->base && L->base == L->ci->base); |
| 15233 | lua_assert(base <= L->top && L->top <= L->stack + L->stacksize); |
| 15234 | lua_assert(L->top == L->ci->top || luaG_checkopenop(i)); |
| 15235 | switch (GET_OPCODE(i)) { |
| 15236 | case OP_MOVE: { |
| 15237 | setobjs2s(L, ra, RB(i)); |
| 15238 | continue; |
| 15239 | } |
| 15240 | case OP_LOADK: { |
| 15241 | setobj2s(L, ra, KBx(i)); |
| 15242 | continue; |
| 15243 | } |
| 15244 | case OP_LOADBOOL: { |
| 15245 | setbvalue(ra, GETARG_B(i)); |
| 15246 | if (GETARG_C(i)) pc++; /* skip next instruction (if C) */ |
| 15247 | continue; |
| 15248 | } |
| 15249 | case OP_LOADNIL: { |
| 15250 | TValue *rb = RB(i); |
| 15251 | do { |
| 15252 | setnilvalue(rb--); |
| 15253 | } while (rb >= ra); |
| 15254 | continue; |
| 15255 | } |
| 15256 | case OP_GETUPVAL: { |
| 15257 | int b = GETARG_B(i); |
| 15258 | setobj2s(L, ra, cl->upvals[b]->v); |
| 15259 | continue; |
| 15260 | } |
| 15261 | case OP_GETGLOBAL: { |
| 15262 | TValue g; |
| 15263 | TValue *rb = KBx(i); |
no test coverage detected