X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/871107618b8c0e08361b84990c5c4a35ae4188e6..da782b62777961ea5041717ec5ae80248d6d5785:/include/xbt/functional.hpp diff --git a/include/xbt/functional.hpp b/include/xbt/functional.hpp index 99cba0d7e1..48803e619e 100644 --- a/include/xbt/functional.hpp +++ b/include/xbt/functional.hpp @@ -1,5 +1,4 @@ -/* Copyright (c) 2015-2016. The SimGrid Team. - * All rights reserved. */ +/* Copyright (c) 2015-2018. The SimGrid Team. All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -7,6 +6,9 @@ #ifndef XBT_FUNCTIONAL_HPP #define XBT_FUNCTIONAL_HPP +#include +#include + #include #include #include @@ -21,42 +23,45 @@ #include #include -#include -#include - namespace simgrid { namespace xbt { -template -class MainFunction { +template class MainFunction { private: F code_; std::shared_ptr> args_; + public: - MainFunction(F code, std::vector args) : - code_(std::move(code)), - args_(std::make_shared>(std::move(args))) - {} + MainFunction(F code, std::vector args) + : code_(std::move(code)), args_(std::make_shared>(std::move(args))) + { + } void operator()() const { - const int argc = args_->size(); + const int argc = args_->size(); std::vector args = *args_; - std::unique_ptr argv(new char*[argc + 1]); - for (int i = 0; i != argc; ++i) - argv[i] = args[i].empty() ? const_cast(""): &args[i].front(); - argv[argc] = nullptr; - code_(argc, argv.get()); + if (not args.empty()) { + char noarg[] = {'\0'}; + std::unique_ptr argv(new char*[argc + 1]); + for (int i = 0; i != argc; ++i) + argv[i] = args[i].empty() ? noarg : &args[i].front(); + argv[argc] = nullptr; + code_(argc, argv.get()); + } else + code_(argc, nullptr); } }; -template inline -std::function wrapMain(F code, std::vector args) +template inline std::function wrap_main(F code, std::vector args) { return MainFunction(std::move(code), std::move(args)); } +inline std::function wrap_main(void (*code)(std::vector), std::vector args) +{ + return std::bind(std::move(code), std::move(args)); +} -template inline -std::function wrapMain(F code, int argc, const char*const argv[]) +template inline std::function wrap_main(F code, int argc, const char* const argv[]) { std::vector args(argv, argv + argc); return MainFunction(std::move(code), std::move(args)); @@ -78,7 +83,7 @@ constexpr auto apply(F&& f, Tuple&& t, simgrid::xbt::index_sequence) * * auto args = std::make_tuple(1, false); * int res = apply(foo, args); - * @encode + * @endcode **/ template constexpr auto apply(F&& f, Tuple&& t) @@ -114,11 +119,23 @@ private: struct whatever {}; // Union used for storage: +#if 0 typedef typename std::aligned_union<0, void*, std::pair, std::pair >::type TaskUnion; +#else + union TaskUnion { + void* ptr; + std::pair funcptr; + std::pair memberptr; + char any1[sizeof(std::pair)]; + char any2[sizeof(std::pair)]; + TaskUnion() { /* Nothing to do */} + ~TaskUnion() { /* Nothing to do */} + }; +#endif // Is F suitable for small buffer optimization? template @@ -155,9 +172,8 @@ private: } public: - - Task() {} - Task(std::nullptr_t) {} + Task() { /* Nothing to do */} + explicit Task(std::nullptr_t) { /* Nothing to do */} ~Task() { this->clear(); @@ -170,7 +186,8 @@ public: if (that.vtable_ && that.vtable_->move) that.vtable_->move(buffer_, that.buffer_); else - std::memcpy(&buffer_, &that.buffer_, sizeof(buffer_)); + std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); + vtable_ = that.vtable_; that.vtable_ = nullptr; } @@ -180,7 +197,7 @@ public: if (that.vtable_ && that.vtable_->move) that.vtable_->move(buffer_, that.buffer_); else - std::memcpy(&buffer_, &that.buffer_, sizeof(buffer_)); + std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); vtable_ = that.vtable_; that.vtable_ = nullptr; return *this; @@ -194,11 +211,11 @@ private: { const static TaskVtable vtable { // Call: - [](TaskUnion& buffer, Args... args) -> R { + [](TaskUnion& buffer, Args... args) { F* src = reinterpret_cast(&buffer); F code = std::move(*src); src->~F(); - code(std::forward(args)...); + return code(std::forward(args)...); }, // Destroy: std::is_trivially_destructible::value ? @@ -219,16 +236,14 @@ private: vtable_ = &vtable; } - template - typename std::enable_if()>::type - init(F code) + template typename std::enable_if()>::type init(F code) { const static TaskVtable vtable { // Call: - [](TaskUnion& buffer, Args... args) -> R { + [](TaskUnion& buffer, Args... args) { // Delete F when we go out of scope: std::unique_ptr code(*reinterpret_cast(&buffer)); - (*code)(std::forward(args)...); + return (*code)(std::forward(args)...); }, // Destroy: [](TaskUnion& buffer) { @@ -243,12 +258,7 @@ private: } public: - - template - Task(F code) - { - this->init(std::move(code)); - } + template explicit Task(F code) { this->init(std::move(code)); } operator bool() const { return vtable_ != nullptr; } bool operator!() const { return vtable_ == nullptr; } @@ -280,15 +290,36 @@ public: } }; -template -auto makeTask(F code, Args... args) --> Task< decltype(code(std::move(args)...))() > +template auto make_task(F code, Args... args) -> Task { TaskImpl task(std::move(code), std::make_tuple(std::move(args)...)); - return std::move(task); + return Task(std::move(task)); } +// Deprecated +template +XBT_ATTRIB_DEPRECATED_v323("Please use make_task()") auto makeTask(F code, Args... args) + -> Task +{ + TaskImpl task(std::move(code), std::make_tuple(std::move(args)...)); + return Task(std::move(task)); } + +template +inline XBT_ATTRIB_DEPRECATED_v323("Please use wrap_main()") std::function wrapMain( + F code, std::vector args) +{ + return MainFunction(std::move(code), std::move(args)); +} + +template +inline XBT_ATTRIB_DEPRECATED_v323("Please use wrap_main()") std::function wrapMain(F code, int argc, + const char* const argv[]) +{ + std::vector args(argv, argv + argc); + return MainFunction(std::move(code), std::move(args)); } +} // namespace xbt +} // namespace simgrid #endif