X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/8f2e8075d660a354a3aabf065998f42802f9cc11..a96793ec8c496eec19daf68f3aa0c4eded2ea166:/include/xbt/functional.hpp diff --git a/include/xbt/functional.hpp b/include/xbt/functional.hpp index 1f8abfbb20..1fefcd8473 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-2019. 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,116 +6,60 @@ #ifndef XBT_FUNCTIONAL_HPP #define XBT_FUNCTIONAL_HPP +#include +#include + +#include #include +#include +#include #include #include -#include -#include +#include +#include #include - -#include -#include +#include +#include +#include namespace simgrid { namespace xbt { -class args { -private: - int argc_ = 0; - char** argv_ = nullptr; -public: - - // Main constructors - args() {} - - void assign(int argc, const char*const* argv) - { - clear(); - char** new_argv = xbt_new(char*,argc + 1); - for (int i = 0; i < argc; i++) - new_argv[i] = xbt_strdup(argv[i]); - new_argv[argc] = nullptr; - this->argc_ = argc; - this->argv_ = new_argv; - } - args(int argc, const char*const* argv) - { - this->assign(argc, argv); - } - - char** to_argv() const - { - const int argc = argc_; - char** argv = xbt_new(char*, argc + 1); - for (int i=0; i< argc; i++) - argv[i] = xbt_strdup(argv_[i]); - argv[argc] = nullptr; - return argv; - } - - // Free - void clear() - { - for (int i = 0; i < this->argc_; i++) - std::free(this->argv_[i]); - std::free(this->argv_); - this->argc_ = 0; - this->argv_ = nullptr; - } - ~args() { clear(); } - - // Copy - args(args const& that) - { - this->assign(that.argc(), that.argv()); - } - args& operator=(args const& that) - { - this->assign(that.argc(), that.argv()); - return *this; - } +template class MainFunction { + F code_; + std::shared_ptr> args_; - // Move: - args(args&& that) : argc_(that.argc_), argv_(that.argv_) +public: + MainFunction(F code, std::vector&& args) + : code_(std::move(code)), args_(std::make_shared>(std::move(args))) { - that.argc_ = 0; - that.argv_ = nullptr; } - args& operator=(args&& that) + void operator()() const { - this->argc_ = that.argc_; - this->argv_ = that.argv_; - that.argc_ = 0; - that.argv_ = nullptr; - return *this; + const int argc = args_->size(); + std::vector args = *args_; + 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); } - - int argc() const { return argc_; } - char** argv() { return argv_; } - const char*const* argv() const { return argv_; } - char* operator[](std::size_t i) { return argv_[i]; } }; -template inline -std::function wrapMain(F code, std::shared_ptr args) -{ - return [=]() { - code(args->argc(), args->argv()); - }; -} - -template inline -std::function wrapMain(F code, simgrid::xbt::args args) +template inline std::function wrap_main(F code, std::vector&& args) { - return wrapMain(std::move(code), - std::unique_ptr(new simgrid::xbt::args(std::move(args)))); + return MainFunction(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[]) { - return wrapMain(std::move(code), args(argc, argv)); + std::vector args(argv, argv + argc); + return MainFunction(std::move(code), std::move(args)); } namespace bits { @@ -135,7 +78,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) @@ -165,70 +108,174 @@ template class Task; */ template class Task { -private: - // Type-erasure for the code: - class Base { - public: - virtual ~Base() {} - virtual R operator()(Args...) = 0; - }; + // Placeholder for some class type: + struct whatever {}; + + // Union used for storage: + typedef typename std::aligned_union<0, + void*, + std::pair, + std::pair + >::type TaskUnion; + + // Is F suitable for small buffer optimization? template - class Impl : public Base { - public: - Impl(F&& code) : code_(std::move(code)) {} - Impl(F const& code) : code_(code) {} - ~Impl() override {} - R operator()(Args... args) - { - return code_(std::forward(args)...); - } - private: - F code_; + static constexpr bool canSBO() + { + return sizeof(F) <= sizeof(TaskUnion) && + alignof(F) <= alignof(TaskUnion); + } + + static_assert(canSBO>(), + "SBO not working for reference_wrapper"); + + // Call (and possibly destroy) the function: + typedef R (*call_function)(TaskUnion&, Args...); + // Destroy the function (of needed): + typedef void (*destroy_function)(TaskUnion&); + // Move the function (otherwise memcpy): + typedef void (*move_function)(TaskUnion& dest, TaskUnion& src); + + // Vtable of functions for manipulating whatever is in the TaskUnion: + struct TaskVtable { + call_function call; + destroy_function destroy; + move_function move; }; - std::unique_ptr code_; + + TaskUnion buffer_; + const TaskVtable* vtable_ = nullptr; + + void clear() + { + if (vtable_ && vtable_->destroy) + vtable_->destroy(buffer_); + } + public: - Task() {} - Task(std::nullptr_t) {} + Task() { /* Nothing to do */} + explicit Task(std::nullptr_t) { /* Nothing to do */} + ~Task() + { + this->clear(); + } + + Task(Task const&) = delete; + + Task(Task&& that) + { + if (that.vtable_ && that.vtable_->move) + that.vtable_->move(buffer_, that.buffer_); + else + std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); + vtable_ = that.vtable_; + that.vtable_ = nullptr; + } + Task& operator=(Task const& that) = delete; + Task& operator=(Task&& that) + { + this->clear(); + if (that.vtable_ && that.vtable_->move) + that.vtable_->move(buffer_, that.buffer_); + else + std::memcpy(static_cast(&buffer_), static_cast(&that.buffer_), sizeof(buffer_)); + vtable_ = that.vtable_; + that.vtable_ = nullptr; + return *this; + } + +private: template - Task(F&& code) : - code_(new Impl(std::forward(code))) {} + typename std::enable_if()>::type + init(F code) + { + const static TaskVtable vtable { + // Call: + [](TaskUnion& buffer, Args&&... args) { + F* src = reinterpret_cast(&buffer); + F code = std::move(*src); + src->~F(); + return code(std::forward(args)...); + }, + // Destroy: + std::is_trivially_destructible::value ? + static_cast(nullptr) : + [](TaskUnion& buffer) { + F* code = reinterpret_cast(&buffer); + code->~F(); + }, + // Move: + [](TaskUnion& dst, TaskUnion& src) { + F* src_code = reinterpret_cast(&src); + F* dst_code = reinterpret_cast(&dst); + new(dst_code) F(std::move(*src_code)); + src_code->~F(); + } + }; + new(&buffer_) F(std::move(code)); + vtable_ = &vtable; + } + + template typename std::enable_if()>::type init(F code) + { + const static TaskVtable vtable { + // Call: + [](TaskUnion& buffer, Args&&... args) { + // Delete F when we go out of scope: + std::unique_ptr code(*reinterpret_cast(&buffer)); + return (*code)(std::forward(args)...); + }, + // Destroy: + [](TaskUnion& buffer) { + F* code = *reinterpret_cast(&buffer); + delete code; + }, + // Move: + nullptr + }; + *reinterpret_cast(&buffer_) = new F(std::move(code)); + vtable_ = &vtable; + } - operator bool() const { return code_ != nullptr; } - bool operator!() const { return code_ == nullptr; } +public: + template explicit Task(F code) { this->init(std::move(code)); } - template - R operator()(OtherArgs&&... args) + operator bool() const { return vtable_ != nullptr; } + bool operator!() const { return vtable_ == nullptr; } + + R operator()(Args&&... args) { - std::unique_ptr code = std::move(code_); - return (*code)(std::forward(args)...); + if (vtable_ == nullptr) + throw std::bad_function_call(); + const TaskVtable* vtable = vtable_; + vtable_ = nullptr; + return vtable->call(buffer_, std::forward(args)...); } }; template -auto makeTask(F code, Args... args) --> Task< decltype(code(std::move(args)...))() > -{ - typedef decltype(code(std::move(args)...)) result_type; - - class Impl { - private: - F code_; - std::tuple args_; - public: - Impl(F code, std::tuple args) : - code_(std::move(code)), - args_(std::move(args)) {} - result_type operator()() - { - return simgrid::xbt::apply(std::move(code_), std::move(args_)); - } - }; - - return Impl(std::move(code), std::make_tuple(std::move(args)...)); -} +class TaskImpl { + F code_; + std::tuple args_; + typedef decltype(simgrid::xbt::apply(std::move(code_), std::move(args_))) result_type; +public: + TaskImpl(F code, std::tuple args) : + code_(std::move(code)), + args_(std::move(args)) + {} + result_type operator()() + { + return simgrid::xbt::apply(std::move(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 Task(std::move(task)); } +} // namespace xbt +} // namespace simgrid #endif