1997-09-16 12:25:59 -07:00
|
|
|
/*
|
1999-10-14 12:46:57 -07:00
|
|
|
** $Id: ldo.h,v 1.8 1999/10/04 17:51:04 roberto Exp roberto $
|
1997-09-16 12:25:59 -07: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 09:29:23 -08:00
|
|
|
#include "lstate.h"
|
1997-09-16 12:25:59 -07:00
|
|
|
|
|
|
|
|
|
|
|
#define MULT_RET 255
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
** macro to increment stack top.
|
1997-11-19 09:29:23 -08:00
|
|
|
** There must be always an empty slot at the L->stack.top
|
1997-09-16 12:25:59 -07:00
|
|
|
*/
|
1997-11-19 09:29:23 -08:00
|
|
|
#define incr_top { if (L->stack.top >= L->stack.last) luaD_checkstack(1); \
|
|
|
|
L->stack.top++; }
|
1997-09-16 12:25:59 -07:00
|
|
|
|
|
|
|
|
|
|
|
/* macros to convert from lua_Object to (TObject *) and back */
|
|
|
|
|
1997-11-19 09:29:23 -08:00
|
|
|
#define Address(lo) ((lo)+L->stack.stack-1)
|
|
|
|
#define Ref(st) ((st)-L->stack.stack+1)
|
1997-09-16 12:25:59 -07:00
|
|
|
|
1997-11-04 07:27:53 -08:00
|
|
|
|
|
|
|
void luaD_init (void);
|
1997-09-16 12:25:59 -07:00
|
|
|
void luaD_adjusttop (StkId newtop);
|
|
|
|
void luaD_openstack (int nelems);
|
|
|
|
void luaD_lineHook (int line);
|
1999-10-14 12:46:57 -07:00
|
|
|
void luaD_callHook (StkId base, const TProtoFunc *tf, int isreturn);
|
1998-07-12 09:14:34 -07:00
|
|
|
void luaD_calln (int nArgs, int nResults);
|
1999-08-16 13:52:00 -07:00
|
|
|
void luaD_callTM (const TObject *f, int nParams, int nResults);
|
1999-06-22 13:37:23 -07:00
|
|
|
int luaD_protectedrun (void);
|
1999-08-16 13:52:00 -07:00
|
|
|
void luaD_gcIM (const TObject *o);
|
1997-09-16 12:25:59 -07:00
|
|
|
void luaD_checkstack (int n);
|
|
|
|
|
|
|
|
|
|
|
|
#endif
|