| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| list_partition.h | 117 _IIter __prev = __begin, __it = __begin; local
|
| list_partition.h | 117 _IIter __prev = __begin, __it = __begin; local
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| list_partition.h | 117 _IIter __prev = __begin, __it = __begin; local
|
| list_partition.h | 117 _IIter __prev = __begin, __it = __begin; local
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| stl_tempbuf.h | 211 _Pointer __prev = __cur; local
213 for(; __cur != __last; ++__cur, ++__prev)
215 _GLIBCXX_MOVE(*__prev));
216 *__seed = _GLIBCXX_MOVE(*__prev);
|
| stl_tempbuf.h | 211 _Pointer __prev = __cur; local
213 for(; __cur != __last; ++__cur, ++__prev)
215 _GLIBCXX_MOVE(*__prev));
216 *__seed = _GLIBCXX_MOVE(*__prev);
|
| locale_conv.h | 454 auto __prev = _M_buf; variable
456 return __prev;
|
| locale_conv.h | 454 auto __prev = _M_buf; variable
456 return __prev;
|
| hashtable.h | 2206 __node_base_ptr __prev local
2212 if (__prev)
2215 __node->_M_nxt = __prev->_M_nxt;
2216 __prev->_M_nxt = __node;
2217 if (__builtin_expect(__prev == __hint, false))
|
| hashtable.h | 2206 __node_base_ptr __prev local
2212 if (__prev)
2215 __node->_M_nxt = __prev->_M_nxt;
2216 __prev->_M_nxt = __node;
2217 if (__builtin_expect(__prev == __hint, false))
|
| ranges_algo.h | 3255 auto __prev = __first; local
3261 if (__comp_proj(*__prev, *__result.min))
3262 __result.min = __prev;
3263 else if (!__comp_proj(*__prev, *__result.max))
3264 __result.max = __prev;
3267 if (!__comp_proj(*__first, *__prev))
3269 if (__comp_proj(*__prev, *__result.min))
3270 __result.min = __prev;
3278 if (!__comp_proj(*__prev, *__result.max))
3279 __result.max = __prev;
[all...] |
| ranges_algo.h | 3255 auto __prev = __first; local
3261 if (__comp_proj(*__prev, *__result.min))
3262 __result.min = __prev;
3263 else if (!__comp_proj(*__prev, *__result.max))
3264 __result.max = __prev;
3267 if (!__comp_proj(*__first, *__prev))
3269 if (__comp_proj(*__prev, *__result.min))
3270 __result.min = __prev;
3278 if (!__comp_proj(*__prev, *__result.max))
3279 __result.max = __prev;
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| stl_tempbuf.h | 277 _Pointer __prev = __cur; local
279 for(; __cur != __last; ++__cur, ++__prev)
281 _GLIBCXX_MOVE(*__prev));
282 *__seed = _GLIBCXX_MOVE(*__prev);
|
| stl_tempbuf.h | 277 _Pointer __prev = __cur; local
279 for(; __cur != __last; ++__cur, ++__prev)
281 _GLIBCXX_MOVE(*__prev));
282 *__seed = _GLIBCXX_MOVE(*__prev);
|
| locale_conv.h | 454 auto __prev = _M_buf; variable
456 return __prev;
|
| locale_conv.h | 454 auto __prev = _M_buf; variable
456 return __prev;
|
| hashtable.h | 2267 __node_base_ptr __prev local
2273 if (__prev)
2276 __node->_M_nxt = __prev->_M_nxt;
2277 __prev->_M_nxt = __node;
2278 if (__builtin_expect(__prev == __hint, false))
|
| hashtable.h | 2267 __node_base_ptr __prev local
2273 if (__prev)
2276 __node->_M_nxt = __prev->_M_nxt;
2277 __prev->_M_nxt = __node;
2278 if (__builtin_expect(__prev == __hint, false))
|
| ranges_algo.h | 3184 auto __prev = __first; local
3190 if (__comp_proj(*__prev, *__result.min))
3191 __result.min = __prev;
3192 else if (!__comp_proj(*__prev, *__result.max))
3193 __result.max = __prev;
3196 if (!__comp_proj(*__first, *__prev))
3198 if (__comp_proj(*__prev, *__result.min))
3199 __result.min = __prev;
3207 if (!__comp_proj(*__prev, *__result.max))
3208 __result.max = __prev;
[all...] |
| ranges_algo.h | 3184 auto __prev = __first; local
3190 if (__comp_proj(*__prev, *__result.min))
3191 __result.min = __prev;
3192 else if (!__comp_proj(*__prev, *__result.max))
3193 __result.max = __prev;
3196 if (!__comp_proj(*__first, *__prev))
3198 if (__comp_proj(*__prev, *__result.min))
3199 __result.min = __prev;
3207 if (!__comp_proj(*__prev, *__result.max))
3208 __result.max = __prev;
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 933 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
936 if (__prev)
938 __new_node->_M_next = __prev->_M_next;
939 __prev->_M_next = __new_node;
|
| hashtable.h | 933 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
936 if (__prev)
938 __new_node->_M_next = __prev->_M_next;
939 __prev->_M_next = __new_node;
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
| hashtable.h | 933 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
936 if (__prev)
938 __new_node->_M_next = __prev->_M_next;
939 __prev->_M_next = __new_node;
|
| hashtable.h | 933 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code); local
936 if (__prev)
938 __new_node->_M_next = __prev->_M_next;
939 __prev->_M_next = __new_node;
|
