-
-
Notifications
You must be signed in to change notification settings - Fork 438
/
uninitialized_relocation_primitives.hpp
497 lines (423 loc) · 19.3 KB
/
uninitialized_relocation_primitives.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
// Copyright (c) 2023 Isidoros Tsaousis-Seiras
//
// SPDX-License-Identifier: BSL-1.0
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
#pragma once
#include <hpx/type_support/is_contiguous_iterator.hpp>
#include <hpx/type_support/is_relocatable.hpp>
#include <hpx/type_support/is_trivially_relocatable.hpp>
#include <hpx/type_support/relocate_at.hpp>
#include <cstring> // for memmove
#include <type_traits>
#include <tuple>
#if defined(HPX_HAVE_P1144_RELOCATE_AT)
#include <memory>
#endif
namespace hpx::experimental::util {
namespace detail { // Utility metafunctions
struct buffer_memcpy_tag
{
};
struct for_loop_nothrow_tag
{
};
struct for_loop_try_catch_tag
{
};
template <typename InIter, typename OutIter,
bool iterators_are_contiguous_v = false>
struct relocation_traits
{
using in_type = typename std::iterator_traits<InIter>::value_type;
using out_type = typename std::iterator_traits<OutIter>::value_type;
constexpr static bool valid_relocation =
is_relocatable_from_v<out_type, in_type>;
// ^^^^ Cannot relocate between unrelated types
constexpr static bool is_memcpyable =
is_trivially_relocatable_v<in_type> &&
// ^^^^ The important check
!std::is_volatile_v<in_type> && !std::is_volatile_v<out_type>;
// ^^^^ Cannot memcpy volatile types
constexpr static bool is_buffer_memcpyable =
is_memcpyable && iterators_are_contiguous_v;
constexpr static bool can_move_construct_nothrow =
std::is_nothrow_constructible_v<in_type, out_type>;
// This is to skip the try-catch block
// type_dst is treated as an rvalue by is_nothrow_constructible
constexpr static bool is_noexcept_relocatable_v =
can_move_construct_nothrow || is_memcpyable;
// If memcpy is not possible, we need to check if the move
// constructor is noexcept
// Using a tag to distinguish implementations
// clang-format off
using implementation_tag = std::conditional_t<
is_buffer_memcpyable,
buffer_memcpy_tag,
std::conditional_t<is_noexcept_relocatable_v,
for_loop_nothrow_tag,
for_loop_try_catch_tag
>
>;
// clang-format on
};
} // namespace detail
#if defined(HPX_HAVE_P1144_RELOCATE_AT)
//////////////////////////////
// uninitialized_relocate_n //
//////////////////////////////
template <typename InIter, typename FwdIter, typename Size,
typename Dummy> // Dummy is used retain the same signature
// as the implementation before P1144
// clang-format off
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive(InIter first, Size n,
FwdIter dst, Dummy) noexcept(
detail::relocation_traits<InIter, FwdIter>::is_noexcept_relocatable_v)
// clang-format on
{
static_assert(
detail::relocation_traits<InIter, FwdIter>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
return std::uninitialized_relocate_n(first, n, dst);
}
template <typename InIter, typename Size, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive(InIter first,
Size n, FwdIter dst) noexcept(detail::relocation_traits<InIter,
FwdIter>::is_noexcept_relocatable_v)
{
return uninitialized_relocate_n_primitive(first, n, dst, bool{});
}
////////////////////////////
// uninitialized_relocate //
////////////////////////////
template <typename InIter, typename Sent, typename FwdIter,
typename Dummy> // Dummy is used retain the same signature
// as the implementation before P1144
// clang-format off
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive(InIter first, Sent last,
FwdIter dst, Dummy) noexcept(
detail::relocation_traits<InIter, FwdIter>::is_noexcept_relocatable_v)
// clang-format on
{
// TODO CHECK SENT
static_assert(
detail::relocation_traits<InIter, FwdIter>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
return std::uninitialized_relocate(first, last, dst);
}
template <typename InIter, typename Sent, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive(InIter first,
Sent last, FwdIter dst) noexcept(detail::relocation_traits<InIter,
FwdIter>::is_noexcept_relocatable_v)
{
return uninitialized_relocate_primitive(first, last, dst, bool{});
}
/////////////////////////////////////
// uninitialized_relocate_backward //
/////////////////////////////////////
template <typename BiIter1, typename BiIter2,
typename Dummy> // Dummy is used retain the same signature
// as the implementation before P1144
// clang-format off
std::tuple<BiIter1, BiIter2> uninitialized_relocate_backward_primitive(
BiIter1 first, BiIter1 last,BiIter2 dst_last, Dummy) noexcept(
detail::relocation_traits<BiIter1, BiIter2>::is_noexcept_relocatable_v)
// clang-format on
{
// TODO CHECK SENT
static_assert(
detail::relocation_traits<BiIter1, BiIter2>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
return std::uninitialized_relocate_backward(first, last, dst_last);
}
template <typename BiIter1, typename BiIter2>
std::tuple<BiIter1, BiIter2> uninitialized_relocate_backward_primitive(
BiIter1 first, BiIter1 last,
BiIter2 dst_last) noexcept(detail::relocation_traits<BiIter1,
BiIter2>::is_noexcept_relocatable_v)
{
return uninitialized_relocate_backward_primitive(
first, last, dst_last, bool{});
}
#else
namespace detail {
//////////////////////////////
// uninitialized_relocate_n //
//////////////////////////////
template <typename InIter, typename Size, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive_helper(
InIter first, Size n, FwdIter dst, buffer_memcpy_tag) noexcept
{
if (n != 0)
{
std::byte const* first_byte =
reinterpret_cast<std::byte const*>(std::addressof(*first));
std::byte* dst_byte = const_cast<std::byte*>(
reinterpret_cast<std::byte const*>(std::addressof(*dst)));
Size n_bytes = n * sizeof(*first);
// Ideally we would want to convey to the compiler
// That the new buffer actually contains objects
// within their lifetime. But this is not possible
// with current language features.
std::memmove(dst_byte, first_byte, n_bytes);
dst += n;
}
return {first, dst};
}
template <typename InIter, typename Size, typename FwdIter>
// Either the buffer is not contiguous or the types are no-throw
// move constructible but not trivially relocatable
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive_helper(
InIter first, Size n, FwdIter dst, for_loop_nothrow_tag) noexcept
{
for (Size i = 0; i < n; ++first, ++dst, ++i)
{
// if the type is trivially relocatable this will be a memcpy
// otherwise it will be a move + destroy
hpx::experimental::detail::relocate_at_helper(
std::addressof(*first), std::addressof(*dst));
}
return {first, dst};
}
template <typename InIter, typename Size, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive_helper(
InIter first, Size n, FwdIter dst, for_loop_try_catch_tag)
{
FwdIter original_dst = dst;
for (Size i = 0; i < n; ++first, ++dst, ++i)
{
try
{
// the move + destroy version will be used
hpx::experimental::detail::relocate_at_helper(
std::addressof(*first), std::addressof(*dst));
}
catch (...)
{
// destroy all objects other that the one
// that caused the exception
// (relocate_at already destroyed that one)
// destroy all objects constructed so far
std::destroy(original_dst, dst);
// destroy all the objects not relocated yet
std::destroy_n(++first, n - i - 1);
// Note:
// using destroy_n instead of destroy + advance
// to avoid calculating the distance
throw;
}
}
return {first, dst};
}
////////////////////////////
// uninitialized_relocate //
////////////////////////////
template <typename InIter, typename Sent, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive_helper(
InIter first, Sent last, FwdIter dst, buffer_memcpy_tag) noexcept
{
return uninitialized_relocate_n_primitive_helper(
first, std::distance(first, last), dst, buffer_memcpy_tag{});
}
template <typename InIter, typename Sent, typename FwdIter>
// Either the buffer is not contiguous or the types are no-throw
// move constructible but not trivially relocatable
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive_helper(
InIter first, Sent last, FwdIter dst, for_loop_nothrow_tag) noexcept
{
for (; first != last; ++first, ++dst)
{
// if the type is trivially relocatable this will be a memcpy
// otherwise it will be a move + destroy
hpx::experimental::detail::relocate_at_helper(
std::addressof(*first), std::addressof(*dst));
}
return {first, dst};
}
template <typename InIter, typename Sent, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive_helper(
InIter first, Sent last, FwdIter dst, for_loop_try_catch_tag)
{
FwdIter original_dst = dst;
for (; first != last; ++first, ++dst)
{
try
{
// the move + destroy version will be used
hpx::experimental::detail::relocate_at_helper(
std::addressof(*first), std::addressof(*dst));
}
catch (...)
{
// destroy all objects other that the one
// that caused the exception
// (relocate_at already destroyed that one)
// destroy all objects constructed so far
std::destroy(original_dst, dst);
// destroy all the objects not relocated yet
std::destroy(++first, last);
throw;
}
}
return {first, dst};
}
/////////////////////////////////////
// uninitialized_relocate_backward //
/////////////////////////////////////
template <typename BiIter1, typename BiIter2>
std::tuple<BiIter1, BiIter2>
uninitialized_relocate_backward_primitive_helper(BiIter1 first,
BiIter1 last, BiIter2 dst_last, buffer_memcpy_tag) noexcept
{
// Here we know the iterators are contiguous
// So calculating the distance and the previous
// iterator is O(1)
auto n_objects = std::distance(first, last);
BiIter2 dst_first = std::prev(dst_last, n_objects);
return uninitialized_relocate_n_primitive_helper(
first, n_objects, dst_first, buffer_memcpy_tag{});
}
template <typename BiIter1, typename BiIter2>
// Either the buffer is not contiguous or the types are no-throw
// move constructible but not trivially relocatable
// dst_last is one past the last element of the destination
std::tuple<BiIter1, BiIter2>
uninitialized_relocate_backward_primitive_helper(BiIter1 first,
BiIter1 last, BiIter2 dst_last, for_loop_nothrow_tag) noexcept
{
while (first != last)
{
// if the type is trivially relocatable this will be a memcpy
// otherwise it will be a move + destroy
std::advance(last, -1);
std::advance(dst_last, -1);
hpx::experimental::detail::relocate_at_helper(
std::addressof(*last), std::addressof(*dst_last));
}
return {last, dst_last};
}
template <typename BiIter1, typename BiIter2>
std::tuple<BiIter1, BiIter2>
uninitialized_relocate_backward_primitive_helper(BiIter1 first,
BiIter1 last, BiIter2 dst_last, for_loop_try_catch_tag)
{
BiIter2 original_dst_last = dst_last;
while (first != last)
{
try
{
std::advance(last, -1);
std::advance(dst_last, -1);
// the move + destroy version will be used
hpx::experimental::detail::relocate_at_helper(
std::addressof(*last), std::addressof(*dst_last));
}
catch (...)
{
// destroy all objects other that the one
// that caused the exception
// (relocate_at already destroyed that one)
// destroy all objects constructed so far
std::destroy(++dst_last, original_dst_last);
// destroy all the objects not relocated yet
std::destroy(first, last);
throw;
}
}
return {last, dst_last};
}
} // namespace detail
//////////////////////////////
// uninitialized_relocate_n //
//////////////////////////////
template <typename InIter, typename FwdIter, typename Size,
typename iterators_are_contiguous_t>
// clang-format off
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive(InIter first, Size n,
FwdIter dst, iterators_are_contiguous_t) noexcept(
detail::relocation_traits<InIter, FwdIter>::is_noexcept_relocatable_v)
// clang-format on
{
static_assert(
detail::relocation_traits<InIter, FwdIter>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
using implementation_tag = typename detail::relocation_traits<InIter,
FwdIter, iterators_are_contiguous_t::value>::implementation_tag;
return detail::uninitialized_relocate_n_primitive_helper(
first, n, dst, implementation_tag{});
}
template <typename InIter, typename Size, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_n_primitive(InIter first,
Size n, FwdIter dst) noexcept(detail::relocation_traits<InIter,
FwdIter>::is_noexcept_relocatable_v)
{
using iterators_are_contiguous_default_t =
std::bool_constant<hpx::traits::is_contiguous_iterator_v<InIter> &&
hpx::traits::is_contiguous_iterator_v<FwdIter>>;
return uninitialized_relocate_n_primitive(
first, n, dst, iterators_are_contiguous_default_t{});
}
////////////////////////////
// uninitialized_relocate //
////////////////////////////
template <typename InIter, typename Sent, typename FwdIter,
typename iterators_are_contiguous_t>
// clang-format off
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive(InIter first, Sent last,
FwdIter dst, iterators_are_contiguous_t) noexcept(
detail::relocation_traits<InIter, FwdIter>::is_noexcept_relocatable_v)
// clang-format on
{
// TODO CHECK SENT
static_assert(
detail::relocation_traits<InIter, FwdIter>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
using implementation_tag = typename detail::relocation_traits<InIter,
FwdIter, iterators_are_contiguous_t::value>::implementation_tag;
return detail::uninitialized_relocate_primitive_helper(
first, last, dst, implementation_tag{});
}
template <typename InIter, typename Sent, typename FwdIter>
std::tuple<InIter, FwdIter> uninitialized_relocate_primitive(InIter first,
Sent last, FwdIter dst) noexcept(detail::relocation_traits<InIter,
FwdIter>::is_noexcept_relocatable_v)
{
using iterators_are_contiguous_default_t =
std::bool_constant<hpx::traits::is_contiguous_iterator_v<InIter> &&
hpx::traits::is_contiguous_iterator_v<FwdIter>>;
return uninitialized_relocate_primitive(
first, last, dst, iterators_are_contiguous_default_t{});
}
/////////////////////////////////////
// uninitialized_relocate_backward //
/////////////////////////////////////
template <typename BiIter1, typename BiIter2,
typename iterators_are_contiguous_t>
std::tuple<BiIter1, BiIter2> uninitialized_relocate_backward_primitive(
BiIter1 first, BiIter1 last, BiIter2 dst_last,
iterators_are_contiguous_t) noexcept(detail::relocation_traits<BiIter1,
BiIter2>::is_noexcept_relocatable_v)
{
// TODO CHECK SENT
static_assert(
detail::relocation_traits<BiIter1, BiIter2>::valid_relocation,
"uninitialized_move(first, last, dst) must be well-formed");
using implementation_tag = typename detail::relocation_traits<BiIter1,
BiIter2, iterators_are_contiguous_t::value>::implementation_tag;
return detail::uninitialized_relocate_backward_primitive_helper(
first, last, dst_last, implementation_tag{});
}
template <typename BiIter1, typename BiIter2>
std::tuple<BiIter1, BiIter2> uninitialized_relocate_backward_primitive(
BiIter1 first, BiIter1 last,
BiIter2 dst_last) noexcept(detail::relocation_traits<BiIter1,
BiIter2>::is_noexcept_relocatable_v)
{
using iterators_are_contiguous_default_t =
std::bool_constant<hpx::traits::is_contiguous_iterator_v<BiIter1> &&
hpx::traits::is_contiguous_iterator_v<BiIter2>>;
return uninitialized_relocate_backward_primitive(
first, last, dst_last, iterators_are_contiguous_default_t{});
}
#endif // defined(__cpp_lib_trivially_relocatable)
} // namespace hpx::experimental::util