Home
last modified time | relevance | path

Searched refs:_M_right (Results 1 – 8 of 8) sorted by relevance

/openbsd/src/gnu/gcc/libstdc++-v3/src/
Dtree.cc65 if (__x->_M_right != 0) in _GLIBCXX_BEGIN_NAMESPACE()
67 __x = __x->_M_right; in _GLIBCXX_BEGIN_NAMESPACE()
74 while (__x == __y->_M_right) in _GLIBCXX_BEGIN_NAMESPACE()
79 if (__x->_M_right != __y) in _GLIBCXX_BEGIN_NAMESPACE()
96 __x = __x->_M_right; in _Rb_tree_decrement()
100 while (__y->_M_right != 0) in _Rb_tree_decrement()
101 __y = __y->_M_right; in _Rb_tree_decrement()
127 _Rb_tree_node_base* const __y = __x->_M_right; in _Rb_tree_rotate_left()
129 __x->_M_right = __y->_M_left; in _Rb_tree_rotate_left()
139 __x->_M_parent->_M_right = __y; in _Rb_tree_rotate_left()
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dstl_tree.h102 _Base_ptr _M_right; member
114 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
137 if (_M_node->_M_right != 0) in _M_increment()
139 _M_node = _M_node->_M_right; in _M_increment()
146 while (_M_node == __y->_M_right) in _M_increment()
151 if (_M_node->_M_right != __y) in _M_increment()
161 _M_node = _M_node->_M_right; in _M_decrement()
165 while (__y->_M_right != 0) in _M_decrement()
166 __y = __y->_M_right; in _M_decrement()
270 _Rb_tree_node_base* __y = __x->_M_right; in _Rb_tree_rotate_left()
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_tree.h101 _Base_ptr _M_right; member
120 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
127 while (__x->_M_right != 0) __x = __x->_M_right; in _S_maximum()
393 __tmp->_M_right = 0; in _M_clone_node()
421 this->_M_header._M_right = &this->_M_header; in _Node_allocator()
442 this->_M_header._M_right = &this->_M_header;
467 { return this->_M_impl._M_header._M_right; }
471 { return this->_M_impl._M_header._M_right; }
510 { return static_cast<_Link_type>(__x->_M_right); }
514 { return static_cast<_Const_Link_type>(__x->_M_right); }
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/
Dropeimpl.h161 __curr_rope = __c->_M_right; in _S_setcache()
226 __current_node = __c->_M_right; in _S_setcache_for_incr()
514 && _RopeRep::_S_leaf == ((_RopeConcatenation*)__r)->_M_right->_M_tag) { in _S_concat_char_iter()
516 (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right); in _S_concat_char_iter()
572 _RopeLeaf* __right = (_RopeLeaf*)(((_RopeConcatenation*)__r)->_M_right); in _S_destr_concat_char_iter()
582 ((_RopeConcatenation*)__r)->_M_right = __new_right; in _S_destr_concat_char_iter()
628 ((_RopeConcatenation*)__left)->_M_right->_M_tag) { in _S_concat()
630 (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right); in _S_concat()
687 _RopeRep* __right = __c->_M_right; in _S_substring()
856 _RopeRep* __right = __conc->_M_right; in _S_apply_to_pieces()
[all …]
Dstl_rope.h607 _Rope_RopeRep<_CharT,_Alloc>* _M_right; member
618 _M_left(__l), _M_right(__r) in _Rope_RopeConcatenation()
624 _M_right->_M_unref_nonnil(); in ~_Rope_RopeConcatenation()
/openbsd/src/gnu/gcc/libstdc++-v3/include/ext/
Dropeimpl.h166 __curr_rope = __c->_M_right; in _S_setcache()
234 __current_node = __c->_M_right; in _S_setcache_for_incr()
551 && __detail::_S_leaf == ((_RopeConcatenation*) __r)->_M_right->_M_tag) in _S_concat_char_iter()
554 (_RopeLeaf* )(((_RopeConcatenation* )__r)->_M_right); in _S_concat_char_iter()
617 __r)->_M_right); in _S_destr_concat_char_iter()
628 ((_RopeConcatenation*)__r)->_M_right = __new_right; in _S_destr_concat_char_iter()
679 __left)->_M_right->_M_tag) in _S_concat()
682 (_RopeLeaf*)(((_RopeConcatenation*)__left)->_M_right); in _S_concat()
747 _RopeRep* __right = __c->_M_right; in _S_substring()
946 _RopeRep* __right = __conc->_M_right; in _S_apply_to_pieces()
[all …]
Drope728 _Rope_RopeRep<_CharT, _Alloc>* _M_right;
741 _M_left(__l), _M_right(__r)
748 _M_right->_M_unref_nonnil();
/openbsd/src/gnu/lib/libstdc++/libstdc++/
DChangeLog1964 Don't check that __w->_M_left != 0 and __w->_M_right != 0