| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| equally_split.h | 53 _DifferenceType __pos = 0; local
56 *__s++ = __pos;
57 __pos += ((__i < __num_longer_chunks)
|
| multiway_mergesort.h | 450 _DifferenceType __pos = 0; local
453 __starts[__i] = __pos;
454 __pos += ((__i < __split)
457 __starts[__num_threads] = __pos;
|
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| equally_split.h | 53 _DifferenceType __pos = 0; local
56 *__s++ = __pos;
57 __pos += ((__i < __num_longer_chunks)
|
| multiway_mergesort.h | 450 _DifferenceType __pos = 0; local
453 __starts[__i] = __pos;
454 __pos += ((__i < __split)
457 __starts[__num_threads] = __pos;
|
| losertree.h | 136 unsigned int __pos = _M_k + __source; local
146 _M_losers[__pos]._M_key = __key;
148 _M_losers[__pos]._M_sup = __sup;
149 _M_losers[__pos]._M_source = __source;
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
232 __pos /= 2)
235 if ((__sup && (!_M_losers[__pos]._M_sup
236 || _M_losers[__pos]._M_source < __source))
237 || (!__sup && !_M_losers[__pos]._M_su
395 unsigned int __pos = _M_k + __source; local
633 unsigned int __pos = _M_k + __source; local
878 unsigned int __pos = _M_k + __source; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| charconv.h | 83 unsigned __pos = __len - 1; local
88 __first[__pos] = __digits[__num + 1];
89 __first[__pos - 1] = __digits[__num];
90 __pos -= 2;
|
| fs_path.h | 717 void _M_erase_from(const_iterator __pos); // erases [__pos,end())
866 _Cmpt(basic_string_view<value_type> __s, _Type __t, size_t __pos);
1095 auto __pos = _M_pathname.find(L'/'); local
1096 while (__pos != _M_pathname.npos)
1098 _M_pathname[__pos] = preferred_separator;
1099 __pos = _M_pathname.find(L'/', __pos);
|
| hashtable.h | 1075 extract(const_iterator __pos)
1077 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1079 _M_get_previous_node(__bkt, __pos._M_cur));
1106 auto __pos = __i++; local
1107 const key_type& __k = _ExtractKey{}(*__pos);
1109 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1113 auto __nh = __src.extract(__pos);
1136 auto __pos = __i++; local
1137 const key_type& __k = _ExtractKey{}(*__pos);
1139 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur)
2118 auto __pos local
2268 auto __pos local
2295 auto __pos local
[all...] |
| stl_deque.h | 2018 _M_insert_dispatch(iterator __pos,
2020 { _M_fill_insert(__pos, __n, __x); }
2025 _M_insert_dispatch(iterator __pos,
2029 _M_range_insert_aux(__pos, __first, __last,
2037 _M_range_insert_aux(iterator __pos, _InputIterator __first,
2043 _M_range_insert_aux(iterator __pos, _ForwardIterator __first,
2050 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
2055 _M_insert_aux(iterator __pos, const value_type& __x);
2059 _M_insert_aux(iterator __pos, _Args&&... __args);
2064 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x)
2098 _M_destroy_data(begin(), __pos, _M_get_Tp_allocator()); local
[all...] |
| basic_string.h | 389 _M_check(size_type __pos, const char* __s) const
391 if (__pos > this->size())
392 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
394 __s, __pos, this->size());
395 return __pos;
407 // NB: _M_limit doesn't check for a bad __pos value.
410 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
412 const bool __testoff = __off < this->size() - __pos;
413 return __testoff ? __off : this->size() - __pos;
509 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s
1764 const size_type __pos = __p - begin(); local
1809 const size_type __pos = __p - begin(); local
1984 const size_type __pos = __p - begin(); local
2068 const size_type __pos = __position - begin(); local
2088 const size_type __pos = __first - begin(); local
[all...] |
| cow_string.h | 366 _M_check(size_type __pos, const char* __s) const
368 if (__pos > this->size())
369 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
371 __s, __pos, this->size());
372 return __pos;
382 // NB: _M_limit doesn't check for a bad __pos value.
384 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
386 const bool __testoff = __off < this->size() - __pos;
387 return __testoff ? __off : this->size() - __pos;
469 _M_mutate(size_type __pos, size_type __len1, size_type __len2)
1661 const size_type __pos = __p - _M_ibegin(); local
1738 const size_type __pos = __position - _M_ibegin(); local
3194 const size_type __pos = __s - _M_data(); local
3328 const size_type __pos = __first - _M_ibegin(); local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| charconv.h | 93 unsigned __pos = __len - 1; local
98 __first[__pos] = __digits[__num + 1];
99 __first[__pos - 1] = __digits[__num];
100 __pos -= 2;
|
| fs_path.h | 717 void _M_erase_from(const_iterator __pos); // erases [__pos,end())
861 _Cmpt(basic_string_view<value_type> __s, _Type __t, size_t __pos);
1090 auto __pos = _M_pathname.find(L'/'); local
1091 while (__pos != _M_pathname.npos)
1093 _M_pathname[__pos] = preferred_separator;
1094 __pos = _M_pathname.find(L'/', __pos);
|
| basic_string.h | 391 _M_check(size_type __pos, const char* __s) const
393 if (__pos > this->size())
394 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
396 __s, __pos, this->size());
397 return __pos;
409 // NB: _M_limit doesn't check for a bad __pos value.
412 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
414 const bool __testoff = __off < this->size() - __pos;
415 return __testoff ? __off : this->size() - __pos;
511 _M_mutate(size_type __pos, size_type __len1, const _CharT* __s
1834 const size_type __pos = __p - begin(); local
1879 const size_type __pos = __p - begin(); local
2054 const size_type __pos = __p - begin(); local
2138 const size_type __pos = __position - begin(); local
2158 const size_type __pos = __first - begin(); local
[all...] |
| hashtable.h | 1135 extract(const_iterator __pos)
1137 size_t __bkt = _M_bucket_index(*__pos._M_cur);
1139 _M_get_previous_node(__bkt, __pos._M_cur));
1166 auto __pos = __i++; local
1168 const key_type& __k = _ExtractKey{}(*__pos);
1188 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur);
1193 auto __nh = __src.extract(__pos);
1216 auto __pos = __i++; local
1217 const key_type& __k = _ExtractKey{}(*__pos);
1219 = _M_src_hash_code(__src.hash_function(), __k, *__pos._M_cur)
2176 auto __pos local
2330 auto __pos local
2357 auto __pos local
[all...] |
| stl_deque.h | 2018 _M_insert_dispatch(iterator __pos,
2020 { _M_fill_insert(__pos, __n, __x); }
2025 _M_insert_dispatch(iterator __pos,
2029 _M_range_insert_aux(__pos, __first, __last,
2037 _M_range_insert_aux(iterator __pos, _InputIterator __first,
2043 _M_range_insert_aux(iterator __pos, _ForwardIterator __first,
2050 _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
2055 _M_insert_aux(iterator __pos, const value_type& __x);
2058 _M_insert_aux(iterator __pos, const value_type& __x)
2059 { return _M_emplace_aux(__pos, __x);
2102 _M_destroy_data(begin(), __pos, _M_get_Tp_allocator()); local
[all...] |
| cow_string.h | 358 _M_check(size_type __pos, const char* __s) const
360 if (__pos > this->size())
361 __throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
363 __s, __pos, this->size());
364 return __pos;
374 // NB: _M_limit doesn't check for a bad __pos value.
376 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
378 const bool __testoff = __off < this->size() - __pos;
379 return __testoff ? __off : this->size() - __pos;
461 _M_mutate(size_type __pos, size_type __len1, size_type __len2)
1695 const size_type __pos = __p - _M_ibegin(); local
1772 const size_type __pos = __position - _M_ibegin(); local
3284 const size_type __pos = __s - _M_data(); local
3418 const size_type __pos = __first - _M_ibegin(); local
[all...] |
| hashtable_policy.h | 891 auto __pos variable
894 return __pos->second;
918 auto __pos variable
921 return __pos->second;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/ |
| set.h | 239 emplace_hint(const_iterator __pos, _Args&&... __args)
241 __glibcxx_check_insert(__pos);
244 _Base::emplace_hint(__pos.base(), std::forward<_Args>(__args)...),
328 iterator __pos = iterator(__ret.position, this); local
329 return { __pos, __ret.inserted, std::move(__ret.node) };
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/ |
| set.h | 239 emplace_hint(const_iterator __pos, _Args&&... __args)
241 __glibcxx_check_insert(__pos);
244 _Base::emplace_hint(__pos.base(), std::forward<_Args>(__args)...),
328 iterator __pos = iterator(__ret.position, this); local
329 return { __pos, __ret.inserted, std::move(__ret.node) };
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/ |
| vstring.h | 89 _M_check(size_type __pos, const char* __s) const
91 if (__pos > this->size())
92 std::__throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
94 __s, __pos, this->size());
95 return __pos;
105 // NB: _M_limit doesn't check for a bad __pos value.
107 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
109 const bool __testoff = __off < this->size() - __pos;
110 return __testoff ? __off : this->size() - __pos;
177 * @param __pos Index of first character to copy from
947 const size_type __pos = __p - _M_ibegin(); local
991 const size_type __pos = __p - _M_ibegin(); local
1155 const size_type __pos = __p - _M_ibegin(); local
1201 const size_type __pos = __position - _M_ibegin(); local
1226 const size_type __pos = __first - _M_ibegin(); local
[all...] |
| ropeimpl.h | 67 size_t __pos = __x._M_current_pos; local
73 __x._M_buf_ptr = __x._M_buf_start + (__pos - __leaf_pos);
84 if (__buf_start_pos + __len <= __pos)
86 __buf_start_pos = __pos - __len / 4;
93 __x._M_buf_ptr = __x._M_tmp_buf + (__pos - __buf_start_pos);
115 size_t __pos = __x._M_current_pos; local
118 if (__pos >= __x._M_root->_M_size)
129 __x._M_buf_ptr = __curr_rope->_M_c_string + __pos;
154 if (__pos >= __curr_start_pos + __left_len)
313 _Rope_iterator(rope<_CharT, _Alloc>& __r, std::size_t __pos)
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/ |
| vstring.h | 87 _M_check(size_type __pos, const char* __s) const
89 if (__pos > this->size())
90 std::__throw_out_of_range_fmt(__N("%s: __pos (which is %zu) > "
92 __s, __pos, this->size());
93 return __pos;
103 // NB: _M_limit doesn't check for a bad __pos value.
105 _M_limit(size_type __pos, size_type __off) const _GLIBCXX_NOEXCEPT
107 const bool __testoff = __off < this->size() - __pos;
108 return __testoff ? __off : this->size() - __pos;
175 * @param __pos Index of first character to copy from
945 const size_type __pos = __p - _M_ibegin(); local
989 const size_type __pos = __p - _M_ibegin(); local
1153 const size_type __pos = __p - _M_ibegin(); local
1199 const size_type __pos = __position - _M_ibegin(); local
1224 const size_type __pos = __first - _M_ibegin(); local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/impl/ |
| profiler_trace.h | 537 std::string::size_type __pos = __line.find("="); local
538 std::string __factor_name = __line.substr(0, __pos);
540 std::string __factor_value = __line.substr(__pos + 1, __end - __pos);
|
