X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/bc37fe765c04a93a0a7e9c5530558aa38589b70c..f021bb7ffaa82cc31dcfe9ccc8d1c34fd1940102:/include/xbt/functional.hpp diff --git a/include/xbt/functional.hpp b/include/xbt/functional.hpp index 99cba0d7e1..8b73dabeaf 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-2017. 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. */ @@ -21,8 +20,8 @@ #include #include -#include -#include +#include "xbt/sysdep.h" +#include "xbt/utility.hpp" namespace simgrid { namespace xbt { @@ -41,11 +40,15 @@ public: { 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); } }; @@ -78,7 +81,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 +117,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 +170,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 +184,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 +195,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 +209,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 +234,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 +256,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; } @@ -285,7 +293,7 @@ auto makeTask(F code, Args... args) -> Task< decltype(code(std::move(args)...))() > { TaskImpl task(std::move(code), std::make_tuple(std::move(args)...)); - return std::move(task); + return Task(std::move(task)); } }