lua/ldo.c

345 lines
8.8 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: ldo.c,v 1.91 2000/08/29 20:43:28 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Stack and Call structure of Lua
** See Copyright Notice in lua.h
*/
#include <setjmp.h>
1999-12-02 19:41:29 +03:00
#include <stdio.h>
1997-11-07 18:09:49 +03:00
#include <stdlib.h>
1997-09-16 23:25:59 +04:00
#include <string.h>
#include "lua.h"
1999-03-10 17:23:07 +03:00
#include "lauxlib.h"
#include "ldebug.h"
1997-09-16 23:25:59 +04:00
#include "ldo.h"
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
#include "lparser.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
1997-09-16 23:25:59 +04:00
#include "ltm.h"
#include "lundump.h"
#include "lvm.h"
#include "lzio.h"
/* space to handle stack overflow errors */
#define EXTRA_STACK (2*LUA_MINSTACK)
void luaD_init (lua_State *L, int stacksize) {
L->stack = luaM_newvector(L, stacksize+EXTRA_STACK, TObject);
L->stack_last = L->stack+(stacksize-1);
L->stacksize = stacksize;
2000-08-28 21:57:04 +04:00
L->Cbase = L->top = L->stack;
1997-09-16 23:25:59 +04:00
}
void luaD_checkstack (lua_State *L, int n) {
1999-12-01 22:50:08 +03:00
if (L->stack_last-L->top <= n) { /* stack overflow? */
if (L->stack_last-L->stack > (L->stacksize-1)) {
1999-12-01 22:50:08 +03:00
/* overflow while handling overflow: do what?? */
L->top -= EXTRA_STACK;
2000-03-03 17:58:26 +03:00
lua_error(L, "BAD STACK OVERFLOW! DATA CORRUPTED!");
1999-12-01 22:50:08 +03:00
}
else {
L->stack_last += EXTRA_STACK; /* to be used by error message */
2000-08-30 00:43:28 +04:00
lua_error(L, "stack overflow");
1997-09-16 23:25:59 +04:00
}
}
}
1999-12-01 22:50:08 +03:00
static void restore_stack_limit (lua_State *L) {
2000-08-28 21:57:04 +04:00
if (L->top - L->stack < L->stacksize - 1)
L->stack_last = L->stack + (L->stacksize-1);
1999-12-01 22:50:08 +03:00
}
1997-09-16 23:25:59 +04:00
/*
1999-12-01 22:50:08 +03:00
** Adjust stack. Set top to base+extra, pushing NILs if needed.
** (we cannot add base+extra unless we are sure it fits in the stack;
** otherwise the result of such operation on pointers is undefined)
1997-09-16 23:25:59 +04:00
*/
1999-12-01 22:50:08 +03:00
void luaD_adjusttop (lua_State *L, StkId base, int extra) {
int diff = extra-(L->top-base);
1997-09-16 23:25:59 +04:00
if (diff <= 0)
1999-12-01 22:50:08 +03:00
L->top = base+extra;
1997-09-16 23:25:59 +04:00
else {
luaD_checkstack(L, diff);
1997-09-16 23:25:59 +04:00
while (diff--)
2000-03-10 21:37:44 +03:00
ttype(L->top++) = TAG_NIL;
1997-09-16 23:25:59 +04:00
}
}
/*
1999-12-01 22:50:08 +03:00
** Open a hole inside the stack at `pos'
1997-09-16 23:25:59 +04:00
*/
2000-08-29 18:48:16 +04:00
static void luaD_openstack (lua_State *L, StkId pos) {
int i = L->top-pos;
while (i--) pos[i+1] = pos[i];
1997-09-16 23:25:59 +04:00
incr_top;
}
static void dohook (lua_State *L, lua_Debug *ar, lua_Hook hook) {
StkId old_Cbase = L->Cbase;
StkId old_top = L->Cbase = L->top;
luaD_checkstack(L, LUA_MINSTACK); /* assures minimum stack size */
L->allowhooks = 0; /* cannot call hooks inside a hook */
(*hook)(L, ar);
LUA_ASSERT(L->allowhooks == 0, "invalid allow");
L->allowhooks = 1;
L->top = old_top;
L->Cbase = old_Cbase;
}
2000-06-29 00:21:06 +04:00
void luaD_lineHook (lua_State *L, StkId func, int line, lua_Hook linehook) {
if (L->allowhooks) {
2000-03-30 21:19:48 +04:00
lua_Debug ar;
2000-01-19 15:00:45 +03:00
ar._func = func;
ar.event = "line";
ar.currentline = line;
dohook(L, &ar, linehook);
}
1997-09-16 23:25:59 +04:00
}
2000-03-30 21:19:48 +04:00
static void luaD_callHook (lua_State *L, StkId func, lua_Hook callhook,
2000-01-19 15:00:45 +03:00
const char *event) {
if (L->allowhooks) {
2000-03-30 21:19:48 +04:00
lua_Debug ar;
2000-01-19 15:00:45 +03:00
ar._func = func;
ar.event = event;
dohook(L, &ar, callhook);
1997-09-16 23:25:59 +04:00
}
}
static StkId callCclosure (lua_State *L, const struct Closure *cl, StkId base) {
2000-05-30 23:00:31 +04:00
int nup = cl->nupvalues; /* number of upvalues */
2000-08-28 21:57:04 +04:00
StkId old_Cbase = L->Cbase;
int n;
2000-08-28 21:57:04 +04:00
L->Cbase = base; /* new base for C function */
2000-08-30 00:43:28 +04:00
luaD_checkstack(L, nup+LUA_MINSTACK); /* assures minimum stack size */
for (n=0; n<nup; n++) /* copy upvalues as extra arguments */
*(L->top++) = cl->upvalue[n];
n = (*cl->f.c)(L); /* do the actual call */
2000-08-28 21:57:04 +04:00
L->Cbase = old_Cbase; /* restore old C base */
return L->top - n; /* return index of first result */
1997-09-16 23:25:59 +04:00
}
void luaD_callTM (lua_State *L, const TObject *f, int nParams, int nResults) {
1999-12-01 22:50:08 +03:00
StkId base = L->top - nParams;
luaD_openstack(L, base);
*base = *f;
luaD_call(L, base, nResults);
1997-09-16 23:25:59 +04:00
}
/*
** Call a function (C or Lua). The function to be called is at *func.
** The arguments are on the stack, right after the function.
** When returns, the results are on the stack, starting at the original
** function position.
2000-08-29 18:48:16 +04:00
** The number of results is nResults, unless nResults=LUA_MULTRET.
*/
1999-12-01 22:50:08 +03:00
void luaD_call (lua_State *L, StkId func, int nResults) {
1997-09-16 23:25:59 +04:00
StkId firstResult;
2000-03-30 21:19:48 +04:00
lua_Hook callhook = L->callhook;
retry: /* for `function' tag method */
switch (ttype(func)) {
2000-03-10 21:37:44 +03:00
case TAG_LCLOSURE: {
2000-06-26 23:28:31 +04:00
CallInfo ci;
ci.func = clvalue(func);
2000-06-29 00:21:06 +04:00
ci.line = 0;
2000-03-31 00:55:50 +04:00
ttype(func) = TAG_LMARK;
2000-06-26 23:28:31 +04:00
infovalue(func) = &ci;
if (callhook)
luaD_callHook(L, func, callhook, "call");
2000-06-26 23:28:31 +04:00
firstResult = luaV_execute(L, ci.func, func+1);
break;
}
2000-03-10 21:37:44 +03:00
case TAG_CCLOSURE: {
2000-03-31 00:55:50 +04:00
ttype(func) = TAG_CMARK;
if (callhook)
luaD_callHook(L, func, callhook, "call");
firstResult = callCclosure(L, clvalue(func), func+1);
break;
}
default: { /* `func' is not a function; check the `function' tag method */
const TObject *im = luaT_getimbyObj(L, func, IM_FUNCTION);
2000-03-10 21:37:44 +03:00
if (ttype(im) == TAG_NIL)
2000-08-10 23:50:47 +04:00
luaG_typeerror(L, func, "call");
luaD_openstack(L, func);
*func = *im; /* tag method is the new function to be called */
goto retry; /* retry the call */
}
1997-09-16 23:25:59 +04:00
}
if (callhook) /* same hook that was active at entry */
2000-01-19 15:00:45 +03:00
luaD_callHook(L, func, callhook, "return");
1997-09-16 23:25:59 +04:00
/* adjust the number of results */
2000-08-29 18:48:16 +04:00
if (nResults == LUA_MULTRET)
1999-12-01 22:50:08 +03:00
nResults = L->top - firstResult;
else
1999-12-01 22:50:08 +03:00
luaD_adjusttop(L, firstResult, nResults);
/* move results to `func' (to erase parameters and function) */
while (nResults) {
*func++ = *(L->top - nResults);
nResults--;
}
L->top = func;
1998-07-12 20:14:34 +04:00
}
1997-09-16 23:25:59 +04:00
static void message (lua_State *L, const char *s) {
2000-05-09 18:50:16 +04:00
const TObject *em = luaH_getglobal(L, LUA_ERRORMESSAGE);
if (*luaO_typename(em) == 'f') {
1999-12-01 22:50:08 +03:00
*L->top = *em;
incr_top;
lua_pushstring(L, s);
1999-12-01 22:50:08 +03:00
luaD_call(L, L->top-2, 0);
1997-09-16 23:25:59 +04:00
}
}
void luaD_breakrun (lua_State *L, int errcode) {
if (L->errorJmp) {
L->errorJmp->status = errcode;
longjmp(L->errorJmp->b, 1);
}
else {
if (errcode != LUA_ERRMEM)
message(L, "unable to recover; exiting\n");
exit(1);
}
}
1997-09-16 23:25:59 +04:00
/*
1999-12-27 20:33:22 +03:00
** Reports an error, and jumps up to the available recovery label
1997-09-16 23:25:59 +04:00
*/
void lua_error (lua_State *L, const char *s) {
if (s) message(L, s);
luaD_breakrun(L, LUA_ERRRUN);
}
static void chain_longjmp (lua_State *L, struct lua_longjmp *lj) {
2000-08-28 21:57:04 +04:00
lj->status = 0;
lj->base = L->Cbase;
lj->previous = L->errorJmp;
L->errorJmp = lj;
}
2000-08-28 21:57:04 +04:00
static int restore_longjmp (lua_State *L, struct lua_longjmp *lj) {
L->Cbase = lj->base;
L->errorJmp = lj->previous;
2000-08-28 21:57:04 +04:00
return lj->status;
1997-09-16 23:25:59 +04:00
}
/*
2000-08-28 21:57:04 +04:00
** Execute a protected call.
1997-09-16 23:25:59 +04:00
*/
2000-08-28 21:57:04 +04:00
int lua_call (lua_State *L, int nargs, int nresults) {
StkId func = L->top - (nargs+1); /* function to be called */
1999-05-10 17:54:01 +04:00
struct lua_longjmp myErrorJmp;
chain_longjmp(L, &myErrorJmp);
1999-05-10 17:54:01 +04:00
if (setjmp(myErrorJmp.b) == 0) {
2000-08-28 21:57:04 +04:00
luaD_call(L, func, nresults);
1997-09-16 23:25:59 +04:00
}
2000-08-28 21:57:04 +04:00
else { /* an error occurred: restore the state */
L->top = func; /* remove garbage from the stack */
1999-12-01 22:50:08 +03:00
restore_stack_limit(L);
1997-09-16 23:25:59 +04:00
}
2000-08-28 21:57:04 +04:00
return restore_longjmp(L, &myErrorJmp);
1997-09-16 23:25:59 +04:00
}
/*
** returns 0 = chunk loaded; >0 : error; -1 = no more chunks to load
1997-09-16 23:25:59 +04:00
*/
static int protectedparser (lua_State *L, ZIO *z, int bin) {
1999-05-10 17:54:01 +04:00
struct lua_longjmp myErrorJmp;
chain_longjmp(L, &myErrorJmp);
1999-05-10 17:54:01 +04:00
if (setjmp(myErrorJmp.b) == 0) {
Proto *tf = bin ? luaU_undump1(L, z) : luaY_parser(L, z);
2000-08-28 21:57:04 +04:00
if (tf == NULL)
myErrorJmp.status = -1; /* `natural' end */
luaV_Lclosure(L, tf, 0);
1997-09-16 23:25:59 +04:00
}
2000-08-28 21:57:04 +04:00
else { /* an error occurred: correct error code */
if (myErrorJmp.status == LUA_ERRRUN)
myErrorJmp.status = LUA_ERRSYNTAX;
1997-09-16 23:25:59 +04:00
}
2000-08-28 21:57:04 +04:00
return restore_longjmp(L, &myErrorJmp); /* error code */
1997-09-16 23:25:59 +04:00
}
static int do_main (lua_State *L, ZIO *z, int bin) {
1997-09-16 23:25:59 +04:00
int status;
do {
2000-05-24 17:54:49 +04:00
unsigned long old_blocks;
luaC_checkGC(L);
old_blocks = L->nblocks;
status = protectedparser(L, z, bin);
if (status > 0) return status; /* error */
else if (status < 0) return 0; /* `natural' end */
1997-09-16 23:25:59 +04:00
else {
unsigned long newelems2 = 2*(L->nblocks-old_blocks);
L->GCthreshold += newelems2;
2000-08-28 21:57:04 +04:00
status = lua_call(L, 0, LUA_MULTRET);
L->GCthreshold -= newelems2;
1997-09-16 23:25:59 +04:00
}
} while (bin && status == 0);
return status;
}
int lua_dofile (lua_State *L, const char *filename) {
1997-09-16 23:25:59 +04:00
ZIO z;
int status;
2000-01-13 18:56:03 +03:00
int bin; /* flag for file mode */
int c; /* look ahead char */
char source[MAXFILENAME];
2000-01-13 18:56:03 +03:00
FILE *f = (filename == NULL) ? stdin : fopen(filename, "r");
if (f == NULL) return 2; /* unable to open file */
1999-03-11 21:59:19 +03:00
luaL_filesource(source, filename, sizeof(source));
2000-01-13 18:56:03 +03:00
c = fgetc(f);
ungetc(c, f);
bin = (c == ID_CHUNK);
if (bin && f != stdin) {
f = freopen(filename, "rb", f); /* set binary mode */
if (f == NULL) return 2; /* unable to reopen file */
}
luaZ_Fopen(&z, f, source);
status = do_main(L, &z, bin);
1997-09-16 23:25:59 +04:00
if (f != stdin)
fclose(f);
return status;
}
int lua_dostring (lua_State *L, const char *str) {
return lua_dobuffer(L, str, strlen(str), str);
1997-09-16 23:25:59 +04:00
}
2000-05-24 17:54:49 +04:00
int lua_dobuffer (lua_State *L, const char *buff, size_t size,
const char *name) {
ZIO z;
if (!name) name = "?";
1998-06-19 22:47:06 +04:00
luaZ_mopen(&z, buff, size, name);
return do_main(L, &z, buff[0]==ID_CHUNK);
}
1998-06-01 02:22:00 +04:00