Lines Matching refs:__p
217 __link_pointer __unsafe_link_pointer_cast(__link_pointer __p) {
218 return __p;
222 __link_pointer __unsafe_link_pointer_cast(__non_link_pointer __p) {
223 return static_cast<__link_pointer>(static_cast<_VoidPtr>(__p));
283 explicit __list_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
284 : __ptr_(__p)
290 explicit __list_iterator(__link_pointer __p) _NOEXCEPT : __ptr_(__p) {}
316 __list_iterator(const __list_iterator& __p)
317 : __ptr_(__p.__ptr_)
319 __get_db()->__iterator_copy(this, &__p);
329 __list_iterator& operator=(const __list_iterator& __p)
331 if (this != &__p)
333 __get_db()->__iterator_copy(this, &__p);
334 __ptr_ = __p.__ptr_;
406 explicit __list_const_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
407 : __ptr_(__p)
413 explicit __list_const_iterator(__link_pointer __p) _NOEXCEPT : __ptr_(__p) {}
433 __list_const_iterator(const __list_iterator<_Tp, _VoidPtr>& __p) _NOEXCEPT
434 : __ptr_(__p.__ptr_)
437 __get_db()->__iterator_copy(this, &__p);
444 __list_const_iterator(const __list_const_iterator& __p)
445 : __ptr_(__p.__ptr_)
447 __get_db()->__iterator_copy(this, &__p);
457 __list_const_iterator& operator=(const __list_const_iterator& __p)
459 if (this != &__p)
461 __get_db()->__iterator_copy(this, &__p);
462 __ptr_ = __p.__ptr_;
772 for (__i_node** __p = __cn1->end_; __p != __cn1->beg_;)
774 --__p;
775 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
778 __cn2->__add(*__p);
779 if (--__cn1->end_ != __p)
780 memmove(__p, __p+1, (__cn1->end_ - __p)*sizeof(__i_node*));
783 (*__p)->__c_ = __cn1;
785 for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
787 --__p;
788 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
791 __cn1->__add(*__p);
792 if (--__cn2->end_ != __p)
793 memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));
796 (*__p)->__c_ = __cn2;
984 iterator emplace(const_iterator __p, _Args&&... __args);
986 iterator insert(const_iterator __p, value_type&& __x);
992 iterator insert(const_iterator __p, const value_type& __x);
993 iterator insert(const_iterator __p, size_type __n, const value_type& __x);
995 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
999 iterator insert(const_iterator __p, initializer_list<value_type> __il)
1000 {return insert(__p, __il.begin(), __il.end());}
1018 iterator erase(const_iterator __p);
1024 void splice(const_iterator __p, list& __c);
1027 void splice(const_iterator __p, list&& __c) {splice(__p, __c);}
1029 void splice(const_iterator __p, list& __c, const_iterator __i);
1032 void splice(const_iterator __p, list&& __c, const_iterator __i)
1033 {splice(__p, __c, __i);}
1035 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1038 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1039 {splice(__p, __c, __f, __l);}
1082 static void __link_nodes (__link_pointer __p, __link_pointer __f, __link_pointer __l);
1096 // Link in nodes [__f, __l] just prior to __p
1100 list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
1102 __p->__prev_->__next_ = __f;
1103 __f->__prev_ = __p->__prev_;
1104 __p->__prev_ = __l;
1105 __l->__next_ = __p;
1397 list<_Tp, _Alloc>::insert(const_iterator __p, const value_type& __x)
1400 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1409 __link_nodes(__p.__ptr_, __hold->__as_link(), __hold->__as_link());
1420 list<_Tp, _Alloc>::insert(const_iterator __p, size_type __n, const value_type& __x)
1423 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1426 iterator __r(__p.__ptr_, this);
1428 iterator __r(__p.__ptr_);
1478 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1487 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1491 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1494 iterator __r(__p.__ptr_, this);
1496 iterator __r(__p.__ptr_);
1546 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1657 list<_Tp, _Alloc>::emplace(const_iterator __p, _Args&&... __args)
1660 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1670 __link_nodes(__p.__ptr_, __nl, __nl);
1684 list<_Tp, _Alloc>::insert(const_iterator __p, value_type&& __x)
1687 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1697 __link_nodes(__p.__ptr_, __nl, __nl);
1720 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1722 --__p;
1723 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1726 (*__p)->__c_ = nullptr;
1727 if (--__c->end_ != __p)
1728 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1749 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1751 --__p;
1752 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1755 (*__p)->__c_ = nullptr;
1756 if (--__c->end_ != __p)
1757 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1769 list<_Tp, _Alloc>::erase(const_iterator __p)
1772 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1776 _LIBCPP_ASSERT(__p != end(),
1779 __link_pointer __n = __p.__ptr_;
1831 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1833 --__p;
1834 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1837 (*__p)->__c_ = nullptr;
1838 if (--__c->end_ != __p)
1839 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1977 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c)
1982 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1991 __link_nodes(__p.__ptr_, __f, __l);
2017 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __i)
2020 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2030 if (__p.__ptr_ != __i.__ptr_ && __p.__ptr_ != __i.__ptr_->__next_)
2034 __link_nodes(__p.__ptr_, __f, __f);
2060 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2063 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2072 _LIBCPP_ASSERT(__i != __p,
2090 __link_nodes(__p.__ptr_, __first, __last);
2227 for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
2229 --__p;
2230 iterator* __i = static_cast<iterator*>((*__p)->__i_);
2233 __cn1->__add(*__p);
2234 (*__p)->__c_ = __cn1;
2235 if (--__cn2->end_ != __p)
2236 memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));