Home
last modified time | relevance | path

Searched refs:_M_root (Results 1 – 7 of 7) sorted by relevance

/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_tree.h648 _M_root() const { return (_Link_type&) _M_header->_M_parent; } in _M_root() function
736 if (__x._M_root() == 0) in _Rb_tree()
741 _M_root() = _M_copy(__x._M_root(), _M_header); in _Rb_tree()
742 _M_leftmost() = _S_minimum(_M_root()); in _Rb_tree()
743 _M_rightmost() = _S_maximum(_M_root()); in _Rb_tree()
758 _M_root() = 0; in _M_empty_initialize()
847 _M_erase(_M_root()); in clear()
849 _M_root() = 0; in clear()
955 if (__x._M_root() == 0)
957 _M_root() = 0;
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_tree.h450 _M_root()
454 _M_root() const
582 if (__x._M_root() != 0)
584 _M_root() = _M_copy(__x._M_begin(), _M_end());
585 _M_leftmost() = _S_minimum(_M_root());
586 _M_rightmost() = _S_maximum(_M_root());
713 _M_root() = 0;
817 if (__x._M_root() != 0)
819 _M_root() = _M_copy(__x._M_begin(), _M_end());
820 _M_leftmost() = _S_minimum(_M_root());
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dstl_rope.h784 _My_rope* _M_root; // The whole rope. variable
787 : _M_pos(__p), _M_current_valid(false), _M_root(__r) {} in _Rope_char_ref_proxy()
789 : _M_pos(__x._M_pos), _M_current_valid(false), _M_root(__x._M_root) {} in _Rope_char_ref_proxy()
795 : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) {} in _Rope_char_ref_proxy()
817 rope<_CharT,_Alloc>* _M_root; // The whole rope. variable
820 : _M_pos(__x._M_pos), _M_root(__x._M_root) {} in _Rope_char_ptr_proxy()
822 : _M_pos(__x._M_pos), _M_root(__x._M_root) {} in _Rope_char_ptr_proxy()
824 _Rope_char_ptr_proxy(_CharT* __x) : _M_root(0), _M_pos(0) { in _Rope_char_ptr_proxy()
829 _M_root = __x._M_root;
836 return _Rope_char_ref_proxy<_CharT,_Alloc>(_M_root, _M_pos);
[all …]
H A Dropeimpl.h127 if (__pos >= __x._M_root->_M_size) { in _S_setcache()
131 __curr_rope = __x._M_root; in _S_setcache()
281 if (_M_root_rope->_M_tree_ptr != _M_root) { in _M_check()
283 _RopeRep::_S_unref(_M_root); in _M_check()
284 _M_root = _M_root_rope->_M_tree_ptr; in _M_check()
285 _RopeRep::_S_ref(_M_root); in _M_check()
303 _RopeRep::_S_ref(_M_root); in _Rope_iterator()
1334 _RopeRep* __old = _M_root->_M_tree_ptr;
1356 _M_root->_M_tree_ptr = __result;
1366 return _My_rope::_S_fetch(_M_root->_M_tree_ptr, _M_pos); in _CharT()
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/
H A Drope941 _My_rope* _M_root; // The whole rope.
944 : _M_pos(__p), _M_current(), _M_current_valid(false), _M_root(__r) { }
948 _M_current_valid(false), _M_root(__x._M_root) { }
955 : _M_pos(__p), _M_current(__c), _M_current_valid(true), _M_root(__r) { }
985 rope<_CharT,_Alloc>* _M_root; // The whole rope.
988 : _M_pos(__x._M_pos), _M_root(__x._M_root) { }
991 : _M_pos(__x._M_pos), _M_root(__x._M_root) { }
996 : _M_root(0), _M_pos(0) { }
1002 _M_root = __x._M_root;
1012 { return _Rope_char_ref_proxy<_CharT, _Alloc>(_M_root, _M_pos); }
[all …]
H A Dropeimpl.h127 if (__pos >= __x._M_root->_M_size) in _S_setcache()
132 __curr_rope = __x._M_root; in _S_setcache()
301 if (_M_root_rope->_M_tree_ptr != this->_M_root) in _M_check()
304 _RopeRep::_S_unref(this->_M_root); in _M_check()
305 this->_M_root = _M_root_rope->_M_tree_ptr; in _M_check()
306 _RopeRep::_S_ref(this->_M_root); in _M_check()
324 { _RopeRep::_S_ref(this->_M_root); } in _Rope_iterator()
1487 _RopeRep* __old = _M_root->_M_tree_ptr;
1509 _M_root->_M_tree_ptr = __result;
1520 return _My_rope::_S_fetch(_M_root->_M_tree_ptr, _M_pos); in _CharT()
/openbsd-src/gnu/llvm/clang/www/
H A Dlibstdc++4.4-clang0x.patch402 if (_M_root() == 0)