
This patch rebases the C++17 parallel algorithms implementation (pstl) against the current upstream version, commit 843c12d6a. This version does not currently include the recently added OpenMP backend, that will be considered for a future version. libstdc++-v3/ChangeLog: * include/pstl/algorithm_fwd.h: Synchronize with upstream. * include/pstl/algorithm_impl.h: Likewise. * include/pstl/execution_defs.h: Likewise. * include/pstl/execution_impl.h: Likewise. * include/pstl/glue_algorithm_impl.h: Likewise. * include/pstl/glue_execution_defs.h: Likewise. * include/pstl/glue_memory_impl.h: Likewise. * include/pstl/glue_numeric_impl.h: Likewise. * include/pstl/memory_impl.h: Likewise. * include/pstl/numeric_fwd.h: Likewise. * include/pstl/numeric_impl.h: Likewise. * include/pstl/parallel_backend.h: Likewise. * include/pstl/parallel_backend_serial.h: Likewise. * include/pstl/parallel_backend_tbb.h: Likewise. * include/pstl/parallel_impl.h: Likewise. * include/pstl/pstl_config.h: Likewise. * include/pstl/unseq_backend_simd.h: Likewise. * include/pstl/utils.h: Likewise. * testsuite/20_util/specialized_algorithms/pstl/uninitialized_construct.cc: Likewise. * testsuite/20_util/specialized_algorithms/pstl/uninitialized_copy_move.cc: Likewise. * testsuite/20_util/specialized_algorithms/pstl/uninitialized_fill_destroy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_merge/inplace_merge.cc: Likewise. * testsuite/25_algorithms/pstl/alg_merge/merge.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/copy_if.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/copy_move.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/fill.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/generate.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/is_partitioned.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/partition.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/partition_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/remove.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/remove_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/replace.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/replace_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/rotate.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/rotate_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/swap_ranges.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/transform_binary.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/transform_unary.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/unique.cc: Likewise. * testsuite/25_algorithms/pstl/alg_modifying_operations/unique_copy_equal.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/adjacent_find.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/all_of.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/any_of.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/count.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/equal.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/find.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/find_end.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/find_first_of.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/find_if.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/for_each.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/mismatch.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/none_of.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/nth_element.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/reverse.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/reverse_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_nonmodifying/search_n.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/includes.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/is_heap.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/is_sorted.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/lexicographical_compare.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/minmax_element.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/partial_sort.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/partial_sort_copy.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/set.cc: Likewise. * testsuite/25_algorithms/pstl/alg_sorting/sort.cc: Likewise. * testsuite/26_numerics/pstl/numeric_ops/adjacent_difference.cc: Likewise. * testsuite/26_numerics/pstl/numeric_ops/reduce.cc: Likewise. * testsuite/26_numerics/pstl/numeric_ops/scan.cc: Likewise. * testsuite/26_numerics/pstl/numeric_ops/transform_reduce.cc: Likewise. * testsuite/26_numerics/pstl/numeric_ops/transform_scan.cc: Likewise. * testsuite/util/pstl/test_utils.h: Likewise.
173 lines
3.5 KiB
C++
173 lines
3.5 KiB
C++
// -*- C++ -*-
|
|
//===-- utils.h -----------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _PSTL_UTILS_H
|
|
#define _PSTL_UTILS_H
|
|
|
|
#include <new>
|
|
#include <type_traits>
|
|
|
|
namespace __pstl
|
|
{
|
|
namespace __internal
|
|
{
|
|
|
|
template <typename _Fp>
|
|
auto
|
|
__except_handler(_Fp __f) -> decltype(__f())
|
|
{
|
|
try
|
|
{
|
|
return __f();
|
|
}
|
|
catch (const std::bad_alloc&)
|
|
{
|
|
throw; // re-throw bad_alloc according to the standard [algorithms.parallel.exceptions]
|
|
}
|
|
catch (...)
|
|
{
|
|
std::__terminate(); // Good bye according to the standard [algorithms.parallel.exceptions]
|
|
}
|
|
}
|
|
|
|
template <typename _Fp>
|
|
void
|
|
__invoke_if(std::true_type, _Fp __f)
|
|
{
|
|
__f();
|
|
}
|
|
|
|
template <typename _Fp>
|
|
void __invoke_if(std::false_type, _Fp)
|
|
{
|
|
}
|
|
|
|
template <typename _Fp>
|
|
void
|
|
__invoke_if_not(std::false_type, _Fp __f)
|
|
{
|
|
__f();
|
|
}
|
|
|
|
template <typename _Fp>
|
|
void __invoke_if_not(std::true_type, _Fp)
|
|
{
|
|
}
|
|
|
|
template <typename _F1, typename _F2>
|
|
auto
|
|
__invoke_if_else(std::true_type, _F1 __f1, _F2) -> decltype(__f1())
|
|
{
|
|
return __f1();
|
|
}
|
|
|
|
template <typename _F1, typename _F2>
|
|
auto
|
|
__invoke_if_else(std::false_type, _F1, _F2 __f2) -> decltype(__f2())
|
|
{
|
|
return __f2();
|
|
}
|
|
|
|
//! Unary operator that returns reference to its argument.
|
|
struct __no_op
|
|
{
|
|
template <typename _Tp>
|
|
_Tp&&
|
|
operator()(_Tp&& __a) const
|
|
{
|
|
return std::forward<_Tp>(__a);
|
|
}
|
|
};
|
|
|
|
template <typename _Pred>
|
|
class __reorder_pred
|
|
{
|
|
_Pred _M_pred;
|
|
|
|
public:
|
|
explicit __reorder_pred(_Pred __pred) : _M_pred(__pred) {}
|
|
|
|
template <typename _FTp, typename _STp>
|
|
bool
|
|
operator()(_FTp&& __a, _STp&& __b)
|
|
{
|
|
return _M_pred(std::forward<_STp>(__b), std::forward<_FTp>(__a));
|
|
}
|
|
};
|
|
|
|
//! Like a polymorphic lambda for pred(...,value)
|
|
template <typename _Tp, typename _Predicate>
|
|
class __equal_value_by_pred
|
|
{
|
|
const _Tp& _M_value;
|
|
_Predicate _M_pred;
|
|
|
|
public:
|
|
__equal_value_by_pred(const _Tp& __value, _Predicate __pred) : _M_value(__value), _M_pred(__pred) {}
|
|
|
|
template <typename _Arg>
|
|
bool
|
|
operator()(_Arg&& __arg)
|
|
{
|
|
return _M_pred(std::forward<_Arg>(__arg), _M_value);
|
|
}
|
|
};
|
|
|
|
//! Like a polymorphic lambda for ==value
|
|
template <typename _Tp>
|
|
class __equal_value
|
|
{
|
|
const _Tp& _M_value;
|
|
|
|
public:
|
|
explicit __equal_value(const _Tp& __value) : _M_value(__value) {}
|
|
|
|
template <typename _Arg>
|
|
bool
|
|
operator()(_Arg&& __arg) const
|
|
{
|
|
return std::forward<_Arg>(__arg) == _M_value;
|
|
}
|
|
};
|
|
|
|
//! Logical negation of ==value
|
|
template <typename _Tp>
|
|
class __not_equal_value
|
|
{
|
|
const _Tp& _M_value;
|
|
|
|
public:
|
|
explicit __not_equal_value(const _Tp& __value) : _M_value(__value) {}
|
|
|
|
template <typename _Arg>
|
|
bool
|
|
operator()(_Arg&& __arg) const
|
|
{
|
|
return !(std::forward<_Arg>(__arg) == _M_value);
|
|
}
|
|
};
|
|
|
|
template <typename _ForwardIterator, typename _Compare>
|
|
_ForwardIterator
|
|
__cmp_iterators_by_values(_ForwardIterator __a, _ForwardIterator __b, _Compare __comp)
|
|
{
|
|
if (__a < __b)
|
|
{ // we should return closer iterator
|
|
return __comp(*__b, *__a) ? __b : __a;
|
|
}
|
|
else
|
|
{
|
|
return __comp(*__a, *__b) ? __a : __b;
|
|
}
|
|
}
|
|
|
|
} // namespace __internal
|
|
} // namespace __pstl
|
|
|
|
#endif /* _PSTL_UTILS_H */
|