2013-05-22 02:23:42 +08:00
|
|
|
/*
|
2024-09-20 22:50:11 +08:00
|
|
|
** $Id: ldo.h $
|
2013-05-22 02:23:42 +08:00
|
|
|
** Stack and Call structure of Lua
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef ldo_h
|
|
|
|
#define ldo_h
|
|
|
|
|
|
|
|
|
2024-09-20 22:50:11 +08:00
|
|
|
#include "llimits.h"
|
2013-05-22 02:23:42 +08:00
|
|
|
#include "lobject.h"
|
|
|
|
#include "lstate.h"
|
|
|
|
#include "lzio.h"
|
|
|
|
|
|
|
|
|
2024-09-20 22:50:11 +08:00
|
|
|
/*
|
|
|
|
** Macro to check stack size and grow stack if needed. Parameters
|
|
|
|
** 'pre'/'pos' allow the macro to preserve a pointer into the
|
|
|
|
** stack across reallocations, doing the work only when needed.
|
|
|
|
** It also allows the running of one GC step when the stack is
|
|
|
|
** reallocated.
|
|
|
|
** 'condmovestack' is used in heavy tests to force a stack reallocation
|
|
|
|
** at every check.
|
|
|
|
*/
|
|
|
|
#define luaD_checkstackaux(L,n,pre,pos) \
|
|
|
|
if (l_unlikely(L->stack_last.p - L->top.p <= (n))) \
|
|
|
|
{ pre; luaD_growstack(L, n, 1); pos; } \
|
|
|
|
else { condmovestack(L,pre,pos); }
|
|
|
|
|
|
|
|
/* In general, 'pre'/'pos' are empty (nothing to save) */
|
|
|
|
#define luaD_checkstack(L,n) luaD_checkstackaux(L,n,(void)0,(void)0)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define savestack(L,pt) (cast_charp(pt) - cast_charp(L->stack.p))
|
|
|
|
#define restorestack(L,n) cast(StkId, cast_charp(L->stack.p) + (n))
|
|
|
|
|
|
|
|
|
|
|
|
/* macro to check stack size, preserving 'p' */
|
|
|
|
#define checkstackp(L,n,p) \
|
|
|
|
luaD_checkstackaux(L, n, \
|
|
|
|
ptrdiff_t t__ = savestack(L, p), /* save 'p' */ \
|
|
|
|
p = restorestack(L, t__)) /* 'pos' part: restore 'p' */
|
|
|
|
|
2013-05-22 02:23:42 +08:00
|
|
|
|
2024-09-20 22:50:11 +08:00
|
|
|
/* macro to check stack size and GC, preserving 'p' */
|
|
|
|
#define checkstackGCp(L,n,p) \
|
|
|
|
luaD_checkstackaux(L, n, \
|
|
|
|
ptrdiff_t t__ = savestack(L, p); /* save 'p' */ \
|
|
|
|
luaC_checkGC(L), /* stack grow uses memory */ \
|
|
|
|
p = restorestack(L, t__)) /* 'pos' part: restore 'p' */
|
2013-05-22 02:23:42 +08:00
|
|
|
|
|
|
|
|
2024-09-20 22:50:11 +08:00
|
|
|
/* macro to check stack size and GC */
|
|
|
|
#define checkstackGC(L,fsize) \
|
|
|
|
luaD_checkstackaux(L, (fsize), luaC_checkGC(L), (void)0)
|
2013-05-22 02:23:42 +08:00
|
|
|
|
|
|
|
|
2024-09-20 22:50:11 +08:00
|
|
|
/* type of protected functions, to be ran by 'runprotected' */
|
2024-09-30 16:36:29 +08:00
|
|
|
typedef void (*Pfunc)(lua_State *L, void *ud);
|
|
|
|
|
|
|
|
LUAI_FUNC void luaD_seterrorobj(lua_State *L, int errcode, StkId oldtop);
|
|
|
|
LUAI_FUNC int luaD_protectedparser(lua_State *L, ZIO *z, const char *name,
|
|
|
|
const char *mode);
|
|
|
|
LUAI_FUNC void luaD_hook(lua_State *L, int event, int line,
|
|
|
|
int fTransfer, int nTransfer);
|
|
|
|
LUAI_FUNC void luaD_hookcall(lua_State *L, CallInfo *ci);
|
|
|
|
LUAI_FUNC int luaD_pretailcall(lua_State *L, CallInfo *ci, StkId func,
|
|
|
|
int narg1, int delta);
|
|
|
|
LUAI_FUNC CallInfo *luaD_precall(lua_State *L, StkId func, int nResults);
|
|
|
|
LUAI_FUNC void luaD_call(lua_State *L, StkId func, int nResults);
|
|
|
|
LUAI_FUNC void luaD_callnoyield(lua_State *L, StkId func, int nResults);
|
|
|
|
LUAI_FUNC int luaD_closeprotected(lua_State *L, ptrdiff_t level, int status);
|
|
|
|
LUAI_FUNC int luaD_pcall(lua_State *L, Pfunc func, void *u,
|
|
|
|
ptrdiff_t oldtop, ptrdiff_t ef);
|
|
|
|
LUAI_FUNC void luaD_poscall(lua_State *L, CallInfo *ci, int nres);
|
|
|
|
LUAI_FUNC int luaD_reallocstack(lua_State *L, int newsize, int raiseerror);
|
|
|
|
LUAI_FUNC int luaD_growstack(lua_State *L, int n, int raiseerror);
|
|
|
|
LUAI_FUNC void luaD_shrinkstack(lua_State *L);
|
|
|
|
LUAI_FUNC void luaD_inctop(lua_State *L);
|
|
|
|
|
|
|
|
LUAI_FUNC l_noret luaD_throw(lua_State *L, int errcode);
|
|
|
|
LUAI_FUNC int luaD_rawrunprotected(lua_State *L, Pfunc f, void *ud);
|
2013-05-22 02:23:42 +08:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|