Steve Checkoway
943ba7e0fa
-1 key -2 value -3 key ... The top key and value can be removed or modified as required. The key at -3 should not be touched since it is required for the next iteration through the loop. Stack management is simplified. Anything left on the stack above the key will be popped. After the loop terminates normally, the stack will be as it was before the loop was entered (no nil values to clean up).
208 lines
6.6 KiB
C++
208 lines
6.6 KiB
C++
#ifndef LUA_MANAGER_H
|
|
#define LUA_MANAGER_H
|
|
|
|
struct lua_State;
|
|
typedef lua_State Lua;
|
|
typedef void (*RegisterWithLuaFn)(lua_State*);
|
|
class RageMutex;
|
|
class XNode;
|
|
|
|
extern "C"
|
|
{
|
|
#include "lua-5.1/src/lua.h"
|
|
#include "lua-5.1/src/lualib.h"
|
|
#include "lua-5.1/src/lauxlib.h"
|
|
}
|
|
|
|
class LuaManager;
|
|
extern LuaManager *LUA;
|
|
|
|
class LuaManager
|
|
{
|
|
public:
|
|
// Every Actor should register its class at program initialization.
|
|
static void Register( RegisterWithLuaFn pfn );
|
|
|
|
LuaManager();
|
|
~LuaManager();
|
|
|
|
Lua *Get();
|
|
void Release( Lua *&p );
|
|
|
|
/* Explicitly lock and unlock Lua access. This is done automatically by Get() and
|
|
* Release(). */
|
|
void YieldLua();
|
|
void UnyieldLua();
|
|
|
|
/* Register all subscribing types. There's no harm in registering when already registered. */
|
|
void RegisterTypes();
|
|
|
|
void SetGlobal( const RString &sName, int val );
|
|
void SetGlobal( const RString &sName, const RString &val );
|
|
void UnsetGlobal( const RString &sName );
|
|
|
|
private:
|
|
lua_State *m_pLuaMain;
|
|
|
|
RageMutex *m_pLock;
|
|
};
|
|
|
|
|
|
namespace LuaHelpers
|
|
{
|
|
/* Run a script with the given name. The given number of return values are left on
|
|
* the Lua stack. On error, nils are left on the stack, sError is set and
|
|
* false is returned. */
|
|
bool RunScript( Lua *L, const RString &sScript, const RString &sName, RString &sError, int iArgs = 0, int iReturnValues = 0 );
|
|
|
|
/* Run the given expression, returning a single value, and leave the return value on the
|
|
* stack. On error, push nil. */
|
|
bool RunExpression( Lua *L, const RString &sExpression, const RString &sName = "" );
|
|
|
|
bool RunScriptFile( const RString &sFile );
|
|
|
|
/* Strip "//" comments and "+". */
|
|
void PrepareExpression( RString &sInOut );
|
|
|
|
/* Create a Lua array (a table with indices starting at 1) of the given vector,
|
|
* and push it on the stack. */
|
|
void CreateTableFromArrayB( Lua *L, const vector<bool> &aIn );
|
|
|
|
/* Recursively copy elements from the table at stack element -2 into the table
|
|
* at stack -1. Pop both elements from the stack. */
|
|
void DeepCopy( lua_State *L );
|
|
|
|
/* Read the table at the top of the stack back into a vector. */
|
|
void ReadArrayFromTableB( Lua *L, vector<bool> &aOut );
|
|
|
|
/* Run an expression in the global environment, returning the given type. */
|
|
bool RunExpressionB( const RString &str );
|
|
float RunExpressionF( const RString &str );
|
|
void RunExpressionS( const RString &str, RString &sOut );
|
|
|
|
/* If sStr begins with @, evaluate the rest as an expression and store the result over sStr. */
|
|
bool RunAtExpressionS( RString &sStr );
|
|
|
|
void ParseCommandList( lua_State *L, const RString &sCommands, const RString &sName );
|
|
|
|
XNode *GetLuaInformation();
|
|
|
|
/* Pops the last iArgs arguments from the stack, and return a function that returns
|
|
* those values. */
|
|
void PushValueFunc( lua_State *L, int iArgs );
|
|
|
|
template<class T>
|
|
void Push( lua_State *L, const T &Object );
|
|
|
|
template<class T>
|
|
bool FromStack( lua_State *L, T &Object, int iOffset );
|
|
|
|
template<class T>
|
|
bool Pop( lua_State *L, T &val )
|
|
{
|
|
bool bRet = LuaHelpers::FromStack( L, val, -1 );
|
|
lua_pop( L, 1 );
|
|
return bRet;
|
|
}
|
|
|
|
template<class T>
|
|
void ReadArrayFromTable( vector<T> &aOut, lua_State *L )
|
|
{
|
|
luaL_checktype( L, -1, LUA_TTABLE );
|
|
|
|
int i = 0;
|
|
while( lua_rawgeti(L, -1, ++i), !lua_isnil(L, -1) )
|
|
{
|
|
T value = T();
|
|
LuaHelpers::Pop( L, value );
|
|
aOut.push_back( value );
|
|
}
|
|
lua_pop( L, 1 ); // pop nil
|
|
}
|
|
template<class T>
|
|
void CreateTableFromArray( const vector<T> &aIn, lua_State *L )
|
|
{
|
|
lua_newtable( L );
|
|
for( unsigned i = 0; i < aIn.size(); ++i )
|
|
{
|
|
LuaHelpers::Push( L, aIn[i] );
|
|
lua_rawseti( L, -2, i+1 );
|
|
}
|
|
}
|
|
|
|
int TypeError( Lua *L, int narg, const char *tname );
|
|
inline int AbsIndex( Lua *L, int i ) { if( i > 0 || i <= LUA_REGISTRYINDEX ) return i; return lua_gettop( L ) + i + 1; }
|
|
}
|
|
|
|
/* Iterate over all elements in the table. For safety reasons, the key is pushed onto
|
|
* the stack and can be read (safely) as a string and popped or altered in any way.
|
|
* Stack management is handled automatically. That is, you need not remove all stack
|
|
* elements above the key. Once the loop exits normally, the top of the stack will be
|
|
* where it was before. If you break out of the loop early, you need to handle that
|
|
* explicitly. */
|
|
#undef UNIQUE_NAME // XXX Remove
|
|
#define UNIQUE_NAME(x) x##_##x
|
|
#define FOREACH_LUATABLE(L,index) \
|
|
for( const int UNIQUE_NAME(tab) = LuaHelpers::AbsIndex(L,index), \
|
|
UNIQUE_NAME(top) = (lua_pushnil(L),lua_gettop(L)); \
|
|
( lua_next(L, UNIQUE_NAME(tab)) || (lua_pop(L,1),false) ) && (lua_pushvalue(L,-2),true); \
|
|
lua_settop(L,UNIQUE_NAME(top)) )
|
|
|
|
|
|
#define REGISTER_WITH_LUA_FUNCTION( Fn ) \
|
|
class Register##Fn { public: Register##Fn() { LuaManager::Register( Fn ); } }; \
|
|
static Register##Fn register##Fn;
|
|
|
|
inline bool MyLua_checkboolean (lua_State *L, int numArg)
|
|
{
|
|
luaL_checktype( L, numArg, LUA_TBOOLEAN );
|
|
return !!lua_toboolean( L, numArg );
|
|
}
|
|
|
|
#define SArg(n) (luaL_checkstring(L,(n)))
|
|
#define IArg(n) (luaL_checkint(L,(n)))
|
|
#define BArg(n) (MyLua_checkboolean(L,(n)))
|
|
#define FArg(n) ((float) luaL_checknumber(L,(n)))
|
|
|
|
/* Linked list of functions we make available to Lua. */
|
|
struct LuaFunctionList
|
|
{
|
|
LuaFunctionList( RString name, lua_CFunction func );
|
|
RString name;
|
|
lua_CFunction func;
|
|
LuaFunctionList *next;
|
|
};
|
|
|
|
#define LuaFunction( func, expr ) \
|
|
int LuaFunc_##func( lua_State *L ) { \
|
|
LuaHelpers::Push( L, expr ); return 1; \
|
|
} \
|
|
static LuaFunctionList g_##func( #func, LuaFunc_##func ); /* register it */
|
|
|
|
#endif
|
|
|
|
/*
|
|
* (c) 2004 Glenn Maynard
|
|
* All rights reserved.
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
* copy of this software and associated documentation files (the
|
|
* "Software"), to deal in the Software without restriction, including
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
* distribute, and/or sell copies of the Software, and to permit persons to
|
|
* whom the Software is furnished to do so, provided that the above
|
|
* copyright notice(s) and this permission notice appear in all copies of
|
|
* the Software and that both the above copyright notice(s) and this
|
|
* permission notice appear in supporting documentation.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF
|
|
* THIRD PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS
|
|
* INCLUDED IN THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT
|
|
* OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
|
|
* OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
* PERFORMANCE OF THIS SOFTWARE.
|
|
*/
|