lua/ldo.c

401 lines
10 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: ldo.c,v 1.120 2001/02/01 17:40:48 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"
#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)
static void restore_stack_limit (lua_State *L) {
StkId limit = L->stack+(L->stacksize-EXTRA_STACK)-1;
if (L->top < limit)
L->stack_last = limit;
}
void luaD_init (lua_State *L, int stacksize) {
stacksize += EXTRA_STACK;
L->stack = luaM_newvector(L, stacksize, TObject);
L->stacksize = stacksize;
2000-08-28 21:57:04 +04:00
L->Cbase = L->top = L->stack;
restore_stack_limit(L);
1997-09-16 23:25:59 +04:00
}
void luaD_checkstack (lua_State *L, int n) {
2000-10-06 16:45:25 +04:00
if (L->stack_last - L->top <= n) { /* stack overflow? */
if (L->stack_last == L->stack+L->stacksize-1) {
/* overflow while handling overflow */
luaD_breakrun(L, LUA_ERRERR); /* break run without error message */
1999-12-01 22:50:08 +03:00
}
else {
L->stack_last += EXTRA_STACK; /* to be used by error message */
lua_assert(L->stack_last == L->stack+L->stacksize-1);
luaD_error(L, "stack overflow");
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--)
setnilvalue(L->top++);
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--) setobj(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;
2000-10-05 16:14:08 +04:00
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
L->allowhooks = 0; /* cannot call hooks inside a hook */
LUA_UNLOCK(L);
(*hook)(L, ar);
LUA_LOCK(L);
lua_assert(L->allowhooks == 0);
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-10-06 16:45:25 +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;
2000-10-06 16:45:25 +04:00
infovalue(func)->pc = NULL; /* function is not active */
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-10-05 16:14:08 +04:00
luaD_checkstack(L, nup+LUA_MINSTACK); /* ensure minimum stack size */
for (n=0; n<nup; n++) /* copy upvalues as extra arguments */
setobj(L->top++, &cl->upvalue[n]);
LUA_UNLOCK(L);
n = (*cl->f.c)(L); /* do the actual call */
LUA_LOCK(L);
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, Closure *f, int nParams, int nResults) {
1999-12-01 22:50:08 +03:00
StkId base = L->top - nParams;
luaD_openstack(L, base);
setclvalue(base, f);
1999-12-01 22:50:08 +03:00
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) {
2000-10-06 16:45:25 +04:00
lua_Hook callhook;
1997-09-16 23:25:59 +04:00
StkId firstResult;
2000-10-05 16:14:08 +04:00
CallInfo ci;
Closure *cl;
if (ttype(func) != LUA_TFUNCTION) {
/* `func' is not a function; check the `function' tag method */
Closure *tm = luaT_gettmbyObj(G(L), func, TM_FUNCTION);
if (tm == NULL)
2000-10-05 16:14:08 +04:00
luaG_typeerror(L, func, "call");
luaD_openstack(L, func);
setclvalue(func, tm); /* tag method is the new function to be called */
1997-09-16 23:25:59 +04:00
}
2000-10-05 16:14:08 +04:00
cl = clvalue(func);
ci.func = cl;
setivalue(func, &ci);
2000-10-06 16:45:25 +04:00
callhook = L->callhook;
if (callhook)
luaD_callHook(L, func, callhook, "call");
firstResult = (cl->isC ? callCclosure(L, cl, func+1) :
luaV_execute(L, cl, func+1));
if (callhook) /* same hook that was active at entry */
luaD_callHook(L, func, callhook, "return");
lua_assert(ttype(func) == LUA_TMARK);
/* move results to `func' (to erase parameters and function) */
2000-10-06 16:45:25 +04:00
if (nResults == LUA_MULTRET) {
while (firstResult < L->top) /* copy all results */
setobj(func++, firstResult++);
2000-10-06 16:45:25 +04:00
L->top = func;
}
else { /* copy at most `nResults' */
for (; nResults > 0 && firstResult < L->top; nResults--)
setobj(func++, firstResult++);
2000-10-06 16:45:25 +04:00
L->top = func;
for (; nResults > 0; nResults--) { /* if there are not enough results */
setnilvalue(L->top); /* adjust the stack */
2000-10-06 16:45:25 +04:00
incr_top; /* must check stack space */
}
}
2000-10-02 18:47:43 +04:00
luaC_checkGC(L);
1998-07-12 20:14:34 +04:00
}
1997-09-16 23:25:59 +04:00
/*
2000-09-25 20:22:42 +04:00
** Execute a protected call.
1997-09-16 23:25:59 +04:00
*/
2000-09-25 20:22:42 +04:00
struct CallS { /* data to `f_call' */
StkId func;
int nresults;
};
static void f_call (lua_State *L, void *ud) {
struct CallS *c = (struct CallS *)ud;
luaD_call(L, c->func, c->nresults);
}
2000-10-20 20:39:03 +04:00
LUA_API int lua_call (lua_State *L, int nargs, int nresults) {
StkId func;
2000-09-25 20:22:42 +04:00
struct CallS c;
int status;
LUA_LOCK(L);
func = L->top - (nargs+1); /* function to be called */
2000-09-25 20:22:42 +04:00
c.func = func; c.nresults = nresults;
status = luaD_runprotected(L, f_call, &c);
if (status != 0) /* an error occurred? */
L->top = func; /* remove parameters from the stack */
LUA_UNLOCK(L);
2000-09-25 20:22:42 +04:00
return status;
1997-09-16 23:25:59 +04:00
}
/*
2000-09-25 20:22:42 +04:00
** Execute a protected parser.
1997-09-16 23:25:59 +04:00
*/
struct SParser { /* data to `f_parser' */
2000-09-25 20:22:42 +04:00
ZIO *z;
int bin;
};
static void f_parser (lua_State *L, void *ud) {
struct SParser *p = (struct SParser *)ud;
2000-09-25 20:22:42 +04:00
Proto *tf = p->bin ? luaU_undump(L, p->z) : luaY_parser(L, p->z);
luaV_Lclosure(L, tf, 0);
1997-09-16 23:25:59 +04:00
}
static int protectedparser (lua_State *L, ZIO *z, int bin) {
struct SParser p;
mem_int old_blocks;
2000-09-25 20:22:42 +04:00
int status;
LUA_LOCK(L);
2000-09-25 20:22:42 +04:00
p.z = z; p.bin = bin;
luaC_checkGC(L);
old_blocks = G(L)->nblocks;
2000-09-25 20:22:42 +04:00
status = luaD_runprotected(L, f_parser, &p);
if (status == 0) {
2000-10-05 16:14:08 +04:00
/* add new memory to threshold (as it probably will stay) */
lua_assert(G(L)->nblocks >= old_blocks);
G(L)->GCthreshold += (G(L)->nblocks - old_blocks);
}
else if (status == LUA_ERRRUN) /* an error occurred: correct error code */
2000-09-25 20:22:42 +04:00
status = LUA_ERRSYNTAX;
LUA_UNLOCK(L);
2000-09-25 20:22:42 +04:00
return status;
1997-09-16 23:25:59 +04:00
}
static int parse_file (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 */
FILE *f = (filename == NULL) ? stdin : fopen(filename, "r");
if (f == NULL) return LUA_ERRFILE; /* unable to open file */
2000-01-13 18:56:03 +03:00
c = fgetc(f);
ungetc(c, f);
bin = (c == ID_CHUNK);
if (bin && f != stdin) {
fclose(f);
f = fopen(filename, "rb"); /* reopen in binary mode */
if (f == NULL) return LUA_ERRFILE; /* unable to reopen file */
}
2001-01-10 19:58:11 +03:00
lua_pushliteral(L, "@");
lua_pushstring(L, (filename == NULL) ? "(stdin)" : filename);
lua_concat(L, 2);
filename = lua_tostring(L, -1); /* filename = '@'..filename */
2000-10-09 17:47:32 +04:00
luaZ_Fopen(&z, f, filename);
status = protectedparser(L, &z, bin);
lua_remove(L, -2); /* remove filename */
1997-09-16 23:25:59 +04:00
if (f != stdin)
fclose(f);
return status;
}
2000-10-20 20:39:03 +04:00
LUA_API int lua_dofile (lua_State *L, const char *filename) {
int status;
status = parse_file(L, filename);
if (status == 0) /* parse OK? */
status = lua_call(L, 0, LUA_MULTRET); /* call main */
return status;
1997-09-16 23:25:59 +04:00
}
static int parse_buffer (lua_State *L, const char *buff, size_t size,
const char *name) {
ZIO z;
int status;
if (!name) name = "?";
1998-06-19 22:47:06 +04:00
luaZ_mopen(&z, buff, size, name);
status = protectedparser(L, &z, buff[0]==ID_CHUNK);
return status;
}
LUA_API int lua_dobuffer (lua_State *L, const char *buff, size_t size, const char *name) {
int status;
status = parse_buffer(L, buff, size, name);
if (status == 0) /* parse OK? */
status = lua_call(L, 0, LUA_MULTRET); /* call main */
return status;
}
2000-10-20 20:39:03 +04:00
LUA_API int lua_dostring (lua_State *L, const char *str) {
return lua_dobuffer(L, str, strlen(str), str);
}
1998-06-01 02:22:00 +04:00
2000-09-25 20:22:42 +04:00
/*
** {======================================================
** Error-recover functions (based on long jumps)
** =======================================================
*/
/* chain list of long jump buffers */
struct lua_longjmp {
jmp_buf b;
struct lua_longjmp *previous;
volatile int status; /* error code */
};
static void message (lua_State *L, const char *s) {
const TObject *em = luaH_getstr(L->gt, luaS_newliteral(L, LUA_ERRORMESSAGE));
2000-10-05 16:14:08 +04:00
if (ttype(em) == LUA_TFUNCTION) {
setobj(L->top, em);
2000-09-25 20:22:42 +04:00
incr_top;
setsvalue(L->top, luaS_new(L, s));
incr_top;
2000-09-25 20:22:42 +04:00
luaD_call(L, L->top-2, 0);
}
}
/*
** Reports an error, and jumps up to the available recovery label
*/
void luaD_error (lua_State *L, const char *s) {
2000-09-25 20:22:42 +04:00
if (s) message(L, s);
luaD_breakrun(L, LUA_ERRRUN);
}
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(EXIT_FAILURE);
}
}
int luaD_runprotected (lua_State *L, void (*f)(lua_State *, void *), void *ud) {
StkId oldCbase = L->Cbase;
StkId oldtop = L->top;
struct lua_longjmp lj;
2000-10-02 18:47:43 +04:00
int allowhooks = L->allowhooks;
2000-09-25 20:22:42 +04:00
lj.status = 0;
lj.previous = L->errorJmp; /* chain new error handler */
L->errorJmp = &lj;
if (setjmp(lj.b) == 0)
(*f)(L, ud);
else { /* an error occurred: restore the state */
2000-10-02 18:47:43 +04:00
L->allowhooks = allowhooks;
2000-09-25 20:22:42 +04:00
L->Cbase = oldCbase;
L->top = oldtop;
restore_stack_limit(L);
}
L->errorJmp = lj.previous; /* restore old error handler */
return lj.status;
}
/* }====================================================== */