Lines Matching refs:__p
230 __link_pointer __unsafe_link_pointer_cast(__link_pointer __p) {
231 return __p;
235 __link_pointer __unsafe_link_pointer_cast(__non_link_pointer __p) {
236 return static_cast<__link_pointer>(static_cast<_VoidPtr>(__p));
296 explicit __list_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
297 : __ptr_(__p)
303 explicit __list_iterator(__link_pointer __p) _NOEXCEPT : __ptr_(__p) {}
329 __list_iterator(const __list_iterator& __p)
330 : __ptr_(__p.__ptr_)
332 __get_db()->__iterator_copy(this, &__p);
342 __list_iterator& operator=(const __list_iterator& __p)
344 if (this != &__p)
346 __get_db()->__iterator_copy(this, &__p);
347 __ptr_ = __p.__ptr_;
419 explicit __list_const_iterator(__link_pointer __p, const void* __c) _NOEXCEPT
420 : __ptr_(__p)
426 explicit __list_const_iterator(__link_pointer __p) _NOEXCEPT : __ptr_(__p) {}
446 __list_const_iterator(const __list_iterator<_Tp, _VoidPtr>& __p) _NOEXCEPT
447 : __ptr_(__p.__ptr_)
450 __get_db()->__iterator_copy(this, &__p);
457 __list_const_iterator(const __list_const_iterator& __p)
458 : __ptr_(__p.__ptr_)
460 __get_db()->__iterator_copy(this, &__p);
470 __list_const_iterator& operator=(const __list_const_iterator& __p)
472 if (this != &__p)
474 __get_db()->__iterator_copy(this, &__p);
475 __ptr_ = __p.__ptr_;
803 for (__i_node** __p = __cn1->end_; __p != __cn1->beg_;)
805 --__p;
806 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
809 __cn2->__add(*__p);
810 if (--__cn1->end_ != __p)
811 memmove(__p, __p+1, (__cn1->end_ - __p)*sizeof(__i_node*));
814 (*__p)->__c_ = __cn1;
816 for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
818 --__p;
819 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
822 __cn1->__add(*__p);
823 if (--__cn2->end_ != __p)
824 memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));
827 (*__p)->__c_ = __cn2;
1012 iterator emplace(const_iterator __p, _Args&&... __args);
1014 iterator insert(const_iterator __p, value_type&& __x);
1017 iterator insert(const_iterator __p, initializer_list<value_type> __il)
1018 {return insert(__p, __il.begin(), __il.end());}
1033 iterator insert(const_iterator __p, const value_type& __x);
1034 iterator insert(const_iterator __p, size_type __n, const value_type& __x);
1036 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
1054 iterator erase(const_iterator __p);
1060 void splice(const_iterator __p, list& __c);
1063 void splice(const_iterator __p, list&& __c) {splice(__p, __c);}
1065 void splice(const_iterator __p, list&& __c, const_iterator __i)
1066 {splice(__p, __c, __i);}
1068 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1069 {splice(__p, __c, __f, __l);}
1071 void splice(const_iterator __p, list& __c, const_iterator __i);
1072 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1108 __node_pointer __p = __node_alloc_traits::allocate(__na, 1);
1109 __p->__prev_ = nullptr;
1110 return __hold_pointer(__p, __node_destructor(__na, 1));
1124 static void __link_nodes (__link_pointer __p, __link_pointer __f, __link_pointer __l);
1154 // Link in nodes [__f, __l] just prior to __p
1158 list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
1160 __p->__prev_->__next_ = __f;
1161 __f->__prev_ = __p->__prev_;
1162 __p->__prev_ = __l;
1163 __l->__next_ = __p;
1443 list<_Tp, _Alloc>::insert(const_iterator __p, const value_type& __x)
1446 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1453 __link_nodes(__p.__ptr_, __hold->__as_link(), __hold->__as_link());
1464 list<_Tp, _Alloc>::insert(const_iterator __p, size_type __n, const value_type& __x)
1467 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1470 iterator __r(__p.__ptr_, this);
1472 iterator __r(__p.__ptr_);
1520 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1529 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1533 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1536 iterator __r(__p.__ptr_, this);
1538 iterator __r(__p.__ptr_);
1586 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1689 list<_Tp, _Alloc>::emplace(const_iterator __p, _Args&&... __args)
1692 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1700 __link_nodes(__p.__ptr_, __nl, __nl);
1712 list<_Tp, _Alloc>::insert(const_iterator __p, value_type&& __x)
1715 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1723 __link_nodes(__p.__ptr_, __nl, __nl);
1746 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1748 --__p;
1749 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1752 (*__p)->__c_ = nullptr;
1753 if (--__c->end_ != __p)
1754 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1775 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1777 --__p;
1778 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1781 (*__p)->__c_ = nullptr;
1782 if (--__c->end_ != __p)
1783 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1795 list<_Tp, _Alloc>::erase(const_iterator __p)
1798 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
1802 _LIBCPP_ASSERT(__p != end(),
1805 __link_pointer __n = __p.__ptr_;
1857 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1859 --__p;
1860 iterator* __i = static_cast<iterator*>((*__p)->__i_);
1863 (*__p)->__c_ = nullptr;
1864 if (--__c->end_ != __p)
1865 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1999 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c)
2004 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2013 __link_nodes(__p.__ptr_, __f, __l);
2039 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __i)
2042 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2052 if (__p.__ptr_ != __i.__ptr_ && __p.__ptr_ != __i.__ptr_->__next_)
2056 __link_nodes(__p.__ptr_, __f, __f);
2082 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2085 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__p) == this,
2094 _LIBCPP_ASSERT(__i != __p,
2112 __link_nodes(__p.__ptr_, __first, __last);
2249 for (__i_node** __p = __cn2->end_; __p != __cn2->beg_;)
2251 --__p;
2252 iterator* __i = static_cast<iterator*>((*__p)->__i_);
2255 __cn1->__add(*__p);
2256 (*__p)->__c_ = __cn1;
2257 if (--__cn2->end_ != __p)
2258 memmove(__p, __p+1, (__cn2->end_ - __p)*sizeof(__i_node*));