Home
last modified time | relevance | path

Searched refs:_Size (Results 1 – 25 of 33) sorted by relevance

12

/external/llvm-project/libcxx/include/
Dbitset134 template <size_t _N_words, size_t _Size>
137 template <size_t _N_words, size_t _Size>
138 struct __has_storage_type<__bitset<_N_words, _Size> >
143 template <size_t _N_words, size_t _Size>
192 {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());}
194 … {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());}
217 template <size_t _N_words, size_t _Size>
220 __bitset<_N_words, _Size>::__bitset() _NOEXCEPT
232 template <size_t _N_words, size_t _Size>
234 __bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT
[all …]
Darray131 template <class _Tp, size_t _Size>
148 _Tp __elems_[_Size];
153 _VSTD::fill_n(data(), _Size, __u);
158 _VSTD::swap_ranges(data(), data() + _Size, __a.data());
167 iterator end() _NOEXCEPT {return iterator(data() + _Size);}
169 const_iterator end() const _NOEXCEPT {return const_iterator(data() + _Size);}
191 _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;}
193 _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;}
195 _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return _Size == 0;}
200 _LIBCPP_ASSERT(__n < _Size, "out-of-bounds access in std::array<T, N>");
[all …]
Dutility967 template <class _Size>
969 _Size
972 _Size __r;
980 template <class _Size, size_t = sizeof(_Size)*__CHAR_BIT__>
983 template <class _Size>
984 struct __murmur2_or_cityhash<_Size, 32>
986 inline _Size operator()(const void* __key, _Size __len)
991 template <class _Size>
992 _Size
993 __murmur2_or_cityhash<_Size, 32>::operator()(const void* __key, _Size __len)
[all …]
D__tuple219 template <class _Tp, size_t _Size> struct _LIBCPP_TEMPLATE_VIS array;
221 template <class _Tp, size_t _Size> struct __tuple_like<array<_Tp, _Size> > : true_type {};
223 template <size_t _Ip, class _Tp, size_t _Size>
226 get(array<_Tp, _Size>&) _NOEXCEPT;
228 template <size_t _Ip, class _Tp, size_t _Size>
231 get(const array<_Tp, _Size>&) _NOEXCEPT;
234 template <size_t _Ip, class _Tp, size_t _Size>
237 get(array<_Tp, _Size>&&) _NOEXCEPT;
239 template <size_t _Ip, class _Tp, size_t _Size>
242 get(const array<_Tp, _Size>&&) _NOEXCEPT;
Dalgorithm893 template <class _InputIterator, class _Size, class _Function>
896 for_each_n(_InputIterator __first, _Size __orig_n, _Function __f)
1532 template <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp>
1535 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag)
1552 _Size __c(0);
1569 template <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp>
1572 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag)
1576 _Size __len = static_cast<_Size>(__last - __first);
1593 _Size __c(0);
1609 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
[all …]
Distream1599 template <class _CharT, class _Traits, size_t _Size>
1601 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x)
1616 while (__c < _Size)
1631 __x = bitset<_Size>(__str);
1632 if (_Size > 0 && __c == 0)
Dmemory2911 template <class _InputIterator, class _Size, class _ForwardIterator>
2913 uninitialized_copy_n(_InputIterator __f, _Size __n, _ForwardIterator __r)
2958 template <class _ForwardIterator, class _Size, class _Tp>
2960 uninitialized_fill_n(_ForwardIterator __f, _Size __n, const _Tp& __x)
2991 template <class _ForwardIterator, class _Size>
2993 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) {
3017 template <class _ForwardIterator, class _Size>
3019 _ForwardIterator uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) {
3055 template <class _ForwardIterator, class _Size>
3057 _ForwardIterator uninitialized_value_construct_n(_ForwardIterator __first, _Size __n) {
[all …]
/external/libcxx/include/
Dbitset135 template <size_t _N_words, size_t _Size>
138 template <size_t _N_words, size_t _Size>
139 struct __has_storage_type<__bitset<_N_words, _Size> >
144 template <size_t _N_words, size_t _Size>
193 {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());}
195 … {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());}
218 template <size_t _N_words, size_t _Size>
221 __bitset<_N_words, _Size>::__bitset() _NOEXCEPT
233 template <size_t _N_words, size_t _Size>
235 __bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT
[all …]
Darray127 template <class _Tp, size_t _Size>
144 _Tp __elems_[_Size];
148 _VSTD::fill_n(__elems_, _Size, __u);
153 std::swap_ranges(__elems_, __elems_ + _Size, __a.__elems_);
162 iterator end() _NOEXCEPT {return iterator(data() + _Size);}
164 const_iterator end() const _NOEXCEPT {return const_iterator(data() + _Size);}
186 _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;}
188 _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;}
203 …ISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX14 reference back() {return __elems_[_Size - 1];}
204 …ISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX11 const_reference back() const {return __elems_[_Size - 1];}
[all …]
Dutility972 template <class _Size>
974 _Size
977 _Size __r;
985 template <class _Size, size_t = sizeof(_Size)*__CHAR_BIT__>
988 template <class _Size>
989 struct __murmur2_or_cityhash<_Size, 32>
991 inline _Size operator()(const void* __key, _Size __len)
996 template <class _Size>
997 _Size
998 __murmur2_or_cityhash<_Size, 32>::operator()(const void* __key, _Size __len)
[all …]
D__tuple223 template <class _Tp, size_t _Size> struct _LIBCPP_TEMPLATE_VIS array;
225 template <class _Tp, size_t _Size> struct __tuple_like<array<_Tp, _Size> > : true_type {};
227 template <size_t _Ip, class _Tp, size_t _Size>
230 get(array<_Tp, _Size>&) _NOEXCEPT;
232 template <size_t _Ip, class _Tp, size_t _Size>
235 get(const array<_Tp, _Size>&) _NOEXCEPT;
238 template <size_t _Ip, class _Tp, size_t _Size>
241 get(array<_Tp, _Size>&&) _NOEXCEPT;
243 template <size_t _Ip, class _Tp, size_t _Size>
246 get(const array<_Tp, _Size>&&) _NOEXCEPT;
Dalgorithm866 template <class _InputIterator, class _Size, class _Function>
869 for_each_n(_InputIterator __first, _Size __orig_n, _Function __f)
1481 template <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp>
1484 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag)
1501 _Size __c(0);
1518 template <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp>
1521 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag)
1525 _Size __len = static_cast<_Size>(__last - __first);
1542 _Size __c(0);
1558 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
[all …]
Distream1459 template <class _CharT, class _Traits, size_t _Size>
1461 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x)
1476 while (__c < _Size)
1491 __x = bitset<_Size>(__str);
Dcompare614 template <size_t _Size>
616 __compute_comp_type(std::array<_ClassifyCompCategory, _Size> __types) {
Dmemory3250 template <class _InputIterator, class _Size, class _ForwardIterator>
3252 uninitialized_copy_n(_InputIterator __f, _Size __n, _ForwardIterator __r)
3297 template <class _ForwardIterator, class _Size, class _Tp>
3299 uninitialized_fill_n(_ForwardIterator __f, _Size __n, const _Tp& __x)
3337 template <class _ForwardIterator, class _Size>
3339 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) {
3363 template <class _ForwardIterator, class _Size>
3365 _ForwardIterator uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) {
3401 template <class _ForwardIterator, class _Size>
3403 _ForwardIterator uninitialized_value_construct_n(_ForwardIterator __first, _Size __n) {
[all …]
/external/llvm-project/pstl/include/pstl/internal/
Dglue_memory_defs.h27 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
29 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator…
37 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
39 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator…
47 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
49 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __v…
57 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
59 destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n);
67 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
69 uninitialized_default_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n);
[all …]
Dunseq_backend_simd.h459 template <typename _Size, typename _Tp, typename _BinaryOperation, typename _UnaryOperation>
461 __simd_transform_reduce(_Size __n, _Tp __init, _BinaryOperation __binary_op, _UnaryOperation __f) n… in __simd_transform_reduce()
463 const _Size __block_size = __lane_size / sizeof(_Tp); in __simd_transform_reduce()
471 for (_Size __i = 0; __i < __block_size; ++__i) in __simd_transform_reduce()
476 _Size __i = 2 * __block_size; in __simd_transform_reduce()
477 const _Size last_iteration = __block_size * (__n / __block_size); in __simd_transform_reduce()
481 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce()
488 for (_Size __j = 0; __j < __n - last_iteration; ++__j) in __simd_transform_reduce()
493 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce()
499 for (_Size __j = 0; __j < __block_size; ++__j) in __simd_transform_reduce()
[all …]
Dglue_memory_impl.h62 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
64 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator… in uninitialized_copy_n()
81 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { in uninitialized_copy_n()
131 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
133 uninitialized_move_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator… in uninitialized_move_n()
150 [__is_vector](_InputIterator __begin, _Size __sz, _ForwardIterator __res) { in uninitialized_move_n()
197 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
199 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __v… in uninitialized_fill_n()
214 [&__value, &__is_vector](_ForwardIterator __begin, _Size __count) { in uninitialized_fill_n()
248 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
[all …]
Dalgorithm_fwd.h88 template <class _ForwardIterator, class _Size, class _Function>
89 _ForwardIterator __brick_walk1_n(_ForwardIterator, _Size, _Function,
96 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVe…
98 __pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Function, _IsVector,
101 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class …
103 __pattern_walk1_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Function, _IsVector,
106 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
108 __pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator, _Size, _Brick,
111 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Brick>
113 __pattern_walk_brick_n(_ExecutionPolicy&&, _RandomAccessIterator, _Size, _Brick,
[all …]
Dglue_algorithm_defs.h48 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
50 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f);
124 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPred…
126 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun…
129 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
131 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun…
140 template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2>
142 copy_n(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _Size __n, _ForwardIterator2 __result);
197 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
199 fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, const _Tp& __value);
[all …]
Dalgorithm_impl.h78 template <class _ForwardIterator, class _Size, class _Function>
80 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __f) in __for_each_n_it_serial()
152 template <class _ForwardIterator, class _Size, class _Function>
154 __brick_walk1_n(_ForwardIterator __first, _Size __n, _Function __f, /*_IsVectorTag=*/std::false_typ… in __brick_walk1_n()
168 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function, class _IsVe…
170 __pattern_walk1_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Function __f, _IsVector… in __pattern_walk1_n()
176 template <class _ExecutionPolicy, class _RandomAccessIterator, class _Size, class _Function, class …
178 __pattern_walk1_n(_ExecutionPolicy&& __exec, _RandomAccessIterator __first, _Size __n, _Function __… in __pattern_walk1_n()
187 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Brick>
189 __pattern_walk_brick_n(_ExecutionPolicy&&, _ForwardIterator __first, _Size __n, _Brick __brick, in __pattern_walk_brick_n()
[all …]
Dglue_algorithm_impl.h71 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
73 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f) in for_each_n()
230 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp, class _BinaryPred…
232 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun… in search_n()
241 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
243 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun… in search_n()
269 template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2>
271 copy_n(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _Size __n, _ForwardIterator2 __result) in copy_n()
279 [__is_vector](_ForwardIterator1 __begin, _Size __sz, _ForwardIterator2 __res) { in copy_n()
422 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
[all …]
/external/libcxx/benchmarks/
Dunordered_set_operations.bench.cpp18 template <class _Size>
20 _Size loadword(const void* __p) { in loadword()
21 _Size __r; in loadword()
/external/mesa3d/src/gallium/drivers/swr/rasterizer/common/
Dos.h86 static inline void* AlignedMalloc(size_t _Size, size_t _Alignment) in AlignedMalloc() argument
88 return _aligned_malloc(_Size, _Alignment); in AlignedMalloc()
/external/rust/crates/gdbstub/src/arch/mips/reg/
Did.rs44 _Size(U), enumerator

12