| commit | aadf08f8d7f4595a54b0d87437a40f3213ac7179 | [log] [tgz] |
|---|---|---|
| author | JF Bastien <jfbastien@apple.com> | Wed Dec 19 17:45:32 2018 +0000 |
| committer | Copybara-Service <copybara-worker@google.com> | Tue Sep 01 14:39:15 2020 -0700 |
| tree | 3b9224fef0d7cb6f135c1182e633f8c96c614dfa |
Initial PSTL commit The initial commit of the Parallel STL upstream (under LLVM umbrella) based on Parallel STL 20181204 open source release, which is available by https://github.com/intel/parallelstl Author: Mikhail Dvorskiy <mikhail.dvorskiy@intel.com> Differential Revision: https://reviews.llvm.org/D55889 llvm-svn: 349653 GitOrigin-RevId: e637637ae46a5b2fa1e9d10c16ae5b0922289f82
Parallel STL is an implementation of the C++ standard library algorithms with support for execution policies, as specified in ISO/IEC 14882:2017 standard, commonly called C++17. The implementation also supports the unsequenced execution policy specified in Parallelism TS version 2 and proposed for the next version of the C++ standard in the C++ working group paper P1001R1. Parallel STL offers efficient support for both parallel and vectorized execution of algorithms. For sequential execution, it relies on an available implementation of the C++ standard library.
To use Parallel STL, you must have the following software installed:
unseq and par_unseq policies only have effect with compilers that
support '#pragma omp simd' or '#pragma simd'.
Parallel and vector execution is only supported for the algorithms
if random access iterators are provided, while for other iterator
types the execution will remain serial.
The following algorithms do not allow efficient SIMD execution:
includes, inplace_merge, merge, nth_element, partial_sort,
partial_sort_copy, set_difference, set_intersection,
set_symmetric_difference, set_union, sort, stable_partition,
stable_sort, unique.
The initial value type for exclusive_scan, inclusive_scan,
transform_exclusive_scan, transform_inclusive_scan shall satisfy
the DefaultConstructible requirements. A default constructed-instance
of the initial value type shall be the identity element for binary_op.
For max_element, min_element, minmax_element, partial_sort,
partial_sort_copy, sort, stable_sort the dereferenced value type of
the provided iterators shall be DefaultConstructible.
For remove, remove_if, unique the dereferenced value type of the provided
iterators shall be MoveConstructible.
The following algorithms require additional O(n) memory space for parallel
execution: copy_if, inplace_merge, partial_sort, partial_sort_copy,
partition_copy, remove, remove_if, rotate, sort, stable_sort, unique,
unique_copy.