/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
H A D | glue_memory_defs.h | 24 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 26 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result); 34 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 36 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result); 44 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp> 46 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __value); 54 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> 56 destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n); 64 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> 66 uninitialized_default_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __ [all...] |
H A D | unseq_backend_simd.h | 88 // Double the block _Size. Any unnecessary iterations can be amortized against work done so far. 455 template <typename _Size, typename _Tp, typename _BinaryOperation, typename _UnaryOperation> 457 __simd_transform_reduce(_Size __n, _Tp __init, _BinaryOperation __binary_op, _UnaryOperation __f) noexcept 459 const _Size __block_size = __lane_size / sizeof(_Tp); 467 for (_Size __i = 0; __i < __block_size; ++__i) 472 _Size __i = 2 * __block_size; 473 const _Size last_iteration = __block_size * (__n / __block_size); 477 for (_Size __j = 0; __j < __block_size; ++__j) 484 for (_Size __j = 0; __j < __n - last_iteration; ++__j) 489 for (_Size __ [all...] |
H A D | glue_memory_impl.h | 55 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 57 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result) 74 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { 124 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 126 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result) 143 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { 190 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp> 192 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __value) 207 [&__value, &__is_vector](_ForwardIterator __begin, _Size __count) { 241 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> [all...] |
H A D | algorithm_fwd.h | 83 template <class _ForwardIterator, class _Size, class _Function> 84 _ForwardIterator __brick_walk1_n(_ForwardIterator, _Size, _Function, 91 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVector> 93 __pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Function, _IsVector, 96 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class _IsVector> 98 __pattern_walk1_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Function, _IsVector, 101 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick> 103 __pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Brick, 106 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick> 108 __pattern_walk_brick_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Bric [all...] |
H A D | algorithm_impl.h | 76 template <class _ForwardIterator, class _Size, class _Function> 78 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __f) 150 template <class _ForwardIterator, class _Size, class _Function> 152 __brick_walk1_n(_ForwardIterator __first, _Size __n, _Function __f, /*_IsVectorTag=*/std::false_type) 166 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVector> 168 __pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Function __f, _IsVector __is_vector, 174 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class _IsVector> 176 __pattern_walk1_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n, _Function __f, 185 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick> 187 __pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __ [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
H A D | glue_memory_defs.h | 24 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 26 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result); 34 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 36 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result); 44 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp> 46 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __value); 54 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> 56 destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n); 64 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> 66 uninitialized_default_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __ [all...] |
H A D | unseq_backend_simd.h | 88 // Double the block _Size. Any unnecessary iterations can be amortized against work done so far. 455 template <typename _Size, typename _Tp, typename _BinaryOperation, typename _UnaryOperation> 457 __simd_transform_reduce(_Size __n, _Tp __init, _BinaryOperation __binary_op, _UnaryOperation __f) noexcept 459 const _Size __block_size = __lane_size / sizeof(_Tp); 467 for (_Size __i = 0; __i < __block_size; ++__i) 472 _Size __i = 2 * __block_size; 473 const _Size last_iteration = __block_size * (__n / __block_size); 477 for (_Size __j = 0; __j < __block_size; ++__j) 484 for (_Size __j = 0; __j < __n - last_iteration; ++__j) 489 for (_Size __ [all...] |
H A D | glue_memory_impl.h | 55 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 57 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result) 75 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { 125 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator> 127 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator __result) 145 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { 191 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp> 193 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __value) 207 [&__value, &__is_vector](_ForwardIterator __begin, _Size __count) { 239 template <class _ExecutionPolicy, class _ForwardIterator, class _Size> [all...] |
H A D | algorithm_fwd.h | 83 template <class _ForwardIterator, class _Size, class _Function> 84 _ForwardIterator __brick_walk1_n(_ForwardIterator, _Size, _Function, 91 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVector> 93 __pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Function, _IsVector, 96 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class _IsVector> 98 __pattern_walk1_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Function, _IsVector, 101 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick> 103 __pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Brick, 106 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick> 108 __pattern_walk_brick_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Bric [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | stl_construct.h | 191 template<typename _ForwardIterator, typename _Size> 193 __destroy_n(_ForwardIterator __first, _Size __count) 204 template<typename _ForwardIterator, typename _Size> 206 __destroy_n(_ForwardIterator __first, _Size __count) 218 template<typename _ForwardIterator, typename _Size> 220 _Destroy_n(_ForwardIterator __first, _Size __count) 245 template <typename _ForwardIterator, typename _Size> 247 destroy_n(_ForwardIterator __first, _Size __count)
|
H A D | stl_uninitialized.h | 227 template<typename _ForwardIterator, typename _Size, typename _Tp> 229 __uninit_fill_n(_ForwardIterator __first, _Size __n, 250 template<typename _ForwardIterator, typename _Size, typename _Tp> 252 __uninit_fill_n(_ForwardIterator __first, _Size __n, 270 template<typename _ForwardIterator, typename _Size, typename _Tp> 272 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) 376 template<typename _ForwardIterator, typename _Size, typename _Tp, 379 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __n, 397 template<typename _ForwardIterator, typename _Size, typename _Tp, 400 __uninitialized_fill_n_a(_ForwardIterator __first, _Size __ [all...] |
H A D | algorithmfwd.h | 248 template<typename _IIter, typename _Size, typename _OIter> 251 copy_n(_IIter, _Size, _OIter); 272 template<typename _OIter, typename _Size, typename _Tp> 275 fill_n(_OIter, _Size, const _Tp&); 749 template<typename _OIter, typename _Size, typename _Generator> 752 generate_n(_OIter, _Size, _Generator); 863 template<typename _FIter, typename _Size, typename _Tp> 866 search_n(_FIter, _FIter, _Size, const _Tp&); 868 template<typename _FIter, typename _Size, typename _Tp, 872 search_n(_FIter, _FIter, _Size, cons [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | stl_construct.h | 202 template<typename _ForwardIterator, typename _Size> 204 __destroy_n(_ForwardIterator __first, _Size __count) 215 template<typename _ForwardIterator, typename _Size> 217 __destroy_n(_ForwardIterator __first, _Size __count) 229 template<typename _ForwardIterator, typename _Size> 231 _Destroy_n(_ForwardIterator __first, _Size __count) 256 template <typename _ForwardIterator, typename _Size> 258 destroy_n(_ForwardIterator __first, _Size __count)
|
H A D | stl_uninitialized.h | 258 template<typename _ForwardIterator, typename _Size, typename _Tp> 261 __do_uninit_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) 280 template<typename _ForwardIterator, typename _Size, typename _Tp> 282 __uninit_fill_n(_ForwardIterator __first, _Size __n, 290 template<typename _ForwardIterator, typename _Size, typename _Tp> 292 __uninit_fill_n(_ForwardIterator __first, _Size __n, 310 template<typename _ForwardIterator, typename _Size, typename _Tp> 312 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) 323 // so only use std::fill_n when _Size is already an integral type. 324 && __is_integer<_Size> [all...] |
H A D | algorithmfwd.h | 248 template<typename _IIter, typename _Size, typename _OIter> 251 copy_n(_IIter, _Size, _OIter); 272 template<typename _OIter, typename _Size, typename _Tp> 275 fill_n(_OIter, _Size, const _Tp&); 750 template<typename _OIter, typename _Size, typename _Generator> 753 generate_n(_OIter, _Size, _Generator); 866 template<typename _FIter, typename _Size, typename _Tp> 869 search_n(_FIter, _FIter, _Size, const _Tp&); 871 template<typename _FIter, typename _Size, typename _Tp, 875 search_n(_FIter, _FIter, _Size, cons [all...] |
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__memory/ |
H A D | allocation_guard.h | 49 using _Size = typename allocator_traits<_Alloc>::size_type; 53 explicit __allocation_guard(_AllocT __alloc, _Size __n) 80 _Size __n_;
|
H A D | uninitialized_algorithms.h | 52 template <class _InputIterator, class _Size, class _ForwardIterator> 54 uninitialized_copy_n(_InputIterator __f, _Size __n, _ForwardIterator __r) 99 template <class _ForwardIterator, class _Size, class _Tp> 101 uninitialized_fill_n(_ForwardIterator __f, _Size __n, const _Tp& __x) 132 template <class _ForwardIterator, class _Size> 134 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) { 158 template <class _ForwardIterator, class _Size> 160 _ForwardIterator uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) { 196 template <class _ForwardIterator, class _Size> 198 _ForwardIterator uninitialized_value_construct_n(_ForwardIterator __first, _Size __ [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/ |
H A D | stl_iterator.h | 50 template<typename _Iterator, typename _Size> 52 __can_advance(const std::reverse_iterator<_Iterator>& __it, _Size __n) 106 template<typename _Iterator, typename _Size> 108 __can_advance(const std::move_iterator<_Iterator>& __it, _Size __n)
|
H A D | debug.h | 68 # define __glibcxx_requires_can_increment(_First,_Size) 95 # define __glibcxx_requires_can_increment(_First,_Size) \ 96 __glibcxx_check_can_increment(_First,_Size)
|
H A D | helper_functions.h | 278 template<typename _InputIterator, typename _Size> 281 __can_advance(_InputIterator, _Size) 285 typename _Size> 288 _Size);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/debug/ |
H A D | stl_iterator.h | 54 template<typename _Iterator, typename _Size> 57 __can_advance(const std::reverse_iterator<_Iterator>& __it, _Size __n) 118 template<typename _Iterator, typename _Size> 121 __can_advance(const std::move_iterator<_Iterator>& __it, _Size __n)
|
H A D | debug.h | 68 # define __glibcxx_requires_can_increment(_First,_Size) 95 # define __glibcxx_requires_can_increment(_First,_Size) \ 96 __glibcxx_check_can_increment(_First,_Size)
|
H A D | helper_functions.h | 273 template<typename _InputIterator, typename _Size> 276 __can_advance(_InputIterator, _Size) 280 typename _Size> 283 _Size);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
H A D | base.h | 100 template<typename _Size> 101 inline _Size 102 __rd_log2(_Size __n) 104 _Size __k;
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
H A D | base.h | 100 template<typename _Size> 101 inline _Size 102 __rd_log2(_Size __n) 104 _Size __k;
|