71 lines
2.7 KiB
C
71 lines
2.7 KiB
C
|
// Copyright (c) 2015 Amanieu d'Antras
|
||
|
|
//
|
||
|
|
// 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 ASYNCXX_H_
|
||
|
|
# error "Do not include this header directly, include <async++.h> instead."
|
||
|
|
#endif
|
||
|
|
|
||
|
|
namespace async {
|
||
|
|
namespace detail {
|
||
|
|
|
||
|
|
// Recursively split the arguments so tasks are spawned in parallel
|
||
|
|
template<std::size_t Start, std::size_t Count>
|
||
|
|
struct parallel_invoke_internal {
|
||
|
|
template<typename Sched, typename Tuple>
|
||
|
|
static void run(Sched& sched, const Tuple& args)
|
||
|
|
{
|
||
|
|
auto&& t = async::local_spawn(sched, [&sched, &args] {
|
||
|
|
parallel_invoke_internal<Start + Count / 2, Count - Count / 2>::run(sched, args);
|
||
|
|
});
|
||
|
|
parallel_invoke_internal<Start, Count / 2>::run(sched, args);
|
||
|
|
t.get();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
template<std::size_t Index>
|
||
|
|
struct parallel_invoke_internal<Index, 1> {
|
||
|
|
template<typename Sched, typename Tuple>
|
||
|
|
static void run(Sched&, const Tuple& args)
|
||
|
|
{
|
||
|
|
// Make sure to preserve the rvalue/lvalue-ness of the original parameter
|
||
|
|
std::forward<typename std::tuple_element<Index, Tuple>::type>(std::get<Index>(args))();
|
||
|
|
}
|
||
|
|
};
|
||
|
|
template<std::size_t Index>
|
||
|
|
struct parallel_invoke_internal<Index, 0> {
|
||
|
|
template<typename Sched, typename Tuple>
|
||
|
|
static void run(Sched&, const Tuple&) {}
|
||
|
|
};
|
||
|
|
|
||
|
|
} // namespace detail
|
||
|
|
|
||
|
|
// Run several functions in parallel, optionally using the specified scheduler.
|
||
|
|
template<typename Sched, typename... Args>
|
||
|
|
typename std::enable_if<detail::is_scheduler<Sched>::value>::type parallel_invoke(Sched& sched, Args&&... args)
|
||
|
|
{
|
||
|
|
detail::parallel_invoke_internal<0, sizeof...(Args)>::run(sched, std::forward_as_tuple(std::forward<Args>(args)...));
|
||
|
|
}
|
||
|
|
template<typename... Args>
|
||
|
|
void parallel_invoke(Args&&... args)
|
||
|
|
{
|
||
|
|
async::parallel_invoke(::async::default_scheduler(), std::forward<Args>(args)...);
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace async
|