// sol2 // The MIT License (MIT) // Copyright (c) 2013-2022 Rapptz, ThePhD 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 #include #include #include #include namespace sol { template decltype(auto) stack_proxy::call(Args&&... args) { stack_function sf(this->lua_state(), this->stack_index()); return sf.template call(std::forward(args)...); } inline protected_function_result::protected_function_result(unsafe_function_result&& o) noexcept : L(o.lua_state()), index(o.stack_index()), returncount(o.return_count()), popcount(o.return_count()), err(o.status()) { // Must be manual, otherwise destructor will screw us // return count being 0 is enough to keep things clean // but we will be thorough o.abandon(); } inline protected_function_result& protected_function_result::operator=(unsafe_function_result&& o) noexcept { L = o.lua_state(); index = o.stack_index(); returncount = o.return_count(); popcount = o.return_count(); err = o.status(); // Must be manual, otherwise destructor will screw us // return count being 0 is enough to keep things clean // but we will be thorough o.abandon(); return *this; } inline unsafe_function_result::unsafe_function_result(protected_function_result&& o) noexcept : L(o.lua_state()), index(o.stack_index()), returncount(o.return_count()) { // Must be manual, otherwise destructor will screw us // return count being 0 is enough to keep things clean // but we will be thorough o.abandon(); } inline unsafe_function_result& unsafe_function_result::operator=(protected_function_result&& o) noexcept { L = o.lua_state(); index = o.stack_index(); returncount = o.return_count(); // Must be manual, otherwise destructor will screw us // return count being 0 is enough to keep things clean // but we will be thorough o.abandon(); return *this; } namespace detail { template struct std_shim { unsafe_function lua_func_; std_shim(unsafe_function lua_func) : lua_func_(std::move(lua_func)) { } template meta::return_type_t operator()(Args&&... args) { return lua_func_.call(std::forward(args)...); } }; template <> struct std_shim { unsafe_function lua_func_; std_shim(unsafe_function lua_func) : lua_func_(std::move(lua_func)) { } template void operator()(Args&&... args) { lua_func_.call(std::forward(args)...); } }; } // namespace detail namespace stack { template struct unqualified_getter> { typedef meta::bind_traits fx_t; typedef typename fx_t::args_list args_lists; typedef meta::tuple_types return_types; template static std::function get_std_func(types, lua_State* L, int index) { detail::std_shim fx(unsafe_function(L, index)); return fx; } static std::function get(lua_State* L, int index, record& tracking) { tracking.use(1); type t = type_of(L, index); if (t == type::none || t == type::lua_nil) { return nullptr; } return get_std_func(return_types(), L, index); } }; template struct unqualified_getter> { static basic_bytecode get(lua_State* L, int index, record& tracking) { tracking.use(1); stack_function sf(L, index); return sf.dump(&dump_panic_on_error); } }; } // namespace stack } // namespace sol #endif // SOL_FUNCTION_HPP