lua/lvm.c

734 lines
22 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: lvm.c,v 1.261 2002/11/14 16:15:53 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Lua virtual machine
** See Copyright Notice in lua.h
*/
2001-02-07 21:13:49 +03:00
#include <stdarg.h>
#include <stdlib.h>
1997-09-16 23:25:59 +04:00
#include <string.h>
#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
/* function to convert a lua_Number to a string */
#ifndef lua_number2str
#include <stdio.h>
#define lua_number2str(s,n) sprintf((s), LUA_NUMBER_FMT, (n))
#endif
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
2001-06-05 23:41:24 +04:00
static void luaV_checkGC (lua_State *L, StkId top) {
if (G(L)->nblocks >= G(L)->GCthreshold) {
2002-01-26 01:14:54 +03:00
L->top = top; /* limit for active registers */
2001-06-05 23:41:24 +04:00
luaC_collectgarbage(L);
2002-01-26 01:14:54 +03:00
L->top = L->ci->top; /* restore old top position */
2001-06-05 23:41:24 +04:00
}
}
const TObject *luaV_tonumber (const TObject *obj, TObject *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[32]; /* 16 digits, sign, point and \0 (+ some extra...) */
2002-02-15 00:46:43 +03:00
lua_number2str(s, nvalue(obj));
2002-11-14 19:15:53 +03:00
setsvalue2s(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) {
lu_byte mask = L->hookmask;
2002-08-12 21:23:12 +04:00
if (mask > LUA_MASKLINE) { /* instruction-hook set? */
2002-07-08 22:21:33 +04:00
if (L->hookcount == 0) {
luaD_callhook(L, LUA_HOOKCOUNT, -1);
resethookcount(L);
return;
}
}
if (mask & LUA_MASKLINE) {
CallInfo *ci = L->ci;
Proto *p = ci_func(ci)->l.p;
int newline = getline(p, pcRel(*ci->u.l.pc, p));
if (!L->hookinit) {
luaG_inithooks(L);
return;
}
lua_assert(ci->state & CI_HASFRAME);
if (pcRel(*ci->u.l.pc, p) == 0) /* tracing may be starting now? */
ci->u.l.savedpc = *ci->u.l.pc; /* initialize `savedpc' */
2002-07-08 22:21:33 +04:00
/* calls linehook when enters a new line or jumps back (loop) */
if (*ci->u.l.pc <= ci->u.l.savedpc ||
2002-08-05 21:36:24 +04:00
newline != getline(p, pcRel(ci->u.l.savedpc, p))) {
2002-07-08 22:21:33 +04:00
luaD_callhook(L, LUA_HOOKLINE, newline);
ci = L->ci; /* previous call may reallocate `ci' */
}
ci->u.l.savedpc = *ci->u.l.pc;
}
2000-06-26 23:28:31 +04:00
}
2002-01-26 01:14:54 +03:00
static void callTMres (lua_State *L, const TObject *f,
const TObject *p1, const TObject *p2) {
setobj2s(L->top, f); /* push function */
setobj2s(L->top+1, p1); /* 1st argument */
setobj2s(L->top+2, p2); /* 2nd argument */
2002-01-26 01:14:54 +03:00
luaD_checkstack(L, 3); /* cannot check before (could invalidate p1, p2) */
L->top += 3;
luaD_call(L, L->top - 3, 1);
L->top--; /* result will be in L->top */
2002-01-26 01:14:54 +03:00
}
1997-09-16 23:25:59 +04:00
2001-06-15 23:17:33 +04:00
2001-12-05 23:15:18 +03:00
static void callTM (lua_State *L, const TObject *f,
2002-01-26 01:14:54 +03:00
const TObject *p1, const TObject *p2, const TObject *p3) {
setobj2s(L->top, f); /* push function */
setobj2s(L->top+1, p1); /* 1st argument */
setobj2s(L->top+2, p2); /* 2nd argument */
setobj2s(L->top+3, p3); /* 3th argument */
2002-01-26 01:14:54 +03:00
luaD_checkstack(L, 4); /* cannot check before (could invalidate p1...p3) */
L->top += 4;
luaD_call(L, L->top - 4, 0);
2001-02-07 21:13:49 +03:00
}
2002-07-05 22:27:39 +04:00
static const TObject *luaV_index (lua_State *L, const TObject *t,
TObject *key, int loop) {
const TObject *tm = fasttm(L, hvalue(t)->metatable, TM_INDEX);
if (tm == NULL) return &luaO_nilobject; /* no TM */
2002-08-05 21:36:24 +04:00
if (ttisfunction(tm)) {
2002-07-05 22:27:39 +04:00
callTMres(L, tm, t, key);
return L->top;
}
else return luaV_gettable(L, tm, key, loop);
}
static const TObject *luaV_getnotable (lua_State *L, const TObject *t,
TObject *key, int loop) {
const TObject *tm = luaT_gettmbyobj(L, t, TM_INDEX);
2002-08-05 21:36:24 +04:00
if (ttisnil(tm))
2002-07-05 22:27:39 +04:00
luaG_typeerror(L, t, "index");
2002-08-05 21:36:24 +04:00
if (ttisfunction(tm)) {
2002-07-05 22:27:39 +04:00
callTMres(L, tm, t, key);
return L->top;
}
else return luaV_gettable(L, tm, key, loop);
}
1997-09-16 23:25:59 +04:00
/*
** Function to index a table.
** Receives the table at `t' and the key at `key'.
** leaves the result at `res'.
1997-09-16 23:25:59 +04:00
*/
2002-07-05 22:27:39 +04:00
const TObject *luaV_gettable (lua_State *L, const TObject *t, TObject *key,
int loop) {
if (loop > MAXTAGLOOP)
luaG_runerror(L, "loop in gettable");
2002-08-05 21:36:24 +04:00
if (ttistable(t)) { /* `t' is a table? */
2002-07-05 22:27:39 +04:00
Table *h = hvalue(t);
const TObject *v = luaH_get(h, key); /* do a primitive get */
2002-08-05 21:36:24 +04:00
if (!ttisnil(v)) return v;
2002-07-05 22:27:39 +04:00
else return luaV_index(L, t, key, loop+1);
}
else return luaV_getnotable(L, t, key, loop+1);
1997-09-16 23:25:59 +04:00
}
/*
2001-02-07 21:13:49 +03:00
** Receives table at `t', key at `key' and value at `val'.
1997-09-16 23:25:59 +04:00
*/
void luaV_settable (lua_State *L, const TObject *t, TObject *key, StkId val) {
2001-12-05 23:15:18 +03:00
const TObject *tm;
2002-02-06 01:39:12 +03:00
int loop = 0;
2002-06-14 21:21:32 +04:00
do {
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);
TObject *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? */
2002-11-14 19:15:53 +03:00
setobj2t(oldval, val); /* write barrier */
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)) {
2002-06-14 21:21:32 +04:00
callTM(L, tm, t, key, val);
return;
2001-12-05 23:15:18 +03:00
}
2002-06-14 21:21:32 +04:00
t = tm; /* else repeat with `tm' */
} while (++loop <= MAXTAGLOOP);
luaG_runerror(L, "loop in settable");
1997-09-16 23:25:59 +04:00
}
2001-02-07 21:13:49 +03:00
static int call_binTM (lua_State *L, const TObject *p1, const TObject *p2,
StkId res, TMS event) {
ptrdiff_t result = savestack(L, res);
2001-12-05 23:15:18 +03:00
const TObject *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 */
2002-08-05 21:36:24 +04:00
if (!ttisfunction(tm)) return 0;
callTMres(L, tm, p1, p2);
res = restorestack(L, result); /* previous call may change stack */
setobjs2s(res, L->top);
2000-08-10 23:50:47 +04:00
return 1;
1997-09-16 23:25:59 +04:00
}
static int luaV_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 TObject *l, const TObject *r) {
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 nvalue(l) < nvalue(r);
2002-08-05 21:36:24 +04:00
else if (ttisstring(l))
return luaV_strcmp(tsvalue(l), tsvalue(r)) < 0;
2002-06-24 19:07:21 +04:00
else if (call_binTM(L, l, r, L->top, TM_LT))
return !l_isfalse(L->top);
2002-06-24 19:07:21 +04:00
return luaG_ordererror(L, l, r);
}
static int luaV_lessequal (lua_State *L, const TObject *l, const TObject *r) {
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 nvalue(l) <= nvalue(r);
2002-08-05 21:36:24 +04:00
else if (ttisstring(l))
return luaV_strcmp(tsvalue(l), tsvalue(r)) <= 0;
2002-06-24 19:07:21 +04:00
else if (call_binTM(L, l, r, L->top, TM_LE)) /* first try `le' */
return !l_isfalse(L->top);
else if (call_binTM(L, r, l, L->top, TM_LT)) /* else try `lt' */
return l_isfalse(L->top);
2002-06-24 19:07:21 +04:00
return luaG_ordererror(L, l, r);
1997-09-16 23:25:59 +04:00
}
2002-06-13 17:39:55 +04:00
int luaV_equalval (lua_State *L, const TObject *t1, const TObject *t2) {
const TObject *tm = NULL;
lua_assert(ttype(t1) == ttype(t2));
switch (ttype(t1)) {
case LUA_TNIL: return 1;
case LUA_TNUMBER: return nvalue(t1) == nvalue(t2);
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;
else if ((tm = fasttm(L, uvalue(t1)->uv.metatable, TM_EQ)) == NULL &&
(tm = fasttm(L, uvalue(t2)->uv.metatable, TM_EQ)) == NULL)
return 0; /* no TM */
else break; /* will try TM */
}
case LUA_TTABLE: {
2002-06-13 17:39:55 +04:00
if (hvalue(t1) == hvalue(t2)) return 1;
else if ((tm = fasttm(L, hvalue(t1)->metatable, TM_EQ)) == NULL &&
(tm = fasttm(L, hvalue(t2)->metatable, TM_EQ)) == NULL)
return 0; /* no TM */
else break; /* will try TM */
}
default: return gcvalue(t1) == gcvalue(t2);
2002-06-13 17:39:55 +04:00
}
callTMres(L, tm, t1, t2); /* call TM */
2002-06-13 17:39:55 +04:00
return !l_isfalse(L->top);
}
2002-06-03 18:08:43 +04:00
void luaV_concat (lua_State *L, int total, int last) {
2000-03-09 03:19:22 +03:00
do {
StkId top = L->ci->base + last + 1;
2000-03-09 03:19:22 +03:00
int n = 2; /* number of elements handled in this pass (at least 2) */
2002-02-07 20:24:05 +03:00
if (!tostring(L, 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)->tsv.len > 0) { /* if len=0, do nothing */
2000-03-17 16:09:12 +03:00
/* at least two string values; get as many as possible */
2001-08-31 23:46:07 +04:00
lu_mem tl = cast(lu_mem, tsvalue(top-1)->tsv.len) +
cast(lu_mem, tsvalue(top-2)->tsv.len);
char *buffer;
2000-03-09 03:19:22 +03:00
int i;
2002-02-07 20:24:05 +03:00
while (n < total && tostring(L, top-n-1)) { /* collect total length */
tl += tsvalue(top-n-1)->tsv.len;
2000-03-09 03:19:22 +03:00
n++;
}
2002-05-15 22:57:44 +04:00
if (tl > MAX_SIZET) luaG_runerror(L, "string size overflow");
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)->tsv.len;
memcpy(buffer+tl, svalue(top-i), l);
2000-03-09 03:19:22 +03:00
tl += l;
}
setsvalue2s(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 */
last -= n-1;
2000-03-09 03:19:22 +03:00
} while (total > 1); /* repeat until only 1 result left */
}
static void Arith (lua_State *L, StkId ra,
const TObject *rb, const TObject *rc, TMS op) {
TObject tempb, tempc;
2002-06-24 18:11:14 +04:00
const TObject *b, *c;
if ((b = luaV_tonumber(rb, &tempb)) != NULL &&
(c = luaV_tonumber(rc, &tempc)) != NULL) {
switch (op) {
case TM_ADD: setnvalue(ra, nvalue(b) + nvalue(c)); break;
case TM_SUB: setnvalue(ra, nvalue(b) - nvalue(c)); break;
case TM_MUL: setnvalue(ra, nvalue(b) * nvalue(c)); break;
case TM_DIV: setnvalue(ra, nvalue(b) / nvalue(c)); break;
case TM_POW: {
const TObject *f = luaH_getstr(hvalue(registry(L)),
G(L)->tmname[TM_POW]);
ptrdiff_t res = savestack(L, ra);
2002-08-05 21:36:24 +04:00
if (!ttisfunction(f))
2002-06-24 18:11:14 +04:00
luaG_runerror(L, "`pow' (for `^' operator) is not a function");
callTMres(L, f, b, c);
ra = restorestack(L, res); /* previous call may change stack */
setobjs2s(ra, L->top);
2002-06-24 18:11:14 +04:00
break;
}
default: lua_assert(0); break;
}
}
2002-06-24 18:11:14 +04:00
else if (!call_binTM(L, rb, rc, ra, op))
luaG_aritherror(L, rb, rc);
}
2000-09-20 21:57:08 +04:00
/*
** some macros for common tasks in `luaV_execute'
*/
2001-12-20 18:13:38 +03:00
#define runtime_check(L, c) { if (!(c)) return 0; }
#define RA(i) (base+GETARG_A(i))
#define RB(i) (base+GETARG_B(i))
#define RKB(i) ((GETARG_B(i) < MAXSTACK) ? RB(i) : k+GETARG_B(i)-MAXSTACK)
#define RC(i) (base+GETARG_C(i))
#define RKC(i) ((GETARG_C(i) < MAXSTACK) ? RC(i) : k+GETARG_C(i)-MAXSTACK)
#define KBx(i) (k+GETARG_Bx(i))
#define dojump(pc, i) ((pc) += (i))
2000-09-20 21:57:08 +04:00
2002-01-10 01:02:47 +03:00
StkId luaV_execute (lua_State *L) {
StkId base;
LClosure *cl;
TObject *k;
const Instruction *pc;
callentry: /* entry point when calling new functions */
L->ci->u.l.pb = &base;
L->ci->u.l.pc = &pc;
if (L->hookmask & LUA_MASKCALL)
luaD_callhook(L, LUA_HOOKCALL, -1);
retentry: /* entry point when returning to old functions */
lua_assert(L->ci->state & CI_SAVEDPC);
L->ci->state = CI_HASFRAME; /* activate frame */
pc = L->ci->u.l.savedpc;
base = L->ci->base;
cl = &clvalue(base - 1)->l;
k = cl->p->k;
2000-06-26 23:28:31 +04:00
/* main loop of interpreter */
1998-12-03 18:45:15 +03:00
for (;;) {
2000-06-29 00:21:06 +04:00
const Instruction i = *pc++;
2002-08-07 18:24:24 +04:00
StkId ra;
2002-07-08 22:21:33 +04:00
if (L->hookmask >= LUA_MASKLINE &&
(--L->hookcount == 0 || L->hookmask & LUA_MASKLINE))
2002-08-05 21:36:24 +04:00
traceexec(L);
2002-08-07 18:24:24 +04:00
/* warning!! several calls may realloc the stack and invalidate `ra' */
ra = RA(i);
2002-01-26 01:14:54 +03:00
lua_assert(L->top <= L->stack + L->stacksize && L->top >= L->ci->base);
lua_assert(L->top == L->ci->top ||
GET_OPCODE(i) == OP_CALL || GET_OPCODE(i) == OP_TAILCALL ||
GET_OPCODE(i) == OP_RETURN || GET_OPCODE(i) == OP_SETLISTO);
2000-02-14 19:51:08 +03:00
switch (GET_OPCODE(i)) {
case OP_MOVE: {
setobjs2s(ra, RB(i));
break;
2000-08-14 21:45:59 +04:00
}
case OP_LOADK: {
setobj2s(ra, KBx(i));
break;
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)) pc++; /* skip next instruction (if C) */
break;
}
case OP_LOADNIL: {
TObject *rb = RB(i);
do {
2001-06-08 16:29:27 +04:00
setnilvalue(rb--);
} while (rb >= ra);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_GETUPVAL: {
int b = GETARG_B(i);
setobj2s(ra, cl->upvals[b]->v);
break;
}
2000-08-14 21:45:59 +04:00
case OP_GETGLOBAL: {
TObject *rb = KBx(i);
2002-07-05 22:27:39 +04:00
const TObject *v;
2002-08-05 21:36:24 +04:00
lua_assert(ttisstring(rb) && ttistable(&cl->g));
2002-07-05 22:27:39 +04:00
v = luaH_getstr(hvalue(&cl->g), tsvalue(rb));
if (!ttisnil(v)) { setobj2s(ra, v); }
2002-07-05 22:27:39 +04:00
else
setobj2s(RA(i), luaV_index(L, &cl->g, rb, 0));
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_GETTABLE: {
2002-07-05 22:27:39 +04:00
StkId rb = RB(i);
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
if (ttistable(rb)) {
2002-07-05 22:27:39 +04:00
const TObject *v = luaH_get(hvalue(rb), rc);
if (!ttisnil(v)) { setobj2s(ra, v); }
2002-07-05 22:27:39 +04:00
else
setobj2s(RA(i), luaV_index(L, rb, rc, 0));
2002-07-05 22:27:39 +04:00
}
else
setobj2s(RA(i), luaV_getnotable(L, rb, rc, 0));
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_SETGLOBAL: {
2002-08-05 21:36:24 +04:00
lua_assert(ttisstring(KBx(i)) && ttistable(&cl->g));
luaV_settable(L, &cl->g, KBx(i), ra);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_SETUPVAL: {
int b = GETARG_B(i);
2002-11-14 19:15:53 +03:00
setobj(cl->upvals[b]->v, ra); /* write barrier */
break;
}
2000-08-14 21:45:59 +04:00
case OP_SETTABLE: {
luaV_settable(L, ra, RKB(i), RKC(i));
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_NEWTABLE: {
2001-10-25 23:14:14 +04:00
int b = GETARG_B(i);
if (b > 0) b = twoto(b-1);
sethvalue(ra, luaH_new(L, b, GETARG_C(i)));
2001-06-05 23:41:24 +04:00
luaV_checkGC(L, ra+1);
1997-09-16 23:25:59 +04:00
break;
}
case OP_SELF: {
StkId rb = RB(i);
2002-07-05 22:27:39 +04:00
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
runtime_check(L, ttisstring(rc));
setobjs2s(ra+1, rb);
2002-08-05 21:36:24 +04:00
if (ttistable(rb)) {
2002-07-05 22:27:39 +04:00
const TObject *v = luaH_getstr(hvalue(rb), tsvalue(rc));
if (!ttisnil(v)) { setobj2s(ra, v); }
2002-07-05 22:27:39 +04:00
else
setobj2s(RA(i), luaV_index(L, rb, rc, 0));
2002-07-05 22:27:39 +04:00
}
else
setobj2s(RA(i), luaV_getnotable(L, rb, rc, 0));
1997-09-16 23:25:59 +04:00
break;
}
2000-08-14 21:45:59 +04:00
case OP_ADD: {
TObject *rb = RKB(i);
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
if (ttisnumber(rb) && ttisnumber(rc)) {
2002-06-24 18:11:14 +04:00
setnvalue(ra, nvalue(rb) + nvalue(rc));
}
else
Arith(L, ra, rb, rc, TM_ADD);
2000-02-22 16:31:43 +03:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_SUB: {
TObject *rb = RKB(i);
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
if (ttisnumber(rb) && ttisnumber(rc)) {
2002-06-24 18:11:14 +04:00
setnvalue(ra, nvalue(rb) - nvalue(rc));
}
else
Arith(L, ra, rb, rc, TM_SUB);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_MUL: {
TObject *rb = RKB(i);
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
if (ttisnumber(rb) && ttisnumber(rc)) {
2002-06-24 18:11:14 +04:00
setnvalue(ra, nvalue(rb) * nvalue(rc));
}
else
Arith(L, ra, rb, rc, TM_MUL);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_DIV: {
TObject *rb = RKB(i);
TObject *rc = RKC(i);
2002-08-05 21:36:24 +04:00
if (ttisnumber(rb) && ttisnumber(rc)) {
2002-06-24 18:11:14 +04:00
setnvalue(ra, nvalue(rb) / nvalue(rc));
}
else
Arith(L, ra, rb, rc, TM_DIV);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_POW: {
Arith(L, ra, RKB(i), RKC(i), TM_POW);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_UNM: {
const TObject *rb = RB(i);
2002-06-24 18:11:14 +04:00
TObject temp;
if (tonumber(rb, &temp)) {
setnvalue(ra, -nvalue(rb));
}
else {
setnilvalue(&temp);
2002-06-24 18:11:14 +04:00
if (!call_binTM(L, RB(i), &temp, ra, TM_UNM))
luaG_aritherror(L, RB(i), &temp);
1997-09-16 23:25:59 +04:00
}
break;
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);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_CONCAT: {
int b = GETARG_B(i);
int c = GETARG_C(i);
2002-06-03 18:08:43 +04:00
luaV_concat(L, c-b+1, c); /* may change `base' (and `ra') */
setobjs2s(RA(i), base+b);
2002-01-26 01:14:54 +03:00
luaV_checkGC(L, base+c+1);
break;
2000-08-14 21:45:59 +04:00
}
case OP_JMP: {
dojump(pc, GETARG_sBx(i));
break;
2000-08-14 21:45:59 +04:00
}
2002-08-21 22:56:33 +04:00
case OP_EQ: {
if (equalobj(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
else dojump(pc, GETARG_sBx(*pc) + 1);
break;
2000-08-14 21:45:59 +04:00
}
case OP_LT: {
if (luaV_lessthan(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
else dojump(pc, GETARG_sBx(*pc) + 1);
break;
}
case OP_LE: {
if (luaV_lessequal(L, RKB(i), RKC(i)) != GETARG_A(i)) pc++;
else dojump(pc, GETARG_sBx(*pc) + 1);
break;
2000-08-14 21:45:59 +04:00
}
case OP_TEST: {
TObject *rb = RB(i);
if (l_isfalse(rb) == GETARG_C(i)) pc++;
else {
setobjs2s(ra, rb);
dojump(pc, GETARG_sBx(*pc) + 1);
}
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
2002-08-05 21:36:24 +04:00
case OP_CALL:
case OP_TAILCALL: {
2001-12-20 18:13:38 +03:00
StkId firstResult;
int b = GETARG_B(i);
2002-01-10 01:02:47 +03:00
int nresults;
if (b != 0) L->top = ra+b; /* else previous instruction set top */
nresults = GETARG_C(i) - 1;
2001-12-20 18:13:38 +03:00
firstResult = luaD_precall(L, ra);
if (firstResult) {
2002-01-26 01:14:54 +03:00
if (firstResult > L->top) { /* yield? */
2002-08-05 21:36:24 +04:00
(L->ci - 1)->u.l.savedpc = pc;
(L->ci - 1)->state = CI_SAVEDPC;
2002-11-06 22:08:00 +03:00
L->ci->state |= CI_YIELD;
2002-01-10 01:02:47 +03:00
return NULL;
}
2001-12-20 18:13:38 +03:00
/* it was a C function (`precall' called it); adjust results */
2002-01-10 01:02:47 +03:00
luaD_poscall(L, nresults, firstResult);
if (nresults >= 0) L->top = L->ci->top;
2001-12-20 18:13:38 +03:00
}
2002-08-05 21:36:24 +04:00
else { /* it is a Lua function */
if (GET_OPCODE(i) == OP_CALL) { /* regular call? */
(L->ci-1)->u.l.savedpc = pc; /* save `pc' to return later */
(L->ci-1)->state = (CI_SAVEDPC | CI_CALLING);
2002-08-05 21:36:24 +04:00
}
else { /* tail call: put new frame in place of previous one */
int aux;
StkId ra1 = RA(i); /* `luaD_precall' may change the stack */
if (L->openupval) luaF_close(L, base);
for (aux = 0; ra1+aux < L->top; aux++) /* move frame down */
setobjs2s(base+aux-1, ra1+aux);
2002-08-05 21:36:24 +04:00
(L->ci - 1)->top = L->top = base+aux; /* correct top */
lua_assert(L->ci->state & CI_SAVEDPC);
2002-08-05 21:36:24 +04:00
(L->ci - 1)->u.l.savedpc = L->ci->u.l.savedpc;
(L->ci - 1)->state = CI_SAVEDPC;
2002-08-05 21:36:24 +04:00
L->ci--; /* remove previous frame */
}
goto callentry;
}
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
case OP_RETURN: {
2002-08-05 21:36:24 +04:00
CallInfo *ci = L->ci - 1;
int b = GETARG_B(i);
2002-01-10 01:02:47 +03:00
if (b != 0) L->top = ra+b-1;
lua_assert(L->ci->state & CI_HASFRAME);
2002-08-05 21:36:24 +04:00
if (L->openupval) luaF_close(L, base);
L->ci->state = CI_SAVEDPC; /* deactivate current function */
L->ci->u.l.savedpc = pc;
/* previous function was running `here'? */
if (!(ci->state & CI_CALLING))
2002-01-26 01:14:54 +03:00
return ra; /* no: return */
2002-08-05 21:36:24 +04:00
else { /* yes: continue its execution (go through) */
2002-01-10 01:02:47 +03:00
int nresults;
2002-08-07 18:24:24 +04:00
lua_assert(ttisfunction(ci->base - 1));
lua_assert(ci->state & CI_SAVEDPC);
2002-08-07 18:24:24 +04:00
lua_assert(GET_OPCODE(*(ci->u.l.savedpc - 1)) == OP_CALL);
nresults = GETARG_C(*(ci->u.l.savedpc - 1)) - 1;
2002-01-10 01:02:47 +03:00
luaD_poscall(L, nresults, ra);
if (nresults >= 0) L->top = L->ci->top;
goto retentry;
2001-12-20 18:13:38 +03:00
}
}
2002-02-06 01:39:12 +03:00
case OP_FORLOOP: {
lua_Number step, index, limit;
2002-03-05 00:33:09 +03:00
const TObject *plimit = ra+1;
const TObject *pstep = ra+2;
2002-08-05 21:36:24 +04:00
if (!ttisnumber(ra))
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "`for' initial value must be a number");
2002-03-05 00:33:09 +03:00
if (!tonumber(plimit, ra+1))
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "`for' limit must be a number");
2002-03-05 00:33:09 +03:00
if (!tonumber(pstep, ra+2))
2002-05-15 22:57:44 +04:00
luaG_runerror(L, "`for' step must be a number");
2002-03-05 00:33:09 +03:00
step = nvalue(pstep);
2002-02-06 01:39:12 +03:00
index = nvalue(ra) + step; /* increment index */
2002-03-05 00:33:09 +03:00
limit = nvalue(plimit);
if (step > 0 ? index <= limit : index >= limit) {
dojump(pc, GETARG_sBx(i)); /* jump back */
2002-02-06 01:39:12 +03:00
chgnvalue(ra, index); /* update index */
}
break;
}
case OP_TFORLOOP: {
setobjs2s(ra+4, ra+2);
setobjs2s(ra+3, ra+1);
setobjs2s(ra+2, ra);
L->top = ra+5;
luaD_call(L, ra+2, GETARG_C(i) + 1);
L->top = L->ci->top;
2002-08-07 18:24:24 +04:00
if (ttisnil(RA(i)+2)) pc++; /* skip jump (break loop) */
else dojump(pc, GETARG_sBx(*pc) + 1); /* else jump back */
break;
}
2002-07-05 22:27:39 +04:00
case OP_TFORPREP: { /* for compatibility only */
2002-08-05 21:36:24 +04:00
if (ttistable(ra)) {
setobjs2s(ra+1, ra);
setobj2s(ra, luaH_getstr(hvalue(gt(L)), luaS_new(L, "next")));
}
dojump(pc, GETARG_sBx(i));
2000-04-12 22:57:19 +04:00
break;
}
case OP_SETLIST:
case OP_SETLISTO: {
int bc;
int n;
2001-10-25 23:14:14 +04:00
Table *h;
2002-08-05 21:36:24 +04:00
runtime_check(L, ttistable(ra));
h = hvalue(ra);
bc = GETARG_Bx(i);
if (GET_OPCODE(i) == OP_SETLIST)
n = (bc&(LFIELDS_PER_FLUSH-1)) + 1;
2002-01-03 20:42:57 +03:00
else {
n = L->top - ra - 1;
2002-01-03 20:42:57 +03:00
L->top = L->ci->top;
}
bc &= ~(LFIELDS_PER_FLUSH-1); /* bc = bc - bc%FPF */
for (; n > 0; n--)
2002-11-14 19:15:53 +03:00
setobj2t(luaH_setnum(L, h, bc+n), ra+n); /* write barrier */
break;
}
case OP_CLOSE: {
luaF_close(L, ra);
break;
}
2000-08-14 21:45:59 +04:00
case OP_CLOSURE: {
Proto *p;
Closure *ncl;
int nup, j;
p = cl->p->p[GETARG_Bx(i)];
nup = p->nupvalues;
ncl = luaF_newLclosure(L, nup, &cl->g);
2001-10-02 20:45:03 +04:00
ncl->l.p = p;
for (j=0; j<nup; j++, pc++) {
2001-10-02 20:45:03 +04:00
if (GET_OPCODE(*pc) == OP_GETUPVAL)
ncl->l.upvals[j] = cl->upvals[GETARG_B(*pc)];
else {
lua_assert(GET_OPCODE(*pc) == OP_MOVE);
ncl->l.upvals[j] = luaF_findupval(L, base + GETARG_B(*pc));
}
}
setclvalue(ra, ncl);
2002-01-26 01:14:54 +03:00
luaV_checkGC(L, L->top);
1997-09-16 23:25:59 +04:00
break;
2000-08-14 21:45:59 +04:00
}
1997-09-16 23:25:59 +04:00
}
2000-10-06 16:45:25 +04:00
}
1997-09-16 23:25:59 +04:00
}