1997-09-17 03:25:59 +08:00
|
|
|
/*
|
2001-12-19 04:52:30 +08:00
|
|
|
** $Id: ldo.h,v 1.1 2001/11/29 22:14:34 rieru Exp rieru $
|
1997-09-17 03:25:59 +08:00
|
|
|
** Stack and Call structure of Lua
|
|
|
|
** See Copyright Notice in lua.h
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef ldo_h
|
|
|
|
#define ldo_h
|
|
|
|
|
|
|
|
|
|
|
|
#include "lobject.h"
|
1997-11-20 01:29:23 +08:00
|
|
|
#include "lstate.h"
|
1997-09-17 03:25:59 +08:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** macro to increment stack top.
|
1997-11-20 01:29:23 +08:00
|
|
|
** There must be always an empty slot at the L->stack.top
|
1997-09-17 03:25:59 +08:00
|
|
|
*/
|
1999-12-02 03:50:08 +08:00
|
|
|
#define incr_top {if (L->top == L->stack_last) luaD_checkstack(L, 1); L->top++;}
|
1997-09-17 03:25:59 +08:00
|
|
|
|
|
|
|
|
2001-06-06 03:41:24 +08:00
|
|
|
#define luaD_checkstack(L,n) if (L->stack_last-(n)<=L->top) luaD_stackerror(L)
|
|
|
|
|
|
|
|
|
1999-12-06 19:41:28 +08:00
|
|
|
void luaD_init (lua_State *L, int stacksize);
|
2001-03-08 02:09:25 +08:00
|
|
|
void luaD_lineHook (lua_State *L, int line, lua_Hook linehook);
|
2001-12-19 04:52:30 +08:00
|
|
|
void luaD_callHook (lua_State *L, lua_Hook callhook, const char *event);
|
|
|
|
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);
|
2001-06-06 03:41:24 +08:00
|
|
|
void luaD_stackerror (lua_State *L);
|
1997-09-17 03:25:59 +08:00
|
|
|
|
2001-11-29 04:13:13 +08:00
|
|
|
void luaD_error (lua_State *L, const char *s);
|
2000-09-26 00:22:42 +08:00
|
|
|
void luaD_breakrun (lua_State *L, int errcode);
|
|
|
|
int luaD_runprotected (lua_State *L, void (*f)(lua_State *, void *), void *ud);
|
|
|
|
|
1997-09-17 03:25:59 +08:00
|
|
|
|
|
|
|
#endif
|