1997-09-16 23:25:59 +04:00
|
|
|
/*
|
2002-03-25 20:47:14 +03:00
|
|
|
** $Id: ldo.h,v 1.41 2002/03/20 12:52:32 roberto Exp roberto $
|
1997-09-16 23:25:59 +04:00
|
|
|
** Stack and Call structure of Lua
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef ldo_h
|
|
|
|
#define ldo_h
|
|
|
|
|
|
|
|
|
|
|
|
#include "lobject.h"
|
1997-11-19 20:29:23 +03:00
|
|
|
#include "lstate.h"
|
1997-09-16 23:25:59 +04:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** macro to increment stack top.
|
1997-11-19 20:29:23 +03:00
|
|
|
** There must be always an empty slot at the L->stack.top
|
1997-09-16 23:25:59 +04:00
|
|
|
*/
|
2002-01-26 01:14:54 +03:00
|
|
|
#define incr_top(L) \
|
|
|
|
{if (L->top >= L->stack_last) luaD_growstack(L, 1); L->top++;}
|
1997-09-16 23:25:59 +04:00
|
|
|
|
2002-03-20 15:52:32 +03:00
|
|
|
#define luaD_checkstack(L,n) \
|
|
|
|
if ((char *)L->stack_last - (char *)L->top <= (n)*(int)sizeof(TObject)) \
|
|
|
|
luaD_growstack(L, n)
|
|
|
|
|
|
|
|
#define savestack(L,p) ((char *)(p) - (char *)L->stack)
|
|
|
|
#define restorestack(L,n) ((TObject *)((char *)L->stack + (n)))
|
2001-06-05 23:41:24 +04:00
|
|
|
|
|
|
|
|
2002-03-25 20:47:14 +03:00
|
|
|
void luaD_lineHook (lua_State *L, int line);
|
2001-12-18 23:52:30 +03:00
|
|
|
StkId luaD_precall (lua_State *L, StkId func);
|
|
|
|
void luaD_call (lua_State *L, StkId func, int nResults);
|
|
|
|
void luaD_poscall (lua_State *L, int wanted, StkId firstResult);
|
2002-01-26 01:14:54 +03:00
|
|
|
void luaD_reallocCI (lua_State *L, int newsize);
|
|
|
|
void luaD_reallocstack (lua_State *L, int newsize);
|
|
|
|
void luaD_growstack (lua_State *L, int n);
|
1997-09-16 23:25:59 +04:00
|
|
|
|
2001-11-28 23:13:13 +03:00
|
|
|
void luaD_error (lua_State *L, const char *s);
|
2000-09-25 20:22:42 +04:00
|
|
|
void luaD_breakrun (lua_State *L, int errcode);
|
|
|
|
int luaD_runprotected (lua_State *L, void (*f)(lua_State *, void *), void *ud);
|
|
|
|
|
1997-09-16 23:25:59 +04:00
|
|
|
|
|
|
|
#endif
|