| /haiku-buildtools/gcc/libstdc++-v3/include/parallel/ |
| H A D | losertree.h | 190 unsigned int __left = __init_winner(2 * __root); local
193 || (!_M_losers[__left]._M_sup
195 _M_losers[__left]._M_key)))
199 return __left;
204 _M_losers[__root] = _M_losers[__left];
290 unsigned int __left = __init_winner(2 * __root); local
293 || (!_M_losers[__left]._M_sup
295 _M_losers[__left]._M_key)))
299 return __left;
304 _M_losers[__root] = _M_losers[__left];
429 unsigned int __left = __init_winner(2 * __root); local
511 unsigned int __left = __init_winner(2 * __root); local
667 unsigned int __left = __init_winner(2 * __root); local
755 unsigned int __left = __init_winner(2 * __root); local
912 unsigned int __left = __init_winner(2 * __root); local
998 unsigned int __left = __init_winner(2 * __root); local
[all...] |
| H A D | partition.h | 70 _GLIBCXX_VOLATILE _DifferenceType __left = 0, __right = __n - 1, local
117 __thread_left = __left + 1;
141 __fetch_and_add(&__left, __chunk_size);
199 __leftold = __left,
200 __leftnew = __left - __leftover_left * __chunk_size,
209 __reserved_left[(__left - (__thread_left_border + 1))
280 __left = __leftnew;
282 __dist = __right - __left + 1;
285 # pragma omp flush(__left, __right)
288 _DifferenceType __final_left = __left, __final_righ
[all...] |
| /haiku-buildtools/legacy/gcc/libstdc++/stl/ |
| H A D | ropeimpl.h | 118 _RopeRep* __left = __c->_M_left; local
119 size_t __left_len = __left->_M_size;
127 __curr_rope = __left;
444 rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right) argument
447 _S_new_RopeConcatenation(__left, __right, __left->get_allocator());
451 __stl_assert(__left->get_allocator() == __right->get_allocator());
503 _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left; local
506 __left->_M_ref_nonnil();
508 __result = _S_tree_concat(__left, __nrigh
591 _S_concat(_RopeRep* __left, _RopeRep* __right) argument
658 _RopeRep* __left = __c->_M_left; local
844 _RopeRep* __left = __conc->_M_left; local
909 bool __left = bool(__o.flags() & ios::left); local
969 _RopeRep* __left = __c->_M_left; local
1007 _RopeRep* __left = __c->_M_left; local
1195 _RopeRep* __left = __c->_M_left; local
1240 _RopeRep* __left = __c->_M_left; local
1279 _S_compare(const _RopeRep* __left, const _RopeRep* __right) argument
[all...] |
| H A D | stl_rope.h | 1400 static _RopeRep* _S_concat(_RopeRep* __left, _RopeRep* __right);
1439 _RopeRep* __left, _RopeRep* __right,
1447 return new(__space) _RopeConcatenation(__left, __right, __a);
1511 _S_tree_concat(_RopeRep* __left, _RopeRep* __right);
1576 static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left, argument
1579 _RopeRep* __result = _S_concat(__left, __right);
1717 _RopeRep* __left = local
1720 _M_tree_ptr = _S_concat(__left, _M_tree_ptr);
1722 _S_unref(__left);
1724 __STL_UNWIND(_S_unref(__left))
1438 _S_new_RopeConcatenation( _RopeRep* __left, _RopeRep* __right, allocator_type __a) argument
2396 operator +(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2411 operator +=(rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2421 operator +(const rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2432 operator +=(rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2441 operator +(const rope<_CharT,_Alloc>& __left, _CharT __right) argument
2450 operator +=(rope<_CharT,_Alloc>& __left, _CharT __right) argument
2457 operator <(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2464 operator ==(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
[all...] |
| H A D | stl_algo.h | 1854 _ForwardIter __middle, __left, __right; local
1868 __left = lower_bound(__first, __middle, __val);
1871 return pair<_ForwardIter, _ForwardIter>(__left, __right);
1892 _ForwardIter __middle, __left, __right; local
1906 __left = lower_bound(__first, __middle, __val, __comp);
1909 return pair<_ForwardIter, _ForwardIter>(__left, __right);
|
| /haiku-buildtools/gcc/libstdc++-v3/include/ext/ |
| H A D | ropeimpl.h | 155 _RopeRep* __left = __c->_M_left; local
156 size_t __left_len = __left->_M_size;
166 __curr_rope = __left;
493 _S_tree_concat(_RopeRep* __left, _RopeRep* __right) argument
495 _RopeConcatenation* __result = _S_new_RopeConcatenation(__left, __right,
496 __left->
553 _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left; local
556 __left->_M_ref_nonnil();
558 { __result = _S_tree_concat(__left, __nright); }
561 _S_unref(__left);
652 _S_concat(_RopeRep* __left, _RopeRep* __right) argument
742 _RopeRep* __left = __c->_M_left; local
932 _RopeRep* __left = __conc->_M_left; local
1013 bool __left = bool(__o.flags() & std::ios::left); local
1083 _RopeRep* __left = __c->_M_left; local
1123 _RopeRep* __left = __c->_M_left; local
1332 _RopeRep* __left = __c->_M_left; local
1382 _RopeRep* __left = __c->_M_left; local
1425 _S_compare(const _RopeRep* __left, const _RopeRep* __right) argument
[all...] |
| /haiku-buildtools/gcc/libstdc++-v3/include/bits/ |
| H A D | ostream_insert.h | 90 const bool __left = ((__out.flags() local
93 if (!__left)
97 if (__left && __out.good())
|
| H A D | stl_algo.h | 2151 _ForwardIterator __left local
2156 return pair<_ForwardIterator, _ForwardIterator>(__left, __right);
|