2009-12-08 18:46:35 +00:00
|
|
|
/*
|
|
|
|
** State and stack handling.
|
|
|
|
** Copyright (C) 2005-2009 Mike Pall. See Copyright Notice in luajit.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _LJ_STATE_H
|
|
|
|
#define _LJ_STATE_H
|
|
|
|
|
|
|
|
#include "lj_obj.h"
|
|
|
|
|
|
|
|
#define incr_top(L) \
|
|
|
|
(++L->top >= L->maxstack && (lj_state_growstack1(L), 0))
|
|
|
|
|
|
|
|
#define savestack(L, p) ((char *)(p) - (char *)L->stack)
|
|
|
|
#define restorestack(L, n) ((TValue *)((char *)L->stack + (n)))
|
|
|
|
|
|
|
|
LJ_FUNC void lj_state_relimitstack(lua_State *L);
|
|
|
|
LJ_FUNC void lj_state_shrinkstack(lua_State *L, MSize used);
|
2009-12-27 16:42:41 +00:00
|
|
|
LJ_FUNCA void LJ_FASTCALL lj_state_growstack(lua_State *L, MSize need);
|
|
|
|
LJ_FUNC void LJ_FASTCALL lj_state_growstack1(lua_State *L);
|
2009-12-08 18:46:35 +00:00
|
|
|
|
|
|
|
static LJ_AINLINE void lj_state_checkstack(lua_State *L, MSize need)
|
|
|
|
{
|
|
|
|
if ((MSize)((char *)L->maxstack-(char *)L->top) <= need*(MSize)sizeof(TValue))
|
|
|
|
lj_state_growstack(L, need);
|
|
|
|
}
|
|
|
|
|
|
|
|
LJ_FUNC lua_State *lj_state_new(lua_State *L);
|
|
|
|
LJ_FUNC void LJ_FASTCALL lj_state_free(global_State *g, lua_State *L);
|
|
|
|
|
|
|
|
#endif
|