71 struct _Rb_tree_node_base  struct
74   typedef _Rb_tree_node_base* _Base_ptr;  argument
95 struct _Rb_tree_node : public _Rb_tree_node_base  argument
104   typedef _Rb_tree_node_base::_Base_ptr _Base_ptr;
217 _Rb_tree_rotate_left(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)  in _Rb_tree_rotate_left()
219   _Rb_tree_node_base* __y = __x->_M_right;  in _Rb_tree_rotate_left()
236 _Rb_tree_rotate_right(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)  in _Rb_tree_rotate_right()
238   _Rb_tree_node_base* __y = __x->_M_left;  in _Rb_tree_rotate_right()
255 _Rb_tree_rebalance(_Rb_tree_node_base* __x, _Rb_tree_node_base*& __root)  in _Rb_tree_rebalance()
260       _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right;  in _Rb_tree_rebalance()
278       _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left;  in _Rb_tree_rebalance()
299 inline _Rb_tree_node_base*
300 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* __z,  in _Rb_tree_rebalance_for_erase()
301                              _Rb_tree_node_base*& __root,  in _Rb_tree_rebalance_for_erase()
302                              _Rb_tree_node_base*& __leftmost,  in _Rb_tree_rebalance_for_erase()
303                              _Rb_tree_node_base*& __rightmost)  in _Rb_tree_rebalance_for_erase()
305   _Rb_tree_node_base* __y = __z;  in _Rb_tree_rebalance_for_erase()
306   _Rb_tree_node_base* __x = 0;  in _Rb_tree_rebalance_for_erase()
307   _Rb_tree_node_base* __x_parent = 0;  in _Rb_tree_rebalance_for_erase()
357         __leftmost = _Rb_tree_node_base::_S_minimum(__x);  in _Rb_tree_rebalance_for_erase()
363         __rightmost = _Rb_tree_node_base::_S_maximum(__x);  in _Rb_tree_rebalance_for_erase()
368         _Rb_tree_node_base* __w = __x_parent->_M_right;  in _Rb_tree_rebalance_for_erase()
397         _Rb_tree_node_base* __w = __x_parent->_M_left;  in _Rb_tree_rebalance_for_erase()
526   typedef _Rb_tree_node_base* _Base_ptr;
615     { return (_Link_type)  _Rb_tree_node_base::_S_minimum(__x); }  in _S_minimum()
618     { return (_Link_type) _Rb_tree_node_base::_S_maximum(__x); }  in _S_maximum()
1257 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root)  in __black_count()
1298   if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))  in __rb_verify()
1300   if (_M_rightmost() != _Rb_tree_node_base::_S_maximum(_M_root()))  in __rb_verify()