| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| list_partition.h | 119 size_t __cur = 1, __next = 1; local
124 __cur = __next;
143 __next = __os_starts.size() / 2 + 1;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| list_partition.h | 119 size_t __cur = 1, __next = 1; local
124 __cur = __next;
143 __next = __os_starts.size() / 2 + 1;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++17/ |
| memory_resource.cc | 266 _Chunk* __next = __head; local
268 while (__next)
270 _Chunk* __ch = __next;
271 __next = __ch->_M_next;
280 _Chunk(size_t __size, size_t __align, _Chunk* __next) noexcept
281 : _M_size(__size, __align), _M_next(__next)
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++17/ |
| memory_resource.cc | 266 _Chunk* __next = __head; local
268 while (__next)
270 _Chunk* __ch = __next;
271 __next = __ch->_M_next;
280 _Chunk(size_t __size, size_t __align, _Chunk* __next) noexcept
281 : _M_size(__size, __align), _M_next(__next)
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| stl_list.h | 205 _List_node_base* __next = __first2->_M_next; local
206 __first1->_M_transfer(__first2, __next);
207 __first2 = __next;
|
| locale_conv.h | 66 auto __next = __first; local
72 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen);
75 __result = (__cvt.*__fn)(__state, __next, __last, __next,
79 while (__result == codecvt_base::partial && __next != __last
84 __count = __next - __first;
100 __count = __next - __first;
588 const _Elem* __next = __first; local
592 __start = __next;
595 auto __result = _M_cvt->out(_M_state, __next, __last, __next
[all...] |
| hashtable.h | 2033 _M_remove_bucket_begin(size_type __bkt, __node_ptr __next,
2036 if (!__next || __next_bkt != __bkt)
2040 if (__next)
2045 _M_before_begin._M_nxt = __next;
2583 __node_ptr __next = __p->_M_next(); local
2601 __p = __next;
2630 __node_ptr __next = __p->_M_next(); local
2683 __p = __next;
|
| ranges_algo.h | 522 auto __next = __first;
523 for (; ++__next != __last; __first = __next)
527 std::__invoke(__proj, *__next)))
530 return __next;
1218 auto __next = __first; local
1219 *__result = *__next;
1220 while (++__next != __last)
1223 std::__invoke(__proj, *__next)))
1225 __first = __next;
[all...] |
| stl_algo.h | 889 _ForwardIterator __next = __first;
890 while (++__next != __last)
892 if (__binary_pred(__first, __next))
894 __first = __next;
1001 _ForwardIterator __next = __first; local
1003 while (++__next != __last)
1004 if (!__binary_pred(__first, __next))
1006 __first = __next;
1453 _ForwardIterator __next = __first;
1455 while (++__next != __last
1792 _RandomAccessIterator __next = __last; local
3323 _ForwardIterator __next = __first; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/ |
| ios.cc | 181 _Callback_list* __next = __p->_M_next; local
183 __p = __next;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| stl_list.h | 206 _List_node_base* __next = __first2->_M_next; local
207 __first1->_M_transfer(__first2, __next);
208 __first2 = __next;
|
| locale_conv.h | 66 auto __next = __first; local
72 __outstr.resize(__outstr.size() + (__last - __next) * __maxlen);
75 __result = (__cvt.*__fn)(__state, __next, __last, __next,
79 while (__result == codecvt_base::partial && __next != __last
84 __count = __next - __first;
100 __count = __next - __first;
588 const _Elem* __next = __first; local
592 __start = __next;
595 auto __result = _M_cvt->out(_M_state, __next, __last, __next
[all...] |
| hashtable.h | 2621 __node_ptr __next = __p->_M_next(); local
2639 __p = __next;
2668 __node_ptr __next = __p->_M_next(); local
2721 __p = __next;
|
| chrono_io.h | 1954 auto __next = _M_f._M_parse(__pc, __format::_ZonedDateTime); local
1958 return __next;
|
| ranges_algo.h | 1195 auto __next = __first; local
1196 *__result = *__next;
1197 while (++__next != __last)
1200 std::__invoke(__proj, *__next)))
1202 __first = __next;
1205 return {__next, std::move(++__result)};
1970 auto __next = __first;
1971 for (++__next; __next != __last; __first = __next, (void)++__next
[all...] |
| stl_algo.h | 844 _ForwardIterator __next = __first;
845 while (++__next != __last)
847 if (__binary_pred(__first, __next))
849 __first = __next;
956 _ForwardIterator __next = __first; local
958 while (++__next != __last)
959 if (!__binary_pred(__first, __next))
961 __first = __next;
1414 _ForwardIterator __next = __first;
1416 while (++__next != __last
1755 _RandomAccessIterator __next = __last; local
3321 _ForwardIterator __next = __first; local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++11/ |
| ios.cc | 181 _Callback_list* __next = __p->_M_next; local
183 __p = __next;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 891 _Node* __next = __cur->_M_next; local
892 while (__next)
894 if (_M_equals(_M_get_key(__next->_M_val), __key))
896 if (&_M_get_key(__next->_M_val) != &__key)
898 __cur->_M_next = __next->_M_next;
899 _M_delete_node(__next);
900 __next = __cur->_M_next;
907 __cur = __next;
908 __next = __cur->_M_next;
913 __cur = __next;
955 _Node* __next = __cur->_M_next; local
1054 _Node* __next = __tmp[__bucket]->_M_next; local
1075 _Node* __next; local
1098 _Node* __next = __cur->_M_next; local
1119 _Node* __next = __cur->_M_next; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 967 _Node* __next = __cur->_M_next; local
968 while (__next != __p)
970 __cur = __next;
971 __next = __cur->_M_next;
973 __cur->_M_next = __next->_M_next;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/backward/ |
| hashtable.h | 891 _Node* __next = __cur->_M_next; local
892 while (__next)
894 if (_M_equals(_M_get_key(__next->_M_val), __key))
896 if (&_M_get_key(__next->_M_val) != &__key)
898 __cur->_M_next = __next->_M_next;
899 _M_delete_node(__next);
900 __next = __cur->_M_next;
907 __cur = __next;
908 __next = __cur->_M_next;
913 __cur = __next;
955 _Node* __next = __cur->_M_next; local
1054 _Node* __next = __tmp[__bucket]->_M_next; local
1075 _Node* __next; local
1098 _Node* __next = __cur->_M_next; local
1119 _Node* __next = __cur->_M_next; local
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 967 _Node* __next = __cur->_M_next; local
968 while (__next != __p)
970 __cur = __next;
971 __next = __cur->_M_next;
973 __cur->_M_next = __next->_M_next;
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
| parallel_backend_tbb.h | 620 __task* __next = _M_func(this); variable
621 return finalize(__next);
631 finalize(__task* __next)
638 return __next;
651 _PSTL_ASSERT(__next == nullptr);
656 return __next;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
| parallel_backend_tbb.h | 630 __task* __next = _M_func(this); variable
631 return finalize(__next);
641 finalize(__task* __next)
648 return __next;
661 _PSTL_ASSERT(__next == nullptr);
666 return __next;
|
