// The MIT License (MIT) // Copyright (c) 2013-2016 Rapptz and contributors // 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, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // 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. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. #ifndef SOL_FUNCTION_HPP #define SOL_FUNCTION_HPP #include "reference.hpp" #include "tuple.hpp" #include "stack.hpp" #include "function_types.hpp" #include "usertype_traits.hpp" #include "resolve.hpp" #include "function_result.hpp" #include #include #include namespace sol { class function : public reference { private: void luacall( std::ptrdiff_t argcount, std::ptrdiff_t resultcount ) const { lua_callk( lua_state( ), static_cast( argcount ), static_cast( resultcount ), 0, nullptr ); } template auto invoke( types, std::index_sequence, std::ptrdiff_t n ) const { luacall( n, sizeof...( Ret ) ); int stacksize = lua_gettop( lua_state( ) ); int firstreturn = std::max(1, stacksize - static_cast(sizeof...(Ret)) + 1); auto r = stack::get>( lua_state( ), firstreturn ); lua_pop(lua_state(), static_cast(sizeof...(Ret))); return r; } template Ret invoke(types, std::index_sequence, std::ptrdiff_t n ) const { luacall( n, 1 ); return stack::pop( lua_state( ) ); } template void invoke(types, std::index_sequence, std::ptrdiff_t n) const { luacall( n, 0 ); } function_result invoke(types<>, std::index_sequence<>, std::ptrdiff_t n ) const { int stacksize = lua_gettop( lua_state( ) ); int firstreturn = std::max( 1, stacksize - static_cast( n ) ); luacall(n, LUA_MULTRET); int poststacksize = lua_gettop( lua_state( ) ); int returncount = poststacksize - (firstreturn - 1); return function_result( lua_state( ), firstreturn, returncount ); } public: function( ) = default; function( lua_State* L, int index = -1 ) : reference( L, index ) { type_assert( L, index, type::function ); } function( const function& ) = default; function& operator=( const function& ) = default; function( function&& ) = default; function& operator=( function&& ) = default; template function_result operator()( Args&&... args ) const { return call<>( std::forward( args )... ); } template decltype(auto) operator()( types, Args&&... args ) const { return call( std::forward( args )... ); } template decltype(auto) call( Args&&... args ) const { push( ); int pushcount = stack::push_args( lua_state( ), std::forward( args )... ); return invoke( types( ), std::index_sequence_for(), pushcount ); } }; class protected_function : public reference { private: static reference& handler_storage() { static sol::reference h; return h; } public: static const reference& get_default_handler () { return handler_storage(); } static void set_default_handler( reference& ref ) { handler_storage() = ref; } private: struct handler { const reference& target; int stackindex; handler(const reference& target) : target(target), stackindex(0) { if (target.valid()) { stackindex = lua_gettop(target.lua_state()) + 1; target.push(); } } ~handler() { if (stackindex > 0) { lua_remove(target.lua_state(), stackindex); } } }; int luacall(std::ptrdiff_t argcount, std::ptrdiff_t resultcount, handler& h) const { return lua_pcallk(lua_state(), static_cast(argcount), static_cast(resultcount), h.stackindex, 0, nullptr); } template auto invoke(types, std::index_sequence, std::ptrdiff_t n, handler& h) const { luacall(n, sizeof...(Ret), h); int stacksize = lua_gettop(lua_state()); int firstreturn = std::max(0, stacksize - static_cast(sizeof...(Ret)) + 1); auto r = stack::get>(lua_state(), firstreturn); lua_pop(lua_state(), static_cast(sizeof...(Ret))); return r; } template Ret invoke(types, std::index_sequence, std::ptrdiff_t n, handler& h) const { luacall(n, 1, h); return stack::pop(lua_state()); } template void invoke(types, std::index_sequence, std::ptrdiff_t n, handler& h) const { luacall(n, 0, h); } protected_function_result invoke(types<>, std::index_sequence<>, std::ptrdiff_t n, handler& h) const { bool handlerpushed = error_handler.valid(); int stacksize = lua_gettop(lua_state()); int firstreturn = std::max(1, stacksize - static_cast(n) - 1); int returncount = 0; call_error code = call_error::ok; try { code = static_cast(luacall(n, LUA_MULTRET, h)); int poststacksize = lua_gettop(lua_state()); returncount = poststacksize - firstreturn; } // Handle C++ errors thrown from C++ functions bound inside of lua catch (const std::exception& error) { h.stackindex = 0; stack::push(lua_state(), error.what()); firstreturn = lua_gettop(lua_state()); return protected_function_result(lua_state(), firstreturn, 0, 1, call_error::runtime); } catch (...) { throw; } return protected_function_result(lua_state(), firstreturn + ( handlerpushed ? 0 : 1 ), returncount, returncount, code); } public: sol::reference error_handler; protected_function() = default; protected_function(lua_State* L, int index = -1): reference(L, index), error_handler(get_default_handler()) { type_assert(L, index, type::function); } protected_function(const protected_function&) = default; protected_function& operator=(const protected_function&) = default; protected_function( protected_function&& ) = default; protected_function& operator=( protected_function&& ) = default; template protected_function_result operator()(Args&&... args) const { return call<>(std::forward(args)...); } template decltype(auto) operator()(types, Args&&... args) const { return call(std::forward(args)...); } template decltype(auto) call(Args&&... args) const { handler h(error_handler); push(); int pushcount = stack::push_args(lua_state(), std::forward(args)...); return invoke(types(), std::index_sequence_for(), pushcount, h); } }; namespace stack { template struct pusher> { template> static void set_memfx(types t, lua_State* L, Fx&& fx) { typedef std::decay_t>> raw_fx_t; typedef R(* fx_ptr_t)(Args...); typedef std::is_convertible is_convertible; set_isconvertible_fx(is_convertible(), t, L, std::forward(fx)); } template static void set_memfx(types<>, lua_State* L, Fx&& fx) { typedef Unwrapped> fx_t; set(L, &fx_t::operator(), std::forward(fx)); } template static void set(lua_State* L, R fxptr(Args...)){ set_fx(std::false_type(), L, fxptr); } template static void set(lua_State* L, Sig* fxptr){ set_fx(std::false_type(), L, fxptr); } template static void set(lua_State* L, R (C::*memfxptr)(Args...), T&& obj) { typedef Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference; set_reference_fx(is_reference(), L, memfxptr, std::forward(obj)); } template static void set(lua_State* L, Sig C::* memfxptr, T&& obj) { typedef Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference; set_reference_fx(is_reference(), L, memfxptr, std::forward(obj)); } template static void set(lua_State* L, Fx&& fx) { set_memfx(types(), L, std::forward(fx)); } template static void set_isconvertible_fx(std::true_type, types, lua_State* L, Fx&& fx) { typedef R(* fx_ptr_t)(Args...); fx_ptr_t fxptr = unwrap(std::forward(fx)); set(L, fxptr); } template static void set_isconvertible_fx(std::false_type, types, lua_State* L, Fx&& fx) { typedef Unwrapped> fx_t; std::unique_ptr sptr(new functor_function(std::forward(fx))); set_fx(L, std::move(sptr)); } template static void set_reference_fx(std::true_type, lua_State* L, Fx&& fx, T&& obj) { set_fx(std::true_type(), L, std::forward(fx), std::forward(obj)); } template static void set_reference_fx(std::false_type, lua_State* L, Fx&& fx, T&& obj) { typedef std::remove_pointer_t> clean_fx; std::unique_ptr sptr(new member_function>(std::forward(obj), std::forward(fx))); return set_fx(L, std::move(sptr)); } template static void set_fx(std::true_type, lua_State* L, Fx&& fx, T&& obj) { // Layout: // idx 1...n: verbatim data of member function pointer // idx n + 1: is the object's void pointer // We don't need to store the size, because the other side is templated // with the same member function pointer type typedef std::decay_t dFx; typedef Unqualified uFx; dFx memfxptr(std::forward(fx)); auto userptr = ptr(obj); void* userobjdata = static_cast(userptr); lua_CFunction freefunc = &static_member_function, uFx>::call; int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr); upvalues += stack::push(L, userobjdata); stack::push(L, freefunc, upvalues); } template static void set_fx(std::false_type, lua_State* L, Fx&& fx) { std::decay_t target(std::forward(fx)); lua_CFunction freefunc = &static_function::call; int upvalues = stack::stack_detail::push_as_upvalues(L, target); stack::push(L, freefunc, upvalues); } template static void set_fx(lua_State* L, std::unique_ptr luafunc) { const static auto& metakey = u8"sol.ƒ.♲.🗑.(/¯◡ ‿ ◡)/¯ ~ ┻━┻ (ノ◕ヮ◕)ノ*:・゚✧"; const static char* metatablename = &metakey[0]; base_function* target = luafunc.release(); void* userdata = reinterpret_cast(target); lua_CFunction freefunc = detail::call; int metapushed = luaL_newmetatable(L, metatablename); if(metapushed == 1) { lua_pushstring(L, "__gc"); stack::push(L, detail::gc); lua_settable(L, -3); lua_pop(L, 1); } stack::stack_detail::push_userdata(L, metatablename, userdata); stack::push(L, freefunc, 1); } template static int push(lua_State* L, Args&&... args) { // Set will always place one thing (function) on the stack set(L, std::forward(args)...); return 1; } }; template struct pusher> { template static int push_func(std::index_sequence, lua_State* L, FP&& fp) { return stack::push(L, std::get(fp)...); } template static int push(lua_State* L, FP&& fp) { return push_func(std::index_sequence_for(), L, std::forward(fp)); } }; template struct pusher> { static int push(lua_State* L, std::function fx) { return pusher>{}.push(L, std::move(fx)); } }; template struct pusher> { template static int push(std::index_sequence, lua_State* L, Set&& set) { pusher>{}.set_fx(L, std::make_unique>(std::get(set)...)); return 1; } template static int push(lua_State* L, Set&& set) { return push(std::index_sequence_for(), L, std::forward(set)); } }; template struct getter> { typedef function_traits fx_t; typedef typename fx_t::args_type args_types; typedef tuple_types return_types; template static std::function get_std_func(types, types, lua_State* L, int index = -1) { sol::function f(L, index); auto fx = [f, L, index](Args&&... args) -> return_type_t { return f.call(std::forward(args)...); }; return std::move(fx); } template static std::function get_std_func(types, types, lua_State* L, int index = -1) { sol::function f(L, index); auto fx = [f, L, index](FxArgs&&... args) -> void { f(std::forward(args)...); }; return std::move(fx); } template static std::function get_std_func(types t, types<>, lua_State* L, int index = -1) { return get_std_func(std::move(t), types(), L, index); } static std::function get(lua_State* L, int index) { return get_std_func(args_types(), return_types(), L, index); } }; } // stack } // sol #endif // SOL_FUNCTION_HPP