DriveHQ Start Menu
Cloud Drive Mapping
Folder Sync
Cloud Backup
True Drop Box
FTP/SFTP Hosting
Group Account
DriveHQ Start Menu
Online File Server
My Storage
|
Manage Shares
|
Publishes
|
Drop Boxes
|
Group Account
WebDAV Drive Mapping
Cloud Drive Home
|
WebDAV Guide
|
Drive Mapping Tool
|
Drive Mapping URL
Complete Data Backup
Backup Guide
|
Online Backup Tool
|
Cloud-to-Cloud Backup
FTP, Email & Web Service
FTP Home
|
FTP Hosting FAQ
|
Email Hosting
|
EmailManager
|
Web Hosting
Help & Resources
About
|
Enterprise Service
|
Partnership
|
Comparisons
|
Support
Quick Links
Security and Privacy
Download Software
Service Manual
Use Cases
Group Account
Online Help
Blog
Contact
Cloud Surveillance
Sign Up
Login
Features
Business Features
Online File Server
FTP Hosting
Cloud Drive Mapping
Cloud File Backup
Email Backup & Hosting
Cloud File Sharing
Folder Synchronization
Group Management
True Drop Box
Full-text Search
AD Integration/SSO
Mobile Access
IP Camera & DVR Solution
More...
Personal Features
Personal Cloud Drive
Backup All Devices
Mobile APPs
Personal Web Hosting
Sub-Account (for Kids)
Home/PC/Kids Monitoring
More...
Software
DriveHQ Drive Mapping Tool
DriveHQ FileManager
DriveHQ Online Backup
DriveHQ Mobile Apps
Pricing
Business Plans & Pricing
Personal Plans & Pricing
Price Comparison with Others
Feature Comparison with Others
Install Mobile App
Sign up
Creating account...
Invalid character in username! Only 0-9, a-z, A-Z, _, -, . allowed.
Username is required!
Invalid email address!
E-mail is required!
Password is required!
Password is invalid!
Password and confirmation do not match.
Confirm password is required!
I accept
Membership Agreement
Please read the Membership Agreement and check "I accept"!
Free Quick Sign-up
Sign-up Page
Log in
Signing in...
Username or e-mail address is required!
Password is required!
Keep me logged in
Quick Login
Forgot Password
Up
Upload
Download
Share
Publish
New Folder
New File
Copy
Cut
Delete
Paste
Rate
Upgrade
Rotate
Effect
Edit
Slide
History
// Copyright (c) 2003 Daniel Wallin and Arvid Norberg // 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. #if !BOOST_PP_IS_ITERATING #ifndef LUABIND_FUNCTION_HPP_INCLUDED #define LUABIND_FUNCTION_HPP_INCLUDED #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace luabind { namespace detail { namespace mpl = boost::mpl; namespace free_functions { struct overload_rep: public overload_rep_base { #define BOOST_PP_ITERATION_PARAMS_1 (4, (0, LUABIND_MAX_ARITY,
, 1)) #include BOOST_PP_ITERATE() inline bool operator==(const overload_rep& o) const { if (o.m_arity != m_arity) return false; if (o.m_params_.size() != m_params_.size()) return false; for (int i = 0; i < (int)m_params_.size(); ++i) if (!(LUABIND_TYPE_INFO_EQUAL(m_params_[i], o.m_params_[i]))) return false; return true; } typedef int(*call_ptr)(lua_State*, void(*)()); inline void set_fun(call_ptr f) { call_fun = f; } inline int call(lua_State* L, void(*f)()) const { return call_fun(L, f); } // this is the actual function pointer to be called when this overload is invoked void (*fun)(); //TODO: private: call_ptr call_fun; // the types of the parameter it takes std::vector
m_params_; char end; }; struct LUABIND_API function_rep { function_rep(const char* name): m_name(name) {} void add_overload(const free_functions::overload_rep& o); const std::vector
& overloads() const throw() { return m_overloads; } const char* name() const { return m_name; } private: const char* m_name; // this have to be write protected, since each time an overload is // added it has to be checked for existence. add_overload() should // be used. std::vector
m_overloads; }; // returns generates functions that calls function pointers #define LUABIND_DECL(z, n, text) typedef typename find_conversion_policy
::type BOOST_PP_CAT(converter_policy,n); \ typename mpl::apply_wrap2< \ BOOST_PP_CAT(converter_policy,n), BOOST_PP_CAT(A,n), lua_to_cpp \ >::type BOOST_PP_CAT(c,n); #define LUABIND_ADD_INDEX(z,n,text) + BOOST_PP_CAT(converter_policy,n)::has_arg #define LUABIND_INDEX_MAP(z,n,text) 1 BOOST_PP_REPEAT(n, LUABIND_ADD_INDEX, _) #define LUABIND_PARAMS(z,n,text) BOOST_PP_CAT(c,n).apply(L, LUABIND_DECORATE_TYPE(A##n), LUABIND_INDEX_MAP(_,n,_)) #define LUABIND_POSTCALL(z,n,text) BOOST_PP_CAT(c,n).converter_postcall(L, LUABIND_DECORATE_TYPE(A##n), LUABIND_INDEX_MAP(_,n,_)); template
struct maybe_yield { static inline int apply(lua_State* L, int nret) { return ret(L, nret, boost::mpl::bool_
::value>()); } static inline int ret(lua_State* L, int nret, boost::mpl::bool_
) { return lua_yield(L, nret); } static inline int ret(lua_State*, int nret, boost::mpl::bool_
) { return nret; } }; template
struct returns { #define BOOST_PP_ITERATION_PARAMS_1 (4, (0, LUABIND_MAX_ARITY,
, 2)) #include BOOST_PP_ITERATE() }; template<> struct returns
{ #define BOOST_PP_ITERATION_PARAMS_1 (4, (0, LUABIND_MAX_ARITY,
, 3)) #include BOOST_PP_ITERATE() }; #define BOOST_PP_ITERATION_PARAMS_1 (4, (0, LUABIND_MAX_ARITY,
, 4)) #include BOOST_PP_ITERATE() #undef LUABIND_PARAMS #undef LUABIND_DECL #undef LUABIND_POSTCALL #undef LUABIND_ADD_INDEX #undef LUABIND_INDEX_MAP #define BOOST_PP_ITERATION_PARAMS_1 (4, (0, LUABIND_MAX_ARITY,
, 5)) #include BOOST_PP_ITERATE() template
struct function_callback_s { static inline int apply(lua_State* L, void(*fun)()) { return free_functions::call(reinterpret_cast
(fun), L, static_cast
(0)); } }; template
struct match_function_callback_s { static inline int apply(lua_State* L) { F fptr = 0; return free_functions::match(fptr, L, static_cast
(0)); } static int callback(lua_State* L) { F fptr = 0; return free_functions::match(fptr, L, static_cast
(0)); } }; LUABIND_API int function_dispatcher(lua_State* L); } } // deprecated template
void function(lua_State* L, const char* name, F f, const Policies& p) { module(L) [ def(name, f, p) ]; } // deprecated template
void function(lua_State* L, const char* name, F f) { luabind::function(L, name, f, detail::null_type()); } namespace detail { template
struct function_commiter : detail::registration { function_commiter(const char* n, F f, const Policies& p) : m_name(n) , fun(f) , policies(p) {} virtual void register_(lua_State* L) const { detail::free_functions::overload_rep o(fun, static_cast
(0)); o.set_match_fun(&detail::free_functions::match_function_callback_s
::apply); o.set_fun(&detail::free_functions::function_callback_s
::apply); #ifndef LUABIND_NO_ERROR_CHECKING o.set_sig_fun(&detail::get_free_function_signature
::apply); #endif lua_pushstring(L, m_name); lua_gettable(L, -2); detail::free_functions::function_rep* rep = 0; if (lua_iscfunction(L, -1)) { if (lua_getupvalue(L, -1, 2) != 0) { // check the magic number that identifies luabind's functions if (lua_touserdata(L, -1) == (void*)0x1337) { if (lua_getupvalue(L, -2, 1) != 0) { rep = static_cast
(lua_touserdata(L, -1)); lua_pop(L, 1); } } lua_pop(L, 1); } } lua_pop(L, 1); if (rep == 0) { lua_pushstring(L, m_name); // create a new function_rep rep = static_cast
(lua_newuserdata(L, sizeof(detail::free_functions::function_rep))); new(rep) detail::free_functions::function_rep(m_name); // STORE IN REGISTRY lua_pushvalue(L, -1); detail::ref(L); detail::class_registry* r = detail::class_registry::get_registry(L); assert(r && "you must call luabind::open() prior to any function registrations"); detail::getref(L, r->lua_function()); int ret = lua_setmetatable(L, -2); (void)ret; assert(ret != 0); // this is just a magic number to identify functions that luabind created lua_pushlightuserdata(L, (void*)0x1337); lua_pushcclosure(L, &free_functions::function_dispatcher, 2); lua_settable(L, -3); } rep->add_overload(o); } char const* m_name; F fun; Policies policies; }; } template
scope def(const char* name, F f, const Policies& policies) { return scope(std::auto_ptr
( new detail::function_commiter
(name, f, policies))); } template
scope def(const char* name, F f) { return scope(std::auto_ptr
( new detail::function_commiter
( name, f, detail::null_type()))); } } // namespace luabind #endif // LUABIND_FUNCTION_HPP_INCLUDED #elif BOOST_PP_ITERATION_FLAGS() == 1 // overloaded template funtion that initializes the parameter list // called m_params and the m_arity member. #define LUABIND_INIT_PARAM(z, n, _) m_params_.push_back(LUABIND_TYPEID(A##n)); #define LUABIND_POLICY_DECL(z,n,text) typedef typename find_conversion_policy
::type BOOST_PP_CAT(p,n); #define LUABIND_ARITY(z,n,text) + BOOST_PP_CAT(p,n)::has_arg template
overload_rep(R(*f)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), A)), Policies*) : fun(reinterpret_cast
(f)) { m_params_.reserve(BOOST_PP_ITERATION()); BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_INIT_PARAM, _) BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_POLICY_DECL, _) m_arity = 0 BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_ARITY, _); } #undef LUABIND_INIT_PARAM #undef LUABIND_POLICY_DECL #undef LUABIND_ARITY #elif BOOST_PP_ITERATION_FLAGS() == 2 template
static int call(T(*f)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), A)), lua_State* L, const Policies*) { int nargs = lua_gettop(L); typedef typename find_conversion_policy<0, Policies>::type converter_policy_ret; typename mpl::apply_wrap2
::type converter_ret; BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_DECL, _) converter_ret.apply(L, f ( BOOST_PP_ENUM(BOOST_PP_ITERATION(), LUABIND_PARAMS, _) )); BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_POSTCALL, _) int nret = lua_gettop(L) - nargs; const int indices[] = { -1 /* self */, nargs + nret /* result*/ BOOST_PP_ENUM_TRAILING(BOOST_PP_ITERATION(), LUABIND_INDEX_MAP, _) }; policy_list_postcall
::apply(L, indices); return maybe_yield
::apply(L, nret); } #elif BOOST_PP_ITERATION_FLAGS() == 3 template
static int call(void(*f)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), A)), lua_State* L, const Policies*) { int nargs = lua_gettop(L); BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_DECL, _) f ( BOOST_PP_ENUM(BOOST_PP_ITERATION(), LUABIND_PARAMS, _) ); BOOST_PP_REPEAT(BOOST_PP_ITERATION(), LUABIND_POSTCALL, _) int nret = lua_gettop(L) - nargs; const int indices[] = { -1 /* self */, nargs + nret /* result*/ BOOST_PP_ENUM_TRAILING(BOOST_PP_ITERATION(), LUABIND_INDEX_MAP, _) }; policy_list_postcall
::apply(L, indices); return maybe_yield
::apply(L, nret); } #elif BOOST_PP_ITERATION_FLAGS() == 4 template
int call(R(*f)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), A)), lua_State* L, const Policies* policies) { return free_functions::returns
::call(f, L, policies); } #elif BOOST_PP_ITERATION_FLAGS() == 5 template
static int match(R(*)(BOOST_PP_ENUM_PARAMS(BOOST_PP_ITERATION(), A)), lua_State* L, const Policies* policies) { //if (lua_gettop(L) != BOOST_PP_ITERATION()) return -1; typedef constructor
ParameterTypes; return match_params(L, 1, static_cast
(0), policies); } #endif
function.hpp
Page URL
File URL
Prev
13/31
Next
Download
( 12 KB )
Note: The DriveHQ service banners will NOT be displayed if the file owner is a paid member.
Comments
Total ratings:
0
Average rating:
Not Rated
Would you like to comment?
Join DriveHQ
for a free account, or
Logon
if you are already a member.