lua/lvm.c

833 lines
26 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lvm.c,v 2.99 2009/09/30 15:38:37 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Lua virtual machine
** See Copyright Notice in lua.h
*/
2005-03-08 21:09:16 +03:00
#include <stdio.h>
#include <stdlib.h>
1997-09-16 23:25:59 +04:00
#include <string.h>
2002-12-04 20:38:31 +03:00
#define lvm_c
#define LUA_CORE
2002-12-04 20:38:31 +03:00
#include "lua.h"
#include "ldebug.h"
1997-09-16 23:25:59 +04:00
#include "ldo.h"
#include "lfunc.h"
#include "lgc.h"
#include "lobject.h"
1997-09-16 23:25:59 +04:00
#include "lopcodes.h"
#include "lstate.h"
1997-09-16 23:25:59 +04:00
#include "lstring.h"
#include "ltable.h"
#include "ltm.h"
#include "lvm.h"
2002-08-05 21:36:24 +04:00
2002-02-06 01:39:12 +03:00
/* limit for table tag-method chains (to avoid loops) */
2002-07-05 22:27:39 +04:00
#define MAXTAGLOOP 100
2002-02-06 01:39:12 +03:00
1997-09-16 23:25:59 +04:00
const TValue *luaV_tonumber (const TValue *obj, TValue *n) {
2001-06-28 18:48:44 +04:00
lua_Number num;
2002-08-05 21:36:24 +04:00
if (ttisnumber(obj)) return obj;
if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) {
2001-06-28 18:48:44 +04:00
setnvalue(n, num);
return n;
1997-09-16 23:25:59 +04:00
}
else
return NULL;
1997-09-16 23:25:59 +04:00
}
2002-11-14 19:15:53 +03:00
int luaV_tostring (lua_State *L, StkId obj) {
2002-08-05 21:36:24 +04:00
if (!ttisnumber(obj))
2002-02-07 20:24:05 +03:00
return 0;
1997-09-16 23:25:59 +04:00
else {
char s[LUAI_MAXNUMBER2STR];
lua_Number n = nvalue(obj);
lua_number2str(s, n);
setsvalue2s(L, obj, luaS_new(L, s));
2002-02-07 20:24:05 +03:00
return 1;
1997-09-16 23:25:59 +04:00
}
}
static void traceexec (lua_State *L) {
CallInfo *ci = L->ci;
lu_byte mask = L->hookmask;
if ((mask & LUA_MASKCOUNT) && L->hookcount == 0) {
resethookcount(L);
luaD_callhook(L, LUA_HOOKCOUNT, -1);
2002-07-08 22:21:33 +04:00
}
if (mask & LUA_MASKLINE) {
Proto *p = ci_func(ci)->l.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 */
2002-07-08 22:21:33 +04:00
luaD_callhook(L, LUA_HOOKLINE, newline);
}
L->oldpc = ci->u.l.savedpc;
2000-06-26 23:28:31 +04:00
}
2006-01-23 22:51:43 +03:00
static void callTM (lua_State *L, const TValue *f, const TValue *p1,
const TValue *p2, TValue *p3, int hasres) {
ptrdiff_t result = savestack(L, p3);
setobj2s(L, L->top++, f); /* push function */
setobj2s(L, L->top++, p1); /* 1st argument */
setobj2s(L, L->top++, p2); /* 2nd argument */
if (!hasres) /* no result? 'p3' is third argument */
setobj2s(L, L->top++, p3); /* 3th argument */
luaD_checkstack(L, 0);
/* metamethod may yield only when called from Lua code */
luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci));
if (hasres) { /* if has result, move it to its place */
p3 = restorestack(L, result);
setobjs2s(L, p3, --L->top);
}
2001-02-07 21:13:49 +03:00
}
void luaV_gettable (lua_State *L, const TValue *t, TValue *key, StkId val) {
int loop;
for (loop = 0; loop < MAXTAGLOOP; loop++) {
const TValue *tm;
if (ttistable(t)) { /* `t' is a table? */
Table *h = hvalue(t);
2005-02-23 20:30:22 +03:00
const TValue *res = luaH_get(h, key); /* do a primitive get */
if (!ttisnil(res) || /* result is no nil? */
(tm = fasttm(L, h->metatable, TM_INDEX)) == NULL) { /* or no TM? */
setobj2s(L, val, res);
return;
}
/* else will try the tag method */
}
else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_INDEX)))
luaG_typeerror(L, t, "index");
if (ttisfunction(tm)) {
callTM(L, tm, t, key, val, 1);
return;
}
t = tm; /* else repeat with 'tm' */
2002-07-05 22:27:39 +04:00
}
luaG_runerror(L, "loop in gettable");
1997-09-16 23:25:59 +04:00
}
void luaV_settable (lua_State *L, const TValue *t, TValue *key, StkId val) {
int loop;
TValue temp;
for (loop = 0; loop < MAXTAGLOOP; loop++) {
const TValue *tm;
2002-08-05 21:36:24 +04:00
if (ttistable(t)) { /* `t' is a table? */
2002-06-14 21:21:32 +04:00
Table *h = hvalue(t);
TValue *oldval = luaH_set(L, h, key); /* do a primitive set */
2002-08-05 21:36:24 +04:00
if (!ttisnil(oldval) || /* result is no nil? */
(tm = fasttm(L, h->metatable, TM_NEWINDEX)) == NULL) { /* or no TM? */
setobj2t(L, oldval, val);
luaC_barriert(L, h, val);
return;
2002-05-28 00:35:40 +04:00
}
2002-06-14 21:21:32 +04:00
/* else will try the tag method */
2001-02-12 16:04:19 +03:00
}
else if (ttisnil(tm = luaT_gettmbyobj(L, t, TM_NEWINDEX)))
luaG_typeerror(L, t, "index");
2002-08-05 21:36:24 +04:00
if (ttisfunction(tm)) {
callTM(L, tm, t, key, val, 0);
return;
2001-12-05 23:15:18 +03:00
}
/* else repeat with 'tm' */
setobj(L, &temp, tm); /* avoid pointing inside table (may rehash) */
t = &temp;
}
2002-06-14 21:21:32 +04:00
luaG_runerror(L, "loop in settable");
1997-09-16 23:25:59 +04:00
}
static int call_binTM (lua_State *L, const TValue *p1, const TValue *p2,
StkId res, TMS event) {
const TValue *tm = luaT_gettmbyobj(L, p1, event); /* try first operand */
2002-08-05 21:36:24 +04:00
if (ttisnil(tm))
2001-12-05 23:15:18 +03:00
tm = luaT_gettmbyobj(L, p2, event); /* try second operand */
if (ttisnil(tm)) return 0;
callTM(L, tm, p1, p2, res, 1);
2000-08-10 23:50:47 +04:00
return 1;
1997-09-16 23:25:59 +04:00
}
static const TValue *get_compTM (lua_State *L, Table *mt1, Table *mt2,
TMS event) {
const TValue *tm1 = fasttm(L, mt1, event);
const TValue *tm2;
if (tm1 == NULL) return NULL; /* no metamethod */
if (mt1 == mt2) return tm1; /* same metatables => same metamethods */
tm2 = fasttm(L, mt2, event);
if (tm2 == NULL) return NULL; /* no metamethod */
if (luaO_rawequalObj(tm1, tm2)) /* same metamethods? */
return tm1;
return NULL;
}
static int call_orderTM (lua_State *L, const TValue *p1, const TValue *p2,
TMS event) {
const TValue *tm1 = luaT_gettmbyobj(L, p1, event);
const TValue *tm2;
if (ttisnil(tm1)) return -1; /* no metamethod? */
tm2 = luaT_gettmbyobj(L, p2, event);
if (!luaO_rawequalObj(tm1, tm2)) /* different metamethods? */
return -1;
callTM(L, tm1, p1, p2, L->top, 1);
return !l_isfalse(L->top);
}
static int l_strcmp (const TString *ls, const TString *rs) {
const char *l = getstr(ls);
size_t ll = ls->tsv.len;
const char *r = getstr(rs);
size_t lr = rs->tsv.len;
1998-03-06 19:54:42 +03:00
for (;;) {
2000-05-24 17:54:49 +04:00
int temp = strcoll(l, r);
if (temp != 0) return temp;
2001-02-22 21:59:59 +03:00
else { /* strings are equal up to a `\0' */
size_t len = strlen(l); /* index of first `\0' in both strings */
if (len == lr) /* r is finished? */
return (len == ll) ? 0 : 1;
else if (len == ll) /* l is finished? */
return -1; /* l is smaller than r (because r is not finished) */
2001-02-22 21:59:59 +03:00
/* both strings longer than `len'; go on comparing (after the `\0') */
2000-05-24 17:54:49 +04:00
len++;
l += len; ll -= len; r += len; lr -= len;
}
1998-03-06 19:54:42 +03:00
}
}
int luaV_lessthan (lua_State *L, const TValue *l, const TValue *r) {
int res;
2002-06-24 19:07:21 +04:00
if (ttype(l) != ttype(r))
return luaG_ordererror(L, l, r);
2002-08-05 21:36:24 +04:00
else if (ttisnumber(l))
return luai_numlt(L, nvalue(l), nvalue(r));
2002-08-05 21:36:24 +04:00
else if (ttisstring(l))
return l_strcmp(rawtsvalue(l), rawtsvalue(r)) < 0;
else if ((res = call_orderTM(L, l, r, TM_LT)) != -1)
return res;
2002-06-24 19:07:21 +04:00
return luaG_ordererror(L, l, r);
}
int luaV_lessequal (lua_State *L, const TValue *l, const TValue *r) {
int res;
2002-06-24 19:07:21 +04:00
if (ttype(l) != ttype(r))
return luaG_ordererror(L, l, r);
2002-08-05 21:36:24 +04:00
else if (ttisnumber(l))
return luai_numle(L, nvalue(l), nvalue(r));
2002-08-05 21:36:24 +04:00
else if (ttisstring(l))
return l_strcmp(rawtsvalue(l), rawtsvalue(r)) <= 0;
else if ((res = call_orderTM(L, l, r, TM_LE)) != -1) /* first try `le' */
return res;
else if ((res = call_orderTM(L, r, l, TM_LT)) != -1) /* else try `lt' */
return !res;
2002-06-24 19:07:21 +04:00
return luaG_ordererror(L, l, r);
1997-09-16 23:25:59 +04:00
}
int luaV_equalval_ (lua_State *L, const TValue *t1, const TValue *t2) {
const TValue *tm;
2002-06-13 17:39:55 +04:00
lua_assert(ttype(t1) == ttype(t2));
switch (ttype(t1)) {
case LUA_TNIL: return 1;
case LUA_TNUMBER: return luai_numeq(nvalue(t1), nvalue(t2));
2002-06-13 17:39:55 +04:00
case LUA_TBOOLEAN: return bvalue(t1) == bvalue(t2); /* true must be 1 !! */
case LUA_TLIGHTUSERDATA: return pvalue(t1) == pvalue(t2);
case LUA_TUSERDATA: {
2002-06-13 17:39:55 +04:00
if (uvalue(t1) == uvalue(t2)) return 1;
tm = get_compTM(L, uvalue(t1)->metatable, uvalue(t2)->metatable, TM_EQ);
break; /* will try TM */
}
case LUA_TTABLE: {
2002-06-13 17:39:55 +04:00
if (hvalue(t1) == hvalue(t2)) return 1;
tm = get_compTM(L, hvalue(t1)->metatable, hvalue(t2)->metatable, TM_EQ);
break; /* will try TM */
}
default: return gcvalue(t1) == gcvalue(t2);
2002-06-13 17:39:55 +04:00
}
if (tm == NULL) return 0; /* no TM? */
callTM(L, tm, t1, t2, L->top, 1); /* call TM */
2002-06-13 17:39:55 +04:00
return !l_isfalse(L->top);
}
void luaV_concat (lua_State *L, int total) {
lua_assert(total >= 2);
2000-03-09 03:19:22 +03:00
do {
StkId top = L->top;
2000-03-09 03:19:22 +03:00
int n = 2; /* number of elements handled in this pass (at least 2) */
if (!(ttisstring(top-2) || ttisnumber(top-2)) || !tostring(L, top-1)) {
2001-02-07 21:13:49 +03:00
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
luaG_concaterror(L, top-2, top-1);
}
else if (tsvalue(top-1)->len == 0) /* second operand is empty? */
(void)tostring(L, top - 2); /* result is first operand */
else if (ttisstring(top-2) && tsvalue(top-2)->len == 0) {
setsvalue2s(L, top-2, rawtsvalue(top-1)); /* result is second op. */
}
else {
/* at least two non-empty string values; get as many as possible */
size_t tl = tsvalue(top-1)->len;
char *buffer;
2000-03-09 03:19:22 +03:00
int i;
/* collect total length */
for (n = 1; n < total && tostring(L, top-n-1); n++) {
size_t l = tsvalue(top-n-1)->len;
if (l >= MAX_SIZET - tl) luaG_runerror(L, "string length overflow");
tl += l;
2000-03-09 03:19:22 +03:00
}
buffer = luaZ_openspace(L, &G(L)->buff, tl);
2000-03-09 03:19:22 +03:00
tl = 0;
for (i=n; i>0; i--) { /* concat all strings */
size_t l = tsvalue(top-i)->len;
memcpy(buffer+tl, svalue(top-i), l);
2000-03-09 03:19:22 +03:00
tl += l;
}
setsvalue2s(L, top-n, luaS_newlstr(L, buffer, tl));
2000-03-09 03:19:22 +03:00
}
total -= n-1; /* got 'n' strings to create 1 new */
L->top -= n-1; /* poped 'n' strings and pushed one */
2000-03-09 03:19:22 +03:00
} while (total > 1); /* repeat until only 1 result left */
}
static void objlen (lua_State *L, StkId ra, const TValue *rb) {
const TValue *tm;
switch (ttype(rb)) {
case LUA_TTABLE: {
Table *h = hvalue(rb);
tm = fasttm(L, h->metatable, TM_LEN);
if (tm) break; /* metamethod? break switch to call it */
setnvalue(ra, cast_num(luaH_getn(h))); /* else primitive len */
return;
}
case LUA_TSTRING: {
setnvalue(ra, cast_num(tsvalue(rb)->len));
return;
}
default: { /* try metamethod */
tm = luaT_gettmbyobj(L, rb, TM_LEN);
if (ttisnil(tm)) /* no metamethod? */
luaG_typeerror(L, rb, "get length of");
break;
}
}
callTM(L, tm, rb, luaO_nilobject, ra, 1);
}
void luaV_arith (lua_State *L, StkId ra, const TValue *rb,
const TValue *rc, TMS op) {
TValue tempb, tempc;
const TValue *b, *c;
2002-06-24 18:11:14 +04:00
if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
(c = luaV_tonumber(rc, &tempc)) != NULL) {
lua_Number res = luaO_arith(op - TM_ADD + LUA_OPADD, nvalue(b), nvalue(c));
setnvalue(ra, res);
}
2002-06-24 18:11:14 +04:00
else if (!call_binTM(L, rb, rc, ra, op))
luaG_aritherror(L, rb, rc);
}
/*
** finish execution of an opcode interrupted by an yield
*/
void luaV_finishOp (lua_State *L) {
CallInfo *ci = L->ci;
StkId base = ci->u.l.base;
Instruction inst = *(ci->u.l.savedpc - 1); /* interrupted instruction */
OpCode op = GET_OPCODE(inst);
if (op == OP_EXTRAARG) { /* extra argument? */
inst = *(ci->u.l.savedpc - 2); /* get its 'main' instruction */
op = GET_OPCODE(inst);
}
switch (op) { /* finish its execution */
case OP_ADD: case OP_SUB: case OP_MUL: case OP_DIV:
case OP_MOD: case OP_POW: case OP_UNM: case OP_LEN:
case OP_GETGLOBAL: case OP_GETTABLE: case OP_SELF: {
setobjs2s(L, base + GETARG_A(inst), --L->top);
break;
}
case OP_LE: case OP_LT: case OP_EQ: {
int res = !l_isfalse(L->top - 1);
L->top--;
/* metamethod should not be called when operand is K */
lua_assert(!ISK(GETARG_B(inst)));
if (op == OP_LE && /* "<=" using "<" instead? */
ttisnil(luaT_gettmbyobj(L, base + GETARG_B(inst), TM_LE)))
res = !res; /* invert result */
lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_JMP);
if (res != GETARG_A(inst)) /* condition failed? */
ci->u.l.savedpc++; /* skip jump instruction */
break;
}
case OP_CONCAT: {
StkId top = L->top - 1; /* top when 'call_binTM' was called */
int b = GETARG_B(inst); /* first element to concatenate */
int total = top - 1 - (base + b); /* elements yet to concatenate */
setobj2s(L, top - 2, top); /* put TM result in proper position */
if (total > 1) { /* are there elements to concat? */
L->top = top - 1; /* top is one after last element (at top-2) */
luaV_concat(L, total); /* concat them (may yield again) */
}
/* move final result to final position */
setobj2s(L, ci->u.l.base + GETARG_A(inst), L->top - 1);
L->top = ci->top; /* restore top */
break;
}
case OP_TFORCALL: {
lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_TFORLOOP);
L->top = ci->top; /* correct top */
break;
}
case OP_CALL: {
if (GETARG_C(inst) - 1 >= 0) /* nresults >= 0? */
L->top = ci->top; /* adjust results */
break;
}
case OP_TAILCALL: case OP_SETGLOBAL: case OP_SETTABLE:
break;
default: lua_assert(0);
}
}
2000-09-20 21:57:08 +04:00
/*
** some macros for common tasks in `luaV_execute'
*/
#define RA(i) (base+GETARG_A(i))
2002-11-21 18:46:44 +03:00
/* to be used after possible stack reallocation */
#define RB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgR, base+GETARG_B(i))
#define RC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgR, base+GETARG_C(i))
#define RKB(i) check_exp(getBMode(GET_OPCODE(i)) == OpArgK, \
2004-06-29 22:49:02 +04:00
ISK(GETARG_B(i)) ? k+INDEXK(GETARG_B(i)) : base+GETARG_B(i))
#define RKC(i) check_exp(getCMode(GET_OPCODE(i)) == OpArgK, \
2004-06-29 22:49:02 +04:00
ISK(GETARG_C(i)) ? k+INDEXK(GETARG_C(i)) : base+GETARG_C(i))
#define KBx(i) \
(k + (GETARG_Bx(i) != 0 ? GETARG_Bx(i) - 1 : GETARG_Ax(*ci->u.l.savedpc++)))
#define dojump(i) { ci->u.l.savedpc += (i); luai_threadyield(L);}
2000-09-20 21:57:08 +04:00
#define Protect(x) { {x;}; base = ci->u.l.base; }
2005-11-01 19:08:45 +03:00
#define arith_op(op,tm) { \
TValue *rb = RKB(i); \
TValue *rc = RKC(i); \
if (ttisnumber(rb) && ttisnumber(rc)) { \
lua_Number nb = nvalue(rb), nc = nvalue(rc); \
setnvalue(ra, op(L, nb, nc)); \
2005-11-01 19:08:45 +03:00
} \
else \
Protect(luaV_arith(L, ra, rb, rc, tm)); \
2005-11-01 19:08:45 +03:00
}
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));
2000-06-26 23:28:31 +04:00
/* main loop of interpreter */
1998-12-03 18:45:15 +03:00
for (;;) {
Instruction i = *(ci->u.l.savedpc++);
StkId ra;
if ((L->hookmask & (LUA_MASKLINE | LUA_MASKCOUNT)) &&
2002-11-18 18:24:11 +03:00
(--L->hookcount == 0 || L->hookmask & LUA_MASKLINE)) {
traceexec(L);
2004-09-16 00:39:42 +04:00
if (L->status == LUA_YIELD) { /* did hook yield? */
ci->u.l.savedpc--; /* undo increment */
luaD_throw(L, LUA_YIELD);
2002-11-18 18:24:11 +03:00
}
base = ci->u.l.base;
2002-11-18 18:24:11 +03:00
}
2002-08-07 18:24:24 +04:00
/* warning!! several calls may realloc the stack and invalidate `ra' */
ra = RA(i);
lua_assert(base == ci->u.l.base);
lua_assert(base <= L->top && L->top < L->stack + L->stacksize);
2000-02-14 19:51:08 +03:00
switch (GET_OPCODE(i)) {
case OP_MOVE: {
setobjs2s(L, ra, RB(i));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_LOADK: {
TValue *rb = KBx(i);
setobj2s(L, ra, rb);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
2001-12-12 01:48:44 +03:00
case OP_LOADBOOL: {
setbvalue(ra, GETARG_B(i));
if (GETARG_C(i)) ci->u.l.savedpc++; /* skip next instruction (if C) */
2004-06-29 21:05:00 +04:00
continue;
2001-12-12 01:48:44 +03:00
}
case OP_LOADNIL: {
TValue *rb = RB(i);
do {
2001-06-08 16:29:27 +04:00
setnilvalue(rb--);
} while (rb >= ra);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_GETUPVAL: {
int b = GETARG_B(i);
setobj2s(L, ra, cl->upvals[b]->v);
2004-06-29 21:05:00 +04:00
continue;
}
2000-08-14 21:45:59 +04:00
case OP_GETGLOBAL: {
TValue g;
TValue *rb = KBx(i);
sethvalue(L, &g, cl->env);
lua_assert(ttisstring(rb));
Protect(luaV_gettable(L, &g, rb, ra));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_GETTABLE: {
Protect(luaV_gettable(L, RB(i), RKC(i), ra));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_SETGLOBAL: {
TValue g;
TValue *rb = KBx(i);
sethvalue(L, &g, cl->env);
lua_assert(ttisstring(rb));
Protect(luaV_settable(L, &g, rb, ra));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_SETUPVAL: {
2003-12-09 19:56:11 +03:00
UpVal *uv = cl->upvals[GETARG_B(i)];
setobj(L, uv->v, ra);
2003-12-09 19:56:11 +03:00
luaC_barrier(L, uv, ra);
2004-06-29 21:05:00 +04:00
continue;
}
2000-08-14 21:45:59 +04:00
case OP_SETTABLE: {
Protect(luaV_settable(L, ra, RKB(i), RKC(i)));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_NEWTABLE: {
2006-07-14 20:22:24 +04:00
int b = GETARG_B(i);
int c = GETARG_C(i);
Table *t = luaH_new(L);
sethvalue(L, ra, t);
2006-07-14 20:22:24 +04:00
if (b != 0 || c != 0)
luaH_resize(L, t, luaO_fb2int(b), luaO_fb2int(c));
Protect(luaC_checkGC(L));
2004-06-29 21:05:00 +04:00
continue;
1997-09-16 23:25:59 +04:00
}
case OP_SELF: {
StkId rb = RB(i);
setobjs2s(L, ra+1, rb);
Protect(luaV_gettable(L, rb, RKC(i), ra));
2004-06-29 21:05:00 +04:00
continue;
1997-09-16 23:25:59 +04:00
}
2000-08-14 21:45:59 +04:00
case OP_ADD: {
2005-11-01 19:08:45 +03:00
arith_op(luai_numadd, TM_ADD);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_SUB: {
2005-11-01 19:08:45 +03:00
arith_op(luai_numsub, TM_SUB);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_MUL: {
2005-11-01 19:08:45 +03:00
arith_op(luai_nummul, TM_MUL);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_DIV: {
2005-11-01 19:08:45 +03:00
arith_op(luai_numdiv, TM_DIV);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
2005-03-08 21:00:16 +03:00
case OP_MOD: {
2005-11-01 19:08:45 +03:00
arith_op(luai_nummod, TM_MOD);
2005-03-08 21:00:16 +03:00
continue;
}
2000-08-14 21:45:59 +04:00
case OP_POW: {
2005-11-01 19:08:45 +03:00
arith_op(luai_numpow, TM_POW);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_UNM: {
2005-08-11 00:20:13 +04:00
TValue *rb = RB(i);
if (ttisnumber(rb)) {
2005-03-08 21:00:16 +03:00
lua_Number nb = nvalue(rb);
setnvalue(ra, luai_numunm(L, nb));
}
else {
Protect(luaV_arith(L, ra, rb, rb, TM_UNM));
1997-09-16 23:25:59 +04:00
}
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_NOT: {
2001-12-12 01:48:44 +03:00
int res = l_isfalse(RB(i)); /* next assignment may change this value */
setbvalue(ra, res);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
2005-05-20 19:53:42 +04:00
case OP_LEN: {
Protect(objlen(L, ra, RB(i)));
continue;
}
case OP_CONCAT: {
int b = GETARG_B(i);
int c = GETARG_C(i);
L->top = base + c + 1; /* mark the end of concat operands */
Protect(luaV_concat(L, c-b+1); luaC_checkGC(L));
L->top = ci->top; /* restore top */
setobjs2s(L, RA(i), base+b);
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_JMP: {
dojump(GETARG_sBx(i));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
2002-08-21 22:56:33 +04:00
case OP_EQ: {
TValue *rb = RKB(i);
TValue *rc = RKC(i);
Protect(
if (equalobj(L, rb, rc) == GETARG_A(i))
dojump(GETARG_sBx(*ci->u.l.savedpc));
)
ci->u.l.savedpc++;
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_LT: {
Protect(
if (luaV_lessthan(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(GETARG_sBx(*ci->u.l.savedpc));
)
ci->u.l.savedpc++;
2004-06-29 21:05:00 +04:00
continue;
}
case OP_LE: {
Protect(
if (luaV_lessequal(L, RKB(i), RKC(i)) == GETARG_A(i))
dojump(GETARG_sBx(*ci->u.l.savedpc));
)
ci->u.l.savedpc++;
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_TEST: {
if (GETARG_C(i) ? !l_isfalse(ra) : l_isfalse(ra))
dojump(GETARG_sBx(*ci->u.l.savedpc));
ci->u.l.savedpc++;
continue;
}
case OP_TESTSET: {
TValue *rb = RB(i);
if (GETARG_C(i) ? !l_isfalse(rb) : l_isfalse(rb)) {
setobjs2s(L, ra, rb);
dojump(GETARG_sBx(*ci->u.l.savedpc));
}
ci->u.l.savedpc++;
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_CALL: {
int b = GETARG_B(i);
int nresults = GETARG_C(i) - 1;
2002-01-10 01:02:47 +03:00
if (b != 0) L->top = ra+b; /* else previous instruction set top */
if (luaD_precall(L, ra, nresults)) { /* 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 */
2001-12-20 18:13:38 +03:00
}
}
case 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)) { /* 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 */
StkId ofunc = oci->func; /* caller function */
/* last stack slot filled by 'precall' */
StkId lim = nci->u.l.base + getproto(nfunc)->numparams;
int aux;
/* close all upvalues from previous call */
if (cl->p->sizep > 0) luaF_close(L, oci->u.l.base);
/* move new frame into old one */
for (aux = 0; nfunc + aux < lim; aux++)
setobjs2s(L, ofunc + aux, nfunc + aux);
oci->u.l.base = ofunc + (nci->u.l.base - nfunc); /* correct base */
oci->top = L->top = ofunc + (L->top - nfunc); /* correct top */
oci->u.l.savedpc = nci->u.l.savedpc;
oci->u.l.tailcalls++; /* one more call lost */
ci = L->ci = oci; /* remove new frame */
lua_assert(L->top == oci->u.l.base + getproto(ofunc)->maxstacksize);
break; /* restart luaV_execute over new Lua function */
}
2000-08-14 21:45:59 +04:00
}
case OP_RETURN: {
2002-08-05 21:36:24 +04:00
int b = GETARG_B(i);
2002-01-10 01:02:47 +03:00
if (b != 0) L->top = ra+b-1;
if (cl->p->sizep > 0) luaF_close(L, base);
2005-08-22 22:54:49 +04:00
b = luaD_poscall(L, ra);
if (!(ci->callstatus & CIST_REENTRY)) /* 'ci' still the called one */
return; /* external invocation: return */
else { /* invocation via reentry: continue execution */
ci = L->ci;
if (b) L->top = ci->top;
lua_assert(isLua(ci));
lua_assert(GET_OPCODE(*((ci)->u.l.savedpc - 1)) == OP_CALL);
break; /* restart luaV_execute over new Lua function */
2001-12-20 18:13:38 +03:00
}
}
2002-02-06 01:39:12 +03:00
case 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)); /* jump back */
setnvalue(ra, idx); /* update internal index... */
setnvalue(ra+3, idx); /* ...and external index */
}
2004-06-29 21:05:00 +04:00
continue;
}
case OP_FORPREP: {
const TValue *init = ra;
const TValue *plimit = ra+1;
const TValue *pstep = ra+2;
if (!tonumber(init, ra))
2005-05-17 23:49:15 +04:00
luaG_runerror(L, LUA_QL("for") " initial value must be a number");
else if (!tonumber(plimit, ra+1))
2005-05-17 23:49:15 +04:00
luaG_runerror(L, LUA_QL("for") " limit must be a number");
else if (!tonumber(pstep, ra+2))
2005-05-17 23:49:15 +04:00
luaG_runerror(L, LUA_QL("for") " step must be a number");
setnvalue(ra, luai_numsub(L, nvalue(ra), nvalue(pstep)));
dojump(GETARG_sBx(i));
2004-06-29 21:05:00 +04:00
continue;
}
case 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(luaD_call(L, cb, GETARG_C(i), 1));
L->top = ci->top;
i = *(ci->u.l.savedpc++); /* go to next instruction */
ra = RA(i);
lua_assert(GET_OPCODE(i) == OP_TFORLOOP);
/* go through */
}
case OP_TFORLOOP: {
if (!ttisnil(ra + 1)) { /* continue loop? */
setobjs2s(L, ra, ra + 1); /* save control variable */
dojump(GETARG_sBx(i)); /* jump back */
}
2004-06-29 21:05:00 +04:00
continue;
}
case OP_SETLIST: {
int n = GETARG_B(i);
int c = GETARG_C(i);
int last;
2001-10-25 23:14:14 +04:00
Table *h;
if (n == 0) n = cast_int(L->top - ra) - 1;
if (c == 0) {
lua_assert(GET_OPCODE(*ci->u.l.savedpc) == OP_EXTRAARG);
c = GETARG_Ax(*ci->u.l.savedpc++);
}
2005-03-07 21:27:34 +03:00
h = hvalue(ra);
2005-03-28 21:17:53 +04:00
last = ((c-1)*LFIELDS_PER_FLUSH) + n;
if (last > h->sizearray) /* needs more space? */
2005-01-04 18:55:12 +03:00
luaH_resizearray(L, h, last); /* pre-alloc it at once */
2003-12-09 19:56:11 +03:00
for (; n > 0; n--) {
TValue *val = ra+n;
setobj2t(L, luaH_setint(L, h, last--), val);
luaC_barriert(L, h, val);
2003-12-09 19:56:11 +03:00
}
L->top = ci->top; /* correct top (in case of previous open call) */
2004-06-29 21:05:00 +04:00
continue;
}
case OP_CLOSE: {
luaF_close(L, ra);
2004-06-29 21:05:00 +04:00
continue;
}
2000-08-14 21:45:59 +04:00
case OP_CLOSURE: {
Proto *p = cl->p->p[GETARG_Bx(i)]; /* prototype for new closure */
int nup = p->sizeupvalues;
Closure *ncl = luaF_newLclosure(L, nup, cl->env);
Upvaldesc *uv = p->upvalues;
int j;
2001-10-02 20:45:03 +04:00
ncl->l.p = p;
setclvalue(L, ra, ncl); /* anchor new closure in stack */
if (p->envreg != NO_REG) { /* lexical environment? */
StkId env = base + p->envreg;
if (!ttistable(env))
luaG_runerror(L, "environment is not a table: "
"cannot create closure");
else
ncl->l.env = hvalue(env);
}
for (j = 0; j < nup; j++) { /* fill in upvalues */
if (uv[j].instack) /* upvalue refers to local variable? */
ncl->l.upvals[j] = luaF_findupval(L, base + uv[j].idx);
else /* get upvalue from enclosing function */
ncl->l.upvals[j] = cl->upvals[uv[j].idx];
}
Protect(luaC_checkGC(L));
2004-06-29 21:05:00 +04:00
continue;
2000-08-14 21:45:59 +04:00
}
case OP_VARARG: {
int b = GETARG_B(i) - 1;
int j;
int n = cast_int(base - ci->func) - cl->p->numparams - 1;
if (b < 0) { /* B == 0? */
b = n; /* get all var. arguments */
Protect(luaD_checkstack(L, n));
ra = RA(i); /* previous call may change the stack */
L->top = ra + n;
}
for (j = 0; j < b; j++) {
if (j < n) {
setobjs2s(L, ra + j, base - n + j);
}
else {
setnilvalue(ra + j);
}
}
2004-06-29 21:05:00 +04:00
continue;
}
case OP_EXTRAARG: {
luaG_runerror(L, "bad opcode");
return;
}
1997-09-16 23:25:59 +04:00
}
/* 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;
2000-10-06 16:45:25 +04:00
}
1997-09-16 23:25:59 +04:00
}