| /src/external/apache2/llvm/dist/libcxx/src/ |
| valarray.cpp | 25 size_t __k = __size_.size() != 0; local
27 __k *= __size_[__i];
28 __1d_.resize(__k);
31 __k = 0;
32 __1d_[__k] = __start;
40 ++__k;
41 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| parallel_impl.h | 46 const _DifferenceType __k = __res - __first; local
47 for (_DifferenceType __old = __extremum; __comp(__k, __old);
50 __extremum.compare_exchange_weak(__old, __k);
|
| parallel_backend_tbb.h | 291 _Index __k = 1; local
292 while (2 * __k < __m)
293 __k *= 2;
294 return __k;
309 _Index __k = __split(__m); local
311 [=] { __tbb_backend::__upsweep(__i, __k, __tilesize, __r, __tilesize, __reduce, __combine); },
313 __tbb_backend::__upsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, __reduce, __combine);
315 if (__m == 2 * __k)
329 const _Index __k = __split(__m); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| search.h | 59 _DifferenceType __k = 0; local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
63 __k = __off[__k];
64 __off[__j] = ++__k;
|
| base.h | 104 _Size __k; local
105 for (__k = 0; __n > 1; __n >>= 1)
106 ++__k;
107 return __k;
|
| multiway_merge.h | 507 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
509 _LT __lt(__k, __comp);
514 for (_SeqNumber __t = 0; __t < __k; ++__t)
521 for (_SeqNumber __t = 0; __t < __k; ++__t)
594 _SeqNumber __k = __seqs_end - __seqs_begin; local
596 _LT __lt(__k, __sentinel, __comp);
598 for (_SeqNumber __t = 0; __t < __k; ++__t)
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k);
957 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
959 switch (__k)
1051 const _SeqNumber __k local
1136 const _SeqNumber __k = __seqs_end - __seqs_begin; local
1251 _SeqNumber __k = 0; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| search.h | 59 _DifferenceType __k = 0; local
62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))
63 __k = __off[__k];
64 __off[__j] = ++__k;
|
| base.h | 104 _Size __k; local
105 for (__k = 0; __n > 1; __n >>= 1)
106 ++__k;
107 return __k;
|
| multiway_merge.h | 507 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
509 _LT __lt(__k, __comp);
514 for (_SeqNumber __t = 0; __t < __k; ++__t)
521 for (_SeqNumber __t = 0; __t < __k; ++__t)
594 _SeqNumber __k = __seqs_end - __seqs_begin; local
596 _LT __lt(__k, __sentinel, __comp);
598 for (_SeqNumber __t = 0; __t < __k; ++__t)
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k);
957 _SeqNumber __k = static_cast<_SeqNumber>(__seqs_end - __seqs_begin); local
959 switch (__k)
1051 const _SeqNumber __k local
1136 const _SeqNumber __k = __seqs_end - __seqs_begin; local
1251 _SeqNumber __k = 0; local
[all...] |
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| unordered_set_operations.bench.cpp | 86 uint32_t __k = data; local
87 __k *= __m;
88 __k ^= __k >> __r;
89 __k *= __m;
91 __h ^= __k;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| stl_map.h | 493 * @param __k The key for which data should be retrieved.
504 operator[](const key_type& __k)
509 iterator __i = lower_bound(__k);
510 // __i->first is greater than or equivalent to __k.
511 if (__i == end() || key_comp()(__k, (*__i).first))
514 std::tuple<const key_type&>(__k),
517 __i = insert(__i, value_type(__k, mapped_type()));
524 operator[](key_type&& __k)
529 iterator __i = lower_bound(__k);
530 // __i->first is greater than or equivalent to __k
597 const key_type& __k = __a; local
855 const key_type& __k = __x.first; local
[all...] |
| hashtable.h | 692 bucket(const key_type& __k) const
693 { return _M_bucket_index(this->_M_hash_code(__k)); }
750 find(const key_type& __k);
753 find(const key_type& __k) const;
756 count(const key_type& __k) const;
759 equal_range(const key_type& __k);
762 equal_range(const key_type& __k) const;
769 _M_find_tr(const _Kt& __k);
775 _M_find_tr(const _Kt& __k) const;
781 _M_count_tr(const _Kt& __k) const
1044 const key_type& __k = __nh._M_key(); local
1089 const key_type& __k = __nh._M_key(); local
1168 const key_type& __k = _ExtractKey{}(*__pos); local
1217 const key_type& __k = _ExtractKey{}(*__pos); local
2136 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local
2173 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local
2262 const key_type& __k = _ExtractKey{}(__node->_M_v()); local
[all...] |
| ranges_algo.h | 1353 auto __k = __middle - __first; local
1355 if (__k == __n - __k)
1357 ranges::swap_ranges(__first, __middle, __middle, __middle + __k);
1366 if (__k < __n - __k)
1371 if (__k == 1)
1378 auto __q = __p + __k;
1379 for (decltype(__n) __i = 0; __i < __n - __k; ++ __i)
1385 __n %= __k;
1553 const auto __k = __d(__g, __param_type{0, __pop_sz}); local
[all...] |
| stl_algo.h | 1261 _Distance __k = __middle - __first; local
1263 if (__k == __n - __k)
1274 if (__k < __n - __k)
1276 if (__is_pod(_ValueType) && __k == 1)
1283 _RandomAccessIterator __q = __p + __k;
1284 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1290 __n = static_cast<_UDistance>(__n) % static_cast<_UDistance>(__k);
1293 std::swap(__n, __k);
5745 const auto __k = __d(__g, __param_type{0, __pop_sz}); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 522 const size_t __k = sizeof(_Thread_record) local
524 __v = ::operator new(__k);
717 const size_t __k = sizeof(_Thread_record) local
719 __v = ::operator new(__k);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++98/ |
| mt_allocator.cc | 522 const size_t __k = sizeof(_Thread_record) local
524 __v = ::operator new(__k);
717 const size_t __k = sizeof(_Thread_record) local
719 __v = ::operator new(__k);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| stl_map.h | 493 * @param __k The key for which data should be retrieved.
504 operator[](const key_type& __k)
509 iterator __i = lower_bound(__k);
510 // __i->first is greater than or equivalent to __k.
511 if (__i == end() || key_comp()(__k, (*__i).first))
514 std::tuple<const key_type&>(__k),
517 __i = insert(__i, value_type(__k, mapped_type()));
524 operator[](key_type&& __k)
529 iterator __i = lower_bound(__k);
530 // __i->first is greater than or equivalent to __k
597 const key_type& __k = __a; local
856 const key_type& __k = __x.first; local
[all...] |
| hashtable.h | 684 bucket(const key_type& __k) const
685 { return _M_bucket_index(this->_M_hash_code(__k)); }
742 find(const key_type& __k);
745 find(const key_type& __k) const;
748 count(const key_type& __k) const;
751 equal_range(const key_type& __k);
754 equal_range(const key_type& __k) const;
763 _M_find_tr(const _Kt& __k);
769 _M_find_tr(const _Kt& __k) const;
775 _M_count_tr(const _Kt& __k) const
1000 const key_type& __k = __nh._M_key(); local
1029 const key_type& __k = __nh._M_key(); local
1107 const key_type& __k = _ExtractKey{}(*__pos); local
1137 const key_type& __k = _ExtractKey{}(*__pos); local
2079 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local
2115 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local
2201 const key_type& __k = _ExtractKey{}(__node->_M_v()); local
[all...] |
| ranges_algo.h | 1376 auto __k = __middle - __first; local
1378 if (__k == __n - __k)
1380 ranges::swap_ranges(__first, __middle, __middle, __middle + __k);
1389 if (__k < __n - __k)
1394 if (__k == 1)
1401 auto __q = __p + __k;
1402 for (decltype(__n) __i = 0; __i < __n - __k; ++ __i)
1408 __n %= __k;
1576 const auto __k = __d(__g, __param_type{0, __pop_sz}); local
[all...] |
| stl_algo.h | 1300 _Distance __k = __middle - __first; local
1302 if (__k == __n - __k)
1313 if (__k < __n - __k)
1315 if (__is_pod(_ValueType) && __k == 1)
1322 _RandomAccessIterator __q = __p + __k;
1323 for (_Distance __i = 0; __i < __n - __k; ++ __i)
1329 __n %= __k;
1332 std::swap(__n, __k);
5786 const auto __k = __d(__g, __param_type{0, __pop_sz}); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 290 bucket(const key_type& __k) const
292 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
331 find(const key_type& __k);
334 find(const key_type& __k) const;
337 count(const key_type& __k) const;
340 equal_range(const key_type& __k);
343 equal_range(const key_type& __k) const;
704 find(const key_type& __k)
706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
870 const key_type& __k = this->_M_extract(__v); local
901 const key_type& __k = this->_M_extract(__v); local
928 const key_type& __k = this->_M_extract(__v); local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 290 bucket(const key_type& __k) const
292 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
331 find(const key_type& __k);
334 find(const key_type& __k) const;
337 count(const key_type& __k) const;
340 equal_range(const key_type& __k);
343 equal_range(const key_type& __k) const;
704 find(const key_type& __k)
706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
870 const key_type& __k = this->_M_extract(__v); local
901 const key_type& __k = this->_M_extract(__v); local
928 const key_type& __k = this->_M_extract(__v); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| parallel_backend_tbb.h | 301 _Index __k = 1; local
302 while (2 * __k < __m)
303 __k *= 2;
304 return __k;
319 _Index __k = __split(__m); local
321 [=] { __tbb_backend::__upsweep(__i, __k, __tilesize, __r, __tilesize, __reduce, __combine); },
323 __tbb_backend::__upsweep(__i + __k, __m - __k, __tilesize, __r + __k, __lastsize, __reduce, __combine);
325 if (__m == 2 * __k)
339 const _Index __k = __split(__m); local
[all...] |
