lua/ldo.c

645 lines
19 KiB
C
Raw Normal View History

1997-09-16 23:25:59 +04:00
/*
** $Id: ldo.c,v 2.76 2009/12/10 18:20:07 roberto Exp roberto $
1997-09-16 23:25:59 +04:00
** Stack and Call structure of Lua
** See Copyright Notice in lua.h
*/
2005-03-08 21:09:16 +03:00
#include <setjmp.h>
1997-11-07 18:09:49 +03:00
#include <stdlib.h>
1997-09-16 23:25:59 +04:00
#include <string.h>
2002-12-04 20:38:31 +03:00
#define ldo_c
#define LUA_CORE
2002-12-04 20:38:31 +03:00
#include "lua.h"
#include "lapi.h"
#include "ldebug.h"
1997-09-16 23:25:59 +04:00
#include "ldo.h"
#include "lfunc.h"
1997-09-16 23:25:59 +04:00
#include "lgc.h"
#include "lmem.h"
#include "lobject.h"
2002-01-10 01:02:47 +03:00
#include "lopcodes.h"
1997-09-16 23:25:59 +04:00
#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"
2002-08-05 21:36:24 +04:00
/*
** {======================================================
** Error-recovery functions
2002-08-05 21:36:24 +04:00
** =======================================================
*/
/*
** LUAI_THROW/LUAI_TRY define how Lua does exception handling. By
** default, Lua handles errors with exceptions when compiling as
** C++ code, with _longjmp/_setjmp when asked to use them, and with
** longjmp/setjmp otherwise.
*/
#if !defined(LUAI_THROW)
#if defined(__cplusplus)
/* C++ exceptions */
#define LUAI_THROW(L,c) throw(c)
#define LUAI_TRY(L,c,a) \
try { a } catch(...) { if ((c)->status == 0) (c)->status = -1; }
#define luai_jmpbuf int /* dummy variable */
#elif defined(LUA_USE_ULONGJMP)
/* in Unix, try _longjmp/_setjmp (more efficient) */
#define LUAI_THROW(L,c) _longjmp((c)->b, 1)
#define LUAI_TRY(L,c,a) if (_setjmp((c)->b) == 0) { a }
#define luai_jmpbuf jmp_buf
#else
/* default handling with long jumps */
#define LUAI_THROW(L,c) longjmp((c)->b, 1)
#define LUAI_TRY(L,c,a) if (setjmp((c)->b) == 0) { a }
#define luai_jmpbuf jmp_buf
#endif
#endif
2002-08-05 21:36:24 +04:00
2002-01-26 01:14:54 +03:00
/* chain list of long jump buffers */
struct lua_longjmp {
struct lua_longjmp *previous;
luai_jmpbuf b;
2002-01-26 01:14:54 +03:00
volatile int status; /* error code */
};
void luaD_seterrorobj (lua_State *L, int errcode, StkId oldtop) {
2002-08-05 21:36:24 +04:00
switch (errcode) {
case LUA_ERRMEM: {
setsvalue2s(L, oldtop, luaS_newliteral(L, MEMERRMSG));
2002-08-05 21:36:24 +04:00
break;
}
case LUA_ERRERR: {
setsvalue2s(L, oldtop, luaS_newliteral(L, "error in error handling"));
2002-08-05 21:36:24 +04:00
break;
}
default: {
setobjs2s(L, oldtop, L->top - 1); /* error message on current top */
2002-11-06 22:08:00 +03:00
break;
2002-08-05 21:36:24 +04:00
}
}
2002-11-06 22:08:00 +03:00
L->top = oldtop + 1;
2002-08-05 21:36:24 +04:00
}
void luaD_throw (lua_State *L, int errcode) {
if (L->errorJmp) { /* thread has an error handler? */
L->errorJmp->status = errcode; /* set status */
LUAI_THROW(L, L->errorJmp); /* jump to it */
2002-08-05 21:36:24 +04:00
}
else { /* thread has no error handler */
L->status = cast_byte(errcode); /* mark it as dead */
if (G(L)->mainthread->errorJmp) { /* main thread has a handler? */
setobjs2s(L, G(L)->mainthread->top++, L->top - 1); /* copy error obj. */
luaD_throw(G(L)->mainthread, errcode); /* re-throw in main thread */
}
else { /* no handler at all; abort */
if (G(L)->panic) { /* panic function? */
lua_unlock(L);
G(L)->panic(L); /* call it (last chance to jump out) */
}
abort();
2005-07-11 18:00:31 +04:00
}
2002-08-05 21:36:24 +04:00
}
}
int luaD_rawrunprotected (lua_State *L, Pfunc f, void *ud) {
unsigned short oldnCcalls = G(L)->nCcalls;
2002-08-05 21:36:24 +04:00
struct lua_longjmp lj;
2006-10-10 21:40:17 +04:00
lj.status = LUA_OK;
2002-08-05 21:36:24 +04:00
lj.previous = L->errorJmp; /* chain new error handler */
L->errorJmp = &lj;
LUAI_TRY(L, &lj,
2002-08-05 21:36:24 +04:00
(*f)(L, ud);
);
2002-08-05 21:36:24 +04:00
L->errorJmp = lj.previous; /* restore old error handler */
G(L)->nCcalls = oldnCcalls;
2002-08-05 21:36:24 +04:00
return lj.status;
}
/* }====================================================== */
static void correctstack (lua_State *L, TValue *oldstack) {
2002-01-26 01:14:54 +03:00
CallInfo *ci;
GCObject *up;
2002-01-26 01:14:54 +03:00
L->top = (L->top - oldstack) + L->stack;
for (up = L->openupval; up != NULL; up = up->gch.next)
gco2uv(up)->v = (gco2uv(up)->v - oldstack) + L->stack;
for (ci = L->ci; ci != NULL; ci = ci->previous) {
2002-01-26 01:14:54 +03:00
ci->top = (ci->top - oldstack) + L->stack;
ci->func = (ci->func - oldstack) + L->stack;
if (isLua(ci))
ci->u.l.base = (ci->u.l.base - oldstack) + L->stack;
2002-01-26 01:14:54 +03:00
}
}
/* some space for error handling */
#define ERRORSTACKSIZE (LUAI_MAXSTACK + 200)
2002-01-26 01:14:54 +03:00
void luaD_reallocstack (lua_State *L, int newsize) {
TValue *oldstack = L->stack;
int lim = L->stacksize;
lua_assert(newsize <= LUAI_MAXSTACK || newsize == ERRORSTACKSIZE);
lua_assert(L->stack_last - L->stack == L->stacksize - EXTRA_STACK);
luaM_reallocvector(L, L->stack, L->stacksize, newsize, TValue);
for (; lim < newsize; lim++)
setnilvalue(L->stack + lim); /* erase new segment */
L->stacksize = newsize;
L->stack_last = L->stack + newsize - EXTRA_STACK;
2002-01-26 01:14:54 +03:00
correctstack(L, oldstack);
}
void luaD_growstack (lua_State *L, int n) {
int size = L->stacksize;
if (size > LUAI_MAXSTACK) /* error after extra size? */
luaD_throw(L, LUA_ERRERR);
else {
int needed = L->top - L->stack + n + EXTRA_STACK;
int newsize = 2 * size;
if (newsize > LUAI_MAXSTACK) newsize = LUAI_MAXSTACK;
if (newsize < needed) newsize = needed;
if (newsize > LUAI_MAXSTACK) { /* stack overflow? */
luaD_reallocstack(L, ERRORSTACKSIZE);
luaG_runerror(L, "stack overflow");
}
else
luaD_reallocstack(L, newsize);
}
}
static int stackinuse (lua_State *L) {
CallInfo *ci;
StkId lim = L->top;
for (ci = L->ci; ci != NULL; ci = ci->previous) {
lua_assert(ci->top <= L->stack_last);
if (lim < ci->top) lim = ci->top;
}
return cast_int(lim - L->stack) + 1; /* part of stack in use */
}
void luaD_shrinkstack (lua_State *L) {
int inuse = stackinuse(L);
int goodsize = inuse + (inuse / 8) + 2*EXTRA_STACK;
if (goodsize > LUAI_MAXSTACK) goodsize = LUAI_MAXSTACK;
if (inuse > LUAI_MAXSTACK || /* handling stack overflow? */
goodsize >= L->stacksize) /* would grow instead of shrink? */
condmovestack(L); /* don't change stack (change only for debugging) */
2002-03-26 23:46:10 +03:00
else
luaD_reallocstack(L, goodsize); /* shrink it */
2002-03-26 23:46:10 +03:00
}
void luaD_hook (lua_State *L, int event, int line) {
2002-07-08 22:21:33 +04:00
lua_Hook hook = L->hook;
if (hook && L->allowhook) {
CallInfo *ci = L->ci;
2002-07-08 22:21:33 +04:00
ptrdiff_t top = savestack(L, L->top);
ptrdiff_t ci_top = savestack(L, ci->top);
2000-03-30 21:19:48 +04:00
lua_Debug ar;
2000-01-19 15:00:45 +03:00
ar.event = event;
2002-07-08 22:21:33 +04:00
ar.currentline = line;
ar.i_ci = ci;
2002-07-08 22:21:33 +04:00
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
ci->top = L->top + LUA_MINSTACK;
lua_assert(ci->top <= L->stack_last);
L->allowhook = 0; /* cannot call hooks inside a hook */
ci->callstatus |= CIST_HOOKED;
2002-07-08 22:21:33 +04:00
lua_unlock(L);
(*hook)(L, &ar);
lua_lock(L);
lua_assert(!L->allowhook);
L->allowhook = 1;
ci->top = restorestack(L, ci_top);
2002-07-08 22:21:33 +04:00
L->top = restorestack(L, top);
ci->callstatus &= ~CIST_HOOKED;
1997-09-16 23:25:59 +04:00
}
}
static void callhook (lua_State *L, CallInfo *ci) {
int hook = LUA_HOOKCALL;
ci->u.l.savedpc++; /* hooks assume 'pc' is already incremented */
if (isLua(ci->previous) &&
GET_OPCODE(*(ci->previous->u.l.savedpc - 1)) == OP_TAILCALL) {
ci->callstatus |= CIST_TAIL;
hook = LUA_HOOKTAILCALL;
}
luaD_hook(L, hook, -1);
ci->u.l.savedpc--; /* correct 'pc' */
}
static StkId adjust_varargs (lua_State *L, Proto *p, int actual) {
2002-01-10 01:02:47 +03:00
int i;
int nfixargs = p->numparams;
StkId base, fixed;
lua_assert(actual >= nfixargs);
/* move fixed parameters to final position */
fixed = L->top - actual; /* first fixed argument */
base = L->top; /* final position of first argument */
for (i=0; i<nfixargs; i++) {
setobjs2s(L, L->top++, fixed + i);
setnilvalue(fixed + i);
}
return base;
2002-01-10 01:02:47 +03:00
}
static StkId tryfuncTM (lua_State *L, StkId func) {
const TValue *tm = luaT_gettmbyobj(L, func, TM_CALL);
2002-07-09 22:19:19 +04:00
StkId p;
ptrdiff_t funcr = savestack(L, func);
2002-08-05 21:36:24 +04:00
if (!ttisfunction(tm))
luaG_typeerror(L, func, "call");
2002-07-09 22:19:19 +04:00
/* Open a hole inside the stack at `func' */
for (p = L->top; p > func; p--) setobjs2s(L, p, p-1);
2002-07-09 22:19:19 +04:00
incr_top(L);
func = restorestack(L, funcr); /* previous call may change stack */
setobj2s(L, func, tm); /* tag method is the new function to be called */
return func;
}
2004-09-08 18:23:09 +04:00
#define next_ci(L) (L->ci = (L->ci->next ? L->ci->next : luaE_extendCI(L)))
2004-09-08 18:23:09 +04:00
/*
** returns true if function has been executed (C function)
*/
int luaD_precall (lua_State *L, StkId func, int nresults) {
2002-01-10 01:02:47 +03:00
LClosure *cl;
ptrdiff_t funcr;
2002-08-05 21:36:24 +04:00
if (!ttisfunction(func)) /* `func' is not a function? */
func = tryfuncTM(L, func); /* check the `function' tag method */
funcr = savestack(L, func);
2002-01-10 01:02:47 +03:00
cl = &clvalue(func)->l;
L->ci->nresults = nresults;
2002-01-10 01:02:47 +03:00
if (!cl->isC) { /* Lua function? prepare its call */
CallInfo *ci;
int nparams, nargs;
StkId base;
2002-01-10 01:02:47 +03:00
Proto *p = cl->p;
luaD_checkstack(L, p->maxstacksize);
func = restorestack(L, funcr);
nargs = cast_int(L->top - func) - 1; /* number of real arguments */
nparams = p->numparams; /* number of expected parameters */
for (; nargs < nparams; nargs++)
setnilvalue(L->top++); /* complete missing arguments */
if (!p->is_vararg) /* no varargs? */
base = func + 1;
else /* vararg function */
base = adjust_varargs(L, p, nargs);
ci = next_ci(L); /* now 'enter' new function */
ci->func = func;
ci->u.l.base = base;
ci->top = base + p->maxstacksize;
2004-09-08 18:23:09 +04:00
lua_assert(ci->top <= L->stack_last);
ci->u.l.savedpc = p->code; /* starting point */
ci->callstatus = CIST_LUA;
2002-01-10 01:02:47 +03:00
L->top = ci->top;
if (L->hookmask & LUA_MASKCALL)
callhook(L, ci);
return 0;
2002-01-10 01:02:47 +03:00
}
else { /* if is a C function, call it */
CallInfo *ci;
2002-01-10 01:02:47 +03:00
int n;
luaD_checkstack(L, LUA_MINSTACK); /* ensure minimum stack size */
ci = next_ci(L); /* now 'enter' new function */
ci->func = restorestack(L, funcr);
ci->top = L->top + LUA_MINSTACK;
2004-09-08 18:23:09 +04:00
lua_assert(ci->top <= L->stack_last);
ci->callstatus = 0;
if (L->hookmask & LUA_MASKCALL)
luaD_hook(L, LUA_HOOKCALL, -1);
2002-01-10 01:02:47 +03:00
lua_unlock(L);
2004-03-24 18:46:49 +03:00
n = (*curr_func(L)->c.f)(L); /* do the actual call */
2002-01-10 01:02:47 +03:00
lua_lock(L);
api_checknelems(L, n);
luaD_poscall(L, L->top - n);
return 1;
2002-01-10 01:02:47 +03:00
}
2001-12-20 18:13:38 +03:00
}
2005-08-22 22:54:49 +04:00
int luaD_poscall (lua_State *L, StkId firstResult) {
2001-12-20 18:13:38 +03:00
StkId res;
2005-08-22 22:54:49 +04:00
int wanted, i;
CallInfo *ci = L->ci;
if (L->hookmask & (LUA_MASKRET | LUA_MASKLINE)) {
if (L->hookmask & LUA_MASKRET) {
ptrdiff_t fr = savestack(L, firstResult); /* hook may change stack */
luaD_hook(L, LUA_HOOKRET, -1);
firstResult = restorestack(L, fr);
}
L->oldpc = ci->previous->u.l.savedpc; /* 'oldpc' for caller function */
}
2005-08-22 22:54:49 +04:00
res = ci->func; /* res == final position of 1st result */
L->ci = ci = ci->previous; /* back to caller */
wanted = ci->nresults;
2001-12-20 18:13:38 +03:00
/* move results to correct place */
2005-08-22 22:54:49 +04:00
for (i = wanted; i != 0 && firstResult < L->top; i--)
setobjs2s(L, res++, firstResult++);
2005-08-22 22:54:49 +04:00
while (i-- > 0)
2001-12-20 18:13:38 +03:00
setnilvalue(res++);
L->top = res;
2005-08-22 22:54:49 +04:00
return (wanted - LUA_MULTRET); /* 0 iff wanted == LUA_MULTRET */
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, all the results are on the stack, starting at the original
** function position.
2006-09-11 18:07:24 +04:00
*/
void luaD_call (lua_State *L, StkId func, int nResults, int allowyield) {
global_State *g = G(L);
if (++g->nCcalls >= LUAI_MAXCCALLS) {
if (g->nCcalls == LUAI_MAXCCALLS)
luaG_runerror(L, "C stack overflow");
else if (g->nCcalls >= (LUAI_MAXCCALLS + (LUAI_MAXCCALLS>>3)))
luaD_throw(L, LUA_ERRERR); /* error while handing stack error */
2002-01-10 01:02:47 +03:00
}
if (!allowyield) L->nny++;
if (!luaD_precall(L, func, nResults)) /* is a Lua function? */
luaV_execute(L); /* call it */
if (!allowyield) L->nny--;
g->nCcalls--;
luaC_checkGC(L);
1998-07-12 20:14:34 +04:00
}
1997-09-16 23:25:59 +04:00
static void finishCcall (lua_State *L) {
CallInfo *ci = L->ci;
int n;
lua_assert(ci->u.c.k != NULL); /* must have a continuation */
lua_assert(L->nny == 0);
/* finish 'luaD_call' */
G(L)->nCcalls--;
/* finish 'lua_callk' */
adjustresults(L, ci->nresults);
/* call continuation function */
if (!(ci->callstatus & CIST_STAT)) /* no call status? */
ci->u.c.status = LUA_YIELD; /* 'default' status */
lua_assert(ci->u.c.status != LUA_OK);
ci->callstatus = (ci->callstatus & ~(CIST_YPCALL | CIST_STAT)) | CIST_YIELDED;
lua_unlock(L);
n = (*ci->u.c.k)(L);
lua_lock(L);
api_checknelems(L, n);
/* finish 'luaD_precall' */
luaD_poscall(L, L->top - n);
}
static void unroll (lua_State *L, void *ud) {
UNUSED(ud);
for (;;) {
if (L->ci == &L->base_ci) /* stack is empty? */
return; /* coroutine finished normally */
if (!isLua(L->ci)) /* C function? */
finishCcall(L);
else { /* Lua function */
luaV_finishOp(L); /* finish interrupted instruction */
luaV_execute(L); /* execute down to higher C 'boundary' */
}
}
}
/*
** check whether thread has a suspended protected call
*/
static CallInfo *findpcall (lua_State *L) {
CallInfo *ci;
for (ci = L->ci; ci != NULL; ci = ci->previous) { /* search for a pcall */
if (ci->callstatus & CIST_YPCALL)
return ci;
}
return NULL; /* no pending pcall */
}
static int recover (lua_State *L, int status) {
StkId oldtop;
CallInfo *ci = findpcall(L);
if (ci == NULL) return 0; /* no recovery point */
/* "finish" luaD_pcall */
oldtop = restorestack(L, ci->u.c.oldtop);
luaF_close(L, oldtop);
luaD_seterrorobj(L, status, oldtop);
L->ci = ci;
L->allowhook = ci->u.c.old_allowhook;
L->nny = 0; /* should be zero to be yieldable */
luaD_shrinkstack(L);
L->errfunc = ci->u.c.old_errfunc;
ci->callstatus |= CIST_STAT; /* call has error status */
ci->u.c.status = status; /* (here it is) */
return 1; /* continue running the coroutine */
}
/*
** signal an error in the call to 'resume', not in the execution of the
** coroutine itself. (Such errors should not be handled by any coroutine
** error hanlder and should not kill the coroutine.)
*/
static void resume_error (lua_State *L, const char *msg, StkId firstArg) {
L->top = firstArg; /* remove args from the stack */
setsvalue2s(L, L->top, luaS_new(L, msg)); /* push error message */
incr_top(L);
luaD_throw(L, -1); /* jump back to 'lua_resume' */
}
/*
** do the work for 'lua_resume' in protected mode
*/
2002-05-02 00:48:12 +04:00
static void resume (lua_State *L, void *ud) {
StkId firstArg = cast(StkId, ud);
2002-02-06 01:38:37 +03:00
CallInfo *ci = L->ci;
if (G(L)->nCcalls >= LUAI_MAXCCALLS)
resume_error(L, "C stack overflow", firstArg);
if (L->status == LUA_OK) { /* may be starting a coroutine */
if (ci != &L->base_ci) /* not in base level? */
resume_error(L, "cannot resume non-suspended coroutine", firstArg);
/* coroutine is in base level; start running it */
if (!luaD_precall(L, firstArg - 1, LUA_MULTRET)) /* Lua function? */
luaV_execute(L); /* call it */
2002-11-06 22:08:00 +03:00
}
else if (L->status != LUA_YIELD)
resume_error(L, "cannot resume dead coroutine", firstArg);
2003-11-11 19:34:17 +03:00
else { /* resuming from previous yield */
2006-10-10 21:40:17 +04:00
L->status = LUA_OK;
if (isLua(ci)) /* yielded inside a hook? */
luaV_execute(L); /* just continue running Lua code */
else { /* 'common' yield */
if (ci->u.c.k != NULL) { /* does it have a continuation? */
int n;
ci->u.c.status = LUA_YIELD; /* 'default' status */
ci->callstatus |= CIST_YIELDED;
ci->func = restorestack(L, ci->u.c.oldtop);
lua_unlock(L);
n = (*ci->u.c.k)(L); /* call continuation */
lua_lock(L);
api_checknelems(L, n);
firstArg = L->top - n; /* yield results come from continuation */
}
G(L)->nCcalls--; /* finish 'luaD_call' */
luaD_poscall(L, firstArg); /* finish 'luaD_precall' */
}
unroll(L, NULL);
}
2002-02-06 01:38:37 +03:00
}
2002-11-06 22:08:00 +03:00
LUA_API int lua_resume (lua_State *L, int nargs) {
2002-02-06 01:38:37 +03:00
int status;
lua_lock(L);
luai_userstateresume(L, nargs);
++G(L)->nCcalls; /* count resume */
L->nny = 0; /* allow yields */
status = luaD_rawrunprotected(L, resume, L->top - nargs);
if (status == -1) /* error calling 'lua_resume'? */
status = LUA_ERRRUN;
else { /* yield or regular error */
while (status != LUA_OK && status != LUA_YIELD) { /* error? */
if (recover(L, status)) /* recover point? */
status = luaD_rawrunprotected(L, unroll, NULL); /* run continuation */
else { /* unrecoverable error */
L->status = cast_byte(status); /* mark thread as `dead' */
luaD_seterrorobj(L, status, L->top);
L->ci->top = L->top;
break;
}
}
lua_assert(status == L->status);
}
L->nny = 1; /* do not allow yields */
--G(L)->nCcalls;
2002-01-10 01:02:47 +03:00
lua_unlock(L);
2002-02-06 01:38:37 +03:00
return status;
2002-01-10 01:02:47 +03:00
}
LUA_API int lua_yieldk (lua_State *L, int nresults, int ctx, lua_CFunction k) {
CallInfo *ci = L->ci;
luai_userstateyield(L, nresults);
2002-01-10 01:02:47 +03:00
lua_lock(L);
api_checknelems(L, nresults);
if (L->nny > 0)
luaG_runerror(L, "attempt to yield across metamethod/C-call boundary");
2004-09-16 00:39:42 +04:00
L->status = LUA_YIELD;
if (isLua(ci)) { /* inside a hook? */
api_check(L, k == NULL, "hooks cannot continue after yielding");
}
else {
if ((ci->u.c.k = k) != NULL) { /* is there a continuation? */
ci->u.c.ctx = ctx; /* save context */
ci->u.c.oldtop = savestack(L, ci->func); /* save current 'func' */
}
ci->func = L->top - nresults - 1; /* protect stack slots below */
luaD_throw(L, LUA_YIELD);
}
lua_assert(ci->callstatus & CIST_HOOKED); /* must be inside a hook */
2002-01-10 01:02:47 +03:00
lua_unlock(L);
return 0; /* return to 'luaD_hook' */
2002-01-10 01:02:47 +03:00
}
2002-12-04 20:29:32 +03:00
int luaD_pcall (lua_State *L, Pfunc func, void *u,
ptrdiff_t old_top, ptrdiff_t ef) {
2000-09-25 20:22:42 +04:00
int status;
CallInfo *old_ci = L->ci;
lu_byte old_allowhooks = L->allowhook;
unsigned short old_nny = L->nny;
2002-08-06 19:32:22 +04:00
ptrdiff_t old_errfunc = L->errfunc;
2002-12-04 20:29:32 +03:00
L->errfunc = ef;
status = luaD_rawrunprotected(L, func, u);
2006-10-10 21:40:17 +04:00
if (status != LUA_OK) { /* an error occurred? */
2002-12-04 20:29:32 +03:00
StkId oldtop = restorestack(L, old_top);
luaF_close(L, oldtop); /* close possible pending closures */
luaD_seterrorobj(L, status, oldtop);
L->ci = old_ci;
L->allowhook = old_allowhooks;
L->nny = old_nny;
luaD_shrinkstack(L);
}
2002-08-06 19:32:22 +04:00
L->errfunc = old_errfunc;
2000-09-25 20:22:42 +04:00
return status;
1997-09-16 23:25:59 +04:00
}
2002-12-04 20:29:32 +03:00
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;
Mbuffer buff; /* buffer to be used by the scanner */
Varlist varl; /* list of local variables (to be used by the parser) */
const char *name;
2000-09-25 20:22:42 +04:00
};
static void f_parser (lua_State *L, void *ud) {
int i;
Proto *tf;
Closure *cl;
2003-08-28 01:01:44 +04:00
struct SParser *p = cast(struct SParser *, ud);
int c = luaZ_lookahead(p->z);
tf = (c == LUA_SIGNATURE[0])
? luaU_undump(L, p->z, &p->buff, p->name)
: luaY_parser(L, p->z, &p->buff, &p->varl, p->name);
setptvalue2s(L, L->top, tf);
incr_top(L);
cl = luaF_newLclosure(L, tf->sizeupvalues, hvalue(&G(L)->l_gt));
2001-10-02 20:45:03 +04:00
cl->l.p = tf;
setclvalue(L, L->top - 1, cl);
for (i = 0; i < tf->sizeupvalues; i++) /* initialize upvalues */
cl->l.upvals[i] = luaF_newupval(L);
1997-09-16 23:25:59 +04:00
}
2003-08-28 01:01:44 +04:00
int luaD_protectedparser (lua_State *L, ZIO *z, const char *name) {
struct SParser p;
2000-09-25 20:22:42 +04:00
int status;
L->nny++; /* cannot yield during parsing */
2003-08-28 01:01:44 +04:00
p.z = z; p.name = name;
p.varl.actvar = NULL; p.varl.nactvar = p.varl.actvarsize = 0;
luaZ_initbuffer(L, &p.buff);
2003-08-28 01:01:44 +04:00
status = luaD_pcall(L, f_parser, &p, savestack(L, L->top), L->errfunc);
luaZ_freebuffer(L, &p.buff);
luaM_freearray(L, p.varl.actvar, p.varl.actvarsize);
L->nny--;
2002-08-05 21:36:24 +04:00
return status;
}
2000-09-25 20:22:42 +04:00