Home
last modified time | relevance | path

Searched refs:__right (Results 1 – 12 of 12) sorted by relevance

/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/parallel/
H A Dlosertree.h192 if (_M_losers[__right]._M_sup in __init_winner()
205 return __right; in __init_winner()
292 if (_M_losers[__right]._M_sup in __init_winner()
305 return __right; in __init_winner()
431 if (_M_losers[__right]._M_sup in __init_winner()
444 return __right; in __init_winner()
526 return __right; in __init_winner()
680 return __right; in __init_winner()
775 return __right; in __init_winner()
925 return __right; in __init_winner()
[all …]
H A Dpartition.h70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1, in __parallel_partition() local
160 __fetch_and_add(&__right, -__chunk_size); in __parallel_partition()
201 __rightold = __right, in __parallel_partition()
202 __rightnew = __right + __leftover_right * __chunk_size; in __parallel_partition()
218 __reserved_right[((__thread_right_border - 1) - __right) in __parallel_partition()
281 __right = __rightnew; in __parallel_partition()
282 __dist = __right - __left + 1; in __parallel_partition()
285 # pragma omp flush(__left, __right) in __parallel_partition()
288 _DifferenceType __final_left = __left, __final_right = __right; in __parallel_partition()
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/parallel/
H A Dlosertree.h192 if (_M_losers[__right]._M_sup in __init_winner()
205 return __right; in __init_winner()
292 if (_M_losers[__right]._M_sup in __init_winner()
305 return __right; in __init_winner()
431 if (_M_losers[__right]._M_sup in __init_winner()
444 return __right; in __init_winner()
526 return __right; in __init_winner()
680 return __right; in __init_winner()
775 return __right; in __init_winner()
925 return __right; in __init_winner()
[all …]
H A Dpartition.h70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1, in __parallel_partition() local
160 __fetch_and_add(&__right, -__chunk_size); in __parallel_partition()
201 __rightold = __right, in __parallel_partition()
202 __rightnew = __right + __leftover_right * __chunk_size; in __parallel_partition()
218 __reserved_right[((__thread_right_border - 1) - __right) in __parallel_partition()
281 __right = __rightnew; in __parallel_partition()
282 __dist = __right - __left + 1; in __parallel_partition()
285 # pragma omp flush(__left, __right) in __parallel_partition()
288 _DifferenceType __final_left = __left, __final_right = __right; in __parallel_partition()
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/ext/
H A Dropeimpl.h550 _RopeLeaf* __right = in _GLIBCXX_VISIBILITY() local
623 __right->_M_unref_nonnil(); in _GLIBCXX_VISIBILITY()
635 _RopeRep* __right = in _GLIBCXX_VISIBILITY() local
643 _S_unref(__right); in _GLIBCXX_VISIBILITY()
657 _S_ref(__right); in _GLIBCXX_VISIBILITY()
658 return __right; in _GLIBCXX_VISIBILITY()
660 if (0 == __right) in _GLIBCXX_VISIBILITY()
672 __right->_M_size); in _GLIBCXX_VISIBILITY()
686 __right)-> in _GLIBCXX_VISIBILITY()
708 _S_unref(__right); in _GLIBCXX_VISIBILITY()
[all …]
H A Drope419 const rope<_CharT, _Alloc>& __right);
2205 __result = _S_concat(__left, __right);
2813 // __right in registers.
2816 __right._M_tree_ptr));
2824 __left.append(__right);
2831 const _CharT* __right)
2836 __right, __rlen));
2842 const _CharT* __right)
2844 __left.append(__right);
2854 &__right, 1));
[all …]
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/ext/
H A Dropeimpl.h549 _RopeLeaf* __right = in _GLIBCXX_VISIBILITY() local
622 __right->_M_unref_nonnil(); in _GLIBCXX_VISIBILITY()
634 _RopeRep* __right = in _GLIBCXX_VISIBILITY() local
642 _S_unref(__right); in _GLIBCXX_VISIBILITY()
656 _S_ref(__right); in _GLIBCXX_VISIBILITY()
657 return __right; in _GLIBCXX_VISIBILITY()
659 if (0 == __right) in _GLIBCXX_VISIBILITY()
671 __right->_M_size); in _GLIBCXX_VISIBILITY()
685 __right)-> in _GLIBCXX_VISIBILITY()
707 _S_unref(__right); in _GLIBCXX_VISIBILITY()
[all …]
H A Drope418 const rope<_CharT, _Alloc>& __right);
2205 __result = _S_concat(__left, __right);
2813 // __right in registers.
2816 __right._M_tree_ptr));
2824 __left.append(__right);
2831 const _CharT* __right)
2836 __right, __rlen));
2842 const _CharT* __right)
2844 __left.append(__right);
2854 &__right, 1));
[all …]
/dragonfly/lib/libssh/openbsd-compat/
H A Dsys-tree.h212 struct type __node, *__left, *__right, *__tmp; \
216 __left = __right = &__node; \
228 SPLAY_LINKLEFT(head, __right, field); \
241 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
249 struct type __node, *__left, *__right, *__tmp; \
252 __left = __right = &__node; \
264 SPLAY_LINKLEFT(head, __right, field); \
277 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/dragonfly/sys/sys/
H A Dtree.h213 struct type __node, *__left, *__right, *__tmp; \
217 __left = __right = &__node; \
229 SPLAY_LINKLEFT(head, __right, field); \
242 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
250 struct type __node, *__left, *__right, *__tmp; \
253 __left = __right = &__node; \
265 SPLAY_LINKLEFT(head, __right, field); \
278 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
/dragonfly/contrib/gcc-4.7/libstdc++-v3/include/bits/
H A Dstl_algo.h2641 _ForwardIterator __right = std::upper_bound(++__middle, __first, in _GLIBCXX_VISIBILITY() local
2643 return pair<_ForwardIterator, _ForwardIterator>(__left, __right); in _GLIBCXX_VISIBILITY()
2707 _ForwardIterator __right = std::upper_bound(++__middle, __first, in _GLIBCXX_VISIBILITY() local
2709 return pair<_ForwardIterator, _ForwardIterator>(__left, __right); in _GLIBCXX_VISIBILITY()
/dragonfly/contrib/gcc-8.0/libstdc++-v3/include/bits/
H A Dstl_algo.h2151 _ForwardIterator __right in _GLIBCXX_VISIBILITY() local
2153 return pair<_ForwardIterator, _ForwardIterator>(__left, __right); in _GLIBCXX_VISIBILITY()