1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#ifndef _LIBCPP___PSTL_BACKENDS_STD_THREAD_H
10#define _LIBCPP___PSTL_BACKENDS_STD_THREAD_H
11
12#include <__config>
13#include <__cstddef/size_t.h>
14#include <__optional/optional.h>
15#include <__pstl/backend_fwd.h>
16#include <__pstl/cpu_algos/any_of.h>
17#include <__pstl/cpu_algos/cpu_traits.h>
18#include <__pstl/cpu_algos/fill.h>
19#include <__pstl/cpu_algos/find_end.h>
20#include <__pstl/cpu_algos/find_if.h>
21#include <__pstl/cpu_algos/for_each.h>
22#include <__pstl/cpu_algos/is_heap_until.h>
23#include <__pstl/cpu_algos/merge.h>
24#include <__pstl/cpu_algos/min_element.h>
25#include <__pstl/cpu_algos/minmax_element.h>
26#include <__pstl/cpu_algos/mismatch.h>
27#include <__pstl/cpu_algos/reverse.h>
28#include <__pstl/cpu_algos/search.h>
29#include <__pstl/cpu_algos/search_n.h>
30#include <__pstl/cpu_algos/stable_sort.h>
31#include <__pstl/cpu_algos/transform.h>
32#include <__pstl/cpu_algos/transform_reduce.h>
33#include <__pstl/cpu_algos/uninitialized_algorithms.h>
34#include <__utility/empty.h>
35#include <__utility/move.h>
36
37#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
38# pragma GCC system_header
39#endif
40
41_LIBCPP_PUSH_MACROS
42#include <__undef_macros>
43
44#if _LIBCPP_STD_VER >= 17
45
46_LIBCPP_BEGIN_NAMESPACE_STD
47namespace __pstl {
48
49//
50// This partial backend implementation is for testing purposes only and not meant for production use. This will be
51// replaced by a proper implementation once the PSTL implementation is somewhat stable.
52//
53// This is intended to be used on top of the "default backend".
54//
55
56template <>
57struct __cpu_traits<__std_thread_backend_tag> {
58 template <class _RandomAccessIterator, class _Fp>
59 _LIBCPP_HIDE_FROM_ABI static optional<__empty>
60 __for_each(_RandomAccessIterator __first, _RandomAccessIterator __last, _Fp __f) {
61 __f(__first, __last);
62 return __empty{};
63 }
64
65 template <class _Index, class _UnaryOp, class _Tp, class _BinaryOp, class _Reduce>
66 _LIBCPP_HIDE_FROM_ABI static optional<_Tp>
67 __transform_reduce(_Index __first, _Index __last, _UnaryOp, _Tp __init, _BinaryOp, _Reduce __reduce) {
68 return __reduce(std::move(__first), std::move(__last), std::move(__init));
69 }
70
71 template <class _RandomAccessIterator, class _Compare, class _LeafSort>
72 _LIBCPP_HIDE_FROM_ABI static optional<__empty>
73 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, _LeafSort __leaf_sort) {
74 __leaf_sort(__first, __last, __comp);
75 return __empty{};
76 }
77
78 _LIBCPP_HIDE_FROM_ABI static void __cancel_execution() {}
79
80 template <class _RandomAccessIterator1,
81 class _RandomAccessIterator2,
82 class _RandomAccessIterator3,
83 class _Compare,
84 class _LeafMerge>
85 _LIBCPP_HIDE_FROM_ABI static optional<__empty>
86 __merge(_RandomAccessIterator1 __first1,
87 _RandomAccessIterator1 __last1,
88 _RandomAccessIterator2 __first2,
89 _RandomAccessIterator2 __last2,
90 _RandomAccessIterator3 __outit,
91 _Compare __comp,
92 _LeafMerge __leaf_merge) {
93 __leaf_merge(__first1, __last1, __first2, __last2, __outit, __comp);
94 return __empty{};
95 }
96
97 static constexpr size_t __lane_size = 64;
98};
99
100// Mandatory implementations of the computational basis
101template <class _ExecutionPolicy>
102struct __find_end<__std_thread_backend_tag, _ExecutionPolicy>
103 : __cpu_parallel_find_end<__std_thread_backend_tag, _ExecutionPolicy> {};
104
105template <class _ExecutionPolicy>
106struct __find_if<__std_thread_backend_tag, _ExecutionPolicy>
107 : __cpu_parallel_find_if<__std_thread_backend_tag, _ExecutionPolicy> {};
108
109template <class _ExecutionPolicy>
110struct __for_each<__std_thread_backend_tag, _ExecutionPolicy>
111 : __cpu_parallel_for_each<__std_thread_backend_tag, _ExecutionPolicy> {};
112
113template <class _ExecutionPolicy>
114struct __is_heap_until<__std_thread_backend_tag, _ExecutionPolicy>
115 : __cpu_parallel_is_heap_until<__std_thread_backend_tag, _ExecutionPolicy> {};
116
117template <class _ExecutionPolicy>
118struct __merge<__std_thread_backend_tag, _ExecutionPolicy>
119 : __cpu_parallel_merge<__std_thread_backend_tag, _ExecutionPolicy> {};
120
121template <class _ExecutionPolicy>
122struct __min_element<__std_thread_backend_tag, _ExecutionPolicy>
123 : __cpu_parallel_min_element<__std_thread_backend_tag, _ExecutionPolicy> {};
124
125template <class _ExecutionPolicy>
126struct __minmax_element<__std_thread_backend_tag, _ExecutionPolicy>
127 : __cpu_parallel_minmax_element<__std_thread_backend_tag, _ExecutionPolicy> {};
128
129template <class _ExecutionPolicy>
130struct __mismatch<__std_thread_backend_tag, _ExecutionPolicy>
131 : __cpu_parallel_mismatch<__std_thread_backend_tag, _ExecutionPolicy> {};
132
133template <class _ExecutionPolicy>
134struct __reverse<__std_thread_backend_tag, _ExecutionPolicy>
135 : __cpu_parallel_reverse<__std_thread_backend_tag, _ExecutionPolicy> {};
136
137template <class _ExecutionPolicy>
138struct __search<__std_thread_backend_tag, _ExecutionPolicy>
139 : __cpu_parallel_search<__std_thread_backend_tag, _ExecutionPolicy> {};
140
141template <class _ExecutionPolicy>
142struct __search_n<__std_thread_backend_tag, _ExecutionPolicy>
143 : __cpu_parallel_search_n<__std_thread_backend_tag, _ExecutionPolicy> {};
144
145template <class _ExecutionPolicy>
146struct __stable_sort<__std_thread_backend_tag, _ExecutionPolicy>
147 : __cpu_parallel_stable_sort<__std_thread_backend_tag, _ExecutionPolicy> {};
148
149template <class _ExecutionPolicy>
150struct __transform<__std_thread_backend_tag, _ExecutionPolicy>
151 : __cpu_parallel_transform<__std_thread_backend_tag, _ExecutionPolicy> {};
152
153template <class _ExecutionPolicy>
154struct __transform_binary<__std_thread_backend_tag, _ExecutionPolicy>
155 : __cpu_parallel_transform_binary<__std_thread_backend_tag, _ExecutionPolicy> {};
156
157template <class _ExecutionPolicy>
158struct __transform_reduce<__std_thread_backend_tag, _ExecutionPolicy>
159 : __cpu_parallel_transform_reduce<__std_thread_backend_tag, _ExecutionPolicy> {};
160
161template <class _ExecutionPolicy>
162struct __transform_reduce_binary<__std_thread_backend_tag, _ExecutionPolicy>
163 : __cpu_parallel_transform_reduce_binary<__std_thread_backend_tag, _ExecutionPolicy> {};
164
165// Not mandatory, but better optimized
166template <class _ExecutionPolicy>
167struct __any_of<__std_thread_backend_tag, _ExecutionPolicy>
168 : __cpu_parallel_any_of<__std_thread_backend_tag, _ExecutionPolicy> {};
169
170template <class _ExecutionPolicy>
171struct __fill<__std_thread_backend_tag, _ExecutionPolicy>
172 : __cpu_parallel_fill<__std_thread_backend_tag, _ExecutionPolicy> {};
173
174template <class _ExecutionPolicy>
175struct __uninitialized_copy<__std_thread_backend_tag, _ExecutionPolicy>
176 : __cpu_parallel_uninitialized_copy<__std_thread_backend_tag, _ExecutionPolicy> {};
177
178template <class _ExecutionPolicy>
179struct __uninitialized_move<__std_thread_backend_tag, _ExecutionPolicy>
180 : __cpu_parallel_uninitialized_move<__std_thread_backend_tag, _ExecutionPolicy> {};
181
182} // namespace __pstl
183_LIBCPP_END_NAMESPACE_STD
184
185#endif // _LIBCPP_STD_VER >= 17
186
187_LIBCPP_POP_MACROS
188
189#endif // _LIBCPP___PSTL_BACKENDS_STD_THREAD_H
190