lua/ldo.c

459 lines
12 KiB
C
Raw Normal View History

1997-09-17 03:25:59 +08:00
/*
2002-01-19 01:39:06 +08:00
** $Id: ldo.c,v 1.154 2002/01/11 20:27:41 roberto Exp $
1997-09-17 03:25:59 +08:00
** Stack and Call structure of Lua
** See Copyright Notice in lua.h
*/
#include <setjmp.h>
1999-12-03 00:41:29 +08:00
#include <stdio.h>
1997-11-07 23:09:49 +08:00
#include <stdlib.h>
1997-09-17 03:25:59 +08:00
#include <string.h>
#include "lua.h"
#include "ldebug.h"
1997-09-17 03:25:59 +08:00
#include "ldo.h"
#include "lfunc.h"
1997-09-17 03:25:59 +08:00
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
2002-01-10 06:02:47 +08:00
#include "lopcodes.h"
1997-09-17 03:25:59 +08:00
#include "lparser.h"
#include "lstate.h"
#include "lstring.h"
#include "ltable.h"
1997-09-17 03:25:59 +08:00
#include "ltm.h"
#include "lundump.h"
#include "lvm.h"
#include "lzio.h"
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;
}
2001-06-06 03:41:24 +08:00
void luaD_stackerror (lua_State *L) {
if (L->stack_last == L->stack+L->stacksize-1) {
/* overflow while handling overflow */
luaD_breakrun(L, LUA_ERRERR); /* break run without error message */
}
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-17 03:25:59 +08:00
}
}
/*
1999-12-02 03:50:08 +08:00
** Open a hole inside the stack at `pos'
1997-09-17 03:25:59 +08:00
*/
2000-08-29 22:48:16 +08: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-17 03:25:59 +08:00
incr_top;
}
static void dohook (lua_State *L, lua_Debug *ar, lua_Hook hook) {
StkId old_top = L->top;
2000-10-05 20:14:08 +08:00
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
L->allowhooks = 0; /* cannot call hooks inside a hook */
2001-03-03 01:27:50 +08:00
lua_unlock(L);
(*hook)(L, ar);
2001-03-03 01:27:50 +08:00
lua_lock(L);
lua_assert(L->allowhooks == 0);
L->allowhooks = 1;
L->top = old_top;
}
void luaD_lineHook (lua_State *L, int line, lua_Hook linehook) {
if (L->allowhooks) {
2000-03-31 01:19:48 +08:00
lua_Debug ar;
ar.event = "line";
2001-12-20 23:13:38 +08:00
ar._ci = L->ci - L->base_ci;
2000-01-19 20:00:45 +08:00
ar.currentline = line;
dohook(L, &ar, linehook);
}
1997-09-17 03:25:59 +08:00
}
2001-12-20 23:13:38 +08:00
void luaD_callHook (lua_State *L, lua_Hook callhook, const char *event) {
if (L->allowhooks) {
2000-03-31 01:19:48 +08:00
lua_Debug ar;
2000-01-19 20:00:45 +08:00
ar.event = event;
2001-12-20 23:13:38 +08:00
ar._ci = L->ci - L->base_ci;
2002-01-04 01:42:57 +08:00
L->ci->pc = NULL; /* function is not active */
dohook(L, &ar, callhook);
1997-09-17 03:25:59 +08:00
}
}
2001-12-20 23:13:38 +08:00
static CallInfo *growci (lua_State *L) {
lua_assert(L->ci == L->end_ci);
luaM_reallocvector(L, L->base_ci, L->size_ci, 2*L->size_ci, CallInfo);
L->ci = L->base_ci + L->size_ci;
L->size_ci *= 2;
L->end_ci = L->base_ci + L->size_ci;
return L->ci;
}
2002-01-10 06:02:47 +08:00
static void adjust_varargs (lua_State *L, StkId base, int nfixargs) {
int i;
Table *htab;
TObject n, nname;
StkId firstvar = base + nfixargs; /* position of first vararg */
if (L->top < firstvar) {
luaD_checkstack(L, firstvar - L->top);
while (L->top < firstvar)
setnilvalue(L->top++);
}
htab = luaH_new(L, 0, 0);
for (i=0; firstvar+i<L->top; i++)
luaH_setnum(L, htab, i+1, firstvar+i);
/* store counter in field `n' */
setnvalue(&n, i);
setsvalue(&nname, luaS_newliteral(L, "n"));
luaH_set(L, htab, &nname, &n);
L->top = firstvar; /* remove elements from the stack */
sethvalue(L->top, htab);
incr_top;
}
2001-12-20 23:13:38 +08:00
StkId luaD_precall (lua_State *L, StkId func) {
CallInfo *ci;
2002-01-10 06:02:47 +08:00
LClosure *cl;
2001-12-20 23:13:38 +08:00
if (ttype(func) != LUA_TFUNCTION) {
/* `func' is not a function; check the `function' tag method */
const TObject *tm = luaT_gettmbyobj(L, func, TM_CALL);
if (ttype(tm) != LUA_TFUNCTION)
luaG_typeerror(L, func, "call");
luaD_openstack(L, func);
setobj(func, tm); /* tag method is the new function to be called */
}
2002-01-10 06:02:47 +08:00
ci = ++L->ci;
if (L->ci == L->end_ci) ci = growci(L);
2001-12-20 23:13:38 +08:00
ci->base = func+1;
if (L->callhook)
luaD_callHook(L, L->callhook, "call");
2002-01-10 06:02:47 +08:00
cl = &clvalue(func)->l;
if (!cl->isC) { /* Lua function? prepare its call */
StkId base = func+1;
Proto *p = cl->p;
ci->savedpc = p->code; /* starting point */
if (p->is_vararg) /* varargs? */
adjust_varargs(L, base, p->numparams);
if (base > L->stack_last - p->maxstacksize)
luaD_stackerror(L);
2002-01-19 01:39:06 +08:00
ci->line = 0;
2002-01-10 06:02:47 +08:00
ci->top = base + p->maxstacksize;
while (L->top < ci->top)
setnilvalue(L->top++);
L->top = ci->top;
return NULL;
}
else { /* if is a C function, call it */
int n;
ci->savedpc = NULL;
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
lua_unlock(L);
#if LUA_COMPATUPVALUES
2002-01-10 06:02:47 +08:00
lua_pushupvalues(L);
#endif
2002-01-10 06:02:47 +08:00
n = (*clvalue(func)->c.f)(L); /* do the actual call */
lua_lock(L);
return L->top - n;
}
2001-12-20 23:13:38 +08:00
}
void luaD_poscall (lua_State *L, int wanted, StkId firstResult) {
StkId res;
if (L->callhook)
luaD_callHook(L, L->callhook, "return");
res = L->ci->base - 1; /* `func' = final position of 1st result */
L->ci--;
/* move results to correct place */
while (wanted != 0 && firstResult < L->top) {
setobj(res++, firstResult++);
wanted--;
}
while (wanted-- > 0)
setnilvalue(res++);
L->top = res;
luaC_checkGC(L);
1997-09-17 03:25:59 +08: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, all the results are on the stack, starting at the original
** function position.
*/
2001-12-20 23:13:38 +08:00
void luaD_call (lua_State *L, StkId func, int nResults) {
StkId firstResult = luaD_precall(L, func);
2002-01-10 06:02:47 +08:00
if (firstResult == NULL) { /* is a Lua function? */
firstResult = luaV_execute(L); /* call it */
if (firstResult == NULL) {
luaD_poscall(L, 0, L->top);
luaD_error(L, "attempt to `yield' across tag-method/C-call boundary");
}
}
2001-12-20 23:13:38 +08:00
luaD_poscall(L, nResults, firstResult);
1998-07-13 00:14:34 +08:00
}
1997-09-17 03:25:59 +08:00
2002-01-10 06:02:47 +08:00
LUA_API void lua_cobegin (lua_State *L, int nargs) {
lua_lock(L);
luaD_precall(L, L->top - (nargs+1));
2002-01-10 06:02:47 +08:00
lua_unlock(L);
}
static void resume_results (lua_State *L, lua_State *from, int numresults) {
while (numresults) {
setobj(L->top, from->top - numresults);
numresults--;
incr_top;
}
}
2002-01-10 06:02:47 +08:00
LUA_API void lua_resume (lua_State *L, lua_State *co) {
StkId firstResult;
lua_lock(L);
if (co->ci->savedpc == NULL) /* no activation record? */
luaD_error(L, "thread is dead - cannot be resumed");
lua_assert(co->errorJmp == NULL);
co->errorJmp = L->errorJmp;
firstResult = luaV_execute(co);
if (firstResult != NULL) { /* `return'? */
resume_results(L, co, co->top - firstResult);
luaD_poscall(co, 0, firstResult); /* ends this coroutine */
}
2002-01-10 06:02:47 +08:00
else { /* `yield' */
int nresults = GETARG_C(*((co->ci-1)->savedpc - 1)) - 1;
resume_results(L, co, co->ci->yield_results);
2002-01-10 06:02:47 +08:00
luaD_poscall(co, nresults, co->top); /* complete it */
if (nresults >= 0) co->top = co->ci->top;
}
co->errorJmp = NULL;
lua_unlock(L);
}
LUA_API int lua_yield (lua_State *L, int nresults) {
CallInfo *ci;
int ibase;
lua_lock(L);
ci = L->ci;
if (ci_func(ci-1)->c.isC)
2002-01-10 06:02:47 +08:00
luaD_error(L, "cannot `yield' a C function");
ci->yield_results = nresults; /* very dirty trick! */
ibase = L->top - (ci-1)->base;
2002-01-10 06:02:47 +08:00
lua_unlock(L);
return ibase;
}
1997-09-17 03:25:59 +08:00
/*
2000-09-26 00:22:42 +08:00
** Execute a protected call.
1997-09-17 03:25:59 +08:00
*/
2000-09-26 00:22:42 +08:00
struct CallS { /* data to `f_call' */
StkId func;
int nresults;
};
static void f_call (lua_State *L, void *ud) {
2001-09-01 03:46:07 +08:00
struct CallS *c = cast(struct CallS *, ud);
2001-12-20 23:13:38 +08:00
luaD_call(L, c->func, c->nresults);
}
2000-10-21 00:39:03 +08:00
LUA_API int lua_call (lua_State *L, int nargs, int nresults) {
StkId func;
2000-09-26 00:22:42 +08:00
struct CallS c;
int status;
2001-03-03 01:27:50 +08:00
lua_lock(L);
func = L->top - (nargs+1); /* function to be called */
2000-09-26 00:22:42 +08:00
c.func = func; c.nresults = nresults;
status = luaD_runprotected(L, f_call, &c);
if (status != 0) { /* an error occurred? */
luaF_close(L, func); /* close eventual pending closures */
2000-09-26 00:22:42 +08:00
L->top = func; /* remove parameters from the stack */
}
2001-03-03 01:27:50 +08:00
lua_unlock(L);
2000-09-26 00:22:42 +08:00
return status;
1997-09-17 03:25:59 +08:00
}
/*
2000-09-26 00:22:42 +08:00
** Execute a protected parser.
1997-09-17 03:25:59 +08:00
*/
struct SParser { /* data to `f_parser' */
2000-09-26 00:22:42 +08:00
ZIO *z;
int bin;
};
static void f_parser (lua_State *L, void *ud) {
2001-09-01 03:46:07 +08:00
struct SParser *p = cast(struct SParser *, ud);
2000-09-26 00:22:42 +08:00
Proto *tf = p->bin ? luaU_undump(L, p->z) : luaY_parser(L, p->z);
Closure *cl = luaF_newLclosure(L, 0);
2001-10-03 00:45:03 +08:00
cl->l.p = tf;
setclvalue(L->top, cl);
incr_top;
1997-09-17 03:25:59 +08:00
}
static int protectedparser (lua_State *L, ZIO *z, int bin) {
struct SParser p;
2001-02-21 02:15:33 +08:00
lu_mem old_blocks;
2000-09-26 00:22:42 +08:00
int status;
2001-03-03 01:27:50 +08:00
lua_lock(L);
2000-09-26 00:22:42 +08:00
p.z = z; p.bin = bin;
/* before parsing, give a (good) chance to GC */
if (G(L)->nblocks/8 >= G(L)->GCthreshold/10)
luaC_collectgarbage(L);
old_blocks = G(L)->nblocks;
2000-09-26 00:22:42 +08:00
status = luaD_runprotected(L, f_parser, &p);
if (status == 0) {
2000-10-05 20:14:08 +08: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-26 00:22:42 +08:00
status = LUA_ERRSYNTAX;
2001-03-03 01:27:50 +08:00
lua_unlock(L);
2000-09-26 00:22:42 +08:00
return status;
1997-09-17 03:25:59 +08:00
}
LUA_API int lua_loadfile (lua_State *L, const char *filename) {
1997-09-17 03:25:59 +08:00
ZIO z;
int status;
2000-01-13 23:56:03 +08:00
int bin; /* flag for file mode */
int nlevel; /* level on the stack of filename */
FILE *f = (filename == NULL) ? stdin : fopen(filename, "r");
if (f == NULL) return LUA_ERRFILE; /* unable to open file */
2001-07-17 04:24:48 +08:00
bin = (ungetc(getc(f), f) == LUA_SIGNATURE[0]);
2000-01-13 23:56:03 +08:00
if (bin && f != stdin) {
fclose(f);
f = fopen(filename, "rb"); /* reopen in binary mode */
if (f == NULL) return LUA_ERRFILE; /* unable to reopen file */
}
lua_pushliteral(L, "@");
lua_pushstring(L, (filename == NULL) ? "(stdin)" : filename);
lua_concat(L, 2);
nlevel = lua_gettop(L);
2001-02-23 02:59:59 +08:00
filename = lua_tostring(L, -1); /* filename = `@'..filename */
2000-10-09 21:47:32 +08:00
luaZ_Fopen(&z, f, filename);
status = protectedparser(L, &z, bin);
lua_remove(L, nlevel); /* remove filename */
1997-09-17 03:25:59 +08:00
if (f != stdin)
fclose(f);
return status;
}
LUA_API int lua_loadbuffer (lua_State *L, const char *buff, size_t size,
const char *name) {
ZIO z;
if (!name) name = "?";
1998-06-20 02:47:06 +08:00
luaZ_mopen(&z, buff, size, name);
return protectedparser(L, &z, buff[0]==LUA_SIGNATURE[0]);
}
2000-09-26 00:22:42 +08:00
/*
** {======================================================
2001-11-28 04:56:47 +08:00
** Error-recovery functions (based on long jumps)
2000-09-26 00:22:42 +08:00
** =======================================================
*/
/* chain list of long jump buffers */
struct lua_longjmp {
jmp_buf b;
struct lua_longjmp *previous;
volatile int status; /* error code */
2001-12-20 23:13:38 +08:00
int ci; /* index of call info of active function that set protection */
StkId top; /* top stack when protection was set */
int allowhooks; /* `allowhook' state when protection was set */
2000-09-26 00:22:42 +08:00
};
static void message (lua_State *L, const char *s) {
2001-12-06 04:15:18 +08:00
TObject o, m;
setsvalue(&o, luaS_newliteral(L, LUA_ERRORMESSAGE));
luaV_gettable(L, gt(L), &o, &m);
if (ttype(&m) == LUA_TFUNCTION) {
StkId top = L->top;
setobj(top, &m);
2000-09-26 00:22:42 +08:00
incr_top;
setsvalue(top+1, luaS_new(L, s));
incr_top;
2001-12-20 23:13:38 +08:00
luaD_call(L, top, 0);
2000-09-26 00:22:42 +08:00
}
}
/*
** Reports an error, and jumps up to the available recovery label
*/
void luaD_error (lua_State *L, const char *s) {
2002-01-10 06:02:47 +08:00
if (s) {
if (L->ci->savedpc) { /* error in Lua function preamble? */
L->ci->savedpc = NULL; /* pretend function was already running */
L->ci->pc = NULL;
}
message(L, s);
}
2000-09-26 00:22:42 +08:00
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 && errcode != LUA_ERRERR)
message(L, "unable to recover; exiting\n");
2000-09-26 00:22:42 +08:00
exit(EXIT_FAILURE);
}
}
int luaD_runprotected (lua_State *L, void (*f)(lua_State *, void *), void *ud) {
struct lua_longjmp lj;
2001-12-20 23:13:38 +08:00
lj.ci = L->ci - L->base_ci;
lj.top = L->top;
lj.allowhooks = L->allowhooks;
2000-09-26 00:22:42 +08: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 */
2001-12-20 23:13:38 +08:00
L->ci = L->base_ci + lj.ci;
L->top = lj.top;
L->allowhooks = lj.allowhooks;
2000-09-26 00:22:42 +08:00
restore_stack_limit(L);
}
L->errorJmp = lj.previous; /* restore old error handler */
return lj.status;
}
/* }====================================================== */