|
|
|
/*
|
|
|
|
** $Id: lvm.c,v 1.177 2001/03/26 14:31:49 roberto Exp roberto $
|
|
|
|
** Lua virtual machine
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdarg.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#define LUA_PRIVATE
|
|
|
|
#include "lua.h"
|
|
|
|
|
|
|
|
#include "lapi.h"
|
|
|
|
#include "ldebug.h"
|
|
|
|
#include "ldo.h"
|
|
|
|
#include "lfunc.h"
|
|
|
|
#include "lgc.h"
|
|
|
|
#include "lobject.h"
|
|
|
|
#include "lopcodes.h"
|
|
|
|
#include "lstate.h"
|
|
|
|
#include "lstring.h"
|
|
|
|
#include "ltable.h"
|
|
|
|
#include "ltm.h"
|
|
|
|
#include "lvm.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int luaV_tonumber (TObject *obj) {
|
|
|
|
if (ttype(obj) != LUA_TSTRING)
|
|
|
|
return 1;
|
|
|
|
else {
|
|
|
|
if (!luaO_str2d(svalue(obj), &nvalue(obj)))
|
|
|
|
return 2;
|
|
|
|
ttype(obj) = LUA_TNUMBER;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int luaV_tostring (lua_State *L, TObject *obj) {
|
|
|
|
if (ttype(obj) != LUA_TNUMBER)
|
|
|
|
return 1;
|
|
|
|
else {
|
|
|
|
l_char s[32]; /* 16 digits, sign, point and \0 (+ some extra...) */
|
|
|
|
lua_number2str(s, nvalue(obj)); /* convert `s' to number */
|
|
|
|
setsvalue(obj, luaS_new(L, s));
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void traceexec (lua_State *L, lua_Hook linehook) {
|
|
|
|
CallInfo *ci = L->ci;
|
|
|
|
int *lineinfo = ci_func(ci)->f.l->lineinfo;
|
|
|
|
int pc = (*ci->pc - ci_func(ci)->f.l->code) - 1;
|
|
|
|
int newline;
|
|
|
|
if (pc == 0) { /* may be first time? */
|
|
|
|
ci->line = 1;
|
|
|
|
ci->refi = 0;
|
|
|
|
ci->lastpc = pc+1; /* make sure it will call linehook */
|
|
|
|
}
|
|
|
|
newline = luaG_getline(lineinfo, pc, ci->line, &ci->refi);
|
|
|
|
/* calls linehook when enters a new line or jumps back (loop) */
|
|
|
|
if (newline != ci->line || pc <= ci->lastpc) {
|
|
|
|
ci->line = newline;
|
|
|
|
luaD_lineHook(L, newline, linehook);
|
|
|
|
}
|
|
|
|
ci->lastpc = pc;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static Closure *luaV_closure (lua_State *L, int nelems) {
|
|
|
|
Closure *c = luaF_newclosure(L, nelems);
|
|
|
|
L->top -= nelems;
|
|
|
|
while (nelems--)
|
|
|
|
setobj(&c->upvalue[nelems], L->top+nelems);
|
|
|
|
setclvalue(L->top, c);
|
|
|
|
incr_top;
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaV_Cclosure (lua_State *L, lua_CFunction c, int nelems) {
|
|
|
|
Closure *cl = luaV_closure(L, nelems);
|
|
|
|
cl->f.c = c;
|
|
|
|
cl->isC = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaV_Lclosure (lua_State *L, Proto *l, int nelems) {
|
|
|
|
Closure *cl = luaV_closure(L, nelems);
|
|
|
|
cl->f.l = l;
|
|
|
|
cl->isC = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void callTM (lua_State *L, const l_char *fmt, ...) {
|
|
|
|
va_list argp;
|
|
|
|
StkId base = L->top;
|
|
|
|
int has_result = 0;
|
|
|
|
va_start(argp, fmt);
|
|
|
|
while (*fmt) {
|
|
|
|
switch (*fmt++) {
|
|
|
|
case l_c('c'):
|
|
|
|
setclvalue(L->top, va_arg(argp, Closure *));
|
|
|
|
break;
|
|
|
|
case l_c('o'):
|
|
|
|
setobj(L->top, va_arg(argp, TObject *));
|
|
|
|
break;
|
|
|
|
case l_c('s'):
|
|
|
|
setsvalue(L->top, va_arg(argp, TString *));
|
|
|
|
break;
|
|
|
|
case l_c('r'):
|
|
|
|
has_result = 1;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
incr_top;
|
|
|
|
}
|
|
|
|
luaD_call(L, base, has_result);
|
|
|
|
if (has_result) {
|
|
|
|
L->top--;
|
|
|
|
setobj(va_arg(argp, TObject *), L->top);
|
|
|
|
}
|
|
|
|
va_end(argp);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Function to index a table.
|
|
|
|
** Receives the table at `t' and the key at the `key'.
|
|
|
|
** leaves the result at `res'.
|
|
|
|
*/
|
|
|
|
void luaV_gettable (lua_State *L, StkId t, TObject *key, StkId res) {
|
|
|
|
Closure *tm;
|
|
|
|
if (ttype(t) == LUA_TTABLE) { /* `t' is a table? */
|
|
|
|
int tg = hvalue(t)->htag;
|
|
|
|
if (tg == LUA_TTABLE || /* with default tag? */
|
|
|
|
(tm = luaT_gettm(G(L), tg, TM_GETTABLE)) == NULL) { /* or no TM? */
|
|
|
|
const TObject *h = luaH_get(hvalue(t), key); /* do a primitive get */
|
|
|
|
/* result is no nil or there is no `index' tag method? */
|
|
|
|
if (ttype(h) != LUA_TNIL || /* no nil? */
|
|
|
|
((tm=luaT_gettm(G(L), tg, TM_INDEX)) == NULL)) { /* or no index TM? */
|
|
|
|
setobj(res, h); /* default get */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* else will call the tag method */
|
|
|
|
}
|
|
|
|
else { /* not a table; try a `gettable' tag method */
|
|
|
|
tm = luaT_gettmbyObj(G(L), t, TM_GETTABLE);
|
|
|
|
if (tm == NULL) /* no tag method? */
|
|
|
|
luaG_typeerror(L, t, l_s("index"));
|
|
|
|
}
|
|
|
|
callTM(L, l_s("coor"), tm, t, key, res);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Receives table at `t', key at `key' and value at `val'.
|
|
|
|
*/
|
|
|
|
void luaV_settable (lua_State *L, StkId t, StkId key, StkId val) {
|
|
|
|
Closure *tm;
|
|
|
|
if (ttype(t) == LUA_TTABLE) { /* `t' is a table? */
|
|
|
|
int tg = hvalue(t)->htag;
|
|
|
|
if (hvalue(t)->htag == LUA_TTABLE || /* with default tag? */
|
|
|
|
(tm = luaT_gettm(G(L), tg, TM_SETTABLE)) == NULL) { /* or no TM? */
|
|
|
|
setobj(luaH_set(L, hvalue(t), key), val); /* do a primitive set */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/* else will call the tag method */
|
|
|
|
}
|
|
|
|
else { /* not a table; try a `settable' tag method */
|
|
|
|
tm = luaT_gettmbyObj(G(L), t, TM_SETTABLE);
|
|
|
|
if (tm == NULL) /* no tag method? */
|
|
|
|
luaG_typeerror(L, t, l_s("index"));
|
|
|
|
}
|
|
|
|
callTM(L, l_s("cooo"), tm, t, key, val);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaV_getglobal (lua_State *L, TString *name, StkId res) {
|
|
|
|
const TObject *value = luaH_getstr(L->gt, name);
|
|
|
|
Closure *tm;
|
|
|
|
if (!HAS_TM_GETGLOBAL(L, ttype(value)) || /* is there a tag method? */
|
|
|
|
(tm = luaT_gettmbyObj(G(L), value, TM_GETGLOBAL)) == NULL) {
|
|
|
|
setobj(res, value); /* default behavior */
|
|
|
|
}
|
|
|
|
else
|
|
|
|
callTM(L, l_s("csor"), tm, name, value, res);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaV_setglobal (lua_State *L, TString *name, StkId val) {
|
|
|
|
TObject *oldvalue = luaH_setstr(L, L->gt, name);
|
|
|
|
Closure *tm;
|
|
|
|
if (!HAS_TM_SETGLOBAL(L, ttype(oldvalue)) || /* no tag methods? */
|
|
|
|
(tm = luaT_gettmbyObj(G(L), oldvalue, TM_SETGLOBAL)) == NULL) {
|
|
|
|
setobj(oldvalue, val); /* raw set */
|
|
|
|
}
|
|
|
|
else
|
|
|
|
callTM(L, l_s("csoo"), tm, name, oldvalue, val);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int call_binTM (lua_State *L, const TObject *p1, const TObject *p2,
|
|
|
|
TObject *res, TMS event) {
|
|
|
|
TString *opname;
|
|
|
|
Closure *tm = luaT_gettmbyObj(G(L), p1, event); /* try first operand */
|
|
|
|
if (tm == NULL) {
|
|
|
|
tm = luaT_gettmbyObj(G(L), p2, event); /* try second operand */
|
|
|
|
if (tm == NULL) {
|
|
|
|
tm = luaT_gettm(G(L), 0, event); /* try a `global' method */
|
|
|
|
if (tm == NULL)
|
|
|
|
return 0; /* no tag method */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
opname = luaS_new(L, luaT_eventname[event]);
|
|
|
|
callTM(L, l_s("coosr"), tm, p1, p2, opname, res);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void call_arith (lua_State *L, StkId p1, TMS event) {
|
|
|
|
if (!call_binTM(L, p1, p1+1, p1, event))
|
|
|
|
luaG_binerror(L, p1, LUA_TNUMBER, l_s("perform arithmetic on"));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int luaV_strlessthan (const TString *ls, const TString *rs) {
|
|
|
|
const l_char *l = getstr(ls);
|
|
|
|
size_t ll = ls->len;
|
|
|
|
const l_char *r = getstr(rs);
|
|
|
|
size_t lr = rs->len;
|
|
|
|
for (;;) {
|
|
|
|
int temp = strcoll(l, r);
|
|
|
|
if (temp != 0) return (temp < 0);
|
|
|
|
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 0; /* l is equal or greater than r */
|
|
|
|
else if (len == ll) /* l is finished? */
|
|
|
|
return 1; /* l is smaller than r (because r is not finished) */
|
|
|
|
/* both strings longer than `len'; go on comparing (after the `\0') */
|
|
|
|
len++;
|
|
|
|
l += len; ll -= len; r += len; lr -= len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int luaV_lessthan (lua_State *L, const TObject *l, const TObject *r) {
|
|
|
|
if (ttype(l) == LUA_TNUMBER && ttype(r) == LUA_TNUMBER)
|
|
|
|
return (nvalue(l) < nvalue(r));
|
|
|
|
else if (ttype(l) == LUA_TSTRING && ttype(r) == LUA_TSTRING)
|
|
|
|
return luaV_strlessthan(tsvalue(l), tsvalue(r));
|
|
|
|
else { /* try TM */
|
|
|
|
if (!call_binTM(L, l, r, L->top, TM_LT))
|
|
|
|
luaG_ordererror(L, l, r);
|
|
|
|
return (ttype(L->top) != LUA_TNIL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void luaV_strconc (lua_State *L, int total, StkId top) {
|
|
|
|
do {
|
|
|
|
int n = 2; /* number of elements handled in this pass (at least 2) */
|
|
|
|
if (tostring(L, top-2) || tostring(L, top-1)) {
|
|
|
|
if (!call_binTM(L, top-2, top-1, top-2, TM_CONCAT))
|
|
|
|
luaG_binerror(L, top-2, LUA_TSTRING, l_s("concat"));
|
|
|
|
}
|
|
|
|
else if (tsvalue(top-1)->len > 0) { /* if len=0, do nothing */
|
|
|
|
/* at least two string values; get as many as possible */
|
|
|
|
lu_mem tl = (lu_mem)tsvalue(top-1)->len + (lu_mem)tsvalue(top-2)->len;
|
|
|
|
l_char *buffer;
|
|
|
|
int i;
|
|
|
|
while (n < total && !tostring(L, top-n-1)) { /* collect total length */
|
|
|
|
tl += tsvalue(top-n-1)->len;
|
|
|
|
n++;
|
|
|
|
}
|
|
|
|
if (tl > MAX_SIZET) luaD_error(L, l_s("string size overflow"));
|
|
|
|
buffer = luaO_openspace(L, tl, l_char);
|
|
|
|
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);
|
|
|
|
tl += l;
|
|
|
|
}
|
|
|
|
setsvalue(top-n, luaS_newlstr(L, buffer, tl));
|
|
|
|
}
|
|
|
|
total -= n-1; /* got `n' strings to create 1 new */
|
|
|
|
top -= n-1;
|
|
|
|
} while (total > 1); /* repeat until only 1 result left */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void luaV_pack (lua_State *L, StkId firstelem) {
|
|
|
|
int i;
|
|
|
|
Hash *htab = luaH_new(L, 0);
|
|
|
|
TObject *n;
|
|
|
|
for (i=0; firstelem+i<L->top; i++)
|
|
|
|
setobj(luaH_setnum(L, htab, i+1), firstelem+i);
|
|
|
|
/* store counter in field `n' */
|
|
|
|
n = luaH_setstr(L, htab, luaS_newliteral(L, l_s("n")));
|
|
|
|
setnvalue(n, i);
|
|
|
|
L->top = firstelem; /* remove elements from the stack */
|
|
|
|
sethvalue(L->top, htab);
|
|
|
|
incr_top;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void adjust_varargs (lua_State *L, StkId base, int nfixargs) {
|
|
|
|
int nvararg = (L->top-base) - nfixargs;
|
|
|
|
if (nvararg < 0)
|
|
|
|
luaD_adjusttop(L, base, nfixargs);
|
|
|
|
luaV_pack(L, base+nfixargs);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define dojump(pc, i) ((pc) += GETARG_S(i))
|
|
|
|
|
|
|
|
/*
|
|
|
|
** Executes the given Lua function. Parameters are between [base,top).
|
|
|
|
** Returns n such that the the results are between [n,top).
|
|
|
|
*/
|
|
|
|
StkId luaV_execute (lua_State *L, const Closure *cl, StkId base) {
|
|
|
|
const Proto *const tf = cl->f.l;
|
|
|
|
StkId top; /* keep top local, for performance */
|
|
|
|
const Instruction *pc = tf->code;
|
|
|
|
const lua_Hook linehook = L->linehook;
|
|
|
|
L->ci->pc = &pc;
|
|
|
|
if (tf->is_vararg) /* varargs? */
|
|
|
|
adjust_varargs(L, base, tf->numparams);
|
|
|
|
luaD_adjusttop(L, base, tf->maxstacksize);
|
|
|
|
top = base+tf->numparams+tf->is_vararg;
|
|
|
|
/* main loop of interpreter */
|
|
|
|
for (;;) {
|
|
|
|
const Instruction i = *pc++;
|
|
|
|
lua_assert(L->top == base+tf->maxstacksize);
|
|
|
|
if (linehook)
|
|
|
|
traceexec(L, linehook);
|
|
|
|
switch (GET_OPCODE(i)) {
|
|
|
|
case OP_RETURN: {
|
|
|
|
L->top = top;
|
|
|
|
return base+GETARG_U(i);
|
|
|
|
}
|
|
|
|
case OP_CALL: {
|
|
|
|
int nres = GETARG_B(i);
|
|
|
|
if (nres == MULT_RET) nres = LUA_MULTRET;
|
|
|
|
L->top = top;
|
|
|
|
luaD_call(L, base+GETARG_A(i), nres);
|
|
|
|
top = L->top;
|
|
|
|
L->top = base+tf->maxstacksize;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHNIL: {
|
|
|
|
int n = GETARG_U(i);
|
|
|
|
lua_assert(n>0);
|
|
|
|
do {
|
|
|
|
setnilvalue(top++);
|
|
|
|
} while (--n > 0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_POP: {
|
|
|
|
top -= GETARG_U(i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHINT: {
|
|
|
|
setnvalue(top, (lua_Number)GETARG_S(i));
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHSTRING: {
|
|
|
|
setsvalue(top, tf->kstr[GETARG_U(i)]);
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHNUM: {
|
|
|
|
setnvalue(top, tf->knum[GETARG_U(i)]);
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHNEGNUM: {
|
|
|
|
setnvalue(top, -tf->knum[GETARG_U(i)]);
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHUPVALUE: {
|
|
|
|
setobj(top++, &cl->upvalue[GETARG_U(i)]);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_GETLOCAL: {
|
|
|
|
setobj(top++, base+GETARG_U(i));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_GETGLOBAL: {
|
|
|
|
luaV_getglobal(L, tf->kstr[GETARG_U(i)], top);
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_GETTABLE: {
|
|
|
|
top--;
|
|
|
|
luaV_gettable(L, top-1, top, top-1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_GETDOTTED: {
|
|
|
|
setsvalue(top, tf->kstr[GETARG_U(i)]);
|
|
|
|
luaV_gettable(L, top-1, top, top-1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_GETINDEXED: {
|
|
|
|
luaV_gettable(L, top-1, base+GETARG_U(i), top-1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHSELF: {
|
|
|
|
setobj(top, top-1);
|
|
|
|
setsvalue(top+1, tf->kstr[GETARG_U(i)]);
|
|
|
|
luaV_gettable(L, top-1, top+1, top-1);
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_CREATETABLE: {
|
|
|
|
luaC_checkGC(L);
|
|
|
|
sethvalue(top, luaH_new(L, GETARG_U(i)));
|
|
|
|
top++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SETLOCAL: {
|
|
|
|
setobj(base+GETARG_U(i), --top);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SETGLOBAL: {
|
|
|
|
top--;
|
|
|
|
luaV_setglobal(L, tf->kstr[GETARG_U(i)], top);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SETTABLE: {
|
|
|
|
StkId t = top-GETARG_A(i);
|
|
|
|
luaV_settable(L, t, t+1, top-1);
|
|
|
|
top -= GETARG_B(i); /* pop values */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SETLIST: {
|
|
|
|
int aux = GETARG_A(i) * LFIELDS_PER_FLUSH;
|
|
|
|
TObject *t = base+GETARG_B(i);
|
|
|
|
Hash *h = hvalue(t);
|
|
|
|
int n;
|
|
|
|
for (n = top-t-1; n; n--)
|
|
|
|
setobj(luaH_setnum(L, h, n+aux), --top);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SETMAP: {
|
|
|
|
TObject *t = base+GETARG_U(i);
|
|
|
|
Hash *h = hvalue(t);
|
|
|
|
while (top-1 > t) {
|
|
|
|
top-=2;
|
|
|
|
setobj(luaH_set(L, h, top), top+1);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_ADD: {
|
|
|
|
if (tonumber(top-2) || tonumber(top-1))
|
|
|
|
call_arith(L, top-2, TM_ADD);
|
|
|
|
else
|
|
|
|
nvalue(top-2) += nvalue(top-1);
|
|
|
|
top--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_ADDI: {
|
|
|
|
if (tonumber(top-1)) {
|
|
|
|
setnvalue(top, (lua_Number)GETARG_S(i));
|
|
|
|
call_arith(L, top-1, TM_ADD);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
nvalue(top-1) += (lua_Number)GETARG_S(i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_SUB: {
|
|
|
|
if (tonumber(top-2) || tonumber(top-1))
|
|
|
|
call_arith(L, top-2, TM_SUB);
|
|
|
|
else
|
|
|
|
nvalue(top-2) -= nvalue(top-1);
|
|
|
|
top--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_MULT: {
|
|
|
|
if (tonumber(top-2) || tonumber(top-1))
|
|
|
|
call_arith(L, top-2, TM_MUL);
|
|
|
|
else
|
|
|
|
nvalue(top-2) *= nvalue(top-1);
|
|
|
|
top--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_DIV: {
|
|
|
|
if (tonumber(top-2) || tonumber(top-1))
|
|
|
|
call_arith(L, top-2, TM_DIV);
|
|
|
|
else
|
|
|
|
nvalue(top-2) /= nvalue(top-1);
|
|
|
|
top--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_POW: {
|
|
|
|
if (!call_binTM(L, top-2, top-1, top-2, TM_POW))
|
|
|
|
luaD_error(L, l_s("undefined operation"));
|
|
|
|
top--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_CONCAT: {
|
|
|
|
int n = GETARG_U(i);
|
|
|
|
luaV_strconc(L, n, top);
|
|
|
|
top -= n-1;
|
|
|
|
luaC_checkGC(L);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_MINUS: {
|
|
|
|
if (tonumber(top-1)) {
|
|
|
|
setnilvalue(top);
|
|
|
|
call_arith(L, top-1, TM_UNM);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
nvalue(top-1) = -nvalue(top-1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_NOT: {
|
|
|
|
ttype(top-1) =
|
|
|
|
(ttype(top-1) == LUA_TNIL) ? LUA_TNUMBER : LUA_TNIL;
|
|
|
|
nvalue(top-1) = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPNE: {
|
|
|
|
top -= 2;
|
|
|
|
if (!luaO_equalObj(top, top+1)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPEQ: {
|
|
|
|
top -= 2;
|
|
|
|
if (luaO_equalObj(top, top+1)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPLT: {
|
|
|
|
top -= 2;
|
|
|
|
if (luaV_lessthan(L, top, top+1)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPLE: { /* a <= b === !(b<a) */
|
|
|
|
top -= 2;
|
|
|
|
if (!luaV_lessthan(L, top+1, top)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPGT: { /* a > b === (b<a) */
|
|
|
|
top -= 2;
|
|
|
|
if (luaV_lessthan(L, top+1, top)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPGE: { /* a >= b === !(a<b) */
|
|
|
|
top -= 2;
|
|
|
|
if (!luaV_lessthan(L, top, top+1)) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPT: {
|
|
|
|
if (ttype(--top) != LUA_TNIL) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPF: {
|
|
|
|
if (ttype(--top) == LUA_TNIL) dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPONT: {
|
|
|
|
if (ttype(top-1) == LUA_TNIL) top--;
|
|
|
|
else dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMPONF: {
|
|
|
|
if (ttype(top-1) != LUA_TNIL) top--;
|
|
|
|
else dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_JMP: {
|
|
|
|
dojump(pc, i);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_PUSHNILJMP: {
|
|
|
|
setnilvalue(top++);
|
|
|
|
pc++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_FORPREP: {
|
|
|
|
int jmp = GETARG_S(i);
|
|
|
|
if (tonumber(top-1))
|
|
|
|
luaD_error(L, l_s("`for' step must be a number"));
|
|
|
|
if (tonumber(top-2))
|
|
|
|
luaD_error(L, l_s("`for' limit must be a number"));
|
|
|
|
if (tonumber(top-3))
|
|
|
|
luaD_error(L, l_s("`for' initial value must be a number"));
|
|
|
|
pc += -jmp; /* `jump' to loop end (delta is negated here) */
|
|
|
|
goto forloop; /* do not increment index */
|
|
|
|
}
|
|
|
|
case OP_FORLOOP: {
|
|
|
|
lua_assert(ttype(top-1) == LUA_TNUMBER);
|
|
|
|
lua_assert(ttype(top-2) == LUA_TNUMBER);
|
|
|
|
if (ttype(top-3) != LUA_TNUMBER)
|
|
|
|
luaD_error(L, l_s("`for' index must be a number"));
|
|
|
|
nvalue(top-3) += nvalue(top-1); /* increment index */
|
|
|
|
forloop:
|
|
|
|
if (nvalue(top-1) > 0 ?
|
|
|
|
nvalue(top-3) > nvalue(top-2) :
|
|
|
|
nvalue(top-3) < nvalue(top-2))
|
|
|
|
top -= 3; /* end loop: remove control variables */
|
|
|
|
else
|
|
|
|
dojump(pc, i); /* repeat loop */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_LFORPREP: {
|
|
|
|
int jmp = GETARG_S(i);
|
|
|
|
if (ttype(top-1) != LUA_TTABLE)
|
|
|
|
luaD_error(L, l_s("`for' table must be a table"));
|
|
|
|
top += 3; /* index,key,value */
|
|
|
|
setnvalue(top-3, -1); /* initial index */
|
|
|
|
setnilvalue(top-2);
|
|
|
|
setnilvalue(top-1);
|
|
|
|
pc += -jmp; /* `jump' to loop end (delta is negated here) */
|
|
|
|
/* go through */
|
|
|
|
}
|
|
|
|
case OP_LFORLOOP: {
|
|
|
|
Hash *t = hvalue(top-4);
|
|
|
|
int n = (int)nvalue(top-3);
|
|
|
|
lua_assert(ttype(top-3) == LUA_TNUMBER);
|
|
|
|
lua_assert(ttype(top-4) == LUA_TTABLE);
|
|
|
|
n = luaH_nexti(t, n);
|
|
|
|
if (n == -1) /* end loop? */
|
|
|
|
top -= 4; /* remove table, index, key, and value */
|
|
|
|
else {
|
|
|
|
Node *node = node(t, n);
|
|
|
|
setnvalue(top-3, n); /* index */
|
|
|
|
setkey2obj(top-2, node);
|
|
|
|
setobj(top-1, val(node));
|
|
|
|
dojump(pc, i); /* repeat loop */
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case OP_CLOSURE: {
|
|
|
|
int nup = GETARG_B(i);
|
|
|
|
luaC_checkGC(L);
|
|
|
|
L->top = top;
|
|
|
|
luaV_Lclosure(L, tf->kproto[GETARG_A(i)], nup);
|
|
|
|
top -= (nup-1);
|
|
|
|
L->top = base+tf->maxstacksize;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|