
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.
107 lines
4 KiB
C++
107 lines
4 KiB
C++
// -*- C++ -*-
|
|
//===-- memory_impl.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_MEMORY_IMPL_H
|
|
#define _PSTL_MEMORY_IMPL_H
|
|
|
|
#include <iterator>
|
|
|
|
#include "unseq_backend_simd.h"
|
|
|
|
namespace __pstl
|
|
{
|
|
namespace __internal
|
|
{
|
|
|
|
//------------------------------------------------------------------------
|
|
// uninitialized_move
|
|
//------------------------------------------------------------------------
|
|
|
|
template <typename _ForwardIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
__brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
|
/*vector=*/std::false_type) noexcept
|
|
{
|
|
using _ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
|
for (; __first != __last; ++__first, ++__result)
|
|
{
|
|
::new (std::addressof(*__result)) _ValueType(std::move(*__first));
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
template <typename _RandomAccessIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
__brick_uninitialized_move(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
|
/*vector=*/std::true_type) noexcept
|
|
{
|
|
using __ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
|
using _ReferenceType1 = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
|
using _ReferenceType2 = typename std::iterator_traits<_OutputIterator>::reference;
|
|
|
|
return __unseq_backend::__simd_walk_2(
|
|
__first, __last - __first, __result,
|
|
[](_ReferenceType1 __x, _ReferenceType2 __y) { ::new (std::addressof(__y)) __ValueType(std::move(__x)); });
|
|
}
|
|
|
|
template <typename _Iterator>
|
|
void
|
|
__brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type) noexcept
|
|
{
|
|
using _ValueType = typename std::iterator_traits<_Iterator>::value_type;
|
|
|
|
for (; __first != __last; ++__first)
|
|
__first->~_ValueType();
|
|
}
|
|
|
|
template <typename _RandomAccessIterator>
|
|
void
|
|
__brick_destroy(_RandomAccessIterator __first, _RandomAccessIterator __last, /*vector*/ std::true_type) noexcept
|
|
{
|
|
using _ValueType = typename std::iterator_traits<_RandomAccessIterator>::value_type;
|
|
using _ReferenceType = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
|
|
|
__unseq_backend::__simd_walk_1(__first, __last - __first, [](_ReferenceType __x) { __x.~_ValueType(); });
|
|
}
|
|
|
|
//------------------------------------------------------------------------
|
|
// uninitialized copy
|
|
//------------------------------------------------------------------------
|
|
|
|
template <typename _ForwardIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
__brick_uninitialized_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result,
|
|
/*vector=*/std::false_type) noexcept
|
|
{
|
|
using _ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
|
for (; __first != __last; ++__first, ++__result)
|
|
{
|
|
::new (std::addressof(*__result)) _ValueType(*__first);
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
template <typename _RandomAccessIterator, typename _OutputIterator>
|
|
_OutputIterator
|
|
__brick_uninitialized_copy(_RandomAccessIterator __first, _RandomAccessIterator __last, _OutputIterator __result,
|
|
/*vector=*/std::true_type) noexcept
|
|
{
|
|
using __ValueType = typename std::iterator_traits<_OutputIterator>::value_type;
|
|
using _ReferenceType1 = typename std::iterator_traits<_RandomAccessIterator>::reference;
|
|
using _ReferenceType2 = typename std::iterator_traits<_OutputIterator>::reference;
|
|
|
|
return __unseq_backend::__simd_walk_2(
|
|
__first, __last - __first, __result,
|
|
[](_ReferenceType1 __x, _ReferenceType2 __y) { ::new (std::addressof(__y)) __ValueType(__x); });
|
|
}
|
|
|
|
} // namespace __internal
|
|
} // namespace __pstl
|
|
|
|
#endif /* _PSTL_MEMORY_IMPL_H */
|